Lines Matching refs:Entries
50 std::vector<std::unique_ptr<Entry>> Entries; member
78 std::vector<Record *> Entries; member
300 for (const auto &Entry : Enum.Entries) in emitGenericEnum()
323 IndexRows = Table.Entries; in emitLookupFunction()
336 std::vector<std::pair<Record *, unsigned>> Entries; in emitLookupFunction() local
337 Entries.reserve(Table.Entries.size()); in emitLookupFunction()
338 for (unsigned i = 0; i < Table.Entries.size(); ++i) in emitLookupFunction()
339 Entries.emplace_back(Table.Entries[i], i); in emitLookupFunction()
341 llvm::stable_sort(Entries, [&](const std::pair<Record *, unsigned> &LHS, in emitLookupFunction()
346 IndexRowsStorage.reserve(Entries.size()); in emitLookupFunction()
347 for (const auto &Entry : Entries) { in emitLookupFunction()
504 for (unsigned i = 0; i < Table.Entries.size(); ++i) { in emitGenericTable()
505 Record *Entry = Table.Entries[i]; in emitGenericTable()
590 Enum.Entries.push_back(std::make_unique<GenericEnum::Entry>(Name, Value)); in collectEnumEntries()
591 Enum.EntryMap.insert(std::make_pair(EntryRec, Enum.Entries.back().get())); in collectEnumEntries()
595 llvm::stable_sort(Enum.Entries, in collectEnumEntries()
601 for (size_t i = 0; i < Enum.Entries.size(); ++i) in collectEnumEntries()
602 Enum.Entries[i]->second = i; in collectEnumEntries()
635 Table.Entries.push_back(EntryRec); // Add record to table's record list. in collectTableEntries()
724 llvm::stable_sort(Table->Entries, [&](Record *LHS, Record *RHS) { in run()