| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| CallSiteSplitting.cpp | 181 SmallVector<BasicBlock *, 2> Preds(predecessors((BB)));
182 assert(Preds.size() == 2 && "Expected exactly 2 predecessors!");
183 return Preds;
197 SmallVector<BasicBlock *, 2> Preds(predecessors(CallSiteBB));
198 if (Preds.size() != 2 || isa<IndirectBrInst>(Preds[0]->getTerminator()) ||
199 isa<IndirectBrInst>(Preds[1]->getTerminator()))
268 /// be split. In this case, Preds for Tail is [(Header, a == null),
306 const SmallVectorImpl<std::pair<BasicBlock *, ConditionsTy>> &Preds,
317 CallPN = PHINode::Create(CB.getType(), Preds.size(), "phi.call")
[all...] |
| GVNSink.cpp | 765 SmallVector<BasicBlock *, 4> Preds;
769 Preds.push_back(B);
773 if (Preds.size() < 2)
775 llvm::sort(Preds);
777 unsigned NumOrigPreds = Preds.size();
779 for (auto I = Preds.begin(); I != Preds.end();) {
781 I = Preds.erase(I);
786 LockstepReverseIterator LRI(Preds);
799 Cand->calculateCost(NumOrigPHIs, Preds.size())
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
| PPCCTRLoops.cpp | 102 SmallVector<MachineBasicBlock *, 8> Preds;
138 if (!CheckPreds && Preds.empty())
151 append_range(Preds, MBB->predecessors());
155 MBB = Preds.pop_back_val();
160 } while (!Preds.empty());
|
| PPCHazardRecognizers.cpp | 38 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) {
39 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit());
43 if (!SU->Preds[i].isNormalMemory() && !SU->Preds[i].isBarrier())
47 if (SU->Preds[i].getSUnit() == CurGroup[j])
64 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) {
65 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit());
69 if (SU->Preds[i].isCtrl())
73 if (SU->Preds[i].getSUnit() == CurGroup[j])
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 63 BBInfo **Preds = nullptr;
126 SmallVector<BlkT *, 10> Preds;
129 Preds.clear();
130 Traits::FindPredecessorBlocks(Info->BB, &Preds);
131 Info->NumPreds = Preds.size();
133 Info->Preds = nullptr;
135 Info->Preds = static_cast<BBInfo **>(Allocator.Allocate(
139 BlkT *Pred = Preds[p];
144 Info->Preds[p] = BBMapBucket.second;
152 Info->Preds[p] = PredInfo
[all...] |
| LoopVersioning.h | 126 const SCEVUnionPredicate &Preds;
|
| BasicBlockUtils.h | 183 /// exit block. This function inserts the new PHIs, as needed. Preds is a list
184 /// of preds inside the loop, SplitBB is the new loop exit block, and DestBB is
186 void createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds,
326 /// The new predecessors are indicated by the Preds array. The new block is
328 /// from Preds are now pointing.
340 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock *> Preds,
348 /// The new predecessors are indicated by the Preds array. The new block is
350 /// from Preds are now pointing.
360 BasicBlock *SplitBlockPredecessors(BasicBlock *BB, ArrayRef<BasicBlock *> Preds,
369 /// predecessors listed in Preds. The other basic block gets the remainin
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| ScheduleDAG.cpp | 109 for (SDep &PredDep : Preds) {
166 Preds.push_back(D);
177 SmallVectorImpl<SDep>::iterator I = llvm::find(Preds, D);
178 if (I == Preds.end())
185 assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!");
187 Preds.erase(I);
239 for (SDep &PredDep : SU->Preds) {
272 for (const SDep &PredDep : Cur->Preds) {
329 SUnit::pred_iterator BestI = Preds.begin();
331 for (SUnit::pred_iterator I = std::next(BestI), E = Preds.end(); I != E
[all...] |
| MacroFusion.cpp | 40 for (const SDep &SI : SU.Preds)
62 for (SDep &SI : SecondSU.Preds)
87 for (SDep &SI : SecondSU.Preds)
113 for (const SDep &SI : SecondSU.Preds) {
178 for (SDep &Dep : AnchorSU.Preds) {
|
| TailDuplicator.cpp | 105 SmallSetVector<MachineBasicBlock *, 8> Preds(MBB->pred_begin(),
111 for (MachineBasicBlock *PredBB : Preds) {
131 if (CheckExtra && !Preds.count(PHIBB)) {
156 /// all Preds that received a copy of \p MBB.
723 SmallVector<MachineBasicBlock *, 8> Preds(TailBB->predecessors());
725 for (MachineBasicBlock *PredBB : Preds) {
841 SmallSetVector<MachineBasicBlock *, 8> Preds;
843 Preds.insert(CandidatePtr->begin(), CandidatePtr->end());
845 Preds.insert(TailBB->pred_begin(), TailBB->pred_end());
847 for (MachineBasicBlock *PredBB : Preds) {
[all...] |
| LatencyPriorityQueue.cpp | 58 for (const SDep &P : SU->Preds) {
103 if (SU->isAvailable) return; // All preds scheduled.
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/GlobalISel/ |
| MIPatternMatch.h | 130 template <typename... Preds> struct And {
137 template <typename Pred, typename... Preds>
138 struct And<Pred, Preds...> : And<Preds...> {
140 And(Pred &&p, Preds &&... preds)
141 : And<Preds...>(std::forward<Preds>(preds)...), P(std::forward<Pred>(p)) {
145 return P.match(MRI, src) && And<Preds...>::match(MRI, src)
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| TypeMetadataUtils.h | 56 SmallVectorImpl<Instruction *> &Preds, bool &HasNonCallUses,
|
| /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 128 /// Preds - The predecessors of this node.
129 NodeGroup Preds;
200 unsigned pred_size() const { return Preds.size(); }
202 bool pred_empty() const { return Preds.empty(); }
239 pred_iterator pred_begin() { return Preds.begin(); }
240 pred_iterator pred_end() { return Preds.end(); }
241 pred_range preds() { return {Preds.begin(), Preds.end()}; } function in class:clang::ento::ExplodedNode
249 const_pred_range preds() const { return {Preds.begin(), Preds.end()}; function in class:clang::ento::ExplodedNode
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 714 void llvm::createPHIsForSplitLoopExit(ArrayRef<BasicBlock *> Preds,
735 PN.getType(), Preds.size(), "split",
737 for (BasicBlock *BB : Preds)
876 ArrayRef<BasicBlock *> Preds,
892 SmallPtrSet<BasicBlock *, 8> UniquePreds(Preds.begin(), Preds.end());
913 MSSAU->wireOldPredecessorsToNewImmediatePredecessor(OldBB, NewBB, Preds);
928 for (BasicBlock *Pred : Preds) {
929 // Preds that are not reachable from entry should not be used to identify if
935 // If we need to preserve LCSSA, determine if any of the preds is a loo
[all...] |
| FlattenCFG.cpp | 147 SmallPtrSet<BasicBlock *, 16> Preds(pred_begin(BB), pred_end(BB));
148 for (SmallPtrSetIterator<BasicBlock *> PI = Preds.begin(), PE = Preds.end();
165 if (UnCondBlock || !PP || (Preds.count(PP) == 0) ||
181 if (PP && Preds.count(PP)) {
218 if (Preds.count(PS) == 0) {
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| AMDGPUExportClustering.cpp | 69 for (const SDep &Pred : SUb->Preds) {
85 for (const SDep &Pred : SU.Preds) {
94 for (const SDep &ExportPred : PredSU->Preds) {
|
| GCNILPSched.cpp | 64 for (const SDep &Pred : SU->Preds) {
65 if (Pred.isCtrl()) continue; // ignore chain preds
123 for (const SDep &Pred : SU->Preds) {
124 if (Pred.isCtrl()) continue; // ignore chain preds
276 for (const auto &PredEdge : SU->Preds) {
|
| GCNMinRegStrategy.cpp | 90 for (auto PDep : SDep.getSUnit()->Preds) {
183 for (const auto &P : S.getSUnit()->Preds) {
195 for (const auto &P : SU->Preds) {
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 207 Preds.addNode(V, G);
471 if (N->Preds.empty()) {
477 WL1.append(N->Preds.begin(), N->Preds.end());
505 if (N->Preds.empty())
513 for (ExplodedNode::pred_iterator I = N->Preds.begin(), E = N->Preds.end();
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/ |
| ARMInstructionSelector.cpp | 393 std::pair<ARMCC::CondCodes, ARMCC::CondCodes> Preds = {ARMCC::AL, ARMCC::AL};
396 Preds = {ARMCC::GT, ARMCC::MI};
399 Preds = {ARMCC::EQ, ARMCC::VS};
403 Preds.first = ARMCC::EQ;
407 Preds.first = ARMCC::GT;
411 Preds.first = ARMCC::GE;
415 Preds.first = ARMCC::HI;
418 Preds.first = ARMCC::MI;
422 Preds.first = ARMCC::LS;
425 Preds.first = ARMCC::VC
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| TypeMetadataUtils.cpp | 98 SmallVectorImpl<Instruction *> &Preds, bool &HasNonCallUses,
117 Preds.push_back(EVI);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| HexagonSubtarget.cpp | 68 static cl::opt<bool> SchedPredsCloser("sched-preds-closer",
203 for (auto &D : SU.Preds)
232 for (SDep &PI : SI.getSUnit()->Preds) {
530 auto F = find(Dst->Preds, T);
531 assert(F != Dst->Preds.end());
547 auto F = find(Dst->Preds, T);
548 assert(F != Dst->Preds.end());
592 SUnit *SrcBest = getZeroLatency(Dst, Dst->Preds);
634 for (auto &I : DstBest->Preds)
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 256 SmallVector<SDep, 4> Preds; ///< All sunit predecessors.
266 unsigned NumPreds = 0; ///< # of SDep::Data preds.
268 unsigned NumPredsLeft = 0; ///< # of preds not scheduled.
270 unsigned WeakPredsLeft = 0; ///< # of weak preds not scheduled.
432 for (const SDep &Pred : Preds)
636 return Node->Preds[Operand].getSUnit();
650 return SUnitIterator(N, (unsigned)N->Preds.size());
664 return Node->Preds[Operand];
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
| ResourcePriorityQueue.cpp | 73 for (SDep &Pred : SU->Preds) {
157 for (SDep &Pred : SU->Preds)
216 for (const SDep &Pred : SU->Preds) {
502 for (SDep &Pred : SU->Preds) {
535 HorizontalVerticalBalance -= (SU->Preds.size() - numberCtrlPredInSU(SU));
572 if (SU->isAvailable) return; // All preds scheduled.
|
