| /openbsd-src/gnu/gcc/gcc/ |
| H A D | tree-ssa-loop-niter.c | 153 c = fold_build2 (MINUS_EXPR, niter_type, in number_of_iterations_ne()
160 c = fold_build2 (MINUS_EXPR, niter_type, in number_of_iterations_ne()
223 mod = fold_build2 (MINUS_EXPR, niter_type, step, mod); in number_of_iterations_lt_to_ne()
233 bound = fold_build2 (MINUS_EXPR, type, in number_of_iterations_lt_to_ne()
260 fold_build2 (MINUS_EXPR, type, in number_of_iterations_lt_to_ne()
301 d = fold_build2 (MINUS_EXPR, niter_type, in assert_no_overflow_lt()
307 diff = fold_build2 (MINUS_EXPR, niter_type, step, in assert_no_overflow_lt()
309 bound = fold_build2 (MINUS_EXPR, type, in assert_no_overflow_lt()
322 d = fold_build2 (MINUS_EXPR, niter_type, in assert_no_overflow_lt()
328 diff = fold_build2 (MINUS_EXPR, niter_type, step, in assert_no_overflow_lt()
[all …]
|
| H A D | tree-complex.c | 235 case MINUS_EXPR: in init_dont_simulate_again()
294 case MINUS_EXPR: in complex_visit_stmt()
824 if (code == MINUS_EXPR) in expand_complex_addition()
825 ri = gimplify_build2 (bsi, MINUS_EXPR, inner_type, ai, bi); in expand_complex_addition()
831 if (code == MINUS_EXPR) in expand_complex_addition()
832 rr = gimplify_build2 (bsi, MINUS_EXPR, inner_type, ar, br); in expand_complex_addition()
854 if (code == MINUS_EXPR) in expand_complex_addition()
861 if (code == MINUS_EXPR) in expand_complex_addition()
996 rr = gimplify_build2 (bsi, MINUS_EXPR, inner_type, t1, t2); in expand_complex_multiplication()
1031 t3 = gimplify_build2 (bsi, MINUS_EXPR, inner_type, t1, t2); in expand_complex_div_straight()
[all …]
|
| H A D | fold-const.c | 1099 case MINUS_EXPR: in negate_expr_p()
1226 return fold_build2 (MINUS_EXPR, type, in fold_negate_expr()
1234 return fold_build2 (MINUS_EXPR, type, in fold_negate_expr()
1240 case MINUS_EXPR: in fold_negate_expr()
1244 return fold_build2 (MINUS_EXPR, type, in fold_negate_expr()
1417 && ((code == PLUS_EXPR && TREE_CODE (in) == MINUS_EXPR) in split_tree()
1418 || (code == MINUS_EXPR && TREE_CODE (in) == PLUS_EXPR)))) in split_tree()
1422 int neg1_p = TREE_CODE (in) == MINUS_EXPR; in split_tree()
1487 || TREE_CODE (t1) == MINUS_EXPR || TREE_CODE (t2) == MINUS_EXPR) in associate_trees()
1492 return build2 (MINUS_EXPR, type, fold_convert (type, t2), in associate_trees()
[all …]
|
| H A D | c-omp.c | 180 case MINUS_EXPR: in check_omp_for_incr_expr()
183 return fold_build2 (MINUS_EXPR, TREE_TYPE (exp), t, TREE_OPERAND (exp, 1)); in check_omp_for_incr_expr()
342 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR in c_finish_omp_for()
|
| H A D | tree-vrp.c | 671 || TREE_CODE (expr) == MINUS_EXPR) in valid_value_p()
706 || TREE_CODE (val1) == MINUS_EXPR) in compare_values_warnv()
709 || TREE_CODE (val2) == MINUS_EXPR)) in compare_values_warnv()
735 code1 = code1 == MINUS_EXPR ? PLUS_EXPR : MINUS_EXPR; in compare_values_warnv()
757 code2 = code2 == MINUS_EXPR ? PLUS_EXPR : MINUS_EXPR; in compare_values_warnv()
784 else if (code2 == MINUS_EXPR) in compare_values_warnv()
796 else if (code2 == MINUS_EXPR) in compare_values_warnv()
800 else if (code1 == MINUS_EXPR) in compare_values_warnv()
808 else if (code2 == MINUS_EXPR) in compare_values_warnv()
1181 max = fold_build2 (MINUS_EXPR, type, max, one); in extract_range_from_assert()
[all …]
|
| H A D | tree-mudflap.c | 668 fold_build2 (MINUS_EXPR, mf_uintptr_type, mf_limit, mf_base), in mf_build_check_statement_for()
831 limit = fold_build2 (MINUS_EXPR, mf_uintptr_type, in mf_xform_derefs_1()
842 limit = fold_build2 (MINUS_EXPR, ptr_type_node, in mf_xform_derefs_1()
850 limit = fold_build2 (MINUS_EXPR, ptr_type_node, in mf_xform_derefs_1()
884 limit = fold_build2 (MINUS_EXPR, ptr_type_node, in mf_xform_derefs_1()
|
| H A D | tree-ssa-loop-manip.c | 82 incr_op = MINUS_EXPR; in create_iv()
93 incr_op = MINUS_EXPR; in create_iv()
746 delta = fold_build2 (MINUS_EXPR, type, bigstep, step); in determine_exit_conditions()
757 bound = fold_build2 (MINUS_EXPR, type, bound, delta); in determine_exit_conditions()
|
| H A D | tree-vect-generic.c | 194 result_low = gimplify_build2 (bsi, MINUS_EXPR, word_type, high_bits, b_low); in do_negate()
303 case MINUS_EXPR: in expand_vector_operation()
425 op = optab_for_tree_code (MINUS_EXPR, type); in expand_vector_operations_1()
|
| H A D | convert.c | 265 case MINUS_EXPR: in convert_to_real()
615 case MINUS_EXPR: in convert_to_integer()
671 || ex_form == MINUS_EXPR))) in convert_to_integer()
|
| H A D | tree-ssa-ccp.c | 1559 elt_offset = int_const_binop (MINUS_EXPR, elt_offset, low_bound, 0); in maybe_fold_offset_to_array_ref()
1705 t = int_const_binop (MINUS_EXPR, offset, field_offset, 1); in maybe_fold_offset_to_component_ref()
1720 offset = int_const_binop (MINUS_EXPR, offset, byte_position (f), 1); in maybe_fold_offset_to_component_ref()
1860 bool subtract = (TREE_CODE (expr) == MINUS_EXPR); in maybe_fold_stmt_addition()
1907 array_idx = int_const_binop (MINUS_EXPR, array_idx, in maybe_fold_stmt_addition()
1924 op1 = int_const_binop (subtract ? MINUS_EXPR : PLUS_EXPR, in maybe_fold_stmt_addition()
2018 case MINUS_EXPR: in fold_stmt_r()
|
| H A D | stmt.c | 2250 lo = tree_low_cst (fold_build2 (MINUS_EXPR, index_type, in emit_case_bit_tests()
2252 hi = tree_low_cst (fold_build2 (MINUS_EXPR, index_type, in emit_case_bit_tests()
2263 index_expr = fold_build2 (MINUS_EXPR, index_type, in emit_case_bit_tests()
2427 range = fold_build2 (MINUS_EXPR, index_type, maxval, minval); in expand_case()
2554 = tree_low_cst (fold_build2 (MINUS_EXPR, index_type, in expand_case()
2557 = tree_low_cst (fold_build2 (MINUS_EXPR, index_type, in expand_case()
2832 low_minus_one = fold_build2 (MINUS_EXPR, TREE_TYPE (node->low), in node_has_low_bound()
3292 new_bound = expand_expr (fold_build2 (MINUS_EXPR, type, in emit_case_nodes()
|
| H A D | expr.h | 144 (TO).var = size_binop (MINUS_EXPR, ssize_int (0), \
147 (TO).var = size_binop (MINUS_EXPR, (TO).var, \
|
| H A D | tree-ssa-loop-ivopts.c | 867 case MINUS_EXPR: in determine_base_object()
1814 case MINUS_EXPR: in strip_offset_1()
2598 case MINUS_EXPR: in constant_multiple_of()
2603 if (code == MINUS_EXPR) in constant_multiple_of()
2822 case MINUS_EXPR: in tree_to_aff_combination()
2825 if (code == MINUS_EXPR) in tree_to_aff_combination()
2896 return fold_build2 (MINUS_EXPR, type, expr, elt); in add_elt_to_tree()
2906 code = MINUS_EXPR; in add_elt_to_tree()
3147 delta = fold_build2 (MINUS_EXPR, common_type, ubase, cbase); in get_computation_aff()
3157 expr = fold_build2 (MINUS_EXPR, uutype, delta, expr); in get_computation_aff()
[all …]
|
| H A D | tree-scalar-evolution.c | 875 if (code == MINUS_EXPR) in add_to_evolution()
1166 case MINUS_EXPR: in follow_ssa_edge_in_rhs()
1182 MINUS_EXPR, rhs1, at_stmt); in follow_ssa_edge_in_rhs()
1640 case MINUS_EXPR: in interpret_rhs_modify_expr()
1830 || code == MINUS_EXPR) in fold_used_pointer()
2264 case MINUS_EXPR: in instantiate_parameters_1()
|
| H A D | tree-ssa-forwprop.c | 218 || TREE_CODE (def_rhs) == MINUS_EXPR) in forward_propagate_into_cond_1()
246 ? MINUS_EXPR : PLUS_EXPR); in forward_propagate_into_cond_1()
|
| H A D | tree-ssa-reassoc.c | 711 case MINUS_EXPR: in eliminate_using_constants()
1235 TREE_SET_CODE (rhs, MINUS_EXPR); in repropagate_negates()
1287 if (TREE_CODE (rhs) == MINUS_EXPR) in break_up_subtract_bb()
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/ |
| H A D | fold-const.c | 865 case MINUS_EXPR:
869 fold (build (MINUS_EXPR, TREE_TYPE (t),
925 && ((code == PLUS_EXPR && TREE_CODE (in) == MINUS_EXPR)
926 || (code == MINUS_EXPR && TREE_CODE (in) == PLUS_EXPR))))
930 int neg1_p = TREE_CODE (in) == MINUS_EXPR;
998 || TREE_CODE (t1) == MINUS_EXPR || TREE_CODE (t2) == MINUS_EXPR)
1003 return build (MINUS_EXPR, type, convert (type, t2),
1006 return build (MINUS_EXPR, type, convert (type, t1),
1089 case MINUS_EXPR:
1284 case MINUS_EXPR:
[all …]
|
| H A D | expr.h | 102 (TO).var = size_binop (MINUS_EXPR, ssize_int (0), \
105 (TO).var = size_binop (MINUS_EXPR, (TO).var, \
|
| /openbsd-src/gnu/gcc/gcc/cp/ |
| H A D | init.c | 221 max_index = fold_build2 (MINUS_EXPR, TREE_TYPE (nelts), in build_zero_init()
1636 index = size_binop (MINUS_EXPR, index, size_one_node); in build_new_1()
1858 cookie_ptr = build2 (MINUS_EXPR, build_pointer_type (sizetype), in build_new_1()
1867 cookie_ptr = build2 (MINUS_EXPR, build_pointer_type (sizetype), in build_new_1()
1908 cp_build_binary_op (MINUS_EXPR, outer_nelts, in build_new_1()
2256 build2 (MINUS_EXPR, ptype, tbase, size_exp))); in build_vec_delete_1()
2285 cp_build_binary_op (MINUS_EXPR, in build_vec_delete_1()
2628 tree m = cp_build_binary_op (MINUS_EXPR, maxindex, iterator); in build_vec_init()
2977 cookie_addr = build2 (MINUS_EXPR, in build_vec_delete()
|
| H A D | operators.def | 109 DEF_SIMPLE_OPERATOR ("-", MINUS_EXPR, "mi", 2)
138 DEF_ASSN_OPERATOR ("-=", MINUS_EXPR, "mI", 2)
|
| H A D | cvt.c | 155 code = MINUS_EXPR; in cp_convert_to_pointer()
191 code = MINUS_EXPR; in cp_convert_to_pointer()
320 code = MINUS_EXPR; in convert_to_pointer_force()
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/cp/ |
| H A D | operators.def | 107 DEF_SIMPLE_OPERATOR ("-", MINUS_EXPR, "mi", 2)
139 DEF_ASSN_OPERATOR ("-=", MINUS_EXPR, "mI", 2)
|
| H A D | cvt.c | 168 code = MINUS_EXPR;
195 code = MINUS_EXPR;
318 code = MINUS_EXPR;
|
| H A D | init.c | 2360 cookie = build (MINUS_EXPR, build_pointer_type (sizetype),
2384 cp_build_binary_op (MINUS_EXPR, outer_nelts,
2436 delete_node = fold (build (MINUS_EXPR, TREE_TYPE (alloc_node),
2597 build_modify_expr (tbase, NOP_EXPR, build (MINUS_EXPR, ptype, tbase, size_exp)),
2633 cp_build_binary_op (MINUS_EXPR,
2988 tree m = cp_build_binary_op (MINUS_EXPR, maxindex, iterator);
3395 cookie_addr = build (MINUS_EXPR,
|
| /openbsd-src/gnu/usr.bin/gcc/gcc/testsuite/gcc.c-torture/execute/ |
| H A D | 20000914-1.c | 62 MINUS_EXPR, enumerator
|