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
|
#ifdef __cplusplus
extern "C" {
#endif
#include "EXTERN.h"
#include "perl.h"
#include "XSUB.h"
#ifdef __cplusplus
}
#endif
#include <sys/types.h>
#include <stdint.h>
#include <netinet/in.h>
#include "libpatricia/patricia.h"
/* frozen stuff is frozen in network byte order */
struct frozen_node
{
int32_t l_index;
int32_t r_index;
int32_t d_index;
uint16_t bitlen; /* bit 0x8000 indicates presence of prefix */
uint16_t family;
uint8_t address[16];
} __attribute__((__packed__));
struct frozen_header
{
uint32_t magic;
#define FROZEN_MAGIC 0x4E655061 /* NePa */
uint8_t major;
#define FROZEN_MAJOR 0
uint8_t minor;
#define FROZEN_MINOR 0
uint16_t maxbits;
int32_t num_total_node;
int32_t num_active_node;
} __attribute__((__packed__));
struct frozen_patricia
{
struct frozen_header header;
struct frozen_node node[1];
} __attribute__((__packed__));
static int
not_here(s)
char *s;
{
croak("%s not implemented on this architecture", s);
return -1;
}
static double
constant(name, arg)
char *name;
int arg;
{
errno = 0;
switch (*name) {
case 'A':
break;
case 'B':
break;
case 'C':
break;
case 'D':
break;
case 'E':
break;
case 'F':
break;
case 'G':
break;
case 'H':
break;
case 'I':
break;
case 'J':
break;
case 'K':
break;
case 'L':
break;
case 'M':
break;
case 'N':
break;
case 'O':
break;
case 'P':
break;
case 'Q':
break;
case 'R':
break;
case 'S':
break;
case 'T':
break;
case 'U':
break;
case 'V':
break;
case 'W':
break;
case 'X':
break;
case 'Y':
break;
case 'Z':
break;
case 'a':
break;
case 'b':
break;
case 'c':
break;
case 'd':
break;
case 'e':
break;
case 'f':
break;
case 'g':
break;
case 'h':
break;
case 'i':
break;
case 'j':
break;
case 'k':
break;
case 'l':
break;
case 'm':
break;
case 'n':
break;
case 'o':
break;
case 'p':
break;
case 'q':
break;
case 'r':
break;
case 's':
break;
case 't':
break;
case 'u':
break;
case 'v':
break;
case 'w':
break;
case 'x':
break;
case 'y':
break;
case 'z':
break;
}
errno = EINVAL;
return 0;
not_there:
errno = ENOENT;
return 0;
}
#define Fill_Prefix(p,f,a,b,mb) \
do { \
if (b < 0 || b > mb) \
croak("invalid key"); \
memcpy(&p.add.sin, a, (mb+7)/8); \
p.family = f; \
p.bitlen = b; \
p.ref_count = 0; \
} while (0)
static void deref_data(SV *data) {
SvREFCNT_dec(data);
data = NULL;
}
static size_t
patricia_walk_inorder_perl(patricia_node_t *node, SV *coderef) {
dSP;
size_t n = 0;
if (node->l) {
n += patricia_walk_inorder_perl(node->l, coderef);
}
if (node->prefix) {
if (NULL != coderef) {
PUSHMARK(SP);
XPUSHs(sv_mortalcopy((SV *)node->data));
PUTBACK;
perl_call_sv(coderef, G_VOID|G_DISCARD);
SPAGAIN;
}
n++;
}
if (node->r) {
n += patricia_walk_inorder_perl(node->r, coderef);
}
return n;
}
typedef patricia_tree_t *Net__Patricia;
typedef patricia_node_t *Net__PatriciaNode;
MODULE = Net::Patricia PACKAGE = Net::Patricia
PROTOTYPES: ENABLE
double
constant(name,arg)
char * name
int arg
Net::Patricia
_new(size)
int size
CODE:
RETVAL = New_Patricia(size);
OUTPUT:
RETVAL
void
_add(tree, family, addr, bits, data)
Net::Patricia tree
int family
char * addr
int bits
SV * data
PROTOTYPE: $$$$$
PREINIT:
prefix_t prefix;
Net__PatriciaNode node;
PPCODE:
Fill_Prefix(prefix, family, addr, bits, tree->maxbits);
node = patricia_lookup(tree, &prefix);
if (NULL != node) {
/* { */
if (node->data) {
deref_data(node->data);
}
node->data = newSVsv(data);
/* } */
PUSHs(data);
} else {
XSRETURN_UNDEF;
}
void
_match(tree, family, addr, bits)
Net::Patricia tree
int family
char * addr
int bits
PROTOTYPE: $$$$
PREINIT:
prefix_t prefix;
Net__PatriciaNode node;
PPCODE:
Fill_Prefix(prefix, family, addr, bits, tree->maxbits);
node = patricia_search_best(tree, &prefix);
if (NULL != node) {
XPUSHs((SV *)node->data);
} else {
XSRETURN_UNDEF;
}
void
_exact(tree, family, addr, bits)
Net::Patricia tree
int family
char * addr
int bits
PROTOTYPE: $$$$
PREINIT:
prefix_t prefix;
Net__PatriciaNode node;
PPCODE:
Fill_Prefix(prefix, family, addr, bits, tree->maxbits);
node = patricia_search_exact(tree, &prefix);
if (NULL != node) {
XPUSHs((SV *)node->data);
} else {
XSRETURN_UNDEF;
}
void
_remove(tree, family, addr, bits)
Net::Patricia tree
int family
char * addr
int bits
PROTOTYPE: $$$$
PREINIT:
prefix_t prefix;
Net__PatriciaNode node;
PPCODE:
Fill_Prefix(prefix, family, addr, bits, tree->maxbits);
node = patricia_search_exact(tree, &prefix);
if (NULL != node) {
XPUSHs(sv_mortalcopy((SV *)node->data));
deref_data(node->data);
patricia_remove(tree, node);
} else {
XSRETURN_UNDEF;
}
size_t
climb(tree, ...)
Net::Patricia tree
PREINIT:
patricia_node_t *node = NULL;
size_t n = 0;
SV *func = NULL;
CODE:
if (2 == items) {
func = ST(1);
} else if (2 < items) {
croak("Usage: Net::Patricia::climb(tree[,CODEREF])");
}
PATRICIA_WALK (tree->head, node) {
if (NULL != func) {
PUSHMARK(SP);
XPUSHs(sv_mortalcopy((SV *)node->data));
PUTBACK;
perl_call_sv(func, G_VOID|G_DISCARD);
SPAGAIN;
}
n++;
} PATRICIA_WALK_END;
RETVAL = n;
OUTPUT:
RETVAL
size_t
climb_inorder(tree, ...)
Net::Patricia tree
PREINIT:
size_t n = 0;
SV *func = NULL;
CODE:
func = NULL;
if (2 == items) {
func = ST(1);
} else if (2 < items) {
croak("Usage: Net::Patricia::climb_inorder(tree[,CODEREF])");
}
n = patricia_walk_inorder_perl(tree->head, func);
RETVAL = n;
OUTPUT:
RETVAL
void
STORABLE_freeze(tree, cloning)
Net::Patricia tree
SV * cloning
PREINIT:
patricia_node_t *node = NULL;
struct frozen_header frozen_header;
struct frozen_node *frozen_nodes, *frozen_node;
size_t n = 0, i = 0, nd = 0;
SV *frozen_patricia;
PPCODE:
if (SvTRUE(cloning))
XSRETURN_UNDEF;
/* I do not know enough of patricia.c to
* decide whether inactive nodes can
* be present in a tree, and whether such
* nodes can be skipped while copying,
* so we copy everything and do not use
* num_active_node here. */
PATRICIA_WALK_ALL (tree->head, node) {
n++;
} PATRICIA_WALK_END;
if (n > 2147483646)
croak("Net::Patricia::STORABLE_freeze: too many nodes");
frozen_header.magic = htonl(FROZEN_MAGIC);
frozen_header.major = FROZEN_MAJOR;
frozen_header.minor = FROZEN_MINOR;
frozen_header.maxbits = htons((uint16_t)tree->maxbits);
frozen_header.num_total_node = htonl(n);
frozen_header.num_active_node = htonl(tree->num_active_node);
frozen_patricia = newSVpv((char *)&frozen_header, sizeof(frozen_header));
XPUSHs(frozen_patricia);
frozen_nodes = calloc(n, sizeof(struct frozen_node));
/* We use user1 field to store the index of each node
* in the frozen_node array; it is okay since Net::Patricia
* is not using it for anything anywhere else */
PATRICIA_WALK_ALL (tree->head, node) {
node->user1 = (void *)(IV)i;
frozen_node = &frozen_nodes[i];
frozen_node->l_index = htonl(-1);
frozen_node->r_index = htonl(-1);
frozen_node->bitlen = node->bit;
if (node->prefix) {
frozen_node->bitlen |= 0x8000;
frozen_node->family = htons(node->prefix->family);
if (tree->maxbits == 32)
memcpy(&frozen_node->address, &node->prefix->add, 4);
else
memcpy(&frozen_node->address, &node->prefix->add, 16);
}
frozen_node->bitlen = htons(frozen_node->bitlen);
if (node->data) {
frozen_node->d_index = htonl(nd);
nd++;
XPUSHs(sv_2mortal(newRV_inc((SV *)node->data)));
} else {
frozen_node->d_index = htonl(-1);
}
if (node->parent && node->parent->l == node) {
frozen_nodes[(IV)node->parent->user1].l_index = htonl(i);
} else if (node->parent && node->parent->r == node) {
frozen_nodes[(IV)node->parent->user1].r_index = htonl(i);
}
i++;
} PATRICIA_WALK_END;
sv_catpvn(frozen_patricia, (char*)frozen_nodes, n*sizeof(struct frozen_node));
free(frozen_nodes);
void
STORABLE_thaw(tobj, cloning, serialized, ...)
SV * tobj
SV * cloning
SV * serialized;
PREINIT:
struct frozen_patricia *frozen_patricia;
struct frozen_node *frozen_node;
struct _patricia_tree_t *tree;
patricia_node_t *node = NULL, *child, **fixup;
int n, n_calculated, i, d_index, l_index, r_index;
STRLEN len;
PPCODE:
if (SvTRUE(cloning))
XSRETURN_UNDEF;
tree = calloc(1, sizeof(*tree));
frozen_patricia = (struct frozen_patricia*)SvPV(serialized, len);
if (ntohl(frozen_patricia->header.magic) != FROZEN_MAGIC)
croak("Net::Patricia::STORABLE_thaw: magic mismatch");
if (frozen_patricia->header.major != FROZEN_MAJOR)
croak("Net::Patricia::STORABLE_thaw: major mismatch");
if (frozen_patricia->header.minor != FROZEN_MINOR)
croak("Net::Patricia::STORABLE_thaw: minor mismatch");
tree->maxbits = ntohs(frozen_patricia->header.maxbits);
tree->num_active_node = ntohl(frozen_patricia->header.num_active_node);
tree->head = NULL;
n = ntohl(frozen_patricia->header.num_total_node);
n_calculated = (len - sizeof(frozen_patricia->header)) / sizeof(struct frozen_node);
if (n_calculated < n)
croak("Net::Patricia::STORABLE_thaw: size mismatch");
fixup = calloc(n, sizeof(patricia_node_t *));
for (i = 0; i < n; i++) {
node = calloc(1, sizeof(*node));
memset(node, 0, sizeof(*node));
frozen_node = &frozen_patricia->node[i];
node->bit = ntohs(frozen_node->bitlen) & ~0x8000;
d_index = ntohl(frozen_node->d_index);
if (d_index >= 0)
node->data = newSVsv(SvRV(ST(3+d_index)));
if (ntohs(frozen_node->bitlen) & 0x8000) {
node->prefix = calloc(1, sizeof(*node->prefix));
node->prefix->bitlen = node->bit;
node->prefix->family = ntohs(frozen_node->family);
#ifndef HAVE_IPV6
if (tree->maxbits > 32)
croak("Net::Patricia::STORABLE_thaw: IPv6 is not supported by Net::Patricia on this machine");
#endif
if (tree->maxbits == 32) {
memcpy(&node->prefix->add, &frozen_node->address, 4);
} else
memcpy(&node->prefix->add, &frozen_node->address, 16);
node->prefix->ref_count = 1;
}
fixup[i] = node;
}
/* Fix pointers up. */
if (n)
tree->head = fixup[0];
for (i = 0; i < n; i++) {
frozen_node = &frozen_patricia->node[i];
node = fixup[i];
l_index = ntohl(frozen_node->l_index);
if (l_index >= 0) {
child = fixup[l_index];
child->parent = node;
node->l = child;
}
r_index = ntohl(frozen_node->r_index);
if (r_index >= 0) {
child = fixup[r_index];
child->parent = node;
node->r = child;
}
}
free(fixup);
sv_setiv((SV*)SvRV(tobj), PTR2IV(tree));
XSRETURN_EMPTY;
void
DESTROY(tree)
Net::Patricia tree
CODE:
Destroy_Patricia(tree, deref_data);
|