File: parsedaddrgrouping.go

package info (click to toggle)
golang-github-seancfoley-ipaddress-go 1.5.4-3
  • links: PTS, VCS
  • area: main
  • in suites: experimental, forky, sid, trixie
  • size: 3,700 kB
  • sloc: makefile: 3
file content (427 lines) | stat: -rw-r--r-- 14,872 bytes parent folder | download
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
//
// Copyright 2020-2022 Sean C Foley
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//

package ipaddr

import "math/bits"

// getNetworkSegmentIndex returns the index of the segment containing the last byte within the network prefix
// When networkPrefixLength is zero (so there are no segments containing bytes within the network prefix), returns -1
func getNetworkSegmentIndex(networkPrefixLength BitCount, bytesPerSegment int, bitsPerSegment BitCount) int {
	if bytesPerSegment != 1 {
		if bytesPerSegment == 2 {
			return int((networkPrefixLength - 1) >> ipv6BitsToSegmentBitshift) //note this is intentionally a signed shift and not >>> so that networkPrefixLength of 0 returns -1
		}
		return int((networkPrefixLength - 1) / bitsPerSegment)
	}
	return int((networkPrefixLength - 1) >> ipv4BitsToSegmentBitshift)
}

// getHostSegmentIndex returns the index of the segment containing the first byte outside the network prefix.
// When networkPrefixLength is nil, or it matches or exceeds the bit length, returns the segment count.
func getHostSegmentIndex(networkPrefixLength BitCount, bytesPerSegment int, bitsPerSegment BitCount) int {
	if bytesPerSegment != 1 {
		if bytesPerSegment == 2 {
			return int(networkPrefixLength >> ipv6BitsToSegmentBitshift)
		}
		return int(networkPrefixLength / bitsPerSegment)
	}
	return int(networkPrefixLength >> ipv4BitsToSegmentBitshift)
}

/**
 * Across an address prefixes are:
 * IPv6: (nil):...:(nil):(1 to 16):(0):...:(0)
 * or IPv4: ...(nil).(1 to 8).(0)...
 */
func getSegmentPrefixLength(bitsPerSegment BitCount, prefixLength PrefixLen, segmentIndex int) PrefixLen {
	if prefixLength != nil {
		return getPrefixedSegmentPrefixLength(bitsPerSegment, prefixLength.bitCount(), segmentIndex)
	}
	return nil
}

func getAdjustedPrefixLength(bitsPerSegment BitCount, prefixLength BitCount, fromIndex, endIndex int) PrefixLen {
	var decrement, totalBits int
	if bitsPerSegment == 8 {
		decrement = fromIndex << ipv4BitsToSegmentBitshift
		totalBits = endIndex << ipv4BitsToSegmentBitshift
	} else if bitsPerSegment == 16 {
		decrement = fromIndex << ipv6BitsToSegmentBitshift
		totalBits = endIndex << ipv6BitsToSegmentBitshift
	} else {
		decrement = fromIndex * int(bitsPerSegment)
		totalBits = endIndex * int(bitsPerSegment)
	}
	return getDivisionPrefixLength(BitCount(totalBits), prefixLength-BitCount(decrement))
}

func getPrefixedSegmentPrefixLength(bitsPerSegment BitCount, prefixLength BitCount, segmentIndex int) PrefixLen {
	var decrement int
	if bitsPerSegment == 8 {
		decrement = segmentIndex << ipv4BitsToSegmentBitshift
	} else if bitsPerSegment == 16 {
		decrement = segmentIndex << ipv6BitsToSegmentBitshift
	} else {
		decrement = segmentIndex * int(bitsPerSegment)
	}
	return getDivisionPrefixLength(bitsPerSegment, prefixLength-BitCount(decrement))
}

/**
 * Across an address prefixes are:
 * IPv6: (nil):...:(nil):(1 to 16):(0):...:(0)
 * or IPv4: ...(nil).(1 to 8).(0)...
 */
func getDivisionPrefixLength(divisionBits, divisionPrefixedBits BitCount) PrefixLen {
	if divisionPrefixedBits <= 0 {
		return cacheBitCount(0) //none of the bits in this segment matter
	} else if divisionPrefixedBits <= divisionBits {
		return cacheBitCount(divisionPrefixedBits) //some of the bits in this segment matter
	}
	return nil //all the bits in this segment matter
}

