Searched refs:Succ (Results 1 - 25 of 36) sorted by relevance

12

/external/clang/test/SemaTemplate/
H A Dalias-church-numerals.cpp9 template<template<template<typename> class, typename> class N, template<typename> class F, typename X> using Succ = F<N<F,X>>;
11 template<template<typename> class F, typename X> using One = Succ<Zero, F, X>;
12 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 Dvectorbuffer.h30 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 DCoreEngine.cpp184 const CFGBlock *Succ = *(Entry->succ_begin()); local
188 BlockEdge StartLoc(Entry, Succ, L);
529 ExplodedNode *Succ = G->getNode(Loc, N->getState(), false, &IsNew); local
530 Succ->addPredecessor(N, *G);
533 WList->enqueue(Succ, Block, Idx+1);
624 ExplodedNode *Succ = generateNodeImpl(Loc, State, NodePred); local
625 return Succ;
633 ExplodedNode *Succ = Eng.G->getNode(BlockEdge(Src, I.getBlock(), local
636 Succ->addPredecessor(Pred, *Eng.G);
642 Eng.WList->enqueue(Succ);
653 ExplodedNode *Succ = Eng.G->getNode(BlockEdge(Src, I.getBlock(), local
678 ExplodedNode *Succ = Eng.G->getNode(BlockEdge(Src, DefaultBlock, local
[all...]
H A DBugReporterVisitors.cpp258 PathDiagnosticPiece *FindLastStoreBRVisitor::VisitNode(const ExplodedNode *Succ, argument
281 // Otherwise, check that Succ has this binding and Pred does not, i.e. this is
284 if (Succ->getState()->getSVal(R) != V)
289 StoreSite = Succ;
293 if (const PostStmt *P = Succ->getLocationAs<PostStmt>())
/external/llvm/include/llvm/Transforms/Utils/
H A DBasicBlockUtils.h85 unsigned GetSuccessorNumber(BasicBlock *BB, BasicBlock *Succ);
127 inline bool SplitCriticalEdge(BasicBlock *Succ, pred_iterator PI, Pass *P = 0) { argument
131 if (TI->getSuccessor(i) == Succ)
/external/llvm/lib/CodeGen/
H A DMachineBasicBlock.cpp539 MachineBasicBlock *Succ = *fromMBB->succ_begin(); local
546 addSuccessor(Succ, Weight);
547 fromMBB->removeSuccessor(Succ);
557 MachineBasicBlock *Succ = *fromMBB->succ_begin(); local
561 addSuccessor(Succ, Weight);
562 fromMBB->removeSuccessor(Succ);
565 for (MachineBasicBlock::instr_iterator MI = Succ->instr_begin(),
566 ME = Succ->instr_end(); MI != ME && MI->isPHI(); ++MI)
631 MachineBasicBlock::SplitCriticalEdge(MachineBasicBlock *Succ, Pass *P) { argument
634 if (Succ
[all...]
H A DMachineTraceMetrics.cpp150 if (!TBI->Succ) {
157 TraceBlockInfo *SuccTBI = &BlockInfo[TBI->Succ->getNumber()];
257 const MachineBasicBlock *Succ = *I; local
259 if (CurLoop && Succ == CurLoop->getHeader())
262 if (isExitingLoop(CurLoop, getLoopFor(Succ)))
265 getHeightResources(Succ);
272 Best = Succ, BestHeight = Height;
400 TBI.Succ = pickTraceSucc(*I);
402 if (TBI.Succ)
403 dbgs() << "BB#" << TBI.Succ
[all...]
H A DMachineTraceMetrics.h132 const MachineBasicBlock *Succ; member in struct:llvm::MachineTraceMetrics::TraceBlockInfo
149 Pred(0), Succ(0),
H A DIfConversion.cpp1522 MachineBasicBlock *Succ = Succs[i]; local
1524 if (Succ == FallThrough)
1526 ToBBI.BB->addSuccessor(Succ);
1555 MachineBasicBlock *Succ = Succs[i]; local
1557 if (Succ == FallThrough)
1559 FromBBI.BB->removeSuccessor(Succ);
1561 ToBBI.BB->addSuccessor(Succ);
/external/llvm/lib/Transforms/Instrumentation/
H A DOptimalEdgeProfiling.cpp183 BasicBlock *Succ = TI->getSuccessor(s); local
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;
/external/llvm/lib/Transforms/Utils/
H A DLocal.cpp154 BasicBlock *Succ = SI->getSuccessor(i); local
155 if (Succ == TheOnlyDest)
158 Succ->removePredecessor(BB);
494 /// almost-empty BB ending in an unconditional branch to Succ, into succ.
496 /// Assumption: Succ is the single successor for BB.
498 static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) { argument
499 assert(*succ_begin(BB) == Succ && "Succ is not successor of BB!");
502 << Succ->getName() << "\n");
505 if (Succ
561 BasicBlock *Succ = cast<BranchInst>(BB->getTerminator())->getSuccessor(0); local
[all...]
H A DBasicBlockUtils.cpp242 unsigned llvm::GetSuccessorNumber(BasicBlock *BB, BasicBlock *Succ) { argument
249 if (Term->getSuccessor(i) == Succ)
256 BasicBlock *llvm::SplitEdge(BasicBlock *BB, BasicBlock *Succ, Pass *P) { argument
257 unsigned SuccNum = GetSuccessorNumber(BB, Succ);
264 // If the edge isn't critical, then BB has a single successor or Succ has a
267 if (BasicBlock *SP = Succ->getSinglePredecessor()) {
272 return SplitBlock(Succ, Succ->begin(), P);
H A DLowerSwitch.cpp201 BasicBlock* Succ = Leaf.BB; local
202 BranchInst::Create(Succ, Default, Comp, NewLeaf);
206 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
H A DSimplifyCFG.cpp168 /// AddPredecessorToBlock - Update PHI nodes in Succ to indicate that there will
171 /// ExistPred, an existing predecessor of Succ.
172 static void AddPredecessorToBlock(BasicBlock *Succ, BasicBlock *NewPred, argument
174 if (!isa<PHINode>(Succ->begin())) return; // Quick exit if nothing to do
177 for (BasicBlock::iterator I = Succ->begin();
549 BasicBlock *Succ = BI->getSuccessor(ICI->getPredicate() == ICmpInst::ICMP_NE); local
552 Succ));
2272 BasicBlock *Succ = OldTerm->getSuccessor(I); local
2274 if (Succ == KeepEdge1)
2276 else if (Succ
3250 BasicBlock *Succ = SI->getSuccessor(i); local
[all...]
/external/clang/lib/Analysis/
H A DCFG.cpp258 CFGBlock *Succ; member in class:__anon3537::CFGBuilder
300 Block(NULL), Succ(NULL),
607 Succ = createBlock();
608 assert(Succ == &cfg->getExit());
632 Succ = B;
678 if (add_successor && Succ)
679 addSuccessor(B, Succ);
1418 Succ = Block;
1449 Succ = ConfluenceBlock;
1455 Succ
[all...]
H A DUninitializedValues.cpp543 const CFGBlock *Succ = *I; local
544 if (Succ && SuccsVisited[Succ->getBlockID()] >= Succ->succ_size() &&
545 vals.getValue(Block, Succ, vd) == Uninitialized) {
551 const Stmt *Label = Succ->getLabel();
/external/llvm/include/llvm/Analysis/
H A DDominatorInternals.h93 typename GraphT::NodeType* Succ = *NextSucc; local
96 DT.Info[Succ];
99 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ)));
H A DBlockFrequencyImpl.h328 BlockT *Succ = *SI; local
329 OS << " " << getBlockName(BB) << " -> " << getBlockName(Succ)
330 << " = " << getEdgeFreq(BB, Succ) << "\n";
/external/llvm/lib/Analysis/
H A DProfileInfo.cpp250 succ_const_iterator Succ = succ_begin(BB), End = succ_end(BB); local
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...]
H A DBranchProbabilityInfo.cpp467 BasicBlock *Succ = *I; local
468 uint32_t Weight = getEdgeWeight(BB, Succ);
476 MaxSucc = Succ;
/external/llvm/lib/VMCore/
H A DBasicBlock.cpp344 BasicBlock *Succ = TI->getSuccessor(i); local
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/include/llvm/Support/
H A DIntegersSubsetMapping.h398 void detachCase(self& NewMapping, SuccessorClass *Succ) { argument
400 if (i->second == Succ) {
408 void removeCase(SuccessorClass *Succ) { argument
410 if (i->second == Succ) {
550 const IntTy* getCaseSingleNumber(SuccessorClass *Succ) { argument
553 if (i->second == Succ) {
/external/llvm/tools/llvm-prof/
H A Dllvm-prof.cpp109 BasicBlock* Succ = TI->getSuccessor(s); local
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/llvm/lib/Transforms/Scalar/
H A DLoopUnswitch.cpp1230 BasicBlock *Succ = BI->getSuccessor(0); local
1231 BasicBlock *SinglePred = Succ->getSinglePredecessor();
1236 << Succ->getName() << "\n");
1238 // Resolve any single entry PHI nodes in Succ.
1239 while (PHINode *PN = dyn_cast<PHINode>(Succ->begin()))
1242 // If Succ has any successors with PHI nodes, update them to have
1243 // entries coming from Pred instead of Succ.
1244 Succ->replaceAllUsesWith(Pred);
1246 // Move all of the successor contents from Succ to Pred.
1247 Pred->getInstList().splice(BI, Succ
[all...]
/external/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp703 SUnit &Succ = *I->getSUnit(); local
704 if (!Succ.isScheduled) {
707 if (OnlyAvailableSucc && OnlyAvailableSucc != &Succ)
709 OnlyAvailableSucc = &Succ;

Completed in 495 milliseconds

12