aboutsummaryrefslogtreecommitdiff
path: root/gcc/fold-const.c
AgeCommit message (Expand)Author
1995-03-08(force_fit_type): Always propagate OVERFLOW.kenner
1995-03-01(decode_field_reference): Don't check TREE_CODE of EXP; letkenner
1995-02-22Support CLEANUP_POINT_EXPRs.merrill
1995-02-10(fold): Don't modify tree with newly-allocated nodes; instead make newkenner
1995-01-17(pedantic_non_lvalue): Check pedantic_lvalues instead of pedantic.merrill
1995-01-14(fold, case COND_EXPR): Properly swap args 1 and 2.kenner
1995-01-10(fold): Avoid infinite recursion caused by last change.kenner
1995-01-07(fold, case CONVERT_EXPR): Don't remove an integer conversion whenkenner
1994-12-10(pedantic_omit_one_operand): New function.kenner
1994-12-09(fold): Call real_zerop for real constants.dje
1994-12-01(fold_truthop): Delete BIT_AND_EXPR of constants with masks.kenner
1994-11-22(fold_convert): Don't fold conversion if it would produce constantkenner
1994-11-16Check target endianness at run time, not compile timeian
1994-11-16(fold): If moved conversion into COND_EXPR, leave it there if it is ankenner
1994-10-05 (fold, COMPONENT_REF): Don't die if the CONSTRUCTORmerrill
1994-09-20(fold): Handle COMPONENT_REFs involving CONSTRUCTORs.merrill
1994-07-30Fix typo.kenner
1994-07-30(fold_truthop): Apply masks to constants.kenner
1994-07-21(fold): Don't fold X-X to 0 if X is floating pointwilson
1994-07-13(decode_field_reference): Merge operand of a BIT_AND_EXPR with thekenner
1994-07-13Remove last change.kenner
1994-07-12(fold, case MULT_EXPR): If arg is an unsigned CEIL_DIV_EXPR, convertkenner
1994-06-29(div_and_round_double): Make it globally accessible.tege
1994-06-15Revert last patch: (fold, case *_DIV_EXPR): Optimize (x / C << y)...tege
1994-06-15(encode, decode): Use 4 HOST_WIDE_INTs for encodedtege
1994-06-14Cast pointer operands to bzero, bcopy, and bcmp to (char *).kenner
1994-04-25(fold-convert): Use assignment, instead of initializing, aggregatekenner
1994-04-18(const_binop): If arg is NaN, just return itkenner
1994-04-09(fold): Avoid exponential work when simplifying conditionalkenner
1994-04-08Fix typo in comment of last change.kenner
1994-04-08(fold, case GT_EXPR): Simplify X < (1 << Y) into X >> Y == 0.kenner
1994-03-30(strip_compound_expr): New function.kenner
1994-03-25(fold, case *_DIV_EXPR): Correct result when product of constantskenner
1994-03-19(const_binop): Avoid initialized aggregate local variables, forkenner
1994-03-14(fold, associate): If -ffast-math, associate FP mults.kenner
1994-03-14(fold): Call tree_int_cst_sgn.kenner
1994-03-13(force_fit_value): Operate on REAL_CST as well.kenner
1994-03-09(fold, case MULT_EXPR): Simplify MULT_EXPR of an EXACT_DIV_EXPR withkenner
1994-02-02(const_binop, COMPLEX_TYPE, case RDIV_EXPR): If complex integer, usekenner
1994-01-31(operand_equal_for_comparison_p): Declare correct_width as unsigned.kenner
1994-01-12(fold, truth_andor): Don't apply distributive law when it would changekenner
1994-01-03(truth_value_p): New function.kenner
1993-12-29(fold, case PLUS_EXPR): Add a missing test of flag_fast_math.kenner
1993-12-27(fold): Simplify more FP ops if -ffast-math.kenner
1993-12-25(fold, case EQ_EXPR, NE_EXPR): If COMPLEX_TYPE and at least one arg iskenner
1993-12-08(fold, case *_{DIV,MOD}_EXPR): When using distributive law, take carekenner
1993-11-15(twoval_comparison_p): Do nothing for SAVE_EXPR, at least for now.rms
1993-10-19(invert_truthvalue): Handle SAVE_EXPR.rms
1993-10-13(optimize_bit_field_compare, decode_field_reference): Don't dokenner
1993-09-30(fold, case PLUS_EXPR, MINUS_EXPR): Properly handle case when ARG1kenner