Lines Matching refs:overflow
571 * Initialize the hash table (avoiding 64K overflow for 16 bit systems).
1863 int overflow = 0; /* number of elements with bit length too large */
1868 * overflow in the case of the bit length tree).
1875 if (bits > max_length) bits = max_length, overflow++;
1888 if (overflow == 0) return;
1890 Trace((stderr,"\nbit length overflow\n"));
1898 s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
1900 /* The brother of the overflow item also moves one step up,
1903 overflow -= 2;
1904 } while (overflow > 0);
2490 Assert(s->pending < s->lit_bufsize + 2*lx, "pendingBuf overflow");
3983 "inflate_trees falloc overflow");