Searched refs:entries (Results 1 - 25 of 38) sorted by relevance

12

/gem5/src/base/filters/
H A Dperfect_bloom_filter.cc49 entries.clear();
56 entries.insert(cast_other->entries.begin(), cast_other->entries.end());
62 entries.insert(addr);
68 entries.erase(addr);
74 return entries.find(addr) != entries.end();
80 return entries.size();
H A Dperfect_bloom_filter.hh60 /** Container storing all set (seen) entries. */
61 std::unordered_set<Addr> entries; member in class:BloomFilter::Perfect
/gem5/src/arch/x86/bios/
H A De820.hh71 std::vector<E820Entry *> entries; member in class:X86ISA::E820Table
75 E820Table(Params *p) : SimObject(p), entries(p->entries)
H A De820.cc59 uint8_t e820Nr = entries.size();
61 // Make sure the number of entries isn't bigger than what the kernel
70 writeVal(entries[i]->addr, proxy, addr);
71 writeVal(entries[i]->size, proxy, addr);
72 writeVal(entries[i]->type, proxy, addr);
H A DE820.py55 entries = VectorParam.X86E820Entry('entries for the e820 table') variable in class:X86E820Table
H A Dacpi.cc67 SysDescTable(p, "RSDT", 1), entries(p->entries)
71 SysDescTable(p, "XSDT", 1), entries(p->entries)
H A DACPI.py61 entries = VectorParam.X86ACPISysDescTable([], 'system description tables') variable in class:X86ACPIRSDT
68 entries = VectorParam.X86ACPISysDescTable([], 'system description tables') variable in class:X86ACPIXSDT
H A Dacpi.hh108 std::vector<SysDescTable *> entries; member in class:X86ISA::ACPI::RSDT
119 std::vector<SysDescTable *> entries; member in class:X86ISA::ACPI::XSDT
/gem5/src/mem/cache/prefetch/
H A Dassociative_set.hh134 * Total number of entries, entries are organized in sets of the provided
143 /** Vector containing the entries of the container */
144 std::vector<Entry> entries; member in class:AssociativeSet
150 * @param num_entries total number of entries of the container, the number
184 * Find the set of entries that could be replaced given
186 * @param addr key to select the set of entries
209 return entries.begin();
219 return entries.end();
228 return entries
[all...]
H A Dassociative_set_impl.hh41 replacementPolicy(rpl_policy), entries(numEntries, init_value)
43 fatal_if(!isPowerOf2(num_entries), "The number of entries of an "
48 Entry* entry = &entries[entry_idx];
83 // Get possible entries to be victimized
100 std::vector<Entry *> entries(selected_entries.size(), nullptr);
104 entries[idx++] = static_cast<Entry *>(entry);
106 return entries;
H A Dsbooe.cc59 entries[index].valid = true;
60 entries[index].line = addr + stride;
61 entries[index].expectedArrivalTick = tick;
65 if (index == entries.size()) {
75 for (const SandboxEntry &entry: sb.entries) {
H A Dsbooe.hh95 /** FIFO queue. Max entries is 'sandboxEntries' */
96 std::vector<SandboxEntry> entries; member in struct:SBOOEPrefetcher::Sandbox
112 entries.resize(max_entries);
H A Dstride.cc112 DPRINTF(HWPrefetch, "Adding context %i with stride entries\n", context);
120 : pcTableSets(sets), _name(name), entries(pcTableSets),
124 entries[set].resize(assoc);
127 entries[set][way].setPosition(set, way);
130 entries[set][way].replacementData =
234 // Get possible entries to be victimized
236 for (auto& entry : entries[set]) {
254 for (auto& entry : entries[set]) {
H A Dstride.hh138 std::vector<std::vector<StrideEntry>> entries; member in class:StridePrefetcher::PCTable
156 * Try to find a table of entries for the given context. If none is
/gem5/src/mem/qos/
H A Dmem_ctrl.cc88 Addr addr, uint64_t entries)
97 " - queue size %d - requested entries %d\n",
100 entries);
103 readQueueSizes[qos] += entries;
104 totalReadQueueSize += entries;
106 writeQueueSizes[qos] += entries;
107 totalWriteQueueSize += entries;
110 packetPriorities[m_id][qos] += entries;
111 for (auto j = 0; j < entries; ++j) {
145 Addr addr, uint64_t entries, doubl
87 logRequest(BusState dir, MasterID m_id, uint8_t qos, Addr addr, uint64_t entries) argument
144 logResponse(BusState dir, MasterID m_id, uint8_t qos, Addr addr, uint64_t entries, double delay) argument
[all...]
H A Dmem_ctrl.hh163 * @param entries number of entries to record
166 Addr addr, uint64_t entries);
176 * @param entries number of entries to record
180 Addr addr, uint64_t entries, double delay);
372 "this master packets %d (entries to move %d)\n",
/gem5/src/mem/ruby/network/
H A DMessageBuffer.py38 buffer_size = Param.Unsigned(0, "Maximum number of entries to buffer \
39 (0 allows infinite entries)")
/gem5/ext/systemc/src/tlm_utils/
H A Dpeq_with_cb_and_phase.h164 entries.resize(100);
168 if (size==entries.size()){
169 entries.resize(entries.size()*2);
171 entries[size++]=p;
175 return entries[out++];
189 std::vector<PAYLOAD> entries; member in class:tlm_utils::peq_with_cb_and_phase::delta_list
/gem5/src/systemc/ext/tlm_utils/
H A Dpeq_with_cb_and_phase.h148 entries.resize(100);
154 if (size==entries.size()) {
155 entries.resize(entries.size() * 2);
157 entries[size++] = p;
160 inline PAYLOAD &get() { return entries[out++]; }
173 std::vector<PAYLOAD> entries; member in class:tlm_utils::peq_with_cb_and_phase::delta_list
/gem5/src/mem/cache/
H A Dqueue.hh80 * The total number of entries in this queue. This number is set
81 * as the number of entries requested plus any reserve. This
82 * allows for the same number of effective entries while still
88 * The number of entries to hold as a temporary overflow
90 * of entries as we only check the full condition under certain
96 std::vector<Entry> entries; member in class:Queue
97 /** Holds pointers to all allocated entries. */
99 /** Holds pointers to entries that haven't been sent downstream. */
101 /** Holds non allocated entries. */
119 /** The number of entries tha
[all...]
/gem5/src/mem/cache/tags/
H A Dbase_set_assoc.hh172 // Get possible entries to be victimized
173 const std::vector<ReplaceableEntry*> entries = variable
178 entries));
H A Dbase.cc83 // Find possible entries that may contain the given address
84 const std::vector<ReplaceableEntry*> entries = local
88 for (const auto& location : entries) {
/gem5/src/mem/cache/tags/indexing_policies/
H A Dskewed_associative.cc211 std::vector<ReplaceableEntry*> entries; local
216 entries.push_back(sets[extractSet(addr, way)][way]);
219 return entries;
/gem5/src/mem/cache/compressors/
H A Dcpack.cc63 // Reset number of valid entries
66 // Set all entries as 0
141 comp_data->entries.push_back(std::move(first_pattern));
142 comp_data->entries.push_back(std::move(second_pattern));
189 for (const auto& entry : cpack_comp_data->entries) {
213 .desc("Number of data entries that were compressed to this pattern.")
218 patternStats.subdesc(i, "Number of data entries that match pattern " +
/gem5/ext/pybind11/tests/
H A Dtest_kwargs_and_defaults.cpp25 m.def("kw_func4", [](const std::vector<int> &entries) {
27 for (int i : entries)

Completed in 28 milliseconds

12