-
Notifications
You must be signed in to change notification settings - Fork 138
/
sets.c
375 lines (245 loc) · 6.17 KB
/
sets.c
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
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
/*
* Copyright (C) 2002-2009, Parrot Foundation.
*/
/*
=head1 NAME
compilers/imcc/sets.c
=head1 DESCRIPTION
An implementation of sets -- used for tracking register usage.
=head2 Functions
=over 4
=cut
*/
#include "imc.h"
#include "sets.h"
/* HEADERIZER HFILE: compilers/imcc/sets.h */
#define NUM_BYTES(length) (((length) / 8) + 1)
#define BYTE_IN_SET(element) ((element) >> 3)
#define BIT_IN_BYTE(element) (1 << ((element) & 7))
/*
=item C<Set* set_make(imc_info_t * imcc, unsigned int length)>
Creates a new Set object.
=cut
*/
PARROT_MALLOC
PARROT_CANNOT_RETURN_NULL
Set*
set_make(ARGMOD(imc_info_t * imcc), unsigned int length)
{
ASSERT_ARGS(set_make)
Set * const s = mem_gc_allocate_zeroed_typed(imcc->interp, Set);
s->length = length;
s->bmp = mem_gc_allocate_n_zeroed_typed(imcc->interp,
NUM_BYTES(length), unsigned char);
return s;
}
/*
=item C<Set* set_make_full(imc_info_t * imcc, unsigned int length)>
Creates a new Set object of C<length> items, setting them all to full.
=cut
*/
PARROT_MALLOC
PARROT_CANNOT_RETURN_NULL
Set*
set_make_full(ARGMOD(imc_info_t * imcc), unsigned int length)
{
ASSERT_ARGS(set_make_full)
Set * const s = set_make(imcc, length);
const size_t bytes = NUM_BYTES(length);
if (bytes)
memset(s->bmp, 0xff, bytes);
return s;
}
/*
=item C<void set_free(Set *s)>
Frees the given Set and its allocated memory.
=cut
*/
void
set_free(ARGMOD(Set *s))
{
ASSERT_ARGS(set_free)
if (s->bmp)
mem_sys_free(s->bmp);
mem_sys_free(s);
}
/*
=item C<void set_clear(Set *s)>
Clears all bits in the Set.
=cut
*/
void
set_clear(ARGMOD(Set *s))
{
ASSERT_ARGS(set_clear)
memset(s->bmp, 0, NUM_BYTES(s->length));
}
/*
=item C<Set* set_copy(imc_info_t * imcc, const Set *s)>
Copies the set C<s>, returning a new set pointer.
=cut
*/
PARROT_MALLOC
PARROT_CANNOT_RETURN_NULL
Set*
set_copy(ARGMOD(imc_info_t * imcc), ARGIN(const Set *s))
{
ASSERT_ARGS(set_copy)
Set * const d = set_make(imcc, s->length);
memcpy(d->bmp, s->bmp, NUM_BYTES(d->length));
return d;
}
/*
=item C<int set_equal(const Set *s1, const Set *s2)>
Compares two sets for equality; sets are equal if they contain the same
elements.
=cut
*/
PARROT_PURE_FUNCTION
int
set_equal(ARGIN(const Set *s1), ARGIN(const Set *s2))
{
ASSERT_ARGS(set_equal)
int mask;
const size_t bytes = s1->length / 8;
PARROT_ASSERT(s1->length == s2->length);
if (bytes)
if (memcmp(s1->bmp, s2->bmp, bytes) != 0)
return 0;
if (s1->length % 8 == 0)
return 1;
mask = (1 << (s1->length % 8)) - 1;
if ((s1->bmp[bytes] & mask) != (s2->bmp[bytes] & mask))
return 0;
return 1;
}
/*
=item C<void set_add(Set *s, unsigned int element)>
Adds to set C<s> the element C<element>.
=cut
*/
void
set_add(ARGMOD(Set *s), unsigned int element)
{
ASSERT_ARGS(set_add)
const int elem_byte_in_set = BYTE_IN_SET(element);
const int bytes_in_set = BYTE_IN_SET(s->length);
if (bytes_in_set < elem_byte_in_set) {
s->bmp = (unsigned char *)mem_sys_realloc_zeroed(s->bmp,
NUM_BYTES(element), NUM_BYTES(s->length));
s->length += 8;
}
s->bmp[elem_byte_in_set] |= BIT_IN_BYTE(element);
}
/*
=item C<unsigned int set_first_zero(const Set *s)>
Sets the first unused item in the set.
=cut
*/
PARROT_WARN_UNUSED_RESULT
PARROT_PURE_FUNCTION
unsigned int
set_first_zero(ARGIN(const Set *s))
{
ASSERT_ARGS(set_first_zero)
unsigned int i;
for (i = 0; i < NUM_BYTES(s->length); ++i) {
const int set_byte = s->bmp[i];
int j;
if (set_byte == 0xFF)
continue;
for (j = 0; j < 8; ++j) {
unsigned int element = i * 8 + j;
if (!set_contains(s, element))
return element;
}
}
return s->length;
}
/*
=item C<int set_contains(const Set *s, unsigned int element)>
Checks whether the specified element is present in the specified Set argument.
Returns 1 if it is, 0 otherwise.
=cut
*/
PARROT_WARN_UNUSED_RESULT
PARROT_PURE_FUNCTION
int
set_contains(ARGIN(const Set *s), unsigned int element)
{
ASSERT_ARGS(set_contains)
if (element > s->length)
return 0;
else {
/* workaround for another lcc bug.. */
const int byte_in_set = element >> 3;
const int pos_in_byte = BIT_IN_BYTE(element);
return s->bmp[byte_in_set] & pos_in_byte;
}
}
/*
=item C<Set * set_union(imc_info_t * imcc, const Set *s1, const Set *s2)>
Computes the union of the two Set arguments, returning it as a new Set.
=cut
*/
PARROT_MALLOC
PARROT_CANNOT_RETURN_NULL
Set *
set_union(ARGMOD(imc_info_t * imcc), ARGIN(const Set *s1), ARGIN(const Set *s2))
{
ASSERT_ARGS(set_union)
unsigned int i;
Set * const s = set_make(imcc, s1->length);
PARROT_ASSERT(s1->length == s2->length);
for (i = 0; i < BYTE_IN_SET(s1->length); i++) {
s->bmp[i] = s1->bmp[i] | s2->bmp[i];
}
return s;
}
/*
=item C<Set * set_intersec(imc_info_t * imcc, const Set *s1, const Set *s2)>
Creates a new Set object that is the intersection of the Set arguments (defined
through the binary C<and> operator.)
=cut
*/
PARROT_MALLOC
PARROT_CANNOT_RETURN_NULL
Set *
set_intersec(ARGMOD(imc_info_t * imcc), ARGIN(const Set *s1),
ARGIN(const Set *s2))
{
ASSERT_ARGS(set_intersec)
unsigned int i;
Set * const s = set_make(imcc, s1->length);
PARROT_ASSERT(s1->length == s2->length);
for (i = 0; i < BYTE_IN_SET(s1->length); i++) {
s->bmp[i] = s1->bmp[i] & s2->bmp[i];
}
return s;
}
/*
=item C<void set_intersec_inplace(Set *s1, const Set *s2)>
Performs a set intersection in place -- the first Set argument changes to
contain the result.
=cut
*/
void
set_intersec_inplace(ARGMOD(Set *s1), ARGIN(const Set *s2))
{
ASSERT_ARGS(set_intersec_inplace)
unsigned int i;
PARROT_ASSERT(s1->length == s2->length);
for (i = 0; i < BYTE_IN_SET(s1->length); i++) {
s1->bmp[i] &= s2->bmp[i];
}
}
/*
=back
=cut
*/
/*
* Local variables:
* c-file-style: "parrot"
* End:
* vim: expandtab shiftwidth=4 cinoptions='\:2=2' :
*/