1/*
2 * Copyright (c) 2012 ARM Limited
3 * All rights reserved
4 *
5 * The license below extends only to copyright in the software and shall
6 * not be construed as granting a license to any other intellectual
7 * property including but not limited to intellectual property relating
8 * to a hardware implementation of the functionality of the software
9 * licensed hereunder. You may use the software subject to the license
10 * terms below provided that you ensure that this notice is replicated
11 * unmodified and in its entirety in all distributions of the software,
12 * modified or unmodified, in source code or in binary form.
13 *
14 * Redistribution and use in source and binary forms, with or without
15 * modification, are permitted provided that the following conditions are
16 * met: redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer;
18 * redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution;
21 * neither the name of the copyright holders nor the names of its
22 * contributors may be used to endorse or promote products derived from
23 * this software without specific prior written permission.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
26 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
27 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
28 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
29 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
30 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
31 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
32 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
33 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
34 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
35 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 *
37 * Authors: Andreas Hansson
38 */
39
40#include "debug/BusAddrRanges.hh"
41#include "mem/physical.hh"
42
43using namespace std;
44
45PhysicalMemory::PhysicalMemory(const vector<AbstractMemory*>& _memories) :
46 size(0)
47{
48 for (vector<AbstractMemory*>::const_iterator m = _memories.begin();
49 m != _memories.end(); ++m) {
50 // only add the memory if it is part of the global address map
51 if ((*m)->isInAddrMap()) {
52 memories.push_back(*m);
53
54 // calculate the total size once and for all
55 size += (*m)->size();
56
57 // add the range to our interval tree and make sure it does not
58 // intersect an existing range
59 if (addrMap.insert((*m)->getAddrRange(), *m) == addrMap.end())
60 fatal("Memory address range for %s is overlapping\n",
61 (*m)->name());
62 }
63 DPRINTF(BusAddrRanges,
64 "Skipping memory %s that is not in global address map\n",
65 (*m)->name());
66 }
| 1/*
2 * Copyright (c) 2012 ARM Limited
3 * All rights reserved
4 *
5 * The license below extends only to copyright in the software and shall
6 * not be construed as granting a license to any other intellectual
7 * property including but not limited to intellectual property relating
8 * to a hardware implementation of the functionality of the software
9 * licensed hereunder. You may use the software subject to the license
10 * terms below provided that you ensure that this notice is replicated
11 * unmodified and in its entirety in all distributions of the software,
12 * modified or unmodified, in source code or in binary form.
13 *
14 * Redistribution and use in source and binary forms, with or without
15 * modification, are permitted provided that the following conditions are
16 * met: redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer;
18 * redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution;
21 * neither the name of the copyright holders nor the names of its
22 * contributors may be used to endorse or promote products derived from
23 * this software without specific prior written permission.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
26 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
27 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
28 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
29 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
30 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
31 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
32 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
33 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
34 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
35 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 *
37 * Authors: Andreas Hansson
38 */
39
40#include "debug/BusAddrRanges.hh"
41#include "mem/physical.hh"
42
43using namespace std;
44
45PhysicalMemory::PhysicalMemory(const vector<AbstractMemory*>& _memories) :
46 size(0)
47{
48 for (vector<AbstractMemory*>::const_iterator m = _memories.begin();
49 m != _memories.end(); ++m) {
50 // only add the memory if it is part of the global address map
51 if ((*m)->isInAddrMap()) {
52 memories.push_back(*m);
53
54 // calculate the total size once and for all
55 size += (*m)->size();
56
57 // add the range to our interval tree and make sure it does not
58 // intersect an existing range
59 if (addrMap.insert((*m)->getAddrRange(), *m) == addrMap.end())
60 fatal("Memory address range for %s is overlapping\n",
61 (*m)->name());
62 }
63 DPRINTF(BusAddrRanges,
64 "Skipping memory %s that is not in global address map\n",
65 (*m)->name());
66 }
|
78 if (r == addrMap.end()) {
79 // not in the cache, and not in the tree
80 return false;
81 }
82 // the range is in the tree, update the cache
83 rangeCache = r->first;
84 }
85
86 assert(addrMap.find(addr) != addrMap.end());
87
88 // either matched the cache or found in the tree
89 return true;
90}
91
92AddrRangeList
93PhysicalMemory::getConfAddrRanges() const
94{
95 // this could be done once in the constructor, but since it is unlikely to
96 // be called more than once the iteration should not be a problem
97 AddrRangeList ranges;
98 for (vector<AbstractMemory*>::const_iterator m = memories.begin();
99 m != memories.end(); ++m) {
100 if ((*m)->isConfReported()) {
101 ranges.push_back((*m)->getAddrRange());
102 }
103 }
104
105 return ranges;
106}
107
108void
109PhysicalMemory::access(PacketPtr pkt)
110{
111 assert(pkt->isRequest());
112 Addr addr = pkt->getAddr();
| 76 if (r == addrMap.end()) {
77 // not in the cache, and not in the tree
78 return false;
79 }
80 // the range is in the tree, update the cache
81 rangeCache = r->first;
82 }
83
84 assert(addrMap.find(addr) != addrMap.end());
85
86 // either matched the cache or found in the tree
87 return true;
88}
89
90AddrRangeList
91PhysicalMemory::getConfAddrRanges() const
92{
93 // this could be done once in the constructor, but since it is unlikely to
94 // be called more than once the iteration should not be a problem
95 AddrRangeList ranges;
96 for (vector<AbstractMemory*>::const_iterator m = memories.begin();
97 m != memories.end(); ++m) {
98 if ((*m)->isConfReported()) {
99 ranges.push_back((*m)->getAddrRange());
100 }
101 }
102
103 return ranges;
104}
105
106void
107PhysicalMemory::access(PacketPtr pkt)
108{
109 assert(pkt->isRequest());
110 Addr addr = pkt->getAddr();
|