-
-
Notifications
You must be signed in to change notification settings - Fork 594
/
util2.d
422 lines (354 loc) · 8.11 KB
/
util2.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
/**
* Compiler implementation of the
* $(LINK2 http://www.dlang.org, D programming language).
*
* Copyright: Copyright (C) 1984-1998 by Symantec
* Copyright (C) 2000-2019 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/util2.d, backend/util2.d)
*/
// Only used for DMD
module dmd.backend.util2;
// Utility subroutines
import core.stdc.stdio;
import core.stdc.stdlib;
import core.stdc.string;
import core.stdc.stdint : uint64_t;
import dmd.backend.cc;
import dmd.backend.cdef;
import dmd.backend.global;
import dmd.backend.mem;
extern (C++):
nothrow:
void *ph_malloc(size_t nbytes);
void *ph_calloc(size_t nbytes);
void ph_free(void *p);
void *ph_realloc(void *p , size_t nbytes);
extern (C) void printInternalFailure(FILE* stream); // from dmd/mars.d
void util_exit(int exitcode);
void file_progress()
{
}
/*******************************
* Alternative assert failure.
*/
void util_assert(const(char)* file, int line)
{
fflush(stdout);
printInternalFailure(stdout);
printf("Internal error: %s %d\n",file,line);
err_exit();
//#if __clang__
// __builtin_unreachable();
//#endif
}
/****************************
* Clean up and exit program.
*/
void err_exit()
{
util_exit(EXIT_FAILURE);
}
/********************************
* Clean up and exit program.
*/
void err_break()
{
util_exit(255);
}
/****************************
* Clean up and exit program.
*/
void util_exit(int exitcode)
{
exit(exitcode); /* terminate abnormally */
}
version (CRuntime_DigitalMars)
{
extern (C) extern __gshared int controlc_saw;
/********************************
* Control C interrupts go here.
*/
private extern (C) void controlc_handler()
{
//printf("saw controlc\n");
controlc_saw = 1;
}
/*********************************
* Trap control C interrupts.
*/
version (MARS) { } else
{
extern (C)
{
void controlc_open();
void controlc_close();
alias _controlc_handler_t = void function();
extern __gshared _controlc_handler_t _controlc_handler;
void _STI_controlc()
{
//printf("_STI_controlc()\n");
_controlc_handler = &controlc_handler;
controlc_open(); /* trap control C */
}
void _STD_controlc()
{
//printf("_STD_controlc()\n");
controlc_close();
}
}
}
}
/***********************************
* Send progress report.
*/
void util_progress()
{
version (MARS) { } else {
version (CRuntime_DigitalMars)
{
if (controlc_saw)
err_break();
}
}
}
void util_progress(int linnum)
{
version (MARS) { } else {
version (CRuntime_DigitalMars)
{
if (controlc_saw)
err_break();
}
}
}
/**********************************
* Binary string search.
* Input:
* p . string of characters
* tab array of pointers to strings
* n = number of pointers in the array
* Returns:
* index (0..n-1) into tab[] if we found a string match
* else -1
*/
version (X86) version (CRuntime_DigitalMars)
version = X86asm;
int binary(const(char)* p, const(char)* *table,int high)
{
version (X86asm)
{
alias len = high; // reuse parameter storage
asm nothrow
{
// First find the length of the identifier.
xor EAX,EAX ; // Scan for a 0.
mov EDI,p ;
mov ECX,EAX ;
dec ECX ; // Longest possible string.
repne ;
scasb ;
mov EDX,high ; // EDX = high
not ECX ; // length of the id including '/0', stays in ECX
dec EDX ; // high--
js short Lnotfound ;
dec EAX ; // EAX = -1, so that eventually EBX = low (0)
mov len,ECX ;
even ;
L4D: lea EBX,[EAX + 1] ; // low = mid + 1
cmp EBX,EDX ;
jg Lnotfound ;
even ;
L15: lea EAX,[EBX + EDX] ; // EAX = low + high
// Do the string compare.
mov EDI,table ;
sar EAX,1 ; // mid = (low + high) >> 1
mov ESI,p ;
mov EDI,[4*EAX+EDI] ; // Load table[mid]
mov ECX,len ; // length of id
repe ;
cmpsb ;
je short L63 ; // return mid if equal
jns short L4D ; // if (cond < 0)
lea EDX,-1[EAX] ; // high = mid - 1
cmp EBX,EDX ;
jle L15 ;
Lnotfound:
mov EAX,-1 ; // Return -1.
even ;
L63: ;
}
}
else
{
int low = 0;
char cp = *p;
high--;
p++;
while (low <= high)
{
int mid = (low + high) >> 1;
int cond = table[mid][0] - cp;
if (cond == 0)
cond = strcmp(table[mid] + 1,p);
if (cond > 0)
high = mid - 1;
else if (cond < 0)
low = mid + 1;
else
return mid; /* match index */
}
return -1;
}
}
// search table[0 .. high] for p[0 .. len] (where p.length not necessairily equal to len)
int binary(const(char)* p, size_t len, const(char)** table, int high)
{
int low = 0;
char cp = *p;
high--;
p++;
len--;
while (low <= high)
{
int mid = (low + high) >> 1;
int cond = table[mid][0] - cp;
if (cond == 0)
{
cond = strncmp(table[mid] + 1, p, len);
if (cond == 0)
cond = table[mid][len+1]; // same as: if (table[mid][len+1] != '\0') cond = 1;
}
if (cond > 0)
high = mid - 1;
else if (cond < 0)
low = mid + 1;
else
return mid; /* match index */
}
return -1;
}
/**********************
* If c is a power of 2, return that power else -1.
*/
int ispow2(uint64_t c)
{ int i;
if (c == 0 || (c & (c - 1)))
i = -1;
else
for (i = 0; c >>= 1; i++)
{ }
return i;
}
/***************************
*/
enum UTIL_PH = true;
version (MEM_DEBUG)
enum MEM_DEBUG = false; //true;
else
enum MEM_DEBUG = false;
version (Windows)
{
void *util_malloc(uint n,uint size)
{
static if (MEM_DEBUG)
{
void *p;
p = mem_malloc(n * size);
//dbg_printf("util_calloc(%d) = %p\n",n * size,p);
return p;
}
else static if (UTIL_PH)
{
return ph_malloc(n * size);
}
else
{
size_t nbytes = cast(size_t)n * cast(size_t)size;
void *p = malloc(nbytes);
if (!p && nbytes)
err_nomem();
return p;
}
}
}
/***************************
*/
version (Windows)
{
void *util_calloc(uint n,uint size)
{
static if (MEM_DEBUG)
{
void *p;
p = mem_calloc(n * size);
//dbg_printf("util_calloc(%d) = %p\n",n * size,p);
return p;
}
else static if (UTIL_PH)
{
return ph_calloc(n * size);
}
else
{
size_t nbytes = cast(size_t) n * cast(size_t) size;
void *p = calloc(n,size);
if (!p && nbytes)
err_nomem();
return p;
}
}
}
/***************************
*/
version (Windows)
{
void util_free(void *p)
{
//dbg_printf("util_free(%p)\n",p);
static if (MEM_DEBUG)
{
mem_free(p);
}
else static if (UTIL_PH)
{
ph_free(p);
}
else
{
free(p);
}
}
}
/***************************
*/
version (Windows)
{
void *util_realloc(void *oldp,uint n,uint size)
{
static if (MEM_DEBUG)
{
//dbg_printf("util_realloc(%p,%d)\n",oldp,n * size);
return mem_realloc(oldp,n * size);
}
else static if (UTIL_PH)
{
return ph_realloc(oldp,n * size);
}
else
{
size_t nbytes = cast(size_t) n * cast(size_t) size;
void *p = realloc(oldp,nbytes);
if (!p && nbytes)
err_nomem();
return p;
}
}
}
/*****************************
*/
void *mem_malloc2(uint size)
{
return mem_malloc(size);
}