Searched refs:node2 (Results 1 – 3 of 3) sorted by relevance
29 static void rb_delete_color(lv_rb_t * tree, lv_rb_node_t * node1, lv_rb_node_t * node2);485 static void rb_delete_color(lv_rb_t * tree, lv_rb_node_t * node1, lv_rb_node_t * node2) in rb_delete_color() argument493 if(node2->left == node1) { in rb_delete_color()494 lv_rb_node_t * pNode2 = node2->right; in rb_delete_color()497 node2->color = LV_RB_COLOR_RED; in rb_delete_color()498 rb_left_rotate(tree, node2); in rb_delete_color()499 pNode2 = node2->right; in rb_delete_color()505 node1 = node2; in rb_delete_color()506 node2 = node2->parent; in rb_delete_color()513 pNode2 = node2->right; in rb_delete_color()[all …]
110 lv_test_node_t * node2 = lv_test_create(node); in testWalkTree() local111 node2->data1 = 3; in testWalkTree()119 lv_test_node_t * node21 = lv_test_create(node2); in testWalkTree()187 lv_test_node_t * node2 = lv_test_create(node); in testTreeSearch() local188 node2->data1 = 3; in testTreeSearch()
46 lv_svg_node_t * node2 = lv_svg_node_create(node1); in testNodeTree() local59 lv_svg_node_delete(node2); in testNodeTree()
