Home
last modified time | relevance | path

Searched refs:phi_nodes (Results 1 – 25 of 40) sorted by relevance

12

/openbsd-src/gnu/gcc/gcc/
H A Dtree-cfgcleanup.c270 || (phi_nodes (bb) != NULL_TREE) != phi_wanted in tree_forwarder_block_p()
361 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) in phi_alternatives_equal()
421 || phi_nodes (dest) != NULL_TREE) in remove_forwarder_block()
428 if (phi_nodes (dest)) in remove_forwarder_block()
457 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) in remove_forwarder_block()
685 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) in remove_forwarder_block_with_phi()
781 if (!phi_nodes (dest) in merge_phi_nodes()
804 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in merge_phi_nodes()
H A Dtree-phinodes.c317 for (loc = &(bb->phi_nodes); in reserve_phi_args_for_new_edge()
356 PHI_CHAIN (phi) = phi_nodes (bb); in create_phi_node()
357 bb->phi_nodes = phi; in create_phi_node()
438 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) in remove_phi_args()
456 for (loc = &(bb_for_stmt (phi)->phi_nodes); in remove_phi_node()
H A Dtree-vectorizer.c242 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) in rename_variables_in_bb()
314 for (phi_new = phi_nodes (new_loop->header), in slpeel_update_phis_for_duplicate_loop()
315 phi_orig = phi_nodes (orig_loop->header); in slpeel_update_phis_for_duplicate_loop()
526 for (orig_phi = phi_nodes (orig_bb), update_phi = phi_nodes (update_bb); in slpeel_update_phi_nodes_for_guard1()
601 set_phi_nodes (new_merge_bb, phi_reverse (phi_nodes (new_merge_bb))); in slpeel_update_phi_nodes_for_guard1()
652 for (update_phi = phi_nodes (update_bb); update_phi; in slpeel_update_phi_nodes_for_guard2()
756 set_phi_nodes (new_merge_bb, phi_reverse (phi_nodes (new_merge_bb))); in slpeel_update_phi_nodes_for_guard2()
871 for (phi = phi_nodes (exit_dest); phi; phi = PHI_CHAIN (phi)) in slpeel_tree_duplicate_loop_to_edge_cfg()
912 for (phi = phi_nodes (loop->header); phi; phi = PHI_CHAIN (phi)) in slpeel_tree_duplicate_loop_to_edge_cfg()
1402 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in new_loop_vec_info()
[all …]
H A Dtree-tailcall.c364 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) in propagate_through_phis()
595 for (phi = phi_nodes (back->dest); phi; phi = PHI_CHAIN (phi)) in adjust_accumulator_values()
604 for (phi = phi_nodes (back->dest); phi; phi = PHI_CHAIN (phi)) in adjust_accumulator_values()
774 phi = phi_nodes (first); in eliminate_tail_call()
964 set_phi_nodes (first, phi_reverse (phi_nodes (first))); in tree_optimize_tail_calls_1()
H A Dtree-ssa-dce.c397 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in find_obviously_necessary_stmts()
580 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in mark_really_necessary_kill_operand_phis()
671 phi = phi_nodes (bb); in remove_dead_phis()
752 || phi_nodes (post_dom_bb)) in remove_dead_stmt()
H A Dtree-ssa-loop-manip.c286 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) in find_uses_to_rename_bb()
433 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in verify_loop_closed_ssa()
454 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) in split_loop_exit_edge()
910 for (phi_old_loop = phi_nodes (loop->header), in tree_unroll_loop()
911 phi_new_loop = phi_nodes (new_loop->header); in tree_unroll_loop()
H A Dtree-outof-ssa.c370 for (phi = phi_nodes (B); phi; phi = PHI_CHAIN (phi)) in eliminate_build()
594 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) in coalesce_abnormal_edges()
687 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in coalesce_phi_operands()
1099 for (phi = phi_nodes (bb); phi; phi = next) in eliminate_virtual_phis()
1163 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in coalesce_vars()
1878 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in rewrite_trees()
1973 phi = phi_nodes (bb); in rewrite_trees()
2407 for (phi = phi_nodes (bb); phi; phi = next) in remove_ssa_form()
2439 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in insert_backedge_copies()
H A Dtree-cfg.c1214 phi = phi_nodes (b); in tree_can_merge_blocks_p()
1320 for (phi = phi_nodes (b); phi; phi = phi_nodes (b)) in tree_merge_blocks()
1974 phi = phi_nodes (bb); in remove_phi_nodes_and_edges_for_unreachable_block()
2994 && ! phi_nodes (dest) in tree_find_edge_insert_loc()
3144 for (var = PENDING_STMT (old_edge), phi = phi_nodes (new_edge->dest); in reinstall_phi_args()
3590 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in verify_stmts()
3996 for (phi = phi_nodes (dummy); phi; phi = PHI_CHAIN (phi)) in tree_make_forwarder_block()
4006 set_phi_nodes (bb, phi_reverse (phi_nodes (bb))); in tree_make_forwarder_block()
4303 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in tree_duplicate_bb()
4311 set_phi_nodes (new_bb, phi_reverse (phi_nodes (new_bb))); in tree_duplicate_bb()
[all …]
H A Dtree-ssa.c61 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) in ssa_redirect_edge()
90 for (phi = phi_nodes (e->dest), arg = PENDING_STMT (e); in flush_pending_stmts()
731 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in verify_ssa()
1274 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in execute_late_warn_uninitialized()
H A Dtree-ssa-live.c362 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in remove_unused_locals()
436 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in create_ssa_var_map()
666 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in calculate_live_on_entry()
691 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in calculate_live_on_entry()
780 for (phi = phi_nodes (e->dest); in calculate_live_on_entry()
831 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in calculate_live_on_exit()
1502 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in build_tree_conflict_graph()
H A Dtree-vect-analyze.c251 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in vect_analyze_operations()
508 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in vect_analyze_scalar_cycles()
1579 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in vect_mark_stmts_to_be_vectorized()
1743 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in vect_can_advance_ivs_p()
1893 || phi_nodes (loop->latch)) in vect_analyze_loop_form()
H A Dtree-if-conv.c567 phi = phi_nodes (bb); in if_convertible_loop_p()
868 phi = phi_nodes (bb); in process_phi_nodes()
883 bb->phi_nodes = NULL; in process_phi_nodes()
H A Dtree-into-ssa.c416 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in initialize_flags_in_bb()
1308 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in rewrite_initialize_block()
1412 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) in rewrite_add_phi_arguments()
1473 print_generic_stmt (file, phi_nodes (bb), dump_flags); in dump_tree_ssa()
1655 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in rewrite_update_init_block()
2233 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in prepare_block_for_update()
H A Dtree-ssa-copyrename.c332 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in rename_ssa_copies()
H A Dtree-ssa-propagate.c402 for (phi = phi_nodes (block); phi; phi = PHI_CHAIN (phi)) in simulate_block()
1157 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in substitute_and_fold()
H A Dtree-ssa-dse.c373 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in dse_record_phis()
H A Dtree-ssa-math-opts.c482 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in execute_cse_reciprocals()
H A Dtree-ssa-dom.c726 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in record_equivalences_from_phis()
1234 phi = phi_nodes (e->dest); in cprop_into_successor_phis()
2298 for (phi = phi_nodes (e->dest); in propagate_rhs_into_lhs()
2398 for (phi = phi_nodes (bb); phi; phi = next) in eliminate_degenerate_phis_1()
H A Dtree-flow-inline.h540 phi_nodes (basic_block bb) in phi_nodes() function
542 return bb->phi_nodes; in phi_nodes()
552 bb->phi_nodes = l; in set_phi_nodes()
H A Dtree-ssa-threadedge.c170 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) in record_temporary_equivalences_from_phis()
H A Dtree-ssa-loop-ivcanon.c421 for (phi = phi_nodes (exit->dest); phi; phi = PHI_CHAIN (phi)) in empty_loop_p()
H A Dlambda-code.c2392 for (phi = phi_nodes (exitdest); phi; phi = PHI_CHAIN (phi)) in can_convert_to_perfect_nest()
2471 for (phi = phi_nodes (olddest); phi; phi = PHI_CHAIN (phi)) in perfect_nestify()
2481 while (phi_nodes (olddest) != NULL) in perfect_nestify()
2483 SET_PHI_RESULT (phi_nodes (olddest), NULL); in perfect_nestify()
2484 remove_phi_node (phi_nodes (olddest), NULL); in perfect_nestify()
H A Dtree-scalar-evolution.c2114 for (phi = phi_nodes (exit->dest); phi; phi = PHI_CHAIN (phi)) in loop_closed_phi_def()
2681 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in analyze_scalar_evolution_for_all_loop_phi_nodes()
2902 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in scev_const_prop()
2982 for (phi = phi_nodes (exit->dest); phi; phi = next_phi) in scev_const_prop()
H A Dtree-ssa-uncprop.c479 tree phi = phi_nodes (e->dest); in uncprop_into_successor_phis()
H A Dtree-ssa-threadupdate.c324 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) in create_edge_and_update_destination_phis()

12