342 #define NODE 1  macro
391 			if (node->rightnode == NODE) {  in lookup()
400 			if (node->leftnode == NODE) {  in lookup()
434 		assert(tree->childnode == NODE);  in tree_walk()
458 						assert(node->leftnode == NODE);  in tree_walk()
472 						assert(node->rightnode == NODE);  in tree_walk()
500 	node->leftnode = NODE;  in alloc_node()
501 	node->rightnode = NODE;  in alloc_node()
569 		if (node->leftnode == NODE || node->rightnode == NODE)  in insert()
749 			if (node->leftnode == NODE && node->left) {  in prune()
754 			} else if (node->rightnode == NODE && node->right) {  in prune()
792 		    node->leftnode == NODE &&  in prune()
797 			   node->rightnode == NODE &&  in prune()
830 	assert(tree->childnode == NODE);  in mark_nodes()
848 				assert(node->leftnode == NODE);  in mark_nodes()
866 				assert(node->rightnode == NODE);  in mark_nodes()
878 	assert(tree->childnode == NODE);  in mark_nodes()
896 				assert(node->leftnode == NODE);  in mark_nodes()
918 				assert(node->rightnode == NODE);  in mark_nodes()
965 	assert(tree->childnode == NODE);  in index_nodes()
987 					assert(node->leftnode == NODE);  in index_nodes()
1001 					assert(node->rightnode == NODE);  in index_nodes()
1034 	if (node->leftnode == NODE)  in mark_subtree()
1036 	if (node->rightnode == NODE)  in mark_subtree()
1074 	assert(tree->childnode == NODE);  in size_nodes()
1086 			if (node->rightnode == NODE) {  in size_nodes()
1150 					assert(node->leftnode == NODE);  in size_nodes()
1162 					assert(node->rightnode == NODE);  in size_nodes()
1218 	assert(tree->childnode == NODE);  in emit()
1232 			if (node->leftnode == NODE)  in emit()
1234 			if (node->rightnode == NODE)  in emit()
1253 			if (node->leftnode == NODE)  in emit()
1260 			if (node->rightnode == NODE)  in emit()
1282 					assert(node->leftnode == NODE);  in emit()
1299 					assert(node->rightnode == NODE);  in emit()
1679 		trees[i].childnode = NODE;  in trees_init()