Home
last modified time | relevance | path

Searched refs:old (Results 1 – 3 of 3) sorted by relevance

/lib/
Dprio_tree.c144 struct prio_tree_node *old, struct prio_tree_node *node) in prio_tree_replace() argument
148 if (prio_tree_root(old)) { in prio_tree_replace()
149 BUG_ON(root->prio_tree_node != old); in prio_tree_replace()
157 node->parent = old->parent; in prio_tree_replace()
158 if (old->parent->left == old) in prio_tree_replace()
159 old->parent->left = node; in prio_tree_replace()
161 old->parent->right = node; in prio_tree_replace()
164 if (!prio_tree_left_empty(old)) { in prio_tree_replace()
165 node->left = old->left; in prio_tree_replace()
166 old->left->parent = node; in prio_tree_replace()
[all …]
Drbtree.c235 struct rb_node *old = node, *left; in rb_erase() local
246 if (parent == old) { in rb_erase()
252 node->rb_parent_color = old->rb_parent_color; in rb_erase()
253 node->rb_right = old->rb_right; in rb_erase()
254 node->rb_left = old->rb_left; in rb_erase()
256 if (rb_parent(old)) in rb_erase()
258 if (rb_parent(old)->rb_left == old) in rb_erase()
259 rb_parent(old)->rb_left = node; in rb_erase()
261 rb_parent(old)->rb_right = node; in rb_erase()
265 rb_set_parent(old->rb_left, node); in rb_erase()
[all …]
Dbitmap.c641 const unsigned long *old, const unsigned long *new, in bitmap_remap() argument
654 int n = bitmap_pos_to_ord(old, oldbit, bits); in bitmap_remap()
689 int bitmap_bitremap(int oldbit, const unsigned long *old, in bitmap_bitremap() argument
693 int n = bitmap_pos_to_ord(old, oldbit, bits); in bitmap_bitremap()