Lines Matching refs:tmp
23 … struct k_rbtree_node_t *parent = (struct k_rbtree_node_t *)node->rbt_parent_color, *gparent, *tmp; in rbtree_insert() local
35 tmp = gparent->rbt_right; in rbtree_insert()
36 if (parent != tmp) { in rbtree_insert()
37 if (tmp && K_RBTREE_IS_RED(tmp)) { in rbtree_insert()
38 rbtree_set_parent_color(tmp, gparent, K_RBTREE_BLACK); in rbtree_insert()
46 tmp = parent->rbt_right; in rbtree_insert()
47 if (node == tmp) { in rbtree_insert()
48 parent->rbt_right = tmp = node->rbt_left; in rbtree_insert()
50 if (tmp){ in rbtree_insert()
51 rbtree_set_parent_color(tmp, parent, in rbtree_insert()
57 tmp = node->rbt_right; in rbtree_insert()
60 gparent->rbt_left = tmp; in rbtree_insert()
62 if (tmp){ in rbtree_insert()
63 rbtree_set_parent_color(tmp, gparent, K_RBTREE_BLACK); in rbtree_insert()
69 tmp = gparent->rbt_left; in rbtree_insert()
70 if (tmp && K_RBTREE_IS_RED(tmp)) { in rbtree_insert()
71 rbtree_set_parent_color(tmp, gparent, K_RBTREE_BLACK); in rbtree_insert()
79 tmp = parent->rbt_left; in rbtree_insert()
80 if (node == tmp) { in rbtree_insert()
81 parent->rbt_left = tmp = node->rbt_right; in rbtree_insert()
83 if (tmp){ in rbtree_insert()
84 rbtree_set_parent_color(tmp, parent, in rbtree_insert()
90 tmp = node->rbt_left; in rbtree_insert()
93 gparent->rbt_right = tmp; in rbtree_insert()
95 if (tmp){ in rbtree_insert()
96 rbtree_set_parent_color(tmp, gparent, K_RBTREE_BLACK); in rbtree_insert()