Searched refs:phis (Results 1 - 10 of 10) sorted by relevance

/haiku-buildtools/gcc/gcc/testsuite/g++.dg/torture/
H A Dpr41775.C267 std::vector < MachineInstr * >phis; local
268 for (std::vector < MachineInstr * >::iterator I = phis.begin (), E =
269 phis.end (); I != E;)
/haiku-buildtools/gcc/gcc/
H A Dtree-ssa-uncprop.c403 gimple_seq phis = phi_nodes (e->dest); local
408 if (gimple_seq_empty_p (phis))
419 for (gsi = gsi_start (phis) ; !gsi_end_p (gsi); gsi_next (&gsi))
H A Dtree-into-ssa.c797 prune_unused_phi_nodes (bitmap phis, bitmap kills, bitmap uses) argument
811 bitmap_clear (phis);
819 bitmap_and_compl_into (phis, to_remove);
820 if (bitmap_empty_p (phis))
844 bitmap_ior (to_remove, kills, phis);
922 if (bitmap_bit_p (phis, b))
930 if (!bitmap_bit_p (phis, p))
958 bitmap_copy (phis, live_phis);
982 vec<gphi *> phis; local
999 phis
2037 vec<gphi *> phis; local
2862 vec<gphi *> phis = phis_to_rewrite[i]; local
[all...]
H A Dtree-vect-loop.c1446 /* FORNOW: we currently don't support the case that these phis
1685 Cross-iteration cycles caused by virtual phis are analyzed separately. */
3982 auto_vec<gimple> phis; variable
4038 (in case of SLP, do it for all the phis). */
4133 /* 2.1 Create new loop-exit-phis to preserve loop-closed form:
4161 vectorized. Create exit phis for the outer loop. */
4543 /* 2.6 Handle the loop-exit phis. Replace the uses of scalar loop-exit
4544 phis with new adjusted scalar results, i.e., replace use <s_out0>
4614 phis.create (3);
4621 phis
4876 auto_vec<gimple> phis; local
[all...]
H A Dtree-ssa-tail-merge.c149 Ideally, a block comparison operator will also indicate which phis are needed
175 - no insertion of gimple_reg phis, We only introduce vop-phis.
1302 /* Returns whether for all phis in DEST the phi alternatives for E1 and
1352 /* For all phis in bb, the phi alternatives for e1 and e2 need to have
1361 /* Return true if BB has non-vop phis. */
1366 gimple_seq phis = phi_nodes (bb); local
1369 if (phis == NULL)
1372 if (!gimple_seq_singleton_p (phis))
1375 phi = gimple_seq_first_stmt (phis);
[all...]
H A Dtree-ssa-sccvn.c289 vn_phi_table_type *phis; member in struct:vn_tables_s
2743 slot = current_info->phis->find_slot_with_hash (&vp1, vp1.hashcode,
2746 slot = valid_info->phis->find_slot_with_hash (&vp1, vp1.hashcode,
2778 slot = current_info->phis->find_slot_with_hash (vp1, vp1->hashcode, INSERT);
3881 slot = info->phis->find_slot_with_hash (phi, phi->hashcode, INSERT);
3954 optimistic_info->phis->empty ();
3974 FOR_EACH_HASH_TABLE_ELEMENT (*optimistic_info->phis, phi, vn_phi_t, hip)
4131 table->phis = new vn_phi_table_type (23);
4136 table->phis_pool = create_alloc_pool ("VN phis",
4149 delete table->phis;
[all...]
H A Dtree-ssa-phiopt.c326 gimple_seq phis = phi_nodes (bb2); local
332 for (gsi = gsi_start (phis); !gsi_end_p (gsi); gsi_next (&gsi))
348 phi = single_non_singleton_phi_for_edges (phis, e1, e2);
1912 /* Walk the phis in bb3 looking for an opportunity. We are looking
1913 for phis of two SSA names, one each of which is defined in bb1 and
H A Dtree-ssa-pre.c138 expressions, because the flow goes backwards through phis. We must
501 int phis; member in struct:__anon226
1474 /* Translate EXPR using phis in PHIBLOCK, so that it has the values of
1475 the phis in PRED. Return NULL if we can't find a leader for each part
2160 phis to translate through. */
3225 pre_stats.phis++;
3707 /* We have no need for virtual phis, as they don't represent
4059 pre_stats.phis--;
4861 loop_optimizer_init may create new phis, etc. */
4902 statistics_counter_event (fun, "New PHIs", pre_stats.phis);
[all...]
H A Dtree-cfg.c1749 any phis. Symbols marked for renaming are never a problem though. */
2663 gphi_iterator phis; local
2669 for (i = 0, phis = gsi_start_phis (new_edge->dest);
2670 v->iterate (i, &vm) && !gsi_end_p (phis);
2671 i++, gsi_next (&phis))
2673 gphi *phi = phis.phi ();
H A Domp-low.c6426 gimple_seq phis;
6431 phis = phi_nodes (l3_bb);
6432 for (gsi = gsi_start (phis); !gsi_end_p (gsi); gsi_next (&gsi))
6425 gimple_seq phis; local

Completed in 314 milliseconds