Home
last modified time | relevance | path

Searched refs:phi (Results 1 – 25 of 102) sorted by relevance

12345

/openbsd-src/gnu/gcc/gcc/
H A Dtree-phinodes.c133 tree phi; in allocate_phi_node() local
148 phi = free_phinodes[bucket]; in allocate_phi_node()
156 phi = ggc_alloc (size); in allocate_phi_node()
164 return phi; in allocate_phi_node()
206 tree phi; in make_phi_node() local
211 phi = allocate_phi_node (capacity); in make_phi_node()
216 memset (phi, 0, (sizeof (struct tree_phi_node) - sizeof (struct phi_arg_d) in make_phi_node()
218 TREE_SET_CODE (phi, PHI_NODE); in make_phi_node()
219 PHI_NUM_ARGS (phi) = len; in make_phi_node()
220 PHI_ARG_CAPACITY (phi) = capacity; in make_phi_node()
[all …]
H A Dtree-cfgcleanup.c359 tree phi; in phi_alternatives_equal() local
361 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) in phi_alternatives_equal()
363 tree val1 = PHI_ARG_DEF (phi, n1); in phi_alternatives_equal()
364 tree val2 = PHI_ARG_DEF (phi, n2); in phi_alternatives_equal()
386 tree phi; in remove_forwarder_block() local
457 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) in remove_forwarder_block()
458 add_phi_arg (phi, PHI_ARG_DEF (phi, succ->dest_idx), s); in remove_forwarder_block()
657 tree phi; in remove_forwarder_block_with_phi() local
685 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) in remove_forwarder_block_with_phi()
687 tree def = PHI_ARG_DEF (phi, succ->dest_idx); in remove_forwarder_block_with_phi()
[all …]
H A Dtree-tailcall.c362 tree phi; in propagate_through_phis() local
364 for (phi = phi_nodes (dest); phi; phi = PHI_CHAIN (phi)) in propagate_through_phis()
365 if (PHI_ARG_DEF_FROM_EDGE (phi, e) == var) in propagate_through_phis()
366 return PHI_RESULT (phi); in propagate_through_phis()
549 tree stmt, var, phi, tmp; in adjust_accumulator_values() local
595 for (phi = phi_nodes (back->dest); phi; phi = PHI_CHAIN (phi)) in adjust_accumulator_values()
596 if (PHI_RESULT (phi) == a_acc) in adjust_accumulator_values()
599 add_phi_arg (phi, a_acc_arg, back); in adjust_accumulator_values()
604 for (phi = phi_nodes (back->dest); phi; phi = PHI_CHAIN (phi)) in adjust_accumulator_values()
605 if (PHI_RESULT (phi) == m_acc) in adjust_accumulator_values()
[all …]
H A Dtree-ssa-dce.c394 tree phi; in find_obviously_necessary_stmts() local
397 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in find_obviously_necessary_stmts()
399 NECESSARY (phi) = 0; in find_obviously_necessary_stmts()
407 if (is_gimple_reg (PHI_RESULT (phi)) in find_obviously_necessary_stmts()
408 && is_global_var (SSA_NAME_VAR (PHI_RESULT (phi)))) in find_obviously_necessary_stmts()
409 mark_stmt_necessary (phi, true); in find_obviously_necessary_stmts()
578 tree phi; in mark_really_necessary_kill_operand_phis() local
580 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in mark_really_necessary_kill_operand_phis()
582 if (!is_gimple_reg (PHI_RESULT (phi)) && NECESSARY (phi)) in mark_really_necessary_kill_operand_phis()
584 for (i = 0; i < PHI_NUM_ARGS (phi); i++) in mark_really_necessary_kill_operand_phis()
[all …]
H A Dtree-ssa.c56 tree phi; in ssa_redirect_edge() local
61 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) in ssa_redirect_edge()
63 if (PHI_ARG_DEF (phi, e->dest_idx) == NULL_TREE) in ssa_redirect_edge()
66 src = PHI_ARG_DEF (phi, e->dest_idx); in ssa_redirect_edge()
67 dst = PHI_RESULT (phi); in ssa_redirect_edge()
85 tree phi, arg; in flush_pending_stmts() local
90 for (phi = phi_nodes (e->dest), arg = PENDING_STMT (e); in flush_pending_stmts()
91 phi; in flush_pending_stmts()
92 phi = PHI_CHAIN (phi), arg = TREE_CHAIN (arg)) in flush_pending_stmts()
95 add_phi_arg (phi, def, e); in flush_pending_stmts()
[all …]
H A Dtree-if-conv.c302 if_convertible_phi_p (struct loop *loop, basic_block bb, tree phi) in if_convertible_phi_p() argument
307 print_generic_stmt (dump_file, phi, TDF_SLIM); in if_convertible_phi_p()
310 if (bb != loop->header && PHI_NUM_ARGS (phi) != 2) in if_convertible_phi_p()
317 if (!is_gimple_reg (SSA_NAME_VAR (PHI_RESULT (phi)))) in if_convertible_phi_p()
321 FOR_EACH_IMM_USE_FAST (use_p, imm_iter, PHI_RESULT (phi)) in if_convertible_phi_p()
498 tree phi; in if_convertible_loop_p() local
567 phi = phi_nodes (bb); in if_convertible_loop_p()
570 if (phi) in if_convertible_loop_p()
575 for (; phi; phi = PHI_CHAIN (phi)) in if_convertible_loop_p()
576 if (!if_convertible_phi_p (loop, bb, phi)) in if_convertible_loop_p()
[all …]
H A Dtree-outof-ssa.c364 tree phi; in eliminate_build() local
370 for (phi = phi_nodes (B); phi; phi = PHI_CHAIN (phi)) in eliminate_build()
372 T0 = var_to_partition_to_var (g->map, PHI_RESULT (phi)); in eliminate_build()
378 Ti = PHI_ARG_DEF (phi, g->e->dest_idx); in eliminate_build()
583 tree phi, var, tmp; in coalesce_abnormal_edges() local
594 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) in coalesce_abnormal_edges()
598 var = PHI_RESULT (phi); in coalesce_abnormal_edges()
605 tmp = PHI_ARG_DEF (phi, e->dest_idx); in coalesce_abnormal_edges()
683 tree phi; in coalesce_phi_operands() local
687 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in coalesce_phi_operands()
[all …]
H A Dtree-ssa-phiopt.c157 tree phi; in tree_ssa_phiopt() local
214 phi = phi_nodes (bb2); in tree_ssa_phiopt()
219 if (!phi || PHI_CHAIN (phi) != NULL) in tree_ssa_phiopt()
222 arg0 = PHI_ARG_DEF_TREE (phi, e1->dest_idx); in tree_ssa_phiopt()
223 arg1 = PHI_ARG_DEF_TREE (phi, e2->dest_idx); in tree_ssa_phiopt()
230 if (conditional_replacement (bb, bb1, e1, e2, phi, arg0, arg1)) in tree_ssa_phiopt()
232 else if (value_replacement (bb, bb1, e1, e2, phi, arg0, arg1)) in tree_ssa_phiopt()
234 else if (abs_replacement (bb, bb1, e1, e2, phi, arg0, arg1)) in tree_ssa_phiopt()
236 else if (minmax_replacement (bb, bb1, e1, e2, phi, arg0, arg1)) in tree_ssa_phiopt()
325 edge e, tree phi, tree new) in replace_phi_edge_with_variable() argument
[all …]
H A Dtree-ssa-loop-manip.c129 tree phi, def_stmt = SSA_NAME_DEF_STMT (use); in add_exit_phis_edge() local
147 phi = create_phi_node (use, exit); in add_exit_phis_edge()
148 create_new_def_for (PHI_RESULT (phi), phi, PHI_RESULT_PTR (phi)); in add_exit_phis_edge()
150 add_phi_arg (phi, use, e); in add_exit_phis_edge()
283 tree phi; in find_uses_to_rename_bb() local
286 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) in find_uses_to_rename_bb()
287 find_uses_to_rename_use (bb, PHI_ARG_DEF_FROM_EDGE (phi, e), in find_uses_to_rename_bb()
423 tree phi; in verify_loop_closed_ssa() local
433 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in verify_loop_closed_ssa()
434 for (i = 0; i < (unsigned) PHI_NUM_ARGS (phi); i++) in verify_loop_closed_ssa()
[all …]
H A Dtree-vectorizer.c221 tree phi; in rename_variables_in_bb() local
242 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) in rename_variables_in_bb()
243 rename_use_op (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e)); in rename_variables_in_bb()
835 tree phi, phi_arg; in slpeel_tree_duplicate_loop_to_edge_cfg() local
871 for (phi = phi_nodes (exit_dest); phi; phi = PHI_CHAIN (phi)) in slpeel_tree_duplicate_loop_to_edge_cfg()
873 phi_arg = PHI_ARG_DEF_FROM_EDGE (phi, loop->single_exit); in slpeel_tree_duplicate_loop_to_edge_cfg()
883 add_phi_arg (phi, phi_arg, new_loop_exit_edge); 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()
914 phi_arg = PHI_ARG_DEF_FROM_EDGE (phi, entry_e); in slpeel_tree_duplicate_loop_to_edge_cfg()
916 add_phi_arg (phi, phi_arg, new_exit_e); in slpeel_tree_duplicate_loop_to_edge_cfg()
[all …]
H A Dtree-ssa-live.c356 tree phi, def; in remove_unused_locals() local
362 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in remove_unused_locals()
368 if (is_global_var (SSA_NAME_VAR (PHI_RESULT (phi)))) in remove_unused_locals()
371 def = PHI_RESULT (phi); in remove_unused_locals()
374 FOR_EACH_PHI_ARG (arg_p, phi, i, SSA_OP_ALL_USES) in remove_unused_locals()
434 tree phi, arg; in create_ssa_var_map() local
436 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in create_ssa_var_map()
439 register_ssa_partition (map, PHI_RESULT (phi), false); in create_ssa_var_map()
440 for (i = 0; i < PHI_NUM_ARGS (phi); i++) in create_ssa_var_map()
442 arg = PHI_ARG_DEF (phi, i); in create_ssa_var_map()
[all …]
H A Dtree-into-ssa.c413 tree phi, stmt; in initialize_flags_in_bb() local
416 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in initialize_flags_in_bb()
418 REWRITE_THIS_STMT (phi) = 0; in initialize_flags_in_bb()
419 REGISTER_DEFS_IN_THIS_STMT (phi) = 0; in initialize_flags_in_bb()
1092 mark_phi_for_rewrite (basic_block bb, tree phi) in mark_phi_for_rewrite() argument
1097 if (REWRITE_THIS_STMT (phi)) in mark_phi_for_rewrite()
1099 REWRITE_THIS_STMT (phi) = 1; in mark_phi_for_rewrite()
1113 VEC_safe_push (tree, heap, phis, phi); in mark_phi_for_rewrite()
1133 tree phi; in insert_phi_nodes_for() local
1164 phi = create_phi_node (var, bb); in insert_phi_nodes_for()
[all …]
H A Dtree-vect-analyze.c237 tree phi; in vect_analyze_operations() local
251 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in vect_analyze_operations()
253 stmt_info = vinfo_for_stmt (phi); in vect_analyze_operations()
257 print_generic_expr (vect_dump, phi, TDF_SLIM); in vect_analyze_operations()
500 tree phi; in vect_analyze_scalar_cycles() local
508 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in vect_analyze_scalar_cycles()
511 tree def = PHI_RESULT (phi); in vect_analyze_scalar_cycles()
512 stmt_vec_info stmt_vinfo = vinfo_for_stmt (phi); in vect_analyze_scalar_cycles()
518 print_generic_expr (vect_dump, phi, TDF_SLIM); in vect_analyze_scalar_cycles()
556 reduc_stmt = vect_is_simple_reduction (loop, phi); in vect_analyze_scalar_cycles()
[all …]
H A Dtree-ssa-propagate.c391 tree phi; in simulate_block() local
402 for (phi = phi_nodes (block); phi; phi = PHI_CHAIN (phi)) in simulate_block()
403 simulate_stmt (phi); in simulate_block()
1030 replace_phi_args_in (tree phi, prop_value_t *prop_value) in replace_phi_args_in() argument
1037 prev_phi = unshare_expr (phi); in replace_phi_args_in()
1039 for (i = 0; i < PHI_NUM_ARGS (phi); i++) in replace_phi_args_in()
1041 tree arg = PHI_ARG_DEF (phi, i); in replace_phi_args_in()
1054 propagate_value (PHI_ARG_DEF_PTR (phi, i), val); in replace_phi_args_in()
1061 && PHI_ARG_EDGE (phi, i)->flags & EDGE_ABNORMAL) in replace_phi_args_in()
1072 print_generic_stmt (dump_file, phi, TDF_SLIM); in replace_phi_args_in()
[all …]
H A Dtree-ssa-copyrename.c301 tree phi, stmt, var, part_var; in rename_ssa_copies() local
332 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in rename_ssa_copies()
335 tree res = PHI_RESULT (phi); in rename_ssa_copies()
341 for (i = 0; i < PHI_NUM_ARGS (phi); i++) in rename_ssa_copies()
343 tree arg = PHI_ARG_DEF (phi, i); in rename_ssa_copies()
H A Dtree-ssa-dom.c724 tree phi; in record_equivalences_from_phis() local
726 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in record_equivalences_from_phis()
728 tree lhs = PHI_RESULT (phi); in record_equivalences_from_phis()
732 for (i = 0; i < PHI_NUM_ARGS (phi); i++) in record_equivalences_from_phis()
734 tree t = PHI_ARG_DEF (phi, i); in record_equivalences_from_phis()
764 if (i == PHI_NUM_ARGS (phi) in record_equivalences_from_phis()
1181 tree lhs, rhs, preinc, phi; in simple_iv_increment_p() local
1201 phi = SSA_NAME_DEF_STMT (preinc); in simple_iv_increment_p()
1202 if (TREE_CODE (phi) != PHI_NODE) in simple_iv_increment_p()
1205 for (i = 0; i < (unsigned) PHI_NUM_ARGS (phi); i++) in simple_iv_increment_p()
[all …]
H A Dtree-ssa-copy.c764 copy_prop_visit_phi_node (tree phi) in copy_prop_visit_phi_node() argument
771 lhs = PHI_RESULT (phi); in copy_prop_visit_phi_node()
776 print_generic_expr (dump_file, phi, dump_flags); in copy_prop_visit_phi_node()
780 for (i = 0; i < PHI_NUM_ARGS (phi); i++) in copy_prop_visit_phi_node()
783 tree arg = PHI_ARG_DEF (phi, i); in copy_prop_visit_phi_node()
784 edge e = PHI_ARG_EDGE (phi, i); in copy_prop_visit_phi_node()
894 tree phi, def; in init_copy_prop() local
929 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in init_copy_prop()
931 def = PHI_RESULT (phi); in init_copy_prop()
933 DONT_SIMULATE_AGAIN (phi) = true; in init_copy_prop()
[all …]
H A Dtree-scalar-evolution.c414 loop_phi_node_p (tree phi) in loop_phi_node_p() argument
420 return loop_containing_stmt (phi)->header == bb_for_stmt (phi); in loop_phi_node_p()
1220 backedge_phi_arg_p (tree phi, int i) in backedge_phi_arg_p() argument
1222 edge e = PHI_ARG_EDGE (phi, i); in backedge_phi_arg_p()
2103 tree phi; in loop_closed_phi_def() local
2114 for (phi = phi_nodes (exit->dest); phi; phi = PHI_CHAIN (phi)) in loop_closed_phi_def()
2115 if (PHI_ARG_DEF_FROM_EDGE (phi, exit) == var) in loop_closed_phi_def()
2116 return PHI_RESULT (phi); in loop_closed_phi_def()
2676 tree phi, chrec; in analyze_scalar_evolution_for_all_loop_phi_nodes() local
2681 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in analyze_scalar_evolution_for_all_loop_phi_nodes()
[all …]
H A Dtree-ssa-uncprop.c479 tree phi = phi_nodes (e->dest); in uncprop_into_successor_phis() local
483 if (!phi) in uncprop_into_successor_phis()
494 for ( ; phi; phi = PHI_CHAIN (phi)) in uncprop_into_successor_phis()
497 tree arg = PHI_ARG_DEF (phi, e->dest_idx); in uncprop_into_successor_phis()
505 && SSA_NAME_VAR (arg) != SSA_NAME_VAR (PHI_RESULT (phi))) in uncprop_into_successor_phis()
527 if (SSA_NAME_VAR (equiv) == SSA_NAME_VAR (PHI_RESULT (phi))) in uncprop_into_successor_phis()
529 SET_PHI_ARG_DEF (phi, e->dest_idx, equiv); in uncprop_into_successor_phis()
H A Dtree-ssa-dse.c371 tree phi; in dse_record_phis() local
373 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) in dse_record_phis()
374 if (!is_gimple_reg (PHI_RESULT (phi))) in dse_record_phis()
377 get_stmt_uid (phi)); in dse_record_phis()
H A Dtree-flow-inline.h515 get_phi_result_ptr (tree phi) in get_phi_result_ptr() argument
517 return &(PHI_RESULT_TREE (phi)); in get_phi_result_ptr()
522 get_phi_arg_def_ptr (tree phi, int i) in get_phi_arg_def_ptr() argument
524 return &(PHI_ARG_IMM_USE_NODE (phi,i)); in get_phi_arg_def_ptr()
550 tree phi; in set_phi_nodes() local
553 for (phi = l; phi; phi = PHI_CHAIN (phi)) in set_phi_nodes()
554 set_bb_for_stmt (phi, bb); in set_phi_nodes()
564 tree phi; in phi_arg_index_from_use() local
570 phi = USE_STMT (use); in phi_arg_index_from_use()
571 gcc_assert (TREE_CODE (phi) == PHI_NODE); in phi_arg_index_from_use()
[all …]
H A Dtree-ssa-threadedge.c165 tree phi; in record_temporary_equivalences_from_phis() local
170 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi)) in record_temporary_equivalences_from_phis()
172 tree src = PHI_ARG_DEF_FROM_EDGE (phi, e); in record_temporary_equivalences_from_phis()
173 tree dst = PHI_RESULT (phi); in record_temporary_equivalences_from_phis()
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp155 MachineBasicBlock::iterator phi = BB.begin(); in runOnMachineFunction() local
156 while (phi != BB.end() && phi->isPHI()) { in runOnMachineFunction()
157 for (unsigned i = phi->getNumOperands() - 1; i >= 2; i-=2) in runOnMachineFunction()
158 if (!preds.count(phi->getOperand(i).getMBB())) { in runOnMachineFunction()
159 phi->removeOperand(i); in runOnMachineFunction()
160 phi->removeOperand(i-1); in runOnMachineFunction()
164 if (phi->getNumOperands() == 3) { in runOnMachineFunction()
165 const MachineOperand &Input = phi->getOperand(1); in runOnMachineFunction()
166 const MachineOperand &Output = phi->getOperand(0); in runOnMachineFunction()
185 BuildMI(BB, BB.getFirstNonPHI(), phi->getDebugLoc(), in runOnMachineFunction()
[all …]
/openbsd-src/gnu/usr.bin/perl/dist/Math-Complex/lib/Math/
H A DTrig.pm123 my ( $rho, $theta, $phi ) = @_;
125 return ( $rho * cos( $theta ) * sin( $phi ),
126 $rho * sin( $theta ) * sin( $phi ),
127 $rho * cos( $phi ) );
210 my $phi = acos_real($z);
212 return ($theta, $phi);
/openbsd-src/gnu/usr.bin/gcc/gcc/
H A Dssa.c647 rtx phi, reg; local
674 phi = gen_rtx_PHI (VOIDmode, vec);
675 phi = gen_rtx_SET (VOIDmode, reg, phi);
679 emit_insn_before (phi, insn);
1067 rtx phi = PATTERN (insn); local
1076 reg = SET_DEST (phi);
1088 if (! remove_phi_alternative (phi, b))
1096 if (GET_MODE (SET_DEST (phi)) == VOIDmode)
1097 PUT_MODE (SET_DEST (phi), GET_MODE (reg));
1098 else if (GET_MODE (SET_DEST (phi)) != GET_MODE (reg))
[all …]

12345