diff options
| -rw-r--r-- | lib/radix-tree.c | 6 |
1 files changed, 4 insertions, 2 deletions
diff --git a/lib/radix-tree.c b/lib/radix-tree.c index e907858498a6..1014171dd1c5 100644 --- a/lib/radix-tree.c +++ b/lib/radix-tree.c | |||
| @@ -174,14 +174,16 @@ static void radix_tree_node_rcu_free(struct rcu_head *head) | |||
| 174 | { | 174 | { |
| 175 | struct radix_tree_node *node = | 175 | struct radix_tree_node *node = |
| 176 | container_of(head, struct radix_tree_node, rcu_head); | 176 | container_of(head, struct radix_tree_node, rcu_head); |
| 177 | int i; | ||
| 177 | 178 | ||
| 178 | /* | 179 | /* |
| 179 | * must only free zeroed nodes into the slab. radix_tree_shrink | 180 | * must only free zeroed nodes into the slab. radix_tree_shrink |
| 180 | * can leave us with a non-NULL entry in the first slot, so clear | 181 | * can leave us with a non-NULL entry in the first slot, so clear |
| 181 | * that here to make sure. | 182 | * that here to make sure. |
| 182 | */ | 183 | */ |
| 183 | tag_clear(node, 0, 0); | 184 | for (i = 0; i < RADIX_TREE_MAX_TAGS; i++) |
| 184 | tag_clear(node, 1, 0); | 185 | tag_clear(node, i, 0); |
| 186 | |||
| 185 | node->slots[0] = NULL; | 187 | node->slots[0] = NULL; |
| 186 | node->count = 0; | 188 | node->count = 0; |
| 187 | 189 | ||
