/
mojoshader_preprocessor.c
1556 lines (1299 loc) · 41.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
21
static Token debug_preprocessor_lexer(IncludeState *s)
23
const Token retval = preprocessor_lexer(s);
24
MOJOSHADER_print_debug_token("LEXER", s->token, s->tokenlen, retval);
26
27
} // debug_preprocessor_lexer
#define preprocessor_lexer(s) debug_preprocessor_lexer(s)
30
31
32
33
34
35
typedef struct DefineHash
{
MOJOSHADER_preprocessorDefine define;
struct DefineHash *next;
} DefineHash;
37
38
39
40
41
42
43
44
// 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;
45
46
47
48
typedef struct Context
{
int isfail;
int out_of_memory;
49
char failstr[256];
50
Conditional *conditional_pool;
51
IncludeState *include_stack;
52
IncludeState *include_pool;
53
DefineHash *define_hashtable[256];
54
DefineHash *define_pool;
55
FilenameCache *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
152
153
154
155
156
157
158
159
160
161
162
163
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);
164
165
TOKENCASE(TOKEN_INCOMPLETE_COMMENT);
TOKENCASE(TOKEN_BAD_CHARS);
166
TOKENCASE(TOKEN_EOI);
167
TOKENCASE(TOKEN_PREPROCESSING_ERROR);
168
169
170
171
172
173
#undef TOKENCASE
case ((Token) '\n'):
printf("'\\n'");
break;
174
175
176
177
case ((Token) '\\'):
printf("'\\\\'");
break;
178
179
180
181
182
183
184
185
186
187
default:
assert(((int)tokenval) < 256);
printf("'%c'", (char) tokenval);
break;
} // switch
printf(")\n");
} // MOJOSHADER_print_debug_token
#endif
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
#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
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
// 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;
262
static void init_buffer(Buffer *buffer)
263
264
265
266
267
{
buffer->total_bytes = 0;
buffer->head.bytes = 0;
buffer->head.next = NULL;
buffer->tail = &buffer->head;
268
} // init_buffer
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
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
331
init_buffer(buffer);
332
333
334
} // free_buffer
335
// !!! FIXME: maybe use these pool magic elsewhere?
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
// 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; \
}
#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)
IMPLEMENT_POOL(DefineHash, define)
376
377
378
379
380
// Preprocessor define hashtable stuff...
static unsigned char hash_define(const char *sym)
{
unsigned char retval = 0;
381
while (*sym)
382
383
384
385
386
retval += *(sym++);
return retval;
} // hash_define
387
static int add_define(Context *ctx, const char *sym, const char *val, int copy)
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
{
char *identifier = NULL;
char *definition = NULL;
const unsigned char hash = hash_define(sym);
DefineHash *bucket = ctx->define_hashtable[hash];
while (bucket)
{
if (strcmp(bucket->define.identifier, sym) == 0)
{
failf(ctx, "'%s' already defined", sym);
return 0;
} // if
bucket = bucket->next;
} // while
403
bucket = get_define(ctx);
404
405
406
if (bucket == NULL)
return 0;
407
identifier = StrDup(ctx, sym);
408
if (identifier == NULL)
410
put_define(ctx, bucket);
411
412
return 0;
} // if
413
414
415
416
417
if (!copy)
bucket->define.definition = val;
else
{
418
definition = StrDup(ctx, val);
419
420
421
if (definition == NULL)
{
Free(ctx, identifier);
422
put_define(ctx, bucket);
423
424
425
426
427
return 0;
} // if
bucket->define.definition = definition;
} // if
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
bucket->define.identifier = identifier;
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);
DefineHash *bucket = ctx->define_hashtable[hash];
DefineHash *prev = NULL;
while (bucket)
{
if (strcmp(bucket->define.identifier, sym) == 0)
{
if (prev == NULL)
ctx->define_hashtable[hash] = bucket->next;
else
prev->next = bucket->next;
Free(ctx, (void *) bucket->define.identifier);
Free(ctx, (void *) bucket->define.definition);
450
put_define(ctx, bucket);
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
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);
DefineHash *bucket = ctx->define_hashtable[hash];
while (bucket)
{
if (strcmp(bucket->define.identifier, sym) == 0)
return bucket->define.definition;
bucket = bucket->next;
} // while
return NULL;
} // find_define
475
static void put_all_defines(Context *ctx)
476
477
478
479
480
481
482
483
484
485
486
{
int i;
for (i = 0; i < STATICARRAYLEN(ctx->define_hashtable); i++)
{
DefineHash *bucket = ctx->define_hashtable[i];
ctx->define_hashtable[i] = NULL;
while (bucket)
{
DefineHash *next = bucket->next;
Free(ctx, (void *) bucket->define.identifier);
Free(ctx, (void *) bucket->define.definition);
487
put_define(ctx, bucket);
488
489
490
491
492
493
bucket = next;
} // while
} // for
} // find_define
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
528
529
530
531
532
533
534
535
536
537
538
539
540
541
// 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
542
static int push_source(Context *ctx, const char *fname, const char *source,
543
unsigned int srclen, unsigned int linenum, int included)
545
IncludeState *state = get_include(ctx);
546
547
548
if (state == NULL)
return 0;
549
if (fname != NULL)
551
state->filename = cache_filename(ctx, fname);
552
553
if (state->filename == NULL)
{
554
put_include(ctx, state);
555
556
return 0;
} // if
557
558
559
560
561
562
} // if
state->included = included;
state->source_base = source;
state->source = source;
state->token = source;
563
state->orig_length = srclen;
564
state->bytes_left = srclen;
565
state->line = linenum;
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
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;
if (state->included)
{
ctx->close_callback(state->source_base, ctx->malloc,
ctx->free, ctx->malloc_data);
} // if
586
587
// state->filename is a pointer to the filename cache; don't free it here!
588
589
while (state->conditional_stack)
put_conditional(ctx, state->conditional_stack);
591
ctx->include_stack = state->next;
592
put_include(ctx, state);
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
} // pop_source
Preprocessor *preprocessor_start(const char *fname, const char *source,
unsigned int sourcelen,
MOJOSHADER_includeOpen open_callback,
MOJOSHADER_includeClose close_callback,
const MOJOSHADER_preprocessorDefine **defines,
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;
for (i = 0; i < define_count; i++)
{
626
if (!add_define(ctx, defines[i]->identifier, defines[i]->definition, 1))
627
628
629
630
631
632
{
okay = 0;
break;
} // if
} // for
633
if ((okay) && (!push_source(ctx, fname, source, sourcelen, 1, 0)))
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
okay = 0;
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);
655
656
put_all_defines(ctx);
657
free_filename_cache(ctx);
658
free_define_pool(ctx);
659
free_conditional_pool(ctx);
660
free_include_pool(ctx);
661
662
663
664
665
666
667
668
669
670
671
672
Free(ctx, ctx);
} // preprocessor_end
int preprocessor_outofmemory(Preprocessor *_ctx)
{
Context *ctx = (Context *) _ctx;
return ctx->out_of_memory;
} // preprocessor_outofmemory
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
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
692
// !!! FIXME: parsing fails on preprocessor directives should skip rest of line.
693
694
static int require_newline(IncludeState *state)
{
695
696
697
698
const Token token = lexer(state);
pushback(state); // rewind no matter what.
return ( (token == TOKEN_INCOMPLETE_COMMENT) // call it an eol.
(token == ((Token) '\n')) || (token == TOKEN_EOI) );
699
700
701
} // require_newline
702
703
704
static void handle_pp_include(Context *ctx)
{
IncludeState *state = ctx->include_stack;
705
Token token = lexer(state);
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
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';
745
bogus = !require_newline(state);
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
} // 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
764
if (!push_source(ctx, filename, newdata, newbytes, 1, 1))
765
766
767
768
769
770
771
{
assert(ctx->out_of_memory);
ctx->close_callback(newdata, ctx->malloc, ctx->free, ctx->malloc_data);
} // if
} // handle_pp_include
772
773
774
775
776
777
778
static void handle_pp_line(Context *ctx)
{
IncludeState *state = ctx->include_stack;
char *filename = NULL;
int linenum = 0;
int bogus = 0;
779
if (lexer(state) != TOKEN_INT_LITERAL)
780
781
782
bogus = 1;
else
{
783
784
785
char *buf = (char *) alloca(state->tokenlen+1);
memcpy(buf, state->token, state->tokenlen);
buf[state->tokenlen] = '\0';
786
787
788
789
linenum = atoi(buf);
} // else
if (!bogus)
790
bogus = (lexer(state) != TOKEN_STRING_LITERAL);
791
792
793
794
if (!bogus)
{
state->token++; // skip '\"'...
795
796
797
filename = (char *) alloca(state->tokenlen);
memcpy(filename, state->token, state->tokenlen-1);
filename[state->tokenlen-1] = '\0';
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
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
814
815
816
static void handle_pp_error(Context *ctx)
{
IncludeState *state = ctx->include_stack;
817
818
819
char *ptr = ctx->failstr;
int avail = sizeof (ctx->failstr) - 1;
int cpy = 0;
820
821
int done = 0;
822
823
824
825
826
827
828
const char *prefix = "#error";
const size_t prefixlen = strlen(prefix);
strcpy(ctx->failstr, prefix);
avail -= prefixlen;
ptr += prefixlen;
state->report_whitespace = 1;
829
830
while (!done)
{
831
const Token token = lexer(state);
832
833
834
switch (token)
{
case ((Token) '\n'):
835
836
837
state->line--; // make sure error is on the right line.
// fall through!
case TOKEN_INCOMPLETE_COMMENT:
838
case TOKEN_EOI:
839
pushback(state); // move back so we catch this later.
840
841
842
done = 1;
break;
843
844
845
846
847
848
849
case ' ':
if (!avail)
break;
*(ptr++) = ' ';
avail--;
break;
851
cpy = Min(avail, (int) state->tokenlen);
852
853
854
855
if (cpy)
memcpy(ptr, state->token, cpy);
ptr += cpy;
avail -= cpy;
856
857
858
859
break;
} // switch
} // while
860
861
*ptr = '\0';
state->report_whitespace = 0;
862
863
864
865
ctx->isfail = 1;
} // handle_pp_error
866
867
868
869
static void handle_pp_define(Context *ctx)
{
IncludeState *state = ctx->include_stack;
870
if (lexer(state) != TOKEN_IDENTIFIER)
871
872
873
874
875
876
877
878
{
fail(ctx, "Macro names must be indentifiers");
return;
} // if
MOJOSHADER_malloc m = ctx->malloc;
void *d = ctx->malloc_data;
const char space = ' ';
879
880
881
char *sym = (char *) alloca(state->tokenlen+1);
memcpy(sym, state->token, state->tokenlen);
sym[state->tokenlen] = '\0';
882
883
884
885
886
887
888
889
890
891
Buffer buffer;
init_buffer(&buffer);
int done = 0;
const char *source = NULL;
state->report_whitespace = 1;
while ((!done) && (!ctx->out_of_memory))
{
bytes_left = state->bytes_left;
892
const Token token = lexer(state);
893
894
895
896
switch (token)
{
case TOKEN_INCOMPLETE_COMMENT:
case TOKEN_EOI:
897
pushback(state); // move back so we catch this later.
898
899
900
901
902
903
// fall through!
case ((Token) '\n'):
done = 1;
break;
case ((Token) ' '): // may not actually point to ' '.
904
905
906
907
908
if (buffer.total_bytes > 0)
{
if (!add_to_buffer(&buffer, &space, 1, m, d))
ctx->out_of_memory = 1;
} // if
909
910
911
break;
default:
912
if (!add_to_buffer(&buffer,state->token,state->tokenlen,m,d))
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
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);
add_define(ctx, sym, definition, 0);
} // handle_pp_define
936
937
938
939
static void handle_pp_undef(Context *ctx)
{
IncludeState *state = ctx->include_stack;
940
if (lexer(state) != TOKEN_IDENTIFIER)
941
942
943
944
945
{
fail(ctx, "Macro names must be indentifiers");
return;
} // if
946
947
948
char *sym = (char *) alloca(state->tokenlen+1);
memcpy(sym, state->token, state->tokenlen);
sym[state->tokenlen] = '\0';
949
950
951
952
953
954
955
956
957
958
959
if (!require_newline(state))
{
fail(ctx, "Invalid #undef directive");
return;
} // if
remove_define(ctx, sym);
} // handle_pp_undef
960
961
962
963
964
965
static Conditional *_handle_pp_ifdef(Context *ctx, const Token type)
{
IncludeState *state = ctx->include_stack;
assert((type == TOKEN_PP_IFDEF) || (type == TOKEN_PP_IFNDEF));
966
if (lexer(state) != TOKEN_IDENTIFIER)
967
968
969
970
971
{
fail(ctx, "Macro names must be indentifiers");
return NULL;
} // if
972
973
974
char *sym = (char *) alloca(state->tokenlen+1);
memcpy(sym, state->token, state->tokenlen);
sym[state->tokenlen] = '\0';
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
if (!require_newline(state))
{
if (type == TOKEN_PP_IFDEF)
fail(ctx, "Invalid #ifdef directive");
else
fail(ctx, "Invalid #ifndef directive");
return NULL;
} // if
Conditional *conditional = get_conditional(ctx);
assert((conditional != NULL) || (ctx->out_of_memory));
if (conditional == NULL)
return NULL;
Conditional *prev = state->conditional_stack;
int skipping = ((prev != NULL) && (prev->skipping));
if (!skipping)
{
const int found = (find_define(ctx, sym) != NULL);
if (type == TOKEN_PP_IFDEF)
skipping = !found;
else
skipping = found;
} // if