// getNetworkPrefixLen translates a non-nil segment prefix length into an address prefix length.
// When calling this for the first segment with a non-nil prefix length, this gives the overall prefix length.
//
// Across an address prefixes are:
// IPv6: (nil):...:(nil):(1 to 16):(0):...:(0)
// or IPv4: ...(nil).(1 to 8).(0)...
func getNetworkPrefixLen(bitsPerSegment, segmentPrefixLength BitCount, segmentIndex int) PrefixLen {
	var increment BitCount
	if bitsPerSegment == 8 {
		increment = BitCount(segmentIndex) << ipv4BitsToSegmentBitshift
	} else if bitsPerSegment == 16 {
		increment = BitCount(segmentIndex) << ipv6BitsToSegmentBitshift
	} else {
		increment = BitCount(segmentIndex) * bitsPerSegment
	}
	return cacheBitCount(increment + segmentPrefixLength)
}

func getSegmentsBitCount(bitsPerSegment BitCount, segmentCount int) BitCount {
	if bitsPerSegment == 8 {
		return BitCount(segmentCount) << ipv4BitsToSegmentBitshift
	} else if bitsPerSegment == 16 {
		return BitCount(segmentCount) << ipv6BitsToSegmentBitshift
	}
	return BitCount(segmentCount) * bitsPerSegment
}

