| /external/e2fsprogs/tests/d_fallocate_bigalloc/ |
| D | expect.gz | 1
2Warning: the bigalloc feature is still under development
3See https://ext4. ... |
| /external/llvm-project/llvm/unittests/ObjectYAML/ |
| D | DWARFYAMLTest.cpp | 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()
109 EXPECT_EQ((uint32_t)PubTypes.Entries[1].DieOffset, 0x4321u); in TEST()
110 EXPECT_EQ(PubTypes.Entries[1].Name, "def"); in TEST()
[all …]
|
| /external/e2fsprogs/tests/d_fallocate/ |
| D | expect.gz | |
| /external/clang/lib/CodeGen/ |
| D | SwiftCallingConv.cpp | 263 if (Entries.empty() || Entries.back().End <= begin) { in addEntry()
264 Entries.push_back({begin, end, type}); in addEntry()
270 size_t index = Entries.size() - 1; in addEntry()
272 if (Entries[index - 1].End <= begin) break; in addEntry()
278 if (Entries[index].Begin >= end) { in addEntry()
282 Entries.insert(Entries.begin() + index, {begin, end, type}); in addEntry()
291 if (Entries[index].Begin == begin && Entries[index].End == end) { in addEntry()
293 if (Entries[index].Type == type) return; in addEntry()
296 if (Entries[index].Type == nullptr) { in addEntry()
299 Entries[index].Type = nullptr; in addEntry()
[all …]
|
| /external/llvm-project/clang/lib/CodeGen/ |
| D | SwiftCallingConv.cpp | 279 if (Entries.empty() || Entries.back().End <= begin) { in addEntry()
280 Entries.push_back({begin, end, type}); in addEntry()
286 size_t index = Entries.size() - 1; in addEntry()
288 if (Entries[index - 1].End <= begin) break; in addEntry()
294 if (Entries[index].Begin >= end) { 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()
309 if (Entries[index].Type == type) return; in addEntry()
312 if (Entries[index].Type == nullptr) { in addEntry()
315 Entries[index].Type = nullptr; in addEntry()
[all …]
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| D | DebugLocStream.h | 54 SmallVector<Entry, 32> Entries; variable
80 Lists.emplace_back(CU, Entries.size()); in startList()
97 Entries.emplace_back(BeginSym, EndSym, DWARFBytes.size(), Comments.size()); in startEntry()
110 return makeArrayRef(Entries) in getEntries()
117 .slice(Entries[EI].ByteOffset, getNumBytes(EI)); in getBytes()
122 .slice(Entries[EI].CommentOffset, getNumComments(EI)); in getComments()
132 assert(&Entries.front() <= &E && &E <= &Entries.back() && in getIndex()
134 return &E - &Entries.front(); in getIndex()
138 return Entries.size() - Lists[LI].EntryOffset; in getNumEntries()
142 if (EI + 1 == Entries.size()) in getNumBytes()
[all …]
|
| D | DebugLocStream.cpp | 17 if (Lists.back().EntryOffset == Entries.size()) { in finalizeList()
29 if (Entries.back().ByteOffset != DWARFBytes.size()) in finalizeEntry()
33 Comments.erase(Comments.begin() + Entries.back().CommentOffset, in finalizeEntry()
35 Entries.pop_back(); in finalizeEntry()
37 assert(Lists.back().EntryOffset <= Entries.size() && in finalizeEntry()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/AsmPrinter/ |
| D | DebugLocStream.h | 49 SmallVector<Entry, 32> Entries; variable
82 Lists.emplace_back(CU, Entries.size()); in startList()
99 Entries.push_back({BeginSym, EndSym, DWARFBytes.size(), Comments.size()}); in startEntry()
112 return makeArrayRef(Entries) in getEntries()
119 .slice(Entries[EI].ByteOffset, getNumBytes(EI)); in getBytes()
124 .slice(Entries[EI].CommentOffset, getNumComments(EI)); in getComments()
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()
[all …]
|
| D | DbgEntityHistoryCalculator.cpp | 59 auto &Entries = VarEntries[Var]; in startDbgValue() local
60 if (!Entries.empty() && Entries.back().isDbgValue() && in startDbgValue()
61 !Entries.back().isClosed() && in startDbgValue()
62 Entries.back().getInstr()->isIdenticalTo(MI)) { in startDbgValue()
64 << "\t" << Entries.back().getInstr() << "\t" << MI in startDbgValue()
68 Entries.emplace_back(&MI, Entry::DbgValue); in startDbgValue()
69 NewIndex = Entries.size() - 1; in startDbgValue()
75 auto &Entries = VarEntries[Var]; in startClobber() local
78 if (Entries.back().isClobber() && Entries.back().getInstr() == &MI) in startClobber()
79 return Entries.size() - 1; in startClobber()
[all …]
|
| D | DwarfStringPool.cpp | 86 SmallVector<const StringMapEntry<EntryTy> *, 64> Entries; in emit() local
87 Entries.reserve(Pool.size()); in emit()
90 Entries.push_back(&E); in emit()
92 llvm::sort(Entries, [](const StringMapEntry<EntryTy> *A, in emit()
97 for (const auto &Entry : Entries) { in emit()
116 Entries.resize(NumIndexedStrings); in emit()
119 Entries[Entry.getValue().Index] = &Entry; in emit()
124 for (const auto &Entry : Entries) in emit()
|
| D | DebugLocStream.cpp | 16 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()
|
| /external/llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
| D | DebugLocStream.h | 49 SmallVector<Entry, 32> Entries; variable
82 Lists.emplace_back(CU, Entries.size()); in startList()
99 Entries.push_back({BeginSym, EndSym, DWARFBytes.size(), Comments.size()}); in startEntry()
112 return makeArrayRef(Entries) in getEntries()
119 .slice(Entries[EI].ByteOffset, getNumBytes(EI)); in getBytes()
124 .slice(Entries[EI].CommentOffset, getNumComments(EI)); in getComments()
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()
[all …]
|
| D | DwarfStringPool.cpp | 84 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()
|
| D | DebugLocStream.cpp | 16 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()
|
| /external/llvm-project/compiler-rt/lib/scudo/standalone/ |
| D | secondary.h | 106 if (Entries[I].Block) in store()
109 Entries[I] = Entries[0]; in store()
110 Entries[0].Block = reinterpret_cast<uptr>(H); in store()
111 Entries[0].BlockEnd = H->BlockEnd; in store()
112 Entries[0].MapBase = H->MapBase; in store()
113 Entries[0].MapSize = H->MapSize; in store()
114 Entries[0].Data = H->Data; in store()
115 Entries[0].Time = Time; in store()
137 if (!Entries[I].Block) in retrieve()
139 const uptr BlockSize = Entries[I].BlockEnd - Entries[I].Block; in retrieve()
[all …]
|
| /external/llvm-project/llvm/test/tools/llvm-readobj/COFF/ |
| 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 …]
|
| /external/e2fsprogs/tests/d_punch_bigalloc/ |
| D | expect | 20 Level Entries Logical Physical Length Flags
22 Level Entries Logical Physical Length Flags
30 Level Entries Logical Physical Length Flags
34 Level Entries Logical Physical Length Flags
38 Level Entries Logical Physical Length Flags
42 Level Entries Logical Physical Length Flags
47 Level Entries Logical Physical Length Flags
53 Level Entries Logical Physical Length Flags
59 Level Entries Logical Physical Length Flags
65 Level Entries Logical Physical Length Flags
[all …]
|
| /external/e2fsprogs/tests/d_punch/ |
| D | expect | 18 Level Entries Logical Physical Length Flags
20 Level Entries Logical Physical Length Flags
28 Level Entries Logical Physical Length Flags
35 Level Entries Logical Physical Length Flags
39 Level Entries Logical Physical Length Flags
44 Level Entries Logical Physical Length Flags
48 Level Entries Logical Physical Length Flags
53 Level Entries Logical Physical Length Flags
58 Level Entries Logical Physical Length Flags
63 Level Entries Logical Physical Length Flags
[all …]
|
| /external/llvm/utils/TableGen/ |
| D | SequenceToOffsetTable.h | 56 unsigned Entries; variable
64 SequenceToOffsetTable() : Entries(0) {} in SequenceToOffsetTable()
69 assert(Entries == 0 && "Cannot call add() after layout()"); in add()
87 assert(Entries && "Call layout() before size()"); in size()
88 return Entries; in size()
93 assert(Entries == 0 && "Can only call layout() once"); in layout()
97 I->second = Entries; in layout()
99 Entries += I->first.size() + 1; in layout()
105 assert(Entries && "Call layout() before get()"); in get()
117 assert(Entries && "Call layout() before emit()");
|
| /external/llvm-project/llvm/utils/TableGen/ |
| D | SequenceToOffsetTable.h | 111 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 …]
|
| /external/llvm-project/compiler-rt/lib/sanitizer_common/ |
| 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 …]
|
| /external/llvm-project/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyCFGSort.cpp | 222 SmallVector<Entry, 4> Entries; in sortBlocks() local
230 Entries.push_back(Entry(R)); in sortBlocks()
234 for (Entry &E : Entries) in sortBlocks()
238 while (!Entries.empty() && Entries.back().NumBlocksLeft == 0) in sortBlocks()
239 Entries.pop_back(); in sortBlocks()
259 if (!Entries.empty() && in sortBlocks()
260 !MDT.dominates(Entries.back().TheRegion->getHeader(), Next)) { in sortBlocks()
261 Entries.back().Deferred.push_back(Next); in sortBlocks()
290 if (!Entries.empty() && in sortBlocks()
291 !MDT.dominates(Entries.back().TheRegion->getHeader(), Next)) { in sortBlocks()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyCFGSort.cpp | 274 SmallVector<Entry, 4> Entries; in sortBlocks() local
282 Entries.push_back(Entry(R)); in sortBlocks()
286 for (Entry &E : Entries) in sortBlocks()
290 while (!Entries.empty() && Entries.back().NumBlocksLeft == 0) in sortBlocks()
291 Entries.pop_back(); in sortBlocks()
311 if (!Entries.empty() && in sortBlocks()
312 !MDT.dominates(Entries.back().TheRegion->getHeader(), Next)) { in sortBlocks()
313 Entries.back().Deferred.push_back(Next); in sortBlocks()
342 if (!Entries.empty() && in sortBlocks()
343 !MDT.dominates(Entries.back().TheRegion->getHeader(), Next)) { in sortBlocks()
[all …]
|
| /external/llvm-project/lld/test/COFF/ |
| D | manifestinput.test | 15 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
|
| /external/llvm-project/llvm/test/tools/llvm-cvtres/ |
| D | combined.test | 16 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
24 CHECK-NEXT: Number of String Entries: 0
25 CHECK-NEXT: Number of ID Entries: 1
45 CHECK-NEXT: Number of String Entries: 2
46 CHECK-NEXT: Number of ID Entries: 0
49 CHECK-NEXT: Number of String Entries: 0
50 CHECK-NEXT: Number of ID Entries: 1
[all …]
|