| /external/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 55 LoopInfo *LI = nullptr,
84 LoopInfo *LI;
90 LoopInfo *LI = nullptr)
91 : DT(DT), LI(LI), MergeIdenticalEdges(false),
183 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
191 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
211 LoopInfo *LI = nullptr,
231 LoopInfo *LI = nullptr,
|
| LoopVersioning.h | 42 LoopVersioning(const LoopAccessInfo &LAI, Loop *L, LoopInfo *LI,
108 LoopInfo *LI;
|
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXLowerAlloca.cpp | 87 auto LI = dyn_cast<LoadInst>(AllocaUse.getUser());
88 if (LI && LI->getPointerOperand() == allocaInst && !LI->isVolatile()) {
89 LI->setOperand(LI->getPointerOperandIndex(), NewASCToGeneric);
|
| NVPTXLowerKernelArgs.cpp | 161 LoadInst *LI = new LoadInst(ArgInParam, Arg->getName(), FirstInst);
162 new StoreInst(LI, AllocA, FirstInst);
204 if (LoadInst *LI = dyn_cast<LoadInst>(&I)) {
205 if (LI->getType()->isPointerTy()) {
206 Value *UO = GetUnderlyingObject(LI->getPointerOperand(),
210 // LI is a load from a pointer within a byval kernel parameter.
211 markPointerAsGlobal(LI);
|
| /external/llvm/lib/Transforms/Scalar/ |
| LowerAtomic.cpp | 102 static bool LowerLoadInst(LoadInst *LI) {
103 LI->setAtomic(NotAtomic);
130 else if (LoadInst *LI = dyn_cast<LoadInst>(Inst)) {
131 if (LI->isAtomic())
132 LowerLoadInst(LI);
|
| Sink.cpp | 37 LoopInfo *LI;
101 LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
219 Loop *succ = LI->getLoopFor(SuccToSinkTo);
220 Loop *cur = LI->getLoopFor(Inst->getParent());
|
| LoadCombine.cpp | 89 PointerOffsetPair LoadCombine::getPointerOffsetPair(LoadInst &LI) {
91 POP.Pointer = LI.getPointerOperand();
95 auto &DL = LI.getModule()->getDataLayout();
246 LoadInst *LI = dyn_cast<LoadInst>(&I);
247 if (!LI)
250 if (!LI->isSimple() || !LI->getType()->isIntegerTy())
252 auto POP = getPointerOffsetPair(*LI);
255 LoadMap[POP.Pointer].push_back(LoadPOPPair(LI, POP, Index++));
256 AST.add(LI);
[all...] |
| LoopInstSimplify.cpp | 79 LoopInfo *LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
126 if (V && LI->replacementPreservesLCSSAForm(I, V)) {
160 const Loop *SuccLoop = LI->getLoopFor(SuccBB);
170 if (LI->getLoopFor(ExitBB) == L && Visited.insert(ExitBB).second)
|
| /external/llvm/include/llvm/Analysis/ |
| BasicAliasAnalysis.h | 45 LoopInfo *LI;
50 LoopInfo *LI = nullptr)
51 : AAResultBase(TLI), DL(DL), AC(AC), DT(DT), LI(LI) {}
54 : AAResultBase(Arg), DL(Arg.DL), AC(Arg.AC), DT(Arg.DT), LI(Arg.LI) {}
57 LI(Arg.LI) {}
|
| IVUsers.h | 124 LoopInfo *LI;
|
| LoopIterator.h | 64 void perform(LoopInfo *LI);
129 LoopInfo *LI;
133 DFS(Storage), LI(LInfo) {}
154 if (!DFS.L->contains(LI->getLoopFor(BB)))
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineLoopInfo.h | 69 LoopInfoBase<MachineBasicBlock, MachineLoop> LI;
82 LoopInfoBase<MachineBasicBlock, MachineLoop>& getBase() { return LI; }
88 inline iterator begin() const { return LI.begin(); }
89 inline iterator end() const { return LI.end(); }
90 bool empty() const { return LI.empty(); }
96 return LI.getLoopFor(BB);
102 return LI.getLoopFor(BB);
108 return LI.getLoopDepth(BB);
113 return LI.isLoopHeader(BB);
120 void releaseMemory() override { LI.releaseMemory();
[all...] |
| /external/llvm/lib/Analysis/ |
| Delinearization.cpp | 44 LoopInfo *LI;
69 LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
96 for (Loop *L = LI->getLoopFor(BB); L != nullptr; L = L->getParentLoop()) {
|
| BlockFrequencyInfo.cpp | 112 const LoopInfo &LI) {
113 calculate(F, BPI, LI);
118 const LoopInfo &LI) {
121 BFI->calculate(F, BPI, LI);
210 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
211 BFI.calculate(F, BPI, LI);
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64PBQPRegAlloc.cpp | 322 const LiveInterval &LI = LIs.getInterval(reg);
324 return LI.expiredAt(SI);
|
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyRegColoring.cpp | 106 LiveInterval *LI = &Liveness->getInterval(VReg);
107 assert(LI->weight == 0.0f);
108 LI->weight = computeWeight(MRI, MBFI, VReg);
109 DEBUG(LI->dump());
110 SortedIntervals.push_back(LI);
136 LiveInterval *LI = SortedIntervals[i];
137 unsigned Old = LI->reg;
148 if (!OtherLI->empty() && OtherLI->overlaps(*LI))
159 Assignments[Color].push_back(LI);
161 << TargetRegisterInfo::virtReg2Index(LI->reg) << " to vreg
[all...] |
| /external/llvm/lib/CodeGen/ |
| AtomicExpandPass.cpp | 53 LoadInst *convertAtomicLoadToIntegerType(LoadInst *LI);
54 bool tryExpandAtomicLoad(LoadInst *LI);
55 bool expandAtomicLoadToLL(LoadInst *LI);
56 bool expandAtomicLoadToCmpXchg(LoadInst *LI);
95 auto LI = dyn_cast<LoadInst>(I);
99 assert((LI || SI || RMWI || CASI || isa<FenceInst>(I)) &&
105 if (LI && isAtLeastAcquire(LI->getOrdering())) {
106 FenceOrdering = LI->getOrdering();
107 LI->setOrdering(Monotonic)
[all...] |
| LiveRangeEdit.cpp | 39 LiveInterval &LI = LIS.createEmptyInterval(VReg);
40 return LI;
99 LiveInterval &li = LIS.getInterval(MO.getReg()); local
100 const VNInfo *OVNI = li.getVNInfoAt(OrigIdx);
110 if (OVNI != li.getVNInfoAt(UseIdx))
164 bool LiveRangeEdit::foldAsLoad(LiveInterval *LI,
169 for (MachineOperand &MO : MRI.reg_nodbg_operands(LI->reg)) {
206 if (UseMI->readsWritesVirtualRegister(LI->reg, &Ops).second)
215 DefMI->addRegisterDead(LI->reg, nullptr);
221 bool LiveRangeEdit::useIsKill(const LiveInterval &LI,
[all...] |
| /external/llvm/lib/LineEditor/ |
| LineEditor.cpp | 141 const LineInfo *LI = ::el_line(EL);
143 StringRef(LI->buffer, LI->lastchar - LI->buffer),
144 LI->cursor - LI->buffer);
180 << StringRef(LI->buffer, LI->lastchar - LI->buffer);
184 Data->PrevCount = LI->lastchar - LI->cursor
[all...] |
| /external/llvm/lib/Target/PowerPC/ |
| PPCLoopDataPrefetch.cpp | 87 LoopInfo *LI;
107 LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
115 for (auto I = LI->begin(), IE = LI->end(); I != IE; ++I)
|
| /external/llvm/lib/Transforms/IPO/ |
| LoopExtractor.cpp | 96 LoopInfo &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo();
146 LI.updateUnloop(L);
|
| /external/llvm/lib/Transforms/Utils/ |
| BreakCriticalEdges.cpp | 48 auto *LI = LIWP ? &LIWP->getLoopInfo() : nullptr;
50 SplitAllCriticalEdges(F, CriticalEdgeSplittingOptions(DT, LI));
200 auto *LI = Options.LI;
201 if (!DT && !LI)
260 if (LI) {
261 if (Loop *TIL = LI->getLoopFor(TIBB)) {
263 // either, and thus LI doesn't need to be updated.
264 if (Loop *DestLoop = LI->getLoopFor(DestBB)) {
267 DestLoop->addBasicBlockToLoop(NewBB, *LI);
[all...] |
| LCSSA.cpp | 66 PredIteratorCache &PredCache, LoopInfo *LI) {
149 if (auto *OtherLoop = LI->getLoopFor(ExitBB))
185 Loop *OtherLoop = LI->getLoopFor(PHIBB);
194 processInstruction(*OtherLoop, *I, DT, EBs, PredCache, LI);
219 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI,
249 Changed |= processInstruction(L, I, DT, ExitBlocks, PredCache, LI);
265 bool llvm::formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI,
271 Changed |= formLCSSARecursively(*SubLoop, DT, LI, SE);
273 Changed |= formLCSSA(L, DT, LI, SE);
286 LoopInfo *LI;
[all...] |
| /external/llvm/unittests/Analysis/ |
| ScalarEvolutionTest.cpp | 38 std::unique_ptr<LoopInfo> LI;
45 LI.reset(new LoopInfo(*DT));
46 return ScalarEvolution(F, TLI, *AC, *DT, *LI);
|
| /external/llvm/utils/TableGen/ |
| OptParserEmitter.cpp | 256 const ListInit *LI = R.getValueAsListInit("Flags");
257 for (Init *I : *LI)
|
