Lines Matching refs:new_node

1194 	struct backref_node *new_node;  local
1224 	new_node = alloc_backref_node(cache);
1225 	if (!new_node)
1228 	new_node->bytenr = dest->node->start;
1229 	new_node->level = node->level;
1230 	new_node->lowest = node->lowest;
1231 	new_node->checked = 1;
1232 	new_node->root = dest;
1240 			new_edge->node[UPPER] = new_node;
1243 				      &new_node->lower);
1246 		list_add_tail(&new_node->lower, &cache->leaves);
1249 	rb_node = tree_insert(&cache->rb_root, new_node->bytenr,
1250 			      &new_node->rb_node);
1252 		backref_tree_panic(rb_node, -EEXIST, new_node->bytenr);
1254 	if (!new_node->lowest) {
1255 		list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) {
1262 	while (!list_empty(&new_node->lower)) {
1263 		new_edge = list_entry(new_node->lower.next,
1268 	free_backref_node(cache, new_node);