Home
last modified time | relevance | path

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

/external/blktrace/
Drbtree.c30 if ((node->rb_right = right->rb_left)) in __rb_rotate_left()
31 rb_set_parent(right->rb_left, node); in __rb_rotate_left()
32 right->rb_left = node; in __rb_rotate_left()
38 if (node == parent->rb_left) in __rb_rotate_left()
39 parent->rb_left = right; in __rb_rotate_left()
50 struct rb_node *left = node->rb_left; in __rb_rotate_right()
53 if ((node->rb_left = left->rb_right)) in __rb_rotate_right()
64 parent->rb_left = left; in __rb_rotate_right()
79 if (parent == gparent->rb_left) in rb_insert_color()
107 register struct rb_node *uncle = gparent->rb_left; in rb_insert_color()
[all …]
Drbtree.h105 struct rb_node *rb_left; member
160 node->rb_left = node->rb_right = NULL; in rb_link_node()
Dblkparse.c809 p = &(*p)->rb_left; in trace_rb_insert()
813 p = &(*p)->rb_left; in trace_rb_insert()
817 p = &(*p)->rb_left; in trace_rb_insert()
868 n = n->rb_left; in trace_rb_find()
872 n = n->rb_left; in trace_rb_find()
921 p = &(*p)->rb_left; in track_rb_insert()
947 n = n->rb_left; in __find_track()
Dblkiomon.c187 p = &(*p)->rb_left; in blkiomon_find_dstat()
/external/e2fsprogs/lib/ext2fs/
Drbtree.c30 if ((node->rb_right = right->rb_left)) in __rb_rotate_left()
31 ext2fs_rb_set_parent(right->rb_left, node); in __rb_rotate_left()
32 right->rb_left = node; in __rb_rotate_left()
38 if (node == parent->rb_left) in __rb_rotate_left()
39 parent->rb_left = right; in __rb_rotate_left()
50 struct rb_node *left = node->rb_left; in __rb_rotate_right()
53 if ((node->rb_left = left->rb_right)) in __rb_rotate_right()
64 parent->rb_left = left; in __rb_rotate_right()
79 if (parent == gparent->rb_left) in ext2fs_rb_insert_color()
107 register struct rb_node *uncle = gparent->rb_left; in ext2fs_rb_insert_color()
[all …]
Drbtree.h117 struct rb_node *rb_left; member
187 node->rb_left = node->rb_right = NULL; in ext2fs_rb_link_node()
Dblkmap64_rb.c372 n = &(*n)->rb_left; in rb_test_bit()
411 n = &(*n)->rb_left; in rb_insert_extent()
502 n = &(*n)->rb_left; in rb_remove_extent()
656 n = &(*n)->rb_left; in rb_test_clear_bmap_extent()
753 n = &(*n)->rb_left; in rb_get_bmap_range()
833 n = &(*n)->rb_left; in rb_find_first_zero()
870 n = &(*n)->rb_left; in rb_find_first_set()
/external/fio/lib/
Drbtree.c30 if ((node->rb_right = right->rb_left)) in __rb_rotate_left()
31 rb_set_parent(right->rb_left, node); in __rb_rotate_left()
32 right->rb_left = node; in __rb_rotate_left()
38 if (node == parent->rb_left) in __rb_rotate_left()
39 parent->rb_left = right; in __rb_rotate_left()
50 struct rb_node *left = node->rb_left; in __rb_rotate_right()
53 if ((node->rb_left = left->rb_right)) in __rb_rotate_right()
64 parent->rb_left = left; in __rb_rotate_right()
79 if (parent == gparent->rb_left) in rb_insert_color()
107 register struct rb_node *uncle = gparent->rb_left; in rb_insert_color()
[all …]
Drbtree.h106 struct rb_node *rb_left; member
150 node->rb_left = node->rb_right = NULL; in rb_link_node()
/external/blktrace/btt/
Dproc.c40 __foreach(n->rb_left, f, arg); in __foreach()
51 __destroy(n->rb_left, free_name, free_pip); in __destroy()
73 n = n->rb_left; in __find_process_pid()
93 n = n->rb_left; in __find_process_name()
114 p = &(*p)->rb_left; in insert_pid()
142 p = &(*p)->rb_left; in insert_name()
Dseek.c72 p = &(*p)->rb_left; in __insert()
94 __destroy(n->rb_left); in __destroy()
149 if (n->rb_left && __median(n->rb_left, sofar, target, rvp)) in __median()
163 if (n->rb_left) in __mode()
164 __mode(n->rb_left, mp); in __mode()
Ddip_rb.c37 p = &(*p)->rb_left; in rb_insert()
57 n = n->rb_left; in rb_find_sec()
82 rb_foreach(n->rb_left, iop, fnc, head); in rb_foreach()
Ddevs.c39 __destroy(n->rb_left); in __destroy()
/external/fio/os/
Dos-netbsd.h17 #undef rb_left
/external/fio/t/
Ddedupe.c209 p = &(*p)->rb_left; in insert_chunk()
/external/fio/
Diolog.c265 p = &(*p)->rb_left; in log_io_piece()
269 p = &(*p)->rb_left; in log_io_piece()