| /src/external/apache2/llvm/dist/clang/include/clang/Basic/ |
| SanitizerSpecialCaseList.h | 42 // Query ignorelisted entries if any bit in Mask matches the entry's section.
52 : Mask(SM), Entries(E){};
55 SectionEntries &Entries;
|
| /src/external/apache2/llvm/dist/clang/include/clang/CodeGen/ |
| SwiftCallingConv.h | 53 SmallVector<StorageEntry, 4> Entries;
75 return Entries.empty();
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/DWARF/ |
| DWARFDebugRangeList.h | 51 /// subsequent entries of the location list.
64 std::vector<RangeListEntry> Entries;
72 const std::vector<RangeListEntry> &getEntries() { return Entries; }
|
| DWARFDebugLoc.h | 25 /// A single location within a location list. Entries are stored in the DWARF5
93 SmallVector<DWARFLocationEntry, 2> Entries;
|
| DWARFDebugPubTable.h | 39 /// Each table consists of sets of variable length entries. Each set describes
41 /// whose definitions are represented by debugging information entries owned
44 /// The total length of the entries for that set, not including the length
63 std::vector<Entry> Entries;
|
| DWARFListTable.h | 25 /// A base class for DWARF list entries, such as range or location list
26 /// entries.
36 /// A base class for lists of entries that are extracted from a particular
43 ListEntries Entries;
46 const ListEntries &getEntries() const { return Entries; }
47 bool empty() const { return Entries.empty(); }
48 void clear() { Entries.clear(); }
58 /// The total length of the entries for this table, not including the length
145 /// more list entries. The list entries are kept in a map where the keys ar
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| SpecialCaseList.h | 15 // entries below it apply to. Section names are regular expressions, and
16 // entries without a section header match all sections (e.g. an '[*]' header
71 /// Parses the special case list entries from files. On failure, returns
80 /// Parses the special case list entries from files. On failure, reports a
140 SectionEntries Entries;
145 /// Parses just-constructed SpecialCaseList entries from a memory buffer.
151 unsigned inSectionBlame(const SectionEntries &Entries, StringRef Prefix,
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfStringPool.cpp | 83 // Get all of the string pool entries and sort them by their offset.
84 SmallVector<const StringMapEntry<EntryTy> *, 64> Entries;
85 Entries.reserve(Pool.size());
88 Entries.push_back(&E);
90 llvm::sort(Entries, [](const StringMapEntry<EntryTy> *A,
95 for (const auto &Entry : Entries) {
99 // Emit a label for reference from debug information entries.
112 // Now only take the indexed entries and put them in an array by their ID so
114 Entries.resize(NumIndexedStrings);
117 Entries[Entry.getValue().Index] = &Entry
[all...] |
| DebugHandlerBase.cpp | 275 const auto &Entries = I.second;
276 if (Entries.empty())
299 Entries.front().getInstr()->getDebugVariable();
302 Entries.front().getInstr()->getParent()->sameSection(&MF->front())) {
303 if (!IsDescribedByReg(Entries.front().getInstr()))
304 LabelsBeforeInsn[Entries.front().getInstr()] = Asm->getFunctionBegin();
305 if (Entries.front().getInstr()->getDebugExpression()->isFragment()) {
307 for (auto I = Entries.begin(); I != Entries.end(); ++I) {
311 if (std::any_of(Entries.begin(), I
[all...] |
| DbgEntityHistoryCalculator.cpp | 77 auto &Entries = VarEntries[Var];
78 if (!Entries.empty() && Entries.back().isDbgValue() &&
79 !Entries.back().isClosed() &&
80 Entries.back().getInstr()->isIdenticalTo(MI)) {
81 LLVM_DEBUG(dbgs() << "Coalescing identical DBG_VALUE entries:\n"
82 << "\t" << Entries.back().getInstr() << "\t" << MI
86 Entries.emplace_back(&MI, Entry::DbgValue);
87 NewIndex = Entries.size() - 1;
93 auto &Entries = VarEntries[Var]
[all...] |
| DebugLocStream.h | 24 /// Byte stream of .debug_loc entries.
26 /// Stores a unified stream of .debug_loc entries. There's \a List for each
49 SmallVector<Entry, 32> Entries;
79 /// Until the next call, \a startEntry() will add entries to this list.
82 Lists.emplace_back(CU, Entries.size());
88 /// If there are no entries in this list, delete it outright. Otherwise,
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))
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/MCA/HardwareUnits/ |
| RetireControlUnit.cpp | 45 unsigned Entries = normalizeQuantity(Inst.getNumMicroOps());
46 assert((AvailableEntries >= Entries) && "Reorder Buffer unavailable!");
49 Queue[NextAvailableSlotIdx] = {IR, Entries, false};
50 NextAvailableSlotIdx += std::max(1U, Entries);
54 AvailableEntries -= Entries;
97 dbgs() << "Retire Unit: { Total ROB Entries =" << NumROBEntries
98 << ", Available ROB entries=" << AvailableEntries << " }\n";
|
| /src/sys/external/bsd/acpica/dist/common/ |
| dmtbdump.c | 324 UINT32 Entries;
336 Entries = (Table->Length - sizeof (ACPI_TABLE_HEADER)) / sizeof (UINT32);
338 for (i = 0; i < Entries; i++)
364 UINT32 Entries;
376 Entries = (Table->Length - sizeof (ACPI_TABLE_HEADER)) / sizeof (UINT64);
378 for (i = 0; i < Entries; i++)
|
| /src/sys/external/bsd/compiler_rt/dist/lib/xray/ |
| xray_interface_internal.h | 55 size_t Entries;
|
| /src/external/apache2/llvm/dist/clang/include/clang/Frontend/ |
| LogDiagnosticPrinter.h | 59 SmallVector<DiagEntry, 8> Entries;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| DbgEntityHistoryCalculator.h | 58 /// There exist two types of entries:
96 using Entries = SmallVector<Entry, 4>;
98 using EntriesMap = MapVector<InlinedEntity, Entries>;
109 auto &Entries = VarEntries[Var];
110 return Entries[Index];
113 /// Test whether a vector of entries features any non-empty locations. It
114 /// could have no entries, or only DBG_VALUE $noreg entries.
115 bool hasNonEmptyLocation(const Entries &Entries) const
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Instrumentation/ |
| AddressSanitizer.h | 56 auto Pos = Entries.find(G);
57 return (Pos != Entries.end()) ? Pos->second : Entry();
72 DenseMap<GlobalVariable *, Entry> Entries;
|
| /src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| SequenceToOffsetTable.h | 85 /// reusing entries.
110 // Entries in the final table, or 0 before layout was called.
111 unsigned Entries;
119 SequenceToOffsetTable() : Entries(0) {}
124 assert(Entries == 0 && "Cannot call add() after layout()");
142 assert((empty() || Entries) && "Call layout() before size()");
143 return Entries;
148 assert(Entries == 0 && "Can only call layout() once");
152 I->second = Entries;
154 Entries += I->first.size() + 1
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/CodeView/ |
| DebugInlineeLinesSubsection.h | 111 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;
|
| /src/external/apache2/llvm/dist/llvm/lib/IR/ |
| ProfileSummary.cpp | 57 std::vector<Metadata *> Entries;
65 Entries.push_back(MDTuple::get(Context, EntryMD));
68 MDTuple::get(Context, Entries)};
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/ |
| WebAssemblyCFGSort.cpp | 224 SmallVector<Entry, 4> Entries;
232 Entries.push_back(Entry(R));
236 for (Entry &E : Entries)
240 while (!Entries.empty() && Entries.back().NumBlocksLeft == 0)
241 Entries.pop_back();
266 for (Entry &E : Entries) {
287 if (!Entries.empty() &&
288 !MDT.dominates(Entries.back().TheRegion->getHeader(), Next)) {
289 Entries.back().Deferred.push_back(Next)
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/dsymutil/ |
| DebugMap.cpp | 61 std::vector<Entry> Entries;
62 Entries.reserve(Symbols.getNumItems());
64 Entries.push_back(std::make_pair(Sym.getKey(), Sym.getValue()));
65 llvm::sort(Entries, [](const Entry &LHS, const Entry &RHS) {
68 for (const auto &Sym : Entries) {
160 std::vector<dsymutil::DebugMapObject::YAMLSymbolMapping> Entries;
176 io.mapRequired("symbols", Norm->Entries);
229 Entries.reserve(Obj.Symbols.size());
231 Entries.push_back(
280 for (auto &Entry : Entries) {
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-readobj/ |
| Win64EHDumper.cpp | 372 const RuntimeFunction *Entries =
375 ArrayRef<RuntimeFunction> RuntimeFunctions(Entries, Count);
|
| /src/sys/dev/ |
| efi.c | 161 struct EFI_SYSTEM_RESOURCE_ENTRY Entries[];
273 offsetof(struct EFI_SYSTEM_RESOURCE_TABLE, Entries);
274 if (tab->FwResourceCount > entry_space/sizeof(tab->Entries[0]))
281 Entries[tab->FwResourceCount]);
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| InterferenceCache.h | 135 // much memory. Instead, a fixed number of cache entries are used in a round-
151 // The actual cache entries.
152 Entry Entries[CacheEntries];
|
