Lines Matching refs:new_node
1151 struct backref_node *new_node; local
1181 new_node = alloc_backref_node(cache);
1182 if (!new_node)
1185 new_node->bytenr = dest->node->start;
1186 new_node->level = node->level;
1187 new_node->lowest = node->lowest;
1188 new_node->checked = 1;
1189 new_node->root = dest;
1197 new_edge->node[UPPER] = new_node;
1200 &new_node->lower);
1203 list_add_tail(&new_node->lower, &cache->leaves);
1206 rb_node = tree_insert(&cache->rb_root, new_node->bytenr,
1207 &new_node->rb_node);
1209 backref_tree_panic(rb_node, -EEXIST, new_node->bytenr);
1211 if (!new_node->lowest) {
1212 list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) {
1219 while (!list_empty(&new_node->lower)) {
1220 new_edge = list_entry(new_node->lower.next,
1225 free_backref_node(cache, new_node);