Lines Matching defs:this
16 include such an acknowledgment, I would appreciate that you keep this
48 code this; /* table entry for duplication */
85 This routine assumes, but does not check, that all of the entries in
86 lens[] are in the range 0..MAXBITS. The caller must assure this.
88 symbol does not occur in this code.
139 Create and fill in decoding tables. In this loop, the table being
148 of the low root bits of huff. This is saved in low to check for when a
154 counts are used for this, and so count[] is decremented as codes are
164 all codes of length max, i.e. all codes, have been processed. This
165 routine permits incomplete codes, so another loop after this one fills
207 this.bits = (unsigned char)(len - drop);
209 this.op = (unsigned char)0;
210 this.val = work[sym];
213 this.op = (unsigned char)(extra[work[sym]]);
214 this.val = base[work[sym]];
217 this.op = (unsigned char)(32 + 64); /* end of block */
218 this.val = 0;
226 next[(huff >> drop) + fill] = this;
281 Fill in rest of table for incomplete codes. This loop is similar to the
287 this.op = (unsigned char)64; /* invalid code marker */
288 this.bits = (unsigned char)(len - drop);
289 this.val = (unsigned short)0;
297 this.bits = (unsigned char)len;
301 next[huff >> drop] = this;