Home
last modified time | relevance | path

Searched refs:MODIFY_EXPR (Results 1 – 25 of 172) sorted by relevance

1234567

/openbsd-src/gnu/gcc/gcc/
H A Dvalue-prof.c196 stmt1 = build2 (MODIFY_EXPR, optype, tmpv, fold_convert (optype, value)); in tree_divmod_fixed_value()
197 stmt2 = build2 (MODIFY_EXPR, optype, tmp1, op2); in tree_divmod_fixed_value()
209 stmt1 = build2 (MODIFY_EXPR, optype, tmp2, in tree_divmod_fixed_value()
216 stmt1 = build2 (MODIFY_EXPR, optype, tmp2, in tree_divmod_fixed_value()
272 && TREE_CODE (TREE_OPERAND (stmt, 0)) == MODIFY_EXPR) in tree_divmod_fixed_value_transform()
274 if (TREE_CODE (modify) != MODIFY_EXPR) in tree_divmod_fixed_value_transform()
360 stmt2 = build2 (MODIFY_EXPR, optype, tmp2, in tree_mod_pow2()
362 stmt3 = build2 (MODIFY_EXPR, optype, tmp3, in tree_mod_pow2()
376 stmt1 = build2 (MODIFY_EXPR, optype, result, in tree_mod_pow2()
383 stmt1 = build2 (MODIFY_EXPR, optype, result, in tree_mod_pow2()
[all …]
H A Dtree-nrv.c136 else if (TREE_CODE (stmt) == MODIFY_EXPR in tree_nrv()
166 else if (TREE_CODE (stmt) == MODIFY_EXPR) in tree_nrv()
208 if (TREE_CODE (*tp) == MODIFY_EXPR in tree_nrv()
300 if (TREE_CODE (stmt) == MODIFY_EXPR in execute_return_slot_opt()
H A Dtree-vect-transform.c180 vec_stmt = build2 (MODIFY_EXPR, void_type_node, addr_expr, addr_base); in vect_create_addr_base_for_vector_ref()
325 vec_stmt = build2 (MODIFY_EXPR, void_type_node, vect_ptr, vec_stmt); in vect_create_data_ref_ptr()
421 init_stmt = build2 (MODIFY_EXPR, vectype, new_var, vector_var); in vect_init_vector()
901 epilog_stmt = build2 (MODIFY_EXPR, vectype, vec_dest, in vect_create_epilog_for_reduction()
959 epilog_stmt = build2 (MODIFY_EXPR, vectype, vec_dest, in vect_create_epilog_for_reduction()
965 epilog_stmt = build2 (MODIFY_EXPR, vectype, vec_dest, in vect_create_epilog_for_reduction()
996 epilog_stmt = build2 (MODIFY_EXPR, scalar_type, new_scalar_dest, rhs); in vect_create_epilog_for_reduction()
1010 epilog_stmt = build2 (MODIFY_EXPR, scalar_type, new_scalar_dest, in vect_create_epilog_for_reduction()
1016 epilog_stmt = build2 (MODIFY_EXPR, scalar_type, new_scalar_dest, in vect_create_epilog_for_reduction()
1046 epilog_stmt = build2 (MODIFY_EXPR, scalar_type, new_scalar_dest, rhs); in vect_create_epilog_for_reduction()
[all …]
H A Dtree-tailcall.c398 if (TREE_CODE (stmt) == MODIFY_EXPR) in find_tail_calls()
495 if (TREE_CODE (stmt) != MODIFY_EXPR) in find_tail_calls()
505 && TREE_CODE (ret_var) == MODIFY_EXPR) in find_tail_calls()
561 stmt = build2 (MODIFY_EXPR, ret_type, NULL_TREE, in adjust_accumulator_values()
575 stmt = build2 (MODIFY_EXPR, ret_type, NULL_TREE, in adjust_accumulator_values()
585 stmt = build2 (MODIFY_EXPR, ret_type, NULL_TREE, in adjust_accumulator_values()
628 if (TREE_CODE (ret_var) == MODIFY_EXPR) in adjust_return_value()
640 stmt = build2 (MODIFY_EXPR, ret_type, NULL_TREE, in adjust_return_value()
655 stmt = build2 (MODIFY_EXPR, ret_type, NULL_TREE, in adjust_return_value()
736 if (TREE_CODE (stmt) == MODIFY_EXPR) in eliminate_tail_call()
[all …]
H A Dtree-ssa-forwprop.c165 if (TREE_CODE (def) == MODIFY_EXPR) in ssa_name_defined_by_comparison_p()
208 if (TREE_CODE (def) != MODIFY_EXPR) in forward_propagate_into_cond_1()
432 && TREE_CODE (def_stmt) == MODIFY_EXPR in find_equivalent_equality_comparison()
438 if (def_stmt && TREE_CODE (def_stmt) == MODIFY_EXPR) in find_equivalent_equality_comparison()
614 if (TREE_CODE (offset) != MODIFY_EXPR) in forward_propagate_addr_into_variable_array_index()
633 if (TREE_CODE (offset) != MODIFY_EXPR) in forward_propagate_addr_into_variable_array_index()
840 if (TREE_CODE (use_stmt) != MODIFY_EXPR) in forward_propagate_addr_expr()
891 if (TREE_CODE (rhs_def_stmt) == MODIFY_EXPR in simplify_not_neg_expr()
921 if (TREE_CODE (def) == MODIFY_EXPR) in simplify_switch_expr()
984 if (TREE_CODE (stmt) == MODIFY_EXPR) in tree_ssa_forward_propagate_single_use_vars()
H A Dgimple-low.c141 x = build2 (MODIFY_EXPR, void_type_node, disp_var, t); in lower_function_body()
257 case MODIFY_EXPR: in lower_stmt()
439 case MODIFY_EXPR: in block_may_fallthru()
563 if (value && TREE_CODE (value) == MODIFY_EXPR) in lower_return_expr()
570 if (tvalue && TREE_CODE (tvalue) == MODIFY_EXPR) in lower_return_expr()
657 if (TREE_CODE (stmt) == MODIFY_EXPR) in lower_builtin_setjmp()
678 t = build2 (MODIFY_EXPR, void_type_node, dest, integer_zero_node); in lower_builtin_setjmp()
702 t = build2 (MODIFY_EXPR, void_type_node, dest, integer_one_node); in lower_builtin_setjmp()
H A Dtree-ssa-phiopt.c442 new1 = build2 (MODIFY_EXPR, TREE_TYPE (old_result), new_var, new1); in conditional_replacement()
473 new = build2 (MODIFY_EXPR, TREE_TYPE (new_var1), new_var1, cond); in conditional_replacement()
517 new = build2 (MODIFY_EXPR, TREE_TYPE (cond_tmp), cond_tmp, op0); in conditional_replacement()
524 new = build2 (MODIFY_EXPR, TREE_TYPE (new_var1), new_var1, cond); in conditional_replacement()
718 || TREE_CODE (assign) != MODIFY_EXPR) in minmax_replacement()
856 new = build2 (MODIFY_EXPR, type, result, in minmax_replacement()
904 if (TREE_CODE (assign) != MODIFY_EXPR) in abs_replacement()
969 new = build2 (MODIFY_EXPR, TREE_TYPE (lhs), in abs_replacement()
981 new = build2 (MODIFY_EXPR, TREE_TYPE (result), in abs_replacement()
H A Dtree-ssa-propagate.c534 if (!stmt || TREE_CODE (stmt) != MODIFY_EXPR) in get_rhs()
538 case MODIFY_EXPR: in get_rhs()
653 if (TREE_CODE (op) != MODIFY_EXPR) in set_rhs()
661 case MODIFY_EXPR: in set_rhs()
772 if (TREE_CODE (stmt) != MODIFY_EXPR) in stmt_makes_single_load()
797 if (TREE_CODE (stmt) != MODIFY_EXPR) in stmt_makes_single_store()
1089 if (TREE_CODE (stmt) == MODIFY_EXPR in fold_predicate_in()
1169 if (TREE_CODE (stmt) == MODIFY_EXPR in substitute_and_fold()
H A Dtree-eh.c118 if (TREE_CODE (t) == MODIFY_EXPR in add_stmt_to_eh_region_fn()
147 if (TREE_CODE (t) == MODIFY_EXPR in remove_stmt_from_eh_region_fn()
627 case MODIFY_EXPR: in do_return_redirection()
649 x = build2 (MODIFY_EXPR, TREE_TYPE (new), new, old); in do_return_redirection()
655 x = build2 (MODIFY_EXPR, TREE_TYPE (result), result, new); in do_return_redirection()
845 x = build2 (MODIFY_EXPR, void_type_node, save_eptr, x); in honor_protect_cleanup_actions()
849 x = build2 (MODIFY_EXPR, void_type_node, save_filt, x); in honor_protect_cleanup_actions()
854 x = build2 (MODIFY_EXPR, void_type_node, x, save_eptr); in honor_protect_cleanup_actions()
858 x = build2 (MODIFY_EXPR, void_type_node, x, save_filt); in honor_protect_cleanup_actions()
1180 x = build2 (MODIFY_EXPR, void_type_node, finally_tmp, in lower_try_finally_switch()
[all …]
H A Dtree-mudflap.c461 t = build2 (MODIFY_EXPR, TREE_TYPE (mf_cache_shift_decl_l), in mf_decl_cache_locals()
467 t = build2 (MODIFY_EXPR, TREE_TYPE (mf_cache_mask_decl_l), in mf_decl_cache_locals()
556 t = build2 (MODIFY_EXPR, void_type_node, mf_base, in mf_build_check_statement_for()
564 t = build2 (MODIFY_EXPR, void_type_node, mf_limit, in mf_build_check_statement_for()
580 t = build2 (MODIFY_EXPR, void_type_node, mf_elem, t); in mf_build_check_statement_for()
626 t = build2 (MODIFY_EXPR, boolean_type_node, cond, t); in mf_build_check_statement_for()
679 t = build2 (MODIFY_EXPR, void_type_node, in mf_build_check_statement_for()
683 t = build2 (MODIFY_EXPR, void_type_node, in mf_build_check_statement_for()
915 case MODIFY_EXPR: in mf_xform_derefs()
925 if (TREE_CODE (TREE_OPERAND (s, 0)) == MODIFY_EXPR) in mf_xform_derefs()
H A Dc-omp.c136 gcc_assert (TREE_CODE (x) == MODIFY_EXPR); in c_finish_omp_atomic()
242 gcc_assert (TREE_CODE (init) == MODIFY_EXPR); in c_finish_omp_for()
333 case MODIFY_EXPR: in c_finish_omp_for()
352 incr = build2 (MODIFY_EXPR, void_type_node, decl, t); in c_finish_omp_for()
H A Dtree-profile.c109 tree stmt1 = build2 (MODIFY_EXPR, gcov_type_node, tmp1, ref); in tree_gen_edge_profiler()
110 tree stmt2 = build2 (MODIFY_EXPR, gcov_type_node, tmp2, in tree_gen_edge_profiler()
113 tree stmt3 = build2 (MODIFY_EXPR, gcov_type_node, ref, tmp2); in tree_gen_edge_profiler()
H A Dtree-vect-patterns.c92 if (TREE_CODE (*def_stmt) != MODIFY_EXPR) in widened_name_p()
167 if (TREE_CODE (last_stmt) != MODIFY_EXPR) in vect_recog_dot_prod_pattern()
387 if (TREE_CODE (last_stmt) != MODIFY_EXPR) in vect_recog_widen_sum_pattern()
521 pattern_expr = build2 (MODIFY_EXPR, void_type_node, var_name, pattern_expr); in vect_pattern_recog_1()
H A Dtree-gimple.c236 case MODIFY_EXPR: in is_gimple_stmt()
433 if (TREE_CODE (t) == MODIFY_EXPR) in get_call_expr_in()
479 case MODIFY_EXPR: in recalculate_side_effects()
H A Dtree-complex.c209 if (!stmt || TREE_CODE (stmt) != MODIFY_EXPR) in init_dont_simulate_again()
213 case MODIFY_EXPR: in init_dont_simulate_again()
270 if (TREE_CODE (stmt) != MODIFY_EXPR) in complex_visit_stmt()
535 last = build2 (MODIFY_EXPR, TREE_TYPE (comp), comp, value); in set_component_ssa_name()
776 x = build2 (MODIFY_EXPR, inner_type, x, r); in expand_complex_move()
789 x = build2 (MODIFY_EXPR, inner_type, x, i); in expand_complex_move()
1125 t1 = build2 (MODIFY_EXPR, inner_type, rr, tr); in expand_complex_div_wide()
1127 t1 = build2 (MODIFY_EXPR, inner_type, ri, ti); in expand_complex_div_wide()
1164 t1 = build2 (MODIFY_EXPR, inner_type, rr, tr); in expand_complex_div_wide()
1166 t1 = build2 (MODIFY_EXPR, inner_type, ri, ti); in expand_complex_div_wide()
[all …]
H A Dlambda-code.c1545 stmt = build2 (MODIFY_EXPR, void_type_node, resvar, integer_zero_node); in lbv_to_gcc_expression()
1560 stmt = build2 (MODIFY_EXPR, void_type_node, resvar, in lbv_to_gcc_expression()
1570 stmt = build2 (MODIFY_EXPR, void_type_node, resvar, in lbv_to_gcc_expression()
1585 stmt = build2 (MODIFY_EXPR, void_type_node, resvar, in lbv_to_gcc_expression()
1636 stmt = build2 (MODIFY_EXPR, void_type_node, resvar, integer_zero_node); in lle_to_gcc_expression()
1667 stmt = build2 (MODIFY_EXPR, void_type_node, resvar, mult); in lle_to_gcc_expression()
1675 stmt = build2 (MODIFY_EXPR, void_type_node, resvar, in lle_to_gcc_expression()
1708 stmt = build2 (MODIFY_EXPR, void_type_node, resvar, mult); in lle_to_gcc_expression()
1716 stmt = build2 (MODIFY_EXPR, void_type_node, resvar, in lle_to_gcc_expression()
1730 stmt = build2 (MODIFY_EXPR, void_type_node, resvar, in lle_to_gcc_expression()
[all …]
H A Domp-low.c160 gcc_assert (TREE_CODE (t) == MODIFY_EXPR); in extract_omp_for_data()
190 gcc_assert (TREE_CODE (t) == MODIFY_EXPR); in extract_omp_for_data()
1686 x = build2 (MODIFY_EXPR, void_type_node, ptr, x); in lower_rec_input_clauses()
1722 x = build2 (MODIFY_EXPR, void_type_node, new_var, x); in lower_rec_input_clauses()
1805 x = build2 (MODIFY_EXPR, void_type_node, new_var, x); in lower_rec_input_clauses()
1970 x = build2 (MODIFY_EXPR, void_type_node, ref, x); in lower_reduction_clauses()
2009 x = build2 (MODIFY_EXPR, void_type_node, ref, x); in lower_copyprivate_clauses()
2090 x = build2 (MODIFY_EXPR, void_type_node, ref, x); in lower_send_clauses()
2097 x = build2 (MODIFY_EXPR, void_type_node, var, ref); in lower_send_clauses()
2134 x = build2 (MODIFY_EXPR, void_type_node, x, var); in lower_send_shared_vars()
[all …]
H A Dtree-ssa-math-opts.c277 return TREE_CODE (use_stmt) == MODIFY_EXPR in is_division_by()
306 new_stmt = build2 (MODIFY_EXPR, void_type_node, recip_def, in insert_reciprocals()
493 if (TREE_CODE (stmt) == MODIFY_EXPR in execute_cse_reciprocals()
H A Dtree-ssa-reassoc.c274 if (TREE_CODE (stmt) != MODIFY_EXPR in get_rank()
381 && TREE_CODE (stmt) == MODIFY_EXPR in is_reassociable_op()
398 if (TREE_CODE (stmt) != MODIFY_EXPR) in get_unary_op()
1008 if (TREE_CODE (immusestmt) == MODIFY_EXPR) in get_single_immediate_use()
1035 && TREE_CODE (negatedef) == MODIFY_EXPR
1216 && TREE_CODE (user) == MODIFY_EXPR in repropagate_negates()
1268 if (TREE_CODE (stmt) == MODIFY_EXPR) in break_up_subtract_bb()
1311 if (TREE_CODE (stmt) == MODIFY_EXPR) in reassociate_bb()
H A Dtree-object-size.c691 gcc_assert (TREE_CODE (TREE_OPERAND (stmt, 0)) == MODIFY_EXPR); in collect_object_sizes_for()
695 case MODIFY_EXPR: in collect_object_sizes_for()
817 gcc_assert (TREE_CODE (TREE_OPERAND (stmt, 0)) == MODIFY_EXPR); in check_for_plus_in_loops_1()
821 case MODIFY_EXPR: in check_for_plus_in_loops_1()
895 gcc_assert (TREE_CODE (TREE_OPERAND (stmt, 0)) == MODIFY_EXPR); in check_for_plus_in_loops()
899 case MODIFY_EXPR: in check_for_plus_in_loops()
H A Dtree-ssa-dom.c1184 if (TREE_CODE (stmt) != MODIFY_EXPR) in simple_iv_increment_p()
1474 if (TREE_CODE (stmt) == MODIFY_EXPR) in eliminate_redundant_computations()
1620 new = build2 (MODIFY_EXPR, TREE_TYPE (stmt), rhs, lhs); in record_equivalences_from_stmt()
1841 && TREE_CODE (TREE_OPERAND (stmt, 0)) == MODIFY_EXPR in optimize_stmt()
1844 || (TREE_CODE (stmt) == MODIFY_EXPR in optimize_stmt()
1853 if (TREE_CODE (stmt) == MODIFY_EXPR) in optimize_stmt()
1930 lhs = TREE_CODE (stmt) == MODIFY_EXPR ? TREE_OPERAND (stmt, 0) : NULL; in lookup_avail_expr()
2103 else if (TREE_CODE (t) == MODIFY_EXPR) in get_rhs_or_phi_arg()
2117 else if (TREE_CODE (t) == MODIFY_EXPR) in get_lhs_or_phi_result()
2240 if (TREE_CODE (use_stmt) == MODIFY_EXPR in propagate_rhs_into_lhs()
[all …]
H A Dgimplify.c1015 || TREE_CODE (temp) == MODIFY_EXPR); in voidify_wrapper_expr()
1044 *save = build2 (MODIFY_EXPR, ptr_type_node, tmp_var, save_call); in build_stack_save_restore()
1150 gcc_assert ((TREE_CODE (ret_expr) == MODIFY_EXPR in gimplify_return_expr()
1193 ret_expr = build2 (MODIFY_EXPR, TREE_TYPE (result), result_decl, result); in gimplify_return_expr()
1248 t = build2 (MODIFY_EXPR, void_type_node, addr, t); in gimplify_decl_expr()
1947 t1 = build2 (MODIFY_EXPR, TREE_TYPE (lvalue), lvalue, t1); in gimplify_self_mod_expr()
2470 = build2 (MODIFY_EXPR, void_type_node, tmp, TREE_OPERAND (expr, 1)); in gimplify_cond_expr()
2475 = build2 (MODIFY_EXPR, void_type_node, tmp2, TREE_OPERAND (expr, 2)); in gimplify_cond_expr()
2765 append_to_statement_list (build2 (MODIFY_EXPR, var_type, var, lower), pre_p); in gimplify_init_ctor_eval_range()
2786 append_to_statement_list (build2 (MODIFY_EXPR, TREE_TYPE (cref), in gimplify_init_ctor_eval_range()
[all …]
H A Dtree-ssa-loop-im.c247 if (TREE_CODE (stmt) != MODIFY_EXPR) in movement_possibility()
629 stmt1 = build2 (MODIFY_EXPR, void_type_node, var, in determine_invariantness_stmt()
635 stmt2 = build2 (MODIFY_EXPR, void_type_node, lhs, in determine_invariantness_stmt()
1073 load = build2 (MODIFY_EXPR, void_type_node, tmp_var, ref); in schedule_sm()
1084 store = build2 (MODIFY_EXPR, void_type_node, in schedule_sm()
1222 if (TREE_CODE (stmt) != MODIFY_EXPR) in gather_mem_refs_stmt()
H A Dtree-ssa-sink.c147 gcc_assert (TREE_CODE (stmt) == MODIFY_EXPR); in is_hidden_global_store()
295 if (TREE_CODE (stmt) != MODIFY_EXPR) in statement_sink_location()
/openbsd-src/gnu/gcc/gcc/cp/
H A Dcp-gimplify.c806 t = build2 (MODIFY_EXPR, void_type_node, p1, start1); in cxx_omp_clause_apply_fn()
812 t = build2 (MODIFY_EXPR, void_type_node, p2, start2); in cxx_omp_clause_apply_fn()
834 t = build2 (MODIFY_EXPR, void_type_node, p1, t); in cxx_omp_clause_apply_fn()
841 t = build2 (MODIFY_EXPR, void_type_node, p2, t); in cxx_omp_clause_apply_fn()
892 ret = build2 (MODIFY_EXPR, void_type_node, dst, src); in cxx_omp_clause_copy_ctor()
908 ret = build2 (MODIFY_EXPR, void_type_node, dst, src); in cxx_omp_clause_assign_op()

1234567