201 	n->n_parent = parent;  in node_new()
232 	n->n_parent = parent;  in node_new_map()
245 		parent = o->n_parent;  in node_duplicate()
266 	if (n->n_parent != NULL)  in node_delete()
267 		TAILQ_REMOVE(&n->n_parent->n_children, n, n_next);  in node_delete()
280 	TAILQ_REMOVE(&n->n_parent->n_children, n, n_next);  in node_move_after()
281 	n->n_parent = previous->n_parent;  in node_move_after()
282 	TAILQ_INSERT_AFTER(&previous->n_parent->n_children, previous, n, n_next);  in node_move_after()
403 			if (n->n_parent != NULL &&  in node_expand_ampersand()
404 			    strcmp(n->n_parent->n_key, "*") != 0) {  in node_expand_ampersand()
406 				    n->n_parent->n_key);  in node_expand_ampersand()
465 	if (n->n_parent != NULL && n->n_parent->n_parent == NULL &&  in node_is_direct_key()
478 		assert(n->n_parent != NULL);  in node_is_direct_map()
479 		if (n->n_parent->n_parent == NULL)  in node_is_direct_map()
481 		n = n->n_parent;  in node_is_direct_map()
551 	if (n->n_parent == NULL)  in node_path_x()
565 	return (node_path_x(n->n_parent, path));  in node_path_x()
601 	return (node_options_x(n->n_parent, options));  in node_options_x()
707 	if (node->n_parent == NULL || node_is_direct_key(node))  in node_find_x()
718 	assert(root->n_parent == NULL);  in node_find()