| /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)
|
| /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...] |
| /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/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 | 22 for (const Entry &E : L.Entries) {
23 if (&E != L.Entries.begin())
71 Loc.Entries.push_back(std::move(E));
106 Loc.Entries.push_back(std::move(E));
115 for (const Entry &E : L.Entries) {
116 if (&E != L.Entries.begin())
|
| /external/llvm/lib/MC/ |
| ConstantPools.cpp | 25 if (Entries.empty())
28 for (EntryVecTy::const_iterator I = Entries.begin(), E = Entries.end();
35 Entries.clear();
42 Entries.push_back(ConstantPoolEntry(CPEntryLabel, Value, Size, Loc));
46 bool ConstantPool::empty() { return Entries.empty(); }
|
| /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/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/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/llvm/lib/Support/ |
| YAMLTraits.cpp | 182 return SQ->Entries.size();
203 CurrentNode = SQ->Entries[Index].get();
220 CurrentNode = SQ->Entries[index].get();
265 BitValuesUsed.insert(BitValuesUsed.begin(), SQ->Entries.size(), false);
278 for (auto &N : SQ->Entries) {
299 assert(BitValuesUsed.size() == SQ->Entries.size());
300 for (unsigned i = 0; i < SQ->Entries.size(); ++i) {
302 setError(SQ->Entries[i].get(), "unknown bit value");
347 SQHNode->Entries.push_back(std::move(Entry));
|
| SpecialCaseList.cpp | 47 SpecialCaseList::SpecialCaseList() : Entries(), Regexps(), IsCompiled(false) {}
112 Entries[Prefix][Category].Strings.insert(Regexp);
148 Entries[I->getKey()][II->getKey()].RegEx.reset(new Regex(II->getValue()));
160 StringMap<StringMap<Entry> >::const_iterator I = Entries.find(Section);
161 if (I == Entries.end()) return false;
|
| /external/libgdx/gdx/src/com/badlogic/gdx/utils/ |
| OrderedMap.java | 22 import com.badlogic.gdx.utils.ObjectMap.Entries;
25 * put and remove. Iteration over the {@link #entries()}, {@link #keys()}, and {@link #values()} is ordered and faster than an
31 private Entries entries1, entries2;
78 public Entries<K, V> iterator () {
79 return entries();
82 /** Returns an iterator for the entries in the map. Remove is supported. Note that the same iterator instance is returned each
84 public Entries<K, V> entries () {
method in class:OrderedMap
155 static public class OrderedMapEntries<K, V> extends Entries<K, V> {
|
| /external/pdfium/third_party/lcms2-2.6/src/ |
| cmsnamed.c | 47 mlu ->Entries = (_cmsMLUentry*) _cmsCalloc(ContextID, nItems, sizeof(_cmsMLUentry));
48 if (mlu ->Entries == NULL) {
107 NewPtr = (_cmsMLUentry*)_cmsRealloc(mlu ->ContextID, mlu ->Entries, AllocatedEntries*sizeof(_cmsMLUentry));
110 mlu ->Entries = NewPtr;
129 if (mlu ->Entries[i].Country == CountryCode &&
130 mlu ->Entries[i].Language == LanguageCode) return i;
172 mlu ->Entries[mlu ->UsedEntries].StrW = Offset;
173 mlu ->Entries[mlu ->UsedEntries].Len = size;
174 mlu ->Entries[mlu ->UsedEntries].Country = CountryCode;
175 mlu ->Entries[mlu ->UsedEntries].Language = LanguageCode
[all...] |
| /external/clang/lib/Frontend/ |
| LogDiagnosticPrinter.cpp | 84 if (Entries.empty())
104 for (auto &DE : Entries)
163 Entries.push_back(DE);
|
| /external/llvm/test/tools/llvm-readobj/ARM/ |
| unwind.s | 151 @ CHECK: Entries [
167 @ CHECK: Entries [
183 @ CHECK: Entries [
203 @ CHECK: Entries [
216 @ CHECK: Entries [
231 @ CHECK: Entries [
265 @ CHECK: Entries [
293 @ CHECK: Entries [
|
| /external/chromium-trace/catapult/tracing/tracing_build/ |
| check_common.py | 71 error = 'Entries in ' + file_name + ' do not match files on disk:\n'
|
| /external/clang/include/clang/Frontend/ |
| LogDiagnosticPrinter.h | 60 SmallVector<DiagEntry, 8> Entries;
|
| /external/guava/guava/src/com/google/common/collect/ |
| 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...] |
| FilteredKeySetMultimap.java | 61 public Set<Entry<K, V>> entries() { method in class:FilteredKeySetMultimap
62 return (Set<Entry<K, V>>) super.entries();
70 class EntrySet extends Entries implements Set<Entry<K, V>> {
|
