/external/llvm/include/llvm/Transforms/Utils/ |
BasicBlockUtils.h | 90 bool isCriticalEdge(const TerminatorInst *TI, unsigned SuccNum, 99 /// If MergeIdenticalEdges is true (not the default), *all* edges from TI to the 111 BasicBlock *SplitCriticalEdge(TerminatorInst *TI, unsigned SuccNum, 127 TerminatorInst *TI = (*PI)->getTerminator(); 128 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) 129 if (TI->getSuccessor(i) == Succ) 130 MadeChange |= !!SplitCriticalEdge(TI, i, P); 142 TerminatorInst *TI = Src->getTerminator(); 145 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!"); 146 if (TI->getSuccessor(i) == Dst [all...] |
/external/llvm/lib/Transforms/Instrumentation/ |
EdgeProfiling.cpp | 94 TerminatorInst *TI = BB->getTerminator(); 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);
|
OptimalEdgeProfiling.cpp | 171 TerminatorInst *TI = BB->getTerminator(); 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) {
|
GCOVProfiling.cpp | 383 TerminatorInst *TI = BB->getTerminator(); 384 if (int successors = TI->getNumSuccessors()) { 386 Block.addEdge(Func.getBlock(TI->getSuccessor(i))); 388 } else if (isa<ReturnInst>(TI)) { 435 TerminatorInst *TI = BB->getTerminator(); 436 if (isa<ReturnInst>(TI)) 439 Edges += TI->getNumSuccessors(); 456 TerminatorInst *TI = BB->getTerminator(); 457 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors() [all...] |
/external/llvm/lib/Transforms/Scalar/ |
LoopDeletion.cpp | 185 TerminatorInst* TI = preheader->getTerminator(); 186 TI->replaceUsesOfWith(L->getHeader(), exitBlock);
|
LoopRotation.cpp | 271 TerminatorInst *TI = OrigHeader->getTerminator(); 272 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) 273 for (BasicBlock::iterator BI = TI->getSuccessor(i)->begin();
|
LoopUnswitch.cpp | 240 TerminatorInst *TI = (*I)->getTerminator(); 241 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { 255 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) { [all...] |
/external/llvm/lib/Analysis/ |
PathProfileVerifier.cpp | 91 TerminatorInst *TI = BB->getTerminator(); 95 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; 96 prev = TI->getSuccessor(s), ++s) { 97 if (prev == TI->getSuccessor(s)) 101 arrayMap[BB][TI->getSuccessor(s)][duplicate] = i++;
|
ProfileInfoLoaderPass.cpp | 166 TerminatorInst *TI = BB->getTerminator(); 167 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) { 168 readEdge(getEdge(BB,TI->getSuccessor(s)), Counters); 187 TerminatorInst *TI = BB->getTerminator(); 188 if (TI->getNumSuccessors() == 0) { 191 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) { 192 readEdge(getEdge(BB,TI->getSuccessor(s)), Counters);
|
SparsePropagation.cpp | 120 void SparseSolver::getFeasibleSuccessors(TerminatorInst &TI, 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 = From->getTerminator() [all...] |
InlineCost.cpp | 154 const TerminatorInst &TI = cast<TerminatorInst>(*U); 155 const unsigned NumSucc = TI.getNumSuccessors(); 158 Instrs += NumBBInsts[TI.getSuccessor(I)];
|
BranchProbabilityInfo.cpp | 91 TerminatorInst *TI = BB->getTerminator(); 92 if (isa<ReturnInst>(TI)) 95 if (TI->getNumSuccessors() > 1) 99 if (TI->getNumSuccessors() == 0) 103 BB = TI->getSuccessor(0); 144 TerminatorInst *TI = BB->getTerminator(); 145 if (TI->getNumSuccessors() == 1) 147 if (!isa<BranchInst>(TI) && !isa<SwitchInst>(TI)) 150 MDNode *WeightsNode = TI->getMetadata(LLVMContext::MD_prof) [all...] |
/external/llvm/lib/Support/ |
Threading.cpp | 74 ThreadInfo *TI = reinterpret_cast<ThreadInfo*>(Arg); 75 TI->UserFn(TI->UserData);
|
/external/llvm/lib/Transforms/Utils/ |
BreakCriticalEdges.cpp | 71 TerminatorInst *TI = I->getTerminator(); 72 if (TI->getNumSuccessors() > 1 && !isa<IndirectBrInst>(TI)) 73 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) 74 if (SplitCriticalEdge(TI, i, this)) { 91 bool llvm::isCriticalEdge(const TerminatorInst *TI, unsigned SuccNum, 93 assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!"); 94 if (TI->getNumSuccessors() == 1) return false; 96 const BasicBlock *Dest = TI->getSuccessor(SuccNum); 102 ++I; // Skip one edge due to the incoming arc from TI [all...] |
CloneFunction.cpp | 299 const TerminatorInst *TI = BB->getTerminator(); 300 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) 301 ToClone.push_back(TI->getSuccessor(i));
|
CodeExtractor.cpp | 156 TerminatorInst *TI = PN->getIncomingBlock(i)->getTerminator(); 157 TI->replaceUsesOfWith(OldPred, NewBB); 231 TerminatorInst *TI = BB->getTerminator(); 232 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) 233 if (!BlocksToExtract.count(TI->getSuccessor(i))) 234 ExitBlocks.insert(TI->getSuccessor(i)); 318 TerminatorInst *TI = newFunction->begin()->getTerminator(); 320 GetElementPtrInst::Create(AI, Idx, "gep_" + inputs[i]->getName(), TI); 321 RewriteVal = new LoadInst(GEP, "loadgep_" + inputs[i]->getName(), TI); 349 if (TerminatorInst *TI = dyn_cast<TerminatorInst>(Users[i]) [all...] |
LoopSimplify.cpp | 172 TerminatorInst *TI = (*I)->getTerminator(); 173 TI->replaceAllUsesWith(UndefValue::get(TI->getType())); 722 TerminatorInst *TI = BackedgeBlocks[i]->getTerminator(); 723 for (unsigned Op = 0, e = TI->getNumSuccessors(); Op != e; ++Op) 724 if (TI->getSuccessor(Op) == Header) 725 TI->setSuccessor(Op, BEBlock);
|
/external/llvm/tools/llvm-prof/ |
llvm-prof.cpp | 107 const TerminatorInst *TI = BB->getTerminator(); 108 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) { 109 BasicBlock* Succ = TI->getSuccessor(s);
|
/external/clang/lib/Lex/ |
PPExpressions.cpp | 266 const TargetInfo &TI = PP.getTargetInfo(); 269 NumBits = TI.getIntWidth(); 271 NumBits = TI.getWCharWidth(); 273 NumBits = TI.getChar16Width(); 275 NumBits = TI.getChar32Width(); 277 NumBits = TI.getCharWidth();
|
/external/llvm/lib/Target/ |
TargetData.cpp | 539 TI = gep_type_begin(ptrTy, Indices); 541 ++CurIDX, ++TI) { 542 if (StructType *STy = dyn_cast<StructType>(*TI)) {
|
/external/llvm/lib/VMCore/ |
BasicBlock.cpp | 338 TerminatorInst *TI = getTerminator(); 339 if (!TI) 343 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) { 344 BasicBlock *Succ = TI->getSuccessor(i);
|
/external/llvm/lib/CodeGen/ |
DwarfEHPrepare.cpp | 370 TerminatorInst *TI = I->getTerminator(); 371 if (!isa<InvokeInst>(TI)) 373 BasicBlock *LPad = TI->getSuccessor(1); 669 TerminatorInst *TI = I->getTerminator(); 670 if (ResumeInst *RI = dyn_cast<ResumeInst>(TI)) 672 else if (InvokeInst *II = dyn_cast<InvokeInst>(TI))
|
ShadowStackGC.cpp | 118 TerminatorInst *TI = CurBB->getTerminator(); 119 if (!isa<UnwindInst>(TI) && !isa<ReturnInst>(TI) && 120 !isa<ResumeInst>(TI)) 123 Builder.SetInsertPoint(TI->getParent(), TI);
|
/external/llvm/include/llvm/ADT/ |
ImmutableSet.h | 438 typename TreeTy::iterator& TI, 441 for ( ; I!=E ; ++I, ++TI) { 442 if (TI == TE || !I->isElementEqual(*TI)) 619 typename TreeTy::iterator TI = T->begin(), TE = T->end(); 620 if (!compareTreeWithSection(TNew, TI, TE)) 622 if (TI != TE) [all...] |
/external/llvm/include/llvm/TableGen/ |
Record.h | 106 virtual Init *convertValue( TypedInit *TI) { return 0; } 154 virtual Init *convertValue( TypedInit *TI); 199 virtual Init *convertValue( TypedInit *TI); 243 virtual Init *convertValue( TypedInit *TI); 286 virtual Init *convertValue( TypedInit *TI); 332 virtual Init *convertValue( TypedInit *TI); 375 virtual Init *convertValue( TypedInit *TI); 415 virtual Init *convertValue( TypedInit *TI); [all...] |