Home
last modified time | relevance | path

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

1234567

/freebsd-13.1/contrib/llvm-project/clang/lib/CodeGen/
H A DSwiftCallingConv.cpp279 if (Entries.empty() || Entries.back().End <= begin) { in addEntry()
298 Entries.insert(Entries.begin() + index, {begin, end, type}); in addEntry()
307 if (Entries[index].Begin == begin && Entries[index].End == end) { in addEntry()
350 if (Entries[index].Type && Entries[index].Type->isVectorTy()) { in addEntry()
371 if (index == Entries.size() - 1 || end <= Entries[index + 1].Begin) { in addEntry()
377 Entries[index].End = Entries[index + 1].Begin; in addEntry()
406 Entries.insert(Entries.begin() + index + 1, numElts - 1, StorageEntry()); in splitVectorEntry()
468 if (Entries.empty()) { in finish()
482 if (shouldMergeEntries(Entries[i - 1], Entries[i], chunkSize)) { in finish()
485 Entries[i - 1].End = Entries[i].Begin; in finish()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DDebugLocStream.h49 SmallVector<Entry, 32> Entries; variable
82 Lists.emplace_back(CU, Entries.size()); in startList()
112 return makeArrayRef(Entries) in getEntries()
119 .slice(Entries[EI].ByteOffset, getNumBytes(EI)); in getBytes()
134 assert(&Entries.front() <= &E && &E <= &Entries.back() && in getIndex()
136 return &E - &Entries.front(); in getIndex()
140 return Entries.size() - Lists[LI].EntryOffset; in getNumEntries()
144 if (EI + 1 == Entries.size()) in getNumBytes()
146 return Entries[EI + 1].ByteOffset - Entries[EI].ByteOffset; in getNumBytes()
149 if (EI + 1 == Entries.size()) in getNumComments()
[all …]
H A DDwarfStringPool.cpp84 SmallVector<const StringMapEntry<EntryTy> *, 64> Entries; in emit() local
85 Entries.reserve(Pool.size()); in emit()
88 Entries.push_back(&E); in emit()
90 llvm::sort(Entries, [](const StringMapEntry<EntryTy> *A, in emit()
95 for (const auto &Entry : Entries) { in emit()
114 Entries.resize(NumIndexedStrings); in emit()
117 Entries[Entry.getValue().Index] = &Entry; in emit()
122 for (const auto &Entry : Entries) in emit()
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 DDbgEntityHistoryCalculator.cpp77 auto &Entries = VarEntries[Var]; in startDbgValue() local
78 if (!Entries.empty() && Entries.back().isDbgValue() && in startDbgValue()
79 !Entries.back().isClosed() && in startDbgValue()
87 NewIndex = Entries.size() - 1; in startDbgValue()
93 auto &Entries = VarEntries[Var]; in startClobber() local
96 if (Entries.back().isClobber() && Entries.back().getInstr() == &MI) in startClobber()
97 return Entries.size() - 1; in startClobber()
99 return Entries.size() - 1; in startClobber()
260 bool DbgValueHistoryMap::hasNonEmptyLocation(const Entries &Entries) const { in hasNonEmptyLocation()
261 for (const auto &Entry : Entries) { in hasNonEmptyLocation()
[all …]
H A DDebugHandlerBase.cpp275 const auto &Entries = I.second; in beginFunction() local
276 if (Entries.empty()) in beginFunction()
294 Entries.front().getInstr()->getDebugVariable(); in beginFunction()
297 if (!IsDescribedByReg(Entries.front().getInstr())) in beginFunction()
298 LabelsBeforeInsn[Entries.front().getInstr()] = Asm->getFunctionBegin(); in beginFunction()
299 if (Entries.front().getInstr()->getDebugExpression()->isFragment()) { in beginFunction()
301 for (auto I = Entries.begin(); I != Entries.end(); ++I) { in beginFunction()
305 if (std::any_of(Entries.begin(), I, in beginFunction()
323 for (const auto &Entry : Entries) { in beginFunction()
H A DAddressPool.cpp59 SmallVector<const MCExpr *, 64> Entries(Pool.size()); in emit() local
62 Entries[I.second.Number] = in emit()
67 for (const MCExpr *Entry : Entries) in emit()
/freebsd-13.1/contrib/llvm-project/llvm/utils/TableGen/
H A DSequenceToOffsetTable.h111 unsigned Entries; variable
119 SequenceToOffsetTable() : Entries(0) {} in SequenceToOffsetTable()
124 assert(Entries == 0 && "Cannot call add() after layout()"); in add()
142 assert((empty() || Entries) && "Call layout() before size()"); in size()
143 return Entries; in size()
148 assert(Entries == 0 && "Can only call layout() once"); in layout()
152 I->second = Entries; in layout()
154 Entries += I->first.size() + 1; in layout()
160 assert(Entries && "Call layout() before get()"); in get()
172 assert(Entries && "Call layout() before emitStringLiteralDef()"); in emitStringLiteralDef()
[all …]
H A DSearchableTableEmitter.cpp50 std::vector<std::unique_ptr<Entry>> Entries; member
78 std::vector<Record *> Entries; member
300 for (const auto &Entry : Enum.Entries) in emitGenericEnum()
323 IndexRows = Table.Entries; in emitLookupFunction()
337 Entries.reserve(Table.Entries.size()); in emitLookupFunction()
339 Entries.emplace_back(Table.Entries[i], i); in emitLookupFunction()
346 IndexRowsStorage.reserve(Entries.size()); in emitLookupFunction()
347 for (const auto &Entry : Entries) { in emitLookupFunction()
505 Record *Entry = Table.Entries[i]; in emitGenericTable()
595 llvm::stable_sort(Enum.Entries, in collectEnumEntries()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyCFGSort.cpp224 SmallVector<Entry, 4> Entries; in sortBlocks() local
232 Entries.push_back(Entry(R)); in sortBlocks()
236 for (Entry &E : Entries) in sortBlocks()
240 while (!Entries.empty() && Entries.back().NumBlocksLeft == 0) in sortBlocks()
241 Entries.pop_back(); in sortBlocks()
266 for (Entry &E : Entries) { in sortBlocks()
287 if (!Entries.empty() && in sortBlocks()
289 Entries.back().Deferred.push_back(Next); in sortBlocks()
318 if (!Entries.empty() && in sortBlocks()
320 Entries.back().Deferred.push_back(Next); in sortBlocks()
[all …]
H A DWebAssemblyFixIrreducibleControlFlow.cpp69 static BlockVector getSortedEntries(const BlockSet &Entries) { in getSortedEntries() argument
70 BlockVector SortedEntries(Entries.begin(), Entries.end()); in getSortedEntries()
244 void makeSingleEntryLoop(BlockSet &Entries, BlockSet &Blocks,
339 BlockSet &Entries, BlockSet &Blocks, MachineFunction &MF, in makeSingleEntryLoop() argument
341 assert(Entries.size() >= 2); in makeSingleEntryLoop()
344 BlockVector SortedEntries = getSortedEntries(Entries); in makeSingleEntryLoop()
406 if (!Entries.count(Entry)) in makeSingleEntryLoop()
422 if (Entries.count(Entry) && Pred->isLayoutSuccessor(Entry)) in makeSingleEntryLoop()
435 if (!Entries.count(Entry) || Map.count({Entry, PredInLoop})) in makeSingleEntryLoop()
471 if (!Entries.count(Succ)) in makeSingleEntryLoop()
/freebsd-13.1/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_interceptors_ioctl_netbsd.inc50 /* Entries from file: altq/altq.h */
59 /* Entries from file: altq/altq_cbq.h */
605 /* Entries from file: dev/md.h */
667 /* Entries from file: net/bpf.h */
724 /* Entries from file: net/npf.h */
909 /* Entries from file: sys/cdio.h */
937 /* Entries from file: sys/chio.h */
959 /* Entries from file: sys/dkio.h */
1013 /* Entries from file: sys/fdio.h */
1033 /* Entries from file: sys/gpio.h */
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DDbgEntityHistoryCalculator.h96 using Entries = SmallVector<Entry, 4>; variable
98 using EntriesMap = MapVector<InlinedEntity, Entries>;
109 auto &Entries = VarEntries[Var]; in getEntry() local
110 return Entries[Index]; in getEntry()
115 bool hasNonEmptyLocation(const Entries &Entries) const;
/freebsd-13.1/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/
H A DDebugInlineeLinesSubsection.cpp71 Size += Entries.size() * sizeof(InlineeSourceLineHeader); in calculateSerializedSize()
74 Size += Entries.size() * sizeof(uint32_t); in calculateSerializedSize()
91 for (const auto &E : Entries) { in commit()
110 auto &Entry = Entries.back(); in addExtraFile()
120 Entries.emplace_back(); in addInlineSite()
121 auto &Entry = Entries.back(); in addInlineSite()
/freebsd-13.1/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-13.1/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dsecondary.h194 if (Entries[I].CommitBase) in store()
197 Entries[I] = Entries[0]; in store()
198 Entries[0] = Entry; in store()
242 Entry = Entries[I]; in retrieve()
243 Entries[I].CommitBase = 0; in retrieve()
316 if (Entries[I].CommitBase) in disableMemoryTagging()
317 setMemoryPermission(Entries[I].CommitBase, Entries[I].CommitSize, 0, in disableMemoryTagging()
339 if (!Entries[I].CommitBase) in empty()
343 MapInfo[N].Data = Entries[I].Data; in empty()
344 Entries[I].CommitBase = 0; in empty()
[all …]
/freebsd-13.1/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-13.1/contrib/llvm-project/llvm/lib/MC/
H A DConstantPools.cpp27 if (Entries.empty()) in emitEntries()
30 for (const ConstantPoolEntry &Entry : Entries) { in emitEntries()
36 Entries.clear(); in emitEntries()
50 Entries.push_back(ConstantPoolEntry(CPEntryLabel, Value, Size, Loc)); in addEntry()
57 bool ConstantPool::empty() { return Entries.empty(); } in empty()
/freebsd-13.1/contrib/llvm-project/compiler-rt/lib/memprof/
H A Dmemprof_allocator.cpp290 if (Entries[i].Empty()) in PrintAll()
292 Entries[i].Print(); in PrintAll()
300 auto id = Entries[i].id; in insertOrMerge()
314 auto tmp = Entries[0]; in insertOrMerge()
315 Entries[0] = Entries[i]; in insertOrMerge()
316 Entries[i] = tmp; in insertOrMerge()
340 Entries[min_idx].Print(); in insertOrMerge()
344 Entries[min_idx] = Entries[0]; in insertOrMerge()
345 Entries[0].id = new_id; in insertOrMerge()
346 Entries[0].MIB = newMIB; in insertOrMerge()
[all …]
/freebsd-13.1/sys/contrib/dev/acpica/common/
H A Ddmtbdump.c385 UINT32 Entries; in AcpiDmDumpRsdt() local
397 Entries = (Table->Length - sizeof (ACPI_TABLE_HEADER)) / sizeof (UINT32); in AcpiDmDumpRsdt()
399 for (i = 0; i < Entries; i++) in AcpiDmDumpRsdt()
425 UINT32 Entries; in AcpiDmDumpXsdt() local
437 Entries = (Table->Length - sizeof (ACPI_TABLE_HEADER)) / sizeof (UINT64); in AcpiDmDumpXsdt()
439 for (i = 0; i < Entries; i++) in AcpiDmDumpXsdt()
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/
H A DInterferenceCache.cpp60 Entries[i].clear(mf, indexes, lis); in init()
65 if (E < CacheEntries && Entries[E].getPhysReg() == PhysReg) { in get()
66 if (!Entries[E].valid(LIUArray, TRI)) in get()
67 Entries[E].revalidate(LIUArray, TRI); in get()
68 return &Entries[E]; in get()
76 if (Entries[E].hasRefs()) { in get()
81 Entries[E].reset(PhysReg, LIUArray, TRI, MF); in get()
83 return &Entries[E]; in get()
/freebsd-13.1/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/
H A DDWARFDebugRangeList.cpp22 Entries.clear(); in clear()
55 Entries.push_back(Entry); in extract()
61 for (const RangeListEntry &RLE : Entries) { in dump()
76 for (const RangeListEntry &RLE : Entries) { in getAbsoluteRanges()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ObjectYAML/
H A DELFYAML.h320 return {{"Entries", Entries.hasValue()}}; in getEntries()
334 return {{"Entries", Entries.hasValue()}}; in getEntries()
352 return {{"Entries", Entries.hasValue()}}; in getEntries()
530 return {{"Entries", Entries.hasValue()}}; in getEntries()
539 Optional<std::vector<uint16_t>> Entries; member
544 return {{"Entries", Entries.hasValue()}}; in getEntries()
559 Optional<std::vector<VerdefEntry>> Entries; member
565 return {{"Entries", Entries.hasValue()}}; in getEntries()
614 return {{"Entries", Entries.hasValue()}}; in getEntries()
623 Optional<std::vector<uint32_t>> Entries; member
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Support/
H A DTimeProfiler.cpp95 assert((Entries.empty() || in end()
97 Entries.back().getFlameGraphStartUs(StartTime) + in end()
98 Entries.back().getFlameGraphDurUs())) && in end()
106 Entries.emplace_back(E); in end()
157 for (const Entry &E : Entries) in write()
160 for (const Entry &E : TTP->Entries) in write()
250 SmallVector<Entry, 128> Entries; member
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFListTable.h43 ListEntries Entries;
46 const ListEntries &getEntries() const { return Entries; } in getEntries()
47 bool empty() const { return Entries.empty(); } in empty()
48 void clear() { Entries.clear(); } in clear()
236 Entries.clear(); in extract()
241 Entries.push_back(Entry); in extract()

1234567