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
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
|
/*
* tkBitFieldPriv.h --
*
* Private implementation for bit field.
*
* Copyright (c) 2015-2017 Gregor Cramer
*
* See the file "license.terms" for information on usage and redistribution of
* this file, and for a DISCLAIMER OF ALL WARRANTIES.
*/
#ifndef _TKBITFIELD
# error "do not include this private header file"
#endif
#ifndef _TKBITFIELDPRIV
#define _TKBITFIELDPRIV
MODULE_SCOPE bool TkBitNone_(const TkBitWord *buf, unsigned words);
#endif /* _TKBITFIELDPRIV */
#ifdef _TK_NEED_IMPLEMENTATION
#include <assert.h>
#ifdef _MSC_VER
# if _MSC_VER >= 1900
# define inline __inline
# else
# define inline
# endif
#elif __STDC_VERSION__ < 199901L
# define inline /* we are not C99 conform */
#endif
#define TK_BIT_WORD_INDEX(n) ((n) >> ((TK_BIT_NBITS + 128) >> 5))
#define TK_BIT_INDEX(n) ((n) & (TK_BIT_NBITS - 1))
#define TK_BIT_MASK(n) (((TkBitWord) 1) << (n))
#define TK_BIT_COUNT_WORDS(n) ((n + TK_BIT_NBITS - 1)/TK_BIT_NBITS)
inline
const unsigned char *
TkBitData(
const TkBitField *bf)
{
assert(bf);
return (const void *) bf->bits;
}
inline
unsigned
TkBitByteSize(
const TkBitField *bf)
{
assert(bf);
return TK_BIT_COUNT_WORDS(bf->size);
}
inline
unsigned
TkBitAdjustSize(
unsigned size)
{
return ((size + (TK_BIT_NBITS - 1))/TK_BIT_NBITS)*TK_BIT_NBITS;
}
inline
TkBitField *
TkBitNew(
unsigned size)
{
TkBitField *bf = TkBitResize(NULL, size);
bf->refCount = 0;
return bf;
}
inline
unsigned
TkBitRefCount(
const TkBitField *bf)
{
assert(bf);
return bf->refCount;
}
inline
void
TkBitIncrRefCount(
TkBitField *bf)
{
assert(bf);
bf->refCount += 1;
}
inline
unsigned
TkBitDecrRefCount(
TkBitField *bf)
{
unsigned refCount;
assert(bf);
assert(TkBitRefCount(bf) > 0);
if ((refCount = --bf->refCount) == 0) {
TkBitDestroy(&bf);
}
return refCount;
}
inline
unsigned
TkBitSize(
const TkBitField *bf)
{
assert(bf);
return bf->size;
}
inline
bool
TkBitIsEmpty(
const TkBitField *bf)
{
assert(bf);
return bf->size == 0;
}
inline
bool
TkBitNone(
const TkBitField *bf)
{
assert(bf);
return bf->size == 0 || TkBitNone_(bf->bits, TK_BIT_COUNT_WORDS(bf->size));
}
inline
bool
TkBitIntersects(
const TkBitField *bf1,
const TkBitField *bf2)
{
return !TkBitDisjunctive(bf1, bf2);
}
inline
bool
TkBitTest(
const TkBitField *bf,
unsigned n)
{
assert(bf);
assert(n < TkBitSize(bf));
return !!(bf->bits[TK_BIT_WORD_INDEX(n)] & TK_BIT_MASK(TK_BIT_INDEX(n)));
}
inline
void
TkBitSet(
TkBitField *bf,
unsigned n)
{
assert(bf);
assert(n < TkBitSize(bf));
bf->bits[TK_BIT_WORD_INDEX(n)] |= TK_BIT_MASK(TK_BIT_INDEX(n));
}
inline
void
TkBitUnset(
TkBitField *bf,
unsigned n)
{
assert(bf);
assert(n < TkBitSize(bf));
bf->bits[TK_BIT_WORD_INDEX(n)] &= ~TK_BIT_MASK(TK_BIT_INDEX(n));
}
inline
void
TkBitPut(
TkBitField *bf,
unsigned n,
bool value)
{
if (value) {
TkBitSet(bf, n);
} else {
TkBitUnset(bf, n);
}
}
#undef _TK_NEED_IMPLEMENTATION
#endif /* _TK_NEED_IMPLEMENTATION */
/* vi:set ts=8 sw=4: */
|
