/external/llvm/lib/Transforms/ObjCARC/ |
DependencyAnalysis.cpp | 254 const BasicBlock *Succ = *SI; 255 if (Succ != StartBB && !Visited.count(Succ)) {
|
/external/llvm/include/llvm/Analysis/ |
DominatorInternals.h | 93 typename GraphT::NodeType* Succ = *NextSucc; 96 DT.Info[Succ]; 99 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ)));
|
BlockFrequencyImpl.h | 328 BlockT *Succ = *SI; 329 OS << " " << getBlockName(BB) << " -> " << getBlockName(Succ) 330 << " = " << getEdgeFreq(BB, Succ) << "\n";
|
/external/llvm/lib/Transforms/Instrumentation/ |
OptimalEdgeProfiling.cpp | 183 BasicBlock *Succ = TI->getSuccessor(s); 184 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB,Succ); 189 Succ = TI->getSuccessor(s); 191 InsertedBlocks.insert(Succ); 202 printEdgeCounter(edge, Succ, i); 203 IncrementCounterInBlock(Succ, i, Counters); ++NumEdgesInserted;
|
GCOVProfiling.cpp | 598 // emit [(succs * preds) x i64*], logically [succ x [pred x i64*]]. 614 BasicBlock *Succ = TI->getSuccessor(i); 615 IRBuilder<> Builder(Succ); 618 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) +
|
/external/llvm/lib/CodeGen/ |
MachineTraceMetrics.cpp | 153 if (!TBI->Succ) { 160 TraceBlockInfo *SuccTBI = &BlockInfo[TBI->Succ->getNumber()]; 260 const MachineBasicBlock *Succ = *I; 262 if (CurLoop && Succ == CurLoop->getHeader()) 265 if (isExitingLoop(CurLoop, getLoopFor(Succ))) 268 getHeightResources(Succ); 275 Best = Succ, BestHeight = Height; 400 DEBUG(dbgs() << " succ for BB#" << I->getNumber() << ": "); 403 TBI.Succ = pickTraceSucc(*I); 405 if (TBI.Succ) [all...] |
MachineBasicBlock.cpp | 445 void MachineBasicBlock::addSuccessor(MachineBasicBlock *succ, uint32_t weight) { 455 Successors.push_back(succ); 456 succ->addPredecessor(this); 459 void MachineBasicBlock::removeSuccessor(MachineBasicBlock *succ) { 460 succ->removePredecessor(this); 461 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ); 542 MachineBasicBlock *Succ = *fromMBB->succ_begin(); 549 addSuccessor(Succ, Weight); 550 fromMBB->removeSuccessor(Succ); 560 MachineBasicBlock *Succ = *fromMBB->succ_begin() [all...] |
IfConversion.cpp | [all...] |
MachineInstr.cpp | 880 MachineBasicBlock::instr_iterator Succ = this; 881 ++Succ; 882 assert(!Succ->isBundledWithPred() && "Inconsistent bundle flags"); 883 Succ->setFlag(BundledPred); [all...] |
/external/llvm/tools/llvm-prof/ |
llvm-prof.cpp | 109 BasicBlock* Succ = TI->getSuccessor(s); 110 double w = ignoreMissing(PI.getEdgeWeight(std::make_pair(BB, Succ))); 112 SuccCounts.push_back(std::make_pair(std::make_pair(BB, Succ), w));
|
/external/qemu/distrib/sdl-1.2.15/src/main/symbian/EKA2/ |
vectorbuffer.h | 30 inline TNode* Succ(); 38 inline TNodeBuffer::TNode* TNodeBuffer::TNode::Succ() 74 __ASSERT_DEBUG(iBottom < iBottom->Succ(), VECPANIC(KErrCorrupt)); 76 reinterpret_cast<const TUint8*>(iBottom->Succ()) - 113 if(iBottom->Succ()->Ptr() - iBuffer > (C - (len + TInt(sizeof(TNode))))) 139 if(iTop->Succ() == NULL) 151 __ASSERT_ALWAYS(iTop->Succ() != NULL, VECPANIC(KErrUnderflow)); //can never pass-by bottom 153 iTop = iTop->Succ(); 177 TNode* t = iTop->Size() > 0 ? iTop : iTop->Succ(); //eliminate terminator 180 TNode* nt = t->Succ(); [all...] |
/external/clang/lib/StaticAnalyzer/Core/ |
CoreEngine.cpp | 184 const CFGBlock *Succ = *(Entry->succ_begin()); 188 BlockEdge StartLoc(Entry, Succ, L); 371 if (const CFGBlock *succ = *it) { 372 generateNode(BlockEdge(B, succ, Pred->getLocationContext()), 529 ExplodedNode *Succ = G->getNode(Loc, N->getState(), false, &IsNew); 530 Succ->addPredecessor(N, *G); 533 WList->enqueue(Succ, Block, Idx+1); 624 ExplodedNode *Succ = generateNodeImpl(Loc, State, NodePred); 625 return Succ; 633 ExplodedNode *Succ = Eng.G->getNode(BlockEdge(Src, I.getBlock() [all...] |
ExprEngineCallAndReturn.cpp | 50 const CFGBlock *Succ = *(Entry->succ_begin()); 53 BlockEdge Loc(Entry, Succ, calleeCtx); [all...] |
/external/llvm/include/llvm/CodeGen/ |
MachineTraceMetrics.h | 133 const MachineBasicBlock *Succ; 150 Pred(0), Succ(0),
|
/external/llvm/lib/Analysis/ |
BranchProbabilityInfo.cpp | 467 BasicBlock *Succ = *I; 468 uint32_t Weight = getEdgeWeight(BB, Succ); 476 MaxSucc = Succ;
|
ProfileInfo.cpp | 250 succ_const_iterator Succ = succ_begin(BB), End = succ_end(BB); 251 if (Succ == End) { 258 for(;Succ != End; ++Succ) { 259 if (P.find(*Succ) != P.end()) continue; 260 Edge e = getEdge(BB,*Succ); 262 P[*Succ] = BB; 263 BFS.push(*Succ); 264 if ((Mode & GetPathToDest) && *Succ == Dest) { 266 BB = *Succ; [all...] |
/external/llvm/lib/IR/ |
BasicBlock.cpp | 344 BasicBlock *Succ = TI->getSuccessor(i); 345 // N.B. Succ might not be a complete BasicBlock, so don't assume 347 for (iterator II = Succ->begin(), IE = Succ->end(); II != IE; ++II) {
|
/external/llvm/lib/Target/Hexagon/ |
HexagonMachineScheduler.cpp | 444 SUnit &Succ = *I->getSUnit(); 445 if (!Succ.isScheduled) { 448 if (OnlyAvailableSucc && OnlyAvailableSucc != &Succ) 450 OnlyAvailableSucc = &Succ;
|
/external/llvm/lib/Transforms/Utils/ |
LowerSwitch.cpp | 201 BasicBlock* Succ = Leaf.BB; 202 BranchInst::Create(Succ, Default, Comp, NewLeaf); 206 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
|
Local.cpp | 177 BasicBlock *Succ = SI->getSuccessor(i); 178 if (Succ == TheOnlyDest) 181 Succ->removePredecessor(BB); 529 /// almost-empty BB ending in an unconditional branch to Succ, into succ. 531 /// Assumption: Succ is the single successor for BB. 533 static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) { 534 assert(*succ_begin(BB) == Succ && "Succ is not successor of BB!"); 537 << Succ->getName() << "\n") [all...] |
/external/llvm/lib/Target/R600/ |
AMDGPUStructurizeCFG.cpp | 305 BasicBlock *Succ = Term->getSuccessor(i); 307 if (Visited.count(Succ)) 308 Loops[Succ] = BB; 381 BasicBlock *Succ = Term->getSuccessor(i); 382 if (Succ != BB)
|
/external/clang/lib/Analysis/ |
UninitializedValues.cpp | 570 const CFGBlock *Succ = *I; 571 if (Succ && SuccsVisited[Succ->getBlockID()] >= Succ->succ_size() && 572 vals.getValue(Block, Succ, vd) == Uninitialized) { 578 const Stmt *Label = Succ->getLabel();
|
/external/llvm/include/llvm/Support/ |
PatternMatch.h | 785 BasicBlock *&Succ; 786 br_match(BasicBlock *&Succ) 787 : Succ(Succ) { 794 Succ = BI->getSuccessor(0); 801 inline br_match m_UnconditionalBr(BasicBlock *&Succ) { return br_match(Succ); }
|
/external/llvm/lib/Transforms/Scalar/ |
JumpThreading.cpp | 193 BasicBlock *Succ = BI->getSuccessor(0); 204 BB = Succ; [all...] |
LoopUnswitch.cpp | [all...] |