| /external/llvm/include/llvm/Transforms/Utils/ |
| 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();
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();
126 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
127 if (TI->getSuccessor(i) == Dst)
128 return SplitCriticalEdge(TI, i, P, MergeIdenticalEdges
[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/Utils/ |
| DemoteRegToStack.cpp | 91 TerminatorInst *TI = &cast<TerminatorInst>(I);
92 assert (isCriticalEdge(TI, SuccNum) &&
94 BasicBlock *BB = SplitCriticalEdge(TI, SuccNum);
|
| BreakCriticalEdges.cpp | 72 TerminatorInst *TI = I->getTerminator();
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,
146 if (!isCriticalEdge(TI, SuccNum, MergeIdenticalEdges)) return 0;
148 assert(!isa<IndirectBrInst>(TI) &&
151 BasicBlock *TIBB = TI->getParent()
[all...] |
| CloneFunction.cpp | 345 const TerminatorInst *TI = BB->getTerminator();
346 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
347 ToClone.push_back(TI->getSuccessor(i));
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| DependencyAnalysis.cpp | 253 const TerminatorInst *TI = cast<TerminatorInst>(&BB->back());
254 for (succ_const_iterator SI(TI), SE(TI, false); SI != SE; ++SI) {
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopDeletion.cpp | 187 TerminatorInst *TI = preheader->getTerminator();
188 TI->replaceUsesOfWith(L->getHeader(), exitBlock);
|
| LoopRotation.cpp | 401 TerminatorInst *TI = OrigHeader->getTerminator();
402 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
403 for (BasicBlock::iterator BI = TI->getSuccessor(i)->begin();
|
| /external/llvm/lib/Analysis/ |
| PathProfileVerifier.cpp | 90 TerminatorInst *TI = BB->getTerminator();
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++;
|
| 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...] |
| LoopInfo.cpp | 249 TerminatorInst *TI = (*I)->getTerminator();
253 for (unsigned i = 0, ie = TI->getNumSuccessors(); i != ie; ++i) {
254 if (TI->getSuccessor(i) == H) {
255 MD = TI->getMetadata(LoopMDName);
286 TerminatorInst *TI = (*I)->getTerminator();
287 for (unsigned i = 0, ie = TI->getNumSuccessors(); i != ie; ++i) {
288 if (TI->getSuccessor(i) == H)
289 TI->setMetadata(LoopMDName, LoopID);
|
| BranchProbabilityInfo.cpp | 125 TerminatorInst *TI = BB->getTerminator();
126 if (TI->getNumSuccessors() == 0) {
127 if (isa<UnreachableInst>(TI))
144 if (UnreachableEdges.size() == TI->getNumSuccessors())
149 if (TI->getNumSuccessors() == 1 || UnreachableEdges.empty())
175 TerminatorInst *TI = BB->getTerminator();
176 if (TI->getNumSuccessors() == 1)
178 if (!isa<BranchInst>(TI) && !isa<SwitchInst>(TI))
181 MDNode *WeightsNode = TI->getMetadata(LLVMContext::MD_prof)
[all...] |
| /external/llvm/lib/IR/ |
| 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/lib/Support/ |
| Threading.cpp | 74 ThreadInfo *TI = reinterpret_cast<ThreadInfo*>(Arg);
75 TI->UserFn(TI->UserData);
|
| /external/llvm/lib/CodeGen/ |
| DwarfEHPrepare.cpp | 111 TerminatorInst *TI = I->getTerminator();
112 if (ResumeInst *RI = dyn_cast<ResumeInst>(TI))
|
| ShadowStackGC.cpp | 118 TerminatorInst *TI = CurBB->getTerminator();
119 if (!isa<ReturnInst>(TI) && !isa<ResumeInst>(TI))
122 Builder.SetInsertPoint(TI->getParent(), TI);
|
| /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/llvm/unittests/IR/ |
| IRBuilderTest.cpp | 85 TerminatorInst *TI = BB->getTerminator();
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->getSuccessor(1))
[all...] |
| /external/clang/lib/Lex/ |
| PPExpressions.cpp | 292 const TargetInfo &TI = PP.getTargetInfo();
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/ |
| PPCCTRLoops.cpp | 451 Instruction *TI = (*I)->getTerminator();
452 if (!TI)
455 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
|
| /external/llvm/lib/Target/SystemZ/ |
| 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();
333 skipTerminator(Position, *TI, true);
334 ++TI;
417 SmallVector<TerminatorInfo, 16>::iterator TI = Terminators.begin();
423 assert(Position.Address <= TI->Address &
[all...] |
