Lines Matching defs:this
16 include such an acknowledgment, I would appreciate that you keep this
53 code this; /* table entry for duplication */
88 This routine assumes, but does not check, that all of the entries in
89 lens[] are in the range 0..MAXBITS. The caller must assure this.
91 symbol does not occur in this code.
118 this.op = (unsigned char)64; /* invalid code marker */
119 this.bits = (unsigned char)1;
120 this.val = (unsigned short)0;
121 *(*table)++ = this; /* make a table to force an error */
122 *(*table)++ = this;
150 Create and fill in decoding tables. In this loop, the table being
159 of the low root bits of huff. This is saved in low to check for when a
165 counts are used for this, and so count[] is decremented as codes are
171 the worst case distance code, MAXD. This should never happen, but the
173 This assumes that when type == LENS, bits == 9.
176 all codes of length max, i.e. all codes, have been processed. This
177 routine permits incomplete codes, so another loop after this one fills
218 this.bits = (unsigned char)(len - drop);
220 this.op = (unsigned char)0;
221 this.val = work[sym];
224 this.op = (unsigned char)(extra[work[sym]]);
225 this.val = base[work[sym]];
228 this.op = (unsigned char)(32 + 64); /* end of block */
229 this.val = 0;
238 next[(huff >> drop) + fill] = this;
292 Fill in rest of table for incomplete codes. This loop is similar to the
298 this.op = (unsigned char)64; /* invalid code marker */
299 this.bits = (unsigned char)(len - drop);
300 this.val = (unsigned short)0;
307 this.bits = (unsigned char)len;
311 next[huff >> drop] = this;
