Lines Matching defs:next
220 Bytef *pending_out; /* next pending byte to output to the stream */
796 /* If flush != Z_NO_FLUSH && avail_out == 0, the next call
799 * empty block here, this will be done at next call. This also
984 /* Skip to next match if the match length cannot increase
1238 * for the next match, plus MIN_MATCH bytes to insert the
1239 * string following the next match.
1301 * matter since it will be recomputed at next deflate call.
1320 * no better match at the next window position.
1333 * for the next match, plus MIN_MATCH bytes to insert the
1334 * string following the next match.
1421 * the next step to decide.
1940 ush next_code[MAX_BITS+1]; /* next code value for each bit length */
2025 node = elems; /* next internal node of the tree */
2028 m = s->heap[SMALLEST]; /* m = node of next least frequency */
2072 int nextlen = tree[0].Len; /* length of next code */
2117 int nextlen = tree[0].Len; /* length of next code */
2665 inflate_huft *Next; /* pointer to next level of table */
3608 #define next more.Next
3839 *(t = &(q->next)) = Z_NULL;
3848 r.next = q; /* pointer to this table */
4063 q = (--p)->next;
4078 #define next more.Next
4088 LEN, /* i: get length/literal/eob next */
4090 DIST, /* i: get distance next */
4183 case LEN: /* i: get length/literal/eob next */
4205 if ((e & 64) == 0) /* next table */
4208 c->sub.code.tree = t->next;
4230 case DIST: /* i: get distance next */
4243 if ((e & 64) == 0) /* next table */
4246 c->sub.code.tree = t->next;
4396 #define next more.Next
4501 e = (t = t->next + ((uInt)b & inflate_mask[e]))->exop;
4514 if ((e = (t = t->next + ((uInt)b & inflate_mask[e]))->exop) == 0)