-
-
Notifications
You must be signed in to change notification settings - Fork 594
/
dt.c
527 lines (456 loc) · 11.2 KB
/
dt.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
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
// Copyright (C) 1984-1998 by Symantec
// Copyright (C) 2000-2015 by Digital Mars
// All Rights Reserved
// http://www.digitalmars.com
// Written by Walter Bright
/*
* This source file is made available for personal use
* only. The license is in backendlicense.txt
* For any other uses, please contact Digital Mars.
*/
#if !SPP
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <time.h>
#include "cc.h"
#include "oper.h"
#include "global.h"
#include "el.h"
#include "type.h"
#include "dt.h"
static char __file__[] = __FILE__; /* for tassert.h */
#include "tassert.h"
static dt_t *dt_freelist;
/**********************************************
* Allocate a data definition struct.
*/
static dt_t *dt_calloc(int dtx)
{
dt_t *dt = dt_freelist;
if (!dt)
{
const size_t n = 4096 / sizeof(dt_t);
dt_t *chunk = (dt_t *)mem_fmalloc(n * sizeof(dt_t));
for (size_t i = 0; i < n - 1; ++i)
{
chunk[i].DTnext = &chunk[i + 1];
}
chunk[n - 1].DTnext = NULL;
dt_freelist = chunk;
dt = chunk;
}
dt_freelist = dt->DTnext;
#ifdef DEBUG
memset(dt, 0xBE, sizeof(*dt));
#endif
dt->DTnext = NULL;
dt->dt = dtx;
return dt;
}
/**********************************************
* Free a data definition struct.
*/
void dt_free(dt_t *dt)
{
if (dt)
{
dt_t *dtn = dt;
while (1)
{
switch (dtn->dt)
{
case DT_abytes:
case DT_nbytes:
mem_free(dtn->DTpbytes);
break;
}
dt_t *dtnext = dtn->DTnext;
if (!dtnext)
break;
dtn = dtnext;
}
dtn->DTnext = dt_freelist;
dt_freelist = dt;
}
}
/*********************************
* Free free list.
*/
void dt_term()
{
#if 0 && TERMCODE
dt_t *dtn;
while (dt_freelist)
{ dtn = dt_freelist->DTnext;
mem_ffree(dt_freelist);
dt_freelist = dtn;
}
#endif
}
dt_t **dtend(dt_t **pdtend)
{
while (*pdtend)
pdtend = &((*pdtend)->DTnext);
return pdtend;
}
/**********************
* Construct a DT_azeros record, and return it.
* Increment dsout.
*/
dt_t **dtnzeros(dt_t **pdtend,unsigned size)
{ dt_t *dt;
//printf("dtnzeros(x%x)\n",size);
assert((long) size >= 0);
while (*pdtend)
pdtend = &((*pdtend)->DTnext);
if (size)
{ dt = dt_calloc(DT_azeros);
dt->DTazeros = size;
*pdtend = dt;
pdtend = &dt->DTnext;
#if SCPP
dsout += size;
#endif
}
return pdtend;
}
/**********************
* Construct a DTsymsize record.
*/
void dtsymsize(symbol *s)
{
symbol_debug(s);
s->Sdt = dt_calloc(DT_symsize);
}
/**********************
* Construct a DTnbytes record, and return it.
*/
dt_t ** dtnbytes(dt_t **pdtend,unsigned size,const char *ptr)
{ dt_t *dt;
while (*pdtend)
pdtend = &((*pdtend)->DTnext);
if (size)
{
if (size < DTibytesMax)
{ dt = dt_calloc(DT_ibytes);
dt->DTn = size;
memcpy(dt->DTdata,ptr,size);
}
else
{
dt = dt_calloc(DT_nbytes);
dt->DTnbytes = size;
dt->DTpbytes = (char *) MEM_PH_MALLOC(size);
memcpy(dt->DTpbytes,ptr,size);
}
*pdtend = dt;
pdtend = &dt->DTnext;
}
return pdtend;
}
/**********************
* Construct a DTabytes record, and return it.
*/
dt_t **dtabytes(dt_t **pdtend, unsigned offset, unsigned size, const char *ptr)
{
return dtabytes(pdtend, TYnptr, offset, size, ptr);
}
dt_t **dtabytes(dt_t **pdtend,tym_t ty, unsigned offset, unsigned size, const char *ptr)
{ dt_t *dt;
while (*pdtend)
pdtend = &((*pdtend)->DTnext);
dt = dt_calloc(DT_abytes);
dt->DTnbytes = size;
dt->DTpbytes = (char *) MEM_PH_MALLOC(size);
dt->Dty = ty;
dt->DTabytes = offset;
memcpy(dt->DTpbytes,ptr,size);
*pdtend = dt;
pdtend = &dt->DTnext;
return pdtend;
}
/**********************
* Construct a DTibytes record, and return it.
*/
dt_t ** dtdword(dt_t **pdtend, int value)
{ dt_t *dt;
while (*pdtend)
pdtend = &((*pdtend)->DTnext);
dt = dt_calloc(DT_ibytes);
dt->DTn = 4;
union { char* cp; int* lp; } u;
u.cp = dt->DTdata;
*u.lp = value;
*pdtend = dt;
pdtend = &dt->DTnext;
return pdtend;
}
dt_t ** dtsize_t(dt_t **pdtend, unsigned long long value)
{ dt_t *dt;
while (*pdtend)
pdtend = &((*pdtend)->DTnext);
dt = dt_calloc(DT_ibytes);
dt->DTn = NPTRSIZE;
union { char* cp; int* lp; } u;
u.cp = dt->DTdata;
*u.lp = value;
if (NPTRSIZE == 8)
u.lp[1] = value >> 32;
*pdtend = dt;
pdtend = &dt->DTnext;
return pdtend;
}
/**********************
* Concatenate two dt_t's.
*/
dt_t ** dtcat(dt_t **pdtend,dt_t *dt)
{
while (*pdtend)
pdtend = &((*pdtend)->DTnext);
*pdtend = dt;
pdtend = &dt->DTnext;
return pdtend;
}
/**********************
* Construct a DTcoff record, and return it.
*/
dt_t ** dtcoff(dt_t **pdtend,unsigned offset)
{ dt_t *dt;
while (*pdtend)
pdtend = &((*pdtend)->DTnext);
dt = dt_calloc(DT_coff);
#if TARGET_SEGMENTED
dt->Dty = TYcptr;
#else
dt->Dty = TYnptr;
#endif
dt->DToffset = offset;
*pdtend = dt;
pdtend = &dt->DTnext;
return pdtend;
}
/**********************
* Construct a DTxoff record, and return it.
*/
dt_t ** dtxoff(dt_t **pdtend,symbol *s,unsigned offset)
{
return dtxoff(pdtend, s, offset, TYnptr);
}
dt_t ** dtxoff(dt_t **pdtend,symbol *s,unsigned offset,tym_t ty)
{ dt_t *dt;
symbol_debug(s);
while (*pdtend)
pdtend = &((*pdtend)->DTnext);
dt = dt_calloc(DT_xoff);
dt->DTsym = s;
dt->DToffset = offset;
dt->Dty = ty;
*pdtend = dt;
pdtend = &dt->DTnext;
return pdtend;
}
/*************************************
* Create a reference to another dt.
*/
dt_t **dtdtoff(dt_t **pdtend, dt_t *dt, unsigned offset)
{
type *t = type_alloc(TYint);
t->Tcount++;
Symbol *s = symbol_calloc("internal");
s->Sclass = SCstatic;
s->Sfl = FLextern;
s->Sflags |= SFLnodebug;
s->Stype = t;
s->Sdt = dt;
slist_add(s);
outdata(s);
return dtxoff(pdtend, s, offset);
}
/**************************************
* Repeat a list of dt_t's count times.
*/
dt_t **dtrepeat(dt_t **pdtend, dt_t *dt, size_t count)
{
unsigned size = dt_size(dt);
if (dtallzeros(dt))
return dtnzeros(pdtend, size * count);
while (*pdtend)
pdtend = &((*pdtend)->DTnext);
if (count == 0)
return pdtend;
if (dtpointers(dt))
{
dt_t *dtp = NULL;
dt_t **pdt = &dtp;
for (size_t i = 0; i < count; ++i)
{
for (dt_t *dtn = dt; dtn; dtn = dtn->DTnext)
{
dt_t *dtx = dt_calloc(dtn->dt);
*dtx = *dtn;
dtx->DTnext = NULL;
switch (dtx->dt)
{
case DT_abytes:
case DT_nbytes:
dtx->DTpbytes = (char *) MEM_PH_MALLOC(dtx->DTnbytes);
memcpy(dtx->DTpbytes, dtn->DTpbytes, dtx->DTnbytes);
break;
}
*pdt = dtx;
pdt = &dtx->DTnext;
}
}
*pdtend = dtp;
return pdt;
}
char *p = (char *)MEM_PH_MALLOC(size * count);
size_t offset = 0;
if (count)
{
for (dt_t *dtn = dt; dtn; dtn = dtn->DTnext)
{
switch (dtn->dt)
{
case DT_nbytes:
memcpy(p + offset, dtn->DTpbytes, dtn->DTnbytes);
offset += dtn->DTnbytes;
break;
case DT_ibytes:
memcpy(p + offset, dtn->DTdata, dtn->DTn);
offset += dtn->DTn;
break;
case DT_symsize:
case DT_azeros:
memset(p + offset, 0, dtn->DTazeros);
offset += dtn->DTazeros;
break;
default:
#ifdef DEBUG
dbg_printf("dt = %p, dt = %d\n",dt,dt->dt);
#endif
assert(0);
}
}
assert(offset == size);
}
for (size_t i = 1; i < count; ++i)
{
memcpy(p + offset, p, size);
offset += size;
}
dt_t *dtx = dt_calloc(DT_nbytes);
dtx->DTnbytes = size * count;
dtx->DTpbytes = p;
*pdtend = dtx;
pdtend = &dtx->DTnext;
return pdtend;
}
/**************************
* 'Optimize' a list of dt_t's.
* (Try to collapse it into one DT_azeros object.)
*/
void dt_optimize(dt_t *dt)
{ dt_t *dtn;
if (dt)
{ for (; 1; dt = dtn)
{
dtn = dt->DTnext;
if (!dtn)
break;
if (dt->dt == DT_azeros)
{
if (dtn->dt == DT_azeros)
{
dt->DTazeros += dtn->DTazeros;
dt->dt = DT_azeros;
dt->DTnext = dtn->DTnext;
dtn->DTnext = NULL;
dt_free(dtn);
dtn = dt;
}
}
}
}
}
/**************************
* Make a common block for s.
*/
void init_common(symbol *s)
{
//printf("init_common('%s')\n", s->Sident);
dtnzeros(&s->Sdt,type_size(s->Stype));
if (s->Sdt)
s->Sdt->dt = DT_common;
}
/**********************************
* Compute size of a dt
*/
unsigned dt_size(const dt_t *dtstart)
{
unsigned datasize = 0;
for (const dt_t *dt = dtstart; dt; dt = dt->DTnext)
{
switch (dt->dt)
{ case DT_abytes:
datasize += size(dt->Dty);
break;
case DT_ibytes:
datasize += dt->DTn;
break;
case DT_nbytes:
datasize += dt->DTnbytes;
break;
case DT_symsize:
case DT_azeros:
datasize += dt->DTazeros;
break;
case DT_common:
break;
case DT_xoff:
case DT_coff:
datasize += size(dt->Dty);
break;
default:
#ifdef DEBUG
dbg_printf("dt = %p, dt = %d\n",dt,dt->dt);
#endif
assert(0);
}
}
return datasize;
}
/************************************
* Return true if dt is all zeros.
*/
bool dtallzeros(const dt_t *dt)
{
return dt->dt == DT_azeros && !dt->DTnext;
}
/************************************
* Return true if dt contains pointers (requires relocations).
*/
bool dtpointers(const dt_t *dtstart)
{
for (const dt_t *dt = dtstart; dt; dt = dt->DTnext)
{
switch (dt->dt)
{
case DT_abytes:
case DT_xoff:
case DT_coff:
return true;
}
}
return false;
}
/***********************************
* Turn DT_azeros into DTcommon
*/
void dt2common(dt_t **pdt)
{
assert((*pdt)->dt == DT_azeros);
(*pdt)->dt = DT_common;
}
#endif /* !SPP */