24 static lv_rb_node_t * rb_create_node(lv_rb_t * tree);
25 static lv_rb_node_t * rb_find_leaf_parent(lv_rb_t * tree, lv_rb_node_t * node);
26 static void rb_right_rotate(lv_rb_t * tree, lv_rb_node_t * node);
27 static void rb_left_rotate(lv_rb_t * tree, lv_rb_node_t * node);
28 static void rb_insert_color(lv_rb_t * tree, lv_rb_node_t * node);
29 static void rb_delete_color(lv_rb_t * tree, lv_rb_node_t * node1, lv_rb_node_t * node2);
66 lv_rb_node_t * lv_rb_insert(lv_rb_t * tree, void * key)  in lv_rb_insert()
73     lv_rb_node_t * node = lv_rb_find(tree, key);  in lv_rb_insert()
89     lv_rb_node_t * parent = rb_find_leaf_parent(tree, node);  in lv_rb_insert()
103 lv_rb_node_t * lv_rb_find(lv_rb_t * tree, const void * key)  in lv_rb_find()
110     lv_rb_node_t * current = tree->root;  in lv_rb_find()
129 void * lv_rb_remove_node(lv_rb_t * tree, lv_rb_node_t * node)  in lv_rb_remove_node()
131     lv_rb_node_t * child = NULL;  in lv_rb_remove_node()
132     lv_rb_node_t * parent = NULL;  in lv_rb_remove_node()
136         lv_rb_node_t * replace = node;  in lv_rb_remove_node()
217     lv_rb_node_t * node = lv_rb_find(tree, key);  in lv_rb_remove()
227 bool lv_rb_drop_node(lv_rb_t * tree, lv_rb_node_t * node)  in lv_rb_drop_node()
265     lv_rb_node_t * node = tree->root;  in lv_rb_destroy()
266     lv_rb_node_t * parent = NULL;  in lv_rb_destroy()
293 lv_rb_node_t * lv_rb_minimum(lv_rb_t * tree)  in lv_rb_minimum()
302 lv_rb_node_t * lv_rb_maximum(lv_rb_t * tree)  in lv_rb_maximum()
311 lv_rb_node_t * lv_rb_minimum_from(lv_rb_node_t * node)  in lv_rb_minimum_from()
320 lv_rb_node_t * lv_rb_maximum_from(lv_rb_node_t * node)  in lv_rb_maximum_from()
333 static lv_rb_node_t * rb_create_node(lv_rb_t * tree)  in rb_create_node()
335     lv_rb_node_t * node = lv_malloc_zeroed(sizeof(lv_rb_node_t));  in rb_create_node()
355 static lv_rb_node_t * rb_find_leaf_parent(lv_rb_t * tree, lv_rb_node_t * node)  in rb_find_leaf_parent()
357     lv_rb_node_t * current = tree->root;  in rb_find_leaf_parent()
358     lv_rb_node_t * parent = current;  in rb_find_leaf_parent()
374 static void rb_right_rotate(lv_rb_t * tree, lv_rb_node_t * node)  in rb_right_rotate()
376     lv_rb_node_t * left = node->left;  in rb_right_rotate()
399 static void rb_left_rotate(lv_rb_t * tree, lv_rb_node_t * node)  in rb_left_rotate()
401     lv_rb_node_t * right = node->right;  in rb_left_rotate()
424 static void rb_insert_color(lv_rb_t * tree, lv_rb_node_t * node)  in rb_insert_color()
426     lv_rb_node_t * parent = NULL;  in rb_insert_color()
427     lv_rb_node_t * gparent = NULL;  in rb_insert_color()
434                 lv_rb_node_t * uncle = gparent->right;  in rb_insert_color()
445                 lv_rb_node_t * tmp;  in rb_insert_color()
458                 lv_rb_node_t * uncle = gparent->left;  in rb_insert_color()
469                 lv_rb_node_t * tmp;  in rb_insert_color()
485 static void rb_delete_color(lv_rb_t * tree, lv_rb_node_t * node1, lv_rb_node_t * node2)  in rb_delete_color()
494             lv_rb_node_t * pNode2 = node2->right;  in rb_delete_color()
524             lv_rb_node_t * pNode2 = node2->left;  in rb_delete_color()