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
|
/**************************************************************************
*
* 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 <stdlib.h>
#include "sl_pp_purify.h"
/*
* Preprocessor purifier performs the following tasks.
* - Convert all variants of newlines into a Unix newline.
* - Merge continued lines into a single long line.
* - Remove line comments and replace block comments with whitespace.
*/
static unsigned int
_purify_newline(const char *input,
char *out)
{
if (input[0] == '\n') {
*out = '\n';
if (input[1] == '\r') {
/*
* The GLSL spec is not explicit about whether this
* combination is a valid newline or not.
* Let's assume it is acceptable.
*/
return 2;
}
return 1;
}
if (input[0] == '\r') {
*out = '\n';
if (input[1] == '\n') {
return 2;
}
return 1;
}
*out = input[0];
return 1;
}
static unsigned int
_purify_backslash(const char *input,
char *out)
{
unsigned int eaten = 0;
for (;;) {
if (input[0] == '\\') {
char next;
unsigned int next_eaten;
eaten++;
input++;
next_eaten = _purify_newline(input, &next);
if (next == '\n') {
/*
* If this is really a line continuation sequence, eat
* it and do not exit the loop.
*/
eaten += next_eaten;
input += next_eaten;
} else {
/*
* It is an error to put anything between a backslash
* and a newline and still expect it to behave like a line
* continuation sequence.
* Even if it is an innocent whitespace.
*/
*out = '\\';
break;
}
} else {
eaten += _purify_newline(input, out);
break;
}
}
return eaten;
}
struct out_buf {
char *out;
unsigned int len;
unsigned int capacity;
};
static int
_out_buf_putc(struct out_buf *obuf,
char c)
{
if (obuf->len >= obuf->capacity) {
unsigned int new_max = obuf->capacity;
if (new_max < 0x100) {
new_max = 0x100;
} else if (new_max < 0x10000) {
new_max *= 2;
} else {
new_max += 0x10000;
}
obuf->out = realloc(obuf->out, new_max);
if (!obuf->out) {
return -1;
}
obuf->capacity = new_max;
}
obuf->out[obuf->len++] = c;
return 0;
}
static unsigned int
_purify_comment(const char *input,
struct out_buf *obuf)
{
unsigned int eaten;
char curr;
eaten = _purify_backslash(input, &curr);
input += eaten;
if (curr == '/') {
char next;
unsigned int next_eaten;
next_eaten = _purify_backslash(input, &next);
if (next == '/') {
eaten += next_eaten;
input += next_eaten;
/* Replace a line comment with either a newline or nil. */
for (;;) {
next_eaten = _purify_backslash(input, &next);
eaten += next_eaten;
input += next_eaten;
if (next == '\n' || next == '\0') {
if (_out_buf_putc(obuf, next)) {
return 0;
}
return eaten;
}
}
} else if (next == '*') {
eaten += next_eaten;
input += next_eaten;
/* Replace a block comment with a whitespace. */
for (;;) {
next_eaten = _purify_backslash(input, &next);
eaten += next_eaten;
input += next_eaten;
while (next == '*') {
next_eaten = _purify_backslash(input, &next);
eaten += next_eaten;
input += next_eaten;
if (next == '/') {
if (_out_buf_putc(obuf, ' ')) {
return 0;
}
return eaten;
}
}
if (next == '\n') {
if (_out_buf_putc(obuf, '\n')) {
return 0;
}
}
if (next == '\0') {
return 0;
}
}
}
}
if (_out_buf_putc(obuf, curr)) {
return 0;
}
return eaten;
}
int
sl_pp_purify(const char *input,
const struct sl_pp_purify_options *options,
char **output)
{
struct out_buf obuf;
obuf.out = NULL;
obuf.len = 0;
obuf.capacity = 0;
for (;;) {
unsigned int eaten;
eaten = _purify_comment(input, &obuf);
if (!eaten) {
return -1;
}
input += eaten;
if (obuf.out[obuf.len - 1] == '\0') {
break;
}
}
*output = obuf.out;
return 0;
}
|
