| /external/llvm/lib/CodeGen/ |
| MachineBlockPlacement.cpp | 351 for (MachineBasicBlock *Succ : MBB->successors()) {
352 if (BlockFilter && !BlockFilter->count(Succ))
354 BlockChain &SuccChain = *BlockToChain[Succ];
356 if (&Chain == &SuccChain || Succ == LoopHeaderBB)
403 for (MachineBasicBlock *Succ : BB->successors()) {
405 if (BlockFilter && !BlockFilter->count(Succ)) {
408 BlockChain *SuccChain = BlockToChain[Succ];
410 DEBUG(dbgs() << " " << getBlockName(Succ)
413 } else if (Succ != *SuccChain->begin()) {
414 DEBUG(dbgs() << " " << getBlockName(Succ) << " -> Mid chain!\n")
[all...] |
| MachineDominators.cpp | 80 MachineBasicBlock *Succ = Edge.ToBB;
81 MachineDomTreeNode *SuccDTNode = DT->getNode(Succ);
83 for (MachineBasicBlock *PredBB : Succ->predecessors()) {
95 // Succ
118 // If all the other predecessors of "Succ" are dominated by "Succ" itself
119 // then the new block is the new immediate dominator of "Succ". Otherwise,
|
| MachineBasicBlock.cpp | 524 void MachineBasicBlock::addSuccessor(MachineBasicBlock *Succ,
530 Successors.push_back(Succ);
531 Succ->addPredecessor(this);
534 void MachineBasicBlock::addSuccessorWithoutProb(MachineBasicBlock *Succ) {
539 Successors.push_back(Succ);
540 Succ->addPredecessor(this);
543 void MachineBasicBlock::removeSuccessor(MachineBasicBlock *Succ,
545 succ_iterator I = std::find(Successors.begin(), Successors.end(), Succ);
621 MachineBasicBlock *Succ = *FromMBB->succ_begin();
626 addSuccessor(Succ, Prob)
[all...] |
| MachineTraceMetrics.cpp | 207 if (!TBI->Succ) {
216 unsigned SuccNum = TBI->Succ->getNumber();
345 for (const MachineBasicBlock *Succ : MBB->successors()) {
347 if (CurLoop && Succ == CurLoop->getHeader())
350 if (isExitingLoop(CurLoop, getLoopFor(Succ)))
353 getHeightResources(Succ);
360 Best = Succ, BestHeight = Height;
481 DEBUG(dbgs() << " succ for BB#" << I->getNumber() << ": ");
484 TBI.Succ = pickTraceSucc(I);
486 if (TBI.Succ)
[all...] |
| LivePhysRegs.cpp | 163 for (const MachineBasicBlock *Succ : MBB->successors())
164 ::addLiveIns(*this, *Succ);
|
| /external/clang/test/SemaTemplate/ |
| alias-church-numerals.cpp | 10 template<template<template<typename> class, typename> class N, template<typename> class F, typename X> using Succ = F<N<F,X>>;
12 template<template<typename> class F, typename X> using One = Succ<Zero, F, X>;
13 template<template<typename> class F, typename X> using Two = Succ<One, F, X>;
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| CoreEngine.cpp | 185 const CFGBlock *Succ = *(Entry->succ_begin());
189 BlockEdge StartLoc(Entry, Succ, L);
382 if (const CFGBlock *succ = *it) {
383 generateNode(BlockEdge(B, succ, Pred->getLocationContext()),
569 ExplodedNode *Succ = G.getNode(Loc, N->getState(), false, &IsNew);
570 Succ->addPredecessor(N, G);
573 WList->enqueue(Succ, Block, Idx+1);
664 ExplodedNode *Succ = generateNodeImpl(Loc, State, NodePred);
665 return Succ;
673 ExplodedNode *Succ
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| CFG.h | 43 unsigned GetSuccessorNumber(const BasicBlock *BB, const BasicBlock *Succ);
|
| /external/llvm/lib/Analysis/ |
| IteratedDominanceFrontier.cpp | 65 for (auto Succ : successors(BB)) {
66 DomTreeNode *SuccNode = DT.getNode(Succ);
|
| EHPersonalities.cpp | 102 for (BasicBlock *Succ : successors(Visiting))
103 Worklist.push_back({Succ, SuccColor});
|
| DivergenceAnalysis.cpp | 207 for (BasicBlock *Succ : successors(ThisBB)) {
208 if (Succ != End && InfluenceRegion.insert(Succ).second)
209 InfluenceStack.push_back(Succ);
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| TestAfterDivZeroChecker.cpp | 73 PathDiagnosticPiece *VisitNode(const ExplodedNode *Succ,
97 PathDiagnosticPiece *DivisionBRVisitor::VisitNode(const ExplodedNode *Succ,
106 if (Optional<PostStmt> P = Succ->getLocationAs<PostStmt>())
118 ProgramStateRef State = Succ->getState();
119 SVal S = State->getSVal(E, Succ->getLocationContext());
120 if (ZeroSymbol == S.getAsSymbol() && SFC == Succ->getStackFrame()) {
124 ProgramPoint P = Succ->getLocation();
|
| /external/clang/lib/Analysis/ |
| CFG.cpp | 374 CFGBlock *Succ;
416 Block(nullptr), Succ(nullptr),
521 : IsConditional(false), KnownExecuted(true), Succ(nullptr),
525 : IsConditional(true), KnownExecuted(KnownExecuted), Succ(nullptr),
541 Succ = S;
547 CFGBlock *Succ;
[all...] |
| ThreadSafetyTIL.cpp | 239 for (auto *Succ : successors()) {
241 if (Succ->BlockID <= BlockID) continue;
244 Candidate = Succ;
248 auto *Alternate = Succ;
|
| /external/llvm/lib/Transforms/Utils/ |
| Local.cpp | 192 for (BasicBlock *Succ : SI->successors()) {
194 if (Succ == TheOnlyDest)
197 Succ->removePredecessor(BB);
606 /// almost-empty BB ending in an unconditional branch to Succ, into Succ.
608 /// Assumption: Succ is the single successor for BB.
610 static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) {
611 assert(*succ_begin(BB) == Succ && "Succ is not successor of BB!");
614 << Succ->getName() << "\n")
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopUnrollPass.cpp | 639 BasicBlock *Succ = nullptr;
642 Succ = BI->getSuccessor(0);
644 Succ = BI->getSuccessor(
646 if (L->contains(Succ))
647 BBWorklist.insert(Succ);
654 BasicBlock *Succ = nullptr;
657 Succ = SI->getSuccessor(0);
659 Succ = SI->findCaseValue(cast<ConstantInt>(SimpleCond))
661 if (L->contains(Succ))
662 BBWorklist.insert(Succ);
[all...] |
| PlaceSafepoints.cpp | 298 for (BasicBlock *Succ : successors(BB)) {
299 if (seen.count(Succ) == 0) {
300 worklist.push_back(Succ);
301 seen.insert(Succ);
621 BasicBlock *Succ = Term->getSuccessor(i);
622 if (DT.dominates(Succ, Term->getParent())) {
623 Headers.insert(Succ);
[all...] |
| LoopUnswitch.cpp | [all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineTraceMetrics.h | 140 const MachineBasicBlock *Succ;
157 Pred(nullptr), Succ(nullptr),
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 145 inline bool SplitCriticalEdge(BasicBlock *Succ, pred_iterator PI,
151 if (TI->getSuccessor(i) == Succ)
|
| /external/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 92 typename GraphT::NodeType* Succ = *NextSucc;
95 DT.Info[Succ];
98 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ)));
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| DependencyAnalysis.cpp | 271 const BasicBlock *Succ = *SI;
272 if (Succ != StartBB && !Visited.count(Succ)) {
|
| /external/llvm/lib/IR/ |
| BasicBlock.cpp | 407 for (BasicBlock *Succ : TI->successors()) {
408 // N.B. Succ might not be a complete BasicBlock, so don't assume
410 for (iterator II = Succ->begin(), IE = Succ->end(); II != IE; ++II) {
|
| /external/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyCommon.h | 114 void handleSuccessor(const CFGBlock *Succ) {}
117 void handleSuccessorBackEdge(const CFGBlock *Succ) {}
452 void handleSuccessor(const CFGBlock *Succ);
453 void handleSuccessorBackEdge(const CFGBlock *Succ);
|
| /external/clang/include/clang/StaticAnalyzer/Core/BugReporter/ |
| BugReporterVisitor.h | 61 virtual PathDiagnosticPiece *VisitNode(const ExplodedNode *Succ,
327 PathDiagnosticPiece *VisitNode(const ExplodedNode *Succ,
|
