|
17
|
1 #include <stdlib.h>
|
|
|
2 #include <string.h>
|
|
|
3
|
|
|
4 #include "array.h"
|
|
|
5 #include "mode.h"
|
|
|
6 #include "place.h"
|
|
|
7 #include "macro.h"
|
|
19
|
8 #include "output.h"
|
|
|
9
|
|
|
10 struct expansionitem {
|
|
|
11 bool isstring;
|
|
|
12 union {
|
|
|
13 char *string;
|
|
|
14 unsigned param;
|
|
|
15 };
|
|
|
16 };
|
|
|
17 DECLARRAY(expansionitem);
|
|
|
18 DEFARRAY(expansionitem, );
|
|
17
|
19
|
|
|
20 struct macro {
|
|
|
21 struct place defplace;
|
|
|
22 struct place expansionplace;
|
|
|
23 unsigned hash;
|
|
|
24 char *name;
|
|
18
|
25 bool hasparams;
|
|
|
26 struct stringarray params;
|
|
19
|
27 struct expansionitemarray expansion;
|
|
|
28 bool inuse;
|
|
17
|
29 };
|
|
|
30 DECLARRAY(macro);
|
|
|
31 DEFARRAY(macro, );
|
|
|
32 DECLARRAY(macroarray);
|
|
|
33 DEFARRAY(macroarray, );
|
|
|
34
|
|
|
35 static struct macroarrayarray macros;
|
|
|
36 static unsigned total_macros;
|
|
|
37 static unsigned hashmask;
|
|
|
38
|
|
|
39 ////////////////////////////////////////////////////////////
|
|
|
40 // macro structure ops
|
|
|
41
|
|
|
42 static
|
|
19
|
43 struct expansionitem *
|
|
|
44 expansionitem_create_string(const char *string)
|
|
|
45 {
|
|
|
46 struct expansionitem *ei;
|
|
|
47
|
|
|
48 ei = domalloc(sizeof(*ei));
|
|
|
49 ei->isstring = true;
|
|
|
50 ei->string = dostrdup(string);
|
|
|
51 return ei;
|
|
|
52 }
|
|
|
53
|
|
|
54 static
|
|
|
55 struct expansionitem *
|
|
|
56 expansionitem_create_stringlen(const char *string, size_t len)
|
|
|
57 {
|
|
|
58 struct expansionitem *ei;
|
|
|
59
|
|
|
60 ei = domalloc(sizeof(*ei));
|
|
|
61 ei->isstring = true;
|
|
|
62 ei->string = dostrndup(string, len);
|
|
|
63 return ei;
|
|
|
64 }
|
|
|
65
|
|
|
66 static
|
|
|
67 struct expansionitem *
|
|
|
68 expansionitem_create_param(unsigned param)
|
|
|
69 {
|
|
|
70 struct expansionitem *ei;
|
|
|
71
|
|
|
72 ei = domalloc(sizeof(*ei));
|
|
|
73 ei->isstring = false;
|
|
|
74 ei->param = param;
|
|
|
75 return ei;
|
|
|
76 }
|
|
|
77
|
|
|
78 static
|
|
|
79 void
|
|
|
80 expansionitem_destroy(struct expansionitem *ei)
|
|
|
81 {
|
|
|
82 if (ei->isstring) {
|
|
|
83 free(ei->string);
|
|
|
84 }
|
|
|
85 free(ei);
|
|
|
86 }
|
|
|
87
|
|
|
88 static
|
|
|
89 bool
|
|
|
90 expansionitem_eq(const struct expansionitem *ei1,
|
|
|
91 const struct expansionitem *ei2)
|
|
|
92 {
|
|
|
93 if (ei1->isstring != ei2->isstring) {
|
|
|
94 return false;
|
|
|
95 }
|
|
|
96 if (ei1->isstring) {
|
|
|
97 if (strcmp(ei1->string, ei2->string) != 0) {
|
|
|
98 return false;
|
|
|
99 }
|
|
|
100 } else {
|
|
|
101 if (ei1->param != ei2->param) {
|
|
|
102 return false;
|
|
|
103 }
|
|
|
104 }
|
|
|
105 return true;
|
|
|
106 }
|
|
|
107
|
|
|
108 static
|
|
17
|
109 struct macro *
|
|
18
|
110 macro_create(struct place *p1, const char *name, unsigned hash,
|
|
19
|
111 struct place *p2)
|
|
17
|
112 {
|
|
|
113 struct macro *m;
|
|
|
114
|
|
|
115 m = domalloc(sizeof(*m));
|
|
|
116 m->defplace = *p1;
|
|
|
117 m->expansionplace = *p2;
|
|
|
118 m->hash = hash;
|
|
|
119 m->name = dostrdup(name);
|
|
18
|
120 m->hasparams = false;
|
|
|
121 stringarray_init(&m->params);
|
|
19
|
122 expansionitemarray_init(&m->expansion);
|
|
|
123 m->inuse = false;
|
|
17
|
124 return m;
|
|
|
125 }
|
|
|
126
|
|
19
|
127 DESTROYALL_ARRAY(expansionitem, );
|
|
|
128
|
|
17
|
129 static
|
|
|
130 void
|
|
|
131 macro_destroy(struct macro *m)
|
|
|
132 {
|
|
19
|
133 expansionitemarray_destroyall(&m->expansion);
|
|
|
134 expansionitemarray_cleanup(&m->expansion);
|
|
17
|
135 free(m->name);
|
|
|
136 free(m);
|
|
|
137 }
|
|
|
138
|
|
18
|
139 static
|
|
|
140 bool
|
|
|
141 macro_eq(const struct macro *m1, const struct macro *m2)
|
|
|
142 {
|
|
|
143 unsigned num1, num2, i;
|
|
19
|
144 struct expansionitem *ei1, *ei2;
|
|
18
|
145 const char *p1, *p2;
|
|
|
146
|
|
|
147 if (strcmp(m1->name, m2->name) != 0) {
|
|
|
148 return false;
|
|
|
149 }
|
|
|
150
|
|
|
151 if (m1->hasparams != m2->hasparams) {
|
|
|
152 return false;
|
|
|
153 }
|
|
|
154
|
|
19
|
155 num1 = expansionitemarray_num(&m1->expansion);
|
|
|
156 num2 = expansionitemarray_num(&m2->expansion);
|
|
|
157 if (num1 != num2) {
|
|
18
|
158 return false;
|
|
|
159 }
|
|
|
160
|
|
19
|
161 for (i=0; i<num1; i++) {
|
|
|
162 ei1 = expansionitemarray_get(&m1->expansion, i);
|
|
|
163 ei2 = expansionitemarray_get(&m2->expansion, i);
|
|
|
164 if (!expansionitem_eq(ei1, ei2)) {
|
|
|
165 return false;
|
|
|
166 }
|
|
|
167 }
|
|
|
168
|
|
18
|
169 num1 = stringarray_num(&m1->params);
|
|
|
170 num2 = stringarray_num(&m2->params);
|
|
|
171 if (num1 != num2) {
|
|
|
172 return false;
|
|
|
173 }
|
|
|
174
|
|
|
175 for (i=0; i<num1; i++) {
|
|
|
176 p1 = stringarray_get(&m1->params, i);
|
|
|
177 p2 = stringarray_get(&m2->params, i);
|
|
|
178 if (strcmp(p1, p2) != 0) {
|
|
|
179 return false;
|
|
|
180 }
|
|
|
181 }
|
|
|
182 return true;
|
|
|
183 }
|
|
|
184
|
|
17
|
185 ////////////////////////////////////////////////////////////
|
|
|
186 // macro table
|
|
|
187
|
|
|
188 /*
|
|
|
189 * Unless I've screwed up, this is something called Fletcher's Checksum
|
|
|
190 * that showed up in Dr. Dobbs in, according to my notes, May 1992. The
|
|
|
191 * implementation is new.
|
|
|
192 */
|
|
|
193 static
|
|
|
194 unsigned
|
|
19
|
195 hashfunc(const char *s, size_t len)
|
|
17
|
196 {
|
|
|
197 uint16_t x1, x2, a;
|
|
19
|
198 size_t i;
|
|
17
|
199
|
|
|
200 x1 = (uint16_t) (len >> 16);
|
|
|
201 x2 = (uint16_t) (len);
|
|
|
202 if (x1==0) {
|
|
|
203 x1++;
|
|
|
204 }
|
|
|
205 if (x2==0) {
|
|
|
206 x2++;
|
|
|
207 }
|
|
|
208
|
|
|
209 for (i=0; i<len; i+=2) {
|
|
|
210 if (i==len-1) {
|
|
|
211 a = (unsigned char)s[i];
|
|
|
212 /* don't run off the end of the array */
|
|
|
213 }
|
|
|
214 else {
|
|
|
215 a = (unsigned char)s[i] +
|
|
|
216 ((uint16_t)(unsigned char)s[i+1] << 8);
|
|
|
217 }
|
|
|
218 x1 += a;
|
|
|
219 if (x1 < a) {
|
|
|
220 x1++;
|
|
|
221 }
|
|
|
222 x2 += x1;
|
|
|
223 if (x2 < x1) {
|
|
|
224 x2++;
|
|
|
225 }
|
|
|
226 }
|
|
|
227
|
|
|
228 x1 ^= 0xffff;
|
|
|
229 x2 ^= 0xffff;
|
|
|
230 return ((uint32_t)x2)*65535U + x1;
|
|
|
231 }
|
|
|
232
|
|
|
233 static
|
|
|
234 void
|
|
|
235 macrotable_init(void)
|
|
|
236 {
|
|
|
237 unsigned i;
|
|
|
238
|
|
|
239 macroarrayarray_init(¯os);
|
|
|
240 macroarrayarray_setsize(¯os, 4);
|
|
|
241 for (i=0; i<4; i++) {
|
|
|
242 macroarrayarray_set(¯os, i, NULL);
|
|
|
243 }
|
|
|
244 total_macros = 0;
|
|
|
245 hashmask = 0x3;
|
|
|
246 }
|
|
|
247
|
|
|
248 DESTROYALL_ARRAY(macro, );
|
|
|
249
|
|
|
250 static
|
|
|
251 void
|
|
|
252 macrotable_cleanup(void)
|
|
|
253 {
|
|
|
254 struct macroarray *bucket;
|
|
|
255 unsigned numbuckets, i;
|
|
|
256
|
|
|
257 numbuckets = macroarrayarray_num(¯os);
|
|
|
258 for (i=0; i<numbuckets; i++) {
|
|
|
259 bucket = macroarrayarray_get(¯os, i);
|
|
|
260 macroarray_destroyall(bucket);
|
|
|
261 macroarray_destroy(bucket);
|
|
|
262 }
|
|
|
263 macroarrayarray_setsize(¯os, 0);
|
|
|
264 macroarrayarray_cleanup(¯os);
|
|
|
265 }
|
|
|
266
|
|
|
267 static
|
|
|
268 struct macro *
|
|
19
|
269 macrotable_findlen(const char *name, size_t len, bool remove)
|
|
17
|
270 {
|
|
|
271 unsigned hash;
|
|
|
272 struct macroarray *bucket;
|
|
|
273 struct macro *m, *m2;
|
|
|
274 unsigned i, num;
|
|
19
|
275 size_t mlen;
|
|
17
|
276
|
|
19
|
277 hash = hashfunc(name, len);
|
|
17
|
278 bucket = macroarrayarray_get(¯os, hash & hashmask);
|
|
|
279 if (bucket == NULL) {
|
|
|
280 return NULL;
|
|
|
281 }
|
|
|
282 num = macroarray_num(bucket);
|
|
|
283 for (i=0; i<num; i++) {
|
|
|
284 m = macroarray_get(bucket, i);
|
|
|
285 if (hash != m->hash) {
|
|
|
286 continue;
|
|
|
287 }
|
|
19
|
288 mlen = strlen(m->name);
|
|
|
289 if (len == mlen && !memcmp(name, m->name, len)) {
|
|
17
|
290 if (remove) {
|
|
|
291 if (i < num-1) {
|
|
|
292 m2 = macroarray_get(bucket, num-1);
|
|
|
293 macroarray_set(bucket, i, m2);
|
|
|
294 }
|
|
|
295 macroarray_setsize(bucket, num-1);
|
|
|
296 total_macros--;
|
|
|
297 }
|
|
|
298 return m;
|
|
|
299 }
|
|
|
300 }
|
|
|
301 return NULL;
|
|
|
302 }
|
|
|
303
|
|
|
304 static
|
|
19
|
305 struct macro *
|
|
|
306 macrotable_find(const char *name, bool remove)
|
|
|
307 {
|
|
|
308 return macrotable_findlen(name, strlen(name), remove);
|
|
|
309 }
|
|
|
310
|
|
|
311 static
|
|
17
|
312 void
|
|
|
313 macrotable_rehash(void)
|
|
|
314 {
|
|
|
315 struct macroarray *newbucket, *oldbucket;
|
|
|
316 struct macro *m;
|
|
|
317 unsigned newmask, tossbit;
|
|
|
318 unsigned numbuckets, i;
|
|
|
319 unsigned oldnum, j, k;
|
|
|
320
|
|
|
321 numbuckets = macroarrayarray_num(¯os);
|
|
|
322 macroarrayarray_setsize(¯os, numbuckets*2);
|
|
|
323
|
|
|
324 assert(hashmask == numbuckets - 1);
|
|
|
325 newmask = (hashmask << 1) | 1U;
|
|
|
326 tossbit = newmask && ~hashmask;
|
|
|
327 hashmask = newmask;
|
|
|
328
|
|
|
329 for (i=0; i<numbuckets; i++) {
|
|
|
330 newbucket = NULL;
|
|
|
331 oldbucket = macroarrayarray_get(¯os, i);
|
|
|
332 oldnum = macroarray_num(oldbucket);
|
|
|
333 for (j=0; j<oldnum; j++) {
|
|
|
334 m = macroarray_get(oldbucket, j);
|
|
|
335 if (m->hash & tossbit) {
|
|
|
336 if (newbucket == NULL) {
|
|
|
337 newbucket = macroarray_create();
|
|
|
338 }
|
|
|
339 macroarray_set(oldbucket, j, NULL);
|
|
|
340 macroarray_add(newbucket, m, NULL);
|
|
|
341 }
|
|
|
342 }
|
|
|
343 for (j=k=0; j<oldnum; j++) {
|
|
|
344 m = macroarray_get(oldbucket, j);
|
|
|
345 if (m != NULL && k < j) {
|
|
|
346 macroarray_set(oldbucket, k++, m);
|
|
|
347 }
|
|
|
348 }
|
|
|
349 macroarray_setsize(oldbucket, k);
|
|
|
350 macroarrayarray_set(¯os, numbuckets + i, newbucket);
|
|
|
351 }
|
|
|
352 }
|
|
|
353
|
|
|
354 static
|
|
|
355 void
|
|
|
356 macrotable_add(struct macro *m)
|
|
|
357 {
|
|
|
358 unsigned hash;
|
|
|
359 struct macroarray *bucket;
|
|
|
360 unsigned numbuckets;
|
|
|
361
|
|
|
362 numbuckets = macroarrayarray_num(¯os);
|
|
|
363 if (total_macros > 0 && total_macros / numbuckets > 9) {
|
|
|
364 macrotable_rehash();
|
|
|
365 }
|
|
|
366
|
|
19
|
367 hash = hashfunc(m->name, strlen(m->name));
|
|
17
|
368 bucket = macroarrayarray_get(¯os, hash & hashmask);
|
|
|
369 if (bucket == NULL) {
|
|
|
370 bucket = macroarray_create();
|
|
|
371 macroarrayarray_set(¯os, hash & hashmask, bucket);
|
|
|
372 }
|
|
|
373 macroarray_add(bucket, m, NULL);
|
|
|
374 total_macros++;
|
|
|
375 }
|
|
|
376
|
|
|
377 ////////////////////////////////////////////////////////////
|
|
|
378 // external macro definition interface
|
|
|
379
|
|
18
|
380 static
|
|
|
381 struct macro *
|
|
|
382 macro_define_common_start(struct place *p1, const char *macro,
|
|
19
|
383 struct place *p2)
|
|
17
|
384 {
|
|
|
385 struct macro *m;
|
|
19
|
386 unsigned hash;
|
|
17
|
387
|
|
18
|
388 if (!is_identifier(macro)) {
|
|
|
389 complain(p1, "Invalid macro name %s", macro);
|
|
|
390 complain_fail();
|
|
|
391 }
|
|
|
392
|
|
19
|
393 hash = hashfunc(macro, strlen(macro));
|
|
|
394 m = macro_create(p1, macro, hash, p2);
|
|
18
|
395 return m;
|
|
|
396 }
|
|
|
397
|
|
|
398 static
|
|
|
399 void
|
|
|
400 macro_define_common_end(struct macro *m)
|
|
|
401 {
|
|
|
402 struct macro *oldm;
|
|
|
403 bool ok;
|
|
|
404
|
|
|
405 oldm = macrotable_find(m->name, false);
|
|
|
406 if (oldm != NULL) {
|
|
|
407 ok = macro_eq(m, oldm);
|
|
|
408 if (ok) {
|
|
|
409 complain(&m->defplace,
|
|
|
410 "Warning: redefinition of %s", m->name);
|
|
17
|
411 if (mode.werror) {
|
|
|
412 complain_fail();
|
|
|
413 }
|
|
18
|
414 } else {
|
|
|
415 complain(&m->defplace,
|
|
|
416 "Redefinition of %s is not identical",
|
|
|
417 m->name);
|
|
|
418 complain_fail();
|
|
17
|
419 }
|
|
18
|
420 complain(&oldm->defplace, "Previous definition was here");
|
|
|
421 macro_destroy(m);
|
|
17
|
422 return;
|
|
|
423 }
|
|
18
|
424 macrotable_add(m);
|
|
|
425 }
|
|
17
|
426
|
|
18
|
427 static
|
|
|
428 void
|
|
|
429 macro_parse_parameters(struct macro *m, struct place *p, const char *params)
|
|
|
430 {
|
|
|
431 size_t len;
|
|
|
432 const char *s;
|
|
|
433 char *param;
|
|
|
434
|
|
|
435 while (params != NULL) {
|
|
|
436 len = strspn(params, ws);
|
|
|
437 params += len;
|
|
|
438 p->column += len;
|
|
|
439 s = strchr(params, ',');
|
|
|
440 if (s) {
|
|
|
441 len = s-params;
|
|
|
442 param = dostrndup(params, len);
|
|
|
443 s++;
|
|
|
444 } else {
|
|
|
445 len = strlen(params);
|
|
|
446 param = dostrndup(params, len);
|
|
|
447 }
|
|
|
448 notrailingws(param, strlen(param));
|
|
|
449 if (!is_identifier(param)) {
|
|
|
450 complain(p, "Invalid macro parameter name %s", param);
|
|
|
451 complain_fail();
|
|
|
452 } else {
|
|
|
453 stringarray_add(&m->params, param, NULL);
|
|
|
454 }
|
|
|
455 params = s;
|
|
|
456 p->column += len;
|
|
|
457 }
|
|
|
458 }
|
|
|
459
|
|
19
|
460 static
|
|
|
461 bool
|
|
|
462 isparam(struct macro *m, const char *name, size_t len, unsigned *num_ret)
|
|
|
463 {
|
|
|
464 unsigned num, i;
|
|
|
465 const char *param;
|
|
|
466
|
|
|
467 num = stringarray_num(&m->params);
|
|
|
468 for (i=0; i<num; i++) {
|
|
|
469 param = stringarray_get(&m->params, i);
|
|
|
470 if (strlen(param) == len && !strcmp(name, param)) {
|
|
|
471 *num_ret = i;
|
|
|
472 return true;
|
|
|
473 }
|
|
|
474 }
|
|
|
475 return false;
|
|
|
476 }
|
|
|
477
|
|
|
478 static
|
|
|
479 void
|
|
|
480 macro_parse_expansion(struct macro *m, const char *buf)
|
|
|
481 {
|
|
|
482 size_t blockstart, wordstart, pos;
|
|
|
483 struct expansionitem *ei;
|
|
|
484 unsigned param;
|
|
|
485
|
|
|
486 pos = blockstart = 0;
|
|
|
487 while (buf[pos] != '\0') {
|
|
|
488 pos += strspn(buf+pos, ws);
|
|
|
489 if (strchr(alnum, buf[pos])) {
|
|
|
490 wordstart = pos;
|
|
|
491 pos += strspn(buf+pos, alnum);
|
|
|
492 if (isparam(m, buf+wordstart, pos-wordstart, ¶m)) {
|
|
|
493 if (pos > blockstart) {
|
|
|
494 ei = expansionitem_create_stringlen(
|
|
|
495 buf + blockstart,
|
|
|
496 blockstart - pos);
|
|
|
497 expansionitemarray_add(&m->expansion,
|
|
|
498 ei, NULL);
|
|
|
499 }
|
|
|
500 ei = expansionitem_create_param(param);
|
|
|
501 expansionitemarray_add(&m->expansion, ei,NULL);
|
|
|
502 blockstart = pos;
|
|
|
503 continue;
|
|
|
504 }
|
|
|
505 continue;
|
|
|
506 }
|
|
|
507 pos++;
|
|
|
508 }
|
|
|
509 if (pos > blockstart) {
|
|
|
510 ei = expansionitem_create_stringlen(buf + blockstart,
|
|
|
511 blockstart - pos);
|
|
|
512 expansionitemarray_add(&m->expansion, ei, NULL);
|
|
|
513 }
|
|
|
514 }
|
|
|
515
|
|
18
|
516 void
|
|
|
517 macro_define_plain(struct place *p1, const char *macro,
|
|
|
518 struct place *p2, const char *expansion)
|
|
|
519 {
|
|
|
520 struct macro *m;
|
|
19
|
521 struct expansionitem *ei;
|
|
18
|
522
|
|
19
|
523 m = macro_define_common_start(p1, macro, p2);
|
|
|
524 ei = expansionitem_create_string(expansion);
|
|
|
525 expansionitemarray_add(&m->expansion, ei, NULL);
|
|
18
|
526 macro_define_common_end(m);
|
|
|
527 }
|
|
|
528
|
|
|
529 void
|
|
|
530 macro_define_params(struct place *p1, const char *macro,
|
|
|
531 struct place *p2, const char *params,
|
|
|
532 struct place *p3, const char *expansion)
|
|
|
533 {
|
|
|
534 struct macro *m;
|
|
|
535
|
|
19
|
536 m = macro_define_common_start(p1, macro, p3);
|
|
18
|
537 macro_parse_parameters(m, p2, params);
|
|
19
|
538 macro_parse_expansion(m, expansion);
|
|
18
|
539 macro_define_common_end(m);
|
|
17
|
540 }
|
|
|
541
|
|
|
542 void
|
|
|
543 macro_undef(const char *macro)
|
|
|
544 {
|
|
|
545 struct macro *m;
|
|
|
546
|
|
|
547 m = macrotable_find(macro, true);
|
|
|
548 if (m) {
|
|
|
549 macro_destroy(m);
|
|
|
550 }
|
|
|
551 }
|
|
|
552
|
|
|
553 bool
|
|
|
554 macro_isdefined(const char *macro)
|
|
|
555 {
|
|
|
556 struct macro *m;
|
|
|
557
|
|
|
558 m = macrotable_find(macro, false);
|
|
|
559 return m != NULL;
|
|
|
560 }
|
|
|
561
|
|
|
562 ////////////////////////////////////////////////////////////
|
|
|
563 // macro expansion
|
|
|
564
|
|
19
|
565 struct expstate {
|
|
|
566 bool honordefined;
|
|
|
567 enum { ES_NORMAL, ES_WANTLPAREN, ES_NOARG, ES_HAVEARG } state;
|
|
|
568 struct macro *curmacro;
|
|
|
569 struct stringarray args;
|
|
|
570 unsigned argparens;
|
|
|
571
|
|
|
572 bool tobuf;
|
|
|
573 char *buf;
|
|
|
574 size_t bufpos, bufmax;
|
|
|
575 };
|
|
|
576
|
|
|
577 static struct expstate mainstate;
|
|
|
578
|
|
|
579 static void doexpand(struct expstate *es, struct place *p,
|
|
|
580 char *buf, size_t len);
|
|
|
581
|
|
|
582 static
|
|
|
583 void
|
|
|
584 expstate_init(struct expstate *es, bool tobuf, bool honordefined)
|
|
|
585 {
|
|
|
586 es->honordefined = honordefined;
|
|
|
587 es->state = ES_NORMAL;
|
|
|
588 es->curmacro = NULL;
|
|
|
589 stringarray_init(&es->args);
|
|
|
590 es->argparens = 0;
|
|
|
591 es->tobuf = tobuf;
|
|
|
592 es->buf = NULL;
|
|
|
593 es->bufpos = 0;
|
|
|
594 es->bufmax = 0;
|
|
|
595 }
|
|
|
596
|
|
|
597 static
|
|
|
598 void
|
|
|
599 expstate_cleanup(struct expstate *es)
|
|
|
600 {
|
|
|
601 assert(es->state == ES_NORMAL);
|
|
|
602 stringarray_cleanup(&es->args);
|
|
|
603 if (es->buf) {
|
|
|
604 free(es->buf);
|
|
|
605 }
|
|
|
606 }
|
|
|
607
|
|
|
608 static
|
|
|
609 void
|
|
|
610 expstate_destroyargs(struct expstate *es)
|
|
|
611 {
|
|
|
612 unsigned i, num;
|
|
|
613
|
|
|
614 num = stringarray_num(&es->args);
|
|
|
615 for (i=0; i<num; i++) {
|
|
|
616 free(stringarray_get(&es->args, i));
|
|
|
617 }
|
|
|
618 stringarray_setsize(&es->args, 0);
|
|
|
619 }
|
|
|
620
|
|
|
621 static
|
|
|
622 void
|
|
|
623 expand_send(struct expstate *es, const char *buf, size_t len)
|
|
|
624 {
|
|
|
625 if (es->tobuf) {
|
|
|
626 if (es->bufpos + len > es->bufmax) {
|
|
|
627 if (es->bufmax == 0) {
|
|
|
628 es->bufmax = 64;
|
|
|
629 }
|
|
|
630 while (es->bufpos + len > es->bufmax) {
|
|
|
631 es->bufmax *= 2;
|
|
|
632 }
|
|
|
633 es->buf = dorealloc(es->buf, es->bufmax);
|
|
|
634 }
|
|
|
635 memcpy(es->buf + es->bufpos, buf, len);
|
|
|
636 es->bufpos += len;
|
|
|
637 } else {
|
|
|
638 output(buf, len);
|
|
|
639 }
|
|
|
640 }
|
|
|
641
|
|
|
642 static
|
|
|
643 void
|
|
|
644 expand_send_eof(struct expstate *es)
|
|
|
645 {
|
|
|
646 if (es->tobuf) {
|
|
|
647 expand_send(es, "", 1);
|
|
|
648 es->bufpos--;
|
|
|
649 } else {
|
|
|
650 output_eof();
|
|
|
651 }
|
|
|
652 }
|
|
|
653
|
|
|
654 static
|
|
|
655 void
|
|
|
656 expand_newarg(struct expstate *es, char *buf, size_t len)
|
|
|
657 {
|
|
|
658 char *text;
|
|
|
659
|
|
|
660 text = dostrndup(buf, len);
|
|
|
661 stringarray_add(&es->args, text, NULL);
|
|
|
662 }
|
|
|
663
|
|
|
664 static
|
|
|
665 void
|
|
|
666 expand_appendarg(struct expstate *es, char *buf, size_t len)
|
|
|
667 {
|
|
|
668 unsigned num;
|
|
|
669 char *text;
|
|
|
670 size_t oldlen;
|
|
|
671
|
|
|
672 num = stringarray_num(&es->args);
|
|
|
673 assert(num > 0);
|
|
|
674
|
|
|
675 text = stringarray_get(&es->args, num - 1);
|
|
|
676 oldlen = strlen(text);
|
|
|
677 text = dorealloc(text, oldlen + len + 1);
|
|
|
678 memcpy(text + oldlen, buf, len);
|
|
|
679 text[oldlen+len] = '\0';
|
|
|
680 stringarray_set(&es->args, num - 1, text);
|
|
|
681 }
|
|
|
682
|
|
|
683 static
|
|
|
684 char *
|
|
|
685 expand_substitute(struct expstate *es)
|
|
|
686 {
|
|
|
687 struct expansionitem *ei;
|
|
|
688 unsigned i, num;
|
|
|
689 size_t len;
|
|
|
690 char *arg;
|
|
|
691 char *ret;
|
|
|
692
|
|
|
693 len = 0;
|
|
|
694 num = expansionitemarray_num(&es->curmacro->expansion);
|
|
|
695 for (i=0; i<num; i++) {
|
|
|
696 ei = expansionitemarray_get(&es->curmacro->expansion, i);
|
|
|
697 if (ei->isstring) {
|
|
|
698 len += strlen(ei->string);
|
|
|
699 } else {
|
|
|
700 arg = stringarray_get(&es->args, ei->param);
|
|
|
701 len += strlen(arg);
|
|
|
702 }
|
|
|
703 }
|
|
|
704
|
|
|
705 ret = domalloc(len+1);
|
|
|
706 *ret = '\0';
|
|
|
707 for (i=0; i<num; i++) {
|
|
|
708 ei = expansionitemarray_get(&es->curmacro->expansion, i);
|
|
|
709 if (ei->isstring) {
|
|
|
710 strcat(ret, ei->string);
|
|
|
711 } else {
|
|
|
712 arg = stringarray_get(&es->args, ei->param);
|
|
|
713 strcat(ret, arg);
|
|
|
714 }
|
|
|
715 }
|
|
|
716
|
|
|
717 return ret;
|
|
|
718 }
|
|
|
719
|
|
|
720 static
|
|
|
721 void
|
|
|
722 expand_domacro(struct expstate *es, struct place *p)
|
|
|
723 {
|
|
|
724 struct macro *m;
|
|
|
725 char *newbuf, *newbuf2;
|
|
|
726
|
|
|
727 if (es->curmacro == NULL) {
|
|
|
728 /* defined() */
|
|
|
729 if (stringarray_num(&es->args) != 1) {
|
|
|
730 complain(p, "Too many arguments for defined()");
|
|
|
731 complain_fail();
|
|
|
732 expand_send(es, "0", 1);
|
|
|
733 return;
|
|
|
734 }
|
|
|
735 m = macrotable_find(stringarray_get(&es->args, 0), false);
|
|
|
736 expand_send(es, (m != NULL) ? "1" : "0", 1);
|
|
|
737 return;
|
|
|
738 }
|
|
|
739
|
|
|
740 assert(es->curmacro->inuse == false);
|
|
|
741 es->curmacro->inuse = true;
|
|
|
742
|
|
|
743 newbuf = expand_substitute(es);
|
|
|
744 newbuf2 = macroexpand(p, newbuf, strlen(newbuf), false);
|
|
|
745 free(newbuf);
|
|
|
746 doexpand(es, p, newbuf2, strlen(newbuf2));
|
|
|
747 free(newbuf2);
|
|
|
748
|
|
|
749 es->curmacro->inuse = false;
|
|
|
750 }
|
|
|
751
|
|
|
752 static
|
|
|
753 void
|
|
|
754 expand_got_ws(struct expstate *es, struct place *p, char *buf, size_t len)
|
|
|
755 {
|
|
|
756 switch (es->state) {
|
|
|
757 case ES_NORMAL:
|
|
|
758 expand_send(es, buf, len);
|
|
|
759 break;
|
|
|
760 break;
|
|
|
761 case ES_WANTLPAREN:
|
|
|
762 break;
|
|
|
763 case ES_NOARG:
|
|
|
764 break;
|
|
|
765 case ES_HAVEARG:
|
|
|
766 expand_appendarg(es, buf, len);
|
|
|
767 break;
|
|
|
768 }
|
|
|
769 }
|
|
|
770
|
|
|
771 static
|
|
|
772 void
|
|
|
773 expand_got_word(struct expstate *es, struct place *p, char *buf, size_t len)
|
|
|
774 {
|
|
|
775 struct macro *m;
|
|
|
776 struct expansionitem *ei;
|
|
|
777 char *newbuf;
|
|
17
|
778
|
|
19
|
779 switch (es->state) {
|
|
|
780 case ES_NORMAL:
|
|
|
781 if (es->honordefined &&
|
|
|
782 len == 7 && !memcmp(buf, "defined", 7)) {
|
|
|
783 es->curmacro = NULL;
|
|
|
784 es->state = ES_WANTLPAREN;
|
|
|
785 break;
|
|
|
786 }
|
|
|
787 m = macrotable_findlen(buf, len, false);
|
|
|
788 if (m == NULL) {
|
|
|
789 expand_send(es, buf, len);
|
|
|
790 } else if (!m->hasparams) {
|
|
|
791 m->inuse = true;
|
|
|
792 assert(expansionitemarray_num(&m->expansion) == 1);
|
|
|
793 ei = expansionitemarray_get(&m->expansion, 0);
|
|
|
794 assert(ei->isstring);
|
|
|
795 newbuf = macroexpand(p, ei->string,
|
|
|
796 strlen(ei->string), false);
|
|
|
797 doexpand(es, p, newbuf, strlen(newbuf));
|
|
|
798 free(newbuf);
|
|
|
799 m->inuse = false;
|
|
|
800 } else {
|
|
|
801 es->curmacro = m;
|
|
|
802 es->state = ES_WANTLPAREN;
|
|
|
803 }
|
|
|
804 break;
|
|
|
805 case ES_WANTLPAREN:
|
|
|
806 if (es->curmacro != NULL) {
|
|
|
807 complain(p, "Expected arguments for macro %s",
|
|
|
808 es->curmacro->name);
|
|
|
809 complain_fail();
|
|
|
810 } else {
|
|
|
811 /* "defined foo" means "defined(foo)" */
|
|
|
812 expand_newarg(es, buf, len);
|
|
|
813 es->state = ES_NORMAL;
|
|
|
814 expand_domacro(es, p);
|
|
|
815 break;
|
|
|
816 }
|
|
|
817 break;
|
|
|
818 case ES_NOARG:
|
|
|
819 expand_newarg(es, buf, len);
|
|
|
820 es->state = ES_HAVEARG;
|
|
|
821 break;
|
|
|
822 case ES_HAVEARG:
|
|
|
823 expand_appendarg(es, buf, len);
|
|
|
824 break;
|
|
|
825 }
|
|
|
826 }
|
|
|
827
|
|
|
828 static
|
|
|
829 void
|
|
|
830 expand_got_lparen(struct expstate *es, struct place *p, char *buf, size_t len)
|
|
|
831 {
|
|
|
832 switch (es->state) {
|
|
|
833 case ES_NORMAL:
|
|
|
834 expand_send(es, buf, len);
|
|
|
835 break;
|
|
|
836 case ES_WANTLPAREN:
|
|
|
837 es->state = ES_NOARG;
|
|
|
838 break;
|
|
|
839 case ES_NOARG:
|
|
|
840 expand_newarg(es, buf, len);
|
|
|
841 es->state = ES_HAVEARG;
|
|
|
842 es->argparens++;
|
|
|
843 break;
|
|
|
844 case ES_HAVEARG:
|
|
|
845 expand_appendarg(es, buf, len);
|
|
|
846 es->argparens++;
|
|
|
847 break;
|
|
|
848 }
|
|
|
849 }
|
|
|
850
|
|
|
851 static
|
|
|
852 void
|
|
|
853 expand_got_rparen(struct expstate *es, struct place *p, char *buf, size_t len)
|
|
|
854 {
|
|
|
855 switch (es->state) {
|
|
|
856 case ES_NORMAL:
|
|
|
857 expand_send(es, buf, len);
|
|
|
858 break;
|
|
|
859 case ES_WANTLPAREN:
|
|
|
860 if (es->curmacro) {
|
|
|
861 complain(p, "Expected arguments for macro %s",
|
|
|
862 es->curmacro->name);
|
|
|
863 } else {
|
|
|
864 complain(p, "Expected arguments for defined()");
|
|
|
865 }
|
|
|
866 complain_fail();
|
|
|
867 break;
|
|
|
868 case ES_NOARG:
|
|
|
869 assert(es->argparens == 0);
|
|
|
870 es->state = ES_NORMAL;
|
|
|
871 expand_domacro(es, p);
|
|
|
872 break;
|
|
|
873 case ES_HAVEARG:
|
|
|
874 if (es->argparens > 0) {
|
|
|
875 es->argparens--;
|
|
|
876 expand_appendarg(es, buf, len);
|
|
|
877 } else {
|
|
|
878 es->state = ES_NORMAL;
|
|
|
879 expand_domacro(es, p);
|
|
|
880 }
|
|
|
881 break;
|
|
|
882 }
|
|
|
883 }
|
|
|
884
|
|
|
885 static
|
|
|
886 void
|
|
|
887 expand_got_comma(struct expstate *es, struct place *p, char *buf, size_t len)
|
|
|
888 {
|
|
|
889 switch (es->state) {
|
|
|
890 case ES_NORMAL:
|
|
|
891 expand_send(es, buf, len);
|
|
|
892 break;
|
|
|
893 case ES_WANTLPAREN:
|
|
|
894 if (es->curmacro) {
|
|
|
895 complain(p, "Expected arguments for macro %s",
|
|
|
896 es->curmacro->name);
|
|
|
897 } else {
|
|
|
898 complain(p, "Expected arguments for defined()");
|
|
|
899 }
|
|
|
900 complain_fail();
|
|
|
901 break;
|
|
|
902 case ES_NOARG:
|
|
|
903 assert(es->argparens == 0);
|
|
|
904 expand_newarg(es, buf, 0);
|
|
|
905 break;
|
|
|
906 case ES_HAVEARG:
|
|
|
907 if (es->argparens > 0) {
|
|
|
908 expand_appendarg(es, buf, len);
|
|
|
909 } else {
|
|
|
910 es->state = ES_NOARG;
|
|
|
911 }
|
|
|
912 break;
|
|
|
913 }
|
|
|
914 }
|
|
|
915
|
|
|
916 static
|
|
|
917 void
|
|
|
918 expand_got_other(struct expstate *es, struct place *p, char *buf, size_t len)
|
|
|
919 {
|
|
|
920 switch (es->state) {
|
|
|
921 case ES_NORMAL:
|
|
|
922 expand_send(es, buf, len);
|
|
|
923 break;
|
|
|
924 case ES_WANTLPAREN:
|
|
|
925 if (es->curmacro) {
|
|
|
926 complain(p, "Expected arguments for macro %s",
|
|
|
927 es->curmacro->name);
|
|
|
928 } else {
|
|
|
929 complain(p, "Expected arguments for defined()");
|
|
|
930 }
|
|
|
931 complain_fail();
|
|
|
932 break;
|
|
|
933 case ES_NOARG:
|
|
|
934 expand_newarg(es, buf, len);
|
|
|
935 es->state = ES_HAVEARG;
|
|
|
936 break;
|
|
|
937 case ES_HAVEARG:
|
|
|
938 expand_appendarg(es, buf, len);
|
|
|
939 break;
|
|
|
940 }
|
|
|
941 }
|
|
|
942
|
|
|
943 static
|
|
|
944 void
|
|
|
945 expand_got_eof(struct expstate *es, struct place *p)
|
|
|
946 {
|
|
|
947 switch (es->state) {
|
|
|
948 case ES_NORMAL:
|
|
|
949 expand_send_eof(es);
|
|
|
950 break;
|
|
|
951 case ES_WANTLPAREN:
|
|
|
952 if (es->curmacro) {
|
|
|
953 complain(p, "Expected arguments for macro %s",
|
|
|
954 es->curmacro->name);
|
|
|
955 } else {
|
|
|
956 complain(p, "Expected arguments for defined()");
|
|
|
957 }
|
|
|
958 complain_fail();
|
|
|
959 break;
|
|
|
960 case ES_NOARG:
|
|
|
961 case ES_HAVEARG:
|
|
|
962 if (es->curmacro) {
|
|
|
963 complain(p, "Unclosed argument list for macro %s",
|
|
|
964 es->curmacro->name);
|
|
|
965 } else {
|
|
|
966 complain(p, "Unclosed argument list for defined()");
|
|
|
967 }
|
|
|
968 complain_fail();
|
|
|
969 expstate_destroyargs(es);
|
|
|
970 break;
|
|
|
971 }
|
|
|
972 es->state = ES_NORMAL;
|
|
|
973 es->curmacro = NULL;
|
|
|
974 es->argparens = 0;
|
|
|
975 }
|
|
|
976
|
|
|
977 static
|
|
|
978 void
|
|
|
979 doexpand(struct expstate *es, struct place *p, char *buf, size_t len)
|
|
|
980 {
|
|
|
981 size_t x;
|
|
|
982
|
|
|
983 while (len > 0) {
|
|
|
984 x = strspn(buf, ws);
|
|
|
985 if (x > 0) {
|
|
|
986 expand_got_ws(es, p, buf, x);
|
|
|
987 buf += x;
|
|
|
988 len -= x;
|
|
|
989 }
|
|
|
990
|
|
|
991 x = strspn(buf, alnum);
|
|
|
992 if (x > 0) {
|
|
|
993 expand_got_word(es, p, buf, x);
|
|
|
994 buf += x;
|
|
|
995 len -= x;
|
|
|
996 continue;
|
|
|
997 }
|
|
|
998
|
|
|
999 if (buf[0] == '(') {
|
|
|
1000 expand_got_lparen(es, p, buf, 1);
|
|
|
1001 buf++;
|
|
|
1002 len--;
|
|
|
1003 continue;
|
|
|
1004 }
|
|
|
1005
|
|
|
1006 if (buf[0] == ')') {
|
|
|
1007 expand_got_rparen(es, p, buf, 1);
|
|
|
1008 buf++;
|
|
|
1009 len--;
|
|
|
1010 continue;
|
|
|
1011 }
|
|
|
1012
|
|
|
1013 if (buf[0] == ',') {
|
|
|
1014 expand_got_comma(es, p, buf, 1);
|
|
|
1015 buf++;
|
|
|
1016 len--;
|
|
|
1017 continue;
|
|
|
1018 }
|
|
|
1019
|
|
|
1020 expand_got_other(es, p, buf, 1);
|
|
|
1021 buf++;
|
|
|
1022 len--;
|
|
|
1023 }
|
|
|
1024 }
|
|
|
1025
|
|
|
1026 char *
|
|
|
1027 macroexpand(struct place *p, char *buf, size_t len, bool honordefined)
|
|
|
1028 {
|
|
|
1029 struct expstate es;
|
|
|
1030 char *ret;
|
|
|
1031
|
|
|
1032 expstate_init(&es, true, honordefined);
|
|
|
1033 doexpand(&es, p, buf, len);
|
|
|
1034 expand_got_eof(&es, p);
|
|
|
1035 ret = es.buf;
|
|
|
1036 es.buf = NULL;
|
|
|
1037 expstate_cleanup(&es);
|
|
|
1038
|
|
|
1039 return ret;
|
|
|
1040 }
|
|
|
1041
|
|
|
1042 void
|
|
|
1043 macro_sendline(struct place *p, char *buf, size_t len)
|
|
|
1044 {
|
|
|
1045 doexpand(&mainstate, p, buf, len);
|
|
|
1046 }
|
|
|
1047
|
|
|
1048 void
|
|
|
1049 macro_sendeof(struct place *p)
|
|
|
1050 {
|
|
|
1051 expand_got_eof(&mainstate, p);
|
|
|
1052 }
|
|
17
|
1053
|
|
|
1054 ////////////////////////////////////////////////////////////
|
|
|
1055 // module initialization
|
|
|
1056
|
|
|
1057 void
|
|
|
1058 macros_init(void)
|
|
|
1059 {
|
|
|
1060 macrotable_init();
|
|
19
|
1061 expstate_init(&mainstate, false, false);
|
|
17
|
1062 }
|
|
|
1063
|
|
|
1064 void
|
|
|
1065 macros_cleanup(void)
|
|
|
1066 {
|
|
19
|
1067 expstate_cleanup(&mainstate);
|
|
17
|
1068 macrotable_cleanup();
|
|
|
1069 }
|
