Lines Matching defs:this
16 include such an acknowledgment, I would appreciate that you keep this
53 code this; /* table entry for duplication */
90 This routine assumes, but does not check, that all of the entries in
91 lens[] are in the range 0..MAXBITS. The caller must assure this.
93 symbol does not occur in this code.
144 Create and fill in decoding tables. In this loop, the table being
153 of the low root bits of huff. This is saved in low to check for when a
159 counts are used for this, and so count[] is decremented as codes are
169 all codes of length max, i.e. all codes, have been processed. This
170 routine permits incomplete codes, so another loop after this one fills
212 this.bits = (unsigned char)(len - drop);
214 this.op = (unsigned char)0;
215 this.val = work[sym];
218 this.op = (unsigned char)(extra[work[sym]]);
219 this.val = base[work[sym]];
222 this.op = (unsigned char)(32 + 64); /* end of block */
223 this.val = 0;
231 next[(huff >> drop) + fill] = this;
286 Fill in rest of table for incomplete codes. This loop is similar to the
292 this.op = (unsigned char)64; /* invalid code marker */
293 this.bits = (unsigned char)(len - drop);
294 this.val = (unsigned short)0;
302 this.bits = (unsigned char)len;
306 next[huff >> drop] = this;
