365 	struct addrnode *newnode, *node;  in addrtree_insert()  local
404 			newnode = node_create(tree, elem, scope, ttl);  in addrtree_insert()
405 			if (!newnode) return;  in addrtree_insert()
406 			if (!edge_create(newnode, addr, sourcemask, node,  in addrtree_insert()
408 				clean_node(tree, newnode);  in addrtree_insert()
410 				free(newnode);  in addrtree_insert()
413 			tree->size_bytes += node_size(tree, newnode);  in addrtree_insert()
414 			lru_push(tree, newnode);  in addrtree_insert()
431 		if (!(newnode = node_create(tree, NULL, 0, 0)))  in addrtree_insert()
434 		if (!edge_create(newnode, addr, common, node, index)) {  in addrtree_insert()
436 			clean_node(tree, newnode);  in addrtree_insert()
438 			free(newnode);  in addrtree_insert()
441 		lru_push(tree, newnode);  in addrtree_insert()
444 		newnode->edge[index] = edge;  in addrtree_insert()
445 		edge->parent_node = newnode;  in addrtree_insert()
450 			newnode->elem = elem;  in addrtree_insert()
451 			newnode->scope = scope;  in addrtree_insert()
452 			newnode->ttl = ttl;  in addrtree_insert()
453 			newnode->only_match_scope_zero = only_match_scope_zero;  in addrtree_insert()
456 		tree->size_bytes += node_size(tree, newnode);  in addrtree_insert()
460 			node = newnode;  in addrtree_insert()
461 			newnode = node_create(tree, elem, scope, ttl);  in addrtree_insert()
462 			if (!edge_create(newnode, addr, sourcemask, node,  in addrtree_insert()
464 				clean_node(tree, newnode);  in addrtree_insert()
466 				free(newnode);  in addrtree_insert()
469 			tree->size_bytes += node_size(tree, newnode);  in addrtree_insert()
470 			lru_push(tree, newnode);  in addrtree_insert()