59     tree->root = NULL;  in lv_rb_init()
79         if(tree->root == NULL) {  in lv_rb_insert()
80             tree->root = node;  in lv_rb_insert()
110     lv_rb_node_t * current = tree->root;  in lv_rb_find()
148             tree->root = replace;  in lv_rb_remove_node()
198         tree->root = child;  in lv_rb_remove_node()
265     lv_rb_node_t * node = tree->root;  in lv_rb_destroy()
290     tree->root = NULL;  in lv_rb_destroy()
299     return lv_rb_minimum_from(tree->root);  in lv_rb_minimum()
308     return lv_rb_maximum_from(tree->root);  in lv_rb_maximum()
357     lv_rb_node_t * current = tree->root;  in rb_find_leaf_parent()
386         tree->root = left;  in rb_right_rotate()
411         tree->root = right;  in rb_left_rotate()
482     tree->root->color = LV_RB_COLOR_BLACK;  in rb_insert_color()
492     while((node1 == NULL || node1->color == LV_RB_COLOR_BLACK) && node1 != tree->root) {  in rb_delete_color()
519                 node1 = tree->root;  in rb_delete_color()
549                 node1 = tree->root;  in rb_delete_color()