Searched refs:Succ (Results 26 - 50 of 68) sorted by relevance

123

/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/
H A DMachineTraceMetrics.h140 const MachineBasicBlock *Succ; member in struct:llvm::MachineTraceMetrics::TraceBlockInfo
157 Pred(nullptr), Succ(nullptr),
H A DMachineBasicBlock.h436 /// 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, Pas
[all...]
/freebsd-11.0-release/contrib/llvm/lib/Analysis/
H A DBlockFrequencyInfoImpl.cpp263 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, argument
584 if (OuterLoop && OuterLoop->isHeader(Succ))
586 auto L = Lookup.find(Succ.Index);
260 addToDist(Distribution &Dist, const LoopData *OuterLoop, const BlockNode &Pred, const BlockNode &Succ, uint64_t Weight) argument
H A DBranchProbabilityInfo.cpp557 BasicBlock *Succ = *I; local
558 auto Prob = getEdgeProbability(BB, Succ);
561 MaxSucc = Succ;
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp44 for (BasicBlock *Succ : BBTerm->successors())
45 Succ->removePredecessor(BB);
238 BasicBlock *llvm::SplitEdge(BasicBlock *BB, BasicBlock *Succ, DominatorTree *DT, argument
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);
H A DSimplifyCFG.cpp230 /// Update PHI nodes in Succ to indicate that there will now be entries in it
233 /// of Succ.
234 static void AddPredecessorToBlock(BasicBlock *Succ, BasicBlock *NewPred, argument
236 if (!isa<PHINode>(Succ->begin())) return; // Quick exit if nothing to do
239 for (BasicBlock::iterator I = Succ->begin();
606 BasicBlock *Succ = BI->getSuccessor(ICI->getPredicate() == ICmpInst::ICMP_NE); local
609 Succ));
2419 BasicBlock *Succ = BB->getSingleSuccessor(); local
2421 for (auto I = Succ->begin(); isa<PHINode>(I); ++I)
2427 assert(std::distance(pred_begin(Succ), pred_en
4201 BasicBlock *Succ = SI->getSuccessor(i); local
4837 BasicBlock *Succ = SI->getSuccessor(i); local
4957 auto Succ = BB->getUniqueSuccessor(); local
[all...]
H A DLowerSwitch.cpp338 BasicBlock* Succ = Leaf.BB; local
339 BranchInst::Create(Succ, Default, Comp, NewLeaf);
343 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
/freebsd-11.0-release/contrib/llvm/lib/Target/WebAssembly/
H A DWebAssemblyCFGStackify.cpp190 MachineBasicBlock *Succ = Succs.pop_back_val(); local
191 if (Visited.insert(Succ).second)
192 Stack.push_back(POStackEntry(Succ, MF, MLI));
/freebsd-11.0-release/contrib/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp453 SUnit &Succ = *I->getSUnit(); local
454 if (!Succ.isScheduled) {
457 if (OnlyAvailableSucc && OnlyAvailableSucc != &Succ)
459 OnlyAvailableSucc = &Succ;
H A DHexagonStoreWidening.cpp553 bool Succ = selectStores(I++, E, OG, CollectedSize, MaxWideSize) && local
556 if (!Succ)
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/
H A DIfConversion.cpp1636 MachineBasicBlock *Succ = Succs[i]; local
1638 if (Succ == FallThrough)
1640 ToBBI.BB->addSuccessor(Succ);
1689 MachineBasicBlock *Succ = FromSuccs[i]; local
1691 if (Succ == FallThrough)
1696 // Calculate the edge probability for the edge from ToBBI.BB to Succ,
1697 // which is a portion of the edge probability from FromBBI.BB to Succ. The
1700 NewProb = MBPI->getEdgeProbability(FromBBI.BB, Succ);
1711 FromBBI.BB->removeSuccessor(Succ);
1714 // If the edge from ToBBI.BB to Succ alread
[all...]
H A DScheduleDAG.cpp142 SmallVectorImpl<SDep>::iterator Succ = std::find(N->Succs.begin(),
144 assert(Succ != N->Succs.end() && "Mismatching preds / succs lists!");
145 N->Succs.erase(Succ);
H A DMachineInstr.cpp1066 MachineBasicBlock::instr_iterator Succ = getIterator(); local
1067 ++Succ;
1068 assert(!Succ->isBundledWithPred() && "Inconsistent bundle flags");
1069 Succ->setFlag(BundledPred);
1084 MachineBasicBlock::instr_iterator Succ = getIterator(); local
1085 ++Succ;
1086 assert(Succ->isBundledWithPred() && "Inconsistent bundle flags");
1087 Succ->clearFlag(BundledPred);
H A DScheduleDAGInstrs.cpp1479 void visitPostorderEdge(const SDep &PredDep, const SUnit *Succ) { argument
1480 R.DFSNodeData[Succ->NodeNum].InstrCount
1482 joinPredSubtree(PredDep, Succ);
1486 void visitCrossEdge(const SDep &PredDep, const SUnit *Succ) { argument
1487 ConnectionPairs.push_back(std::make_pair(PredDep.getSUnit(), Succ));
1532 bool joinPredSubtree(const SDep &PredDep, const SUnit *Succ, argument
1554 R.DFSNodeData[PredNum].SubtreeID = Succ->NodeNum;
1555 SubtreeClasses.join(Succ->NodeNum, PredNum);
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DBugReporterVisitors.cpp446 PathDiagnosticPiece *FindLastStoreBRVisitor::VisitNode(const ExplodedNode *Succ, argument
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, argument
[all...]
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/Analysis/
H A DUninitializedValues.cpp645 const CFGBlock *Succ = *I; local
646 if (Succ && SuccsVisited[Succ->getBlockID()] >= Succ->succ_size() &&
647 vals.getValue(Block, Succ, vd) == Uninitialized) {
653 const Stmt *Label = Succ->getLabel();
H A DThreadSafetyCommon.cpp902 void SExprBuilder::handleSuccessor(const CFGBlock *Succ) { argument
906 void SExprBuilder::handleSuccessorBackEdge(const CFGBlock *Succ) { argument
907 mergePhiNodesBackEdge(Succ);
908 ++BBInfo[Succ->getBlockID()].ProcessedPredecessors;
/freebsd-11.0-release/contrib/llvm/lib/Transforms/IPO/
H A DSampleProfile.cpp875 for (auto *Succ : Successors[BB]) {
876 Edge E = std::make_pair(BB, Succ);
1035 BasicBlock *Succ = TI->getSuccessor(I); local
1036 Edge E = std::make_pair(BB, Succ);
1050 MaxDestLoc = Succ->getFirstNonPHIOrDbgOrLifetime()->getDebugLoc();
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DStructurizeCFG.cpp361 for (BasicBlock *Succ : Term->successors())
362 if (Visited.count(Succ))
363 Loops[Succ] = BB;
438 BasicBlock *Succ = Term->getSuccessor(i); local
439 if (Succ != BB)
H A DJumpThreading.cpp256 BasicBlock *Succ = BI->getSuccessor(0); local
267 BB = Succ;
1263 for (BasicBlock *Succ : successors(Pred))
1264 if (Succ == BB)
1638 for (BasicBlock *Succ : successors(BB)) {
1639 auto SuccFreq = (Succ == SuccBB)
1641 : BBOrigFreq * BPI->getEdgeProbability(BB, Succ);
/freebsd-11.0-release/contrib/llvm/lib/Target/Mips/
H A DMipsDelaySlotFiller.cpp243 bool examinePred(MachineBasicBlock &Pred, const MachineBasicBlock &Succ,
849 bool Filler::examinePred(MachineBasicBlock &Pred, const MachineBasicBlock &Succ, argument
853 getBranch(Pred, Succ);
863 RegDU.addLiveOut(Pred, Succ);
/freebsd-11.0-release/contrib/llvm/include/llvm/IR/
H A DPatternMatch.h909 BasicBlock *&Succ; member in struct:llvm::PatternMatch::br_match
910 br_match(BasicBlock *&Succ) : Succ(Succ) {} argument
915 Succ = BI->getSuccessor(0);
922 inline br_match m_UnconditionalBr(BasicBlock *&Succ) { return br_match(Succ); } argument
/freebsd-11.0-release/contrib/llvm/lib/Transforms/ObjCARC/
H A DObjCARCOpts.cpp309 void addSucc(BasicBlock *Succ) { Succs.push_back(Succ); } argument
1206 const BasicBlock *Succ = *SI; local
1207 DenseMap<const BasicBlock *, BBState>::iterator I = BBStates.find(Succ);
1212 Succ = *SI;
1213 I = BBStates.find(Succ);
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Instrumentation/
H A DPGOInstrumentation.cpp262 BasicBlock *Succ = TI->getSuccessor(I); local
263 uint32_t Index = getBBInfo(Succ).Index;
/freebsd-11.0-release/contrib/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.h113 void addSucc(SIScheduleBlock *Succ);

Completed in 410 milliseconds

123