Lines Matching defs:rb_node
15 return !RB_EMPTY_NODE(&state->rb_node);
93 struct rb_node rb_node;
118 struct rb_node *node;
122 state = rb_entry(node, struct extent_state, rb_node);
123 rb_erase(&state->rb_node, &tree->state);
124 RB_CLEAR_NODE(&state->rb_node);
150 RB_CLEAR_NODE(&state->rb_node);
198 struct rb_node *next = rb_next(&state->rb_node);
201 return rb_entry(next, struct extent_state, rb_node);
208 struct rb_node *next = rb_prev(&state->rb_node);
211 return rb_entry(next, struct extent_state, rb_node);
235 struct rb_node ***node_ret,
236 struct rb_node **parent_ret)
239 struct rb_node **node = &root->rb_node;
240 struct rb_node *prev = NULL;
245 entry = rb_entry(prev, struct extent_state, rb_node);
285 struct rb_node **node = &root->rb_node;
293 entry = rb_entry(*node, struct extent_state, rb_node);
352 rb_erase(&other->rb_node, &tree->state);
353 RB_CLEAR_NODE(&other->rb_node);
362 rb_erase(&other->rb_node, &tree->state);
363 RB_CLEAR_NODE(&other->rb_node);
397 struct rb_node **node;
398 struct rb_node *parent = NULL;
403 node = &tree->state.rb_node;
408 entry = rb_entry(parent, struct extent_state, rb_node);
422 rb_link_node(&state->rb_node, parent, node);
423 rb_insert_color(&state->rb_node, &tree->state);
433 struct extent_state *state, struct rb_node **node,
434 struct rb_node *parent, unsigned bits,
438 rb_link_node(&state->rb_node, parent, node);
439 rb_insert_color(&state->rb_node, &tree->state);
460 struct rb_node *parent = NULL;
461 struct rb_node **node;
471 parent = &orig->rb_node;
477 entry = rb_entry(parent, struct extent_state, rb_node);
489 rb_link_node(&prealloc->rb_node, parent, node);
490 rb_insert_color(&prealloc->rb_node, &tree->state);
522 rb_erase(&state->rb_node, &tree->state);
523 RB_CLEAR_NODE(&state->rb_node);
988 struct rb_node **p = NULL;
989 struct rb_node *parent = NULL;
1236 struct rb_node **p = NULL;
1237 struct rb_node *parent = NULL;