Home
last modified time | relevance | path

Searched refs:fold_binary (Results 1 – 25 of 89) sorted by relevance

1234

/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Domp-general.cc544 t = fold_binary (MINUS_EXPR, long_long_unsigned_type_node, in omp_extract_for_data()
550 tree last = fold_binary (PLUS_EXPR, itype, first, in omp_extract_for_data()
551 fold_binary (MULT_EXPR, itype, t, in omp_extract_for_data()
563 n1first = fold_binary (PLUS_EXPR, itype, in omp_extract_for_data()
564 fold_binary (MULT_EXPR, itype, in omp_extract_for_data()
566 n1last = fold_binary (PLUS_EXPR, itype, in omp_extract_for_data()
567 fold_binary (MULT_EXPR, itype, in omp_extract_for_data()
576 n2first = fold_binary (PLUS_EXPR, itype, in omp_extract_for_data()
577 fold_binary (MULT_EXPR, itype, in omp_extract_for_data()
579 n2last = fold_binary (PLUS_EXPR, itype, in omp_extract_for_data()
[all …]
H A DChangeLog.ptr26 (fold_binary): Fix spelling/grammer mistakes.
267 (fold_binary <case POINTER_PLUS_EXPR>): Convert the second
290 (fold_binary <case MINUS_EXPR>): Fold (PTR0 p+ A) - (PTR1 p+ B)
399 * fold-const.c (fold_binary <case POINTER_PLUS_EXPR>);
401 (fold_binary <case PLUS_EXPR>): Add folding of PTR+INT into
423 (fold_binary <case POINTER_PLUS_EXR>): Remove code argument.
424 (fold_binary <case PLUS_EXPR>): Don't call try_move_mult_to_index.
425 (fold_binary <case MINUS_EXPR>): Likewise.
479 (fold_binary): Handle simple POINTER_PLUS_EXPR cases.
H A Dtree-ssa-dom.cc252 fold_binary (MINUS_EXPR, TREE_TYPE (rhs1), in derive_equivalences()
258 fold_binary (MINUS_EXPR, TREE_TYPE (rhs1), in derive_equivalences()
277 fold_binary (MINUS_EXPR, TREE_TYPE (rhs1), in derive_equivalences()
283 fold_binary (PLUS_EXPR, TREE_TYPE (rhs1), in derive_equivalences()
H A Dtree-ssa-loop-niter.cc1944 tree tem = fold_binary (code, boolean_type_node, iv0->base, iv1->base); in number_of_iterations_cond()
2339 e = fold_binary (TRUTH_OR_EXPR, boolean_type_node, notcond, expr); in tree_simplify_using_condition_1()
2344 e = fold_binary (TRUTH_AND_EXPR, boolean_type_node, cond, expr); in tree_simplify_using_condition_1()
3195 acnd = fold_binary (cmp, boolean_type_node, aval[0], aval[1]); in loop_niter_by_eval()
3409 tree tem = fold_binary (GE_EXPR, boolean_type_node, op0, in derive_constant_upper_bound_ops()
3784 next = fold_binary (PLUS_EXPR, type, low, step); in idx_infer_loop_bounds()
3786 next = fold_binary (PLUS_EXPR, type, high, step); in idx_infer_loop_bounds()
4770 e = fold_binary (cmp, boolean_type_node, in n_of_executions_at_most()
4834 && (e = fold_binary (GT_EXPR, boolean_type_node, valid_niter, in loop_exits_before_overflow()
H A Dtree-ssa-reassoc.cc2433 tree folded = fold_binary (opcode, TREE_TYPE (oelm1->op), in optimize_ops_list()
2697 tree tem = fold_binary (LT_EXPR, boolean_type_node, in range_entry_cmp()
2701 tem = fold_binary (GT_EXPR, boolean_type_node, in range_entry_cmp()
2717 tree tem = fold_binary (LT_EXPR, boolean_type_node, in range_entry_cmp()
2721 tem = fold_binary (GT_EXPR, boolean_type_node, in range_entry_cmp()
3052 lowxor = fold_binary (BIT_XOR_EXPR, type, lowi, lowj); in optimize_range_tests_xor()
3057 highxor = fold_binary (BIT_XOR_EXPR, type, highi, highj); in optimize_range_tests_xor()
3107 tem1 = fold_binary (MINUS_EXPR, type, highi, lowi); in optimize_range_tests_diff()
3110 tem2 = fold_binary (MINUS_EXPR, type, highj, lowj); in optimize_range_tests_diff()
3114 tem1 = fold_binary (MINUS_EXPR, type, lowj, lowi); in optimize_range_tests_diff()
[all …]
H A Dfold-const.h62 #define fold_binary(CODE,T1,T2,T3)\ macro
/netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/
H A Dsvalue.cc864 = fold_binary (op, boolean_type_node, lhs_const, rhs_const); in eval_condition()
1565 tree iter_gt_base = fold_binary (GT_EXPR, boolean_type_node, in get_direction()
1570 tree iter_lt_base = fold_binary (LT_EXPR, boolean_type_node, in get_direction()
1606 tree base_op_rhs = fold_binary (op, boolean_type_node, in eval_condition_without_cm()
1620 tree base_op_rhs = fold_binary (op, boolean_type_node, in eval_condition_without_cm()
1633 tree base_le_rhs = fold_binary (LE_EXPR, boolean_type_node, in eval_condition_without_cm()
1646 tree base_le_rhs = fold_binary (LE_EXPR, boolean_type_node, in eval_condition_without_cm()
H A Dregion-model-manager.cc414 && (fold_binary (LE_EXPR, boolean_type_node, in maybe_fold_unaryop()
612 if (tree result = fold_binary (op, type, cst0, cst1)) in maybe_fold_binop()
1515 = fold_binary (EQ_EXPR, boolean_type_node, parent_size_cst, size_cst); in get_sized_region()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dtree-ssa-dom.c252 fold_binary (MINUS_EXPR, TREE_TYPE (rhs1), in derive_equivalences()
258 fold_binary (MINUS_EXPR, TREE_TYPE (rhs1), in derive_equivalences()
277 fold_binary (MINUS_EXPR, TREE_TYPE (rhs1), in derive_equivalences()
283 fold_binary (PLUS_EXPR, TREE_TYPE (rhs1), in derive_equivalences()
H A Dtree-ssa-loop-niter.c1830 tree tem = fold_binary (code, boolean_type_node, iv0->base, iv1->base); in number_of_iterations_cond()
2234 e = fold_binary (TRUTH_OR_EXPR, boolean_type_node, notcond, expr); in tree_simplify_using_condition_1()
2239 e = fold_binary (TRUTH_AND_EXPR, boolean_type_node, cond, expr); in tree_simplify_using_condition_1()
3077 acnd = fold_binary (cmp, boolean_type_node, aval[0], aval[1]); in loop_niter_by_eval()
3295 tree tem = fold_binary (GE_EXPR, boolean_type_node, op0, in derive_constant_upper_bound_ops()
3662 next = fold_binary (PLUS_EXPR, type, low, step); in idx_infer_loop_bounds()
3664 next = fold_binary (PLUS_EXPR, type, high, step); in idx_infer_loop_bounds()
4647 e = fold_binary (cmp, boolean_type_node, in n_of_executions_at_most()
4711 && (e = fold_binary (GT_EXPR, boolean_type_node, valid_niter, in loop_exits_before_overflow()
H A Dtree-ssa-reassoc.c2357 tree folded = fold_binary (opcode, TREE_TYPE (oelm1->op), in optimize_ops_list()
2606 tree tem = fold_binary (LT_EXPR, boolean_type_node, in range_entry_cmp()
2610 tem = fold_binary (GT_EXPR, boolean_type_node, in range_entry_cmp()
2626 tree tem = fold_binary (LT_EXPR, boolean_type_node, in range_entry_cmp()
2630 tem = fold_binary (GT_EXPR, boolean_type_node, in range_entry_cmp()
2887 lowxor = fold_binary (BIT_XOR_EXPR, type, lowi, lowj); in optimize_range_tests_xor()
2892 highxor = fold_binary (BIT_XOR_EXPR, type, highi, highj); in optimize_range_tests_xor()
2942 tem1 = fold_binary (MINUS_EXPR, type, highi, lowi); in optimize_range_tests_diff()
2945 tem2 = fold_binary (MINUS_EXPR, type, highj, lowj); in optimize_range_tests_diff()
2949 tem1 = fold_binary (MINUS_EXPR, type, lowj, lowi); in optimize_range_tests_diff()
[all …]
H A Dfold-const.h51 #define fold_binary(CODE,T1,T2,T3)\ macro
H A Dtree-ssa-threadbackward.c327 arg = fold_binary (cond_code, boolean_type_node, in profitable_jump_thread_path()
/netbsd-src/external/gpl3/binutils.old/dist/ld/
H A DChangeLog-200420 * ldexp.c (fold_binary) <case DATA_SEGMENT_ALIGN>: Initialize them.
158 (fold_binary): Likewise.
410 (fold_binary): Add it here. Insert padding to make relro_end
471 * ldexp.c (fold_binary) [DATA_SEGMENT_ALIGN]: Adjust data segment
528 * ldexp.c (fold_binary) [DATA_SEGMENT_ALIGN]: Apply data segment
991 (fold_binary): Handle -z relro.
1256 * ldexp.c (fold_binary): Add ALIGN_K case.
H A DChangeLog-2005822 (fold_binary, fold_trinary, fold_name, exp_fold_tree_1): Likewise.
827 (fold_binary <DATA_SEGMENT_ALIGN, DATA_SEGMENT_RELRO_END, >): Ditto.
828 (fold_binary <'%','/'>): Don't error if marking.
924 Call fold_binary on etree_binary.
944 * ldexp.c (new_rel, new_rel_from_section, fold_unary, fold_binary,
1040 (fold_binary): Likewise.
H A DChangeLog-2011979 * ldexp.c (fold_binary): Set result section for arithmetic and
1040 (fold_binary <DATA_SEGMENT_ALIGN>): Likewise.
1041 (fold_binary <DATA_SEGMENT_RELRO_END>): Likewise. Also test
H A DChangeLog-2008282 * ldexp.c (fold_binary): Evaluate rhs when lhs not valid.
345 * ldexp.c (fold_binary <DATA_SEGMENT_ALIGN>): Do not align
770 (fold_binary <SEGMENT_START>): Set expld.result.section to
H A DChangeLog-2015630 * ldexp.c (fold_binary <DATA_SEGMENT_ALIGN>): Don't set min_base.
631 (fold_binary <DATA_SEGMENT_RELRO_END>): Do set relro_offset.
802 * ldexp.c (fold_binary <DATA_SEGMENT_RELRO_END>): Comment.
/netbsd-src/external/gpl3/binutils/dist/ld/
H A DChangeLog-200420 * ldexp.c (fold_binary) <case DATA_SEGMENT_ALIGN>: Initialize them.
158 (fold_binary): Likewise.
410 (fold_binary): Add it here. Insert padding to make relro_end
471 * ldexp.c (fold_binary) [DATA_SEGMENT_ALIGN]: Adjust data segment
528 * ldexp.c (fold_binary) [DATA_SEGMENT_ALIGN]: Apply data segment
991 (fold_binary): Handle -z relro.
1256 * ldexp.c (fold_binary): Add ALIGN_K case.
H A DChangeLog-2005822 (fold_binary, fold_trinary, fold_name, exp_fold_tree_1): Likewise.
827 (fold_binary <DATA_SEGMENT_ALIGN, DATA_SEGMENT_RELRO_END, >): Ditto.
828 (fold_binary <'%','/'>): Don't error if marking.
924 Call fold_binary on etree_binary.
944 * ldexp.c (new_rel, new_rel_from_section, fold_unary, fold_binary,
1040 (fold_binary): Likewise.
H A DChangeLog-2011979 * ldexp.c (fold_binary): Set result section for arithmetic and
1040 (fold_binary <DATA_SEGMENT_ALIGN>): Likewise.
1041 (fold_binary <DATA_SEGMENT_RELRO_END>): Likewise. Also test
H A DChangeLog-2015630 * ldexp.c (fold_binary <DATA_SEGMENT_ALIGN>): Don't set min_base.
631 (fold_binary <DATA_SEGMENT_RELRO_END>): Do set relro_offset.
802 * ldexp.c (fold_binary <DATA_SEGMENT_RELRO_END>): Comment.
H A DChangeLog-2008282 * ldexp.c (fold_binary): Evaluate rhs when lhs not valid.
345 * ldexp.c (fold_binary <DATA_SEGMENT_ALIGN>): Do not align
770 (fold_binary <SEGMENT_START>): Set expld.result.section to
H A Dldexp.c537 fold_binary (etree_type *tree) in fold_binary() function
1076 fold_binary (tree); in exp_fold_tree_1()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/analyzer/
H A Dconstraint-manager.cc149 tree comparison = fold_binary (EQ_EXPR, boolean_type_node, in constrained_to_single_element()
935 tree eq = fold_binary (EQ_EXPR, boolean_type_node, in get_or_add_equiv_class()
972 = fold_binary (LT_EXPR, boolean_type_node, in get_or_add_equiv_class()
1019 = fold_binary (op, boolean_type_node, lhs_const, rhs_const); in eval_condition()

1234