1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
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
241
242
243
244
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
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
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
|
/**************************************************************************
*
* Copyright 2009 VMware, Inc.
* All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sub license, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice (including the
* next paragraph) shall be included in all copies or substantial portions
* of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
* IN NO EVENT SHALL TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR
* ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
**************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "../pp/sl_pp_context.h"
#include "../pp/sl_pp_purify.h"
#include "../pp/sl_pp_version.h"
#include "../pp/sl_pp_process.h"
int
main(int argc,
char *argv[])
{
FILE *in;
long size;
char *inbuf;
struct sl_pp_purify_options options;
char *outbuf;
struct sl_pp_context context;
struct sl_pp_token_info *tokens;
unsigned int version;
unsigned int tokens_eaten;
struct sl_pp_token_info *outtokens;
FILE *out;
unsigned int i;
if (argc != 3) {
return 1;
}
in = fopen(argv[1], "rb");
if (!in) {
return 1;
}
fseek(in, 0, SEEK_END);
size = ftell(in);
fseek(in, 0, SEEK_SET);
inbuf = malloc(size + 1);
if (!inbuf) {
fclose(in);
return 1;
}
if (fread(inbuf, 1, size, in) != size) {
free(inbuf);
fclose(in);
return 1;
}
inbuf[size] = '\0';
fclose(in);
memset(&options, 0, sizeof(options));
if (sl_pp_purify(inbuf, &options, &outbuf)) {
free(inbuf);
return 1;
}
free(inbuf);
sl_pp_context_init(&context);
if (sl_pp_tokenise(&context, outbuf, &tokens)) {
sl_pp_context_destroy(&context);
free(outbuf);
return 1;
}
free(outbuf);
if (sl_pp_version(&context, tokens, &version, &tokens_eaten)) {
sl_pp_context_destroy(&context);
free(tokens);
return -1;
}
out = fopen(argv[2], "wb");
if (!out) {
sl_pp_context_destroy(&context);
free(tokens);
return 1;
}
if (sl_pp_process(&context, &tokens[tokens_eaten], &outtokens)) {
fprintf(out, "$ERROR: `%s'\n", context.error_msg);
sl_pp_context_destroy(&context);
free(tokens);
fclose(out);
return -1;
}
free(tokens);
for (i = 0; outtokens[i].token != SL_PP_EOF; i++) {
switch (outtokens[i].token) {
case SL_PP_NEWLINE:
fprintf(out, "\n");
break;
case SL_PP_COMMA:
fprintf(out, ", ");
break;
case SL_PP_SEMICOLON:
fprintf(out, "; ");
break;
case SL_PP_LBRACE:
fprintf(out, "{ ");
break;
case SL_PP_RBRACE:
fprintf(out, "} ");
break;
case SL_PP_LPAREN:
fprintf(out, "( ");
break;
case SL_PP_RPAREN:
fprintf(out, ") ");
break;
case SL_PP_LBRACKET:
fprintf(out, "[ ");
break;
case SL_PP_RBRACKET:
fprintf(out, "] ");
break;
case SL_PP_DOT:
fprintf(out, ". ");
break;
case SL_PP_INCREMENT:
fprintf(out, "++ ");
break;
case SL_PP_ADDASSIGN:
fprintf(out, "+= ");
break;
case SL_PP_PLUS:
fprintf(out, "+ ");
break;
case SL_PP_DECREMENT:
fprintf(out, "-- ");
break;
case SL_PP_SUBASSIGN:
fprintf(out, "-= ");
break;
case SL_PP_MINUS:
fprintf(out, "- ");
break;
case SL_PP_BITNOT:
fprintf(out, "~ ");
break;
case SL_PP_NOTEQUAL:
fprintf(out, "!= ");
break;
case SL_PP_NOT:
fprintf(out, "! ");
break;
case SL_PP_MULASSIGN:
fprintf(out, "*= ");
break;
case SL_PP_STAR:
fprintf(out, "* ");
break;
case SL_PP_DIVASSIGN:
fprintf(out, "/= ");
break;
case SL_PP_SLASH:
fprintf(out, "/ ");
break;
case SL_PP_MODASSIGN:
fprintf(out, "%= ");
break;
case SL_PP_MODULO:
fprintf(out, "% ");
break;
case SL_PP_LSHIFTASSIGN:
fprintf(out, "<<= ");
break;
case SL_PP_LSHIFT:
fprintf(out, "<< ");
break;
case SL_PP_LESSEQUAL:
fprintf(out, "<= ");
break;
case SL_PP_LESS:
fprintf(out, "< ");
break;
case SL_PP_RSHIFTASSIGN:
fprintf(out, ">>= ");
break;
case SL_PP_RSHIFT:
fprintf(out, ">> ");
break;
case SL_PP_GREATEREQUAL:
fprintf(out, ">= ");
break;
case SL_PP_GREATER:
fprintf(out, "> ");
break;
case SL_PP_EQUAL:
fprintf(out, "== ");
break;
case SL_PP_ASSIGN:
fprintf(out, "= ");
break;
case SL_PP_AND:
fprintf(out, "&& ");
break;
case SL_PP_BITANDASSIGN:
fprintf(out, "&= ");
break;
case SL_PP_BITAND:
fprintf(out, "& ");
break;
case SL_PP_XOR:
fprintf(out, "^^ ");
break;
case SL_PP_BITXORASSIGN:
fprintf(out, "^= ");
break;
case SL_PP_BITXOR:
fprintf(out, "^ ");
break;
case SL_PP_OR:
fprintf(out, "|| ");
break;
case SL_PP_BITORASSIGN:
fprintf(out, "|= ");
break;
case SL_PP_BITOR:
fprintf(out, "| ");
break;
case SL_PP_QUESTION:
fprintf(out, "? ");
break;
case SL_PP_COLON:
fprintf(out, ": ");
break;
case SL_PP_IDENTIFIER:
fprintf(out, "%s ", sl_pp_context_cstr(&context, outtokens[i].data.identifier));
break;
case SL_PP_NUMBER:
fprintf(out, "%s ", sl_pp_context_cstr(&context, outtokens[i].data.number));
break;
case SL_PP_OTHER:
fprintf(out, "%c", outtokens[i].data.other);
break;
case SL_PP_PRAGMA_OPTIMIZE:
fprintf(out, "#pragma optimize(%s)", outtokens[i].data.pragma ? "on" : "off");
break;
case SL_PP_PRAGMA_DEBUG:
fprintf(out, "#pragma debug(%s)", outtokens[i].data.pragma ? "on" : "off");
break;
case SL_PP_EXTENSION_REQUIRE:
fprintf(out, "#extension %s : require", sl_pp_context_cstr(&context, outtokens[i].data.extension));
break;
case SL_PP_EXTENSION_ENABLE:
fprintf(out, "#extension %s : enable", sl_pp_context_cstr(&context, outtokens[i].data.extension));
break;
case SL_PP_EXTENSION_WARN:
fprintf(out, "#extension %s : warn", sl_pp_context_cstr(&context, outtokens[i].data.extension));
break;
case SL_PP_EXTENSION_DISABLE:
fprintf(out, "#extension %s : disable", sl_pp_context_cstr(&context, outtokens[i].data.extension));
break;
case SL_PP_LINE:
fprintf(out, "#line %u", outtokens[i].data.line);
break;
case SL_PP_FILE:
fprintf(out, " #file %u", outtokens[i].data.file);
break;
default:
assert(0);
}
}
sl_pp_context_destroy(&context);
free(outtokens);
fclose(out);
return 0;
}
|
