45 	node_t *leftmost_child, *sibling;  in node_print()  local
52 	leftmost_child = phn_lchild_get(node_t, link, node);  in node_print()
53 	if (leftmost_child == NULL) {  in node_print()
56 	node_print(leftmost_child, depth + 1);  in node_print()
58 	for (sibling = phn_next_get(node_t, link, leftmost_child); sibling !=  in node_print()
90 	node_t *leftmost_child, *sibling;  in node_validate()  local
97 	leftmost_child = phn_lchild_get(node_t, link, node);  in node_validate()
98 	if (leftmost_child == NULL) {  in node_validate()
101 	assert_ptr_eq((void *)phn_prev_get(node_t, link, leftmost_child),  in node_validate()
103 	nnodes += node_validate(leftmost_child, node);  in node_validate()
105 	for (sibling = phn_next_get(node_t, link, leftmost_child); sibling !=  in node_validate()