Lines Matching defs:node
22 struct rb_node node;
36 struct rb_node node;
71 struct rb_node node;
84 entry = rb_entry(parent_node, struct block_entry, node);
93 rb_link_node(&be->node, parent_node, p);
94 rb_insert_color(&be->node, root);
105 entry = rb_entry(n, struct block_entry, node);
125 entry = rb_entry(parent_node, struct root_entry, node);
134 rb_link_node(&re->node, parent_node, p);
135 rb_insert_color(&re->node, root);
171 entry = rb_entry(parent_node, struct ref_entry, node);
181 rb_link_node(&ref->node, parent_node, p);
182 rb_insert_color(&ref->node, root);
194 entry = rb_entry(n, struct root_entry, node);
240 re = rb_entry(n, struct root_entry, node);
241 rb_erase(&re->node, &be->roots);
246 ref = rb_entry(n, struct ref_entry, node);
247 rb_erase(&ref->node, &be->refs);
592 /* Walk up to the next node that needs to be processed */
646 ref = rb_entry(n, struct ref_entry, node);
654 re = rb_entry(n, struct root_entry, node);
844 rb_erase(&exist->node, &be->refs);
920 be = rb_entry(n, struct block_entry, node);
921 rb_erase(&be->node, &fs_info->block_tree);
940 entry = rb_entry(n, struct block_entry, node);
965 n = &be->node;
967 be = rb_entry(n, struct block_entry, node);
986 rb_erase(&be->node, &fs_info->block_tree);