Lines Matching defs:get
766 /* If we came back in here to get the last output from
828 /* We'll have to come back to get the rest of the output;
970 * It is easy to get rid of this optimization if necessary.
1721 * tree construction to get a canonical Huffman tree (longest code
2308 /* Build the bit length tree for the above two trees, and get the index
3052 TYPE, /* get type bits (3, including end bit) */
3053 LENS, /* get lengths for stored */
3055 TABLE, /* get table lengths */
3056 BTREE, /* get bit lengths tree for a dynamic block */
3057 DTREE, /* get length, distance trees for a dynamic block */
3103 /* get bytes and bits */
3288 s->mode = LENS; /* get length of stored block */
3849 j = i >> (w - l); /* (get around Turbo C bug) */
4088 LEN, /* i: get length/literal/eob next */
4090 DIST, /* i: get distance next */
4108 uInt get; /* bits to get for extra */
4183 case LEN: /* i: get length/literal/eob next */
4200 c->sub.copy.get = e & 15;
4222 j = c->sub.copy.get;
4230 case DIST: /* i: get distance next */
4238 c->sub.copy.get = e & 15;
4254 j = c->sub.copy.get;
4438 /* get literal/length code */
4454 /* get extra bits for length */
4467 /* get extra bits to add to distance base */
4469 GRABBITS(e) /* get extra bits (up to 13) */