Lines Matching refs:new
35 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; in insert() local
38 while (*new) { in insert()
39 parent = *new; in insert()
41 new = &parent->rb_left; in insert()
43 new = &parent->rb_right; in insert()
46 rb_link_node(&node->rb, parent, new); in insert()
52 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; in insert_cached() local
56 while (*new) { in insert_cached()
57 parent = *new; in insert_cached()
59 new = &parent->rb_left; in insert_cached()
61 new = &parent->rb_right; in insert_cached()
66 rb_link_node(&node->rb, parent, new); in insert_cached()
89 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in RB_DECLARE_CALLBACKS_MAX() local
94 while (*new) { in RB_DECLARE_CALLBACKS_MAX()
95 rb_parent = *new; in RB_DECLARE_CALLBACKS_MAX()
100 new = &parent->rb.rb_left; in RB_DECLARE_CALLBACKS_MAX()
102 new = &parent->rb.rb_right; in RB_DECLARE_CALLBACKS_MAX()
106 rb_link_node(&node->rb, rb_parent, new); in RB_DECLARE_CALLBACKS_MAX()
113 struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; in insert_augmented_cached() local
119 while (*new) { in insert_augmented_cached()
120 rb_parent = *new; in insert_augmented_cached()
125 new = &parent->rb.rb_left; in insert_augmented_cached()
127 new = &parent->rb.rb_right; in insert_augmented_cached()
133 rb_link_node(&node->rb, rb_parent, new); in insert_augmented_cached()