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 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460
|
#!/usr/bin/perl -w
package NetAddr::IP;
require 5.005_62;
use Carp;
use Socket;
use strict;
use warnings;
#############################################
# These are the overload methods, placed here
# for convenience.
#############################################
use overload
'+' => \&plus,
'-' => \&minus,
'++' => \&plusplus,
'--' => \&minusminus,
"=" => sub {
return _fnew NetAddr::IP [ $_[0]->{addr}, $_[0]->{mask},
$_[0]->{bits} ];
},
'""' => sub {
$_[0]->cidr();
},
'eq' => sub {
my $a = ref $_[0] eq 'NetAddr::IP' ? $_[0]->cidr : $_[0];
my $b = ref $_[1] eq 'NetAddr::IP' ? $_[1]->cidr : $_[1];
$a eq $b;
},
'==' => sub {
return 0 unless ref $_[0] eq 'NetAddr::IP';
return 0 unless ref $_[1] eq 'NetAddr::IP';
$_[0]->cidr eq $_[1]->cidr;
},
# The comparisons below are not portable
# when attempted with the full bit vector.
# This is why we break them down and do it
# one octet at a time. String comparison
# is not portable because of endianness.
'>' => sub {
return 0 if ($_[0]->{bits} != $_[1]->{bits});
for my $b (0 .. $_[0]->{bits}/8 - 1) {
return 1 if vec($_[0]->{addr}, $b, 8)
> vec($_[1]->{addr}, $b, 8);
}
for my $b (0 .. $_[0]->{bits}/8 - 1) {
return 1 if vec($_[0]->{mask}, $b, 8)
> vec($_[1]->{mask}, $b, 8);
}
return 0;
},
'<' => sub {
return 0 if ($_[0]->{bits} != $_[1]->{bits});
for my $b (0 .. $_[0]->{bits}/8 - 1) {
return 1 if vec($_[0]->{addr}, $b, 8)
< vec($_[1]->{addr}, $b, 8);
}
for my $b (0 .. $_[0]->{bits}/8 - 1) {
return 1 if vec($_[0]->{mask}, $b, 8)
< vec($_[1]->{mask}, $b, 8);
}
return 0;
},
'>=' => sub {
return 0 if ($_[0]->{bits} != $_[1]->{bits});
for my $b (0 .. $_[0]->{bits}/8 - 1) {
return 1 if vec($_[0]->{addr}, $b, 8)
>= vec($_[1]->{addr}, $b, 8);
}
for my $b (0 .. $_[0]->{bits}/8 - 1) {
return 1 if vec($_[0]->{mask}, $b, 8)
>= vec($_[1]->{mask}, $b, 8);
}
return 0;
},
'<=' => sub {
return 0 if ($_[0]->{bits} != $_[1]->{bits});
for my $b (0 .. $_[0]->{bits}/8 - 1) {
return 1 if vec($_[0]->{addr}, $b, 8)
<= vec($_[1]->{addr}, $b, 8);
}
for my $b (0 .. $_[0]->{bits}/8 - 1) {
return 1 if vec($_[0]->{mask}, $b, 8)
<= vec($_[1]->{mask}, $b, 8);
}
return 0;
},
'<=>' => sub {
return undef if ($_[0]->{bits} != $_[1]->{bits});
for my $b (0 .. $_[0]->{bits}/8 - 1) {
my $r = vec($_[0]->{addr}, $b, 8)
<=> vec($_[1]->{addr}, $b, 8);
return $r if $r;
}
for my $b (0 .. $_[0]->{bits}/8 - 1) {
my $r = vec($_[0]->{mask}, $b, 8)
<=> vec($_[1]->{mask}, $b, 8);
return $r if $r;
}
return 0;
},
'cmp' => sub {
return undef if ($_[0]->{bits} != $_[1]->{bits});
for my $b (0 .. $_[0]->{bits}/8 - 1) {
my $r = vec($_[0]->{addr}, $b, 8)
<=> vec($_[1]->{addr}, $b, 8);
return $r if $r;
}
for my $b (0 .. $_[0]->{bits}/8 - 1) {
my $r = vec($_[0]->{mask}, $b, 8)
<=> vec($_[1]->{mask}, $b, 8);
return $r if $r;
}
return 0;
},
'@{}' => sub {
return [ $_[0]->hostenum ];
};
#############################################
# End of the overload methods.
#############################################
our $VERSION = '3.07';
# Preloaded methods go here.
# This is a variant to ->new() that
# creates and blesses a new object
# without the fancy parsing of
# IP formats and shorthands.
sub _fnew ($$) {
my $type = shift;
my $class = ref($type) || $type || "NetAddr::IP";
my $r_addr = shift;
return
bless { addr => $r_addr->[0],
mask => $r_addr->[1],
bits => $r_addr->[2] },
$class;
}
# Returns 2 ** $bits -1 (ie,
# $bits one bits)
sub _ones ($) {
my $bits = shift;
return ~vec('', 0, $bits);
}
# Addition of a constant to an
# object
sub plus {
my $ip = shift;
my $const = shift;
return $ip unless $const;
my $a = $ip->{addr};
my $m = $ip->{mask};
my $b = $ip->{bits};
my $hp = "$a" & ~"$m";
my $np = "$a" & "$m";
vec($hp, 0, $b) += $const;
return _fnew NetAddr::IP [ "$np" | ("$hp" & ~"$m"), $m, $b];
}
sub minus {
my $ip = shift;
my $const = shift;
return plus($ip, -$const, @_);
}
# Auto-increment an object
sub plusplus {
my $ip = shift;
my $a = $ip->{addr};
my $m = $ip->{mask};
my $hp = "$a" & ~"$m";
my $np = "$a" & "$m";
vec($hp, 0, 32) ++;
$ip->{addr} = "$np" | ("$hp" & ~"$m");
return $ip;
}
sub minusminus {
my $ip = shift;
my $a = $ip->{addr};
my $m = $ip->{mask};
my $hp = "$a" & ~"$m";
my $np = "$a" & "$m";
vec($hp, 0, 32) --;
$ip->{addr} = "$np" | ("$hp" & ~"$m");
return $ip;
}
sub masklen ($) {
my $self = shift;
my $bits = 0;
for (my $i = 0;
$i < $self->{bits};
$i ++)
{
$bits += vec($self->{mask}, $i, 1);
}
return $bits;
}
sub _parse_mask ($$) {
my $mask = shift;
my $bits = shift;
my $bmask = '';
if ($mask =~ m/^default$/i) {
vec($bmask, 0, $bits) = 0x0;
}
elsif ($mask =~ m/^broadcast$/i) {
vec($bmask, 0, $bits) = _ones $bits;
}
elsif ($mask =~ m/^loopback$/i) {
vec($bmask, 0, 8) = 255;
vec($bmask, 1, 8) = 0;
vec($bmask, 2, 8) = 0;
vec($bmask, 3, 8) = 0;
}
elsif ($mask =~ m/^(\d+)\.(\d+)\.(\d+)\.(\d+)$/) {
vec($bmask, 0, 8) = $1;
vec($bmask, 1, 8) = $2;
vec($bmask, 2, 8) = $3;
vec($bmask, 3, 8) = $4;
}
elsif ($mask =~ m/^(\d+)$/ and $1 <= 32) {
if ($1) {
vec($bmask, 0, $bits) = _ones $bits;
vec($bmask, 0, $bits) <<= ($bits - $1);
} else {
vec($bmask, 0, $bits) = 0x0;
}
}
elsif ($mask =~ m/^(\d+)$/) {
vec($bmask, 0, $bits) = $1;
}
return $bmask;
}
sub _obits ($$) {
my $lo = shift;
my $hi = shift;
return 0xFF if $lo == $hi;
return (~ ($hi ^ $lo)) & 0xFF;
}
sub _v4 ($$$) {
my $ip = shift;
my $mask = shift;
my $present = shift;
my $addr = '';
if ($ip =~ m!^default$!i) {
vec($addr, 0, 32) = 0x0;
}
elsif ($ip =~ m!^broadcast$!i) {
vec($addr, 0, 32) = _ones 32;
}
elsif ($ip =~ m!^loopback$!i) {
vec($addr, 0, 8) = 127;
vec($addr, 3, 8) = 1;
}
elsif ($ip =~ m/^(\d+)\.(\d+)\.(\d+)\.(\d+)$/) {
vec($addr, 0, 8) = $1;
vec($addr, 1, 8) = $2;
vec($addr, 2, 8) = $3;
vec($addr, 3, 8) = $4;
}
elsif ($ip =~ m/^(\d+)\.(\d+)$/) {
vec($addr, 0, 8) = $1;
vec($addr, 1, 8) = ($present ? $2 : 0);
vec($addr, 2, 8) = 0;
vec($addr, 3, 8) = ($present ? 0 : $2);
}
elsif ($ip =~ m/^(\d+)\.(\d+)\.(\d+)$/) {
vec($addr, 0, 8) = $1;
vec($addr, 1, 8) = $2;
vec($addr, 2, 8) = ($present ? $3 : 0);
vec($addr, 3, 8) = ($present ? 0 : $3);
}
elsif ($ip =~ m/^([xb\d]+)$/) {
vec($addr, 0, 32) = $1;
}
# The notations below, include an
# implicit mask specification.
elsif ($ip =~ m/^(\d+)\.$/ and $1 >= 0 and $1 <= 255) {
#print "^(\\d+)\\.\$\n";
vec($addr, 0, 8) = $1;
vec($addr, 1, 8) = 0;
vec($addr, 2, 8) = 0;
vec($addr, 3, 8) = 0;
vec($mask, 0, 32) = 0xFF000000;
}
elsif ($ip =~ m/^(\d+)\.(\d+)-(\d+)\.?$/
and $1 >= 0 and $1 <= 255
and $2 >= 0 and $2 <= 255
and $3 >= 0 and $3 <= 255
and $2 <= $3) {
#print "^(\\d+)\\.(\\d+)-(\\d+)\\.?\$\n";
vec($addr, 0, 8) = $1;
vec($addr, 1, 8) = $2;
vec($addr, 2, 8) = 0;
vec($addr, 3, 8) = 0;
vec($mask, 0, 32) = 0x0;
vec($mask, 0, 8) = 0xFF;
vec($mask, 1, 8) = _obits $2, $3;
}
elsif ($ip =~ m/^(\d+)-(\d+)\.?$/
and $1 >= 0 and $1 <= 255
and $2 >= 0 and $2 <= 255
and $1 <= $2) {
#print "^(\\d+)-(\\d+)\\.?\$\n";
vec($addr, 0, 8) = $1;
vec($addr, 1, 8) = 0;
vec($addr, 2, 8) = 0;
vec($addr, 3, 8) = 0;
vec($mask, 0, 32) = 0x0;
vec($mask, 0, 8) = _obits $1, $2;
}
elsif ($ip =~ m/^(\d+)\.(\d+)\.$/ and $1 >= 0
and $1 <= 255 and $2 >= 0 and $2 <= 255)
{
#print "^(\\d+)\\.(\\d+)\\.\$\n";
vec($addr, 0, 8) = $1;
vec($addr, 1, 8) = $2;
vec($addr, 2, 8) = 0;
vec($addr, 3, 8) = 0;
vec($mask, 0, 32) = 0xFFFF0000;
}
elsif ($ip =~ m/^(\d+)\.(\d+)\.(\d+)-(\d+)\.?$/
and $1 >= 0 and $1 <= 255
and $2 >= 0 and $2 <= 255
and $3 >= 0 and $3 <= 255
and $4 >= 0 and $4 <= 255
and $3 <= $4) {
#print "^(\\d+)\\.(\\d+)\\.(\\d+)-(\\d+)\\.?\$\n";
vec($addr, 0, 8) = $1;
vec($addr, 1, 8) = $2;
vec($addr, 2, 8) = $3;
vec($addr, 3, 8) = 0;
vec($mask, 0, 32) = 0x0;
vec($mask, 0, 8) = 0xFF;
vec($mask, 1, 8) = 0xFF;
vec($mask, 2, 8) = _obits $3, $4;
}
elsif ($ip =~ m/^(\d+)\.(\d+)\.(\d+)\.$/ and $1 >= 0
and $1 <= 255 and $2 >= 0 and $2 <= 255
and $3 >= 0 and $3 <= 255)
{
#print "^(\\d+)\\.(\\d+)\\.(\\d+)\\.\$\n";
vec($addr, 0, 8) = $1;
vec($addr, 1, 8) = $2;
vec($addr, 2, 8) = $3;
vec($addr, 3, 8) = 0;
vec($mask, 0, 32) = 0xFFFFFF00;
}
elsif ($ip =~ m/^(\d+)\.(\d+)\.(\d+)\.(\d+)-(\d+)$/
and $1 >= 0 and $1 <= 255
and $2 >= 0 and $2 <= 255
and $3 >= 0 and $3 <= 255
and $4 >= 0 and $4 <= 255
and $5 >= 0 and $5 <= 255
and $4 <= $5) {
#print "^(\\d+)\\.(\\d+)\\.(\\d+)\\.(\\d+)-(\\d+)\$\n";
vec($addr, 0, 8) = $1;
vec($addr, 1, 8) = $2;
vec($addr, 2, 8) = $3;
vec($addr, 3, 8) = $4;
vec($mask, 0, 8) = 0xFF;
vec($mask, 1, 8) = 0xFF;
vec($mask, 2, 8) = 0xFF;
vec($mask, 3, 8) = _obits $4, $5;
}
elsif ($ip =~ m/^(\d+)\.(\d+)\.(\d+)\.(\d+)
\s*-\s*(\d+)\.(\d+)\.(\d+)\.(\d+)$/x
and $1 >= 0 and $1 <= 255
and $2 >= 0 and $2 <= 255
and $3 >= 0 and $3 <= 255
and $4 >= 0 and $4 <= 255
and $5 >= 0 and $5 <= 255
and $6 >= 0 and $6 <= 255
and $7 >= 0 and $7 <= 255
and $8 >= 0 and $8 <= 255)
{
my $last = '';
vec($addr, 0, 8) = $1;
vec($addr, 1, 8) = $2;
vec($addr, 2, 8) = $3;
vec($addr, 3, 8) = $4;
vec($last, 0, 8) = $5;
vec($last, 1, 8) = $6;
vec($last, 2, 8) = $7;
vec($last, 3, 8) = $8;
vec($mask, 0, 8) = _obits $1, $5;
vec($mask, 1, 8) = _obits $2, $6;
vec($mask, 2, 8) = _obits $3, $7;
vec($mask, 3, 8) = _obits $4, $8;
}
elsif (my $a = gethostbyname($ip)) {
if (inet_ntoa($a) =~ m!^(\d+)\.(\d+)\.(\d+)\.(\d+)$!) {
vec($addr, 0, 8) = $1;
vec($addr, 1, 8) = $2;
vec($addr, 2, 8) = $3;
vec($addr, 3, 8) = $4;
}
}
else {
# croak "Cannot obtain an IP address out of $ip";
return undef;
}
return { addr => $addr, mask => $mask, bits => 32 };
}
sub new ($$;$) {
my $type = $_[0];
my $class = ref($type) || $type || "NetAddr::IP";
my $ip = $_[1];
my $hasmask = 1;
my $mask;
$ip = 'default' unless defined $ip;
if (@_ == 2) {
if ($ip =~ m!^(.+)/(.+)$!) {
$ip = $1;
$mask = $2;
}
elsif ($ip =~ m!^(default|broadcast|loopback)$!) {
$mask = $ip;
}
}
if (defined $_[2]) {
$mask = _parse_mask $_[2], 32;
}
elsif (defined $mask) {
$mask = _parse_mask $mask, 32;
}
else {
$hasmask = 0;
$mask = _parse_mask 32, 32;
}
my $self = _v4($ip, $mask, $hasmask);
return undef unless $self;
return bless $self, $class;
}
sub new4 ($$;$) {
new($_[0], $_[1], $_[2]);
}
# Output a vec() as a dotted-quad
sub _to_quad ($) {
my $vec = shift;
return vec($vec, 0, 8) . '.' .
vec($vec, 1, 8) . '.' .
vec($vec, 2, 8) . '.' .
vec($vec, 3, 8);
}
# Get the network address
sub _network ($) {
my $self = shift;
my $a = $self->{addr};
my $m = $self->{mask};
return [ "$a" & "$m", $self->{mask}, $self->{bits} ];
}
# Should be obvious
sub _broadcast ($) {
my $self = shift;
my $a = $self->{addr};
my $m = $self->{mask};
my $c = '';
vec($c, 0, $self->{bits}) = _ones $self->{bits};
vec($c, 0, $self->{bits}) ^= vec($m, 0, $self->{bits});
return [ "$a" | ~ "$m" | $c, $self->{mask}, $self->{bits} ];
}
# This will become an lvalue later
sub mask ($) {
my $self = shift;
_to_quad $self->{mask};
}
# idem
sub addr ($) {
my $self = shift;
_to_quad $self->{addr};
}
sub cidr ($) {
my $self = shift;
return $self->addr . '/' . $self->masklen;
}
sub do_prefix ($$$) {
my $mask = shift;
my $faddr = shift;
my $laddr = shift;
if ($mask > 24) {
return "$faddr->[0].$faddr->[1].$faddr->[2].$faddr->[3]-$laddr->[3]";
}
elsif ($mask == 24) {
return "$faddr->[0].$faddr->[1].$faddr->[2].";
}
elsif ($mask > 16) {
return "$faddr->[0].$faddr->[1].$faddr->[2]-$laddr->[2].";
}
elsif ($mask == 16) {
return "$faddr->[0].$faddr->[1].";
}
elsif ($mask > 8) {
return "$faddr->[0].$faddr->[1]-$laddr->[1].";
}
elsif ($mask == 8) {
return "$faddr->[0].";
}
else {
return "$faddr->[0]-$laddr->[0]";
}
}
sub nprefix ($) {
my $self = shift;
my $mask = $self->masklen;
return undef if $self->{bits} > 32;
return $self->addr if $mask == 32;
my @faddr = split (/\./, $self->first->addr);
my @laddr = split (/\./, $self->last->addr);
return do_prefix $mask, \@faddr, \@laddr;
}
sub prefix ($) {
my $self = shift;
my $mask = $self->masklen;
return undef if $self->{bits} > 32;
return $self->addr if $mask == 32;
my @faddr = split (/\./, $self->first->addr);
my @laddr = split (/\./, $self->broadcast->addr);
return do_prefix $mask, \@faddr, \@laddr;
}
sub range ($) {
my $self = shift;
my $mask = $self->masklen;
return undef if $self->{bits} > 32;
return $self->network->addr . ' - ' . $self->broadcast->addr;
}
sub broadcast ($) {
my $self = shift;
return $self->_fnew($self->_broadcast);
}
sub network ($) {
my $self = shift;
return $self->_fnew($self->_network);
}
sub wildcard ($) {
my $self = shift;
return wantarray() ? ($self->addr, _to_quad ~$self->{mask}) :
_to_quad ~$self->{mask};
}
sub numeric ($) {
my $self = shift;
return
wantarray() ? ( vec($self->{addr}, 0, 32),
vec($self->{mask}, 0, 32) ) :
vec($self->{addr}, 0, 32);
}
# Return the shortest possible subnet
# list that completely contains all
# the given addresses or subnets.
sub compactref ($) {
my @addr = sort
# { (vec($a->{addr}, 0, $a->{bits}) <=> vec($b->{addr}, 0, $a->{bits}))
# || (vec($a->{mask}, 0, $a->{bits})
# <=> vec($b->{mask}, 0, $a->{bits}))
# }
@{$_[0]} or
return [];
my $bits = $addr[0]->{bits};
my $changed;
do {
$changed = 0;
for (my $i = 0;
$i <= $#addr - 1;
$i ++)
{
my $lip = $addr[$i];
my $hip = $addr[$i + 1];
if ($lip->contains($hip)) {
splice(@addr, $i + 1, 1);
++ $changed;
-- $i;
}
elsif (vec($lip->{mask}, 0, $bits)
== vec($hip->{mask}, 0, $bits))
{
my $la = $lip->{addr};
my $ha = $hip->{addr};
my $nb = '';
my $na = '';
my $nm = '';
vec($nb, 0, $bits) =
vec($na, 0, $bits) =
vec($la, 0, $bits);
vec($nb, 0, $bits) ^= vec($ha, 0, $bits);
vec($na, 0, $bits) ^= vec($nb, 0, $bits);
vec($nm, 0, $bits) = vec($lip->{mask}, 0, $bits);
vec($nm, 0, $bits) <<= 1;
# if ((vec($la, 0, $bits) & vec($nm, 0, $bits))
# == (vec($ha, 0, $bits) & vec($nm, 0, $bits)))
if (("$la" & "$nm") eq ("$ha" & "$nm"))
{
if ("$la" eq "$ha") {
splice(@addr, $i + 1, 1);
}
else {
$addr[$i] = ($lip->_fnew([ "$na" & "$nm",
$nm, $bits ]));
splice(@addr, $i + 1, 1);
}
# print $lip->addr, "/", $lip->mask, " + ", $hip->addr,
# "/", $hip->mask, " = ", $addr[$i]->addr, "/",
# $addr[$i]->mask, "\n";
-- $i;
++ $changed;
}
}
}
} while ($changed);
return \@addr;
}
sub compact {
return @{compactref(\@_)};
}
# Splits the current object in
# smaller subnets, of $bits bits
# netmask.
sub splitref ($;$) {
my $self = shift;
my $mask = _parse_mask shift || $self->{bits}, $self->{bits};
my $bits = $self->{bits};
my @ret;
if (vec($self->{mask}, 0, $bits)
<= vec($mask, 0, $bits))
{
my $delta = '';
my $num = '';
my $v = '';
vec($num, 0, $bits) = _ones $bits;
vec($num, 0, $bits) ^= vec($mask, 0, $bits);
vec($num, 0, $bits) ++;
vec($delta, 0, $bits) = (vec($self->{mask}, 0, $bits)
^ vec($mask, 0, $bits));
my $net = $self->network->{addr};
$net = "$net" & "$mask";
my $to = $self->broadcast->{addr};
$to = "$to" & "$mask";
# XXX - Note that most likely,
# this loop will NOT work on IPv6...
# $net, $to and $num might very well
# be too large for most integer or
# floating pointrepresentations.
for (my $i = vec($net, 0, $bits);
$i <= vec($to, 0, $bits);
$i += vec($num, 0, $bits))
{
vec($v, 0, $bits) = $i;
push @ret, $self->_fnew([ $v, $mask, $bits ]);
}
}
return \@ret;
}
sub split ($;$) {
return @{$_[0]->splitref($_[1])};
}
sub hostenumref ($) {
my $r = $_[0]->splitref(32);
if ($_[0]->mask ne '255.255.255.255') {
splice(@$r, 0, 1);
splice(@$r, scalar @$r - 1, 1);
}
return $r;
}
sub hostenum ($) {
return @{$_[0]->hostenumref};
}
# Returns TRUE if $a completely
# contains $b and both are of the
# same length (ie, V4 or V6).
sub contains ($$) {
my $a = shift;
my $b = shift;
my $bits = $a->{bits};
my $mask;
# Both must be of the same length...
return undef
unless $bits == $b->{bits};
# $a must be less specific than $b...
return 0
unless ($mask = vec($a->{mask}, 0, $bits))
<= vec($b->{mask}, 0, $bits);
# A default address always contains
return 1 if ($mask == 0x0);
return
((vec($a->{addr}, 0, $bits) & $mask)
== (vec($b->{addr}, 0, $bits) & $mask));
}
sub within ($$) {
return contains($_[1], $_[0]);
}
sub first ($) {
my $self = shift;
return $self->network + 1;
}
sub last ($) {
my $self = shift;
return $self if $self->masklen == $self->{bits};
return $self->broadcast - 1;
}
# XXX - The constant below should be
# constructed dinamically depending on
# the address size in order to work with
# V6.
sub num ($) {
my $self = shift;
return ~vec($self->{mask}, 0, $self->{bits}) & 0xFFFFFFFF;
}
1;
__END__
=head1 NAME
NetAddr::IP - Manages IPv4 addresses and subnets
=head1 SYNOPSIS
use NetAddr::IP;
my $ip = new NetAddr::IP 'loopback';
print "The address is ", $ip->addr, " with mask ", $ip->mask, "\n" ;
if ($ip->within(new NetAddr::IP "127.0.0.0", "255.0.0.0")) {
print "Is a loopback address\n";
}
# This prints 127.0.0.1/32
print "You can also say $ip...\n";
=head1 DESCRIPTION
This module provides a number of methods useful for handling IPv4
addresses ans subnets. Hopefully, its methods are also usable for IPv6
addresses.
Methods so far include:
=over
=item C<-E<gt>new([$addr, [ $mask ]])>
This method creates a new IPv4 address with the supplied address in
C<$addr> and an optional netmask C<$mask>, which can be omitted to get
a /32 mask.
C<$addr> can be almost anything that can be resolved to an IP address
in all the notations I have seen over time. It can optionally contain
the mask in CIDR notation.
B<prefix> notation is understood, with the limitation that the range
speficied by the prefix must match with a valid subnet.
If called with no arguments, 'default' is assumed.
=item C<-E<gt>broadcast()>
Returns a new object refering to the broadcast address of a given
subnet.
=item C<-E<gt>network()>
Returns a new object refering to the network address of a given
subnet.
=item C<-E<gt>addr()>
Returns a scalar with the address part of the object as a dotted-quad.
=item C<-E<gt>mask()>
Returns a scalar with the mask as a dotted-quad.
=item C<-E<gt>masklen()>
Returns a scalar the number of one bits in the mask.
=item C<-E<gt>cidr()>
Returns a scalar with the address and mask in CIDR notation.
=item C<-E<gt>range()>
Returns a scalar with the base address and the broadcast address
separated by a dash and spaces. This is called range notation.
=item C<-E<gt>prefix()>
Returns a scalar with the address and mask in prefix
representation. This is useful for some programs, which expect its
input to be in this format. This method will include the broadcast
address in the encoding.
=item C<-E<gt>nprefix()>
Just as C<-E<gt>prefix()>, but does not include the broadcast address.
=item C<-E<gt>numeric()>
When called in a scalar context, will return a numeric representation
of the address part of the IP address. When called in an array
contest, it returns a list of two elements. The first element is as
described, the second element is the numeric representation of the
netmask.
=item C<-E<gt>wildcard()>
When called in a scalar context, returns the wildcard bits
corresponding to the mask, in dotted-quad format.
When called in an array context, returns a two-element array. The
first element, is the address part. The second element, is the
wildcard translation of the mask.
=item C<$me-E<gt>contains($other)>
Returns true when C<$me> completely contains C<$other>. False is
returned otherwise and C<undef> is returned if C<$me> and C<$other>
are of different versions.
=item C<$me-E<gt>within($other)>
The complement of C<-E<gt>contains()>. Returns true when C<$me> is
completely con tained within C<$other>.
=item C<-E<gt>split($bits)>
Returns a list of objects, representing subnets of C<$bits> mask
produced by splitting the original object, which is left
unchanged. Note that C<$bits> must be longer than the original
object's mask in order for it to be splittable.
Note that C<$bits> can be given as an integer (the length of the mask)
or as a dotted-quad. If omitted, a host mask is assumed.
=item C<-E<gt>splitref($bits)>
A (faster) version of C<-E<gt>split()> that returns a reference to a
list of objects instead of a real list. This is useful when large
numbers of objects are expected.
=item C<-E<gt>hostenum()>
Returns the list of hosts within a subnet.
=item C<-E<gt>hostenumref()>
Faster version of C<-E<gt>hostenum()>, returning a reference to a list.
=item C<$me-E<gt>compact($addr1, $addr2, ...)>
Given a list of objects (including C<$me>), this method will compact
all the addresses and subnets into the largest (ie, least specific)
subnets possible that contain exactly all of the given objects.
Note that in versions prior to 3.02, if fed with the same IP subnets
multiple times, these subnets would be returned. From 3.02 on, a more
"correct" approach has been adopted and only one address would be
returned.
=item C<$me-E<gt>compactref(\@list)>
As usual, a faster version of =item C<-E<gt>compact()> that returns a
reference to a list. Note that this method takes a reference to a list
instead.
=item C<-E<gt>first()>
Returns a new object representing the first useable IP address within
the subnet (ie, the first host address).
=item C<-E<gt>last()>
Returns a new object representing the last useable IP address within
the subnet (ie, one less than the broadcast address).
=item C<-E<gt>num()>
Returns the number of useable addresses IP addresses within the
subnet, not counting the broadcast address.
=back
In addition to the methods, some functions are overloaded to ease
manipulation of the objects. The available operations are:
=over
=item B<Stringification>
An object can be used just as a string. For instance, the following code
my $ip = new NetAddr::IP 'loopback';
print "$ip\n";
Will print the string 127.0.0.1/8.
=item B<Equality>
You can test for equality with either C<eq> or C<==>.
=item B<Dereferencing as an ARRAY>
You can do something along the lines of
my $net = new NetAddr::IP $cidr_spec;
for my $ip (@$net) {
print "Host $ip is in $net\n";
}
However, note that this might generate a very large amount of items
in the list. You must be careful when doing this kind of expansion.
=item B<Sum and auto-increment>
You can add a constant to an object. This will return a new object
referring to the host address obtained by incrementing (or
decrementing) the given address. YOu can do this with the operators
B<+>, B<->, B<+=> and B<-=>.
The auto-increment or auto-decrement operators will return a new
object pointing to the next or previous host address in the
subnet. These are the B<++> and B<--> operators.
=back
=head2 EXPORT
None by default.
=head1 HISTORY
=over
=item 0.01
=over
=item *
original version; Basic testing and release to CPAN as
version 0.01. This is considered beta software.
=back
=item 0.02
=over
=item *
Multiple changes to fix endiannes issues. This code is now
moderately tested on Wintel and Sun/Solaris boxes.
=back
=item 0.03
=over
=item *
Added -E<gt>first and -E<gt>last methods. Version changed to 0.03.
=back
=item 1.00
=over
=item *
Implemented -E<gt>new_subnet. Version changed to 1.00.
=item *
less croak()ing when improper input is fed to the module. A
more consistent 'undef' is returned now instead to allow the
user to better handle the error.
=back
=item 1.10
=over
=item *
As per Marnix A. Van Ammers [mav6@ns02.comp.pge.com]
suggestion, changed the syntax of the loop in host_enum to
be the same of the enum method.
=item *
Fixed the MS-DOS ^M at the end-of-line problem. This should
make the module easier to use for *nix users.
=back
=item 1.20
=over
=item *
Implemented -E<gt>compact and -E<gt>expand methods.
=item *
Applying for official name
=back
=item 1.21
=over
=item *
Added -E<gt>addr_number and -E<gt>mask_bits. Currently we return
normal numbers (not BigInts). Please test this in your
platform and report any problems!
=back
=item 2.00
=over
=item *
Released under the new *official* name of NetAddr::IP
=back
=item 2.10
=over
=item *
Added support for -E<gt>new($min, $max, $bits) form
=item *
Added -E<gt>to_numeric. This helps serializing objects
=back
=item 2.20
=over
=item *
Chris Dowling reported that the sort method introduced in
v1.20 for -E<gt>expand and -E<gt>compact doesn't always return a
number under perl versions < 5.6.0. His fix was applied and
redistributed. Thanks Chris!
=item *
This module is hopefully released with no CR-LF issues!
=item *
Fixed a warning about uninitialized values during make test
=back
=item 2.21
=over
=item *
Dennis Boylan pointed out a bug under Linux and perhaps
other platforms as well causing the error "Sort subroutine
didn't return single value at
/usr/lib/perl5/site_perl/5.6.0/NetAddr/IP.pm line 299, E<lt>E<gt>
line 2." or similar. This was fixed.
=back
=item 2.22
=over
=item *
Some changes suggested by Jeroen Ruigrok and Anton Berezin
were included. Thanks guys!
=back
=item 2.23
=over
=item *
Bug fix for /XXX.XXX.XXX.XXX netmasks under v5.6.1 suggested
by Tim Wuyts. Thanks!
=item *
Tested the module under MACHTYPE=hppa1.0-hp-hpux11.00. It is
now konwn to work under Linux (Intel/AMD), Digital Unix
(Alpha), Solaris (Sun), HP-UX11 (HP-PA-RISC), Windows
9x/NT/2K (using ActiveState on Intel).
=back
=item 2.24
=over
=item *
A spurious warning when expand()ing with -w under certain
circumstances was removed. This involved using /31s, /32s
and the same netmask as the input. Thanks to Elie Rosenblum
for pointing it out.
=item *
Slight change in license terms to ease redistribution as a
Debian package.
=back
=item 3.00
=over
This is a major rewrite, supposed to fix a number of issues pointed
out in earlier versions.
The goals for this version include getting rid of BigInts, speeding up
and also cleaning up the code, which is written in a modular enough
way so as to allow IPv6 functionality in the future, taking benefit
from most of the methods.
Note that no effort has been made to remain backwards compatible with
earlier versions. In particular, certain semantics of the earlier
versions have been removed in favor of faster performance.
This version was tested under Win98/2K (ActiveState 5.6.0/5.6.1),
HP-UX11 on PA-RISC (5.6.0), RedHat Linux 6.2 (5.6.0), Digital Unix on
Alpha (5.6.0), Solaris on Sparc (5.6.0) and possibly others.
=back
=item 3.01
=over
=item *
Added C<-E<gt>numeric()>.
=item *
C<-E<gt>new()> called with no parameters creates a B<default>
NetAddr::IP object.
=back
=item 3.02
=over
=item *
Fxed C<-E<gt>compact()> for cases of equal subnets or
mutually-contained IP addresses as pointed out by Peter Wirdemo. Note
that now only distinct IP addresses will be returned by this method.
=item *
Fixed the docs as suggested by Thomas Linden.
=item *
Introduced overloading to ease certain common operations.
=item *
Fixed compatibility issue with C<-E<gt>num()> on 64-bit processors.
=back
=item 3.03
=over
=item *
Added more comparison operators.
=item *
As per Peter Wirdemo's suggestion, added C<-E<gt>wildcard()> for
producing subnets in wildcard format.
=item *
Added C<++> and C<+> to provide for efficient iteration operations
over all the hosts of a subnet without C<-E<gt>expand()>ing it.
=back
=item 3.04
=over
=item *
Got rid of C<croak()> when invalid input was fed to C<-E<gt>new()>.
=item *
As suggested by Andrew Gaskill, added support for prefix
notation. Thanks for the code of the initial C<-E<gt>prefix()>
function.
=back
=item 3.05
=over
=item *
Added support for range notation, where base and broadcast addresses
are given as arguments to C<-E<gt>new()>.
=back
=item 3.06
=over
=item *
Andrew Ruthven pointed out a bug related to proper interpretation of
"compact" CIDR blocks. This was fixed. Thanks!
=back
=item 3.07
=over
=item *
Sami Pohto pointed out a bug with C<-E<gt>last()>. This was fixed.
=item *
A small bug related to parsing of 'localhost' was fixed.
=back
=back
=head1 AUTHOR
Luis E. Munoz <luismunoz@cpan.org>
=head1 WARRANTY
This software comes with the same warranty as perl itself (ie, none), so
by using it you accept any and all the liability.
=head1 LICENSE
This software is (c) Luis E. Munoz. It can be used under the terms of
the perl artistic license provided that proper credit for the work of
the author is preserved in the form of this copyright notice and
license for this module.
=head1 SEE ALSO
perl(1).
=cut
|