Searched refs:Entries (Results 1 - 25 of 108) sorted by relevance

12345

/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DDebugLocStream.cpp16 if (Lists.back().EntryOffset == Entries.size()) {
28 if (Entries.back().ByteOffset != DWARFBytes.size())
32 Comments.erase(Comments.begin() + Entries.back().CommentOffset,
34 Entries.pop_back();
36 assert(Lists.back().EntryOffset <= Entries.size() &&
H A DDebugLocStream.h49 SmallVector<Entry, 32> Entries; member in class:llvm::DebugLocStream
82 Lists.emplace_back(CU, Entries.size());
99 Entries.push_back({BeginSym, EndSym, DWARFBytes.size(), Comments.size()});
112 return makeArrayRef(Entries)
119 .slice(Entries[EI].ByteOffset, getNumBytes(EI));
124 .slice(Entries[EI].CommentOffset, getNumComments(EI));
134 assert(&Entries.front() <= &E && &E <= &Entries.back() &&
136 return &E - &Entries.front();
140 return Entries
[all...]
H A DDbgEntityHistoryCalculator.cpp59 auto &Entries = VarEntries[Var]; local
60 if (!Entries.empty() && Entries.back().isDbgValue() &&
61 !Entries.back().isClosed() &&
62 Entries.back().getInstr()->isIdenticalTo(MI)) {
64 << "\t" << Entries.back().getInstr() << "\t" << MI
68 Entries.emplace_back(&MI, Entry::DbgValue);
69 NewIndex = Entries.size() - 1;
75 auto &Entries = VarEntries[Var]; local
78 if (Entries
344 const Entries &Entries = VarRangePair.second; local
[all...]
H A DDwarfStringPool.cpp86 SmallVector<const StringMapEntry<EntryTy> *, 64> Entries; local
87 Entries.reserve(Pool.size());
90 Entries.push_back(&E);
92 llvm::sort(Entries, [](const StringMapEntry<EntryTy> *A,
97 for (const auto &Entry : Entries) {
116 Entries.resize(NumIndexedStrings);
119 Entries[Entry.getValue().Index] = &Entry;
124 for (const auto &Entry : Entries)
H A DDebugHandlerBase.cpp213 const auto &Entries = I.second; local
214 if (Entries.empty())
231 Entries.front().getInstr()->getDebugVariable();
234 if (!IsDescribedByReg(Entries.front().getInstr()))
235 LabelsBeforeInsn[Entries.front().getInstr()] = Asm->getFunctionBegin();
236 if (Entries.front().getInstr()->getDebugExpression()->isFragment()) {
238 for (auto I = Entries.begin(); I != Entries.end(); ++I) {
242 if (std::any_of(Entries.begin(), I,
260 for (const auto &Entry : Entries) {
[all...]
H A DAddressPool.cpp64 SmallVector<const MCExpr *, 64> Entries(Pool.size());
67 Entries[I.second.Number] =
72 for (const MCExpr *Entry : Entries)
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DSequenceToOffsetTable.h54 // Entries in the final table, or 0 before layout was called.
55 unsigned Entries; member in class:llvm::SequenceToOffsetTable
63 SequenceToOffsetTable() : Entries(0) {}
68 assert(Entries == 0 && "Cannot call add() after layout()");
86 assert((empty() || Entries) && "Call layout() before size()");
87 return Entries;
92 assert(Entries == 0 && "Can only call layout() once");
96 I->second = Entries;
98 Entries += I->first.size() + 1;
104 assert(Entries
[all...]
H A DSearchableTableEmitter.cpp49 std::vector<std::unique_ptr<Entry>> Entries; member in struct:__anon2937::GenericEnum
74 std::vector<Record *> Entries; member in struct:__anon2937::GenericTable
286 for (const auto &Entry : Enum.Entries)
309 IndexRows = Table.Entries;
321 std::vector<std::pair<Record *, unsigned>> Entries; local
322 Entries.reserve(Table.Entries.size());
323 for (unsigned i = 0; i < Table.Entries.size(); ++i)
324 Entries.emplace_back(Table.Entries[
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/lib/CodeGen/
H A DSwiftCallingConv.cpp266 if (Entries.empty() || Entries.back().End <= begin) {
267 Entries.push_back({begin, end, type});
272 // TODO: do a binary search if Entries is big enough for it to matter.
273 size_t index = Entries.size() - 1;
275 if (Entries[index - 1].End <= begin) break;
281 if (Entries[index].Begin >= end) {
285 Entries.insert(Entries.begin() + index, {begin, end, type});
294 if (Entries[inde
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/MCA/HardwareUnits/
H A DRetireControlUnit.cpp43 unsigned Entries = normalizeQuantity(Inst.getNumMicroOps()); local
44 assert((AvailableEntries >= Entries) && "Reorder Buffer unavailable!");
47 Queue[NextAvailableSlotIdx] = {IR, Entries, false};
48 NextAvailableSlotIdx += std::max(1U, Entries);
51 AvailableEntries -= Entries;
94 dbgs() << "Retire Unit: { Total ROB Entries =" << NumROBEntries
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/
H A DDebugInlineeLinesSubsection.cpp71 Size += Entries.size() * sizeof(InlineeSourceLineHeader);
74 Size += Entries.size() * sizeof(uint32_t);
91 for (const auto &E : Entries) {
110 auto &Entry = Entries.back();
120 Entries.emplace_back();
121 auto &Entry = Entries.back();
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFDebugRangeList.h64 std::vector<RangeListEntry> Entries; member in class:llvm::DWARFDebugRangeList
72 const std::vector<RangeListEntry> &getEntries() { return Entries; }
H A DDWARFDebugPubTable.h59 std::vector<Entry> Entries; member in struct:llvm::DWARFDebugPubTable::Set
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Basic/
H A DSanitizerSpecialCaseList.h45 : Mask(SM), Entries(E){};
48 SectionEntries &Entries; member in struct:clang::SanitizerSpecialCaseList::SanitizerSection
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/
H A DDWARFDebugRangeList.cpp22 Entries.clear();
55 Entries.push_back(Entry);
61 for (const RangeListEntry &RLE : Entries) {
73 for (const RangeListEntry &RLE : Entries) {
H A DDWARFDebugPubTable.cpp42 SetData.Entries.push_back(
57 for (const Entry &E : S.Entries) {
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_interceptors_ioctl_netbsd.inc45 /* 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 fro
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/MC/
H A DConstantPools.cpp27 if (Entries.empty())
30 for (const ConstantPoolEntry &Entry : Entries) {
36 Entries.clear();
50 Entries.push_back(ConstantPoolEntry(CPEntryLabel, Value, Size, Loc));
57 bool ConstantPool::empty() { return Entries.empty(); }
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyCFGSort.cpp274 SmallVector<Entry, 4> Entries; local
282 Entries.push_back(Entry(R));
286 for (Entry &E : Entries)
290 while (!Entries.empty() && Entries.back().NumBlocksLeft == 0)
291 Entries.pop_back();
311 if (!Entries.empty() &&
312 !MDT.dominates(Entries.back().TheRegion->getHeader(), Next)) {
313 Entries.back().Deferred.push_back(Next);
342 if (!Entries
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Instrumentation/
H A DAddressSanitizer.h55 auto Pos = Entries.find(G);
56 return (Pos != Entries.end()) ? Pos->second : Entry();
71 DenseMap<GlobalVariable *, Entry> Entries; member in class:llvm::GlobalsMetadata
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DDbgEntityHistoryCalculator.h74 using Entries = SmallVector<Entry, 4>;
76 using EntriesMap = MapVector<InlinedEntity, Entries>;
87 auto &Entries = VarEntries[Var]; local
88 return Entries[Index];
/freebsd-11-stable/contrib/llvm-project/clang/lib/Basic/
H A DSanitizerSpecialCaseList.cpp52 SanitizerSections.emplace_back(Mask, S.Entries);
61 SpecialCaseList::inSectionBlame(S.Entries, Prefix, Query, Category))
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/CodeView/
H A DDebugInlineeLinesSubsection.h111 std::vector<Entry>::const_iterator begin() const { return Entries.begin(); }
112 std::vector<Entry>::const_iterator end() const { return Entries.end(); }
118 std::vector<Entry> Entries; member in class:llvm::codeview::final
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/xray/
H A Dxray_interface_internal.h54 size_t Entries; member in struct:__xray::XRaySledMap
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DInterferenceCache.cpp64 Entries[i].clear(mf, indexes, lis);
69 if (E < CacheEntries && Entries[E].getPhysReg() == PhysReg) {
70 if (!Entries[E].valid(LIUArray, TRI))
71 Entries[E].revalidate(LIUArray, TRI);
72 return &Entries[E];
80 if (Entries[E].hasRefs()) {
85 Entries[E].reset(PhysReg, LIUArray, TRI, MF);
87 return &Entries[E];

Completed in 293 milliseconds

12345