| /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"
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/ |
| insert_fn_imps.hpp | 240 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local
242 if (smaller)
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/ |
| insert_fn_imps.hpp | 240 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local
242 if (smaller)
|
| /src/external/bsd/unbound/dist/testcode/ |
| lock_verify.c | 78 /** set of all locks that are smaller than this one (locked earlier) */
79 rbtree_type* smaller; member in struct:order_lock
83 /** if lock has been visited (all smaller locks have been compared to
195 o->smaller = rbtree_create(order_lock_cmp);
204 free(o->smaller);
219 o->smaller = rbtree_create(order_lock_cmp);
254 if(!rbtree_insert(now->smaller, &ref->node)) {
344 RBTREE_FOR(ref, struct lock_ref*, visit->lock->smaller) {
407 if(o->smaller) {
408 traverse_postorder(o->smaller, &dellockref, NULL)
[all...] |
| /src/external/gpl2/diffutils/dist/src/ |
| cmp.c | 325 and if more bytes will be compared than are in the smaller file. */
378 size_t smaller; /* The lesser of `read0' and `read1'. */
456 smaller = MIN (read0, read1);
458 if (first_diff < smaller)
538 while (first_diff < smaller);
374 size_t smaller; \/* The lesser of `read0' and `read1'. *\/ local
|
| /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;
|
| /src/external/cddl/osnet/dist/uts/common/zmod/ |
| trees.c | 445 #define smaller(tree, n, m, depth) \ macro
452 * when the heap property is re-established (each father smaller than its
465 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
468 /* Exit if v is smaller than both sons */
469 if (smaller(tree, v, s->heap[j], s->depth)) break;
|
| /src/external/gpl3/binutils/dist/zlib/ |
| trees.c | 497 #define smaller(tree, n, m, depth) \ macro
504 * when the heap property is re-established (each father smaller than its
513 smaller(tree, s->heap[j + 1], s->heap[j], s->depth)) {
516 /* Exit if v is smaller than both sons */
517 if (smaller(tree, v, s->heap[j], s->depth)) break;
|
| /src/external/gpl3/binutils.old/dist/zlib/ |
| trees.c | 441 #define smaller(tree, n, m, depth) \ macro
448 * when the heap property is re-established (each father smaller than its
461 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
464 /* Exit if v is smaller than both sons */
465 if (smaller(tree, v, s->heap[j], s->depth)) break;
|
| /src/external/gpl3/gdb/dist/zlib/ |
| trees.c | 441 #define smaller(tree, n, m, depth) \ macro
448 * when the heap property is re-established (each father smaller than its
461 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
464 /* Exit if v is smaller than both sons */
465 if (smaller(tree, v, s->heap[j], s->depth)) break;
|
| /src/external/gpl3/gdb.old/dist/zlib/ |
| trees.c | 441 #define smaller(tree, n, m, depth) \ macro
448 * when the heap property is re-established (each father smaller than its
461 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
464 /* Exit if v is smaller than both sons */
465 if (smaller(tree, v, s->heap[j], s->depth)) break;
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-ssa-phiopt.cc | 686 of cst3 and cst4 is smaller. */
1777 tree smaller, larger, arg_true, arg_false; local
1810 operand is smaller/larger if the result of the comparison is true. */
1815 smaller = gimple_cond_lhs (cond);
1817 /* If we have smaller < CST it is equivalent to smaller <= CST-1.
1818 Likewise smaller <= CST is equivalent to smaller < CST+1. */
1844 smaller = rhs;
1848 if (TREE_CODE (smaller) == INTEGER_CS
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-ssa-phiopt.cc | 1718 tree smaller, larger, arg_true, arg_false; local
1747 operand is smaller/larger if the result of the comparison is true. */
1752 smaller = gimple_cond_lhs (cond);
1754 /* If we have smaller < CST it is equivalent to smaller <= CST-1.
1755 Likewise smaller <= CST is equivalent to smaller < CST+1. */
1781 smaller = rhs;
1785 if (TREE_CODE (smaller) == INTEGER_CST
1786 && INTEGRAL_TYPE_P (TREE_TYPE (smaller)))
[all...] |
| /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...] |
