Searched refs:node1 (Results 1 – 3 of 3) sorted by relevance
108 lv_test_node_t * node1 = lv_test_create(node); in testWalkTree() local109 node1->data1 = 2; in testWalkTree()113 lv_test_node_t * node11 = lv_test_create(node1); in testWalkTree()116 lv_test_node_t * node12 = lv_test_create(node1); in testWalkTree()185 lv_test_node_t * node1 = lv_test_create(node); in testTreeSearch() local186 node1->data1 = 2; in testTreeSearch()190 lv_test_node_t * node11 = lv_test_create(node1); in testTreeSearch()
45 lv_svg_node_t * node1 = lv_svg_node_create(root); in testNodeTree() local46 lv_svg_node_t * node2 = lv_svg_node_create(node1); in testNodeTree()
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() argument492 while((node1 == NULL || node1->color == LV_RB_COLOR_BLACK) && node1 != tree->root) { in rb_delete_color()493 if(node2->left == node1) { in rb_delete_color()505 node1 = node2; in rb_delete_color()519 node1 = tree->root; in rb_delete_color()535 node1 = node2; in rb_delete_color()549 node1 = tree->root; in rb_delete_color()554 if(node1 != NULL) in rb_delete_color()555 node1->color = LV_RB_COLOR_BLACK; in rb_delete_color()
