Lines Matching refs:one
62 buf->one = NULL;
77 * 2 the insert key specifies a shorter key than the one at the node
78 * 3 the insert key specifies a longer key than the one at the node
80 * when t_split returns, c_node->one and c_node->zero must != NULL
132 ASSERT(nodep->one == NULL);
134 nodep->one = create_node(KM_SLEEP);
143 if ((nodep->one == NULL) && (nodep->zero == NULL)) {
144 nodep->one = create_node(KM_SLEEP);
148 tnodep->one = nodep->one;
151 nodep->one = create_node(KM_SLEEP);
154 nodep->zero->pos = pos - 1; /* link is one bit */
170 if ((nodep->one == NULL) && (nodep->zero == NULL)) {
171 nodep->one = create_node(KM_SLEEP);
175 tnodep->one = nodep->one;
177 nodep->one = tnodep;
181 nodep->one->pos = pos - 1; /* link is one bit */
183 nodep->one->bits = (old_bits - nodep->bits) - 1;
185 for (i = 0; i < nodep->one->bits; ++i) {
186 SETBIT(nodep->one->val, (nodep->one->pos - i),
188 (nodep->one->pos - i), key_len),
190 SETBIT(nodep->one->mask,
191 (nodep->one->pos - i), 1, key_len);
193 nodep->one->elements = nodep->elements;
242 ASSERT(c_node->one != NULL);
258 ASSERT(c_node->one != NULL);
265 if ((c_node->one == NULL) &&
274 ASSERT(c_node->one != NULL);
290 ASSERT(c_node->one != NULL);
294 if (c_node->one == NULL) { /* leaf node */
305 c_node = c_node->one; /* internal node */
366 if (c_node->one == NULL) {
367 c_node->one = create_node(KM_SLEEP);
369 c_node = c_node->one;
428 ((c_node->one == NULL) && (c_node->zero == NULL))) {
473 ((c_node->one == NULL) &&
499 if (t_traverse_delete(&c_node->one, (pos - 1), id, key, mask,
501 c_node->one = NULL;
505 * non path-compressed nodes will contain one child and no elements
521 if ((c_node->one == NULL) && (c_node->zero != NULL)) {
538 c_node->one = c_node->zero->one;
542 ASSERT(c_node->zero->one == NULL);
547 } else if ((c_node->one != NULL) && (c_node->zero == NULL)) {
550 c_node->elements = c_node->one->elements;
552 c_node->bits += c_node->one->bits + 1;
554 c_node->mask |= c_node->one->mask;
558 c_node->val |= c_node->one->val;
563 t_node = c_node->one;
564 c_node->zero = c_node->one->zero;
565 c_node->one = c_node->one->one;
568 ASSERT(c_node->one->one == NULL);
569 ASSERT(c_node->one->zero == NULL);
570 kmem_cache_free(trie_node_cache, c_node->one);
571 c_node->one = NULL;
576 ((c_node->one == NULL) && (c_node->zero == NULL))) {
599 * - if more than one id share the same key, only the id specified is removed
663 if (c_node->one == NULL) {
666 c_node = c_node->one;
751 c_node = c_node->one;
813 c_node = c_node->one;