/
mojoshader_preprocessor.c
2566 lines (2163 loc) · 71.8 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"
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
19
20
#if DEBUG_LEXER
21
static Token debug_preprocessor_lexer(IncludeState *s)
22
{
23
const Token retval = preprocessor_lexer(s);
24
MOJOSHADER_print_debug_token("LEXER", s->token, s->tokenlen, retval);
25
return retval;
26
27
} // debug_preprocessor_lexer
#define preprocessor_lexer(s) debug_preprocessor_lexer(s)
28
29
#endif
30
31
32
#if DEBUG_TOKENIZER
static void print_debug_lexing_position(IncludeState *s)
{
33
34
if (s != NULL)
printf("NOW LEXING %s:%d ...\n", s->filename, s->line);
35
36
37
38
39
} // print_debug_lexing_position
#else
#define print_debug_lexing_position(s)
#endif
40
41
42
43
typedef struct Context
{
int isfail;
int out_of_memory;
44
char failstr[256];
45
int recursion_count;
46
int asm_comments;
47
int parsing_pragma;
48
Conditional *conditional_pool;
49
IncludeState *include_stack;
50
IncludeState *include_pool;
51
52
Define *define_hashtable[256];
Define *define_pool;
53
54
Define *file_macro;
Define *line_macro;
55
StringCache *filename_cache;
56
57
58
59
60
61
62
63
64
65
66
67
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)
{
68
ctx->out_of_memory = 1;
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
} // 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);
99
vsnprintf(ctx->failstr, sizeof (ctx->failstr), fmt, ap);
100
101
102
103
104
105
106
107
108
va_end(ap);
} // failf
static inline void fail(Context *ctx, const char *reason)
{
failf(ctx, "%s", reason);
} // fail
109
110
111
112
113
114
115
116
117
118
119
#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");
120
121
else if (token[i] == '\\')
printf("\\\\");
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
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);
152
TOKENCASE(TOKEN_HASH);
153
154
155
156
157
158
159
160
161
162
163
164
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);
165
TOKENCASE(TOKEN_PP_PRAGMA);
166
167
TOKENCASE(TOKEN_INCOMPLETE_COMMENT);
TOKENCASE(TOKEN_BAD_CHARS);
168
TOKENCASE(TOKEN_EOI);
169
TOKENCASE(TOKEN_PREPROCESSING_ERROR);
170
171
172
173
174
175
#undef TOKENCASE
case ((Token) '\n'):
printf("'\\n'");
break;
176
177
178
179
case ((Token) '\\'):
printf("'\\\\'");
break;
180
181
182
183
184
185
186
187
188
189
default:
assert(((int)tokenval) < 256);
printf("'%c'", (char) tokenval);
break;
} // switch
printf(")\n");
} // MOJOSHADER_print_debug_token
#endif
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
#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
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
WCHAR wpath[MAX_PATH];
if (!MultiByteToWideChar(CP_UTF8, 0, fname, -1, wpath, MAX_PATH))
return 0;
const DWORD share = FILE_SHARE_READ | FILE_SHARE_WRITE | FILE_SHARE_DELETE;
const HANDLE handle = CreateFileW(wpath, FILE_GENERIC_READ, share,
NULL, OPEN_EXISTING, NULL, NULL);
if (handle == INVALID_HANDLE_VALUE)
return 0;
const DWORD fileSize = GetFileSize(handle, NULL);
if (fileSize == INVALID_FILE_SIZE)
{
CloseHandle(handle);
return 0;
} // if
char *data = (char *) m(fileSize, d);
if (data == NULL)
{
CloseHandle(handle);
return 0;
} // if
DWORD readLength = 0;
if (!ReadFile(handle, data, fileSize, &readLength, NULL))
{
CloseHandle(handle);
f(data, d);
return 0;
} // if
CloseHandle(handle);
if (readLength != fileSize)
{
f(data, d);
return 0;
} // if
*outdata = data;
*outbytes = fileSize;
return 1;
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
#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
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
// 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;
305
static void init_buffer(Buffer *buffer)
306
307
308
309
310
{
buffer->total_bytes = 0;
buffer->head.bytes = 0;
buffer->head.next = NULL;
buffer->tail = &buffer->head;
311
} // init_buffer
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
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)
{
345
char *retval = (char *) m(buffer->total_bytes + 1, d);
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
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
374
init_buffer(buffer);
375
376
377
} // free_buffer
378
// !!! FIXME: maybe use these pool magic elsewhere?
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
// 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; \
407
ctx->poolname##_pool = item; \
408
409
410
411
412
413
414
415
416
}
#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)
417
IMPLEMENT_POOL(Define, define)
418
419
420
421
// Preprocessor define hashtable stuff...
422
423
// !!! FIXME: why isn't this using mojoshader_common.c's code?
424
425
// this is djb's xor hashing function.
static inline uint32 hash_string_djbxor(const char *sym)
426
{
427
register uint32 hash = 5381;
428
while (*sym)
429
430
431
432
433
434
435
hash = ((hash << 5) + hash) ^ *(sym++);
return hash;
} // hash_string_djbxor
static inline uint8 hash_define(const char *sym)
{
return (uint8) hash_string_djbxor(sym);
436
437
438
} // hash_define
439
static int add_define(Context *ctx, const char *sym, const char *val,
440
char **parameters, int paramcount)
441
{
442
const uint8 hash = hash_define(sym);
443
Define *bucket = ctx->define_hashtable[hash];
444
445
while (bucket)
{
446
if (strcmp(bucket->identifier, sym) == 0)
447
{
448
449
failf(ctx, "'%s' already defined", sym); // !!! FIXME: warning?
// !!! FIXME: gcc reports the location of previous #define here.
450
451
452
453
454
return 0;
} // if
bucket = bucket->next;
} // while
455
bucket = get_define(ctx);
456
457
458
if (bucket == NULL)
return 0;
459
bucket->definition = val;
460
bucket->original = NULL;
461
462
463
bucket->identifier = sym;
bucket->parameters = (const char **) parameters;
bucket->paramcount = paramcount;
464
465
466
467
468
469
bucket->next = ctx->define_hashtable[hash];
ctx->define_hashtable[hash] = bucket;
return 1;
} // add_define
470
471
static void free_define(Context *ctx, Define *def)
{
472
473
474
475
476
477
478
479
480
481
482
if (def != NULL)
{
int i;
for (i = 0; i < def->paramcount; i++)
Free(ctx, (void *) def->parameters[i]);
Free(ctx, (void *) def->parameters);
Free(ctx, (void *) def->identifier);
Free(ctx, (void *) def->definition);
Free(ctx, (void *) def->original);
put_define(ctx, def);
} // if
483
484
485
} // free_define
486
487
static int remove_define(Context *ctx, const char *sym)
{
488
const uint8 hash = hash_define(sym);
489
490
Define *bucket = ctx->define_hashtable[hash];
Define *prev = NULL;
491
492
while (bucket)
{
493
if (strcmp(bucket->identifier, sym) == 0)
494
495
496
497
498
{
if (prev == NULL)
ctx->define_hashtable[hash] = bucket->next;
else
prev->next = bucket->next;
499
free_define(ctx, bucket);
500
501
502
503
504
505
506
507
508
509
return 1;
} // if
prev = bucket;
bucket = bucket->next;
} // while
return 0;
} // remove_define
510
static const Define *find_define(Context *ctx, const char *sym)
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
if ( (ctx->file_macro) && (strcmp(sym, "__FILE__") == 0) )
{
Free(ctx, (char *) ctx->file_macro->definition);
const IncludeState *state = ctx->include_stack;
const char *fname = state ? state->filename : "";
const size_t len = strlen(fname) + 2;
char *str = (char *) Malloc(ctx, len);
if (!str)
return NULL;
str[0] = '\"';
memcpy(str + 1, fname, len - 2);
str[len - 1] = '\"';
ctx->file_macro->definition = str;
return ctx->file_macro;
} // if
else if ( (ctx->line_macro) && (strcmp(sym, "__LINE__") == 0) )
{
Free(ctx, (char *) ctx->line_macro->definition);
const IncludeState *state = ctx->include_stack;
const size_t bufsize = 32;
char *str = (char *) Malloc(ctx, bufsize);
if (!str)
return 0;
const size_t len = snprintf(str, bufsize, "%u", state->line);
assert(len < bufsize);
ctx->line_macro->definition = str;
return ctx->line_macro;
} // else
543
const uint8 hash = hash_define(sym);
544
Define *bucket = ctx->define_hashtable[hash];
545
546
while (bucket)
{
547
if (strcmp(bucket->identifier, sym) == 0)
548
return bucket;
549
550
551
552
553
554
bucket = bucket->next;
} // while
return NULL;
} // find_define
555
556
557
558
559
560
561
562
563
564
565
static const Define *find_define_by_token(Context *ctx)
{
IncludeState *state = ctx->include_stack;
assert(state->tokenval == TOKEN_IDENTIFIER);
char *sym = (char *) alloca(state->tokenlen+1);
memcpy(sym, state->token, state->tokenlen);
sym[state->tokenlen] = '\0';
return find_define(ctx, sym);
} // find_define_by_token
566
567
static const Define *find_macro_arg(const IncludeState *state,
const Define *defines)
568
569
570
571
572
573
{
const Define *def = NULL;
char *sym = (char *) alloca(state->tokenlen + 1);
memcpy(sym, state->token, state->tokenlen);
sym[state->tokenlen] = '\0';
574
for (def = defines; def != NULL; def = def->next)
575
{
576
assert(def->parameters == NULL); // args can't have args!
577
578
579
580
581
582
583
584
585
assert(def->paramcount == 0); // args can't have args!
if (strcmp(def->identifier, sym) == 0)
break;
} // while
return def;
} // find_macro_arg
586
static void put_all_defines(Context *ctx)
587
{
588
size_t i;
589
590
for (i = 0; i < STATICARRAYLEN(ctx->define_hashtable); i++)
{
591
Define *bucket = ctx->define_hashtable[i];
592
593
594
ctx->define_hashtable[i] = NULL;
while (bucket)
{
595
Define *next = bucket->next;
596
free_define(ctx, bucket);
597
598
599
bucket = next;
} // while
} // for
600
} // put_all_defines
601
602
603
static int push_source(Context *ctx, const char *fname, const char *source,
604
unsigned int srclen, unsigned int linenum,
605
MOJOSHADER_includeClose close_callback)
606
{
607
608
609
if (srclen == 0)
return 1; // nothing to do: just pretend you did it.
610
IncludeState *state = get_include(ctx);
611
612
613
if (state == NULL)
return 0;
614
if (fname != NULL)
615
{
616
state->filename = stringcache(ctx->filename_cache, fname);
617
618
if (state->filename == NULL)
{
619
out_of_memory(ctx);
620
put_include(ctx, state);
621
622
return 0;
} // if
623
624
} // if
625
state->close_callback = close_callback;
626
627
628
state->source_base = source;
state->source = source;
state->token = source;
629
state->tokenval = ((Token) '\n');
630
state->orig_length = srclen;
631
state->bytes_left = srclen;
632
state->line = linenum;
633
state->next = ctx->include_stack;
634
state->asm_comments = ctx->asm_comments;
635
636
637
print_debug_lexing_position(state);
638
639
640
641
642
643
644
645
646
647
648
649
ctx->include_stack = state;
return 1;
} // push_source
static void pop_source(Context *ctx)
{
IncludeState *state = ctx->include_stack;
if (state == NULL)
return;
650
if (state->close_callback)
651
{
652
653
state->close_callback(state->source_base, ctx->malloc,
ctx->free, ctx->malloc_data);
654
655
} // if
656
657
// state->filename is a pointer to the filename cache; don't free it here!
658
659
660
661
662
663
664
Conditional *cond = state->conditional_stack;
while (cond)
{
Conditional *next = cond->next;
put_conditional(ctx, cond);
cond = next;
} // while
665
666
ctx->include_stack = state->next;
667
668
669
print_debug_lexing_position(ctx->include_stack);
670
put_include(ctx, state);
671
672
673
} // pop_source
674
675
676
677
678
679
680
static void close_define_include(const char *data, MOJOSHADER_malloc m,
MOJOSHADER_free f, void *d)
{
f((void *) data, d);
} // close_define_include
681
682
683
684
Preprocessor *preprocessor_start(const char *fname, const char *source,
unsigned int sourcelen,
MOJOSHADER_includeOpen open_callback,
MOJOSHADER_includeClose close_callback,
685
const MOJOSHADER_preprocessorDefine *defines,
686
unsigned int define_count, int asm_comments,
687
688
689
MOJOSHADER_malloc m, MOJOSHADER_free f, void *d)
{
int okay = 1;
690
unsigned int i = 0;
691
692
693
694
695
696
697
// the preprocessor is internal-only, so we verify all these are != NULL.
assert(m != NULL);
assert(f != NULL);
Context *ctx = (Context *) m(sizeof (Context), d);
if (ctx == NULL)
698
return NULL;
699
700
701
702
703
704
705
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;
706
ctx->asm_comments = asm_comments;
707
708
ctx->filename_cache = stringcache_create(m, f, d);
709
710
711
712
713
714
715
716
717
718
719
okay = ((okay) && (ctx->filename_cache != NULL));
ctx->file_macro = get_define(ctx);
okay = ((okay) && (ctx->file_macro != NULL));
if ((okay) && (ctx->file_macro))
okay = ((ctx->file_macro->identifier = StrDup(ctx, "__FILE__")) != 0);
ctx->line_macro = get_define(ctx);
okay = ((okay) && (ctx->line_macro != NULL));
if ((okay) && (ctx->line_macro))
okay = ((ctx->line_macro->identifier = StrDup(ctx, "__LINE__")) != 0);
720
721
722
723
// let the usual preprocessor parser sort these out.
char *define_include = NULL;
unsigned int define_include_len = 0;
724
if ((okay) && (define_count > 0))
725
{
726
for (i = 0; i < define_count; i++)
727
{
728
729
define_include_len += strlen(defines[i].identifier);
define_include_len += strlen(defines[i].definition);
730
731
732
733
734
735
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)
736
okay = 0;
737
738
739
740
741
else
{
char *ptr = define_include;
for (i = 0; i < define_count; i++)
{
742
743
ptr += sprintf(ptr, "#define %s %s\n", defines[i].identifier,
defines[i].definition);
744
745
746
} // for
} // else
} // if
747
748
if ((okay) && (!push_source(ctx,fname,source,sourcelen,1,NULL)))
749
750
okay = 0;
751
752
753
if ((okay) && (define_include != NULL))
{
okay = push_source(ctx, "<predefined macros>", define_include,
754
define_include_len, 1, close_define_include);
755
756
} // if
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
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);
776
777
put_all_defines(ctx);
778
779
780
if (ctx->filename_cache != NULL)
stringcache_destroy(ctx->filename_cache);
781
782
free_define(ctx, ctx->file_macro);
free_define(ctx, ctx->line_macro);
783
free_define_pool(ctx);
784
free_conditional_pool(ctx);
785
free_include_pool(ctx);
786
787
788
789
790
791
792
793
794
795
796
797
Free(ctx, ctx);
} // preprocessor_end
int preprocessor_outofmemory(Preprocessor *_ctx)
{
Context *ctx = (Context *) _ctx;
return ctx->out_of_memory;
} // preprocessor_outofmemory
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
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
817
// !!! FIXME: parsing fails on preprocessor directives should skip rest of line.
818
819
static int require_newline(IncludeState *state)
{
820
821
const Token token = lexer(state);
pushback(state); // rewind no matter what.
822
return ( (token == TOKEN_INCOMPLETE_COMMENT) || // call it an eol.
823
(token == ((Token) '\n')) || (token == TOKEN_EOI) );
824
825
826
} // require_newline
827
828
829
830
831
832
833
834
835
836
static int token_to_int(IncludeState *state)
{
assert(state->tokenval == TOKEN_INT_LITERAL);
char *buf = (char *) alloca(state->tokenlen+1);
memcpy(buf, state->token, state->tokenlen);
buf[state->tokenlen] = '\0';
return atoi(buf);
} // token_to_int
837
838
839
static void handle_pp_include(Context *ctx)
{
IncludeState *state = ctx->include_stack;
840
Token token = lexer(state);
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
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';
880
bogus = !require_newline(state);
881
882
883
884
885
886
887
888
889
890
} // if
if (bogus)
{
fail(ctx, "Invalid #include directive");
return;
} // else
const char *newdata = NULL;
unsigned int newbytes = 0;
891
892
893
894
895
896
if ((ctx->open_callback == NULL) || (ctx->close_callback == NULL))
{
fail(ctx, "Saw #include, but no include callbacks defined");
return;
} // if
897
898
899
900
901
902
903
904
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
905
MOJOSHADER_includeClose callback = ctx->close_callback;
906
if (!push_source(ctx, filename, newdata, newbytes, 1, callback))
907
908
909
910
911
912
913
{
assert(ctx->out_of_memory);
ctx->close_callback(newdata, ctx->malloc, ctx->free, ctx->malloc_data);
} // if
} // handle_pp_include
914
915
916
917
918
919
920
static void handle_pp_line(Context *ctx)
{
IncludeState *state = ctx->include_stack;
char *filename = NULL;
int linenum = 0;
int bogus = 0;
921
if (lexer(state) != TOKEN_INT_LITERAL)
922
923
bogus = 1;
else
924
linenum = token_to_int(state);
925
926
if (!bogus)
927
928
929
930
931
932
933
934
935
{
Token t = lexer(state);
if (t == ((Token) '\n'))
{
state->line = linenum;
return;
}
bogus = (t != TOKEN_STRING_LITERAL);
}
936
937
938
939
if (!bogus)
{
state->token++; // skip '\"'...
940
941
942
filename = (char *) alloca(state->tokenlen);
memcpy(filename, state->token, state->tokenlen-1);
filename[state->tokenlen-1] = '\0';
943
944
945
946
947
948
949
950
951
bogus = !require_newline(state);
} // if
if (bogus)
{
fail(ctx, "Invalid #line directive");
return;
} // if
952
953
954
const char *cached = stringcache(ctx->filename_cache, filename);
if (cached == NULL)
out_of_memory(ctx);
955
956
957
958
959
state->filename = cached;
state->line = linenum;
} // handle_pp_line
960
961
962
static void handle_pp_error(Context *ctx)
{
IncludeState *state = ctx->include_stack;
963
964
965
char *ptr = ctx->failstr;
int avail = sizeof (ctx->failstr) - 1;
int cpy = 0;
966
967
int done = 0;
968
969
970
971
972
973
974
const char *prefix = "#error";
const size_t prefixlen = strlen(prefix);
strcpy(ctx->failstr, prefix);
avail -= prefixlen;
ptr += prefixlen;
state->report_whitespace = 1;
975
976
while (!done)
{
977
const Token token = lexer(state);
978
979
980
switch (token)
{
case ((Token) '\n'):
981
982
983
state->line--; // make sure error is on the right line.
// fall through!
case TOKEN_INCOMPLETE_COMMENT:
984
case TOKEN_EOI:
985
pushback(state); // move back so we catch this later.
986
987
988
done = 1;
break;
989
case ((Token) ' '):
990
991
992
993
994
995
if (!avail)
break;
*(ptr++) = ' ';
avail--;
break;
996
default:
997
cpy = Min(avail, (int) state->tokenlen);
998
999
1000
if (cpy)
memcpy(ptr, state->token, cpy);
ptr += cpy;