Home | History | Annotate | Download | only in zmod

Lines Matching defs:this

18   include such an acknowledgment, I would appreciate that you keep this
55     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.
120         this.op = (unsigned char)64;    /* invalid code marker */
121         this.bits = (unsigned char)1;
122         this.val = (unsigned short)0;
123         *(*table)++ = this;             /* make a table to force an error */
124         *(*table)++ = this;
152        Create and fill in decoding tables.  In this loop, the table being
161        of the low root bits of huff.  This is saved in low to check for when a
167        counts are used for this, and so count[] is decremented as codes are
173        the worst case distance code, MAXD.  This should never happen, but the
175        This assumes that when type == LENS, bits == 9.
178        all codes of length max, i.e. all codes, have been processed.  This
179        routine permits incomplete codes, so another loop after this one fills
220         this.bits = (unsigned char)(len - drop);
222             this.op = (unsigned char)0;
223             this.val = work[sym];
226             this.op = (unsigned char)(extra[work[sym]]);
227             this.val = base[work[sym]];
230             this.op = (unsigned char)(32 + 64);         /* end of block */
231             this.val = 0;
240             next[(huff >> drop) + fill] = this;
294        Fill in rest of table for incomplete codes.  This loop is similar to the
300     this.op = (unsigned char)64;                /* invalid code marker */
301     this.bits = (unsigned char)(len - drop);
302     this.val = (unsigned short)0;
309             this.bits = (unsigned char)len;
313         next[huff >> drop] = this;