Home
last modified time | relevance | path

Searched refs:COND_EXPR_COND (Results 1 – 22 of 22) sorted by relevance

/openbsd-src/gnu/gcc/gcc/
H A Dtree-ssa-loop-unswitch.c136 cond = COND_EXPR_COND (stmt); in tree_may_unswitch_on()
161 && operand_equal_p (COND_EXPR_COND (stmt), cond, 0)) in simplify_using_entry_checks()
234 COND_EXPR_COND (stmt) = boolean_true_node; in tree_unswitch_single_loop()
240 COND_EXPR_COND (stmt) = boolean_false_node; in tree_unswitch_single_loop()
H A Dtree-ssa-threadedge.c302 tree cond = COND_EXPR_COND (TREE_OPERAND (stmt, 1)); in record_temporary_equivalences_from_stmts_at_dest()
363 cond = COND_EXPR_COND (stmt); in simplify_control_stmt_condition()
423 TREE_SET_CODE (COND_EXPR_COND (dummy_cond), cond_code); in simplify_control_stmt_condition()
424 TREE_OPERAND (COND_EXPR_COND (dummy_cond), 0) = op0; in simplify_control_stmt_condition()
425 TREE_OPERAND (COND_EXPR_COND (dummy_cond), 1) = op1; in simplify_control_stmt_condition()
431 cached_lhs = fold (COND_EXPR_COND (dummy_cond)); in simplify_control_stmt_condition()
H A Dtree-ssa-loop-ivcanon.c108 COND_EXPR_COND (cond) = build2 (cmp, boolean_type_node, in create_canonical_iv()
230 old_cond = COND_EXPR_COND (cond); in try_unroll_loop_completely()
231 COND_EXPR_COND (cond) = dont_exit; in try_unroll_loop_completely()
246 COND_EXPR_COND (cond) = old_cond; in try_unroll_loop_completely()
258 COND_EXPR_COND (cond) = do_exit; in try_unroll_loop_completely()
512 COND_EXPR_COND (cond_stmt) = do_exit; in remove_empty_loop()
H A Dtree-ssa-forwprop.c501 tree cond = COND_EXPR_COND (stmt); in simplify_cond()
520 COND_EXPR_COND (stmt) = new_cond; in simplify_cond()
539 tree cond = COND_EXPR_COND (cond_expr); in forward_propagate_into_cond()
556 COND_EXPR_COND (cond_expr) = new_cond; in forward_propagate_into_cond()
H A Dtree-ssa-phiopt.c402 cond = COND_EXPR_COND (last_stmt (cond_bb)); in conditional_replacement()
559 cond = COND_EXPR_COND (last_stmt (cond_bb)); in value_replacement()
639 cond = COND_EXPR_COND (last_stmt (cond_bb)); in minmax_replacement()
920 cond = COND_EXPR_COND (last_stmt (cond_bb)); in abs_replacement()
H A Dtree-ssa-dom.c398 tree cond = COND_EXPR_COND (condstmt); in canonicalize_comparison()
480 element->rhs = COND_EXPR_COND (expr); in initialize_hash_element()
599 && (COMPARISON_CLASS_P (COND_EXPR_COND (last)) in dom_opt_finalize_block()
600 || TREE_CODE (COND_EXPR_COND (last)) == SSA_NAME) in dom_opt_finalize_block()
1323 tree cond = COND_EXPR_COND (stmt); in record_edge_info()
1495 expr_p = &COND_EXPR_COND (stmt); in eliminate_redundant_computations()
1889 val = COND_EXPR_COND (stmt); in optimize_stmt()
2275 val = COND_EXPR_COND (use_stmt); in propagate_rhs_into_lhs()
H A Dtree-ssa-propagate.c546 return COND_EXPR_COND (stmt); in get_rhs()
671 COND_EXPR_COND (stmt) = expr; in set_rhs()
1096 pred_p = &COND_EXPR_COND (stmt); in fold_predicate_in()
H A Dtree-vrp.c3378 tree cond = COND_EXPR_COND (stmt); in register_edge_assert_for()
3699 && !fp_predicate (COND_EXPR_COND (last)) in find_assert_locations()
4449 cond = COND_EXPR_COND (stmt); in vrp_visit_cond_stmt()
5102 tree cond = COND_EXPR_COND (stmt); in simplify_cond_using_ranges()
5130 COND_EXPR_COND (stmt) in simplify_cond_using_ranges()
5136 print_generic_expr (dump_file, COND_EXPR_COND (stmt), 0); in simplify_cond_using_ranges()
5158 COND_EXPR_COND (stmt) in simplify_cond_using_ranges()
5164 print_generic_expr (dump_file, COND_EXPR_COND (stmt), 0); in simplify_cond_using_ranges()
5199 && COMPARISON_CLASS_P (COND_EXPR_COND (stmt))) in simplify_stmt_using_ranges()
5226 return vrp_evaluate_conditional (COND_EXPR_COND (stmt), within_stmt);
[all …]
H A Dtree-ssa-uncprop.c86 tree cond = COND_EXPR_COND (stmt); in associate_equivalences_with_edges()
H A Dtree-ssa-loop-niter.c932 cond = COND_EXPR_COND (last_stmt (e->src)); in simplify_using_initial_conditions()
1063 cond = COND_EXPR_COND (stmt); in number_of_iterations_exit()
1385 cnd = COND_EXPR_COND (cond); in loop_niter_by_eval()
H A Dtree-cfgcleanup.c89 val = fold (COND_EXPR_COND (expr)); in cleanup_control_expr_graph()
H A Dtree-cfg.c439 cond = fold (COND_EXPR_COND (stmt)); in fold_cond_expr_cond()
447 COND_EXPR_COND (stmt) = boolean_false_node; in fold_cond_expr_cond()
449 COND_EXPR_COND (stmt) = boolean_true_node; in fold_cond_expr_cond()
1469 if (remove_useless_stmts_warn_notreached (COND_EXPR_COND (stmt))) in remove_useless_stmts_warn_notreached()
1523 cond = fold (COND_EXPR_COND (*stmt_p)); in remove_useless_stmts_cond()
3337 x = COND_EXPR_COND (t); in verify_expr()
H A Dtree-ssa-copy.c627 cond = COND_EXPR_COND (stmt); in copy_prop_visit_cond_stmt()
H A Dtree-ssa-loop-manip.c880 COND_EXPR_COND (exit_if) = dont_exit; in tree_unroll_loop()
H A Dtree-if-conv.c269 c = COND_EXPR_COND (stmt); in tree_if_convert_cond_expr()
H A Dlambda-code.c1917 COND_EXPR_COND (exitcond) = build2 (testtype, in lambda_loopnest_to_gcc_loopnest()
2555 COND_EXPR_COND (exit_condition) = build2 (GE_EXPR, in perfect_nestify()
H A Dcfgexpand.c1198 tree pred = COND_EXPR_COND (stmt); in expand_gimple_cond_expr()
H A Dtree-nested.c619 walk_tree (&COND_EXPR_COND (t), wi->callback, wi, NULL); in walk_stmts()
H A Dtree-ssa-operands.c2113 get_expr_operands (stmt, &COND_EXPR_COND (stmt), opf_none); in parse_ssa_operands()
H A Dtree-pretty-print.c1052 dump_generic_node (buffer, COND_EXPR_COND (node), spc, flags, false); in dump_generic_node()
H A Dtree.h1521 #define COND_EXPR_COND(NODE) (TREE_OPERAND (COND_EXPR_CHECK (NODE), 0)) macro
H A Dtree-ssa-loop-ivopts.c1635 find_interesting_uses_cond (data, stmt, &COND_EXPR_COND (stmt)); in find_interesting_uses_stmt()