Home
last modified time | relevance | path

Searched defs:phi (Results 1 – 25 of 54) sorted by relevance

123

/openbsd-src/gnu/gcc/gcc/
H A Dtree-phinodes.c133 tree phi; in allocate_phi_node() local
206 tree phi; in make_phi_node() local
242 release_phi_node (tree phi) in release_phi_node()
266 resize_phi_node (tree *phi, int len) in resize_phi_node()
351 tree phi; in create_phi_node() local
372 add_phi_arg (tree phi, tree def, edge e) in add_phi_arg()
403 remove_phi_arg_num (tree phi, int i) in remove_phi_arg_num()
436 tree phi; in remove_phi_args() local
446 remove_phi_node (tree phi, tree prev) in remove_phi_node()
476 phi_reverse (tree phi) in phi_reverse()
H A Dtree-ssa-phiopt.c157 tree phi; in tree_ssa_phiopt() local
325 edge e, tree phi, tree new) in replace_phi_edge_with_variable()
375 edge e0, edge e1, tree phi, in conditional_replacement()
545 edge e0, edge e1, tree phi, in value_replacement()
623 edge e0, edge e1, tree phi, in minmax_replacement()
875 tree phi, tree arg0, tree arg1) in abs_replacement()
H A Dtree-ssa.c56 tree phi; in ssa_redirect_edge() local
85 tree phi, arg; in flush_pending_stmts() local
304 verify_phi_args (tree phi, basic_block bb, basic_block *definition_block) in verify_phi_args()
715 tree phi; in verify_ssa() local
1229 warn_uninitialized_phi (tree phi) in warn_uninitialized_phi()
1266 tree phi; in execute_late_warn_uninitialized() local
H A Dtree-tailcall.c362 tree phi; in propagate_through_phis() local
549 tree stmt, var, phi, tmp; in adjust_accumulator_values() local
721 tree phi; in eliminate_tail_call() local
876 tree stmt, param, ret_type, tmp, phi; in tree_optimize_tail_calls_1() local
916 tree phi; in tree_optimize_tail_calls_1() local
H A Dtree-cfgcleanup.c359 tree phi; in phi_alternatives_equal() local
386 tree phi; in remove_forwarder_block() local
657 tree phi; in remove_forwarder_block_with_phi() local
796 tree phi; in merge_phi_nodes() local
H A Dtree-if-conv.c302 if_convertible_phi_p (struct loop *loop, basic_block bb, tree phi) in if_convertible_phi_p()
498 tree phi; in if_convertible_loop_p() local
796 replace_phi_with_cond_modify_expr (tree phi, tree cond, basic_block true_bb, in replace_phi_with_cond_modify_expr()
860 tree phi, cond; in process_phi_nodes() local
H A Dtree-outof-ssa.c364 tree phi; in eliminate_build() local
583 tree phi, var, tmp; in coalesce_abnormal_edges() local
683 tree phi; in coalesce_phi_operands() local
1095 tree phi, next; in eliminate_virtual_phis() local
1160 tree phi, arg; in coalesce_vars() local
1867 tree phi; in rewrite_trees() local
1876 tree phi; in rewrite_trees() local
2345 tree phi, next; in remove_ssa_form() local
2437 tree phi; in insert_backedge_copies() local
H A Dtree-ssa-dce.c394 tree phi; in find_obviously_necessary_stmts() local
578 tree phi; in mark_really_necessary_kill_operand_phis() local
668 tree prev, phi; in remove_dead_phis() local
H A Dtree-vect-analyze.c237 tree phi; in vect_analyze_operations() local
500 tree phi; in vect_analyze_scalar_cycles() local
1566 tree phi; in vect_mark_stmts_to_be_vectorized() local
1736 tree phi; in vect_can_advance_ivs_p() local
H A Dtree-vectorizer.c221 tree phi; in rename_variables_in_bb() local
835 tree phi, phi_arg; in slpeel_tree_duplicate_loop_to_edge_cfg() local
1400 tree phi; in new_loop_vec_info() local
1460 tree phi; in destroy_loop_vec_info() local
1812 vect_is_simple_reduction (struct loop *loop, tree phi) in vect_is_simple_reduction()
H A Dtree-ssa-dom.c724 tree phi; in record_equivalences_from_phis() local
1181 tree lhs, rhs, preinc, phi; in simple_iv_increment_p() local
1226 tree phi; in cprop_into_successor_phis() local
2056 degenerate_phi_result (tree phi) in degenerate_phi_result()
2294 tree phi; in propagate_rhs_into_lhs() local
2395 tree phi, next; in eliminate_degenerate_phis_1() local
H A Dtree-flow-inline.h515 get_phi_result_ptr (tree phi) in get_phi_result_ptr()
522 get_phi_arg_def_ptr (tree phi, int i) in get_phi_arg_def_ptr()
550 tree phi; in set_phi_nodes() local
564 tree phi; in phi_arg_index_from_use() local
1249 op_iter_init_phiuse (ssa_op_iter *ptr, tree phi, int flags) in op_iter_init_phiuse()
1278 op_iter_init_phidef (ssa_op_iter *ptr, tree phi, int flags) in op_iter_init_phidef()
H A Dtree-ssa-propagate.c391 tree phi; in simulate_block() local
1030 replace_phi_args_in (tree phi, prop_value_t *prop_value) in replace_phi_args_in()
1153 tree phi; in substitute_and_fold() local
H A Dtree-ssa-loop-manip.c129 tree phi, def_stmt = SSA_NAME_DEF_STMT (use); in add_exit_phis_edge() local
283 tree phi; in find_uses_to_rename_bb() local
423 tree phi; in verify_loop_closed_ssa() local
451 tree phi, new_phi, new_name, name; in split_loop_exit_edge() local
H A Dtree-ssa-live.c356 tree phi, def; in remove_unused_locals() local
434 tree phi, arg; in create_ssa_var_map() local
646 tree phi, var, stmt; in calculate_live_on_entry() local
820 tree t, phi; in calculate_live_on_exit() local
1425 tree phi; in build_tree_conflict_graph() local
H A Dtree-into-ssa.c413 tree phi, stmt; in initialize_flags_in_bb() local
1092 mark_phi_for_rewrite (basic_block bb, tree phi) in mark_phi_for_rewrite()
1133 tree phi; in insert_phi_nodes_for() local
1297 tree phi; in rewrite_initialize_block() local
1410 tree phi; in rewrite_add_phi_arguments() local
1626 tree phi; in rewrite_update_init_block() local
1860 tree phi; in rewrite_update_phi_arguments() local
2225 tree phi; in prepare_block_for_update() local
H A Dtree-ssa-copy.c764 copy_prop_visit_phi_node (tree phi) in copy_prop_visit_phi_node()
894 tree phi, def; in init_copy_prop() local
H A Dtree-ssa-copyrename.c301 tree phi, stmt, var, part_var; in rename_ssa_copies() local
H A Dtree-scalar-evolution.c414 loop_phi_node_p (tree phi) in loop_phi_node_p()
1220 backedge_phi_arg_p (tree phi, int i) in backedge_phi_arg_p()
2103 tree phi; in loop_closed_phi_def() local
2676 tree phi, chrec; in analyze_scalar_evolution_for_all_loop_phi_nodes() local
2890 tree name, phi, next_phi, type, ev; in scev_const_prop() local
H A Dtree-complex.c183 tree phi; in init_dont_simulate_again() local
355 complex_visit_phi (tree phi) in complex_visit_phi()
670 tree phi; in update_phi_components() local
H A Dtree-cfg.c1184 tree phi; in tree_can_merge_blocks_p() local
1312 tree phi; in tree_merge_blocks() local
1970 tree phi; in remove_phi_nodes_and_edges_for_unreachable_block() local
3139 tree var, phi; in reinstall_phi_args() local
3587 tree phi; in verify_stmts() local
3986 tree phi, new_phi, var; in tree_make_forwarder_block() local
4297 tree phi; in tree_duplicate_bb() local
4354 tree phi, phi_copy, phi_next, def; in add_phi_args_after_copy_bb() local
/openbsd-src/gnu/usr.bin/gcc/gcc/testsuite/g++.dg/opt/
H A Dreg-stack4.C24 double phi = vecdca.data; in track_match() local
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp155 MachineBasicBlock::iterator phi = BB.begin(); in runOnMachineFunction() local
/openbsd-src/gnu/usr.bin/gcc/gcc/
H A Dssa.c647 rtx phi, reg; local
1067 rtx phi = PATTERN (insn); local
1509 rtx phi; local
1582 rtx phi; local
/openbsd-src/gnu/llvm/llvm/examples/BrainF/
H A DBrainF.cpp188 void BrainF::readloop(PHINode *phi, BasicBlock *oldbb, BasicBlock *testbb, in readloop()

123