Lines Matching defs:node
302 struct rb_node *node;
305 node = rb_first(&tree->state);
306 state = rb_entry(node, struct extent_state, rb_node);
358 struct rb_node *node,
386 rb_link_node(node, parent, p);
387 rb_insert_color(node, root);
399 * @p_ret - pointer where new node should be anchored (used when inserting an
552 struct rb_node *node;
564 node = tree_insert(&tree->state, NULL, end, &state->rb_node, p, parent);
565 if (node) {
567 found = rb_entry(node, struct extent_state, rb_node);
569 "found node %llu %llu on insert of %llu %llu",
594 struct rb_node *node;
604 node = tree_insert(&tree->state, &orig->rb_node, prealloc->end,
606 if (node) {
703 struct rb_node *node;
754 node = tree_search(tree, start);
755 if (!node)
757 state = rb_entry(node, struct extent_state, rb_node);
872 struct rb_node *node;
883 node = tree_search(tree, start);
885 if (!node)
888 state = rb_entry(node, struct extent_state, rb_node);
906 node = rb_next(node);
971 struct rb_node *node;
998 node = &state->rb_node;
1006 node = tree_search_for_insert(tree, start, &p, &parent);
1007 if (!node) {
1019 state = rb_entry(node, struct extent_state, rb_node);
1213 struct rb_node *node;
1244 node = &state->rb_node;
1253 node = tree_search_for_insert(tree, start, &p, &parent);
1254 if (!node) {
1268 state = rb_entry(node, struct extent_state, rb_node);
1530 struct rb_node *node;
1537 node = tree_search(tree, start);
1538 if (!node)
1542 state = rb_entry(node, struct extent_state, rb_node);
1546 node = rb_next(node);
1547 if (!node)
1653 struct rb_node *node, *prev = NULL, *next;
1659 node = __etree_search(tree, start, &next, &prev, NULL, NULL);
1660 if (!node && !next && !prev) {
1668 } else if (!node && !next) {
1677 } else if (!node) {
1678 node = next;
1681 * At this point 'node' either contains 'start' or start is
1682 * before 'node'
1684 state = rb_entry(node, struct extent_state, rb_node);
1709 * |---prev range---|---hole/unset---|---node range---|
1715 * |---hole/unset--||--first node--|
1735 state = rb_entry(node, struct extent_state, rb_node);
1743 node = rb_next(node);
1744 if (!node)
1761 struct rb_node *node;
1773 node = tree_search(tree, cur_start);
1774 if (!node) {
1780 state = rb_entry(node, struct extent_state, rb_node);
1798 node = rb_next(node);
1802 if (!node)
2040 struct rb_node *node;
2059 node = tree_search(tree, cur_start);
2060 if (!node)
2064 state = rb_entry(node, struct extent_state, rb_node);
2082 node = rb_next(node);
2083 if (!node)
2098 struct rb_node *node;
2107 node = tree_search(tree, start);
2108 if (!node) {
2112 state = rb_entry(node, struct extent_state, rb_node);
2125 struct rb_node *node;
2134 node = tree_search(tree, start);
2135 if (!node) {
2139 state = rb_entry(node, struct extent_state, rb_node);
2161 struct rb_node *node;
2167 node = &cached->rb_node;
2169 node = tree_search(tree, start);
2170 while (node && start <= end) {
2171 state = rb_entry(node, struct extent_state, rb_node);
2196 node = rb_next(node);
2197 if (!node) {
3802 * or the content of some node/leaf from a past generation that got