| /src/usr.bin/gzip/ |
| znew | 22 # Return 0 if the first arg file size is smaller than the second, 1 otherwise.
23 smaller () { function
64 if test $kflag -eq 1 && smaller "$filez" "$tmp"; then
65 echo -n "$prog: $filez is smaller than $filegz"
|
| znew | 22 # Return 0 if the first arg file size is smaller than the second, 1 otherwise.
23 smaller () { function
64 if test $kflag -eq 1 && smaller "$filez" "$tmp"; then
65 echo -n "$prog: $filez is smaller than $filegz"
|
| znew | 22 # Return 0 if the first arg file size is smaller than the second, 1 otherwise.
23 smaller () { function
64 if test $kflag -eq 1 && smaller "$filez" "$tmp"; then
65 echo -n "$prog: $filez is smaller than $filegz"
|
| /src/common/dist/zlib/ |
| trees.c | 499 #define smaller(tree, n, m, depth) \ macro
506 * when the heap property is re-established (each father smaller than its
515 smaller(tree, s->heap[j + 1], s->heap[j], s->depth)) {
518 /* Exit if v is smaller than both sons */
519 if (smaller(tree, v, s->heap[j], s->depth)) break;
|
| trees.c | 499 #define smaller(tree, n, m, depth) \ macro
506 * when the heap property is re-established (each father smaller than its
515 smaller(tree, s->heap[j + 1], s->heap[j], s->depth)) {
518 /* Exit if v is smaller than both sons */
519 if (smaller(tree, v, s->heap[j], s->depth)) break;
|
| trees.c | 499 #define smaller(tree, n, m, depth) \ macro
506 * when the heap property is re-established (each father smaller than its
515 smaller(tree, s->heap[j + 1], s->heap[j], s->depth)) {
518 /* Exit if v is smaller than both sons */
519 if (smaller(tree, v, s->heap[j], s->depth)) break;
|
| /src/sys/net/ |
| zlib.c | 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) \ macro
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 *
[all...] |
| zlib.c | 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) \ macro
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 *
[all...] |
| zlib.c | 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) \ macro
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 *
[all...] |
