Searched refs:phi (Results 1 - 25 of 289) sorted by relevance

1234567891011>>

/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dtree-phinodes.c96 gphi *phi; local
111 phi = as_a <gphi *> (free_phinodes[bucket]->pop ());
119 phi = static_cast <gphi *> (ggc_internal_alloc (size));
129 return phi;
171 gphi *phi; local
176 phi = allocate_phi_node (capacity);
181 memset (phi, 0, (sizeof (struct gphi)
184 phi->code = GIMPLE_PHI;
185 gimple_init_singleton (phi);
186 phi
213 release_phi_node(gimple *phi) argument
237 resize_phi_node(gphi *phi, size_t len) argument
319 add_phi_node_to_bb(gphi *phi, basic_block bb) argument
341 gphi *phi = make_phi_node (var, EDGE_COUNT (bb->preds)); local
355 add_phi_arg(gphi *phi, tree def, edge e, location_t locus) argument
388 remove_phi_arg_num(gphi *phi, int i) argument
440 gimple *phi = gsi_stmt (*gsi); local
471 degenerate_phi_result(gphi *phi) argument
[all...]
H A Dtree-phinodes.h25 extern void add_phi_node_to_bb (gphi *phi, basic_block bb);
40 /* Return the phi argument which contains the specified use. */
47 gimple *phi; local
53 phi = USE_STMT (use);
56 root = gimple_phi_arg (phi, 0);
63 && index < gimple_phi_capacity (phi));
H A Dgimple-ssa-split-paths.c193 gimple *phi = gsi_stmt (gsi); local
194 if ((gimple_phi_arg_def (phi, 0) == lhs1
195 && gimple_phi_arg_def (phi, 1) == lhs2)
196 || (gimple_phi_arg_def (phi, 1) == lhs1
197 && gimple_phi_arg_def (phi, 0) == lhs2))
239 gimple *phi = gsi_stmt (gsi); local
240 if ((gimple_phi_arg_def (phi, 0) == lhs1
241 && gimple_phi_arg_def (phi, 1) == rhs1)
242 || (gimple_phi_arg_def (phi, 1) == lhs1
243 && gimple_phi_arg_def (phi,
263 gphi *phi = si.phi (); local
266 FOR_EACH_IMM_USE_FAST(use_p, iter, gimple_phi_result (phi)) argument
[all...]
H A Dgimple-streamer-out.c39 output_phi (struct output_block *ob, gphi *phi) argument
41 unsigned i, len = gimple_phi_num_args (phi);
44 streamer_write_uhwi (ob, SSA_NAME_VERSION (PHI_RESULT (phi)));
48 stream_write_tree (ob, gimple_phi_arg_def (phi, i), true);
49 streamer_write_uhwi (ob, gimple_phi_arg_edge (phi, i)->src->index);
51 location_t loc = gimple_phi_arg_location (phi, i);
246 gphi *phi = psi.phi (); local
251 if (!virtual_operand_p (gimple_phi_result (phi)))
252 output_phi (ob, phi);
[all...]
H A Dtree-ssa-phiprop.c129 /* Insert a new phi node for the dereference of PHI at basic_block
133 phiprop_insert_phi (basic_block bb, gphi *phi, gimple *use_stmt, argument
164 old_arg = PHI_ARG_DEF_FROM_EDGE (phi, e);
165 locus = gimple_phi_arg_location_from_edge (phi, e);
180 print_generic_expr (dump_file, PHI_ARG_DEF_FROM_EDGE (phi, e));
198 old_arg = PHI_ARG_DEF_FROM_EDGE (phi, e);
213 print_generic_expr (dump_file, PHI_ARG_DEF_FROM_EDGE (phi, e));
247 /* Propagate between the phi node arguments of PHI in BB and phi result
262 propagate_with_phi (basic_block bb, gphi *phi, struc argument
[all...]
H A Dtree-ssa-uninit.c51 ssa names that are defined by phi with operands that
117 gives which argument of the phi node to take the location from. WC
389 another phi with one operand defined by this PHI,
395 can_skip_redundant_opnd (tree opnd, gimple *phi) argument
401 phi_def = gimple_phi_result (phi);
422 compute_uninit_opnds_pos (gphi *phi) argument
427 n = gimple_phi_num_args (phi);
428 /* Bail out for phi with too many args. */
434 tree op = gimple_phi_arg_def (phi, i);
437 && !can_skip_redundant_opnd (op, phi))
817 collect_phi_def_edges(gphi *phi, basic_block cd_root, auto_vec<edge> *edges, hash_set<gimple *> *visited_phis) argument
870 find_def_preds(pred_chain_union *preds, gphi *phi) argument
1152 prune_uninit_phi_opnds(gphi *phi, unsigned uninit_opnds, gphi *flag_def, tree boundary_cst, enum tree_code cmp_code, hash_set<gphi *> *visited_phis, bitmap *visited_flag_phis) argument
1326 use_pred_not_overlap_with_undef_path_pred(pred_chain_union preds, gphi *phi, unsigned uninit_opnds, hash_set<gphi *> *visited_phis) argument
2018 is_degenerated_phi(gimple *phi, pred_info *pred_p) argument
2338 uninit_uses_cannot_happen(gphi *phi, unsigned uninit_opnds, pred_chain_union phi_use_guards) argument
2424 is_use_properly_guarded(gimple *use_stmt, basic_block use_bb, gphi *phi, unsigned uninit_opnds, pred_chain_union *def_preds, hash_set<gphi *> *visited_phis) argument
2503 find_uninit_use(gphi *phi, unsigned uninit_opnds, vec<gphi *> *worklist, hash_set<gphi *> *added_to_worklist) argument
2575 warn_uninitialized_phi(gphi *phi, vec<gphi *> *worklist, hash_set<gphi *> *added_to_worklist) argument
2679 gphi *phi = gsi.phi (); local
[all...]
H A Dtree-outof-ssa.c556 /* Return true if this phi argument T should have a copy queued when using
588 gphi *phi = gsi.phi (); local
591 p0 = var_to_partition (g->map, gimple_phi_result (phi));
596 Ti = PHI_ARG_DEF (phi, g->e->dest_idx);
601 locus = gimple_phi_arg_location_from_edge (phi, g->e);
735 /* Eliminate all the phi nodes on edge E in graph G. */
794 remove_gimple_phi_args (gphi *phi) argument
802 print_gimple_stmt (dump_file, phi, 0, TDF_SLIM);
805 FOR_EACH_PHI_ARG (arg_p, phi, ite
845 gphi *phi = gsi.phi (); local
886 gphi *phi = gsi.phi (); local
1180 gphi *phi = gsi.phi (); local
[all...]
H A Dgimple-ssa-evrp.c107 gphi *phi = gpi.phi (); local
108 tree lhs = PHI_RESULT (phi);
117 stmts_to_remove.safe_push (phi);
241 gphi *phi = gpi.phi (); local
242 use_operand_p use_p = PHI_ARG_DEF_PTR_FROM_EDGE (phi, e);
H A Dtree-ssa-copy.c328 copy_prop::visit_phi (gphi *phi) argument
334 tree lhs = gimple_phi_result (phi);
339 print_gimple_stmt (dump_file, phi, 0, dump_flags);
342 for (i = 0; i < gimple_phi_num_args (phi); i++)
346 tree arg = gimple_phi_arg_def (phi, i);
347 edge e = gimple_phi_arg_edge (phi, i);
477 gphi *phi = si.phi (); local
480 def = gimple_phi_result (phi);
482 prop_set_simulate_again (phi, fals
[all...]
H A Dtree-ssa-loop-manip.c65 gphi *phi; local
156 phi = create_phi_node (vb, loop->header);
157 add_phi_arg (phi, initial, loop_preheader_edge (loop), UNKNOWN_LOCATION);
158 add_phi_arg (phi, va, loop_latch_edge (loop), UNKNOWN_LOCATION);
289 gphi *phi; local
309 phi = create_phi_node (NULL_TREE, exit);
310 create_new_def_for (var, phi, gimple_phi_result_ptr (phi));
312 add_phi_arg (phi, var, e, UNKNOWN_LOCATION);
317 print_gimple_stmt (dump_file, phi,
464 gphi *phi = bsi.phi (); local
558 gphi *phi = bsi.phi (); local
739 gphi *phi = bsi.phi (); local
803 gphi *phi, *new_phi; local
1461 gphi *phi = psi->phi (); local
1541 gphi *phi = psi.phi (); local
[all...]
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dtree-phinodes.cc96 gphi *phi; local
111 phi = as_a <gphi *> (free_phinodes[bucket]->pop ());
119 phi = static_cast <gphi *> (ggc_internal_alloc (size));
129 return phi;
171 gphi *phi; local
176 phi = allocate_phi_node (capacity);
181 memset (phi, 0, (sizeof (struct gphi)
184 phi->code = GIMPLE_PHI;
185 gimple_init_singleton (phi);
186 phi
213 release_phi_node(gimple *phi) argument
237 resize_phi_node(gphi *phi, size_t len) argument
319 add_phi_node_to_bb(gphi *phi, basic_block bb) argument
341 gphi *phi = make_phi_node (var, EDGE_COUNT (bb->preds)); local
355 add_phi_arg(gphi *phi, tree def, edge e, location_t locus) argument
388 remove_phi_arg_num(gphi *phi, int i) argument
[all...]
H A Dtree-phinodes.h25 extern void add_phi_node_to_bb (gphi *phi, basic_block bb);
40 /* Return the phi argument which contains the specified use. */
47 gimple *phi; local
53 phi = USE_STMT (use);
56 root = gimple_phi_arg (phi, 0);
63 && index < gimple_phi_capacity (phi));
H A Dgimple-ssa-split-paths.cc194 gimple *phi = gsi_stmt (gsi); local
195 if ((gimple_phi_arg_def (phi, 0) == lhs1
196 && gimple_phi_arg_def (phi, 1) == lhs2)
197 || (gimple_phi_arg_def (phi, 1) == lhs1
198 && gimple_phi_arg_def (phi, 0) == lhs2))
240 gimple *phi = gsi_stmt (gsi); local
241 if ((gimple_phi_arg_def (phi, 0) == lhs1
242 && gimple_phi_arg_def (phi, 1) == rhs1)
243 || (gimple_phi_arg_def (phi, 1) == lhs1
244 && gimple_phi_arg_def (phi,
279 gimple *phi = gsi_stmt (gsi); local
302 gphi *phi = si.phi (); local
305 FOR_EACH_IMM_USE_FAST(use_p, iter, gimple_phi_result (phi)) argument
[all...]
H A Dgimple-streamer-out.cc39 output_phi (struct output_block *ob, gphi *phi) argument
41 unsigned i, len = gimple_phi_num_args (phi);
44 streamer_write_uhwi (ob, SSA_NAME_VERSION (PHI_RESULT (phi)));
48 stream_write_tree (ob, gimple_phi_arg_def (phi, i), true);
49 streamer_write_uhwi (ob, gimple_phi_arg_edge (phi, i)->src->index);
51 location_t loc = gimple_phi_arg_location (phi, i);
246 gphi *phi = psi.phi (); local
251 if (!virtual_operand_p (gimple_phi_result (phi)))
252 output_phi (ob, phi);
[all...]
H A Dtree-ssa-phiprop.cc129 /* Insert a new phi node for the dereference of PHI at basic_block
133 phiprop_insert_phi (basic_block bb, gphi *phi, gimple *use_stmt, argument
164 old_arg = PHI_ARG_DEF_FROM_EDGE (phi, e);
165 locus = gimple_phi_arg_location_from_edge (phi, e);
180 print_generic_expr (dump_file, PHI_ARG_DEF_FROM_EDGE (phi, e));
198 old_arg = PHI_ARG_DEF_FROM_EDGE (phi, e);
213 print_generic_expr (dump_file, PHI_ARG_DEF_FROM_EDGE (phi, e));
247 /* Propagate between the phi node arguments of PHI in BB and phi result
262 propagate_with_phi (basic_block bb, gphi *phi, struc argument
[all...]
H A Dgimple-range-path.cc272 path_range_query::ssa_range_in_phi (irange &r, gphi *phi) argument
274 tree name = gimple_phi_result (phi);
275 basic_block bb = gimple_bb (phi);
276 unsigned nargs = gimple_phi_num_args (phi);
280 if (m_resolve && m_ranger->range_of_expr (r, name, phi))
283 // Try to fold the phi exclusively with global or cached values.
290 tree arg = gimple_phi_arg_def (phi, i);
306 if (e_in == gimple_phi_arg_edge (phi, i))
308 tree arg = gimple_phi_arg_def (phi, i);
390 gphi *phi local
780 maybe_register_phi_relation(gphi *phi, edge e) argument
822 gphi *phi = iter.phi (); local
[all...]
H A Dtree-ssa-sink.cc81 find_bb_for_arg (gphi *phi, tree def) argument
86 for (i = 0; i < gimple_phi_num_args (phi); i++)
87 if (PHI_ARG_DEF (phi, i) == def)
92 result = gimple_phi_arg_edge (phi, i)->src;
99 We could also do the case where the first immediate use is in a phi node,
102 in the statement occurs for multiple edges in the various phi nodes it's
145 if (gphi *phi = dyn_cast <gphi *> (usestmt))
149 useblock = gimple_phi_arg_edge (phi, idx)->src;
502 gphi *phi; local
505 && (phi
[all...]
H A Dtree-ssa-uninit.cc57 ssa names that are defined by phi with operands that
947 gphi *phi = si.phi (); local
948 tree def = PHI_ARG_DEF_FROM_EDGE (phi, found);
959 FOR_EACH_IMM_USE_FAST (use_p, iter, gimple_phi_result (phi)) argument
1078 another phi with one operand defined by this PHI,
1084 can_skip_redundant_opnd (tree opnd, gimple *phi) argument
1086 tree phi_def = gimple_phi_result (phi);
1108 compute_uninit_opnds_pos (gphi *phi) argument
1112 unsigned n = gimple_phi_num_args (phi);
1160 phi_arg_set(gphi *phi) argument
1175 find_uninit_use(gphi *phi, unsigned uninit_opnds, vec<gphi *> *worklist, hash_set<gphi *> *added_to_worklist) argument
1248 warn_uninitialized_phi(gphi *phi, vec<gphi *> *worklist, hash_set<gphi *> *added_to_worklist) argument
1367 gphi *phi = gsi.phi (); local
[all...]
H A Dtree-outof-ssa.cc556 /* Return true if this phi argument T should have a copy queued when using
588 gphi *phi = gsi.phi (); local
591 p0 = var_to_partition (g->map, gimple_phi_result (phi));
596 Ti = PHI_ARG_DEF (phi, g->e->dest_idx);
601 locus = gimple_phi_arg_location_from_edge (phi, g->e);
735 /* Eliminate all the phi nodes on edge E in graph G. */
794 remove_gimple_phi_args (gphi *phi) argument
802 print_gimple_stmt (dump_file, phi, 0, TDF_SLIM);
805 FOR_EACH_PHI_ARG (arg_p, phi, ite
845 gphi *phi = gsi.phi (); local
886 gphi *phi = gsi.phi (); local
1180 gphi *phi = gsi.phi (); local
[all...]
H A Dtree-ssa-copy.cc328 copy_prop::visit_phi (gphi *phi) argument
334 tree lhs = gimple_phi_result (phi);
339 print_gimple_stmt (dump_file, phi, 0, dump_flags);
342 for (i = 0; i < gimple_phi_num_args (phi); i++)
346 tree arg = gimple_phi_arg_def (phi, i);
347 edge e = gimple_phi_arg_edge (phi, i);
477 gphi *phi = si.phi (); local
480 def = gimple_phi_result (phi);
482 prop_set_simulate_again (phi, fals
[all...]
/netbsd-current/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp162 MachineBasicBlock::iterator phi = BB->begin(); local
163 while (phi != BB->end() && phi->isPHI()) {
164 for (unsigned i = phi->getNumOperands() - 1; i >= 2; i-=2)
165 if (!preds.count(phi->getOperand(i).getMBB())) {
166 phi->RemoveOperand(i);
167 phi->RemoveOperand(i-1);
171 if (phi->getNumOperands() == 3) {
172 const MachineOperand &Input = phi->getOperand(1);
173 const MachineOperand &Output = phi
[all...]
/netbsd-current/external/gpl3/gcc/dist/gcc/rtl-ssa/
H A Dfunctions.cc96 // The initial phase of the phi simplification process. The cumulative
98 // for a phi P with uid ID:
110 function_info::simplify_phi_setup (phi_info *phi, set_info **assumed_values, argument
116 unsigned int phi_uid = phi->uid ();
119 machine_mode phi_mode = phi->mode ();
120 for (use_info *input : phi->inputs ())
141 new_value = phi;
144 // that the phi's mode is at least as large.
148 if (phi->mode () != phi_mode)
149 phi
170 simplify_phi_propagate(phi_info *phi, set_info **assumed_values, bitmap curr_worklist, bitmap next_worklist) argument
[all...]
H A Dblocks.cc72 // Start off with an empty set of phi nodes for each block.
276 for (const phi_info *phi : phis)
283 pp_access (pp, phi, PP_ACCESS_SETTER);
290 pp_string (pp, "no phi nodes");
295 pp_string (pp, "no phi insn");
359 if (auto *phi = safe_dyn_cast<phi_info *> (set))
360 if (phi->is_degenerate ())
362 set = phi->input_value (0);
364 // Remove the phi if it turned out to be useless. This is
367 if (bb == bb->ebb ()->last_bb () && all_uses_are_live_out_uses (phi))
376 append_phi(ebb_info *ebb, phi_info *phi) argument
388 remove_phi(phi_info *phi) argument
407 delete_phi(phi_info *phi) argument
423 replace_phi(phi_info *phi, set_info *new_value) argument
479 phi_info *phi = m_free_phis; local
529 phi_info *phi = create_phi (ebb, def->resource (), &input, 1); local
785 phi_info *phi = create_phi (ebb, { E_BLKmode, regno }, local
1112 phi_info *phi = sorted_phis[phi_i]; local
[all...]
/netbsd-current/external/lgpl3/gmp/dist/mpn/s390_32/
H A Daddmul_1.asm50 alr 0,6 # add vlimb to phi
53 alr 0,6 # conditionally add vlimb to phi
56 ahi 0,1 # increment phi
60 ahi 0,1 # increment phi
76 alr 0,6 # conditionally add vlimb to phi
79 ahi 0,1 # increment phi
83 ahi 0,1 # increment phi
H A Dsubmul_1.asm50 alr 0,6 # add vlimb to phi
53 alr 0,6 # conditionally add vlimb to phi
56 ahi 0,1 # increment phi
60 ahi 0,1 # increment phi
76 alr 0,6 # conditionally add vlimb to phi
79 ahi 0,1 # increment phi
83 ahi 0,1 # increment phi

Completed in 194 milliseconds

1234567891011>>