/external/llvm/include/llvm/Transforms/Utils/ |
H A D | BasicBlockUtils.h | 79 /// If MergeIdenticalEdges is true (not the default), *all* edges from TI to the 91 BasicBlock *SplitCriticalEdge(TerminatorInst *TI, unsigned SuccNum, 108 TerminatorInst *TI = (*PI)->getTerminator(); local 109 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) 110 if (TI->getSuccessor(i) == Succ) 111 MadeChange |= !!SplitCriticalEdge(TI, i, P); 123 TerminatorInst *TI = Src->getTerminator(); local 126 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!"); 127 if (TI->getSuccessor(i) == Dst) 128 return SplitCriticalEdge(TI, [all...] |
/external/llvm/lib/Transforms/Instrumentation/ |
H A D | EdgeProfiling.cpp | 94 TerminatorInst *TI = BB->getTerminator(); local 95 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) { 97 SplitCriticalEdge(TI, s, this); 102 if (TI->getNumSuccessors() == 1) { 107 IncrementCounterInBlock(TI->getSuccessor(s), i++, Counters);
|
H A D | OptimalEdgeProfiling.cpp | 171 TerminatorInst *TI = BB->getTerminator(); local 172 if (TI->getNumSuccessors() == 0) { 182 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) { 183 BasicBlock *Succ = TI->getSuccessor(s); 188 bool wasInserted = SplitCriticalEdge(TI, s, this); 189 Succ = TI->getSuccessor(s); 196 if (TI->getNumSuccessors() == 1) {
|
/external/llvm/lib/Transforms/Utils/ |
H A D | DemoteRegToStack.cpp | 91 TerminatorInst *TI = &cast<TerminatorInst>(I); local 92 assert (isCriticalEdge(TI, SuccNum) && 94 BasicBlock *BB = SplitCriticalEdge(TI, SuccNum);
|
H A D | BreakCriticalEdges.cpp | 72 TerminatorInst *TI = I->getTerminator(); local 73 if (TI->getNumSuccessors() > 1 && !isa<IndirectBrInst>(TI)) 74 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) 75 if (SplitCriticalEdge(TI, i, this)) { 130 /// If MergeIdenticalEdges is true (not the default), *all* edges from TI to the 142 BasicBlock *llvm::SplitCriticalEdge(TerminatorInst *TI, unsigned SuccNum, argument 146 if (!isCriticalEdge(TI, SuccNum, MergeIdenticalEdges)) return 0; 148 assert(!isa<IndirectBrInst>(TI) && 151 BasicBlock *TIBB = TI [all...] |
H A D | CloneFunction.cpp | 345 const TerminatorInst *TI = BB->getTerminator(); local 346 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) 347 ToClone.push_back(TI->getSuccessor(i));
|
/external/llvm/lib/Analysis/ |
H A D | ProfileDataLoaderPass.cpp | 119 TerminatorInst *TI = BB->getTerminator(); local 120 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) { 121 readEdge(ReadCount++, PB, PB.getEdge(BB,TI->getSuccessor(s)), 140 TerminatorInst *TI = BB->getTerminator(); local 141 unsigned NumSuccessors = TI->getNumSuccessors(); 152 ProfileData::Edge edge = PB.getEdge(BB, TI->getSuccessor(s)); 163 MDBuilder MDB(TI->getContext()); 165 TI->setMetadata(LLVMContext::MD_prof, Node);
|
H A D | PathProfileVerifier.cpp | 90 TerminatorInst *TI = BB->getTerminator(); local 94 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; 95 prev = TI->getSuccessor(s), ++s) { 96 if (prev == TI->getSuccessor(s)) 100 arrayMap[BB][TI->getSuccessor(s)][duplicate] = i++;
|
H A D | ProfileInfoLoaderPass.cpp | 166 TerminatorInst *TI = BB->getTerminator(); local 167 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) { 168 readEdge(getEdge(BB,TI->getSuccessor(s)), Counters); 187 TerminatorInst *TI = BB->getTerminator(); local 188 if (TI->getNumSuccessors() == 0) { 191 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) { 192 readEdge(getEdge(BB,TI->getSuccessor(s)), Counters);
|
H A D | SparsePropagation.cpp | 120 void SparseSolver::getFeasibleSuccessors(TerminatorInst &TI, argument 123 Succs.resize(TI.getNumSuccessors()); 124 if (TI.getNumSuccessors() == 0) return; 126 if (BranchInst *BI = dyn_cast<BranchInst>(&TI)) { 161 if (isa<InvokeInst>(TI)) { 168 if (isa<IndirectBrInst>(TI)) { 173 SwitchInst &SI = cast<SwitchInst>(TI); 183 Succs.assign(TI.getNumSuccessors(), true); 194 Succs.assign(TI.getNumSuccessors(), true); 207 TerminatorInst *TI local 217 visitTerminatorInst(TerminatorInst &TI) argument [all...] |
H A D | CFG.cpp | 88 bool llvm::isCriticalEdge(const TerminatorInst *TI, unsigned SuccNum, argument 90 assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!"); 91 if (TI->getNumSuccessors() == 1) return false; 93 const BasicBlock *Dest = TI->getSuccessor(SuccNum); 99 ++I; // Skip one edge due to the incoming arc from TI. 104 // non-critical iff all preds come from TI's block.
|
/external/llvm/lib/IR/ |
H A D | Dominators.cpp | 43 const TerminatorInst *TI = Start->getTerminator(); local 45 for (unsigned int i = 0, n = TI->getNumSuccessors(); i < n; ++i) { 46 if (TI->getSuccessor(i) == End)
|
H A D | BasicBlock.cpp | 338 TerminatorInst *TI = getTerminator(); local 339 if (!TI) 343 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) { 344 BasicBlock *Succ = TI->getSuccessor(i);
|
H A D | Pass.cpp | 163 const PassInfo *Pass::lookupPassInfo(const void *TI) { argument 164 return PassRegistry::getPassRegistry()->getPassInfo(TI);
|
/external/llvm/lib/Support/ |
H A D | Threading.cpp | 74 ThreadInfo *TI = reinterpret_cast<ThreadInfo*>(Arg); local 75 TI->UserFn(TI->UserData);
|
/external/llvm/lib/Transforms/ObjCARC/ |
H A D | DependencyAnalysis.cpp | 253 const TerminatorInst *TI = cast<TerminatorInst>(&BB->back()); local 254 for (succ_const_iterator SI(TI), SE(TI, false); SI != SE; ++SI) {
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | LoopDeletion.cpp | 187 TerminatorInst *TI = preheader->getTerminator(); local 188 TI->replaceUsesOfWith(L->getHeader(), exitBlock);
|
H A D | LoopRotation.cpp | 401 TerminatorInst *TI = OrigHeader->getTerminator(); local 402 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) 403 for (BasicBlock::iterator BI = TI->getSuccessor(i)->begin();
|
H A D | TailRecursionElimination.cpp | 396 TailCallElim::FindTRECandidate(Instruction *TI, argument 398 BasicBlock *BB = TI->getParent(); 401 if (&BB->front() == TI) // Make sure there is something before the terminator. 407 BasicBlock::iterator BBI = TI; 429 FirstNonDbg(llvm::next(BB->begin())) == TI &&
|
/external/llvm/lib/CodeGen/ |
H A D | DwarfEHPrepare.cpp | 111 TerminatorInst *TI = I->getTerminator(); local 112 if (ResumeInst *RI = dyn_cast<ResumeInst>(TI))
|
/external/llvm/unittests/IR/ |
H A D | IRBuilderTest.cpp | 85 TerminatorInst *TI = BB->getTerminator(); local 86 EXPECT_EQ(BI, TI); 87 EXPECT_EQ(2u, TI->getNumSuccessors()); 88 EXPECT_EQ(TBB, TI->getSuccessor(0)); 89 EXPECT_EQ(FBB, TI->getSuccessor(1)); 94 TI = BB->getTerminator(); 95 EXPECT_EQ(BI, TI); 96 EXPECT_EQ(2u, TI->getNumSuccessors()); 97 EXPECT_EQ(TBB, TI->getSuccessor(0)); 98 EXPECT_EQ(FBB, TI [all...] |
/external/clang/lib/Lex/ |
H A D | PPExpressions.cpp | 292 const TargetInfo &TI = PP.getTargetInfo(); local 295 NumBits = TI.getIntWidth(); 297 NumBits = TI.getWCharWidth(); 299 NumBits = TI.getChar16Width(); 301 NumBits = TI.getChar32Width(); 303 NumBits = TI.getCharWidth();
|
/external/llvm/lib/Target/PowerPC/ |
H A D | PPCCTRLoops.cpp | 451 Instruction *TI = (*I)->getTerminator(); local 452 if (!TI) 455 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
|
/external/llvm/lib/Target/SystemZ/ |
H A D | SystemZLongBranch.cpp | 317 for (SmallVectorImpl<TerminatorInfo>::iterator TI = Terminators.begin(), 318 TE = Terminators.end(); TI != TE; ++TI) 319 if (mustRelaxBranch(*TI, TI->Address)) 327 SmallVector<TerminatorInfo, 16>::iterator TI = Terminators.begin(); local 333 skipTerminator(Position, *TI, true); 334 ++TI; 417 SmallVector<TerminatorInfo, 16>::iterator TI = Terminators.begin(); local 423 assert(Position.Address <= TI [all...] |
/external/llvm/tools/llvm-prof/ |
H A D | llvm-prof.cpp | 107 const TerminatorInst *TI = BB->getTerminator(); local 108 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) { 109 BasicBlock* Succ = TI->getSuccessor(s);
|