Lines Matching defs:get
1301 * It is easy to get rid of this optimization if necessary.
2121 * tree construction to get a canonical Huffman tree (longest code
2710 /* Build the bit length tree for the above two trees, and get the index
3533 TYPE, /* get type bits (3, including end bit) */
3534 LENS, /* get lengths for stored */
3536 TABLE, /* get table lengths */
3537 BTREE, /* get bit lengths tree for a dynamic block */
3538 DTREE, /* get length, distance trees for a dynamic block */
3590 /* get bytes and bits */
3759 s->mode = LENS; /* get length of stored block */
4350 j = i >> (w - l); /* (get around Turbo C bug) */
4618 LEN, /* i: get length/literal/eob next */
4620 DIST, /* i: get distance next */
4638 uInt get; /* bits to get for extra */
4714 case LEN: /* i: get length/literal/eob next */
4731 c->sub.copy.get = e & 15;
4753 j = c->sub.copy.get;
4761 case DIST: /* i: get distance next */
4769 c->sub.copy.get = e & 15;
4785 j = c->sub.copy.get;
5001 /* get literal/length code */
5017 /* get extra bits for length */
5030 /* get extra bits to add to distance base */
5032 GRABBITS(e) /* get extra bits (up to 13) */