/gem5/src/mem/cache/prefetch/ |
H A D | slim_ampm.cc | 42 std::vector<AddrPriority> &addresses) 44 dcpt.calculatePrefetch(pfi, addresses); 45 if (addresses.empty()) { 46 ampm.calculatePrefetch(pfi, addresses); 41 calculatePrefetch(const PrefetchInfo &pfi, std::vector<AddrPriority> &addresses) argument
|
H A D | tagged.hh | 55 std::vector<AddrPriority> &addresses) override;
|
H A D | tagged.cc | 48 std::vector<AddrPriority> &addresses) 54 addresses.push_back(AddrPriority(newAddr,0)); 47 calculatePrefetch(const PrefetchInfo &pfi, std::vector<AddrPriority> &addresses) argument
|
H A D | slim_ampm.hh | 62 std::vector<AddrPriority> &addresses) override;
|
H A D | delta_correlating_prediction_tables.hh | 116 * @param addresses prefetch candidates generated 119 std::vector<QueuedPrefetcher::AddrPriority> &addresses); 135 std::vector<AddrPriority> &addresses) override;
|
H A D | delta_correlating_prediction_tables.cc | 128 std::vector<QueuedPrefetcher::AddrPriority> &addresses) 142 entry->getCandidates(addresses, deltaMaskBits); 165 std::vector<AddrPriority> &addresses) 167 dcpt.calculatePrefetch(pfi, addresses); 126 calculatePrefetch( const BasePrefetcher::PrefetchInfo &pfi, std::vector<QueuedPrefetcher::AddrPriority> &addresses) argument 164 calculatePrefetch(const PrefetchInfo &pfi, std::vector<AddrPriority> &addresses) argument
|
H A D | access_map_pattern_matching.cc | 156 std::vector<QueuedPrefetcher::AddrPriority> &addresses) 158 assert(addresses.empty()); 223 addresses.push_back(QueuedPrefetcher::AddrPriority(pf_addr, 0)); 224 if (addresses.size() == degree) { 247 addresses.push_back(QueuedPrefetcher::AddrPriority(pf_addr, 0)); 248 if (addresses.size() == degree) { 268 std::vector<AddrPriority> &addresses) 270 ampm.calculatePrefetch(pfi, addresses); 154 calculatePrefetch( const BasePrefetcher::PrefetchInfo &pfi, std::vector<QueuedPrefetcher::AddrPriority> &addresses) argument 267 calculatePrefetch(const PrefetchInfo &pfi, std::vector<AddrPriority> &addresses) argument
|
H A D | pif.hh | 53 /** Number of preceding and subsequent spatial addresses to compact */ 62 * The compactor tracks retired instructions addresses, leveraging the 67 * the spatial compactor combines instruction-block addresses that fall 103 * Fills the provided vector with the predicted addresses using the 106 * @param addresses reference to a vector to add the generated 107 * addresses 110 std::vector<AddrPriority> &addresses) const; 181 std::vector<AddrPriority> &addresses);
|
H A D | signature_path.cc | 96 bool is_secure, std::vector<AddrPriority> &addresses) 131 addresses.push_back(AddrPriority(new_addr, 0)); 227 std::vector<AddrPriority> &addresses) 290 is_secure, addresses); 306 auxiliaryPrefetcher(ppn, current_block, is_secure, addresses); 311 bool is_secure, std::vector<AddrPriority> &addresses) 313 if (addresses.empty()) { 316 is_secure, addresses); 94 addPrefetch(Addr ppn, stride_t last_block, stride_t delta, double path_confidence, signature_t signature, bool is_secure, std::vector<AddrPriority> &addresses) argument 226 calculatePrefetch(const PrefetchInfo &pfi, std::vector<AddrPriority> &addresses) argument 310 auxiliaryPrefetcher(Addr ppn, stride_t current_block, bool is_secure, std::vector<AddrPriority> &addresses) argument
|
H A D | signature_path.hh | 169 * @param addresses addresses to prefetch will be added to this vector 174 std::vector<AddrPriority> &addresses); 254 * @param addresses the addresses to be prefetched are added to this vector 255 * @param updated_filter_entries set of addresses containing these that 259 bool is_secure, std::vector<AddrPriority> &addresses); 281 std::vector<AddrPriority> &addresses) override;
|
H A D | signature_path_v2.hh | 85 std::vector<AddrPriority> &addresses) override
|
H A D | irregular_stream_buffer.hh | 79 * Maps a set of contiguous addresses to another set of (not necessarily 80 * contiguos) addresses, with their corresponding confidence counters 101 * Counter of allocated structural addresses, increased by "chunkSize", 129 std::vector<AddrPriority> &addresses) override;
|
H A D | access_map_pattern_matching.hh | 185 std::vector<QueuedPrefetcher::AddrPriority> &addresses); 198 std::vector<AddrPriority> &addresses) override;
|
H A D | spatio_temporal_memory_streaming.hh | 184 * addresses, adding them to the addresses vector 186 * @param addresses vector to add the addresses to be prefetched 189 std::vector<AddrPriority> &addresses); 194 std::vector<AddrPriority> &addresses) override;
|
H A D | pif.cc | 108 std::vector<AddrPriority> &addresses) const 110 // Calculate the addresses of the instruction blocks that are encoded 111 // by the bit vector and issue prefetch requests for these addresses. 120 addresses.push_back(AddrPriority(prec_addr, 0)); 127 addresses.push_back(AddrPriority(succ_addr, 0)); 201 std::vector<AddrPriority> &addresses) 216 sabEntry->getPredictedAddresses(lBlkSize, addresses); 239 entry->getPredictedAddresses(lBlkSize, addresses); 200 calculatePrefetch(const PrefetchInfo &pfi, std::vector<AddrPriority> &addresses) argument
|
H A D | sbooe.cc | 125 std::vector<AddrPriority> &addresses) 140 addresses.push_back(AddrPriority(pref_line << lBlkSize, 0)); 124 calculatePrefetch(const PrefetchInfo &pfi, std::vector<AddrPriority> &addresses) argument
|
H A D | bop.hh | 154 std::vector<AddrPriority> &addresses) override;
|
H A D | sbooe.hh | 61 * Holds the current demand addresses and tick. This is later used to 155 std::vector<AddrPriority> &addresses) override;
|
H A D | stride.hh | 176 std::vector<AddrPriority> &addresses) override;
|
H A D | indirect_memory.hh | 193 std::vector<AddrPriority> &addresses) override;
|
H A D | spatio_temporal_memory_streaming.cc | 119 std::vector<AddrPriority> &addresses) 179 reconstructSequence(idx, addresses); 188 std::vector<AddrPriority> &addresses) 248 addresses.push_back(AddrPriority(pf_addr, 0)); 118 calculatePrefetch(const PrefetchInfo &pfi, std::vector<AddrPriority> &addresses) argument 187 reconstructSequence(unsigned int rmob_idx, std::vector<AddrPriority> &addresses) argument
|
H A D | bop.cc | 226 std::vector<AddrPriority> &addresses) 245 addresses.push_back(AddrPriority(prefetch_addr, 0)); 225 calculatePrefetch(const PrefetchInfo &pfi, std::vector<AddrPriority> &addresses) argument
|
H A D | indirect_memory.cc | 62 std::vector<AddrPriority> &addresses) 97 addresses.push_back(AddrPriority(addr + delta * i, 0)); 152 addresses.push_back(AddrPriority(pf_addr, 0)); 221 // Second index is filled, compare the addresses generated during 61 calculatePrefetch(const PrefetchInfo &pfi, std::vector<AddrPriority> &addresses) argument
|
H A D | queued.cc | 120 * The throttleControlPct controls how many of the candidate addresses 163 std::vector<AddrPriority> addresses; local 164 calculatePrefetch(pfi, addresses); 167 size_t max_pfs = getMaxPermittedPrefetches(addresses.size()); 171 for (AddrPriority& addr_prio : addresses) { 387 // if we trained with virtual addresses,
|
H A D | queued.hh | 187 std::vector<AddrPriority> &addresses) = 0;
|