Lines Matching +defs:x +defs:get
106 # define Trace(x) fprintf x
107 # define Tracev(x) {if (verbose) fprintf x ;}
108 # define Tracevv(x) {if (verbose>1) fprintf x ;}
109 # define Tracec(c,x) {if (verbose && (c)) fprintf x ;}
110 # define Tracecv(c,x) {if (verbose>1 && (c)) fprintf x ;}
113 # define Trace(x)
114 # define Tracev(x)
115 # define Tracevv(x)
116 # define Tracec(c,x)
117 # define Tracecv(c,x)
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.
1627 Tracev((stderr," l %2d v %4x ", length, value));
1721 * tree construction to get a canonical Huffman tree (longest code
1964 Tracec(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",
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 */
3683 /* If BMAX needs to be larger than 16, then h and x[] should be uLong. */
3722 uInt x[BMAX+1]; /* bit offsets, then code stack */
3723 uIntf *xp; /* pointer into x */
3773 x[1] = j = 0;
3774 p = c + 1; xp = x + 2;
3784 v[x[j]++] = i;
3789 x[0] = i = 0; /* first Huffman code is zero */
3845 x[h] = i; /* save pattern for backing up */
3849 j = i >> (w - l); /* (get around Turbo C bug) */
3880 while ((i & ((1 << w) - 1)) != x[h])
4086 enum { /* waiting for "i:"=input, "o:"=output, "x:"=nothing */
4087 START, /* x: set up for LEN */
4088 LEN, /* i: get length/literal/eob next */
4090 DIST, /* i: get distance next */
4095 END, /* x: got eob and all data flushed */
4096 BADCODE} /* x: got error */
4108 uInt get; /* bits to get for extra */
4165 { /* waiting for "i:"=input, "o:"=output, "x:"=nothing */
4166 case START: /* x: set up for LEN */
4183 case LEN: /* i: get length/literal/eob next */
4194 "inflate: literal 0x%02x\n", t->base));
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;
4293 case BADCODE: /* x: got error */
4438 /* get literal/length code */
4445 "inflate: * literal 0x%02x\n", t->base));
4454 /* get extra bits for length */
4467 /* get extra bits to add to distance base */
4469 GRABBITS(e) /* get extra bits (up to 13) */
4519 "inflate: * literal 0x%02x\n", t->base));