| /external/llvm/lib/CodeGen/AsmPrinter/ |
| D | DebugLocStream.h | 54 SmallVector<Entry, 32> Entries; variable
80 Lists.emplace_back(CU, Entries.size()); in startList()
97 Entries.emplace_back(BeginSym, EndSym, DWARFBytes.size(), Comments.size()); in startEntry()
110 return makeArrayRef(Entries) in getEntries()
117 .slice(Entries[EI].ByteOffset, getNumBytes(EI)); in getBytes()
122 .slice(Entries[EI].CommentOffset, getNumComments(EI)); in getComments()
132 assert(&Entries.front() <= &E && &E <= &Entries.back() && in getIndex()
134 return &E - &Entries.front(); in getIndex()
138 return Entries.size() - Lists[LI].EntryOffset; in getNumEntries()
142 if (EI + 1 == Entries.size()) in getNumBytes()
[all …]
|
| D | DebugLocStream.cpp | 17 if (Lists.back().EntryOffset == Entries.size()) { in finalizeList()
29 if (Entries.back().ByteOffset != DWARFBytes.size()) in finalizeEntry()
33 Comments.erase(Comments.begin() + Entries.back().CommentOffset, in finalizeEntry()
35 Entries.pop_back(); in finalizeEntry()
37 assert(Lists.back().EntryOffset <= Entries.size() && in finalizeEntry()
|
| D | DwarfStringPool.cpp | 47 SmallVector<const StringMapEntry<EntryTy> *, 64> Entries(Pool.size()); in emit() local
50 Entries[E.getValue().Index] = &E; in emit()
52 for (const auto &Entry : Entries) { in emit()
71 for (const auto &Entry : Entries) in emit()
|
| D | AddressPool.cpp | 35 SmallVector<const MCExpr *, 64> Entries(Pool.size()); in emit() local
38 Entries[I.second.Number] = in emit()
43 for (const MCExpr *Entry : Entries) in emit()
|
| D | DwarfAccelTable.cpp | 31 Entries(Allocator) {} in DwarfAccelTable()
38 DataArray &DIEs = Entries[Name.getString()]; in AddName()
73 Data.reserve(Entries.size()); in FinalizeTable()
74 for (StringMap<DataArray>::iterator EI = Entries.begin(), EE = Entries.end(); in FinalizeTable()
268 for (StringMap<DataArray>::const_iterator EI = Entries.begin(), in print()
269 EE = Entries.end(); in print()
|
| /external/llvm/utils/TableGen/ |
| D | SequenceToOffsetTable.h | 57 unsigned Entries; variable
65 SequenceToOffsetTable() : Entries(0) {} in SequenceToOffsetTable()
70 assert(Entries == 0 && "Cannot call add() after layout()"); in add()
88 assert(Entries && "Call layout() before size()"); in size()
89 return Entries; in size()
94 assert(Entries == 0 && "Can only call layout() once"); in layout()
98 I->second = Entries; in layout()
100 Entries += I->first.size() + 1; in layout()
106 assert(Entries && "Call layout() before get()"); in get()
118 assert(Entries && "Call layout() before emit()");
|
| /external/llvm/lib/MC/ |
| D | ConstantPools.cpp | 25 if (Entries.empty()) in emitEntries()
28 for (EntryVecTy::const_iterator I = Entries.begin(), E = Entries.end(); in emitEntries()
35 Entries.clear(); in emitEntries()
42 Entries.push_back(ConstantPoolEntry(CPEntryLabel, Value, Size, Loc)); in addEntry()
46 bool ConstantPool::empty() { return Entries.empty(); } in empty()
|
| /external/llvm/lib/Target/WebAssembly/ |
| D | Relooper.cpp | 309 void GetBlocksOut(Block *Source, BlockSet &Entries, in Calculate()
313 Entries.insert(iter.first); in Calculate()
359 Shape *MakeLoop(BlockSet &Blocks, BlockSet &Entries, in Calculate()
365 BlockSet Queue = Entries; in Calculate()
394 for (const auto &iter : Entries) in Calculate()
401 Shape *Inner = Process(InnerBlocks, Entries, nullptr); in Calculate()
411 void FindIndependentGroups(BlockSet &Entries, in Calculate()
463 for (const auto &Entry : Entries) { in Calculate()
506 for (const auto &iter : Entries) { in Calculate()
527 for (const auto &iter : Entries) in Calculate()
[all …]
|
| /external/llvm/tools/dsymutil/ |
| D | DebugMap.cpp | 42 std::vector<Entry> Entries; in print() local
43 Entries.reserve(Symbols.getNumItems()); in print()
45 Entries.push_back(std::make_pair(Sym.getKey(), Sym.getValue())); in print()
47 Entries.begin(), Entries.end(), in print()
49 for (const auto &Sym : Entries) { in print()
133 std::vector<dsymutil::DebugMapObject::YAMLSymbolMapping> Entries; member
149 io.mapRequired("symbols", Norm->Entries); in mapping()
203 Entries.reserve(Obj.Symbols.size()); in YamlDMO()
205 Entries.push_back(std::make_pair(Entry.getKey(), Entry.getValue())); in YamlDMO()
238 for (auto &Entry : Entries) { in denormalize()
|
| /external/llvm/lib/DebugInfo/DWARF/ |
| D | DWARFDebugRangeList.cpp | 19 Entries.clear(); in clear()
42 Entries.push_back(entry); in extract()
48 for (const RangeListEntry &RLE : Entries) { in dump()
60 for (const RangeListEntry &RLE : Entries) { in getAbsoluteRanges()
|
| D | DWARFDebugLoc.cpp | 22 for (const Entry &E : L.Entries) { in dump()
23 if (&E != L.Entries.begin()) in dump()
71 Loc.Entries.push_back(std::move(E)); in parse()
106 Loc.Entries.push_back(std::move(E)); in parse()
115 for (const Entry &E : L.Entries) { in dump()
116 if (&E != L.Entries.begin()) in dump()
|
| /external/llvm/lib/CodeGen/ |
| D | InterferenceCache.cpp | 53 Entries[i].clear(mf, indexes, lis); in init()
58 if (E < CacheEntries && Entries[E].getPhysReg() == PhysReg) { in get()
59 if (!Entries[E].valid(LIUArray, TRI)) in get()
60 Entries[E].revalidate(LIUArray, TRI); in get()
61 return &Entries[E]; in get()
69 if (Entries[E].hasRefs()) { in get()
74 Entries[E].reset(PhysReg, LIUArray, TRI, MF); in get()
76 return &Entries[E]; in get()
|
| /external/pdfium/third_party/lcms2-2.6/src/ |
| D | cmsnamed.c | 47 mlu ->Entries = (_cmsMLUentry*) _cmsCalloc(ContextID, nItems, sizeof(_cmsMLUentry)); in cmsMLUalloc()
48 if (mlu ->Entries == NULL) { in cmsMLUalloc()
107 …NewPtr = (_cmsMLUentry*)_cmsRealloc(mlu ->ContextID, mlu ->Entries, AllocatedEntries*sizeof(_cmsML… in GrowMLUtable()
110 mlu ->Entries = NewPtr; in GrowMLUtable()
129 if (mlu ->Entries[i].Country == CountryCode && in SearchMLUEntry()
130 mlu ->Entries[i].Language == LanguageCode) return i; in SearchMLUEntry()
172 mlu ->Entries[mlu ->UsedEntries].StrW = Offset; in AddMLUBlock()
173 mlu ->Entries[mlu ->UsedEntries].Len = size; in AddMLUBlock()
174 mlu ->Entries[mlu ->UsedEntries].Country = CountryCode; in AddMLUBlock()
175 mlu ->Entries[mlu ->UsedEntries].Language = LanguageCode; in AddMLUBlock()
[all …]
|
| /external/llvm/test/CodeGen/X86/ |
| D | stackmap-liveness.ll | 34 ; Num LiveOut Entries: 0
45 ; Num LiveOut Entries: 1
65 ; Num LiveOut Entries: 0
76 ; Num LiveOut Entries: 5
109 ; Num LiveOut Entries: 0
120 ; Num LiveOut Entries: 2
146 ; Num LiveOut Entries: 0
157 ; Num LiveOut Entries: 2
|
| /external/llvm/test/tools/llvm-readobj/ARM/ |
| D | 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/llvm/lib/Support/ |
| D | SpecialCaseList.cpp | 47 SpecialCaseList::SpecialCaseList() : Entries(), Regexps(), IsCompiled(false) {} in SpecialCaseList()
112 Entries[Prefix][Category].Strings.insert(Regexp); in parse()
148 Entries[I->getKey()][II->getKey()].RegEx.reset(new Regex(II->getValue())); in compile()
160 StringMap<StringMap<Entry> >::const_iterator I = Entries.find(Section); in inSection()
161 if (I == Entries.end()) return false; in inSection()
|
| D | YAMLTraits.cpp | 182 return SQ->Entries.size(); in beginSequence()
203 CurrentNode = SQ->Entries[Index].get(); in preflightElement()
220 CurrentNode = SQ->Entries[index].get(); in preflightFlowElement()
265 BitValuesUsed.insert(BitValuesUsed.begin(), SQ->Entries.size(), false); in beginBitSetScalar()
278 for (auto &N : SQ->Entries) { in bitSetMatch()
299 assert(BitValuesUsed.size() == SQ->Entries.size()); in endBitSetScalar()
300 for (unsigned i = 0; i < SQ->Entries.size(); ++i) { in endBitSetScalar()
302 setError(SQ->Entries[i].get(), "unknown bit value"); in endBitSetScalar()
347 SQHNode->Entries.push_back(std::move(Entry)); in createHNodes()
|
| /external/libgdx/gdx/src/com/badlogic/gdx/utils/ |
| D | OrderedMap.java | 22 import com.badlogic.gdx.utils.ObjectMap.Entries;
31 private Entries entries1, entries2;
78 public Entries<K, V> iterator () { in iterator()
84 public Entries<K, V> entries () { in entries()
155 static public class OrderedMapEntries<K, V> extends Entries<K, V> {
|
| D | ObjectIntMap.java | 47 private Entries entries1, entries2;
555 public Entries<K> iterator () { in iterator()
561 public Entries<K> entries () { in entries()
563 entries1 = new Entries(this); in entries()
564 entries2 = new Entries(this); in entries()
668 …static public class Entries<K> extends MapIterator<K> implements Iterable<Entry<K>>, Iterator<Entr… class in ObjectIntMap
671 public Entries (ObjectIntMap<K> map) { in Entries() method in ObjectIntMap.Entries
692 public Entries<K> iterator () { in iterator()
|
| D | ObjectFloatMap.java | 47 private Entries entries1, entries2;
554 public Entries<K> iterator () { in iterator()
560 public Entries<K> entries () { in entries()
562 entries1 = new Entries(this); in entries()
563 entries2 = new Entries(this); in entries()
667 …static public class Entries<K> extends MapIterator<K> implements Iterable<Entry<K>>, Iterator<Entr… class in ObjectFloatMap
670 public Entries (ObjectFloatMap<K> map) { in Entries() method in ObjectFloatMap.Entries
691 public Entries<K> iterator () { in iterator()
|
| /external/clang/lib/Basic/ |
| D | SourceManager.cpp | 192 std::vector<LineEntry> &Entries = LineEntries[FID]; in AddLineNote() local
194 assert((Entries.empty() || Entries.back().FileOffset < Offset) && in AddLineNote()
200 if (!Entries.empty()) { in AddLineNote()
204 FilenameID = Entries.back().FilenameID; in AddLineNote()
208 Kind = Entries.back().FileKind; in AddLineNote()
209 IncludeOffset = Entries.back().IncludeOffset; in AddLineNote()
212 Entries.push_back(LineEntry::get(Offset, LineNo, FilenameID, Kind, in AddLineNote()
227 std::vector<LineEntry> &Entries = LineEntries[FID]; in AddLineNote() local
229 assert((Entries.empty() || Entries.back().FileOffset < Offset) && in AddLineNote()
234 IncludeOffset = Entries.empty() ? 0 : Entries.back().IncludeOffset; in AddLineNote()
[all …]
|
| /external/llvm/include/llvm/DebugInfo/DWARF/ |
| D | DWARFDebugRangeList.h | 62 std::vector<RangeListEntry> Entries; variable
69 const std::vector<RangeListEntry> &getEntries() { return Entries; } in getEntries()
|
| D | DWARFDebugLoc.h | 38 SmallVector<Entry, 2> Entries; member
68 SmallVector<Entry, 2> Entries; member
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | AbstractMultimap.java | 115 return new Entries(); in createEntries()
119 private class Entries extends Multimaps.Entries<K, V> { class in AbstractMultimap
131 private class EntrySet extends Entries implements Set<Entry<K, V>> {
|
| /external/clang/lib/Frontend/ |
| D | LogDiagnosticPrinter.cpp | 84 if (Entries.empty()) in EndSourceFile()
104 for (auto &DE : Entries) in EndSourceFile()
163 Entries.push_back(DE); in HandleDiagnostic()
|