/external/clang/test/SemaTemplate/ |
H A D | alias-church-numerals.cpp | 10 template<template<template<typename> class, typename> class N, template<typename> class F, typename X> using Succ = F<N<F,X>>; 12 template<template<typename> class F, typename X> using One = Succ<Zero, F, X>; 13 template<template<typename> class F, typename X> using Two = Succ<One, F, X>;
|
/external/qemu/distrib/sdl-1.2.15/src/main/symbian/EKA2/ |
H A D | vectorbuffer.h | 30 inline TNode* Succ(); 38 inline TNodeBuffer::TNode* TNodeBuffer::TNode::Succ() function in class:TNodeBuffer::TNode 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/ |
H A D | CoreEngine.cpp | 184 const CFGBlock *Succ = *(Entry->succ_begin()); local 188 BlockEdge StartLoc(Entry, Succ, L); 552 ExplodedNode *Succ = G->getNode(Loc, N->getState(), false, &IsNew); local 553 Succ->addPredecessor(N, *G); 556 WList->enqueue(Succ, Block, Idx+1); 647 ExplodedNode *Succ = generateNodeImpl(Loc, State, NodePred); local 648 return Succ; 656 ExplodedNode *Succ = Eng.G->getNode(BlockEdge(Src, I.getBlock(), local 659 Succ->addPredecessor(Pred, *Eng.G); 665 Eng.WList->enqueue(Succ); 676 ExplodedNode *Succ = Eng.G->getNode(BlockEdge(Src, I.getBlock(), local 701 ExplodedNode *Succ = Eng.G->getNode(BlockEdge(Src, DefaultBlock, local [all...] |
H A D | BugReporterVisitors.cpp | 450 PathDiagnosticPiece *FindLastStoreBRVisitor::VisitNode(const ExplodedNode *Succ, argument 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, argument [all...] |
/external/llvm/lib/Transforms/Utils/ |
H A D | AddDiscriminators.cpp | 182 BasicBlock *Succ = Last->getSuccessor(I); local 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;
|
H A D | Local.cpp | 183 BasicBlock *Succ = SI->getSuccessor(i); local 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) { argument 538 assert(*succ_begin(BB) == Succ && "Succ is not successor of BB!"); 541 << Succ 735 BasicBlock *Succ = cast<BranchInst>(BB->getTerminator())->getSuccessor(0); local [all...] |
H A D | LowerSwitch.cpp | 266 BasicBlock* Succ = Leaf.BB; local 267 BranchInst::Create(Succ, Default, Comp, NewLeaf); 271 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
|
/external/llvm/include/llvm/Analysis/ |
H A D | CFG.h | 43 unsigned GetSuccessorNumber(BasicBlock *BB, BasicBlock *Succ);
|
/external/llvm/lib/CodeGen/ |
H A D | MachineBasicBlock.cpp | 585 MachineBasicBlock *Succ = *fromMBB->succ_begin(); local 592 addSuccessor(Succ, Weight); 593 fromMBB->removeSuccessor(Succ); 603 MachineBasicBlock *Succ = *fromMBB->succ_begin(); local 607 addSuccessor(Succ, Weight); 608 fromMBB->removeSuccessor(Succ); 611 for (MachineBasicBlock::instr_iterator MI = Succ->instr_begin(), 612 ME = Succ->instr_end(); MI != ME && MI->isPHI(); ++MI) 677 MachineBasicBlock::SplitCriticalEdge(MachineBasicBlock *Succ, Pass *P) { argument 680 if (Succ [all...] |
H A D | MachineTraceMetrics.cpp | 209 if (!TBI->Succ) { 218 unsigned SuccNum = TBI->Succ->getNumber(); 353 const MachineBasicBlock *Succ = *I; local 355 if (CurLoop && Succ == CurLoop->getHeader()) 358 if (isExitingLoop(CurLoop, getLoopFor(Succ))) 361 getHeightResources(Succ); 368 Best = Succ, BestHeight = Height; 496 TBI.Succ = pickTraceSucc(*I); 498 if (TBI.Succ) 499 dbgs() << "BB#" << TBI.Succ [all...] |
/external/clang/lib/StaticAnalyzer/Checkers/ |
H A D | TestAfterDivZeroChecker.cpp | 73 PathDiagnosticPiece *VisitNode(const ExplodedNode *Succ, 97 PathDiagnosticPiece *DivisionBRVisitor::VisitNode(const ExplodedNode *Succ, argument 106 if (Optional<PostStmt> P = Succ->getLocationAs<PostStmt>()) 118 ProgramStateRef State = Succ->getState(); 119 SVal S = State->getSVal(E, Succ->getLocationContext()); 120 if (ZeroSymbol == S.getAsSymbol() && SFC == Succ->getStackFrame()) { 124 ProgramPoint P = Succ->getLocation();
|
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | BasicBlockUtils.h | 106 inline bool SplitCriticalEdge(BasicBlock *Succ, pred_iterator PI, argument 111 if (TI->getSuccessor(i) == Succ)
|
/external/clang/lib/Analysis/ |
H A D | CFG.cpp | 297 CFGBlock *Succ; member in class:__anon17770::CFGBuilder 339 Block(nullptr), Succ(nullptr), 912 Succ = createBlock(); 913 assert(Succ == &cfg->getExit()); 937 Succ = B; 983 if (add_successor && Succ) 984 addSuccessor(B, Succ); 994 addSuccessor(B, &cfg->getExit(), Succ); 1764 Succ = Block; 1795 Succ 3767 addSuccessor(AdjacentBlock Succ, BumpVectorContext &C) argument [all...] |
/external/llvm/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 93 typename GraphT::NodeType* Succ = *NextSucc; local 96 DT.Info[Succ]; 99 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ)));
|
/external/llvm/lib/IR/ |
H A D | BasicBlock.cpp | 348 BasicBlock *Succ = TI->getSuccessor(i); local 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/Transforms/ObjCARC/ |
H A D | DependencyAnalysis.cpp | 256 const BasicBlock *Succ = *SI; local 257 if (Succ != StartBB && !Visited.count(Succ)) {
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | LoopUnswitch.cpp | 1106 BasicBlock *Succ = BI->getSuccessor(0); local 1107 BasicBlock *SinglePred = Succ->getSinglePredecessor(); 1112 << Succ->getName() << "\n"); 1114 // Resolve any single entry PHI nodes in Succ. 1115 while (PHINode *PN = dyn_cast<PHINode>(Succ->begin())) 1118 // If Succ has any successors with PHI nodes, update them to have 1119 // entries coming from Pred instead of Succ. 1120 Succ->replaceAllUsesWith(Pred); 1122 // Move all of the successor contents from Succ to Pred. 1123 Pred->getInstList().splice(BI, Succ [all...] |
/external/llvm/lib/Analysis/ |
H A D | BlockFrequencyInfoImpl.cpp | 264 const BlockNode &Succ, 273 BlockNode Resolved = Working[Succ.Index].getResolvedNode(); 280 dbgs() << ", succ = " << getBlockName(Succ); 281 if (Resolved != Succ) 561 void IrreducibleGraph::addEdge(IrrNode &Irr, const BlockNode &Succ, argument 563 if (OuterLoop && OuterLoop->isHeader(Succ)) 565 auto L = Lookup.find(Succ.Index); 261 addToDist(Distribution &Dist, const LoopData *OuterLoop, const BlockNode &Pred, const BlockNode &Succ, uint64_t Weight) argument
|
H A D | CFG.cpp | 72 unsigned llvm::GetSuccessorNumber(BasicBlock *BB, BasicBlock *Succ) { argument 79 if (Term->getSuccessor(i) == Succ)
|
/external/llvm/lib/MC/MCAnalysis/ |
H A D | MCObjectDisassembler.cpp | 167 void addSucc(BBInfo &Succ) { argument 168 Succs.insert(&Succ); 169 Succ.Preds.insert(this); 454 MCBasicBlock *Succ = BBInfos[*SI].BB; local 455 BB->addSuccessor(Succ); 456 Succ->addPredecessor(BB);
|
/external/clang/include/clang/Analysis/Analyses/ |
H A D | ThreadSafetyCommon.h | 72 void handleSuccessor(const CFGBlock *Succ) {} argument 75 void handleSuccessorBackEdge(const CFGBlock *Succ) {} argument 343 void handleSuccessor(const CFGBlock *Succ); 344 void handleSuccessorBackEdge(const CFGBlock *Succ);
|
/external/clang/include/clang/StaticAnalyzer/Core/BugReporter/ |
H A D | BugReporterVisitor.h | 58 virtual PathDiagnosticPiece *VisitNode(const ExplodedNode *Succ, 328 PathDiagnosticPiece *VisitNode(const ExplodedNode *Succ,
|
/external/llvm/include/llvm/CodeGen/ |
H A D | MachineTraceMetrics.h | 140 const MachineBasicBlock *Succ; member in struct:llvm::MachineTraceMetrics::TraceBlockInfo 157 Pred(nullptr), Succ(nullptr),
|
/external/llvm/lib/Target/Hexagon/ |
H A D | HexagonMachineScheduler.cpp | 448 SUnit &Succ = *I->getSUnit(); local 449 if (!Succ.isScheduled) { 452 if (OnlyAvailableSucc && OnlyAvailableSucc != &Succ) 454 OnlyAvailableSucc = &Succ;
|
/external/llvm/lib/Target/Mips/ |
H A D | MipsDelaySlotFiller.cpp | 236 bool examinePred(MachineBasicBlock &Pred, const MachineBasicBlock &Succ, 703 bool Filler::examinePred(MachineBasicBlock &Pred, const MachineBasicBlock &Succ, argument 707 getBranch(Pred, Succ); 717 RegDU.addLiveOut(Pred, Succ);
|