Searched refs:Succ (Results 1 - 25 of 31) 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/llvm/lib/CodeGen/
H A DMachineBranchProbabilityInfo.cpp35 MachineBasicBlock *Succ = *I; local
36 uint32_t Weight = getEdgeWeight(MBB, Succ);
74 MachineBasicBlock *Succ = *I; local
75 uint32_t Weight = getEdgeWeight(MBB, Succ);
83 MaxSucc = Succ;
H A DMachineBasicBlock.cpp414 MachineBasicBlock *Succ = *fromMBB->succ_begin(); local
422 addSuccessor(Succ, weight);
423 fromMBB->removeSuccessor(Succ);
433 MachineBasicBlock *Succ = *fromMBB->succ_begin(); local
434 addSuccessor(Succ);
435 fromMBB->removeSuccessor(Succ);
438 for (MachineBasicBlock::iterator MI = Succ->begin(), ME = Succ->end();
504 MachineBasicBlock::SplitCriticalEdge(MachineBasicBlock *Succ, Pass *P) { argument
531 << " -- BB#" << Succ
[all...]
H A DIfConversion.cpp1433 MachineBasicBlock *Succ = Succs[i]; local
1435 if (Succ == FallThrough)
1437 ToBBI.BB->addSuccessor(Succ);
1466 MachineBasicBlock *Succ = Succs[i]; local
1468 if (Succ == FallThrough)
1470 FromBBI.BB->removeSuccessor(Succ);
1472 ToBBI.BB->addSuccessor(Succ);
H A DSjLjEHPrepare.cpp169 BasicBlock *Succ = *succ_begin(LPad); local
171 LPad->getParent(), Succ);
174 BranchInst::Create(Succ, JumpTo);
177 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
/external/llvm/lib/Analysis/
H A DBranchProbabilityInfo.cpp189 BasicBlock *Succ = *I; local
190 if (isReturningBlock(Succ))
191 ReturningEdges.insert(Succ);
193 StayEdges.insert(Succ);
270 BasicBlock *Succ = *I; local
271 Loop *SuccL = LI->getLoopFor(Succ);
273 ExitingEdges.insert(Succ);
274 else if (Succ == L->getHeader())
275 BackEdges.insert(Succ);
277 InEdges.insert(Succ);
420 const BasicBlock *Succ = *I; local
448 BasicBlock *Succ = *I; local
[all...]
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...]
/external/llvm/include/llvm/Transforms/Utils/
H A DBasicBlockUtils.h84 unsigned GetSuccessorNumber(BasicBlock *BB, BasicBlock *Succ);
125 inline bool SplitCriticalEdge(BasicBlock *Succ, pred_iterator PI, Pass *P = 0) { argument
129 if (TI->getSuccessor(i) == 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;
H A DGCOVProfiling.cpp548 BasicBlock *Succ = TI->getSuccessor(i); local
549 IRBuilder<> builder(Succ);
552 EdgeTable[((Succs.idFor(Succ)-1) * Preds.size()) +
/external/llvm/lib/Transforms/Utils/
H A DLocal.cpp153 BasicBlock *Succ = SI->getSuccessor(i); local
154 if (Succ == TheOnlyDest)
157 Succ->removePredecessor(BB);
475 /// almost-empty BB ending in an unconditional branch to Succ, into succ.
477 /// Assumption: Succ is the single successor for BB.
479 static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) { argument
480 assert(*succ_begin(BB) == Succ && "Succ is not successor of BB!");
483 << Succ->getName() << "\n");
486 if (Succ
556 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)
257 BasicBlock *llvm::SplitEdge(BasicBlock *BB, BasicBlock *Succ, Pass *P) { argument
258 unsigned SuccNum = GetSuccessorNumber(BB, Succ);
265 // If the edge isn't critical, then BB has a single successor or Succ has a
268 if (BasicBlock *SP = Succ->getSinglePredecessor()) {
273 return SplitBlock(Succ, Succ->begin(), P);
H A DLowerSwitch.cpp213 BasicBlock* Succ = Leaf.BB; local
214 BranchInst::Create(Succ, Default, Comp, NewLeaf);
218 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
/external/clang/lib/StaticAnalyzer/Core/
H A DCoreEngine.cpp169 const CFGBlock *Succ = *(Entry->succ_begin()); local
173 BlockEdge StartLoc(Entry, Succ, L);
550 ExplodedNode *Succ = C.Eng.G->getNode(Loc, N->State, &IsNew); local
551 Succ->addPredecessor(N, *C.Eng.G);
554 C.Eng.WList->enqueue(Succ, C.Block, Idx+1);
578 ExplodedNode *Succ = generateNodeImpl(Loc, State, NodePred); local
579 return Succ;
588 ExplodedNode *Succ = Eng.G->getNode(BlockEdge(Src, I.getBlock(), local
591 Succ->addPredecessor(Pred, *Eng.G);
596 Succ
612 ExplodedNode *Succ = Eng.G->getNode(BlockEdge(Src, I.getBlock(), local
638 ExplodedNode *Succ = Eng.G->getNode(BlockEdge(Src, DefaultBlock, local
[all...]
H A DBugReporter.cpp1772 const ExplodedNode *Succ = *WI.I; local
1774 if (Succ->succ_empty()) {
1776 if (!Succ->isSink()) {
1788 unsigned &mark = Visited[Succ];
1791 WL.push_back(Succ);
/external/clang/lib/Analysis/
H A DCFG.cpp256 CFGBlock *Succ; member in class:__anon2771::CFGBuilder
293 Block(NULL), Succ(NULL),
517 Succ = createBlock();
518 assert(Succ == &cfg->getExit());
542 Succ = B;
588 if (add_successor && Succ)
589 addSuccessor(B, Succ);
1058 Succ = ConfluenceBlock;
1202 Succ = Block;
1233 Succ
[all...]
/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.h327 BlockT *Succ = *SI; local
328 OS << " " << getBlockName(BB) << " -> " << getBlockName(Succ)
329 << " = " << getEdgeFreq(BB, Succ) << "\n";
/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/lib/Transforms/Scalar/
H A DLoopUnswitch.cpp1032 BasicBlock *Succ = BI->getSuccessor(0); local
1033 BasicBlock *SinglePred = Succ->getSinglePredecessor();
1038 << Succ->getName() << "\n");
1040 // Resolve any single entry PHI nodes in Succ.
1041 while (PHINode *PN = dyn_cast<PHINode>(Succ->begin()))
1044 // If Succ has any successors with PHI nodes, update them to have
1045 // entries coming from Pred instead of Succ.
1046 Succ->replaceAllUsesWith(Pred);
1048 // Move all of the successor contents from Succ to Pred.
1049 Pred->getInstList().splice(BI, Succ
[all...]
/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/Target/ARM/
H A DARMConstantIslandPass.cpp751 MachineBasicBlock *Succ = *OrigBB->succ_begin(); local
752 OrigBB->removeSuccessor(Succ);
753 NewBB->addSuccessor(Succ);
757 assert((Succ->empty() || !Succ->begin()->isPHI())
926 MachineBasicBlock *Succ = *MBB->succ_begin();
931 return PredMI->getOperand(0).getMBB() == Succ;
/external/v8/src/
H A Dlog.cc95 if (Succ(head_) == tail_) {
99 head_ = Succ(head_);
109 tail_ = Succ(tail_);
123 int Succ(int index) { return (index + 1) % kBufferSize; } function in class:v8::internal::Profiler
/external/llvm/lib/Target/CBackend/
H A DCBackend.cpp2399 BasicBlock* Succ = SI.getSuccessor(i); local
2403 printPHICopiesForSuccessor (SI.getParent(), Succ, 2);
2404 printBranchToBlock(SI.getParent(), Succ, 2);
2405 if (Function::iterator(Succ) == llvm::next(Function::iterator(SI.getParent())))
2452 void CWriter::printBranchToBlock(BasicBlock *CurBB, BasicBlock *Succ, argument
2454 if (isGotoCodeNecessary(CurBB, Succ)) {
2456 writeOperand(Succ);
/external/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h342 MachineBasicBlock *SplitCriticalEdge(MachineBasicBlock *Succ, Pass *P);

Completed in 580 milliseconds

12