| /external/llvm/lib/Analysis/ |
| CFG.cpp | 73 const BasicBlock *Succ) {
80 if (Term->getSuccessor(i) == Succ)
|
| BlockFrequencyInfoImpl.cpp | 263 const BlockNode &Succ,
272 BlockNode Resolved = Working[Succ.Index].getResolvedNode();
279 dbgs() << ", succ = " << getBlockName(Succ);
280 if (Resolved != Succ)
582 void IrreducibleGraph::addEdge(IrrNode &Irr, const BlockNode &Succ,
584 if (OuterLoop && OuterLoop->isHeader(Succ))
586 auto L = Lookup.find(Succ.Index);
|
| BranchProbabilityInfo.cpp | 562 BasicBlock *Succ = *I;
563 uint32_t Weight = getEdgeWeight(BB, Succ);
571 MaxSucc = Succ;
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineBasicBlock.h | 436 /// Add Succ as a successor of this MachineBasicBlock. The Predecessors list
437 /// of Succ is automatically updated. PROB parameter is stored in
444 void addSuccessor(MachineBasicBlock *Succ,
447 /// Add Succ as a successor of this MachineBasicBlock. The Predecessors list
448 /// of Succ is automatically updated. The probability is not provided because
451 void addSuccessorWithoutProb(MachineBasicBlock *Succ);
470 /// Predecessors list of Succ is automatically updated.
473 void removeSuccessor(MachineBasicBlock *Succ,
477 /// MachineBasicBlock. The Predecessors list of Succ is automatically updated.
566 MachineBasicBlock *SplitCriticalEdge(MachineBasicBlock *Succ, Pass *P)
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 44 for (BasicBlock *Succ : BBTerm->successors())
45 Succ->removePredecessor(BB);
238 BasicBlock *llvm::SplitEdge(BasicBlock *BB, BasicBlock *Succ, DominatorTree *DT,
240 unsigned SuccNum = GetSuccessorNumber(BB, Succ);
248 // If the edge isn't critical, then BB has a single successor or Succ has a
250 if (BasicBlock *SP = Succ->getSinglePredecessor()) {
255 return SplitBlock(Succ, &Succ->front(), DT, LI);
261 "Should have a single succ!");
[all...] |
| SimplifyCFG.cpp | 222 /// Update PHI nodes in Succ to indicate that there will now be entries in it
225 /// of Succ.
226 static void AddPredecessorToBlock(BasicBlock *Succ, BasicBlock *NewPred,
228 if (!isa<PHINode>(Succ->begin())) return; // Quick exit if nothing to do
231 for (BasicBlock::iterator I = Succ->begin();
591 BasicBlock *Succ = BI->getSuccessor(ICI->getPredicate() == ICmpInst::ICMP_NE);
594 Succ));
746 assert(TIV && "No edge from pred to succ?");
[all...] |
| LowerSwitch.cpp | 338 BasicBlock* Succ = Leaf.BB;
339 BranchInst::Create(Succ, Default, Comp, NewLeaf);
343 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
|
| CloneFunction.cpp | 413 for (const BasicBlock *Succ : TI->successors())
414 ToClone.push_back(Succ);
468 for (const BasicBlock *Succ : TI->successors())
469 ToClone.push_back(Succ);
699 // Move all the instructions in the succ to the pred.
[all...] |
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyCFGStackify.cpp | 189 MachineBasicBlock *Succ = Succs.pop_back_val();
190 if (Visited.insert(Succ).second)
191 Stack.push_back(POStackEntry(Succ, MF, MLI));
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 453 SUnit &Succ = *I->getSUnit();
454 if (!Succ.isScheduled) {
457 if (OnlyAvailableSucc && OnlyAvailableSucc != &Succ)
459 OnlyAvailableSucc = &Succ;
|
| HexagonStoreWidening.cpp | 553 bool Succ = selectStores(I++, E, OG, CollectedSize, MaxWideSize) &&
556 if (!Succ)
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| BugReporterVisitors.cpp | 446 PathDiagnosticPiece *FindLastStoreBRVisitor::VisitNode(const ExplodedNode *Succ,
477 // (1) Succ has this binding and Pred does not, i.e. this is
479 // (2) Succ has this binding and is a PostStore node for this region, i.e.
482 if (Succ->getState()->getSVal(R) != V)
486 Optional<PostStore> PS = Succ->getLocationAs<PostStore>();
491 StoreSite = Succ;
495 if (Optional<PostStmt> P = Succ->getLocationAs<PostStmt>())
504 if (Optional<CallEnter> CE = Succ->getLocationAs<CallEnter>()) {
512 Succ->getState());
807 SuppressInlineDefensiveChecksVisitor::VisitNode(const ExplodedNode *Succ,
[all...] |
| /external/llvm/lib/CodeGen/ |
| IfConversion.cpp | [all...] |
| ScheduleDAG.cpp | 92 // Now add a corresponding succ to N.
142 SmallVectorImpl<SDep>::iterator Succ = std::find(N->Succs.begin(),
144 assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!");
145 N->Succs.erase(Succ);
|
| MachineInstr.cpp | [all...] |
| ScheduleDAGInstrs.cpp | [all...] |
| /external/clang/lib/Analysis/ |
| UninitializedValues.cpp | 645 const CFGBlock *Succ = *I;
646 if (Succ && SuccsVisited[Succ->getBlockID()] >= Succ->succ_size() &&
647 vals.getValue(Block, Succ, vd) == Uninitialized) {
653 const Stmt *Label = Succ->getLabel();
|
| ThreadSafetyCommon.cpp | 902 void SExprBuilder::handleSuccessor(const CFGBlock *Succ) {
906 void SExprBuilder::handleSuccessorBackEdge(const CFGBlock *Succ) {
907 mergePhiNodesBackEdge(Succ);
908 ++BBInfo[Succ->getBlockID()].ProcessedPredecessors;
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| SampleProfile.cpp | [all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| StructurizeCFG.cpp | 361 for (BasicBlock *Succ : Term->successors())
362 if (Visited.count(Succ))
363 Loops[Succ] = BB;
438 BasicBlock *Succ = Term->getSuccessor(i);
439 if (Succ != BB)
|
| RewriteStatepointsForGC.cpp | [all...] |
| /external/llvm/lib/Target/Mips/ |
| MipsDelaySlotFiller.cpp | 243 bool examinePred(MachineBasicBlock &Pred, const MachineBasicBlock &Succ,
849 bool Filler::examinePred(MachineBasicBlock &Pred, const MachineBasicBlock &Succ,
853 getBranch(Pred, Succ);
863 RegDU.addLiveOut(Pred, Succ);
|
| /external/llvm/include/llvm/IR/ |
| PatternMatch.h | 909 BasicBlock *&Succ;
910 br_match(BasicBlock *&Succ) : Succ(Succ) {}
915 Succ = BI->getSuccessor(0);
922 inline br_match m_UnconditionalBr(BasicBlock *&Succ) { return br_match(Succ); }
[all...] |
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | 309 void addSucc(BasicBlock *Succ) { Succs.push_back(Succ); }
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| PGOInstrumentation.cpp | 262 BasicBlock *Succ = TI->getSuccessor(I);
263 uint32_t Index = getBBInfo(Succ).Index;
|
