HomeSort by: relevance | last modified time | path
    Searched refs:smaller (Results 1 - 25 of 123) sorted by relevancy

1 2 3 4 5

  /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/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/common/lib/libc/arch/or1k/gen/
mulsi3.S 50 l.bf .Lloop # yes, r6 already has smaller value,
52 l.ori r6, r4, 0 # move r4 to r6 because it's smaller than r3
  /src/external/gpl3/gcc/dist/libgcc/config/nds32/
lib1asmsrc-newlib.S 42 slt $r3, $r1, $r0 ! test if dividend is smaller than or equal to divisor
93 slt $r3, $r1, $r0 ! test if dividend is smaller than or equal to divisor
139 slt $r3, $r1, $r0 ! test if dividend is smaller than or equal to divisor
177 slt $r3, $r1, $r0 ! test if dividend is smaller than or equal to divisor
  /src/external/gpl3/gcc.old/dist/libgcc/config/nds32/
lib1asmsrc-newlib.S 42 slt $r3, $r1, $r0 ! test if dividend is smaller than or equal to divisor
93 slt $r3, $r1, $r0 ! test if dividend is smaller than or equal to divisor
139 slt $r3, $r1, $r0 ! test if dividend is smaller than or equal to divisor
177 slt $r3, $r1, $r0 ! test if dividend is smaller than or equal to divisor
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/lib/
compiler.F90 58 smaller than 10. */
  /src/external/gpl3/gdb/dist/gdb/testsuite/lib/
compiler.F90 58 smaller than 10. */
  /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/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/crypto/external/bsd/heimdal/dist/lib/asn1/
README.template 12 - assumption: code is large, tables smaller
  /src/external/gpl3/gcc/dist/libgcc/config/arm/
bpabi-v6m.S 198 @ that the first operand was smaller than the second.
279 @ that the first operand was smaller than the second.
  /src/external/gpl3/gcc.old/dist/libgcc/config/arm/
bpabi-v6m.S 198 @ that the first operand was smaller than the second.
279 @ that the first operand was smaller than the second.
  /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/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/bsd/mdocml/dist/
mandoc.css 52 font-size: smaller; }
59 font-size: smaller; }
67 font-size: smaller; }
  /src/external/lgpl3/gmp/dist/mpn/powerpc32/750/
rshift.asm 43 C smaller and saving about 30 or so cycles of overhead.
lshift.asm 43 C smaller and saving about 30 or so cycles of overhead.
  /src/external/lgpl3/gmp/dist/mpn/x86/pentium4/
copyi.asm 35 dnl loop for smaller sizes.
  /src/sys/arch/atari/stand/installboot/
disklabel.c 43 #error BBSIZE is smaller than MINBBSIZE
  /src/external/bsd/openldap/dist/libraries/liblunicode/ucdata/
api.txt 149 smaller than "len" if compositions occurred.
  /src/external/lgpl3/gmp/dist/mpn/powerpc64/mode64/p9/
addmul_1.asm 45 C * This is marginally faster (but much smaller) than ../aorsmul_1.asm.
mul_1.asm 45 C * This is marginally faster (but much smaller) than ../mul_1.asm.
  /src/external/lgpl3/gmp/dist/mpn/x86/pentium/mmx/
mul_1.asm 224 C Plain integer code is used here, since it's smaller and is about
347 C Plain integer code is used here, since it's smaller and is about
  /src/external/lgpl3/gmp/dist/mpn/x86_64/pentium4/
rsh1aors_n.asm 46 C * Try to make this smaller, 746 bytes seem excessive for this 2nd class
49 C * A separate small-n loop might speed things as well as make things smaller.

Completed in 38 milliseconds

1 2 3 4 5