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