Home
last modified time | relevance | path

Searched refs:Entries (Results 1 – 25 of 181) sorted by relevance

12345678

/freebsd/contrib/llvm-project/clang/lib/CodeGen/
H A DSwiftCallingConv.cpp280 if (Entries.empty() || Entries.back().End <= begin) { in addEntry()
281 Entries.push_back({begin, end, type}); in addEntry()
287 size_t index = Entries.size() - 1; in addEntry()
289 if (Entries[index - 1].End <= begin) break; in addEntry()
295 if (Entries[index].Begin >= end) { in addEntry()
299 Entries.insert(Entries.begin() + index, {begin, end, type}); in addEntry()
308 if (Entries[index].Begin == begin && Entries[index].End == end) { in addEntry()
310 if (Entries[index].Type == type) return; in addEntry()
313 if (Entries[index].Type == nullptr) { in addEntry()
316 Entries[index].Type = nullptr; in addEntry()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DDebugLocStream.h48 SmallVector<Entry, 32> Entries;
81 Lists.emplace_back(CU, Entries.size()); in startList()
98 Entries.push_back({BeginSym, EndSym, DWARFBytes.size(), Comments.size()}); in startEntry()
111 return ArrayRef(Entries).slice(Lists[LI].EntryOffset, getNumEntries(LI)); in getEntries()
117 .slice(Entries[EI].ByteOffset, getNumBytes(EI)); in getBytes()
121 return ArrayRef(Comments).slice(Entries[EI].CommentOffset, in getComments()
132 assert(&Entries.front() <= &E && &E <= &Entries.back() && in getIndex()
134 return &E - &Entries.front(); in getIndex()
138 return Entries in getNumEntries()
49 SmallVector<Entry, 32> Entries; global() variable
[all...]
H A DDbgEntityHistoryCalculator.cpp76 auto &Entries = VarEntries[Var]; in startDbgValue() local
77 if (!Entries.empty() && Entries.back().isDbgValue() && in startDbgValue()
78 !Entries.back().isClosed() && in startDbgValue()
79 Entries.back().getInstr()->isEquivalentDbgInstr(MI)) { in startDbgValue()
81 << "\t" << Entries.back().getInstr() << "\t" << MI in startDbgValue()
85 Entries.emplace_back(&MI, Entry::DbgValue); in startDbgValue()
86 NewIndex = Entries.size() - 1; in startDbgValue()
92 auto &Entries = VarEntries[Var]; in startClobber() local
95 if (Entries.back().isClobber() && Entries.back().getInstr() == &MI) in startClobber()
96 return Entries.size() - 1; in startClobber()
[all …]
H A DDebugLocStream.cpp16 if (Lists.back().EntryOffset == Entries.size()) { in finalizeList()
28 if (Entries.back().ByteOffset != DWARFBytes.size()) in finalizeEntry()
32 Comments.erase(Comments.begin() + Entries.back().CommentOffset, in finalizeEntry()
34 Entries.pop_back(); in finalizeEntry()
36 assert(Lists.back().EntryOffset <= Entries.size() && in finalizeEntry()
H A DDwarfStringPool.cpp84 SmallVector<const StringMapEntry<EntryTy> *, 64> Entries( in emit() local
87 llvm::sort(Entries, [](const StringMapEntry<EntryTy> *A, in emit()
92 for (const auto &Entry : Entries) { in emit()
111 Entries.resize(NumIndexedStrings); in emit()
114 Entries[Entry.getValue().Index] = &Entry; in emit()
119 for (const auto &Entry : Entries) in emit()
H A DDebugHandlerBase.cpp293 const auto &Entries = I.second; in beginFunction() local
294 if (Entries.empty()) in beginFunction()
312 Entries.front().getInstr()->getDebugVariable(); in beginFunction()
315 if (!IsDescribedByReg(Entries.front().getInstr())) in beginFunction()
316 LabelsBeforeInsn[Entries.front().getInstr()] = Asm->getFunctionBegin(); in beginFunction()
317 if (Entries.front().getInstr()->getDebugExpression()->isFragment()) { in beginFunction()
319 for (const auto *I = Entries.begin(); I != Entries.end(); ++I) { in beginFunction()
323 if (std::any_of(Entries.begin(), I, in beginFunction()
341 for (const auto &Entry : Entries) { in beginFunction()
/freebsd/contrib/llvm-project/clang/lib/Tooling/DependencyScanning/
H A DInProcessModuleCache.cpp54 ModuleCacheEntries &Entries; member in __anond09638f40111::InProcessModuleCache
63 InProcessModuleCache(ModuleCacheEntries &Entries) : Entries(Entries) {} in InProcessModuleCache() argument
69 std::lock_guard<std::mutex> Lock(Entries.Mutex); in getLock()
70 auto &Entry = Entries.Map[Filename]; in getLock()
80 std::lock_guard<std::mutex> Lock(Entries.Mutex); in getModuleTimestamp()
81 auto &Entry = Entries.Map[Filename]; in getModuleTimestamp()
93 std::lock_guard<std::mutex> Lock(Entries.Mutex); in updateModuleTimestamp()
94 auto &Entry = Entries.Map[Filename]; in updateModuleTimestamp()
111 dependencies::makeInProcessModuleCache(ModuleCacheEntries &Entries) { in makeInProcessModuleCache() argument
112 return llvm::makeIntrusiveRefCnt<InProcessModuleCache>(Entries); in makeInProcessModuleCache()
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/LogicalView/Core/
H A DLVStringPool.h34 std::vector<ValueType *> Entries; variable
47 size_t getSize() const { return Entries.size() - 1; } in getSize()
62 size_t Value = Entries.size(); in getIndex()
65 Entries.push_back(Entry); in getIndex()
71 return (Index >= Entries.size()) ? StringRef() : Entries[Index]->getKey(); in getString()
75 if (!Entries.empty()) { in print()
77 for (const ValueType *Entry : Entries) in print()
/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyCFGSort.cpp223 SmallVector<Entry, 4> Entries; in sortBlocks() local
231 Entries.push_back(Entry(R)); in sortBlocks()
235 for (Entry &E : Entries) in sortBlocks()
239 while (!Entries.empty() && Entries.back().NumBlocksLeft == 0) in sortBlocks()
240 Entries.pop_back(); in sortBlocks()
265 for (Entry &E : Entries) { in sortBlocks()
286 if (!Entries.empty() && in sortBlocks()
287 !MDT.dominates(Entries.back().TheRegion->getHeader(), Next)) { in sortBlocks()
288 Entries.back().Deferred.push_back(Next); in sortBlocks()
317 if (!Entries.empty() && in sortBlocks()
[all …]
H A DWebAssemblyFixIrreducibleControlFlow.cpp70 static BlockVector getSortedEntries(const BlockSet &Entries) { in getSortedEntries() argument
71 BlockVector SortedEntries(Entries.begin(), Entries.end()); in getSortedEntries()
243 void makeSingleEntryLoop(BlockSet &Entries, BlockSet &Blocks,
338 BlockSet &Entries, BlockSet &Blocks, MachineFunction &MF, in makeSingleEntryLoop() argument
340 assert(Entries.size() >= 2); in makeSingleEntryLoop()
343 BlockVector SortedEntries = getSortedEntries(Entries); in makeSingleEntryLoop()
405 if (!Entries.count(Entry)) in makeSingleEntryLoop()
421 if (Entries.count(Entry) && Pred->isLayoutSuccessor(Entry)) in makeSingleEntryLoop()
434 if (!Entries.count(Entry) || Map.count({Entry, PredInLoop})) in makeSingleEntryLoop()
470 if (!Entries.count(Succ)) in makeSingleEntryLoop()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGenericCycleInfo.h59 SmallVector<BlockT *, 1> Entries; variable
81 Entries.clear(); in clear()
90 Entries.push_back(Block); in appendEntry()
108 bool isReducible() const { return Entries.size() == 1; } in isReducible()
110 BlockT *getHeader() const { return Entries[0]; } in getHeader()
113 return Entries; in getEntries()
123 return is_contained(Entries, Block); in isEntry()
129 Entries.clear(); in setSingleEntry()
130 Entries.push_back(Block); in setSingleEntry()
219 const_entry_iterator entry_begin() const { return Entries.begin(); } in entry_begin()
[all …]
H A DConcurrentHashtable.h138 DataPtr Entries = new EntryDataTy[InitialBucketSize]; in MultiThreadAllocator() local
139 memset(Entries, 0, sizeof(EntryDataTy) * InitialBucketSize); in MultiThreadAllocator()
143 BucketsArray[Idx].Entries = Entries; in MultiThreadAllocator()
164 delete[] BucketsArray[Idx].Entries; in ~ConcurrentHashTableByPtr()
184 DataPtr BucketEntries = CurBucket.Entries; in insert()
290 DataPtr Entries = nullptr; member
314 DataPtr SrcEntries = CurBucket.Entries; in RehashBucket()
352 CurBucket.Entries = DestEntries; in RehashBucket()
/freebsd/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_interceptors_ioctl_netbsd.inc45 /* Entries from file: altq/altq_afmap.h */
50 /* Entries from file: altq/altq.h */
54 /* Entries from file: altq/altq_blue.h */
59 /* Entries from file: altq/altq_cbq.h */
66 /* Entries from file: altq/altq_cdnr.h */
80 /* Entries from file: altq/altq_fifoq.h */
83 /* Entries from file: altq/altq_hfsc.h */
87 /* Entries from file: altq/altq_jobs.h */
95 /* Entries from file: altq/altq_priq.h */
104 /* Entries from file: altq/altq_red.h */
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
H A DTableManager.h35 auto EntryI = Entries.find(Target.getName()); in getEntryForTarget()
38 if (EntryI == Entries.end()) { in getEntryForTarget()
44 EntryI = Entries.insert(std::make_pair(Target.getName(), &Entry)).first; in getEntryForTarget()
47 assert(EntryI != Entries.end() && "Could not get entry symbol"); in getEntryForTarget()
63 auto Res = Entries.insert({ in registerPreExistingEntry()
72 DenseMap<orc::SymbolStringPtr, Symbol *> Entries; variable
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DDbgEntityHistoryCalculator.h95 using Entries = SmallVector<Entry, 4>; variable
97 using EntriesMap = MapVector<InlinedEntity, Entries>;
108 auto &Entries = VarEntries[Var]; in getEntry() local
109 return Entries[Index]; in getEntry()
114 bool hasNonEmptyLocation(const Entries &Entries) const;
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/
H A DDebugInlineeLinesSubsection.cpp72 Size += Entries.size() * sizeof(InlineeSourceLineHeader); in calculateSerializedSize()
75 Size += Entries.size() * sizeof(uint32_t); in calculateSerializedSize()
92 for (const auto &E : Entries) { in commit()
111 auto &Entry = Entries.back(); in addExtraFile()
121 Entries.emplace_back(); in addInlineSite()
122 auto &Entry = Entries.back(); in addInlineSite()
/freebsd/contrib/llvm-project/llvm/lib/MCA/HardwareUnits/
H A DRetireControlUnit.cpp45 unsigned Entries = normalizeQuantity(Inst.getNumMicroOps()); in dispatch() local
46 assert((AvailableEntries >= Entries) && "Reorder Buffer unavailable!"); in dispatch()
49 Queue[NextAvailableSlotIdx] = {IR, Entries, false}; in dispatch()
50 NextAvailableSlotIdx += std::max(1U, Entries); in dispatch()
54 AvailableEntries -= Entries; in dispatch()
/freebsd/contrib/llvm-project/libunwind/src/
H A DFrameHeaderCache.hpp50 CacheEntry Entries[kCacheEntryCount]; member in FrameHeaderCache
57 Unused = &Entries[0]; in resetCache()
59 Entries[i].Next = &Entries[i + 1]; in resetCache()
61 Entries[kCacheEntryCount - 1].Next = nullptr; in resetCache()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DInterferenceCache.cpp58 for (Entry &E : Entries) in init()
64 if (E < CacheEntries && Entries[E].getPhysReg() == PhysReg) { in get()
65 if (!Entries[E].valid(LIUArray, TRI)) in get()
66 Entries[E].revalidate(LIUArray, TRI); in get()
67 return &Entries[E]; in get()
75 if (Entries[E].hasRefs()) { in get()
80 Entries[E].reset(PhysReg, LIUArray, TRI, MF); in get()
82 return &Entries[E]; in get()
/freebsd/contrib/llvm-project/llvm/lib/MC/
H A DMCSchedule.cpp167 MCSchedModel::getForwardingDelayCycles(ArrayRef<MCReadAdvanceEntry> Entries, in getForwardingDelayCycles() argument
169 if (Entries.empty()) in getForwardingDelayCycles()
173 for (const MCReadAdvanceEntry &E : Entries) { in getForwardingDelayCycles()
185 ArrayRef<MCReadAdvanceEntry> Entries = STI.getReadAdvanceEntries(SCDesc); in getBypassDelayCycles() local
186 if (Entries.empty()) in getBypassDelayCycles()
207 for (const MCReadAdvanceEntry &E : Entries) { in getBypassDelayCycles()
H A DConstantPools.cpp27 if (Entries.empty()) in emitEntries()
30 for (const ConstantPoolEntry &Entry : Entries) { in emitEntries()
36 Entries.clear(); in emitEntries()
61 Entries.push_back(ConstantPoolEntry(CPEntryLabel, Value, Size, Loc)); in addEntry()
70 bool ConstantPool::empty() { return Entries.empty(); } in empty()
/freebsd/contrib/llvm-project/llvm/utils/TableGen/
H A DSearchableTableEmitter.cpp57 MapVector<const Record *, Entry> Entries; member
60 auto II = Entries.find(Def); in getEntry()
61 if (II == Entries.end()) in getEntry()
92 std::vector<const Record *> Entries; member
341 make_second_range(Enum.Entries.getArrayRef())) in emitGenericEnum()
364 IndexRows = Table.Entries; in emitLookupFunction()
377 std::vector<std::pair<const Record *, unsigned>> Entries; in emitLookupFunction() local
378 Entries.reserve(Table.Entries.size()); in emitLookupFunction()
379 for (auto [Idx, TblEntry] : enumerate(Table.Entries)) in emitLookupFunction()
380 Entries.emplace_back(TblEntry, Idx); in emitLookupFunction()
[all …]
H A DRegisterBankEmitter.cpp305 SmallVector<Entry, 0> Entries; in emitBaseClassImplementation() local
308 if (RC->EnumValue >= Entries.size()) in emitBaseClassImplementation()
309 Entries.resize(RC->EnumValue + 1); in emitBaseClassImplementation()
310 Entry &E = Entries[RC->EnumValue]; in emitBaseClassImplementation()
320 for (auto &E : Entries) { in emitBaseClassImplementation()
335 Entries.size() / ElemsPerWord + ((Entries.size() % ElemsPerWord) > 0); in emitBaseClassImplementation()
340 for (auto &E : Entries) { in emitBaseClassImplementation()
365 << Entries.size() in emitBaseClassImplementation()
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFDebugFrame.h200 std::vector<std::unique_ptr<dwarf::FrameEntry>> Entries; variable
201 using iterator = pointee_iterator<decltype(Entries)::const_iterator>;
224 bool empty() const { return Entries.empty(); } in empty()
227 iterator begin() const { return Entries.begin(); } in begin()
228 iterator end() const { return Entries.end(); } in end()
230 return iterator_range<iterator>(Entries.begin(), Entries.end()); in entries()
/freebsd/sys/contrib/dev/acpica/common/
H A Ddmtbdump.c432 UINT32 Entries; in AcpiDmDumpRsdt() local
444 Entries = (Table->Length - sizeof (ACPI_TABLE_HEADER)) / sizeof (UINT32); in AcpiDmDumpRsdt()
446 for (i = 0; i < Entries; i++) in AcpiDmDumpRsdt()
472 UINT32 Entries; in AcpiDmDumpXsdt() local
484 Entries = (Table->Length - sizeof (ACPI_TABLE_HEADER)) / sizeof (UINT64); in AcpiDmDumpXsdt()
486 for (i = 0; i < Entries; i++) in AcpiDmDumpXsdt()

12345678