/external/llvm/include/llvm/Analysis/ |
H A D | BranchProbabilityInfo.h | 130 LoopInfo *LI; member in class:llvm::BranchProbabilityInfo
|
H A D | LoopIterator.h | 64 void perform(LoopInfo *LI); 129 LoopInfo *LI; member in class:llvm::LoopBlocksTraversal 133 DFS(Storage), LI(LInfo) {} 154 if (!DFS.L->contains(LI->getLoopFor(BB)))
|
H A D | IVUsers.h | 122 LoopInfo *LI; member in class:llvm::IVUsers
|
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | SSAUpdater.h | 163 virtual void replaceLoadWithValue(LoadInst *LI, Value *V) const { argument
|
/external/llvm/lib/Target/R600/ |
H A D | SIFixSGPRLiveRanges.cpp | 99 LiveInterval &LI = LIS->getInterval(Def.getReg()); local 100 for (unsigned i = 0, e = LI.size() - 1; i != e; ++i) { 101 LiveRange::Segment &Seg = LI.segments[i]; 102 LiveRange::Segment &Next = LI.segments[i + 1];
|
/external/llvm/lib/Analysis/ |
H A D | Delinearization.cpp | 44 LoopInfo *LI; member in class:__anon25675::Delinearization 69 LI = &getAnalysis<LoopInfo>(); 96 for (Loop *L = LI->getLoopFor(BB); L != nullptr; L = L->getParentLoop()) {
|
H A D | CFG.cpp | 112 static const Loop *getOutermostLoop(const LoopInfo *LI, const BasicBlock *BB) { argument 113 const Loop *L = LI->getLoopFor(BB); 122 static bool loopContainsBoth(const LoopInfo *LI, argument 124 const Loop *L1 = getOutermostLoop(LI, BB1); 125 const Loop *L2 = getOutermostLoop(LI, BB2); 132 const LoopInfo *LI) { 150 if (LI && loopContainsBoth(LI, BB, StopBB)) 159 if (const Loop *Outer = LI ? getOutermostLoop(LI, B 129 isPotentiallyReachableInner(SmallVectorImpl<BasicBlock *> &Worklist, BasicBlock *StopBB, const DominatorTree *DT, const LoopInfo *LI) argument 174 isPotentiallyReachable(const BasicBlock *A, const BasicBlock *B, const DominatorTree *DT, const LoopInfo *LI) argument 186 isPotentiallyReachable(const Instruction *A, const Instruction *B, const DominatorTree *DT, const LoopInfo *LI) argument [all...] |
H A D | AliasSetTracker.cpp | 298 bool AliasSetTracker::add(LoadInst *LI) { argument 299 if (LI->getOrdering() > Monotonic) return addUnknown(LI); 302 AliasSet &AS = addPointer(LI->getOperand(0), 303 AA.getTypeStoreSize(LI->getType()), 304 LI->getMetadata(LLVMContext::MD_tbaa), 306 if (LI->isVolatile()) AS.setVolatile(); 351 if (LoadInst *LI = dyn_cast<LoadInst>(I)) 352 return add(LI); 429 bool AliasSetTracker::remove(LoadInst *LI) { argument [all...] |
H A D | BlockFrequencyInfo.cpp | 132 LoopInfo &LI = getAnalysis<LoopInfo>(); local 135 BFI->doFunction(&F, &BPI, &LI);
|
H A D | IVUsers.cpp | 50 ScalarEvolution *SE, LoopInfo *LI) { 58 SE->getSCEVAtScope(AR, LI->getLoopFor(I->getParent())) != AR); 62 return isInteresting(AR->getStart(), I, L, SE, LI) && 63 !isInteresting(AR->getStepRecurrence(*SE), I, L, SE, LI); 71 if (isInteresting(*OI, I, L, SE, LI)) { 86 const LoopInfo *LI, 92 Loop *DomLoop = LI->getLoopFor(DomBB); 142 if (!isInteresting(ISE, I, L, SE, LI)) 164 if (!isSimplifiedLoopNest(UseBB, DT, LI, SimpleLoopNests)) 174 if (LI 49 isInteresting(const SCEV *S, const Instruction *I, const Loop *L, ScalarEvolution *SE, LoopInfo *LI) argument 85 isSimplifiedLoopNest(BasicBlock *BB, const DominatorTree *DT, const LoopInfo *LI, SmallPtrSet<Loop*,16> &SimpleLoopNests) argument [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | LowerAtomic.cpp | 102 static bool LowerLoadInst(LoadInst *LI) { argument 103 LI->setAtomic(NotAtomic); 130 else if (LoadInst *LI = dyn_cast<LoadInst>(Inst)) { 131 if (LI->isAtomic()) 132 LowerLoadInst(LI); variable
|
H A D | LoopInstSimplify.cpp | 75 LoopInfo *LI = &getAnalysis<LoopInfo>(); local 120 if (V && LI->replacementPreservesLCSSAForm(I, V)) { 154 const Loop *SuccLoop = LI->getLoopFor(SuccBB); 164 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB))
|
H A D | Sink.cpp | 36 LoopInfo *LI; member in class:__anon26340::Sinking 101 LI = &getAnalysis<LoopInfo>(); 209 Loop *succ = LI->getLoopFor(SuccToSinkTo); 210 Loop *cur = LI->getLoopFor(Inst->getParent());
|
/external/llvm/include/llvm/CodeGen/ |
H A D | MachineLoopInfo.h | 74 LoopInfoBase<MachineBasicBlock, MachineLoop> LI; member in class:llvm::MachineLoopInfo 87 LoopInfoBase<MachineBasicBlock, MachineLoop>& getBase() { return LI; } 93 inline iterator begin() const { return LI.begin(); } 94 inline iterator end() const { return LI.end(); } 95 bool empty() const { return LI.empty(); } 101 return LI.getLoopFor(BB); 107 return LI.getLoopFor(BB); 113 return LI.getLoopDepth(BB); 118 return LI.isLoopHeader(BB); 125 void releaseMemory() override { LI [all...] |
H A D | AsmPrinter.h | 111 MachineLoopInfo *LI; member in class:llvm::AsmPrinter
|
H A D | LiveIntervalAnalysis.h | 132 LiveInterval &LI = createEmptyInterval(Reg); local 133 computeVirtRegInterval(LI); 134 return LI; 169 /// extendToIndices - Extend the live range of LI to reach all points in 171 /// existing defs in LI. PHI-defs are added as needed to maintain SSA form. 173 /// If a SlotIndex in Indices is the end index of a basic block, LI will be 179 /// pruneValue - If an LI value is live at Kill, prune its live range by 181 /// EndPoints such that extendToIndices(LI, EndPoints) will reconstruct the 186 void pruneValue(LiveInterval *LI, SlotIndex Kill, 278 /// intervalIsInOneMBB - If LI i [all...] |
/external/llvm/lib/CodeGen/ |
H A D | CalcSpillWeights.cpp | 74 // Check if all values in LI are rematerializable 75 static bool isRematerializable(const LiveInterval &LI, argument 78 for (LiveInterval::const_vni_iterator I = LI.vni_begin(), E = LI.vni_end();
|
H A D | LiveRangeCalc.h | 83 // Cleared when the final value has been determined and LI has been updated. 88 // determined, the range from the block start to Kill will be added to LI. 104 /// Assuming that LI is live-in to KillMBB and killed at Kill, find the set 108 /// to LI, and the function returns true. 110 /// If multiple values can reach Kill, the blocks that need LI to be live in 155 /// extend - Extend the live range of LI to reach Kill. 157 /// The existing values in LI must be live so they jointly dominate Kill. If 165 /// createDeadDefs - Create a dead def in LI for every def operand of Reg. 170 /// createDeadDefs - Create a dead def in LI for every def of LI 171 createDeadDefs(LiveInterval &LI) argument 182 extendToUses(LiveInterval &LI) argument [all...] |
H A D | AtomicExpandLoadLinkedPass.cpp | 43 bool expandAtomicLoad(LoadInst *LI); 44 bool expandAtomicStore(StoreInst *LI); 88 else if (LoadInst *LI = dyn_cast<LoadInst>(Inst)) 89 MadeChange |= expandAtomicLoad(LI); 99 bool AtomicExpandLoadLinked::expandAtomicLoad(LoadInst *LI) { argument 104 : LI->getOrdering(); 108 IRBuilder<> Builder(LI); 110 Builder, LI->getPointerOperand(), MemOpOrder); 112 insertTrailingFence(Builder, LI->getOrdering()); 114 LI [all...] |
H A D | LiveRangeEdit.cpp | 39 LiveInterval &LI = LIS.createEmptyInterval(VReg); local 40 return LI; 166 bool LiveRangeEdit::foldAsLoad(LiveInterval *LI, argument 171 for (MachineOperand &MO : MRI.reg_nodbg_operands(LI->reg)) { 208 if (UseMI->readsWritesVirtualRegister(LI->reg, &Ops).second) 217 DefMI->addRegisterDead(LI->reg, nullptr); 272 LiveInterval &LI = LIS.getInterval(Reg); local 280 LI.Query(Idx).isKill())) 281 ToShrink.insert(&LI); 285 if (VNInfo *VNI = LI 344 LiveInterval *LI = ToShrink.back(); local 375 DEBUG(dbgs() << NumComp << " components: " << *LI << '\\n'); local 412 LiveInterval &LI = LIS.getInterval(get(I)); local [all...] |
H A D | StackProtector.cpp | 359 LoadInst *LI = B.CreateLoad(StackGuardVar, "StackGuard"); local 360 B.CreateCall2(Intrinsic::getDeclaration(M, Intrinsic::stackprotector), LI, local
|
H A D | VirtRegMap.cpp | 246 LiveInterval &LI = LIS->getInterval(VirtReg); local 247 if (LI.empty() || LIS->intervalIsInOneMBB(LI)) 254 // Scan the segments of LI. 255 for (LiveInterval::const_iterator I = LI.begin(), E = LI.end(); I != E;
|
/external/llvm/lib/Transforms/Utils/ |
H A D | BreakCriticalEdges.cpp | 216 LoopInfo *LI = P->getAnalysisIfAvailable<LoopInfo>(); local 219 if (!DT && !LI) 278 if (LI) { 279 if (Loop *TIL = LI->getLoopFor(TIBB)) { 281 // either, and thus LI doesn't need to be updated. 282 if (Loop *DestLoop = LI->getLoopFor(DestBB)) { 285 DestLoop->addBasicBlockToLoop(NewBB, LI->getBase()); 288 TIL->addBasicBlockToLoop(NewBB, LI->getBase()); 291 DestLoop->addBasicBlockToLoop(NewBB, LI->getBase()); 300 P->addBasicBlockToLoop(NewBB, LI [all...] |
H A D | LCSSA.cpp | 236 for (Loop::iterator LI = L.begin(), LE = L.end(); LI != LE; ++LI) 237 Changed |= formLCSSARecursively(**LI, DT, SE); 252 LoopInfo *LI; member in struct:__anon26352::LCSSA 288 LI = &getAnalysis<LoopInfo>(); 293 for (LoopInfo::iterator I = LI->begin(), E = LI->end(); I != E; ++I) 301 for (Loop::iterator LI = L.begin(), LE = L.end(); LI ! [all...] |
/external/llvm/utils/TableGen/ |
H A D | OptParserEmitter.cpp | 252 const ListInit *LI = R.getValueAsListInit("Flags"); local 253 if (LI->empty()) { 257 for (unsigned i = 0, e = LI->size(); i != e; ++i) { 260 OS << cast<DefInit>(LI->getElement(i))->getDef()->getName();
|