tagged.cc revision 10623:b9646f4546ad
1/* 2 * Copyright (c) 2005 The Regents of The University of Michigan 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer; 9 * redistributions in binary form must reproduce the above copyright 10 * notice, this list of conditions and the following disclaimer in the 11 * documentation and/or other materials provided with the distribution; 12 * neither the name of the copyright holders nor the names of its 13 * contributors may be used to endorse or promote products derived from 14 * this software without specific prior written permission. 15 * 16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 27 * 28 * Authors: Ron Dreslinski 29 */ 30 31/** 32 * @file 33 * Describes a tagged prefetcher based on template policies. 34 */ 35 36#include "mem/cache/prefetch/tagged.hh" 37 38TaggedPrefetcher::TaggedPrefetcher(const TaggedPrefetcherParams *p) 39 : QueuedPrefetcher(p), degree(p->degree) 40{ 41 42} 43 44void 45TaggedPrefetcher::calculatePrefetch(const PacketPtr &pkt, 46 std::vector<Addr> &addresses) 47{ 48 Addr blkAddr = pkt->getAddr() & ~(Addr)(blkSize-1); 49 50 for (int d = 1; d <= degree; d++) { 51 Addr newAddr = blkAddr + d*(blkSize); 52 if (!samePage(blkAddr, newAddr)) { 53 // Count number of unissued prefetches due to page crossing 54 pfSpanPage += degree - d + 1; 55 return; 56 } else { 57 addresses.push_back(newAddr); 58 } 59 } 60} 61 62TaggedPrefetcher* 63TaggedPrefetcherParams::create() 64{ 65 return new TaggedPrefetcher(this); 66} 67