-
-
Notifications
You must be signed in to change notification settings - Fork 594
/
dvec.d
607 lines (532 loc) · 12.8 KB
/
dvec.d
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
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
/**
* Compiler implementation of the
* $(LINK2 http://www.dlang.org, D programming language).
*
* Simple bit vector implementation.
*
* Copyright: Copyright (c) 2013-2018 by The D Language Foundation, All Rights Reserved
* Authors: $(LINK2 http://www.digitalmars.com, Walter Bright)
* License: $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
* Source: $(LINK2 https://github.com/dlang/dmd/blob/master/src/dmd/backend/dvec.d, backend/dvec.d)
*/
module dmd.backend.dvec;
import core.stdc.stdio;
import core.stdc.stdlib;
import core.stdc.string;
import core.bitop;
extern (C):
nothrow:
@nogc:
alias vec_base_t = size_t; // base type of vector
alias vec_t = vec_base_t*;
enum VECBITS = vec_base_t.sizeof * 8; // # of bits per entry
enum VECMASK = VECBITS - 1; // mask for bit position
enum VECSHIFT = (VECBITS == 16) ? 4 : (VECBITS == 32 ? 5 : 6); // # of bits in VECMASK
static assert(vec_base_t.sizeof == 2 && VECSHIFT == 4 ||
vec_base_t.sizeof == 4 && VECSHIFT == 5 ||
vec_base_t.sizeof == 8 && VECSHIFT == 6);
struct VecGlobal
{
int count; // # of vectors allocated
int initcount; // # of times package is initialized
vec_t[30] freelist; // free lists indexed by dim
nothrow:
@nogc:
void initialize()
{
if (initcount++ == 0)
count = 0;
}
void terminate()
{
if (--initcount == 0)
{
debug
{
if (count != 0)
{
printf("vecGlobal.count = %d\n", count);
assert(0);
}
}
else
assert(count == 0);
foreach (size_t i; 0 .. freelist.length)
{
void **vn;
for (void** v = cast(void **)freelist[i]; v; v = vn)
{
vn = cast(void **)(*v);
//mem_free(v);
.free(v);
}
freelist[i] = null;
}
}
}
vec_t allocate(size_t numbits)
{
if (numbits == 0)
return cast(vec_t) null;
const dim = (numbits + (VECBITS - 1)) >> VECSHIFT;
vec_t v;
if (dim < freelist.length && (v = freelist[dim]) != null)
{
freelist[dim] = *cast(vec_t *)v;
v += 2;
switch (dim)
{
case 5: v[4] = 0; goto case 4;
case 4: v[3] = 0; goto case 3;
case 3: v[2] = 0; goto case 2;
case 2: v[1] = 0; goto case 1;
case 1: v[0] = 0;
break;
default: memset(v,0,dim * vec_base_t.sizeof);
break;
}
goto L1;
}
else
{
v = cast(vec_t) calloc(dim + 2, vec_base_t.sizeof);
assert(v);
}
if (v)
{
v += 2;
L1:
vec_dim(v) = dim;
vec_numbits(v) = numbits;
/*printf("vec_calloc(%d): v = %p vec_numbits = %d vec_dim = %d\n",
numbits,v,vec_numbits(v),vec_dim(v));*/
count++;
}
return v;
}
vec_t dup(const vec_t v)
{
if (!v)
return null;
const dim = vec_dim(v);
const nbytes = (dim + 2) * vec_base_t.sizeof;
vec_t vc;
vec_t result;
if (dim < freelist.length && (vc = freelist[dim]) != null)
{
freelist[dim] = *cast(vec_t *)vc;
goto L1;
}
else
{
vc = cast(vec_t) calloc(nbytes, 1);
assert(vc);
}
if (vc)
{
L1:
memcpy(vc,v - 2,nbytes);
count++;
result = vc + 2;
}
else
result = null;
return result;
}
void free(vec_t v)
{
/*printf("vec_free(%p)\n",v);*/
if (v)
{
const dim = vec_dim(v);
v -= 2;
if (dim < freelist.length)
{
*cast(vec_t *)v = freelist[dim];
freelist[dim] = v;
}
else
.free(v);
count--;
}
}
}
__gshared VecGlobal vecGlobal;
private pure vec_base_t MASK(uint b) { return cast(vec_base_t)1 << (b & VECMASK); }
pure ref inout(vec_base_t) vec_numbits(inout vec_t v) { return v[-1]; }
pure ref inout(vec_base_t) vec_dim(inout vec_t v) { return v[-2]; }
/**************************
* Initialize package.
*/
void vec_init()
{
vecGlobal.initialize();
}
/**************************
* Terminate package.
*/
void vec_term()
{
vecGlobal.terminate();
}
/********************************
* Allocate a vector given # of bits in it.
* Clear the vector.
*/
vec_t vec_calloc(size_t numbits)
{
return vecGlobal.allocate(numbits);
}
/********************************
* Allocate copy of existing vector.
*/
vec_t vec_clone(const vec_t v)
{
return vecGlobal.dup(v);
}
/**************************
* Free a vector.
*/
void vec_free(vec_t v)
{
/*printf("vec_free(%p)\n",v);*/
return vecGlobal.free(v);
}
/**************************
* Realloc a vector to have numbits bits in it.
* Extra bits are set to 0.
*/
vec_t vec_realloc(vec_t v, size_t numbits)
{
/*printf("vec_realloc(%p,%d)\n",v,numbits);*/
if (!v)
return vec_calloc(numbits);
if (!numbits)
{ vec_free(v);
return null;
}
const vbits = vec_numbits(v);
if (numbits == vbits)
return v;
vec_t newv = vec_calloc(numbits);
if (newv)
{
const nbytes = (vec_dim(v) < vec_dim(newv)) ? vec_dim(v) : vec_dim(newv);
memcpy(newv,v,nbytes * vec_base_t.sizeof);
vec_clearextrabits(newv);
}
vec_free(v);
return newv;
}
/**************************
* Set bit b in vector v.
*/
pure
void vec_setbit(size_t b, vec_t v)
{
debug
{
if (!(v && b < vec_numbits(v)))
printf("vec_setbit(v = %p,b = %d): numbits = %d dim = %d\n",
v,b,v ? vec_numbits(v) : 0, v ? vec_dim(v) : 0);
}
assert(v && b < vec_numbits(v));
core.bitop.bts(v, b);
}
/**************************
* Clear bit b in vector v.
*/
pure
void vec_clearbit(size_t b, vec_t v)
{
assert(v && b < vec_numbits(v));
core.bitop.btr(v, b);
}
/**************************
* Test bit b in vector v.
*/
pure
size_t vec_testbit(size_t b, const vec_t v)
{
if (!v)
return 0;
debug
{
if (!(v && b < vec_numbits(v)))
printf("vec_setbit(v = %p,b = %d): numbits = %d dim = %d\n",
v,b,v ? vec_numbits(v) : 0, v ? vec_dim(v) : 0);
}
assert(v && b < vec_numbits(v));
return core.bitop.bt(v, b);
}
/********************************
* Find first set bit starting from b in vector v.
* If no bit is found, return vec_numbits(v).
*/
pure
size_t vec_index(size_t b, const vec_t vec)
{
if (!vec)
return 0;
const(vec_base_t)* v = vec;
if (b < vec_numbits(v))
{
const vtop = &vec[vec_dim(v)];
const bit = b & VECMASK;
if (bit != b) // if not starting in first word
v += b >> VECSHIFT;
size_t starv = *v >> bit;
while (1)
{
while (starv)
{
if (starv & 1)
return b;
b++;
starv >>= 1;
}
b = (b + VECBITS) & ~VECMASK; // round up to next word
if (++v >= vtop)
break;
starv = *v;
}
}
return vec_numbits(vec);
}
/********************************
* Compute v1 &= v2.
*/
pure
void vec_andass(vec_t v1, const(vec_base_t)* v2)
{
if (v1)
{
assert(v2);
assert(vec_numbits(v1)==vec_numbits(v2));
const vtop = &v1[vec_dim(v1)];
for (; v1 < vtop; v1++,v2++)
*v1 &= *v2;
}
else
assert(!v2);
}
/********************************
* Compute v1 = v2 & v3.
*/
pure
void vec_and(vec_t v1, const(vec_base_t)* v2, const(vec_base_t)* v3)
{
if (v1)
{
assert(v2 && v3);
assert(vec_numbits(v1)==vec_numbits(v2) && vec_numbits(v1)==vec_numbits(v3));
const vtop = &v1[vec_dim(v1)];
for (; v1 < vtop; v1++,v2++,v3++)
*v1 = *v2 & *v3;
}
else
assert(!v2 && !v3);
}
/********************************
* Compute v1 ^= v2.
*/
pure
void vec_xorass(vec_t v1, const(vec_base_t)* v2)
{
if (v1)
{
assert(v2);
assert(vec_numbits(v1)==vec_numbits(v2));
const vtop = &v1[vec_dim(v1)];
for (; v1 < vtop; v1++,v2++)
*v1 ^= *v2;
}
else
assert(!v2);
}
/********************************
* Compute v1 = v2 ^ v3.
*/
pure
void vec_xor(vec_t v1, const(vec_base_t)* v2, const(vec_base_t)* v3)
{
if (v1)
{
assert(v2 && v3);
assert(vec_numbits(v1)==vec_numbits(v2) && vec_numbits(v1)==vec_numbits(v3));
const vtop = &v1[vec_dim(v1)];
for (; v1 < vtop; v1++,v2++,v3++)
*v1 = *v2 ^ *v3;
}
else
assert(!v2 && !v3);
}
/********************************
* Compute v1 |= v2.
*/
pure
void vec_orass(vec_t v1, const(vec_base_t)* v2)
{
if (v1)
{
debug assert(v2);
debug assert(vec_numbits(v1)==vec_numbits(v2));
const vtop = &v1[vec_dim(v1)];
for (; v1 < vtop; v1++,v2++)
*v1 |= *v2;
}
else
assert(!v2);
}
/********************************
* Compute v1 = v2 | v3.
*/
pure
void vec_or(vec_t v1, const(vec_base_t)* v2, const(vec_base_t)* v3)
{
if (v1)
{
assert(v2 && v3);
assert(vec_numbits(v1)==vec_numbits(v2) && vec_numbits(v1)==vec_numbits(v3));
const vtop = &v1[vec_dim(v1)];
for (; v1 < vtop; v1++,v2++,v3++)
*v1 = *v2 | *v3;
}
else
assert(!v2 && !v3);
}
/********************************
* Compute v1 -= v2.
*/
pure
void vec_subass(vec_t v1, const(vec_base_t)* v2)
{
if (v1)
{
assert(v2);
assert(vec_numbits(v1)==vec_numbits(v2));
const vtop = &v1[vec_dim(v1)];
for (; v1 < vtop; v1++,v2++)
*v1 &= ~*v2;
}
else
assert(!v2);
}
/********************************
* Compute v1 = v2 - v3.
*/
pure
void vec_sub(vec_t v1, const(vec_base_t)* v2, const(vec_base_t)* v3)
{
if (v1)
{
assert(v2 && v3);
assert(vec_numbits(v1)==vec_numbits(v2) && vec_numbits(v1)==vec_numbits(v3));
const vtop = &v1[vec_dim(v1)];
for (; v1 < vtop; v1++,v2++,v3++)
*v1 = *v2 & ~*v3;
}
else
assert(!v2 && !v3);
}
/****************
* Clear vector.
*/
pure
void vec_clear(vec_t v)
{
if (v)
memset(v, 0, v[0].sizeof * vec_dim(v));
}
/****************
* Set vector.
*/
pure
void vec_set(vec_t v)
{
if (v)
{
memset(v, ~0, v[0].sizeof * vec_dim(v));
vec_clearextrabits(v);
}
}
/***************
* Copy vector.
*/
pure
void vec_copy(vec_t to, const vec_t from)
{
if (to != from)
{
debug
{
if (!(to && from && vec_numbits(to) == vec_numbits(from)))
printf("to = x%lx, from = x%lx, numbits(to) = %d, numbits(from) = %d\n",
cast(int)to,cast(int)from,to ? vec_numbits(to) : 0, from ? vec_numbits(from): 0);
}
assert(to && from && vec_numbits(to) == vec_numbits(from));
memcpy(to, from, to[0].sizeof * vec_dim(to));
}
}
/****************
* Return 1 if vectors are equal.
*/
pure
int vec_equal(const vec_t v1, const vec_t v2)
{
if (v1 == v2)
return 1;
assert(v1 && v2 && vec_numbits(v1) == vec_numbits(v2));
return !memcmp(v1, v2, v1[0].sizeof * vec_dim(v1));
}
/********************************
* Return 1 if (v1 & v2) == 0
*/
pure
int vec_disjoint(const(vec_base_t)* v1, const(vec_base_t)* v2)
{
assert(v1 && v2);
assert(vec_numbits(v1) == vec_numbits(v2));
const vtop = &v1[vec_dim(v1)];
for (; v1 < vtop; v1++,v2++)
if (*v1 & *v2)
return 0;
return 1;
}
/*********************
* Clear any extra bits in vector.
*/
pure
void vec_clearextrabits(vec_t v)
{
assert(v);
const n = vec_numbits(v);
if (n & VECMASK)
v[vec_dim(v) - 1] &= MASK(cast(uint)n) - 1;
}
/******************
* Write out vector.
*/
pure
void vec_println(const vec_t v)
{
debug
{
vec_print(v);
fputc('\n',stdout);
}
}
pure
void vec_print(const vec_t v)
{
debug
{
printf(" Vec %p, numbits %d dim %d",v,vec_numbits(v),vec_dim(v));
if (v)
{
fputc('\t',stdout);
for (size_t i = 0; i < vec_numbits(v); i++)
fputc((vec_testbit(i,v)) ? '1' : '0',stdout);
}
}
}