Home
last modified time | relevance | path

Searched refs:bb_for_stmt (Results 1 – 25 of 42) sorted by relevance

12

/freebsd-12.1/contrib/gcc/
H A Dtree-ssa-sink.c243 useblock = bb_for_stmt (usestmt); in nearest_common_dominator_of_uses()
385 sinkbb = bb_for_stmt (use); in statement_sink_location()
410 if (bb_for_stmt (use) == frombb) in statement_sink_location()
457 bb->index, bb_for_stmt (sinkstmt)->index); in sink_code_in_bb()
468 bsi_move_to_bb_end (&bsi, bb_for_stmt (sinkstmt)); in sink_code_in_bb()
H A Dvalue-prof.c144 if (bb != bb_for_stmt (stmt)) in tree_value_profile_transformations()
146 bb = bb_for_stmt (stmt); in tree_value_profile_transformations()
191 bb = bb_for_stmt (stmt); in tree_divmod_fixed_value()
307 if (check_counter (stmt, "value", all, bb_for_stmt (stmt)->count)) in tree_divmod_fixed_value_transform()
355 bb = bb_for_stmt (stmt); in tree_mod_pow2()
479 if (check_counter (stmt, "pow2", all, bb_for_stmt (stmt)->count)) in tree_mod_pow2_value_transform()
519 bb = bb_for_stmt (stmt); in tree_mod_subtract()
657 if (check_counter (stmt, "interval", all, bb_for_stmt (stmt)->count)) in tree_mod_subtract_transform()
H A Dtree-ssa-dse.c180 def_bb = bb_for_stmt (def_stmt); in memory_ssa_name_same()
205 walk_data.store1_bb = bb_for_stmt (store1); in memory_address_same()
206 walk_data.store2_bb = bb_for_stmt (store2); in memory_address_same()
H A Dtree-ssa-threadedge.c97 && dominated_by_p (CDI_DOMINATORS, bb, bb_for_stmt (use_stmt))) in lhs_of_dominating_assert()
181 && bb_for_stmt (SSA_NAME_DEF_STMT (src)) == e->dest) in record_temporary_equivalences_from_phis()
518 && bb_for_stmt (SSA_NAME_DEF_STMT (use)) == e->dest) in thread_across_edge()
H A Dtree-ssa-loop-manip.c130 basic_block def_bb = bb_for_stmt (def_stmt); in add_exit_phis_edge()
161 basic_block def_bb = bb_for_stmt (SSA_NAME_DEF_STMT (var)); in add_exit_phis_var()
240 def_bb = bb_for_stmt (SSA_NAME_DEF_STMT (use)); in find_uses_to_rename_use()
266 basic_block bb = bb_for_stmt (stmt); in find_uses_to_rename_stmt()
399 def_bb = bb_for_stmt (def); in check_loop_closed_ssa_use()
H A Dtree-phinodes.c376 gcc_assert (bb == bb_for_stmt (phi)); in add_phi_arg()
456 for (loc = &(bb_for_stmt (phi)->phi_nodes); in remove_phi_node()
H A Dtree-ssa-math-opts.c351 basic_block bb = bb_for_stmt (use_stmt); in replace_reciprocal()
411 register_division_in (bb_for_stmt (use_stmt)); in execute_cse_reciprocals_1()
H A Dtree-ssa-loop-im.c311 def_bb = bb_for_stmt (def_stmt); in outermost_invariant_loop()
379 basic_block def_bb = bb_for_stmt (def_stmt); in add_dependency()
482 basic_block bb = bb_for_stmt (stmt); in determine_max_movement()
516 struct loop *stmt_loop = bb_for_stmt (stmt)->loop_father; in set_level()
542 set_level (stmt, bb_for_stmt (stmt)->loop_father, LIM_DATA (stmt)->max_loop); in set_profitable_level()
H A Dtree-ssa-forwprop.c583 && tree_purge_dead_eh_edges (bb_for_stmt (stmt))) in tidy_after_forward_propagate_addr()
828 int stmt_loop_depth = bb_for_stmt (stmt)->loop_depth; in forward_propagate_addr_expr()
849 if (bb_for_stmt (use_stmt)->loop_depth > stmt_loop_depth) in forward_propagate_addr_expr()
H A Dtree-tailcall.c213 at_bb = bb_for_stmt (at); in independent_of_stmt_p()
214 call_bb = bb_for_stmt (bsi_stmt (bsi)); in independent_of_stmt_p()
222 bb = bb_for_stmt (at); in independent_of_stmt_p()
H A Dtree-if-conv.c271 extract_true_false_edges_from_block (bb_for_stmt (stmt), in tree_if_convert_cond_expr()
287 if (!bb_with_exit_edge_p (loop, bb_for_stmt (stmt))) in tree_if_convert_cond_expr()
812 bb = bb_for_stmt (phi); in replace_phi_with_cond_modify_expr()
H A Dtree-cfgcleanup.c172 bb = bb_for_stmt (stmt);
818 || bb_for_stmt (use_stmt) != dest in merge_phi_nodes()
H A Dtree-ssa-loop-unswitch.c130 def_bb = bb_for_stmt (def); in tree_may_unswitch_on()
H A Dlambda-code.c1880 bb = bb_for_stmt (exitcond); in lambda_loopnest_to_gcc_loopnest()
2214 || bb_for_stmt (stmt) != loop->single_exit->dest) in exit_phi_for_loop_p()
2238 basic_block immbb = bb_for_stmt (USE_STMT (use_p)); in can_put_in_inner_loop()
2261 basic_block immbb = bb_for_stmt (USE_STMT (use_p)); in can_put_after_inner_loop()
2337 if (bb_for_stmt (USE_STMT (use_a))->loop_father in can_convert_to_perfect_nest()
2347 if (bb_for_stmt (USE_STMT (use_b))->loop_father in can_convert_to_perfect_nest()
2363 if (bb_for_stmt (arg_stmt)->loop_father in can_convert_to_perfect_nest()
2380 bb_for_stmt (stmt), in can_convert_to_perfect_nest()
H A Dtree-ssa-dce.c346 gcc_assert (EDGE_COUNT (bb_for_stmt (stmt)->succs) == 2); in mark_stmt_if_obviously_necessary()
496 basic_block bb = bb_for_stmt (i); in propagate_necessity()
H A Dtree-ssa-dom.c705 basic_block stmt_bb = bb_for_stmt (stmt); in dom_opt_finalize_block()
1104 defbb = bb_for_stmt (defstmt); in loop_depth_of_name()
2248 bitmap_set_bit (need_eh_cleanup, bb_for_stmt (use_stmt)->index); in propagate_rhs_into_lhs()
2283 basic_block bb = bb_for_stmt (use_stmt); in propagate_rhs_into_lhs()
2318 bsi = bsi_last (bb_for_stmt (use_stmt)); in propagate_rhs_into_lhs()
H A Dtree-ssa-reassoc.c271 if (bb_for_stmt (stmt) == NULL) in get_rank()
276 return bb_rank[bb_for_stmt (stmt)->index]; in get_rank()
286 maxrank = bb_rank[bb_for_stmt(stmt)->index]; in get_rank()
H A Dtree-ssa-loop-ivopts.c603 basic_block cand_bb = bb_for_stmt (cand->incremented_at); in stmt_after_ip_original_pos()
604 basic_block stmt_bb = bb_for_stmt (stmt); in stmt_after_ip_original_pos()
931 bb = bb_for_stmt (SSA_NAME_DEF_STMT (var)); in get_iv()
947 struct loop *loop = bb_for_stmt (phi)->loop_father; in determine_biv_step()
1018 incr_bb = bb_for_stmt (SSA_NAME_DEF_STMT (var)); in mark_bivs()
1175 bb = bb_for_stmt (SSA_NAME_DEF_STMT (op)); in record_invariant()
1309 def_bb = bb_for_stmt (SSA_NAME_DEF_STMT (expr)); in expr_invariant_in_loop_p()
1688 && bb_for_stmt (stmt) == data->current_loop->header) in find_interesting_uses_stmt()
4120 ex_bb = bb_for_stmt (use->stmt); in iv_elimination_compare()
4146 ex_bb = bb_for_stmt (use->stmt); in may_eliminate_iv()
[all …]
H A Dtree-scalar-evolution.c420 return loop_containing_stmt (phi)->header == bb_for_stmt (phi); in loop_phi_node_p()
1504 struct loop *loop = bb_for_stmt (loop_phi_node)->loop_father; in analyze_initial_condition()
1919 bb = bb_for_stmt (def); in analyze_scalar_evolution_1()
2157 def_bb = bb_for_stmt (SSA_NAME_DEF_STMT (chrec)); in instantiate_parameters_1()
2795 basic_block bb = bb_for_stmt (stmt); in simple_iv()
H A Dtree-ssa-propagate.c339 basic_block bb = bb_for_stmt (stmt); in simulate_stmt()
389 bb = bb_for_stmt (stmt); in process_ssa_edge_worklist()
H A Dtree-vectorizer.c1698 bb = bb_for_stmt (*def_stmt); in vect_is_simple_use()
1940 && flow_bb_inside_loop_p (loop, bb_for_stmt (def1)) in vect_is_simple_reduction()
1951 && flow_bb_inside_loop_p (loop, bb_for_stmt (def2)) in vect_is_simple_reduction()
H A Dtree-into-ssa.c2187 basic_block def_bb = bb_for_stmt (stmt); in mark_use_interesting()
2326 basic_block bb = bb_for_stmt (stmt); in prepare_use_sites_for()
2358 bb = bb_for_stmt (stmt); in prepare_def_site_for()
2578 basic_block bb = bb_for_stmt (stmt); in create_new_def_for()
H A Dtree-eh.c1726 src = bb_for_stmt (stmt); in make_eh_edge()
1768 src = bb_for_stmt (stmt); in mark_eh_edge()
1799 basic_block bb = bb_for_stmt (stmt); in verify_eh_edges()
H A Dtree-ssa-loop-niter.c1260 basic_block bb = bb_for_stmt (stmt); in chain_of_csts_start()
1917 basic_block bb1 = bb_for_stmt (s1), bb2 = bb_for_stmt (s2); in stmt_dominates_stmt_p()
H A Dtree-ssa-live.c580 def_bb = bb_for_stmt (SSA_NAME_DEF_STMT (var)); in live_worklist()
679 if (!stmt || e->src != bb_for_stmt (stmt)) in calculate_live_on_entry()
738 tmp = bb_for_stmt (stmt); in calculate_live_on_entry()

12