Home
last modified time | relevance | path

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

12345678

/dflybsd-src/contrib/gcc-8.0/gcc/
H A Dtree-phinodes.c94 gphi *phi; in allocate_phi_node() local
109 phi = as_a <gphi *> (free_phinodes[bucket]->pop ()); in allocate_phi_node()
117 phi = static_cast <gphi *> (ggc_internal_alloc (size)); in allocate_phi_node()
127 return phi; in allocate_phi_node()
169 gphi *phi; in make_phi_node() local
174 phi = allocate_phi_node (capacity); in make_phi_node()
179 memset (phi, 0, (sizeof (struct gphi) in make_phi_node()
182 phi->code = GIMPLE_PHI; in make_phi_node()
183 gimple_init_singleton (phi); in make_phi_node()
184 phi->nargs = len; in make_phi_node()
[all …]
H A Dtree-outof-ssa.c556 gphi *phi = gsi.phi (); in eliminate_build() local
559 p0 = var_to_partition (g->map, gimple_phi_result (phi)); in eliminate_build()
564 Ti = PHI_ARG_DEF (phi, g->e->dest_idx); in eliminate_build()
565 locus = gimple_phi_arg_location_from_edge (phi, g->e); in eliminate_build()
756 remove_gimple_phi_args (gphi *phi) in remove_gimple_phi_args() argument
764 print_gimple_stmt (dump_file, phi, 0, TDF_SLIM); in remove_gimple_phi_args()
767 FOR_EACH_PHI_ARG (arg_p, phi, iter, SSA_OP_USE) in remove_gimple_phi_args()
807 gphi *phi = gsi.phi (); in eliminate_useless_phis() local
808 result = gimple_phi_result (phi); in eliminate_useless_phis()
814 for (size_t i = 0; i < gimple_phi_num_args (phi); i++) in eliminate_useless_phis()
[all …]
H A Dtree-parloops.c237 reduction_phi (reduction_info_table_type *reduction_list, gimple *phi) in reduction_phi() argument
241 if (reduction_list->elements () == 0 || phi == NULL) in reduction_phi()
244 if (gimple_uid (phi) == (unsigned int)-1 in reduction_phi()
245 || gimple_uid (phi) == 0) in reduction_phi()
248 tmpred.reduc_phi = phi; in reduction_phi()
249 tmpred.reduc_version = gimple_uid (phi); in reduction_phi()
251 gcc_assert (red == NULL || red->reduc_phi == phi); in reduction_phi()
1693 gphi *phi = gsi.phi (); in transform_to_exit_first_loop_alt() local
1694 tree res_a = PHI_RESULT (phi); in transform_to_exit_first_loop_alt()
1697 tree res_c = copy_ssa_name (res_a, phi); in transform_to_exit_first_loop_alt()
[all …]
H A Dtree-ssa-uninit.c395 can_skip_redundant_opnd (tree opnd, gimple *phi) in can_skip_redundant_opnd() argument
401 phi_def = gimple_phi_result (phi); in can_skip_redundant_opnd()
422 compute_uninit_opnds_pos (gphi *phi) in compute_uninit_opnds_pos() argument
427 n = gimple_phi_num_args (phi); in compute_uninit_opnds_pos()
434 tree op = gimple_phi_arg_def (phi, i); in compute_uninit_opnds_pos()
437 && !can_skip_redundant_opnd (op, phi)) in compute_uninit_opnds_pos()
817 collect_phi_def_edges (gphi *phi, basic_block cd_root, in collect_phi_def_edges() argument
825 if (visited_phis->add (phi)) in collect_phi_def_edges()
828 n = gimple_phi_num_args (phi); in collect_phi_def_edges()
831 opnd_edge = gimple_phi_arg_edge (phi, i); in collect_phi_def_edges()
[all …]
H A Dtree-ssa-phiopt.c131 gphi *phi = NULL; in single_non_singleton_phi_for_edges() local
144 if (phi) in single_non_singleton_phi_for_edges()
147 phi = p; in single_non_singleton_phi_for_edges()
149 return phi; in single_non_singleton_phi_for_edges()
184 gphi *phi; in tree_ssa_phiopt_worker() local
291 phi = as_a <gphi *> (gsi_stmt (gsi)); in tree_ssa_phiopt_worker()
292 arg0 = gimple_phi_arg_def (phi, e1->dest_idx); in tree_ssa_phiopt_worker()
293 arg1 = gimple_phi_arg_def (phi, e2->dest_idx); in tree_ssa_phiopt_worker()
294 if (value_replacement (bb, bb1, e1, e2, phi, arg0, arg1) == 2) in tree_ssa_phiopt_worker()
305 phi = single_non_singleton_phi_for_edges (phis, e1, e2); in tree_ssa_phiopt_worker()
[all …]
H A Dgimple-streamer-out.c38 output_phi (struct output_block *ob, gphi *phi) in output_phi() argument
40 unsigned i, len = gimple_phi_num_args (phi); in output_phi()
43 streamer_write_uhwi (ob, SSA_NAME_VERSION (PHI_RESULT (phi))); in output_phi()
47 stream_write_tree (ob, gimple_phi_arg_def (phi, i), true); in output_phi()
48 streamer_write_uhwi (ob, gimple_phi_arg_edge (phi, i)->src->index); in output_phi()
50 stream_output_location (ob, &bp, gimple_phi_arg_location (phi, i)); in output_phi()
243 gphi *phi = psi.phi (); in output_bb() local
248 if (!virtual_operand_p (gimple_phi_result (phi))) in output_bb()
249 output_phi (ob, phi); in output_bb()
H A Dtree-ssa-phiprop.c133 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()
369 gimple_bb (phi)))) in propagate_with_phi()
[all …]
H A 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()
H A Dtree-ssa-loop-unswitch.c143 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()
719 gphi *phi = gsi.phi (); in empty_bb_without_guard_p() local
720 name = PHI_RESULT (phi); in empty_bb_without_guard_p()
775 gphi *phi = gsi.phi (); in get_vop_from_header() local
776 if (!virtual_operand_p (gimple_phi_result (phi))) in get_vop_from_header()
778 return PHI_ARG_DEF_FROM_EDGE (phi, loop_preheader_edge (loop)); in get_vop_from_header()
909 gphi *phi = gsi.phi (); in hoist_guard() local
911 if (virtual_operand_p (gimple_phi_result (phi))) in hoist_guard()
[all …]
H A Dtree-ssa-loop-manip.c66 gphi *phi; in create_iv() local
138 phi = create_phi_node (vb, loop->header); in create_iv()
139 add_phi_arg (phi, initial, loop_preheader_edge (loop), UNKNOWN_LOCATION); in create_iv()
140 add_phi_arg (phi, va, loop_latch_edge (loop), UNKNOWN_LOCATION); in create_iv()
271 gphi *phi; in add_exit_phi() local
291 phi = create_phi_node (NULL_TREE, exit); in add_exit_phi()
292 create_new_def_for (var, phi, gimple_phi_result_ptr (phi)); in add_exit_phi()
294 add_phi_arg (phi, var, e, UNKNOWN_LOCATION); in add_exit_phi()
299 print_gimple_stmt (dump_file, phi, 0, dump_flags); in add_exit_phi()
446 gphi *phi = bsi.phi (); in find_uses_to_rename_bb() local
[all …]
H A Dgimple-ssa-split-paths.c188 gimple *phi = gsi_stmt (gsi); in is_feasible_trace() local
189 if ((gimple_phi_arg_def (phi, 0) == lhs1 in is_feasible_trace()
190 && gimple_phi_arg_def (phi, 1) == lhs2) in is_feasible_trace()
191 || (gimple_phi_arg_def (phi, 1) == lhs1 in is_feasible_trace()
192 && gimple_phi_arg_def (phi, 0) == lhs2)) in is_feasible_trace()
212 gphi *phi = si.phi (); in is_feasible_trace() local
215 FOR_EACH_IMM_USE_FAST (use_p, iter, gimple_phi_result (phi)) in is_feasible_trace()
236 for (unsigned i = 0; i < gimple_phi_num_args (phi); ++i) in is_feasible_trace()
237 if (gimple_phi_arg_def (phi, i) == gimple_phi_result (stmt)) in is_feasible_trace()
H A Dgimple-ssa-strength-reduction.c803 slsr_process_phi (gphi *phi, bool speed) in slsr_process_phi() argument
808 struct 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()
1771 slsr_process_phi (gsi.phi (), speed); in before_dom_children()
2376 clear_visited (gphi *phi) in clear_visited() argument
2379 slsr_cand_t phi_cand = *stmt_cand_map->get (phi); in clear_visited()
[all …]
H A Dtree-ssa.c143 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()
638 gphi *phi = NULL; in verify_vssa() local
642 tree res = gimple_phi_result (si.phi ()); in verify_vssa()
[all …]
H A Dtree-ssa-copy.c328 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 …]
H A Dgimple-ssa-backprop.c464 backprop::process_phi_use (gphi *phi, usage_info *info) in process_phi_use() argument
466 tree result = gimple_phi_result (phi); in process_phi_use()
488 else if (gphi *phi = dyn_cast <gphi *> (stmt)) in process_use() local
489 process_phi_use (phi, info); in process_use()
511 gphi *phi = dyn_cast <gphi *> (stmt); in intersect_uses() local
512 if (phi in intersect_uses()
513 && !bitmap_bit_p (m_visited_blocks, gimple_bb (phi)->index) in intersect_uses()
515 SSA_NAME_VERSION (gimple_phi_result (phi)))) in intersect_uses()
523 print_gimple_stmt (dump_file, phi, 0, TDF_SLIM); in intersect_uses()
645 tree result = gimple_phi_result (gpi.phi ()); in process_block()
[all …]
/dflybsd-src/contrib/gcc-4.7/gcc/
H A Dtree-phinodes.c132 gimple phi; in allocate_phi_node() local
148 phi = VEC_pop (gimple, free_phinodes[bucket]); in allocate_phi_node()
157 phi = ggc_alloc_gimple_statement_d (size); in allocate_phi_node()
168 return phi; in allocate_phi_node()
210 gimple phi; in make_phi_node() local
215 phi = allocate_phi_node (capacity); in make_phi_node()
220 memset (phi, 0, (sizeof (struct gimple_statement_phi) in make_phi_node()
223 phi->gsbase.code = GIMPLE_PHI; in make_phi_node()
224 phi->gimple_phi.nargs = len; in make_phi_node()
225 phi->gimple_phi.capacity = capacity; in make_phi_node()
[all …]
H A Dtree-ssa-uninit.c118 can_skip_redundant_opnd (tree opnd, gimple phi) in can_skip_redundant_opnd() argument
124 phi_def = gimple_phi_result (phi); in can_skip_redundant_opnd()
145 compute_uninit_opnds_pos (gimple phi) in compute_uninit_opnds_pos() argument
150 n = gimple_phi_num_args (phi); in compute_uninit_opnds_pos()
157 tree op = gimple_phi_arg_def (phi, i); in compute_uninit_opnds_pos()
160 && !can_skip_redundant_opnd (op, phi)) in compute_uninit_opnds_pos()
478 collect_phi_def_edges (gimple phi, basic_block cd_root, in collect_phi_def_edges() argument
486 if (pointer_set_insert (visited_phis, phi)) in collect_phi_def_edges()
489 n = gimple_phi_num_args (phi); in collect_phi_def_edges()
492 opnd_edge = gimple_phi_arg_edge (phi, i); in collect_phi_def_edges()
[all …]
H A Dtree-outof-ssa.c512 gimple phi = gsi_stmt (gsi); in eliminate_build() local
515 p0 = var_to_partition (g->map, gimple_phi_result (phi)); in eliminate_build()
520 Ti = PHI_ARG_DEF (phi, g->e->dest_idx); in eliminate_build()
521 locus = gimple_phi_arg_location_from_edge (phi, g->e); in eliminate_build()
715 remove_gimple_phi_args (gimple phi) in remove_gimple_phi_args() argument
723 print_gimple_stmt (dump_file, phi, 0, TDF_SLIM); in remove_gimple_phi_args()
726 FOR_EACH_PHI_ARG (arg_p, phi, iter, SSA_OP_USE) in remove_gimple_phi_args()
766 gimple phi = gsi_stmt (gsi); in eliminate_useless_phis() local
767 result = gimple_phi_result (phi); in eliminate_useless_phis()
774 for (i = 0; i < gimple_phi_num_args (phi); i++) in eliminate_useless_phis()
[all …]
H A Dgimple-streamer-out.c35 output_phi (struct output_block *ob, gimple phi) in output_phi() argument
37 unsigned i, len = gimple_phi_num_args (phi); in output_phi()
40 streamer_write_uhwi (ob, SSA_NAME_VERSION (PHI_RESULT (phi))); in output_phi()
44 stream_write_tree (ob, gimple_phi_arg_def (phi, i), true); in output_phi()
45 streamer_write_uhwi (ob, gimple_phi_arg_edge (phi, i)->src->index); in output_phi()
46 lto_output_location (ob, gimple_phi_arg_location (phi, i)); in output_phi()
209 gimple phi = gsi_stmt (bsi); in output_bb() local
214 if (is_gimple_reg (gimple_phi_result (phi))) in output_bb()
215 output_phi (ob, phi); in output_bb()
H A Dgraphite-sese-to-poly.c43 phi_arg_in_outermost_loop (gimple phi) in phi_arg_in_outermost_loop() argument
45 loop_p loop = gimple_bb (phi)->loop_father; in phi_arg_in_outermost_loop()
48 for (i = 0; i < gimple_phi_num_args (phi); i++) in phi_arg_in_outermost_loop()
49 if (!flow_bb_inside_loop_p (loop, gimple_phi_arg_edge (phi, i)->src)) in phi_arg_in_outermost_loop()
51 loop = gimple_phi_arg_edge (phi, i)->src->loop_father; in phi_arg_in_outermost_loop()
64 gimple phi = gsi_stmt (*psi); in remove_simple_copy_phi() local
65 tree res = gimple_phi_result (phi); in remove_simple_copy_phi()
66 size_t entry = phi_arg_in_outermost_loop (phi); in remove_simple_copy_phi()
67 tree init = gimple_phi_arg_def (phi, entry); in remove_simple_copy_phi()
69 edge e = gimple_phi_arg_edge (phi, entry); in remove_simple_copy_phi()
[all …]
H A Dtree-ssa-dce.c449 gimple phi, stmt; in find_obviously_necessary_stmts() local
457 phi = gsi_stmt (gsi); in find_obviously_necessary_stmts()
458 gimple_set_plf (phi, STMT_NECESSARY, false); in find_obviously_necessary_stmts()
677 degenerate_phi_p (gimple phi) in degenerate_phi_p() argument
680 tree op = gimple_phi_arg_def (phi, 0); in degenerate_phi_p()
681 for (i = 1; i < gimple_phi_num_args (phi); i++) in degenerate_phi_p()
682 if (gimple_phi_arg_def (phi, i) != op) in degenerate_phi_p()
1031 mark_virtual_phi_result_for_renaming (gimple phi) in mark_virtual_phi_result_for_renaming() argument
1036 print_gimple_stmt (dump_file, phi, 0, TDF_SLIM); in mark_virtual_phi_result_for_renaming()
1040 mark_virtual_operand_for_renaming (gimple_phi_result (phi)); in mark_virtual_phi_result_for_renaming()
[all …]
H A Dtree-ssa-phiprop.c133 phiprop_insert_phi (basic_block bb, gimple phi, gimple use_stmt, in phiprop_insert_phi() argument
163 old_arg = PHI_ARG_DEF_FROM_EDGE (phi, e); in phiprop_insert_phi()
164 locus = gimple_phi_arg_location_from_edge (phi, e); in phiprop_insert_phi()
179 print_generic_expr (dump_file, PHI_ARG_DEF_FROM_EDGE (phi, e), 0); in phiprop_insert_phi()
194 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), 0); in phiprop_insert_phi()
245 propagate_with_phi (basic_block bb, gimple phi, struct phiprop_d *phivn, in propagate_with_phi() argument
248 tree ptr = PHI_RESULT (phi); in propagate_with_phi()
264 FOR_EACH_PHI_ARG (arg_p, phi, i, SSA_OP_USE) in propagate_with_phi()
350 res = phiprop_insert_phi (bb, phi, use_stmt, phivn, n); in propagate_with_phi()
H A Dtree-ssa-phiopt.c231 gimple cond_stmt, phi; in tree_ssa_phiopt_worker() local
321 phi = NULL; in tree_ssa_phiopt_worker()
326 if (phi) in tree_ssa_phiopt_worker()
328 phi = NULL; in tree_ssa_phiopt_worker()
331 phi = gsi_stmt (gsi); in tree_ssa_phiopt_worker()
333 if (!phi) in tree_ssa_phiopt_worker()
336 arg0 = gimple_phi_arg_def (phi, e1->dest_idx); in tree_ssa_phiopt_worker()
337 arg1 = gimple_phi_arg_def (phi, e2->dest_idx); in tree_ssa_phiopt_worker()
344 if (conditional_replacement (bb, bb1, e1, e2, phi, arg0, arg1)) in tree_ssa_phiopt_worker()
346 else if (value_replacement (bb, bb1, e1, e2, phi, arg0, arg1)) in tree_ssa_phiopt_worker()
[all …]
H A Dtree-vect-loop.c178 gimple phi; in vect_determine_vectorization_factor() local
198 phi = gsi_stmt (si); in vect_determine_vectorization_factor()
199 stmt_info = vinfo_for_stmt (phi); in vect_determine_vectorization_factor()
203 print_gimple_stmt (vect_dump, phi, 0, TDF_SLIM); in vect_determine_vectorization_factor()
211 scalar_type = TREE_TYPE (PHI_RESULT (phi)); in vect_determine_vectorization_factor()
547 gimple phi = gsi_stmt (gsi); in vect_analyze_scalar_cycles_1() local
549 tree def = PHI_RESULT (phi); in vect_analyze_scalar_cycles_1()
550 stmt_vec_info stmt_vinfo = vinfo_for_stmt (phi); in vect_analyze_scalar_cycles_1()
555 print_gimple_stmt (vect_dump, phi, 0, TDF_SLIM); in vect_analyze_scalar_cycles_1()
582 VEC_safe_push (gimple, heap, worklist, phi); in vect_analyze_scalar_cycles_1()
[all …]
/dflybsd-src/usr.bin/calendar/
H A Dmoon.c638 double phi = mod_f(lunar_longitude(t) - solar_longitude(t), 360); in lunar_phase() local
650 return (fabs(phi - phi2) > 180) ? phi2 : phi; in lunar_phase()
659 lunar_phase_atafter(double phi, double t) in lunar_phase_atafter() argument
663 double tau = t + rate * mod_f(phi - phase, 360); in lunar_phase_atafter()
669 return invert_angular(lunar_phase, phi, a, b); in lunar_phase_atafter()
680 double phi = lunar_phase(t); in new_moon_before() local
681 int n = (int)lround((t - t0) / mean_synodic_month - phi / 360.0); in new_moon_before()
701 double phi = lunar_phase(t); in new_moon_atafter() local
702 int n = (int)lround((t - t0) / mean_synodic_month - phi / 360.0); in new_moon_atafter()
827 double phi = lunar_phase(t_u); in show_moon_info() local
[all …]

12345678