Skip to content

Latest commit

 

History

History
1594 lines (1333 loc) · 42.6 KB

mojoshader_preprocessor.c

File metadata and controls

1594 lines (1333 loc) · 42.6 KB
 
1
2
3
4
5
6
7
8
9
10
11
12
/**
* MojoShader; generate shader programs from bytecode of compiled
* Direct3D shaders.
*
* Please see the file LICENSE.txt in the source's root directory.
*
* This file written by Ryan C. Gordon.
*/
#define __MOJOSHADER_INTERNAL__ 1
#include "mojoshader_internal.h"
Feb 12, 2009
Feb 12, 2009
13
14
15
16
17
18
#if DEBUG_PREPROCESSOR
#define print_debug_token(token, len, val) \
MOJOSHADER_print_debug_token("PREPROCESSOR", token, len, val)
#else
#define print_debug_token(token, len, val)
#endif
Feb 10, 2009
Feb 10, 2009
19
Feb 15, 2009
Feb 15, 2009
20
#if DEBUG_LEXER
Feb 18, 2009
Feb 18, 2009
21
static Token debug_preprocessor_lexer(IncludeState *s)
Feb 15, 2009
Feb 15, 2009
22
{
Feb 18, 2009
Feb 18, 2009
23
const Token retval = preprocessor_lexer(s);
Feb 18, 2009
Feb 18, 2009
24
MOJOSHADER_print_debug_token("LEXER", s->token, s->tokenlen, retval);
Feb 15, 2009
Feb 15, 2009
25
return retval;
Feb 18, 2009
Feb 18, 2009
26
27
} // debug_preprocessor_lexer
#define preprocessor_lexer(s) debug_preprocessor_lexer(s)
Feb 15, 2009
Feb 15, 2009
28
29
#endif
Feb 20, 2009
Feb 20, 2009
30
typedef struct Define
Feb 19, 2009
Feb 19, 2009
32
33
const char *identifier;
const char *definition;
Feb 20, 2009
Feb 20, 2009
34
35
struct Define *next;
} Define;
Feb 14, 2009
Feb 14, 2009
37
Feb 13, 2009
Feb 13, 2009
38
39
40
41
42
43
44
45
// Simple linked list to cache source filenames, so we don't have to copy
// the same string over and over for each opcode.
typedef struct FilenameCache
{
char *filename;
struct FilenameCache *next;
} FilenameCache;
46
47
48
49
typedef struct Context
{
int isfail;
int out_of_memory;
Feb 13, 2009
Feb 13, 2009
50
char failstr[256];
Feb 14, 2009
Feb 14, 2009
51
Conditional *conditional_pool;
52
IncludeState *include_stack;
Feb 18, 2009
Feb 18, 2009
53
IncludeState *include_pool;
Feb 20, 2009
Feb 20, 2009
54
55
Define *define_hashtable[256];
Define *define_pool;
Feb 13, 2009
Feb 13, 2009
56
FilenameCache *filename_cache;
57
58
59
60
61
62
63
64
65
66
67
68
MOJOSHADER_includeOpen open_callback;
MOJOSHADER_includeClose close_callback;
MOJOSHADER_malloc malloc;
MOJOSHADER_free free;
void *malloc_data;
} Context;
// Convenience functions for allocators...
static inline void out_of_memory(Context *ctx)
{
Feb 13, 2009
Feb 13, 2009
69
ctx->out_of_memory = 1;
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
} // out_of_memory
static inline void *Malloc(Context *ctx, const size_t len)
{
void *retval = ctx->malloc((int) len, ctx->malloc_data);
if (retval == NULL)
out_of_memory(ctx);
return retval;
} // Malloc
static inline void Free(Context *ctx, void *ptr)
{
if (ptr != NULL) // check for NULL in case of dumb free() impl.
ctx->free(ptr, ctx->malloc_data);
} // Free
static inline char *StrDup(Context *ctx, const char *str)
{
char *retval = (char *) Malloc(ctx, strlen(str) + 1);
if (retval != NULL)
strcpy(retval, str);
return retval;
} // StrDup
static void failf(Context *ctx, const char *fmt, ...) ISPRINTF(2,3);
static void failf(Context *ctx, const char *fmt, ...)
{
ctx->isfail = 1;
va_list ap;
va_start(ap, fmt);
Feb 13, 2009
Feb 13, 2009
100
vsnprintf(ctx->failstr, sizeof (ctx->failstr), fmt, ap);
101
102
103
104
105
106
107
108
109
va_end(ap);
} // failf
static inline void fail(Context *ctx, const char *reason)
{
failf(ctx, "%s", reason);
} // fail
Feb 12, 2009
Feb 12, 2009
110
111
112
113
114
115
116
117
118
119
120
#if DEBUG_TOKENIZER
void MOJOSHADER_print_debug_token(const char *subsystem, const char *token,
const unsigned int tokenlen,
const Token tokenval)
{
printf("%s TOKEN: \"", subsystem);
unsigned int i;
for (i = 0; i < tokenlen; i++)
{
if (token[i] == '\n')
printf("\\n");
Feb 15, 2009
Feb 15, 2009
121
122
else if (token[i] == '\\')
printf("\\\\");
Feb 12, 2009
Feb 12, 2009
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
else
printf("%c", token[i]);
} // for
printf("\" (");
switch (tokenval)
{
#define TOKENCASE(x) case x: printf("%s", #x); break
TOKENCASE(TOKEN_UNKNOWN);
TOKENCASE(TOKEN_IDENTIFIER);
TOKENCASE(TOKEN_INT_LITERAL);
TOKENCASE(TOKEN_FLOAT_LITERAL);
TOKENCASE(TOKEN_STRING_LITERAL);
TOKENCASE(TOKEN_ADDASSIGN);
TOKENCASE(TOKEN_SUBASSIGN);
TOKENCASE(TOKEN_MULTASSIGN);
TOKENCASE(TOKEN_DIVASSIGN);
TOKENCASE(TOKEN_MODASSIGN);
TOKENCASE(TOKEN_XORASSIGN);
TOKENCASE(TOKEN_ANDASSIGN);
TOKENCASE(TOKEN_ORASSIGN);
TOKENCASE(TOKEN_INCREMENT);
TOKENCASE(TOKEN_DECREMENT);
TOKENCASE(TOKEN_RSHIFT);
TOKENCASE(TOKEN_LSHIFT);
TOKENCASE(TOKEN_ANDAND);
TOKENCASE(TOKEN_OROR);
TOKENCASE(TOKEN_LEQ);
TOKENCASE(TOKEN_GEQ);
TOKENCASE(TOKEN_EQL);
TOKENCASE(TOKEN_NEQ);
TOKENCASE(TOKEN_HASHHASH);
TOKENCASE(TOKEN_PP_INCLUDE);
TOKENCASE(TOKEN_PP_LINE);
TOKENCASE(TOKEN_PP_DEFINE);
TOKENCASE(TOKEN_PP_UNDEF);
TOKENCASE(TOKEN_PP_IF);
TOKENCASE(TOKEN_PP_IFDEF);
TOKENCASE(TOKEN_PP_IFNDEF);
TOKENCASE(TOKEN_PP_ELSE);
TOKENCASE(TOKEN_PP_ELIF);
TOKENCASE(TOKEN_PP_ENDIF);
TOKENCASE(TOKEN_PP_ERROR);
Feb 13, 2009
Feb 13, 2009
165
166
TOKENCASE(TOKEN_INCOMPLETE_COMMENT);
TOKENCASE(TOKEN_BAD_CHARS);
Feb 12, 2009
Feb 12, 2009
167
TOKENCASE(TOKEN_EOI);
Feb 13, 2009
Feb 13, 2009
168
TOKENCASE(TOKEN_PREPROCESSING_ERROR);
Feb 12, 2009
Feb 12, 2009
169
170
171
172
173
174
#undef TOKENCASE
case ((Token) '\n'):
printf("'\\n'");
break;
Feb 15, 2009
Feb 15, 2009
175
176
177
178
case ((Token) '\\'):
printf("'\\\\'");
break;
Feb 12, 2009
Feb 12, 2009
179
180
181
182
183
184
185
186
187
188
default:
assert(((int)tokenval) < 256);
printf("'%c'", (char) tokenval);
break;
} // switch
printf(")\n");
} // MOJOSHADER_print_debug_token
#endif
Feb 13, 2009
Feb 13, 2009
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
#if !MOJOSHADER_FORCE_INCLUDE_CALLBACKS
// !!! FIXME: most of these _MSC_VER should probably be _WINDOWS?
#ifdef _MSC_VER
#define WIN32_LEAN_AND_MEAN 1
#include <windows.h> // GL headers need this for WINGDIAPI definition.
#else
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
#endif
int MOJOSHADER_internal_include_open(MOJOSHADER_includeType inctype,
const char *fname, const char *parent,
const char **outdata,
unsigned int *outbytes,
MOJOSHADER_malloc m, MOJOSHADER_free f,
void *d)
{
#ifdef _MSC_VER
#error Write me.
#else
struct stat statbuf;
if (stat(fname, &statbuf) == -1)
return 0;
char *data = (char *) m(statbuf.st_size, d);
if (data == NULL)
return 0;
const int fd = open(fname, O_RDONLY);
if (fd == -1)
{
f(data, d);
return 0;
} // if
if (read(fd, data, statbuf.st_size) != statbuf.st_size)
{
f(data, d);
close(fd);
return 0;
} // if
close(fd);
*outdata = data;
*outbytes = (unsigned int) statbuf.st_size;
return 1;
#endif
} // MOJOSHADER_internal_include_open
void MOJOSHADER_internal_include_close(const char *data, MOJOSHADER_malloc m,
MOJOSHADER_free f, void *d)
{
f((void *) data, d);
} // MOJOSHADER_internal_include_close
#endif // !MOJOSHADER_FORCE_INCLUDE_CALLBACKS
Feb 16, 2009
Feb 16, 2009
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
// data buffer stuff...
#define BUFFER_LEN (64 * 1024)
typedef struct BufferList
{
char buffer[BUFFER_LEN];
size_t bytes;
struct BufferList *next;
} BufferList;
typedef struct Buffer
{
size_t total_bytes;
BufferList head;
BufferList *tail;
} Buffer;
Feb 16, 2009
Feb 16, 2009
263
static void init_buffer(Buffer *buffer)
Feb 16, 2009
Feb 16, 2009
264
265
266
267
268
{
buffer->total_bytes = 0;
buffer->head.bytes = 0;
buffer->head.next = NULL;
buffer->tail = &buffer->head;
Feb 16, 2009
Feb 16, 2009
269
} // init_buffer
Feb 16, 2009
Feb 16, 2009
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
static int add_to_buffer(Buffer *buffer, const char *data,
size_t len, MOJOSHADER_malloc m, void *d)
{
buffer->total_bytes += len;
while (len > 0)
{
const size_t avail = BUFFER_LEN - buffer->tail->bytes;
const size_t cpy = (avail > len) ? len : avail;
memcpy(buffer->tail->buffer + buffer->tail->bytes, data, cpy);
len -= cpy;
data += cpy;
buffer->tail->bytes += cpy;
assert(buffer->tail->bytes <= BUFFER_LEN);
if (buffer->tail->bytes == BUFFER_LEN)
{
BufferList *item = (BufferList *) m(sizeof (BufferList), d);
if (item == NULL)
return 0;
item->bytes = 0;
item->next = NULL;
buffer->tail->next = item;
buffer->tail = item;
} // if
} // while
return 1;
} // add_to_buffer
static char *flatten_buffer(Buffer *buffer, MOJOSHADER_malloc m, void *d)
{
char *retval = m(buffer->total_bytes + 1, d);
if (retval == NULL)
return NULL;
BufferList *item = &buffer->head;
char *ptr = retval;
while (item != NULL)
{
BufferList *next = item->next;
memcpy(ptr, item->buffer, item->bytes);
ptr += item->bytes;
item = next;
} // while
*ptr = '\0';
assert(ptr == (retval + buffer->total_bytes));
return retval;
} // flatten_buffer
static void free_buffer(Buffer *buffer, MOJOSHADER_free f, void *d)
{
// head is statically allocated, so start with head.next...
BufferList *item = buffer->head.next;
while (item != NULL)
{
BufferList *next = item->next;
f(item, d);
item = next;
} // while
Feb 16, 2009
Feb 16, 2009
332
init_buffer(buffer);
Feb 16, 2009
Feb 16, 2009
333
334
335
} // free_buffer
Feb 18, 2009
Feb 18, 2009
336
// !!! FIXME: maybe use these pool magic elsewhere?
Feb 16, 2009
Feb 16, 2009
337
Feb 18, 2009
Feb 18, 2009
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
// Pool stuff...
// ugh, I hate this macro salsa.
#define FREE_POOL(type, poolname) \
static void free_##poolname##_pool(Context *ctx) { \
type *item = ctx->poolname##_pool; \
while (item != NULL) { \
type *next = item->next; \
Free(ctx, item); \
item = next; \
} \
}
#define GET_POOL(type, poolname) \
static type *get_##poolname(Context *ctx) { \
type *retval = ctx->poolname##_pool; \
if (retval != NULL) \
ctx->poolname##_pool = retval->next; \
else \
retval = (type *) Malloc(ctx, sizeof (type)); \
if (retval != NULL) \
memset(retval, '\0', sizeof (type)); \
return retval; \
}
#define PUT_POOL(type, poolname) \
static void put_##poolname(Context *ctx, type *item) { \
item->next = ctx->poolname##_pool; \
Feb 19, 2009
Feb 19, 2009
365
ctx->poolname##_pool = item; \
Feb 18, 2009
Feb 18, 2009
366
367
368
369
370
371
372
373
374
}
#define IMPLEMENT_POOL(type, poolname) \
FREE_POOL(type, poolname) \
GET_POOL(type, poolname) \
PUT_POOL(type, poolname)
IMPLEMENT_POOL(Conditional, conditional)
IMPLEMENT_POOL(IncludeState, include)
Feb 20, 2009
Feb 20, 2009
375
IMPLEMENT_POOL(Define, define)
Feb 14, 2009
Feb 14, 2009
376
Feb 13, 2009
Feb 13, 2009
377
378
379
380
381
382
// Preprocessor define hashtable stuff...
static unsigned char hash_define(const char *sym)
{
unsigned char retval = 0;
Feb 14, 2009
Feb 14, 2009
383
while (*sym)
384
385
386
387
388
retval += *(sym++);
return retval;
} // hash_define
Feb 17, 2009
Feb 17, 2009
389
static int add_define(Context *ctx, const char *sym, const char *val, int copy)
390
391
392
393
{
char *identifier = NULL;
char *definition = NULL;
const unsigned char hash = hash_define(sym);
Feb 20, 2009
Feb 20, 2009
394
Define *bucket = ctx->define_hashtable[hash];
395
396
while (bucket)
{
Feb 19, 2009
Feb 19, 2009
397
if (strcmp(bucket->identifier, sym) == 0)
398
399
400
401
402
403
404
{
failf(ctx, "'%s' already defined", sym);
return 0;
} // if
bucket = bucket->next;
} // while
Feb 18, 2009
Feb 18, 2009
405
bucket = get_define(ctx);
406
407
408
if (bucket == NULL)
return 0;
Feb 18, 2009
Feb 18, 2009
409
identifier = StrDup(ctx, sym);
Feb 17, 2009
Feb 17, 2009
410
if (identifier == NULL)
Feb 18, 2009
Feb 18, 2009
412
put_define(ctx, bucket);
413
414
return 0;
} // if
Feb 17, 2009
Feb 17, 2009
415
416
if (!copy)
Feb 19, 2009
Feb 19, 2009
417
bucket->definition = val;
Feb 17, 2009
Feb 17, 2009
418
419
else
{
Feb 18, 2009
Feb 18, 2009
420
definition = StrDup(ctx, val);
Feb 17, 2009
Feb 17, 2009
421
422
423
if (definition == NULL)
{
Free(ctx, identifier);
Feb 18, 2009
Feb 18, 2009
424
put_define(ctx, bucket);
Feb 17, 2009
Feb 17, 2009
425
426
return 0;
} // if
Feb 19, 2009
Feb 19, 2009
427
bucket->definition = definition;
Feb 17, 2009
Feb 17, 2009
428
429
} // if
Feb 19, 2009
Feb 19, 2009
430
bucket->identifier = identifier;
431
432
433
434
435
436
437
438
439
bucket->next = ctx->define_hashtable[hash];
ctx->define_hashtable[hash] = bucket;
return 1;
} // add_define
static int remove_define(Context *ctx, const char *sym)
{
const unsigned char hash = hash_define(sym);
Feb 20, 2009
Feb 20, 2009
440
441
Define *bucket = ctx->define_hashtable[hash];
Define *prev = NULL;
442
443
while (bucket)
{
Feb 19, 2009
Feb 19, 2009
444
if (strcmp(bucket->identifier, sym) == 0)
445
446
447
448
449
{
if (prev == NULL)
ctx->define_hashtable[hash] = bucket->next;
else
prev->next = bucket->next;
Feb 19, 2009
Feb 19, 2009
450
451
Free(ctx, (void *) bucket->identifier);
Free(ctx, (void *) bucket->definition);
Feb 18, 2009
Feb 18, 2009
452
put_define(ctx, bucket);
453
454
455
456
457
458
459
460
461
462
463
464
465
return 1;
} // if
prev = bucket;
bucket = bucket->next;
} // while
return 0;
} // remove_define
static const char *find_define(Context *ctx, const char *sym)
{
const unsigned char hash = hash_define(sym);
Feb 20, 2009
Feb 20, 2009
466
Define *bucket = ctx->define_hashtable[hash];
467
468
while (bucket)
{
Feb 19, 2009
Feb 19, 2009
469
470
if (strcmp(bucket->identifier, sym) == 0)
return bucket->definition;
471
472
473
474
475
476
bucket = bucket->next;
} // while
return NULL;
} // find_define
Feb 18, 2009
Feb 18, 2009
477
static void put_all_defines(Context *ctx)
478
479
480
481
{
int i;
for (i = 0; i < STATICARRAYLEN(ctx->define_hashtable); i++)
{
Feb 20, 2009
Feb 20, 2009
482
Define *bucket = ctx->define_hashtable[i];
483
484
485
ctx->define_hashtable[i] = NULL;
while (bucket)
{
Feb 20, 2009
Feb 20, 2009
486
Define *next = bucket->next;
Feb 19, 2009
Feb 19, 2009
487
488
Free(ctx, (void *) bucket->identifier);
Free(ctx, (void *) bucket->definition);
Feb 18, 2009
Feb 18, 2009
489
put_define(ctx, bucket);
490
491
492
bucket = next;
} // while
} // for
Feb 20, 2009
Feb 20, 2009
493
} // put_all_defines
Feb 13, 2009
Feb 13, 2009
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
// filename cache stuff...
static const char *cache_filename(Context *ctx, const char *fname)
{
if (fname == NULL)
return NULL;
// !!! FIXME: this could be optimized into a hash table, but oh well.
FilenameCache *item = ctx->filename_cache;
while (item != NULL)
{
if (strcmp(item->filename, fname) == 0)
return item->filename;
item = item->next;
} // while
// new cache item.
item = (FilenameCache *) Malloc(ctx, sizeof (FilenameCache));
if (item == NULL)
return NULL;
item->filename = StrDup(ctx, fname);
if (item->filename == NULL)
{
Free(ctx, item);
return NULL;
} // if
item->next = ctx->filename_cache;
ctx->filename_cache = item;
return item->filename;
} // cache_filename
static void free_filename_cache(Context *ctx)
{
FilenameCache *item = ctx->filename_cache;
while (item != NULL)
{
FilenameCache *next = item->next;
Free(ctx, item->filename);
Free(ctx, item);
item = next;
} // while
} // free_filename_cache
544
static int push_source(Context *ctx, const char *fname, const char *source,
Feb 19, 2009
Feb 19, 2009
545
546
unsigned int srclen, unsigned int linenum,
MOJOSHADER_includeClose close_callback)
Feb 18, 2009
Feb 18, 2009
548
IncludeState *state = get_include(ctx);
549
550
551
if (state == NULL)
return 0;
Feb 10, 2009
Feb 10, 2009
552
if (fname != NULL)
Feb 13, 2009
Feb 13, 2009
554
state->filename = cache_filename(ctx, fname);
Feb 10, 2009
Feb 10, 2009
555
556
if (state->filename == NULL)
{
Feb 18, 2009
Feb 18, 2009
557
put_include(ctx, state);
Feb 10, 2009
Feb 10, 2009
558
559
return 0;
} // if
560
561
} // if
Feb 19, 2009
Feb 19, 2009
562
state->close_callback = close_callback;
563
564
565
state->source_base = source;
state->source = source;
state->token = source;
Feb 17, 2009
Feb 17, 2009
566
state->orig_length = srclen;
567
state->bytes_left = srclen;
Feb 17, 2009
Feb 17, 2009
568
state->line = linenum;
569
570
571
572
573
574
575
576
577
578
579
580
581
582
state->next = ctx->include_stack;
ctx->include_stack = state;
return 1;
} // push_source
static void pop_source(Context *ctx)
{
IncludeState *state = ctx->include_stack;
if (state == NULL)
return;
Feb 19, 2009
Feb 19, 2009
583
if (state->close_callback)
Feb 19, 2009
Feb 19, 2009
585
586
state->close_callback(state->source_base, ctx->malloc,
ctx->free, ctx->malloc_data);
587
588
} // if
Feb 13, 2009
Feb 13, 2009
589
590
// state->filename is a pointer to the filename cache; don't free it here!
Feb 20, 2009
Feb 20, 2009
591
592
593
594
595
596
597
Conditional *cond = state->conditional_stack;
while (cond)
{
Conditional *next = cond->next;
put_conditional(ctx, cond);
cond = next;
} // while
Feb 14, 2009
Feb 14, 2009
598
599
ctx->include_stack = state->next;
Feb 18, 2009
Feb 18, 2009
600
put_include(ctx, state);
601
602
603
} // pop_source
Feb 19, 2009
Feb 19, 2009
604
605
606
607
608
609
610
static void close_define_include(const char *data, MOJOSHADER_malloc m,
MOJOSHADER_free f, void *d)
{
f((void *) data, d);
} // close_define_include
611
612
613
614
Preprocessor *preprocessor_start(const char *fname, const char *source,
unsigned int sourcelen,
MOJOSHADER_includeOpen open_callback,
MOJOSHADER_includeClose close_callback,
Feb 19, 2009
Feb 19, 2009
615
const MOJOSHADER_preprocessorDefine *defines,
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
unsigned int define_count,
MOJOSHADER_malloc m, MOJOSHADER_free f, void *d)
{
int okay = 1;
int i = 0;
// the preprocessor is internal-only, so we verify all these are != NULL.
assert(m != NULL);
assert(f != NULL);
assert(open_callback != NULL);
assert(close_callback != NULL);
Context *ctx = (Context *) m(sizeof (Context), d);
if (ctx == NULL)
return 0;
memset(ctx, '\0', sizeof (Context));
ctx->malloc = m;
ctx->free = f;
ctx->malloc_data = d;
ctx->open_callback = open_callback;
ctx->close_callback = close_callback;
Feb 19, 2009
Feb 19, 2009
639
640
641
642
// let the usual preprocessor parser sort these out.
char *define_include = NULL;
unsigned int define_include_len = 0;
if (define_count > 0)
Feb 19, 2009
Feb 19, 2009
644
for (i = 0; i < define_count; i++)
Feb 19, 2009
Feb 19, 2009
646
647
define_include_len += strlen(defines[i].identifier);
define_include_len += strlen(defines[i].definition);
Feb 19, 2009
Feb 19, 2009
648
649
650
651
652
653
define_include_len += 10; // "#define<space><space><newline>"
} // for
define_include_len++; // for null terminator.
define_include = (char *) Malloc(ctx, define_include_len);
if (define_include == NULL)
654
okay = 0;
Feb 19, 2009
Feb 19, 2009
655
656
657
658
659
else
{
char *ptr = define_include;
for (i = 0; i < define_count; i++)
{
Feb 19, 2009
Feb 19, 2009
660
661
ptr += sprintf(ptr, "#define %s %s\n", defines[i].identifier,
defines[i].definition);
Feb 19, 2009
Feb 19, 2009
662
663
664
} // for
} // else
} // if
Feb 19, 2009
Feb 19, 2009
666
if ((okay) && (!push_source(ctx, fname, source, sourcelen, 1, NULL)))
667
668
okay = 0;
Feb 19, 2009
Feb 19, 2009
669
670
671
672
673
674
if ((okay) && (define_include != NULL))
{
okay = push_source(ctx, "<predefined macros>", define_include,
define_include_len, 1, close_define_include);
} // if
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
if (!okay)
{
preprocessor_end((Preprocessor *) ctx);
return NULL;
} // if
return (Preprocessor *) ctx;
} // preprocessor_start
void preprocessor_end(Preprocessor *_ctx)
{
Context *ctx = (Context *) _ctx;
if (ctx == NULL)
return;
while (ctx->include_stack != NULL)
pop_source(ctx);
Feb 18, 2009
Feb 18, 2009
694
695
put_all_defines(ctx);
Feb 13, 2009
Feb 13, 2009
696
free_filename_cache(ctx);
Feb 18, 2009
Feb 18, 2009
697
free_define_pool(ctx);
Feb 14, 2009
Feb 14, 2009
698
free_conditional_pool(ctx);
Feb 18, 2009
Feb 18, 2009
699
free_include_pool(ctx);
700
701
702
703
704
705
706
707
708
709
710
711
Free(ctx, ctx);
} // preprocessor_end
int preprocessor_outofmemory(Preprocessor *_ctx)
{
Context *ctx = (Context *) _ctx;
return ctx->out_of_memory;
} // preprocessor_outofmemory
Feb 18, 2009
Feb 18, 2009
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
static inline void pushback(IncludeState *state)
{
#if DEBUG_PREPROCESSOR
printf("PREPROCESSOR PUSHBACK\n");
#endif
assert(!state->pushedback);
state->pushedback = 1;
} // pushback
static Token lexer(IncludeState *state)
{
if (!state->pushedback)
return preprocessor_lexer(state);
state->pushedback = 0;
return state->tokenval;
} // lexer
Feb 17, 2009
Feb 17, 2009
731
// !!! FIXME: parsing fails on preprocessor directives should skip rest of line.
Feb 14, 2009
Feb 14, 2009
732
733
static int require_newline(IncludeState *state)
{
Feb 18, 2009
Feb 18, 2009
734
735
const Token token = lexer(state);
pushback(state); // rewind no matter what.
Feb 18, 2009
Feb 18, 2009
736
return ( (token == TOKEN_INCOMPLETE_COMMENT) || // call it an eol.
Feb 18, 2009
Feb 18, 2009
737
(token == ((Token) '\n')) || (token == TOKEN_EOI) );
Feb 14, 2009
Feb 14, 2009
738
739
740
} // require_newline
Feb 13, 2009
Feb 13, 2009
741
742
743
static void handle_pp_include(Context *ctx)
{
IncludeState *state = ctx->include_stack;
Feb 18, 2009
Feb 18, 2009
744
Token token = lexer(state);
Feb 13, 2009
Feb 13, 2009
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
MOJOSHADER_includeType incltype;
char *filename = NULL;
int bogus = 0;
if (token == TOKEN_STRING_LITERAL)
incltype = MOJOSHADER_INCLUDETYPE_LOCAL;
else if (token == ((Token) '<'))
{
incltype = MOJOSHADER_INCLUDETYPE_SYSTEM;
// can't use lexer, since every byte between the < > pair is
// considered part of the filename. :/
while (!bogus)
{
if ( !(bogus = (state->bytes_left == 0)) )
{
const char ch = *state->source;
if ( !(bogus = ((ch == '\r') || (ch == '\n'))) )
{
state->source++;
state->bytes_left--;
if (ch == '>')
break;
} // if
} // if
} // while
} // else if
else
{
bogus = 1;
} // else
if (!bogus)
{
state->token++; // skip '<' or '\"'...
const unsigned int len = ((unsigned int) (state->source-state->token));
filename = (char *) alloca(len);
memcpy(filename, state->token, len-1);
filename[len-1] = '\0';
Feb 14, 2009
Feb 14, 2009
784
bogus = !require_newline(state);
Feb 13, 2009
Feb 13, 2009
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
} // if
if (bogus)
{
fail(ctx, "Invalid #include directive");
return;
} // else
const char *newdata = NULL;
unsigned int newbytes = 0;
if (!ctx->open_callback(incltype, filename, state->source_base,
&newdata, &newbytes, ctx->malloc,
ctx->free, ctx->malloc_data))
{
fail(ctx, "Include callback failed"); // !!! FIXME: better error
return;
} // if
Feb 19, 2009
Feb 19, 2009
803
if (!push_source(ctx, filename, newdata, newbytes, 1, ctx->close_callback))
Feb 13, 2009
Feb 13, 2009
804
805
806
807
808
809
810
{
assert(ctx->out_of_memory);
ctx->close_callback(newdata, ctx->malloc, ctx->free, ctx->malloc_data);
} // if
} // handle_pp_include
Feb 14, 2009
Feb 14, 2009
811
812
813
814
815
816
817
static void handle_pp_line(Context *ctx)
{
IncludeState *state = ctx->include_stack;
char *filename = NULL;
int linenum = 0;
int bogus = 0;
Feb 18, 2009
Feb 18, 2009
818
if (lexer(state) != TOKEN_INT_LITERAL)
Feb 14, 2009
Feb 14, 2009
819
820
821
bogus = 1;
else
{
Feb 18, 2009
Feb 18, 2009
822
823
824
char *buf = (char *) alloca(state->tokenlen+1);
memcpy(buf, state->token, state->tokenlen);
buf[state->tokenlen] = '\0';
Feb 14, 2009
Feb 14, 2009
825
826
827
828
linenum = atoi(buf);
} // else
if (!bogus)
Feb 18, 2009
Feb 18, 2009
829
bogus = (lexer(state) != TOKEN_STRING_LITERAL);
Feb 14, 2009
Feb 14, 2009
830
831
832
833
if (!bogus)
{
state->token++; // skip '\"'...
Feb 18, 2009
Feb 18, 2009
834
835
836
filename = (char *) alloca(state->tokenlen);
memcpy(filename, state->token, state->tokenlen-1);
filename[state->tokenlen-1] = '\0';
Feb 14, 2009
Feb 14, 2009
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
bogus = !require_newline(state);
} // if
if (bogus)
{
fail(ctx, "Invalid #line directive");
return;
} // if
const char *cached = cache_filename(ctx, filename);
assert((cached != NULL) || (ctx->out_of_memory));
state->filename = cached;
state->line = linenum;
} // handle_pp_line
Feb 13, 2009
Feb 13, 2009
853
854
855
static void handle_pp_error(Context *ctx)
{
IncludeState *state = ctx->include_stack;
Feb 17, 2009
Feb 17, 2009
856
857
858
char *ptr = ctx->failstr;
int avail = sizeof (ctx->failstr) - 1;
int cpy = 0;
Feb 13, 2009
Feb 13, 2009
859
860
int done = 0;
Feb 17, 2009
Feb 17, 2009
861
862
863
864
865
866
867
const char *prefix = "#error";
const size_t prefixlen = strlen(prefix);
strcpy(ctx->failstr, prefix);
avail -= prefixlen;
ptr += prefixlen;
state->report_whitespace = 1;
Feb 13, 2009
Feb 13, 2009
868
869
while (!done)
{
Feb 18, 2009
Feb 18, 2009
870
const Token token = lexer(state);
Feb 13, 2009
Feb 13, 2009
871
872
873
switch (token)
{
case ((Token) '\n'):
Feb 14, 2009
Feb 14, 2009
874
875
876
state->line--; // make sure error is on the right line.
// fall through!
case TOKEN_INCOMPLETE_COMMENT:
Feb 13, 2009
Feb 13, 2009
877
case TOKEN_EOI:
Feb 18, 2009
Feb 18, 2009
878
pushback(state); // move back so we catch this later.
Feb 13, 2009
Feb 13, 2009
879
880
881
done = 1;
break;
Feb 17, 2009
Feb 17, 2009
882
883
884
885
886
887
888
case ' ':
if (!avail)
break;
*(ptr++) = ' ';
avail--;
break;
Feb 13, 2009
Feb 13, 2009
889
default:
Feb 18, 2009
Feb 18, 2009
890
cpy = Min(avail, (int) state->tokenlen);
Feb 17, 2009
Feb 17, 2009
891
892
893
894
if (cpy)
memcpy(ptr, state->token, cpy);
ptr += cpy;
avail -= cpy;
Feb 13, 2009
Feb 13, 2009
895
896
897
898
break;
} // switch
} // while
Feb 17, 2009
Feb 17, 2009
899
900
*ptr = '\0';
state->report_whitespace = 0;
Feb 13, 2009
Feb 13, 2009
901
902
903
904
ctx->isfail = 1;
} // handle_pp_error
Feb 17, 2009
Feb 17, 2009
905
906
907
908
static void handle_pp_define(Context *ctx)
{
IncludeState *state = ctx->include_stack;
Feb 18, 2009
Feb 18, 2009
909
if (lexer(state) != TOKEN_IDENTIFIER)
Feb 17, 2009
Feb 17, 2009
910
911
912
913
914
915
916
917
{
fail(ctx, "Macro names must be indentifiers");
return;
} // if
MOJOSHADER_malloc m = ctx->malloc;
void *d = ctx->malloc_data;
const char space = ' ';
Feb 18, 2009
Feb 18, 2009
918
919
920
char *sym = (char *) alloca(state->tokenlen+1);
memcpy(sym, state->token, state->tokenlen);
sym[state->tokenlen] = '\0';
Feb 17, 2009
Feb 17, 2009
921
922
923
924
925
926
927
928
Buffer buffer;
init_buffer(&buffer);
int done = 0;
state->report_whitespace = 1;
while ((!done) && (!ctx->out_of_memory))
{
Feb 18, 2009
Feb 18, 2009
929
const Token token = lexer(state);
Feb 17, 2009
Feb 17, 2009
930
931
932
933
switch (token)
{
case TOKEN_INCOMPLETE_COMMENT:
case TOKEN_EOI:
Feb 18, 2009
Feb 18, 2009
934
pushback(state); // move back so we catch this later.
Feb 17, 2009
Feb 17, 2009
935
936
937
938
939
940
// fall through!
case ((Token) '\n'):
done = 1;
break;
case ((Token) ' '): // may not actually point to ' '.
Feb 17, 2009
Feb 17, 2009
941
942
943
944
945
if (buffer.total_bytes > 0)
{
if (!add_to_buffer(&buffer, &space, 1, m, d))
ctx->out_of_memory = 1;
} // if
Feb 17, 2009
Feb 17, 2009
946
947
948
break;
default:
Feb 18, 2009
Feb 18, 2009
949
if (!add_to_buffer(&buffer,state->token,state->tokenlen,m,d))
Feb 17, 2009
Feb 17, 2009
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
ctx->out_of_memory = 1;
break;
} // switch
} // while
state->report_whitespace = 0;
char *definition = NULL;
if (!ctx->out_of_memory)
{
definition = flatten_buffer(&buffer, m, d);
ctx->out_of_memory = (definition == NULL);
} // if
free_buffer(&buffer, ctx->free, d);
if (ctx->out_of_memory)
return;
assert(done);
Feb 19, 2009
Feb 19, 2009
969
970
if (!add_define(ctx, sym, definition, 0))
Free(ctx, definition);
Feb 17, 2009
Feb 17, 2009
971
972
973
} // handle_pp_define
Feb 14, 2009
Feb 14, 2009
974
975
976
977
static void handle_pp_undef(Context *ctx)
{
IncludeState *state = ctx->include_stack;
Feb 18, 2009
Feb 18, 2009
978
if (lexer(state) != TOKEN_IDENTIFIER)
Feb 14, 2009
Feb 14, 2009
979
980
981
982
983
{
fail(ctx, "Macro names must be indentifiers");
return;
} // if
Feb 18, 2009
Feb 18, 2009
984
985
986
char *sym = (char *) alloca(state->tokenlen+1);
memcpy(sym, state->token, state->tokenlen);
sym[state->tokenlen] = '\0';
Feb 14, 2009
Feb 14, 2009
987
988
989
990
991
992
993
994
995
996
997
if (!require_newline(state))
{
fail(ctx, "Invalid #undef directive");
return;
} // if
remove_define(ctx, sym);
} // handle_pp_undef
Feb 14, 2009
Feb 14, 2009
998
999
1000
static Conditional *_handle_pp_ifdef(Context *ctx, const Token type)
{
IncludeState *state = ctx->include_stack;