DataBlock.cc (7039:bc0b6ea676b5) | DataBlock.cc (8090:722a0d28ee83) |
---|---|
1/* 2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 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; --- 13 unchanged lines hidden (view full) --- 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 29#include "mem/ruby/common/DataBlock.hh" | 1/* 2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 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; --- 13 unchanged lines hidden (view full) --- 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 29#include "mem/ruby/common/DataBlock.hh" |
30#include "mem/ruby/system/System.hh" |
|
30 | 31 |
32DataBlock::DataBlock(const DataBlock &cp) 33{ 34 m_data = new uint8[RubySystem::getBlockSizeBytes()]; 35 memcpy(m_data, cp.m_data, RubySystem::getBlockSizeBytes()); 36 m_alloc = true; 37} 38 39void 40DataBlock::alloc() 41{ 42 m_data = new uint8[RubySystem::getBlockSizeBytes()]; 43 m_alloc = true; 44 clear(); 45} 46 47void 48DataBlock::clear() 49{ 50 memset(m_data, 0, RubySystem::getBlockSizeBytes()); 51} 52 53bool 54DataBlock::equal(const DataBlock& obj) const 55{ 56 return !memcmp(m_data, obj.m_data, RubySystem::getBlockSizeBytes()); 57} 58 59void 60DataBlock::print(std::ostream& out) const 61{ 62 using namespace std; 63 64 int size = RubySystem::getBlockSizeBytes(); 65 out << "[ "; 66 for (int i = 0; i < size; i++) { 67 out << setw(2) << setfill('0') << hex << "0x" << (int)m_data[i] << " "; 68 out << setfill(' '); 69 } 70 out << dec << "]" << flush; 71} 72 73const uint8* 74DataBlock::getData(int offset, int len) const 75{ 76 assert(offset + len <= RubySystem::getBlockSizeBytes()); 77 return &m_data[offset]; 78} 79 80void 81DataBlock::setData(uint8* data, int offset, int len) 82{ 83 assert(offset + len <= RubySystem::getBlockSizeBytes()); 84 memcpy(&m_data[offset], data, len); 85} 86 |
|
31DataBlock & 32DataBlock::operator=(const DataBlock & obj) 33{ 34 if (this == &obj) { 35 // assert(false); 36 } else { 37 if (!m_alloc) 38 m_data = new uint8[RubySystem::getBlockSizeBytes()]; 39 memcpy(m_data, obj.m_data, RubySystem::getBlockSizeBytes()); 40 m_alloc = true; 41 } 42 43 return *this; 44} | 87DataBlock & 88DataBlock::operator=(const DataBlock & obj) 89{ 90 if (this == &obj) { 91 // assert(false); 92 } else { 93 if (!m_alloc) 94 m_data = new uint8[RubySystem::getBlockSizeBytes()]; 95 memcpy(m_data, obj.m_data, RubySystem::getBlockSizeBytes()); 96 m_alloc = true; 97 } 98 99 return *this; 100} |