DataBlock.cc (6154:6bb54dcb940e) DataBlock.cc (6285:ce086eca1ede)
1
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/DataBlock.hh"
35
2#include "mem/ruby/common/DataBlock.hh"
3
36DataBlock::DataBlock()
4DataBlock &
5DataBlock::operator=(const DataBlock & obj)
37{
6{
38 if (DATA_BLOCK || XACT_MEMORY) {
39 m_data.setSize(RubyConfig::dataBlockBytes());
40 }
41 clear();
42}
43
44DataBlock::~DataBlock()
45{
46
47}
48
49void DataBlock::clear()
50{
51 int size = m_data.size();
52 for (int i = 0; i < size; i++) {
53 m_data[i] = 0;
54 }
55}
56
57bool DataBlock::equal(const DataBlock& obj) const
58{
59 bool value = true;
60 int size = m_data.size();
61 for (int i = 0; i < size; i++) {
62 value = value && (m_data[i] == obj.m_data[i]);
63 }
64 return value;
65}
66
67void DataBlock::print(ostream& out) const
68{
69 int size = m_data.size();
70 for (int i = 0; i < size; i+=4) {
71 out << hex << *((uint32*)(&(m_data[i]))) << " ";
72 }
73 out << dec << "]" << flush;
74}
75
76uint8 DataBlock::getByte(int whichByte) const
77{
78 if (DATA_BLOCK || XACT_MEMORY) {
79 return m_data[whichByte];
7 if (this == &obj) {
8 // assert(false);
80 } else {
9 } else {
81 return 0;
10 if (!m_alloc)
11 m_data = new uint8[RubySystem::getBlockSizeBytes()];
12 memcpy(m_data, obj.m_data, RubySystem::getBlockSizeBytes());
13 m_alloc = true;
82 }
14 }
15 return *this;
83}
16}
84
85void DataBlock::setByte(int whichByte, uint8 data)
86{
87 if (DATA_BLOCK || XACT_MEMORY) {
88 m_data[whichByte] = data;
89 }
90}
91