Lines Matching refs:node
16 struct rb_node node;
78 struct rb_node *node;
114 for (node = rb_first(tm_root); node; node = next) {
115 next = rb_next(node);
116 tm = rb_entry(node, struct tree_mod_elem, node);
119 rb_erase(node, tm_root);
127 * node/leaf start address -> sequence
129 * The 'start address' is the logical address of the *new* root node for root
148 cur = rb_entry(*new, struct tree_mod_elem, node);
162 rb_link_node(&tm->node, parent, new);
163 rb_insert_color(&tm->node, tm_root);
220 RB_CLEAR_NODE(&tm->node);
277 RB_CLEAR_NODE(&tm->node);
357 if (tm_list[i] && !RB_EMPTY_NODE(&tm_list[i]->node))
358 rb_erase(&tm_list[i]->node, &eb->fs_info->tree_mod_log);
381 rb_erase(&tm_list[j]->node,
479 struct rb_node *node;
485 node = tm_root->rb_node;
486 while (node) {
487 cur = rb_entry(node, struct tree_mod_elem, node);
489 node = node->rb_left;
491 node = node->rb_right;
493 node = node->rb_left;
495 /* We want the node with the highest seq */
499 node = node->rb_left;
501 /* We want the node with the smallest seq */
505 node = node->rb_right;
650 if (dst_move_tm && !RB_EMPTY_NODE(&dst_move_tm->node))
651 rb_erase(&dst_move_tm->node, &fs_info->tree_mod_log);
653 if (src_move_tm && !RB_EMPTY_NODE(&src_move_tm->node))
654 rb_erase(&src_move_tm->node, &fs_info->tree_mod_log);
658 if (tm_list[i] && !RB_EMPTY_NODE(&tm_list[i]->node))
659 rb_erase(&tm_list[i]->node, &fs_info->tree_mod_log);
886 * For non-roots, this operation may exist if the node
894 next = rb_next(&tm->node);
897 tm = rb_entry(next, struct tree_mod_elem, node);
966 * Rewind the state of @root's root node to the given @time_seq value.