| /llvm-project/llvm/test/CodeGen/RISCV/ |
| H A D | jumptable.ll | 14 ; RUN: llc -mtriple=riscv32 -code-model=small -verify-machineinstrs -riscv-min-jump-table-entries=7…
15 ; RUN: | FileCheck %s -check-prefixes=CHECK,RV32I-SMALL-7-ENTRIES
16 ; RUN: llc -mtriple=riscv32 -code-model=medium -verify-machineinstrs -riscv-min-jump-table-entries=…
17 ; RUN: | FileCheck %s -check-prefixes=CHECK,RV32I-MEDIUM-7-ENTRIES
18 …-mtriple=riscv32 -relocation-model=pic -verify-machineinstrs -riscv-min-jump-table-entries=7 < %s \
19 ; RUN: | FileCheck %s -check-prefixes=CHECK,RV32I-PIC-7-ENTRIES
20 ; RUN: llc -mtriple=riscv64 -code-model=small -verify-machineinstrs -riscv-min-jump-table-entries=7…
21 ; RUN: | FileCheck %s -check-prefixes=CHECK,RV64I-SMALL-7-ENTRIES
22 ; RUN: llc -mtriple=riscv64 -code-model=medium -verify-machineinstrs -riscv-min-jump-table-entries=…
23 ; RUN: | FileCheck %s -check-prefixes=CHECK,RV64I-MEDIUM-7-ENTRIES
[all …]
|
| /llvm-project/llvm/test/DebugInfo/PDB/ |
| H A D | module-stats.test | 7 ALL-NEXT: Total: 6 entries ( 204 bytes)
9 ALL-NEXT: S_COMPILE3: 1 entries ( 60 bytes)
10 ALL-NEXT: S_OBJNAME: 1 entries ( 56 bytes)
11 ALL-NEXT: S_GPROC32: 1 entries ( 44 bytes)
12 ALL-NEXT: S_FRAMEPROC: 1 entries ( 32 bytes)
13 ALL-NEXT: S_BUILDINFO: 1 entries ( 8 bytes)
14 ALL-NEXT: S_END: 1 entries ( 4 bytes)
16 ALL-NEXT: Total: 2 entries ( 88 bytes)
18 ALL-NEXT: DEBUG_S_LINES: 1 entries ( 56 bytes)
19 ALL-NEXT: DEBUG_S_FILECHKSMS: 1 entries ( 32 bytes)
[all …]
|
| H A D | type-stats.test | 7 ALL-NEXT: Total: 75 entries ( 5,336 bytes, 71.15 avg)
9 ALL-NEXT: LF_FIELDLIST: 14 entries ( 1,956 bytes, 139.71 avg)
10 ALL-NEXT: LF_STRUCTURE: 14 entries ( 1,584 bytes, 113.14 avg)
11 ALL-NEXT: LF_ENUM: 8 entries ( 988 bytes, 123.50 avg)
12 ALL-NEXT: LF_MFUNCTION: 14 entries ( 392 bytes, 28.00 avg)
13 ALL-NEXT: LF_ARGLIST: 10 entries ( 176 bytes, 17.60 avg)
14 ALL-NEXT: LF_METHODLIST: 5 entries ( 116 bytes, 23.20 avg)
15 ALL-NEXT: LF_POINTER: 8 entries ( 96 bytes, 12.00 avg)
16 ALL-NEXT: LF_PROCEDURE: 1 entries ( 16 bytes, 16.00 avg)
17 ALL-NEXT: LF_MODIFIER: 1 entries ( 12 bytes, 12.00 avg)
|
| /llvm-project/polly/lib/External/isl/ |
| H A D | isl_hash.c | 56 table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry, in isl_hash_table_init()
58 if (!table->entries) in isl_hash_table_init()
74 * We reuse isl_hash_table_find to create entries in the extended table.
75 * Since all entries in the original table are assumed to be different,
82 struct isl_hash_table_entry *entries; in grow_table() local
85 entries = table->entries; in grow_table()
88 table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry, in grow_table()
90 if (!table->entries) { in grow_table()
91 table->entries = entries; in grow_table()
102 if (!entries[h].data) in grow_table()
[all …]
|
| /llvm-project/clang/test/Templight/ |
| H A D | templight-empty-entries-fix.cpp | 8 // CHECK: {{^name:[ ]+'\(lambda at .*templight-empty-entries-fix.cpp:4:3\)'$}}
11 // CHECK: {{^orig:[ ]+'.*templight-empty-entries-fix.cpp:4:3'$}}
12 // CHECK: {{^poi:[ ]+'.*templight-empty-entries-fix.cpp:4:3'$}}
14 // CHECK: {{^name:[ ]+'\(lambda at .*templight-empty-entries-fix.cpp:4:3\)'$}}
17 // CHECK: {{^orig:[ ]+'.*templight-empty-entries-fix.cpp:4:3'$}}
18 // CHECK: {{^poi:[ ]+'.*templight-empty-entries-fix.cpp:4:3'$}}
26 // CHECK: {{^orig:[ ]+'.*templight-empty-entries-fix.cpp:20:25'$}}
27 // CHECK: {{^poi:[ ]+'.*templight-empty-entries-fix.cpp:20:31'$}}
32 // CHECK: {{^orig:[ ]+'.*templight-empty-entries-fix.cpp:20:15'$}}
33 // CHECK: {{^poi:[ ]+'.*templight-empty-entries
[all...] |
| /llvm-project/llvm/test/tools/yaml2obj/ELF/ |
| H A D | stack-sizes.yaml | 67 # RUN: llvm-readobj --sections --section-data %t2.le64 | FileCheck %s --check-prefix=ENTRIES-LE64-B…
69 # RUN: llvm-readobj --sections --section-data %t2.be64 | FileCheck %s --check-prefix=ENTRIES-BE64-B…
71 # RUN: llvm-readobj --sections --section-data %t2.le32 | FileCheck %s --check-prefix=ENTRIES-LE32-B…
73 # RUN: llvm-readobj --sections --section-data %t2.be32 | FileCheck %s --check-prefix=ENTRIES-BE32-B…
75 # ENTRIES-LE64-BOTH: Name: .stack_sizes
76 # ENTRIES-LE64-BOTH: SectionData (
77 # ENTRIES-LE64-BOTH-NEXT: 0000: 10000000 00000000 20300000 00000000 |
78 # ENTRIES-LE64-BOTH-NEXT: 0010: 0040 |
80 # ENTRIES-BE64-BOTH: Name: .stack_sizes
81 # ENTRIES-BE64-BOTH: SectionData (
[all …]
|
| H A D | bb-addr-map.yaml | 36 # Case 4: Specify Entries.
42 # Case 5: Specify Entries and omit the Address field.
99 ## Entries.
102 Entries:
112 ## 5) When specifying the description with Entries, the 'Address' field will be
116 Entries:
126 ## actual number of BB Entries.
129 Entries:
144 Entries:
152 Entries:
[all …]
|
| /llvm-project/llvm/unittests/ObjectYAML/ |
| H A D | DWARFYAMLTest.cpp | 75 Entries: in TEST()
85 Entries: in TEST()
97 ASSERT_EQ(PubNames.Entries.size(), 2u); in TEST()
98 EXPECT_EQ((uint32_t)PubNames.Entries[0].DieOffset, 0x1234u); in TEST()
99 EXPECT_EQ(PubNames.Entries[0].Name, "abc"); in TEST()
100 EXPECT_EQ((uint32_t)PubNames.Entries[1].DieOffset, 0x4321u); in TEST()
101 EXPECT_EQ(PubNames.Entries[1].Name, "def"); in TEST()
106 ASSERT_EQ(PubTypes.Entries.size(), 2u); in TEST()
107 EXPECT_EQ((uint32_t)PubTypes.Entries[0].DieOffset, 0x1234u); in TEST()
108 EXPECT_EQ(PubTypes.Entries[0].Name, "abc"); in TEST()
[all …]
|
| /llvm-project/llvm/test/tools/llvm-mca/X86/ |
| H A D | scheduler-queue-usage.s | 31 # BARCELONA-NEXT: [2] Average number of used buffer entries.
32 # BARCELONA-NEXT: [3] Maximum number of used buffer entries.
33 # BARCELONA-NEXT: [4] Total number of buffer entries.
37 # BDVER2-NEXT: [2] Average number of used buffer entries.
38 # BDVER2-NEXT: [3] Maximum number of used buffer entries.
39 # BDVER2-NEXT: [4] Total number of buffer entries.
43 # BDW-NEXT: [2] Average number of used buffer entries.
44 # BDW-NEXT: [3] Maximum number of used buffer entries.
45 # BDW-NEXT: [4] Total number of buffer entries.
49 # BTVER2-NEXT: [2] Average number of used buffer entries.
[all …]
|
| /llvm-project/libc/test/include/sys/ |
| H A D | queue_test.cpp | 24 SLIST_ENTRY(Entry) entries; in TEST()
37 SLIST_FOREACH(e, &head, entries) { v.append(e->c); } in TEST()
43 SLIST_INSERT_HEAD(&head, &e1, entries); in TEST()
48 SLIST_INSERT_AFTER(&e1, &e2, entries); in TEST()
55 SLIST_INSERT_HEAD(&head2, &e3, entries); in TEST()
63 SLIST_CONCAT(&head2, &head, Entry, entries); in TEST()
67 SLIST_CONCAT(&head, &head2, Entry, entries); in TEST()
72 SLIST_FOREACH_SAFE(e, &head, entries, tmp) { in TEST()
74 SLIST_REMOVE(&head, e, Entry, entries); in TEST()
82 SLIST_REMOVE_HEAD(&head, entries); in TEST()
[all...] |
| /llvm-project/llvm/test/tools/llvm-readobj/COFF/ |
| H A D | resources.test | 15 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
53 TEST_RES-NEXT: Number of String Entries: 2
54 TEST_RES-NEXT: Number of ID Entries: 0
[all …]
|
| /llvm-project/clang/lib/CodeGen/ |
| H A D | SwiftCallingConv.cpp | 279 // Fast path: we can just add entries to the end. in addEntry()
280 if (Entries.empty() || Entries.back().End <= begin) { in addEntry()
281 Entries.push_back({begin, end, type}); in addEntry()
286 // TODO: do a binary search if Entries is big enough for it to matter. 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 in addEntry()
[all...] |
| /llvm-project/llvm/test/Analysis/CycleInfo/ |
| H A D | basic.ll | 12 ; CHECK: depth=1: entries(loop)
25 ; CHECK: depth=1: entries(loop) loop_next
41 ; CHECK: depth=1: entries(outer_header) outer_latch inner
42 ; CHECK: depth=2: entries(inner)
61 ; CHECK: depth=1: entries(outer_header) inner_header inner_latch
62 ; CHECK: depth=2: entries(inner_header) inner_latch
81 ; CHECK-DAG: depth=1: entries(left)
82 ; CHECK-DAG: depth=1: entries(right)
98 ; CHECK-DAG: depth=1: entries(second)
99 ; CHECK-DAG: depth=1: entries(firs
[all...] |
| /llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
| H A D | DebugLocStream.h | 23 /// Byte stream of .debug_loc entries.
25 /// Stores a unified stream of .debug_loc entries. There's \a List for each
48 SmallVector<Entry, 32> Entries; variable
78 /// Until the next call, \a startEntry() will add entries to this list.
81 Lists.emplace_back(CU, Entries.size()); in startList()
87 /// If there are no entries in this list, delete it outright. Otherwise,
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()
[all …]
|
| H A D | DbgEntityHistoryCalculator.cpp | 76 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()
80 LLVM_DEBUG(dbgs() << "Coalescing identical DBG_VALUE entries:\n" 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()
[all …]
|
| /llvm-project/llvm/test/CodeGen/PowerPC/ |
| H A D | ppc-TOC-stats.ll | 7 ; RUN: --stats -ppc-min-jump-table-entries=4 < %s 2>&1 | FileCheck %s --check-prefix=AIX
9 ; RUN: --stats -ppc-min-jump-table-entries=4 < %s 2>&1 | FileCheck %s --check-prefix=AIX
11 ; RUN: --stats -ppc-min-jump-table-entries=4 < %s 2>&1 | FileCheck %s --check-prefix=LINUX
13 ; RUN: --stats -ppc-min-jump-table-entries=4 < %s 2>&1 | FileCheck %s --check-prefix=LINUX
15 ; RUN: -code-model=large --stats -ppc-min-jump-table-entries=4 < %s 2>&1 | FileCheck %s --check-p…
17 ; RUN: -code-model=large --stats -ppc-min-jump-table-entries=4 < %s 2>&1 | FileCheck %s --check-p…
22 ; of TOC entries.
25 ; AIX: 1 asmprinter - Number of Block Address TOC Entries.
26 ; AIX: 13 asmprinter - Number of Constant Pool TOC Entries.
27 ; AIX: 1 asmprinter - Number of EH Block TOC Entries.
[all …]
|
| /llvm-project/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_interceptors_ioctl_netbsd.inc | 45 /* 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 …]
|
| /llvm-project/lldb/test/API/python_api/sbenvironment/ |
| H A D | TestSBEnvironment.py | 16 def assertEqualEntries(self, env, entries): argument
17 self.assertEqual(env.GetNumValues(), len(entries))
21 self.assertIn(name + "=" + value, entries)
23 entries = env.GetEntries()
24 self.assertEqual(entries.GetSize(), len(entries))
25 for i in range(entries.GetSize()):
26 (name, value) = entries.GetStringAtIndex(i).split("=")
27 self.assertIn(name + "=" + value, entries)
115 entries = lldb.SBStringList()
116 entries.AppendList(["X=x", "Y=y"], 2)
[all …]
|
| /llvm-project/llvm/test/tools/obj2yaml/ELF/ |
| H A D | call-graph-profile-section.yaml | 3 ## Test we use the "Entries" property when it is possible to dump values correctly.
18 # BASIC-NEXT: Entries:
31 Entries:
55 # INVALID-NEXT: Entries:
68 # INVALID-NEXT: Entries:
72 # INVALID-NEXT: Entries:
77 # INVALID-NEXT: Entries:
83 # INVALID-NEXT: Entries:
89 # INVALID-NEXT: Entries:
104 ## Case 2: Check that we use the "Entries" property to dump the data when it
[all …]
|
| /llvm-project/llvm/include/llvm/ADT/ |
| H A D | ConcurrentHashtable.h | 49 /// bucket entries
52 /// buckets might be extended to contain more entries. Each bucket can be
57 /// BucketsArray keeps all buckets. Each bucket keeps an array of Entries
58 /// (pointers to KeyDataTy) and another array of entries hashes:
61 /// BucketsArray[BucketIdx].Entries[EntryIdx]:
64 /// [Bucket 0].Entries -> [KeyDataTy*][KeyDataTy*]
67 /// [Bucket 1].Entries -> [KeyDataTy*][KeyDataTy*][KeyDataTy*][KeyDataTy*]
70 /// [Bucket N].Entries -> [KeyDataTy*][KeyDataTy*][KeyDataTy*]
138 DataPtr Entries = new EntryDataTy[InitialBucketSize]; in MultiThreadAllocator()
139 memset(Entries, in MultiThreadAllocator()
137 DataPtr Entries = new EntryDataTy[InitialBucketSize]; MultiThreadAllocator() local
289 DataPtr Entries = nullptr; global() member
[all...] |
| /llvm-project/llvm/lib/Target/DirectX/ |
| H A D | DXILResource.cpp | 275 SmallVector<Metadata *> Entries; in write() local
277 Entries.emplace_back( in write()
279 Entries.emplace_back(ConstantAsMetadata::get( in write()
282 if (Entries.empty()) in write()
284 return MDNode::get(Ctx, Entries); in write()
288 MutableArrayRef<Metadata *> Entries) const { in write()
290 Entries[0] = ConstantAsMetadata::get(B.getInt32(ID)); in write()
291 Entries[1] = ConstantAsMetadata::get(GV); in write()
292 Entries[2] = MDString::get(Ctx, Name); in write()
293 Entries[ in write()
301 Metadata *Entries[11]; write() local
315 Metadata *Entries[7]; write() local
[all...] |
| /llvm-project/llvm/include/llvm/BinaryFormat/ |
| H A D | DynamicTags.def | 46 DYNAMIC_TAG(PLTRELSZ, 2) // Size of relocation entries in PLT.
51 DYNAMIC_TAG(RELA, 7) // Address of relocation table (Rela entries).
61 DYNAMIC_TAG(REL, 17) // Address of relocation table (Rel entries).
86 DYNAMIC_TAG(RELR, 36) // Address of relocation table (Relr entries).
107 DYNAMIC_TAG(ANDROID_RELR, 0x6FFFE000) // Address of relocation table (Relr entries).
124 DYNAMIC_TAG(VERDEFNUM, 0X6FFFFFFD) // The number of entries in DT_VERDEF.
127 DYNAMIC_TAG(VERNEEDNUM, 0X6FFFFFFF) // The number of entries in DT_VERNEED.
129 // AArch64 specific dynamic table entries
139 // AArch64 specific dynamic table entries for RELR auth relocations as described here:
145 // Hexagon specific dynamic table entries
[all …]
|
| /llvm-project/lld/ELF/ |
| H A D | SyntheticSections.h | 223 // Returns the number of entries in the local part of GOT including
224 // the number of reserved entries.
232 // contains different types of entries. Here is a layout of GOT:
233 // - Header entries |
234 // - Page entries | Local part
235 // - Local entries (16-bit access) |
236 // - Local entries (32-bit access) |
237 // - Normal global entries || Global part
238 // - Reloc-only global entries ||
239 // - TLS entries ||| TL
752 SmallVector<const Symbol *, 0> entries; global() variable
760 SmallVector<const Symbol *, 0> entries; global() variable
838 entries() { entries() function
[all...] |
| /llvm-project/llvm/test/tools/llvm-readobj/ELF/ |
| H A D | mips-got.test | 1 ## Check that we are able to dump MIPS GOT entries using -A properly.
39 Entries:
53 # BASIC-LLVM-NEXT: Reserved entries [
67 # BASIC-LLVM-NEXT: Local entries [
79 # BASIC-LLVM-NEXT: Global entries [
99 # BASIC-LLVM-NEXT: Number of TLS and multi-GOT entries: [[OTHERNUM]]
105 # BASIC-GNU-NEXT: Reserved entries:
110 # BASIC-GNU-NEXT: Local entries:
115 # BASIC-GNU-NEXT: Global entries:
120 # BASIC-GNU-OTHER-NEXT: Number of TLS and multi-GOT entries [[OTHERNUM]]
[all …]
|
| /llvm-project/clang/test/CodeGenCXX/ |
| H A D | microsoft-abi-vtables-single-inheritance.cpp | 7 // CHECK-LABEL: VFTable for 'A' (3 entries)
11 // CHECK-LABEL: VFTable indices for 'A' (3 entries)
26 // CHECK-LABEL: VFTable for 'A' in 'B' (5 entries)
32 // CHECK-LABEL: VFTable indices for 'B' (3 entries)
46 // CHECK-LABEL: VFTable for 'C' (2 entries)
49 // CHECK-LABEL: VFTable indices for 'C' (2 entries).
61 // CHECK-LABEL: VFTable for 'D' (2 entries)
64 // CHECK-LABEL: VFTable indices for 'D' (2 entries)
76 // CHECK-LABEL: VFTable for 'A' in 'E' (5 entries)
82 // CHECK-LABEL: VFTable indices for 'E' (2 entries).
[all …]
|