summaryrefslogtreecommitdiff
path: root/src/mem/ruby/common/SubBlock.cc
blob: 568d3106a1407fd679b989c7bba2ecb47f1d81e1 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81

/*
 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are
 * met: redistributions of source code must retain the above copyright
 * notice, this list of conditions and the following disclaimer;
 * redistributions in binary form must reproduce the above copyright
 * notice, this list of conditions and the following disclaimer in the
 * documentation and/or other materials provided with the distribution;
 * neither the name of the copyright holders nor the names of its
 * contributors may be used to endorse or promote products derived from
 * this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

/*
 * $Id$
 */

#include "mem/ruby/common/SubBlock.hh"

SubBlock::SubBlock(const Address& addr, int size)
{
  m_address = addr;
  setSize(size);
  for(int i=0; i<size; i++) {
    setByte(i, 0);
  }
}

SubBlock::SubBlock(const Address& addr, const Address& logicalAddress, int size)
{
  m_address = addr;
  m_logicalAddress = logicalAddress;
  setSize(size);
  for(int i=0; i<size; i++) {
    setByte(i, 0);
  }
}

void SubBlock::internalMergeFrom(const DataBlock& data)
{
  int size = getSize();
  assert(size > 0);
  int offset = m_address.getOffset();
  for(int i=0; i<size; i++) {
    this->setByte(i, data.getByte(offset+i));
  }
}

void SubBlock::internalMergeTo(DataBlock& data) const
{
  int size = getSize();
  assert(size > 0);
  int offset = m_address.getOffset();
  for(int i=0; i<size; i++) {
    data.setByte(offset+i, this->getByte(i)); // This will detect crossing a cache line boundary
  }
}

void SubBlock::print(ostream& out) const
{
  out << "[" << m_address << ", " << getSize() << ", " << m_data << "]";
}