| /external/llvm/lib/Transforms/ObjCARC/ |
| DependencyAnalysis.cpp | 256 const BasicBlock *Succ = *SI;
257 if (Succ != StartBB && !Visited.count(Succ)) {
|
| /external/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 93 typename GraphT::NodeType* Succ = *NextSucc;
96 DT.Info[Succ];
99 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ)));
|
| /external/llvm/lib/Transforms/Utils/ |
| AddDiscriminators.cpp | 182 BasicBlock *Succ = Last->getSuccessor(I);
183 Instruction *First = Succ->getFirstNonPHIOrDbgOrLifetime();
188 // If the first instruction (First) of Succ is at the same file
191 // in Succ that share the same location with First.
208 for (BasicBlock::iterator I1(*First), E1 = Succ->end(); I1 != E1;
|
| LowerSwitch.cpp | 266 BasicBlock* Succ = Leaf.BB;
267 BranchInst::Create(Succ, Default, Comp, NewLeaf);
271 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
|
| Local.cpp | 183 BasicBlock *Succ = SI->getSuccessor(i);
184 if (Succ == TheOnlyDest)
187 Succ->removePredecessor(BB);
533 /// almost-empty BB ending in an unconditional branch to Succ, into Succ.
535 /// Assumption: Succ is the single successor for BB.
537 static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) {
538 assert(*succ_begin(BB) == Succ && "Succ is not successor of BB!");
541 << Succ->getName() << "\n")
[all...] |
| /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);
376 if (const CFGBlock *succ = *it) {
377 generateNode(BlockEdge(B, succ, Pred->getLocationContext()),
552 ExplodedNode *Succ = G->getNode(Loc, N->getState(), false, &IsNew);
553 Succ->addPredecessor(N, *G);
556 WList->enqueue(Succ, Block, Idx+1);
647 ExplodedNode *Succ = generateNodeImpl(Loc, State, NodePred);
648 return Succ;
656 ExplodedNode *Succ = Eng.G->getNode(BlockEdge(Src, I.getBlock()
[all...] |
| ExprEngineCallAndReturn.cpp | 53 const CFGBlock *Succ = *(Entry->succ_begin());
56 BlockEdge Loc(Entry, Succ, calleeCtx);
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineTraceMetrics.h | 140 const MachineBasicBlock *Succ;
157 Pred(nullptr), Succ(nullptr),
|
| /external/llvm/lib/CodeGen/ |
| MachineTraceMetrics.cpp | 209 if (!TBI->Succ) {
218 unsigned SuccNum = TBI->Succ->getNumber();
353 const MachineBasicBlock *Succ = *I;
355 if (CurLoop && Succ == CurLoop->getHeader())
358 if (isExitingLoop(CurLoop, getLoopFor(Succ)))
361 getHeightResources(Succ);
368 Best = Succ, BestHeight = Height;
493 DEBUG(dbgs() << " succ for BB#" << I->getNumber() << ": ");
496 TBI.Succ = pickTraceSucc(*I);
498 if (TBI.Succ)
[all...] |
| MachineBasicBlock.cpp | 488 void MachineBasicBlock::addSuccessor(MachineBasicBlock *succ, uint32_t weight) {
498 Successors.push_back(succ);
499 succ->addPredecessor(this);
502 void MachineBasicBlock::removeSuccessor(MachineBasicBlock *succ) {
503 succ->removePredecessor(this);
504 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ);
585 MachineBasicBlock *Succ = *fromMBB->succ_begin();
592 addSuccessor(Succ, Weight);
593 fromMBB->removeSuccessor(Succ);
603 MachineBasicBlock *Succ = *fromMBB->succ_begin()
[all...] |
| MachineInstr.cpp | [all...] |
| /external/llvm/lib/IR/ |
| BasicBlock.cpp | 348 BasicBlock *Succ = TI->getSuccessor(i);
349 // N.B. Succ might not be a complete BasicBlock, so don't assume
351 for (iterator II = Succ->begin(), IE = Succ->end(); II != IE; ++II) {
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 448 SUnit &Succ = *I->getSUnit();
449 if (!Succ.isScheduled) {
452 if (OnlyAvailableSucc && OnlyAvailableSucc != &Succ)
454 OnlyAvailableSucc = &Succ;
|
| /external/llvm/lib/Analysis/ |
| BranchProbabilityInfo.cpp | 567 BasicBlock *Succ = *I;
568 uint32_t Weight = getEdgeWeight(BB, Succ);
576 MaxSucc = Succ;
|
| /external/llvm/lib/MC/MCAnalysis/ |
| MCModuleYAML.cpp | 429 MCBasicBlock *Succ = MCFN->find(*SI);
430 if (!Succ)
432 MCBB->addSuccessor(Succ);
|
| MCObjectDisassembler.cpp | 167 void addSucc(BBInfo &Succ) {
168 Succs.insert(&Succ);
169 Succ.Preds.insert(this);
454 MCBasicBlock *Succ = BBInfos[*SI].BB;
455 BB->addSuccessor(Succ);
456 Succ->addPredecessor(BB);
|
| /external/clang/lib/Analysis/ |
| UninitializedValues.cpp | 586 const CFGBlock *Succ = *I;
587 if (Succ && SuccsVisited[Succ->getBlockID()] >= Succ->succ_size() &&
588 vals.getValue(Block, Succ, vd) == Uninitialized) {
594 const Stmt *Label = Succ->getLabel();
|
| /external/llvm/include/llvm/IR/ |
| PatternMatch.h | 888 BasicBlock *&Succ;
889 br_match(BasicBlock *&Succ)
890 : Succ(Succ) {
897 Succ = BI->getSuccessor(0);
904 inline br_match m_UnconditionalBr(BasicBlock *&Succ) { return br_match(Succ); }
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 714 // emit [(succs * preds) x i64*], logically [succ x [pred x i64*]].
730 BasicBlock *Succ = TI->getSuccessor(i);
731 IRBuilder<> Builder(Succ);
734 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) +
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| JumpThreading.cpp | 209 BasicBlock *Succ = BI->getSuccessor(0);
220 BB = Succ;
[all...] |
| LoopUnswitch.cpp | [all...] |
| SCCP.cpp | [all...] |
| SampleProfile.cpp | [all...] |
| StructurizeCFG.cpp | 302 BasicBlock *Succ = Term->getSuccessor(i);
304 if (Visited.count(Succ))
305 Loops[Succ] = BB;
381 BasicBlock *Succ = Term->getSuccessor(i);
382 if (Succ != BB)
|
