Home
last modified time | relevance | path

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

12345678

/netbsd/src/external/gpl3/gcc/dist/gcc/
Dtree-phinodes.cc96 gphi *phi; in allocate_phi_node() local
111 phi = as_a <gphi *> (free_phinodes[bucket]->pop ()); in allocate_phi_node()
119 phi = static_cast <gphi *> (ggc_internal_alloc (size)); in allocate_phi_node()
129 return phi; in allocate_phi_node()
171 gphi *phi; in make_phi_node() local
176 phi = allocate_phi_node (capacity); in make_phi_node()
181 memset (phi, 0, (sizeof (struct gphi) in make_phi_node()
184 phi->code = GIMPLE_PHI; in make_phi_node()
185 gimple_init_singleton (phi); in make_phi_node()
186 phi->nargs = len; in make_phi_node()
[all …]
Dgimple-ssa-split-paths.cc194 gimple *phi = gsi_stmt (gsi); in is_feasible_trace() local
195 if ((gimple_phi_arg_def (phi, 0) == lhs1 in is_feasible_trace()
196 && gimple_phi_arg_def (phi, 1) == lhs2) in is_feasible_trace()
197 || (gimple_phi_arg_def (phi, 1) == lhs1 in is_feasible_trace()
198 && gimple_phi_arg_def (phi, 0) == lhs2)) in is_feasible_trace()
240 gimple *phi = gsi_stmt (gsi); in is_feasible_trace() local
241 if ((gimple_phi_arg_def (phi, 0) == lhs1 in is_feasible_trace()
242 && gimple_phi_arg_def (phi, 1) == rhs1) in is_feasible_trace()
243 || (gimple_phi_arg_def (phi, 1) == lhs1 in is_feasible_trace()
244 && gimple_phi_arg_def (phi, 0) == rhs1)) in is_feasible_trace()
[all …]
Dgimple-range-path.cc272 path_range_query::ssa_range_in_phi (irange &r, gphi *phi) in ssa_range_in_phi() argument
274 tree name = gimple_phi_result (phi); in ssa_range_in_phi()
275 basic_block bb = gimple_bb (phi); in ssa_range_in_phi()
276 unsigned nargs = gimple_phi_num_args (phi); in ssa_range_in_phi()
280 if (m_resolve && m_ranger->range_of_expr (r, name, phi)) in ssa_range_in_phi()
290 tree arg = gimple_phi_arg_def (phi, i); in ssa_range_in_phi()
306 if (e_in == gimple_phi_arg_edge (phi, i)) in ssa_range_in_phi()
308 tree arg = gimple_phi_arg_def (phi, i); in ssa_range_in_phi()
390 gphi *phi = iter.phi (); in compute_ranges_in_phis() local
391 tree name = gimple_phi_result (phi); in compute_ranges_in_phis()
[all …]
Dtree-parloops.cc225 parloops_is_slp_reduction (loop_vec_info loop_info, gimple *phi, in parloops_is_slp_reduction() argument
228 class loop *loop = (gimple_bb (phi))->loop_father; in parloops_is_slp_reduction()
243 lhs = PHI_RESULT (phi); in parloops_is_slp_reduction()
256 if (use_stmt == phi) in parloops_is_slp_reduction()
301 if (!found || loop_use_stmt != phi || size < 2) in parloops_is_slp_reduction()
306 lhs = PHI_RESULT (phi); in parloops_is_slp_reduction()
460 gphi *phi = as_a <gphi *> (phi_info->stmt); in parloops_is_simple_reduction() local
461 class loop *loop = (gimple_bb (phi))->loop_father; in parloops_is_simple_reduction()
476 tree phi_name = PHI_RESULT (phi); in parloops_is_simple_reduction()
504 tree loop_arg = PHI_ARG_DEF_FROM_EDGE (phi, latch_e); in parloops_is_simple_reduction()
[all …]
Dtree-ssa-uninit.cc947 gphi *phi = si.phi (); in warn_uninit_phi_uses() local
948 tree def = PHI_ARG_DEF_FROM_EDGE (phi, found); in warn_uninit_phi_uses()
959 FOR_EACH_IMM_USE_FAST (use_p, iter, gimple_phi_result (phi)) in warn_uninit_phi_uses()
1084 can_skip_redundant_opnd (tree opnd, gimple *phi) in can_skip_redundant_opnd() argument
1086 tree phi_def = gimple_phi_result (phi); in can_skip_redundant_opnd()
1108 compute_uninit_opnds_pos (gphi *phi) in compute_uninit_opnds_pos() argument
1112 unsigned n = gimple_phi_num_args (phi); in compute_uninit_opnds_pos()
1119 tree op = gimple_phi_arg_def (phi, i); in compute_uninit_opnds_pos()
1122 && !can_skip_redundant_opnd (op, phi)) in compute_uninit_opnds_pos()
1160 uninit_undef_val_t::phi_arg_set (gphi *phi) in phi_arg_set() argument
[all …]
Dgimple-predicate-analysis.cc326 find_var_cmp_const (pred_chain_union preds, gphi *phi, gimple **flag_def, in find_var_cmp_const() argument
367 || gimple_bb (lhs_def) != gimple_bb (phi)) in find_var_cmp_const()
419 || gimple_bb (*flag_def) != gimple_bb (phi) in find_var_cmp_const()
480 prune_phi_opnds (gphi *phi, unsigned opnds, gphi *flag_def, in prune_phi_opnds() argument
507 tree phi_arg = gimple_phi_arg_def (phi, i); in prune_phi_opnds()
546 tree opnd = gimple_phi_arg_def (phi, i); in prune_phi_opnds()
553 edge opnd_edge = gimple_phi_arg_edge (phi, i); in prune_phi_opnds()
554 if (def_preds.is_use_guarded (phi, opnd_edge->src, in prune_phi_opnds()
575 collect_phi_def_edges (gphi *phi, basic_block cd_root, auto_vec<edge> *edges, in collect_phi_def_edges() argument
584 print_gimple_stmt (dump_file, phi, 0); in collect_phi_def_edges()
[all …]
Dtree-ssa-phiopt.cc144 gphi *phi = NULL; in single_non_singleton_phi_for_edges() local
157 if (phi) in single_non_singleton_phi_for_edges()
160 phi = p; in single_non_singleton_phi_for_edges()
162 return phi; in single_non_singleton_phi_for_edges()
199 gphi *phi; in tree_ssa_phiopt_worker() local
306 phi = as_a <gphi *> (gsi_stmt (gsi)); in tree_ssa_phiopt_worker()
307 arg0 = gimple_phi_arg_def (phi, e1->dest_idx); in tree_ssa_phiopt_worker()
308 arg1 = gimple_phi_arg_def (phi, e2->dest_idx); in tree_ssa_phiopt_worker()
309 if (value_replacement (bb, bb1, e1, e2, phi, arg0, arg1) == 2) in tree_ssa_phiopt_worker()
320 phi = single_non_singleton_phi_for_edges (phis, e1, e2); in tree_ssa_phiopt_worker()
[all …]
Dgimple-streamer-out.cc39 output_phi (struct output_block *ob, gphi *phi) in output_phi() argument
41 unsigned i, len = gimple_phi_num_args (phi); in output_phi()
44 streamer_write_uhwi (ob, SSA_NAME_VERSION (PHI_RESULT (phi))); in output_phi()
48 stream_write_tree (ob, gimple_phi_arg_def (phi, i), true); in output_phi()
49 streamer_write_uhwi (ob, gimple_phi_arg_edge (phi, i)->src->index); in output_phi()
51 location_t loc = gimple_phi_arg_location (phi, i); in output_phi()
246 gphi *phi = psi.phi (); in output_bb() local
251 if (!virtual_operand_p (gimple_phi_result (phi))) in output_bb()
252 output_phi (ob, phi); in output_bb()
Dtree-outof-ssa.cc588 gphi *phi = gsi.phi (); in eliminate_build() local
591 p0 = var_to_partition (g->map, gimple_phi_result (phi)); in eliminate_build()
596 Ti = PHI_ARG_DEF (phi, g->e->dest_idx); in eliminate_build()
601 locus = gimple_phi_arg_location_from_edge (phi, g->e); in eliminate_build()
794 remove_gimple_phi_args (gphi *phi) in remove_gimple_phi_args() argument
802 print_gimple_stmt (dump_file, phi, 0, TDF_SLIM); in remove_gimple_phi_args()
805 FOR_EACH_PHI_ARG (arg_p, phi, iter, SSA_OP_USE) in remove_gimple_phi_args()
845 gphi *phi = gsi.phi (); in eliminate_useless_phis() local
846 result = gimple_phi_result (phi); in eliminate_useless_phis()
854 remove_gimple_phi_args (phi); in eliminate_useless_phis()
[all …]
Dtree-ssa-phiprop.cc133 phiprop_insert_phi (basic_block bb, gphi *phi, gimple *use_stmt, in phiprop_insert_phi() argument
164 old_arg = PHI_ARG_DEF_FROM_EDGE (phi, e); in phiprop_insert_phi()
165 locus = gimple_phi_arg_location_from_edge (phi, e); in phiprop_insert_phi()
180 print_generic_expr (dump_file, PHI_ARG_DEF_FROM_EDGE (phi, e)); in phiprop_insert_phi()
198 old_arg = PHI_ARG_DEF_FROM_EDGE (phi, e); in phiprop_insert_phi()
213 print_generic_expr (dump_file, PHI_ARG_DEF_FROM_EDGE (phi, e)); in phiprop_insert_phi()
262 propagate_with_phi (basic_block bb, gphi *phi, struct phiprop_d *phivn, in propagate_with_phi() argument
265 tree ptr = PHI_RESULT (phi); in propagate_with_phi()
282 FOR_EACH_PHI_ARG (arg_p, phi, i, SSA_OP_USE) in propagate_with_phi()
376 gimple_bb (phi)))) in propagate_with_phi()
[all …]
Dtree-ssa-loop-manip.cc65 gphi *phi; in create_iv() local
156 phi = create_phi_node (vb, loop->header); in create_iv()
157 add_phi_arg (phi, initial, loop_preheader_edge (loop), UNKNOWN_LOCATION); in create_iv()
158 add_phi_arg (phi, va, loop_latch_edge (loop), UNKNOWN_LOCATION); in create_iv()
289 gphi *phi; in add_exit_phi() local
309 phi = create_phi_node (NULL_TREE, exit); in add_exit_phi()
310 create_new_def_for (var, phi, gimple_phi_result_ptr (phi)); in add_exit_phi()
312 add_phi_arg (phi, var, e, UNKNOWN_LOCATION); in add_exit_phi()
317 print_gimple_stmt (dump_file, phi, 0, dump_flags); in add_exit_phi()
462 gphi *phi = bsi.phi (); in find_uses_to_rename_bb() local
[all …]
Dtree-phinodes.h25 extern void add_phi_node_to_bb (gphi *phi, basic_block bb);
47 gimple *phi; in phi_arg_index_from_use() local
53 phi = USE_STMT (use); in phi_arg_index_from_use()
56 root = gimple_phi_arg (phi, 0); in phi_arg_index_from_use()
63 && index < gimple_phi_capacity (phi)); in phi_arg_index_from_use()
Dtree-ssa-loop-unswitch.cc143 if (gphi *phi = dyn_cast <gphi *> (def)) in is_maybe_undefined() local
145 for (unsigned i = 0; i < gimple_phi_num_args (phi); ++i) in is_maybe_undefined()
147 tree t = gimple_phi_arg_def (phi, i); in is_maybe_undefined()
744 gphi *phi = gsi.phi (); in empty_bb_without_guard_p() local
745 name = PHI_RESULT (phi); in empty_bb_without_guard_p()
808 gphi *phi = gsi.phi (); in get_vop_from_header() local
809 if (!virtual_operand_p (gimple_phi_result (phi))) in get_vop_from_header()
811 return PHI_ARG_DEF_FROM_EDGE (phi, loop_preheader_edge (loop)); in get_vop_from_header()
948 gphi *phi = gsi.phi (); in hoist_guard() local
950 if (virtual_operand_p (gimple_phi_result (phi))) in hoist_guard()
[all …]
Dtree-ssa-sink.cc81 find_bb_for_arg (gphi *phi, tree def) in find_bb_for_arg() argument
86 for (i = 0; i < gimple_phi_num_args (phi); i++) in find_bb_for_arg()
87 if (PHI_ARG_DEF (phi, i) == def) in find_bb_for_arg()
92 result = gimple_phi_arg_edge (phi, i)->src; in find_bb_for_arg()
145 if (gphi *phi = dyn_cast <gphi *> (usestmt)) in nearest_common_dominator_of_uses() local
149 useblock = gimple_phi_arg_edge (phi, idx)->src; in nearest_common_dominator_of_uses()
502 gphi *phi; in sink_common_stores_to_bb() local
505 && (phi = get_virtual_phi (bb))) in sink_common_stores_to_bb()
520 for (unsigned i = 0; i < gimple_phi_num_args (phi); ++i) in sink_common_stores_to_bb()
522 tree arg = gimple_phi_arg_def (phi, i); in sink_common_stores_to_bb()
[all …]
Dgimple-ssa-strength-reduction.cc803 slsr_process_phi (gphi *phi, bool speed) in slsr_process_phi() argument
808 class loop *cand_loop = gimple_bb (phi)->loop_father; in slsr_process_phi()
817 for (i = 0; i < gimple_phi_num_args (phi); i++) in slsr_process_phi()
820 tree arg = gimple_phi_arg_def (phi, i); in slsr_process_phi()
849 if (uses_consumed_by_stmt (arg, phi)) in slsr_process_phi()
877 c = alloc_cand_and_find_basis (CAND_PHI, phi, arg0_base, in slsr_process_phi()
882 add_cand_for_stmt (phi, c); in slsr_process_phi()
1744 slsr_process_phi (gsi.phi (), speed); in before_dom_children()
2377 clear_visited (gphi *phi) in clear_visited() argument
2380 slsr_cand_t phi_cand = *stmt_cand_map->get (phi); in clear_visited()
[all …]
Dtree-ssa.cc143 gphi *phi; in ssa_redirect_edge() local
156 phi = gsi.phi (); in ssa_redirect_edge()
157 def = gimple_phi_arg_def (phi, e->dest_idx); in ssa_redirect_edge()
158 locus = gimple_phi_arg_location (phi, e->dest_idx); in ssa_redirect_edge()
163 redirect_edge_var_map_add (e, gimple_phi_result (phi), def, locus); in ssa_redirect_edge()
178 gphi *phi; in flush_pending_stmts() local
193 phi = gsi.phi (); in flush_pending_stmts()
195 add_phi_arg (phi, def, e, redirect_edge_var_map_location (vm)); in flush_pending_stmts()
655 gphi *phi = NULL; in verify_vssa() local
659 tree res = gimple_phi_result (si.phi ()); in verify_vssa()
[all …]
Dtree-ssa-copy.cc328 copy_prop::visit_phi (gphi *phi) in visit_phi() argument
334 tree lhs = gimple_phi_result (phi); in visit_phi()
339 print_gimple_stmt (dump_file, phi, 0, dump_flags); in visit_phi()
342 for (i = 0; i < gimple_phi_num_args (phi); i++) in visit_phi()
346 tree arg = gimple_phi_arg_def (phi, i); in visit_phi()
347 edge e = gimple_phi_arg_edge (phi, i); in visit_phi()
477 gphi *phi = si.phi (); in init_copy_prop() local
480 def = gimple_phi_result (phi); in init_copy_prop()
482 prop_set_simulate_again (phi, false); in init_copy_prop()
484 prop_set_simulate_again (phi, true); in init_copy_prop()
[all …]
Dtree-ssa-propagate.cc605 substitute_and_fold_engine::replace_phi_args_in (gphi *phi) in replace_phi_args_in() argument
610 for (i = 0; i < gimple_phi_num_args (phi); i++) in replace_phi_args_in()
612 tree arg = gimple_phi_arg_def (phi, i); in replace_phi_args_in()
616 edge e = gimple_phi_arg_edge (phi, i); in replace_phi_args_in()
626 propagate_value (PHI_ARG_DEF_PTR (phi, i), val); in replace_phi_args_in()
653 print_gimple_stmt (dump_file, phi, 0, TDF_SLIM); in replace_phi_args_in()
736 gphi *phi = gpi.phi (); in propagate_into_phi_args() local
737 use_operand_p use_p = PHI_ARG_DEF_PTR_FROM_EDGE (phi, e); in propagate_into_phi_args()
765 gphi *phi = i.phi (); in before_dom_children() local
766 tree res = gimple_phi_result (phi); in before_dom_children()
[all …]
Dgimple-ssa-backprop.cc460 backprop::process_phi_use (gphi *phi, usage_info *info) in process_phi_use() argument
462 tree result = gimple_phi_result (phi); in process_phi_use()
484 else if (gphi *phi = dyn_cast <gphi *> (stmt)) in process_use() local
485 process_phi_use (phi, info); in process_use()
507 gphi *phi = dyn_cast <gphi *> (stmt); in intersect_uses() local
508 if (phi in intersect_uses()
509 && !bitmap_bit_p (m_visited_blocks, gimple_bb (phi)->index) in intersect_uses()
511 SSA_NAME_VERSION (gimple_phi_result (phi)))) in intersect_uses()
519 print_gimple_stmt (dump_file, phi, 0, TDF_SLIM); in intersect_uses()
641 tree result = gimple_phi_result (gpi.phi ()); in process_block()
[all …]
Dtree-ssa-dce.cc394 gimple *phi, *stmt; in find_obviously_necessary_stmts() local
402 phi = gsi_stmt (gsi); in find_obviously_necessary_stmts()
403 gimple_set_plf (phi, STMT_NECESSARY, false); in find_obviously_necessary_stmts()
635 degenerate_phi_p (gimple *phi) in degenerate_phi_p() argument
638 tree op = gimple_phi_arg_def (phi, 0); in degenerate_phi_p()
639 for (i = 1; i < gimple_phi_num_args (phi); i++) in degenerate_phi_p()
640 if (gimple_phi_arg_def (phi, i) != op) in degenerate_phi_p()
705 gphi *phi = as_a <gphi *> (stmt); in propagate_necessity() local
788 basic_block arg_bb = gimple_phi_arg_edge (phi, k)->src; in propagate_necessity()
1015 gphi *phi; in remove_dead_phis() local
[all …]
Dtree-ssa-loop-split.cc191 gphi *phi; in find_or_create_guard_phi() local
192 if ((phi = dyn_cast <gphi *> (def)) in find_or_create_guard_phi()
193 && gimple_bb (phi) == loop->header) in find_or_create_guard_phi()
194 return phi; in find_or_create_guard_phi()
215 gphi *phi = psi.phi (); in easy_exit_values() local
216 tree next = PHI_ARG_DEF_FROM_EDGE (phi, latch); in easy_exit_values()
253 gphi *phi_first = psi_first.phi (); in connect_loop_phis()
254 gphi *phi_second = psi_second.phi (); in connect_loop_phis()
573 gphi *phi = find_or_create_guard_phi (loop1, guard_iv, &iv); in split_loop() local
574 if (!phi) in split_loop()
[all …]
Dtree-switch-conversion.cc244 gphi *phi = gsi.phi (); in check_final_bb() local
247 if (virtual_operand_p (gimple_phi_result (phi))) in check_final_bb()
252 for (i = 0; i < gimple_phi_num_args (phi); i++) in check_final_bb()
254 basic_block bb = gimple_phi_arg_edge (phi, i)->src; in check_final_bb()
265 val = gimple_phi_arg_def (phi, i); in check_final_bb()
356 gphi *phi = gsi.phi (); in gather_default_values() local
357 if (virtual_operand_p (gimple_phi_result (phi))) in gather_default_values()
359 tree val = PHI_ARG_DEF_FROM_EDGE (phi, e); in gather_default_values()
416 gphi *phi = gsi.phi (); in build_constructors() local
417 if (virtual_operand_p (gimple_phi_result (phi))) in build_constructors()
[all …]
/netbsd/src/external/bsd/pcc/dist/pcc/mip/
Doptim2.c746 SLIST_INIT(&bb->phi); in bblocks_build()
1138 struct phiinfo *phi; in placePhiFunctions() local
1193 SLIST_FOREACH(phi, &y->phi, phielem) { in placePhiFunctions()
1194 if (phi->tmpregno==i+defsites.low) in placePhiFunctions()
1214 phi = tmpcalloc(sizeof(struct phiinfo)); in placePhiFunctions()
1216 phi->tmpregno=i+defsites.low; in placePhiFunctions()
1217 phi->size=k; in placePhiFunctions()
1218 phi->n_type=ntype; in placePhiFunctions()
1219 phi->intmpregno=tmpcalloc(k*sizeof(int)); in placePhiFunctions()
1221 SLIST_INSERT_LAST(&y->phi,phi,phielem); in placePhiFunctions()
[all …]
/netbsd/src/external/lgpl3/gmp/dist/mpn/s390_32/
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
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

12345678