// TODO LATER getDivisionGrouping: This extended prefix subnet: follow the latest Java code which has been updated.
//
//public static boolean isPrefixSubnet(
//		DivisionValueProvider lowerValueProvider,
//		DivisionValueProvider lowerExtendedValueProvider,
//		DivisionValueProvider upperValueProvider,
//		DivisionValueProvider upperExtendedValueProvider,
//		DivisionLengthProvider bitLengthProvider,
//		int divisionCount,
//		Integer networkPrefixLength,
//		PrefixConfiguration prefixConfiguration,
//		boolean fullRangeOnly) {
//	if(networkPrefixLength == null || prefixConfiguration.prefixedSubnetsAreExplicit()) {
//		return false;
//	}
//	if(networkPrefixLength < 0) {
//		networkPrefixLength = 0;
//	}
//	int totalBitLength = 0;
//	topLoop:
//	for(int i = 0; i < divisionCount; i++) {
//		int divBitLength = bitLengthProvider.getLength(i);
//		Integer divisionPrefLength = ParsedAddressGrouping.getDivisionPrefixLength(divBitLength, networkPrefixLength - totalBitLength);
//		if(divBitLength == 0) {
//			continue;
//		}
//		if(divisionPrefLength == null) {
//			totalBitLength += divBitLength;
//			continue;
//		}
//		int divisionPrefixLength = divisionPrefLength;
//		int extendedPrefixLength, extendedDivBitLength;
//		boolean isExtended, hasExtendedPrefixLength;
//		boolean hasPrefLen = divisionPrefixLength != divBitLength;
//		if(hasPrefLen) {
//			// for values larger than 64 bits, the "extended" values are the upper (aka most significant, leftmost) bits
//			if(isExtended = (divBitLength > Long.SIZE)) {
//				extendedDivBitLength = divBitLength - Long.SIZE;
//				divBitLength = Long.SIZE;
//				if(hasExtendedPrefixLength = (divisionPrefixLength < extendedDivBitLength)) {
//					extendedPrefixLength = divisionPrefixLength;
//					divisionPrefixLength = 0;
//				} else {
//					isExtended = false;
//					extendedPrefixLength = extendedDivBitLength;
//					divisionPrefixLength -= extendedDivBitLength;
//				}
//			} else {
//				extendedPrefixLength = extendedDivBitLength = 0;
//				hasExtendedPrefixLength = false;
//			}
//		} else {
//			extendedPrefixLength = extendedDivBitLength = 0;
//			hasExtendedPrefixLength = isExtended = false;// we may be extended, but we set to false because we do nothing when no prefix
//		}
//		while(true) {
//			if(isExtended) {
//				long extendedLower = lowerExtendedValueProvider.getValue(i);
//				if(extendedPrefixLength == 0) {
//					if(extendedLower != 0) {
//						return false;
//					}
//					long extendedUpper = upperExtendedValueProvider.getValue(i);
//					if(fullRangeOnly) {
//						long maxVal = ~0L >>> (Long.SIZE - extendedDivBitLength);
//						if(extendedUpper != maxVal) {
//							return false;
//						}
//					} else {
//						int upperOnes = Long.numberOfTrailingZeros(~extendedUpper);
//						if(upperOnes > 0) {
//							if(upperOnes < Long.SIZE && (extendedUpper >>> upperOnes) != 0) {
//								return false;
//							}
//							fullRangeOnly = true;
//						} else if(extendedUpper != 0) {
//							return false;
//						}
//					}
//				} else if(hasExtendedPrefixLength) {
//					int divHostBits = extendedDivBitLength - extendedPrefixLength; // < 64, when 64 handled by block above
//					if(fullRangeOnly) {
//						long hostMask = ~(~0L << divHostBits);
//						if((hostMask & extendedLower) != 0) {
//							return false;
//						}
//						long extendedUpper = upperExtendedValueProvider.getValue(i);
//						if((hostMask & extendedUpper) != hostMask) {
//							return false;
//						}
//					} else {
//						int lowerZeros = Long.numberOfTrailingZeros(extendedLower);
//						if(lowerZeros < divHostBits) {
//							return false;
//						}
//						long extendedUpper = upperExtendedValueProvider.getValue(i);
//						int upperOnes = Long.numberOfTrailingZeros(~extendedUpper);
//						if(upperOnes < divHostBits) {
//							int upperZeros = Long.numberOfTrailingZeros(extendedUpper >>> upperOnes);
//							if(upperOnes + upperZeros < divHostBits) {
//								return false;
//							}
//							fullRangeOnly = upperOnes > 0;
//						} else {
//							fullRangeOnly = true;
//						}
//					}
//				}
//			}
//			if(divisionPrefixLength == 0) {
//				long lower = lowerValueProvider.getValue(i);
//				if(lower != 0) {
//					return false;
//				}
//				long upper = upperValueProvider.getValue(i);
//				if(fullRangeOnly) {
//					long maxVal = ~0L >>> (Long.SIZE - divBitLength);
//					if(upper != maxVal) {
//						return false;
//					}
//				} else {
//					int upperOnes = Long.numberOfTrailingZeros(~upper);
//					if(upperOnes > 0) {
//						if(upperOnes < Long.SIZE && (upper >>> upperOnes) != 0) {
//							return false;
//						}
//						fullRangeOnly = true;
//					} else if(upper != 0) {
//						return false;
//					}
//				}
//			} else if(hasPrefLen){
//				long lower = lowerValueProvider.getValue(i);
//				int divHostBits = divBitLength - divisionPrefixLength; // < 64, when 64 handled by block above
//				if(fullRangeOnly) {
//					long hostMask = ~(~0L << divHostBits);
//					if((hostMask & lower) != 0) {
//						return false;
//					}
//					long upper = upperValueProvider.getValue(i);
//					if((hostMask & upper) != hostMask) {
//						return false;
//					}
//				} else {
//					int lowerZeros = Long.numberOfTrailingZeros(lower);
//					if(lowerZeros < divHostBits) {
//						return false;
//					}
//					long upper = upperValueProvider.getValue(i);
//					int upperOnes = Long.numberOfTrailingZeros(~upper);
//					if(upperOnes < divHostBits) {
//						int upperZeros = Long.numberOfTrailingZeros(upper >>> upperOnes);
//						if(upperOnes + upperZeros < divHostBits) {
//							return false;
//						}
//						fullRangeOnly = upperOnes > 0;
//					} else {
//						fullRangeOnly = true;
//					}
//				}
//			}
//			if(++i == divisionCount) {
//				break topLoop;
//			}
//			divBitLength = bitLengthProvider.getLength(i);
//			if(hasExtendedPrefixLength = isExtended = (divBitLength > Long.SIZE)) {
//				extendedDivBitLength = divBitLength - Long.SIZE;
//				divBitLength = Long.SIZE;
//			} else {
//				extendedDivBitLength = 0;
//			}
//			extendedPrefixLength = divisionPrefixLength = 0;
//		} // end while
//	}
//	return true;
//}

