/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/Transforms/Utils/ |
H A D | BasicBlockUtils.h | 91 bool isCriticalEdge(const TerminatorInst *TI, unsigned SuccNum, 100 /// If MergeIdenticalEdges is true (not the default), *all* edges from TI to the 112 BasicBlock *SplitCriticalEdge(TerminatorInst *TI, unsigned SuccNum, 129 TerminatorInst *TI = (*PI)->getTerminator(); local 130 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) 131 if (TI->getSuccessor(i) == Succ) 132 MadeChange |= !!SplitCriticalEdge(TI, i, P); 144 TerminatorInst *TI = Src->getTerminator(); local 147 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!"); 148 if (TI [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/unittests/VMCore/ |
H A D | IRBuilderTest.cpp | 82 TerminatorInst *TI = BB->getTerminator(); local 83 EXPECT_EQ(BI, TI); 84 EXPECT_EQ(2u, TI->getNumSuccessors()); 85 EXPECT_EQ(TBB, TI->getSuccessor(0)); 86 EXPECT_EQ(FBB, TI->getSuccessor(1)); 91 TI = BB->getTerminator(); 92 EXPECT_EQ(BI, TI); 93 EXPECT_EQ(2u, TI->getNumSuccessors()); 94 EXPECT_EQ(TBB, TI->getSuccessor(0)); 95 EXPECT_EQ(FBB, TI [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/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) {
|
H A D | GCOVProfiling.cpp | 391 TerminatorInst *TI = BB->getTerminator(); local 392 if (int successors = TI->getNumSuccessors()) { 394 Block.addEdge(Func.getBlock(TI->getSuccessor(i))); 396 } else if (isa<ReturnInst>(TI)) { 438 TerminatorInst *TI = BB->getTerminator(); local 439 if (isa<ReturnInst>(TI)) 442 Edges += TI->getNumSuccessors(); 459 TerminatorInst *TI = BB->getTerminator(); local 460 int Successors = isa<ReturnInst>(TI) ? 1 : TI 554 TerminatorInst *TI = BB->getTerminator(); local [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Utils/ |
H A D | BreakCriticalEdges.cpp | 71 TerminatorInst *TI = I->getTerminator(); local 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, argument 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 174 SplitCriticalEdge(TerminatorInst *TI, unsigned SuccNum, Pass *P, bool MergeIdenticalEdges, bool DontDeleteUselessPhis, bool SplitLandingPads) argument [all...] |
H A D | CodeExtractor.cpp | 236 TerminatorInst *TI = PN->getIncomingBlock(i)->getTerminator(); local 237 TI->replaceUsesOfWith(OldPred, NewBB); 364 TerminatorInst *TI = newFunction->begin()->getTerminator(); local 366 GetElementPtrInst::Create(AI, Idx, "gep_" + inputs[i]->getName(), TI); 367 RewriteVal = new LoadInst(GEP, "loadgep_" + inputs[i]->getName(), TI); 395 if (TerminatorInst *TI = dyn_cast<TerminatorInst>(Users[i])) 396 if (!Blocks.count(TI->getParent()) && 397 TI->getParent()->getParent() == oldFunction) 398 TI->replaceUsesOfWith(header, newHeader); 527 TerminatorInst *TI local [all...] |
H A D | SimplifyCFG.cpp | 84 Value *isValueEqualityComparison(TerminatorInst *TI); 85 BasicBlock *GetValueEqualityComparisonCases(TerminatorInst *TI, 87 bool SimplifyEqualityComparisonWithOnlyPredecessor(TerminatorInst *TI, 90 bool FoldValueComparisonIntoPredecessors(TerminatorInst *TI, 499 static void EraseTerminatorInstAndDCECond(TerminatorInst *TI) { argument 501 if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) { 503 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { 506 } else if (IndirectBrInst *IBI = dyn_cast<IndirectBrInst>(TI)) { 510 TI->eraseFromParent(); 516 Value *SimplifyCFGOpt::isValueEqualityComparison(TerminatorInst *TI) { argument 542 GetValueEqualityComparisonCases(TerminatorInst *TI, std::vector<ValueEqualityComparisonCase> &Cases) argument 616 SimplifyEqualityComparisonWithOnlyPredecessor(TerminatorInst *TI, BasicBlock *Pred, IRBuilder<> &Builder) argument 783 GetBranchWeights(TerminatorInst *TI, SmallVectorImpl<uint64_t> &Weights) argument 825 FoldValueComparisonIntoPredecessors(TerminatorInst *TI, IRBuilder<> &Builder) argument 2890 TerminatorInst *TI = Preds[i]->getTerminator(); local [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/lib/Analysis/ |
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 | 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 | BranchProbabilityInfo.cpp | 111 TerminatorInst *TI = BB->getTerminator(); local 112 if (TI->getNumSuccessors() == 0) { 113 if (isa<UnreachableInst>(TI)) 130 if (UnreachableEdges.size() == TI->getNumSuccessors()) 135 if (TI->getNumSuccessors() == 1 || UnreachableEdges.empty()) 161 TerminatorInst *TI = BB->getTerminator(); local 162 if (TI->getNumSuccessors() == 1) 164 if (!isa<BranchInst>(TI) && !isa<SwitchInst>(TI)) 167 MDNode *WeightsNode = TI [all...] |
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 | PathProfileVerifier.cpp | 91 TerminatorInst *TI = BB->getTerminator(); local 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++;
|
/macosx-10.9.5/llvmCore-3425.0.33/lib/Support/ |
H A D | Threading.cpp | 74 ThreadInfo *TI = reinterpret_cast<ThreadInfo*>(Arg); local 75 TI->UserFn(TI->UserData);
|
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/ |
H A D | PassRegistry.h | 48 const PassInfo *getPassInfo(const void *TI) const;
|
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/InstCombine/ |
H A D | InstCombineSelect.cpp | 122 /// FoldSelectOpOp - Here we have (select c, TI, FI), and we know that TI and FI 124 Instruction *InstCombiner::FoldSelectOpOp(SelectInst &SI, Instruction *TI, argument 126 if (TI->getNumOperands() == 1) { 129 if (TI->isCast()) { 130 if (TI->getOperand(0)->getType() != FI->getOperand(0)->getType()) 143 Value *NewSI = Builder->CreateSelect(SI.getCondition(), TI->getOperand(0), 145 return CastInst::Create(Instruction::CastOps(TI->getOpcode()), NewSI, 146 TI->getType()); 150 if (!isa<BinaryOperator>(TI)) [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Scalar/ |
H A D | SCCP.cpp | 449 void getFeasibleSuccessors(TerminatorInst &TI, SmallVector<bool, 16> &Succs); 475 void visitTerminatorInst(TerminatorInst &TI); 522 void SCCPSolver::getFeasibleSuccessors(TerminatorInst &TI, argument 524 Succs.resize(TI.getNumSuccessors()); 525 if (BranchInst *BI = dyn_cast<BranchInst>(&TI)) { 546 if (isa<InvokeInst>(TI)) { 552 if (SwitchInst *SI = dyn_cast<SwitchInst>(&TI)) { 563 Succs.assign(TI.getNumSuccessors(), true); 572 if (isa<IndirectBrInst>(&TI)) { 574 Succs.assign(TI 743 visitTerminatorInst(TerminatorInst &TI) argument 1460 TerminatorInst *TI = BB->getTerminator(); local 1794 TerminatorInst *TI = BB->getTerminator(); local 1874 TerminatorInst *TI = I->getParent()->getTerminator(); local [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/lib/CodeGen/ |
H A D | DwarfEHPrepare.cpp | 114 TerminatorInst *TI = I->getTerminator(); local 115 if (ResumeInst *RI = dyn_cast<ResumeInst>(TI)) 117 else if (InvokeInst *II = dyn_cast<InvokeInst>(TI))
|
H A D | ShadowStackGC.cpp | 118 TerminatorInst *TI = CurBB->getTerminator(); local 119 if (!isa<ReturnInst>(TI) && !isa<ResumeInst>(TI)) 122 Builder.SetInsertPoint(TI->getParent(), TI);
|
/macosx-10.9.5/groff-38/groff/font/devdvi/ |
H A D | TI | 4 name TI
|
/macosx-10.9.5/llvmCore-3425.0.33/lib/VMCore/ |
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 | 184 const PassInfo *Pass::lookupPassInfo(const void *TI) { argument 185 return PassRegistry::getPassRegistry()->getPassInfo(TI);
|
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)
|
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/Analysis/ |
H A D | SparsePropagation.h | 195 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs, 200 void visitTerminatorInst(TerminatorInst &TI);
|
/macosx-10.9.5/llvmCore-3425.0.33/utils/TableGen/ |
H A D | SubtargetEmitter.cpp | 1229 TI = SC.Transitions.begin(), TE = SC.Transitions.end(); 1230 TI != TE; ++TI) { 1232 std::set_union(TI->ProcIndices.begin(), TI->ProcIndices.end(), 1245 TI = SC.Transitions.begin(), TE = SC.Transitions.end(); 1246 TI != TE; ++TI) { 1248 if (*PI != 0 && !std::count(TI->ProcIndices.begin(), 1249 TI [all...] |