3 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
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.
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.
33 * Description: See NetDest.hh
39 #include "mem/ruby/common/NetDest.hh"
40 #include "mem/protocol/Protocol.hh"
47 void NetDest::add(MachineID newElement
)
49 m_bits
[vecIndex(newElement
)].add(bitIndex(newElement
.num
));
52 void NetDest::addNetDest(const NetDest
& netDest
)
54 assert(m_bits
.size() == netDest
.getSize());
55 for (int i
= 0; i
< m_bits
.size(); i
++) {
56 m_bits
[i
].addSet(netDest
.m_bits
[i
]);
60 void NetDest::addRandom()
62 int i
= random()%m_bits
.size();
63 m_bits
[i
].addRandom();
66 void NetDest::setNetDest(MachineType machine
, const Set
& set
)
68 // assure that there is only one set of destinations for this machine
69 assert(MachineType_base_level((MachineType
)(machine
+1)) - MachineType_base_level(machine
) == 1);
70 m_bits
[MachineType_base_level(machine
)] = set
;
73 void NetDest::remove(MachineID oldElement
)
75 m_bits
[vecIndex(oldElement
)].remove(bitIndex(oldElement
.num
));
78 void NetDest::removeNetDest(const NetDest
& netDest
)
80 assert(m_bits
.size() == netDest
.getSize());
81 for (int i
= 0; i
< m_bits
.size(); i
++) {
82 m_bits
[i
].removeSet(netDest
.m_bits
[i
]);
89 for (int i
= 0; i
< m_bits
.size(); i
++) {
94 void NetDest::broadcast()
96 for (MachineType machine
= MachineType_FIRST
; machine
< MachineType_NUM
; ++machine
) {
101 void NetDest::broadcast(MachineType machineType
) {
103 for (int i
= 0; i
< MachineType_base_count(machineType
); i
++) {
104 MachineID mach
= {machineType
, i
};
109 //For Princeton Network
110 Vector
<NodeID
> NetDest::getAllDest() {
113 for (int i
=0; i
<m_bits
.size(); i
++) {
114 for (int j
=0; j
<m_bits
[i
].getSize(); j
++) {
115 if (m_bits
[i
].isElement(j
)) {
116 dest
.insertAtBottom((NodeID
) (MachineType_base_number((MachineType
) i
) + j
));
123 int NetDest::count() const
126 for (int i
=0; i
<m_bits
.size(); i
++) {
127 counter
+= m_bits
[i
].count();
132 NodeID
NetDest::elementAt(MachineID index
) {
133 return m_bits
[vecIndex(index
)].elementAt(bitIndex(index
.num
));
136 NodeID
NetDest::smallestElement() const
139 for (int i
=0; i
<m_bits
.size(); i
++) {
140 for (int j
=0; j
<m_bits
[i
].getSize(); j
++) {
141 if (m_bits
[i
].isElement(j
)) {
146 ERROR_MSG("No smallest element of an empty set.");
149 MachineID
NetDest::smallestElement(MachineType machine
) const
151 for (int j
= 0; j
< m_bits
[MachineType_base_level(machine
)].getSize(); j
++) {
152 if (m_bits
[MachineType_base_level(machine
)].isElement(j
)) {
153 MachineID mach
= {machine
, j
};
158 ERROR_MSG("No smallest element of given MachineType.");
162 // Returns true iff all bits are set
163 bool NetDest::isBroadcast() const
165 for (int i
=0; i
<m_bits
.size(); i
++) {
166 if (!m_bits
[i
].isBroadcast()) {
173 // Returns true iff no bits are set
174 bool NetDest::isEmpty() const
176 for (int i
=0; i
<m_bits
.size(); i
++) {
177 if (!m_bits
[i
].isEmpty()) {
184 // returns the logical OR of "this" set and orNetDest
185 NetDest
NetDest::OR(const NetDest
& orNetDest
) const
187 assert(m_bits
.size() == orNetDest
.getSize());
189 for (int i
=0; i
<m_bits
.size(); i
++) {
190 result
.m_bits
[i
] = m_bits
[i
].OR(orNetDest
.m_bits
[i
]);
196 // returns the logical AND of "this" set and andNetDest
197 NetDest
NetDest::AND(const NetDest
& andNetDest
) const
199 assert(m_bits
.size() == andNetDest
.getSize());
201 for (int i
=0; i
<m_bits
.size(); i
++) {
202 result
.m_bits
[i
] = m_bits
[i
].AND(andNetDest
.m_bits
[i
]);
207 // Returns true if the intersection of the two sets is non-empty
208 bool NetDest::intersectionIsNotEmpty(const NetDest
& other_netDest
) const
210 assert(m_bits
.size() == other_netDest
.getSize());
211 for (int i
=0; i
<m_bits
.size(); i
++) {
212 if (m_bits
[i
].intersectionIsNotEmpty(other_netDest
.m_bits
[i
])) {
219 bool NetDest::isSuperset(const NetDest
& test
) const
221 assert(m_bits
.size() == test
.getSize());
223 for (int i
=0; i
<m_bits
.size(); i
++) {
224 if (!m_bits
[i
].isSuperset(test
.m_bits
[i
])) {
231 bool NetDest::isElement(MachineID element
) const
233 return ((m_bits
[vecIndex(element
)])).isElement(bitIndex(element
.num
));
236 void NetDest::setSize()
238 m_bits
.setSize(MachineType_base_level(MachineType_NUM
));
239 assert(m_bits
.size() == MachineType_NUM
);
241 for (int i
= 0; i
< m_bits
.size(); i
++) {
242 m_bits
[i
].setSize(MachineType_base_count((MachineType
)i
));
246 void NetDest::print(ostream
& out
) const
248 out
<< "[NetDest (" << m_bits
.size() << ") ";
250 for (int i
=0; i
<m_bits
.size(); i
++) {
251 for (int j
=0; j
<m_bits
[i
].getSize(); j
++) {
252 out
<< (bool) m_bits
[i
].isElement(j
) << " ";