diff options
author | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2002-09-22 14:09:34 +0000 |
---|---|---|
committer | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2002-09-22 14:09:34 +0000 |
commit | 6ef828f9e997f2a593360aa6ce158d9f5ae739a0 (patch) | |
tree | d2db7ebbe3f404f7fa5e30b7ecf4ac4675f5b518 /gcc/fold-const.c | |
parent | 43e00fc9fcdb8cf219d4f9cf9ff1d45dbcbadeee (diff) | |
download | gcc-6ef828f9e997f2a593360aa6ce158d9f5ae739a0.tar.gz |
* dbxout.c: Follow spelling conventions.
* defaults.h: Likewise.
* df.c: Likewise.
* diagnostic.h: Likewise.
* doloop.c: Likewise.
* dwarf2out.c: Likewise.
* dwarfout.c: Likewise.
* emit-rtl.c: Likewise.
* except.c: Likewise.
* explow.c: Likewise.
* expmed.c: Likewise.
* expr.c: Likewise.
* expr.h: Likewise.
* flags.h: Likewise.
* flow.c: Likewise.
* fold-const.c: Likewise.
* function.c: Likewise.
* function.h: Likewise.
* gcc.c: Likewise.
* gcov-io.h: Likewise.
* gcov.c: Likewise.
* gcse.c: Likewise.
* genattrtab.c: Likewise.
* genconfig.c: Likewise.
* genrecog.c: Likewise.
* ggc-page.c: Likewise.
* ggc.h: Likewise.
* global.c: Likewise.
* gthr-win32.h: Likewise.
* integrate.c: Likewise.
* jump.c: Likewise.
* langhooks.c: Likewise.
* langhooks.h: Likewise.
* line-map.h: Likewise.
* local-alloc.c: Likewise.
* longlong.h: Likewise.
* loop.c: Likewise.
* loop.h: Likewise.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@57406 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/fold-const.c')
-rw-r--r-- | gcc/fold-const.c | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/gcc/fold-const.c b/gcc/fold-const.c index c1ea09d7a5a..2e869017dee 100644 --- a/gcc/fold-const.c +++ b/gcc/fold-const.c @@ -649,7 +649,7 @@ div_and_round_double (code, uns, int num_hi_sig, den_hi_sig; unsigned HOST_WIDE_INT quo_est, scale; - /* Find the highest non-zero divisor digit. */ + /* Find the highest nonzero divisor digit. */ for (i = 4 - 1;; i--) if (den[i] != 0) { @@ -1350,7 +1350,7 @@ size_htab_hash (x) ^ (TREE_OVERFLOW (t) << 20)); } -/* Return non-zero if the value represented by *X (an INTEGER_CST tree node) +/* Return nonzero if the value represented by *X (an INTEGER_CST tree node) is the same as that given by *Y, which is the same. */ static int @@ -1781,7 +1781,7 @@ truth_value_p (code) } /* Return nonzero if two operands are necessarily equal. - If ONLY_CONST is non-zero, only return non-zero for constants. + If ONLY_CONST is nonzero, only return nonzero for constants. This function tests whether the operands are indistinguishable; it does not test whether they are equal using C's == operation. The distinction is important for IEEE floating point, because @@ -2015,7 +2015,7 @@ operand_equal_for_comparison_p (arg0, arg1, other) /* See if ARG is an expression that is either a comparison or is performing arithmetic on comparisons. The comparisons must only be comparing two different values, which will be stored in *CVAL1 and *CVAL2; if - they are non-zero it means that some operands have already been found. + they are nonzero it means that some operands have already been found. No variables may be used anywhere else in the expression except in the comparisons. If SAVE_P is true it means we removed a SAVE_EXPR around the expression and save_expr needs to be called with CVAL1 and CVAL2. @@ -2400,7 +2400,7 @@ distribute_bit_expr (code, type, arg0, arg1) } /* Return a BIT_FIELD_REF of type TYPE to refer to BITSIZE bits of INNER - starting at BITPOS. The field is unsigned if UNSIGNEDP is non-zero. */ + starting at BITPOS. The field is unsigned if UNSIGNEDP is nonzero. */ static tree make_bit_field_ref (inner, type, bitsize, bitpos, unsignedp) @@ -2673,7 +2673,7 @@ decode_field_reference (exp, pbitsize, pbitpos, pmode, punsignedp, return inner; } -/* Return non-zero if MASK represents a mask of SIZE ones in the low-order +/* Return nonzero if MASK represents a mask of SIZE ones in the low-order bit positions. */ static int @@ -4395,7 +4395,7 @@ count_cond (expr, lim) /* Transform `a + (b ? x : y)' into `b ? (a + x) : (a + y)'. Transform, `a + (x < y)' into `(x < y) ? (a + 1) : (a + 0)'. Here CODE corresponds to the `+', COND to the `(b ? x : y)' or `(x < y)' - expression, and ARG to `a'. If COND_FIRST_P is non-zero, then the + expression, and ARG to `a'. If COND_FIRST_P is nonzero, then the COND is the first argument to CODE; otherwise (as in the example given here), it is the second argument. TYPE is the type of the original expression. */ @@ -4527,7 +4527,7 @@ fold_binary_op_with_conditional_arg (code, type, cond, arg, cond_first_p) TYPE, X + ADDEND is the same as X. If NEGATE, return true if X - ADDEND is the same as X. - X + 0 and X - 0 both give X when X is NaN, infinite, or non-zero + X + 0 and X - 0 both give X when X is NaN, infinite, or nonzero and finite. The problematic cases are when X is zero, and its mode has signed zeros. In the case of rounding towards -infinity, X - 0 is not the same as X because 0 - 0 is -0. In other rounding |