Lines Matching defs:get
1359 * It is easy to get rid of this optimization if necessary.
1478 * It is easy to get rid of this optimization if necessary.
2403 * tree construction to get a canonical Huffman tree (longest code
3054 /* Build the bit length tree for the above two trees, and get the index
3859 TYPE, /* get type bits (3, including end bit) */
3860 LENS, /* get lengths for stored */
3862 TABLE, /* get table lengths */
3863 BTREE, /* get bit lengths tree for a dynamic block */
3864 DTREE, /* get length, distance trees for a dynamic block */
3915 /* get bytes and bits */
4093 s->mode = LENS; /* get length of stored block */
5011 LEN, /* i: get length/literal/eob next */
5013 DIST, /* i: get distance next */
5037 uInt get; /* bits to get for extra */
5113 case LEN: /* i: get length/literal/eob next */
5130 c->sub.copy.get = e & 15;
5152 j = c->sub.copy.get;
5160 case DIST: /* i: get distance next */
5168 c->sub.copy.get = e & 15;
5184 j = c->sub.copy.get;
5390 /* get literal/length code */
5406 /* get extra bits for length */
5419 /* get extra bits to add to distance base */
5421 GRABBITS(e) /* get extra bits (up to 13) */