Home
last modified time | relevance | path

Searched refs:phis (Results 1 – 25 of 119) sorted by relevance

12345

/netbsd-src/external/gpl3/gcc/dist/gcc/rtl-ssa/
H A Dblocks.cc273 if (auto phis = this->phis ()) in print_full() local
276 for (const phi_info *phi : phis) in print_full()
685 bb_phi_info &phis = bi.bb_phis[i]; in place_phis() local
687 bitmap_and (&phis.regs, &unfiltered[i], DF_LR_IN (cfg_bb)); in place_phis()
691 phis.num_phis = bitmap_count_bits (&phis.regs); in place_phis()
692 phis.num_preds = EDGE_COUNT (cfg_bb->preds); in place_phis()
693 unsigned int num_inputs = phis.num_phis * phis.num_preds; in place_phis()
696 phis.inputs = XOBNEWVEC (&m_temp_obstack, set_info *, num_inputs); in place_phis()
697 memset (phis.inputs, 0, num_inputs * sizeof (phis.inputs[0])); in place_phis()
776 bb_phi_info &phis = bi.bb_phis[cfg_bb->index]; in add_phi_nodes() local
[all …]
H A Dfunctions.cc240 auto *phis = XOBNEWVEC (&m_temp_obstack, phi_info *, m_next_phi_uid); in simplify_phis() local
254 for (phi_info *phi : ebb->phis ()) in simplify_phis()
257 phis[phi->uid ()] = phi; in simplify_phis()
271 simplify_phi_propagate (phis[uid], assumed_values, in simplify_phis()
288 if (bitmap_bit_p (valid_phi_uids, i) && phis[i] != assumed_values[i]) in simplify_phis()
289 replace_phi (phis[i], assumed_values[i]); in simplify_phis()
H A Dblocks.h232 iterator_range<phi_iterator> phis () const;
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dtree-into-ssa.cc748 prune_unused_phi_nodes (bitmap phis, bitmap kills, bitmap uses) in prune_unused_phi_nodes() argument
762 bitmap_clear (phis); in prune_unused_phi_nodes()
770 bitmap_and_compl_into (phis, to_remove); in prune_unused_phi_nodes()
771 if (bitmap_empty_p (phis)) in prune_unused_phi_nodes()
795 bitmap_ior (to_remove, kills, phis); in prune_unused_phi_nodes()
873 if (bitmap_bit_p (phis, b)) in prune_unused_phi_nodes()
881 if (!bitmap_bit_p (phis, p)) in prune_unused_phi_nodes()
909 bitmap_copy (phis, live_phis); in prune_unused_phi_nodes()
933 vec<gphi *> phis; in mark_phi_for_rewrite() local
950 phis = phis_to_rewrite[idx]; in mark_phi_for_rewrite()
[all …]
H A Dtree-ssa-uncprop.cc342 gimple_seq phis = phi_nodes (e->dest); in uncprop_into_successor_phis() local
347 if (gimple_seq_empty_p (phis)) in uncprop_into_successor_phis()
358 for (gsi = gsi_start (phis) ; !gsi_end_p (gsi); gsi_next (&gsi)) in uncprop_into_successor_phis()
H A Dtree-ssa-tail-merge.cc1422 gimple_seq phis = phi_nodes (bb); in bb_has_non_vop_phi() local
1425 if (phis == NULL) in bb_has_non_vop_phi()
1428 if (!gimple_seq_singleton_p (phis)) in bb_has_non_vop_phi()
1431 phi = gimple_seq_first_stmt (phis); in bb_has_non_vop_phi()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dtree-into-ssa.c747 prune_unused_phi_nodes (bitmap phis, bitmap kills, bitmap uses) in prune_unused_phi_nodes() argument
761 bitmap_clear (phis); in prune_unused_phi_nodes()
769 bitmap_and_compl_into (phis, to_remove); in prune_unused_phi_nodes()
770 if (bitmap_empty_p (phis)) in prune_unused_phi_nodes()
794 bitmap_ior (to_remove, kills, phis); in prune_unused_phi_nodes()
872 if (bitmap_bit_p (phis, b)) in prune_unused_phi_nodes()
880 if (!bitmap_bit_p (phis, p)) in prune_unused_phi_nodes()
908 bitmap_copy (phis, live_phis); in prune_unused_phi_nodes()
932 vec<gphi *> phis; in mark_phi_for_rewrite() local
949 phis = phis_to_rewrite[idx]; in mark_phi_for_rewrite()
[all …]
H A Dtree-ssa-uncprop.c342 gimple_seq phis = phi_nodes (e->dest); in uncprop_into_successor_phis() local
347 if (gimple_seq_empty_p (phis)) in uncprop_into_successor_phis()
358 for (gsi = gsi_start (phis) ; !gsi_end_p (gsi); gsi_next (&gsi)) in uncprop_into_successor_phis()
H A Dtree-ssa-tail-merge.c1410 gimple_seq phis = phi_nodes (bb); in bb_has_non_vop_phi() local
1413 if (phis == NULL) in bb_has_non_vop_phi()
1416 if (!gimple_seq_singleton_p (phis)) in bb_has_non_vop_phi()
1419 phi = gimple_seq_first_stmt (phis); in bb_has_non_vop_phi()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DDivergenceAnalysis.cpp195 for (const auto &Phi : DivExit.phis()) { in analyzeLoopExitDivergence()
224 for (auto &Phi : UserBlock->phis()) { in analyzeLoopExitDivergence()
278 for (const auto &Phi : JoinBlock.phis()) { in taintAndPushPhiNodes()
H A DPhiValues.cpp167 for (const PHINode &PN : BB.phis()) { in print()
200 for (const PHINode &PN : BB.phis()) in run()
H A DLoopNestAnalysis.cpp259 return any_of(ExitBlock.phis(), [](const PHINode &PN) { in checkLoopsStructure()
270 all_of(BB.phis(), [&](const PHINode &PN) { in checkLoopsStructure()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/IR/
H A DBasicBlock.h354 iterator_range<const_phi_iterator> phis() const { in phis() function
355 return const_cast<BasicBlock *>(this)->phis(); in phis()
357 iterator_range<phi_iterator> phis();
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
H A DLoopInterchange.cpp757 for (PHINode &PHI : L->getHeader()->phis()) { in findInductionAndReductions()
973 for (PHINode &PHI : InnerExit->phis()) { in areInnerLoopExitPHIsSupported()
997 for (PHINode &PHI : LoopNestExit->phis()) { in areOuterLoopExitPHIsSupported()
1470 for (PHINode &P : make_early_inc_range(InnerExit->phis())) { in moveLCSSAPhis()
1495 for (PHINode &P : InnerExit->phis()) in moveLCSSAPhis()
1499 for (PHINode &P : InnerLatch->phis()) in moveLCSSAPhis()
1520 for (PHINode &P : OuterExit->phis()) { in moveLCSSAPhis()
1666 for (PHINode &PHI : drop_begin(InnerLoopHeader->phis())) in adjustLoopBranches()
1668 for (PHINode &PHI : drop_begin(OuterLoopHeader->phis())) in adjustLoopBranches()
H A DLoopDeletion.cpp66 for (PHINode &P : ExitBlock->phis()) { in isLoopDead()
198 for (PHINode &P : ExitBlock->phis()) { in deleteLoopIfDead()
H A DLoopFlatten.cpp128 for (PHINode &PHI : L->getHeader()->phis()) { in findLoopComponents()
217 for (PHINode &InnerPHI : FI.InnerLoop->getHeader()->phis()) { in checkPHIs()
266 for (PHINode &OuterPHI : FI.OuterLoop->getHeader()->phis()) { in checkPHIs()
H A DReg2Mem.cpp86 for (auto &Phi : BB.phis()) in runPass()
H A DCallSiteSplitting.cpp339 for (PHINode &PN : TailBB->phis()) { in splitCallSite()
422 for (auto &PN : Parent->phis()) { in isPredicatedOnPHI()
/netbsd-src/external/apache2/llvm/dist/llvm/examples/IRTransforms/
H A DSimplifyCFG.cpp284 for (PHINode &PN : make_early_inc_range(BB.phis())) { in mergeIntoSinglePredecessor_v1()
335 for (PHINode &PN : make_early_inc_range(BB.phis())) { in mergeIntoSinglePredecessor_v2()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
H A DCallPromotionUtils.cpp52 for (PHINode &Phi : Invoke->getNormalDest()->phis()) { in fixupPHINodeForNormalDest()
84 for (PHINode &Phi : Invoke->getUnwindDest()->phis()) { in fixupPHINodeForUnwindDest()
H A DLoopUnroll.cpp195 for (const PHINode &PN : Header->phis()) { in isEpilogProfitable()
638 for (PHINode &PHI : Succ->phis()) { in UnrollLoop()
736 for (PHINode &Phi : Succ->phis()) in UnrollLoop()
H A DLoopUnrollRuntime.cpp97 for (PHINode &PN : Succ->phis()) { in ConnectProlog()
210 for (PHINode &PN : NewExit->phis()) { in ConnectEpilog()
257 for (PHINode &PN : Succ->phis()) { in ConnectEpilog()
H A DLoopUnrollAndJam.cpp146 for (auto &Phi : Header->phis()) { in processHeaderPhiOperands()
447 for (PHINode &Phi : ForeBlocksFirst[It]->phis()) { in UnrollAndJamLoop()
470 for (PHINode &Phi : BB->phis()) { in UnrollAndJamLoop()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/ObjCARC/
H A DObjCARC.h77 for (auto &P : BB->phis()) { in getEquivalentPHIs()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/IR/
H A DBasicBlock.cpp316 iterator_range<BasicBlock::phi_iterator> BasicBlock::phis() { in phis() function in BasicBlock
332 for (PHINode &Phi : make_early_inc_range(phis())) { in removePredecessor()

12345