45 	node_t *leftmost_child, *sibling;  in node_print()  local
51 	leftmost_child = phn_lchild_get(node_t, link, node);  in node_print()
52 	if (leftmost_child == NULL)  in node_print()
54 	node_print(leftmost_child, depth + 1);  in node_print()
56 	for (sibling = phn_next_get(node_t, link, leftmost_child); sibling !=  in node_print()
89 	node_t *leftmost_child, *sibling;  in node_validate()  local
96 	leftmost_child = phn_lchild_get(node_t, link, node);  in node_validate()
97 	if (leftmost_child == NULL)  in node_validate()
99 	assert_ptr_eq((void *)phn_prev_get(node_t, link, leftmost_child),  in node_validate()
101 	nnodes += node_validate(leftmost_child, node);  in node_validate()
103 	for (sibling = phn_next_get(node_t, link, leftmost_child); sibling !=  in node_validate()