Lines Matching defs:smaller
446 * smaller than this value. This mechanism is used only for compression
497 * - if compression is not successful for a file smaller than 64K, we can
503 * a highly compressible string table.) Smaller buffer sizes give
2541 #define smaller(tree, n, m, depth) \
2548 * when the heap property is re-established (each father smaller than its
2560 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
2563 /* Exit if v is smaller than both sons */
2564 if (smaller(tree, v, s->heap[j], s->depth)) break;
4646 while (++j < z) /* try smaller tables up to z bits */
5837 #define BASE 65521L /* largest prime smaller than 65536 */