Skip to content

Commit

Permalink
---
Browse files Browse the repository at this point in the history
yaml
---
r: 78775
b: refs/heads/master
c: 93e4308
h: refs/heads/master
i:
  78773: daf1c3d
  78771: 9611c8d
  78767: 004e49d
v: v3
  • Loading branch information
Stephen Hemminger authored and David S. Miller committed Jan 28, 2008
1 parent 35a81d0 commit 2c5aac9
Show file tree
Hide file tree
Showing 2 changed files with 5 additions and 11 deletions.
2 changes: 1 addition & 1 deletion [refs]
Original file line number Diff line number Diff line change
@@ -1,2 +1,2 @@
---
refs/heads/master: c28a1cf448e59019fa681741963c3acaeaeb6d27
refs/heads/master: 93e4308b3bea445dc2d3e3c1897a93fe111eba17
14 changes: 4 additions & 10 deletions trunk/net/ipv4/fib_trie.c
Original file line number Diff line number Diff line change
Expand Up @@ -153,7 +153,6 @@ struct trie {
struct trie_use_stats stats;
#endif
int size;
unsigned int revision;
};

static void put_child(struct trie *t, struct tnode *tn, int i, struct node *n);
Expand Down Expand Up @@ -1046,7 +1045,7 @@ fib_insert_node(struct trie *t, int *err, u32 key, int plen)

if (!li) {
*err = -ENOMEM;
goto err;
goto done;
}

fa_head = &li->falh;
Expand All @@ -1058,7 +1057,7 @@ fib_insert_node(struct trie *t, int *err, u32 key, int plen)

if (!l) {
*err = -ENOMEM;
goto err;
goto done;
}

l->key = key;
Expand All @@ -1067,7 +1066,7 @@ fib_insert_node(struct trie *t, int *err, u32 key, int plen)
if (!li) {
tnode_free((struct tnode *) l);
*err = -ENOMEM;
goto err;
goto done;
}

fa_head = &li->falh;
Expand Down Expand Up @@ -1104,7 +1103,7 @@ fib_insert_node(struct trie *t, int *err, u32 key, int plen)
free_leaf_info(li);
tnode_free((struct tnode *) l);
*err = -ENOMEM;
goto err;
goto done;
}

node_set_parent((struct node *)tn, tp);
Expand All @@ -1130,8 +1129,6 @@ fib_insert_node(struct trie *t, int *err, u32 key, int plen)

rcu_assign_pointer(t->trie, trie_rebalance(t, tp));
done:
t->revision++;
err:
return fa_head;
}

Expand Down Expand Up @@ -1546,7 +1543,6 @@ static int trie_leaf_remove(struct trie *t, t_key key)
* Remove the leaf and rebalance the tree
*/

t->revision++;
t->size--;

tp = node_parent(n);
Expand Down Expand Up @@ -1752,8 +1748,6 @@ static int fn_trie_flush(struct fib_table *tb)
struct leaf *ll = NULL, *l = NULL;
int found = 0, h;

t->revision++;

for (h = 0; (l = nextleaf(t, l)) != NULL; h++) {
found += trie_flush_leaf(t, l);

Expand Down

0 comments on commit 2c5aac9

Please sign in to comment.