/freebsd-9.3-release/contrib/gcc/ |
H A D | conflict.c | 58 smaller-numbered reg and one for the larger-numbered reg. This 69 smaller-numbered reg, as an index in the table of arcs of this 78 /* The smaller-numbered reg involved in this conflict. */ 79 int smaller; member in struct:conflict_graph_arc_def 114 R1 and R2. R1 is assumed to be smaller or equal to R2. */ 130 return CONFLICT_HASH_FN (arc->smaller, arc->larger); 142 return arc1->smaller == arc2->smaller && arc1->larger == arc2->larger; 186 int smaller = MIN (reg1, reg2); 195 dummy.smaller 185 int smaller = MIN (reg1, reg2); local [all...] |
H A D | tree-ssa-phiopt.c | 630 tree smaller, larger, arg_true, arg_false; local 644 operand is smaller/larger if the result of the comparison is true. */ 647 smaller = TREE_OPERAND (cond, 0); 652 smaller = TREE_OPERAND (cond, 1); 684 if (operand_equal_for_phi_arg_p (arg_true, smaller) 689 if (smaller < larger) 690 rslt = smaller; 695 else if (operand_equal_for_phi_arg_p (arg_false, smaller) 739 if (smaller < larger) 741 r' = MAX_EXPR (smaller, boun [all...] |
/freebsd-9.3-release/usr.bin/gzip/ |
H A D | znew | 23 # Return 0 if the first arg file size is smaller than the second, 1 otherwise. 24 smaller () { 64 if test $kflag -eq 1 && smaller "$filez" "$tmp"; then 65 echo -n "$prog: $filez is smaller than $filegz"
|
/freebsd-9.3-release/contrib/diff/src/ |
H A D | cmp.c | 327 and if more bytes will be compared than are in the smaller file. */ 380 size_t smaller; /* The lesser of `read0' and `read1'. */ 458 smaller = MIN (read0, read1); 460 if (first_diff < smaller) 538 while (first_diff < smaller); 376 size_t smaller; /* The lesser of `read0' and `read1'. */ local
|
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/thin_heap_/ |
H A D | insert_fn_imps.hpp | 280 const bool smaller = Cmp_Fn::operator()(r_new_val, p_nd->m_value); local 284 if (smaller)
|
/freebsd-9.3-release/lib/libz/ |
H A D | trees.c | 443 #define smaller(tree, n, m, depth) \ macro 450 * when the heap property is re-established (each father smaller than its 463 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { 466 /* Exit if v is smaller than both sons */ 467 if (smaller(tree, v, s->heap[j], s->depth)) break;
|
/freebsd-9.3-release/sys/cddl/contrib/opensolaris/uts/common/zmod/ |
H A D | 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;
|
/freebsd-9.3-release/sys/boot/i386/pmbr/ |
H A D | pmbr.s | 163 # the next sector. We assume that partition entries are smaller than 64k
|
/freebsd-9.3-release/sys/cam/ |
H A D | README.quirks | 24 and RBC. SCSI hard drives are usually SBC-compliant and smaller
|
/freebsd-9.3-release/contrib/one-true-awk/ |
H A D | FIXES | 183 smaller size, and i think that's right. added some assertions to b.c 806 are smaller than pointers!
|
/freebsd-9.3-release/contrib/gcc/doc/include/ |
H A D | texinfo.tex | 624 % convenient for us to use an explicitly smaller font, rather than using 1679 \def\lsize{reduced}\def\lllsize{smaller}% 1721 \def\lsize{small}\def\lllsize{smaller}% 1729 \def\lsize{smaller}\def\lllsize{smaller}% 1736 \def\curfontsize{smaller}% 1737 \def\lsize{smaller}\def\lllsize{smaller}% 2049 % We print this one point size smaller, since it's intended for 2126 % be smaller ye [all...] |
/freebsd-9.3-release/contrib/groff/doc/ |
H A D | texinfo.tex | 616 % convenient for us to use an explicitly smaller font, rather than using 1613 \def\lsize{reduced}\def\lllsize{smaller}% 1655 \def\lsize{small}\def\lllsize{smaller}% 1663 \def\lsize{smaller}\def\lllsize{smaller}% 1670 \def\curfontsize{smaller}% 1671 \def\lsize{smaller}\def\lllsize{smaller}% 1948 % We print this one point size smaller, since it's intended for 2025 % be smaller ye [all...] |
/freebsd-9.3-release/contrib/amd/doc/ |
H A D | texinfo.tex | 615 % convenient for us to use an explicitly smaller font, rather than using 1611 \def\lsize{reduced}\def\lllsize{smaller}% 1647 \def\lsize{small}\def\lllsize{smaller}% 1654 \def\lsize{smaller}\def\lllsize{smaller}% 1661 \def\lsize{smaller}\def\lllsize{smaller}% 1934 % We print this one point size smaller, since it's intended for 1963 % be smaller yet, but lllsize is the best we can do for now. 2742 \global\advance\multitableparskip-7pt %% to keep parskip somewhat smaller [all...] |
/freebsd-9.3-release/crypto/openssl/util/ |
H A D | pod2man.pl | 38 a teeny bit smaller in troff(1), and escaping backslashes so you don't 989 # make all caps a teeny bit smaller, but don't muck with embedded code literals 991 if ($Cmd !~ /^head1/) { # SH already makes smaller
|
/freebsd-9.3-release/sys/net/ |
H A D | zlib.c | 423 * smaller than this value. This mechanism is used only for compression 474 * - if compression is not successful for a file smaller than 64K, we can 2203 #define smaller(tree, n, m, depth) \ macro 2210 * when the heap property is re-established (each father smaller than its 2223 smaller(tree, s->heap[j+1], s->heap[j], s->depth)) { 2226 /* Exit if v is smaller than both sons */ 2227 if (smaller(tree, v, s->heap[j], s->depth)) break; 4325 while (++j < z) /* try smaller tables up to z bits */ 5346 #define BASE 65521L /* largest prime smaller than 65536 */
|
/freebsd-9.3-release/contrib/gcc/config/arm/ |
H A D | ieee754-sf.S | 814 @ that the first operand was smaller than the second.
|
H A D | lib1funcs.asm | 671 @ with one of the smaller RORs.
|
H A D | ieee754-df.S | 1108 @ that the first operand was smaller than the second.
|
/freebsd-9.3-release/sys/mips/mips/ |
H A D | fp.S | 723 blt t2, ta2, 3f # subtract larger from smaller 878 blt t2, ta2, 3f # subtract larger from smaller
|
/freebsd-9.3-release/contrib/ntp/sntp/libevent/ |
H A D | configure | 1468 --enable-function-sections, make static library allow smaller binaries with --gc-sections
|