61 	buf->zero = NULL;  in create_node()
133 		ASSERT(nodep->zero == NULL);  in t_split()
135 		nodep->zero = create_node(KM_SLEEP);  in t_split()
143 			if ((nodep->one == NULL) && (nodep->zero == NULL)) {  in t_split()
145 				nodep->zero = create_node(KM_SLEEP);  in t_split()
149 				tnodep->zero = nodep->zero;  in t_split()
150 				nodep->zero = tnodep;  in t_split()
154 			nodep->zero->pos = pos - 1; /* link is one bit */  in t_split()
156 			nodep->zero->bits = (old_bits - nodep->bits) - 1;  in t_split()
158 			for (i = 0; i < nodep->zero->bits; ++i) {  in t_split()
159 				SETBIT(nodep->zero->val,  in t_split()
160 				    (nodep->zero->pos - i),  in t_split()
162 					(nodep->zero->pos - i), key_len),  in t_split()
164 				SETBIT(nodep->zero->mask,  in t_split()
165 				    (nodep->zero->pos - i), 1, key_len);  in t_split()
167 			nodep->zero->elements = nodep->elements;  in t_split()
170 			if ((nodep->one == NULL) && (nodep->zero == NULL)) {  in t_split()
172 				nodep->zero = create_node(KM_SLEEP);  in t_split()
176 				tnodep->zero = nodep->zero;  in t_split()
178 				nodep->zero = create_node(KM_SLEEP);  in t_split()
243 					ASSERT(c_node->zero != NULL);  in t_insert()
259 					ASSERT(c_node->zero != NULL);  in t_insert()
266 				    (c_node->zero == NULL) &&  in t_insert()
275 					ASSERT(c_node->zero != NULL);  in t_insert()
280 			if (c_node->zero == NULL) { /* leaf node */  in t_insert()
291 				c_node = c_node->zero; /* internal node */  in t_insert()
304 				ASSERT(c_node->zero != NULL);  in t_insert()
361 				if (c_node->zero == NULL) {  in t_insert6()
362 					c_node->zero = create_node(KM_SLEEP);  in t_insert6()
364 				c_node = c_node->zero;  in t_insert6()
428 		    ((c_node->one == NULL) && (c_node->zero == NULL))) {  in t_traverse_delete()
474 				(c_node->zero == NULL))) {  in t_traverse_delete()
494 		if (t_traverse_delete(&c_node->zero, (pos - 1), id, key, mask,  in t_traverse_delete()
496 			c_node->zero = NULL;  in t_traverse_delete()
521 	if ((c_node->one == NULL) && (c_node->zero != NULL)) {  in t_traverse_delete()
524 			c_node->elements = c_node->zero->elements;  in t_traverse_delete()
526 			c_node->bits += c_node->zero->bits + 1;  in t_traverse_delete()
528 			c_node->mask |= c_node->zero->mask;  in t_traverse_delete()
532 			c_node->val |= c_node->zero->val;  in t_traverse_delete()
537 			t_node = c_node->zero;  in t_traverse_delete()
538 			c_node->one = c_node->zero->one;  in t_traverse_delete()
539 			c_node->zero = c_node->zero->zero;  in t_traverse_delete()
542 			ASSERT(c_node->zero->one == NULL);  in t_traverse_delete()
543 			ASSERT(c_node->zero->zero == NULL);  in t_traverse_delete()
544 			kmem_cache_free(trie_node_cache, c_node->zero);  in t_traverse_delete()
545 			c_node->zero = NULL;  in t_traverse_delete()
547 	} else if ((c_node->one != NULL) && (c_node->zero == NULL)) {  in t_traverse_delete()
564 			c_node->zero = c_node->one->zero;  in t_traverse_delete()
569 			ASSERT(c_node->one->zero == NULL);  in t_traverse_delete()
576 	    ((c_node->one == NULL) && (c_node->zero == NULL))) {  in t_traverse_delete()
658 				if (c_node->zero == NULL) {  in t_remove6()
661 				c_node = c_node->zero;  in t_remove6()
748 			c_node = c_node->zero;  in t_retrieve()
810 				c_node = c_node->zero;  in t_retrieve6()