| OLD | NEW |
| 1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file |
| 2 // for details. All rights reserved. Use of this source code is governed by a | 2 // for details. All rights reserved. Use of this source code is governed by a |
| 3 // BSD-style license that can be found in the LICENSE file. | 3 // BSD-style license that can be found in the LICENSE file. |
| 4 | 4 |
| 5 #ifndef VM_BIT_VECTOR_H_ | 5 #ifndef VM_BIT_VECTOR_H_ |
| 6 #define VM_BIT_VECTOR_H_ | 6 #define VM_BIT_VECTOR_H_ |
| 7 | 7 |
| 8 #include "vm/allocation.h" | 8 #include "vm/allocation.h" |
| 9 #include "vm/isolate.h" | 9 #include "vm/isolate.h" |
| 10 #include "vm/zone.h" | 10 #include "vm/zone.h" |
| (...skipping 66 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 77 | 77 |
| 78 // Remove all elements that are in the bitvector from. | 78 // Remove all elements that are in the bitvector from. |
| 79 bool RemoveAll(const BitVector* from); | 79 bool RemoveAll(const BitVector* from); |
| 80 | 80 |
| 81 // From the bitvector gen add those elements that are not in the | 81 // From the bitvector gen add those elements that are not in the |
| 82 // bitvector kill. | 82 // bitvector kill. |
| 83 bool KillAndAdd(BitVector* kill, BitVector* gen); | 83 bool KillAndAdd(BitVector* kill, BitVector* gen); |
| 84 | 84 |
| 85 void Intersect(const BitVector* other); | 85 void Intersect(const BitVector* other); |
| 86 | 86 |
| 87 bool Contains(int i) const { | 87 bool Contains(intptr_t i) const { |
| 88 ASSERT(i >= 0 && i < length()); | 88 ASSERT(i >= 0 && i < length()); |
| 89 uword block = data_[i / kBitsPerWord]; | 89 uword block = data_[i / kBitsPerWord]; |
| 90 return (block & (static_cast<uword>(1) << (i % kBitsPerWord))) != 0; | 90 return (block & (static_cast<uword>(1) << (i % kBitsPerWord))) != 0; |
| 91 } | 91 } |
| 92 | 92 |
| 93 void Clear() { | 93 void Clear() { |
| 94 for (intptr_t i = 0; i < data_length_; i++) { | 94 for (intptr_t i = 0; i < data_length_; i++) { |
| 95 data_[i] = 0; | 95 data_[i] = 0; |
| 96 } | 96 } |
| 97 } | 97 } |
| (...skipping 12 matching lines...) Expand all Loading... |
| 110 intptr_t length_; | 110 intptr_t length_; |
| 111 intptr_t data_length_; | 111 intptr_t data_length_; |
| 112 uword* data_; | 112 uword* data_; |
| 113 | 113 |
| 114 DISALLOW_COPY_AND_ASSIGN(BitVector); | 114 DISALLOW_COPY_AND_ASSIGN(BitVector); |
| 115 }; | 115 }; |
| 116 | 116 |
| 117 } // namespace dart | 117 } // namespace dart |
| 118 | 118 |
| 119 #endif // VM_BIT_VECTOR_H_ | 119 #endif // VM_BIT_VECTOR_H_ |
| OLD | NEW |