-
Notifications
You must be signed in to change notification settings - Fork 0
/
ranges.go
472 lines (400 loc) · 9.53 KB
/
ranges.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
package iprange
import (
"fmt"
"math/big"
"net"
"sort"
"github.com/brunoga/deep"
)
// family defines the version of IP.
type family int
// Standard IP version 4 or 6. Unknown represents an invalid IP version,
// which is commonly used in the zero value of an IPRanges struct or to
// distinguish an invalid xIP.
const (
Unknown family = iota
IPv4
IPv6
)
// String implements fmt.Stringer.
func (f family) String() string {
if f == IPv4 {
return "IPv4"
}
if f == IPv6 {
return "IPv6"
}
return "Unknown"
}
// IPRanges is a set of ipRange that uses the starting and ending IP
// addresses to represent any IP range of any size. The following IP
// range formats are valid:
//
// 172.18.0.1 fd00::1
// 172.18.0.0/24 fd00::/64
// 172.18.0.1-10 fd00::1-a
// 172.18.0.1-172.18.1.10 fd00::1-fd00::1:a
//
// Dual-stack IP ranges are not allowed, The IP version of an IPRanges
// can only be IPv4, IPv6, or unknown (zero value).
type IPRanges struct {
version family
ranges []ipRange
}
// Parse parses a set of IP range format strings as IPRanges, the slice
// of ipRange with the same IP version, which records the starting and
// ending IP addresses.
//
// The error errInvalidIPRangeFormat wiil be returned when one of IP range
// string is invalid. And dual-stack IP ranges are not allowed, the error
// errDualStackIPRanges occurs when parsing a set of IP range strings, where
// there are both IPv4 and IPv6 addresses.
func Parse(rs ...string) (*IPRanges, error) {
if len(rs) == 0 {
return &IPRanges{}, nil
}
version := Unknown
ranges := make([]ipRange, 0, len(rs))
for i, r := range rs {
v, err := parse(r)
if err != nil {
return nil, err
}
if i == 0 {
version = IPv4
if v.start.To4() == nil {
version = IPv6
}
}
if v.start.version() != version {
return nil, errDualStackIPRanges
}
ranges = append(ranges, *v)
}
return &IPRanges{
version: version,
ranges: ranges,
}, nil
}
// Version returns the IP version of IPRanges:
//
// 1: IPv4
// 2: IPv6
// 0: zero value of IPRanges
//
// Do not compare family with a regular int value, which is confusing.
// Use predefined const such as IPv4, IPv6, or Unknown.
func (rr *IPRanges) Version() family {
return rr.version
}
// Contains reports whether IPRanges rr contain net.IP ip. If rr is IPv4
// and ip is IPv6, then it is also considered not contained, and vice versa.
func (rr *IPRanges) Contains(ip net.IP) bool {
w := xIP{ip}
if w.version() != rr.version {
return false
}
for _, r := range rr.ranges {
if r.contains(ip) {
return true
}
}
return false
}
// MergeEqual reports whether IPRanges rr is equal to rr2, but both rr and
// rr2 are pre-merged, which means they are both ordered and deduplicated.
func (rr *IPRanges) MergeEqual(rr2 *IPRanges) bool {
if rr.version != rr2.version {
return false
}
rr = rr.DeepCopy().Merge()
rr2 = rr2.DeepCopy().Merge()
return rr.Equal(rr2)
}
// Equal reports whether IPRanges rr is equal to rr2.
func (rr *IPRanges) Equal(rr2 *IPRanges) bool {
if rr.version != rr2.version {
return false
}
n := len(rr.ranges)
if len(rr2.ranges) != n {
return false
}
for i := 0; i < n; i++ {
if !rr.ranges[i].equal(&rr2.ranges[i]) {
return false
}
}
return true
}
// Size calculates the total number of IP addresses that pertain to
// IPRanges rr.
func (rr *IPRanges) Size() *big.Int {
n := big.NewInt(0)
for _, r := range rr.ranges {
n.Add(n, r.size())
}
return n
}
// Merge merges the duplicate parts of multiple ipRanges in rr and sort
// them by their respective starting xIP.
func (rr *IPRanges) Merge() *IPRanges {
if len(rr.ranges) <= 1 {
return rr
}
sort.Slice(rr.ranges, func(i, j int) bool {
return rr.ranges[i].start.cmp(rr.ranges[j].start) < 0
})
cur := -1
merged := make([]ipRange, 0, len(rr.ranges))
for _, r := range rr.ranges {
if cur == -1 {
merged = append(merged, r)
cur++
continue
}
if merged[cur].end.next().cmp(r.start) == 0 {
merged[cur].end = r.end
continue
}
if merged[cur].end.cmp(r.start) < 0 {
merged = append(merged, r)
cur++
continue
}
if merged[cur].end.cmp(r.end) < 0 {
merged[cur].end = r.end
}
}
rr.ranges = merged
return rr
}
// IsOverlap reports whether IPRanges rr have overlapping parts.
func (rr *IPRanges) IsOverlap() bool {
n := len(rr.ranges)
if n <= 1 {
return false
}
rs := rr.DeepCopy().ranges
sort.Slice(rs, func(i, j int) bool {
return rs[i].start.cmp(rs[j].start) < 0
})
for i := 0; i < n-1; i++ {
if rs[i].end.cmp(rs[i+1].start) >= 0 {
return true
}
}
return false
}
// Union calculates the union of IPRanges rr and rs with the same IP
// version. The result is always merged (ordered and deduplicated).
//
// Input: [172.18.0.20-30, 172.18.0.1-25] U [172.18.0.5-25]
// Output: [172.18.0.1-30]
func (rr *IPRanges) Union(rs *IPRanges) *IPRanges {
if rr.version != rs.version {
return rr.Merge()
}
rr.ranges = append(rr.ranges, rs.ranges...)
return rr.Merge()
}
// Diff calculates the difference of IPRanges rr and rs with the same IP
// version. The result is always merged (ordered and deduplicated).
//
// Input: [172.18.0.20-30, 172.18.0.1-25] - [172.18.0.5-25]
// Output: [172.18.0.1-4, 172.18.0.26-30]
func (rr *IPRanges) Diff(rs *IPRanges) *IPRanges {
if rr.version != rs.version {
return rr.Merge()
}
if len(rr.ranges) == 0 || len(rs.ranges) == 0 {
return rr.Merge()
}
rs = rs.DeepCopy()
omr := rr.Merge().ranges
tmr := rs.Merge().ranges
n1, n2 := len(omr), len(tmr)
ranges := make([]ipRange, 0, n1+n2)
i, j := 0, 0
for i < n1 && j < n2 {
// The following are all distributions of the difference sets between two
// IP range A and B (IP range A - IP range B).
//
// For convenience, use symbols to distinguish between two IP ranges:
// A: *------*
// B: `------`
// *------*
// `------`
if omr[i].end.cmp(tmr[j].start) < 0 {
ranges = append(ranges, omr[i])
i++
continue
}
// *------*
// `------`
if omr[i].start.cmp(tmr[j].end) > 0 {
j++
continue
}
if omr[i].end.cmp(tmr[j].end) <= 0 {
// *------*
// `------`
if omr[i].start.cmp(tmr[j].start) < 0 {
ranges = append(ranges, ipRange{
start: omr[i].start,
end: tmr[j].start.prev(),
})
}
// *--*
// `----------`
i++
continue
}
// *----------*
// `--`
if omr[i].start.cmp(tmr[j].start) < 0 {
ranges = append(ranges, ipRange{
start: omr[i].start,
end: tmr[j].start.prev(),
})
}
// *------*
// `------`
omr[i].start = (tmr[j].end.next())
j++
}
if j == n2 && tmr[j-1].end.cmp(omr[i].end) < 0 {
ranges = append(ranges, omr[i])
}
if i+1 < n1 {
ranges = append(ranges, omr[i+1:]...)
}
rr.ranges = ranges
return rr
}
// Intersect calculates the intersection of IPRanges rr and rs with the
// same IP version. The result is always merged (ordered and deduplicated).
//
// Input: [172.18.0.20-30, 172.18.0.1-25] ∩ [172.18.0.5-25]
// Output: [172.18.0.5-25]
func (rr *IPRanges) Intersect(rs *IPRanges) *IPRanges {
if rr.version != rs.version {
return &IPRanges{
version: rr.version,
}
}
if len(rr.ranges) == 0 || len(rs.ranges) == 0 {
return &IPRanges{
version: rr.version,
}
}
rs = rs.DeepCopy()
omr := rr.Merge().ranges
tmr := rs.Merge().ranges
n1, n2 := len(omr), len(tmr)
ranges := make([]ipRange, 0, maxN(n1, n2))
for i, j := 0, 0; i < n1 && j < n2; {
start := maxXIP(omr[i].start, tmr[j].start)
end := minXIP(omr[i].end, tmr[j].end)
if start.cmp(end) <= 0 {
ranges = append(ranges, ipRange{
start: start,
end: end,
})
}
if omr[i].end.cmp(tmr[j].end) < 0 {
i++
} else {
j++
}
}
rr.ranges = ranges
return rr
}
// Slice returns a slice of IPRanges, supporting negative indexes.
func (rr *IPRanges) Slice(start, end *big.Int) *IPRanges {
size := rr.Size()
version := rr.version
rs := &IPRanges{version: version}
if size.Sign() == 0 {
return rs
}
if start.Sign() < 0 {
start = new(big.Int).Add(start, size)
if start.Sign() < 0 {
start = big.NewInt(0)
}
} else {
start = new(big.Int).Set(start)
}
if end.Sign() < 0 {
end = new(big.Int).Add(end, size)
if end.Sign() < 0 {
return rs
}
} else {
end = new(big.Int).Set(end)
}
if start.Cmp(end) > 0 {
return rs
}
var ranges []ipRange
for i := 0; i < len(rr.ranges); i++ {
size := rr.ranges[i].size()
if start.Cmp(size) >= 0 {
start.Sub(start, size)
end.Sub(end, size)
continue
}
if start.Sign() >= 0 {
if end.Cmp(size) < 0 {
ranges = append(ranges, ipRange{
start: rr.ranges[i].start.nextN(start),
end: rr.ranges[i].start.nextN(end),
})
break
}
ranges = append(ranges, ipRange{
start: rr.ranges[i].start.nextN(start),
end: rr.ranges[i].end,
})
start.Sub(start, size)
end.Sub(end, size)
continue
}
if end.Cmp(size) >= 0 {
ranges = append(ranges, ipRange{
start: rr.ranges[i].start,
end: rr.ranges[i].end,
})
end.Sub(end, size)
continue
}
ranges = append(ranges, ipRange{
start: rr.ranges[i].start,
end: rr.ranges[i].start.nextN(end),
})
break
}
rs.ranges = ranges
return rs
}
func (rr *IPRanges) DeepCopy() *IPRanges {
return deep.MustCopy(rr)
}
// String implements fmt.Stringer.
func (rr *IPRanges) String() string {
ss := rr.Strings()
if len(ss) == 1 {
return ss[0]
}
return fmt.Sprint(ss)
}
// Strings returns a slice of the string representations of the IPRanges rr.
func (rr *IPRanges) Strings() []string {
ss := make([]string, 0, len(rr.ranges))
for _, r := range rr.ranges {
ss = append(ss, r.String())
}
return ss
}