Searched refs:victim (Results 1 – 2 of 2) sorted by relevance
| /lib/ |
| D | rbtree.c | 553 void rb_replace_node(struct rb_node *victim, struct rb_node *new, in rb_replace_node() argument
556 struct rb_node *parent = rb_parent(victim); in rb_replace_node()
559 *new = *victim; in rb_replace_node()
562 if (victim->rb_left) in rb_replace_node()
563 rb_set_parent(victim->rb_left, new); in rb_replace_node()
564 if (victim->rb_right) in rb_replace_node()
565 rb_set_parent(victim->rb_right, new); in rb_replace_node()
566 __rb_change_child(victim, new, parent, root); in rb_replace_node()
570 void rb_replace_node_rcu(struct rb_node *victim, struct rb_node *new, in rb_replace_node_rcu() argument
573 struct rb_node *parent = rb_parent(victim); in rb_replace_node_rcu()
[all …]
|
| D | btree.c | 639 int btree_merge(struct btree_head *target, struct btree_head *victim, in btree_merge() argument
647 BUG_ON(target == victim); in btree_merge()
651 target->node = victim->node; in btree_merge()
652 target->height = victim->height; in btree_merge()
653 __btree_init(victim); in btree_merge()
661 if (!btree_last(victim, geo, key)) in btree_merge()
663 val = btree_lookup(victim, geo, key); in btree_merge()
670 btree_remove(victim, geo, dup); in btree_merge()
|