Lines Matching defs:rb_node
34 return !RB_EMPTY_NODE(&state->rb_node);
131 struct rb_node rb_node;
302 struct rb_node *node;
306 state = rb_entry(node, struct extent_state, rb_node);
307 rb_erase(&state->rb_node, &tree->state);
308 RB_CLEAR_NODE(&state->rb_node);
335 RB_CLEAR_NODE(&state->rb_node);
355 static struct rb_node *tree_insert(struct rb_root *root,
356 struct rb_node *search_start,
358 struct rb_node *node,
359 struct rb_node ***p_in,
360 struct rb_node **parent_in)
362 struct rb_node **p;
363 struct rb_node *parent = NULL;
372 p = search_start ? &search_start : &root->rb_node;
375 entry = rb_entry(parent, struct tree_entry, rb_node);
409 static struct rb_node *__etree_search(struct extent_io_tree *tree, u64 offset,
410 struct rb_node **next_ret,
411 struct rb_node **prev_ret,
412 struct rb_node ***p_ret,
413 struct rb_node **parent_ret)
416 struct rb_node **n = &root->rb_node;
417 struct rb_node *prev = NULL;
418 struct rb_node *orig_prev = NULL;
424 entry = rb_entry(prev, struct tree_entry, rb_node);
444 prev_entry = rb_entry(prev, struct tree_entry, rb_node);
451 prev_entry = rb_entry(prev, struct tree_entry, rb_node);
454 prev_entry = rb_entry(prev, struct tree_entry, rb_node);
461 static inline struct rb_node *
464 struct rb_node ***p_ret,
465 struct rb_node **parent_ret)
467 struct rb_node *next= NULL;
468 struct rb_node *ret;
476 static inline struct rb_node *tree_search(struct extent_io_tree *tree,
495 struct rb_node *other_node;
500 other_node = rb_prev(&state->rb_node);
502 other = rb_entry(other_node, struct extent_state, rb_node);
510 rb_erase(&other->rb_node, &tree->state);
511 RB_CLEAR_NODE(&other->rb_node);
515 other_node = rb_next(&state->rb_node);
517 other = rb_entry(other_node, struct extent_state, rb_node);
525 rb_erase(&other->rb_node, &tree->state);
526 RB_CLEAR_NODE(&other->rb_node);
548 struct rb_node ***p,
549 struct rb_node **parent,
552 struct rb_node *node;
564 node = tree_insert(&tree->state, NULL, end, &state->rb_node, p, parent);
567 found = rb_entry(node, struct extent_state, rb_node);
594 struct rb_node *node;
604 node = tree_insert(&tree->state, &orig->rb_node, prealloc->end,
605 &prealloc->rb_node, NULL, NULL);
615 struct rb_node *next = rb_next(&state->rb_node);
617 return rb_entry(next, struct extent_state, rb_node);
655 rb_erase(&state->rb_node, &tree->state);
656 RB_CLEAR_NODE(&state->rb_node);
703 struct rb_node *node;
757 state = rb_entry(node, struct extent_state, rb_node);
872 struct rb_node *node;
888 state = rb_entry(node, struct extent_state, rb_node);
971 struct rb_node *node;
972 struct rb_node **p;
973 struct rb_node *parent;
998 node = &state->rb_node;
1019 state = rb_entry(node, struct extent_state, rb_node);
1213 struct rb_node *node;
1214 struct rb_node **p;
1215 struct rb_node *parent;
1244 node = &state->rb_node;
1268 state = rb_entry(node, struct extent_state, rb_node);
1530 struct rb_node *node;
1542 state = rb_entry(node, struct extent_state, rb_node);
1653 struct rb_node *node, *prev = NULL, *next;
1673 state = rb_entry(prev, struct extent_state, rb_node);
1684 state = rb_entry(node, struct extent_state, rb_node);
1721 rb_node);
1735 state = rb_entry(node, struct extent_state, rb_node);
1761 struct rb_node *node;
1780 state = rb_entry(node, struct extent_state, rb_node);
2040 struct rb_node *node;
2064 state = rb_entry(node, struct extent_state, rb_node);
2098 struct rb_node *node;
2112 state = rb_entry(node, struct extent_state, rb_node);
2125 struct rb_node *node;
2139 state = rb_entry(node, struct extent_state, rb_node);
2161 struct rb_node *node;
2167 node = &cached->rb_node;
2171 state = rb_entry(node, struct extent_state, rb_node);