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
|
/**************************************************************************
*
* 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_macro.h"
#include "sl_pp_process.h"
static void
skip_whitespace(const struct sl_pp_token_info *input,
unsigned int *pi)
{
while (input[*pi].token == SL_PP_WHITESPACE) {
(*pi)++;
}
}
void
sl_pp_macro_free(struct sl_pp_macro *macro)
{
while (macro) {
struct sl_pp_macro *next_macro = macro->next;
struct sl_pp_macro_formal_arg *arg = macro->arg;
while (arg) {
struct sl_pp_macro_formal_arg *next_arg = arg->next;
free(arg);
arg = next_arg;
}
free(macro->body);
free(macro);
macro = next_macro;
}
}
int
sl_pp_macro_expand(struct sl_pp_context *context,
const struct sl_pp_token_info *input,
unsigned int *pi,
struct sl_pp_macro *local,
struct sl_pp_process_state *state)
{
int macro_name;
struct sl_pp_macro *macro = NULL;
struct sl_pp_macro *actual_arg = NULL;
unsigned int j;
if (input[*pi].token != SL_PP_IDENTIFIER) {
return -1;
}
macro_name = input[*pi].data.identifier;
if (local) {
for (macro = local; macro; macro = macro->next) {
if (macro->name == macro_name) {
break;
}
}
}
if (!macro) {
for (macro = context->macro; macro; macro = macro->next) {
if (macro->name == macro_name) {
break;
}
}
}
if (!macro) {
if (sl_pp_process_out(state, &input[*pi])) {
return -1;
}
(*pi)++;
return 0;
}
(*pi)++;
if (macro->num_args >= 0) {
skip_whitespace(input, pi);
if (input[*pi].token != SL_PP_LPAREN) {
return -1;
}
(*pi)++;
skip_whitespace(input, pi);
}
if (macro->num_args > 0) {
struct sl_pp_macro_formal_arg *formal_arg = macro->arg;
struct sl_pp_macro **pmacro = &actual_arg;
for (j = 0; j < (unsigned int)macro->num_args; j++) {
unsigned int body_len;
unsigned int i;
int done = 0;
unsigned int paren_nesting = 0;
unsigned int k;
*pmacro = malloc(sizeof(struct sl_pp_macro));
if (!*pmacro) {
return -1;
}
(**pmacro).name = formal_arg->name;
(**pmacro).num_args = -1;
(**pmacro).arg = NULL;
(**pmacro).body = NULL;
(**pmacro).next = NULL;
body_len = 1;
for (i = *pi; !done; i++) {
switch (input[i].token) {
case SL_PP_WHITESPACE:
break;
case SL_PP_COMMA:
if (!paren_nesting) {
if (j < (unsigned int)macro->num_args - 1) {
done = 1;
} else {
return -1;
}
} else {
body_len++;
}
break;
case SL_PP_LPAREN:
paren_nesting++;
body_len++;
break;
case SL_PP_RPAREN:
if (!paren_nesting) {
if (j == (unsigned int)macro->num_args - 1) {
done = 1;
} else {
return -1;
}
} else {
paren_nesting--;
body_len++;
}
break;
case SL_PP_EOF:
return -1;
default:
body_len++;
}
}
(**pmacro).body = malloc(sizeof(struct sl_pp_token_info) * body_len);
if (!(**pmacro).body) {
return -1;
}
for (done = 0, k = 0, i = *pi; !done; i++) {
switch (input[i].token) {
case SL_PP_WHITESPACE:
break;
case SL_PP_COMMA:
if (!paren_nesting && j < (unsigned int)macro->num_args - 1) {
done = 1;
} else {
(**pmacro).body[k++] = input[i];
}
break;
case SL_PP_LPAREN:
paren_nesting++;
(**pmacro).body[k++] = input[i];
break;
case SL_PP_RPAREN:
if (!paren_nesting && j == (unsigned int)macro->num_args - 1) {
done = 1;
} else {
paren_nesting--;
(**pmacro).body[k++] = input[i];
}
break;
default:
(**pmacro).body[k++] = input[i];
}
}
(**pmacro).body[k++].token = SL_PP_EOF;
(*pi) = i;
formal_arg = formal_arg->next;
pmacro = &(**pmacro).next;
}
}
/* Right paren for non-empty argument list has already been eaten. */
if (macro->num_args == 0) {
skip_whitespace(input, pi);
if (input[*pi].token != SL_PP_RPAREN) {
return -1;
}
(*pi)++;
}
for (j = 0;;) {
switch (macro->body[j].token) {
case SL_PP_IDENTIFIER:
if (sl_pp_macro_expand(context, macro->body, &j, actual_arg, state)) {
return -1;
}
break;
case SL_PP_EOF:
sl_pp_macro_free(actual_arg);
return 0;
default:
if (sl_pp_process_out(state, ¯o->body[j])) {
return -1;
}
j++;
}
}
}
|
