Cross Reference: /illumos-gate/usr/src/uts/common/ipp/ipgpc/trie.c

Lines Matching refs:zero
61 	buf->zero = NULL;
80  * when t_split returns, c_node->one and c_node->zero must != NULL
133 		ASSERT(nodep->zero == NULL);
135 		nodep->zero = create_node(KM_SLEEP);
143 			if ((nodep->one == NULL) && (nodep->zero == NULL)) {
145 				nodep->zero = create_node(KM_SLEEP);
149 				tnodep->zero = nodep->zero;
150 				nodep->zero = tnodep;
154 			nodep->zero->pos = pos - 1; /* link is one bit */
156 			nodep->zero->bits = (old_bits - nodep->bits) - 1;
158 			for (i = 0; i < nodep->zero->bits; ++i) {
159 				SETBIT(nodep->zero->val,
160 				    (nodep->zero->pos - i),
162 					(nodep->zero->pos - i), key_len),
164 				SETBIT(nodep->zero->mask,
165 				    (nodep->zero->pos - i), 1, key_len);
167 			nodep->zero->elements = nodep->elements;
170 			if ((nodep->one == NULL) && (nodep->zero == NULL)) {
172 				nodep->zero = create_node(KM_SLEEP);
176 				tnodep->zero = nodep->zero;
178 				nodep->zero = create_node(KM_SLEEP);
243 					ASSERT(c_node->zero != NULL);
259 					ASSERT(c_node->zero != NULL);
266 				    (c_node->zero == NULL) &&
275 					ASSERT(c_node->zero != NULL);
280 			if (c_node->zero == NULL) { /* leaf node */
291 				c_node = c_node->zero; /* internal node */
304 				ASSERT(c_node->zero != NULL);
361 				if (c_node->zero == NULL) {
362 					c_node->zero = create_node(KM_SLEEP);
364 				c_node = c_node->zero;
426 		/* check if node has zero elements, is a LEAF node */
428 		    ((c_node->one == NULL) && (c_node->zero == NULL))) {
434 				/* this is the root, just zero out the info */
471 			/* check if node has zero elements & is a LEAF node */
474 				(c_node->zero == NULL))) {
481 					/* this is the root, zero out info */
494 		if (t_traverse_delete(&c_node->zero, (pos - 1), id, key, mask,
496 			c_node->zero = NULL;
521 	if ((c_node->one == NULL) && (c_node->zero != NULL)) {
524 			c_node->elements = c_node->zero->elements;
526 			c_node->bits += c_node->zero->bits + 1;
528 			c_node->mask |= c_node->zero->mask;
532 			c_node->val |= c_node->zero->val;
537 			t_node = c_node->zero;
538 			c_node->one = c_node->zero->one;
539 			c_node->zero = c_node->zero->zero;
542 			ASSERT(c_node->zero->one == NULL);
543 			ASSERT(c_node->zero->zero == NULL);
544 			kmem_cache_free(trie_node_cache, c_node->zero);
545 			c_node->zero = NULL;
547 	} else if ((c_node->one != NULL) && (c_node->zero == NULL)) {
564 			c_node->zero = c_node->one->zero;
569 			ASSERT(c_node->one->zero == NULL);
574 	/* check if node has zero elements, is a LEAF node */
576 	    ((c_node->one == NULL) && (c_node->zero == NULL))) {
582 			/* this is the root, just zero out the info */
658 				if (c_node->zero == NULL) {
661 				c_node = c_node->zero;
748 			c_node = c_node->zero;
810 				c_node = c_node->zero;