Commit | Line | Data |
---|---|---|
ec2bcbe7 | 1 | /* C preprocessor macro expansion for GDB. |
9b254dd1 | 2 | Copyright (C) 2002, 2007, 2008 Free Software Foundation, Inc. |
ec2bcbe7 JB |
3 | Contributed by Red Hat, Inc. |
4 | ||
5 | This file is part of GDB. | |
6 | ||
7 | This program is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
a9762ec7 | 9 | the Free Software Foundation; either version 3 of the License, or |
ec2bcbe7 JB |
10 | (at your option) any later version. |
11 | ||
12 | This program is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
a9762ec7 | 18 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
ec2bcbe7 JB |
19 | |
20 | #include "defs.h" | |
04ea0df1 | 21 | #include "gdb_obstack.h" |
ec2bcbe7 JB |
22 | #include "bcache.h" |
23 | #include "macrotab.h" | |
24 | #include "macroexp.h" | |
25 | #include "gdb_assert.h" | |
26 | ||
27 | ||
28 | \f | |
29 | /* A resizeable, substringable string type. */ | |
30 | ||
31 | ||
32 | /* A string type that we can resize, quickly append to, and use to | |
33 | refer to substrings of other strings. */ | |
34 | struct macro_buffer | |
35 | { | |
36 | /* An array of characters. The first LEN bytes are the real text, | |
37 | but there are SIZE bytes allocated to the array. If SIZE is | |
38 | zero, then this doesn't point to a malloc'ed block. If SHARED is | |
39 | non-zero, then this buffer is actually a pointer into some larger | |
40 | string, and we shouldn't append characters to it, etc. Because | |
41 | of sharing, we can't assume in general that the text is | |
42 | null-terminated. */ | |
43 | char *text; | |
44 | ||
45 | /* The number of characters in the string. */ | |
46 | int len; | |
47 | ||
48 | /* The number of characters allocated to the string. If SHARED is | |
49 | non-zero, this is meaningless; in this case, we set it to zero so | |
50 | that any "do we have room to append something?" tests will fail, | |
51 | so we don't always have to check SHARED before using this field. */ | |
52 | int size; | |
53 | ||
54 | /* Zero if TEXT can be safely realloc'ed (i.e., it's its own malloc | |
55 | block). Non-zero if TEXT is actually pointing into the middle of | |
56 | some other block, and we shouldn't reallocate it. */ | |
57 | int shared; | |
58 | ||
59 | /* For detecting token splicing. | |
60 | ||
61 | This is the index in TEXT of the first character of the token | |
62 | that abuts the end of TEXT. If TEXT contains no tokens, then we | |
63 | set this equal to LEN. If TEXT ends in whitespace, then there is | |
64 | no token abutting the end of TEXT (it's just whitespace), and | |
65 | again, we set this equal to LEN. We set this to -1 if we don't | |
66 | know the nature of TEXT. */ | |
67 | int last_token; | |
68 | ||
69 | /* If this buffer is holding the result from get_token, then this | |
70 | is non-zero if it is an identifier token, zero otherwise. */ | |
71 | int is_identifier; | |
72 | }; | |
73 | ||
74 | ||
75 | /* Set the macro buffer *B to the empty string, guessing that its | |
76 | final contents will fit in N bytes. (It'll get resized if it | |
77 | doesn't, so the guess doesn't have to be right.) Allocate the | |
78 | initial storage with xmalloc. */ | |
79 | static void | |
80 | init_buffer (struct macro_buffer *b, int n) | |
81 | { | |
ec2bcbe7 JB |
82 | b->size = n; |
83 | if (n > 0) | |
84 | b->text = (char *) xmalloc (n); | |
85 | else | |
a86bc61c | 86 | b->text = NULL; |
ec2bcbe7 JB |
87 | b->len = 0; |
88 | b->shared = 0; | |
89 | b->last_token = -1; | |
90 | } | |
91 | ||
92 | ||
93 | /* Set the macro buffer *BUF to refer to the LEN bytes at ADDR, as a | |
94 | shared substring. */ | |
95 | static void | |
96 | init_shared_buffer (struct macro_buffer *buf, char *addr, int len) | |
97 | { | |
98 | buf->text = addr; | |
99 | buf->len = len; | |
100 | buf->shared = 1; | |
101 | buf->size = 0; | |
102 | buf->last_token = -1; | |
103 | } | |
104 | ||
105 | ||
106 | /* Free the text of the buffer B. Raise an error if B is shared. */ | |
107 | static void | |
108 | free_buffer (struct macro_buffer *b) | |
109 | { | |
110 | gdb_assert (! b->shared); | |
111 | if (b->size) | |
112 | xfree (b->text); | |
113 | } | |
114 | ||
115 | ||
116 | /* A cleanup function for macro buffers. */ | |
117 | static void | |
118 | cleanup_macro_buffer (void *untyped_buf) | |
119 | { | |
120 | free_buffer ((struct macro_buffer *) untyped_buf); | |
121 | } | |
122 | ||
123 | ||
124 | /* Resize the buffer B to be at least N bytes long. Raise an error if | |
125 | B shouldn't be resized. */ | |
126 | static void | |
127 | resize_buffer (struct macro_buffer *b, int n) | |
128 | { | |
129 | /* We shouldn't be trying to resize shared strings. */ | |
130 | gdb_assert (! b->shared); | |
131 | ||
132 | if (b->size == 0) | |
133 | b->size = n; | |
134 | else | |
135 | while (b->size <= n) | |
136 | b->size *= 2; | |
137 | ||
138 | b->text = xrealloc (b->text, b->size); | |
139 | } | |
140 | ||
141 | ||
142 | /* Append the character C to the buffer B. */ | |
39efb398 | 143 | static void |
ec2bcbe7 JB |
144 | appendc (struct macro_buffer *b, int c) |
145 | { | |
146 | int new_len = b->len + 1; | |
147 | ||
148 | if (new_len > b->size) | |
149 | resize_buffer (b, new_len); | |
150 | ||
151 | b->text[b->len] = c; | |
152 | b->len = new_len; | |
153 | } | |
154 | ||
155 | ||
156 | /* Append the LEN bytes at ADDR to the buffer B. */ | |
39efb398 | 157 | static void |
ec2bcbe7 JB |
158 | appendmem (struct macro_buffer *b, char *addr, int len) |
159 | { | |
160 | int new_len = b->len + len; | |
161 | ||
162 | if (new_len > b->size) | |
163 | resize_buffer (b, new_len); | |
164 | ||
165 | memcpy (b->text + b->len, addr, len); | |
166 | b->len = new_len; | |
167 | } | |
168 | ||
169 | ||
170 | \f | |
171 | /* Recognizing preprocessor tokens. */ | |
172 | ||
173 | ||
d7d9f01e TT |
174 | int |
175 | macro_is_whitespace (int c) | |
ec2bcbe7 JB |
176 | { |
177 | return (c == ' ' | |
178 | || c == '\t' | |
179 | || c == '\n' | |
180 | || c == '\v' | |
181 | || c == '\f'); | |
182 | } | |
183 | ||
184 | ||
d7d9f01e TT |
185 | int |
186 | macro_is_digit (int c) | |
ec2bcbe7 JB |
187 | { |
188 | return ('0' <= c && c <= '9'); | |
189 | } | |
190 | ||
191 | ||
d7d9f01e TT |
192 | int |
193 | macro_is_identifier_nondigit (int c) | |
ec2bcbe7 JB |
194 | { |
195 | return (c == '_' | |
196 | || ('a' <= c && c <= 'z') | |
197 | || ('A' <= c && c <= 'Z')); | |
198 | } | |
199 | ||
200 | ||
201 | static void | |
202 | set_token (struct macro_buffer *tok, char *start, char *end) | |
203 | { | |
204 | init_shared_buffer (tok, start, end - start); | |
205 | tok->last_token = 0; | |
206 | ||
207 | /* Presumed; get_identifier may overwrite this. */ | |
208 | tok->is_identifier = 0; | |
209 | } | |
210 | ||
211 | ||
212 | static int | |
213 | get_comment (struct macro_buffer *tok, char *p, char *end) | |
214 | { | |
215 | if (p + 2 > end) | |
216 | return 0; | |
217 | else if (p[0] == '/' | |
218 | && p[1] == '*') | |
219 | { | |
220 | char *tok_start = p; | |
221 | ||
222 | p += 2; | |
223 | ||
224 | for (; p < end; p++) | |
225 | if (p + 2 <= end | |
226 | && p[0] == '*' | |
227 | && p[1] == '/') | |
228 | { | |
229 | p += 2; | |
230 | set_token (tok, tok_start, p); | |
231 | return 1; | |
232 | } | |
233 | ||
8a3fe4f8 | 234 | error (_("Unterminated comment in macro expansion.")); |
ec2bcbe7 JB |
235 | } |
236 | else if (p[0] == '/' | |
237 | && p[1] == '/') | |
238 | { | |
239 | char *tok_start = p; | |
240 | ||
241 | p += 2; | |
242 | for (; p < end; p++) | |
243 | if (*p == '\n') | |
244 | break; | |
245 | ||
246 | set_token (tok, tok_start, p); | |
247 | return 1; | |
248 | } | |
249 | else | |
250 | return 0; | |
251 | } | |
252 | ||
253 | ||
254 | static int | |
255 | get_identifier (struct macro_buffer *tok, char *p, char *end) | |
256 | { | |
257 | if (p < end | |
d7d9f01e | 258 | && macro_is_identifier_nondigit (*p)) |
ec2bcbe7 JB |
259 | { |
260 | char *tok_start = p; | |
261 | ||
262 | while (p < end | |
d7d9f01e TT |
263 | && (macro_is_identifier_nondigit (*p) |
264 | || macro_is_digit (*p))) | |
ec2bcbe7 JB |
265 | p++; |
266 | ||
267 | set_token (tok, tok_start, p); | |
268 | tok->is_identifier = 1; | |
269 | return 1; | |
270 | } | |
271 | else | |
272 | return 0; | |
273 | } | |
274 | ||
275 | ||
276 | static int | |
277 | get_pp_number (struct macro_buffer *tok, char *p, char *end) | |
278 | { | |
279 | if (p < end | |
d7d9f01e | 280 | && (macro_is_digit (*p) |
ec2bcbe7 JB |
281 | || *p == '.')) |
282 | { | |
283 | char *tok_start = p; | |
284 | ||
285 | while (p < end) | |
286 | { | |
d7d9f01e TT |
287 | if (macro_is_digit (*p) |
288 | || macro_is_identifier_nondigit (*p) | |
ec2bcbe7 JB |
289 | || *p == '.') |
290 | p++; | |
291 | else if (p + 2 <= end | |
292 | && strchr ("eEpP.", *p) | |
293 | && (p[1] == '+' || p[1] == '-')) | |
294 | p += 2; | |
295 | else | |
296 | break; | |
297 | } | |
298 | ||
299 | set_token (tok, tok_start, p); | |
300 | return 1; | |
301 | } | |
302 | else | |
303 | return 0; | |
304 | } | |
305 | ||
306 | ||
307 | ||
308 | /* If the text starting at P going up to (but not including) END | |
309 | starts with a character constant, set *TOK to point to that | |
310 | character constant, and return 1. Otherwise, return zero. | |
311 | Signal an error if it contains a malformed or incomplete character | |
312 | constant. */ | |
313 | static int | |
314 | get_character_constant (struct macro_buffer *tok, char *p, char *end) | |
315 | { | |
316 | /* ISO/IEC 9899:1999 (E) Section 6.4.4.4 paragraph 1 | |
317 | But of course, what really matters is that we handle it the same | |
318 | way GDB's C/C++ lexer does. So we call parse_escape in utils.c | |
319 | to handle escape sequences. */ | |
320 | if ((p + 1 <= end && *p == '\'') | |
321 | || (p + 2 <= end && p[0] == 'L' && p[1] == '\'')) | |
322 | { | |
323 | char *tok_start = p; | |
324 | char *body_start; | |
325 | ||
326 | if (*p == '\'') | |
327 | p++; | |
328 | else if (*p == 'L') | |
329 | p += 2; | |
330 | else | |
331 | gdb_assert (0); | |
332 | ||
333 | body_start = p; | |
334 | for (;;) | |
335 | { | |
336 | if (p >= end) | |
8a3fe4f8 | 337 | error (_("Unmatched single quote.")); |
ec2bcbe7 JB |
338 | else if (*p == '\'') |
339 | { | |
340 | if (p == body_start) | |
8a3fe4f8 AC |
341 | error (_("A character constant must contain at least one " |
342 | "character.")); | |
ec2bcbe7 JB |
343 | p++; |
344 | break; | |
345 | } | |
346 | else if (*p == '\\') | |
347 | { | |
348 | p++; | |
349 | parse_escape (&p); | |
350 | } | |
351 | else | |
352 | p++; | |
353 | } | |
354 | ||
355 | set_token (tok, tok_start, p); | |
356 | return 1; | |
357 | } | |
358 | else | |
359 | return 0; | |
360 | } | |
361 | ||
362 | ||
363 | /* If the text starting at P going up to (but not including) END | |
364 | starts with a string literal, set *TOK to point to that string | |
365 | literal, and return 1. Otherwise, return zero. Signal an error if | |
366 | it contains a malformed or incomplete string literal. */ | |
367 | static int | |
368 | get_string_literal (struct macro_buffer *tok, char *p, char *end) | |
369 | { | |
370 | if ((p + 1 <= end | |
371 | && *p == '\"') | |
372 | || (p + 2 <= end | |
373 | && p[0] == 'L' | |
374 | && p[1] == '\"')) | |
375 | { | |
376 | char *tok_start = p; | |
377 | ||
378 | if (*p == '\"') | |
379 | p++; | |
380 | else if (*p == 'L') | |
381 | p += 2; | |
382 | else | |
383 | gdb_assert (0); | |
384 | ||
385 | for (;;) | |
386 | { | |
387 | if (p >= end) | |
8a3fe4f8 | 388 | error (_("Unterminated string in expression.")); |
ec2bcbe7 JB |
389 | else if (*p == '\"') |
390 | { | |
391 | p++; | |
392 | break; | |
393 | } | |
394 | else if (*p == '\n') | |
8a3fe4f8 AC |
395 | error (_("Newline characters may not appear in string " |
396 | "constants.")); | |
ec2bcbe7 JB |
397 | else if (*p == '\\') |
398 | { | |
399 | p++; | |
400 | parse_escape (&p); | |
401 | } | |
402 | else | |
403 | p++; | |
404 | } | |
405 | ||
406 | set_token (tok, tok_start, p); | |
407 | return 1; | |
408 | } | |
409 | else | |
410 | return 0; | |
411 | } | |
412 | ||
413 | ||
414 | static int | |
415 | get_punctuator (struct macro_buffer *tok, char *p, char *end) | |
416 | { | |
417 | /* Here, speed is much less important than correctness and clarity. */ | |
418 | ||
ccb3ac8a TT |
419 | /* ISO/IEC 9899:1999 (E) Section 6.4.6 Paragraph 1. |
420 | Note that this table is ordered in a special way. A punctuator | |
421 | which is a prefix of another punctuator must appear after its | |
422 | "extension". Otherwise, the wrong token will be returned. */ | |
ec2bcbe7 | 423 | static const char * const punctuators[] = { |
ccb3ac8a TT |
424 | "[", "]", "(", ")", "{", "}", "?", ";", ",", "~", |
425 | "...", ".", | |
426 | "->", "--", "-=", "-", | |
427 | "++", "+=", "+", | |
428 | "*=", "*", | |
429 | "!=", "!", | |
430 | "&&", "&=", "&", | |
431 | "/=", "/", | |
432 | "%>", "%:%:", "%:", "%=", "%", | |
433 | "^=", "^", | |
434 | "##", "#", | |
435 | ":>", ":", | |
436 | "||", "|=", "|", | |
437 | "<<=", "<<", "<=", "<:", "<%", "<", | |
438 | ">>=", ">>", ">=", ">", | |
439 | "==", "=", | |
ec2bcbe7 JB |
440 | 0 |
441 | }; | |
442 | ||
443 | int i; | |
444 | ||
445 | if (p + 1 <= end) | |
446 | { | |
447 | for (i = 0; punctuators[i]; i++) | |
448 | { | |
449 | const char *punctuator = punctuators[i]; | |
450 | ||
451 | if (p[0] == punctuator[0]) | |
452 | { | |
453 | int len = strlen (punctuator); | |
454 | ||
455 | if (p + len <= end | |
456 | && ! memcmp (p, punctuator, len)) | |
457 | { | |
458 | set_token (tok, p, p + len); | |
459 | return 1; | |
460 | } | |
461 | } | |
462 | } | |
463 | } | |
464 | ||
465 | return 0; | |
466 | } | |
467 | ||
468 | ||
469 | /* Peel the next preprocessor token off of SRC, and put it in TOK. | |
470 | Mutate TOK to refer to the first token in SRC, and mutate SRC to | |
471 | refer to the text after that token. SRC must be a shared buffer; | |
472 | the resulting TOK will be shared, pointing into the same string SRC | |
473 | does. Initialize TOK's last_token field. Return non-zero if we | |
474 | succeed, or 0 if we didn't find any more tokens in SRC. */ | |
475 | static int | |
476 | get_token (struct macro_buffer *tok, | |
477 | struct macro_buffer *src) | |
478 | { | |
479 | char *p = src->text; | |
480 | char *end = p + src->len; | |
481 | ||
482 | gdb_assert (src->shared); | |
483 | ||
484 | /* From the ISO C standard, ISO/IEC 9899:1999 (E), section 6.4: | |
485 | ||
486 | preprocessing-token: | |
487 | header-name | |
488 | identifier | |
489 | pp-number | |
490 | character-constant | |
491 | string-literal | |
492 | punctuator | |
493 | each non-white-space character that cannot be one of the above | |
494 | ||
495 | We don't have to deal with header-name tokens, since those can | |
496 | only occur after a #include, which we will never see. */ | |
497 | ||
498 | while (p < end) | |
d7d9f01e | 499 | if (macro_is_whitespace (*p)) |
ec2bcbe7 JB |
500 | p++; |
501 | else if (get_comment (tok, p, end)) | |
502 | p += tok->len; | |
503 | else if (get_pp_number (tok, p, end) | |
504 | || get_character_constant (tok, p, end) | |
505 | || get_string_literal (tok, p, end) | |
506 | /* Note: the grammar in the standard seems to be | |
507 | ambiguous: L'x' can be either a wide character | |
508 | constant, or an identifier followed by a normal | |
509 | character constant. By trying `get_identifier' after | |
510 | we try get_character_constant and get_string_literal, | |
511 | we give the wide character syntax precedence. Now, | |
512 | since GDB doesn't handle wide character constants | |
513 | anyway, is this the right thing to do? */ | |
514 | || get_identifier (tok, p, end) | |
515 | || get_punctuator (tok, p, end)) | |
516 | { | |
517 | /* How many characters did we consume, including whitespace? */ | |
518 | int consumed = p - src->text + tok->len; | |
519 | src->text += consumed; | |
520 | src->len -= consumed; | |
521 | return 1; | |
522 | } | |
523 | else | |
524 | { | |
525 | /* We have found a "non-whitespace character that cannot be | |
526 | one of the above." Make a token out of it. */ | |
527 | int consumed; | |
528 | ||
529 | set_token (tok, p, p + 1); | |
530 | consumed = p - src->text + tok->len; | |
531 | src->text += consumed; | |
532 | src->len -= consumed; | |
533 | return 1; | |
534 | } | |
535 | ||
536 | return 0; | |
537 | } | |
538 | ||
539 | ||
540 | \f | |
541 | /* Appending token strings, with and without splicing */ | |
542 | ||
543 | ||
544 | /* Append the macro buffer SRC to the end of DEST, and ensure that | |
545 | doing so doesn't splice the token at the end of SRC with the token | |
546 | at the beginning of DEST. SRC and DEST must have their last_token | |
547 | fields set. Upon return, DEST's last_token field is set correctly. | |
548 | ||
549 | For example: | |
550 | ||
551 | If DEST is "(" and SRC is "y", then we can return with | |
552 | DEST set to "(y" --- we've simply appended the two buffers. | |
553 | ||
554 | However, if DEST is "x" and SRC is "y", then we must not return | |
555 | with DEST set to "xy" --- that would splice the two tokens "x" and | |
556 | "y" together to make a single token "xy". However, it would be | |
557 | fine to return with DEST set to "x y". Similarly, "<" and "<" must | |
558 | yield "< <", not "<<", etc. */ | |
559 | static void | |
560 | append_tokens_without_splicing (struct macro_buffer *dest, | |
561 | struct macro_buffer *src) | |
562 | { | |
563 | int original_dest_len = dest->len; | |
564 | struct macro_buffer dest_tail, new_token; | |
565 | ||
566 | gdb_assert (src->last_token != -1); | |
567 | gdb_assert (dest->last_token != -1); | |
568 | ||
569 | /* First, just try appending the two, and call get_token to see if | |
570 | we got a splice. */ | |
571 | appendmem (dest, src->text, src->len); | |
572 | ||
573 | /* If DEST originally had no token abutting its end, then we can't | |
574 | have spliced anything, so we're done. */ | |
575 | if (dest->last_token == original_dest_len) | |
576 | { | |
577 | dest->last_token = original_dest_len + src->last_token; | |
578 | return; | |
579 | } | |
580 | ||
581 | /* Set DEST_TAIL to point to the last token in DEST, followed by | |
582 | all the stuff we just appended. */ | |
583 | init_shared_buffer (&dest_tail, | |
584 | dest->text + dest->last_token, | |
585 | dest->len - dest->last_token); | |
586 | ||
587 | /* Re-parse DEST's last token. We know that DEST used to contain | |
588 | at least one token, so if it doesn't contain any after the | |
589 | append, then we must have spliced "/" and "*" or "/" and "/" to | |
590 | make a comment start. (Just for the record, I got this right | |
591 | the first time. This is not a bug fix.) */ | |
592 | if (get_token (&new_token, &dest_tail) | |
593 | && (new_token.text + new_token.len | |
594 | == dest->text + original_dest_len)) | |
595 | { | |
596 | /* No splice, so we're done. */ | |
597 | dest->last_token = original_dest_len + src->last_token; | |
598 | return; | |
599 | } | |
600 | ||
601 | /* Okay, a simple append caused a splice. Let's chop dest back to | |
602 | its original length and try again, but separate the texts with a | |
603 | space. */ | |
604 | dest->len = original_dest_len; | |
605 | appendc (dest, ' '); | |
606 | appendmem (dest, src->text, src->len); | |
607 | ||
608 | init_shared_buffer (&dest_tail, | |
609 | dest->text + dest->last_token, | |
610 | dest->len - dest->last_token); | |
611 | ||
612 | /* Try to re-parse DEST's last token, as above. */ | |
613 | if (get_token (&new_token, &dest_tail) | |
614 | && (new_token.text + new_token.len | |
615 | == dest->text + original_dest_len)) | |
616 | { | |
617 | /* No splice, so we're done. */ | |
618 | dest->last_token = original_dest_len + 1 + src->last_token; | |
619 | return; | |
620 | } | |
621 | ||
622 | /* As far as I know, there's no case where inserting a space isn't | |
623 | enough to prevent a splice. */ | |
624 | internal_error (__FILE__, __LINE__, | |
e2e0b3e5 | 625 | _("unable to avoid splicing tokens during macro expansion")); |
ec2bcbe7 JB |
626 | } |
627 | ||
628 | ||
629 | \f | |
630 | /* Expanding macros! */ | |
631 | ||
632 | ||
633 | /* A singly-linked list of the names of the macros we are currently | |
634 | expanding --- for detecting expansion loops. */ | |
635 | struct macro_name_list { | |
636 | const char *name; | |
637 | struct macro_name_list *next; | |
638 | }; | |
639 | ||
640 | ||
641 | /* Return non-zero if we are currently expanding the macro named NAME, | |
642 | according to LIST; otherwise, return zero. | |
643 | ||
644 | You know, it would be possible to get rid of all the NO_LOOP | |
645 | arguments to these functions by simply generating a new lookup | |
646 | function and baton which refuses to find the definition for a | |
647 | particular macro, and otherwise delegates the decision to another | |
648 | function/baton pair. But that makes the linked list of excluded | |
649 | macros chained through untyped baton pointers, which will make it | |
650 | harder to debug. :( */ | |
651 | static int | |
652 | currently_rescanning (struct macro_name_list *list, const char *name) | |
653 | { | |
654 | for (; list; list = list->next) | |
a86bc61c | 655 | if (strcmp (name, list->name) == 0) |
ec2bcbe7 JB |
656 | return 1; |
657 | ||
658 | return 0; | |
659 | } | |
660 | ||
661 | ||
662 | /* Gather the arguments to a macro expansion. | |
663 | ||
664 | NAME is the name of the macro being invoked. (It's only used for | |
665 | printing error messages.) | |
666 | ||
667 | Assume that SRC is the text of the macro invocation immediately | |
668 | following the macro name. For example, if we're processing the | |
669 | text foo(bar, baz), then NAME would be foo and SRC will be (bar, | |
670 | baz). | |
671 | ||
672 | If SRC doesn't start with an open paren ( token at all, return | |
673 | zero, leave SRC unchanged, and don't set *ARGC_P to anything. | |
674 | ||
675 | If SRC doesn't contain a properly terminated argument list, then | |
676 | raise an error. | |
677 | ||
678 | Otherwise, return a pointer to the first element of an array of | |
679 | macro buffers referring to the argument texts, and set *ARGC_P to | |
680 | the number of arguments we found --- the number of elements in the | |
681 | array. The macro buffers share their text with SRC, and their | |
682 | last_token fields are initialized. The array is allocated with | |
683 | xmalloc, and the caller is responsible for freeing it. | |
684 | ||
685 | NOTE WELL: if SRC starts with a open paren ( token followed | |
686 | immediately by a close paren ) token (e.g., the invocation looks | |
687 | like "foo()"), we treat that as one argument, which happens to be | |
688 | the empty list of tokens. The caller should keep in mind that such | |
689 | a sequence of tokens is a valid way to invoke one-parameter | |
690 | function-like macros, but also a valid way to invoke zero-parameter | |
691 | function-like macros. Eeew. | |
692 | ||
693 | Consume the tokens from SRC; after this call, SRC contains the text | |
694 | following the invocation. */ | |
695 | ||
696 | static struct macro_buffer * | |
697 | gather_arguments (const char *name, struct macro_buffer *src, int *argc_p) | |
698 | { | |
699 | struct macro_buffer tok; | |
700 | int args_len, args_size; | |
a86bc61c | 701 | struct macro_buffer *args = NULL; |
ec2bcbe7 JB |
702 | struct cleanup *back_to = make_cleanup (free_current_contents, &args); |
703 | ||
704 | /* Does SRC start with an opening paren token? Read from a copy of | |
705 | SRC, so SRC itself is unaffected if we don't find an opening | |
706 | paren. */ | |
707 | { | |
708 | struct macro_buffer temp; | |
709 | init_shared_buffer (&temp, src->text, src->len); | |
710 | ||
711 | if (! get_token (&tok, &temp) | |
712 | || tok.len != 1 | |
713 | || tok.text[0] != '(') | |
714 | { | |
715 | discard_cleanups (back_to); | |
716 | return 0; | |
717 | } | |
718 | } | |
719 | ||
720 | /* Consume SRC's opening paren. */ | |
721 | get_token (&tok, src); | |
722 | ||
723 | args_len = 0; | |
b1ddacc7 | 724 | args_size = 6; |
ec2bcbe7 JB |
725 | args = (struct macro_buffer *) xmalloc (sizeof (*args) * args_size); |
726 | ||
727 | for (;;) | |
728 | { | |
729 | struct macro_buffer *arg; | |
730 | int depth; | |
731 | ||
732 | /* Make sure we have room for the next argument. */ | |
733 | if (args_len >= args_size) | |
734 | { | |
735 | args_size *= 2; | |
736 | args = xrealloc (args, sizeof (*args) * args_size); | |
737 | } | |
738 | ||
739 | /* Initialize the next argument. */ | |
740 | arg = &args[args_len++]; | |
741 | set_token (arg, src->text, src->text); | |
742 | ||
743 | /* Gather the argument's tokens. */ | |
744 | depth = 0; | |
745 | for (;;) | |
746 | { | |
747 | char *start = src->text; | |
748 | ||
749 | if (! get_token (&tok, src)) | |
8a3fe4f8 | 750 | error (_("Malformed argument list for macro `%s'."), name); |
ec2bcbe7 JB |
751 | |
752 | /* Is tok an opening paren? */ | |
753 | if (tok.len == 1 && tok.text[0] == '(') | |
754 | depth++; | |
755 | ||
756 | /* Is tok is a closing paren? */ | |
757 | else if (tok.len == 1 && tok.text[0] == ')') | |
758 | { | |
759 | /* If it's a closing paren at the top level, then that's | |
760 | the end of the argument list. */ | |
761 | if (depth == 0) | |
762 | { | |
763 | discard_cleanups (back_to); | |
764 | *argc_p = args_len; | |
765 | return args; | |
766 | } | |
767 | ||
768 | depth--; | |
769 | } | |
770 | ||
771 | /* If tok is a comma at top level, then that's the end of | |
772 | the current argument. */ | |
773 | else if (tok.len == 1 && tok.text[0] == ',' && depth == 0) | |
774 | break; | |
775 | ||
776 | /* Extend the current argument to enclose this token. If | |
777 | this is the current argument's first token, leave out any | |
778 | leading whitespace, just for aesthetics. */ | |
779 | if (arg->len == 0) | |
780 | { | |
781 | arg->text = tok.text; | |
782 | arg->len = tok.len; | |
783 | arg->last_token = 0; | |
784 | } | |
785 | else | |
786 | { | |
787 | arg->len = (tok.text + tok.len) - arg->text; | |
788 | arg->last_token = tok.text - arg->text; | |
789 | } | |
790 | } | |
791 | } | |
792 | } | |
793 | ||
794 | ||
795 | /* The `expand' and `substitute_args' functions both invoke `scan' | |
796 | recursively, so we need a forward declaration somewhere. */ | |
797 | static void scan (struct macro_buffer *dest, | |
798 | struct macro_buffer *src, | |
799 | struct macro_name_list *no_loop, | |
800 | macro_lookup_ftype *lookup_func, | |
801 | void *lookup_baton); | |
802 | ||
803 | ||
804 | /* Given the macro definition DEF, being invoked with the actual | |
805 | arguments given by ARGC and ARGV, substitute the arguments into the | |
806 | replacement list, and store the result in DEST. | |
807 | ||
808 | If it is necessary to expand macro invocations in one of the | |
809 | arguments, use LOOKUP_FUNC and LOOKUP_BATON to find the macro | |
810 | definitions, and don't expand invocations of the macros listed in | |
811 | NO_LOOP. */ | |
812 | static void | |
813 | substitute_args (struct macro_buffer *dest, | |
814 | struct macro_definition *def, | |
815 | int argc, struct macro_buffer *argv, | |
816 | struct macro_name_list *no_loop, | |
817 | macro_lookup_ftype *lookup_func, | |
818 | void *lookup_baton) | |
819 | { | |
820 | /* A macro buffer for the macro's replacement list. */ | |
821 | struct macro_buffer replacement_list; | |
822 | ||
823 | init_shared_buffer (&replacement_list, (char *) def->replacement, | |
824 | strlen (def->replacement)); | |
825 | ||
826 | gdb_assert (dest->len == 0); | |
827 | dest->last_token = 0; | |
828 | ||
829 | for (;;) | |
830 | { | |
831 | struct macro_buffer tok; | |
832 | char *original_rl_start = replacement_list.text; | |
833 | int substituted = 0; | |
834 | ||
835 | /* Find the next token in the replacement list. */ | |
836 | if (! get_token (&tok, &replacement_list)) | |
837 | break; | |
838 | ||
839 | /* Just for aesthetics. If we skipped some whitespace, copy | |
840 | that to DEST. */ | |
841 | if (tok.text > original_rl_start) | |
842 | { | |
843 | appendmem (dest, original_rl_start, tok.text - original_rl_start); | |
844 | dest->last_token = dest->len; | |
845 | } | |
846 | ||
847 | /* Is this token the stringification operator? */ | |
848 | if (tok.len == 1 | |
849 | && tok.text[0] == '#') | |
8a3fe4f8 | 850 | error (_("Stringification is not implemented yet.")); |
ec2bcbe7 JB |
851 | |
852 | /* Is this token the splicing operator? */ | |
853 | if (tok.len == 2 | |
854 | && tok.text[0] == '#' | |
855 | && tok.text[1] == '#') | |
8a3fe4f8 | 856 | error (_("Token splicing is not implemented yet.")); |
ec2bcbe7 JB |
857 | |
858 | /* Is this token an identifier? */ | |
859 | if (tok.is_identifier) | |
860 | { | |
861 | int i; | |
862 | ||
863 | /* Is it the magic varargs parameter? */ | |
864 | if (tok.len == 11 | |
865 | && ! memcmp (tok.text, "__VA_ARGS__", 11)) | |
8a3fe4f8 | 866 | error (_("Variable-arity macros not implemented yet.")); |
ec2bcbe7 JB |
867 | |
868 | /* Is it one of the parameters? */ | |
869 | for (i = 0; i < def->argc; i++) | |
870 | if (tok.len == strlen (def->argv[i]) | |
871 | && ! memcmp (tok.text, def->argv[i], tok.len)) | |
872 | { | |
873 | struct macro_buffer arg_src; | |
874 | ||
875 | /* Expand any macro invocations in the argument text, | |
876 | and append the result to dest. Remember that scan | |
877 | mutates its source, so we need to scan a new buffer | |
878 | referring to the argument's text, not the argument | |
879 | itself. */ | |
880 | init_shared_buffer (&arg_src, argv[i].text, argv[i].len); | |
881 | scan (dest, &arg_src, no_loop, lookup_func, lookup_baton); | |
882 | substituted = 1; | |
883 | break; | |
884 | } | |
885 | } | |
886 | ||
887 | /* If it wasn't a parameter, then just copy it across. */ | |
888 | if (! substituted) | |
889 | append_tokens_without_splicing (dest, &tok); | |
890 | } | |
891 | } | |
892 | ||
893 | ||
894 | /* Expand a call to a macro named ID, whose definition is DEF. Append | |
895 | its expansion to DEST. SRC is the input text following the ID | |
896 | token. We are currently rescanning the expansions of the macros | |
897 | named in NO_LOOP; don't re-expand them. Use LOOKUP_FUNC and | |
898 | LOOKUP_BATON to find definitions for any nested macro references. | |
899 | ||
900 | Return 1 if we decided to expand it, zero otherwise. (If it's a | |
901 | function-like macro name that isn't followed by an argument list, | |
902 | we don't expand it.) If we return zero, leave SRC unchanged. */ | |
903 | static int | |
904 | expand (const char *id, | |
905 | struct macro_definition *def, | |
906 | struct macro_buffer *dest, | |
907 | struct macro_buffer *src, | |
908 | struct macro_name_list *no_loop, | |
909 | macro_lookup_ftype *lookup_func, | |
910 | void *lookup_baton) | |
911 | { | |
912 | struct macro_name_list new_no_loop; | |
913 | ||
914 | /* Create a new node to be added to the front of the no-expand list. | |
915 | This list is appropriate for re-scanning replacement lists, but | |
916 | it is *not* appropriate for scanning macro arguments; invocations | |
917 | of the macro whose arguments we are gathering *do* get expanded | |
918 | there. */ | |
919 | new_no_loop.name = id; | |
920 | new_no_loop.next = no_loop; | |
921 | ||
922 | /* What kind of macro are we expanding? */ | |
923 | if (def->kind == macro_object_like) | |
924 | { | |
925 | struct macro_buffer replacement_list; | |
926 | ||
927 | init_shared_buffer (&replacement_list, (char *) def->replacement, | |
928 | strlen (def->replacement)); | |
929 | ||
930 | scan (dest, &replacement_list, &new_no_loop, lookup_func, lookup_baton); | |
931 | return 1; | |
932 | } | |
933 | else if (def->kind == macro_function_like) | |
934 | { | |
935 | struct cleanup *back_to = make_cleanup (null_cleanup, 0); | |
0a029df5 | 936 | int argc = 0; |
a86bc61c | 937 | struct macro_buffer *argv = NULL; |
ec2bcbe7 JB |
938 | struct macro_buffer substituted; |
939 | struct macro_buffer substituted_src; | |
940 | ||
941 | if (def->argc >= 1 | |
a86bc61c | 942 | && strcmp (def->argv[def->argc - 1], "...") == 0) |
8a3fe4f8 | 943 | error (_("Varargs macros not implemented yet.")); |
ec2bcbe7 JB |
944 | |
945 | make_cleanup (free_current_contents, &argv); | |
946 | argv = gather_arguments (id, src, &argc); | |
947 | ||
948 | /* If we couldn't find any argument list, then we don't expand | |
949 | this macro. */ | |
950 | if (! argv) | |
951 | { | |
952 | do_cleanups (back_to); | |
953 | return 0; | |
954 | } | |
955 | ||
956 | /* Check that we're passing an acceptable number of arguments for | |
957 | this macro. */ | |
958 | if (argc != def->argc) | |
959 | { | |
960 | /* Remember that a sequence of tokens like "foo()" is a | |
961 | valid invocation of a macro expecting either zero or one | |
962 | arguments. */ | |
963 | if (! (argc == 1 | |
964 | && argv[0].len == 0 | |
965 | && def->argc == 0)) | |
8a3fe4f8 AC |
966 | error (_("Wrong number of arguments to macro `%s' " |
967 | "(expected %d, got %d)."), | |
ec2bcbe7 JB |
968 | id, def->argc, argc); |
969 | } | |
970 | ||
971 | /* Note that we don't expand macro invocations in the arguments | |
972 | yet --- we let subst_args take care of that. Parameters that | |
973 | appear as operands of the stringifying operator "#" or the | |
974 | splicing operator "##" don't get macro references expanded, | |
975 | so we can't really tell whether it's appropriate to macro- | |
976 | expand an argument until we see how it's being used. */ | |
977 | init_buffer (&substituted, 0); | |
978 | make_cleanup (cleanup_macro_buffer, &substituted); | |
979 | substitute_args (&substituted, def, argc, argv, no_loop, | |
980 | lookup_func, lookup_baton); | |
981 | ||
982 | /* Now `substituted' is the macro's replacement list, with all | |
983 | argument values substituted into it properly. Re-scan it for | |
984 | macro references, but don't expand invocations of this macro. | |
985 | ||
986 | We create a new buffer, `substituted_src', which points into | |
987 | `substituted', and scan that. We can't scan `substituted' | |
988 | itself, since the tokenization process moves the buffer's | |
989 | text pointer around, and we still need to be able to find | |
990 | `substituted's original text buffer after scanning it so we | |
991 | can free it. */ | |
992 | init_shared_buffer (&substituted_src, substituted.text, substituted.len); | |
993 | scan (dest, &substituted_src, &new_no_loop, lookup_func, lookup_baton); | |
994 | ||
995 | do_cleanups (back_to); | |
996 | ||
997 | return 1; | |
998 | } | |
999 | else | |
e2e0b3e5 | 1000 | internal_error (__FILE__, __LINE__, _("bad macro definition kind")); |
ec2bcbe7 JB |
1001 | } |
1002 | ||
1003 | ||
1004 | /* If the single token in SRC_FIRST followed by the tokens in SRC_REST | |
1005 | constitute a macro invokation not forbidden in NO_LOOP, append its | |
1006 | expansion to DEST and return non-zero. Otherwise, return zero, and | |
1007 | leave DEST unchanged. | |
1008 | ||
1009 | SRC_FIRST and SRC_REST must be shared buffers; DEST must not be one. | |
1010 | SRC_FIRST must be a string built by get_token. */ | |
1011 | static int | |
1012 | maybe_expand (struct macro_buffer *dest, | |
1013 | struct macro_buffer *src_first, | |
1014 | struct macro_buffer *src_rest, | |
1015 | struct macro_name_list *no_loop, | |
1016 | macro_lookup_ftype *lookup_func, | |
1017 | void *lookup_baton) | |
1018 | { | |
1019 | gdb_assert (src_first->shared); | |
1020 | gdb_assert (src_rest->shared); | |
1021 | gdb_assert (! dest->shared); | |
1022 | ||
1023 | /* Is this token an identifier? */ | |
1024 | if (src_first->is_identifier) | |
1025 | { | |
1026 | /* Make a null-terminated copy of it, since that's what our | |
1027 | lookup function expects. */ | |
1028 | char *id = xmalloc (src_first->len + 1); | |
1029 | struct cleanup *back_to = make_cleanup (xfree, id); | |
1030 | memcpy (id, src_first->text, src_first->len); | |
1031 | id[src_first->len] = 0; | |
1032 | ||
1033 | /* If we're currently re-scanning the result of expanding | |
1034 | this macro, don't expand it again. */ | |
1035 | if (! currently_rescanning (no_loop, id)) | |
1036 | { | |
1037 | /* Does this identifier have a macro definition in scope? */ | |
1038 | struct macro_definition *def = lookup_func (id, lookup_baton); | |
1039 | ||
1040 | if (def && expand (id, def, dest, src_rest, no_loop, | |
1041 | lookup_func, lookup_baton)) | |
1042 | { | |
1043 | do_cleanups (back_to); | |
1044 | return 1; | |
1045 | } | |
1046 | } | |
1047 | ||
1048 | do_cleanups (back_to); | |
1049 | } | |
1050 | ||
1051 | return 0; | |
1052 | } | |
1053 | ||
1054 | ||
1055 | /* Expand macro references in SRC, appending the results to DEST. | |
1056 | Assume we are re-scanning the result of expanding the macros named | |
1057 | in NO_LOOP, and don't try to re-expand references to them. | |
1058 | ||
1059 | SRC must be a shared buffer; DEST must not be one. */ | |
1060 | static void | |
1061 | scan (struct macro_buffer *dest, | |
1062 | struct macro_buffer *src, | |
1063 | struct macro_name_list *no_loop, | |
1064 | macro_lookup_ftype *lookup_func, | |
1065 | void *lookup_baton) | |
1066 | { | |
1067 | gdb_assert (src->shared); | |
1068 | gdb_assert (! dest->shared); | |
1069 | ||
1070 | for (;;) | |
1071 | { | |
1072 | struct macro_buffer tok; | |
1073 | char *original_src_start = src->text; | |
1074 | ||
1075 | /* Find the next token in SRC. */ | |
1076 | if (! get_token (&tok, src)) | |
1077 | break; | |
1078 | ||
1079 | /* Just for aesthetics. If we skipped some whitespace, copy | |
1080 | that to DEST. */ | |
1081 | if (tok.text > original_src_start) | |
1082 | { | |
1083 | appendmem (dest, original_src_start, tok.text - original_src_start); | |
1084 | dest->last_token = dest->len; | |
1085 | } | |
1086 | ||
1087 | if (! maybe_expand (dest, &tok, src, no_loop, lookup_func, lookup_baton)) | |
1088 | /* We didn't end up expanding tok as a macro reference, so | |
1089 | simply append it to dest. */ | |
1090 | append_tokens_without_splicing (dest, &tok); | |
1091 | } | |
1092 | ||
1093 | /* Just for aesthetics. If there was any trailing whitespace in | |
1094 | src, copy it to dest. */ | |
1095 | if (src->len) | |
1096 | { | |
1097 | appendmem (dest, src->text, src->len); | |
1098 | dest->last_token = dest->len; | |
1099 | } | |
1100 | } | |
1101 | ||
1102 | ||
1103 | char * | |
1104 | macro_expand (const char *source, | |
1105 | macro_lookup_ftype *lookup_func, | |
1106 | void *lookup_func_baton) | |
1107 | { | |
1108 | struct macro_buffer src, dest; | |
1109 | struct cleanup *back_to; | |
1110 | ||
1111 | init_shared_buffer (&src, (char *) source, strlen (source)); | |
1112 | ||
1113 | init_buffer (&dest, 0); | |
1114 | dest.last_token = 0; | |
1115 | back_to = make_cleanup (cleanup_macro_buffer, &dest); | |
1116 | ||
1117 | scan (&dest, &src, 0, lookup_func, lookup_func_baton); | |
1118 | ||
1119 | appendc (&dest, '\0'); | |
1120 | ||
1121 | discard_cleanups (back_to); | |
1122 | return dest.text; | |
1123 | } | |
1124 | ||
1125 | ||
1126 | char * | |
1127 | macro_expand_once (const char *source, | |
1128 | macro_lookup_ftype *lookup_func, | |
1129 | void *lookup_func_baton) | |
1130 | { | |
8a3fe4f8 | 1131 | error (_("Expand-once not implemented yet.")); |
ec2bcbe7 JB |
1132 | } |
1133 | ||
1134 | ||
1135 | char * | |
1136 | macro_expand_next (char **lexptr, | |
1137 | macro_lookup_ftype *lookup_func, | |
1138 | void *lookup_baton) | |
1139 | { | |
1140 | struct macro_buffer src, dest, tok; | |
1141 | struct cleanup *back_to; | |
1142 | ||
1143 | /* Set up SRC to refer to the input text, pointed to by *lexptr. */ | |
1144 | init_shared_buffer (&src, *lexptr, strlen (*lexptr)); | |
1145 | ||
1146 | /* Set up DEST to receive the expansion, if there is one. */ | |
1147 | init_buffer (&dest, 0); | |
1148 | dest.last_token = 0; | |
1149 | back_to = make_cleanup (cleanup_macro_buffer, &dest); | |
1150 | ||
1151 | /* Get the text's first preprocessing token. */ | |
1152 | if (! get_token (&tok, &src)) | |
1153 | { | |
1154 | do_cleanups (back_to); | |
1155 | return 0; | |
1156 | } | |
1157 | ||
1158 | /* If it's a macro invocation, expand it. */ | |
1159 | if (maybe_expand (&dest, &tok, &src, 0, lookup_func, lookup_baton)) | |
1160 | { | |
1161 | /* It was a macro invocation! Package up the expansion as a | |
1162 | null-terminated string and return it. Set *lexptr to the | |
1163 | start of the next token in the input. */ | |
1164 | appendc (&dest, '\0'); | |
1165 | discard_cleanups (back_to); | |
1166 | *lexptr = src.text; | |
1167 | return dest.text; | |
1168 | } | |
1169 | else | |
1170 | { | |
1171 | /* It wasn't a macro invocation. */ | |
1172 | do_cleanups (back_to); | |
1173 | return 0; | |
1174 | } | |
1175 | } |