Loading net/ipv4/fib_trie.c +387 −385 Original line number Diff line number Diff line Loading @@ -314,6 +314,7 @@ static void fn_free_alias(struct fib_alias *fa) The bits from (n->pos) to (n->pos + n->bits - 1) - "C" - are the index into n's child array, and will of course be different for each child. The rest of the bits, from (n->pos + n->bits) onward, are completely unknown at this point. Loading Loading @@ -395,6 +396,7 @@ static struct tnode* tnode_new(t_key key, int pos, int bits) tn->full_children = 0; tn->empty_children = 1<<bits; } if (trie_debug > 0) printk("AT %p s=%u %u\n", tn, (unsigned int) sizeof(struct tnode), (unsigned int) (sizeof(struct node) * 1<<bits)); Loading Loading @@ -896,7 +898,6 @@ static struct leaf_info *find_leaf_info(struct hlist_head *head, int plen) struct leaf_info *li; hlist_for_each_entry(li, node, head, hlist) { if (li->plen == plen) return li; } Loading Loading @@ -1759,6 +1760,7 @@ static struct leaf *nextleaf(struct trie *t, struct leaf *thisleaf) } else p = (struct tnode *) NODE_PARENT(c); while (p) { int pos, last; Loading net/ipv4/af_inet.c +1 −1 File changed.Contains only whitespace changes. Show changes Loading
net/ipv4/fib_trie.c +387 −385 Original line number Diff line number Diff line Loading @@ -314,6 +314,7 @@ static void fn_free_alias(struct fib_alias *fa) The bits from (n->pos) to (n->pos + n->bits - 1) - "C" - are the index into n's child array, and will of course be different for each child. The rest of the bits, from (n->pos + n->bits) onward, are completely unknown at this point. Loading Loading @@ -395,6 +396,7 @@ static struct tnode* tnode_new(t_key key, int pos, int bits) tn->full_children = 0; tn->empty_children = 1<<bits; } if (trie_debug > 0) printk("AT %p s=%u %u\n", tn, (unsigned int) sizeof(struct tnode), (unsigned int) (sizeof(struct node) * 1<<bits)); Loading Loading @@ -896,7 +898,6 @@ static struct leaf_info *find_leaf_info(struct hlist_head *head, int plen) struct leaf_info *li; hlist_for_each_entry(li, node, head, hlist) { if (li->plen == plen) return li; } Loading Loading @@ -1759,6 +1760,7 @@ static struct leaf *nextleaf(struct trie *t, struct leaf *thisleaf) } else p = (struct tnode *) NODE_PARENT(c); while (p) { int pos, last; Loading