| /external/llvm/include/llvm/Transforms/Utils/ |
| 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();
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();
147 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
148 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) {
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopDeletion.cpp | 185 TerminatorInst* TI = preheader->getTerminator();
186 TI->replaceUsesOfWith(L->getHeader(), exitBlock);
|
| LoopRotation.cpp | 374 TerminatorInst *TI = OrigHeader->getTerminator();
375 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
376 for (BasicBlock::iterator BI = TI->getSuccessor(i)->begin();
|
| /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++;
|
| ProfileDataLoaderPass.cpp | 119 TerminatorInst *TI = BB->getTerminator();
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();
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);
|
| 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...] |
| BranchProbabilityInfo.cpp | 111 TerminatorInst *TI = BB->getTerminator();
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();
162 if (TI->getNumSuccessors() == 1)
164 if (!isa<BranchInst>(TI) && !isa<SwitchInst>(TI))
167 MDNode *WeightsNode = TI->getMetadata(LLVMContext::MD_prof)
[all...] |
| InlineCost.cpp | [all...] |
| /external/llvm/lib/Support/ |
| Threading.cpp | 74 ThreadInfo *TI = reinterpret_cast<ThreadInfo*>(Arg);
75 TI->UserFn(TI->UserData);
|
| /external/llvm/lib/VMCore/ |
| Dominators.cpp | 43 const TerminatorInst *TI = Start->getTerminator();
45 for (unsigned int i = 0, n = TI->getNumSuccessors(); i < n; ++i) {
46 if (TI->getSuccessor(i) == End)
|
| 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/unittests/VMCore/ |
| IRBuilderTest.cpp | 82 TerminatorInst *TI = BB->getTerminator();
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->getSuccessor(1))
[all...] |
| /external/llvm/lib/CodeGen/ |
| DwarfEHPrepare.cpp | 114 TerminatorInst *TI = I->getTerminator();
115 if (ResumeInst *RI = dyn_cast<ResumeInst>(TI))
117 else if (InvokeInst *II = dyn_cast<InvokeInst>(TI))
|
| ShadowStackGC.cpp | 118 TerminatorInst *TI = CurBB->getTerminator();
119 if (!isa<ReturnInst>(TI) && !isa<ResumeInst>(TI))
122 Builder.SetInsertPoint(TI->getParent(), TI);
|
| /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 | 342 const TerminatorInst *TI = BB->getTerminator();
343 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
344 ToClone.push_back(TI->getSuccessor(i));
|
| CodeExtractor.cpp | 236 TerminatorInst *TI = PN->getIncomingBlock(i)->getTerminator();
237 TI->replaceUsesOfWith(OldPred, NewBB);
364 TerminatorInst *TI = newFunction->begin()->getTerminator();
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 = (*i)->getTerminator()
[all...] |
| LoopSimplify.cpp | 173 TerminatorInst *TI = (*I)->getTerminator();
174 TI->replaceAllUsesWith(UndefValue::get(TI->getType()));
739 TerminatorInst *TI = BackedgeBlocks[i]->getTerminator();
740 for (unsigned Op = 0, e = TI->getNumSuccessors(); Op != e; ++Op)
741 if (TI->getSuccessor(Op) == Header)
742 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 | 274 const TargetInfo &TI = PP.getTargetInfo();
277 NumBits = TI.getIntWidth();
279 NumBits = TI.getWCharWidth();
281 NumBits = TI.getChar16Width();
283 NumBits = TI.getChar32Width();
285 NumBits = TI.getCharWidth();
|
| /external/llvm/lib/Target/ |
| TargetData.cpp | 604 TI = gep_type_begin(ptrTy, Indices);
606 ++CurIDX, ++TI) {
607 if (StructType *STy = dyn_cast<StructType>(*TI)) {
|
| /external/llvm/include/llvm/ADT/ |
| ImmutableSet.h | 444 typename TreeTy::iterator& TI,
447 for ( ; I!=E ; ++I, ++TI) {
448 if (TI == TE || !I->isElementEqual(*TI))
625 typename TreeTy::iterator TI = T->begin(), TE = T->end();
626 if (!compareTreeWithSection(TNew, TI, TE))
628 if (TI != TE)
[all...] |
