345 	int childnode;  member
427 	if (tree->childnode == LEAF) {  in tree_walk()
432 		assert(tree->childnode == NODE);  in tree_walk()
581 			tree->childnode = LEAF;  in insert()
669 	if (tree->childnode == LEAF)  in prune()
825 	if (tree->childnode == LEAF)  in mark_nodes()
828 	assert(tree->childnode == NODE);  in mark_nodes()
876 	assert(tree->childnode == NODE);  in mark_nodes()
958 	if (tree->childnode == LEAF) {  in index_nodes()
963 	assert(tree->childnode == NODE);  in index_nodes()
1069 	if (tree->childnode == LEAF)  in size_nodes()
1072 	assert(tree->childnode == NODE);  in size_nodes()
1207 	if (tree->childnode == LEAF) {  in emit()
1216 	assert(tree->childnode == NODE);  in emit()
1672 		trees[i].childnode = NODE;  in trees_init()