| /external/llvm/include/llvm/DebugInfo/DWARF/ |
| DWARFDebugFrame.h | 37 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/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.
|
| YAMLTraits.h | 1048 std::vector<std::unique_ptr<HNode>> Entries;
[all...] |
| /external/llvm/include/llvm/MC/ |
| ConstantPools.h | 42 EntryVecTy Entries;
|
| /external/clang/include/clang/Frontend/ |
| LogDiagnosticPrinter.h | 60 SmallVector<DiagEntry, 8> Entries;
|
| /external/llvm/utils/TableGen/ |
| SequenceToOffsetTable.h | 31 /// reusing entries.
56 // Entries in the final table, or 0 before layout was called.
57 unsigned Entries;
65 SequenceToOffsetTable() : Entries(0) {}
70 assert(Entries == 0 && "Cannot call add() after layout()");
88 assert(Entries && "Call layout() before size()");
89 return Entries;
94 assert(Entries == 0 && "Can only call layout() once");
98 I->second = Entries;
100 Entries += I->first.size() + 1
[all...] |
| DAGISelMatcherOpt.cpp | 410 // Check to see if all of the leading entries are now opcode checks. If so,
488 Matcher *Entries[2] = { PrevMatcher, MatcherWithoutCTM };
489 Cases[Entry-1].second = new ScopeMatcher(Entries);
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/gs/ |
| acl.py | 32 ENTRIES = 'Entries'
59 self.entries = Entries(self)
71 acl_entries = self.entries
82 self.entries.entry_list.append(entry)
88 self.entries.entry_list.append(entry)
93 self.entries.entry_list.append(entry)
97 self.entries.entry_list.append(entry)
103 elif name.lower() == ENTRIES.lower()
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| FilteredKeyMultimap.java | 180 return new Entries();
183 class Entries extends ForwardingCollection<Entry<K, V>> {
186 return Collections2.filter(unfiltered.entries(), entryPredicate());
|
| AbstractMultimap.java | 89 for (Map.Entry<? extends K, ? extends V> entry : multimap.entries()) {
103 private transient Collection<Entry<K, V>> entries; field in class:AbstractMultimap
106 public Collection<Entry<K, V>> entries() { method in class:AbstractMultimap
107 Collection<Entry<K, V>> result = entries;
108 return (result == null) ? entries = createEntries() : result;
115 return new Entries();
119 private class Entries extends Multimaps.Entries<K, V> {
131 private class EntrySet extends Entries implements Set<Entry<K, V>> {
200 return Maps.valueIterator(entries().iterator())
[all...] |
| /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) {
133 std::vector<dsymutil::DebugMapObject::YAMLSymbolMapping> Entries;
149 io.mapRequired("symbols", Norm->Entries);
203 Entries.reserve(Obj.Symbols.size());
205 Entries.push_back(std::make_pair(Entry.getKey(), Entry.getValue()))
[all...] |
| /external/llvm/tools/llvm-readobj/ |
| Win64EHDumper.cpp | 313 const RuntimeFunction *Entries =
316 ArrayRef<RuntimeFunction> RuntimeFunctions(Entries, Count);
|
| ARMEHABIPrinter.h | 478 /// ARM EHABI Section 5 - Index Table Entries
490 const unsigned Entries = IT->sh_size / IndexTableEntrySize;
492 ListScope E(SW, "Entries");
493 for (unsigned Entry = 0; Entry < Entries; ++Entry) {
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| 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...] |
| DwarfAccelTable.h | 236 StringEntries Entries;
|
| /external/llvm/lib/CodeGen/ |
| InterferenceCache.h | 133 // much memory. Instead, a fixed number of cache entries are used in a round-
145 // The actual cache entries.
146 Entry Entries[CacheEntries];
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/gdiplus/ |
| gdipluspixelformats.h | 92 ARGB Entries[1];
|
| /external/llvm/include/llvm/CodeGen/ |
| MIRYamlMapping.h | 302 std::vector<Entry> Entries;
328 YamlIO.mapOptional("entries", JT.Entries);
421 if (!YamlIO.outputting() || !MF.JumpTableInfo.Entries.empty())
|
| /toolchain/binutils/binutils-2.25/gold/ |
| merge.h | 112 // A list of entries for a particular input section.
115 typedef std::vector<Input_merge_entry> Entries;
138 Entries entries; member in struct:gold::Object_merge_map::Input_merge_map
139 // Whether the ENTRIES field is sorted by input_offset.
143 : merge_map(NULL), entries(), sorted(true)
406 // Compare two entries in the hash table for equality. To do this
450 // The number of entries seen in input files.
566 // The number of entries seen in input files.
|
| /external/chromium-trace/catapult/third_party/gsutil/gslib/ |
| translation_helper.py | 30 from boto.gs.acl import Entries
90 # when a default object ACL should be private (containing no entries).
677 acl.entries = cls.BotoEntriesFromJson(acl_json, acl)
687 # a private (no entries) default object ACL.
694 if hasattr(acl, 'entries'):
695 return cls.BotoEntriesToJson(acl.entries)
716 entries = Entries(parent)
717 entries.parent = parent
718 entries.entry_list = [cls.BotoEntryFromJson(entry_json
[all...] |
| /external/llvm/lib/MC/ |
| MCDwarf.cpp | 67 // Add the line entry to this section's entries.
96 // This emits the Dwarf line table for the specified section from the entries
559 // table entries.
716 // and file table entries.
755 const std::vector<MCGenDwarfLabelEntry> &Entries =
757 for (const auto &Entry : Entries) {
[all...] |
| /external/llvm/lib/Target/WebAssembly/ |
| Relooper.cpp | 54 "How many entries to allow in a multiple before we use a switch"),
227 // If a block has multiple entries but no exits, and it is small enough, it
307 // Create a list of entries from a block. If LimitTo is provided, only
309 void GetBlocksOut(Block *Source, BlockSet &Entries,
313 Entries.insert(iter.first);
359 Shape *MakeLoop(BlockSet &Blocks, BlockSet &Entries,
361 // Find the inner blocks in this loop. Proceed backwards from the entries
365 BlockSet Queue = Entries;
393 // A. Branches to the loop entries become a continue to this shape
394 for (const auto &iter : Entries)
[all...] |
| /external/clang/lib/Basic/ |
| SourceManager.cpp | 192 std::vector<LineEntry> &Entries = LineEntries[FID];
194 assert((Entries.empty() || Entries.back().FileOffset < Offset) &&
195 "Adding line entries out of order!");
200 if (!Entries.empty()) {
204 FilenameID = Entries.back().FilenameID;
208 Kind = Entries.back().FileKind;
209 IncludeOffset = Entries.back().IncludeOffset;
212 Entries.push_back(LineEntry::get(Offset, LineNo, FilenameID, Kind,
227 std::vector<LineEntry> &Entries = LineEntries[FID]
[all...] |
