| /netbsd-src/external/apache2/llvm/dist/clang/lib/CodeGen/ |
| H A 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 …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/ |
| H A 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 …]
|
| H A D | DbgEntityHistoryCalculator.cpp | 77 auto &Entries = VarEntries[Var]; in startDbgValue() local
78 if (!Entries.empty() && Entries.back().isDbgValue() && in startDbgValue()
79 !Entries.back().isClosed() && in startDbgValue()
80 Entries.back().getInstr()->isIdenticalTo(MI)) { in startDbgValue()
82 << "\t" << Entries.back().getInstr() << "\t" << MI in startDbgValue()
86 Entries.emplace_back(&MI, Entry::DbgValue); 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()
[all …]
|
| H A 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()
|
| H A 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()
|
| H A D | DebugHandlerBase.cpp | 275 const auto &Entries = I.second; in beginFunction() local
276 if (Entries.empty()) in beginFunction()
299 Entries.front().getInstr()->getDebugVariable(); in beginFunction()
302 Entries.front().getInstr()->getParent()->sameSection(&MF->front())) { in beginFunction()
303 if (!IsDescribedByReg(Entries.front().getInstr())) in beginFunction()
304 LabelsBeforeInsn[Entries.front().getInstr()] = Asm->getFunctionBegin(); in beginFunction()
305 if (Entries.front().getInstr()->getDebugExpression()->isFragment()) { in beginFunction()
307 for (auto I = Entries.begin(); I != Entries.end(); ++I) { in beginFunction()
311 if (std::any_of(Entries.begin(), I, in beginFunction()
329 for (const auto &Entry : Entries) { in beginFunction()
|
| H A D | AddressPool.cpp | 59 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()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| H A 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 …]
|
| H A D | SearchableTableEmitter.cpp | 50 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()
336 std::vector<std::pair<Record *, unsigned>> Entries; in emitLookupFunction() local
337 Entries.reserve(Table.Entries.size()); in emitLookupFunction()
338 for (unsigned i = 0; i < Table.Entries.size(); ++i) in emitLookupFunction()
339 Entries.emplace_back(Table.Entries[i], i); in emitLookupFunction()
341 llvm::stable_sort(Entries, [&](const std::pair<Record *, unsigned> &LHS, in emitLookupFunction()
346 IndexRowsStorage.reserve(Entries.size()); in emitLookupFunction()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/libsanitizer/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 …]
|
| /netbsd-src/external/gpl3/gcc.old/dist/libsanitizer/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 …]
|
| /netbsd-src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| H A D | sanitizer_interceptors_ioctl_netbsd.inc | 46 /* Entries from file: altq/altq_afmap.h */
51 /* Entries from file: altq/altq.h */
55 /* Entries from file: altq/altq_blue.h */
60 /* Entries from file: altq/altq_cbq.h */
67 /* Entries from file: altq/altq_cdnr.h */
81 /* Entries from file: altq/altq_fifoq.h */
84 /* Entries from file: altq/altq_hfsc.h */
88 /* Entries from file: altq/altq_jobs.h */
96 /* Entries from file: altq/altq_priq.h */
105 /* Entries from file: altq/altq_red.h */
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyCFGSort.cpp | 224 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()
288 !MDT.dominates(Entries.back().TheRegion->getHeader(), Next)) { in sortBlocks()
289 Entries.back().Deferred.push_back(Next); in sortBlocks()
318 if (!Entries.empty() && in sortBlocks()
[all …]
|
| H A D | WebAssemblyFixIrreducibleControlFlow.cpp | 69 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()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| H A D | DbgEntityHistoryCalculator.h | 96 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;
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/DebugInfo/CodeView/ |
| H A D | DebugInlineeLinesSubsection.cpp | 71 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()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/MCA/HardwareUnits/ |
| H A D | RetireControlUnit.cpp | 45 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()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/tools/dsymutil/ |
| H A D | DebugMap.cpp | 61 std::vector<Entry> Entries; in print() local
62 Entries.reserve(Symbols.getNumItems()); in print()
64 Entries.push_back(std::make_pair(Sym.getKey(), Sym.getValue())); in print()
65 llvm::sort(Entries, [](const Entry &LHS, const Entry &RHS) { in print()
68 for (const auto &Sym : Entries) { in print()
160 std::vector<dsymutil::DebugMapObject::YAMLSymbolMapping> Entries; member
176 io.mapRequired("symbols", Norm->Entries); in mapping()
229 Entries.reserve(Obj.Symbols.size()); in YamlDMO()
231 Entries.push_back( in YamlDMO()
280 for (auto &Entry : Entries) { in denormalize()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/MC/ |
| H A D | ConstantPools.cpp | 27 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()
|
| /netbsd-src/sys/external/bsd/acpica/dist/common/ |
| H A D | dmtbdump.c | 324 UINT32 Entries; in AcpiDmDumpXsdt()
336 Entries = (Table->Length - sizeof (ACPI_TABLE_HEADER)) / sizeof (UINT32); in AcpiDmDumpXsdt()
338 for (i = 0; i < Entries; i++)
364 UINT32 Entries; in AcpiDmDumpFadt()
376 Entries = (Table->Length - sizeof (ACPI_TABLE_HEADER)) / sizeof (UINT64); in AcpiDmDumpFadt()
378 for (i = 0; i < Entries; i++) in AcpiDmDumpFadt()
277 UINT32 Entries; AcpiDmDumpRsdt() local
317 UINT32 Entries; AcpiDmDumpXsdt() local
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| H A D | InterferenceCache.cpp | 60 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()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/ |
| H A D | DWARFDebugRangeList.cpp | 22 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()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ObjectYAML/ |
| H A D | ELFYAML.h | 314 Optional<std::vector<BBAddrMapEntry>> Entries; member
319 return {{"Entries", Entries.hasValue()}}; in getEntries()
328 Optional<std::vector<StackSizeEntry>> Entries; member
333 return {{"Entries", Entries.hasValue()}}; in getEntries()
346 Optional<std::vector<DynamicEntry>> Entries; member
351 return {{"Entries", Entries.hasValue()}}; in getEntries()
528 Optional<std::vector<CallGraphEntry>> Entries; member
533 return {{"Entries", Entries.hasValue()}}; in getEntries()
542 Optional<std::vector<uint16_t>> Entries; member
547 return {{"Entries", Entries.hasValue()}}; in getEntries()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Support/ |
| H A D | TimeProfiler.cpp | 95 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
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/DWARF/ |
| H A D | DWARFListTable.h | 43 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()
|