Revision ae80a2de nest/rt-fib.c
nest/rt-fib.c | ||
---|---|---|
206 | 206 |
void * |
207 | 207 |
fib_get(struct fib *f, ip_addr *a, int len) |
208 | 208 |
{ |
209 |
unsigned int h = ipa_hash(*a);
|
|
209 |
uint h = ipa_hash(*a); |
|
210 | 210 |
struct fib_node **ee = f->hash_table + (h >> f->hash_shift); |
211 | 211 |
struct fib_node *g, *e = *ee; |
212 | 212 |
u32 uid = h << 16; |
... | ... | |
321 | 321 |
fib_delete(struct fib *f, void *E) |
322 | 322 |
{ |
323 | 323 |
struct fib_node *e = E; |
324 |
unsigned int h = fib_hash(f, &e->prefix);
|
|
324 |
uint h = fib_hash(f, &e->prefix); |
|
325 | 325 |
struct fib_node **ee = f->hash_table + h; |
326 | 326 |
struct fib_iterator *it; |
327 | 327 |
|
... | ... | |
442 | 442 |
void |
443 | 443 |
fib_check(struct fib *f) |
444 | 444 |
{ |
445 |
unsigned int i, ec, lo, nulls;
|
|
445 |
uint i, ec, lo, nulls; |
|
446 | 446 |
|
447 | 447 |
ec = 0; |
448 | 448 |
for(i=0; i<f->hash_size; i++) |
... | ... | |
452 | 452 |
for(n=f->hash_table[i]; n; n=n->next) |
453 | 453 |
{ |
454 | 454 |
struct fib_iterator *j, *j0; |
455 |
unsigned int h0 = ipa_hash(n->prefix);
|
|
455 |
uint h0 = ipa_hash(n->prefix); |
|
456 | 456 |
if (h0 < lo) |
457 | 457 |
bug("fib_check: discord in hash chains"); |
458 | 458 |
lo = h0; |
... | ... | |
489 | 489 |
|
490 | 490 |
void dump(char *m) |
491 | 491 |
{ |
492 |
unsigned int i;
|
|
492 |
uint i; |
|
493 | 493 |
|
494 | 494 |
debug("%s ... order=%d, size=%d, entries=%d\n", m, f.hash_order, f.hash_size, f.hash_size); |
495 | 495 |
for(i=0; i<f.hash_size; i++) |
Also available in: Unified diff