SubBlock.cc revision 6154
1 2/* 3 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 4 * All rights reserved. 5 * 6 * Redistribution and use in source and binary forms, with or without 7 * modification, are permitted provided that the following conditions are 8 * met: redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer; 10 * redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution; 13 * neither the name of the copyright holders nor the names of its 14 * contributors may be used to endorse or promote products derived from 15 * this software without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 18 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 19 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 20 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 21 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 22 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 23 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 27 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28 */ 29 30/* 31 * $Id$ 32 */ 33 34#include "mem/ruby/common/SubBlock.hh" 35 36SubBlock::SubBlock(const Address& addr, int size) 37{ 38 m_address = addr; 39 setSize(size); 40 for(int i=0; i<size; i++) { 41 setByte(i, 0); 42 } 43} 44 45SubBlock::SubBlock(const Address& addr, const Address& logicalAddress, int size) 46{ 47 m_address = addr; 48 m_logicalAddress = logicalAddress; 49 setSize(size); 50 for(int i=0; i<size; i++) { 51 setByte(i, 0); 52 } 53} 54 55void SubBlock::internalMergeFrom(const DataBlock& data) 56{ 57 int size = getSize(); 58 assert(size > 0); 59 int offset = m_address.getOffset(); 60 for(int i=0; i<size; i++) { 61 this->setByte(i, data.getByte(offset+i)); 62 } 63} 64 65void SubBlock::internalMergeTo(DataBlock& data) const 66{ 67 int size = getSize(); 68 assert(size > 0); 69 int offset = m_address.getOffset(); 70 for(int i=0; i<size; i++) { 71 data.setByte(offset+i, this->getByte(i)); // This will detect crossing a cache line boundary 72 } 73} 74 75void SubBlock::print(ostream& out) const 76{ 77 out << "[" << m_address << ", " << getSize() << ", " << m_data << "]"; 78} 79 80 81 82