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 "arch/isa_traits.hh"
| 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 "arch/isa_traits.hh"
|
38 39TaggedPrefetcher::TaggedPrefetcher(const BaseCacheParams *p) 40 : BasePrefetcher(p), 41 latency(p->prefetch_latency), degree(p->prefetch_degree) 42{ 43} 44 45void 46TaggedPrefetcher:: 47calculatePrefetch(PacketPtr &pkt, std::list<Addr> &addresses, 48 std::list<Tick> &delays) 49{ 50 Addr blkAddr = pkt->getAddr() & ~(Addr)(this->blkSize-1); 51 52 for (int d=1; d <= degree; d++) { 53 Addr newAddr = blkAddr + d*(this->blkSize); 54 if (this->pageStop && 55 (blkAddr & ~(TheISA::VMPageSize - 1)) != 56 (newAddr & ~(TheISA::VMPageSize - 1))) 57 { 58 //Spanned the page, so now stop 59 this->pfSpanPage += degree - d + 1; 60 return; 61 } 62 else 63 { 64 addresses.push_back(newAddr); 65 delays.push_back(latency); 66 } 67 } 68} 69 70
| 38 39TaggedPrefetcher::TaggedPrefetcher(const BaseCacheParams *p) 40 : BasePrefetcher(p), 41 latency(p->prefetch_latency), degree(p->prefetch_degree) 42{ 43} 44 45void 46TaggedPrefetcher:: 47calculatePrefetch(PacketPtr &pkt, std::list<Addr> &addresses, 48 std::list<Tick> &delays) 49{ 50 Addr blkAddr = pkt->getAddr() & ~(Addr)(this->blkSize-1); 51 52 for (int d=1; d <= degree; d++) { 53 Addr newAddr = blkAddr + d*(this->blkSize); 54 if (this->pageStop && 55 (blkAddr & ~(TheISA::VMPageSize - 1)) != 56 (newAddr & ~(TheISA::VMPageSize - 1))) 57 { 58 //Spanned the page, so now stop 59 this->pfSpanPage += degree - d + 1; 60 return; 61 } 62 else 63 { 64 addresses.push_back(newAddr); 65 delays.push_back(latency); 66 } 67 } 68} 69 70
|