|
@@ -447,7 +447,6 @@ static void tnode_put_child_reorg(struct tnode *tn, int i, struct node *n,
|
|
|
|
|
|
BUG_ON(i >= 1<<tn->bits);
|
|
|
|
|
|
-
|
|
|
/* update emptyChildren */
|
|
|
if (n == NULL && chi != NULL)
|
|
|
tn->empty_children++;
|
|
@@ -1306,7 +1305,6 @@ err:
|
|
|
return err;
|
|
|
}
|
|
|
|
|
|
-
|
|
|
/* should be called with rcu_read_lock */
|
|
|
static int check_leaf(struct trie *t, struct leaf *l,
|
|
|
t_key key, const struct flowi *flp,
|
|
@@ -1721,7 +1719,6 @@ static struct leaf *leaf_walk_rcu(struct tnode *p, struct node *c)
|
|
|
return NULL; /* Root of trie */
|
|
|
}
|
|
|
|
|
|
-
|
|
|
static struct leaf *trie_firstleaf(struct trie *t)
|
|
|
{
|
|
|
struct tnode *n = (struct tnode *) rcu_dereference(t->trie);
|
|
@@ -1849,7 +1846,6 @@ static int fn_trie_dump_fa(t_key key, int plen, struct list_head *fah,
|
|
|
{
|
|
|
int i, s_i;
|
|
|
struct fib_alias *fa;
|
|
|
-
|
|
|
__be32 xkey = htonl(key);
|
|
|
|
|
|
s_i = cb->args[4];
|
|
@@ -1882,7 +1878,6 @@ static int fn_trie_dump_fa(t_key key, int plen, struct list_head *fah,
|
|
|
return skb->len;
|
|
|
}
|
|
|
|
|
|
-
|
|
|
static int fn_trie_dump_leaf(struct leaf *l, struct fib_table *tb,
|
|
|
struct sk_buff *skb, struct netlink_callback *cb)
|
|
|
{
|
|
@@ -2388,7 +2383,6 @@ static int fib_trie_seq_show(struct seq_file *seq, void *v)
|
|
|
struct leaf *l = (struct leaf *) n;
|
|
|
struct leaf_info *li;
|
|
|
struct hlist_node *node;
|
|
|
-
|
|
|
__be32 val = htonl(l->key);
|
|
|
|
|
|
seq_indent(seq, iter->depth);
|