Skip to content

Latest commit

 

History

History
1424 lines (1191 loc) · 38.5 KB

mojoshader_preprocessor.c

File metadata and controls

1424 lines (1191 loc) · 38.5 KB
 
1
2
3
4
5
6
7
8
9
10
11
12
/**
* MojoShader; generate shader programs from bytecode of compiled
* Direct3D shaders.
*
* Please see the file LICENSE.txt in the source's root directory.
*
* This file written by Ryan C. Gordon.
*/
#define __MOJOSHADER_INTERNAL__ 1
#include "mojoshader_internal.h"
Feb 12, 2009
Feb 12, 2009
13
14
15
16
17
18
#if DEBUG_PREPROCESSOR
#define print_debug_token(token, len, val) \
MOJOSHADER_print_debug_token("PREPROCESSOR", token, len, val)
#else
#define print_debug_token(token, len, val)
#endif
Feb 10, 2009
Feb 10, 2009
19
Feb 15, 2009
Feb 15, 2009
20
21
22
23
24
25
26
27
28
29
30
31
#if DEBUG_LEXER
static Token debug_preprocessor_internal_lexer(IncludeState *s)
{
const Token retval = preprocessor_internal_lexer(s);
MOJOSHADER_print_debug_token("LEXER", s->token,
(unsigned int) (s->source - s->token),
retval);
return retval;
} // debug_preprocessor_internal_lexer
#define preprocessor_internal_lexer(s) debug_preprocessor_internal_lexer(s)
#endif
32
33
34
35
36
37
typedef struct DefineHash
{
MOJOSHADER_preprocessorDefine define;
struct DefineHash *next;
} DefineHash;
Feb 14, 2009
Feb 14, 2009
38
Feb 13, 2009
Feb 13, 2009
39
40
41
42
43
44
45
46
// 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;
47
48
49
50
typedef struct Context
{
int isfail;
int out_of_memory;
Feb 13, 2009
Feb 13, 2009
51
char failstr[256];
Feb 14, 2009
Feb 14, 2009
52
Conditional *conditional_pool;
53
54
IncludeState *include_stack;
DefineHash *define_hashtable[256];
Feb 13, 2009
Feb 13, 2009
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)
{
Feb 13, 2009
Feb 13, 2009
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);
Feb 13, 2009
Feb 13, 2009
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
Feb 12, 2009
Feb 12, 2009
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");
Feb 15, 2009
Feb 15, 2009
120
121
else if (token[i] == '\\')
printf("\\\\");
Feb 12, 2009
Feb 12, 2009
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);
Feb 13, 2009
Feb 13, 2009
164
165
TOKENCASE(TOKEN_INCOMPLETE_COMMENT);
TOKENCASE(TOKEN_BAD_CHARS);
Feb 12, 2009
Feb 12, 2009
166
TOKENCASE(TOKEN_EOI);
Feb 13, 2009
Feb 13, 2009
167
TOKENCASE(TOKEN_PREPROCESSING_ERROR);
Feb 12, 2009
Feb 12, 2009
168
169
170
171
172
173
#undef TOKENCASE
case ((Token) '\n'):
printf("'\\n'");
break;
Feb 15, 2009
Feb 15, 2009
174
175
176
177
case ((Token) '\\'):
printf("'\\\\'");
break;
Feb 12, 2009
Feb 12, 2009
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
Feb 13, 2009
Feb 13, 2009
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
Feb 14, 2009
Feb 14, 2009
245
246
247
248
249
250
251
252
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
// Conditional pool stuff...
static void free_conditional_pool(Context *ctx)
{
Conditional *item = ctx->conditional_pool;
while (item != NULL)
{
Conditional *next = item->next;
Free(ctx, item);
item = next;
} // while
} // free_conditional_pool
static Conditional *get_conditional(Context *ctx)
{
Conditional *retval = ctx->conditional_pool;
if (retval != NULL)
ctx->conditional_pool = retval->next;
else
retval = (Conditional *) Malloc(ctx, sizeof (Conditional));
if (retval != NULL)
memset(retval, '\0', sizeof (Conditional));
return retval;
} // get_conditional
static void put_conditionals(Context *ctx, Conditional *item)
{
while (item != NULL)
{
Conditional *next = item->next;
item->next = ctx->conditional_pool;
ctx->conditional_pool = item;
item = next;
} // while
} // put_conditionals
Feb 13, 2009
Feb 13, 2009
285
286
287
288
289
290
// Preprocessor define hashtable stuff...
static unsigned char hash_define(const char *sym)
{
unsigned char retval = 0;
Feb 14, 2009
Feb 14, 2009
291
while (*sym)
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
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
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
retval += *(sym++);
return retval;
} // hash_define
static int add_define(Context *ctx, const char *sym, const char *val)
{
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
bucket = (DefineHash *) Malloc(ctx, sizeof (DefineHash));
if (bucket == NULL)
return 0;
identifier = (char *) Malloc(ctx, strlen(sym) + 1);
definition = (char *) Malloc(ctx, strlen(val) + 1);
if ((identifier == NULL) || (definition == NULL))
{
Free(ctx, identifier);
Free(ctx, definition);
Free(ctx, bucket);
return 0;
} // if
strcpy(identifier, sym);
strcpy(definition, val);
bucket->define.identifier = identifier;
bucket->define.definition = definition;
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);
Free(ctx, bucket);
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
static void free_all_defines(Context *ctx)
{
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);
Free(ctx, bucket);
bucket = next;
} // while
} // for
} // find_define
Feb 13, 2009
Feb 13, 2009
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
// 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
444
445
446
447
448
449
450
451
static int push_source(Context *ctx, const char *fname, const char *source,
unsigned int srclen, int included)
{
IncludeState *state = (IncludeState *) Malloc(ctx, sizeof (IncludeState));
if (state == NULL)
return 0;
memset(state, '\0', sizeof (IncludeState));
Feb 10, 2009
Feb 10, 2009
452
if (fname != NULL)
Feb 13, 2009
Feb 13, 2009
454
state->filename = cache_filename(ctx, fname);
Feb 10, 2009
Feb 10, 2009
455
456
457
458
459
if (state->filename == NULL)
{
Free(ctx, state);
return 0;
} // if
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
} // if
state->included = included;
state->source_base = source;
state->source = source;
state->token = source;
state->bytes_left = srclen;
state->line = 1;
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
Feb 13, 2009
Feb 13, 2009
488
489
// state->filename is a pointer to the filename cache; don't free it here!
Feb 14, 2009
Feb 14, 2009
490
491
put_conditionals(ctx, state->conditional_stack);
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
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
ctx->include_stack = state->next;
Free(ctx, state);
} // 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++)
{
if (!add_define(ctx, defines[i]->identifier, defines[i]->definition))
{
okay = 0;
break;
} // if
} // for
if ((okay) && (!push_source(ctx, fname, source, sourcelen, 0)))
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);
free_all_defines(ctx);
Feb 13, 2009
Feb 13, 2009
557
free_filename_cache(ctx);
Feb 14, 2009
Feb 14, 2009
558
free_conditional_pool(ctx);
559
560
561
562
563
564
565
566
567
568
569
570
Free(ctx, ctx);
} // preprocessor_end
int preprocessor_outofmemory(Preprocessor *_ctx)
{
Context *ctx = (Context *) _ctx;
return ctx->out_of_memory;
} // preprocessor_outofmemory
Feb 14, 2009
Feb 14, 2009
571
572
573
static int require_newline(IncludeState *state)
{
const char *source = state->source;
Feb 17, 2009
Feb 17, 2009
574
const unsigned int bytes_left = state->bytes_left;
Feb 15, 2009
Feb 15, 2009
575
const unsigned int linenum = state->line;
Feb 14, 2009
Feb 14, 2009
576
const Token token = preprocessor_internal_lexer(state);
Feb 15, 2009
Feb 15, 2009
577
state->source = source; // rewind no matter what.
Feb 17, 2009
Feb 17, 2009
578
state->bytes_left = bytes_left;
Feb 15, 2009
Feb 15, 2009
579
state->line = linenum;
Feb 14, 2009
Feb 14, 2009
580
if (token == TOKEN_INCOMPLETE_COMMENT)
Feb 15, 2009
Feb 15, 2009
581
return 1; // call it an eol.
Feb 14, 2009
Feb 14, 2009
582
583
584
585
return ( (token == ((Token) '\n')) || (token == TOKEN_EOI) );
} // require_newline
Feb 13, 2009
Feb 13, 2009
586
587
588
589
590
591
592
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
626
627
628
static void handle_pp_include(Context *ctx)
{
IncludeState *state = ctx->include_stack;
Token token = preprocessor_internal_lexer(state);
MOJOSHADER_includeType incltype;
char *filename = NULL;
int bogus = 0;
if (token == TOKEN_STRING_LITERAL)
incltype = MOJOSHADER_INCLUDETYPE_LOCAL;
else if (token == ((Token) '<'))
{
incltype = MOJOSHADER_INCLUDETYPE_SYSTEM;
// can't use lexer, since every byte between the < > pair is
// considered part of the filename. :/
while (!bogus)
{
if ( !(bogus = (state->bytes_left == 0)) )
{
const char ch = *state->source;
if ( !(bogus = ((ch == '\r') || (ch == '\n'))) )
{
state->source++;
state->bytes_left--;
if (ch == '>')
break;
} // if
} // if
} // while
} // else if
else
{
bogus = 1;
} // else
if (!bogus)
{
state->token++; // skip '<' or '\"'...
const unsigned int len = ((unsigned int) (state->source-state->token));
filename = (char *) alloca(len);
memcpy(filename, state->token, len-1);
filename[len-1] = '\0';
Feb 14, 2009
Feb 14, 2009
629
bogus = !require_newline(state);
Feb 13, 2009
Feb 13, 2009
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
} // 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
if (!push_source(ctx, filename, newdata, newbytes, 1))
{
assert(ctx->out_of_memory);
ctx->close_callback(newdata, ctx->malloc, ctx->free, ctx->malloc_data);
} // if
} // handle_pp_include
Feb 14, 2009
Feb 14, 2009
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
static void handle_pp_line(Context *ctx)
{
IncludeState *state = ctx->include_stack;
char *filename = NULL;
int linenum = 0;
int bogus = 0;
if (preprocessor_internal_lexer(state) != TOKEN_INT_LITERAL)
bogus = 1;
else
{
const unsigned int len = ((unsigned int) (state->source-state->token));
char *buf = (char *) alloca(len+1);
memcpy(buf, state->token, len);
buf[len] = '\0';
linenum = atoi(buf);
} // else
if (!bogus)
bogus = (preprocessor_internal_lexer(state) != TOKEN_STRING_LITERAL);
if (!bogus)
{
state->token++; // skip '\"'...
const unsigned int len = ((unsigned int) (state->source-state->token));
filename = (char *) alloca(len);
memcpy(filename, state->token, len-1);
filename[len-1] = '\0';
bogus = !require_newline(state);
} // if
if (bogus)
{
fail(ctx, "Invalid #line directive");
return;
} // if
const char *cached = cache_filename(ctx, filename);
assert((cached != NULL) || (ctx->out_of_memory));
state->filename = cached;
state->line = linenum;
} // handle_pp_line
Feb 15, 2009
Feb 15, 2009
700
// !!! FIXME: this should use the lexer, apparently gcc does so.
Feb 13, 2009
Feb 13, 2009
701
702
703
704
705
706
static void handle_pp_error(Context *ctx)
{
IncludeState *state = ctx->include_stack;
const char *data = NULL;
int done = 0;
Feb 14, 2009
Feb 14, 2009
707
const char *source = NULL;
Feb 13, 2009
Feb 13, 2009
708
709
while (!done)
{
Feb 14, 2009
Feb 14, 2009
710
source = state->source;
Feb 13, 2009
Feb 13, 2009
711
712
713
714
const Token token = preprocessor_internal_lexer(state);
switch (token)
{
case ((Token) '\n'):
Feb 14, 2009
Feb 14, 2009
715
716
717
state->line--; // make sure error is on the right line.
// fall through!
case TOKEN_INCOMPLETE_COMMENT:
Feb 13, 2009
Feb 13, 2009
718
719
720
721
722
723
724
725
726
727
728
case TOKEN_EOI:
done = 1;
break;
default:
if (data == NULL)
data = state->token; // skip #error token.
break;
} // switch
} // while
Feb 14, 2009
Feb 14, 2009
729
730
state->source = source; // move back so we catch this later.
Feb 13, 2009
Feb 13, 2009
731
732
733
734
735
736
737
738
739
740
741
742
const char *prefix = "#error ";
const size_t prefixlen = strlen(prefix);
const int len = (int) (state->source - data);
const int cpy = Min(len, sizeof (ctx->failstr) - prefixlen);
strcpy(ctx->failstr, prefix);
if (cpy > 0)
memcpy(ctx->failstr + prefixlen, data, cpy);
ctx->failstr[cpy + prefixlen] = '\0';
ctx->isfail = 1;
} // handle_pp_error
Feb 14, 2009
Feb 14, 2009
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
static void handle_pp_undef(Context *ctx)
{
IncludeState *state = ctx->include_stack;
if (preprocessor_internal_lexer(state) != TOKEN_IDENTIFIER)
{
fail(ctx, "Macro names must be indentifiers");
return;
} // if
const unsigned int len = ((unsigned int) (state->source-state->token));
char *sym = (char *) alloca(len);
memcpy(sym, state->token, len-1);
sym[len-1] = '\0';
if (!require_newline(state))
{
fail(ctx, "Invalid #undef directive");
return;
} // if
remove_define(ctx, sym);
} // handle_pp_undef
Feb 14, 2009
Feb 14, 2009
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
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
static Conditional *_handle_pp_ifdef(Context *ctx, const Token type)
{
IncludeState *state = ctx->include_stack;
assert((type == TOKEN_PP_IFDEF) || (type == TOKEN_PP_IFNDEF));
if (preprocessor_internal_lexer(state) != TOKEN_IDENTIFIER)
{
fail(ctx, "Macro names must be indentifiers");
return NULL;
} // if
const unsigned int len = ((unsigned int) (state->source-state->token));
char *sym = (char *) alloca(len);
memcpy(sym, state->token, len-1);
sym[len-1] = '\0';
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
conditional->type = type;
conditional->linenum = state->line - 1;
conditional->skipping = skipping;
Feb 15, 2009
Feb 15, 2009
813
conditional->chosen = !skipping;
Feb 14, 2009
Feb 14, 2009
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
conditional->next = prev;
state->conditional_stack = conditional;
return conditional;
} // _handle_pp_ifdef
static inline void handle_pp_ifdef(Context *ctx)
{
_handle_pp_ifdef(ctx, TOKEN_PP_IFDEF);
} // handle_pp_ifdef
static inline void handle_pp_ifndef(Context *ctx)
{
_handle_pp_ifdef(ctx, TOKEN_PP_IFNDEF);
} // handle_pp_ifndef
Feb 15, 2009
Feb 15, 2009
832
833
834
835
836
837
838
839
840
841
842
843
844
845
static inline void handle_pp_else(Context *ctx)
{
IncludeState *state = ctx->include_stack;
Conditional *cond = state->conditional_stack;
if (!require_newline(state))
fail(ctx, "Invalid #else directive");
else if (cond == NULL)
fail(ctx, "#else without #if");
else if (cond->type == TOKEN_PP_ELSE)
fail(ctx, "#else after #else");
else
{
cond->type = TOKEN_PP_ELSE;
Feb 15, 2009
Feb 15, 2009
846
847
848
cond->skipping = cond->chosen;
if (!cond->chosen)
cond->chosen = 1;
Feb 15, 2009
Feb 15, 2009
849
850
851
852
} // else
} // handle_pp_else
Feb 14, 2009
Feb 14, 2009
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
static void handle_pp_endif(Context *ctx)
{
IncludeState *state = ctx->include_stack;
Conditional *cond = state->conditional_stack;
if (!require_newline(state))
fail(ctx, "Invalid #endif directive");
else if (cond == NULL)
fail(ctx, "Unmatched #endif");
else
{
state->conditional_stack = cond->next; // pop it.
cond->next = NULL;
put_conditionals(ctx, cond);
} // else
} // handle_pp_endif
Feb 14, 2009
Feb 14, 2009
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
static void unterminated_pp_condition(Context *ctx)
{
IncludeState *state = ctx->include_stack;
Conditional *cond = state->conditional_stack;
// !!! FIXME: report the line number where the #if is, not the EOI.
switch (cond->type)
{
case TOKEN_PP_IF: fail(ctx, "Unterminated #if"); break;
case TOKEN_PP_IFDEF: fail(ctx, "Unterminated #ifdef"); break;
case TOKEN_PP_IFNDEF: fail(ctx, "Unterminated #ifndef"); break;
case TOKEN_PP_ELSE: fail(ctx, "Unterminated #else"); break;
case TOKEN_PP_ELIF: fail(ctx, "Unterminated #elif"); break;
default: assert(0 && "Shouldn't hit this case"); break;
} // switch
// pop this conditional, we'll report the next error next time...
state->conditional_stack = cond->next; // pop it.
cond->next = NULL;
put_conditionals(ctx, cond);
} // unterminated_pp_condition
Feb 10, 2009
Feb 10, 2009
895
896
static inline const char *_preprocessor_nexttoken(Preprocessor *_ctx,
unsigned int *_len, Token *_token)
897
898
899
900
901
{
Context *ctx = (Context *) _ctx;
while (1)
{
Feb 13, 2009
Feb 13, 2009
902
903
904
905
906
907
908
909
if (ctx->isfail)
{
ctx->isfail = 0;
*_token = TOKEN_PREPROCESSING_ERROR;
*_len = strlen(ctx->failstr);
return ctx->failstr;
} // if
910
911
IncludeState *state = ctx->include_stack;
if (state == NULL)
Feb 10, 2009
Feb 10, 2009
912
913
914
{
*_token = TOKEN_EOI;
*_len = 0;
915
return NULL; // we're done!
Feb 10, 2009
Feb 10, 2009
916
} // if
Feb 13, 2009
Feb 13, 2009
918
919
920
921
922
// !!! FIXME: todo.
// TOKEN_PP_DEFINE,
// TOKEN_PP_IF,
// TOKEN_PP_ELIF,
Feb 14, 2009
Feb 14, 2009
923
924
925
const Conditional *cond = state->conditional_stack;
const int skipping = ((cond != NULL) && (cond->skipping));
926
927
928
929
Token token = preprocessor_internal_lexer(state);
if (token == TOKEN_EOI)
{
assert(state->bytes_left == 0);
Feb 14, 2009
Feb 14, 2009
930
931
932
933
934
935
if (state->conditional_stack != NULL)
{
unterminated_pp_condition(ctx);
continue; // returns an error.
} // if
936
937
938
939
pop_source(ctx);
continue; // pick up again after parent's #include line.
} // if
Feb 13, 2009
Feb 13, 2009
940
else if (token == TOKEN_INCOMPLETE_COMMENT)
Feb 12, 2009
Feb 12, 2009
941
942
{
fail(ctx, "Incomplete multiline comment");
Feb 13, 2009
Feb 13, 2009
943
continue; // will return at top of loop.
Feb 12, 2009
Feb 12, 2009
944
945
} // else if
Feb 14, 2009
Feb 14, 2009
946
947
948
949
950
951
952
953
954
955
956
957
else if (token == TOKEN_PP_IFDEF)
{
handle_pp_ifdef(ctx);
continue; // get the next thing.
} // else if
else if (token == TOKEN_PP_IFNDEF)
{
handle_pp_ifndef(ctx);
continue; // get the next thing.
} // else if
Feb 14, 2009
Feb 14, 2009
958
959
960
961
962
963
else if (token == TOKEN_PP_ENDIF)
{
handle_pp_endif(ctx);
continue; // get the next thing.
} // else if
Feb 15, 2009
Feb 15, 2009
964
965
966
967
968
969
else if (token == TOKEN_PP_ELSE)
{
handle_pp_else(ctx);
continue; // get the next thing.
} // else if
Feb 14, 2009
Feb 14, 2009
970
// NOTE: Conditionals must be above (skipping) test.
Feb 14, 2009
Feb 14, 2009
971
972
973
else if (skipping)
continue; // just keep dumping tokens until we get end of block.
Feb 13, 2009
Feb 13, 2009
974
975
976
977
978
979
else if (token == TOKEN_PP_INCLUDE)
{
handle_pp_include(ctx);
continue; // will return error or use new top of include_stack.
} // else if
Feb 14, 2009
Feb 14, 2009
980
981
982
983
984
985
else if (token == TOKEN_PP_LINE)
{
handle_pp_line(ctx);
continue; // get the next thing.
} // else if
Feb 13, 2009
Feb 13, 2009
986
987
988
989
990
991
else if (token == TOKEN_PP_ERROR)
{
handle_pp_error(ctx);
continue; // will return at top of loop.
} // else if
Feb 14, 2009
Feb 14, 2009
992
993
994
995
996
997
else if (token == TOKEN_PP_UNDEF)
{
handle_pp_undef(ctx);
continue; // will return at top of loop.
} // else if
Feb 14, 2009
Feb 14, 2009
998
999
1000
assert(!skipping);
*_token = token;
*_len = (unsigned int) (state->source - state->token);