HomeSort by relevance Sort by last modified time
    Searched refs:Entries (Results 1 - 25 of 232) sorted by null

1 2 3 4 5 6 7 8 910

  /external/llvm/lib/CodeGen/AsmPrinter/
DebugLocStream.cpp 17 if (Lists.back().EntryOffset == Entries.size()) {
29 if (Entries.back().ByteOffset != DWARFBytes.size())
33 Comments.erase(Comments.begin() + Entries.back().CommentOffset,
35 Entries.pop_back();
37 assert(Lists.back().EntryOffset <= Entries.size() &&
38 "Popped off more entries than are in the list");
DebugLocStream.h 25 /// \brief Byte stream of .debug_loc entries.
27 /// Stores a unified stream of .debug_loc entries. There's \a List for each
54 SmallVector<Entry, 32> Entries;
77 /// Until the next call, \a startEntry() will add entries to this list.
80 Lists.emplace_back(CU, Entries.size());
86 /// If there are no entries in this list, delete it outright. Otherwise,
97 Entries.emplace_back(BeginSym, EndSym, DWARFBytes.size(), Comments.size());
110 return makeArrayRef(Entries)
117 .slice(Entries[EI].ByteOffset, getNumBytes(EI));
122 .slice(Entries[EI].CommentOffset, getNumComments(EI))
    [all...]
AddressPool.cpp 34 // Order the address pool entries by ID
35 SmallVector<const MCExpr *, 64> Entries(Pool.size());
38 Entries[I.second.Number] =
43 for (const MCExpr *Entry : Entries)
DwarfStringPool.cpp 45 // Get all of the string pool entries and put them in an array by their ID so
47 SmallVector<const StringMapEntry<EntryTy> *, 64> Entries(Pool.size());
50 Entries[E.getValue().Index] = &E;
52 for (const auto &Entry : Entries) {
56 // Emit a label for reference from debug information entries.
71 for (const auto &Entry : Entries)
  /frameworks/native/cmds/lshal/
TableEntry.h 65 using Entries = std::vector<TableEntry>;
67 Entries entries; member in struct:android::lshal::Table
69 Entries::iterator begin() { return entries.begin(); }
70 Entries::const_iterator begin() const { return entries.begin(); }
71 Entries::iterator end() { return entries.end(); }
72 Entries::const_iterator end() const { return entries.end();
    [all...]
  /external/llvm/utils/TableGen/
SequenceToOffsetTable.h 30 /// reusing entries.
55 // Entries in the final table, or 0 before layout was called.
56 unsigned Entries;
64 SequenceToOffsetTable() : Entries(0) {}
69 assert(Entries == 0 && "Cannot call add() after layout()");
87 assert(Entries && "Call layout() before size()");
88 return Entries;
93 assert(Entries == 0 && "Can only call layout() once");
97 I->second = Entries;
99 Entries += I->first.size() + 1
    [all...]
  /external/clang/lib/CodeGen/
SwiftCallingConv.cpp 262 // Fast path: we can just add entries to the end.
263 if (Entries.empty() || Entries.back().End <= begin) {
264 Entries.push_back({begin, end, type});
269 // TODO: do a binary search if Entries is big enough for it to matter.
270 size_t index = Entries.size() - 1;
272 if (Entries[index - 1].End <= begin) break;
278 if (Entries[index].Begin >= end) {
282 Entries.insert(Entries.begin() + index, {begin, end, type})
    [all...]
  /external/llvm/include/llvm/DebugInfo/DWARF/
DWARFDebugFrame.h 39 std::vector<std::unique_ptr<FrameEntry>> Entries;
DWARFDebugLoc.h 38 SmallVector<Entry, 2> Entries;
68 SmallVector<Entry, 2> Entries;
DWARFDebugRangeList.h 48 // subsequent entries of the location list.
62 std::vector<RangeListEntry> Entries;
69 const std::vector<RangeListEntry> &getEntries() { return Entries; }
  /external/llvm/lib/DebugInfo/DWARF/
DWARFDebugRangeList.cpp 19 Entries.clear();
42 Entries.push_back(entry);
48 for (const RangeListEntry &RLE : Entries) {
60 for (const RangeListEntry &RLE : Entries) {
DWARFDebugLoc.cpp 21 for (const Entry &E : L.Entries) {
22 if (&E != L.Entries.begin())
70 Loc.Entries.push_back(std::move(E));
105 Loc.Entries.push_back(std::move(E));
114 for (const Entry &E : L.Entries) {
115 if (&E != L.Entries.begin())
  /external/llvm/lib/MC/
ConstantPools.cpp 25 if (Entries.empty())
28 for (const ConstantPoolEntry &Entry : Entries) {
34 Entries.clear();
41 Entries.push_back(ConstantPoolEntry(CPEntryLabel, Value, Size, Loc));
45 bool ConstantPool::empty() { return Entries.empty(); }
  /device/linaro/bootloader/edk2/AppPkg/Applications/Sockets/WebServer/
WebServer.c 64 if ( pWebServer->Entries >= MaxEntries ) {
112 // Initialize the new entries in the FD list
144 // Initialize the new entries in the port list
191 pFdList[ pWebServer->Entries ].fd = SocketFD;
192 pFdList[ pWebServer->Entries ].events = POLLRDNORM
194 pFdList[ pWebServer->Entries ].revents = 0;
199 pWebServer->ppPortList[ pWebServer->Entries ] = pPort;
204 pWebServer->Entries += 1;
207 pWebServer->Entries ));
237 nfds_t Entries;
    [all...]
Handles.c 37 INTN Entries;
106 Entries = LengthInBytes / sizeof ( *pHandleArray );
108 pHandleEnd = &pHandle [ Entries ];
  /device/linaro/bootloader/edk2/DuetPkg/DxeIpl/
DxeInit.c 239 gHob->NvStorageFvb.FvbInfo.Entries[0].Base, gHob->NvFtwFvb.FvbInfo.Entries[0].Length,
242 gHob->NvStorage.FvbInfo.Entries[0].Base, gHob->NvStorage.FvbInfo.Entries[0].Length,
244 gHob->NvFtwWorking.FvbInfo.Entries[0].Base, gHob->NvFtwWorking.FvbInfo.Entries[0].Length,
245 gHob->NvFtwSpare.FvbInfo.Entries[0].Base, gHob->NvFtwSpare.FvbInfo.Entries[0].Length,
  /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Foundation/Include/
EfiFlashMap.h 76 EFI_FLASH_SUBAREA_ENTRY Entries[1];
84 EFI_FLASH_SUBAREA_ENTRY Entries[1];
103 EFI_FLASH_SUBAREA_ENTRY Entries[1];
  /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Foundation/Ppi/FlashMap/
FlashMap.h 47 OUT EFI_FLASH_SUBAREA_ENTRY **Entries
  /external/llvm/tools/dsymutil/
DebugMap.cpp 42 std::vector<Entry> Entries;
43 Entries.reserve(Symbols.getNumItems());
45 Entries.push_back(std::make_pair(Sym.getKey(), Sym.getValue()));
47 Entries.begin(), Entries.end(),
49 for (const auto &Sym : Entries) {
136 std::vector<dsymutil::DebugMapObject::YAMLSymbolMapping> Entries;
152 io.mapRequired("symbols", Norm->Entries);
206 Entries.reserve(Obj.Symbols.size());
208 Entries.push_back(std::make_pair(Entry.getKey(), Entry.getValue()))
    [all...]
  /external/swiftshader/third_party/LLVM/lib/CodeGen/
InterferenceCache.cpp 33 Entries[i].clear(mf, indexes);
38 if (E < CacheEntries && Entries[E].getPhysReg() == PhysReg) {
39 if (!Entries[E].valid(LIUArray, TRI))
40 Entries[E].revalidate();
41 return &Entries[E];
48 // Skip entries that are in use.
49 if (Entries[E].hasRefs()) {
54 Entries[E].reset(PhysReg, LIUArray, TRI, MF);
56 return &Entries[E];
58 llvm_unreachable("Ran out of interference cache entries.")
    [all...]
  /device/linaro/bootloader/edk2/MdePkg/Include/Protocol/
VlanConfig.h 82 VLAN and allocate a buffer into which those entries are copied.
88 @param[out] Entries The buffer which receive the VLAN configuration.
103 OUT EFI_VLAN_FIND_DATA **Entries
  /external/llvm/include/llvm/Support/
SpecialCaseList.h 62 /// Parses the special case list entries from files. On failure, returns
70 /// Parses the special case list entries from files. On failure, reports a
90 StringMap<StringMap<Entry>> Entries;
95 /// Parses just-constructed SpecialCaseList entries from a memory buffer.
  /external/llvm/lib/CodeGen/
InterferenceCache.cpp 31 // this is because PhysRegEntries works like a SparseSet and its entries are
53 Entries[i].clear(mf, indexes, lis);
58 if (E < CacheEntries && Entries[E].getPhysReg() == PhysReg) {
59 if (!Entries[E].valid(LIUArray, TRI))
60 Entries[E].revalidate(LIUArray, TRI);
61 return &Entries[E];
68 // Skip entries that are in use.
69 if (Entries[E].hasRefs()) {
74 Entries[E].reset(PhysReg, LIUArray, TRI, MF);
76 return &Entries[E]
    [all...]
  /external/swiftshader/third_party/LLVM/utils/TableGen/
EDEmitter.cpp 41 std::vector<std::string> Entries;
46 Entries.push_back(std::string(e));
47 return Entries.size() - 1;
54 unsigned int numEntries = Entries.size();
56 o.indent(i) << Entries[index];
71 unsigned int numEntries = Entries.size();
74 o.indent(i) << Entries[index] << " = " << format("0x%x", flag);
123 std::vector<ConstantEmitter *> Entries;
128 Entries.push_back(e);
133 while (Entries.size())
    [all...]
  /device/linaro/bootloader/edk2/CorebootModulePkg/Library/CbParseLib/
CbParseLib.c 137 DEBUG ((EFI_D_ERROR, "Incorrect checksum of all the coreboot table entries\n"));
187 struct cbmem_entry *Entries;
196 Entries = Root->entries;
197 if (Entries[0].magic == CBMEM_ENTRY_MAGIC) {
200 Entries = (struct cbmem_entry *)((struct imd_root *)Root)->entries;
201 if (Entries[0].magic == IMD_ENTRY_MAGIC) {
209 if (Entries[Idx].id == TableId) {
211 *pMemTable = (VOID *) ((UINTN)Entries[Idx].start + (UINTN)Root);
    [all...]

Completed in 373 milliseconds

1 2 3 4 5 6 7 8 910