- node = rcu_rbtree_search(rbtree_root, key[2], tree_comp);
- assert(node);
- rcu_rbtree_remove(&rbtree_root, node, tree_comp, rbtree_alloc,
- rbtree_free);
- defer_rcu((void (*)(void *))rbtree_free, node);
-
- node = rcu_rbtree_search(rbtree_root, key[1], tree_comp);
- assert(node);
- rcu_rbtree_remove(&rbtree_root, node, tree_comp, rbtree_alloc,
- rbtree_free);
- defer_rcu((void (*)(void *))rbtree_free, node);
-
- node = rcu_rbtree_search(rbtree_root, key[0], tree_comp);
- assert(node);
- rcu_rbtree_remove(&rbtree_root, node, tree_comp, rbtree_alloc,
- rbtree_free);
- defer_rcu((void (*)(void *))rbtree_free, node);
+ for (i = 0; i < NR_RAND; i++) {
+ node = rcu_rbtree_search(rbtree_root, key[i],
+ tree_comp);
+ assert(node != &rcu_rbtree_nil);
+ rcu_rbtree_remove(&rbtree_root, node, tree_comp,
+ rbtree_alloc, rbtree_free);
+ defer_rcu((void (*)(void *))rbtree_free, node);
+ }