Home
last modified time | relevance | path

Searched refs:LI (Results 1 – 25 of 506) sorted by relevance

12345678910>>...21

/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DLiveIntervalCalc.cpp42 void LiveIntervalCalc::calculate(LiveInterval &LI, bool TrackSubRegs) {
53 Register Reg = LI.reg(); in calculate()
59 if (LI.hasSubRanges() || (SubReg != 0 && TrackSubRegs)) { in calculate()
64 if (!LI.hasSubRanges() && !LI.empty()) { in calculate()
66 LI.createSubRangeFrom(*Alloc, ClassMask, LI); in calculate()
69 LI.refineSubRanges( in calculate()
80 if (MO.isDef() && !LI.hasSubRanges()) in calculate()
81 createDeadDef(*Indexes, *Alloc, LI, M in calculate()
43 calculate(LiveInterval & LI,bool TrackSubRegs) calculate() argument
107 constructMainRangeFromSubranges(LiveInterval & LI) constructMainRangeFromSubranges() argument
137 extendToUses(LiveRange & LR,Register Reg,LaneBitmask Mask,LiveInterval * LI) extendToUses() argument
[all...]
H A DCalcSpillWeights.cpp82 bool VirtRegAuxInfo::isRematerializable(const LiveInterval &LI, in isRematerializable() argument
86 Register Reg = LI.reg(); in isRematerializable()
88 for (LiveInterval::const_vni_iterator I = LI.vni_begin(), E = LI.vni_end(); in isRematerializable()
132 bool VirtRegAuxInfo::isLiveAtStatepointVarArg(LiveInterval &LI) { in isLiveAtStatepointVarArg() argument
133 return any_of(VRM.getRegInfo().reg_operands(LI.reg()), in isLiveAtStatepointVarArg()
142 void VirtRegAuxInfo::calculateSpillWeightAndHint(LiveInterval &LI) { in calculateSpillWeightAndHint() argument
143 float Weight = weightCalcHelper(LI); in calculateSpillWeightAndHint()
147 LI.setWeight(Weight); in calculateSpillWeightAndHint()
150 static bool canMemFoldInlineAsm(LiveInterval &LI, in canMemFoldInlineAsm() argument
152 for (const MachineOperand &MO : MRI.reg_operands(LI.reg())) { in canMemFoldInlineAsm()
[all …]
H A DRenameIndependentSubregs.cpp78 bool renameComponents(LiveInterval &LI) const;
85 LiveInterval &LI) const;
122 bool RenameIndependentSubregs::renameComponents(LiveInterval &LI) const { in INITIALIZE_PASS_DEPENDENCY()
124 if (LI.valnos.size() < 2) in INITIALIZE_PASS_DEPENDENCY()
129 if (!findComponents(Classes, SubRangeInfos, LI)) in INITIALIZE_PASS_DEPENDENCY()
133 Register Reg = LI.reg(); in INITIALIZE_PASS_DEPENDENCY()
136 Intervals.push_back(&LI); in INITIALIZE_PASS_DEPENDENCY()
157 LiveInterval &LI) const { in findComponents()
161 for (LiveInterval::SubRange &SR : LI.subranges()) { in findComponents()
178 Register Reg = LI.reg(); in findComponents()
[all …]
H A DLiveRangeEdit.cpp40 LiveInterval &LI = LIS.createEmptyInterval(VReg); in createEmptyIntervalFrom() local
42 LI.markNotSpillable(); in createEmptyIntervalFrom()
50 LI.createSubRange(Alloc, S.LaneMask); in createEmptyIntervalFrom()
52 return LI; in createEmptyIntervalFrom()
207 bool LiveRangeEdit::foldAsLoad(LiveInterval *LI, in foldAsLoad() argument
212 for (MachineOperand &MO : MRI.reg_nodbg_operands(LI->reg())) { in foldAsLoad()
248 if (UseMI->readsWritesVirtualRegister(LI->reg(), &Ops).second) in foldAsLoad()
260 DefMI->addRegisterDead(LI->reg(), nullptr); in foldAsLoad()
266 bool LiveRangeEdit::useIsKill(const LiveInterval &LI, in useIsKill() argument
270 if (LI.Query(Idx).isKill()) in useIsKill()
[all …]
H A DInterleavedAccessPass.cpp103 bool lowerInterleavedLoad(LoadInst *LI,
134 LoadInst *LI);
253 LoadInst *LI, SmallVector<Instruction *, 32> &DeadInsts) { in lowerInterleavedLoad() argument
254 if (!LI->isSimple() || isa<ScalableVectorType>(LI->getType())) in lowerInterleavedLoad()
268 for (auto *User : LI->users()) { in lowerInterleavedLoad()
297 cast<FixedVectorType>(LI->getType())->getNumElements(); in lowerInterleavedLoad()
330 if (cast<Instruction>(Shuffle->getOperand(0))->getOperand(0) == LI) in lowerInterleavedLoad()
332 if (cast<Instruction>(Shuffle->getOperand(0))->getOperand(1) == LI) in lowerInterleavedLoad()
342 replaceBinOpShuffles(BinOpShuffles.getArrayRef(), Shuffles, LI); in lowerInterleavedLoad()
344 LLVM_DEBUG(dbgs() << "IA: Found an interleaved load: " << *LI << "\n"); in lowerInterleavedLoad()
[all …]
H A DLiveIntervals.cpp213 bool LiveIntervals::computeVirtRegInterval(LiveInterval &LI) { in computeVirtRegInterval() argument
215 assert(LI.empty() && "Should only compute empty intervals."); in computeVirtRegInterval()
217 LICalc->calculate(LI, MRI->shouldTrackSubRegLiveness(LI.reg())); in computeVirtRegInterval()
218 return computeDeadValues(LI, nullptr); in computeVirtRegInterval()
226 LiveInterval &LI = createEmptyInterval(Reg); in computeVirtRegs() local
227 bool NeedSplit = computeVirtRegInterval(LI); in computeVirtRegs()
230 splitSeparateComponents(LI, SplitLIs); in computeVirtRegs()
356 for (const auto &LI : MBB.liveins()) { in computeLiveInRegUnits() local
357 for (MCRegUnit Unit : TRI->regunits(LI.PhysReg)) { in computeLiveInRegUnits()
409 const LiveInterval &LI = getInterval(Reg); in extendSegmentsToUses() local
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DFixIrreducible.cpp115 static void reconnectChildLoops(LoopInfo &LI, Loop *ParentLoop, Loop *NewLoop, in INITIALIZE_PASS_DEPENDENCY()
119 : LI.getTopLevelLoopsVector(); in INITIALIZE_PASS_DEPENDENCY()
138 if (LI.getLoopFor(BB) != Child) in INITIALIZE_PASS_DEPENDENCY()
140 LI.changeLoopFor(BB, NewLoop); in INITIALIZE_PASS_DEPENDENCY()
150 LI.destroy(Child); in INITIALIZE_PASS_DEPENDENCY()
164 static void createNaturalLoopInternal(LoopInfo &LI, DominatorTree &DT,
202 auto NewLoop = LI.AllocateLoop(); in createNaturalLoopInternal()
206 LI.addTopLevelLoop(NewLoop); in createNaturalLoopInternal()
216 NewLoop->addBasicBlockToLoop(G, LI); in createNaturalLoopInternal()
222 if (LI in createNaturalLoopInternal()
167 createNaturalLoopInternal(LoopInfo & LI,DominatorTree & DT,Loop * ParentLoop,SetVector<BasicBlock * > & Blocks,SetVector<BasicBlock * > & Headers) createNaturalLoopInternal() argument
256 createNaturalLoop(LoopInfo & LI,DominatorTree & DT,Function * F,SetVector<BasicBlock * > & Blocks,SetVector<BasicBlock * > & Headers) createNaturalLoop() argument
262 createNaturalLoop(LoopInfo & LI,DominatorTree & DT,Loop & L,SetVector<BasicBlock * > & Blocks,SetVector<BasicBlock * > & Headers) createNaturalLoop() argument
270 makeReducible(LoopInfo & LI,DominatorTree & DT,Graph && G) makeReducible() argument
316 FixIrreducibleImpl(Function & F,LoopInfo & LI,DominatorTree & DT) FixIrreducibleImpl() argument
344 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo(); runOnFunction() local
351 auto &LI = AM.getResult<LoopAnalysis>(F); run() local
[all...]
H A DMatrixUtils.cpp26 LoopInfo &LI) { in CreateLoop() argument
60 L->addBasicBlockToLoop(Header, LI); in CreateLoop()
61 L->addBasicBlockToLoop(Body, LI); in CreateLoop()
62 L->addBasicBlockToLoop(Latch, LI); in CreateLoop()
72 LoopInfo &LI) { in CreateTiledLoops() argument
73 Loop *ColumnLoopInfo = LI.AllocateLoop(); in CreateTiledLoops()
74 Loop *RowLoopInfo = LI.AllocateLoop(); in CreateTiledLoops()
75 Loop *KLoopInfo = LI.AllocateLoop(); in CreateTiledLoops()
78 if (Loop *ParentL = LI.getLoopFor(Start)) in CreateTiledLoops()
81 LI.addTopLevelLoop(ColumnLoopInfo); in CreateTiledLoops()
[all …]
H A DPromoteMemoryToRegister.cpp68 if (const LoadInst *LI = dyn_cast<LoadInst>(U)) { in isAllocaPromotable() local
71 if (LI->isVolatile() || LI->getType() != AI->getAllocatedType()) in isAllocaPromotable()
254 LoadInst *LI = cast<LoadInst>(User); in AnalyzeAlloca() local
257 UsingBlocks.push_back(LI->getParent()); in AnalyzeAlloca()
446 static void addAssumeNonNull(AssumptionCache *AC, LoadInst *LI) { in addAssumeNonNull() argument
448 Intrinsic::getDeclaration(LI->getModule(), Intrinsic::assume); in addAssumeNonNull()
449 ICmpInst *LoadNotNull = new ICmpInst(ICmpInst::ICMP_NE, LI, in addAssumeNonNull()
450 Constant::getNullValue(LI->getType())); in addAssumeNonNull()
451 LoadNotNull->insertAfter(LI); in addAssumeNonNull()
457 static void convertMetadataToAssumes(LoadInst *LI, Value *Val, in convertMetadataToAssumes() argument
[all …]
H A DLoopSimplify.cpp119 LoopInfo *LI, MemorySSAUpdater *MSSAU, in InsertPreheaderForLoop() argument
141 LI, MSSAU, PreserveLCSSA); in InsertPreheaderForLoop()
216 DominatorTree *DT, LoopInfo *LI, in separateNestedLoop() argument
273 DT, LI, MSSAU, PreserveLCSSA); in separateNestedLoop()
280 Loop *NewOuter = LI->AllocateLoop(); in separateNestedLoop()
286 LI->changeTopLevelLoop(L, NewOuter); in separateNestedLoop()
324 if ((*LI)[BB] == L) { in separateNestedLoop()
325 LI->changeLoopFor(BB, NewOuter); in separateNestedLoop()
334 formDedicatedExitBlocks(L, DT, LI, MSSAU, PreserveLCSSA); in separateNestedLoop()
343 formLCSSA(*L, *DT, LI, SE); in separateNestedLoop()
[all …]
H A DLCSSA.cpp78 const DominatorTree &DT, const LoopInfo &LI, in formLCSSAForInstructions() argument
98 Loop *L = LI.getLoopFor(InstBB); in formLCSSAForInstructions()
200 if (auto *OtherLoop = LI.getLoopFor(ExitBB)) in formLCSSAForInstructions()
280 if (auto *OtherLoop = LI.getLoopFor(InsertedPN->getParent())) in formLCSSAForInstructions()
363 bool llvm::formLCSSA(Loop &L, const DominatorTree &DT, const LoopInfo *LI, in formLCSSA() argument
371 assert(SubLoop->isRecursivelyLCSSAForm(DT, *LI) && "Subloop not in LCSSA!"); in formLCSSA()
396 if (LI->getLoopFor(BB) != &L) in formLCSSA()
417 Changed = formLCSSAForInstructions(Worklist, DT, *LI, SE); in formLCSSA()
426 const LoopInfo *LI, ScalarEvolution *SE) { in formLCSSARecursively() argument
431 Changed |= formLCSSARecursively(*SubLoop, DT, LI, SE); in formLCSSARecursively()
[all …]
H A DUnifyLoopExits.cpp143 static bool unifyLoopExits(DominatorTree &DT, LoopInfo &LI, Loop *L) { in unifyLoopExits() argument
158 auto SL = LI.getLoopFor(S); in unifyLoopExits()
204 ParentLoop->addBasicBlockToLoop(G, LI); in unifyLoopExits()
210 LI.verify(DT); in unifyLoopExits()
216 static bool runImpl(LoopInfo &LI, DominatorTree &DT) { in runImpl() argument
219 auto Loops = LI.getLoopsInPreorder(); in runImpl()
222 << LI.getLoopDepth(L->getHeader()) << ")\n"); in runImpl()
223 Changed |= unifyLoopExits(DT, LI, L); in runImpl()
231 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo(); in runOnFunction() local
236 return runImpl(LI, DT); in runOnFunction()
[all …]
/freebsd/contrib/llvm-project/llvm/tools/llvm-diff/lib/
H A DDifferenceEngine.cpp304 BasicBlock::const_iterator LI = L->begin(), LE = L->end(); in diff() local
308 assert(LI != LE && RI != R->end()); in diff()
309 const Instruction *LeftI = &*LI, *RightI = &*RI; in diff()
327 ++LI; in diff()
329 } while (LI != LE); // This is sufficient: we can't get equality of in diff()
334 for (LI = L->begin(), RI = R->begin(); LI != LE; ++LI, ++RI) in diff()
335 unify(&*LI, &*RI); in diff()
339 void runBlockDiff(BasicBlock::const_iterator LI,
389 const PHINode &LI = cast<PHINode>(*L); in diff() local
393 if (LI.getType() != RI.getType()) { in diff()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/Analysis/
H A DSPIRVConvergenceRegionAnalysis.cpp123 ConvergenceRegion::ConvergenceRegion(DominatorTree &DT, LoopInfo &LI, in ConvergenceRegion() argument
125 : DT(DT), LI(LI), Parent(nullptr) { in ConvergenceRegion()
136 DominatorTree &DT, LoopInfo &LI, in ConvergenceRegion() argument
139 : DT(DT), LI(LI), ConvergenceToken(ConvergenceToken), Entry(Entry), in ConvergenceRegion()
201 ConvergenceRegionAnalyzer(Function &F, DominatorTree &DT, LoopInfo &LI) in ConvergenceRegionAnalyzer() argument
202 : DT(DT), LI(LI), F(F) {} in ConvergenceRegionAnalyzer()
212 if (!LI.isLoopHeader(To)) in isBackEdge()
215 auto *L = LI.getLoopFor(To); in isBackEdge()
223 findPathsToMatch(LoopInfo &LI, BasicBlock *From, in findPathsToMatch() argument
236 auto ChildSet = findPathsToMatch(LI, To, isMatch); in findPathsToMatch()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/NVPTX/
H A DNVPTXLowerAggrCopies.cpp71 if (LoadInst *LI = dyn_cast<LoadInst>(&I)) { in runOnFunction() local
72 if (!LI->hasOneUse()) in runOnFunction()
75 if (DL.getTypeStoreSize(LI->getType()) < MaxAggrCopySize) in runOnFunction()
78 if (StoreInst *SI = dyn_cast<StoreInst>(LI->user_back())) { in runOnFunction()
79 if (SI->getOperand(0) != LI) in runOnFunction()
81 AggrLoads.push_back(LI); in runOnFunction()
104 for (LoadInst *LI : AggrLoads) { in runOnFunction()
105 auto *SI = cast<StoreInst>(*LI->user_begin()); in runOnFunction()
106 Value *SrcAddr = LI->getOperand(0); in runOnFunction()
108 unsigned NumLoads = DL.getTypeStoreSize(LI->getType()); in runOnFunction()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DCFG.cpp128 static const Loop *getOutermostLoop(const LoopInfo *LI, const BasicBlock *BB) { in getOutermostLoop() argument
129 const Loop *L = LI->getLoopFor(BB); in getOutermostLoop()
137 const DominatorTree *DT, const LoopInfo *LI) { in isReachableImpl() argument
158 if (LI && ExclusionSet) { in isReachableImpl()
160 if (const Loop *L = getOutermostLoop(LI, BB)) in isReachableImpl()
166 if (LI) { in isReachableImpl()
168 if (const Loop *L = getOutermostLoop(LI, StopSetBB)) in isReachableImpl()
191 if (LI) { in isReachableImpl()
192 Outer = getOutermostLoop(LI, BB); in isReachableImpl()
242 const LoopInfo *LI) { in isPotentiallyReachableFromMany() argument
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineLoadStoreAlloca.cpp76 if (auto *LI = dyn_cast<LoadInst>(I)) { in isOnlyCopiedFromConstantMemory() local
78 if (!LI->isSimple()) return false; in isOnlyCopiedFromConstantMemory()
562 LoadInst *InstCombinerImpl::combineLoadToNewType(LoadInst &LI, Type *NewTy, in combineLoadToNewType() argument
564 assert((!LI.isAtomic() || isSupportedAtomicType(NewTy)) && in combineLoadToNewType()
568 Builder.CreateAlignedLoad(NewTy, LI.getPointerOperand(), LI.getAlign(), in combineLoadToNewType()
569 LI.isVolatile(), LI.getName() + Suffix); in combineLoadToNewType()
570 NewLoad->setAtomic(LI.getOrdering(), LI.getSyncScopeID()); in combineLoadToNewType()
571 copyMetadataForLoad(*NewLoad, LI); in combineLoadToNewType()
693 static Instruction *unpackLoadToAggregate(InstCombinerImpl &IC, LoadInst &LI) { in unpackLoadToAggregate() argument
696 if (!LI.isSimple()) in unpackLoadToAggregate()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopSimplifyCFG.cpp90 Loop &L, LoopInfo &LI) { in getInnermostLoopFor() argument
93 Loop *BBL = LI.getLoopFor(BB); in getInnermostLoopFor()
112 LoopInfo &LI; member in __anona0e87c8a0111::ConstantTerminatorFoldingImpl
192 if (L.contains(Succ) && !LI.isLoopHeader(Succ) && RPO[BB] > RPO[Succ]) in hasIrreducibleCFG()
204 DFS.perform(&LI); in analyze()
236 bool TakeFoldCandidate = TheOnlySucc && LI.getLoopFor(BB) == &L; in analyze()
274 return !TheOnlySucc || TheOnlySucc == To || LI.getLoopFor(From) != &L; in analyze()
353 Preheader, Preheader->getTerminator(), &DT, &LI, MSSAU); in handleDeadExits()
384 if (Loop *OuterLoop = LI.getLoopFor(Preheader)) { in handleDeadExits()
389 Loop *StillReachable = getInnermostLoopFor(LiveExitBlocks, L, LI); in handleDeadExits()
[all …]
H A DSink.cpp66 DominatorTree &DT, LoopInfo &LI) { in IsAcceptableTarget() argument
91 Loop *succ = LI.getLoopFor(SuccToSinkTo); in IsAcceptableTarget()
92 Loop *cur = LI.getLoopFor(Inst->getParent()); in IsAcceptableTarget()
104 DominatorTree &DT, LoopInfo &LI, AAResults &AA) { in SinkInstruction()
156 !IsAcceptableTarget(Inst, SuccToSinkTo, DT, LI)) in SinkInstruction()
175 static bool ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInfo &LI, in ProcessBlock() argument
201 if (SinkInstruction(Inst, Stores, DT, LI, AA)) { in ProcessBlock()
213 LoopInfo &LI, AAResults &AA) { in iterativelySinkInstructions() argument
221 MadeChange |= ProcessBlock(I, DT, LI, AA); in iterativelySinkInstructions()
231 auto &LI in run() local
105 SinkInstruction(Instruction * Inst,SmallPtrSetImpl<Instruction * > & Stores,DominatorTree & DT,LoopInfo & LI,AAResults & AA) SinkInstruction() argument
252 auto &LI = getAnalysis<LoopInfoWrapperPass>().getLoopInfo(); runOnFunction() local
[all...]
H A DSimpleLoopUnswitch.cpp194 const LoopInfo &LI) { in collectHomogenousInstGraphLoopInvariants() argument
410 DominatorTree &DT, LoopInfo &LI, in hoistLoopToNewParent() argument
421 if (Loop *ExitL = LI.getLoopFor(ExitBB)) in hoistLoopToNewParent()
435 assert(OldParentL == LI.getLoopFor(&Preheader) && in hoistLoopToNewParent()
437 LI.changeLoopFor(&Preheader, NewParentL); in hoistLoopToNewParent()
446 LI.addTopLevelLoop(&L); in hoistLoopToNewParent()
465 formLCSSA(*OldContainingL, DT, &LI, SE); in hoistLoopToNewParent()
472 formDedicatedExitBlocks(OldContainingL, &DT, &LI, MSSAU, in hoistLoopToNewParent()
481 const LoopInfo &LI) { in getTopMostExitingLoop() argument
482 Loop *TopMost = LI.getLoopFor(ExitBB); in getTopMostExitingLoop()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DLoopExtractor.cpp79 bool extractLoops(Loop::iterator From, Loop::iterator To, LoopInfo &LI,
81 bool extractLoop(Loop *L, LoopInfo &LI, DominatorTree &DT);
170 LoopInfo &LI = LookupLoopInfo(F); in runOnFunction() local
173 if (LI.empty()) in runOnFunction()
180 if (std::next(LI.begin()) != LI.end()) in runOnFunction()
181 return Changed | extractLoops(LI.begin(), LI.end(), LI, DT); in runOnFunction()
184 Loop *TLL = *LI.begin(); in runOnFunction()
210 return Changed | extractLoop(TLL, LI, DT); in runOnFunction()
217 return Changed | extractLoops(TLL->begin(), TLL->end(), LI, DT); in runOnFunction()
221 LoopInfo &LI, DominatorTree &DT) { in extractLoops() argument
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DBasicBlockUtils.h97 LoopInfo *LI = nullptr,
112 DomTreeUpdater *DTU = nullptr, LoopInfo *LI = nullptr);
148 LoopInfo *LI; member
154 /// SplitCriticalEdge is guaranteed to preserve loop-simplify form if LI is
160 LoopInfo *LI = nullptr,
163 : DT(DT), PDT(PDT), LI(LI), MSSAU(MSSAU) {} in DT()
252 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr,
284 LoopInfo *LI = nullptr,
288 LoopInfo *LI
[all...]
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopAnalysisManager.h57 LoopInfo &LI; member
90 explicit Result(LoopAnalysisManager &InnerAM, LoopInfo &LI) in Result() argument
91 : InnerAM(&InnerAM), LI(&LI) {} in Result()
93 : InnerAM(std::move(Arg.InnerAM)), LI(Arg.LI), MSSAUsed(Arg.MSSAUsed) { in Result()
101 LI = RHS.LI;
139 LoopInfo *LI; variable
/freebsd/contrib/llvm-project/llvm/lib/TableGen/
H A DStringMatcher.cpp113 for (const auto &LI : MatchesByLetter) { in EmitStringMatcherForChar() local
115 OS << Indent << "case '" << LI.first << "':\t // " << LI.second.size() in EmitStringMatcherForChar()
117 if (LI.second.size() != 1) in EmitStringMatcherForChar()
120 if (EmitStringMatcherForChar(LI.second, CharNo + 1, IndentCount + 1, in EmitStringMatcherForChar()
146 for (const auto &LI : MatchesByLength) { in Emit() local
148 << "case " << LI.first << ":\t // " << LI.second.size() << " string" in Emit()
149 << (LI.second.size() == 1 ? "" : "s") << " to match.\n"; in Emit()
150 if (EmitStringMatcherForChar(LI.second, 0, Indent, IgnoreDuplicates)) in Emit()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DDebugLocStream.h60 const List &getList(size_t LI) const { return Lists[LI]; } in getNumLists()
80 size_t LI = Lists.size(); in startList()
82 return LI; in startList()
110 size_t LI = getIndex(L); in getEntries()
111 return ArrayRef(Entries).slice(Lists[LI].EntryOffset, getNumEntries(LI)); in getEntries() local
136 size_t getNumEntries(size_t LI) const { in getIndex()
137 if (LI + 1 == Lists.size()) in getNumEntries() argument
138 return Entries.size() - Lists[LI] in getNumEntries()
61 getList(size_t LI) getList() argument
81 size_t LI = Lists.size(); startList() local
[all...]

12345678910>>...21