type subnetOption int

const (
	zerosOnly = subnetOption(iota)
	fullRangeOnly
	zerosToFullRange
	zerosOrFullRange
)

//
// For explicit prefix config this always returns false.
// For all prefix subnets config this always returns true if the prefix length does not extend beyond the address end.
func isPrefixSubnet(
	lowerValueProvider,
	upperValueProvider SegmentValueProvider,
	segmentCount,
	bytesPerSegment int,
	bitsPerSegment BitCount,
	segmentMaxValue SegInt,
	prefLen BitCount,
	subnetOption subnetOption) bool {

	if prefLen < 0 {
		prefLen = 0
	} else {
		var totalBitCount BitCount
		if bitsPerSegment == 8 {
			totalBitCount = BitCount(segmentCount) << ipv4BitsToSegmentBitshift
		} else if bitsPerSegment == 16 {
			totalBitCount = BitCount(segmentCount) << ipv6BitsToSegmentBitshift
		} else {
			totalBitCount = BitCount(segmentCount) * bitsPerSegment
		}
		if prefLen >= totalBitCount {
			return false
		}
	}
	prefixedSegment := getHostSegmentIndex(prefLen, bytesPerSegment, bitsPerSegment)
	i := prefixedSegment
	if i < segmentCount {
		zero := PrefixBitCount(0)
		segmentPrefixLength := getPrefixedSegmentPrefixLength(bitsPerSegment, prefLen, i)
		for {
			//we want to see if there is a sequence of zeros followed by a sequence of full-range bits from the prefix onwards
			//once we start seeing full range bits, the remained of the section must be full range
			//for instance x marks the start of zeros and y marks the start of full range:
			//segment 1 segment 2 ...
			//upper: 10101010  10100111 11111111 11111111
			//lower: 00111010  00100000 00000000 00000000
			//                    x y
			//upper: 10101010  10100000 00000000 00111111
			//lower: 00111010  00100000 10000000 00000000
			//                           x         y
			//
			//the bit marked x in each set of 4 segment of 8 bits is a sequence of zeros, followed by full range bits starting at bit y
			lower := lowerValueProvider(i)
			prefLen := segmentPrefixLength.bitCount()
			if prefLen == 0 {
				if lower != 0 {
					return false
				}
				upper := upperValueProvider(i)
				if subnetOption == fullRangeOnly {
					if upper != segmentMaxValue {
						return false
					}
				} else if upper != 0 {
					if subnetOption == zerosOnly {
						return false
					} else if upper == segmentMaxValue {
						if subnetOption == zerosOrFullRange && i > prefixedSegment {
							return false
						}
					} else if subnetOption == zerosOrFullRange {
						return false
					} else { //zerosToFullRange
						upperTrailingOnes := bits.TrailingZeros64(^uint64(upper))
						if (upper >> uint(upperTrailingOnes)) != 0 {
							return false
						}
					}
					subnetOption = fullRangeOnly
				}
			} else if prefLen < bitsPerSegment {
				segHostBits := bitsPerSegment - prefLen
				hostMask := ^(^SegInt(0) << uint(segHostBits))
				if (hostMask & lower) != 0 {
					return false
				}
				upper := upperValueProvider(i)
				if subnetOption == fullRangeOnly {
					if (hostMask & upper) != hostMask {
						return false
					}
				} else {
					hostUpper := hostMask & upper
					if hostUpper != 0 {
						if subnetOption == zerosOnly {
							return false
						} else if hostUpper == hostMask {
							if subnetOption == zerosOrFullRange && i > prefixedSegment {
								return false
							}
						} else if subnetOption == zerosOrFullRange {
							return false
						} else { // zerosToFullRange
							upperTrailingOnes := uint(bits.TrailingZeros64(^uint64(upper)))
							hostMask >>= upperTrailingOnes
							upper >>= upperTrailingOnes
							if (hostMask & upper) != 0 {
								return false
							}
						}
						subnetOption = fullRangeOnly
					}
				}
			}
			segmentPrefixLength = &zero
			i++
			if i >= segmentCount {
				break
			}
		}
	}
	return true
}