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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
|
/*
* Copyright (C) 2012 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``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 APPLE INC. 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.
*/
#ifndef FastBitVector_h
#define FastBitVector_h
#include <wtf/FastMalloc.h>
#include <wtf/OwnArrayPtr.h>
#include <wtf/PassOwnArrayPtr.h>
#include <wtf/StdLibExtras.h>
namespace WTF {
class FastBitVector {
public:
FastBitVector()
: m_array(0)
, m_numBits(0)
{
}
FastBitVector(const FastBitVector& other)
: m_array(0)
, m_numBits(0)
{
*this = other;
}
~FastBitVector()
{
if (m_array)
fastFree(m_array);
}
FastBitVector& operator=(const FastBitVector& other)
{
size_t length = other.arrayLength();
uint32_t* newArray = static_cast<uint32_t*>(fastCalloc(length, 4));
memcpy(newArray, other.m_array, length * 4);
if (m_array)
fastFree(m_array);
m_array = newArray;
m_numBits = other.m_numBits;
return *this;
}
size_t numBits() const { return m_numBits; }
void resize(size_t numBits)
{
// Use fastCalloc instead of fastRealloc because we expect the common
// use case for this method to be initializing the size of the bitvector.
size_t newLength = (numBits + 31) >> 5;
uint32_t* newArray = static_cast<uint32_t*>(fastCalloc(newLength, 4));
memcpy(newArray, m_array, arrayLength() * 4);
if (m_array)
fastFree(m_array);
m_array = newArray;
m_numBits = numBits;
}
void setAll()
{
memset(m_array, 255, arrayLength() * 4);
}
void clearAll()
{
memset(m_array, 0, arrayLength() * 4);
}
void set(const FastBitVector& other)
{
ASSERT(m_numBits == other.m_numBits);
memcpy(m_array, other.m_array, arrayLength() * 4);
}
bool setAndCheck(const FastBitVector& other)
{
bool changed = false;
ASSERT(m_numBits == other.m_numBits);
for (unsigned i = arrayLength(); i--;) {
if (m_array[i] == other.m_array[i])
continue;
m_array[i] = other.m_array[i];
changed = true;
}
return changed;
}
bool equals(const FastBitVector& other) const
{
ASSERT(m_numBits == other.m_numBits);
// Use my own comparison loop because memcmp does more than what I want
// and bcmp is not as standard.
for (unsigned i = arrayLength(); i--;) {
if (m_array[i] != other.m_array[i])
return false;
}
return true;
}
void merge(const FastBitVector& other)
{
ASSERT(m_numBits == other.m_numBits);
for (unsigned i = arrayLength(); i--;)
m_array[i] |= other.m_array[i];
}
void filter(const FastBitVector& other)
{
ASSERT(m_numBits == other.m_numBits);
for (unsigned i = arrayLength(); i--;)
m_array[i] &= other.m_array[i];
}
void exclude(const FastBitVector& other)
{
ASSERT(m_numBits == other.m_numBits);
for (unsigned i = arrayLength(); i--;)
m_array[i] &= ~other.m_array[i];
}
void set(size_t i)
{
ASSERT_WITH_SECURITY_IMPLICATION(i < m_numBits);
m_array[i >> 5] |= (1 << (i & 31));
}
void clear(size_t i)
{
ASSERT_WITH_SECURITY_IMPLICATION(i < m_numBits);
m_array[i >> 5] &= ~(1 << (i & 31));
}
void set(size_t i, bool value)
{
if (value)
set(i);
else
clear(i);
}
bool get(size_t i) const
{
ASSERT_WITH_SECURITY_IMPLICATION(i < m_numBits);
return !!(m_array[i >> 5] & (1 << (i & 31)));
}
private:
size_t arrayLength() const { return (m_numBits + 31) >> 5; }
uint32_t* m_array; // No, this can't be an OwnArrayPtr.
size_t m_numBits;
};
} // namespace WTF
using WTF::FastBitVector;
#endif // FastBitVector_h
|
