Home
last modified time | relevance | path

Searched refs:create_phi_node (Results 1 – 14 of 14) sorted by relevance

/freebsd-12.1/contrib/gcc/
H A Dtree-ssa-loop-manip.c118 stmt = create_phi_node (vb, loop->header); in create_iv()
147 phi = create_phi_node (use, exit); in add_exit_phis_edge()
468 new_phi = create_phi_node (new_name, bb); in split_loop_exit_edge()
935 phi_rest = create_phi_node (new_init, rest); in tree_unroll_loop()
H A Dtree-vectorizer.c542 new_phi = create_phi_node (SSA_NAME_VAR (PHI_RESULT (orig_phi)), in slpeel_update_phi_nodes_for_guard1()
563 new_phi = create_phi_node (SSA_NAME_VAR (PHI_RESULT (orig_phi)), in slpeel_update_phi_nodes_for_guard1()
667 new_phi = create_phi_node (SSA_NAME_VAR (PHI_RESULT (orig_phi)), in slpeel_update_phi_nodes_for_guard2()
709 new_phi = create_phi_node (SSA_NAME_VAR (PHI_RESULT (orig_phi)), in slpeel_update_phi_nodes_for_guard2()
743 new_phi = create_phi_node (SSA_NAME_VAR (PHI_RESULT (orig_phi)), in slpeel_update_phi_nodes_for_guard2()
H A Dtree-tailcall.c919 phi = create_phi_node (name, first); in tree_optimize_tail_calls_1()
933 phi = create_phi_node (tmp, first); in tree_optimize_tail_calls_1()
949 phi = create_phi_node (tmp, first); in tree_optimize_tail_calls_1()
H A Dtree-phinodes.c349 create_phi_node (tree var, basic_block bb) in create_phi_node() function
H A Dtree-vect-transform.c856 new_phi = create_phi_node (SSA_NAME_VAR (vect_def), exit_bb); in vect_create_epilog_for_reduction()
1340 new_phi = create_phi_node (vec_dest, loop->header); in vectorizable_reduction()
1947 phi_stmt = create_phi_node (msq, loop->header); /* CHECKME */ in vectorizable_load()
3025 new_phi = create_phi_node (SSA_NAME_VAR (PHI_RESULT (orig_phi)), in vect_transform_loop()
H A Dtree-complex.c681 pr = create_phi_node (lr, bb); in update_phi_components()
688 pi = create_phi_node (li, bb); in update_phi_components()
H A Dtree-flow.h656 extern tree create_phi_node (tree, basic_block);
H A Dtree-into-ssa.c1164 phi = create_phi_node (var, bb); in insert_phi_nodes_for()
1181 phi = create_phi_node (sym, bb); in insert_phi_nodes_for()
H A Dtree-ssa-pre.c2590 temp = create_phi_node (temp, block); in insert_into_preds_of_block()
3062 temp = create_phi_node (temp, block); in insert_extra_phis()
H A Dtree-cfg.c4006 new_phi = create_phi_node (var, bb); in tree_make_forwarder_block()
4312 tree copy = create_phi_node (PHI_RESULT (phi), new_bb); in tree_duplicate_bb()
H A Dlambda-code.c2494 phi = create_phi_node (phiname, preheaderbb); in perfect_nestify()
H A DChangeLog.tree-ssa4274 * tree-phinodes.c (create_phi_node, add_phi_arg, remove_phi_node,
4643 * tree-dfa.c (create_phi_node): Moved to tree-phinodes.o.
4673 (create_phi_node, add_phi_arg, remove_phi_node,
4802 * tree-dfa.c (create_phi_node): Moved to tree-phinodes.o.
4862 * tree-dfa.c (create_phi_node): Moved to tree-phinodes.o.
6978 * tree-dfa.c (create_phi_node): Clear PHI_REWRITTEN on all new PHIs
6987 * tree-dfa.c (create_phi_node): Get the number of predecessors from
7674 (create_phi_node): Chain to start of list.
13210 (create_phi_node): New function.
H A DChangeLog-20053964 * tree-flow.h (reserve_phi_args_for_new_edge, create_phi_node,
17142 create_phi_node, remove_phi_node): Likewise.
H A DChangeLog-20046915 * tree-phinodes.c (create_phi_node): Don't zero PHI_REWRITTEN.
10402 * tree-phinodes.c (create_phi_node): Access the number of