stride.cc revision 5338
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 * Steve Reinhardt 30 */ 31 32/** 33 * @file 34 * Stride Prefetcher template instantiations. 35 */ 36 37#include "mem/cache/prefetch/stride.hh" 38 39void 40StridePrefetcher::calculatePrefetch(PacketPtr &pkt, std::list<Addr> &addresses, 41 std::list<Tick> &delays) 42{ 43// Addr blkAddr = pkt->paddr & ~(Addr)(this->blkSize-1); 44 int cpuID = pkt->req->getCpuNum(); 45 if (!useCPUId) cpuID = 0; 46 47 /* Scan Table for IAddr Match */ 48/* std::list<strideEntry*>::iterator iter; 49 for (iter=table[cpuID].begin(); 50 iter !=table[cpuID].end(); 51 iter++) { 52 if ((*iter)->IAddr == pkt->pc) break; 53 } 54 55 if (iter != table[cpuID].end()) { 56 //Hit in table 57 58 int newStride = blkAddr - (*iter)->MAddr; 59 if (newStride == (*iter)->stride) { 60 (*iter)->confidence++; 61 } 62 else { 63 (*iter)->stride = newStride; 64 (*iter)->confidence--; 65 } 66 67 (*iter)->MAddr = blkAddr; 68 69 for (int d=1; d <= degree; d++) { 70 Addr newAddr = blkAddr + d * newStride; 71 if (this->pageStop && 72 (blkAddr & ~(TheISA::VMPageSize - 1)) != 73 (newAddr & ~(TheISA::VMPageSize - 1))) 74 { 75 //Spanned the page, so now stop 76 this->pfSpanPage += degree - d + 1; 77 return; 78 } 79 else 80 { 81 addresses.push_back(newAddr); 82 delays.push_back(latency); 83 } 84 } 85 } 86 else { 87 //Miss in table 88 //Find lowest confidence and replace 89 90 } 91*/ 92} 93