SubBlock.cc (6285:ce086eca1ede) SubBlock.cc (7039:bc0b6ea676b5)
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;

--- 12 unchanged lines hidden (view full) ---

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
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;

--- 12 unchanged lines hidden (view full) ---

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
30/*
31 * $Id$
32 */
33
34#include "mem/ruby/common/SubBlock.hh"
35
36SubBlock::SubBlock(const Address& addr, int size)
37{
29#include "mem/ruby/common/SubBlock.hh"
30
31SubBlock::SubBlock(const Address& addr, int size)
32{
38 m_address = addr;
39 setSize(size);
40 for(int i=0; i<size; i++) {
41 setByte(i, 0);
42 }
33 m_address = addr;
34 setSize(size);
35 for (int i = 0; i < size; i++) {
36 setByte(i, 0);
37 }
43}
44
38}
39
45void SubBlock::internalMergeFrom(const DataBlock& data)
40void
41SubBlock::internalMergeFrom(const DataBlock& data)
46{
42{
47 int size = getSize();
48 assert(size > 0);
49 int offset = m_address.getOffset();
50 for(int i=0; i<size; i++) {
51 this->setByte(i, data.getByte(offset+i));
52 }
43 int size = getSize();
44 assert(size > 0);
45 int offset = m_address.getOffset();
46 for (int i = 0; i < size; i++) {
47 this->setByte(i, data.getByte(offset + i));
48 }
53}
54
49}
50
55void SubBlock::internalMergeTo(DataBlock& data) const
51void
52SubBlock::internalMergeTo(DataBlock& data) const
56{
53{
57 int size = getSize();
58 assert(size > 0);
59 int offset = m_address.getOffset();
60 for(int i=0; i<size; i++) {
61 data.setByte(offset+i, this->getByte(i)); // This will detect crossing a cache line boundary
62 }
54 int size = getSize();
55 assert(size > 0);
56 int offset = m_address.getOffset();
57 for (int i = 0; i < size; i++) {
58 // This will detect crossing a cache line boundary
59 data.setByte(offset + i, this->getByte(i));
60 }
63}
64
61}
62
65void SubBlock::print(ostream& out) const
63void
64SubBlock::print(ostream& out) const
66{
65{
67 out << "[" << m_address << ", " << getSize() << ", " << m_data << "]";
66 out << "[" << m_address << ", " << getSize() << ", " << m_data << "]";
68}
69
70
71
67}
68
69
70