Home
last modified time | relevance | path

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

12345678910>>...16

/llvm-project-15.0.7/llvm/unittests/ObjectYAML/
H A DDWARFYAMLTest.cpp97 ASSERT_EQ(PubNames.Entries.size(), 2u); in TEST()
99 EXPECT_EQ(PubNames.Entries[0].Name, "abc"); in TEST()
101 EXPECT_EQ(PubNames.Entries[1].Name, "def"); in TEST()
106 ASSERT_EQ(PubTypes.Entries.size(), 2u); in TEST()
108 EXPECT_EQ(PubTypes.Entries[0].Name, "abc"); in TEST()
110 EXPECT_EQ(PubTypes.Entries[1].Name, "def"); in TEST()
163 ASSERT_EQ(GNUPubNames.Entries.size(), 2u); in TEST()
166 EXPECT_EQ(GNUPubNames.Entries[0].Name, "abc"); in TEST()
169 EXPECT_EQ(GNUPubNames.Entries[1].Name, "def"); in TEST()
174 ASSERT_EQ(GNUPubTypes.Entries.size(), 2u); in TEST()
[all …]
/llvm-project-15.0.7/clang/lib/CodeGen/
H A DSwiftCallingConv.cpp280 if (Entries.empty() || Entries.back().End <= begin) { 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()
351 if (Entries[index].Type && Entries[index].Type->isVectorTy()) { in addEntry()
372 if (index == Entries.size() - 1 || end <= Entries[index + 1].Begin) { in addEntry()
378 Entries[index].End = Entries[index + 1].Begin; in addEntry()
407 Entries.insert(Entries.begin() + index + 1, numElts - 1, StorageEntry()); in splitVectorEntry()
469 if (Entries.empty()) { in finish()
483 if (shouldMergeEntries(Entries[i - 1], Entries[i], chunkSize)) { in finish()
486 Entries[i - 1].End = Entries[i].Begin; in finish()
[all …]
/llvm-project-15.0.7/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.cpp76 auto &Entries = VarEntries[Var]; in startDbgValue() local
77 if (!Entries.empty() && Entries.back().isDbgValue() && in startDbgValue()
78 !Entries.back().isClosed() && 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()
98 return Entries.size() - 1; in startClobber()
259 bool DbgValueHistoryMap::hasNonEmptyLocation(const Entries &Entries) const { in hasNonEmptyLocation()
260 for (const auto &Entry : Entries) { in hasNonEmptyLocation()
[all …]
/llvm-project-15.0.7/llvm/test/tools/llvm-readobj/COFF/
H A Dresources.test15 ZERO-DAG: Number of String Entries: 0
16 ZERO-NEXT: Number of ID Entries: 1
19 ZERO-NEXT: Number of String Entries: 0
20 ZERO-NEXT: Number of ID Entries: 1
23 ZERO-NEXT: Number of String Entries: 0
24 ZERO-NEXT: Number of ID Entries: 1
49 TEST_RES-DAG: Number of String Entries: 0
50 TEST_RES-NEXT: Number of ID Entries: 4
54 TEST_RES-NEXT: Number of ID Entries: 0
99 TEST_RES-NEXT: Number of ID Entries: 1
[all …]
/llvm-project-15.0.7/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.cpp48 std::vector<std::unique_ptr<Entry>> Entries; member
76 std::vector<Record *> Entries; member
298 for (const auto &Entry : Enum.Entries) in emitGenericEnum()
321 IndexRows = Table.Entries; in emitLookupFunction()
335 Entries.reserve(Table.Entries.size()); in emitLookupFunction()
337 Entries.emplace_back(Table.Entries[i], i); in emitLookupFunction()
344 IndexRowsStorage.reserve(Entries.size()); in emitLookupFunction()
345 for (const auto &Entry : Entries) { in emitLookupFunction()
503 Record *Entry = Table.Entries[i]; in emitGenericTable()
593 llvm::stable_sort(Enum.Entries, in collectEnumEntries()
[all …]
/llvm-project-15.0.7/llvm/test/tools/obj2yaml/ELF/
H A Dcall-graph-profile-section.yaml18 # BASIC-NEXT: Entries:
31 Entries:
55 # INVALID-NEXT: Entries:
68 # INVALID-NEXT: Entries:
72 # INVALID-NEXT: Entries:
77 # INVALID-NEXT: Entries:
123 Entries:
128 Entries:
133 Entries:
140 Entries:
[all …]
/llvm-project-15.0.7/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 …]
/llvm-project-15.0.7/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 …]
/llvm-project-15.0.7/llvm/test/tools/yaml2obj/ELF/
H A Dbb-addr-map.yaml36 # Case 4: Specify Entries.
42 # Case 5: Specify Entries and omit the Address field.
84 ## Entries.
87 Entries:
99 Entries:
107 ## actual number of BB Entries.
110 Entries:
119 ## Check we can't use Entries at the same time as either Content or Size.
123 # INVALID: error: "Entries" cannot be used with "Content" or "Size"
134 Entries: []
[all …]
/llvm-project-15.0.7/lld/test/COFF/
H A Dmanifestinput.test15 TEST_EMBED-DAG: Number of String Entries: 0
16 TEST_EMBED-NEXT: Number of ID Entries: 1
19 TEST_EMBED-NEXT: Number of String Entries: 0
20 TEST_EMBED-NEXT: Number of ID Entries: 1
23 TEST_EMBED-NEXT: Number of String Entries: 0
24 TEST_EMBED-NEXT: Number of ID Entries: 1
H A Dresource.test18 RESOURCE_INFO-DAG: Number of String Entries: 0
19 RESOURCE_INFO-NEXT: Number of ID Entries: 1
22 RESOURCE_INFO-NEXT: Number of String Entries: 0
23 RESOURCE_INFO-NEXT: Number of ID Entries: 1
26 RESOURCE_INFO-NEXT: Number of String Entries: 0
27 RESOURCE_INFO-NEXT: Number of ID Entries: 1
/llvm-project-15.0.7/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()
57 DenseMap<StringRef, Symbol *> Entries; variable
/llvm-project-15.0.7/clang-tools-extra/clang-tidy/misc/ConfusableTable/
H A DBuildConfusableTable.cpp27 std::vector<std::pair<llvm::UTF32, SmallVector<llvm::UTF32>>> Entries; in main() local
55 Entries.emplace_back(CodePoint, To); in main()
57 llvm::sort(Entries); in main()
60 std::max_element(Entries.begin(), Entries.end(), in main()
74 for (const auto &Values : Entries) { in main()
/llvm-project-15.0.7/llvm/test/tools/llvm-cvtres/
H A Dcombined.test16 CHECK-DAG: Number of String Entries: 1
17 CHECK-NEXT: Number of ID Entries: 5
20 CHECK-NEXT: Number of String Entries: 1
21 CHECK-NEXT: Number of ID Entries: 0
25 CHECK-NEXT: Number of ID Entries: 1
46 CHECK-NEXT: Number of ID Entries: 0
50 CHECK-NEXT: Number of ID Entries: 1
70 CHECK-NEXT: Number of ID Entries: 1
91 CHECK-NEXT: Number of ID Entries: 1
136 CHECK-NEXT: Number of ID Entries: 0
[all …]
H A Dobject.test15 CHECK-DAG: Number of String Entries: 1
16 CHECK-NEXT: Number of ID Entries: 4
19 CHECK-NEXT: Number of String Entries: 1
20 CHECK-NEXT: Number of ID Entries: 0
24 CHECK-NEXT: Number of ID Entries: 1
45 CHECK-NEXT: Number of ID Entries: 0
49 CHECK-NEXT: Number of ID Entries: 1
69 CHECK-NEXT: Number of ID Entries: 1
90 CHECK-NEXT: Number of ID Entries: 1
135 CHECK-NEXT: Number of ID Entries: 0
[all …]
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DGenericCycleInfo.h63 SmallVector<BlockT *, 1> Entries; variable
80 Entries.clear(); in clear()
87 void appendEntry(BlockT *Block) { Entries.push_back(Block); } in appendEntry()
99 bool isReducible() const { return Entries.size() == 1; } in isReducible()
101 BlockT *getHeader() const { return Entries[0]; } in getHeader()
104 return Entries; in getEntries()
108 bool isEntry(BlockT *Block) const { return is_contained(Entries, Block); } in isEntry()
191 size_t getNumEntries() const { return Entries.size(); } in getNumEntries()
193 return llvm::make_range(Entries.begin(), Entries.end()); in entries()
200 for (auto *Entry : Entries) { in printEntries()
/llvm-project-15.0.7/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;
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/compiler-rt/lib/scudo/standalone/
H A Dsecondary.h207 if (Entries[I].CommitBase) in store()
210 Entries[I] = Entries[0]; in store()
211 Entries[0] = Entry; in store()
255 Entry = Entries[I]; in retrieve()
256 Entries[I].CommitBase = 0; in retrieve()
329 if (Entries[I].CommitBase) in disableMemoryTagging()
330 setMemoryPermission(Entries[I].CommitBase, Entries[I].CommitSize, 0, in disableMemoryTagging()
352 if (!Entries[I].CommitBase) in empty()
356 MapInfo[N].Data = Entries[I].Data; in empty()
357 Entries[I].CommitBase = 0; in empty()
[all …]
/llvm-project-15.0.7/bolt/lib/Core/
H A DJumpTable.cpp40 return std::make_pair(0, Entries.size()); in getEntriesForAddress()
46 for (size_t I = 0; I < Entries.size(); ++I) { in getEntriesForAddress()
73 for (auto I = &Entries[Range.first], E = &Entries[Range.second]; I != E; in replaceDestination()
88 for (MCSymbol *Entry : Entries) { in updateOriginal()
115 for (const MCSymbol *Entry : Entries) { in print()

12345678910>>...16