Home
last modified time | relevance | path

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

/qemu/util/
H A Dinterval-tree.c138 node->rb_left = node->rb_right = NULL; in rb_link_node()
158 while (node->rb_left) { in rb_next()
159 node = node->rb_left; in rb_next()
183 } else if (parent->rb_left == old) { in rb_change_child()
184 qatomic_set(&parent->rb_left, new); in rb_change_child()
268 tmp = node->rb_left; in rb_insert_augmented()
270 qatomic_set(&node->rb_left, parent); in rb_insert_augmented()
290 qatomic_set(&gparent->rb_left, tmp); /* == parent->rb_right */ in rb_insert_augmented()
299 tmp = gparent->rb_left; in rb_insert_augmented()
310 tmp = parent->rb_left; in rb_insert_augmented()
[all …]
H A Dselfmap.c97 free_rbnode(n->rb_left); in free_rbnode()
/qemu/include/qemu/
H A Dinterval-tree.h21 struct RBNode *rb_left; member