ipp/ipgpc/trie.c

64 	buf->bits = 0;
84  *  has its high order bits masked.
96  *        *  * bits = 4 pos = 5 val = 1011 mask = 00111100
102  *                           *  bits = 1 pos = 5 val = 1 mask = 00100000
104  *  bits = 2 pos = 3 val=11*   * (to be inserted: (bits = 2 pos = 3 val = 00
115  *        *  * bits = 4 pos = 5 val = 1011 mask = 00111100
117  *         *   *  (to be inserted: bits = 1 pos = 0 val = 1 mask = 00000001)
130 	if (pos == (nodep->pos - nodep->bits)) {
136 	} else {		/* pos > (nodep->pos - nodep->bits) */
137 		old_bits = nodep->bits; /* save old bits entry */
139 		nodep->bits = nodep->pos - pos;
155 			/* bits gets remaining bits minus the link */
156 			nodep->zero->bits = (old_bits - nodep->bits) - 1;
157 			/* set bits that are covered by this node */
158 			for (i = 0; i < nodep->zero->bits; ++i) {
182 			/* bits gets remaining bits minus the link */
183 			nodep->one->bits = (old_bits - nodep->bits) - 1;
184 			/* set bits that are covered by this node */
185 			for (i = 0; i < nodep->one->bits; ++i) {
197 		/* clear bits no longer covered by this node, from pos=>0 */
238 			if (c_node->bits > 0) {
240 				if ((pos - 1) > (c_node->pos - c_node->bits)) {
251 		if (c_node->bits > 0) { /* path compressed node */
253 			if ((pos - 1) > (c_node->pos - c_node->bits)) {
261 					continue; /* bits match, so go on */
263 			} else if ((pos - 1) == (c_node->pos - c_node->bits)) {
281 				if (c_node->bits == 0) {
284 				c_node->bits++;
295 				if (c_node->bits == 0) {
298 				c_node->bits++;
327  * specific to inserting keys of 128 bits in length
349 	 * values.  The highest order of the bits are located in array[0]
436 				c_node->bits = 0;
444 	/* check to see if node describes bits to skip */
445 	if (c_node->bits > 0) {
451 		pos = (c_node->pos - c_node->bits) + 1;
483 					c_node->bits = 0;
525 			/* be sure to include the link in the bits */
526 			c_node->bits += c_node->zero->bits + 1;
551 			/* be sure to include the link in the bits */
552 			c_node->bits += c_node->one->bits + 1;
584 			c_node->bits = 0;
624  * specific to removing key of 128 bits in length
646 	 * values.  The higest order of the bits are located in array[0]
723 		/* check node for bits to check */
724 		if (c_node->bits > 0) {
730 			if ((pos = (c_node->pos - c_node->bits) + 1) == 0) {
731 				/* if node covers rest of bits in key */
776  * specific to retrieving keys of 128 bits in length
798 	 * values.  The higest order of the bits are located in array[0]