test/unit/ph.c

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