/
mojoshader_preprocessor.c
2193 lines (1847 loc) · 61.4 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
Conditional *conditional_pool;
48
IncludeState *include_stack;
49
IncludeState *include_pool;
50
51
Define *define_hashtable[256];
Define *define_pool;
52
StringCache *filename_cache;
53
54
55
56
57
58
59
60
61
62
63
64
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)
{
65
ctx->out_of_memory = 1;
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
} // 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);
96
vsnprintf(ctx->failstr, sizeof (ctx->failstr), fmt, ap);
97
98
99
100
101
102
103
104
105
va_end(ap);
} // failf
static inline void fail(Context *ctx, const char *reason)
{
failf(ctx, "%s", reason);
} // fail
106
107
108
109
110
111
112
113
114
115
116
#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");
117
118
else if (token[i] == '\\')
printf("\\\\");
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
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);
161
162
TOKENCASE(TOKEN_INCOMPLETE_COMMENT);
TOKENCASE(TOKEN_BAD_CHARS);
163
TOKENCASE(TOKEN_EOI);
164
TOKENCASE(TOKEN_PREPROCESSING_ERROR);
165
166
167
168
169
170
#undef TOKENCASE
case ((Token) '\n'):
printf("'\\n'");
break;
171
172
173
174
case ((Token) '\\'):
printf("'\\\\'");
break;
175
176
177
178
179
180
181
182
183
184
default:
assert(((int)tokenval) < 256);
printf("'%c'", (char) tokenval);
break;
} // switch
printf(")\n");
} // MOJOSHADER_print_debug_token
#endif
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
#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
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
// 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;
259
static void init_buffer(Buffer *buffer)
260
261
262
263
264
{
buffer->total_bytes = 0;
buffer->head.bytes = 0;
buffer->head.next = NULL;
buffer->tail = &buffer->head;
265
} // init_buffer
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
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)
{
299
char *retval = (char *) m(buffer->total_bytes + 1, d);
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
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
328
init_buffer(buffer);
329
330
331
} // free_buffer
332
// !!! FIXME: maybe use these pool magic elsewhere?
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
// 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; \
361
ctx->poolname##_pool = item; \
362
363
364
365
366
367
368
369
370
}
#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)
371
IMPLEMENT_POOL(Define, define)
372
373
374
375
// Preprocessor define hashtable stuff...
376
377
// !!! FIXME: why isn't this using mojoshader_common.c's code?
378
379
// this is djb's xor hashing function.
static inline uint32 hash_string_djbxor(const char *sym)
380
{
381
register uint32 hash = 5381;
382
while (*sym)
383
384
385
386
387
388
389
hash = ((hash << 5) + hash) ^ *(sym++);
return hash;
} // hash_string_djbxor
static inline uint8 hash_define(const char *sym)
{
return (uint8) hash_string_djbxor(sym);
390
391
392
} // hash_define
393
static int add_define(Context *ctx, const char *sym, const char *val,
394
char **parameters, int paramcount)
395
{
396
const uint8 hash = hash_define(sym);
397
Define *bucket = ctx->define_hashtable[hash];
398
399
while (bucket)
{
400
if (strcmp(bucket->identifier, sym) == 0)
401
402
403
404
405
406
407
{
failf(ctx, "'%s' already defined", sym);
return 0;
} // if
bucket = bucket->next;
} // while
408
bucket = get_define(ctx);
409
410
411
if (bucket == NULL)
return 0;
412
413
414
415
bucket->definition = val;
bucket->identifier = sym;
bucket->parameters = (const char **) parameters;
bucket->paramcount = paramcount;
416
417
418
419
420
421
bucket->next = ctx->define_hashtable[hash];
ctx->define_hashtable[hash] = bucket;
return 1;
} // add_define
422
423
static void free_define(Context *ctx, Define *def)
{
424
int i;
425
426
427
428
429
430
431
432
433
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);
put_define(ctx, def);
} // free_define
434
435
static int remove_define(Context *ctx, const char *sym)
{
436
const uint8 hash = hash_define(sym);
437
438
Define *bucket = ctx->define_hashtable[hash];
Define *prev = NULL;
439
440
while (bucket)
{
441
if (strcmp(bucket->identifier, sym) == 0)
442
443
444
445
446
{
if (prev == NULL)
ctx->define_hashtable[hash] = bucket->next;
else
prev->next = bucket->next;
447
free_define(ctx, bucket);
448
449
450
451
452
453
454
455
456
457
return 1;
} // if
prev = bucket;
bucket = bucket->next;
} // while
return 0;
} // remove_define
458
static const Define *find_define(Context *ctx, const char *sym)
459
{
460
const uint8 hash = hash_define(sym);
461
Define *bucket = ctx->define_hashtable[hash];
462
463
while (bucket)
{
464
if (strcmp(bucket->identifier, sym) == 0)
465
return bucket;
466
467
468
469
470
471
bucket = bucket->next;
} // while
return NULL;
} // find_define
472
473
474
475
476
477
478
479
480
481
482
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
483
static void put_all_defines(Context *ctx)
484
{
485
size_t i;
486
487
for (i = 0; i < STATICARRAYLEN(ctx->define_hashtable); i++)
{
488
Define *bucket = ctx->define_hashtable[i];
489
490
491
ctx->define_hashtable[i] = NULL;
while (bucket)
{
492
Define *next = bucket->next;
493
free_define(ctx, bucket);
494
495
496
bucket = next;
} // while
} // for
497
} // put_all_defines
498
499
500
static int push_source(Context *ctx, const char *fname, const char *source,
501
unsigned int srclen, unsigned int linenum,
502
MOJOSHADER_includeClose close_callback, Define *defs)
503
{
504
505
506
if (srclen == 0)
return 1; // nothing to do: just pretend you did it.
507
IncludeState *state = get_include(ctx);
508
509
510
if (state == NULL)
return 0;
511
if (fname != NULL)
512
{
513
state->filename = stringcache(ctx->filename_cache, fname);
514
515
if (state->filename == NULL)
{
516
out_of_memory(ctx);
517
put_include(ctx, state);
518
519
return 0;
} // if
520
521
} // if
522
state->close_callback = close_callback;
523
524
525
state->source_base = source;
state->source = source;
state->token = source;
526
state->tokenval = ((Token) '\n');
527
state->orig_length = srclen;
528
state->bytes_left = srclen;
529
state->line = linenum;
530
state->defines = defs;
531
state->next = ctx->include_stack;
532
state->asm_comments = ctx->asm_comments;
533
534
535
print_debug_lexing_position(state);
536
537
538
539
540
541
542
543
544
545
546
547
ctx->include_stack = state;
return 1;
} // push_source
static void pop_source(Context *ctx)
{
IncludeState *state = ctx->include_stack;
if (state == NULL)
return;
548
if (state->close_callback)
549
{
550
551
state->close_callback(state->source_base, ctx->malloc,
ctx->free, ctx->malloc_data);
552
553
} // if
554
555
// state->filename is a pointer to the filename cache; don't free it here!
556
557
558
559
560
561
562
Conditional *cond = state->conditional_stack;
while (cond)
{
Conditional *next = cond->next;
put_conditional(ctx, cond);
cond = next;
} // while
563
564
565
566
567
568
569
570
571
572
573
574
Define *def = state->defines;
while (def)
{
Define *next = def->next;
def->identifier = NULL; // we reuse an allocation here, don't free!
assert(def->parameters == NULL);
assert(def->paramcount == 0);
free_define(ctx, def);
def = next;
} // while
575
ctx->include_stack = state->next;
576
577
578
print_debug_lexing_position(ctx->include_stack);
579
put_include(ctx, state);
580
581
582
} // pop_source
583
584
585
586
587
588
589
static void close_define_include(const char *data, MOJOSHADER_malloc m,
MOJOSHADER_free f, void *d)
{
f((void *) data, d);
} // close_define_include
590
591
592
593
Preprocessor *preprocessor_start(const char *fname, const char *source,
unsigned int sourcelen,
MOJOSHADER_includeOpen open_callback,
MOJOSHADER_includeClose close_callback,
594
const MOJOSHADER_preprocessorDefine *defines,
595
unsigned int define_count, int asm_comments,
596
597
598
MOJOSHADER_malloc m, MOJOSHADER_free f, void *d)
{
int okay = 1;
599
unsigned int i = 0;
600
601
602
603
604
605
606
// 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)
607
return NULL;
608
609
610
611
612
613
614
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;
615
ctx->asm_comments = asm_comments;
616
617
618
619
620
621
ctx->filename_cache = stringcache_create(m, f, d);
if (ctx->filename_cache == 0)
{
f(ctx, d);
return NULL;
} // if
622
623
624
625
626
// let the usual preprocessor parser sort these out.
char *define_include = NULL;
unsigned int define_include_len = 0;
if (define_count > 0)
627
{
628
for (i = 0; i < define_count; i++)
629
{
630
631
define_include_len += strlen(defines[i].identifier);
define_include_len += strlen(defines[i].definition);
632
633
634
635
636
637
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)
638
okay = 0;
639
640
641
642
643
else
{
char *ptr = define_include;
for (i = 0; i < define_count; i++)
{
644
645
ptr += sprintf(ptr, "#define %s %s\n", defines[i].identifier,
defines[i].definition);
646
647
648
} // for
} // else
} // if
649
650
if ((okay) && (!push_source(ctx, fname, source, sourcelen, 1, NULL, NULL)))
651
652
okay = 0;
653
654
655
if ((okay) && (define_include != NULL))
{
okay = push_source(ctx, "<predefined macros>", define_include,
656
define_include_len, 1, close_define_include, NULL);
657
658
} // if
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
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);
678
679
put_all_defines(ctx);
680
681
682
if (ctx->filename_cache != NULL)
stringcache_destroy(ctx->filename_cache);
683
free_define_pool(ctx);
684
free_conditional_pool(ctx);
685
free_include_pool(ctx);
686
687
688
689
690
691
692
693
694
695
696
697
Free(ctx, ctx);
} // preprocessor_end
int preprocessor_outofmemory(Preprocessor *_ctx)
{
Context *ctx = (Context *) _ctx;
return ctx->out_of_memory;
} // preprocessor_outofmemory
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
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
717
// !!! FIXME: parsing fails on preprocessor directives should skip rest of line.
718
719
static int require_newline(IncludeState *state)
{
720
721
const Token token = lexer(state);
pushback(state); // rewind no matter what.
722
return ( (token == TOKEN_INCOMPLETE_COMMENT) || // call it an eol.
723
(token == ((Token) '\n')) || (token == TOKEN_EOI) );
724
725
726
} // require_newline
727
728
729
730
731
732
733
734
735
736
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
737
738
739
static void handle_pp_include(Context *ctx)
{
IncludeState *state = ctx->include_stack;
740
Token token = lexer(state);
741
742
743
744
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
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';
780
bogus = !require_newline(state);
781
782
783
784
785
786
787
788
789
790
} // if
if (bogus)
{
fail(ctx, "Invalid #include directive");
return;
} // else
const char *newdata = NULL;
unsigned int newbytes = 0;
791
792
793
794
795
796
if ((ctx->open_callback == NULL) || (ctx->close_callback == NULL))
{
fail(ctx, "Saw #include, but no include callbacks defined");
return;
} // if
797
798
799
800
801
802
803
804
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
805
806
MOJOSHADER_includeClose callback = ctx->close_callback;
if (!push_source(ctx, filename, newdata, newbytes, 1, callback, NULL))
807
808
809
810
811
812
813
{
assert(ctx->out_of_memory);
ctx->close_callback(newdata, ctx->malloc, ctx->free, ctx->malloc_data);
} // if
} // handle_pp_include
814
815
816
817
818
819
820
static void handle_pp_line(Context *ctx)
{
IncludeState *state = ctx->include_stack;
char *filename = NULL;
int linenum = 0;
int bogus = 0;
821
if (lexer(state) != TOKEN_INT_LITERAL)
822
823
bogus = 1;
else
824
linenum = token_to_int(state);
825
826
if (!bogus)
827
bogus = (lexer(state) != TOKEN_STRING_LITERAL);
828
829
830
831
if (!bogus)
{
state->token++; // skip '\"'...
832
833
834
filename = (char *) alloca(state->tokenlen);
memcpy(filename, state->token, state->tokenlen-1);
filename[state->tokenlen-1] = '\0';
835
836
837
838
839
840
841
842
843
bogus = !require_newline(state);
} // if
if (bogus)
{
fail(ctx, "Invalid #line directive");
return;
} // if
844
845
846
const char *cached = stringcache(ctx->filename_cache, filename);
if (cached == NULL)
out_of_memory(ctx);
847
848
849
850
851
state->filename = cached;
state->line = linenum;
} // handle_pp_line
852
853
854
static void handle_pp_error(Context *ctx)
{
IncludeState *state = ctx->include_stack;
855
856
857
char *ptr = ctx->failstr;
int avail = sizeof (ctx->failstr) - 1;
int cpy = 0;
858
859
int done = 0;
860
861
862
863
864
865
866
const char *prefix = "#error";
const size_t prefixlen = strlen(prefix);
strcpy(ctx->failstr, prefix);
avail -= prefixlen;
ptr += prefixlen;
state->report_whitespace = 1;
867
868
while (!done)
{
869
const Token token = lexer(state);
870
871
872
switch (token)
{
case ((Token) '\n'):
873
874
875
state->line--; // make sure error is on the right line.
// fall through!
case TOKEN_INCOMPLETE_COMMENT:
876
case TOKEN_EOI:
877
pushback(state); // move back so we catch this later.
878
879
880
done = 1;
break;
881
882
883
884
885
886
887
case ' ':
if (!avail)
break;
*(ptr++) = ' ';
avail--;
break;
888
default:
889
cpy = Min(avail, (int) state->tokenlen);
890
891
892
893
if (cpy)
memcpy(ptr, state->token, cpy);
ptr += cpy;
avail -= cpy;
894
895
896
897
break;
} // switch
} // while
898
899
*ptr = '\0';
state->report_whitespace = 0;
900
901
902
903
ctx->isfail = 1;
} // handle_pp_error
904
905
906
static void handle_pp_define(Context *ctx)
{
IncludeState *state = ctx->include_stack;
907
int done = 0;
908
909
if (lexer(state) != TOKEN_IDENTIFIER)
910
{
911
fail(ctx, "Macro names must be identifiers");
912
913
914
return;
} // if
915
916
917
918
char *definition = NULL;
char *sym = (char *) Malloc(ctx, state->tokenlen+1);
if (sym == NULL)
return;
919
920
memcpy(sym, state->token, state->tokenlen);
sym[state->tokenlen] = '\0';
921
922
923
924
925
926
927
928
if (strcmp(sym, "defined") == 0)
{
Free(ctx, sym);
fail(ctx, "'defined' cannot be used as a macro name");
return;
} // if
929
930
931
932
933
// #define a(b) is different than #define a (b) :(
state->report_whitespace = 1;
lexer(state);
state->report_whitespace = 0;
934
int params = 0;
935
char **idents = NULL;
936
937
938
MOJOSHADER_malloc m = ctx->malloc;
void *d = ctx->malloc_data;
static const char space = ' ';
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
if (state->tokenval == ((Token) ' '))
lexer(state); // skip it.
else if (state->tokenval == ((Token) '('))
{
IncludeState saved;
memcpy(&saved, state, sizeof (IncludeState));
while (1)
{
if (lexer(state) != TOKEN_IDENTIFIER)
break;
params++;
if (lexer(state) != ((Token) ','))
break;
} // while
if (state->tokenval != ((Token) ')'))
{
fail(ctx, "syntax error in macro parameter list");
goto handle_pp_define_failed;
} // if
961
962
963
if (params == 0) // special case for void args: "#define a() b"
params = -1;
else
964
965
966
967
{
idents = (char **) Malloc(ctx, sizeof (char *) * params);
if (idents == NULL)
goto handle_pp_define_failed;
968
969
970
971
// roll all the way back, do it again.
memcpy(state, &saved, sizeof (IncludeState));
memset(idents, '\0', sizeof (char *) * params);
972
973
974
975
976
977
978
979
980
981
int i;
for (i = 0; i < params; i++)
{
lexer(state);
assert(state->tokenval == TOKEN_IDENTIFIER);
char *dst = (char *) Malloc(ctx, state->tokenlen+1);
if (dst == NULL)
break;
982
983
984
985
memcpy(dst, state->token, state->tokenlen);
dst[state->tokenlen] = '\0';
idents[i] = dst;
986
987
988
989
990
991
992
993
994
if (i < (params-1))
{
lexer(state);
assert(state->tokenval == ((Token) ','));
} // if
} // for
if (i != params)
995
{
996
997
assert(ctx->out_of_memory);
goto handle_pp_define_failed;
998
} // if
999
1000
lexer(state);