| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| MachineDominators.cpp | 103 MachineBasicBlock *Succ = Edge.ToBB; 104 MachineDomTreeNode *SuccDTNode = DT->getNode(Succ); 106 for (MachineBasicBlock *PredBB : Succ->predecessors()) { 118 // Succ 141 // If all the other predecessors of "Succ" are dominated by "Succ" itself 142 // then the new block is the new immediate dominator of "Succ". Otherwise,
|
| SwitchLoweringUtils.cpp | 242 for (MachineBasicBlock *Succ : Table) { 243 if (Done.count(Succ)) 245 addSuccessorWithProb(JumpTableMBB, Succ, JTProbs[Succ]); 246 Done.insert(Succ); 480 MachineBasicBlock *Succ = CC.MBB; 482 if (DstIndex != 0 && Clusters[DstIndex - 1].MBB == Succ &&
|
| MIRPrinter.cpp | 587 MachineBasicBlock *Succ = MO.getMBB(); 588 auto RP = Seen.insert(Succ); 590 Result.push_back(Succ);
|
| MachineInstr.cpp | 771 MachineBasicBlock::instr_iterator Succ = getIterator(); 772 ++Succ; 773 assert(!Succ->isBundledWithPred() && "Inconsistent bundle flags"); 774 Succ->setFlag(BundledPred); 789 MachineBasicBlock::instr_iterator Succ = getIterator(); 790 ++Succ; 791 assert(Succ->isBundledWithPred() && "Inconsistent bundle flags"); 792 Succ->clearFlag(BundledPred);
|
| AtomicExpandPass.cpp | 1109 Value *Succ = Builder.CreateExtractValue(NewCI, 1); 1115 Res = Builder.CreateInsertValue(Res, Succ, 1);
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| CoreEngine.cpp | 96 const CFGBlock *Succ = *(Entry->succ_begin()); 100 BlockEdge StartLoc(Entry, Succ, L); 333 if (const CFGBlock *succ = *it) { 334 generateNode(BlockEdge(B, succ, Pred->getLocationContext()), 556 ExplodedNode *Succ = G.getNode(Loc, N->getState(), false, &IsNew); 557 Succ->addPredecessor(N, G); 560 WList->enqueue(Succ, Block, Idx+1); 643 ExplodedNode *Succ = generateNodeImpl(Loc, State, NodePred); 644 return Succ; 652 ExplodedNode *Succ [all...] |
| ExprEngineCallAndReturn.cpp | 55 const CFGBlock *Succ = *(Entry->succ_begin()); 58 BlockEdge Loc(Entry, Succ, calleeCtx);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| MachineTraceMetrics.h | 162 const MachineBasicBlock *Succ = nullptr;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
| PPCBranchCoalescing.cpp | 301 MachineBasicBlock *Succ = 306 assert(Succ && "Expecting a valid fall-through block\n"); 308 if (!Succ->empty()) { 313 if (!Succ->isSuccessor(Cand.BranchTargetBlock)) { 320 Cand.FallThroughBlock = Succ;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| WebAssemblyFixIrreducibleControlFlow.cpp | 143 for (auto *Succ : MBB->successors()) { 144 if (Succ != Entry && inRegion(Succ)) { 145 Reachable[MBB].insert(Succ); 146 WorkList.emplace_back(MBB, Succ); 152 MachineBasicBlock *MBB, *Succ; 153 std::tie(MBB, Succ) = WorkList.pop_back_val(); 154 assert(inRegion(MBB) && Succ != Entry && inRegion(Succ)); 156 // We recently added MBB => Succ, and that means we may have enable [all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| SampleProfileProbe.cpp | 235 auto *Succ = TI->getSuccessor(I); 236 auto Index = getBlockId(Succ);
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| PlaceSafepoints.cpp | 285 for (BasicBlock *Succ : successors(BB)) { 286 if (Seen.insert(Succ).second) { 287 Worklist.push_back(Succ); 553 BasicBlock *Succ = Term->getSuccessor(i); 554 if (DT.dominates(Succ, Term->getParent())) { 555 Headers.insert(Succ);
|
| SCCP.cpp | 352 for (BasicBlock *Succ : successors(BB)) { 353 if (Solver.isEdgeFeasible(BB, Succ)) 354 FeasibleSuccessors.insert(Succ); 374 for (BasicBlock *Succ : successors(BB)) { 375 if (Succ == OnlyFeasibleSuccessor && !HaveSeenOnlyFeasibleSuccessor) { 382 Succ->removePredecessor(BB); 383 Updates.push_back({DominatorTree::Delete, BB, Succ}); 398 BasicBlock *Succ = CI->getCaseSuccessor(); 399 Succ->removePredecessor(BB); 400 Updates.push_back({DominatorTree::Delete, BB, Succ}); [all...] |
| LoopSimplifyCFG.cpp | 200 for (auto *Succ : successors(BB)) 201 if (L.contains(Succ) && !LI.isLoopHeader(Succ) && RPO[BB] > RPO[Succ]) 250 for (BasicBlock *Succ : successors(BB)) 251 if (!TakeFoldCandidate || TheOnlySucc == Succ) { 252 if (L.contains(Succ)) 253 LiveLoopBlocks.insert(Succ); 255 LiveExitBlocks.insert(Succ); 298 return any_of(successors(BB), [&](BasicBlock *Succ) { [all...] |
| CorrelatedValuePropagation.cpp | 337 for (auto *Succ : successors(BB)) 338 SuccessorsCount[Succ]++; 352 BasicBlock *Succ = CI->getCaseSuccessor(); 353 Succ->removePredecessor(BB); 363 if (--SuccessorsCount[Succ] == 0) 364 DTU.applyUpdatesPermissive({{DominatorTree::Delete, BB, Succ}});
|
| LoopFuse.cpp | 811 BasicBlock *Succ = CurrentBranch->getSuccessor(0); 812 if (Succ == BB) 813 Succ = CurrentBranch->getSuccessor(1); 814 ReplaceInstWithInst(CurrentBranch, BranchInst::Create(Succ)); 1148 dbgs() << "TODO: Implement pred/succ dependence handling!\n"); 1289 if (BasicBlock *Succ = FC0.Latch->getUniqueSuccessor()) { 1290 MergeBlockIntoPredecessor(Succ, &DTU, &LI);
|
| StructurizeCFG.cpp | 438 for (BasicBlock *Succ : Term->successors()) 439 if (Visited.count(Succ)) 440 Loops[Succ] = BB; 474 BasicBlock *Succ = Term->getSuccessor(i); 475 if (Succ != BB) 680 for (BasicBlock *Succ : successors(BB)) 681 delPhiValues(BB, Succ);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| HexagonStoreWidening.cpp | 545 bool Succ = selectStores(I++, E, OG, CollectedSize, MaxWideSize) && 548 if (!Succ)
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/ |
| MipsBranchExpansion.cpp | 206 MachineBasicBlock *Succ = Parent->getNextNode(); 207 if (Succ != nullptr && Parent->isSuccessor(Succ)) { 208 Position = Succ->begin(); 209 Parent = Succ;
|
| /src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| UninitializedValues.cpp | 644 const CFGBlock *Succ = *I; 645 if (Succ && SuccsVisited[Succ->getBlockID()] >= Succ->succ_size() && 646 vals.getValue(Block, Succ, vd) == Uninitialized) { 652 const Stmt *Label = Succ->getLabel();
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| SILowerControlFlow.cpp | 444 MachineBasicBlock *Succ = *B->succ_begin(); 446 It = Succ->begin(); 447 B = Succ; 742 MachineBasicBlock *Succ = *MBB.succ_begin(); 749 P->ReplaceUsesOfBlockWith(&MBB, Succ); 751 MBB.removeSuccessor(Succ); 758 if (FallThrough && !FallThrough->isLayoutSuccessor(Succ)) { 759 if (!GetFallThroughSucc(Succ)) { 762 MF->splice(std::next(FallThroughPos), Succ); 766 .addMBB(Succ); [all...] |
| SIMachineScheduler.cpp | 424 for (SDep& Succ : SU->Succs) { 425 if (BC->isSUInBlock(Succ.getSUnit(), ID)) 426 undoReleaseSucc(SU, &Succ); 465 for (SDep& Succ : SU->Succs) { 466 SUnit *SuccSU = Succ.getSUnit(); 474 releaseSucc(SU, &Succ); 497 for (SDep& Succ : SU->Succs) { 499 NodeNum2Index.find(Succ.getSUnit()->NodeNum); 536 void SIScheduleBlock::addSucc(SIScheduleBlock *Succ, 538 unsigned SuccID = Succ->getID() [all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| LowerSwitch.cpp | 195 BasicBlock *Succ = Leaf.BB; 196 BranchInst::Create(Succ, Default, Comp, NewLeaf); 200 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
| X86SpeculativeLoadHardening.cpp | 225 MachineBasicBlock &Succ, int SuccCount, 228 assert(!Succ.isEHPad() && "Shouldn't get edges to EH pads!"); 241 assert(Br->getOperand(0).getMBB() == &Succ && 260 // Insert unconditional "jump Succ" instruction in the new block if 262 if (!NewMBB.isLayoutSuccessor(&Succ)) { 264 TII.insertBranch(NewMBB, &Succ, nullptr, Cond, Br->getDebugLoc()); 269 assert(NewMBB.isLayoutSuccessor(&Succ) && 278 MBB.replaceSuccessor(&Succ, &NewMBB); 280 MBB.splitSuccessor(&Succ, &NewMBB); 284 NewMBB.addSuccessor(&Succ); [all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-c-test/ |
| echo.cpp | 665 LLVMAtomicOrdering Succ = LLVMGetCmpXchgSuccessOrdering(Src); 669 Dst = LLVMBuildAtomicCmpXchg(Builder, Ptr, Cmp, New, Succ, Fail,
|