| /external/llvm/lib/Transforms/InstCombine/ |
| D | InstCombineLoadStoreAlloca.cpp | 69 if (LoadInst *LI = dyn_cast<LoadInst>(I)) { in isOnlyCopiedFromConstantGlobal() local
71 if (!LI->isSimple()) return false; in isOnlyCopiedFromConstantGlobal()
318 static LoadInst *combineLoadToNewType(InstCombiner &IC, LoadInst &LI, Type *NewTy, in combineLoadToNewType() argument
320 Value *Ptr = LI.getPointerOperand(); in combineLoadToNewType()
321 unsigned AS = LI.getPointerAddressSpace(); in combineLoadToNewType()
323 LI.getAllMetadata(MD); in combineLoadToNewType()
327 LI.getAlignment(), LI.getName() + Suffix); in combineLoadToNewType()
456 static Instruction *combineLoadToOperationType(InstCombiner &IC, LoadInst &LI) { in combineLoadToOperationType() argument
459 if (!LI.isSimple()) in combineLoadToOperationType()
462 if (LI.use_empty()) in combineLoadToOperationType()
[all …]
|
| /external/llvm/lib/CodeGen/ |
| D | 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); in runOnFunction() local
99 assert((LI || SI || RMWI || CASI || isa<FenceInst>(I)) && in runOnFunction()
105 if (LI && isAtLeastAcquire(LI->getOrdering())) { in runOnFunction()
106 FenceOrdering = LI->getOrdering(); in runOnFunction()
107 LI->setOrdering(Monotonic); in runOnFunction()
138 if (LI) { in runOnFunction()
[all …]
|
| D | LiveRangeEdit.cpp | 39 LiveInterval &LI = LIS.createEmptyInterval(VReg); in createEmptyIntervalFrom() local
40 return LI; in createEmptyIntervalFrom()
164 bool LiveRangeEdit::foldAsLoad(LiveInterval *LI, in foldAsLoad() argument
169 for (MachineOperand &MO : MRI.reg_nodbg_operands(LI->reg)) { in foldAsLoad()
206 if (UseMI->readsWritesVirtualRegister(LI->reg, &Ops).second) in foldAsLoad()
215 DefMI->addRegisterDead(LI->reg, nullptr); in foldAsLoad()
221 bool LiveRangeEdit::useIsKill(const LiveInterval &LI, in useIsKill() argument
225 if (LI.Query(Idx).isKill()) in useIsKill()
230 for (const LiveInterval::SubRange &S : LI.subranges()) { in useIsKill()
279 LiveInterval &LI = LIS.getInterval(Reg); in eliminateDeadDef() local
[all …]
|
| D | InterleavedAccessPass.cpp | 83 bool lowerInterleavedLoad(LoadInst *LI,
179 LoadInst *LI, SmallVector<Instruction *, 32> &DeadInsts) { in lowerInterleavedLoad() argument
180 if (!LI->isSimple()) in lowerInterleavedLoad()
186 for (auto UI = LI->user_begin(), E = LI->user_end(); UI != E; UI++) { in lowerInterleavedLoad()
222 DEBUG(dbgs() << "IA: Found an interleaved load: " << *LI << "\n"); in lowerInterleavedLoad()
225 if (!TLI->lowerInterleavedLoad(LI, Shuffles, Indices, Factor)) in lowerInterleavedLoad()
231 DeadInsts.push_back(LI); in lowerInterleavedLoad()
275 if (LoadInst *LI = dyn_cast<LoadInst>(&I)) in runOnFunction() local
276 Changed |= lowerInterleavedLoad(LI, DeadInsts); in runOnFunction()
|
| D | LiveIntervalAnalysis.cpp | 197 void LiveIntervals::computeVirtRegInterval(LiveInterval &LI) { in computeVirtRegInterval() argument
199 assert(LI.empty() && "Should only compute empty intervals."); in computeVirtRegInterval()
200 bool ShouldTrackSubRegLiveness = MRI->shouldTrackSubRegLiveness(LI.reg); in computeVirtRegInterval()
202 LRCalc->calculate(LI, ShouldTrackSubRegLiveness); in computeVirtRegInterval()
203 bool SeparatedComponents = computeDeadValues(LI, nullptr); in computeVirtRegInterval()
208 splitSeparateComponents(LI, SplitLIs); in computeVirtRegInterval()
326 for (const auto &LI : MBB->liveins()) { in computeLiveInRegUnits() local
327 for (MCRegUnitIterator Units(LI.PhysReg, TRI); Units.isValid(); ++Units) { in computeLiveInRegUnits()
476 bool LiveIntervals::computeDeadValues(LiveInterval &LI, in computeDeadValues() argument
479 for (auto VNI : LI.valnos) { in computeDeadValues()
[all …]
|
| D | LiveRangeCalc.cpp | 53 void LiveRangeCalc::calculate(LiveInterval &LI, bool TrackSubRegs) { in calculate() argument
60 unsigned Reg = LI.reg; in calculate()
66 if (LI.hasSubRanges() || (SubReg != 0 && TrackSubRegs)) { in calculate()
72 if (!LI.hasSubRanges() && !LI.empty()) { in calculate()
74 LI.createSubRangeFrom(*Alloc, ClassMask, LI); in calculate()
77 for (LiveInterval::SubRange &S : LI.subranges()) { in calculate()
88 CommonRange = LI.createSubRangeFrom(*Alloc, Common, S); in calculate()
99 LiveInterval::SubRange *NewRange = LI.createSubRange(*Alloc, Mask); in calculate()
107 if (MO.isDef() && !LI.hasSubRanges()) in calculate()
108 createDeadDef(*Indexes, *Alloc, LI, MO); in calculate()
[all …]
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineLoopInfo.h | 69 LoopInfoBase<MachineBasicBlock, MachineLoop> LI; variable
82 LoopInfoBase<MachineBasicBlock, MachineLoop>& getBase() { return LI; } in getBase()
88 inline iterator begin() const { return LI.begin(); } in begin()
89 inline iterator end() const { return LI.end(); } in end()
90 bool empty() const { return LI.empty(); } in empty()
96 return LI.getLoopFor(BB); in getLoopFor()
102 return LI.getLoopFor(BB);
108 return LI.getLoopDepth(BB); in getLoopDepth()
113 return LI.isLoopHeader(BB); in isLoopHeader()
120 void releaseMemory() override { LI.releaseMemory(); } in releaseMemory()
[all …]
|
| /external/llvm/tools/llvm-diff/ |
| D | DifferenceEngine.cpp | 195 BasicBlock::iterator LI = L->begin(), LE = L->end(); in diff() local
199 assert(LI != LE && RI != R->end()); in diff()
200 Instruction *LeftI = &*LI, *RightI = &*RI; in diff()
213 ++LI, ++RI; in diff()
214 } while (LI != LE); // This is sufficient: we can't get equality of in diff()
219 for (LI = L->begin(), RI = R->begin(); LI != LE; ++LI, ++RI) in diff()
220 unify(&*LI, &*RI); in diff()
224 void runBlockDiff(BasicBlock::iterator LI, BasicBlock::iterator RI);
277 InvokeInst *LI = cast<InvokeInst>(L); in diff() local
279 if (diffCallSites(CallSite(LI), CallSite(RI), Complain)) in diff()
[all …]
|
| /external/llvm/lib/TableGen/ |
| D | StringMatcher.cpp | 106 for (std::map<char, std::vector<const StringPair*> >::iterator LI = in EmitStringMatcherForChar() local
107 MatchesByLetter.begin(), E = MatchesByLetter.end(); LI != E; ++LI) { in EmitStringMatcherForChar()
109 OS << Indent << "case '" << LI->first << "':\t // " in EmitStringMatcherForChar()
110 << LI->second.size() << " string"; in EmitStringMatcherForChar()
111 if (LI->second.size() != 1) OS << 's'; in EmitStringMatcherForChar()
113 if (EmitStringMatcherForChar(LI->second, CharNo+1, IndentCount+1)) in EmitStringMatcherForChar()
139 for (std::map<unsigned, std::vector<const StringPair*> >::iterator LI = in Emit() local
140 MatchesByLength.begin(), E = MatchesByLength.end(); LI != E; ++LI) { in Emit()
141 OS.indent(Indent*2+2) << "case " << LI->first << ":\t // " in Emit()
142 << LI->second.size() in Emit()
[all …]
|
| /external/llvm/lib/Analysis/ |
| D | CFG.cpp | 113 static const Loop *getOutermostLoop(const LoopInfo *LI, const BasicBlock *BB) { in getOutermostLoop() argument
114 const Loop *L = LI->getLoopFor(BB); in getOutermostLoop()
123 static bool loopContainsBoth(const LoopInfo *LI, in loopContainsBoth() argument
125 const Loop *L1 = getOutermostLoop(LI, BB1); in loopContainsBoth()
126 const Loop *L2 = getOutermostLoop(LI, BB2); in loopContainsBoth()
132 const DominatorTree *DT, const LoopInfo *LI) { in isPotentiallyReachableFromMany() argument
150 if (LI && loopContainsBoth(LI, BB, StopBB)) in isPotentiallyReachableFromMany()
159 if (const Loop *Outer = LI ? getOutermostLoop(LI, BB) : nullptr) { in isPotentiallyReachableFromMany()
175 const DominatorTree *DT, const LoopInfo *LI) { in isPotentiallyReachable() argument
183 DT, LI); in isPotentiallyReachable()
[all …]
|
| D | MemoryDependenceAnalysis.cpp | 132 if (const LoadInst *LI = dyn_cast<LoadInst>(Inst)) { in GetLocation() local
133 if (LI->isUnordered()) { in GetLocation()
134 Loc = MemoryLocation::get(LI); in GetLocation()
137 if (LI->getOrdering() == Monotonic) { in GetLocation()
138 Loc = MemoryLocation::get(LI); in GetLocation()
272 const LoadInst *LI) { in isLoadLoadClobberIfExtendedToFullWidth() argument
273 const DataLayout &DL = LI->getModule()->getDataLayout(); in isLoadLoadClobberIfExtendedToFullWidth()
280 MemLocBase, MemLocOffs, MemLoc.Size, LI); in isLoadLoadClobberIfExtendedToFullWidth()
293 const LoadInst *LI) { in getLoadLoadClobberFullWidthSize() argument
295 if (!isa<IntegerType>(LI->getType()) || !LI->isSimple()) return 0; in getLoadLoadClobberFullWidthSize()
[all …]
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopDeletion.cpp | 117 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end(); in isLoopDead() local
118 LI != LE; ++LI) { in isLoopDead()
119 for (BasicBlock::iterator BI = (*LI)->begin(), BE = (*LI)->end(); in isLoopDead()
213 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end(); in runOnLoop() local
214 LI != LE; ++LI) { in runOnLoop()
217 ChildNodes.insert(ChildNodes.begin(), DT[*LI]->begin(), DT[*LI]->end()); in runOnLoop()
224 DT.eraseNode(*LI); in runOnLoop()
228 (*LI)->dropAllReferences(); in runOnLoop()
235 for (Loop::block_iterator LI = L->block_begin(), LE = L->block_end(); in runOnLoop() local
236 LI != LE; ++LI) in runOnLoop()
[all …]
|
| D | LICM.cpp | 77 static bool inSubLoop(BasicBlock *BB, Loop *CurLoop, LoopInfo *LI);
80 static bool sink(Instruction &I, const LoopInfo *LI, const DominatorTree *DT,
98 const LoopInfo *LI);
142 LoopInfo *LI; // Current LoopInfo member
194 LI = &getAnalysis<LoopInfoWrapperPass>().getLoopInfo(); in runOnLoop()
231 if (LI->getLoopFor(BB) == L) // Ignore blocks in subloops. in runOnLoop()
250 Changed |= sinkRegion(DT->getNode(L->getHeader()), AA, LI, DT, TLI, CurLoop, in runOnLoop()
253 Changed |= hoistRegion(DT->getNode(L->getHeader()), AA, LI, DT, TLI, in runOnLoop()
267 PIC, LI, DT, CurLoop, in runOnLoop()
278 formLCSSARecursively(*L, *DT, LI, SEWP ? &SEWP->getSE() : nullptr); in runOnLoop()
[all …]
|
| D | SROA.cpp | 743 void visitLoadInst(LoadInst &LI) { in visitLoadInst() argument
744 assert((!LI.isSimple() || LI.getType()->isSingleValueType()) && in visitLoadInst()
748 return PI.setAborted(&LI); in visitLoadInst()
750 const DataLayout &DL = LI.getModule()->getDataLayout(); in visitLoadInst()
751 uint64_t Size = DL.getTypeStoreSize(LI.getType()); in visitLoadInst()
752 return handleLoadOrStore(LI.getType(), LI, Offset, Size, LI.isVolatile()); in visitLoadInst()
908 if (LoadInst *LI = dyn_cast<LoadInst>(I)) { in hasUnsafePHIOrSelectUse() local
909 Size = std::max(Size, DL.getTypeStoreSize(LI->getType())); in hasUnsafePHIOrSelectUse()
1090 if (LoadInst *LI = dyn_cast<LoadInst>(U->getUser())) { in findCommonType() local
1091 UserTy = LI->getType(); in findCommonType()
[all …]
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| D | DebugLocStream.h | 65 const List &getList(size_t LI) const { return Lists[LI]; } in getList() argument
79 size_t LI = Lists.size(); in startList() local
81 return LI; in startList()
109 size_t LI = getIndex(L); in getEntries() local
111 .slice(Lists[LI].EntryOffset, getNumEntries(LI)); in getEntries()
136 size_t getNumEntries(size_t LI) const { in getNumEntries() argument
137 if (LI + 1 == Lists.size()) in getNumEntries()
138 return Entries.size() - Lists[LI].EntryOffset; in getNumEntries()
139 return Lists[LI + 1].EntryOffset - Lists[LI].EntryOffset; in getNumEntries()
|
| /external/llvm/lib/Transforms/Utils/ |
| D | PromoteMemoryToRegister.cpp | 58 if (const LoadInst *LI = dyn_cast<LoadInst>(U)) { in isAllocaPromotable() local
61 if (LI->isVolatile()) in isAllocaPromotable()
134 LoadInst *LI = cast<LoadInst>(User); in AnalyzeAlloca() local
137 UsingBlocks.push_back(LI->getParent()); in AnalyzeAlloca()
138 AllocaPointerVal = LI; in AnalyzeAlloca()
354 LoadInst *LI = cast<LoadInst>(UserInst); in rewriteSingleStoreAlloca() local
361 if (LI->getParent() == StoreBB) { in rewriteSingleStoreAlloca()
368 if (unsigned(StoreIndex) > LBI.getInstructionIndex(LI)) { in rewriteSingleStoreAlloca()
374 } else if (LI->getParent() != StoreBB && in rewriteSingleStoreAlloca()
375 !DT.dominates(StoreBB, LI->getParent())) { in rewriteSingleStoreAlloca()
[all …]
|
| D | BreakCriticalEdges.cpp | 48 auto *LI = LIWP ? &LIWP->getLoopInfo() : nullptr; in runOnFunction() local
50 SplitAllCriticalEdges(F, CriticalEdgeSplittingOptions(DT, LI)); in runOnFunction()
200 auto *LI = Options.LI; in SplitCriticalEdge() local
201 if (!DT && !LI) in SplitCriticalEdge()
260 if (LI) { in SplitCriticalEdge()
261 if (Loop *TIL = LI->getLoopFor(TIBB)) { in SplitCriticalEdge()
264 if (Loop *DestLoop = LI->getLoopFor(DestBB)) { in SplitCriticalEdge()
267 DestLoop->addBasicBlockToLoop(NewBB, *LI); in SplitCriticalEdge()
270 TIL->addBasicBlockToLoop(NewBB, *LI); in SplitCriticalEdge()
273 DestLoop->addBasicBlockToLoop(NewBB, *LI); in SplitCriticalEdge()
[all …]
|
| D | LCSSA.cpp | 66 PredIteratorCache &PredCache, LoopInfo *LI) { in processInstruction() argument
149 if (auto *OtherLoop = LI->getLoopFor(ExitBB)) in processInstruction()
185 Loop *OtherLoop = LI->getLoopFor(PHIBB); in processInstruction()
194 processInstruction(*OtherLoop, *I, DT, EBs, PredCache, LI); in processInstruction()
219 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI, in formLCSSA() argument
249 Changed |= processInstruction(L, I, DT, ExitBlocks, PredCache, LI); in formLCSSA()
265 bool llvm::formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI, in formLCSSARecursively() argument
271 Changed |= formLCSSARecursively(*SubLoop, DT, LI, SE); in formLCSSARecursively()
273 Changed |= formLCSSA(L, DT, LI, SE); in formLCSSARecursively()
286 LoopInfo *LI; member
[all …]
|
| D | LoopSimplify.cpp | 118 LoopInfo *LI, bool PreserveLCSSA) { in InsertPreheaderForLoop() argument
140 LI, PreserveLCSSA); in InsertPreheaderForLoop()
159 DominatorTree *DT, LoopInfo *LI, in rewriteLoopExitBlock() argument
175 NewExitBB = SplitBlockPredecessors(Exit, LoopBlocks, ".loopexit", DT, LI, in rewriteLoopExitBlock()
249 DominatorTree *DT, LoopInfo *LI, in separateNestedLoop() argument
285 DT, LI, PreserveLCSSA); in separateNestedLoop()
298 LI->changeTopLevelLoop(L, NewOuter); in separateNestedLoop()
336 if ((*LI)[BB] == L) in separateNestedLoop()
337 LI->changeLoopFor(BB, NewOuter); in separateNestedLoop()
352 DominatorTree *DT, LoopInfo *LI) { in insertUniqueBackedgeBlock() argument
[all …]
|
| /external/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyRegColoring.cpp | 106 LiveInterval *LI = &Liveness->getInterval(VReg); in runOnMachineFunction() local
107 assert(LI->weight == 0.0f); in runOnMachineFunction()
108 LI->weight = computeWeight(MRI, MBFI, VReg); in runOnMachineFunction()
109 DEBUG(LI->dump()); in runOnMachineFunction()
110 SortedIntervals.push_back(LI); in runOnMachineFunction()
136 LiveInterval *LI = SortedIntervals[i]; in runOnMachineFunction() local
137 unsigned Old = LI->reg; in runOnMachineFunction()
148 if (!OtherLI->empty() && OtherLI->overlaps(*LI)) in runOnMachineFunction()
159 Assignments[Color].push_back(LI); in runOnMachineFunction()
161 << TargetRegisterInfo::virtReg2Index(LI->reg) << " to vreg" in runOnMachineFunction()
|
| /external/tcpdump/tests/ |
| D | print-AA.out | 72 <LI>
73 Configuration files can be found in <TT>/etc/apache</TT>.</LI>
75 <LI>
77 HTML files should exist, is set to <TT>/var/www</TT>.</LI>
79 <LI>
81 Debian packages will place their scripts.</LI>
83 <LI>
86 <TT>/etc/logrotate.d/apache</TT>.</LI>
88 <LI>
91 if it exists (assuming that <TT>/var/www</TT> is your <TT>DocumentRoot</TT>).</LI>
[all …]
|
| D | print-A.out | 72 <LI>
73 Configuration files can be found in <TT>/etc/apache</TT>.</LI>
75 <LI>
77 HTML files should exist, is set to <TT>/var/www</TT>.</LI>
79 <LI>
81 Debian packages will place their scripts.</LI>
83 <LI>
86 <TT>/etc/logrotate.d/apache</TT>.</LI>
88 <LI>
91 if it exists (assuming that <TT>/var/www</TT> is your <TT>DocumentRoot</TT>).</LI>
[all …]
|
| /external/llvm/tools/llvm-cov/ |
| D | SourceCoverageView.cpp | 171 for (line_iterator LI(File, /*SkipBlanks=*/false); !LI.is_at_eof(); ++LI) { in render() local
177 else if (LI.line_number() < FirstLine) in render()
185 while (NextSegment != EndSegment && NextSegment->Line == LI.line_number()) in render()
201 renderLineNumberColumn(OS, LI.line_number()); in render()
205 if (NextESV != EndESV && NextESV->getLine() == LI.line_number() && in render()
210 renderLine(OS, *LI, LI.line_number(), WrappedSegment, LineSegments, in render()
225 for (; NextESV != EndESV && NextESV->getLine() == LI.line_number(); in render()
235 renderLine(OS, *LI, LI.line_number(), WrappedSegment, LineSegments, in render()
248 for (; NextISV != EndISV && NextISV->Line == LI.line_number(); ++NextISV) { in render()
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| D | BasicBlockUtils.h | 55 LoopInfo *LI = nullptr,
84 LoopInfo *LI; member
90 LoopInfo *LI = nullptr)
91 : DT(DT), LI(LI), MergeIdenticalEdges(false), in DT()
183 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
191 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
211 LoopInfo *LI = nullptr,
231 LoopInfo *LI = nullptr,
|
| /external/llvm/lib/Target/NVPTX/ |
| D | NVPTXLowerAlloca.cpp | 87 auto LI = dyn_cast<LoadInst>(AllocaUse.getUser()); in runOnBasicBlock() local
88 if (LI && LI->getPointerOperand() == allocaInst && !LI->isVolatile()) { in runOnBasicBlock()
89 LI->setOperand(LI->getPointerOperandIndex(), NewASCToGeneric); in runOnBasicBlock()
|