Lines Matching refs:node
264 struct rb_node **node = &root->rb_node; in tree_search_for_insert() local
268 while (*node) { in tree_search_for_insert()
269 prev = *node; in tree_search_for_insert()
273 node = &(*node)->rb_left; in tree_search_for_insert()
275 node = &(*node)->rb_right; in tree_search_for_insert()
281 *node_ret = node; in tree_search_for_insert()
310 struct rb_node **node = &root->rb_node; in tree_search_prev_next() local
317 while (*node) { in tree_search_prev_next()
318 entry = rb_entry(*node, struct extent_state, rb_node); in tree_search_prev_next()
321 node = &(*node)->rb_left; in tree_search_prev_next()
323 node = &(*node)->rb_right; in tree_search_prev_next()
444 struct rb_node **node; in insert_state() local
452 node = &tree->state.rb_node; in insert_state()
453 while (*node) { in insert_state()
456 parent = *node; in insert_state()
471 node = &(*node)->rb_left; in insert_state()
484 node = &(*node)->rb_right; in insert_state()
490 rb_link_node(&state->rb_node, parent, node); in insert_state()
500 struct extent_state *state, struct rb_node **node, in insert_state_fast() argument
505 rb_link_node(&state->rb_node, parent, node); in insert_state_fast()
528 struct rb_node **node; in split_state() local
540 node = &parent; in split_state()
541 while (*node) { in split_state()
544 parent = *node; in split_state()
548 node = &(*node)->rb_left; in split_state()
550 node = &(*node)->rb_right; in split_state()
557 rb_link_node(&prealloc->rb_node, parent, node); in split_state()