62 	buf->one = NULL;  in create_node()
132 		ASSERT(nodep->one == NULL);  in t_split()
134 		nodep->one = create_node(KM_SLEEP);  in t_split()
143 			if ((nodep->one == NULL) && (nodep->zero == NULL)) {  in t_split()
144 				nodep->one = create_node(KM_SLEEP);  in t_split()
148 				tnodep->one = nodep->one;  in t_split()
151 				nodep->one = create_node(KM_SLEEP);  in t_split()
170 			if ((nodep->one == NULL) && (nodep->zero == NULL)) {  in t_split()
171 				nodep->one = create_node(KM_SLEEP);  in t_split()
175 				tnodep->one = nodep->one;  in t_split()
177 				nodep->one = tnodep;  in t_split()
181 			nodep->one->pos = pos - 1; /* link is one bit */  in t_split()
183 			nodep->one->bits = (old_bits - nodep->bits) - 1;  in t_split()
185 			for (i = 0; i < nodep->one->bits; ++i) {  in t_split()
186 				SETBIT(nodep->one->val, (nodep->one->pos - i),  in t_split()
188 					(nodep->one->pos - i), key_len),  in t_split()
190 				SETBIT(nodep->one->mask,  in t_split()
191 				    (nodep->one->pos - i), 1, key_len);  in t_split()
193 			nodep->one->elements = nodep->elements;  in t_split()
242 					ASSERT(c_node->one != NULL);  in t_insert()
258 					ASSERT(c_node->one != NULL);  in t_insert()
265 				if ((c_node->one == NULL) &&  in t_insert()
274 					ASSERT(c_node->one != NULL);  in t_insert()
290 				ASSERT(c_node->one != NULL);  in t_insert()
294 			if (c_node->one == NULL) { /* leaf node */  in t_insert()
305 				c_node = c_node->one; /* internal node */  in t_insert()
366 				if (c_node->one == NULL) {  in t_insert6()
367 					c_node->one = create_node(KM_SLEEP);  in t_insert6()
369 				c_node = c_node->one;  in t_insert6()
428 		    ((c_node->one == NULL) && (c_node->zero == NULL))) {  in t_traverse_delete()
473 			    ((c_node->one == NULL) &&  in t_traverse_delete()
499 		if (t_traverse_delete(&c_node->one, (pos - 1), id, key, mask,  in t_traverse_delete()
501 			c_node->one = NULL;  in t_traverse_delete()
521 	if ((c_node->one == NULL) && (c_node->zero != NULL)) {  in t_traverse_delete()
538 			c_node->one = c_node->zero->one;  in t_traverse_delete()
542 			ASSERT(c_node->zero->one == NULL);  in t_traverse_delete()
547 	} else if ((c_node->one != NULL) && (c_node->zero == NULL)) {  in t_traverse_delete()
550 			c_node->elements = c_node->one->elements;  in t_traverse_delete()
552 			c_node->bits += c_node->one->bits + 1;  in t_traverse_delete()
554 			c_node->mask |= c_node->one->mask;  in t_traverse_delete()
558 			c_node->val |= c_node->one->val;  in t_traverse_delete()
563 			t_node = c_node->one;  in t_traverse_delete()
564 			c_node->zero = c_node->one->zero;  in t_traverse_delete()
565 			c_node->one = c_node->one->one;  in t_traverse_delete()
568 			ASSERT(c_node->one->one == NULL);  in t_traverse_delete()
569 			ASSERT(c_node->one->zero == NULL);  in t_traverse_delete()
570 			kmem_cache_free(trie_node_cache, c_node->one);  in t_traverse_delete()
571 			c_node->one = NULL;  in t_traverse_delete()
576 	    ((c_node->one == NULL) && (c_node->zero == NULL))) {  in t_traverse_delete()
663 				if (c_node->one == NULL) {  in t_remove6()
666 				c_node = c_node->one;  in t_remove6()
751 			c_node = c_node->one;  in t_retrieve()
813 				c_node = c_node->one;  in t_retrieve6()