Set.hh (7055:4e24742201d7) | Set.hh (7089:9ea24d102d66) |
---|---|
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 * Set.hh 32 * 33 * Description: 34 * 35 * $Id: BigSet.hh 1.6 05/01/19 13:12:25-06:00 mikem@maya.cs.wisc.edu $ 36 * 37 */ 38 | |
39// modified by Dan Gibson on 05/20/05 to accomidate FASTER 40// >32 set lengths, using an array of ints w/ 32 bits/int 41 | 29// modified by Dan Gibson on 05/20/05 to accomidate FASTER 30// >32 set lengths, using an array of ints w/ 32 bits/int 31 |
42// NOTE: Never include this file directly, this should only be 43// included from Set.hh | 32#ifndef __MEM_RUBY_COMMON_SET_HH__ 33#define __MEM_RUBY_COMMON_SET_HH__ |
44 | 34 |
45#ifndef SET_H 46#define SET_H 47 | |
48#include <iostream> | 35#include <iostream> |
36#include <limits> |
|
49 50#include "mem/ruby/system/System.hh" 51#include "mem/ruby/common/Global.hh" | 37 38#include "mem/ruby/system/System.hh" 39#include "mem/ruby/common/Global.hh" |
52#include "mem/gems_common/Vector.hh" | |
53#include "mem/ruby/system/NodeID.hh" 54 | 40#include "mem/ruby/system/NodeID.hh" 41 |
55// gibson 05/20/05 56// enum PresenceBit {NotPresent, Present}; | 42class Set 43{ 44 private: 45 int m_nSize; // the number of bits in this set 46 int m_nArrayLen; // the number of 32-bit words that are 47 // held in the array |
57 | 48 |
58class Set { 59public: 60 // Constructors 61 // creates and empty set 62 Set(); 63 Set (int size); | 49 // Changed 5/24/05 for static allocation of array 50 // note that "long" corresponds to 32 bits on a 32-bit machine, 51 // 64 bits if the -m64 parameter is passed to g++, which it is 52 // for an AMD opteron under our configuration |
64 | 53 |
65 // used during the replay mechanism 66 // Set(const char *str); | 54 long *m_p_nArray; // an word array to hold the bits in the set 55 long m_p_nArray_Static[NUMBER_WORDS_PER_SET]; |
67 | 56 |
68 Set(const Set& obj); 69 Set& operator=(const Set& obj); | 57 static const int LONG_BITS = std::numeric_limits<long>::digits; 58 static const int INDEX_SHIFT = LONG_BITS == 64 ? 6 : 5; 59 static const int INDEX_MASK = (1 << INDEX_SHIFT) - 1; |
70 | 60 |
71 // Destructor 72 ~Set(); | 61 void clearExcess(); |
73 | 62 |
74 // Public Methods | 63 public: 64 Set(); 65 Set(int size); 66 Set(const Set& obj); 67 ~Set(); |
75 | 68 |
76 inline void add(NodeID index) | 69 Set& operator=(const Set& obj); 70 71 void 72 add(NodeID index) |
77 { | 73 { |
78#ifdef __32BITS__ 79 m_p_nArray[index>>5] |= (1 << (index & 0x01F)); 80#else 81 m_p_nArray[index>>6] |= (((unsigned long) 1) << (index & 0x03F)); 82#endif // __32BITS__ | 74 m_p_nArray[index >> INDEX_SHIFT] |= 75 (((unsigned long) 1) << (index & INDEX_MASK)); |
83 } 84 | 76 } 77 |
85 void addSet(const Set& set); 86 void addRandom(); | 78 void addSet(const Set& set); 79 void addRandom(); |
87 | 80 |
88 inline void remove(NodeID index) | 81 void 82 remove(NodeID index) |
89 { | 83 { |
90#ifdef __32BITS__ 91 m_p_nArray[index>>5] &= ~(0x00000001 << (index & 0x01F)); 92#else 93 m_p_nArray[index>>6] &= ~(((unsigned long) 0x0000000000000001) << (index & 0x03F)); 94#endif // __32BITS__ | 84 m_p_nArray[index >> INDEX_SHIFT] &= 85 ~(((unsigned long)1) << (index & INDEX_MASK)); |
95 } 96 | 86 } 87 |
88 void removeSet(const Set& set); |
|
97 | 89 |
98 void removeSet(const Set& set); | 90 void 91 clear() 92 { 93 for (int i = 0; i < m_nArrayLen; i++) 94 m_p_nArray[i] = 0; 95 } |
99 | 96 |
100 inline void clear() { for(int i=0; i<m_nArrayLen; i++) m_p_nArray[i] = 0; } | 97 void broadcast(); 98 int count() const; 99 bool isEqual(const Set& set) const; |
101 | 100 |
102 void broadcast(); 103 int count() const; 104 bool isEqual(const Set& set) const; | 101 // return the logical OR of this set and orSet 102 Set OR(const Set& orSet) const; |
105 | 103 |
106 Set OR(const Set& orSet) const; // return the logical OR of this set and orSet 107 Set AND(const Set& andSet) const; // return the logical AND of this set and andSet | 104 // return the logical AND of this set and andSet 105 Set AND(const Set& andSet) const; |
108 | 106 |
109 // Returns true if the intersection of the two sets is non-empty 110 inline bool intersectionIsNotEmpty(const Set& other_set) const | 107 // Returns true if the intersection of the two sets is empty 108 bool 109 intersectionIsEmpty(const Set& other_set) const |
111 { | 110 { |
112 for(int i=0; i< m_nArrayLen; i++) { 113 if(m_p_nArray[i] & other_set.m_p_nArray[i]) { 114 return true; 115 } 116 } 117 return false; | 111 for (int i = 0; i < m_nArrayLen; i++) 112 if (m_p_nArray[i] & other_set.m_p_nArray[i]) 113 return false; 114 return true; |
118 } 119 | 115 } 116 |
120 // Returns true if the intersection of the two sets is empty 121 inline bool intersectionIsEmpty(const Set& other_set) const 122 { 123 for(int i=0; i< m_nArrayLen; i++) { 124 if(m_p_nArray[i] & other_set.m_p_nArray[i]) { 125 return false; 126 } 127 } 128 return true; 129 } | 117 bool isSuperset(const Set& test) const; 118 bool isSubset(const Set& test) const { return test.isSuperset(*this); } |
130 | 119 |
131 bool isSuperset(const Set& test) const; 132 bool isSubset(const Set& test) const { return test.isSuperset(*this); } 133 134 inline bool isElement(NodeID element) const | 120 bool 121 isElement(NodeID element) const |
135 { | 122 { |
136#ifdef __32BITS__ 137 return ((m_p_nArray[element>>5] & (0x00000001 << (element & 0x01F)))!=0); 138#else 139 return ((m_p_nArray[element>>6] & (((unsigned long) 0x0000000000000001) << (element & 0x03F)))!=0); 140#endif // __32BITS__ 141 | 123 return (m_p_nArray[element>>INDEX_SHIFT] & 124 (((unsigned long)1) << (element & INDEX_MASK))) != 0; |
142 } 143 | 125 } 126 |
144 bool isBroadcast() const; 145 bool isEmpty() const; | 127 bool isBroadcast() const; 128 bool isEmpty() const; |
146 | 129 |
147 NodeID smallestElement() const; | 130 NodeID smallestElement() const; |
148 | 131 |
149 // int size() const; 150 void setSize (int size); | 132 void setSize(int size); |
151 | 133 |
152 // get element for a index 153 inline NodeID elementAt(int index) const | 134 NodeID 135 elementAt(int index) const |
154 { | 136 { |
155 if(isElement(index)) return (NodeID) true; 156 else return 0; | 137 if (isElement(index)) 138 return (NodeID)true; 139 else 140 return 0; |
157 } 158 | 141 } 142 |
159 // gibson 05/20/05 160 int getSize() const { return m_nSize; } | 143 int getSize() const { return m_nSize; } |
161 | 144 |
162 // DEPRECATED METHODS 163 void addToSet(NodeID newElement) { add(newElement); } // Deprecated 164 void removeFromSet(NodeID newElement) { remove(newElement); } // Deprecated 165 void clearSet() { clear(); } // Deprecated 166 void setBroadcast() { broadcast(); } // Deprecated 167 bool presentInSet(NodeID element) const { return isElement(element); } // Deprecated 168 169 void print(std::ostream& out) const; 170private: 171 // Private Methods 172 173 // Data Members (m_ prefix) 174 // gibson 05/20/05 175 // Vector<uint8> m_bits; // This is an vector of uint8 to reduce the size of the set 176 177 int m_nSize; // the number of bits in this set 178 int m_nArrayLen; // the number of 32-bit words that are held in the array 179 180 // Changed 5/24/05 for static allocation of array 181 // note that "long" corresponds to 32 bits on a 32-bit machine, 182 // 64 bits if the -m64 parameter is passed to g++, which it is 183 // for an AMD opteron under our configuration 184 185 long * m_p_nArray; // an word array to hold the bits in the set 186 long m_p_nArray_Static[NUMBER_WORDS_PER_SET]; | 145 void print(std::ostream& out) const; |
187}; 188 | 146}; 147 |
189// Output operator declaration 190std::ostream& operator<<(std::ostream& out, const Set& obj); 191 192// ******************* Definitions ******************* 193 194// Output operator definition 195extern inline 196std::ostream& operator<<(std::ostream& out, const Set& obj) | 148inline std::ostream& 149operator<<(std::ostream& out, const Set& obj) |
197{ | 150{ |
198 obj.print(out); 199 out << std::flush; 200 return out; | 151 obj.print(out); 152 out << std::flush; 153 return out; |
201} 202 | 154} 155 |
203#endif //SET_H 204 | 156#endif // __MEM_RUBY_COMMON_SET_HH__ |