Lines Matching refs:one
60 buf->one = NULL; in create_node()
130 ASSERT(nodep->one == NULL); in t_split()
132 nodep->one = create_node(KM_SLEEP); in t_split()
141 if ((nodep->one == NULL) && (nodep->zero == NULL)) { in t_split()
142 nodep->one = create_node(KM_SLEEP); in t_split()
146 tnodep->one = nodep->one; in t_split()
149 nodep->one = create_node(KM_SLEEP); in t_split()
168 if ((nodep->one == NULL) && (nodep->zero == NULL)) { in t_split()
169 nodep->one = create_node(KM_SLEEP); in t_split()
173 tnodep->one = nodep->one; in t_split()
175 nodep->one = tnodep; in t_split()
179 nodep->one->pos = pos - 1; /* link is one bit */ in t_split()
181 nodep->one->bits = (old_bits - nodep->bits) - 1; in t_split()
183 for (i = 0; i < nodep->one->bits; ++i) { in t_split()
184 SETBIT(nodep->one->val, (nodep->one->pos - i), in t_split()
186 (nodep->one->pos - i), key_len), in t_split()
188 SETBIT(nodep->one->mask, in t_split()
189 (nodep->one->pos - i), 1, key_len); in t_split()
191 nodep->one->elements = nodep->elements; in t_split()
240 ASSERT(c_node->one != NULL); in t_insert()
256 ASSERT(c_node->one != NULL); in t_insert()
263 if ((c_node->one == NULL) && in t_insert()
272 ASSERT(c_node->one != NULL); in t_insert()
288 ASSERT(c_node->one != NULL); in t_insert()
292 if (c_node->one == NULL) { /* leaf node */ in t_insert()
303 c_node = c_node->one; /* internal node */ in t_insert()
364 if (c_node->one == NULL) { in t_insert6()
365 c_node->one = create_node(KM_SLEEP); in t_insert6()
367 c_node = c_node->one; in t_insert6()
426 ((c_node->one == NULL) && (c_node->zero == NULL))) { in t_traverse_delete()
471 ((c_node->one == NULL) && in t_traverse_delete()
497 if (t_traverse_delete(&c_node->one, (pos - 1), id, key, mask, in t_traverse_delete()
499 c_node->one = NULL; in t_traverse_delete()
519 if ((c_node->one == NULL) && (c_node->zero != NULL)) { in t_traverse_delete()
536 c_node->one = c_node->zero->one; in t_traverse_delete()
540 ASSERT(c_node->zero->one == NULL); in t_traverse_delete()
545 } else if ((c_node->one != NULL) && (c_node->zero == NULL)) { in t_traverse_delete()
548 c_node->elements = c_node->one->elements; in t_traverse_delete()
550 c_node->bits += c_node->one->bits + 1; in t_traverse_delete()
552 c_node->mask |= c_node->one->mask; in t_traverse_delete()
556 c_node->val |= c_node->one->val; in t_traverse_delete()
561 t_node = c_node->one; in t_traverse_delete()
562 c_node->zero = c_node->one->zero; in t_traverse_delete()
563 c_node->one = c_node->one->one; in t_traverse_delete()
566 ASSERT(c_node->one->one == NULL); in t_traverse_delete()
567 ASSERT(c_node->one->zero == NULL); in t_traverse_delete()
568 kmem_cache_free(trie_node_cache, c_node->one); in t_traverse_delete()
569 c_node->one = NULL; in t_traverse_delete()
574 ((c_node->one == NULL) && (c_node->zero == NULL))) { in t_traverse_delete()
661 if (c_node->one == NULL) { in t_remove6()
664 c_node = c_node->one; in t_remove6()
749 c_node = c_node->one; in t_retrieve()
811 c_node = c_node->one; in t_retrieve6()