Lines Matching defs:this
151 arising from the use of this software.
153 Permission is granted to anyone to use this software for any purpose,
157 1. The origin of this software must not be misrepresented; you must not
158 claim that you wrote the original software. If you use this software
289 Of course this will generally degrade compression (there's no free lunch).
571 /* The deflate compression method (the only one supported in this version) */
881 * Since MSDOS is not a preemptive multitasking OS, this table is not
1305 z_streamp strm; /* pointer back to this zlib stream */
1326 * bytes. With this organization, matches are limited to a distance of
1327 * wSize-MAX_MATCH bytes, but this ensures that IO is always
1339 /* Link to older string with same hash index. To limit the size of this
1340 * array to 64K, this link is maintained only for the last 32K strings.
1341 * An index in this array is thus a window index modulo 32K.
1371 /* Length of the best match at previous step. Matches not greater than this
1376 /* To speed up deflation, hash chains are never searched beyond this
1383 * smaller than this value. This mechanism is used only for compression
1388 * greater than this length. This saves time but degrades compression.
1396 /* Use a faster search when the previous match is longer than this */
1398 int nice_match; /* Stop searching when current match exceeds this */
1548 unsigned char bits; /* bits in this part of the code */
1689 include such an acknowledgment, I would appreciate that you keep this
1726 code this; /* table entry for duplication */
1762 lens[] are in the range 0..MAXBITS. The caller must assure this.
1764 symbol does not occur in this code.
1791 this.op = (unsigned char)64; /* invalid code marker */
1792 this.bits = (unsigned char)1;
1793 this.val = (unsigned short)0;
1794 *(*table)++ = this; /* make a table to force an error */
1795 *(*table)++ = this;
1823 Create and fill in decoding tables. In this loop, the table being
1838 counts are used for this, and so count[] is decremented as codes are
1850 routine permits incomplete codes, so another loop after this one fills
1891 this.bits = (unsigned char)(len - drop);
1893 this.op = (unsigned char)0;
1894 this.val = work[sym];
1897 this.op = (unsigned char)(extra[work[sym]]);
1898 this.val = base[work[sym]];
1901 this.op = (unsigned char)(32 + 64); /* end of block */
1902 this.val = 0;
1911 next[(huff >> drop) + fill] = this;
1971 this.op = (unsigned char)64; /* invalid code marker */
1972 this.bits = (unsigned char)(len - drop);
1973 this.val = (unsigned short)0;
1980 this.bits = (unsigned char)len;
1984 next[huff >> drop] = this;
2035 inflate execution time is spent in this routine.
2087 code this; /* retrieved table entry */
2124 this = lcode[hold & lmask];
2126 op = (unsigned)(this.bits);
2129 op = (unsigned)(this.op);
2131 Tracevv((stderr, this.val >= 0x20 && this.val < 0x7f ?
2133 "inflate: literal 0x%02x\n", this.val));
2134 PUP(out) = (unsigned char)(this.val);
2137 len = (unsigned)(this.val);
2155 this = dcode[hold & dmask];
2157 op = (unsigned)(this.bits);
2160 op = (unsigned)(this.op);
2162 dist = (unsigned)(this.val);
2259 this = dcode[this.val + (hold & ((((unsigned int)1) << op) - 1))];
2269 this = lcode[this.val + (hold & ((((unsigned int)1) << op) - 1))];
2423 fixed code decoding. Normally this returns fixed tables from inffixed.h.
2424 If BUILDFIXED is defined, then instead this routine builds the tables the
2531 when a window is already in use, or when output has been written during this
2762 In this implementation, the flush parameter of inflate() only affects the
2786 code this; /* current decoding table entry */
3098 this = state->lencode[BITS(state->lenbits)];
3099 if ((unsigned)(this.bits) <= bits) break;
3102 if (this.val < 16) {
3103 NEEDBITS(this.bits);
3104 DROPBITS(this.bits);
3105 state->lens[state->have++] = this.val;
3108 if (this.val == 16) {
3109 NEEDBITS(this.bits + 2);
3110 DROPBITS(this.bits);
3120 else if (this.val == 17) {
3121 NEEDBITS(this.bits + 3);
3122 DROPBITS(this.bits);
3128 NEEDBITS(this.bits + 7);
3129 DROPBITS(this.bits);
3177 this = state->lencode[BITS(state->lenbits)];
3178 if ((unsigned)(this.bits) <= bits) break;
3181 if (this.op && (this.op & 0xf0) == 0) {
3182 last = this;
3184 this = state->lencode[last.val +
3186 if ((unsigned)(last.bits + this.bits) <= bits) break;
3191 DROPBITS(this.bits);
3192 state->length = (unsigned)this.val;
3193 if ((int)(this.op) == 0) {
3194 Tracevv((stderr, this.val >= 0x20 && this.val < 0x7f ?
3196 "inflate: literal 0x%02x\n", this.val));
3200 if (this.op & 32) {
3205 if (this.op & 64) {
3210 state->extra = (unsigned)(this.op) & 15;
3222 this = state->distcode[BITS(state->distbits)];
3223 if ((unsigned)(this.bits) <= bits) break;
3226 if ((this.op & 0xf0) == 0) {
3227 last = this;
3229 this = state->distcode[last.val +
3231 if ((unsigned)(last.bits + this.bits) <= bits) break;
3236 DROPBITS(this.bits);
3237 if (this.op & 64) {
3242 state->offset = (unsigned)this.val;
3243 state->extra = (unsigned)(this.op) & 15;
3718 strcpy(s->path, path); /* do this early for debugging */
3767 * Note that in this case inflate *requires* an extra "dummy" byte
3791 * start anyway in write mode, so this initialization is not