Queued prefetcher entries now count with a priority field. The idea is to add packets ordered by priority and then by age. For the existing algorithms in which priority doesn't make sense, it is set to 0 for all deferred packets in the queue.
67 lines
2.4 KiB
C++
67 lines
2.4 KiB
C++
/*
|
|
* Copyright (c) 2005 The Regents of The University of Michigan
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are
|
|
* met: redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer;
|
|
* redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution;
|
|
* neither the name of the copyright holders nor the names of its
|
|
* contributors may be used to endorse or promote products derived from
|
|
* this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
* Authors: Ron Dreslinski
|
|
*/
|
|
|
|
/**
|
|
* @file
|
|
* Describes a tagged prefetcher based on template policies.
|
|
*/
|
|
|
|
#include "mem/cache/prefetch/tagged.hh"
|
|
|
|
TaggedPrefetcher::TaggedPrefetcher(const TaggedPrefetcherParams *p)
|
|
: QueuedPrefetcher(p), degree(p->degree)
|
|
{
|
|
|
|
}
|
|
|
|
void
|
|
TaggedPrefetcher::calculatePrefetch(const PacketPtr &pkt,
|
|
std::vector<AddrPriority> &addresses)
|
|
{
|
|
Addr blkAddr = pkt->getAddr() & ~(Addr)(blkSize-1);
|
|
|
|
for (int d = 1; d <= degree; d++) {
|
|
Addr newAddr = blkAddr + d*(blkSize);
|
|
if (!samePage(blkAddr, newAddr)) {
|
|
// Count number of unissued prefetches due to page crossing
|
|
pfSpanPage += degree - d + 1;
|
|
return;
|
|
} else {
|
|
addresses.push_back(AddrPriority(newAddr,0));
|
|
}
|
|
}
|
|
}
|
|
|
|
TaggedPrefetcher*
|
|
TaggedPrefetcherParams::create()
|
|
{
|
|
return new TaggedPrefetcher(this);
|
|
}
|