Cross Reference: /src/common/dist/zlib/examples/enough.c

Lines Matching defs:use
9    1.1   4 Jan 2007  Use faster incremental table usage computation
16                      Use a macro to compute the history index
41    properties are: we cannot use more bit patterns than are available; and when
275     // we need to use at least this many bit patterns so that the code won't be
281     // we can use at most this many bit patterns, lest there not be enough
289     for (int use = least; use <= most; use++) {
290         got = count(syms - use, (left - use) << 1, len + 1);
412     // we need to use at least this many bit patterns so that the code won't be
418     // we can use at most this many bit patterns, lest there not be enough
425     int use = least;
426     while (rem < use) {
427         use -= rem;
431     rem -= use;
434     for (use = least; use <= most; use++) {
435         g.code[len] = use;
436         examine(syms - use, (left - use) << 1, len + 1,
496 // For the deflate literal/length code, use "enough". For the deflate distance
497 // code, use "enough 30 6".
OpenGrok
