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 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198
|
//
// 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/big"
"strconv"
"strings"
"unsafe"
"github.com/seancfoley/ipaddress-go/ipaddr/addrerr"
)
const (
digits = "0123456789abcdefghijklmnopqrstuvwxyz"
extendedDigits = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz!#$%&()*+-;<=>?@^_`{|}~"
uppercaseDigits = extendedDigits
doubleDigitsDecimal = "00010203040506070809" +
"10111213141516171819" +
"20212223242526272829" +
"30313233343536373839" +
"40414243444546474849" +
"50515253545556575859" +
"60616263646566676869" +
"70717273747576777879" +
"80818283848586878889" +
"90919293949596979899"
)
func isExtendedDigits(radix int) bool {
return radix > len(digits)
}
func getDigits(uppercase bool, radix int) string {
if uppercase || isExtendedDigits(radix) {
return uppercaseDigits
}
return digits
}
func toUnsignedString(value uint64, radix int, appendable *strings.Builder) *strings.Builder {
return toUnsignedStringCased(value, radix, 0, false, appendable)
}
func toUnsignedStringCased(value uint64, radix, choppedDigits int, uppercase bool, appendable *strings.Builder) *strings.Builder {
if value > 0xffff || choppedDigits != 0 || !toUnsignedStringFast(uint16(value), radix, uppercase, appendable) {
toUnsignedStringSlow(value, radix, choppedDigits, uppercase, appendable)
}
return appendable
}
func toUnsignedStringFast(value uint16, radix int, uppercase bool, appendable *strings.Builder) bool {
if value <= 1 { //for values larger than 1, result can be different with different radix (radix is 2 and up)
if value == 0 {
appendable.WriteByte('0')
} else {
appendable.WriteByte('1')
}
return true
}
//var quotient, remainder uint //we iterate on value == quotient * radix + remainder
if radix == 10 {
// we know value <= 0xffff (ie 16 bits or less)
if value < 10 {
appendable.WriteByte(digits[value])
return true
} else if value < 100 {
dig := doubleDigitsDecimal
digIndex := value << 1
appendable.WriteByte(dig[digIndex])
appendable.WriteByte(dig[digIndex+1])
return true
} else if value < 200 {
dig := doubleDigitsDecimal
digIndex := (value - 100) << 1
appendable.WriteByte('1')
appendable.WriteByte(dig[digIndex])
appendable.WriteByte(dig[digIndex+1])
return true
} else if value < 300 {
dig := doubleDigitsDecimal
digIndex := (value - 200) << 1
appendable.WriteByte('2')
appendable.WriteByte(dig[digIndex])
appendable.WriteByte(dig[digIndex+1])
return true
}
dig := digits
uval := uint(value)
var res [5]byte
i := 4
for { //value == quotient * 10 + remainder
quotient := (uval * 0xcccd) >> 19 // floor of n/10 is floor of ((0xcccd * n / 2^16) / 2^3)
remainder := uval - ((quotient << 3) + (quotient << 1)) //multiplication by 2 added to multiplication by 2^3 is multiplication by 2 + 8 = 10
res[i] = dig[remainder]
uval = quotient
if uval == 0 {
break
}
i--
}
appendable.Write(res[i:])
return true
} else if radix == 16 {
if value < 0x10 {
dig := getDigits(uppercase, radix)
appendable.WriteByte(dig[value])
return true
} else if value == 0xffff {
if uppercase {
appendable.WriteString("FFFF")
} else {
appendable.WriteString("ffff")
}
return true
}
dig := getDigits(uppercase, radix)
shift := uint(12)
for {
index := (value >> shift) & 15
if index != 0 { // index 0 is digit "0", no need to write leading zeros
appendable.WriteByte(dig[index])
shift -= 4
for shift > 0 {
appendable.WriteByte(dig[(value>>shift)&15])
shift -= 4
}
break
}
shift -= 4
if shift == 0 {
break
}
}
appendable.WriteByte(dig[value&15])
return true
} else if radix == 8 {
dig := digits
if value < 010 {
appendable.WriteByte(dig[value])
return true
}
shift := uint(15)
for {
index := (value >> shift) & 7
if index != 0 { // index 0 is digit "0"
appendable.WriteByte(dig[index])
shift -= 3
for shift > 0 {
appendable.WriteByte(dig[(value>>shift)&7])
shift -= 3
}
break
}
shift -= 3
if shift == 0 {
break
}
}
appendable.WriteByte(dig[value&7])
return true
} else if radix == 2 {
//note that we already know value != 0 and that value <= 0xffff
var digitIndex int
if (value >> 8) == 0 {
if value == 0xff {
appendable.WriteString("11111111")
return true
} else if (value >> 4) == 0 {
digitIndex = 4
} else {
digitIndex = 8
}
} else {
if value == 0xffff {
appendable.WriteString("1111111111111111")
return true
} else if (value >> 4) == 0 {
digitIndex = 12
} else {
digitIndex = 16
}
}
for digitIndex--; digitIndex > 0; digitIndex-- {
digit := (value >> uint(digitIndex)) & 1
if digit == 1 {
appendable.WriteByte('1')
for digitIndex--; digitIndex > 0; digitIndex-- {
digit = (value >> uint(digitIndex)) & 1
if digit == 0 {
appendable.WriteByte('0')
} else {
appendable.WriteByte('1')
}
}
break
}
}
if (value & 1) == 0 {
appendable.WriteByte('0')
} else {
appendable.WriteByte('1')
}
return true
}
return false
}
func toUnsignedStringSlow(
value uint64,
radix,
choppedDigits int,
uppercase bool,
appendable *strings.Builder) {
var str string
if radix <= 36 { // strconv.FormatUint doesn't work with larger radix
str = strconv.FormatUint(value, radix)
if choppedDigits > 0 {
str = str[:len(str)-choppedDigits]
}
if uppercase && radix > 10 {
strlen := len(str)
diff := uint8('a' - 'A')
for i := 0; i < strlen; i++ {
c := str[i]
if c > '9' {
c -= diff
}
appendable.WriteByte(c)
}
} else {
appendable.WriteString(str)
}
return
}
var bytes [13]byte
index := 13
dig := extendedDigits
rad64 := uint64(radix)
for value >= rad64 {
val := value
value /= rad64
if choppedDigits > 0 {
choppedDigits--
continue
}
index--
remainder := val - (value * rad64)
bytes[index] = dig[remainder]
}
if choppedDigits == 0 {
appendable.WriteByte(dig[value])
}
appendable.Write(bytes[index:])
}
func toUnsignedStringLength(value uint64, radix int) int {
if value <= 0xffff {
if result := toUnsignedStringLengthFast(uint16(value), radix); result >= 0 {
return result
}
}
return toUnsignedStringLengthSlow(value, radix)
}
const maxUint = ^uint(0)
func toUnsignedStringLengthSlow(value uint64, radix int) int {
count := 1
useInts := value <= uint64(maxUint)
value2 := uint(radix)
if useInts {
value2 = uint(value)
}
uradix := uint(radix)
for value2 >= uradix {
if useInts {
value2 /= uradix
} else {
value /= uint64(radix)
if value <= uint64(maxUint) {
useInts = true
value2 = uint(value)
}
}
count++
}
return count
}
func toUnsignedStringLengthFast(value uint16, radix int) int {
if value <= 1 { //for values larger than 1, result can be different with different radix (radix is 2 and up)
return 1
}
if radix == 10 {
//this needs value <= 0xffff (ie 16 bits or less) which is a prereq to calling this method
if value < 10 {
return 1
} else if value < 100 {
return 2
} else if value < 1000 {
return 3
} else if value < 10000 {
return 4
}
return 5
} else if radix == 16 {
//this needs value <= 0xffff (ie 16 bits or less)
if value < 0x10 {
return 1
} else if value < 0x100 {
return 2
} else if value < 0x1000 {
return 3
}
return 4
} else if radix == 8 {
//this needs value <= 0xffff (ie 16 bits or less)
if value < 010 {
return 1
} else if value < 0100 {
return 2
} else if value < 01000 {
return 3
} else if value < 010000 {
return 4
} else if value < 0100000 {
return 5
}
return 6
} else if radix == 2 {
//count the number of digits
//note that we already know value != 0 and that value <= 0xffff
//and we use both of those facts
digitCount := 15
val := value
if val>>8 == 0 {
digitCount -= 8
} else {
val >>= 8
}
if val>>4 == 0 {
digitCount -= 4
} else {
val >>= 4
}
if val>>2 == 0 {
digitCount -= 2
} else {
val >>= 2
}
//at this point, if (val & 2) != 0 we have undercounted the digit count by 1
if (val & 2) != 0 {
digitCount++
}
return digitCount
}
return -1
}
func toDefaultString(val uint64, radix int) string {
//0 and 1 are common segment values, and additionally they are the same regardless of radix (even binary)
//so we have a fast path for them
if val == 0 {
return "0"
} else if val == 1 {
return "1"
}
var length int
var quotient, remainder, value uint //we iterate on //value == quotient * radix + remainder
if radix == 10 {
if val < 10 {
return digits[val : val+1]
} else if val < 100 {
dig := doubleDigitsDecimal
value = uint(val)
digIndex := value << 1
var builder strings.Builder
builder.Grow(2)
builder.WriteByte(dig[digIndex])
builder.WriteByte(dig[digIndex+1])
return builder.String()
} else if val < 200 {
dig := doubleDigitsDecimal
value = uint(val)
digIndex := (value - 100) << 1
var builder strings.Builder
builder.WriteByte('1')
builder.WriteByte(dig[digIndex])
builder.WriteByte(dig[digIndex+1])
return builder.String()
} else if val < 300 {
dig := doubleDigitsDecimal
value = uint(val)
digIndex := (value - 200) << 1
var builder strings.Builder
builder.WriteByte('2')
builder.WriteByte(dig[digIndex])
builder.WriteByte(dig[digIndex+1])
return builder.String()
} else if val < 1000 {
length = 3
value = uint(val)
} else {
return strconv.FormatUint(val, 10)
}
chars := make([]byte, length)
dig := digits
for value != 0 {
length--
//value == quotient * 10 + remainder
quotient = (value * 0xcccd) >> 19 //floor of n/10 is floor of ((0xcccd * n / (2 ^ 16)) / (2 ^ 3))
remainder = value - ((quotient << 3) + (quotient << 1)) //multiplication by 2 added to multiplication by 2 ^ 3 is multiplication by 2 + 8 = 10
chars[length] = dig[remainder]
value = quotient
}
return string(chars)
} else if radix == 16 {
if val < 0x10 {
return digits[val : val+1]
}
var builder strings.Builder
if val < 0x100 {
length = 2
value = uint(val)
} else if val < 0x1000 {
length = 3
value = uint(val)
} else if val < 0x10000 {
if val == 0xffff {
return "ffff"
}
value = uint(val)
length = 4
} else {
return strconv.FormatUint(val, 16)
}
dig := digits
builder.Grow(length)
shift := uint(12)
for {
index := (value >> shift) & 15
if index != 0 { // index 0 is digit "0", so no need to write a leading zero
builder.WriteByte(dig[index])
shift -= 4
for shift > 0 {
builder.WriteByte(dig[(value>>shift)&15])
shift -= 4
}
break
}
shift -= 4
if shift == 0 {
break
}
}
builder.WriteByte(dig[value&15])
return builder.String()
}
return strconv.FormatUint(val, radix)
}
func toDefaultBigString(val, radix *BigDivInt, uppercase bool, choppedDigits, maxDigits int) string {
if bigIsZero(val) {
return "0"
} else if bigAbsIsOne(val) {
return "1"
}
dig := getDigits(uppercase, int(radix.Uint64()))
var builder strings.Builder
if maxDigits > 0 { //maxDigits is 0 or less if the max digits is unknown
if maxDigits <= choppedDigits {
return ""
}
toDefaultStringRecursive(val, radix, uppercase, choppedDigits, maxDigits, dig, true, &builder)
} else {
var quotient big.Int
quotient.Set(val)
for { //value == quotient * 16 + remainder
var remainder big.Int
quotient.QuoRem("ient, radix, &remainder)
if choppedDigits > 0 {
choppedDigits--
continue
}
builder.WriteByte(dig[remainder.Uint64()])
if bigIsZero("ient) {
break
}
}
if builder.Len() == 0 {
return "" // all digits are chopped
}
return reverse(builder.String())
}
return builder.String()
}
func toDefaultStringRecursive(val *BigDivInt, radix *BigDivInt, uppercase bool, choppedDigits, digitCount int, dig string, highest bool, builder *strings.Builder) {
if val.IsUint64() {
longVal := val.Uint64()
intRadix := int(radix.Int64())
if !highest {
getLeadingZeros(digitCount-toUnsignedStringLength(longVal, intRadix), builder)
}
toUnsignedStringCased(longVal, intRadix, choppedDigits, uppercase, builder)
} else if digitCount > choppedDigits {
halfCount := digitCount >> 1
var quotient, remainder big.Int
var radixPower = getRadixPower(radix, halfCount)
quotient.QuoRem(val, radixPower, &remainder)
if highest && bigIsZero("ient) {
// only do low
toDefaultStringRecursive(&remainder, radix, uppercase, choppedDigits, halfCount, dig, true, builder)
} else {
toDefaultStringRecursive("ient, radix, uppercase, max(0, choppedDigits-halfCount), digitCount-halfCount, dig, highest, builder)
toDefaultStringRecursive(&remainder, radix, uppercase, choppedDigits, halfCount, dig, false, builder)
}
}
}
func getRadixPower(radix *big.Int, power int) *big.Int {
if power == 1 {
return radix
}
intRadix := radix.Uint64()
key := intRadix<<32 | uint64(power)
theMapPtr := (*map[uint64]*big.Int)(atomicLoadPointer((*unsafe.Pointer)(unsafe.Pointer(&radixPowerMap))))
theMap := *theMapPtr
if res, ok := theMap[key]; ok {
return res
}
result := new(big.Int)
if (power & 1) == 0 {
halfPower := getRadixPower(radix, power>>1)
result.Mul(halfPower, halfPower)
} else {
halfPower := getRadixPower(radix, (power-1)>>1)
result.Mul(halfPower, halfPower).Mul(result, radix)
}
//replace the map atomically
newRadixMap := createRadixMap()
theNewMap := *newRadixMap
for k, val := range theMap {
theNewMap[k] = val
}
theNewMap[key] = result
dataLoc := (*unsafe.Pointer)(unsafe.Pointer(&radixPowerMap))
atomicStorePointer(dataLoc, unsafe.Pointer(newRadixMap))
return result
}
var radixPowerMap = createRadixMap() // we use a pointer so we can overwrite atomically
func createRadixMap() *map[uint64]*big.Int {
res := make(map[uint64]*big.Int)
return &res
}
func reverse(s string) string {
bts := []byte(s)
for i, j := 0, len(s)-1; i < j; i, j = i+1, j-1 {
bts[i], bts[j] = bts[j], bts[i]
}
return string(bts)
}
func getDefaultRangeStringVals(strProvider divStringProvider, val1, val2 uint64, radix int) string {
var len1, len2 int // we iterate on //value == quotient * radix + remainder
var value1, value2 uint // we iterate on //value == quotient * radix + remainder
if radix == 10 {
if val2 < 10 {
len2 = 1
} else if val2 < 100 {
len2 = 2
} else if val2 < 1000 {
len2 = 3
} else {
return buildDefaultRangeString(strProvider, radix)
}
value2 = uint(val2)
if val1 < 10 {
len1 = 1
} else if val1 < 100 {
len1 = 2
} else if val1 < 1000 {
len1 = 3
} else {
return buildDefaultRangeString(strProvider, radix)
}
value1 = uint(val1)
charsStr := strings.Builder{}
charsStr.Grow(len1 + len2 + 1)
dig := digits
doubleDig := doubleDigitsDecimal
var quotient, remainder uint
var chars []byte
if val1 < 10 {
charsStr.WriteByte(dig[value1])
} else if val1 < 100 {
digIndex := value1 << 1
charsStr.WriteByte(doubleDig[digIndex])
charsStr.WriteByte(doubleDig[digIndex+1])
} else if val1 < 200 {
charsStr.WriteByte('1')
digIndex := (value1 - 100) << 1
charsStr.WriteByte(doubleDig[digIndex])
charsStr.WriteByte(doubleDig[digIndex+1])
} else if val1 < 300 {
charsStr.WriteByte('2')
digIndex := (value1 - 200) << 1
charsStr.WriteByte(doubleDig[digIndex])
charsStr.WriteByte(doubleDig[digIndex+1])
} else {
chars = make([]byte, len2) // note that len2 >= len1
origLen1 := len1
for {
//value == quotient * 10 + remainder
quotient = (value1 * 0xcccd) >> 19 //floor of n/10 is floor of ((0xcccd * n / (2 ^ 16)) / (2 ^ 3))
remainder = value1 - ((quotient << 3) + (quotient << 1)) //multiplication by 2 added to multiplication by 2 ^ 3 is multiplication by 2 + 8 = 10
len1--
chars[len1] = dig[remainder]
value1 = quotient
if value1 == 0 {
break
}
}
charsStr.Write(chars[:origLen1])
}
charsStr.WriteByte(RangeSeparator)
if val2 < 10 {
charsStr.WriteByte(dig[value2])
} else if val2 < 100 {
digIndex := value2 << 1
charsStr.WriteByte(doubleDig[digIndex])
charsStr.WriteByte(doubleDig[digIndex+1])
} else if val2 < 200 {
charsStr.WriteByte('1')
digIndex := (value2 - 100) << 1
charsStr.WriteByte(doubleDig[digIndex])
charsStr.WriteByte(doubleDig[digIndex+1])
} else if val2 < 300 {
charsStr.WriteByte('2')
digIndex := (value2 - 200) << 1
charsStr.WriteByte(doubleDig[digIndex])
charsStr.WriteByte(doubleDig[digIndex+1])
} else {
origLen2 := len2
if chars == nil {
chars = make([]byte, len2)
}
for {
quotient = (value2 * 0xcccd) >> 19
remainder = value2 - ((quotient << 3) + (quotient << 1))
len2--
chars[len2] = dig[remainder]
value2 = quotient
if value2 == 0 {
break
}
}
charsStr.Write(chars[:origLen2])
}
return charsStr.String()
} else if radix == 16 {
if val2 < 0x10 {
len2 = 1
} else if val2 < 0x100 {
len2 = 2
} else if val2 < 0x1000 {
len2 = 3
} else if val2 < 0x10000 {
len2 = 4
} else {
return buildDefaultRangeString(strProvider, radix)
}
if val1 < 0x10 {
len1 = 1
} else if val1 < 0x100 {
len1 = 2
} else if val1 < 0x1000 {
len1 = 3
} else if val1 < 0x10000 {
len1 = 4
} else {
return buildDefaultRangeString(strProvider, radix)
}
value1 = uint(val1)
charsStr := strings.Builder{}
charsStr.Grow(len1 + len2 + 1)
dig := digits
if val1 < 0x10 {
charsStr.WriteByte(dig[value1])
} else {
shift := uint(12)
for {
index := (value1 >> shift) & 15
if index != 0 { // index 0 is digit "0"
charsStr.WriteByte(dig[index])
shift -= 4
for shift > 0 {
charsStr.WriteByte(dig[(value1>>shift)&15])
shift -= 4
}
break
}
shift -= 4
if shift == 0 {
break
}
}
charsStr.WriteByte(dig[value1&15])
}
charsStr.WriteByte(RangeSeparator)
value2 = uint(val2)
if val2 < 0x10 {
charsStr.WriteByte(dig[value2])
} else {
shift := uint(12)
for {
index := (value2 >> shift) & 15
if index != 0 { // index 0 is digit "0"
charsStr.WriteByte(dig[index])
shift -= 4
for shift > 0 {
charsStr.WriteByte(dig[(value2>>shift)&15])
shift -= 4
}
break
}
shift -= 4
if shift == 0 {
break
}
}
charsStr.WriteByte(dig[value2&15])
}
return charsStr.String()
}
return buildDefaultRangeString(strProvider, radix)
}
func buildDefaultRangeString(strProvider divStringProvider, radix int) string {
builder := strings.Builder{}
builder.Grow(20)
getRangeString(strProvider, RangeSeparatorStr, 0, 0, "", radix, false, false, &builder)
return builder.String()
}
func getRangeString(
strProvider divStringProvider,
rangeSeparator string,
lowerLeadingZerosCount,
upperLeadingZerosCount int,
stringPrefix string,
radix int,
uppercase,
maskUpper bool,
appendable *strings.Builder) int {
prefLen := len(stringPrefix)
hasStringPrefix := prefLen > 0
if appendable == nil {
count := lowerLeadingZerosCount + upperLeadingZerosCount +
strProvider.getLowerStringLength(radix) + strProvider.getUpperStringLength(radix) + len(rangeSeparator)
if hasStringPrefix {
count += prefLen << 1
}
return count
} else {
if hasStringPrefix {
appendable.WriteString(stringPrefix)
}
if lowerLeadingZerosCount > 0 {
getLeadingZeros(lowerLeadingZerosCount, appendable)
}
strProvider.getLowerString(radix, uppercase, appendable)
appendable.WriteString(rangeSeparator)
if hasStringPrefix {
appendable.WriteString(stringPrefix)
}
if upperLeadingZerosCount > 0 {
getLeadingZeros(upperLeadingZerosCount, appendable)
}
if maskUpper {
strProvider.getUpperStringMasked(radix, uppercase, appendable)
} else {
strProvider.getUpperString(radix, uppercase, appendable)
}
}
return 0
}
func toSplitUnsignedString(
value uint64,
radix,
choppedDigits int,
uppercase bool,
splitDigitSeparator byte,
reverseSplitDigits bool,
stringPrefix string,
appendable *strings.Builder) {
if reverseSplitDigits {
appendDigits(value, radix, choppedDigits, uppercase, splitDigitSeparator, stringPrefix, appendable)
} else {
// for ::1 this produces
// 1.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.ip6.arpa
// each seg is 4 digits like 1.0.0.0 for the last seg
var tmpBuilder strings.Builder
appendDigits(value, radix, choppedDigits, uppercase, splitDigitSeparator, stringPrefix, &tmpBuilder)
stringPrefixLen := len(stringPrefix)
str := tmpBuilder.String()
back := tmpBuilder.Len() - 1
for {
appendable.WriteString(stringPrefix)
appendable.WriteByte(str[back])
back -= stringPrefixLen // skip the prefix, if any
back -= 2 // 1 for the separator, 1 for the byte
if back < 0 {
break
}
appendable.WriteByte(splitDigitSeparator)
}
}
}
func toUnsignedSplitRangeString(
lower,
upper uint64,
rangeSeparator,
wildcard string,
radix int,
uppercase bool,
splitDigitSeparator byte,
reverseSplitDigits bool,
stringPrefix string,
appendable *strings.Builder) (err addrerr.IncompatibleAddressError) {
//A split can be invalid. Consider xxx.456-789.
//The number 691, which is in the range 456-789, is not in the range 4-7.5-8.6-9
//In such cases we have IncompatibleAddressError
//To avoid such cases, we must have lower digits covering the full range, for example 400-799 in which lower digits are both 0-9 ranges.
//If we have 401-799 then 500 will not be included when splitting.
//If we have 400-798 then 599 will not be included when splitting.
//If we have 410-799 then 500 will not be included when splitting.
//If we have 400-789 then 599 will not be included when splitting.
if reverseSplitDigits {
err = appendRangeDigits(lower, upper, rangeSeparator, wildcard, radix, uppercase, splitDigitSeparator, reverseSplitDigits, stringPrefix, appendable)
} else {
var tmpBuilder strings.Builder
err = appendRangeDigits(lower, upper, rangeSeparator, wildcard, radix, uppercase, splitDigitSeparator, reverseSplitDigits, stringPrefix, &tmpBuilder)
if err == nil {
str := tmpBuilder.String()
for back := tmpBuilder.Len() - 1; back >= 0; back-- {
appendable.WriteByte(str[back])
}
}
}
return
}
func toUnsignedSplitRangeStringLength(
lower,
upper uint64,
rangeSeparator,
wildcard string,
leadingZerosCount,
radix int,
uppercase bool,
splitDigitSeparator byte,
reverseSplitDigits bool,
stringPrefix string) int {
_ = rangeSeparator
_ = uppercase
_ = splitDigitSeparator
_ = reverseSplitDigits
digitsLength := -1 //we will count one too many split digit separators in here
stringPrefixLength := len(stringPrefix)
radix64 := uint64(radix)
for {
upperDigit := int(upper % radix64)
lowerDigit := int(lower % radix64)
isFull := (lowerDigit == 0) && (upperDigit == radix-1)
if isFull {
digitsLength += len(wildcard) + 1
} else {
//if not full range, they must not be the same either, otherwise they would be illegal for split range.
//this is because we know whenever entering the loop that upper != lower, and we know this also means the least significant digits must differ.
digitsLength += (stringPrefixLength << 1) + 4 /* 1 for each digit, 1 for range separator, 1 for split digit separator */
}
upper /= radix64
lower /= radix64
if upper == lower {
break
}
}
remaining := 0
if upper != 0 {
remaining = toUnsignedStringLength(upper, radix)
}
remaining += leadingZerosCount
if remaining > 0 {
digitsLength += remaining * (stringPrefixLength + 2 /* one for each splitDigitSeparator, 1 for each digit */)
}
return digitsLength
}
func appendDigits(
value uint64,
radix int,
choppedDigits int,
uppercase bool,
splitDigitSeparator byte,
stringPrefix string,
appendable *strings.Builder) {
useInts := value <= uint64(maxUint)
value2 := uint(radix)
if useInts {
value2 = uint(value)
}
uradix := uint(radix)
rad64 := uint64(radix)
dig := digits
if uppercase {
dig = uppercaseDigits
}
var index uint
prefLen := len(stringPrefix)
for value2 >= uradix {
if useInts {
val := value2
value2 /= uradix
if choppedDigits > 0 {
choppedDigits--
continue
}
index = val % uradix
} else {
val := value
value /= rad64
if value <= uint64(maxUint) {
useInts = true
value2 = uint(value)
}
if choppedDigits > 0 {
choppedDigits--
continue
}
index = uint(val % rad64)
}
if prefLen > 0 {
appendable.WriteString(stringPrefix)
}
appendable.WriteByte(dig[index])
appendable.WriteByte(splitDigitSeparator)
}
if choppedDigits == 0 {
if prefLen > 0 {
appendable.WriteString(stringPrefix)
}
appendable.WriteByte(dig[value2])
}
}
func appendRangeDigits(
lower,
upper uint64,
rangeSeparator,
wildcard string,
radix int,
uppercase bool,
splitDigitSeparator byte,
reverseSplitDigits bool,
stringPrefix string,
appendable *strings.Builder) addrerr.IncompatibleAddressError {
dig := digits
if uppercase {
dig = uppercaseDigits
}
previousWasFullRange := true
useInts := upper <= uint64(maxUint)
lowerInt := uint(radix)
upperInt := lowerInt
if useInts {
upperInt = uint(upper)
lowerInt = uint(lower)
}
uradix := uint(radix)
rad64 := uint64(radix)
prefLen := len(stringPrefix)
for {
var upperDigit, lowerDigit uint
if useInts {
ud := upperInt
upperDigit = upperInt % uradix
upperInt /= uradix
if ud == lowerInt {
lowerInt = upperInt
lowerDigit = upperDigit
} else {
lowerDigit = lowerInt % uradix
lowerInt /= uradix
}
} else {
ud := upper
upperDigit = uint(upper % rad64)
upper /= rad64
if ud == lower {
lower = upper
lowerDigit = upperDigit
} else {
lowerDigit = uint(lower % rad64)
lower /= rad64
}
if upper <= uint64(maxUint) {
useInts = true
upperInt = uint(upper)
lowerInt = uint(lower)
}
}
if lowerDigit == upperDigit {
previousWasFullRange = false
if reverseSplitDigits {
if prefLen > 0 {
appendable.WriteString(stringPrefix)
}
appendable.WriteByte(dig[lowerDigit])
} else {
//in this case, whatever we do here will be completely reversed following this method call
appendable.WriteByte(dig[lowerDigit])
for k := prefLen - 1; k >= 0; k-- {
appendable.WriteByte(stringPrefix[k])
}
}
} else {
if !previousWasFullRange {
return &incompatibleAddressError{addressError{key: "ipaddress.error.splitMismatch"}}
}
previousWasFullRange = (lowerDigit == 0) && (upperDigit == uradix-1)
if previousWasFullRange && len(wildcard) > 0 {
if reverseSplitDigits {
appendable.WriteString(wildcard)
} else {
//in this case, whatever we do here will be completely reversed following this method call
for k := len(wildcard) - 1; k >= 0; k-- {
appendable.WriteByte(wildcard[k])
}
}
} else {
if reverseSplitDigits {
if prefLen > 0 {
appendable.WriteString(stringPrefix)
}
appendable.WriteByte(dig[lowerDigit])
appendable.WriteString(rangeSeparator)
appendable.WriteByte(dig[upperDigit])
} else {
//in this case, whatever we do here will be completely reversed following this method call
appendable.WriteByte(dig[upperDigit])
appendable.WriteString(rangeSeparator)
appendable.WriteByte(dig[lowerDigit])
for k := prefLen - 1; k >= 0; k-- {
appendable.WriteByte(stringPrefix[k])
}
}
}
}
if upperInt == 0 {
break
}
appendable.WriteByte(splitDigitSeparator)
}
return nil
}
var maxDigitMap = createDigitMap() // we use a pointer so we can overwrite atomically
func createDigitMap() *map[uint64]int {
res := make(map[uint64]int)
return &res
}
func getBigMaxDigitCount(radix int, bitCount BitCount, maxValue *BigDivInt) int {
return getMaxDigitCountCalc(radix, bitCount, func() int {
return getBigDigitCount(maxValue, big.NewInt(int64(radix)))
})
}
func getMaxDigitCount(radix int, bitCount BitCount, maxValue uint64) int {
return getMaxDigitCountCalc(radix, bitCount, func() int {
return getDigitCount(maxValue, radix)
})
}
func getMaxDigitCountCalc(radix int, bitCount BitCount, calc func() int) int {
rad64 := uint64(radix)
key := (rad64 << 32) | uint64(bitCount)
theMapPtr := (*map[uint64]int)(atomicLoadPointer((*unsafe.Pointer)(unsafe.Pointer(&maxDigitMap))))
theMap := *theMapPtr
if digs, ok := theMap[key]; ok {
return digs
}
digs := calc()
newMaxDigitMap := createDigitMap()
theNewMap := *newMaxDigitMap
for k, val := range theMap {
theNewMap[k] = val
}
theNewMap[key] = digs
dataLoc := (*unsafe.Pointer)(unsafe.Pointer(&maxDigitMap))
atomicStorePointer(dataLoc, unsafe.Pointer(newMaxDigitMap))
return digs
}
func getDigitCount(value uint64, radix int) int {
result := 1
if radix == 16 {
for {
value >>= 4
if value == 0 {
break
}
result++
}
} else {
if radix == 10 {
if value < 10 {
return 1
} else if value < 100 {
return 2
} else if value < 1000 {
return 3
}
value /= 1000
result = 3 //we start with 3 in the loop below
} else if radix == 8 {
for {
value >>= 3
if value == 0 {
break
}
result++
}
return result
}
rad64 := uint64(radix)
for {
value /= rad64
if value == 0 {
break
}
result++
}
}
return result
}
func getBigDigitCount(val, radix *BigDivInt) int {
if bigIsZero(val) || bigAbsIsOne(val) {
return 1
}
result := 1
var v big.Int
v.Set(val)
for {
v.Quo(&v, radix)
if bigIsZero(&v) {
break
}
result++
}
return result
}
|