/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/lib/CodeGen/AsmPrinter/ |
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 | 43 // Get all of the string pool entries and put them in an array by their ID so 46 Entries(Pool.size()); 49 Entries[E.getValue().second] = &E; 51 for (const auto &Entry : Entries) { 52 // Emit a label for reference from debug information entries. 65 for (const auto &Entry : Entries) {
|
DwarfAccelTable.cpp | 31 Entries(Allocator) {} 38 DataArray &DIEs = Entries[Name]; 73 Data.reserve(Entries.size()); 74 for (StringMap<DataArray>::iterator EI = Entries.begin(), EE = Entries.end(); 77 // Unique the entries. 267 O << "Entries: \n"; 268 for (StringMap<DataArray>::const_iterator EI = Entries.begin(), 269 EE = Entries.end();
|
/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)); 46 bool ConstantPool::empty() { return Entries.empty(); }
|
/external/llvm/tools/dsymutil/ |
DebugMap.cpp | 40 std::vector<Entry> Entries; 41 Entries.reserve(Symbols.getNumItems()); 43 Entries.push_back(std::make_pair(Sym.getKey(), Sym.getValue())); 45 Entries.begin(), Entries.end(), 47 for (const auto &Sym : Entries) {
|
/external/llvm/include/llvm/MC/ |
ConstantPools.h | 40 EntryVecTy 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/llvm/lib/Support/ |
YAMLTraits.cpp | 173 return SQ->Entries.size(); 194 CurrentNode = SQ->Entries[Index].get(); 211 CurrentNode = SQ->Entries[index].get(); 256 BitValuesUsed.insert(BitValuesUsed.begin(), SQ->Entries.size(), false); 269 for (auto &N : SQ->Entries) { 290 assert(BitValuesUsed.size() == SQ->Entries.size()); 291 for (unsigned i = 0; i < SQ->Entries.size(); ++i) { 293 setError(SQ->Entries[i].get(), "unknown bit value"); 336 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/pdfium/core/src/fxcodec/lcms2/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/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>> {
|
/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...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.jdt.debug_3.6.1.v20100715_r361/ |
plugin.properties | 17 descriptionMap=Map Entries
|
/external/chromium-trace/trace-viewer/tracing/build/ |
check_common.py | 76 error = 'Entries in ' + file_name + ' do not match files on disk:\n'
|