Lines Matching refs:node
25 struct rb_node node;
39 struct rb_node node;
74 struct rb_node node;
87 entry = rb_entry(parent_node, struct block_entry, node);
96 rb_link_node(&be->node, parent_node, p);
97 rb_insert_color(&be->node, root);
108 entry = rb_entry(n, struct block_entry, node);
128 entry = rb_entry(parent_node, struct root_entry, node);
137 rb_link_node(&re->node, parent_node, p);
138 rb_insert_color(&re->node, root);
174 entry = rb_entry(parent_node, struct ref_entry, node);
184 rb_link_node(&ref->node, parent_node, p);
185 rb_insert_color(&ref->node, root);
197 entry = rb_entry(n, struct root_entry, node);
243 re = rb_entry(n, struct root_entry, node);
244 rb_erase(&re->node, &be->roots);
249 ref = rb_entry(n, struct ref_entry, node);
250 rb_erase(&ref->node, &be->refs);
583 /* Walk up to the next node that needs to be processed */
637 ref = rb_entry(n, struct ref_entry, node);
645 re = rb_entry(n, struct root_entry, node);
831 rb_erase(&exist->node, &be->refs);
907 be = rb_entry(n, struct block_entry, node);
908 rb_erase(&be->node, &fs_info->block_tree);
927 entry = rb_entry(n, struct block_entry, node);
952 n = &be->node;
954 be = rb_entry(n, struct block_entry, node);
973 rb_erase(&be->node, &fs_info->block_tree);