369 	unsigned char leftnode;  member
398 			if (node->leftnode == NODE) {  in lookup()
400 			} else if (node->leftnode == LEAF) {  in lookup()
450 					if (node->leftnode == LEAF) {  in tree_walk()
456 						assert(node->leftnode == NODE);  in tree_walk()
498 	node->leftnode = NODE;  in alloc_node()
564 			node->leftnode = LEAF;  in insert()
567 		if (node->leftnode == NODE || node->rightnode == NODE)  in insert()
584 			parent->leftnode = LEAF;  in insert()
679 		if (node->leftnode == LEAF)  in prune()
700 			if (left->leftnode == LEAF)  in prune()
714 			if (right->leftnode == LEAF)  in prune()
747 			if (node->leftnode == NODE && node->left) {  in prune()
790 		    node->leftnode == NODE &&  in prune()
835 			if (node->leftnode == LEAF) {  in mark_nodes()
846 				assert(node->leftnode == NODE);  in mark_nodes()
883 			if (node->leftnode == LEAF) {  in mark_nodes()
894 				assert(node->leftnode == NODE);  in mark_nodes()
978 				if (node->leftnode == LEAF) {  in index_nodes()
985 					assert(node->leftnode == NODE);  in index_nodes()
1032 	if (node->leftnode == NODE)  in mark_subtree()
1105 							if (n->leftnode == LEAF)  in size_nodes()
1145 				if (node->leftnode == LEAF) {  in size_nodes()
1148 					assert(node->leftnode == NODE);  in size_nodes()
1230 			if (node->leftnode == NODE)  in emit()
1251 			if (node->leftnode == NODE)  in emit()
1271 				if (node->leftnode == LEAF) {  in emit()
1280 					assert(node->leftnode == NODE);  in emit()