| /external/llvm/lib/Target/Mips/ |
| MipsDelaySlotFiller.cpp | 239 bool examinePred(MachineBasicBlock &Pred, const MachineBasicBlock &Succ,
687 bool Filler::examinePred(MachineBasicBlock &Pred, const MachineBasicBlock &Succ,
691 getBranch(Pred, Succ);
701 RegDU.addLiveOut(Pred, Succ);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| BugReporterVisitors.cpp | 450 PathDiagnosticPiece *FindLastStoreBRVisitor::VisitNode(const ExplodedNode *Succ,
481 // (1) Succ has this binding and Pred does not, i.e. this is
483 // (2) Succ has this binding and is a PostStore node for this region, i.e.
486 if (Succ->getState()->getSVal(R) != V)
490 Optional<PostStore> PS = Succ->getLocationAs<PostStore>();
495 StoreSite = Succ;
499 if (Optional<PostStmt> P = Succ->getLocationAs<PostStmt>())
508 if (Optional<CallEnter> CE = Succ->getLocationAs<CallEnter>()) {
516 Succ->getState());
811 SuppressInlineDefensiveChecksVisitor::VisitNode(const ExplodedNode *Succ,
[all...] |
| BugReporter.cpp | [all...] |
| ExprEngineCallAndReturn.cpp | 53 const CFGBlock *Succ = *(Entry->succ_begin());
56 BlockEdge Loc(Entry, Succ, calleeCtx);
[all...] |
| /external/llvm/lib/CodeGen/ |
| ScheduleDAGInstrs.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);
|
| 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/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 | 798 BasicBlock *&Succ;
799 br_match(BasicBlock *&Succ)
800 : Succ(Succ) {
807 Succ = BI->getSuccessor(0);
814 inline br_match m_UnconditionalBr(BasicBlock *&Succ) { return br_match(Succ); }
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| StructurizeCFG.cpp | 300 BasicBlock *Succ = Term->getSuccessor(i);
302 if (Visited.count(Succ))
303 Loops[Succ] = BB;
374 BasicBlock *Succ = Term->getSuccessor(i);
375 if (Succ != BB)
|
| SCCP.cpp | [all...] |
| GVN.cpp | 697 BasicBlock *splitCriticalEdges(BasicBlock *Pred, BasicBlock *Succ);
[all...] |
| JumpThreading.cpp | 195 BasicBlock *Succ = BI->getSuccessor(0);
206 BB = Succ;
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 241 BasicBlock *llvm::SplitEdge(BasicBlock *BB, BasicBlock *Succ, Pass *P) {
242 unsigned SuccNum = GetSuccessorNumber(BB, Succ);
249 // If the edge isn't critical, then BB has a single successor or Succ has a
252 if (BasicBlock *SP = Succ->getSinglePredecessor()) {
257 return SplitBlock(Succ, Succ->begin(), P);
263 "Should have a single succ!");
|
| SimplifyCFG.cpp | 184 /// AddPredecessorToBlock - Update PHI nodes in Succ to indicate that there will
187 /// ExistPred, an existing predecessor of Succ.
188 static void AddPredecessorToBlock(BasicBlock *Succ, BasicBlock *NewPred,
190 if (!isa<PHINode>(Succ->begin())) return; // Quick exit if nothing to do
193 for (BasicBlock::iterator I = Succ->begin();
500 BasicBlock *Succ = BI->getSuccessor(ICI->getPredicate() == ICmpInst::ICMP_NE);
503 Succ));
658 assert(TIV && "No edge from pred to succ?");
[all...] |
| /external/llvm/lib/Analysis/ |
| BranchProbabilityInfo.cpp | 546 BasicBlock *Succ = *I;
547 uint32_t Weight = getEdgeWeight(BB, Succ);
555 MaxSucc = Succ;
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineBasicBlock.h | 357 /// addSuccessor - Add succ as a successor of this MachineBasicBlock.
358 /// The Predecessors list of succ is automatically updated. WEIGHT
364 void addSuccessor(MachineBasicBlock *succ, uint32_t weight = 0);
367 /// MachineBasicBlock. The Predecessors list of succ is automatically updated.
369 void removeSuccessor(MachineBasicBlock *succ);
372 /// this MachineBasicBlock. The Predecessors list of succ is automatically
446 MachineBasicBlock *SplitCriticalEdge(MachineBasicBlock *Succ, Pass *P);
634 uint32_t getSuccWeight(const_succ_iterator Succ) const;
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 628 // emit [(succs * preds) x i64*], logically [succ x [pred x i64*]].
644 BasicBlock *Succ = TI->getSuccessor(i);
645 IRBuilder<> Builder(Succ);
648 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) +
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | 764 void addSucc(BasicBlock *Succ) { Succs.push_back(Succ); }
[all...] |
| /external/chromium_org/v8/src/ |
| log.cc | 554 if (Succ(head_) == tail_) {
558 head_ = Succ(head_);
568 tail_ = Succ(tail_);
582 int Succ(int index) { return (index + 1) % kBufferSize; }
[all...] |
| /external/v8/src/ |
| log.cc | 94 if (Succ(head_) == tail_) {
98 head_ = Succ(head_);
108 tail_ = Succ(tail_);
122 int Succ(int index) { return (index + 1) % kBufferSize; }
[all...] |
| /external/llvm/lib/Target/ARM/ |
| ARMConstantIslandPass.cpp | [all...] |
| ARMISelLowering.cpp | [all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGBuilder.cpp | [all...] |
