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
39 properties are: we cannot use more bit patterns than are available; and when
207 int least; /* least number of syms to use at this juncture */
208 int most; /* most number of syms to use at this juncture */
209 int use; /* number of bit patterns to use in next call */
225 /* we need to use at least this many bit patterns so that the code won't be
231 /* we can use at most this many bit patterns, lest there not be enough
239 for (use = least; use <= most; use++) {
240 got = count(syms - use, len + 1, (left - use) << 1);
324 int least; /* least number of syms to use at this juncture */
325 int most; /* most number of syms to use at this juncture */
326 int use; /* number of bit patterns to use in next call */
345 for (use = root + 1; use <= max; use++)
346 if (code[use])
347 printf("%d[%d] ", code[use], use);
361 /* we need to use at least this many bit patterns so that the code won't be
367 /* we can use at most this many bit patterns, lest there not be enough
374 use = least;
375 while (rem < use) {
376 use -= rem;
380 rem -= use;
383 for (use = least; use <= most; use++) {
384 code[len] = use;
385 examine(syms - use, len + 1, (left - use) << 1,
450 For the deflate literal/length code, use "enough". For the deflate distance
451 code, use "enough 30 6".
