2 Copyright (C) 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
3 Written by Mark Mitchell <mark@codesourcery.com>.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GCC is distributed in the hope that it will be useful, but
13 WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA
24 #include "coretypes.h"
26 #include "dyn-string.h"
34 #include "diagnostic.h"
44 A cp_lexer represents a stream of cp_tokens. It allows arbitrary
50 We use a circular buffer to store incoming tokens.
52 Some artifacts of the C++ language (such as the
53 expression/declaration ambiguity) require arbitrary look-ahead.
54 The strategy we adopt for dealing with these problems is to attempt
55 to parse one construct (e.g., the declaration) and fall back to the
56 other (e.g., the expression) if that attempt does not succeed.
57 Therefore, we must sometimes store an arbitrary number of tokens.
59 The parser routinely peeks at the next token, and then consumes it
60 later. That also requires a buffer in which to store the tokens.
62 In order to easily permit adding tokens to the end of the buffer,
63 while removing them from the beginning of the buffer, we use a
68 typedef struct cp_token GTY (())
70 /* The kind of token. */
71 ENUM_BITFIELD (cpp_ttype) type : 8;
72 /* If this token is a keyword, this value indicates which keyword.
73 Otherwise, this value is RID_MAX. */
74 ENUM_BITFIELD (rid) keyword : 8;
77 /* The value associated with this token, if any. */
79 /* The location at which this token was found. */
83 /* The number of tokens in a single token block.
84 Computed so that cp_token_block fits in a 512B allocation unit. */
86 #define CP_TOKEN_BLOCK_NUM_TOKENS ((512 - 3*sizeof (char*))/sizeof (cp_token))
88 /* A group of tokens. These groups are chained together to store
89 large numbers of tokens. (For example, a token block is created
90 when the body of an inline member function is first encountered;
91 the tokens are processed later after the class definition is
94 This somewhat ungainly data structure (as opposed to, say, a
95 variable-length array), is used due to constraints imposed by the
96 current garbage-collection methodology. If it is made more
97 flexible, we could perhaps simplify the data structures involved. */
99 typedef struct cp_token_block GTY (())
102 cp_token tokens[CP_TOKEN_BLOCK_NUM_TOKENS];
103 /* The number of tokens in this block. */
105 /* The next token block in the chain. */
106 struct cp_token_block *next;
107 /* The previous block in the chain. */
108 struct cp_token_block *prev;
111 typedef struct cp_token_cache GTY (())
113 /* The first block in the cache. NULL if there are no tokens in the
115 cp_token_block *first;
116 /* The last block in the cache. NULL If there are no tokens in the
118 cp_token_block *last;
123 static cp_token_cache *cp_token_cache_new
125 static void cp_token_cache_push_token
126 (cp_token_cache *, cp_token *);
128 /* Create a new cp_token_cache. */
130 static cp_token_cache *
131 cp_token_cache_new (void)
133 return ggc_alloc_cleared (sizeof (cp_token_cache));
136 /* Add *TOKEN to *CACHE. */
139 cp_token_cache_push_token (cp_token_cache *cache,
142 cp_token_block *b = cache->last;
144 /* See if we need to allocate a new token block. */
145 if (!b || b->num_tokens == CP_TOKEN_BLOCK_NUM_TOKENS)
147 b = ggc_alloc_cleared (sizeof (cp_token_block));
148 b->prev = cache->last;
151 cache->last->next = b;
155 cache->first = cache->last = b;
157 /* Add this token to the current token block. */
158 b->tokens[b->num_tokens++] = *token;
161 /* The cp_lexer structure represents the C++ lexer. It is responsible
162 for managing the token stream from the preprocessor and supplying
165 typedef struct cp_lexer GTY (())
167 /* The memory allocated for the buffer. Never NULL. */
168 cp_token * GTY ((length ("(%h.buffer_end - %h.buffer)"))) buffer;
169 /* A pointer just past the end of the memory allocated for the buffer. */
170 cp_token * GTY ((skip)) buffer_end;
171 /* The first valid token in the buffer, or NULL if none. */
172 cp_token * GTY ((skip)) first_token;
173 /* The next available token. If NEXT_TOKEN is NULL, then there are
174 no more available tokens. */
175 cp_token * GTY ((skip)) next_token;
176 /* A pointer just past the last available token. If FIRST_TOKEN is
177 NULL, however, there are no available tokens, and then this
178 location is simply the place in which the next token read will be
179 placed. If LAST_TOKEN == FIRST_TOKEN, then the buffer is full.
180 When the LAST_TOKEN == BUFFER, then the last token is at the
181 highest memory address in the BUFFER. */
182 cp_token * GTY ((skip)) last_token;
184 /* A stack indicating positions at which cp_lexer_save_tokens was
185 called. The top entry is the most recent position at which we
186 began saving tokens. The entries are differences in token
187 position between FIRST_TOKEN and the first saved token.
189 If the stack is non-empty, we are saving tokens. When a token is
190 consumed, the NEXT_TOKEN pointer will move, but the FIRST_TOKEN
191 pointer will not. The token stream will be preserved so that it
192 can be reexamined later.
194 If the stack is empty, then we are not saving tokens. Whenever a
195 token is consumed, the FIRST_TOKEN pointer will be moved, and the
196 consumed token will be gone forever. */
197 varray_type saved_tokens;
199 /* The STRING_CST tokens encountered while processing the current
201 varray_type string_tokens;
203 /* True if we should obtain more tokens from the preprocessor; false
204 if we are processing a saved token cache. */
207 /* True if we should output debugging information. */
210 /* The next lexer in a linked list of lexers. */
211 struct cp_lexer *next;
216 static cp_lexer *cp_lexer_new_main
218 static cp_lexer *cp_lexer_new_from_tokens
219 (struct cp_token_cache *);
220 static int cp_lexer_saving_tokens
222 static cp_token *cp_lexer_next_token
223 (cp_lexer *, cp_token *);
224 static cp_token *cp_lexer_prev_token
225 (cp_lexer *, cp_token *);
226 static ptrdiff_t cp_lexer_token_difference
227 (cp_lexer *, cp_token *, cp_token *);
228 static cp_token *cp_lexer_read_token
230 static void cp_lexer_maybe_grow_buffer
232 static void cp_lexer_get_preprocessor_token
233 (cp_lexer *, cp_token *);
234 static cp_token *cp_lexer_peek_token
236 static cp_token *cp_lexer_peek_nth_token
237 (cp_lexer *, size_t);
238 static inline bool cp_lexer_next_token_is
239 (cp_lexer *, enum cpp_ttype);
240 static bool cp_lexer_next_token_is_not
241 (cp_lexer *, enum cpp_ttype);
242 static bool cp_lexer_next_token_is_keyword
243 (cp_lexer *, enum rid);
244 static cp_token *cp_lexer_consume_token
246 static void cp_lexer_purge_token
248 static void cp_lexer_purge_tokens_after
249 (cp_lexer *, cp_token *);
250 static void cp_lexer_save_tokens
252 static void cp_lexer_commit_tokens
254 static void cp_lexer_rollback_tokens
256 static inline void cp_lexer_set_source_position_from_token
257 (cp_lexer *, const cp_token *);
258 static void cp_lexer_print_token
259 (FILE *, cp_token *);
260 static inline bool cp_lexer_debugging_p
262 static void cp_lexer_start_debugging
263 (cp_lexer *) ATTRIBUTE_UNUSED;
264 static void cp_lexer_stop_debugging
265 (cp_lexer *) ATTRIBUTE_UNUSED;
267 /* Manifest constants. */
269 #define CP_TOKEN_BUFFER_SIZE 5
270 #define CP_SAVED_TOKENS_SIZE 5
272 /* A token type for keywords, as opposed to ordinary identifiers. */
273 #define CPP_KEYWORD ((enum cpp_ttype) (N_TTYPES + 1))
275 /* A token type for template-ids. If a template-id is processed while
276 parsing tentatively, it is replaced with a CPP_TEMPLATE_ID token;
277 the value of the CPP_TEMPLATE_ID is whatever was returned by
278 cp_parser_template_id. */
279 #define CPP_TEMPLATE_ID ((enum cpp_ttype) (CPP_KEYWORD + 1))
281 /* A token type for nested-name-specifiers. If a
282 nested-name-specifier is processed while parsing tentatively, it is
283 replaced with a CPP_NESTED_NAME_SPECIFIER token; the value of the
284 CPP_NESTED_NAME_SPECIFIER is whatever was returned by
285 cp_parser_nested_name_specifier_opt. */
286 #define CPP_NESTED_NAME_SPECIFIER ((enum cpp_ttype) (CPP_TEMPLATE_ID + 1))
288 /* A token type for tokens that are not tokens at all; these are used
289 to mark the end of a token block. */
290 #define CPP_NONE (CPP_NESTED_NAME_SPECIFIER + 1)
294 /* The stream to which debugging output should be written. */
295 static FILE *cp_lexer_debug_stream;
297 /* Create a new main C++ lexer, the lexer that gets tokens from the
301 cp_lexer_new_main (void)
304 cp_token first_token;
306 /* It's possible that lexing the first token will load a PCH file,
307 which is a GC collection point. So we have to grab the first
308 token before allocating any memory. */
309 cp_lexer_get_preprocessor_token (NULL, &first_token);
310 c_common_no_more_pch ();
312 /* Allocate the memory. */
313 lexer = ggc_alloc_cleared (sizeof (cp_lexer));
315 /* Create the circular buffer. */
316 lexer->buffer = ggc_calloc (CP_TOKEN_BUFFER_SIZE, sizeof (cp_token));
317 lexer->buffer_end = lexer->buffer + CP_TOKEN_BUFFER_SIZE;
319 /* There is one token in the buffer. */
320 lexer->last_token = lexer->buffer + 1;
321 lexer->first_token = lexer->buffer;
322 lexer->next_token = lexer->buffer;
323 memcpy (lexer->buffer, &first_token, sizeof (cp_token));
325 /* This lexer obtains more tokens by calling c_lex. */
326 lexer->main_lexer_p = true;
328 /* Create the SAVED_TOKENS stack. */
329 VARRAY_INT_INIT (lexer->saved_tokens, CP_SAVED_TOKENS_SIZE, "saved_tokens");
331 /* Create the STRINGS array. */
332 VARRAY_TREE_INIT (lexer->string_tokens, 32, "strings");
334 /* Assume we are not debugging. */
335 lexer->debugging_p = false;
340 /* Create a new lexer whose token stream is primed with the TOKENS.
341 When these tokens are exhausted, no new tokens will be read. */
344 cp_lexer_new_from_tokens (cp_token_cache *tokens)
348 cp_token_block *block;
349 ptrdiff_t num_tokens;
351 /* Allocate the memory. */
352 lexer = ggc_alloc_cleared (sizeof (cp_lexer));
354 /* Create a new buffer, appropriately sized. */
356 for (block = tokens->first; block != NULL; block = block->next)
357 num_tokens += block->num_tokens;
358 lexer->buffer = ggc_alloc (num_tokens * sizeof (cp_token));
359 lexer->buffer_end = lexer->buffer + num_tokens;
361 /* Install the tokens. */
362 token = lexer->buffer;
363 for (block = tokens->first; block != NULL; block = block->next)
365 memcpy (token, block->tokens, block->num_tokens * sizeof (cp_token));
366 token += block->num_tokens;
369 /* The FIRST_TOKEN is the beginning of the buffer. */
370 lexer->first_token = lexer->buffer;
371 /* The next available token is also at the beginning of the buffer. */
372 lexer->next_token = lexer->buffer;
373 /* The buffer is full. */
374 lexer->last_token = lexer->first_token;
376 /* This lexer doesn't obtain more tokens. */
377 lexer->main_lexer_p = false;
379 /* Create the SAVED_TOKENS stack. */
380 VARRAY_INT_INIT (lexer->saved_tokens, CP_SAVED_TOKENS_SIZE, "saved_tokens");
382 /* Create the STRINGS array. */
383 VARRAY_TREE_INIT (lexer->string_tokens, 32, "strings");
385 /* Assume we are not debugging. */
386 lexer->debugging_p = false;
391 /* Returns nonzero if debugging information should be output. */
394 cp_lexer_debugging_p (cp_lexer *lexer)
396 return lexer->debugging_p;
399 /* Set the current source position from the information stored in
403 cp_lexer_set_source_position_from_token (cp_lexer *lexer ATTRIBUTE_UNUSED ,
404 const cp_token *token)
406 /* Ideally, the source position information would not be a global
407 variable, but it is. */
409 /* Update the line number. */
410 if (token->type != CPP_EOF)
411 input_location = token->location;
414 /* TOKEN points into the circular token buffer. Return a pointer to
415 the next token in the buffer. */
417 static inline cp_token *
418 cp_lexer_next_token (cp_lexer* lexer, cp_token* token)
421 if (token == lexer->buffer_end)
422 token = lexer->buffer;
426 /* TOKEN points into the circular token buffer. Return a pointer to
427 the previous token in the buffer. */
429 static inline cp_token *
430 cp_lexer_prev_token (cp_lexer* lexer, cp_token* token)
432 if (token == lexer->buffer)
433 token = lexer->buffer_end;
437 /* nonzero if we are presently saving tokens. */
440 cp_lexer_saving_tokens (const cp_lexer* lexer)
442 return VARRAY_ACTIVE_SIZE (lexer->saved_tokens) != 0;
445 /* Return a pointer to the token that is N tokens beyond TOKEN in the
449 cp_lexer_advance_token (cp_lexer *lexer, cp_token *token, ptrdiff_t n)
452 if (token >= lexer->buffer_end)
453 token = lexer->buffer + (token - lexer->buffer_end);
457 /* Returns the number of times that START would have to be incremented
458 to reach FINISH. If START and FINISH are the same, returns zero. */
461 cp_lexer_token_difference (cp_lexer* lexer, cp_token* start, cp_token* finish)
464 return finish - start;
466 return ((lexer->buffer_end - lexer->buffer)
470 /* Obtain another token from the C preprocessor and add it to the
471 token buffer. Returns the newly read token. */
474 cp_lexer_read_token (cp_lexer* lexer)
478 /* Make sure there is room in the buffer. */
479 cp_lexer_maybe_grow_buffer (lexer);
481 /* If there weren't any tokens, then this one will be the first. */
482 if (!lexer->first_token)
483 lexer->first_token = lexer->last_token;
484 /* Similarly, if there were no available tokens, there is one now. */
485 if (!lexer->next_token)
486 lexer->next_token = lexer->last_token;
488 /* Figure out where we're going to store the new token. */
489 token = lexer->last_token;
491 /* Get a new token from the preprocessor. */
492 cp_lexer_get_preprocessor_token (lexer, token);
494 /* Increment LAST_TOKEN. */
495 lexer->last_token = cp_lexer_next_token (lexer, token);
497 /* Strings should have type `const char []'. Right now, we will
498 have an ARRAY_TYPE that is constant rather than an array of
500 FIXME: Make fix_string_type get this right in the first place. */
501 if ((token->type == CPP_STRING || token->type == CPP_WSTRING)
502 && flag_const_strings)
504 if (c_lex_string_translate)
506 tree value = token->value;
509 /* We might as well go ahead and release the chained
510 translated string such that we can reuse its memory. */
511 if (TREE_CHAIN (value))
512 value = TREE_CHAIN (token->value);
514 /* Get the current type. It will be an ARRAY_TYPE. */
515 type = TREE_TYPE (value);
516 /* Use build_cplus_array_type to rebuild the array, thereby
517 getting the right type. */
518 type = build_cplus_array_type (TREE_TYPE (type),
520 /* Reset the type of the token. */
521 TREE_TYPE (value) = type;
528 /* If the circular buffer is full, make it bigger. */
531 cp_lexer_maybe_grow_buffer (cp_lexer* lexer)
533 /* If the buffer is full, enlarge it. */
534 if (lexer->last_token == lexer->first_token)
536 cp_token *new_buffer;
537 cp_token *old_buffer;
538 cp_token *new_first_token;
539 ptrdiff_t buffer_length;
540 size_t num_tokens_to_copy;
542 /* Remember the current buffer pointer. It will become invalid,
543 but we will need to do pointer arithmetic involving this
545 old_buffer = lexer->buffer;
546 /* Compute the current buffer size. */
547 buffer_length = lexer->buffer_end - lexer->buffer;
548 /* Allocate a buffer twice as big. */
549 new_buffer = ggc_realloc (lexer->buffer,
550 2 * buffer_length * sizeof (cp_token));
552 /* Because the buffer is circular, logically consecutive tokens
553 are not necessarily placed consecutively in memory.
554 Therefore, we must keep move the tokens that were before
555 FIRST_TOKEN to the second half of the newly allocated
557 num_tokens_to_copy = (lexer->first_token - old_buffer);
558 memcpy (new_buffer + buffer_length,
560 num_tokens_to_copy * sizeof (cp_token));
561 /* Clear the rest of the buffer. We never look at this storage,
562 but the garbage collector may. */
563 memset (new_buffer + buffer_length + num_tokens_to_copy, 0,
564 (buffer_length - num_tokens_to_copy) * sizeof (cp_token));
566 /* Now recompute all of the buffer pointers. */
568 = new_buffer + (lexer->first_token - old_buffer);
569 if (lexer->next_token != NULL)
571 ptrdiff_t next_token_delta;
573 if (lexer->next_token > lexer->first_token)
574 next_token_delta = lexer->next_token - lexer->first_token;
577 buffer_length - (lexer->first_token - lexer->next_token);
578 lexer->next_token = new_first_token + next_token_delta;
580 lexer->last_token = new_first_token + buffer_length;
581 lexer->buffer = new_buffer;
582 lexer->buffer_end = new_buffer + buffer_length * 2;
583 lexer->first_token = new_first_token;
587 /* Store the next token from the preprocessor in *TOKEN. */
590 cp_lexer_get_preprocessor_token (cp_lexer *lexer ATTRIBUTE_UNUSED ,
595 /* If this not the main lexer, return a terminating CPP_EOF token. */
596 if (lexer != NULL && !lexer->main_lexer_p)
598 token->type = CPP_EOF;
599 token->location.line = 0;
600 token->location.file = NULL;
601 token->value = NULL_TREE;
602 token->keyword = RID_MAX;
608 /* Keep going until we get a token we like. */
611 /* Get a new token from the preprocessor. */
612 token->type = c_lex_with_flags (&token->value, &token->flags);
613 /* Issue messages about tokens we cannot process. */
619 error ("invalid token");
623 /* This is a good token, so we exit the loop. */
628 /* Now we've got our token. */
629 token->location = input_location;
631 /* Check to see if this token is a keyword. */
632 if (token->type == CPP_NAME
633 && C_IS_RESERVED_WORD (token->value))
635 /* Mark this token as a keyword. */
636 token->type = CPP_KEYWORD;
637 /* Record which keyword. */
638 token->keyword = C_RID_CODE (token->value);
639 /* Update the value. Some keywords are mapped to particular
640 entities, rather than simply having the value of the
641 corresponding IDENTIFIER_NODE. For example, `__const' is
642 mapped to `const'. */
643 token->value = ridpointers[token->keyword];
646 token->keyword = RID_MAX;
649 /* Return a pointer to the next token in the token stream, but do not
653 cp_lexer_peek_token (cp_lexer* lexer)
657 /* If there are no tokens, read one now. */
658 if (!lexer->next_token)
659 cp_lexer_read_token (lexer);
661 /* Provide debugging output. */
662 if (cp_lexer_debugging_p (lexer))
664 fprintf (cp_lexer_debug_stream, "cp_lexer: peeking at token: ");
665 cp_lexer_print_token (cp_lexer_debug_stream, lexer->next_token);
666 fprintf (cp_lexer_debug_stream, "\n");
669 token = lexer->next_token;
670 cp_lexer_set_source_position_from_token (lexer, token);
674 /* Return true if the next token has the indicated TYPE. */
677 cp_lexer_next_token_is (cp_lexer* lexer, enum cpp_ttype type)
681 /* Peek at the next token. */
682 token = cp_lexer_peek_token (lexer);
683 /* Check to see if it has the indicated TYPE. */
684 return token->type == type;
687 /* Return true if the next token does not have the indicated TYPE. */
690 cp_lexer_next_token_is_not (cp_lexer* lexer, enum cpp_ttype type)
692 return !cp_lexer_next_token_is (lexer, type);
695 /* Return true if the next token is the indicated KEYWORD. */
698 cp_lexer_next_token_is_keyword (cp_lexer* lexer, enum rid keyword)
702 /* Peek at the next token. */
703 token = cp_lexer_peek_token (lexer);
704 /* Check to see if it is the indicated keyword. */
705 return token->keyword == keyword;
708 /* Return a pointer to the Nth token in the token stream. If N is 1,
709 then this is precisely equivalent to cp_lexer_peek_token. */
712 cp_lexer_peek_nth_token (cp_lexer* lexer, size_t n)
716 /* N is 1-based, not zero-based. */
717 my_friendly_assert (n > 0, 20000224);
719 /* Skip ahead from NEXT_TOKEN, reading more tokens as necessary. */
720 token = lexer->next_token;
721 /* If there are no tokens in the buffer, get one now. */
724 cp_lexer_read_token (lexer);
725 token = lexer->next_token;
728 /* Now, read tokens until we have enough. */
731 /* Advance to the next token. */
732 token = cp_lexer_next_token (lexer, token);
733 /* If that's all the tokens we have, read a new one. */
734 if (token == lexer->last_token)
735 token = cp_lexer_read_token (lexer);
741 /* Consume the next token. The pointer returned is valid only until
742 another token is read. Callers should preserve copy the token
743 explicitly if they will need its value for a longer period of
747 cp_lexer_consume_token (cp_lexer* lexer)
751 /* If there are no tokens, read one now. */
752 if (!lexer->next_token)
753 cp_lexer_read_token (lexer);
755 /* Remember the token we'll be returning. */
756 token = lexer->next_token;
758 /* Increment NEXT_TOKEN. */
759 lexer->next_token = cp_lexer_next_token (lexer,
761 /* Check to see if we're all out of tokens. */
762 if (lexer->next_token == lexer->last_token)
763 lexer->next_token = NULL;
765 /* If we're not saving tokens, then move FIRST_TOKEN too. */
766 if (!cp_lexer_saving_tokens (lexer))
768 /* If there are no tokens available, set FIRST_TOKEN to NULL. */
769 if (!lexer->next_token)
770 lexer->first_token = NULL;
772 lexer->first_token = lexer->next_token;
775 /* Provide debugging output. */
776 if (cp_lexer_debugging_p (lexer))
778 fprintf (cp_lexer_debug_stream, "cp_lexer: consuming token: ");
779 cp_lexer_print_token (cp_lexer_debug_stream, token);
780 fprintf (cp_lexer_debug_stream, "\n");
786 /* Permanently remove the next token from the token stream. There
787 must be a valid next token already; this token never reads
788 additional tokens from the preprocessor. */
791 cp_lexer_purge_token (cp_lexer *lexer)
794 cp_token *next_token;
796 token = lexer->next_token;
799 next_token = cp_lexer_next_token (lexer, token);
800 if (next_token == lexer->last_token)
802 *token = *next_token;
806 lexer->last_token = token;
807 /* The token purged may have been the only token remaining; if so,
809 if (lexer->next_token == token)
810 lexer->next_token = NULL;
813 /* Permanently remove all tokens after TOKEN, up to, but not
814 including, the token that will be returned next by
815 cp_lexer_peek_token. */
818 cp_lexer_purge_tokens_after (cp_lexer *lexer, cp_token *token)
824 if (lexer->next_token)
826 /* Copy the tokens that have not yet been read to the location
827 immediately following TOKEN. */
828 t1 = cp_lexer_next_token (lexer, token);
829 t2 = peek = cp_lexer_peek_token (lexer);
830 /* Move tokens into the vacant area between TOKEN and PEEK. */
831 while (t2 != lexer->last_token)
834 t1 = cp_lexer_next_token (lexer, t1);
835 t2 = cp_lexer_next_token (lexer, t2);
837 /* Now, the next available token is right after TOKEN. */
838 lexer->next_token = cp_lexer_next_token (lexer, token);
839 /* And the last token is wherever we ended up. */
840 lexer->last_token = t1;
844 /* There are no tokens in the buffer, so there is nothing to
845 copy. The last token in the buffer is TOKEN itself. */
846 lexer->last_token = cp_lexer_next_token (lexer, token);
850 /* Begin saving tokens. All tokens consumed after this point will be
854 cp_lexer_save_tokens (cp_lexer* lexer)
856 /* Provide debugging output. */
857 if (cp_lexer_debugging_p (lexer))
858 fprintf (cp_lexer_debug_stream, "cp_lexer: saving tokens\n");
860 /* Make sure that LEXER->NEXT_TOKEN is non-NULL so that we can
861 restore the tokens if required. */
862 if (!lexer->next_token)
863 cp_lexer_read_token (lexer);
865 VARRAY_PUSH_INT (lexer->saved_tokens,
866 cp_lexer_token_difference (lexer,
871 /* Commit to the portion of the token stream most recently saved. */
874 cp_lexer_commit_tokens (cp_lexer* lexer)
876 /* Provide debugging output. */
877 if (cp_lexer_debugging_p (lexer))
878 fprintf (cp_lexer_debug_stream, "cp_lexer: committing tokens\n");
880 VARRAY_POP (lexer->saved_tokens);
883 /* Return all tokens saved since the last call to cp_lexer_save_tokens
884 to the token stream. Stop saving tokens. */
887 cp_lexer_rollback_tokens (cp_lexer* lexer)
891 /* Provide debugging output. */
892 if (cp_lexer_debugging_p (lexer))
893 fprintf (cp_lexer_debug_stream, "cp_lexer: restoring tokens\n");
895 /* Find the token that was the NEXT_TOKEN when we started saving
897 delta = VARRAY_TOP_INT(lexer->saved_tokens);
898 /* Make it the next token again now. */
899 lexer->next_token = cp_lexer_advance_token (lexer,
902 /* It might be the case that there were no tokens when we started
903 saving tokens, but that there are some tokens now. */
904 if (!lexer->next_token && lexer->first_token)
905 lexer->next_token = lexer->first_token;
907 /* Stop saving tokens. */
908 VARRAY_POP (lexer->saved_tokens);
911 /* Print a representation of the TOKEN on the STREAM. */
914 cp_lexer_print_token (FILE * stream, cp_token* token)
916 const char *token_type = NULL;
918 /* Figure out what kind of token this is. */
926 token_type = "COMMA";
930 token_type = "OPEN_PAREN";
933 case CPP_CLOSE_PAREN:
934 token_type = "CLOSE_PAREN";
938 token_type = "OPEN_BRACE";
941 case CPP_CLOSE_BRACE:
942 token_type = "CLOSE_BRACE";
946 token_type = "SEMICOLON";
958 token_type = "keyword";
961 /* This is not a token that we know how to handle yet. */
966 /* If we have a name for the token, print it out. Otherwise, we
967 simply give the numeric code. */
969 fprintf (stream, "%s", token_type);
971 fprintf (stream, "%d", token->type);
972 /* And, for an identifier, print the identifier name. */
973 if (token->type == CPP_NAME
974 /* Some keywords have a value that is not an IDENTIFIER_NODE.
975 For example, `struct' is mapped to an INTEGER_CST. */
976 || (token->type == CPP_KEYWORD
977 && TREE_CODE (token->value) == IDENTIFIER_NODE))
978 fprintf (stream, " %s", IDENTIFIER_POINTER (token->value));
981 /* Start emitting debugging information. */
984 cp_lexer_start_debugging (cp_lexer* lexer)
986 ++lexer->debugging_p;
989 /* Stop emitting debugging information. */
992 cp_lexer_stop_debugging (cp_lexer* lexer)
994 --lexer->debugging_p;
1003 A cp_parser parses the token stream as specified by the C++
1004 grammar. Its job is purely parsing, not semantic analysis. For
1005 example, the parser breaks the token stream into declarators,
1006 expressions, statements, and other similar syntactic constructs.
1007 It does not check that the types of the expressions on either side
1008 of an assignment-statement are compatible, or that a function is
1009 not declared with a parameter of type `void'.
1011 The parser invokes routines elsewhere in the compiler to perform
1012 semantic analysis and to build up the abstract syntax tree for the
1015 The parser (and the template instantiation code, which is, in a
1016 way, a close relative of parsing) are the only parts of the
1017 compiler that should be calling push_scope and pop_scope, or
1018 related functions. The parser (and template instantiation code)
1019 keeps track of what scope is presently active; everything else
1020 should simply honor that. (The code that generates static
1021 initializers may also need to set the scope, in order to check
1022 access control correctly when emitting the initializers.)
1027 The parser is of the standard recursive-descent variety. Upcoming
1028 tokens in the token stream are examined in order to determine which
1029 production to use when parsing a non-terminal. Some C++ constructs
1030 require arbitrary look ahead to disambiguate. For example, it is
1031 impossible, in the general case, to tell whether a statement is an
1032 expression or declaration without scanning the entire statement.
1033 Therefore, the parser is capable of "parsing tentatively." When the
1034 parser is not sure what construct comes next, it enters this mode.
1035 Then, while we attempt to parse the construct, the parser queues up
1036 error messages, rather than issuing them immediately, and saves the
1037 tokens it consumes. If the construct is parsed successfully, the
1038 parser "commits", i.e., it issues any queued error messages and
1039 the tokens that were being preserved are permanently discarded.
1040 If, however, the construct is not parsed successfully, the parser
1041 rolls back its state completely so that it can resume parsing using
1042 a different alternative.
1047 The performance of the parser could probably be improved
1048 substantially. Some possible improvements include:
1050 - The expression parser recurses through the various levels of
1051 precedence as specified in the grammar, rather than using an
1052 operator-precedence technique. Therefore, parsing a simple
1053 identifier requires multiple recursive calls.
1055 - We could often eliminate the need to parse tentatively by
1056 looking ahead a little bit. In some places, this approach
1057 might not entirely eliminate the need to parse tentatively, but
1058 it might still speed up the average case. */
1060 /* Flags that are passed to some parsing functions. These values can
1061 be bitwise-ored together. */
1063 typedef enum cp_parser_flags
1066 CP_PARSER_FLAGS_NONE = 0x0,
1067 /* The construct is optional. If it is not present, then no error
1068 should be issued. */
1069 CP_PARSER_FLAGS_OPTIONAL = 0x1,
1070 /* When parsing a type-specifier, do not allow user-defined types. */
1071 CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES = 0x2
1074 /* The different kinds of declarators we want to parse. */
1076 typedef enum cp_parser_declarator_kind
1078 /* We want an abstract declarator. */
1079 CP_PARSER_DECLARATOR_ABSTRACT,
1080 /* We want a named declarator. */
1081 CP_PARSER_DECLARATOR_NAMED,
1082 /* We don't mind, but the name must be an unqualified-id. */
1083 CP_PARSER_DECLARATOR_EITHER
1084 } cp_parser_declarator_kind;
1086 /* A mapping from a token type to a corresponding tree node type. */
1088 typedef struct cp_parser_token_tree_map_node
1090 /* The token type. */
1091 ENUM_BITFIELD (cpp_ttype) token_type : 8;
1092 /* The corresponding tree code. */
1093 ENUM_BITFIELD (tree_code) tree_type : 8;
1094 } cp_parser_token_tree_map_node;
1096 /* A complete map consists of several ordinary entries, followed by a
1097 terminator. The terminating entry has a token_type of CPP_EOF. */
1099 typedef cp_parser_token_tree_map_node cp_parser_token_tree_map[];
1101 /* The status of a tentative parse. */
1103 typedef enum cp_parser_status_kind
1105 /* No errors have occurred. */
1106 CP_PARSER_STATUS_KIND_NO_ERROR,
1107 /* An error has occurred. */
1108 CP_PARSER_STATUS_KIND_ERROR,
1109 /* We are committed to this tentative parse, whether or not an error
1111 CP_PARSER_STATUS_KIND_COMMITTED
1112 } cp_parser_status_kind;
1114 /* Context that is saved and restored when parsing tentatively. */
1116 typedef struct cp_parser_context GTY (())
1118 /* If this is a tentative parsing context, the status of the
1120 enum cp_parser_status_kind status;
1121 /* If non-NULL, we have just seen a `x->' or `x.' expression. Names
1122 that are looked up in this context must be looked up both in the
1123 scope given by OBJECT_TYPE (the type of `x' or `*x') and also in
1124 the context of the containing expression. */
1126 /* The next parsing context in the stack. */
1127 struct cp_parser_context *next;
1128 } cp_parser_context;
1132 /* Constructors and destructors. */
1134 static cp_parser_context *cp_parser_context_new
1135 (cp_parser_context *);
1137 /* Class variables. */
1139 static GTY((deletable)) cp_parser_context* cp_parser_context_free_list;
1141 /* Constructors and destructors. */
1143 /* Construct a new context. The context below this one on the stack
1144 is given by NEXT. */
1146 static cp_parser_context *
1147 cp_parser_context_new (cp_parser_context* next)
1149 cp_parser_context *context;
1151 /* Allocate the storage. */
1152 if (cp_parser_context_free_list != NULL)
1154 /* Pull the first entry from the free list. */
1155 context = cp_parser_context_free_list;
1156 cp_parser_context_free_list = context->next;
1157 memset (context, 0, sizeof (*context));
1160 context = ggc_alloc_cleared (sizeof (cp_parser_context));
1161 /* No errors have occurred yet in this context. */
1162 context->status = CP_PARSER_STATUS_KIND_NO_ERROR;
1163 /* If this is not the bottomost context, copy information that we
1164 need from the previous context. */
1167 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1168 expression, then we are parsing one in this context, too. */
1169 context->object_type = next->object_type;
1170 /* Thread the stack. */
1171 context->next = next;
1177 /* The cp_parser structure represents the C++ parser. */
1179 typedef struct cp_parser GTY(())
1181 /* The lexer from which we are obtaining tokens. */
1184 /* The scope in which names should be looked up. If NULL_TREE, then
1185 we look up names in the scope that is currently open in the
1186 source program. If non-NULL, this is either a TYPE or
1187 NAMESPACE_DECL for the scope in which we should look.
1189 This value is not cleared automatically after a name is looked
1190 up, so we must be careful to clear it before starting a new look
1191 up sequence. (If it is not cleared, then `X::Y' followed by `Z'
1192 will look up `Z' in the scope of `X', rather than the current
1193 scope.) Unfortunately, it is difficult to tell when name lookup
1194 is complete, because we sometimes peek at a token, look it up,
1195 and then decide not to consume it. */
1198 /* OBJECT_SCOPE and QUALIFYING_SCOPE give the scopes in which the
1199 last lookup took place. OBJECT_SCOPE is used if an expression
1200 like "x->y" or "x.y" was used; it gives the type of "*x" or "x",
1201 respectively. QUALIFYING_SCOPE is used for an expression of the
1202 form "X::Y"; it refers to X. */
1204 tree qualifying_scope;
1206 /* A stack of parsing contexts. All but the bottom entry on the
1207 stack will be tentative contexts.
1209 We parse tentatively in order to determine which construct is in
1210 use in some situations. For example, in order to determine
1211 whether a statement is an expression-statement or a
1212 declaration-statement we parse it tentatively as a
1213 declaration-statement. If that fails, we then reparse the same
1214 token stream as an expression-statement. */
1215 cp_parser_context *context;
1217 /* True if we are parsing GNU C++. If this flag is not set, then
1218 GNU extensions are not recognized. */
1219 bool allow_gnu_extensions_p;
1221 /* TRUE if the `>' token should be interpreted as the greater-than
1222 operator. FALSE if it is the end of a template-id or
1223 template-parameter-list. */
1224 bool greater_than_is_operator_p;
1226 /* TRUE if default arguments are allowed within a parameter list
1227 that starts at this point. FALSE if only a gnu extension makes
1228 them permissible. */
1229 bool default_arg_ok_p;
1231 /* TRUE if we are parsing an integral constant-expression. See
1232 [expr.const] for a precise definition. */
1233 bool integral_constant_expression_p;
1235 /* TRUE if we are parsing an integral constant-expression -- but a
1236 non-constant expression should be permitted as well. This flag
1237 is used when parsing an array bound so that GNU variable-length
1238 arrays are tolerated. */
1239 bool allow_non_integral_constant_expression_p;
1241 /* TRUE if ALLOW_NON_CONSTANT_EXPRESSION_P is TRUE and something has
1242 been seen that makes the expression non-constant. */
1243 bool non_integral_constant_expression_p;
1245 /* TRUE if local variable names and `this' are forbidden in the
1247 bool local_variables_forbidden_p;
1249 /* TRUE if the declaration we are parsing is part of a
1250 linkage-specification of the form `extern string-literal
1252 bool in_unbraced_linkage_specification_p;
1254 /* TRUE if we are presently parsing a declarator, after the
1255 direct-declarator. */
1256 bool in_declarator_p;
1258 /* TRUE if we are presently parsing a template-argument-list. */
1259 bool in_template_argument_list_p;
1261 /* TRUE if we are presently parsing the body of an
1262 iteration-statement. */
1263 bool in_iteration_statement_p;
1265 /* TRUE if we are presently parsing the body of a switch
1267 bool in_switch_statement_p;
1269 /* TRUE if we are parsing a type-id in an expression context. In
1270 such a situation, both "type (expr)" and "type (type)" are valid
1272 bool in_type_id_in_expr_p;
1274 /* If non-NULL, then we are parsing a construct where new type
1275 definitions are not permitted. The string stored here will be
1276 issued as an error message if a type is defined. */
1277 const char *type_definition_forbidden_message;
1279 /* A list of lists. The outer list is a stack, used for member
1280 functions of local classes. At each level there are two sub-list,
1281 one on TREE_VALUE and one on TREE_PURPOSE. Each of those
1282 sub-lists has a FUNCTION_DECL or TEMPLATE_DECL on their
1283 TREE_VALUE's. The functions are chained in reverse declaration
1286 The TREE_PURPOSE sublist contains those functions with default
1287 arguments that need post processing, and the TREE_VALUE sublist
1288 contains those functions with definitions that need post
1291 These lists can only be processed once the outermost class being
1292 defined is complete. */
1293 tree unparsed_functions_queues;
1295 /* The number of classes whose definitions are currently in
1297 unsigned num_classes_being_defined;
1299 /* The number of template parameter lists that apply directly to the
1300 current declaration. */
1301 unsigned num_template_parameter_lists;
1304 /* The type of a function that parses some kind of expression. */
1305 typedef tree (*cp_parser_expression_fn) (cp_parser *);
1309 /* Constructors and destructors. */
1311 static cp_parser *cp_parser_new
1314 /* Routines to parse various constructs.
1316 Those that return `tree' will return the error_mark_node (rather
1317 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1318 Sometimes, they will return an ordinary node if error-recovery was
1319 attempted, even though a parse error occurred. So, to check
1320 whether or not a parse error occurred, you should always use
1321 cp_parser_error_occurred. If the construct is optional (indicated
1322 either by an `_opt' in the name of the function that does the
1323 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1324 the construct is not present. */
1326 /* Lexical conventions [gram.lex] */
1328 static tree cp_parser_identifier
1331 /* Basic concepts [gram.basic] */
1333 static bool cp_parser_translation_unit
1336 /* Expressions [gram.expr] */
1338 static tree cp_parser_primary_expression
1339 (cp_parser *, cp_id_kind *, tree *);
1340 static tree cp_parser_id_expression
1341 (cp_parser *, bool, bool, bool *, bool);
1342 static tree cp_parser_unqualified_id
1343 (cp_parser *, bool, bool, bool);
1344 static tree cp_parser_nested_name_specifier_opt
1345 (cp_parser *, bool, bool, bool, bool);
1346 static tree cp_parser_nested_name_specifier
1347 (cp_parser *, bool, bool, bool, bool);
1348 static tree cp_parser_class_or_namespace_name
1349 (cp_parser *, bool, bool, bool, bool, bool);
1350 static tree cp_parser_postfix_expression
1351 (cp_parser *, bool);
1352 static tree cp_parser_postfix_open_square_expression
1353 (cp_parser *, tree, bool);
1354 static tree cp_parser_postfix_dot_deref_expression
1355 (cp_parser *, enum cpp_ttype, tree, bool, cp_id_kind *);
1356 static tree cp_parser_parenthesized_expression_list
1357 (cp_parser *, bool, bool *);
1358 static void cp_parser_pseudo_destructor_name
1359 (cp_parser *, tree *, tree *);
1360 static tree cp_parser_unary_expression
1361 (cp_parser *, bool);
1362 static enum tree_code cp_parser_unary_operator
1364 static tree cp_parser_new_expression
1366 static tree cp_parser_new_placement
1368 static tree cp_parser_new_type_id
1370 static tree cp_parser_new_declarator_opt
1372 static tree cp_parser_direct_new_declarator
1374 static tree cp_parser_new_initializer
1376 static tree cp_parser_delete_expression
1378 static tree cp_parser_cast_expression
1379 (cp_parser *, bool);
1380 static tree cp_parser_pm_expression
1382 static tree cp_parser_multiplicative_expression
1384 static tree cp_parser_additive_expression
1386 static tree cp_parser_shift_expression
1388 static tree cp_parser_relational_expression
1390 static tree cp_parser_equality_expression
1392 static tree cp_parser_and_expression
1394 static tree cp_parser_exclusive_or_expression
1396 static tree cp_parser_inclusive_or_expression
1398 static tree cp_parser_logical_and_expression
1400 static tree cp_parser_logical_or_expression
1402 static tree cp_parser_question_colon_clause
1403 (cp_parser *, tree);
1404 static tree cp_parser_assignment_expression
1406 static enum tree_code cp_parser_assignment_operator_opt
1408 static tree cp_parser_expression
1410 static tree cp_parser_constant_expression
1411 (cp_parser *, bool, bool *);
1412 static tree cp_parser_builtin_offsetof
1415 /* Statements [gram.stmt.stmt] */
1417 static void cp_parser_statement
1418 (cp_parser *, bool);
1419 static tree cp_parser_labeled_statement
1420 (cp_parser *, bool);
1421 static tree cp_parser_expression_statement
1422 (cp_parser *, bool);
1423 static tree cp_parser_compound_statement
1424 (cp_parser *, bool);
1425 static void cp_parser_statement_seq_opt
1426 (cp_parser *, bool);
1427 static tree cp_parser_selection_statement
1429 static tree cp_parser_condition
1431 static tree cp_parser_iteration_statement
1433 static void cp_parser_for_init_statement
1435 static tree cp_parser_jump_statement
1437 static void cp_parser_declaration_statement
1440 static tree cp_parser_implicitly_scoped_statement
1442 static void cp_parser_already_scoped_statement
1445 /* Declarations [gram.dcl.dcl] */
1447 static void cp_parser_declaration_seq_opt
1449 static void cp_parser_declaration
1451 static void cp_parser_block_declaration
1452 (cp_parser *, bool);
1453 static void cp_parser_simple_declaration
1454 (cp_parser *, bool);
1455 static tree cp_parser_decl_specifier_seq
1456 (cp_parser *, cp_parser_flags, tree *, int *);
1457 static tree cp_parser_storage_class_specifier_opt
1459 static tree cp_parser_function_specifier_opt
1461 static tree cp_parser_type_specifier
1462 (cp_parser *, cp_parser_flags, bool, bool, int *, bool *);
1463 static tree cp_parser_simple_type_specifier
1464 (cp_parser *, cp_parser_flags, bool);
1465 static tree cp_parser_type_name
1467 static tree cp_parser_elaborated_type_specifier
1468 (cp_parser *, bool, bool);
1469 static tree cp_parser_enum_specifier
1471 static void cp_parser_enumerator_list
1472 (cp_parser *, tree);
1473 static void cp_parser_enumerator_definition
1474 (cp_parser *, tree);
1475 static tree cp_parser_namespace_name
1477 static void cp_parser_namespace_definition
1479 static void cp_parser_namespace_body
1481 static tree cp_parser_qualified_namespace_specifier
1483 static void cp_parser_namespace_alias_definition
1485 static void cp_parser_using_declaration
1487 static void cp_parser_using_directive
1489 static void cp_parser_asm_definition
1491 static void cp_parser_linkage_specification
1494 /* Declarators [gram.dcl.decl] */
1496 static tree cp_parser_init_declarator
1497 (cp_parser *, tree, tree, bool, bool, int, bool *);
1498 static tree cp_parser_declarator
1499 (cp_parser *, cp_parser_declarator_kind, int *, bool *);
1500 static tree cp_parser_direct_declarator
1501 (cp_parser *, cp_parser_declarator_kind, int *);
1502 static enum tree_code cp_parser_ptr_operator
1503 (cp_parser *, tree *, tree *);
1504 static tree cp_parser_cv_qualifier_seq_opt
1506 static tree cp_parser_cv_qualifier_opt
1508 static tree cp_parser_declarator_id
1510 static tree cp_parser_type_id
1512 static tree cp_parser_type_specifier_seq
1514 static tree cp_parser_parameter_declaration_clause
1516 static tree cp_parser_parameter_declaration_list
1518 static tree cp_parser_parameter_declaration
1519 (cp_parser *, bool, bool *);
1520 static void cp_parser_function_body
1522 static tree cp_parser_initializer
1523 (cp_parser *, bool *, bool *);
1524 static tree cp_parser_initializer_clause
1525 (cp_parser *, bool *);
1526 static tree cp_parser_initializer_list
1527 (cp_parser *, bool *);
1529 static bool cp_parser_ctor_initializer_opt_and_function_body
1532 /* Classes [gram.class] */
1534 static tree cp_parser_class_name
1535 (cp_parser *, bool, bool, bool, bool, bool, bool);
1536 static tree cp_parser_class_specifier
1538 static tree cp_parser_class_head
1539 (cp_parser *, bool *, tree *);
1540 static enum tag_types cp_parser_class_key
1542 static void cp_parser_member_specification_opt
1544 static void cp_parser_member_declaration
1546 static tree cp_parser_pure_specifier
1548 static tree cp_parser_constant_initializer
1551 /* Derived classes [gram.class.derived] */
1553 static tree cp_parser_base_clause
1555 static tree cp_parser_base_specifier
1558 /* Special member functions [gram.special] */
1560 static tree cp_parser_conversion_function_id
1562 static tree cp_parser_conversion_type_id
1564 static tree cp_parser_conversion_declarator_opt
1566 static bool cp_parser_ctor_initializer_opt
1568 static void cp_parser_mem_initializer_list
1570 static tree cp_parser_mem_initializer
1572 static tree cp_parser_mem_initializer_id
1575 /* Overloading [gram.over] */
1577 static tree cp_parser_operator_function_id
1579 static tree cp_parser_operator
1582 /* Templates [gram.temp] */
1584 static void cp_parser_template_declaration
1585 (cp_parser *, bool);
1586 static tree cp_parser_template_parameter_list
1588 static tree cp_parser_template_parameter
1590 static tree cp_parser_type_parameter
1592 static tree cp_parser_template_id
1593 (cp_parser *, bool, bool, bool);
1594 static tree cp_parser_template_name
1595 (cp_parser *, bool, bool, bool, bool *);
1596 static tree cp_parser_template_argument_list
1598 static tree cp_parser_template_argument
1600 static void cp_parser_explicit_instantiation
1602 static void cp_parser_explicit_specialization
1605 /* Exception handling [gram.exception] */
1607 static tree cp_parser_try_block
1609 static bool cp_parser_function_try_block
1611 static void cp_parser_handler_seq
1613 static void cp_parser_handler
1615 static tree cp_parser_exception_declaration
1617 static tree cp_parser_throw_expression
1619 static tree cp_parser_exception_specification_opt
1621 static tree cp_parser_type_id_list
1624 /* GNU Extensions */
1626 static tree cp_parser_asm_specification_opt
1628 static tree cp_parser_asm_operand_list
1630 static tree cp_parser_asm_clobber_list
1632 static tree cp_parser_attributes_opt
1634 static tree cp_parser_attribute_list
1636 static bool cp_parser_extension_opt
1637 (cp_parser *, int *);
1638 static void cp_parser_label_declaration
1641 /* Utility Routines */
1643 static tree cp_parser_lookup_name
1644 (cp_parser *, tree, bool, bool, bool, bool);
1645 static tree cp_parser_lookup_name_simple
1646 (cp_parser *, tree);
1647 static tree cp_parser_maybe_treat_template_as_class
1649 static bool cp_parser_check_declarator_template_parameters
1650 (cp_parser *, tree);
1651 static bool cp_parser_check_template_parameters
1652 (cp_parser *, unsigned);
1653 static tree cp_parser_simple_cast_expression
1655 static tree cp_parser_binary_expression
1656 (cp_parser *, const cp_parser_token_tree_map, cp_parser_expression_fn);
1657 static tree cp_parser_global_scope_opt
1658 (cp_parser *, bool);
1659 static bool cp_parser_constructor_declarator_p
1660 (cp_parser *, bool);
1661 static tree cp_parser_function_definition_from_specifiers_and_declarator
1662 (cp_parser *, tree, tree, tree);
1663 static tree cp_parser_function_definition_after_declarator
1664 (cp_parser *, bool);
1665 static void cp_parser_template_declaration_after_export
1666 (cp_parser *, bool);
1667 static tree cp_parser_single_declaration
1668 (cp_parser *, bool, bool *);
1669 static tree cp_parser_functional_cast
1670 (cp_parser *, tree);
1671 static tree cp_parser_save_member_function_body
1672 (cp_parser *, tree, tree, tree);
1673 static tree cp_parser_enclosed_template_argument_list
1675 static void cp_parser_save_default_args
1676 (cp_parser *, tree);
1677 static void cp_parser_late_parsing_for_member
1678 (cp_parser *, tree);
1679 static void cp_parser_late_parsing_default_args
1680 (cp_parser *, tree);
1681 static tree cp_parser_sizeof_operand
1682 (cp_parser *, enum rid);
1683 static bool cp_parser_declares_only_class_p
1685 static bool cp_parser_friend_p
1687 static cp_token *cp_parser_require
1688 (cp_parser *, enum cpp_ttype, const char *);
1689 static cp_token *cp_parser_require_keyword
1690 (cp_parser *, enum rid, const char *);
1691 static bool cp_parser_token_starts_function_definition_p
1693 static bool cp_parser_next_token_starts_class_definition_p
1695 static bool cp_parser_next_token_ends_template_argument_p
1697 static bool cp_parser_nth_token_starts_template_argument_list_p
1698 (cp_parser *, size_t);
1699 static enum tag_types cp_parser_token_is_class_key
1701 static void cp_parser_check_class_key
1702 (enum tag_types, tree type);
1703 static void cp_parser_check_access_in_redeclaration
1705 static bool cp_parser_optional_template_keyword
1707 static void cp_parser_pre_parsed_nested_name_specifier
1709 static void cp_parser_cache_group
1710 (cp_parser *, cp_token_cache *, enum cpp_ttype, unsigned);
1711 static void cp_parser_parse_tentatively
1713 static void cp_parser_commit_to_tentative_parse
1715 static void cp_parser_abort_tentative_parse
1717 static bool cp_parser_parse_definitely
1719 static inline bool cp_parser_parsing_tentatively
1721 static bool cp_parser_committed_to_tentative_parse
1723 static void cp_parser_error
1724 (cp_parser *, const char *);
1725 static void cp_parser_name_lookup_error
1726 (cp_parser *, tree, tree, const char *);
1727 static bool cp_parser_simulate_error
1729 static void cp_parser_check_type_definition
1731 static void cp_parser_check_for_definition_in_return_type
1733 static void cp_parser_check_for_invalid_template_id
1734 (cp_parser *, tree);
1735 static bool cp_parser_non_integral_constant_expression
1736 (cp_parser *, const char *);
1737 static void cp_parser_diagnose_invalid_type_name
1738 (cp_parser *, tree, tree);
1739 static bool cp_parser_parse_and_diagnose_invalid_type_name
1741 static int cp_parser_skip_to_closing_parenthesis
1742 (cp_parser *, bool, bool, bool);
1743 static void cp_parser_skip_to_end_of_statement
1745 static void cp_parser_consume_semicolon_at_end_of_statement
1747 static void cp_parser_skip_to_end_of_block_or_statement
1749 static void cp_parser_skip_to_closing_brace
1751 static void cp_parser_skip_until_found
1752 (cp_parser *, enum cpp_ttype, const char *);
1753 static bool cp_parser_error_occurred
1755 static bool cp_parser_allow_gnu_extensions_p
1757 static bool cp_parser_is_string_literal
1759 static bool cp_parser_is_keyword
1760 (cp_token *, enum rid);
1761 static tree cp_parser_make_typename_type
1762 (cp_parser *, tree, tree);
1764 /* Returns nonzero if we are parsing tentatively. */
1767 cp_parser_parsing_tentatively (cp_parser* parser)
1769 return parser->context->next != NULL;
1772 /* Returns nonzero if TOKEN is a string literal. */
1775 cp_parser_is_string_literal (cp_token* token)
1777 return (token->type == CPP_STRING || token->type == CPP_WSTRING);
1780 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
1783 cp_parser_is_keyword (cp_token* token, enum rid keyword)
1785 return token->keyword == keyword;
1788 /* Issue the indicated error MESSAGE. */
1791 cp_parser_error (cp_parser* parser, const char* message)
1793 /* Output the MESSAGE -- unless we're parsing tentatively. */
1794 if (!cp_parser_simulate_error (parser))
1797 token = cp_lexer_peek_token (parser->lexer);
1798 c_parse_error (message,
1799 /* Because c_parser_error does not understand
1800 CPP_KEYWORD, keywords are treated like
1802 (token->type == CPP_KEYWORD ? CPP_NAME : token->type),
1807 /* Issue an error about name-lookup failing. NAME is the
1808 IDENTIFIER_NODE DECL is the result of
1809 the lookup (as returned from cp_parser_lookup_name). DESIRED is
1810 the thing that we hoped to find. */
1813 cp_parser_name_lookup_error (cp_parser* parser,
1816 const char* desired)
1818 /* If name lookup completely failed, tell the user that NAME was not
1820 if (decl == error_mark_node)
1822 if (parser->scope && parser->scope != global_namespace)
1823 error ("`%D::%D' has not been declared",
1824 parser->scope, name);
1825 else if (parser->scope == global_namespace)
1826 error ("`::%D' has not been declared", name);
1828 error ("`%D' has not been declared", name);
1830 else if (parser->scope && parser->scope != global_namespace)
1831 error ("`%D::%D' %s", parser->scope, name, desired);
1832 else if (parser->scope == global_namespace)
1833 error ("`::%D' %s", name, desired);
1835 error ("`%D' %s", name, desired);
1838 /* If we are parsing tentatively, remember that an error has occurred
1839 during this tentative parse. Returns true if the error was
1840 simulated; false if a message should be issued by the caller. */
1843 cp_parser_simulate_error (cp_parser* parser)
1845 if (cp_parser_parsing_tentatively (parser)
1846 && !cp_parser_committed_to_tentative_parse (parser))
1848 parser->context->status = CP_PARSER_STATUS_KIND_ERROR;
1854 /* This function is called when a type is defined. If type
1855 definitions are forbidden at this point, an error message is
1859 cp_parser_check_type_definition (cp_parser* parser)
1861 /* If types are forbidden here, issue a message. */
1862 if (parser->type_definition_forbidden_message)
1863 /* Use `%s' to print the string in case there are any escape
1864 characters in the message. */
1865 error ("%s", parser->type_definition_forbidden_message);
1868 /* This function is called when a declaration is parsed. If
1869 DECLARATOR is a function declarator and DECLARES_CLASS_OR_ENUM
1870 indicates that a type was defined in the decl-specifiers for DECL,
1871 then an error is issued. */
1874 cp_parser_check_for_definition_in_return_type (tree declarator,
1875 int declares_class_or_enum)
1877 /* [dcl.fct] forbids type definitions in return types.
1878 Unfortunately, it's not easy to know whether or not we are
1879 processing a return type until after the fact. */
1881 && (TREE_CODE (declarator) == INDIRECT_REF
1882 || TREE_CODE (declarator) == ADDR_EXPR))
1883 declarator = TREE_OPERAND (declarator, 0);
1885 && TREE_CODE (declarator) == CALL_EXPR
1886 && declares_class_or_enum & 2)
1887 error ("new types may not be defined in a return type");
1890 /* A type-specifier (TYPE) has been parsed which cannot be followed by
1891 "<" in any valid C++ program. If the next token is indeed "<",
1892 issue a message warning the user about what appears to be an
1893 invalid attempt to form a template-id. */
1896 cp_parser_check_for_invalid_template_id (cp_parser* parser,
1902 if (cp_lexer_next_token_is (parser->lexer, CPP_LESS))
1905 error ("`%T' is not a template", type);
1906 else if (TREE_CODE (type) == IDENTIFIER_NODE)
1907 error ("`%E' is not a template", type);
1909 error ("invalid template-id");
1910 /* Remember the location of the invalid "<". */
1911 if (cp_parser_parsing_tentatively (parser)
1912 && !cp_parser_committed_to_tentative_parse (parser))
1914 token = cp_lexer_peek_token (parser->lexer);
1915 token = cp_lexer_prev_token (parser->lexer, token);
1916 start = cp_lexer_token_difference (parser->lexer,
1917 parser->lexer->first_token,
1922 /* Consume the "<". */
1923 cp_lexer_consume_token (parser->lexer);
1924 /* Parse the template arguments. */
1925 cp_parser_enclosed_template_argument_list (parser);
1926 /* Permanently remove the invalid template arguments so that
1927 this error message is not issued again. */
1930 token = cp_lexer_advance_token (parser->lexer,
1931 parser->lexer->first_token,
1933 cp_lexer_purge_tokens_after (parser->lexer, token);
1938 /* If parsing an integral constant-expression, issue an error message
1939 about the fact that THING appeared and return true. Otherwise,
1940 return false, marking the current expression as non-constant. */
1943 cp_parser_non_integral_constant_expression (cp_parser *parser,
1946 if (parser->integral_constant_expression_p)
1948 if (!parser->allow_non_integral_constant_expression_p)
1950 error ("%s cannot appear in a constant-expression", thing);
1953 parser->non_integral_constant_expression_p = true;
1958 /* Emit a diagnostic for an invalid type name. Consider also if it is
1959 qualified or not and the result of a lookup, to provide a better
1963 cp_parser_diagnose_invalid_type_name (cp_parser *parser, tree scope, tree id)
1965 tree decl, old_scope;
1966 /* Try to lookup the identifier. */
1967 old_scope = parser->scope;
1968 parser->scope = scope;
1969 decl = cp_parser_lookup_name_simple (parser, id);
1970 parser->scope = old_scope;
1971 /* If the lookup found a template-name, it means that the user forgot
1972 to specify an argument list. Emit an useful error message. */
1973 if (TREE_CODE (decl) == TEMPLATE_DECL)
1974 error ("invalid use of template-name `%E' without an argument list",
1976 else if (!parser->scope)
1978 /* Issue an error message. */
1979 error ("`%E' does not name a type", id);
1980 /* If we're in a template class, it's possible that the user was
1981 referring to a type from a base class. For example:
1983 template <typename T> struct A { typedef T X; };
1984 template <typename T> struct B : public A<T> { X x; };
1986 The user should have said "typename A<T>::X". */
1987 if (processing_template_decl && current_class_type)
1991 for (b = TREE_CHAIN (TYPE_BINFO (current_class_type));
1995 tree base_type = BINFO_TYPE (b);
1996 if (CLASS_TYPE_P (base_type)
1997 && dependent_type_p (base_type))
2000 /* Go from a particular instantiation of the
2001 template (which will have an empty TYPE_FIELDs),
2002 to the main version. */
2003 base_type = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (base_type);
2004 for (field = TYPE_FIELDS (base_type);
2006 field = TREE_CHAIN (field))
2007 if (TREE_CODE (field) == TYPE_DECL
2008 && DECL_NAME (field) == id)
2010 inform ("(perhaps `typename %T::%E' was intended)",
2011 BINFO_TYPE (b), id);
2020 /* Here we diagnose qualified-ids where the scope is actually correct,
2021 but the identifier does not resolve to a valid type name. */
2024 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
2025 error ("`%E' in namespace `%E' does not name a type",
2027 else if (TYPE_P (parser->scope))
2028 error ("`%E' in class `%T' does not name a type",
2035 /* Check for a common situation where a type-name should be present,
2036 but is not, and issue a sensible error message. Returns true if an
2037 invalid type-name was detected.
2039 The situation handled by this function are variable declarations of the
2040 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2041 Usually, `ID' should name a type, but if we got here it means that it
2042 does not. We try to emit the best possible error message depending on
2043 how exactly the id-expression looks like.
2047 cp_parser_parse_and_diagnose_invalid_type_name (cp_parser *parser)
2051 cp_parser_parse_tentatively (parser);
2052 id = cp_parser_id_expression (parser,
2053 /*template_keyword_p=*/false,
2054 /*check_dependency_p=*/true,
2055 /*template_p=*/NULL,
2056 /*declarator_p=*/true);
2057 /* After the id-expression, there should be a plain identifier,
2058 otherwise this is not a simple variable declaration. Also, if
2059 the scope is dependent, we cannot do much. */
2060 if (!cp_lexer_next_token_is (parser->lexer, CPP_NAME)
2061 || (parser->scope && TYPE_P (parser->scope)
2062 && dependent_type_p (parser->scope)))
2064 cp_parser_abort_tentative_parse (parser);
2067 if (!cp_parser_parse_definitely (parser))
2070 /* If we got here, this cannot be a valid variable declaration, thus
2071 the cp_parser_id_expression must have resolved to a plain identifier
2072 node (not a TYPE_DECL or TEMPLATE_ID_EXPR). */
2073 my_friendly_assert (TREE_CODE (id) == IDENTIFIER_NODE, 20030203);
2074 /* Emit a diagnostic for the invalid type. */
2075 cp_parser_diagnose_invalid_type_name (parser, parser->scope, id);
2076 /* Skip to the end of the declaration; there's no point in
2077 trying to process it. */
2078 cp_parser_skip_to_end_of_block_or_statement (parser);
2082 /* Consume tokens up to, and including, the next non-nested closing `)'.
2083 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2084 are doing error recovery. Returns -1 if OR_COMMA is true and we
2085 found an unnested comma. */
2088 cp_parser_skip_to_closing_parenthesis (cp_parser *parser,
2093 unsigned paren_depth = 0;
2094 unsigned brace_depth = 0;
2095 int saved_c_lex_string_translate = c_lex_string_translate;
2098 if (recovering && !or_comma && cp_parser_parsing_tentatively (parser)
2099 && !cp_parser_committed_to_tentative_parse (parser))
2103 /* If we're looking ahead, keep both translated and untranslated
2105 c_lex_string_translate = -1;
2111 /* If we've run out of tokens, then there is no closing `)'. */
2112 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
2118 token = cp_lexer_peek_token (parser->lexer);
2120 /* This matches the processing in skip_to_end_of_statement. */
2121 if (token->type == CPP_SEMICOLON && !brace_depth)
2126 if (token->type == CPP_OPEN_BRACE)
2128 if (token->type == CPP_CLOSE_BRACE)
2136 if (recovering && or_comma && token->type == CPP_COMMA
2137 && !brace_depth && !paren_depth)
2145 /* If it is an `(', we have entered another level of nesting. */
2146 if (token->type == CPP_OPEN_PAREN)
2148 /* If it is a `)', then we might be done. */
2149 else if (token->type == CPP_CLOSE_PAREN && !paren_depth--)
2152 cp_lexer_consume_token (parser->lexer);
2160 /* Consume the token. */
2161 cp_lexer_consume_token (parser->lexer);
2164 c_lex_string_translate = saved_c_lex_string_translate;
2168 /* Consume tokens until we reach the end of the current statement.
2169 Normally, that will be just before consuming a `;'. However, if a
2170 non-nested `}' comes first, then we stop before consuming that. */
2173 cp_parser_skip_to_end_of_statement (cp_parser* parser)
2175 unsigned nesting_depth = 0;
2181 /* Peek at the next token. */
2182 token = cp_lexer_peek_token (parser->lexer);
2183 /* If we've run out of tokens, stop. */
2184 if (token->type == CPP_EOF)
2186 /* If the next token is a `;', we have reached the end of the
2188 if (token->type == CPP_SEMICOLON && !nesting_depth)
2190 /* If the next token is a non-nested `}', then we have reached
2191 the end of the current block. */
2192 if (token->type == CPP_CLOSE_BRACE)
2194 /* If this is a non-nested `}', stop before consuming it.
2195 That way, when confronted with something like:
2199 we stop before consuming the closing `}', even though we
2200 have not yet reached a `;'. */
2201 if (nesting_depth == 0)
2203 /* If it is the closing `}' for a block that we have
2204 scanned, stop -- but only after consuming the token.
2210 we will stop after the body of the erroneously declared
2211 function, but before consuming the following `typedef'
2213 if (--nesting_depth == 0)
2215 cp_lexer_consume_token (parser->lexer);
2219 /* If it the next token is a `{', then we are entering a new
2220 block. Consume the entire block. */
2221 else if (token->type == CPP_OPEN_BRACE)
2223 /* Consume the token. */
2224 cp_lexer_consume_token (parser->lexer);
2228 /* This function is called at the end of a statement or declaration.
2229 If the next token is a semicolon, it is consumed; otherwise, error
2230 recovery is attempted. */
2233 cp_parser_consume_semicolon_at_end_of_statement (cp_parser *parser)
2235 /* Look for the trailing `;'. */
2236 if (!cp_parser_require (parser, CPP_SEMICOLON, "`;'"))
2238 /* If there is additional (erroneous) input, skip to the end of
2240 cp_parser_skip_to_end_of_statement (parser);
2241 /* If the next token is now a `;', consume it. */
2242 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
2243 cp_lexer_consume_token (parser->lexer);
2247 /* Skip tokens until we have consumed an entire block, or until we
2248 have consumed a non-nested `;'. */
2251 cp_parser_skip_to_end_of_block_or_statement (cp_parser* parser)
2253 unsigned nesting_depth = 0;
2259 /* Peek at the next token. */
2260 token = cp_lexer_peek_token (parser->lexer);
2261 /* If we've run out of tokens, stop. */
2262 if (token->type == CPP_EOF)
2264 /* If the next token is a `;', we have reached the end of the
2266 if (token->type == CPP_SEMICOLON && !nesting_depth)
2268 /* Consume the `;'. */
2269 cp_lexer_consume_token (parser->lexer);
2272 /* Consume the token. */
2273 token = cp_lexer_consume_token (parser->lexer);
2274 /* If the next token is a non-nested `}', then we have reached
2275 the end of the current block. */
2276 if (token->type == CPP_CLOSE_BRACE
2277 && (nesting_depth == 0 || --nesting_depth == 0))
2279 /* If it the next token is a `{', then we are entering a new
2280 block. Consume the entire block. */
2281 if (token->type == CPP_OPEN_BRACE)
2286 /* Skip tokens until a non-nested closing curly brace is the next
2290 cp_parser_skip_to_closing_brace (cp_parser *parser)
2292 unsigned nesting_depth = 0;
2298 /* Peek at the next token. */
2299 token = cp_lexer_peek_token (parser->lexer);
2300 /* If we've run out of tokens, stop. */
2301 if (token->type == CPP_EOF)
2303 /* If the next token is a non-nested `}', then we have reached
2304 the end of the current block. */
2305 if (token->type == CPP_CLOSE_BRACE && nesting_depth-- == 0)
2307 /* If it the next token is a `{', then we are entering a new
2308 block. Consume the entire block. */
2309 else if (token->type == CPP_OPEN_BRACE)
2311 /* Consume the token. */
2312 cp_lexer_consume_token (parser->lexer);
2316 /* This is a simple wrapper around make_typename_type. When the id is
2317 an unresolved identifier node, we can provide a superior diagnostic
2318 using cp_parser_diagnose_invalid_type_name. */
2321 cp_parser_make_typename_type (cp_parser *parser, tree scope, tree id)
2324 if (TREE_CODE (id) == IDENTIFIER_NODE)
2326 result = make_typename_type (scope, id, /*complain=*/0);
2327 if (result == error_mark_node)
2328 cp_parser_diagnose_invalid_type_name (parser, scope, id);
2331 return make_typename_type (scope, id, tf_error);
2335 /* Create a new C++ parser. */
2338 cp_parser_new (void)
2343 /* cp_lexer_new_main is called before calling ggc_alloc because
2344 cp_lexer_new_main might load a PCH file. */
2345 lexer = cp_lexer_new_main ();
2347 parser = ggc_alloc_cleared (sizeof (cp_parser));
2348 parser->lexer = lexer;
2349 parser->context = cp_parser_context_new (NULL);
2351 /* For now, we always accept GNU extensions. */
2352 parser->allow_gnu_extensions_p = 1;
2354 /* The `>' token is a greater-than operator, not the end of a
2356 parser->greater_than_is_operator_p = true;
2358 parser->default_arg_ok_p = true;
2360 /* We are not parsing a constant-expression. */
2361 parser->integral_constant_expression_p = false;
2362 parser->allow_non_integral_constant_expression_p = false;
2363 parser->non_integral_constant_expression_p = false;
2365 /* Local variable names are not forbidden. */
2366 parser->local_variables_forbidden_p = false;
2368 /* We are not processing an `extern "C"' declaration. */
2369 parser->in_unbraced_linkage_specification_p = false;
2371 /* We are not processing a declarator. */
2372 parser->in_declarator_p = false;
2374 /* We are not processing a template-argument-list. */
2375 parser->in_template_argument_list_p = false;
2377 /* We are not in an iteration statement. */
2378 parser->in_iteration_statement_p = false;
2380 /* We are not in a switch statement. */
2381 parser->in_switch_statement_p = false;
2383 /* We are not parsing a type-id inside an expression. */
2384 parser->in_type_id_in_expr_p = false;
2386 /* The unparsed function queue is empty. */
2387 parser->unparsed_functions_queues = build_tree_list (NULL_TREE, NULL_TREE);
2389 /* There are no classes being defined. */
2390 parser->num_classes_being_defined = 0;
2392 /* No template parameters apply. */
2393 parser->num_template_parameter_lists = 0;
2398 /* Lexical conventions [gram.lex] */
2400 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
2404 cp_parser_identifier (cp_parser* parser)
2408 /* Look for the identifier. */
2409 token = cp_parser_require (parser, CPP_NAME, "identifier");
2410 /* Return the value. */
2411 return token ? token->value : error_mark_node;
2414 /* Basic concepts [gram.basic] */
2416 /* Parse a translation-unit.
2419 declaration-seq [opt]
2421 Returns TRUE if all went well. */
2424 cp_parser_translation_unit (cp_parser* parser)
2428 cp_parser_declaration_seq_opt (parser);
2430 /* If there are no tokens left then all went well. */
2431 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
2434 /* Otherwise, issue an error message. */
2435 cp_parser_error (parser, "expected declaration");
2439 /* Consume the EOF token. */
2440 cp_parser_require (parser, CPP_EOF, "end-of-file");
2443 finish_translation_unit ();
2445 /* All went well. */
2449 /* Expressions [gram.expr] */
2451 /* Parse a primary-expression.
2462 ( compound-statement )
2463 __builtin_va_arg ( assignment-expression , type-id )
2468 Returns a representation of the expression.
2470 *IDK indicates what kind of id-expression (if any) was present.
2472 *QUALIFYING_CLASS is set to a non-NULL value if the id-expression can be
2473 used as the operand of a pointer-to-member. In that case,
2474 *QUALIFYING_CLASS gives the class that is used as the qualifying
2475 class in the pointer-to-member. */
2478 cp_parser_primary_expression (cp_parser *parser,
2480 tree *qualifying_class)
2484 /* Assume the primary expression is not an id-expression. */
2485 *idk = CP_ID_KIND_NONE;
2486 /* And that it cannot be used as pointer-to-member. */
2487 *qualifying_class = NULL_TREE;
2489 /* Peek at the next token. */
2490 token = cp_lexer_peek_token (parser->lexer);
2491 switch (token->type)
2502 token = cp_lexer_consume_token (parser->lexer);
2503 return token->value;
2507 token = cp_lexer_consume_token (parser->lexer);
2508 if (TREE_CHAIN (token->value))
2509 return TREE_CHAIN (token->value);
2511 return token->value;
2513 case CPP_OPEN_PAREN:
2516 bool saved_greater_than_is_operator_p;
2518 /* Consume the `('. */
2519 cp_lexer_consume_token (parser->lexer);
2520 /* Within a parenthesized expression, a `>' token is always
2521 the greater-than operator. */
2522 saved_greater_than_is_operator_p
2523 = parser->greater_than_is_operator_p;
2524 parser->greater_than_is_operator_p = true;
2525 /* If we see `( { ' then we are looking at the beginning of
2526 a GNU statement-expression. */
2527 if (cp_parser_allow_gnu_extensions_p (parser)
2528 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
2530 /* Statement-expressions are not allowed by the standard. */
2532 pedwarn ("ISO C++ forbids braced-groups within expressions");
2534 /* And they're not allowed outside of a function-body; you
2535 cannot, for example, write:
2537 int i = ({ int j = 3; j + 1; });
2539 at class or namespace scope. */
2540 if (!at_function_scope_p ())
2541 error ("statement-expressions are allowed only inside functions");
2542 /* Start the statement-expression. */
2543 expr = begin_stmt_expr ();
2544 /* Parse the compound-statement. */
2545 cp_parser_compound_statement (parser, true);
2547 expr = finish_stmt_expr (expr, false);
2551 /* Parse the parenthesized expression. */
2552 expr = cp_parser_expression (parser);
2553 /* Let the front end know that this expression was
2554 enclosed in parentheses. This matters in case, for
2555 example, the expression is of the form `A::B', since
2556 `&A::B' might be a pointer-to-member, but `&(A::B)' is
2558 finish_parenthesized_expr (expr);
2560 /* The `>' token might be the end of a template-id or
2561 template-parameter-list now. */
2562 parser->greater_than_is_operator_p
2563 = saved_greater_than_is_operator_p;
2564 /* Consume the `)'. */
2565 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
2566 cp_parser_skip_to_end_of_statement (parser);
2572 switch (token->keyword)
2574 /* These two are the boolean literals. */
2576 cp_lexer_consume_token (parser->lexer);
2577 return boolean_true_node;
2579 cp_lexer_consume_token (parser->lexer);
2580 return boolean_false_node;
2582 /* The `__null' literal. */
2584 cp_lexer_consume_token (parser->lexer);
2587 /* Recognize the `this' keyword. */
2589 cp_lexer_consume_token (parser->lexer);
2590 if (parser->local_variables_forbidden_p)
2592 error ("`this' may not be used in this context");
2593 return error_mark_node;
2595 /* Pointers cannot appear in constant-expressions. */
2596 if (cp_parser_non_integral_constant_expression (parser,
2598 return error_mark_node;
2599 return finish_this_expr ();
2601 /* The `operator' keyword can be the beginning of an
2606 case RID_FUNCTION_NAME:
2607 case RID_PRETTY_FUNCTION_NAME:
2608 case RID_C99_FUNCTION_NAME:
2609 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
2610 __func__ are the names of variables -- but they are
2611 treated specially. Therefore, they are handled here,
2612 rather than relying on the generic id-expression logic
2613 below. Grammatically, these names are id-expressions.
2615 Consume the token. */
2616 token = cp_lexer_consume_token (parser->lexer);
2617 /* Look up the name. */
2618 return finish_fname (token->value);
2625 /* The `__builtin_va_arg' construct is used to handle
2626 `va_arg'. Consume the `__builtin_va_arg' token. */
2627 cp_lexer_consume_token (parser->lexer);
2628 /* Look for the opening `('. */
2629 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
2630 /* Now, parse the assignment-expression. */
2631 expression = cp_parser_assignment_expression (parser);
2632 /* Look for the `,'. */
2633 cp_parser_require (parser, CPP_COMMA, "`,'");
2634 /* Parse the type-id. */
2635 type = cp_parser_type_id (parser);
2636 /* Look for the closing `)'. */
2637 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
2638 /* Using `va_arg' in a constant-expression is not
2640 if (cp_parser_non_integral_constant_expression (parser,
2642 return error_mark_node;
2643 return build_x_va_arg (expression, type);
2647 return cp_parser_builtin_offsetof (parser);
2650 cp_parser_error (parser, "expected primary-expression");
2651 return error_mark_node;
2654 /* An id-expression can start with either an identifier, a
2655 `::' as the beginning of a qualified-id, or the "operator"
2659 case CPP_TEMPLATE_ID:
2660 case CPP_NESTED_NAME_SPECIFIER:
2664 const char *error_msg;
2667 /* Parse the id-expression. */
2669 = cp_parser_id_expression (parser,
2670 /*template_keyword_p=*/false,
2671 /*check_dependency_p=*/true,
2672 /*template_p=*/NULL,
2673 /*declarator_p=*/false);
2674 if (id_expression == error_mark_node)
2675 return error_mark_node;
2676 /* If we have a template-id, then no further lookup is
2677 required. If the template-id was for a template-class, we
2678 will sometimes have a TYPE_DECL at this point. */
2679 else if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR
2680 || TREE_CODE (id_expression) == TYPE_DECL)
2681 decl = id_expression;
2682 /* Look up the name. */
2685 decl = cp_parser_lookup_name_simple (parser, id_expression);
2686 /* If name lookup gives us a SCOPE_REF, then the
2687 qualifying scope was dependent. Just propagate the
2689 if (TREE_CODE (decl) == SCOPE_REF)
2691 if (TYPE_P (TREE_OPERAND (decl, 0)))
2692 *qualifying_class = TREE_OPERAND (decl, 0);
2695 /* Check to see if DECL is a local variable in a context
2696 where that is forbidden. */
2697 if (parser->local_variables_forbidden_p
2698 && local_variable_p (decl))
2700 /* It might be that we only found DECL because we are
2701 trying to be generous with pre-ISO scoping rules.
2702 For example, consider:
2706 for (int i = 0; i < 10; ++i) {}
2707 extern void f(int j = i);
2710 Here, name look up will originally find the out
2711 of scope `i'. We need to issue a warning message,
2712 but then use the global `i'. */
2713 decl = check_for_out_of_scope_variable (decl);
2714 if (local_variable_p (decl))
2716 error ("local variable `%D' may not appear in this context",
2718 return error_mark_node;
2723 decl = finish_id_expression (id_expression, decl, parser->scope,
2724 idk, qualifying_class,
2725 parser->integral_constant_expression_p,
2726 parser->allow_non_integral_constant_expression_p,
2727 &parser->non_integral_constant_expression_p,
2730 cp_parser_error (parser, error_msg);
2734 /* Anything else is an error. */
2736 cp_parser_error (parser, "expected primary-expression");
2737 return error_mark_node;
2741 /* Parse an id-expression.
2748 :: [opt] nested-name-specifier template [opt] unqualified-id
2750 :: operator-function-id
2753 Return a representation of the unqualified portion of the
2754 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
2755 a `::' or nested-name-specifier.
2757 Often, if the id-expression was a qualified-id, the caller will
2758 want to make a SCOPE_REF to represent the qualified-id. This
2759 function does not do this in order to avoid wastefully creating
2760 SCOPE_REFs when they are not required.
2762 If TEMPLATE_KEYWORD_P is true, then we have just seen the
2765 If CHECK_DEPENDENCY_P is false, then names are looked up inside
2766 uninstantiated templates.
2768 If *TEMPLATE_P is non-NULL, it is set to true iff the
2769 `template' keyword is used to explicitly indicate that the entity
2770 named is a template.
2772 If DECLARATOR_P is true, the id-expression is appearing as part of
2773 a declarator, rather than as part of an expression. */
2776 cp_parser_id_expression (cp_parser *parser,
2777 bool template_keyword_p,
2778 bool check_dependency_p,
2782 bool global_scope_p;
2783 bool nested_name_specifier_p;
2785 /* Assume the `template' keyword was not used. */
2787 *template_p = false;
2789 /* Look for the optional `::' operator. */
2791 = (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false)
2793 /* Look for the optional nested-name-specifier. */
2794 nested_name_specifier_p
2795 = (cp_parser_nested_name_specifier_opt (parser,
2796 /*typename_keyword_p=*/false,
2799 /*is_declarator=*/false)
2801 /* If there is a nested-name-specifier, then we are looking at
2802 the first qualified-id production. */
2803 if (nested_name_specifier_p)
2806 tree saved_object_scope;
2807 tree saved_qualifying_scope;
2808 tree unqualified_id;
2811 /* See if the next token is the `template' keyword. */
2813 template_p = &is_template;
2814 *template_p = cp_parser_optional_template_keyword (parser);
2815 /* Name lookup we do during the processing of the
2816 unqualified-id might obliterate SCOPE. */
2817 saved_scope = parser->scope;
2818 saved_object_scope = parser->object_scope;
2819 saved_qualifying_scope = parser->qualifying_scope;
2820 /* Process the final unqualified-id. */
2821 unqualified_id = cp_parser_unqualified_id (parser, *template_p,
2824 /* Restore the SAVED_SCOPE for our caller. */
2825 parser->scope = saved_scope;
2826 parser->object_scope = saved_object_scope;
2827 parser->qualifying_scope = saved_qualifying_scope;
2829 return unqualified_id;
2831 /* Otherwise, if we are in global scope, then we are looking at one
2832 of the other qualified-id productions. */
2833 else if (global_scope_p)
2838 /* Peek at the next token. */
2839 token = cp_lexer_peek_token (parser->lexer);
2841 /* If it's an identifier, and the next token is not a "<", then
2842 we can avoid the template-id case. This is an optimization
2843 for this common case. */
2844 if (token->type == CPP_NAME
2845 && !cp_parser_nth_token_starts_template_argument_list_p
2847 return cp_parser_identifier (parser);
2849 cp_parser_parse_tentatively (parser);
2850 /* Try a template-id. */
2851 id = cp_parser_template_id (parser,
2852 /*template_keyword_p=*/false,
2853 /*check_dependency_p=*/true,
2855 /* If that worked, we're done. */
2856 if (cp_parser_parse_definitely (parser))
2859 /* Peek at the next token. (Changes in the token buffer may
2860 have invalidated the pointer obtained above.) */
2861 token = cp_lexer_peek_token (parser->lexer);
2863 switch (token->type)
2866 return cp_parser_identifier (parser);
2869 if (token->keyword == RID_OPERATOR)
2870 return cp_parser_operator_function_id (parser);
2874 cp_parser_error (parser, "expected id-expression");
2875 return error_mark_node;
2879 return cp_parser_unqualified_id (parser, template_keyword_p,
2880 /*check_dependency_p=*/true,
2884 /* Parse an unqualified-id.
2888 operator-function-id
2889 conversion-function-id
2893 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
2894 keyword, in a construct like `A::template ...'.
2896 Returns a representation of unqualified-id. For the `identifier'
2897 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
2898 production a BIT_NOT_EXPR is returned; the operand of the
2899 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
2900 other productions, see the documentation accompanying the
2901 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
2902 names are looked up in uninstantiated templates. If DECLARATOR_P
2903 is true, the unqualified-id is appearing as part of a declarator,
2904 rather than as part of an expression. */
2907 cp_parser_unqualified_id (cp_parser* parser,
2908 bool template_keyword_p,
2909 bool check_dependency_p,
2914 /* Peek at the next token. */
2915 token = cp_lexer_peek_token (parser->lexer);
2917 switch (token->type)
2923 /* We don't know yet whether or not this will be a
2925 cp_parser_parse_tentatively (parser);
2926 /* Try a template-id. */
2927 id = cp_parser_template_id (parser, template_keyword_p,
2930 /* If it worked, we're done. */
2931 if (cp_parser_parse_definitely (parser))
2933 /* Otherwise, it's an ordinary identifier. */
2934 return cp_parser_identifier (parser);
2937 case CPP_TEMPLATE_ID:
2938 return cp_parser_template_id (parser, template_keyword_p,
2945 tree qualifying_scope;
2949 /* Consume the `~' token. */
2950 cp_lexer_consume_token (parser->lexer);
2951 /* Parse the class-name. The standard, as written, seems to
2954 template <typename T> struct S { ~S (); };
2955 template <typename T> S<T>::~S() {}
2957 is invalid, since `~' must be followed by a class-name, but
2958 `S<T>' is dependent, and so not known to be a class.
2959 That's not right; we need to look in uninstantiated
2960 templates. A further complication arises from:
2962 template <typename T> void f(T t) {
2966 Here, it is not possible to look up `T' in the scope of `T'
2967 itself. We must look in both the current scope, and the
2968 scope of the containing complete expression.
2970 Yet another issue is:
2979 The standard does not seem to say that the `S' in `~S'
2980 should refer to the type `S' and not the data member
2983 /* DR 244 says that we look up the name after the "~" in the
2984 same scope as we looked up the qualifying name. That idea
2985 isn't fully worked out; it's more complicated than that. */
2986 scope = parser->scope;
2987 object_scope = parser->object_scope;
2988 qualifying_scope = parser->qualifying_scope;
2990 /* If the name is of the form "X::~X" it's OK. */
2991 if (scope && TYPE_P (scope)
2992 && cp_lexer_next_token_is (parser->lexer, CPP_NAME)
2993 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
2995 && (cp_lexer_peek_token (parser->lexer)->value
2996 == TYPE_IDENTIFIER (scope)))
2998 cp_lexer_consume_token (parser->lexer);
2999 return build_nt (BIT_NOT_EXPR, scope);
3002 /* If there was an explicit qualification (S::~T), first look
3003 in the scope given by the qualification (i.e., S). */
3006 cp_parser_parse_tentatively (parser);
3007 type_decl = cp_parser_class_name (parser,
3008 /*typename_keyword_p=*/false,
3009 /*template_keyword_p=*/false,
3011 /*check_dependency=*/false,
3012 /*class_head_p=*/false,
3014 if (cp_parser_parse_definitely (parser))
3015 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
3017 /* In "N::S::~S", look in "N" as well. */
3018 if (scope && qualifying_scope)
3020 cp_parser_parse_tentatively (parser);
3021 parser->scope = qualifying_scope;
3022 parser->object_scope = NULL_TREE;
3023 parser->qualifying_scope = NULL_TREE;
3025 = cp_parser_class_name (parser,
3026 /*typename_keyword_p=*/false,
3027 /*template_keyword_p=*/false,
3029 /*check_dependency=*/false,
3030 /*class_head_p=*/false,
3032 if (cp_parser_parse_definitely (parser))
3033 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
3035 /* In "p->S::~T", look in the scope given by "*p" as well. */
3036 else if (object_scope)
3038 cp_parser_parse_tentatively (parser);
3039 parser->scope = object_scope;
3040 parser->object_scope = NULL_TREE;
3041 parser->qualifying_scope = NULL_TREE;
3043 = cp_parser_class_name (parser,
3044 /*typename_keyword_p=*/false,
3045 /*template_keyword_p=*/false,
3047 /*check_dependency=*/false,
3048 /*class_head_p=*/false,
3050 if (cp_parser_parse_definitely (parser))
3051 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
3053 /* Look in the surrounding context. */
3054 parser->scope = NULL_TREE;
3055 parser->object_scope = NULL_TREE;
3056 parser->qualifying_scope = NULL_TREE;
3058 = cp_parser_class_name (parser,
3059 /*typename_keyword_p=*/false,
3060 /*template_keyword_p=*/false,
3062 /*check_dependency=*/false,
3063 /*class_head_p=*/false,
3065 /* If an error occurred, assume that the name of the
3066 destructor is the same as the name of the qualifying
3067 class. That allows us to keep parsing after running
3068 into ill-formed destructor names. */
3069 if (type_decl == error_mark_node && scope && TYPE_P (scope))
3070 return build_nt (BIT_NOT_EXPR, scope);
3071 else if (type_decl == error_mark_node)
3072 return error_mark_node;
3076 A typedef-name that names a class shall not be used as the
3077 identifier in the declarator for a destructor declaration. */
3079 && !DECL_IMPLICIT_TYPEDEF_P (type_decl)
3080 && !DECL_SELF_REFERENCE_P (type_decl))
3081 error ("typedef-name `%D' used as destructor declarator",
3084 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
3088 if (token->keyword == RID_OPERATOR)
3092 /* This could be a template-id, so we try that first. */
3093 cp_parser_parse_tentatively (parser);
3094 /* Try a template-id. */
3095 id = cp_parser_template_id (parser, template_keyword_p,
3096 /*check_dependency_p=*/true,
3098 /* If that worked, we're done. */
3099 if (cp_parser_parse_definitely (parser))
3101 /* We still don't know whether we're looking at an
3102 operator-function-id or a conversion-function-id. */
3103 cp_parser_parse_tentatively (parser);
3104 /* Try an operator-function-id. */
3105 id = cp_parser_operator_function_id (parser);
3106 /* If that didn't work, try a conversion-function-id. */
3107 if (!cp_parser_parse_definitely (parser))
3108 id = cp_parser_conversion_function_id (parser);
3115 cp_parser_error (parser, "expected unqualified-id");
3116 return error_mark_node;
3120 /* Parse an (optional) nested-name-specifier.
3122 nested-name-specifier:
3123 class-or-namespace-name :: nested-name-specifier [opt]
3124 class-or-namespace-name :: template nested-name-specifier [opt]
3126 PARSER->SCOPE should be set appropriately before this function is
3127 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
3128 effect. TYPE_P is TRUE if we non-type bindings should be ignored
3131 Sets PARSER->SCOPE to the class (TYPE) or namespace
3132 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
3133 it unchanged if there is no nested-name-specifier. Returns the new
3134 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
3136 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
3137 part of a declaration and/or decl-specifier. */
3140 cp_parser_nested_name_specifier_opt (cp_parser *parser,
3141 bool typename_keyword_p,
3142 bool check_dependency_p,
3144 bool is_declaration)
3146 bool success = false;
3147 tree access_check = NULL_TREE;
3151 /* If the next token corresponds to a nested name specifier, there
3152 is no need to reparse it. However, if CHECK_DEPENDENCY_P is
3153 false, it may have been true before, in which case something
3154 like `A<X>::B<Y>::C' may have resulted in a nested-name-specifier
3155 of `A<X>::', where it should now be `A<X>::B<Y>::'. So, when
3156 CHECK_DEPENDENCY_P is false, we have to fall through into the
3158 if (check_dependency_p
3159 && cp_lexer_next_token_is (parser->lexer, CPP_NESTED_NAME_SPECIFIER))
3161 cp_parser_pre_parsed_nested_name_specifier (parser);
3162 return parser->scope;
3165 /* Remember where the nested-name-specifier starts. */
3166 if (cp_parser_parsing_tentatively (parser)
3167 && !cp_parser_committed_to_tentative_parse (parser))
3169 token = cp_lexer_peek_token (parser->lexer);
3170 start = cp_lexer_token_difference (parser->lexer,
3171 parser->lexer->first_token,
3177 push_deferring_access_checks (dk_deferred);
3183 tree saved_qualifying_scope;
3184 bool template_keyword_p;
3186 /* Spot cases that cannot be the beginning of a
3187 nested-name-specifier. */
3188 token = cp_lexer_peek_token (parser->lexer);
3190 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
3191 the already parsed nested-name-specifier. */
3192 if (token->type == CPP_NESTED_NAME_SPECIFIER)
3194 /* Grab the nested-name-specifier and continue the loop. */
3195 cp_parser_pre_parsed_nested_name_specifier (parser);
3200 /* Spot cases that cannot be the beginning of a
3201 nested-name-specifier. On the second and subsequent times
3202 through the loop, we look for the `template' keyword. */
3203 if (success && token->keyword == RID_TEMPLATE)
3205 /* A template-id can start a nested-name-specifier. */
3206 else if (token->type == CPP_TEMPLATE_ID)
3210 /* If the next token is not an identifier, then it is
3211 definitely not a class-or-namespace-name. */
3212 if (token->type != CPP_NAME)
3214 /* If the following token is neither a `<' (to begin a
3215 template-id), nor a `::', then we are not looking at a
3216 nested-name-specifier. */
3217 token = cp_lexer_peek_nth_token (parser->lexer, 2);
3218 if (token->type != CPP_SCOPE
3219 && !cp_parser_nth_token_starts_template_argument_list_p
3224 /* The nested-name-specifier is optional, so we parse
3226 cp_parser_parse_tentatively (parser);
3228 /* Look for the optional `template' keyword, if this isn't the
3229 first time through the loop. */
3231 template_keyword_p = cp_parser_optional_template_keyword (parser);
3233 template_keyword_p = false;
3235 /* Save the old scope since the name lookup we are about to do
3236 might destroy it. */
3237 old_scope = parser->scope;
3238 saved_qualifying_scope = parser->qualifying_scope;
3239 /* Parse the qualifying entity. */
3241 = cp_parser_class_or_namespace_name (parser,
3247 /* Look for the `::' token. */
3248 cp_parser_require (parser, CPP_SCOPE, "`::'");
3250 /* If we found what we wanted, we keep going; otherwise, we're
3252 if (!cp_parser_parse_definitely (parser))
3254 bool error_p = false;
3256 /* Restore the OLD_SCOPE since it was valid before the
3257 failed attempt at finding the last
3258 class-or-namespace-name. */
3259 parser->scope = old_scope;
3260 parser->qualifying_scope = saved_qualifying_scope;
3261 /* If the next token is an identifier, and the one after
3262 that is a `::', then any valid interpretation would have
3263 found a class-or-namespace-name. */
3264 while (cp_lexer_next_token_is (parser->lexer, CPP_NAME)
3265 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
3267 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
3270 token = cp_lexer_consume_token (parser->lexer);
3275 decl = cp_parser_lookup_name_simple (parser, token->value);
3276 if (TREE_CODE (decl) == TEMPLATE_DECL)
3277 error ("`%D' used without template parameters",
3280 cp_parser_name_lookup_error
3281 (parser, token->value, decl,
3282 "is not a class or namespace");
3283 parser->scope = NULL_TREE;
3285 /* Treat this as a successful nested-name-specifier
3290 If the name found is not a class-name (clause
3291 _class_) or namespace-name (_namespace.def_), the
3292 program is ill-formed. */
3295 cp_lexer_consume_token (parser->lexer);
3300 /* We've found one valid nested-name-specifier. */
3302 /* Make sure we look in the right scope the next time through
3304 parser->scope = (TREE_CODE (new_scope) == TYPE_DECL
3305 ? TREE_TYPE (new_scope)
3307 /* If it is a class scope, try to complete it; we are about to
3308 be looking up names inside the class. */
3309 if (TYPE_P (parser->scope)
3310 /* Since checking types for dependency can be expensive,
3311 avoid doing it if the type is already complete. */
3312 && !COMPLETE_TYPE_P (parser->scope)
3313 /* Do not try to complete dependent types. */
3314 && !dependent_type_p (parser->scope))
3315 complete_type (parser->scope);
3318 /* Retrieve any deferred checks. Do not pop this access checks yet
3319 so the memory will not be reclaimed during token replacing below. */
3320 access_check = get_deferred_access_checks ();
3322 /* If parsing tentatively, replace the sequence of tokens that makes
3323 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
3324 token. That way, should we re-parse the token stream, we will
3325 not have to repeat the effort required to do the parse, nor will
3326 we issue duplicate error messages. */
3327 if (success && start >= 0)
3329 /* Find the token that corresponds to the start of the
3331 token = cp_lexer_advance_token (parser->lexer,
3332 parser->lexer->first_token,
3335 /* Reset the contents of the START token. */
3336 token->type = CPP_NESTED_NAME_SPECIFIER;
3337 token->value = build_tree_list (access_check, parser->scope);
3338 TREE_TYPE (token->value) = parser->qualifying_scope;
3339 token->keyword = RID_MAX;
3340 /* Purge all subsequent tokens. */
3341 cp_lexer_purge_tokens_after (parser->lexer, token);
3344 pop_deferring_access_checks ();
3345 return success ? parser->scope : NULL_TREE;
3348 /* Parse a nested-name-specifier. See
3349 cp_parser_nested_name_specifier_opt for details. This function
3350 behaves identically, except that it will an issue an error if no
3351 nested-name-specifier is present, and it will return
3352 ERROR_MARK_NODE, rather than NULL_TREE, if no nested-name-specifier
3356 cp_parser_nested_name_specifier (cp_parser *parser,
3357 bool typename_keyword_p,
3358 bool check_dependency_p,
3360 bool is_declaration)
3364 /* Look for the nested-name-specifier. */
3365 scope = cp_parser_nested_name_specifier_opt (parser,
3370 /* If it was not present, issue an error message. */
3373 cp_parser_error (parser, "expected nested-name-specifier");
3374 parser->scope = NULL_TREE;
3375 return error_mark_node;
3381 /* Parse a class-or-namespace-name.
3383 class-or-namespace-name:
3387 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
3388 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
3389 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
3390 TYPE_P is TRUE iff the next name should be taken as a class-name,
3391 even the same name is declared to be another entity in the same
3394 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
3395 specified by the class-or-namespace-name. If neither is found the
3396 ERROR_MARK_NODE is returned. */
3399 cp_parser_class_or_namespace_name (cp_parser *parser,
3400 bool typename_keyword_p,
3401 bool template_keyword_p,
3402 bool check_dependency_p,
3404 bool is_declaration)
3407 tree saved_qualifying_scope;
3408 tree saved_object_scope;
3412 /* Before we try to parse the class-name, we must save away the
3413 current PARSER->SCOPE since cp_parser_class_name will destroy
3415 saved_scope = parser->scope;
3416 saved_qualifying_scope = parser->qualifying_scope;
3417 saved_object_scope = parser->object_scope;
3418 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
3419 there is no need to look for a namespace-name. */
3420 only_class_p = template_keyword_p || (saved_scope && TYPE_P (saved_scope));
3422 cp_parser_parse_tentatively (parser);
3423 scope = cp_parser_class_name (parser,
3428 /*class_head_p=*/false,
3430 /* If that didn't work, try for a namespace-name. */
3431 if (!only_class_p && !cp_parser_parse_definitely (parser))
3433 /* Restore the saved scope. */
3434 parser->scope = saved_scope;
3435 parser->qualifying_scope = saved_qualifying_scope;
3436 parser->object_scope = saved_object_scope;
3437 /* If we are not looking at an identifier followed by the scope
3438 resolution operator, then this is not part of a
3439 nested-name-specifier. (Note that this function is only used
3440 to parse the components of a nested-name-specifier.) */
3441 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME)
3442 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SCOPE)
3443 return error_mark_node;
3444 scope = cp_parser_namespace_name (parser);
3450 /* Parse a postfix-expression.
3454 postfix-expression [ expression ]
3455 postfix-expression ( expression-list [opt] )
3456 simple-type-specifier ( expression-list [opt] )
3457 typename :: [opt] nested-name-specifier identifier
3458 ( expression-list [opt] )
3459 typename :: [opt] nested-name-specifier template [opt] template-id
3460 ( expression-list [opt] )
3461 postfix-expression . template [opt] id-expression
3462 postfix-expression -> template [opt] id-expression
3463 postfix-expression . pseudo-destructor-name
3464 postfix-expression -> pseudo-destructor-name
3465 postfix-expression ++
3466 postfix-expression --
3467 dynamic_cast < type-id > ( expression )
3468 static_cast < type-id > ( expression )
3469 reinterpret_cast < type-id > ( expression )
3470 const_cast < type-id > ( expression )
3471 typeid ( expression )
3477 ( type-id ) { initializer-list , [opt] }
3479 This extension is a GNU version of the C99 compound-literal
3480 construct. (The C99 grammar uses `type-name' instead of `type-id',
3481 but they are essentially the same concept.)
3483 If ADDRESS_P is true, the postfix expression is the operand of the
3486 Returns a representation of the expression. */
3489 cp_parser_postfix_expression (cp_parser *parser, bool address_p)
3493 cp_id_kind idk = CP_ID_KIND_NONE;
3494 tree postfix_expression = NULL_TREE;
3495 /* Non-NULL only if the current postfix-expression can be used to
3496 form a pointer-to-member. In that case, QUALIFYING_CLASS is the
3497 class used to qualify the member. */
3498 tree qualifying_class = NULL_TREE;
3500 /* Peek at the next token. */
3501 token = cp_lexer_peek_token (parser->lexer);
3502 /* Some of the productions are determined by keywords. */
3503 keyword = token->keyword;
3513 const char *saved_message;
3515 /* All of these can be handled in the same way from the point
3516 of view of parsing. Begin by consuming the token
3517 identifying the cast. */
3518 cp_lexer_consume_token (parser->lexer);
3520 /* New types cannot be defined in the cast. */
3521 saved_message = parser->type_definition_forbidden_message;
3522 parser->type_definition_forbidden_message
3523 = "types may not be defined in casts";
3525 /* Look for the opening `<'. */
3526 cp_parser_require (parser, CPP_LESS, "`<'");
3527 /* Parse the type to which we are casting. */
3528 type = cp_parser_type_id (parser);
3529 /* Look for the closing `>'. */
3530 cp_parser_require (parser, CPP_GREATER, "`>'");
3531 /* Restore the old message. */
3532 parser->type_definition_forbidden_message = saved_message;
3534 /* And the expression which is being cast. */
3535 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
3536 expression = cp_parser_expression (parser);
3537 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3539 /* Only type conversions to integral or enumeration types
3540 can be used in constant-expressions. */
3541 if (parser->integral_constant_expression_p
3542 && !dependent_type_p (type)
3543 && !INTEGRAL_OR_ENUMERATION_TYPE_P (type)
3544 && (cp_parser_non_integral_constant_expression
3546 "a cast to a type other than an integral or "
3547 "enumeration type")))
3548 return error_mark_node;
3554 = build_dynamic_cast (type, expression);
3558 = build_static_cast (type, expression);
3562 = build_reinterpret_cast (type, expression);
3566 = build_const_cast (type, expression);
3577 const char *saved_message;
3578 bool saved_in_type_id_in_expr_p;
3580 /* Consume the `typeid' token. */
3581 cp_lexer_consume_token (parser->lexer);
3582 /* Look for the `(' token. */
3583 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
3584 /* Types cannot be defined in a `typeid' expression. */
3585 saved_message = parser->type_definition_forbidden_message;
3586 parser->type_definition_forbidden_message
3587 = "types may not be defined in a `typeid\' expression";
3588 /* We can't be sure yet whether we're looking at a type-id or an
3590 cp_parser_parse_tentatively (parser);
3591 /* Try a type-id first. */
3592 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
3593 parser->in_type_id_in_expr_p = true;
3594 type = cp_parser_type_id (parser);
3595 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
3596 /* Look for the `)' token. Otherwise, we can't be sure that
3597 we're not looking at an expression: consider `typeid (int
3598 (3))', for example. */
3599 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3600 /* If all went well, simply lookup the type-id. */
3601 if (cp_parser_parse_definitely (parser))
3602 postfix_expression = get_typeid (type);
3603 /* Otherwise, fall back to the expression variant. */
3608 /* Look for an expression. */
3609 expression = cp_parser_expression (parser);
3610 /* Compute its typeid. */
3611 postfix_expression = build_typeid (expression);
3612 /* Look for the `)' token. */
3613 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3615 /* `typeid' may not appear in an integral constant expression. */
3616 if (cp_parser_non_integral_constant_expression(parser,
3617 "`typeid' operator"))
3618 return error_mark_node;
3619 /* Restore the saved message. */
3620 parser->type_definition_forbidden_message = saved_message;
3626 bool template_p = false;
3630 /* Consume the `typename' token. */
3631 cp_lexer_consume_token (parser->lexer);
3632 /* Look for the optional `::' operator. */
3633 cp_parser_global_scope_opt (parser,
3634 /*current_scope_valid_p=*/false);
3635 /* Look for the nested-name-specifier. */
3636 cp_parser_nested_name_specifier (parser,
3637 /*typename_keyword_p=*/true,
3638 /*check_dependency_p=*/true,
3640 /*is_declaration=*/true);
3641 /* Look for the optional `template' keyword. */
3642 template_p = cp_parser_optional_template_keyword (parser);
3643 /* We don't know whether we're looking at a template-id or an
3645 cp_parser_parse_tentatively (parser);
3646 /* Try a template-id. */
3647 id = cp_parser_template_id (parser, template_p,
3648 /*check_dependency_p=*/true,
3649 /*is_declaration=*/true);
3650 /* If that didn't work, try an identifier. */
3651 if (!cp_parser_parse_definitely (parser))
3652 id = cp_parser_identifier (parser);
3653 /* If we look up a template-id in a non-dependent qualifying
3654 scope, there's no need to create a dependent type. */
3655 if (TREE_CODE (id) == TYPE_DECL
3656 && !dependent_type_p (parser->scope))
3657 type = TREE_TYPE (id);
3658 /* Create a TYPENAME_TYPE to represent the type to which the
3659 functional cast is being performed. */
3661 type = make_typename_type (parser->scope, id,
3664 postfix_expression = cp_parser_functional_cast (parser, type);
3672 /* If the next thing is a simple-type-specifier, we may be
3673 looking at a functional cast. We could also be looking at
3674 an id-expression. So, we try the functional cast, and if
3675 that doesn't work we fall back to the primary-expression. */
3676 cp_parser_parse_tentatively (parser);
3677 /* Look for the simple-type-specifier. */
3678 type = cp_parser_simple_type_specifier (parser,
3679 CP_PARSER_FLAGS_NONE,
3680 /*identifier_p=*/false);
3681 /* Parse the cast itself. */
3682 if (!cp_parser_error_occurred (parser))
3684 = cp_parser_functional_cast (parser, type);
3685 /* If that worked, we're done. */
3686 if (cp_parser_parse_definitely (parser))
3689 /* If the functional-cast didn't work out, try a
3690 compound-literal. */
3691 if (cp_parser_allow_gnu_extensions_p (parser)
3692 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
3694 tree initializer_list = NULL_TREE;
3695 bool saved_in_type_id_in_expr_p;
3697 cp_parser_parse_tentatively (parser);
3698 /* Consume the `('. */
3699 cp_lexer_consume_token (parser->lexer);
3700 /* Parse the type. */
3701 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
3702 parser->in_type_id_in_expr_p = true;
3703 type = cp_parser_type_id (parser);
3704 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
3705 /* Look for the `)'. */
3706 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3707 /* Look for the `{'. */
3708 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
3709 /* If things aren't going well, there's no need to
3711 if (!cp_parser_error_occurred (parser))
3713 bool non_constant_p;
3714 /* Parse the initializer-list. */
3716 = cp_parser_initializer_list (parser, &non_constant_p);
3717 /* Allow a trailing `,'. */
3718 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
3719 cp_lexer_consume_token (parser->lexer);
3720 /* Look for the final `}'. */
3721 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
3723 /* If that worked, we're definitely looking at a
3724 compound-literal expression. */
3725 if (cp_parser_parse_definitely (parser))
3727 /* Warn the user that a compound literal is not
3728 allowed in standard C++. */
3730 pedwarn ("ISO C++ forbids compound-literals");
3731 /* Form the representation of the compound-literal. */
3733 = finish_compound_literal (type, initializer_list);
3738 /* It must be a primary-expression. */
3739 postfix_expression = cp_parser_primary_expression (parser,
3746 /* If we were avoiding committing to the processing of a
3747 qualified-id until we knew whether or not we had a
3748 pointer-to-member, we now know. */
3749 if (qualifying_class)
3753 /* Peek at the next token. */
3754 token = cp_lexer_peek_token (parser->lexer);
3755 done = (token->type != CPP_OPEN_SQUARE
3756 && token->type != CPP_OPEN_PAREN
3757 && token->type != CPP_DOT
3758 && token->type != CPP_DEREF
3759 && token->type != CPP_PLUS_PLUS
3760 && token->type != CPP_MINUS_MINUS);
3762 postfix_expression = finish_qualified_id_expr (qualifying_class,
3767 return postfix_expression;
3770 /* Keep looping until the postfix-expression is complete. */
3773 if (idk == CP_ID_KIND_UNQUALIFIED
3774 && TREE_CODE (postfix_expression) == IDENTIFIER_NODE
3775 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
3776 /* It is not a Koenig lookup function call. */
3778 = unqualified_name_lookup_error (postfix_expression);
3780 /* Peek at the next token. */
3781 token = cp_lexer_peek_token (parser->lexer);
3783 switch (token->type)
3785 case CPP_OPEN_SQUARE:
3787 = cp_parser_postfix_open_square_expression (parser,
3790 idk = CP_ID_KIND_NONE;
3793 case CPP_OPEN_PAREN:
3794 /* postfix-expression ( expression-list [opt] ) */
3797 tree args = (cp_parser_parenthesized_expression_list
3798 (parser, false, /*non_constant_p=*/NULL));
3800 if (args == error_mark_node)
3802 postfix_expression = error_mark_node;
3806 /* Function calls are not permitted in
3807 constant-expressions. */
3808 if (cp_parser_non_integral_constant_expression (parser,
3811 postfix_expression = error_mark_node;
3816 if (idk == CP_ID_KIND_UNQUALIFIED)
3818 /* We do not perform argument-dependent lookup if
3819 normal lookup finds a non-function, in accordance
3820 with the expected resolution of DR 218. */
3822 && (is_overloaded_fn (postfix_expression)
3823 || TREE_CODE (postfix_expression) == IDENTIFIER_NODE))
3827 = perform_koenig_lookup (postfix_expression, args);
3829 else if (TREE_CODE (postfix_expression) == IDENTIFIER_NODE)
3831 = unqualified_fn_lookup_error (postfix_expression);
3834 if (TREE_CODE (postfix_expression) == COMPONENT_REF)
3836 tree instance = TREE_OPERAND (postfix_expression, 0);
3837 tree fn = TREE_OPERAND (postfix_expression, 1);
3839 if (processing_template_decl
3840 && (type_dependent_expression_p (instance)
3841 || (!BASELINK_P (fn)
3842 && TREE_CODE (fn) != FIELD_DECL)
3843 || type_dependent_expression_p (fn)
3844 || any_type_dependent_arguments_p (args)))
3847 = build_min_nt (CALL_EXPR, postfix_expression,
3852 if (BASELINK_P (fn))
3854 = (build_new_method_call
3855 (instance, fn, args, NULL_TREE,
3856 (idk == CP_ID_KIND_QUALIFIED
3857 ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL)));
3860 = finish_call_expr (postfix_expression, args,
3861 /*disallow_virtual=*/false,
3862 /*koenig_p=*/false);
3864 else if (TREE_CODE (postfix_expression) == OFFSET_REF
3865 || TREE_CODE (postfix_expression) == MEMBER_REF
3866 || TREE_CODE (postfix_expression) == DOTSTAR_EXPR)
3867 postfix_expression = (build_offset_ref_call_from_tree
3868 (postfix_expression, args));
3869 else if (idk == CP_ID_KIND_QUALIFIED)
3870 /* A call to a static class member, or a namespace-scope
3873 = finish_call_expr (postfix_expression, args,
3874 /*disallow_virtual=*/true,
3877 /* All other function calls. */
3879 = finish_call_expr (postfix_expression, args,
3880 /*disallow_virtual=*/false,
3883 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
3884 idk = CP_ID_KIND_NONE;
3890 /* postfix-expression . template [opt] id-expression
3891 postfix-expression . pseudo-destructor-name
3892 postfix-expression -> template [opt] id-expression
3893 postfix-expression -> pseudo-destructor-name */
3895 /* Consume the `.' or `->' operator. */
3896 cp_lexer_consume_token (parser->lexer);
3899 = cp_parser_postfix_dot_deref_expression (parser, token->type,
3905 /* postfix-expression ++ */
3906 /* Consume the `++' token. */
3907 cp_lexer_consume_token (parser->lexer);
3908 /* Generate a representation for the complete expression. */
3910 = finish_increment_expr (postfix_expression,
3911 POSTINCREMENT_EXPR);
3912 /* Increments may not appear in constant-expressions. */
3913 if (cp_parser_non_integral_constant_expression (parser,
3915 postfix_expression = error_mark_node;
3916 idk = CP_ID_KIND_NONE;
3919 case CPP_MINUS_MINUS:
3920 /* postfix-expression -- */
3921 /* Consume the `--' token. */
3922 cp_lexer_consume_token (parser->lexer);
3923 /* Generate a representation for the complete expression. */
3925 = finish_increment_expr (postfix_expression,
3926 POSTDECREMENT_EXPR);
3927 /* Decrements may not appear in constant-expressions. */
3928 if (cp_parser_non_integral_constant_expression (parser,
3930 postfix_expression = error_mark_node;
3931 idk = CP_ID_KIND_NONE;
3935 return postfix_expression;
3939 /* We should never get here. */
3941 return error_mark_node;
3944 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
3945 by cp_parser_builtin_offsetof. We're looking for
3947 postfix-expression [ expression ]
3949 FOR_OFFSETOF is set if we're being called in that context, which
3950 changes how we deal with integer constant expressions. */
3953 cp_parser_postfix_open_square_expression (cp_parser *parser,
3954 tree postfix_expression,
3959 /* Consume the `[' token. */
3960 cp_lexer_consume_token (parser->lexer);
3962 /* Parse the index expression. */
3963 /* ??? For offsetof, there is a question of what to allow here. If
3964 offsetof is not being used in an integral constant expression context,
3965 then we *could* get the right answer by computing the value at runtime.
3966 If we are in an integral constant expression context, then we might
3967 could accept any constant expression; hard to say without analysis.
3968 Rather than open the barn door too wide right away, allow only integer
3969 constant expresions here. */
3971 index = cp_parser_constant_expression (parser, false, NULL);
3973 index = cp_parser_expression (parser);
3975 /* Look for the closing `]'. */
3976 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
3978 /* Build the ARRAY_REF. */
3979 postfix_expression = grok_array_decl (postfix_expression, index);
3981 /* When not doing offsetof, array references are not permitted in
3982 constant-expressions. */
3984 && (cp_parser_non_integral_constant_expression
3985 (parser, "an array reference")))
3986 postfix_expression = error_mark_node;
3988 return postfix_expression;
3991 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
3992 by cp_parser_builtin_offsetof. We're looking for
3994 postfix-expression . template [opt] id-expression
3995 postfix-expression . pseudo-destructor-name
3996 postfix-expression -> template [opt] id-expression
3997 postfix-expression -> pseudo-destructor-name
3999 FOR_OFFSETOF is set if we're being called in that context. That sorta
4000 limits what of the above we'll actually accept, but nevermind.
4001 TOKEN_TYPE is the "." or "->" token, which will already have been
4002 removed from the stream. */
4005 cp_parser_postfix_dot_deref_expression (cp_parser *parser,
4006 enum cpp_ttype token_type,
4007 tree postfix_expression,
4008 bool for_offsetof, cp_id_kind *idk)
4013 tree scope = NULL_TREE;
4015 /* If this is a `->' operator, dereference the pointer. */
4016 if (token_type == CPP_DEREF)
4017 postfix_expression = build_x_arrow (postfix_expression);
4018 /* Check to see whether or not the expression is type-dependent. */
4019 dependent_p = type_dependent_expression_p (postfix_expression);
4020 /* The identifier following the `->' or `.' is not qualified. */
4021 parser->scope = NULL_TREE;
4022 parser->qualifying_scope = NULL_TREE;
4023 parser->object_scope = NULL_TREE;
4024 *idk = CP_ID_KIND_NONE;
4025 /* Enter the scope corresponding to the type of the object
4026 given by the POSTFIX_EXPRESSION. */
4027 if (!dependent_p && TREE_TYPE (postfix_expression) != NULL_TREE)
4029 scope = TREE_TYPE (postfix_expression);
4030 /* According to the standard, no expression should ever have
4031 reference type. Unfortunately, we do not currently match
4032 the standard in this respect in that our internal representation
4033 of an expression may have reference type even when the standard
4034 says it does not. Therefore, we have to manually obtain the
4035 underlying type here. */
4036 scope = non_reference (scope);
4037 /* The type of the POSTFIX_EXPRESSION must be complete. */
4038 scope = complete_type_or_else (scope, NULL_TREE);
4039 /* Let the name lookup machinery know that we are processing a
4040 class member access expression. */
4041 parser->context->object_type = scope;
4042 /* If something went wrong, we want to be able to discern that case,
4043 as opposed to the case where there was no SCOPE due to the type
4044 of expression being dependent. */
4046 scope = error_mark_node;
4047 /* If the SCOPE was erroneous, make the various semantic analysis
4048 functions exit quickly -- and without issuing additional error
4050 if (scope == error_mark_node)
4051 postfix_expression = error_mark_node;
4054 /* If the SCOPE is not a scalar type, we are looking at an
4055 ordinary class member access expression, rather than a
4056 pseudo-destructor-name. */
4057 if (!scope || !SCALAR_TYPE_P (scope))
4059 template_p = cp_parser_optional_template_keyword (parser);
4060 /* Parse the id-expression. */
4061 name = cp_parser_id_expression (parser, template_p,
4062 /*check_dependency_p=*/true,
4063 /*template_p=*/NULL,
4064 /*declarator_p=*/false);
4065 /* In general, build a SCOPE_REF if the member name is qualified.
4066 However, if the name was not dependent and has already been
4067 resolved; there is no need to build the SCOPE_REF. For example;
4069 struct X { void f(); };
4070 template <typename T> void f(T* t) { t->X::f(); }
4072 Even though "t" is dependent, "X::f" is not and has been resolved
4073 to a BASELINK; there is no need to include scope information. */
4075 /* But we do need to remember that there was an explicit scope for
4076 virtual function calls. */
4078 *idk = CP_ID_KIND_QUALIFIED;
4080 if (name != error_mark_node && !BASELINK_P (name) && parser->scope)
4082 name = build_nt (SCOPE_REF, parser->scope, name);
4083 parser->scope = NULL_TREE;
4084 parser->qualifying_scope = NULL_TREE;
4085 parser->object_scope = NULL_TREE;
4087 if (scope && name && BASELINK_P (name))
4088 adjust_result_of_qualified_name_lookup
4089 (name, BINFO_TYPE (BASELINK_BINFO (name)), scope);
4091 = finish_class_member_access_expr (postfix_expression, name);
4093 /* Otherwise, try the pseudo-destructor-name production. */
4099 /* Parse the pseudo-destructor-name. */
4100 cp_parser_pseudo_destructor_name (parser, &s, &type);
4101 /* Form the call. */
4103 = finish_pseudo_destructor_expr (postfix_expression,
4104 s, TREE_TYPE (type));
4107 /* We no longer need to look up names in the scope of the object on
4108 the left-hand side of the `.' or `->' operator. */
4109 parser->context->object_type = NULL_TREE;
4111 /* Outside of offsetof, these operators may not appear in
4112 constant-expressions. */
4114 && (cp_parser_non_integral_constant_expression
4115 (parser, token_type == CPP_DEREF ? "'->'" : "`.'")))
4116 postfix_expression = error_mark_node;
4118 return postfix_expression;
4121 /* Parse a parenthesized expression-list.
4124 assignment-expression
4125 expression-list, assignment-expression
4130 identifier, expression-list
4132 Returns a TREE_LIST. The TREE_VALUE of each node is a
4133 representation of an assignment-expression. Note that a TREE_LIST
4134 is returned even if there is only a single expression in the list.
4135 error_mark_node is returned if the ( and or ) are
4136 missing. NULL_TREE is returned on no expressions. The parentheses
4137 are eaten. IS_ATTRIBUTE_LIST is true if this is really an attribute
4138 list being parsed. If NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P
4139 indicates whether or not all of the expressions in the list were
4143 cp_parser_parenthesized_expression_list (cp_parser* parser,
4144 bool is_attribute_list,
4145 bool *non_constant_p)
4147 tree expression_list = NULL_TREE;
4148 tree identifier = NULL_TREE;
4150 /* Assume all the expressions will be constant. */
4152 *non_constant_p = false;
4154 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
4155 return error_mark_node;
4157 /* Consume expressions until there are no more. */
4158 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
4163 /* At the beginning of attribute lists, check to see if the
4164 next token is an identifier. */
4165 if (is_attribute_list
4166 && cp_lexer_peek_token (parser->lexer)->type == CPP_NAME)
4170 /* Consume the identifier. */
4171 token = cp_lexer_consume_token (parser->lexer);
4172 /* Save the identifier. */
4173 identifier = token->value;
4177 /* Parse the next assignment-expression. */
4180 bool expr_non_constant_p;
4181 expr = (cp_parser_constant_expression
4182 (parser, /*allow_non_constant_p=*/true,
4183 &expr_non_constant_p));
4184 if (expr_non_constant_p)
4185 *non_constant_p = true;
4188 expr = cp_parser_assignment_expression (parser);
4190 /* Add it to the list. We add error_mark_node
4191 expressions to the list, so that we can still tell if
4192 the correct form for a parenthesized expression-list
4193 is found. That gives better errors. */
4194 expression_list = tree_cons (NULL_TREE, expr, expression_list);
4196 if (expr == error_mark_node)
4200 /* After the first item, attribute lists look the same as
4201 expression lists. */
4202 is_attribute_list = false;
4205 /* If the next token isn't a `,', then we are done. */
4206 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
4209 /* Otherwise, consume the `,' and keep going. */
4210 cp_lexer_consume_token (parser->lexer);
4213 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
4218 /* We try and resync to an unnested comma, as that will give the
4219 user better diagnostics. */
4220 ending = cp_parser_skip_to_closing_parenthesis (parser,
4221 /*recovering=*/true,
4223 /*consume_paren=*/true);
4227 return error_mark_node;
4230 /* We built up the list in reverse order so we must reverse it now. */
4231 expression_list = nreverse (expression_list);
4233 expression_list = tree_cons (NULL_TREE, identifier, expression_list);
4235 return expression_list;
4238 /* Parse a pseudo-destructor-name.
4240 pseudo-destructor-name:
4241 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
4242 :: [opt] nested-name-specifier template template-id :: ~ type-name
4243 :: [opt] nested-name-specifier [opt] ~ type-name
4245 If either of the first two productions is used, sets *SCOPE to the
4246 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
4247 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
4248 or ERROR_MARK_NODE if the parse fails. */
4251 cp_parser_pseudo_destructor_name (cp_parser* parser,
4255 bool nested_name_specifier_p;
4257 /* Look for the optional `::' operator. */
4258 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/true);
4259 /* Look for the optional nested-name-specifier. */
4260 nested_name_specifier_p
4261 = (cp_parser_nested_name_specifier_opt (parser,
4262 /*typename_keyword_p=*/false,
4263 /*check_dependency_p=*/true,
4265 /*is_declaration=*/true)
4267 /* Now, if we saw a nested-name-specifier, we might be doing the
4268 second production. */
4269 if (nested_name_specifier_p
4270 && cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
4272 /* Consume the `template' keyword. */
4273 cp_lexer_consume_token (parser->lexer);
4274 /* Parse the template-id. */
4275 cp_parser_template_id (parser,
4276 /*template_keyword_p=*/true,
4277 /*check_dependency_p=*/false,
4278 /*is_declaration=*/true);
4279 /* Look for the `::' token. */
4280 cp_parser_require (parser, CPP_SCOPE, "`::'");
4282 /* If the next token is not a `~', then there might be some
4283 additional qualification. */
4284 else if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMPL))
4286 /* Look for the type-name. */
4287 *scope = TREE_TYPE (cp_parser_type_name (parser));
4289 /* If we didn't get an aggregate type, or we don't have ::~,
4290 then something has gone wrong. Since the only caller of this
4291 function is looking for something after `.' or `->' after a
4292 scalar type, most likely the program is trying to get a
4293 member of a non-aggregate type. */
4294 if (*scope == error_mark_node
4295 || cp_lexer_next_token_is_not (parser->lexer, CPP_SCOPE)
4296 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_COMPL)
4298 cp_parser_error (parser, "request for member of non-aggregate type");
4299 *type = error_mark_node;
4303 /* Look for the `::' token. */
4304 cp_parser_require (parser, CPP_SCOPE, "`::'");
4309 /* Look for the `~'. */
4310 cp_parser_require (parser, CPP_COMPL, "`~'");
4311 /* Look for the type-name again. We are not responsible for
4312 checking that it matches the first type-name. */
4313 *type = cp_parser_type_name (parser);
4316 /* Parse a unary-expression.
4322 unary-operator cast-expression
4323 sizeof unary-expression
4331 __extension__ cast-expression
4332 __alignof__ unary-expression
4333 __alignof__ ( type-id )
4334 __real__ cast-expression
4335 __imag__ cast-expression
4338 ADDRESS_P is true iff the unary-expression is appearing as the
4339 operand of the `&' operator.
4341 Returns a representation of the expression. */
4344 cp_parser_unary_expression (cp_parser *parser, bool address_p)
4347 enum tree_code unary_operator;
4349 /* Peek at the next token. */
4350 token = cp_lexer_peek_token (parser->lexer);
4351 /* Some keywords give away the kind of expression. */
4352 if (token->type == CPP_KEYWORD)
4354 enum rid keyword = token->keyword;
4364 op = keyword == RID_ALIGNOF ? ALIGNOF_EXPR : SIZEOF_EXPR;
4365 /* Consume the token. */
4366 cp_lexer_consume_token (parser->lexer);
4367 /* Parse the operand. */
4368 operand = cp_parser_sizeof_operand (parser, keyword);
4370 if (TYPE_P (operand))
4371 return cxx_sizeof_or_alignof_type (operand, op, true);
4373 return cxx_sizeof_or_alignof_expr (operand, op);
4377 return cp_parser_new_expression (parser);
4380 return cp_parser_delete_expression (parser);
4384 /* The saved value of the PEDANTIC flag. */
4388 /* Save away the PEDANTIC flag. */
4389 cp_parser_extension_opt (parser, &saved_pedantic);
4390 /* Parse the cast-expression. */
4391 expr = cp_parser_simple_cast_expression (parser);
4392 /* Restore the PEDANTIC flag. */
4393 pedantic = saved_pedantic;
4403 /* Consume the `__real__' or `__imag__' token. */
4404 cp_lexer_consume_token (parser->lexer);
4405 /* Parse the cast-expression. */
4406 expression = cp_parser_simple_cast_expression (parser);
4407 /* Create the complete representation. */
4408 return build_x_unary_op ((keyword == RID_REALPART
4409 ? REALPART_EXPR : IMAGPART_EXPR),
4419 /* Look for the `:: new' and `:: delete', which also signal the
4420 beginning of a new-expression, or delete-expression,
4421 respectively. If the next token is `::', then it might be one of
4423 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
4427 /* See if the token after the `::' is one of the keywords in
4428 which we're interested. */
4429 keyword = cp_lexer_peek_nth_token (parser->lexer, 2)->keyword;
4430 /* If it's `new', we have a new-expression. */
4431 if (keyword == RID_NEW)
4432 return cp_parser_new_expression (parser);
4433 /* Similarly, for `delete'. */
4434 else if (keyword == RID_DELETE)
4435 return cp_parser_delete_expression (parser);
4438 /* Look for a unary operator. */
4439 unary_operator = cp_parser_unary_operator (token);
4440 /* The `++' and `--' operators can be handled similarly, even though
4441 they are not technically unary-operators in the grammar. */
4442 if (unary_operator == ERROR_MARK)
4444 if (token->type == CPP_PLUS_PLUS)
4445 unary_operator = PREINCREMENT_EXPR;
4446 else if (token->type == CPP_MINUS_MINUS)
4447 unary_operator = PREDECREMENT_EXPR;
4448 /* Handle the GNU address-of-label extension. */
4449 else if (cp_parser_allow_gnu_extensions_p (parser)
4450 && token->type == CPP_AND_AND)
4454 /* Consume the '&&' token. */
4455 cp_lexer_consume_token (parser->lexer);
4456 /* Look for the identifier. */
4457 identifier = cp_parser_identifier (parser);
4458 /* Create an expression representing the address. */
4459 return finish_label_address_expr (identifier);
4462 if (unary_operator != ERROR_MARK)
4464 tree cast_expression;
4465 tree expression = error_mark_node;
4466 const char *non_constant_p = NULL;
4468 /* Consume the operator token. */
4469 token = cp_lexer_consume_token (parser->lexer);
4470 /* Parse the cast-expression. */
4472 = cp_parser_cast_expression (parser, unary_operator == ADDR_EXPR);
4473 /* Now, build an appropriate representation. */
4474 switch (unary_operator)
4477 non_constant_p = "`*'";
4478 expression = build_x_indirect_ref (cast_expression, "unary *");
4482 non_constant_p = "`&'";
4485 expression = build_x_unary_op (unary_operator, cast_expression);
4488 case PREINCREMENT_EXPR:
4489 case PREDECREMENT_EXPR:
4490 non_constant_p = (unary_operator == PREINCREMENT_EXPR
4495 case TRUTH_NOT_EXPR:
4496 expression = finish_unary_op_expr (unary_operator, cast_expression);
4504 && cp_parser_non_integral_constant_expression (parser,
4506 expression = error_mark_node;
4511 return cp_parser_postfix_expression (parser, address_p);
4514 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
4515 unary-operator, the corresponding tree code is returned. */
4517 static enum tree_code
4518 cp_parser_unary_operator (cp_token* token)
4520 switch (token->type)
4523 return INDIRECT_REF;
4529 return CONVERT_EXPR;
4535 return TRUTH_NOT_EXPR;
4538 return BIT_NOT_EXPR;
4545 /* Parse a new-expression.
4548 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
4549 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
4551 Returns a representation of the expression. */
4554 cp_parser_new_expression (cp_parser* parser)
4556 bool global_scope_p;
4561 /* Look for the optional `::' operator. */
4563 = (cp_parser_global_scope_opt (parser,
4564 /*current_scope_valid_p=*/false)
4566 /* Look for the `new' operator. */
4567 cp_parser_require_keyword (parser, RID_NEW, "`new'");
4568 /* There's no easy way to tell a new-placement from the
4569 `( type-id )' construct. */
4570 cp_parser_parse_tentatively (parser);
4571 /* Look for a new-placement. */
4572 placement = cp_parser_new_placement (parser);
4573 /* If that didn't work out, there's no new-placement. */
4574 if (!cp_parser_parse_definitely (parser))
4575 placement = NULL_TREE;
4577 /* If the next token is a `(', then we have a parenthesized
4579 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
4581 /* Consume the `('. */
4582 cp_lexer_consume_token (parser->lexer);
4583 /* Parse the type-id. */
4584 type = cp_parser_type_id (parser);
4585 /* Look for the closing `)'. */
4586 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
4587 /* There should not be a direct-new-declarator in this production,
4588 but GCC used to allowed this, so we check and emit a sensible error
4589 message for this case. */
4590 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
4592 error ("array bound forbidden after parenthesized type-id");
4593 inform ("try removing the parentheses around the type-id");
4594 cp_parser_direct_new_declarator (parser);
4597 /* Otherwise, there must be a new-type-id. */
4599 type = cp_parser_new_type_id (parser);
4601 /* If the next token is a `(', then we have a new-initializer. */
4602 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
4603 initializer = cp_parser_new_initializer (parser);
4605 initializer = NULL_TREE;
4607 /* A new-expression may not appear in an integral constant
4609 if (cp_parser_non_integral_constant_expression (parser, "`new'"))
4610 return error_mark_node;
4612 /* Create a representation of the new-expression. */
4613 return build_new (placement, type, initializer, global_scope_p);
4616 /* Parse a new-placement.
4621 Returns the same representation as for an expression-list. */
4624 cp_parser_new_placement (cp_parser* parser)
4626 tree expression_list;
4628 /* Parse the expression-list. */
4629 expression_list = (cp_parser_parenthesized_expression_list
4630 (parser, false, /*non_constant_p=*/NULL));
4632 return expression_list;
4635 /* Parse a new-type-id.
4638 type-specifier-seq new-declarator [opt]
4640 Returns a TREE_LIST whose TREE_PURPOSE is the type-specifier-seq,
4641 and whose TREE_VALUE is the new-declarator. */
4644 cp_parser_new_type_id (cp_parser* parser)
4646 tree type_specifier_seq;
4648 const char *saved_message;
4650 /* The type-specifier sequence must not contain type definitions.
4651 (It cannot contain declarations of new types either, but if they
4652 are not definitions we will catch that because they are not
4654 saved_message = parser->type_definition_forbidden_message;
4655 parser->type_definition_forbidden_message
4656 = "types may not be defined in a new-type-id";
4657 /* Parse the type-specifier-seq. */
4658 type_specifier_seq = cp_parser_type_specifier_seq (parser);
4659 /* Restore the old message. */
4660 parser->type_definition_forbidden_message = saved_message;
4661 /* Parse the new-declarator. */
4662 declarator = cp_parser_new_declarator_opt (parser);
4664 return build_tree_list (type_specifier_seq, declarator);
4667 /* Parse an (optional) new-declarator.
4670 ptr-operator new-declarator [opt]
4671 direct-new-declarator
4673 Returns a representation of the declarator. See
4674 cp_parser_declarator for the representations used. */
4677 cp_parser_new_declarator_opt (cp_parser* parser)
4679 enum tree_code code;
4681 tree cv_qualifier_seq;
4683 /* We don't know if there's a ptr-operator next, or not. */
4684 cp_parser_parse_tentatively (parser);
4685 /* Look for a ptr-operator. */
4686 code = cp_parser_ptr_operator (parser, &type, &cv_qualifier_seq);
4687 /* If that worked, look for more new-declarators. */
4688 if (cp_parser_parse_definitely (parser))
4692 /* Parse another optional declarator. */
4693 declarator = cp_parser_new_declarator_opt (parser);
4695 /* Create the representation of the declarator. */
4696 if (code == INDIRECT_REF)
4697 declarator = make_pointer_declarator (cv_qualifier_seq,
4700 declarator = make_reference_declarator (cv_qualifier_seq,
4703 /* Handle the pointer-to-member case. */
4705 declarator = build_nt (SCOPE_REF, type, declarator);
4710 /* If the next token is a `[', there is a direct-new-declarator. */
4711 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
4712 return cp_parser_direct_new_declarator (parser);
4717 /* Parse a direct-new-declarator.
4719 direct-new-declarator:
4721 direct-new-declarator [constant-expression]
4723 Returns an ARRAY_REF, following the same conventions as are
4724 documented for cp_parser_direct_declarator. */
4727 cp_parser_direct_new_declarator (cp_parser* parser)
4729 tree declarator = NULL_TREE;
4735 /* Look for the opening `['. */
4736 cp_parser_require (parser, CPP_OPEN_SQUARE, "`['");
4737 /* The first expression is not required to be constant. */
4740 expression = cp_parser_expression (parser);
4741 /* The standard requires that the expression have integral
4742 type. DR 74 adds enumeration types. We believe that the
4743 real intent is that these expressions be handled like the
4744 expression in a `switch' condition, which also allows
4745 classes with a single conversion to integral or
4746 enumeration type. */
4747 if (!processing_template_decl)
4750 = build_expr_type_conversion (WANT_INT | WANT_ENUM,
4755 error ("expression in new-declarator must have integral or enumeration type");
4756 expression = error_mark_node;
4760 /* But all the other expressions must be. */
4763 = cp_parser_constant_expression (parser,
4764 /*allow_non_constant=*/false,
4766 /* Look for the closing `]'. */
4767 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
4769 /* Add this bound to the declarator. */
4770 declarator = build_nt (ARRAY_REF, declarator, expression);
4772 /* If the next token is not a `[', then there are no more
4774 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_SQUARE))
4781 /* Parse a new-initializer.
4784 ( expression-list [opt] )
4786 Returns a representation of the expression-list. If there is no
4787 expression-list, VOID_ZERO_NODE is returned. */
4790 cp_parser_new_initializer (cp_parser* parser)
4792 tree expression_list;
4794 expression_list = (cp_parser_parenthesized_expression_list
4795 (parser, false, /*non_constant_p=*/NULL));
4796 if (!expression_list)
4797 expression_list = void_zero_node;
4799 return expression_list;
4802 /* Parse a delete-expression.
4805 :: [opt] delete cast-expression
4806 :: [opt] delete [ ] cast-expression
4808 Returns a representation of the expression. */
4811 cp_parser_delete_expression (cp_parser* parser)
4813 bool global_scope_p;
4817 /* Look for the optional `::' operator. */
4819 = (cp_parser_global_scope_opt (parser,
4820 /*current_scope_valid_p=*/false)
4822 /* Look for the `delete' keyword. */
4823 cp_parser_require_keyword (parser, RID_DELETE, "`delete'");
4824 /* See if the array syntax is in use. */
4825 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
4827 /* Consume the `[' token. */
4828 cp_lexer_consume_token (parser->lexer);
4829 /* Look for the `]' token. */
4830 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
4831 /* Remember that this is the `[]' construct. */
4837 /* Parse the cast-expression. */
4838 expression = cp_parser_simple_cast_expression (parser);
4840 /* A delete-expression may not appear in an integral constant
4842 if (cp_parser_non_integral_constant_expression (parser, "`delete'"))
4843 return error_mark_node;
4845 return delete_sanity (expression, NULL_TREE, array_p, global_scope_p);
4848 /* Parse a cast-expression.
4852 ( type-id ) cast-expression
4854 Returns a representation of the expression. */
4857 cp_parser_cast_expression (cp_parser *parser, bool address_p)
4859 /* If it's a `(', then we might be looking at a cast. */
4860 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
4862 tree type = NULL_TREE;
4863 tree expr = NULL_TREE;
4864 bool compound_literal_p;
4865 const char *saved_message;
4867 /* There's no way to know yet whether or not this is a cast.
4868 For example, `(int (3))' is a unary-expression, while `(int)
4869 3' is a cast. So, we resort to parsing tentatively. */
4870 cp_parser_parse_tentatively (parser);
4871 /* Types may not be defined in a cast. */
4872 saved_message = parser->type_definition_forbidden_message;
4873 parser->type_definition_forbidden_message
4874 = "types may not be defined in casts";
4875 /* Consume the `('. */
4876 cp_lexer_consume_token (parser->lexer);
4877 /* A very tricky bit is that `(struct S) { 3 }' is a
4878 compound-literal (which we permit in C++ as an extension).
4879 But, that construct is not a cast-expression -- it is a
4880 postfix-expression. (The reason is that `(struct S) { 3 }.i'
4881 is legal; if the compound-literal were a cast-expression,
4882 you'd need an extra set of parentheses.) But, if we parse
4883 the type-id, and it happens to be a class-specifier, then we
4884 will commit to the parse at that point, because we cannot
4885 undo the action that is done when creating a new class. So,
4886 then we cannot back up and do a postfix-expression.
4888 Therefore, we scan ahead to the closing `)', and check to see
4889 if the token after the `)' is a `{'. If so, we are not
4890 looking at a cast-expression.
4892 Save tokens so that we can put them back. */
4893 cp_lexer_save_tokens (parser->lexer);
4894 /* Skip tokens until the next token is a closing parenthesis.
4895 If we find the closing `)', and the next token is a `{', then
4896 we are looking at a compound-literal. */
4898 = (cp_parser_skip_to_closing_parenthesis (parser, false, false,
4899 /*consume_paren=*/true)
4900 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE));
4901 /* Roll back the tokens we skipped. */
4902 cp_lexer_rollback_tokens (parser->lexer);
4903 /* If we were looking at a compound-literal, simulate an error
4904 so that the call to cp_parser_parse_definitely below will
4906 if (compound_literal_p)
4907 cp_parser_simulate_error (parser);
4910 bool saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
4911 parser->in_type_id_in_expr_p = true;
4912 /* Look for the type-id. */
4913 type = cp_parser_type_id (parser);
4914 /* Look for the closing `)'. */
4915 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
4916 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
4919 /* Restore the saved message. */
4920 parser->type_definition_forbidden_message = saved_message;
4922 /* If ok so far, parse the dependent expression. We cannot be
4923 sure it is a cast. Consider `(T ())'. It is a parenthesized
4924 ctor of T, but looks like a cast to function returning T
4925 without a dependent expression. */
4926 if (!cp_parser_error_occurred (parser))
4927 expr = cp_parser_simple_cast_expression (parser);
4929 if (cp_parser_parse_definitely (parser))
4931 /* Warn about old-style casts, if so requested. */
4932 if (warn_old_style_cast
4933 && !in_system_header
4934 && !VOID_TYPE_P (type)
4935 && current_lang_name != lang_name_c)
4936 warning ("use of old-style cast");
4938 /* Only type conversions to integral or enumeration types
4939 can be used in constant-expressions. */
4940 if (parser->integral_constant_expression_p
4941 && !dependent_type_p (type)
4942 && !INTEGRAL_OR_ENUMERATION_TYPE_P (type)
4943 && (cp_parser_non_integral_constant_expression
4945 "a cast to a type other than an integral or "
4946 "enumeration type")))
4947 return error_mark_node;
4949 /* Perform the cast. */
4950 expr = build_c_cast (type, expr);
4955 /* If we get here, then it's not a cast, so it must be a
4956 unary-expression. */
4957 return cp_parser_unary_expression (parser, address_p);
4960 /* Parse a pm-expression.
4964 pm-expression .* cast-expression
4965 pm-expression ->* cast-expression
4967 Returns a representation of the expression. */
4970 cp_parser_pm_expression (cp_parser* parser)
4972 static const cp_parser_token_tree_map map = {
4973 { CPP_DEREF_STAR, MEMBER_REF },
4974 { CPP_DOT_STAR, DOTSTAR_EXPR },
4975 { CPP_EOF, ERROR_MARK }
4978 return cp_parser_binary_expression (parser, map,
4979 cp_parser_simple_cast_expression);
4982 /* Parse a multiplicative-expression.
4984 multiplicative-expression:
4986 multiplicative-expression * pm-expression
4987 multiplicative-expression / pm-expression
4988 multiplicative-expression % pm-expression
4990 Returns a representation of the expression. */
4993 cp_parser_multiplicative_expression (cp_parser* parser)
4995 static const cp_parser_token_tree_map map = {
4996 { CPP_MULT, MULT_EXPR },
4997 { CPP_DIV, TRUNC_DIV_EXPR },
4998 { CPP_MOD, TRUNC_MOD_EXPR },
4999 { CPP_EOF, ERROR_MARK }
5002 return cp_parser_binary_expression (parser,
5004 cp_parser_pm_expression);
5007 /* Parse an additive-expression.
5009 additive-expression:
5010 multiplicative-expression
5011 additive-expression + multiplicative-expression
5012 additive-expression - multiplicative-expression
5014 Returns a representation of the expression. */
5017 cp_parser_additive_expression (cp_parser* parser)
5019 static const cp_parser_token_tree_map map = {
5020 { CPP_PLUS, PLUS_EXPR },
5021 { CPP_MINUS, MINUS_EXPR },
5022 { CPP_EOF, ERROR_MARK }
5025 return cp_parser_binary_expression (parser,
5027 cp_parser_multiplicative_expression);
5030 /* Parse a shift-expression.
5034 shift-expression << additive-expression
5035 shift-expression >> additive-expression
5037 Returns a representation of the expression. */
5040 cp_parser_shift_expression (cp_parser* parser)
5042 static const cp_parser_token_tree_map map = {
5043 { CPP_LSHIFT, LSHIFT_EXPR },
5044 { CPP_RSHIFT, RSHIFT_EXPR },
5045 { CPP_EOF, ERROR_MARK }
5048 return cp_parser_binary_expression (parser,
5050 cp_parser_additive_expression);
5053 /* Parse a relational-expression.
5055 relational-expression:
5057 relational-expression < shift-expression
5058 relational-expression > shift-expression
5059 relational-expression <= shift-expression
5060 relational-expression >= shift-expression
5064 relational-expression:
5065 relational-expression <? shift-expression
5066 relational-expression >? shift-expression
5068 Returns a representation of the expression. */
5071 cp_parser_relational_expression (cp_parser* parser)
5073 static const cp_parser_token_tree_map map = {
5074 { CPP_LESS, LT_EXPR },
5075 { CPP_GREATER, GT_EXPR },
5076 { CPP_LESS_EQ, LE_EXPR },
5077 { CPP_GREATER_EQ, GE_EXPR },
5078 { CPP_MIN, MIN_EXPR },
5079 { CPP_MAX, MAX_EXPR },
5080 { CPP_EOF, ERROR_MARK }
5083 return cp_parser_binary_expression (parser,
5085 cp_parser_shift_expression);
5088 /* Parse an equality-expression.
5090 equality-expression:
5091 relational-expression
5092 equality-expression == relational-expression
5093 equality-expression != relational-expression
5095 Returns a representation of the expression. */
5098 cp_parser_equality_expression (cp_parser* parser)
5100 static const cp_parser_token_tree_map map = {
5101 { CPP_EQ_EQ, EQ_EXPR },
5102 { CPP_NOT_EQ, NE_EXPR },
5103 { CPP_EOF, ERROR_MARK }
5106 return cp_parser_binary_expression (parser,
5108 cp_parser_relational_expression);
5111 /* Parse an and-expression.
5115 and-expression & equality-expression
5117 Returns a representation of the expression. */
5120 cp_parser_and_expression (cp_parser* parser)
5122 static const cp_parser_token_tree_map map = {
5123 { CPP_AND, BIT_AND_EXPR },
5124 { CPP_EOF, ERROR_MARK }
5127 return cp_parser_binary_expression (parser,
5129 cp_parser_equality_expression);
5132 /* Parse an exclusive-or-expression.
5134 exclusive-or-expression:
5136 exclusive-or-expression ^ and-expression
5138 Returns a representation of the expression. */
5141 cp_parser_exclusive_or_expression (cp_parser* parser)
5143 static const cp_parser_token_tree_map map = {
5144 { CPP_XOR, BIT_XOR_EXPR },
5145 { CPP_EOF, ERROR_MARK }
5148 return cp_parser_binary_expression (parser,
5150 cp_parser_and_expression);
5154 /* Parse an inclusive-or-expression.
5156 inclusive-or-expression:
5157 exclusive-or-expression
5158 inclusive-or-expression | exclusive-or-expression
5160 Returns a representation of the expression. */
5163 cp_parser_inclusive_or_expression (cp_parser* parser)
5165 static const cp_parser_token_tree_map map = {
5166 { CPP_OR, BIT_IOR_EXPR },
5167 { CPP_EOF, ERROR_MARK }
5170 return cp_parser_binary_expression (parser,
5172 cp_parser_exclusive_or_expression);
5175 /* Parse a logical-and-expression.
5177 logical-and-expression:
5178 inclusive-or-expression
5179 logical-and-expression && inclusive-or-expression
5181 Returns a representation of the expression. */
5184 cp_parser_logical_and_expression (cp_parser* parser)
5186 static const cp_parser_token_tree_map map = {
5187 { CPP_AND_AND, TRUTH_ANDIF_EXPR },
5188 { CPP_EOF, ERROR_MARK }
5191 return cp_parser_binary_expression (parser,
5193 cp_parser_inclusive_or_expression);
5196 /* Parse a logical-or-expression.
5198 logical-or-expression:
5199 logical-and-expression
5200 logical-or-expression || logical-and-expression
5202 Returns a representation of the expression. */
5205 cp_parser_logical_or_expression (cp_parser* parser)
5207 static const cp_parser_token_tree_map map = {
5208 { CPP_OR_OR, TRUTH_ORIF_EXPR },
5209 { CPP_EOF, ERROR_MARK }
5212 return cp_parser_binary_expression (parser,
5214 cp_parser_logical_and_expression);
5217 /* Parse the `? expression : assignment-expression' part of a
5218 conditional-expression. The LOGICAL_OR_EXPR is the
5219 logical-or-expression that started the conditional-expression.
5220 Returns a representation of the entire conditional-expression.
5222 This routine is used by cp_parser_assignment_expression.
5224 ? expression : assignment-expression
5228 ? : assignment-expression */
5231 cp_parser_question_colon_clause (cp_parser* parser, tree logical_or_expr)
5234 tree assignment_expr;
5236 /* Consume the `?' token. */
5237 cp_lexer_consume_token (parser->lexer);
5238 if (cp_parser_allow_gnu_extensions_p (parser)
5239 && cp_lexer_next_token_is (parser->lexer, CPP_COLON))
5240 /* Implicit true clause. */
5243 /* Parse the expression. */
5244 expr = cp_parser_expression (parser);
5246 /* The next token should be a `:'. */
5247 cp_parser_require (parser, CPP_COLON, "`:'");
5248 /* Parse the assignment-expression. */
5249 assignment_expr = cp_parser_assignment_expression (parser);
5251 /* Build the conditional-expression. */
5252 return build_x_conditional_expr (logical_or_expr,
5257 /* Parse an assignment-expression.
5259 assignment-expression:
5260 conditional-expression
5261 logical-or-expression assignment-operator assignment_expression
5264 Returns a representation for the expression. */
5267 cp_parser_assignment_expression (cp_parser* parser)
5271 /* If the next token is the `throw' keyword, then we're looking at
5272 a throw-expression. */
5273 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_THROW))
5274 expr = cp_parser_throw_expression (parser);
5275 /* Otherwise, it must be that we are looking at a
5276 logical-or-expression. */
5279 /* Parse the logical-or-expression. */
5280 expr = cp_parser_logical_or_expression (parser);
5281 /* If the next token is a `?' then we're actually looking at a
5282 conditional-expression. */
5283 if (cp_lexer_next_token_is (parser->lexer, CPP_QUERY))
5284 return cp_parser_question_colon_clause (parser, expr);
5287 enum tree_code assignment_operator;
5289 /* If it's an assignment-operator, we're using the second
5292 = cp_parser_assignment_operator_opt (parser);
5293 if (assignment_operator != ERROR_MARK)
5297 /* Parse the right-hand side of the assignment. */
5298 rhs = cp_parser_assignment_expression (parser);
5299 /* An assignment may not appear in a
5300 constant-expression. */
5301 if (cp_parser_non_integral_constant_expression (parser,
5303 return error_mark_node;
5304 /* Build the assignment expression. */
5305 expr = build_x_modify_expr (expr,
5306 assignment_operator,
5315 /* Parse an (optional) assignment-operator.
5317 assignment-operator: one of
5318 = *= /= %= += -= >>= <<= &= ^= |=
5322 assignment-operator: one of
5325 If the next token is an assignment operator, the corresponding tree
5326 code is returned, and the token is consumed. For example, for
5327 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
5328 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
5329 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
5330 operator, ERROR_MARK is returned. */
5332 static enum tree_code
5333 cp_parser_assignment_operator_opt (cp_parser* parser)
5338 /* Peek at the next toen. */
5339 token = cp_lexer_peek_token (parser->lexer);
5341 switch (token->type)
5352 op = TRUNC_DIV_EXPR;
5356 op = TRUNC_MOD_EXPR;
5396 /* Nothing else is an assignment operator. */
5400 /* If it was an assignment operator, consume it. */
5401 if (op != ERROR_MARK)
5402 cp_lexer_consume_token (parser->lexer);
5407 /* Parse an expression.
5410 assignment-expression
5411 expression , assignment-expression
5413 Returns a representation of the expression. */
5416 cp_parser_expression (cp_parser* parser)
5418 tree expression = NULL_TREE;
5422 tree assignment_expression;
5424 /* Parse the next assignment-expression. */
5425 assignment_expression
5426 = cp_parser_assignment_expression (parser);
5427 /* If this is the first assignment-expression, we can just
5430 expression = assignment_expression;
5432 expression = build_x_compound_expr (expression,
5433 assignment_expression);
5434 /* If the next token is not a comma, then we are done with the
5436 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
5438 /* Consume the `,'. */
5439 cp_lexer_consume_token (parser->lexer);
5440 /* A comma operator cannot appear in a constant-expression. */
5441 if (cp_parser_non_integral_constant_expression (parser,
5442 "a comma operator"))
5443 expression = error_mark_node;
5449 /* Parse a constant-expression.
5451 constant-expression:
5452 conditional-expression
5454 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
5455 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
5456 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
5457 is false, NON_CONSTANT_P should be NULL. */
5460 cp_parser_constant_expression (cp_parser* parser,
5461 bool allow_non_constant_p,
5462 bool *non_constant_p)
5464 bool saved_integral_constant_expression_p;
5465 bool saved_allow_non_integral_constant_expression_p;
5466 bool saved_non_integral_constant_expression_p;
5469 /* It might seem that we could simply parse the
5470 conditional-expression, and then check to see if it were
5471 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
5472 one that the compiler can figure out is constant, possibly after
5473 doing some simplifications or optimizations. The standard has a
5474 precise definition of constant-expression, and we must honor
5475 that, even though it is somewhat more restrictive.
5481 is not a legal declaration, because `(2, 3)' is not a
5482 constant-expression. The `,' operator is forbidden in a
5483 constant-expression. However, GCC's constant-folding machinery
5484 will fold this operation to an INTEGER_CST for `3'. */
5486 /* Save the old settings. */
5487 saved_integral_constant_expression_p = parser->integral_constant_expression_p;
5488 saved_allow_non_integral_constant_expression_p
5489 = parser->allow_non_integral_constant_expression_p;
5490 saved_non_integral_constant_expression_p = parser->non_integral_constant_expression_p;
5491 /* We are now parsing a constant-expression. */
5492 parser->integral_constant_expression_p = true;
5493 parser->allow_non_integral_constant_expression_p = allow_non_constant_p;
5494 parser->non_integral_constant_expression_p = false;
5495 /* Although the grammar says "conditional-expression", we parse an
5496 "assignment-expression", which also permits "throw-expression"
5497 and the use of assignment operators. In the case that
5498 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
5499 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
5500 actually essential that we look for an assignment-expression.
5501 For example, cp_parser_initializer_clauses uses this function to
5502 determine whether a particular assignment-expression is in fact
5504 expression = cp_parser_assignment_expression (parser);
5505 /* Restore the old settings. */
5506 parser->integral_constant_expression_p = saved_integral_constant_expression_p;
5507 parser->allow_non_integral_constant_expression_p
5508 = saved_allow_non_integral_constant_expression_p;
5509 if (allow_non_constant_p)
5510 *non_constant_p = parser->non_integral_constant_expression_p;
5511 parser->non_integral_constant_expression_p = saved_non_integral_constant_expression_p;
5516 /* Parse __builtin_offsetof.
5518 offsetof-expression:
5519 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
5521 offsetof-member-designator:
5523 | offsetof-member-designator "." id-expression
5524 | offsetof-member-designator "[" expression "]"
5528 cp_parser_builtin_offsetof (cp_parser *parser)
5530 int save_ice_p, save_non_ice_p;
5534 /* We're about to accept non-integral-constant things, but will
5535 definitely yield an integral constant expression. Save and
5536 restore these values around our local parsing. */
5537 save_ice_p = parser->integral_constant_expression_p;
5538 save_non_ice_p = parser->non_integral_constant_expression_p;
5540 /* Consume the "__builtin_offsetof" token. */
5541 cp_lexer_consume_token (parser->lexer);
5542 /* Consume the opening `('. */
5543 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
5544 /* Parse the type-id. */
5545 type = cp_parser_type_id (parser);
5546 /* Look for the `,'. */
5547 cp_parser_require (parser, CPP_COMMA, "`,'");
5549 /* Build the (type *)null that begins the traditional offsetof macro. */
5550 expr = build_static_cast (build_pointer_type (type), null_pointer_node);
5552 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
5553 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DEREF, expr,
5557 cp_token *token = cp_lexer_peek_token (parser->lexer);
5558 switch (token->type)
5560 case CPP_OPEN_SQUARE:
5561 /* offsetof-member-designator "[" expression "]" */
5562 expr = cp_parser_postfix_open_square_expression (parser, expr, true);
5566 /* offsetof-member-designator "." identifier */
5567 cp_lexer_consume_token (parser->lexer);
5568 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DOT, expr,
5572 case CPP_CLOSE_PAREN:
5573 /* Consume the ")" token. */
5574 cp_lexer_consume_token (parser->lexer);
5578 /* Error. We know the following require will fail, but
5579 that gives the proper error message. */
5580 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
5581 cp_parser_skip_to_closing_parenthesis (parser, true, false, true);
5582 expr = error_mark_node;
5588 /* We've finished the parsing, now finish with the semantics. At present
5589 we're just mirroring the traditional macro implementation. Better
5590 would be to do the lowering of the ADDR_EXPR to flat pointer arithmetic
5591 here rather than in build_x_unary_op. */
5592 expr = build_reinterpret_cast (build_reference_type (char_type_node), expr);
5593 expr = build_x_unary_op (ADDR_EXPR, expr);
5594 expr = build_reinterpret_cast (size_type_node, expr);
5597 parser->integral_constant_expression_p = save_ice_p;
5598 parser->non_integral_constant_expression_p = save_non_ice_p;
5603 /* Statements [gram.stmt.stmt] */
5605 /* Parse a statement.
5609 expression-statement
5614 declaration-statement
5618 cp_parser_statement (cp_parser* parser, bool in_statement_expr_p)
5622 location_t statement_locus;
5624 /* There is no statement yet. */
5625 statement = NULL_TREE;
5626 /* Peek at the next token. */
5627 token = cp_lexer_peek_token (parser->lexer);
5628 /* Remember the location of the first token in the statement. */
5629 statement_locus = token->location;
5630 /* If this is a keyword, then that will often determine what kind of
5631 statement we have. */
5632 if (token->type == CPP_KEYWORD)
5634 enum rid keyword = token->keyword;
5640 statement = cp_parser_labeled_statement (parser,
5641 in_statement_expr_p);
5646 statement = cp_parser_selection_statement (parser);
5652 statement = cp_parser_iteration_statement (parser);
5659 statement = cp_parser_jump_statement (parser);
5663 statement = cp_parser_try_block (parser);
5667 /* It might be a keyword like `int' that can start a
5668 declaration-statement. */
5672 else if (token->type == CPP_NAME)
5674 /* If the next token is a `:', then we are looking at a
5675 labeled-statement. */
5676 token = cp_lexer_peek_nth_token (parser->lexer, 2);
5677 if (token->type == CPP_COLON)
5678 statement = cp_parser_labeled_statement (parser, in_statement_expr_p);
5680 /* Anything that starts with a `{' must be a compound-statement. */
5681 else if (token->type == CPP_OPEN_BRACE)
5682 statement = cp_parser_compound_statement (parser, false);
5684 /* Everything else must be a declaration-statement or an
5685 expression-statement. Try for the declaration-statement
5686 first, unless we are looking at a `;', in which case we know that
5687 we have an expression-statement. */
5690 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
5692 cp_parser_parse_tentatively (parser);
5693 /* Try to parse the declaration-statement. */
5694 cp_parser_declaration_statement (parser);
5695 /* If that worked, we're done. */
5696 if (cp_parser_parse_definitely (parser))
5699 /* Look for an expression-statement instead. */
5700 statement = cp_parser_expression_statement (parser, in_statement_expr_p);
5703 /* Set the line number for the statement. */
5704 if (statement && STATEMENT_CODE_P (TREE_CODE (statement)))
5706 SET_EXPR_LOCUS (statement, NULL);
5707 annotate_with_locus (statement, statement_locus);
5711 /* Parse a labeled-statement.
5714 identifier : statement
5715 case constant-expression : statement
5721 case constant-expression ... constant-expression : statement
5723 Returns the new CASE_LABEL, for a `case' or `default' label. For
5724 an ordinary label, returns a LABEL_STMT. */
5727 cp_parser_labeled_statement (cp_parser* parser, bool in_statement_expr_p)
5730 tree statement = error_mark_node;
5732 /* The next token should be an identifier. */
5733 token = cp_lexer_peek_token (parser->lexer);
5734 if (token->type != CPP_NAME
5735 && token->type != CPP_KEYWORD)
5737 cp_parser_error (parser, "expected labeled-statement");
5738 return error_mark_node;
5741 switch (token->keyword)
5748 /* Consume the `case' token. */
5749 cp_lexer_consume_token (parser->lexer);
5750 /* Parse the constant-expression. */
5751 expr = cp_parser_constant_expression (parser,
5752 /*allow_non_constant_p=*/false,
5755 ellipsis = cp_lexer_peek_token (parser->lexer);
5756 if (ellipsis->type == CPP_ELLIPSIS)
5758 /* Consume the `...' token. */
5759 cp_lexer_consume_token (parser->lexer);
5761 cp_parser_constant_expression (parser,
5762 /*allow_non_constant_p=*/false,
5764 /* We don't need to emit warnings here, as the common code
5765 will do this for us. */
5768 expr_hi = NULL_TREE;
5770 if (!parser->in_switch_statement_p)
5771 error ("case label `%E' not within a switch statement", expr);
5773 statement = finish_case_label (expr, expr_hi);
5778 /* Consume the `default' token. */
5779 cp_lexer_consume_token (parser->lexer);
5780 if (!parser->in_switch_statement_p)
5781 error ("case label not within a switch statement");
5783 statement = finish_case_label (NULL_TREE, NULL_TREE);
5787 /* Anything else must be an ordinary label. */
5788 statement = finish_label_stmt (cp_parser_identifier (parser));
5792 /* Require the `:' token. */
5793 cp_parser_require (parser, CPP_COLON, "`:'");
5794 /* Parse the labeled statement. */
5795 cp_parser_statement (parser, in_statement_expr_p);
5797 /* Return the label, in the case of a `case' or `default' label. */
5801 /* Parse an expression-statement.
5803 expression-statement:
5806 Returns the new EXPR_STMT -- or NULL_TREE if the expression
5807 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
5808 indicates whether this expression-statement is part of an
5809 expression statement. */
5812 cp_parser_expression_statement (cp_parser* parser, bool in_statement_expr_p)
5814 tree statement = NULL_TREE;
5816 /* If the next token is a ';', then there is no expression
5818 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
5819 statement = cp_parser_expression (parser);
5821 /* Consume the final `;'. */
5822 cp_parser_consume_semicolon_at_end_of_statement (parser);
5824 if (in_statement_expr_p
5825 && cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
5827 /* This is the final expression statement of a statement
5829 statement = finish_stmt_expr_expr (statement);
5832 statement = finish_expr_stmt (statement);
5839 /* Parse a compound-statement.
5842 { statement-seq [opt] }
5844 Returns a COMPOUND_STMT representing the statement. */
5847 cp_parser_compound_statement (cp_parser *parser, bool in_statement_expr_p)
5851 /* Consume the `{'. */
5852 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "`{'"))
5853 return error_mark_node;
5854 /* Begin the compound-statement. */
5855 compound_stmt = begin_compound_stmt (/*has_no_scope=*/false);
5856 /* Parse an (optional) statement-seq. */
5857 cp_parser_statement_seq_opt (parser, in_statement_expr_p);
5858 /* Finish the compound-statement. */
5859 finish_compound_stmt (compound_stmt);
5860 /* Consume the `}'. */
5861 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
5863 return compound_stmt;
5866 /* Parse an (optional) statement-seq.
5870 statement-seq [opt] statement */
5873 cp_parser_statement_seq_opt (cp_parser* parser, bool in_statement_expr_p)
5875 /* Scan statements until there aren't any more. */
5878 /* If we're looking at a `}', then we've run out of statements. */
5879 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE)
5880 || cp_lexer_next_token_is (parser->lexer, CPP_EOF))
5883 /* Parse the statement. */
5884 cp_parser_statement (parser, in_statement_expr_p);
5888 /* Parse a selection-statement.
5890 selection-statement:
5891 if ( condition ) statement
5892 if ( condition ) statement else statement
5893 switch ( condition ) statement
5895 Returns the new IF_STMT or SWITCH_STMT. */
5898 cp_parser_selection_statement (cp_parser* parser)
5903 /* Peek at the next token. */
5904 token = cp_parser_require (parser, CPP_KEYWORD, "selection-statement");
5906 /* See what kind of keyword it is. */
5907 keyword = token->keyword;
5916 /* Look for the `('. */
5917 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
5919 cp_parser_skip_to_end_of_statement (parser);
5920 return error_mark_node;
5923 /* Begin the selection-statement. */
5924 if (keyword == RID_IF)
5925 statement = begin_if_stmt ();
5927 statement = begin_switch_stmt ();
5929 /* Parse the condition. */
5930 condition = cp_parser_condition (parser);
5931 /* Look for the `)'. */
5932 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
5933 cp_parser_skip_to_closing_parenthesis (parser, true, false,
5934 /*consume_paren=*/true);
5936 if (keyword == RID_IF)
5940 /* Add the condition. */
5941 finish_if_stmt_cond (condition, statement);
5943 /* Parse the then-clause. */
5944 then_stmt = cp_parser_implicitly_scoped_statement (parser);
5945 finish_then_clause (statement);
5947 /* If the next token is `else', parse the else-clause. */
5948 if (cp_lexer_next_token_is_keyword (parser->lexer,
5953 /* Consume the `else' keyword. */
5954 cp_lexer_consume_token (parser->lexer);
5955 /* Parse the else-clause. */
5957 = cp_parser_implicitly_scoped_statement (parser);
5958 finish_else_clause (statement);
5961 /* Now we're all done with the if-statement. */
5967 bool in_switch_statement_p;
5969 /* Add the condition. */
5970 finish_switch_cond (condition, statement);
5972 /* Parse the body of the switch-statement. */
5973 in_switch_statement_p = parser->in_switch_statement_p;
5974 parser->in_switch_statement_p = true;
5975 body = cp_parser_implicitly_scoped_statement (parser);
5976 parser->in_switch_statement_p = in_switch_statement_p;
5978 /* Now we're all done with the switch-statement. */
5979 finish_switch_stmt (statement);
5987 cp_parser_error (parser, "expected selection-statement");
5988 return error_mark_node;
5992 /* Parse a condition.
5996 type-specifier-seq declarator = assignment-expression
6001 type-specifier-seq declarator asm-specification [opt]
6002 attributes [opt] = assignment-expression
6004 Returns the expression that should be tested. */
6007 cp_parser_condition (cp_parser* parser)
6009 tree type_specifiers;
6010 const char *saved_message;
6012 /* Try the declaration first. */
6013 cp_parser_parse_tentatively (parser);
6014 /* New types are not allowed in the type-specifier-seq for a
6016 saved_message = parser->type_definition_forbidden_message;
6017 parser->type_definition_forbidden_message
6018 = "types may not be defined in conditions";
6019 /* Parse the type-specifier-seq. */
6020 type_specifiers = cp_parser_type_specifier_seq (parser);
6021 /* Restore the saved message. */
6022 parser->type_definition_forbidden_message = saved_message;
6023 /* If all is well, we might be looking at a declaration. */
6024 if (!cp_parser_error_occurred (parser))
6027 tree asm_specification;
6030 tree initializer = NULL_TREE;
6032 /* Parse the declarator. */
6033 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
6034 /*ctor_dtor_or_conv_p=*/NULL,
6035 /*parenthesized_p=*/NULL);
6036 /* Parse the attributes. */
6037 attributes = cp_parser_attributes_opt (parser);
6038 /* Parse the asm-specification. */
6039 asm_specification = cp_parser_asm_specification_opt (parser);
6040 /* If the next token is not an `=', then we might still be
6041 looking at an expression. For example:
6045 looks like a decl-specifier-seq and a declarator -- but then
6046 there is no `=', so this is an expression. */
6047 cp_parser_require (parser, CPP_EQ, "`='");
6048 /* If we did see an `=', then we are looking at a declaration
6050 if (cp_parser_parse_definitely (parser))
6052 /* Create the declaration. */
6053 decl = start_decl (declarator, type_specifiers,
6054 /*initialized_p=*/true,
6055 attributes, /*prefix_attributes=*/NULL_TREE);
6056 /* Parse the assignment-expression. */
6057 initializer = cp_parser_assignment_expression (parser);
6059 /* Process the initializer. */
6060 cp_finish_decl (decl,
6063 LOOKUP_ONLYCONVERTING);
6065 return convert_from_reference (decl);
6068 /* If we didn't even get past the declarator successfully, we are
6069 definitely not looking at a declaration. */
6071 cp_parser_abort_tentative_parse (parser);
6073 /* Otherwise, we are looking at an expression. */
6074 return cp_parser_expression (parser);
6077 /* Parse an iteration-statement.
6079 iteration-statement:
6080 while ( condition ) statement
6081 do statement while ( expression ) ;
6082 for ( for-init-statement condition [opt] ; expression [opt] )
6085 Returns the new WHILE_STMT, DO_STMT, or FOR_STMT. */
6088 cp_parser_iteration_statement (cp_parser* parser)
6093 bool in_iteration_statement_p;
6096 /* Peek at the next token. */
6097 token = cp_parser_require (parser, CPP_KEYWORD, "iteration-statement");
6099 return error_mark_node;
6101 /* Remember whether or not we are already within an iteration
6103 in_iteration_statement_p = parser->in_iteration_statement_p;
6105 /* See what kind of keyword it is. */
6106 keyword = token->keyword;
6113 /* Begin the while-statement. */
6114 statement = begin_while_stmt ();
6115 /* Look for the `('. */
6116 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6117 /* Parse the condition. */
6118 condition = cp_parser_condition (parser);
6119 finish_while_stmt_cond (condition, statement);
6120 /* Look for the `)'. */
6121 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6122 /* Parse the dependent statement. */
6123 parser->in_iteration_statement_p = true;
6124 cp_parser_already_scoped_statement (parser);
6125 parser->in_iteration_statement_p = in_iteration_statement_p;
6126 /* We're done with the while-statement. */
6127 finish_while_stmt (statement);
6135 /* Begin the do-statement. */
6136 statement = begin_do_stmt ();
6137 /* Parse the body of the do-statement. */
6138 parser->in_iteration_statement_p = true;
6139 cp_parser_implicitly_scoped_statement (parser);
6140 parser->in_iteration_statement_p = in_iteration_statement_p;
6141 finish_do_body (statement);
6142 /* Look for the `while' keyword. */
6143 cp_parser_require_keyword (parser, RID_WHILE, "`while'");
6144 /* Look for the `('. */
6145 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6146 /* Parse the expression. */
6147 expression = cp_parser_expression (parser);
6148 /* We're done with the do-statement. */
6149 finish_do_stmt (expression, statement);
6150 /* Look for the `)'. */
6151 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6152 /* Look for the `;'. */
6153 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6159 tree condition = NULL_TREE;
6160 tree expression = NULL_TREE;
6162 /* Begin the for-statement. */
6163 statement = begin_for_stmt ();
6164 /* Look for the `('. */
6165 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6166 /* Parse the initialization. */
6167 cp_parser_for_init_statement (parser);
6168 finish_for_init_stmt (statement);
6170 /* If there's a condition, process it. */
6171 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6172 condition = cp_parser_condition (parser);
6173 finish_for_cond (condition, statement);
6174 /* Look for the `;'. */
6175 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6177 /* If there's an expression, process it. */
6178 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
6179 expression = cp_parser_expression (parser);
6180 finish_for_expr (expression, statement);
6181 /* Look for the `)'. */
6182 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6184 /* Parse the body of the for-statement. */
6185 parser->in_iteration_statement_p = true;
6186 cp_parser_already_scoped_statement (parser);
6187 parser->in_iteration_statement_p = in_iteration_statement_p;
6189 /* We're done with the for-statement. */
6190 finish_for_stmt (statement);
6195 cp_parser_error (parser, "expected iteration-statement");
6196 statement = error_mark_node;
6203 /* Parse a for-init-statement.
6206 expression-statement
6207 simple-declaration */
6210 cp_parser_for_init_statement (cp_parser* parser)
6212 /* If the next token is a `;', then we have an empty
6213 expression-statement. Grammatically, this is also a
6214 simple-declaration, but an invalid one, because it does not
6215 declare anything. Therefore, if we did not handle this case
6216 specially, we would issue an error message about an invalid
6218 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6220 /* We're going to speculatively look for a declaration, falling back
6221 to an expression, if necessary. */
6222 cp_parser_parse_tentatively (parser);
6223 /* Parse the declaration. */
6224 cp_parser_simple_declaration (parser,
6225 /*function_definition_allowed_p=*/false);
6226 /* If the tentative parse failed, then we shall need to look for an
6227 expression-statement. */
6228 if (cp_parser_parse_definitely (parser))
6232 cp_parser_expression_statement (parser, false);
6235 /* Parse a jump-statement.
6240 return expression [opt] ;
6248 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_STMT, or
6252 cp_parser_jump_statement (cp_parser* parser)
6254 tree statement = error_mark_node;
6258 /* Peek at the next token. */
6259 token = cp_parser_require (parser, CPP_KEYWORD, "jump-statement");
6261 return error_mark_node;
6263 /* See what kind of keyword it is. */
6264 keyword = token->keyword;
6268 if (!parser->in_switch_statement_p
6269 && !parser->in_iteration_statement_p)
6271 error ("break statement not within loop or switch");
6272 statement = error_mark_node;
6275 statement = finish_break_stmt ();
6276 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6280 if (!parser->in_iteration_statement_p)
6282 error ("continue statement not within a loop");
6283 statement = error_mark_node;
6286 statement = finish_continue_stmt ();
6287 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6294 /* If the next token is a `;', then there is no
6296 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6297 expr = cp_parser_expression (parser);
6300 /* Build the return-statement. */
6301 statement = finish_return_stmt (expr);
6302 /* Look for the final `;'. */
6303 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6308 /* Create the goto-statement. */
6309 if (cp_lexer_next_token_is (parser->lexer, CPP_MULT))
6311 /* Issue a warning about this use of a GNU extension. */
6313 pedwarn ("ISO C++ forbids computed gotos");
6314 /* Consume the '*' token. */
6315 cp_lexer_consume_token (parser->lexer);
6316 /* Parse the dependent expression. */
6317 finish_goto_stmt (cp_parser_expression (parser));
6320 finish_goto_stmt (cp_parser_identifier (parser));
6321 /* Look for the final `;'. */
6322 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6326 cp_parser_error (parser, "expected jump-statement");
6333 /* Parse a declaration-statement.
6335 declaration-statement:
6336 block-declaration */
6339 cp_parser_declaration_statement (cp_parser* parser)
6341 /* Parse the block-declaration. */
6342 cp_parser_block_declaration (parser, /*statement_p=*/true);
6344 /* Finish off the statement. */
6348 /* Some dependent statements (like `if (cond) statement'), are
6349 implicitly in their own scope. In other words, if the statement is
6350 a single statement (as opposed to a compound-statement), it is
6351 none-the-less treated as if it were enclosed in braces. Any
6352 declarations appearing in the dependent statement are out of scope
6353 after control passes that point. This function parses a statement,
6354 but ensures that is in its own scope, even if it is not a
6357 Returns the new statement. */
6360 cp_parser_implicitly_scoped_statement (cp_parser* parser)
6364 /* If the token is not a `{', then we must take special action. */
6365 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
6367 /* Create a compound-statement. */
6368 statement = begin_compound_stmt (/*has_no_scope=*/false);
6369 /* Parse the dependent-statement. */
6370 cp_parser_statement (parser, false);
6371 /* Finish the dummy compound-statement. */
6372 finish_compound_stmt (statement);
6374 /* Otherwise, we simply parse the statement directly. */
6376 statement = cp_parser_compound_statement (parser, false);
6378 /* Return the statement. */
6382 /* For some dependent statements (like `while (cond) statement'), we
6383 have already created a scope. Therefore, even if the dependent
6384 statement is a compound-statement, we do not want to create another
6388 cp_parser_already_scoped_statement (cp_parser* parser)
6390 /* If the token is not a `{', then we must take special action. */
6391 if (cp_lexer_next_token_is_not(parser->lexer, CPP_OPEN_BRACE))
6395 /* Create a compound-statement. */
6396 statement = begin_compound_stmt (/*has_no_scope=*/true);
6397 /* Parse the dependent-statement. */
6398 cp_parser_statement (parser, false);
6399 /* Finish the dummy compound-statement. */
6400 finish_compound_stmt (statement);
6402 /* Otherwise, we simply parse the statement directly. */
6404 cp_parser_statement (parser, false);
6407 /* Declarations [gram.dcl.dcl] */
6409 /* Parse an optional declaration-sequence.
6413 declaration-seq declaration */
6416 cp_parser_declaration_seq_opt (cp_parser* parser)
6422 token = cp_lexer_peek_token (parser->lexer);
6424 if (token->type == CPP_CLOSE_BRACE
6425 || token->type == CPP_EOF)
6428 if (token->type == CPP_SEMICOLON)
6430 /* A declaration consisting of a single semicolon is
6431 invalid. Allow it unless we're being pedantic. */
6432 if (pedantic && !in_system_header)
6433 pedwarn ("extra `;'");
6434 cp_lexer_consume_token (parser->lexer);
6438 /* The C lexer modifies PENDING_LANG_CHANGE when it wants the
6439 parser to enter or exit implicit `extern "C"' blocks. */
6440 while (pending_lang_change > 0)
6442 push_lang_context (lang_name_c);
6443 --pending_lang_change;
6445 while (pending_lang_change < 0)
6447 pop_lang_context ();
6448 ++pending_lang_change;
6451 /* Parse the declaration itself. */
6452 cp_parser_declaration (parser);
6456 /* Parse a declaration.
6461 template-declaration
6462 explicit-instantiation
6463 explicit-specialization
6464 linkage-specification
6465 namespace-definition
6470 __extension__ declaration */
6473 cp_parser_declaration (cp_parser* parser)
6479 /* Set this here since we can be called after
6480 pushing the linkage specification. */
6481 c_lex_string_translate = 1;
6483 /* Check for the `__extension__' keyword. */
6484 if (cp_parser_extension_opt (parser, &saved_pedantic))
6486 /* Parse the qualified declaration. */
6487 cp_parser_declaration (parser);
6488 /* Restore the PEDANTIC flag. */
6489 pedantic = saved_pedantic;
6494 /* Try to figure out what kind of declaration is present. */
6495 token1 = *cp_lexer_peek_token (parser->lexer);
6497 /* Don't translate the CPP_STRING in extern "C". */
6498 if (token1.keyword == RID_EXTERN)
6499 c_lex_string_translate = 0;
6501 if (token1.type != CPP_EOF)
6502 token2 = *cp_lexer_peek_nth_token (parser->lexer, 2);
6504 c_lex_string_translate = 1;
6506 /* If the next token is `extern' and the following token is a string
6507 literal, then we have a linkage specification. */
6508 if (token1.keyword == RID_EXTERN
6509 && cp_parser_is_string_literal (&token2))
6510 cp_parser_linkage_specification (parser);
6511 /* If the next token is `template', then we have either a template
6512 declaration, an explicit instantiation, or an explicit
6514 else if (token1.keyword == RID_TEMPLATE)
6516 /* `template <>' indicates a template specialization. */
6517 if (token2.type == CPP_LESS
6518 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_GREATER)
6519 cp_parser_explicit_specialization (parser);
6520 /* `template <' indicates a template declaration. */
6521 else if (token2.type == CPP_LESS)
6522 cp_parser_template_declaration (parser, /*member_p=*/false);
6523 /* Anything else must be an explicit instantiation. */
6525 cp_parser_explicit_instantiation (parser);
6527 /* If the next token is `export', then we have a template
6529 else if (token1.keyword == RID_EXPORT)
6530 cp_parser_template_declaration (parser, /*member_p=*/false);
6531 /* If the next token is `extern', 'static' or 'inline' and the one
6532 after that is `template', we have a GNU extended explicit
6533 instantiation directive. */
6534 else if (cp_parser_allow_gnu_extensions_p (parser)
6535 && (token1.keyword == RID_EXTERN
6536 || token1.keyword == RID_STATIC
6537 || token1.keyword == RID_INLINE)
6538 && token2.keyword == RID_TEMPLATE)
6539 cp_parser_explicit_instantiation (parser);
6540 /* If the next token is `namespace', check for a named or unnamed
6541 namespace definition. */
6542 else if (token1.keyword == RID_NAMESPACE
6543 && (/* A named namespace definition. */
6544 (token2.type == CPP_NAME
6545 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
6547 /* An unnamed namespace definition. */
6548 || token2.type == CPP_OPEN_BRACE))
6549 cp_parser_namespace_definition (parser);
6550 /* We must have either a block declaration or a function
6553 /* Try to parse a block-declaration, or a function-definition. */
6554 cp_parser_block_declaration (parser, /*statement_p=*/false);
6557 /* Parse a block-declaration.
6562 namespace-alias-definition
6569 __extension__ block-declaration
6572 If STATEMENT_P is TRUE, then this block-declaration is occurring as
6573 part of a declaration-statement. */
6576 cp_parser_block_declaration (cp_parser *parser,
6582 /* Check for the `__extension__' keyword. */
6583 if (cp_parser_extension_opt (parser, &saved_pedantic))
6585 /* Parse the qualified declaration. */
6586 cp_parser_block_declaration (parser, statement_p);
6587 /* Restore the PEDANTIC flag. */
6588 pedantic = saved_pedantic;
6593 /* Peek at the next token to figure out which kind of declaration is
6595 token1 = cp_lexer_peek_token (parser->lexer);
6597 /* If the next keyword is `asm', we have an asm-definition. */
6598 if (token1->keyword == RID_ASM)
6601 cp_parser_commit_to_tentative_parse (parser);
6602 cp_parser_asm_definition (parser);
6604 /* If the next keyword is `namespace', we have a
6605 namespace-alias-definition. */
6606 else if (token1->keyword == RID_NAMESPACE)
6607 cp_parser_namespace_alias_definition (parser);
6608 /* If the next keyword is `using', we have either a
6609 using-declaration or a using-directive. */
6610 else if (token1->keyword == RID_USING)
6615 cp_parser_commit_to_tentative_parse (parser);
6616 /* If the token after `using' is `namespace', then we have a
6618 token2 = cp_lexer_peek_nth_token (parser->lexer, 2);
6619 if (token2->keyword == RID_NAMESPACE)
6620 cp_parser_using_directive (parser);
6621 /* Otherwise, it's a using-declaration. */
6623 cp_parser_using_declaration (parser);
6625 /* If the next keyword is `__label__' we have a label declaration. */
6626 else if (token1->keyword == RID_LABEL)
6629 cp_parser_commit_to_tentative_parse (parser);
6630 cp_parser_label_declaration (parser);
6632 /* Anything else must be a simple-declaration. */
6634 cp_parser_simple_declaration (parser, !statement_p);
6637 /* Parse a simple-declaration.
6640 decl-specifier-seq [opt] init-declarator-list [opt] ;
6642 init-declarator-list:
6644 init-declarator-list , init-declarator
6646 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
6647 function-definition as a simple-declaration. */
6650 cp_parser_simple_declaration (cp_parser* parser,
6651 bool function_definition_allowed_p)
6653 tree decl_specifiers;
6655 int declares_class_or_enum;
6656 bool saw_declarator;
6658 /* Defer access checks until we know what is being declared; the
6659 checks for names appearing in the decl-specifier-seq should be
6660 done as if we were in the scope of the thing being declared. */
6661 push_deferring_access_checks (dk_deferred);
6663 /* Parse the decl-specifier-seq. We have to keep track of whether
6664 or not the decl-specifier-seq declares a named class or
6665 enumeration type, since that is the only case in which the
6666 init-declarator-list is allowed to be empty.
6670 In a simple-declaration, the optional init-declarator-list can be
6671 omitted only when declaring a class or enumeration, that is when
6672 the decl-specifier-seq contains either a class-specifier, an
6673 elaborated-type-specifier, or an enum-specifier. */
6675 = cp_parser_decl_specifier_seq (parser,
6676 CP_PARSER_FLAGS_OPTIONAL,
6678 &declares_class_or_enum);
6679 /* We no longer need to defer access checks. */
6680 stop_deferring_access_checks ();
6682 /* In a block scope, a valid declaration must always have a
6683 decl-specifier-seq. By not trying to parse declarators, we can
6684 resolve the declaration/expression ambiguity more quickly. */
6685 if (!function_definition_allowed_p && !decl_specifiers)
6687 cp_parser_error (parser, "expected declaration");
6691 /* If the next two tokens are both identifiers, the code is
6692 erroneous. The usual cause of this situation is code like:
6696 where "T" should name a type -- but does not. */
6697 if (cp_parser_parse_and_diagnose_invalid_type_name (parser))
6699 /* If parsing tentatively, we should commit; we really are
6700 looking at a declaration. */
6701 cp_parser_commit_to_tentative_parse (parser);
6706 /* Keep going until we hit the `;' at the end of the simple
6708 saw_declarator = false;
6709 while (cp_lexer_next_token_is_not (parser->lexer,
6713 bool function_definition_p;
6716 saw_declarator = true;
6717 /* Parse the init-declarator. */
6718 decl = cp_parser_init_declarator (parser, decl_specifiers, attributes,
6719 function_definition_allowed_p,
6721 declares_class_or_enum,
6722 &function_definition_p);
6723 /* If an error occurred while parsing tentatively, exit quickly.
6724 (That usually happens when in the body of a function; each
6725 statement is treated as a declaration-statement until proven
6727 if (cp_parser_error_occurred (parser))
6729 /* Handle function definitions specially. */
6730 if (function_definition_p)
6732 /* If the next token is a `,', then we are probably
6733 processing something like:
6737 which is erroneous. */
6738 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
6739 error ("mixing declarations and function-definitions is forbidden");
6740 /* Otherwise, we're done with the list of declarators. */
6743 pop_deferring_access_checks ();
6747 /* The next token should be either a `,' or a `;'. */
6748 token = cp_lexer_peek_token (parser->lexer);
6749 /* If it's a `,', there are more declarators to come. */
6750 if (token->type == CPP_COMMA)
6751 cp_lexer_consume_token (parser->lexer);
6752 /* If it's a `;', we are done. */
6753 else if (token->type == CPP_SEMICOLON)
6755 /* Anything else is an error. */
6758 cp_parser_error (parser, "expected `,' or `;'");
6759 /* Skip tokens until we reach the end of the statement. */
6760 cp_parser_skip_to_end_of_statement (parser);
6761 /* If the next token is now a `;', consume it. */
6762 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
6763 cp_lexer_consume_token (parser->lexer);
6766 /* After the first time around, a function-definition is not
6767 allowed -- even if it was OK at first. For example:
6772 function_definition_allowed_p = false;
6775 /* Issue an error message if no declarators are present, and the
6776 decl-specifier-seq does not itself declare a class or
6778 if (!saw_declarator)
6780 if (cp_parser_declares_only_class_p (parser))
6781 shadow_tag (decl_specifiers);
6782 /* Perform any deferred access checks. */
6783 perform_deferred_access_checks ();
6786 /* Consume the `;'. */
6787 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6790 pop_deferring_access_checks ();
6793 /* Parse a decl-specifier-seq.
6796 decl-specifier-seq [opt] decl-specifier
6799 storage-class-specifier
6810 Returns a TREE_LIST, giving the decl-specifiers in the order they
6811 appear in the source code. The TREE_VALUE of each node is the
6812 decl-specifier. For a keyword (such as `auto' or `friend'), the
6813 TREE_VALUE is simply the corresponding TREE_IDENTIFIER. For the
6814 representation of a type-specifier, see cp_parser_type_specifier.
6816 If there are attributes, they will be stored in *ATTRIBUTES,
6817 represented as described above cp_parser_attributes.
6819 If FRIEND_IS_NOT_CLASS_P is non-NULL, and the `friend' specifier
6820 appears, and the entity that will be a friend is not going to be a
6821 class, then *FRIEND_IS_NOT_CLASS_P will be set to TRUE. Note that
6822 even if *FRIEND_IS_NOT_CLASS_P is FALSE, the entity to which
6823 friendship is granted might not be a class.
6825 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
6828 1: one of the decl-specifiers is an elaborated-type-specifier
6829 (i.e., a type declaration)
6830 2: one of the decl-specifiers is an enum-specifier or a
6831 class-specifier (i.e., a type definition)
6836 cp_parser_decl_specifier_seq (cp_parser* parser,
6837 cp_parser_flags flags,
6839 int* declares_class_or_enum)
6841 tree decl_specs = NULL_TREE;
6842 bool friend_p = false;
6843 bool constructor_possible_p = !parser->in_declarator_p;
6845 /* Assume no class or enumeration type is declared. */
6846 *declares_class_or_enum = 0;
6848 /* Assume there are no attributes. */
6849 *attributes = NULL_TREE;
6851 /* Keep reading specifiers until there are no more to read. */
6854 tree decl_spec = NULL_TREE;
6858 /* Peek at the next token. */
6859 token = cp_lexer_peek_token (parser->lexer);
6860 /* Handle attributes. */
6861 if (token->keyword == RID_ATTRIBUTE)
6863 /* Parse the attributes. */
6864 decl_spec = cp_parser_attributes_opt (parser);
6865 /* Add them to the list. */
6866 *attributes = chainon (*attributes, decl_spec);
6869 /* If the next token is an appropriate keyword, we can simply
6870 add it to the list. */
6871 switch (token->keyword)
6877 error ("duplicate `friend'");
6880 /* The representation of the specifier is simply the
6881 appropriate TREE_IDENTIFIER node. */
6882 decl_spec = token->value;
6883 /* Consume the token. */
6884 cp_lexer_consume_token (parser->lexer);
6887 /* function-specifier:
6894 decl_spec = cp_parser_function_specifier_opt (parser);
6900 /* The representation of the specifier is simply the
6901 appropriate TREE_IDENTIFIER node. */
6902 decl_spec = token->value;
6903 /* Consume the token. */
6904 cp_lexer_consume_token (parser->lexer);
6905 /* A constructor declarator cannot appear in a typedef. */
6906 constructor_possible_p = false;
6907 /* The "typedef" keyword can only occur in a declaration; we
6908 may as well commit at this point. */
6909 cp_parser_commit_to_tentative_parse (parser);
6912 /* storage-class-specifier:
6927 decl_spec = cp_parser_storage_class_specifier_opt (parser);
6934 /* Constructors are a special case. The `S' in `S()' is not a
6935 decl-specifier; it is the beginning of the declarator. */
6936 constructor_p = (!decl_spec
6937 && constructor_possible_p
6938 && cp_parser_constructor_declarator_p (parser,
6941 /* If we don't have a DECL_SPEC yet, then we must be looking at
6942 a type-specifier. */
6943 if (!decl_spec && !constructor_p)
6945 int decl_spec_declares_class_or_enum;
6946 bool is_cv_qualifier;
6949 = cp_parser_type_specifier (parser, flags,
6951 /*is_declaration=*/true,
6952 &decl_spec_declares_class_or_enum,
6955 *declares_class_or_enum |= decl_spec_declares_class_or_enum;
6957 /* If this type-specifier referenced a user-defined type
6958 (a typedef, class-name, etc.), then we can't allow any
6959 more such type-specifiers henceforth.
6963 The longest sequence of decl-specifiers that could
6964 possibly be a type name is taken as the
6965 decl-specifier-seq of a declaration. The sequence shall
6966 be self-consistent as described below.
6970 As a general rule, at most one type-specifier is allowed
6971 in the complete decl-specifier-seq of a declaration. The
6972 only exceptions are the following:
6974 -- const or volatile can be combined with any other
6977 -- signed or unsigned can be combined with char, long,
6985 void g (const int Pc);
6987 Here, Pc is *not* part of the decl-specifier seq; it's
6988 the declarator. Therefore, once we see a type-specifier
6989 (other than a cv-qualifier), we forbid any additional
6990 user-defined types. We *do* still allow things like `int
6991 int' to be considered a decl-specifier-seq, and issue the
6992 error message later. */
6993 if (decl_spec && !is_cv_qualifier)
6994 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
6995 /* A constructor declarator cannot follow a type-specifier. */
6997 constructor_possible_p = false;
7000 /* If we still do not have a DECL_SPEC, then there are no more
7004 /* Issue an error message, unless the entire construct was
7006 if (!(flags & CP_PARSER_FLAGS_OPTIONAL))
7008 cp_parser_error (parser, "expected decl specifier");
7009 return error_mark_node;
7015 /* Add the DECL_SPEC to the list of specifiers. */
7016 if (decl_specs == NULL || TREE_VALUE (decl_specs) != error_mark_node)
7017 decl_specs = tree_cons (NULL_TREE, decl_spec, decl_specs);
7019 /* After we see one decl-specifier, further decl-specifiers are
7021 flags |= CP_PARSER_FLAGS_OPTIONAL;
7024 /* Don't allow a friend specifier with a class definition. */
7025 if (friend_p && (*declares_class_or_enum & 2))
7026 error ("class definition may not be declared a friend");
7028 /* We have built up the DECL_SPECS in reverse order. Return them in
7029 the correct order. */
7030 return nreverse (decl_specs);
7033 /* Parse an (optional) storage-class-specifier.
7035 storage-class-specifier:
7044 storage-class-specifier:
7047 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
7050 cp_parser_storage_class_specifier_opt (cp_parser* parser)
7052 switch (cp_lexer_peek_token (parser->lexer)->keyword)
7060 /* Consume the token. */
7061 return cp_lexer_consume_token (parser->lexer)->value;
7068 /* Parse an (optional) function-specifier.
7075 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
7078 cp_parser_function_specifier_opt (cp_parser* parser)
7080 switch (cp_lexer_peek_token (parser->lexer)->keyword)
7085 /* Consume the token. */
7086 return cp_lexer_consume_token (parser->lexer)->value;
7093 /* Parse a linkage-specification.
7095 linkage-specification:
7096 extern string-literal { declaration-seq [opt] }
7097 extern string-literal declaration */
7100 cp_parser_linkage_specification (cp_parser* parser)
7105 /* Look for the `extern' keyword. */
7106 cp_parser_require_keyword (parser, RID_EXTERN, "`extern'");
7108 /* Peek at the next token. */
7109 token = cp_lexer_peek_token (parser->lexer);
7110 /* If it's not a string-literal, then there's a problem. */
7111 if (!cp_parser_is_string_literal (token))
7113 cp_parser_error (parser, "expected language-name");
7116 /* Consume the token. */
7117 cp_lexer_consume_token (parser->lexer);
7119 /* Transform the literal into an identifier. If the literal is a
7120 wide-character string, or contains embedded NULs, then we can't
7121 handle it as the user wants. */
7122 if (token->type == CPP_WSTRING
7123 || (strlen (TREE_STRING_POINTER (token->value))
7124 != (size_t) (TREE_STRING_LENGTH (token->value) - 1)))
7126 cp_parser_error (parser, "invalid linkage-specification");
7127 /* Assume C++ linkage. */
7128 linkage = get_identifier ("c++");
7130 /* If the string is chained to another string, take the latter,
7131 that's the untranslated string. */
7132 else if (TREE_CHAIN (token->value))
7133 linkage = get_identifier (TREE_STRING_POINTER (TREE_CHAIN (token->value)));
7134 /* If it's a simple string constant, things are easier. */
7136 linkage = get_identifier (TREE_STRING_POINTER (token->value));
7138 /* We're now using the new linkage. */
7139 push_lang_context (linkage);
7141 /* If the next token is a `{', then we're using the first
7143 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
7145 /* Consume the `{' token. */
7146 cp_lexer_consume_token (parser->lexer);
7147 /* Parse the declarations. */
7148 cp_parser_declaration_seq_opt (parser);
7149 /* Look for the closing `}'. */
7150 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
7152 /* Otherwise, there's just one declaration. */
7155 bool saved_in_unbraced_linkage_specification_p;
7157 saved_in_unbraced_linkage_specification_p
7158 = parser->in_unbraced_linkage_specification_p;
7159 parser->in_unbraced_linkage_specification_p = true;
7160 have_extern_spec = true;
7161 cp_parser_declaration (parser);
7162 have_extern_spec = false;
7163 parser->in_unbraced_linkage_specification_p
7164 = saved_in_unbraced_linkage_specification_p;
7167 /* We're done with the linkage-specification. */
7168 pop_lang_context ();
7171 /* Special member functions [gram.special] */
7173 /* Parse a conversion-function-id.
7175 conversion-function-id:
7176 operator conversion-type-id
7178 Returns an IDENTIFIER_NODE representing the operator. */
7181 cp_parser_conversion_function_id (cp_parser* parser)
7185 tree saved_qualifying_scope;
7186 tree saved_object_scope;
7189 /* Look for the `operator' token. */
7190 if (!cp_parser_require_keyword (parser, RID_OPERATOR, "`operator'"))
7191 return error_mark_node;
7192 /* When we parse the conversion-type-id, the current scope will be
7193 reset. However, we need that information in able to look up the
7194 conversion function later, so we save it here. */
7195 saved_scope = parser->scope;
7196 saved_qualifying_scope = parser->qualifying_scope;
7197 saved_object_scope = parser->object_scope;
7198 /* We must enter the scope of the class so that the names of
7199 entities declared within the class are available in the
7200 conversion-type-id. For example, consider:
7207 S::operator I() { ... }
7209 In order to see that `I' is a type-name in the definition, we
7210 must be in the scope of `S'. */
7212 pop_p = push_scope (saved_scope);
7213 /* Parse the conversion-type-id. */
7214 type = cp_parser_conversion_type_id (parser);
7215 /* Leave the scope of the class, if any. */
7217 pop_scope (saved_scope);
7218 /* Restore the saved scope. */
7219 parser->scope = saved_scope;
7220 parser->qualifying_scope = saved_qualifying_scope;
7221 parser->object_scope = saved_object_scope;
7222 /* If the TYPE is invalid, indicate failure. */
7223 if (type == error_mark_node)
7224 return error_mark_node;
7225 return mangle_conv_op_name_for_type (type);
7228 /* Parse a conversion-type-id:
7231 type-specifier-seq conversion-declarator [opt]
7233 Returns the TYPE specified. */
7236 cp_parser_conversion_type_id (cp_parser* parser)
7239 tree type_specifiers;
7242 /* Parse the attributes. */
7243 attributes = cp_parser_attributes_opt (parser);
7244 /* Parse the type-specifiers. */
7245 type_specifiers = cp_parser_type_specifier_seq (parser);
7246 /* If that didn't work, stop. */
7247 if (type_specifiers == error_mark_node)
7248 return error_mark_node;
7249 /* Parse the conversion-declarator. */
7250 declarator = cp_parser_conversion_declarator_opt (parser);
7252 return grokdeclarator (declarator, type_specifiers, TYPENAME,
7253 /*initialized=*/0, &attributes);
7256 /* Parse an (optional) conversion-declarator.
7258 conversion-declarator:
7259 ptr-operator conversion-declarator [opt]
7261 Returns a representation of the declarator. See
7262 cp_parser_declarator for details. */
7265 cp_parser_conversion_declarator_opt (cp_parser* parser)
7267 enum tree_code code;
7269 tree cv_qualifier_seq;
7271 /* We don't know if there's a ptr-operator next, or not. */
7272 cp_parser_parse_tentatively (parser);
7273 /* Try the ptr-operator. */
7274 code = cp_parser_ptr_operator (parser, &class_type,
7276 /* If it worked, look for more conversion-declarators. */
7277 if (cp_parser_parse_definitely (parser))
7281 /* Parse another optional declarator. */
7282 declarator = cp_parser_conversion_declarator_opt (parser);
7284 /* Create the representation of the declarator. */
7285 if (code == INDIRECT_REF)
7286 declarator = make_pointer_declarator (cv_qualifier_seq,
7289 declarator = make_reference_declarator (cv_qualifier_seq,
7292 /* Handle the pointer-to-member case. */
7294 declarator = build_nt (SCOPE_REF, class_type, declarator);
7302 /* Parse an (optional) ctor-initializer.
7305 : mem-initializer-list
7307 Returns TRUE iff the ctor-initializer was actually present. */
7310 cp_parser_ctor_initializer_opt (cp_parser* parser)
7312 /* If the next token is not a `:', then there is no
7313 ctor-initializer. */
7314 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
7316 /* Do default initialization of any bases and members. */
7317 if (DECL_CONSTRUCTOR_P (current_function_decl))
7318 finish_mem_initializers (NULL_TREE);
7323 /* Consume the `:' token. */
7324 cp_lexer_consume_token (parser->lexer);
7325 /* And the mem-initializer-list. */
7326 cp_parser_mem_initializer_list (parser);
7331 /* Parse a mem-initializer-list.
7333 mem-initializer-list:
7335 mem-initializer , mem-initializer-list */
7338 cp_parser_mem_initializer_list (cp_parser* parser)
7340 tree mem_initializer_list = NULL_TREE;
7342 /* Let the semantic analysis code know that we are starting the
7343 mem-initializer-list. */
7344 if (!DECL_CONSTRUCTOR_P (current_function_decl))
7345 error ("only constructors take base initializers");
7347 /* Loop through the list. */
7350 tree mem_initializer;
7352 /* Parse the mem-initializer. */
7353 mem_initializer = cp_parser_mem_initializer (parser);
7354 /* Add it to the list, unless it was erroneous. */
7355 if (mem_initializer)
7357 TREE_CHAIN (mem_initializer) = mem_initializer_list;
7358 mem_initializer_list = mem_initializer;
7360 /* If the next token is not a `,', we're done. */
7361 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
7363 /* Consume the `,' token. */
7364 cp_lexer_consume_token (parser->lexer);
7367 /* Perform semantic analysis. */
7368 if (DECL_CONSTRUCTOR_P (current_function_decl))
7369 finish_mem_initializers (mem_initializer_list);
7372 /* Parse a mem-initializer.
7375 mem-initializer-id ( expression-list [opt] )
7380 ( expression-list [opt] )
7382 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
7383 class) or FIELD_DECL (for a non-static data member) to initialize;
7384 the TREE_VALUE is the expression-list. */
7387 cp_parser_mem_initializer (cp_parser* parser)
7389 tree mem_initializer_id;
7390 tree expression_list;
7393 /* Find out what is being initialized. */
7394 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
7396 pedwarn ("anachronistic old-style base class initializer");
7397 mem_initializer_id = NULL_TREE;
7400 mem_initializer_id = cp_parser_mem_initializer_id (parser);
7401 member = expand_member_init (mem_initializer_id);
7402 if (member && !DECL_P (member))
7403 in_base_initializer = 1;
7406 = cp_parser_parenthesized_expression_list (parser, false,
7407 /*non_constant_p=*/NULL);
7408 if (!expression_list)
7409 expression_list = void_type_node;
7411 in_base_initializer = 0;
7413 return member ? build_tree_list (member, expression_list) : NULL_TREE;
7416 /* Parse a mem-initializer-id.
7419 :: [opt] nested-name-specifier [opt] class-name
7422 Returns a TYPE indicating the class to be initializer for the first
7423 production. Returns an IDENTIFIER_NODE indicating the data member
7424 to be initialized for the second production. */
7427 cp_parser_mem_initializer_id (cp_parser* parser)
7429 bool global_scope_p;
7430 bool nested_name_specifier_p;
7431 bool template_p = false;
7434 /* `typename' is not allowed in this context ([temp.res]). */
7435 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
7437 error ("keyword `typename' not allowed in this context (a qualified "
7438 "member initializer is implicitly a type)");
7439 cp_lexer_consume_token (parser->lexer);
7441 /* Look for the optional `::' operator. */
7443 = (cp_parser_global_scope_opt (parser,
7444 /*current_scope_valid_p=*/false)
7446 /* Look for the optional nested-name-specifier. The simplest way to
7451 The keyword `typename' is not permitted in a base-specifier or
7452 mem-initializer; in these contexts a qualified name that
7453 depends on a template-parameter is implicitly assumed to be a
7456 is to assume that we have seen the `typename' keyword at this
7458 nested_name_specifier_p
7459 = (cp_parser_nested_name_specifier_opt (parser,
7460 /*typename_keyword_p=*/true,
7461 /*check_dependency_p=*/true,
7463 /*is_declaration=*/true)
7465 if (nested_name_specifier_p)
7466 template_p = cp_parser_optional_template_keyword (parser);
7467 /* If there is a `::' operator or a nested-name-specifier, then we
7468 are definitely looking for a class-name. */
7469 if (global_scope_p || nested_name_specifier_p)
7470 return cp_parser_class_name (parser,
7471 /*typename_keyword_p=*/true,
7472 /*template_keyword_p=*/template_p,
7474 /*check_dependency_p=*/true,
7475 /*class_head_p=*/false,
7476 /*is_declaration=*/true);
7477 /* Otherwise, we could also be looking for an ordinary identifier. */
7478 cp_parser_parse_tentatively (parser);
7479 /* Try a class-name. */
7480 id = cp_parser_class_name (parser,
7481 /*typename_keyword_p=*/true,
7482 /*template_keyword_p=*/false,
7484 /*check_dependency_p=*/true,
7485 /*class_head_p=*/false,
7486 /*is_declaration=*/true);
7487 /* If we found one, we're done. */
7488 if (cp_parser_parse_definitely (parser))
7490 /* Otherwise, look for an ordinary identifier. */
7491 return cp_parser_identifier (parser);
7494 /* Overloading [gram.over] */
7496 /* Parse an operator-function-id.
7498 operator-function-id:
7501 Returns an IDENTIFIER_NODE for the operator which is a
7502 human-readable spelling of the identifier, e.g., `operator +'. */
7505 cp_parser_operator_function_id (cp_parser* parser)
7507 /* Look for the `operator' keyword. */
7508 if (!cp_parser_require_keyword (parser, RID_OPERATOR, "`operator'"))
7509 return error_mark_node;
7510 /* And then the name of the operator itself. */
7511 return cp_parser_operator (parser);
7514 /* Parse an operator.
7517 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
7518 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
7519 || ++ -- , ->* -> () []
7526 Returns an IDENTIFIER_NODE for the operator which is a
7527 human-readable spelling of the identifier, e.g., `operator +'. */
7530 cp_parser_operator (cp_parser* parser)
7532 tree id = NULL_TREE;
7535 /* Peek at the next token. */
7536 token = cp_lexer_peek_token (parser->lexer);
7537 /* Figure out which operator we have. */
7538 switch (token->type)
7544 /* The keyword should be either `new' or `delete'. */
7545 if (token->keyword == RID_NEW)
7547 else if (token->keyword == RID_DELETE)
7552 /* Consume the `new' or `delete' token. */
7553 cp_lexer_consume_token (parser->lexer);
7555 /* Peek at the next token. */
7556 token = cp_lexer_peek_token (parser->lexer);
7557 /* If it's a `[' token then this is the array variant of the
7559 if (token->type == CPP_OPEN_SQUARE)
7561 /* Consume the `[' token. */
7562 cp_lexer_consume_token (parser->lexer);
7563 /* Look for the `]' token. */
7564 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
7565 id = ansi_opname (op == NEW_EXPR
7566 ? VEC_NEW_EXPR : VEC_DELETE_EXPR);
7568 /* Otherwise, we have the non-array variant. */
7570 id = ansi_opname (op);
7576 id = ansi_opname (PLUS_EXPR);
7580 id = ansi_opname (MINUS_EXPR);
7584 id = ansi_opname (MULT_EXPR);
7588 id = ansi_opname (TRUNC_DIV_EXPR);
7592 id = ansi_opname (TRUNC_MOD_EXPR);
7596 id = ansi_opname (BIT_XOR_EXPR);
7600 id = ansi_opname (BIT_AND_EXPR);
7604 id = ansi_opname (BIT_IOR_EXPR);
7608 id = ansi_opname (BIT_NOT_EXPR);
7612 id = ansi_opname (TRUTH_NOT_EXPR);
7616 id = ansi_assopname (NOP_EXPR);
7620 id = ansi_opname (LT_EXPR);
7624 id = ansi_opname (GT_EXPR);
7628 id = ansi_assopname (PLUS_EXPR);
7632 id = ansi_assopname (MINUS_EXPR);
7636 id = ansi_assopname (MULT_EXPR);
7640 id = ansi_assopname (TRUNC_DIV_EXPR);
7644 id = ansi_assopname (TRUNC_MOD_EXPR);
7648 id = ansi_assopname (BIT_XOR_EXPR);
7652 id = ansi_assopname (BIT_AND_EXPR);
7656 id = ansi_assopname (BIT_IOR_EXPR);
7660 id = ansi_opname (LSHIFT_EXPR);
7664 id = ansi_opname (RSHIFT_EXPR);
7668 id = ansi_assopname (LSHIFT_EXPR);
7672 id = ansi_assopname (RSHIFT_EXPR);
7676 id = ansi_opname (EQ_EXPR);
7680 id = ansi_opname (NE_EXPR);
7684 id = ansi_opname (LE_EXPR);
7687 case CPP_GREATER_EQ:
7688 id = ansi_opname (GE_EXPR);
7692 id = ansi_opname (TRUTH_ANDIF_EXPR);
7696 id = ansi_opname (TRUTH_ORIF_EXPR);
7700 id = ansi_opname (POSTINCREMENT_EXPR);
7703 case CPP_MINUS_MINUS:
7704 id = ansi_opname (PREDECREMENT_EXPR);
7708 id = ansi_opname (COMPOUND_EXPR);
7711 case CPP_DEREF_STAR:
7712 id = ansi_opname (MEMBER_REF);
7716 id = ansi_opname (COMPONENT_REF);
7719 case CPP_OPEN_PAREN:
7720 /* Consume the `('. */
7721 cp_lexer_consume_token (parser->lexer);
7722 /* Look for the matching `)'. */
7723 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
7724 return ansi_opname (CALL_EXPR);
7726 case CPP_OPEN_SQUARE:
7727 /* Consume the `['. */
7728 cp_lexer_consume_token (parser->lexer);
7729 /* Look for the matching `]'. */
7730 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
7731 return ansi_opname (ARRAY_REF);
7735 id = ansi_opname (MIN_EXPR);
7739 id = ansi_opname (MAX_EXPR);
7743 id = ansi_assopname (MIN_EXPR);
7747 id = ansi_assopname (MAX_EXPR);
7751 /* Anything else is an error. */
7755 /* If we have selected an identifier, we need to consume the
7758 cp_lexer_consume_token (parser->lexer);
7759 /* Otherwise, no valid operator name was present. */
7762 cp_parser_error (parser, "expected operator");
7763 id = error_mark_node;
7769 /* Parse a template-declaration.
7771 template-declaration:
7772 export [opt] template < template-parameter-list > declaration
7774 If MEMBER_P is TRUE, this template-declaration occurs within a
7777 The grammar rule given by the standard isn't correct. What
7780 template-declaration:
7781 export [opt] template-parameter-list-seq
7782 decl-specifier-seq [opt] init-declarator [opt] ;
7783 export [opt] template-parameter-list-seq
7786 template-parameter-list-seq:
7787 template-parameter-list-seq [opt]
7788 template < template-parameter-list > */
7791 cp_parser_template_declaration (cp_parser* parser, bool member_p)
7793 /* Check for `export'. */
7794 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXPORT))
7796 /* Consume the `export' token. */
7797 cp_lexer_consume_token (parser->lexer);
7798 /* Warn that we do not support `export'. */
7799 warning ("keyword `export' not implemented, and will be ignored");
7802 cp_parser_template_declaration_after_export (parser, member_p);
7805 /* Parse a template-parameter-list.
7807 template-parameter-list:
7809 template-parameter-list , template-parameter
7811 Returns a TREE_LIST. Each node represents a template parameter.
7812 The nodes are connected via their TREE_CHAINs. */
7815 cp_parser_template_parameter_list (cp_parser* parser)
7817 tree parameter_list = NULL_TREE;
7824 /* Parse the template-parameter. */
7825 parameter = cp_parser_template_parameter (parser);
7826 /* Add it to the list. */
7827 parameter_list = process_template_parm (parameter_list,
7830 /* Peek at the next token. */
7831 token = cp_lexer_peek_token (parser->lexer);
7832 /* If it's not a `,', we're done. */
7833 if (token->type != CPP_COMMA)
7835 /* Otherwise, consume the `,' token. */
7836 cp_lexer_consume_token (parser->lexer);
7839 return parameter_list;
7842 /* Parse a template-parameter.
7846 parameter-declaration
7848 Returns a TREE_LIST. The TREE_VALUE represents the parameter. The
7849 TREE_PURPOSE is the default value, if any. */
7852 cp_parser_template_parameter (cp_parser* parser)
7856 /* Peek at the next token. */
7857 token = cp_lexer_peek_token (parser->lexer);
7858 /* If it is `class' or `template', we have a type-parameter. */
7859 if (token->keyword == RID_TEMPLATE)
7860 return cp_parser_type_parameter (parser);
7861 /* If it is `class' or `typename' we do not know yet whether it is a
7862 type parameter or a non-type parameter. Consider:
7864 template <typename T, typename T::X X> ...
7868 template <class C, class D*> ...
7870 Here, the first parameter is a type parameter, and the second is
7871 a non-type parameter. We can tell by looking at the token after
7872 the identifier -- if it is a `,', `=', or `>' then we have a type
7874 if (token->keyword == RID_TYPENAME || token->keyword == RID_CLASS)
7876 /* Peek at the token after `class' or `typename'. */
7877 token = cp_lexer_peek_nth_token (parser->lexer, 2);
7878 /* If it's an identifier, skip it. */
7879 if (token->type == CPP_NAME)
7880 token = cp_lexer_peek_nth_token (parser->lexer, 3);
7881 /* Now, see if the token looks like the end of a template
7883 if (token->type == CPP_COMMA
7884 || token->type == CPP_EQ
7885 || token->type == CPP_GREATER)
7886 return cp_parser_type_parameter (parser);
7889 /* Otherwise, it is a non-type parameter.
7893 When parsing a default template-argument for a non-type
7894 template-parameter, the first non-nested `>' is taken as the end
7895 of the template parameter-list rather than a greater-than
7898 cp_parser_parameter_declaration (parser, /*template_parm_p=*/true,
7899 /*parenthesized_p=*/NULL);
7902 /* Parse a type-parameter.
7905 class identifier [opt]
7906 class identifier [opt] = type-id
7907 typename identifier [opt]
7908 typename identifier [opt] = type-id
7909 template < template-parameter-list > class identifier [opt]
7910 template < template-parameter-list > class identifier [opt]
7913 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
7914 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
7915 the declaration of the parameter. */
7918 cp_parser_type_parameter (cp_parser* parser)
7923 /* Look for a keyword to tell us what kind of parameter this is. */
7924 token = cp_parser_require (parser, CPP_KEYWORD,
7925 "`class', `typename', or `template'");
7927 return error_mark_node;
7929 switch (token->keyword)
7935 tree default_argument;
7937 /* If the next token is an identifier, then it names the
7939 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
7940 identifier = cp_parser_identifier (parser);
7942 identifier = NULL_TREE;
7944 /* Create the parameter. */
7945 parameter = finish_template_type_parm (class_type_node, identifier);
7947 /* If the next token is an `=', we have a default argument. */
7948 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
7950 /* Consume the `=' token. */
7951 cp_lexer_consume_token (parser->lexer);
7952 /* Parse the default-argument. */
7953 default_argument = cp_parser_type_id (parser);
7956 default_argument = NULL_TREE;
7958 /* Create the combined representation of the parameter and the
7959 default argument. */
7960 parameter = build_tree_list (default_argument, parameter);
7966 tree parameter_list;
7968 tree default_argument;
7970 /* Look for the `<'. */
7971 cp_parser_require (parser, CPP_LESS, "`<'");
7972 /* Parse the template-parameter-list. */
7973 begin_template_parm_list ();
7975 = cp_parser_template_parameter_list (parser);
7976 parameter_list = end_template_parm_list (parameter_list);
7977 /* Look for the `>'. */
7978 cp_parser_require (parser, CPP_GREATER, "`>'");
7979 /* Look for the `class' keyword. */
7980 cp_parser_require_keyword (parser, RID_CLASS, "`class'");
7981 /* If the next token is an `=', then there is a
7982 default-argument. If the next token is a `>', we are at
7983 the end of the parameter-list. If the next token is a `,',
7984 then we are at the end of this parameter. */
7985 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ)
7986 && cp_lexer_next_token_is_not (parser->lexer, CPP_GREATER)
7987 && cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
7988 identifier = cp_parser_identifier (parser);
7990 identifier = NULL_TREE;
7991 /* Create the template parameter. */
7992 parameter = finish_template_template_parm (class_type_node,
7995 /* If the next token is an `=', then there is a
7996 default-argument. */
7997 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
8001 /* Consume the `='. */
8002 cp_lexer_consume_token (parser->lexer);
8003 /* Parse the id-expression. */
8005 = cp_parser_id_expression (parser,
8006 /*template_keyword_p=*/false,
8007 /*check_dependency_p=*/true,
8008 /*template_p=*/&is_template,
8009 /*declarator_p=*/false);
8010 if (TREE_CODE (default_argument) == TYPE_DECL)
8011 /* If the id-expression was a template-id that refers to
8012 a template-class, we already have the declaration here,
8013 so no further lookup is needed. */
8016 /* Look up the name. */
8018 = cp_parser_lookup_name (parser, default_argument,
8020 /*is_template=*/is_template,
8021 /*is_namespace=*/false,
8022 /*check_dependency=*/true);
8023 /* See if the default argument is valid. */
8025 = check_template_template_default_arg (default_argument);
8028 default_argument = NULL_TREE;
8030 /* Create the combined representation of the parameter and the
8031 default argument. */
8032 parameter = build_tree_list (default_argument, parameter);
8037 /* Anything else is an error. */
8038 cp_parser_error (parser,
8039 "expected `class', `typename', or `template'");
8040 parameter = error_mark_node;
8046 /* Parse a template-id.
8049 template-name < template-argument-list [opt] >
8051 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
8052 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
8053 returned. Otherwise, if the template-name names a function, or set
8054 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
8055 names a class, returns a TYPE_DECL for the specialization.
8057 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
8058 uninstantiated templates. */
8061 cp_parser_template_id (cp_parser *parser,
8062 bool template_keyword_p,
8063 bool check_dependency_p,
8064 bool is_declaration)
8069 ptrdiff_t start_of_id;
8070 tree access_check = NULL_TREE;
8071 cp_token *next_token, *next_token_2;
8074 /* If the next token corresponds to a template-id, there is no need
8076 next_token = cp_lexer_peek_token (parser->lexer);
8077 if (next_token->type == CPP_TEMPLATE_ID)
8082 /* Get the stored value. */
8083 value = cp_lexer_consume_token (parser->lexer)->value;
8084 /* Perform any access checks that were deferred. */
8085 for (check = TREE_PURPOSE (value); check; check = TREE_CHAIN (check))
8086 perform_or_defer_access_check (TREE_PURPOSE (check),
8087 TREE_VALUE (check));
8088 /* Return the stored value. */
8089 return TREE_VALUE (value);
8092 /* Avoid performing name lookup if there is no possibility of
8093 finding a template-id. */
8094 if ((next_token->type != CPP_NAME && next_token->keyword != RID_OPERATOR)
8095 || (next_token->type == CPP_NAME
8096 && !cp_parser_nth_token_starts_template_argument_list_p
8099 cp_parser_error (parser, "expected template-id");
8100 return error_mark_node;
8103 /* Remember where the template-id starts. */
8104 if (cp_parser_parsing_tentatively (parser)
8105 && !cp_parser_committed_to_tentative_parse (parser))
8107 next_token = cp_lexer_peek_token (parser->lexer);
8108 start_of_id = cp_lexer_token_difference (parser->lexer,
8109 parser->lexer->first_token,
8115 push_deferring_access_checks (dk_deferred);
8117 /* Parse the template-name. */
8118 is_identifier = false;
8119 template = cp_parser_template_name (parser, template_keyword_p,
8123 if (template == error_mark_node || is_identifier)
8125 pop_deferring_access_checks ();
8129 /* If we find the sequence `[:' after a template-name, it's probably
8130 a digraph-typo for `< ::'. Substitute the tokens and check if we can
8131 parse correctly the argument list. */
8132 next_token = cp_lexer_peek_nth_token (parser->lexer, 1);
8133 next_token_2 = cp_lexer_peek_nth_token (parser->lexer, 2);
8134 if (next_token->type == CPP_OPEN_SQUARE
8135 && next_token->flags & DIGRAPH
8136 && next_token_2->type == CPP_COLON
8137 && !(next_token_2->flags & PREV_WHITE))
8139 cp_parser_parse_tentatively (parser);
8140 /* Change `:' into `::'. */
8141 next_token_2->type = CPP_SCOPE;
8142 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
8144 cp_lexer_consume_token (parser->lexer);
8145 /* Parse the arguments. */
8146 arguments = cp_parser_enclosed_template_argument_list (parser);
8147 if (!cp_parser_parse_definitely (parser))
8149 /* If we couldn't parse an argument list, then we revert our changes
8150 and return simply an error. Maybe this is not a template-id
8152 next_token_2->type = CPP_COLON;
8153 cp_parser_error (parser, "expected `<'");
8154 pop_deferring_access_checks ();
8155 return error_mark_node;
8157 /* Otherwise, emit an error about the invalid digraph, but continue
8158 parsing because we got our argument list. */
8159 pedwarn ("`<::' cannot begin a template-argument list");
8160 inform ("`<:' is an alternate spelling for `['. Insert whitespace "
8161 "between `<' and `::'");
8162 if (!flag_permissive)
8167 inform ("(if you use `-fpermissive' G++ will accept your code)");
8174 /* Look for the `<' that starts the template-argument-list. */
8175 if (!cp_parser_require (parser, CPP_LESS, "`<'"))
8177 pop_deferring_access_checks ();
8178 return error_mark_node;
8180 /* Parse the arguments. */
8181 arguments = cp_parser_enclosed_template_argument_list (parser);
8184 /* Build a representation of the specialization. */
8185 if (TREE_CODE (template) == IDENTIFIER_NODE)
8186 template_id = build_min_nt (TEMPLATE_ID_EXPR, template, arguments);
8187 else if (DECL_CLASS_TEMPLATE_P (template)
8188 || DECL_TEMPLATE_TEMPLATE_PARM_P (template))
8190 = finish_template_type (template, arguments,
8191 cp_lexer_next_token_is (parser->lexer,
8195 /* If it's not a class-template or a template-template, it should be
8196 a function-template. */
8197 my_friendly_assert ((DECL_FUNCTION_TEMPLATE_P (template)
8198 || TREE_CODE (template) == OVERLOAD
8199 || BASELINK_P (template)),
8202 template_id = lookup_template_function (template, arguments);
8205 /* Retrieve any deferred checks. Do not pop this access checks yet
8206 so the memory will not be reclaimed during token replacing below. */
8207 access_check = get_deferred_access_checks ();
8209 /* If parsing tentatively, replace the sequence of tokens that makes
8210 up the template-id with a CPP_TEMPLATE_ID token. That way,
8211 should we re-parse the token stream, we will not have to repeat
8212 the effort required to do the parse, nor will we issue duplicate
8213 error messages about problems during instantiation of the
8215 if (start_of_id >= 0)
8219 /* Find the token that corresponds to the start of the
8221 token = cp_lexer_advance_token (parser->lexer,
8222 parser->lexer->first_token,
8225 /* Reset the contents of the START_OF_ID token. */
8226 token->type = CPP_TEMPLATE_ID;
8227 token->value = build_tree_list (access_check, template_id);
8228 token->keyword = RID_MAX;
8229 /* Purge all subsequent tokens. */
8230 cp_lexer_purge_tokens_after (parser->lexer, token);
8233 pop_deferring_access_checks ();
8237 /* Parse a template-name.
8242 The standard should actually say:
8246 operator-function-id
8248 A defect report has been filed about this issue.
8250 A conversion-function-id cannot be a template name because they cannot
8251 be part of a template-id. In fact, looking at this code:
8255 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
8256 It is impossible to call a templated conversion-function-id with an
8257 explicit argument list, since the only allowed template parameter is
8258 the type to which it is converting.
8260 If TEMPLATE_KEYWORD_P is true, then we have just seen the
8261 `template' keyword, in a construction like:
8265 In that case `f' is taken to be a template-name, even though there
8266 is no way of knowing for sure.
8268 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
8269 name refers to a set of overloaded functions, at least one of which
8270 is a template, or an IDENTIFIER_NODE with the name of the template,
8271 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
8272 names are looked up inside uninstantiated templates. */
8275 cp_parser_template_name (cp_parser* parser,
8276 bool template_keyword_p,
8277 bool check_dependency_p,
8278 bool is_declaration,
8279 bool *is_identifier)
8285 /* If the next token is `operator', then we have either an
8286 operator-function-id or a conversion-function-id. */
8287 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_OPERATOR))
8289 /* We don't know whether we're looking at an
8290 operator-function-id or a conversion-function-id. */
8291 cp_parser_parse_tentatively (parser);
8292 /* Try an operator-function-id. */
8293 identifier = cp_parser_operator_function_id (parser);
8294 /* If that didn't work, try a conversion-function-id. */
8295 if (!cp_parser_parse_definitely (parser))
8297 cp_parser_error (parser, "expected template-name");
8298 return error_mark_node;
8301 /* Look for the identifier. */
8303 identifier = cp_parser_identifier (parser);
8305 /* If we didn't find an identifier, we don't have a template-id. */
8306 if (identifier == error_mark_node)
8307 return error_mark_node;
8309 /* If the name immediately followed the `template' keyword, then it
8310 is a template-name. However, if the next token is not `<', then
8311 we do not treat it as a template-name, since it is not being used
8312 as part of a template-id. This enables us to handle constructs
8315 template <typename T> struct S { S(); };
8316 template <typename T> S<T>::S();
8318 correctly. We would treat `S' as a template -- if it were `S<T>'
8319 -- but we do not if there is no `<'. */
8321 if (processing_template_decl
8322 && cp_parser_nth_token_starts_template_argument_list_p (parser, 1))
8324 /* In a declaration, in a dependent context, we pretend that the
8325 "template" keyword was present in order to improve error
8326 recovery. For example, given:
8328 template <typename T> void f(T::X<int>);
8330 we want to treat "X<int>" as a template-id. */
8332 && !template_keyword_p
8333 && parser->scope && TYPE_P (parser->scope)
8334 && dependent_type_p (parser->scope)
8335 /* Do not do this for dtors (or ctors), since they never
8336 need the template keyword before their name. */
8337 && !constructor_name_p (identifier, parser->scope))
8341 /* Explain what went wrong. */
8342 error ("non-template `%D' used as template", identifier);
8343 inform ("use `%T::template %D' to indicate that it is a template",
8344 parser->scope, identifier);
8345 /* If parsing tentatively, find the location of the "<"
8347 if (cp_parser_parsing_tentatively (parser)
8348 && !cp_parser_committed_to_tentative_parse (parser))
8350 cp_parser_simulate_error (parser);
8351 token = cp_lexer_peek_token (parser->lexer);
8352 token = cp_lexer_prev_token (parser->lexer, token);
8353 start = cp_lexer_token_difference (parser->lexer,
8354 parser->lexer->first_token,
8359 /* Parse the template arguments so that we can issue error
8360 messages about them. */
8361 cp_lexer_consume_token (parser->lexer);
8362 cp_parser_enclosed_template_argument_list (parser);
8363 /* Skip tokens until we find a good place from which to
8364 continue parsing. */
8365 cp_parser_skip_to_closing_parenthesis (parser,
8366 /*recovering=*/true,
8368 /*consume_paren=*/false);
8369 /* If parsing tentatively, permanently remove the
8370 template argument list. That will prevent duplicate
8371 error messages from being issued about the missing
8372 "template" keyword. */
8375 token = cp_lexer_advance_token (parser->lexer,
8376 parser->lexer->first_token,
8378 cp_lexer_purge_tokens_after (parser->lexer, token);
8381 *is_identifier = true;
8385 /* If the "template" keyword is present, then there is generally
8386 no point in doing name-lookup, so we just return IDENTIFIER.
8387 But, if the qualifying scope is non-dependent then we can
8388 (and must) do name-lookup normally. */
8389 if (template_keyword_p
8391 || (TYPE_P (parser->scope)
8392 && dependent_type_p (parser->scope))))
8396 /* Look up the name. */
8397 decl = cp_parser_lookup_name (parser, identifier,
8399 /*is_template=*/false,
8400 /*is_namespace=*/false,
8401 check_dependency_p);
8402 decl = maybe_get_template_decl_from_type_decl (decl);
8404 /* If DECL is a template, then the name was a template-name. */
8405 if (TREE_CODE (decl) == TEMPLATE_DECL)
8409 /* The standard does not explicitly indicate whether a name that
8410 names a set of overloaded declarations, some of which are
8411 templates, is a template-name. However, such a name should
8412 be a template-name; otherwise, there is no way to form a
8413 template-id for the overloaded templates. */
8414 fns = BASELINK_P (decl) ? BASELINK_FUNCTIONS (decl) : decl;
8415 if (TREE_CODE (fns) == OVERLOAD)
8419 for (fn = fns; fn; fn = OVL_NEXT (fn))
8420 if (TREE_CODE (OVL_CURRENT (fn)) == TEMPLATE_DECL)
8425 /* Otherwise, the name does not name a template. */
8426 cp_parser_error (parser, "expected template-name");
8427 return error_mark_node;
8431 /* If DECL is dependent, and refers to a function, then just return
8432 its name; we will look it up again during template instantiation. */
8433 if (DECL_FUNCTION_TEMPLATE_P (decl) || !DECL_P (decl))
8435 tree scope = CP_DECL_CONTEXT (get_first_fn (decl));
8436 if (TYPE_P (scope) && dependent_type_p (scope))
8443 /* Parse a template-argument-list.
8445 template-argument-list:
8447 template-argument-list , template-argument
8449 Returns a TREE_VEC containing the arguments. */
8452 cp_parser_template_argument_list (cp_parser* parser)
8454 tree fixed_args[10];
8455 unsigned n_args = 0;
8456 unsigned alloced = 10;
8457 tree *arg_ary = fixed_args;
8459 bool saved_in_template_argument_list_p;
8461 saved_in_template_argument_list_p = parser->in_template_argument_list_p;
8462 parser->in_template_argument_list_p = true;
8468 /* Consume the comma. */
8469 cp_lexer_consume_token (parser->lexer);
8471 /* Parse the template-argument. */
8472 argument = cp_parser_template_argument (parser);
8473 if (n_args == alloced)
8477 if (arg_ary == fixed_args)
8479 arg_ary = xmalloc (sizeof (tree) * alloced);
8480 memcpy (arg_ary, fixed_args, sizeof (tree) * n_args);
8483 arg_ary = xrealloc (arg_ary, sizeof (tree) * alloced);
8485 arg_ary[n_args++] = argument;
8487 while (cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
8489 vec = make_tree_vec (n_args);
8492 TREE_VEC_ELT (vec, n_args) = arg_ary[n_args];
8494 if (arg_ary != fixed_args)
8496 parser->in_template_argument_list_p = saved_in_template_argument_list_p;
8500 /* Parse a template-argument.
8503 assignment-expression
8507 The representation is that of an assignment-expression, type-id, or
8508 id-expression -- except that the qualified id-expression is
8509 evaluated, so that the value returned is either a DECL or an
8512 Although the standard says "assignment-expression", it forbids
8513 throw-expressions or assignments in the template argument.
8514 Therefore, we use "conditional-expression" instead. */
8517 cp_parser_template_argument (cp_parser* parser)
8522 bool maybe_type_id = false;
8525 tree qualifying_class;
8527 /* There's really no way to know what we're looking at, so we just
8528 try each alternative in order.
8532 In a template-argument, an ambiguity between a type-id and an
8533 expression is resolved to a type-id, regardless of the form of
8534 the corresponding template-parameter.
8536 Therefore, we try a type-id first. */
8537 cp_parser_parse_tentatively (parser);
8538 argument = cp_parser_type_id (parser);
8539 /* If there was no error parsing the type-id but the next token is a '>>',
8540 we probably found a typo for '> >'. But there are type-id which are
8541 also valid expressions. For instance:
8543 struct X { int operator >> (int); };
8544 template <int V> struct Foo {};
8547 Here 'X()' is a valid type-id of a function type, but the user just
8548 wanted to write the expression "X() >> 5". Thus, we remember that we
8549 found a valid type-id, but we still try to parse the argument as an
8550 expression to see what happens. */
8551 if (!cp_parser_error_occurred (parser)
8552 && cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
8554 maybe_type_id = true;
8555 cp_parser_abort_tentative_parse (parser);
8559 /* If the next token isn't a `,' or a `>', then this argument wasn't
8560 really finished. This means that the argument is not a valid
8562 if (!cp_parser_next_token_ends_template_argument_p (parser))
8563 cp_parser_error (parser, "expected template-argument");
8564 /* If that worked, we're done. */
8565 if (cp_parser_parse_definitely (parser))
8568 /* We're still not sure what the argument will be. */
8569 cp_parser_parse_tentatively (parser);
8570 /* Try a template. */
8571 argument = cp_parser_id_expression (parser,
8572 /*template_keyword_p=*/false,
8573 /*check_dependency_p=*/true,
8575 /*declarator_p=*/false);
8576 /* If the next token isn't a `,' or a `>', then this argument wasn't
8578 if (!cp_parser_next_token_ends_template_argument_p (parser))
8579 cp_parser_error (parser, "expected template-argument");
8580 if (!cp_parser_error_occurred (parser))
8582 /* Figure out what is being referred to. If the id-expression
8583 was for a class template specialization, then we will have a
8584 TYPE_DECL at this point. There is no need to do name lookup
8585 at this point in that case. */
8586 if (TREE_CODE (argument) != TYPE_DECL)
8587 argument = cp_parser_lookup_name (parser, argument,
8589 /*is_template=*/template_p,
8590 /*is_namespace=*/false,
8591 /*check_dependency=*/true);
8592 if (TREE_CODE (argument) != TEMPLATE_DECL
8593 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
8594 cp_parser_error (parser, "expected template-name");
8596 if (cp_parser_parse_definitely (parser))
8598 /* It must be a non-type argument. There permitted cases are given
8599 in [temp.arg.nontype]:
8601 -- an integral constant-expression of integral or enumeration
8604 -- the name of a non-type template-parameter; or
8606 -- the name of an object or function with external linkage...
8608 -- the address of an object or function with external linkage...
8610 -- a pointer to member... */
8611 /* Look for a non-type template parameter. */
8612 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
8614 cp_parser_parse_tentatively (parser);
8615 argument = cp_parser_primary_expression (parser,
8618 if (TREE_CODE (argument) != TEMPLATE_PARM_INDEX
8619 || !cp_parser_next_token_ends_template_argument_p (parser))
8620 cp_parser_simulate_error (parser);
8621 if (cp_parser_parse_definitely (parser))
8624 /* If the next token is "&", the argument must be the address of an
8625 object or function with external linkage. */
8626 address_p = cp_lexer_next_token_is (parser->lexer, CPP_AND);
8628 cp_lexer_consume_token (parser->lexer);
8629 /* See if we might have an id-expression. */
8630 token = cp_lexer_peek_token (parser->lexer);
8631 if (token->type == CPP_NAME
8632 || token->keyword == RID_OPERATOR
8633 || token->type == CPP_SCOPE
8634 || token->type == CPP_TEMPLATE_ID
8635 || token->type == CPP_NESTED_NAME_SPECIFIER)
8637 cp_parser_parse_tentatively (parser);
8638 argument = cp_parser_primary_expression (parser,
8641 if (cp_parser_error_occurred (parser)
8642 || !cp_parser_next_token_ends_template_argument_p (parser))
8643 cp_parser_abort_tentative_parse (parser);
8646 if (qualifying_class)
8647 argument = finish_qualified_id_expr (qualifying_class,
8651 if (TREE_CODE (argument) == VAR_DECL)
8653 /* A variable without external linkage might still be a
8654 valid constant-expression, so no error is issued here
8655 if the external-linkage check fails. */
8656 if (!DECL_EXTERNAL_LINKAGE_P (argument))
8657 cp_parser_simulate_error (parser);
8659 else if (is_overloaded_fn (argument))
8660 /* All overloaded functions are allowed; if the external
8661 linkage test does not pass, an error will be issued
8665 && (TREE_CODE (argument) == OFFSET_REF
8666 || TREE_CODE (argument) == SCOPE_REF))
8667 /* A pointer-to-member. */
8670 cp_parser_simulate_error (parser);
8672 if (cp_parser_parse_definitely (parser))
8675 argument = build_x_unary_op (ADDR_EXPR, argument);
8680 /* If the argument started with "&", there are no other valid
8681 alternatives at this point. */
8684 cp_parser_error (parser, "invalid non-type template argument");
8685 return error_mark_node;
8687 /* If the argument wasn't successfully parsed as a type-id followed
8688 by '>>', the argument can only be a constant expression now.
8689 Otherwise, we try parsing the constant-expression tentatively,
8690 because the argument could really be a type-id. */
8692 cp_parser_parse_tentatively (parser);
8693 argument = cp_parser_constant_expression (parser,
8694 /*allow_non_constant_p=*/false,
8695 /*non_constant_p=*/NULL);
8696 argument = fold_non_dependent_expr (argument);
8699 if (!cp_parser_next_token_ends_template_argument_p (parser))
8700 cp_parser_error (parser, "expected template-argument");
8701 if (cp_parser_parse_definitely (parser))
8703 /* We did our best to parse the argument as a non type-id, but that
8704 was the only alternative that matched (albeit with a '>' after
8705 it). We can assume it's just a typo from the user, and a
8706 diagnostic will then be issued. */
8707 return cp_parser_type_id (parser);
8710 /* Parse an explicit-instantiation.
8712 explicit-instantiation:
8713 template declaration
8715 Although the standard says `declaration', what it really means is:
8717 explicit-instantiation:
8718 template decl-specifier-seq [opt] declarator [opt] ;
8720 Things like `template int S<int>::i = 5, int S<double>::j;' are not
8721 supposed to be allowed. A defect report has been filed about this
8726 explicit-instantiation:
8727 storage-class-specifier template
8728 decl-specifier-seq [opt] declarator [opt] ;
8729 function-specifier template
8730 decl-specifier-seq [opt] declarator [opt] ; */
8733 cp_parser_explicit_instantiation (cp_parser* parser)
8735 int declares_class_or_enum;
8736 tree decl_specifiers;
8738 tree extension_specifier = NULL_TREE;
8740 /* Look for an (optional) storage-class-specifier or
8741 function-specifier. */
8742 if (cp_parser_allow_gnu_extensions_p (parser))
8745 = cp_parser_storage_class_specifier_opt (parser);
8746 if (!extension_specifier)
8747 extension_specifier = cp_parser_function_specifier_opt (parser);
8750 /* Look for the `template' keyword. */
8751 cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'");
8752 /* Let the front end know that we are processing an explicit
8754 begin_explicit_instantiation ();
8755 /* [temp.explicit] says that we are supposed to ignore access
8756 control while processing explicit instantiation directives. */
8757 push_deferring_access_checks (dk_no_check);
8758 /* Parse a decl-specifier-seq. */
8760 = cp_parser_decl_specifier_seq (parser,
8761 CP_PARSER_FLAGS_OPTIONAL,
8763 &declares_class_or_enum);
8764 /* If there was exactly one decl-specifier, and it declared a class,
8765 and there's no declarator, then we have an explicit type
8767 if (declares_class_or_enum && cp_parser_declares_only_class_p (parser))
8771 type = check_tag_decl (decl_specifiers);
8772 /* Turn access control back on for names used during
8773 template instantiation. */
8774 pop_deferring_access_checks ();
8776 do_type_instantiation (type, extension_specifier, /*complain=*/1);
8783 /* Parse the declarator. */
8785 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
8786 /*ctor_dtor_or_conv_p=*/NULL,
8787 /*parenthesized_p=*/NULL);
8788 cp_parser_check_for_definition_in_return_type (declarator,
8789 declares_class_or_enum);
8790 if (declarator != error_mark_node)
8792 decl = grokdeclarator (declarator, decl_specifiers,
8794 /* Turn access control back on for names used during
8795 template instantiation. */
8796 pop_deferring_access_checks ();
8797 /* Do the explicit instantiation. */
8798 do_decl_instantiation (decl, extension_specifier);
8802 pop_deferring_access_checks ();
8803 /* Skip the body of the explicit instantiation. */
8804 cp_parser_skip_to_end_of_statement (parser);
8807 /* We're done with the instantiation. */
8808 end_explicit_instantiation ();
8810 cp_parser_consume_semicolon_at_end_of_statement (parser);
8813 /* Parse an explicit-specialization.
8815 explicit-specialization:
8816 template < > declaration
8818 Although the standard says `declaration', what it really means is:
8820 explicit-specialization:
8821 template <> decl-specifier [opt] init-declarator [opt] ;
8822 template <> function-definition
8823 template <> explicit-specialization
8824 template <> template-declaration */
8827 cp_parser_explicit_specialization (cp_parser* parser)
8829 /* Look for the `template' keyword. */
8830 cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'");
8831 /* Look for the `<'. */
8832 cp_parser_require (parser, CPP_LESS, "`<'");
8833 /* Look for the `>'. */
8834 cp_parser_require (parser, CPP_GREATER, "`>'");
8835 /* We have processed another parameter list. */
8836 ++parser->num_template_parameter_lists;
8837 /* Let the front end know that we are beginning a specialization. */
8838 begin_specialization ();
8840 /* If the next keyword is `template', we need to figure out whether
8841 or not we're looking a template-declaration. */
8842 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
8844 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
8845 && cp_lexer_peek_nth_token (parser->lexer, 3)->type != CPP_GREATER)
8846 cp_parser_template_declaration_after_export (parser,
8847 /*member_p=*/false);
8849 cp_parser_explicit_specialization (parser);
8852 /* Parse the dependent declaration. */
8853 cp_parser_single_declaration (parser,
8857 /* We're done with the specialization. */
8858 end_specialization ();
8859 /* We're done with this parameter list. */
8860 --parser->num_template_parameter_lists;
8863 /* Parse a type-specifier.
8866 simple-type-specifier
8869 elaborated-type-specifier
8877 Returns a representation of the type-specifier. If the
8878 type-specifier is a keyword (like `int' or `const', or
8879 `__complex__') then the corresponding IDENTIFIER_NODE is returned.
8880 For a class-specifier, enum-specifier, or elaborated-type-specifier
8881 a TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
8883 If IS_FRIEND is TRUE then this type-specifier is being declared a
8884 `friend'. If IS_DECLARATION is TRUE, then this type-specifier is
8885 appearing in a decl-specifier-seq.
8887 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
8888 class-specifier, enum-specifier, or elaborated-type-specifier, then
8889 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
8890 if a type is declared; 2 if it is defined. Otherwise, it is set to
8893 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
8894 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
8898 cp_parser_type_specifier (cp_parser* parser,
8899 cp_parser_flags flags,
8901 bool is_declaration,
8902 int* declares_class_or_enum,
8903 bool* is_cv_qualifier)
8905 tree type_spec = NULL_TREE;
8909 /* Assume this type-specifier does not declare a new type. */
8910 if (declares_class_or_enum)
8911 *declares_class_or_enum = 0;
8912 /* And that it does not specify a cv-qualifier. */
8913 if (is_cv_qualifier)
8914 *is_cv_qualifier = false;
8915 /* Peek at the next token. */
8916 token = cp_lexer_peek_token (parser->lexer);
8918 /* If we're looking at a keyword, we can use that to guide the
8919 production we choose. */
8920 keyword = token->keyword;
8923 /* Any of these indicate either a class-specifier, or an
8924 elaborated-type-specifier. */
8929 /* Parse tentatively so that we can back up if we don't find a
8930 class-specifier or enum-specifier. */
8931 cp_parser_parse_tentatively (parser);
8932 /* Look for the class-specifier or enum-specifier. */
8933 if (keyword == RID_ENUM)
8934 type_spec = cp_parser_enum_specifier (parser);
8936 type_spec = cp_parser_class_specifier (parser);
8938 /* If that worked, we're done. */
8939 if (cp_parser_parse_definitely (parser))
8941 if (declares_class_or_enum)
8942 *declares_class_or_enum = 2;
8949 /* Look for an elaborated-type-specifier. */
8950 type_spec = cp_parser_elaborated_type_specifier (parser,
8953 /* We're declaring a class or enum -- unless we're using
8955 if (declares_class_or_enum && keyword != RID_TYPENAME)
8956 *declares_class_or_enum = 1;
8962 type_spec = cp_parser_cv_qualifier_opt (parser);
8963 /* Even though we call a routine that looks for an optional
8964 qualifier, we know that there should be one. */
8965 my_friendly_assert (type_spec != NULL, 20000328);
8966 /* This type-specifier was a cv-qualified. */
8967 if (is_cv_qualifier)
8968 *is_cv_qualifier = true;
8973 /* The `__complex__' keyword is a GNU extension. */
8974 return cp_lexer_consume_token (parser->lexer)->value;
8980 /* If we do not already have a type-specifier, assume we are looking
8981 at a simple-type-specifier. */
8982 type_spec = cp_parser_simple_type_specifier (parser, flags,
8983 /*identifier_p=*/true);
8985 /* If we didn't find a type-specifier, and a type-specifier was not
8986 optional in this context, issue an error message. */
8987 if (!type_spec && !(flags & CP_PARSER_FLAGS_OPTIONAL))
8989 cp_parser_error (parser, "expected type specifier");
8990 return error_mark_node;
8996 /* Parse a simple-type-specifier.
8998 simple-type-specifier:
8999 :: [opt] nested-name-specifier [opt] type-name
9000 :: [opt] nested-name-specifier template template-id
9015 simple-type-specifier:
9016 __typeof__ unary-expression
9017 __typeof__ ( type-id )
9019 For the various keywords, the value returned is simply the
9020 TREE_IDENTIFIER representing the keyword if IDENTIFIER_P is true.
9021 For the first two productions, and if IDENTIFIER_P is false, the
9022 value returned is the indicated TYPE_DECL. */
9025 cp_parser_simple_type_specifier (cp_parser* parser, cp_parser_flags flags,
9028 tree type = NULL_TREE;
9031 /* Peek at the next token. */
9032 token = cp_lexer_peek_token (parser->lexer);
9034 /* If we're looking at a keyword, things are easy. */
9035 switch (token->keyword)
9038 type = char_type_node;
9041 type = wchar_type_node;
9044 type = boolean_type_node;
9047 type = short_integer_type_node;
9050 type = integer_type_node;
9053 type = long_integer_type_node;
9056 type = integer_type_node;
9059 type = unsigned_type_node;
9062 type = float_type_node;
9065 type = double_type_node;
9068 type = void_type_node;
9075 /* Consume the `typeof' token. */
9076 cp_lexer_consume_token (parser->lexer);
9077 /* Parse the operand to `typeof'. */
9078 operand = cp_parser_sizeof_operand (parser, RID_TYPEOF);
9079 /* If it is not already a TYPE, take its type. */
9080 if (!TYPE_P (operand))
9081 operand = finish_typeof (operand);
9090 /* If the type-specifier was for a built-in type, we're done. */
9095 /* Consume the token. */
9096 id = cp_lexer_consume_token (parser->lexer)->value;
9098 /* There is no valid C++ program where a non-template type is
9099 followed by a "<". That usually indicates that the user thought
9100 that the type was a template. */
9101 cp_parser_check_for_invalid_template_id (parser, type);
9103 return identifier_p ? id : TYPE_NAME (type);
9106 /* The type-specifier must be a user-defined type. */
9107 if (!(flags & CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES))
9111 /* Don't gobble tokens or issue error messages if this is an
9112 optional type-specifier. */
9113 if (flags & CP_PARSER_FLAGS_OPTIONAL)
9114 cp_parser_parse_tentatively (parser);
9116 /* Look for the optional `::' operator. */
9117 cp_parser_global_scope_opt (parser,
9118 /*current_scope_valid_p=*/false);
9119 /* Look for the nested-name specifier. */
9121 = (cp_parser_nested_name_specifier_opt (parser,
9122 /*typename_keyword_p=*/false,
9123 /*check_dependency_p=*/true,
9125 /*is_declaration=*/false)
9127 /* If we have seen a nested-name-specifier, and the next token
9128 is `template', then we are using the template-id production. */
9130 && cp_parser_optional_template_keyword (parser))
9132 /* Look for the template-id. */
9133 type = cp_parser_template_id (parser,
9134 /*template_keyword_p=*/true,
9135 /*check_dependency_p=*/true,
9136 /*is_declaration=*/false);
9137 /* If the template-id did not name a type, we are out of
9139 if (TREE_CODE (type) != TYPE_DECL)
9141 cp_parser_error (parser, "expected template-id for type");
9145 /* Otherwise, look for a type-name. */
9147 type = cp_parser_type_name (parser);
9148 /* Keep track of all name-lookups performed in class scopes. */
9151 && TREE_CODE (type) == TYPE_DECL
9152 && TREE_CODE (DECL_NAME (type)) == IDENTIFIER_NODE)
9153 maybe_note_name_used_in_class (DECL_NAME (type), type);
9154 /* If it didn't work out, we don't have a TYPE. */
9155 if ((flags & CP_PARSER_FLAGS_OPTIONAL)
9156 && !cp_parser_parse_definitely (parser))
9160 /* If we didn't get a type-name, issue an error message. */
9161 if (!type && !(flags & CP_PARSER_FLAGS_OPTIONAL))
9163 cp_parser_error (parser, "expected type-name");
9164 return error_mark_node;
9167 /* There is no valid C++ program where a non-template type is
9168 followed by a "<". That usually indicates that the user thought
9169 that the type was a template. */
9170 if (type && type != error_mark_node)
9171 cp_parser_check_for_invalid_template_id (parser, TREE_TYPE (type));
9176 /* Parse a type-name.
9189 Returns a TYPE_DECL for the the type. */
9192 cp_parser_type_name (cp_parser* parser)
9197 /* We can't know yet whether it is a class-name or not. */
9198 cp_parser_parse_tentatively (parser);
9199 /* Try a class-name. */
9200 type_decl = cp_parser_class_name (parser,
9201 /*typename_keyword_p=*/false,
9202 /*template_keyword_p=*/false,
9204 /*check_dependency_p=*/true,
9205 /*class_head_p=*/false,
9206 /*is_declaration=*/false);
9207 /* If it's not a class-name, keep looking. */
9208 if (!cp_parser_parse_definitely (parser))
9210 /* It must be a typedef-name or an enum-name. */
9211 identifier = cp_parser_identifier (parser);
9212 if (identifier == error_mark_node)
9213 return error_mark_node;
9215 /* Look up the type-name. */
9216 type_decl = cp_parser_lookup_name_simple (parser, identifier);
9217 /* Issue an error if we did not find a type-name. */
9218 if (TREE_CODE (type_decl) != TYPE_DECL)
9220 if (!cp_parser_simulate_error (parser))
9221 cp_parser_name_lookup_error (parser, identifier, type_decl,
9223 type_decl = error_mark_node;
9225 /* Remember that the name was used in the definition of the
9226 current class so that we can check later to see if the
9227 meaning would have been different after the class was
9228 entirely defined. */
9229 else if (type_decl != error_mark_node
9231 maybe_note_name_used_in_class (identifier, type_decl);
9238 /* Parse an elaborated-type-specifier. Note that the grammar given
9239 here incorporates the resolution to DR68.
9241 elaborated-type-specifier:
9242 class-key :: [opt] nested-name-specifier [opt] identifier
9243 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
9244 enum :: [opt] nested-name-specifier [opt] identifier
9245 typename :: [opt] nested-name-specifier identifier
9246 typename :: [opt] nested-name-specifier template [opt]
9251 elaborated-type-specifier:
9252 class-key attributes :: [opt] nested-name-specifier [opt] identifier
9253 class-key attributes :: [opt] nested-name-specifier [opt]
9254 template [opt] template-id
9255 enum attributes :: [opt] nested-name-specifier [opt] identifier
9257 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
9258 declared `friend'. If IS_DECLARATION is TRUE, then this
9259 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
9260 something is being declared.
9262 Returns the TYPE specified. */
9265 cp_parser_elaborated_type_specifier (cp_parser* parser,
9267 bool is_declaration)
9269 enum tag_types tag_type;
9271 tree type = NULL_TREE;
9272 tree attributes = NULL_TREE;
9274 /* See if we're looking at the `enum' keyword. */
9275 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ENUM))
9277 /* Consume the `enum' token. */
9278 cp_lexer_consume_token (parser->lexer);
9279 /* Remember that it's an enumeration type. */
9280 tag_type = enum_type;
9281 /* Parse the attributes. */
9282 attributes = cp_parser_attributes_opt (parser);
9284 /* Or, it might be `typename'. */
9285 else if (cp_lexer_next_token_is_keyword (parser->lexer,
9288 /* Consume the `typename' token. */
9289 cp_lexer_consume_token (parser->lexer);
9290 /* Remember that it's a `typename' type. */
9291 tag_type = typename_type;
9292 /* The `typename' keyword is only allowed in templates. */
9293 if (!processing_template_decl)
9294 pedwarn ("using `typename' outside of template");
9296 /* Otherwise it must be a class-key. */
9299 tag_type = cp_parser_class_key (parser);
9300 if (tag_type == none_type)
9301 return error_mark_node;
9302 /* Parse the attributes. */
9303 attributes = cp_parser_attributes_opt (parser);
9306 /* Look for the `::' operator. */
9307 cp_parser_global_scope_opt (parser,
9308 /*current_scope_valid_p=*/false);
9309 /* Look for the nested-name-specifier. */
9310 if (tag_type == typename_type)
9312 if (cp_parser_nested_name_specifier (parser,
9313 /*typename_keyword_p=*/true,
9314 /*check_dependency_p=*/true,
9318 return error_mark_node;
9321 /* Even though `typename' is not present, the proposed resolution
9322 to Core Issue 180 says that in `class A<T>::B', `B' should be
9323 considered a type-name, even if `A<T>' is dependent. */
9324 cp_parser_nested_name_specifier_opt (parser,
9325 /*typename_keyword_p=*/true,
9326 /*check_dependency_p=*/true,
9329 /* For everything but enumeration types, consider a template-id. */
9330 if (tag_type != enum_type)
9332 bool template_p = false;
9335 /* Allow the `template' keyword. */
9336 template_p = cp_parser_optional_template_keyword (parser);
9337 /* If we didn't see `template', we don't know if there's a
9338 template-id or not. */
9340 cp_parser_parse_tentatively (parser);
9341 /* Parse the template-id. */
9342 decl = cp_parser_template_id (parser, template_p,
9343 /*check_dependency_p=*/true,
9345 /* If we didn't find a template-id, look for an ordinary
9347 if (!template_p && !cp_parser_parse_definitely (parser))
9349 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
9350 in effect, then we must assume that, upon instantiation, the
9351 template will correspond to a class. */
9352 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
9353 && tag_type == typename_type)
9354 type = make_typename_type (parser->scope, decl,
9357 type = TREE_TYPE (decl);
9360 /* For an enumeration type, consider only a plain identifier. */
9363 identifier = cp_parser_identifier (parser);
9365 if (identifier == error_mark_node)
9367 parser->scope = NULL_TREE;
9368 return error_mark_node;
9371 /* For a `typename', we needn't call xref_tag. */
9372 if (tag_type == typename_type)
9373 return cp_parser_make_typename_type (parser, parser->scope,
9375 /* Look up a qualified name in the usual way. */
9380 /* In an elaborated-type-specifier, names are assumed to name
9381 types, so we set IS_TYPE to TRUE when calling
9382 cp_parser_lookup_name. */
9383 decl = cp_parser_lookup_name (parser, identifier,
9385 /*is_template=*/false,
9386 /*is_namespace=*/false,
9387 /*check_dependency=*/true);
9389 /* If we are parsing friend declaration, DECL may be a
9390 TEMPLATE_DECL tree node here. However, we need to check
9391 whether this TEMPLATE_DECL results in valid code. Consider
9392 the following example:
9395 template <class T> class C {};
9398 template <class T> friend class N::C; // #1, valid code
9400 template <class T> class Y {
9401 friend class N::C; // #2, invalid code
9404 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
9405 name lookup of `N::C'. We see that friend declaration must
9406 be template for the code to be valid. Note that
9407 processing_template_decl does not work here since it is
9408 always 1 for the above two cases. */
9410 decl = (cp_parser_maybe_treat_template_as_class
9411 (decl, /*tag_name_p=*/is_friend
9412 && parser->num_template_parameter_lists));
9414 if (TREE_CODE (decl) != TYPE_DECL)
9416 error ("expected type-name");
9417 return error_mark_node;
9420 if (TREE_CODE (TREE_TYPE (decl)) != TYPENAME_TYPE)
9421 check_elaborated_type_specifier
9423 (parser->num_template_parameter_lists
9424 || DECL_SELF_REFERENCE_P (decl)));
9426 type = TREE_TYPE (decl);
9430 /* An elaborated-type-specifier sometimes introduces a new type and
9431 sometimes names an existing type. Normally, the rule is that it
9432 introduces a new type only if there is not an existing type of
9433 the same name already in scope. For example, given:
9436 void f() { struct S s; }
9438 the `struct S' in the body of `f' is the same `struct S' as in
9439 the global scope; the existing definition is used. However, if
9440 there were no global declaration, this would introduce a new
9441 local class named `S'.
9443 An exception to this rule applies to the following code:
9445 namespace N { struct S; }
9447 Here, the elaborated-type-specifier names a new type
9448 unconditionally; even if there is already an `S' in the
9449 containing scope this declaration names a new type.
9450 This exception only applies if the elaborated-type-specifier
9451 forms the complete declaration:
9455 A declaration consisting solely of `class-key identifier ;' is
9456 either a redeclaration of the name in the current scope or a
9457 forward declaration of the identifier as a class name. It
9458 introduces the name into the current scope.
9460 We are in this situation precisely when the next token is a `;'.
9462 An exception to the exception is that a `friend' declaration does
9463 *not* name a new type; i.e., given:
9465 struct S { friend struct T; };
9467 `T' is not a new type in the scope of `S'.
9469 Also, `new struct S' or `sizeof (struct S)' never results in the
9470 definition of a new type; a new type can only be declared in a
9471 declaration context. */
9473 /* Warn about attributes. They are ignored. */
9475 warning ("type attributes are honored only at type definition");
9477 type = xref_tag (tag_type, identifier,
9480 || cp_lexer_next_token_is_not (parser->lexer,
9482 parser->num_template_parameter_lists);
9485 if (tag_type != enum_type)
9486 cp_parser_check_class_key (tag_type, type);
9488 /* A "<" cannot follow an elaborated type specifier. If that
9489 happens, the user was probably trying to form a template-id. */
9490 cp_parser_check_for_invalid_template_id (parser, type);
9495 /* Parse an enum-specifier.
9498 enum identifier [opt] { enumerator-list [opt] }
9500 Returns an ENUM_TYPE representing the enumeration. */
9503 cp_parser_enum_specifier (cp_parser* parser)
9506 tree identifier = NULL_TREE;
9509 /* Look for the `enum' keyword. */
9510 if (!cp_parser_require_keyword (parser, RID_ENUM, "`enum'"))
9511 return error_mark_node;
9512 /* Peek at the next token. */
9513 token = cp_lexer_peek_token (parser->lexer);
9515 /* See if it is an identifier. */
9516 if (token->type == CPP_NAME)
9517 identifier = cp_parser_identifier (parser);
9519 /* Look for the `{'. */
9520 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "`{'"))
9521 return error_mark_node;
9523 /* At this point, we're going ahead with the enum-specifier, even
9524 if some other problem occurs. */
9525 cp_parser_commit_to_tentative_parse (parser);
9527 /* Issue an error message if type-definitions are forbidden here. */
9528 cp_parser_check_type_definition (parser);
9530 /* Create the new type. */
9531 type = start_enum (identifier ? identifier : make_anon_name ());
9533 /* Peek at the next token. */
9534 token = cp_lexer_peek_token (parser->lexer);
9535 /* If it's not a `}', then there are some enumerators. */
9536 if (token->type != CPP_CLOSE_BRACE)
9537 cp_parser_enumerator_list (parser, type);
9538 /* Look for the `}'. */
9539 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
9541 /* Finish up the enumeration. */
9547 /* Parse an enumerator-list. The enumerators all have the indicated
9551 enumerator-definition
9552 enumerator-list , enumerator-definition */
9555 cp_parser_enumerator_list (cp_parser* parser, tree type)
9561 /* Parse an enumerator-definition. */
9562 cp_parser_enumerator_definition (parser, type);
9563 /* Peek at the next token. */
9564 token = cp_lexer_peek_token (parser->lexer);
9565 /* If it's not a `,', then we've reached the end of the
9567 if (token->type != CPP_COMMA)
9569 /* Otherwise, consume the `,' and keep going. */
9570 cp_lexer_consume_token (parser->lexer);
9571 /* If the next token is a `}', there is a trailing comma. */
9572 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
9574 if (pedantic && !in_system_header)
9575 pedwarn ("comma at end of enumerator list");
9581 /* Parse an enumerator-definition. The enumerator has the indicated
9584 enumerator-definition:
9586 enumerator = constant-expression
9592 cp_parser_enumerator_definition (cp_parser* parser, tree type)
9598 /* Look for the identifier. */
9599 identifier = cp_parser_identifier (parser);
9600 if (identifier == error_mark_node)
9603 /* Peek at the next token. */
9604 token = cp_lexer_peek_token (parser->lexer);
9605 /* If it's an `=', then there's an explicit value. */
9606 if (token->type == CPP_EQ)
9608 /* Consume the `=' token. */
9609 cp_lexer_consume_token (parser->lexer);
9610 /* Parse the value. */
9611 value = cp_parser_constant_expression (parser,
9612 /*allow_non_constant_p=*/false,
9618 /* Create the enumerator. */
9619 build_enumerator (identifier, value, type);
9622 /* Parse a namespace-name.
9625 original-namespace-name
9628 Returns the NAMESPACE_DECL for the namespace. */
9631 cp_parser_namespace_name (cp_parser* parser)
9634 tree namespace_decl;
9636 /* Get the name of the namespace. */
9637 identifier = cp_parser_identifier (parser);
9638 if (identifier == error_mark_node)
9639 return error_mark_node;
9641 /* Look up the identifier in the currently active scope. Look only
9642 for namespaces, due to:
9646 When looking up a namespace-name in a using-directive or alias
9647 definition, only namespace names are considered.
9653 During the lookup of a name preceding the :: scope resolution
9654 operator, object, function, and enumerator names are ignored.
9656 (Note that cp_parser_class_or_namespace_name only calls this
9657 function if the token after the name is the scope resolution
9659 namespace_decl = cp_parser_lookup_name (parser, identifier,
9661 /*is_template=*/false,
9662 /*is_namespace=*/true,
9663 /*check_dependency=*/true);
9664 /* If it's not a namespace, issue an error. */
9665 if (namespace_decl == error_mark_node
9666 || TREE_CODE (namespace_decl) != NAMESPACE_DECL)
9668 cp_parser_error (parser, "expected namespace-name");
9669 namespace_decl = error_mark_node;
9672 return namespace_decl;
9675 /* Parse a namespace-definition.
9677 namespace-definition:
9678 named-namespace-definition
9679 unnamed-namespace-definition
9681 named-namespace-definition:
9682 original-namespace-definition
9683 extension-namespace-definition
9685 original-namespace-definition:
9686 namespace identifier { namespace-body }
9688 extension-namespace-definition:
9689 namespace original-namespace-name { namespace-body }
9691 unnamed-namespace-definition:
9692 namespace { namespace-body } */
9695 cp_parser_namespace_definition (cp_parser* parser)
9699 /* Look for the `namespace' keyword. */
9700 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
9702 /* Get the name of the namespace. We do not attempt to distinguish
9703 between an original-namespace-definition and an
9704 extension-namespace-definition at this point. The semantic
9705 analysis routines are responsible for that. */
9706 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
9707 identifier = cp_parser_identifier (parser);
9709 identifier = NULL_TREE;
9711 /* Look for the `{' to start the namespace. */
9712 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
9713 /* Start the namespace. */
9714 push_namespace (identifier);
9715 /* Parse the body of the namespace. */
9716 cp_parser_namespace_body (parser);
9717 /* Finish the namespace. */
9719 /* Look for the final `}'. */
9720 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
9723 /* Parse a namespace-body.
9726 declaration-seq [opt] */
9729 cp_parser_namespace_body (cp_parser* parser)
9731 cp_parser_declaration_seq_opt (parser);
9734 /* Parse a namespace-alias-definition.
9736 namespace-alias-definition:
9737 namespace identifier = qualified-namespace-specifier ; */
9740 cp_parser_namespace_alias_definition (cp_parser* parser)
9743 tree namespace_specifier;
9745 /* Look for the `namespace' keyword. */
9746 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
9747 /* Look for the identifier. */
9748 identifier = cp_parser_identifier (parser);
9749 if (identifier == error_mark_node)
9751 /* Look for the `=' token. */
9752 cp_parser_require (parser, CPP_EQ, "`='");
9753 /* Look for the qualified-namespace-specifier. */
9755 = cp_parser_qualified_namespace_specifier (parser);
9756 /* Look for the `;' token. */
9757 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
9759 /* Register the alias in the symbol table. */
9760 do_namespace_alias (identifier, namespace_specifier);
9763 /* Parse a qualified-namespace-specifier.
9765 qualified-namespace-specifier:
9766 :: [opt] nested-name-specifier [opt] namespace-name
9768 Returns a NAMESPACE_DECL corresponding to the specified
9772 cp_parser_qualified_namespace_specifier (cp_parser* parser)
9774 /* Look for the optional `::'. */
9775 cp_parser_global_scope_opt (parser,
9776 /*current_scope_valid_p=*/false);
9778 /* Look for the optional nested-name-specifier. */
9779 cp_parser_nested_name_specifier_opt (parser,
9780 /*typename_keyword_p=*/false,
9781 /*check_dependency_p=*/true,
9783 /*is_declaration=*/true);
9785 return cp_parser_namespace_name (parser);
9788 /* Parse a using-declaration.
9791 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
9792 using :: unqualified-id ; */
9795 cp_parser_using_declaration (cp_parser* parser)
9798 bool typename_p = false;
9799 bool global_scope_p;
9805 /* Look for the `using' keyword. */
9806 cp_parser_require_keyword (parser, RID_USING, "`using'");
9808 /* Peek at the next token. */
9809 token = cp_lexer_peek_token (parser->lexer);
9810 /* See if it's `typename'. */
9811 if (token->keyword == RID_TYPENAME)
9813 /* Remember that we've seen it. */
9815 /* Consume the `typename' token. */
9816 cp_lexer_consume_token (parser->lexer);
9819 /* Look for the optional global scope qualification. */
9821 = (cp_parser_global_scope_opt (parser,
9822 /*current_scope_valid_p=*/false)
9825 /* If we saw `typename', or didn't see `::', then there must be a
9826 nested-name-specifier present. */
9827 if (typename_p || !global_scope_p)
9828 qscope = cp_parser_nested_name_specifier (parser, typename_p,
9829 /*check_dependency_p=*/true,
9831 /*is_declaration=*/true);
9832 /* Otherwise, we could be in either of the two productions. In that
9833 case, treat the nested-name-specifier as optional. */
9835 qscope = cp_parser_nested_name_specifier_opt (parser,
9836 /*typename_keyword_p=*/false,
9837 /*check_dependency_p=*/true,
9839 /*is_declaration=*/true);
9841 qscope = global_namespace;
9843 /* Parse the unqualified-id. */
9844 identifier = cp_parser_unqualified_id (parser,
9845 /*template_keyword_p=*/false,
9846 /*check_dependency_p=*/true,
9847 /*declarator_p=*/true);
9849 /* The function we call to handle a using-declaration is different
9850 depending on what scope we are in. */
9851 if (identifier == error_mark_node)
9853 else if (TREE_CODE (identifier) != IDENTIFIER_NODE
9854 && TREE_CODE (identifier) != BIT_NOT_EXPR)
9855 /* [namespace.udecl]
9857 A using declaration shall not name a template-id. */
9858 error ("a template-id may not appear in a using-declaration");
9861 scope = current_scope ();
9862 if (scope && TYPE_P (scope))
9864 /* Create the USING_DECL. */
9865 decl = do_class_using_decl (build_nt (SCOPE_REF,
9868 /* Add it to the list of members in this class. */
9869 finish_member_declaration (decl);
9873 decl = cp_parser_lookup_name_simple (parser, identifier);
9874 if (decl == error_mark_node)
9875 cp_parser_name_lookup_error (parser, identifier, decl, NULL);
9877 do_local_using_decl (decl, qscope, identifier);
9879 do_toplevel_using_decl (decl, qscope, identifier);
9883 /* Look for the final `;'. */
9884 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
9887 /* Parse a using-directive.
9890 using namespace :: [opt] nested-name-specifier [opt]
9894 cp_parser_using_directive (cp_parser* parser)
9896 tree namespace_decl;
9899 /* Look for the `using' keyword. */
9900 cp_parser_require_keyword (parser, RID_USING, "`using'");
9901 /* And the `namespace' keyword. */
9902 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
9903 /* Look for the optional `::' operator. */
9904 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
9905 /* And the optional nested-name-specifier. */
9906 cp_parser_nested_name_specifier_opt (parser,
9907 /*typename_keyword_p=*/false,
9908 /*check_dependency_p=*/true,
9910 /*is_declaration=*/true);
9911 /* Get the namespace being used. */
9912 namespace_decl = cp_parser_namespace_name (parser);
9913 /* And any specified attributes. */
9914 attribs = cp_parser_attributes_opt (parser);
9915 /* Update the symbol table. */
9916 parse_using_directive (namespace_decl, attribs);
9917 /* Look for the final `;'. */
9918 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
9921 /* Parse an asm-definition.
9924 asm ( string-literal ) ;
9929 asm volatile [opt] ( string-literal ) ;
9930 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
9931 asm volatile [opt] ( string-literal : asm-operand-list [opt]
9932 : asm-operand-list [opt] ) ;
9933 asm volatile [opt] ( string-literal : asm-operand-list [opt]
9934 : asm-operand-list [opt]
9935 : asm-operand-list [opt] ) ; */
9938 cp_parser_asm_definition (cp_parser* parser)
9942 tree outputs = NULL_TREE;
9943 tree inputs = NULL_TREE;
9944 tree clobbers = NULL_TREE;
9946 bool volatile_p = false;
9947 bool extended_p = false;
9949 /* Look for the `asm' keyword. */
9950 cp_parser_require_keyword (parser, RID_ASM, "`asm'");
9951 /* See if the next token is `volatile'. */
9952 if (cp_parser_allow_gnu_extensions_p (parser)
9953 && cp_lexer_next_token_is_keyword (parser->lexer, RID_VOLATILE))
9955 /* Remember that we saw the `volatile' keyword. */
9957 /* Consume the token. */
9958 cp_lexer_consume_token (parser->lexer);
9960 /* Look for the opening `('. */
9961 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
9962 /* Look for the string. */
9963 c_lex_string_translate = 0;
9964 token = cp_parser_require (parser, CPP_STRING, "asm body");
9967 string = token->value;
9968 /* If we're allowing GNU extensions, check for the extended assembly
9969 syntax. Unfortunately, the `:' tokens need not be separated by
9970 a space in C, and so, for compatibility, we tolerate that here
9971 too. Doing that means that we have to treat the `::' operator as
9973 if (cp_parser_allow_gnu_extensions_p (parser)
9974 && at_function_scope_p ()
9975 && (cp_lexer_next_token_is (parser->lexer, CPP_COLON)
9976 || cp_lexer_next_token_is (parser->lexer, CPP_SCOPE)))
9978 bool inputs_p = false;
9979 bool clobbers_p = false;
9981 /* The extended syntax was used. */
9984 /* Look for outputs. */
9985 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
9987 /* Consume the `:'. */
9988 cp_lexer_consume_token (parser->lexer);
9989 /* Parse the output-operands. */
9990 if (cp_lexer_next_token_is_not (parser->lexer,
9992 && cp_lexer_next_token_is_not (parser->lexer,
9994 && cp_lexer_next_token_is_not (parser->lexer,
9996 outputs = cp_parser_asm_operand_list (parser);
9998 /* If the next token is `::', there are no outputs, and the
9999 next token is the beginning of the inputs. */
10000 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
10002 /* Consume the `::' token. */
10003 cp_lexer_consume_token (parser->lexer);
10004 /* The inputs are coming next. */
10008 /* Look for inputs. */
10010 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
10013 /* Consume the `:'. */
10014 cp_lexer_consume_token (parser->lexer);
10015 /* Parse the output-operands. */
10016 if (cp_lexer_next_token_is_not (parser->lexer,
10018 && cp_lexer_next_token_is_not (parser->lexer,
10020 && cp_lexer_next_token_is_not (parser->lexer,
10022 inputs = cp_parser_asm_operand_list (parser);
10024 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
10025 /* The clobbers are coming next. */
10028 /* Look for clobbers. */
10030 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
10033 /* Consume the `:'. */
10034 cp_lexer_consume_token (parser->lexer);
10035 /* Parse the clobbers. */
10036 if (cp_lexer_next_token_is_not (parser->lexer,
10038 clobbers = cp_parser_asm_clobber_list (parser);
10041 /* Look for the closing `)'. */
10042 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
10043 cp_parser_skip_to_closing_parenthesis (parser, true, false,
10044 /*consume_paren=*/true);
10045 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10047 /* Create the ASM_STMT. */
10048 if (at_function_scope_p ())
10050 asm_stmt = finish_asm_stmt (volatile_p, string, outputs,
10052 /* If the extended syntax was not used, mark the ASM_STMT. */
10054 ASM_INPUT_P (asm_stmt) = 1;
10057 assemble_asm (string);
10060 c_lex_string_translate = 1;
10063 /* Declarators [gram.dcl.decl] */
10065 /* Parse an init-declarator.
10068 declarator initializer [opt]
10073 declarator asm-specification [opt] attributes [opt] initializer [opt]
10075 function-definition:
10076 decl-specifier-seq [opt] declarator ctor-initializer [opt]
10078 decl-specifier-seq [opt] declarator function-try-block
10082 function-definition:
10083 __extension__ function-definition
10085 The DECL_SPECIFIERS and PREFIX_ATTRIBUTES apply to this declarator.
10086 Returns a representation of the entity declared. If MEMBER_P is TRUE,
10087 then this declarator appears in a class scope. The new DECL created
10088 by this declarator is returned.
10090 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
10091 for a function-definition here as well. If the declarator is a
10092 declarator for a function-definition, *FUNCTION_DEFINITION_P will
10093 be TRUE upon return. By that point, the function-definition will
10094 have been completely parsed.
10096 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
10100 cp_parser_init_declarator (cp_parser* parser,
10101 tree decl_specifiers,
10102 tree prefix_attributes,
10103 bool function_definition_allowed_p,
10105 int declares_class_or_enum,
10106 bool* function_definition_p)
10111 tree asm_specification;
10113 tree decl = NULL_TREE;
10115 bool is_initialized;
10116 bool is_parenthesized_init;
10117 bool is_non_constant_init;
10118 int ctor_dtor_or_conv_p;
10120 bool pop_p = false;
10122 /* Assume that this is not the declarator for a function
10124 if (function_definition_p)
10125 *function_definition_p = false;
10127 /* Defer access checks while parsing the declarator; we cannot know
10128 what names are accessible until we know what is being
10130 resume_deferring_access_checks ();
10132 /* Parse the declarator. */
10134 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
10135 &ctor_dtor_or_conv_p,
10136 /*parenthesized_p=*/NULL);
10137 /* Gather up the deferred checks. */
10138 stop_deferring_access_checks ();
10140 /* If the DECLARATOR was erroneous, there's no need to go
10142 if (declarator == error_mark_node)
10143 return error_mark_node;
10145 cp_parser_check_for_definition_in_return_type (declarator,
10146 declares_class_or_enum);
10148 /* Figure out what scope the entity declared by the DECLARATOR is
10149 located in. `grokdeclarator' sometimes changes the scope, so
10150 we compute it now. */
10151 scope = get_scope_of_declarator (declarator);
10153 /* If we're allowing GNU extensions, look for an asm-specification
10155 if (cp_parser_allow_gnu_extensions_p (parser))
10157 /* Look for an asm-specification. */
10158 asm_specification = cp_parser_asm_specification_opt (parser);
10159 /* And attributes. */
10160 attributes = cp_parser_attributes_opt (parser);
10164 asm_specification = NULL_TREE;
10165 attributes = NULL_TREE;
10168 /* Peek at the next token. */
10169 token = cp_lexer_peek_token (parser->lexer);
10170 /* Check to see if the token indicates the start of a
10171 function-definition. */
10172 if (cp_parser_token_starts_function_definition_p (token))
10174 if (!function_definition_allowed_p)
10176 /* If a function-definition should not appear here, issue an
10178 cp_parser_error (parser,
10179 "a function-definition is not allowed here");
10180 return error_mark_node;
10184 /* Neither attributes nor an asm-specification are allowed
10185 on a function-definition. */
10186 if (asm_specification)
10187 error ("an asm-specification is not allowed on a function-definition");
10189 error ("attributes are not allowed on a function-definition");
10190 /* This is a function-definition. */
10191 *function_definition_p = true;
10193 /* Parse the function definition. */
10195 decl = cp_parser_save_member_function_body (parser,
10198 prefix_attributes);
10201 = (cp_parser_function_definition_from_specifiers_and_declarator
10202 (parser, decl_specifiers, prefix_attributes, declarator));
10210 Only in function declarations for constructors, destructors, and
10211 type conversions can the decl-specifier-seq be omitted.
10213 We explicitly postpone this check past the point where we handle
10214 function-definitions because we tolerate function-definitions
10215 that are missing their return types in some modes. */
10216 if (!decl_specifiers && ctor_dtor_or_conv_p <= 0)
10218 cp_parser_error (parser,
10219 "expected constructor, destructor, or type conversion");
10220 return error_mark_node;
10223 /* An `=' or an `(' indicates an initializer. */
10224 is_initialized = (token->type == CPP_EQ
10225 || token->type == CPP_OPEN_PAREN);
10226 /* If the init-declarator isn't initialized and isn't followed by a
10227 `,' or `;', it's not a valid init-declarator. */
10228 if (!is_initialized
10229 && token->type != CPP_COMMA
10230 && token->type != CPP_SEMICOLON)
10232 cp_parser_error (parser, "expected init-declarator");
10233 return error_mark_node;
10236 /* Because start_decl has side-effects, we should only call it if we
10237 know we're going ahead. By this point, we know that we cannot
10238 possibly be looking at any other construct. */
10239 cp_parser_commit_to_tentative_parse (parser);
10241 /* If the decl specifiers were bad, issue an error now that we're
10242 sure this was intended to be a declarator. Then continue
10243 declaring the variable(s), as int, to try to cut down on further
10245 if (decl_specifiers != NULL
10246 && TREE_VALUE (decl_specifiers) == error_mark_node)
10248 cp_parser_error (parser, "invalid type in declaration");
10249 TREE_VALUE (decl_specifiers) = integer_type_node;
10252 /* Check to see whether or not this declaration is a friend. */
10253 friend_p = cp_parser_friend_p (decl_specifiers);
10255 /* Check that the number of template-parameter-lists is OK. */
10256 if (!cp_parser_check_declarator_template_parameters (parser, declarator))
10257 return error_mark_node;
10259 /* Enter the newly declared entry in the symbol table. If we're
10260 processing a declaration in a class-specifier, we wait until
10261 after processing the initializer. */
10264 if (parser->in_unbraced_linkage_specification_p)
10266 decl_specifiers = tree_cons (error_mark_node,
10267 get_identifier ("extern"),
10269 have_extern_spec = false;
10271 decl = start_decl (declarator, decl_specifiers,
10272 is_initialized, attributes, prefix_attributes);
10275 /* Enter the SCOPE. That way unqualified names appearing in the
10276 initializer will be looked up in SCOPE. */
10278 pop_p = push_scope (scope);
10280 /* Perform deferred access control checks, now that we know in which
10281 SCOPE the declared entity resides. */
10282 if (!member_p && decl)
10284 tree saved_current_function_decl = NULL_TREE;
10286 /* If the entity being declared is a function, pretend that we
10287 are in its scope. If it is a `friend', it may have access to
10288 things that would not otherwise be accessible. */
10289 if (TREE_CODE (decl) == FUNCTION_DECL)
10291 saved_current_function_decl = current_function_decl;
10292 current_function_decl = decl;
10295 /* Perform the access control checks for the declarator and the
10296 the decl-specifiers. */
10297 perform_deferred_access_checks ();
10299 /* Restore the saved value. */
10300 if (TREE_CODE (decl) == FUNCTION_DECL)
10301 current_function_decl = saved_current_function_decl;
10304 /* Parse the initializer. */
10305 if (is_initialized)
10306 initializer = cp_parser_initializer (parser,
10307 &is_parenthesized_init,
10308 &is_non_constant_init);
10311 initializer = NULL_TREE;
10312 is_parenthesized_init = false;
10313 is_non_constant_init = true;
10316 /* The old parser allows attributes to appear after a parenthesized
10317 initializer. Mark Mitchell proposed removing this functionality
10318 on the GCC mailing lists on 2002-08-13. This parser accepts the
10319 attributes -- but ignores them. */
10320 if (cp_parser_allow_gnu_extensions_p (parser) && is_parenthesized_init)
10321 if (cp_parser_attributes_opt (parser))
10322 warning ("attributes after parenthesized initializer ignored");
10324 /* Leave the SCOPE, now that we have processed the initializer. It
10325 is important to do this before calling cp_finish_decl because it
10326 makes decisions about whether to create DECL_STMTs or not based
10327 on the current scope. */
10331 /* For an in-class declaration, use `grokfield' to create the
10335 decl = grokfield (declarator, decl_specifiers,
10336 initializer, /*asmspec=*/NULL_TREE,
10337 /*attributes=*/NULL_TREE);
10338 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
10339 cp_parser_save_default_args (parser, decl);
10342 /* Finish processing the declaration. But, skip friend
10344 if (!friend_p && decl)
10345 cp_finish_decl (decl,
10348 /* If the initializer is in parentheses, then this is
10349 a direct-initialization, which means that an
10350 `explicit' constructor is OK. Otherwise, an
10351 `explicit' constructor cannot be used. */
10352 ((is_parenthesized_init || !is_initialized)
10353 ? 0 : LOOKUP_ONLYCONVERTING));
10355 /* Remember whether or not variables were initialized by
10356 constant-expressions. */
10357 if (decl && TREE_CODE (decl) == VAR_DECL
10358 && is_initialized && !is_non_constant_init)
10359 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
10364 /* Parse a declarator.
10368 ptr-operator declarator
10370 abstract-declarator:
10371 ptr-operator abstract-declarator [opt]
10372 direct-abstract-declarator
10377 attributes [opt] direct-declarator
10378 attributes [opt] ptr-operator declarator
10380 abstract-declarator:
10381 attributes [opt] ptr-operator abstract-declarator [opt]
10382 attributes [opt] direct-abstract-declarator
10384 Returns a representation of the declarator. If the declarator has
10385 the form `* declarator', then an INDIRECT_REF is returned, whose
10386 only operand is the sub-declarator. Analogously, `& declarator' is
10387 represented as an ADDR_EXPR. For `X::* declarator', a SCOPE_REF is
10388 used. The first operand is the TYPE for `X'. The second operand
10389 is an INDIRECT_REF whose operand is the sub-declarator.
10391 Otherwise, the representation is as for a direct-declarator.
10393 (It would be better to define a structure type to represent
10394 declarators, rather than abusing `tree' nodes to represent
10395 declarators. That would be much clearer and save some memory.
10396 There is no reason for declarators to be garbage-collected, for
10397 example; they are created during parser and no longer needed after
10398 `grokdeclarator' has been called.)
10400 For a ptr-operator that has the optional cv-qualifier-seq,
10401 cv-qualifiers will be stored in the TREE_TYPE of the INDIRECT_REF
10404 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
10405 detect constructor, destructor or conversion operators. It is set
10406 to -1 if the declarator is a name, and +1 if it is a
10407 function. Otherwise it is set to zero. Usually you just want to
10408 test for >0, but internally the negative value is used.
10410 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
10411 a decl-specifier-seq unless it declares a constructor, destructor,
10412 or conversion. It might seem that we could check this condition in
10413 semantic analysis, rather than parsing, but that makes it difficult
10414 to handle something like `f()'. We want to notice that there are
10415 no decl-specifiers, and therefore realize that this is an
10416 expression, not a declaration.)
10418 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
10419 the declarator is a direct-declarator of the form "(...)". */
10422 cp_parser_declarator (cp_parser* parser,
10423 cp_parser_declarator_kind dcl_kind,
10424 int* ctor_dtor_or_conv_p,
10425 bool* parenthesized_p)
10429 enum tree_code code;
10430 tree cv_qualifier_seq;
10432 tree attributes = NULL_TREE;
10434 /* Assume this is not a constructor, destructor, or type-conversion
10436 if (ctor_dtor_or_conv_p)
10437 *ctor_dtor_or_conv_p = 0;
10439 if (cp_parser_allow_gnu_extensions_p (parser))
10440 attributes = cp_parser_attributes_opt (parser);
10442 /* Peek at the next token. */
10443 token = cp_lexer_peek_token (parser->lexer);
10445 /* Check for the ptr-operator production. */
10446 cp_parser_parse_tentatively (parser);
10447 /* Parse the ptr-operator. */
10448 code = cp_parser_ptr_operator (parser,
10450 &cv_qualifier_seq);
10451 /* If that worked, then we have a ptr-operator. */
10452 if (cp_parser_parse_definitely (parser))
10454 /* If a ptr-operator was found, then this declarator was not
10456 if (parenthesized_p)
10457 *parenthesized_p = true;
10458 /* The dependent declarator is optional if we are parsing an
10459 abstract-declarator. */
10460 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED)
10461 cp_parser_parse_tentatively (parser);
10463 /* Parse the dependent declarator. */
10464 declarator = cp_parser_declarator (parser, dcl_kind,
10465 /*ctor_dtor_or_conv_p=*/NULL,
10466 /*parenthesized_p=*/NULL);
10468 /* If we are parsing an abstract-declarator, we must handle the
10469 case where the dependent declarator is absent. */
10470 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED
10471 && !cp_parser_parse_definitely (parser))
10472 declarator = NULL_TREE;
10474 /* Build the representation of the ptr-operator. */
10475 if (code == INDIRECT_REF)
10476 declarator = make_pointer_declarator (cv_qualifier_seq,
10479 declarator = make_reference_declarator (cv_qualifier_seq,
10481 /* Handle the pointer-to-member case. */
10483 declarator = build_nt (SCOPE_REF, class_type, declarator);
10485 /* Everything else is a direct-declarator. */
10488 if (parenthesized_p)
10489 *parenthesized_p = cp_lexer_next_token_is (parser->lexer,
10491 declarator = cp_parser_direct_declarator (parser, dcl_kind,
10492 ctor_dtor_or_conv_p);
10495 if (attributes && declarator != error_mark_node)
10496 declarator = tree_cons (attributes, declarator, NULL_TREE);
10501 /* Parse a direct-declarator or direct-abstract-declarator.
10505 direct-declarator ( parameter-declaration-clause )
10506 cv-qualifier-seq [opt]
10507 exception-specification [opt]
10508 direct-declarator [ constant-expression [opt] ]
10511 direct-abstract-declarator:
10512 direct-abstract-declarator [opt]
10513 ( parameter-declaration-clause )
10514 cv-qualifier-seq [opt]
10515 exception-specification [opt]
10516 direct-abstract-declarator [opt] [ constant-expression [opt] ]
10517 ( abstract-declarator )
10519 Returns a representation of the declarator. DCL_KIND is
10520 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
10521 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
10522 we are parsing a direct-declarator. It is
10523 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
10524 of ambiguity we prefer an abstract declarator, as per
10525 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P is as for
10526 cp_parser_declarator.
10528 For the declarator-id production, the representation is as for an
10529 id-expression, except that a qualified name is represented as a
10530 SCOPE_REF. A function-declarator is represented as a CALL_EXPR;
10531 see the documentation of the FUNCTION_DECLARATOR_* macros for
10532 information about how to find the various declarator components.
10533 An array-declarator is represented as an ARRAY_REF. The
10534 direct-declarator is the first operand; the constant-expression
10535 indicating the size of the array is the second operand. */
10538 cp_parser_direct_declarator (cp_parser* parser,
10539 cp_parser_declarator_kind dcl_kind,
10540 int* ctor_dtor_or_conv_p)
10543 tree declarator = NULL_TREE;
10544 tree scope = NULL_TREE;
10545 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
10546 bool saved_in_declarator_p = parser->in_declarator_p;
10548 bool pop_p = false;
10552 /* Peek at the next token. */
10553 token = cp_lexer_peek_token (parser->lexer);
10554 if (token->type == CPP_OPEN_PAREN)
10556 /* This is either a parameter-declaration-clause, or a
10557 parenthesized declarator. When we know we are parsing a
10558 named declarator, it must be a parenthesized declarator
10559 if FIRST is true. For instance, `(int)' is a
10560 parameter-declaration-clause, with an omitted
10561 direct-abstract-declarator. But `((*))', is a
10562 parenthesized abstract declarator. Finally, when T is a
10563 template parameter `(T)' is a
10564 parameter-declaration-clause, and not a parenthesized
10567 We first try and parse a parameter-declaration-clause,
10568 and then try a nested declarator (if FIRST is true).
10570 It is not an error for it not to be a
10571 parameter-declaration-clause, even when FIRST is
10577 The first is the declaration of a function while the
10578 second is a the definition of a variable, including its
10581 Having seen only the parenthesis, we cannot know which of
10582 these two alternatives should be selected. Even more
10583 complex are examples like:
10588 The former is a function-declaration; the latter is a
10589 variable initialization.
10591 Thus again, we try a parameter-declaration-clause, and if
10592 that fails, we back out and return. */
10594 if (!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
10597 unsigned saved_num_template_parameter_lists;
10599 cp_parser_parse_tentatively (parser);
10601 /* Consume the `('. */
10602 cp_lexer_consume_token (parser->lexer);
10605 /* If this is going to be an abstract declarator, we're
10606 in a declarator and we can't have default args. */
10607 parser->default_arg_ok_p = false;
10608 parser->in_declarator_p = true;
10611 /* Inside the function parameter list, surrounding
10612 template-parameter-lists do not apply. */
10613 saved_num_template_parameter_lists
10614 = parser->num_template_parameter_lists;
10615 parser->num_template_parameter_lists = 0;
10617 /* Parse the parameter-declaration-clause. */
10618 params = cp_parser_parameter_declaration_clause (parser);
10620 parser->num_template_parameter_lists
10621 = saved_num_template_parameter_lists;
10623 /* If all went well, parse the cv-qualifier-seq and the
10624 exception-specification. */
10625 if (cp_parser_parse_definitely (parser))
10627 tree cv_qualifiers;
10628 tree exception_specification;
10630 if (ctor_dtor_or_conv_p)
10631 *ctor_dtor_or_conv_p = *ctor_dtor_or_conv_p < 0;
10633 /* Consume the `)'. */
10634 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
10636 /* Parse the cv-qualifier-seq. */
10637 cv_qualifiers = cp_parser_cv_qualifier_seq_opt (parser);
10638 /* And the exception-specification. */
10639 exception_specification
10640 = cp_parser_exception_specification_opt (parser);
10642 /* Create the function-declarator. */
10643 declarator = make_call_declarator (declarator,
10646 exception_specification);
10647 /* Any subsequent parameter lists are to do with
10648 return type, so are not those of the declared
10650 parser->default_arg_ok_p = false;
10652 /* Repeat the main loop. */
10657 /* If this is the first, we can try a parenthesized
10661 bool saved_in_type_id_in_expr_p;
10663 parser->default_arg_ok_p = saved_default_arg_ok_p;
10664 parser->in_declarator_p = saved_in_declarator_p;
10666 /* Consume the `('. */
10667 cp_lexer_consume_token (parser->lexer);
10668 /* Parse the nested declarator. */
10669 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
10670 parser->in_type_id_in_expr_p = true;
10672 = cp_parser_declarator (parser, dcl_kind, ctor_dtor_or_conv_p,
10673 /*parenthesized_p=*/NULL);
10674 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
10676 /* Expect a `)'. */
10677 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
10678 declarator = error_mark_node;
10679 if (declarator == error_mark_node)
10682 goto handle_declarator;
10684 /* Otherwise, we must be done. */
10688 else if ((!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
10689 && token->type == CPP_OPEN_SQUARE)
10691 /* Parse an array-declarator. */
10694 if (ctor_dtor_or_conv_p)
10695 *ctor_dtor_or_conv_p = 0;
10698 parser->default_arg_ok_p = false;
10699 parser->in_declarator_p = true;
10700 /* Consume the `['. */
10701 cp_lexer_consume_token (parser->lexer);
10702 /* Peek at the next token. */
10703 token = cp_lexer_peek_token (parser->lexer);
10704 /* If the next token is `]', then there is no
10705 constant-expression. */
10706 if (token->type != CPP_CLOSE_SQUARE)
10708 bool non_constant_p;
10711 = cp_parser_constant_expression (parser,
10712 /*allow_non_constant=*/true,
10714 if (!non_constant_p)
10715 bounds = fold_non_dependent_expr (bounds);
10718 bounds = NULL_TREE;
10719 /* Look for the closing `]'. */
10720 if (!cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'"))
10722 declarator = error_mark_node;
10726 declarator = build_nt (ARRAY_REF, declarator, bounds);
10728 else if (first && dcl_kind != CP_PARSER_DECLARATOR_ABSTRACT)
10730 /* Parse a declarator-id */
10731 if (dcl_kind == CP_PARSER_DECLARATOR_EITHER)
10732 cp_parser_parse_tentatively (parser);
10733 declarator = cp_parser_declarator_id (parser);
10734 if (dcl_kind == CP_PARSER_DECLARATOR_EITHER)
10736 if (!cp_parser_parse_definitely (parser))
10737 declarator = error_mark_node;
10738 else if (TREE_CODE (declarator) != IDENTIFIER_NODE)
10740 cp_parser_error (parser, "expected unqualified-id");
10741 declarator = error_mark_node;
10745 if (declarator == error_mark_node)
10748 if (TREE_CODE (declarator) == SCOPE_REF
10749 && !current_scope ())
10751 tree scope = TREE_OPERAND (declarator, 0);
10753 /* In the declaration of a member of a template class
10754 outside of the class itself, the SCOPE will sometimes
10755 be a TYPENAME_TYPE. For example, given:
10757 template <typename T>
10758 int S<T>::R::i = 3;
10760 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
10761 this context, we must resolve S<T>::R to an ordinary
10762 type, rather than a typename type.
10764 The reason we normally avoid resolving TYPENAME_TYPEs
10765 is that a specialization of `S' might render
10766 `S<T>::R' not a type. However, if `S' is
10767 specialized, then this `i' will not be used, so there
10768 is no harm in resolving the types here. */
10769 if (TREE_CODE (scope) == TYPENAME_TYPE)
10773 /* Resolve the TYPENAME_TYPE. */
10774 type = resolve_typename_type (scope,
10775 /*only_current_p=*/false);
10776 /* If that failed, the declarator is invalid. */
10777 if (type == error_mark_node)
10778 error ("`%T::%D' is not a type",
10779 TYPE_CONTEXT (scope),
10780 TYPE_IDENTIFIER (scope));
10781 /* Build a new DECLARATOR. */
10782 declarator = build_nt (SCOPE_REF,
10784 TREE_OPERAND (declarator, 1));
10788 /* Check to see whether the declarator-id names a constructor,
10789 destructor, or conversion. */
10790 if (declarator && ctor_dtor_or_conv_p
10791 && ((TREE_CODE (declarator) == SCOPE_REF
10792 && CLASS_TYPE_P (TREE_OPERAND (declarator, 0)))
10793 || (TREE_CODE (declarator) != SCOPE_REF
10794 && at_class_scope_p ())))
10796 tree unqualified_name;
10799 /* Get the unqualified part of the name. */
10800 if (TREE_CODE (declarator) == SCOPE_REF)
10802 class_type = TREE_OPERAND (declarator, 0);
10803 unqualified_name = TREE_OPERAND (declarator, 1);
10807 class_type = current_class_type;
10808 unqualified_name = declarator;
10811 /* See if it names ctor, dtor or conv. */
10812 if (TREE_CODE (unqualified_name) == BIT_NOT_EXPR
10813 || IDENTIFIER_TYPENAME_P (unqualified_name)
10814 || constructor_name_p (unqualified_name, class_type)
10815 || (TREE_CODE (unqualified_name) == TYPE_DECL
10816 && same_type_p (TREE_TYPE (unqualified_name),
10818 *ctor_dtor_or_conv_p = -1;
10819 if (TREE_CODE (declarator) == SCOPE_REF
10820 && TREE_CODE (unqualified_name) == TYPE_DECL
10821 && CLASSTYPE_USE_TEMPLATE (TREE_TYPE (unqualified_name)))
10823 error ("invalid use of constructor as a template");
10824 inform ("use `%T::%D' instead of `%T::%T' to name the "
10825 "constructor in a qualified name", class_type,
10826 DECL_NAME (TYPE_TI_TEMPLATE (class_type)),
10827 class_type, class_type);
10831 handle_declarator:;
10832 scope = get_scope_of_declarator (declarator);
10834 /* Any names that appear after the declarator-id for a
10835 member are looked up in the containing scope. */
10836 pop_p = push_scope (scope);
10837 parser->in_declarator_p = true;
10838 if ((ctor_dtor_or_conv_p && *ctor_dtor_or_conv_p)
10840 && (TREE_CODE (declarator) == SCOPE_REF
10841 || TREE_CODE (declarator) == IDENTIFIER_NODE)))
10842 /* Default args are only allowed on function
10844 parser->default_arg_ok_p = saved_default_arg_ok_p;
10846 parser->default_arg_ok_p = false;
10855 /* For an abstract declarator, we might wind up with nothing at this
10856 point. That's an error; the declarator is not optional. */
10858 cp_parser_error (parser, "expected declarator");
10860 /* If we entered a scope, we must exit it now. */
10864 parser->default_arg_ok_p = saved_default_arg_ok_p;
10865 parser->in_declarator_p = saved_in_declarator_p;
10870 /* Parse a ptr-operator.
10873 * cv-qualifier-seq [opt]
10875 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
10880 & cv-qualifier-seq [opt]
10882 Returns INDIRECT_REF if a pointer, or pointer-to-member, was
10883 used. Returns ADDR_EXPR if a reference was used. In the
10884 case of a pointer-to-member, *TYPE is filled in with the
10885 TYPE containing the member. *CV_QUALIFIER_SEQ is filled in
10886 with the cv-qualifier-seq, or NULL_TREE, if there are no
10887 cv-qualifiers. Returns ERROR_MARK if an error occurred. */
10889 static enum tree_code
10890 cp_parser_ptr_operator (cp_parser* parser,
10892 tree* cv_qualifier_seq)
10894 enum tree_code code = ERROR_MARK;
10897 /* Assume that it's not a pointer-to-member. */
10899 /* And that there are no cv-qualifiers. */
10900 *cv_qualifier_seq = NULL_TREE;
10902 /* Peek at the next token. */
10903 token = cp_lexer_peek_token (parser->lexer);
10904 /* If it's a `*' or `&' we have a pointer or reference. */
10905 if (token->type == CPP_MULT || token->type == CPP_AND)
10907 /* Remember which ptr-operator we were processing. */
10908 code = (token->type == CPP_AND ? ADDR_EXPR : INDIRECT_REF);
10910 /* Consume the `*' or `&'. */
10911 cp_lexer_consume_token (parser->lexer);
10913 /* A `*' can be followed by a cv-qualifier-seq, and so can a
10914 `&', if we are allowing GNU extensions. (The only qualifier
10915 that can legally appear after `&' is `restrict', but that is
10916 enforced during semantic analysis. */
10917 if (code == INDIRECT_REF
10918 || cp_parser_allow_gnu_extensions_p (parser))
10919 *cv_qualifier_seq = cp_parser_cv_qualifier_seq_opt (parser);
10923 /* Try the pointer-to-member case. */
10924 cp_parser_parse_tentatively (parser);
10925 /* Look for the optional `::' operator. */
10926 cp_parser_global_scope_opt (parser,
10927 /*current_scope_valid_p=*/false);
10928 /* Look for the nested-name specifier. */
10929 cp_parser_nested_name_specifier (parser,
10930 /*typename_keyword_p=*/false,
10931 /*check_dependency_p=*/true,
10933 /*is_declaration=*/false);
10934 /* If we found it, and the next token is a `*', then we are
10935 indeed looking at a pointer-to-member operator. */
10936 if (!cp_parser_error_occurred (parser)
10937 && cp_parser_require (parser, CPP_MULT, "`*'"))
10939 /* The type of which the member is a member is given by the
10941 *type = parser->scope;
10942 /* The next name will not be qualified. */
10943 parser->scope = NULL_TREE;
10944 parser->qualifying_scope = NULL_TREE;
10945 parser->object_scope = NULL_TREE;
10946 /* Indicate that the `*' operator was used. */
10947 code = INDIRECT_REF;
10948 /* Look for the optional cv-qualifier-seq. */
10949 *cv_qualifier_seq = cp_parser_cv_qualifier_seq_opt (parser);
10951 /* If that didn't work we don't have a ptr-operator. */
10952 if (!cp_parser_parse_definitely (parser))
10953 cp_parser_error (parser, "expected ptr-operator");
10959 /* Parse an (optional) cv-qualifier-seq.
10962 cv-qualifier cv-qualifier-seq [opt]
10964 Returns a TREE_LIST. The TREE_VALUE of each node is the
10965 representation of a cv-qualifier. */
10968 cp_parser_cv_qualifier_seq_opt (cp_parser* parser)
10970 tree cv_qualifiers = NULL_TREE;
10976 /* Look for the next cv-qualifier. */
10977 cv_qualifier = cp_parser_cv_qualifier_opt (parser);
10978 /* If we didn't find one, we're done. */
10982 /* Add this cv-qualifier to the list. */
10984 = tree_cons (NULL_TREE, cv_qualifier, cv_qualifiers);
10987 /* We built up the list in reverse order. */
10988 return nreverse (cv_qualifiers);
10991 /* Parse an (optional) cv-qualifier.
11003 cp_parser_cv_qualifier_opt (cp_parser* parser)
11006 tree cv_qualifier = NULL_TREE;
11008 /* Peek at the next token. */
11009 token = cp_lexer_peek_token (parser->lexer);
11010 /* See if it's a cv-qualifier. */
11011 switch (token->keyword)
11016 /* Save the value of the token. */
11017 cv_qualifier = token->value;
11018 /* Consume the token. */
11019 cp_lexer_consume_token (parser->lexer);
11026 return cv_qualifier;
11029 /* Parse a declarator-id.
11033 :: [opt] nested-name-specifier [opt] type-name
11035 In the `id-expression' case, the value returned is as for
11036 cp_parser_id_expression if the id-expression was an unqualified-id.
11037 If the id-expression was a qualified-id, then a SCOPE_REF is
11038 returned. The first operand is the scope (either a NAMESPACE_DECL
11039 or TREE_TYPE), but the second is still just a representation of an
11043 cp_parser_declarator_id (cp_parser* parser)
11045 tree id_expression;
11047 /* The expression must be an id-expression. Assume that qualified
11048 names are the names of types so that:
11051 int S<T>::R::i = 3;
11053 will work; we must treat `S<T>::R' as the name of a type.
11054 Similarly, assume that qualified names are templates, where
11058 int S<T>::R<T>::i = 3;
11061 id_expression = cp_parser_id_expression (parser,
11062 /*template_keyword_p=*/false,
11063 /*check_dependency_p=*/false,
11064 /*template_p=*/NULL,
11065 /*declarator_p=*/true);
11066 /* If the name was qualified, create a SCOPE_REF to represent
11070 id_expression = build_nt (SCOPE_REF, parser->scope, id_expression);
11071 parser->scope = NULL_TREE;
11074 return id_expression;
11077 /* Parse a type-id.
11080 type-specifier-seq abstract-declarator [opt]
11082 Returns the TYPE specified. */
11085 cp_parser_type_id (cp_parser* parser)
11087 tree type_specifier_seq;
11088 tree abstract_declarator;
11090 /* Parse the type-specifier-seq. */
11092 = cp_parser_type_specifier_seq (parser);
11093 if (type_specifier_seq == error_mark_node)
11094 return error_mark_node;
11096 /* There might or might not be an abstract declarator. */
11097 cp_parser_parse_tentatively (parser);
11098 /* Look for the declarator. */
11099 abstract_declarator
11100 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_ABSTRACT, NULL,
11101 /*parenthesized_p=*/NULL);
11102 /* Check to see if there really was a declarator. */
11103 if (!cp_parser_parse_definitely (parser))
11104 abstract_declarator = NULL_TREE;
11106 return groktypename (build_tree_list (type_specifier_seq,
11107 abstract_declarator));
11110 /* Parse a type-specifier-seq.
11112 type-specifier-seq:
11113 type-specifier type-specifier-seq [opt]
11117 type-specifier-seq:
11118 attributes type-specifier-seq [opt]
11120 Returns a TREE_LIST. Either the TREE_VALUE of each node is a
11121 type-specifier, or the TREE_PURPOSE is a list of attributes. */
11124 cp_parser_type_specifier_seq (cp_parser* parser)
11126 bool seen_type_specifier = false;
11127 tree type_specifier_seq = NULL_TREE;
11129 /* Parse the type-specifiers and attributes. */
11132 tree type_specifier;
11134 /* Check for attributes first. */
11135 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
11137 type_specifier_seq = tree_cons (cp_parser_attributes_opt (parser),
11139 type_specifier_seq);
11143 /* After the first type-specifier, others are optional. */
11144 if (seen_type_specifier)
11145 cp_parser_parse_tentatively (parser);
11146 /* Look for the type-specifier. */
11147 type_specifier = cp_parser_type_specifier (parser,
11148 CP_PARSER_FLAGS_NONE,
11149 /*is_friend=*/false,
11150 /*is_declaration=*/false,
11153 /* If the first type-specifier could not be found, this is not a
11154 type-specifier-seq at all. */
11155 if (!seen_type_specifier && type_specifier == error_mark_node)
11156 return error_mark_node;
11157 /* If subsequent type-specifiers could not be found, the
11158 type-specifier-seq is complete. */
11159 else if (seen_type_specifier && !cp_parser_parse_definitely (parser))
11162 /* Add the new type-specifier to the list. */
11164 = tree_cons (NULL_TREE, type_specifier, type_specifier_seq);
11165 seen_type_specifier = true;
11168 /* We built up the list in reverse order. */
11169 return nreverse (type_specifier_seq);
11172 /* Parse a parameter-declaration-clause.
11174 parameter-declaration-clause:
11175 parameter-declaration-list [opt] ... [opt]
11176 parameter-declaration-list , ...
11178 Returns a representation for the parameter declarations. Each node
11179 is a TREE_LIST. (See cp_parser_parameter_declaration for the exact
11180 representation.) If the parameter-declaration-clause ends with an
11181 ellipsis, PARMLIST_ELLIPSIS_P will hold of the first node in the
11182 list. A return value of NULL_TREE indicates a
11183 parameter-declaration-clause consisting only of an ellipsis. */
11186 cp_parser_parameter_declaration_clause (cp_parser* parser)
11192 /* Peek at the next token. */
11193 token = cp_lexer_peek_token (parser->lexer);
11194 /* Check for trivial parameter-declaration-clauses. */
11195 if (token->type == CPP_ELLIPSIS)
11197 /* Consume the `...' token. */
11198 cp_lexer_consume_token (parser->lexer);
11201 else if (token->type == CPP_CLOSE_PAREN)
11202 /* There are no parameters. */
11204 #ifndef NO_IMPLICIT_EXTERN_C
11205 if (in_system_header && current_class_type == NULL
11206 && current_lang_name == lang_name_c)
11210 return void_list_node;
11212 /* Check for `(void)', too, which is a special case. */
11213 else if (token->keyword == RID_VOID
11214 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
11215 == CPP_CLOSE_PAREN))
11217 /* Consume the `void' token. */
11218 cp_lexer_consume_token (parser->lexer);
11219 /* There are no parameters. */
11220 return void_list_node;
11223 /* Parse the parameter-declaration-list. */
11224 parameters = cp_parser_parameter_declaration_list (parser);
11225 /* If a parse error occurred while parsing the
11226 parameter-declaration-list, then the entire
11227 parameter-declaration-clause is erroneous. */
11228 if (parameters == error_mark_node)
11229 return error_mark_node;
11231 /* Peek at the next token. */
11232 token = cp_lexer_peek_token (parser->lexer);
11233 /* If it's a `,', the clause should terminate with an ellipsis. */
11234 if (token->type == CPP_COMMA)
11236 /* Consume the `,'. */
11237 cp_lexer_consume_token (parser->lexer);
11238 /* Expect an ellipsis. */
11240 = (cp_parser_require (parser, CPP_ELLIPSIS, "`...'") != NULL);
11242 /* It might also be `...' if the optional trailing `,' was
11244 else if (token->type == CPP_ELLIPSIS)
11246 /* Consume the `...' token. */
11247 cp_lexer_consume_token (parser->lexer);
11248 /* And remember that we saw it. */
11252 ellipsis_p = false;
11254 /* Finish the parameter list. */
11255 return finish_parmlist (parameters, ellipsis_p);
11258 /* Parse a parameter-declaration-list.
11260 parameter-declaration-list:
11261 parameter-declaration
11262 parameter-declaration-list , parameter-declaration
11264 Returns a representation of the parameter-declaration-list, as for
11265 cp_parser_parameter_declaration_clause. However, the
11266 `void_list_node' is never appended to the list. */
11269 cp_parser_parameter_declaration_list (cp_parser* parser)
11271 tree parameters = NULL_TREE;
11273 /* Look for more parameters. */
11277 bool parenthesized_p;
11278 /* Parse the parameter. */
11280 = cp_parser_parameter_declaration (parser,
11281 /*template_parm_p=*/false,
11284 /* If a parse error occurred parsing the parameter declaration,
11285 then the entire parameter-declaration-list is erroneous. */
11286 if (parameter == error_mark_node)
11288 parameters = error_mark_node;
11291 /* Add the new parameter to the list. */
11292 TREE_CHAIN (parameter) = parameters;
11293 parameters = parameter;
11295 /* Peek at the next token. */
11296 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN)
11297 || cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
11298 /* The parameter-declaration-list is complete. */
11300 else if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
11304 /* Peek at the next token. */
11305 token = cp_lexer_peek_nth_token (parser->lexer, 2);
11306 /* If it's an ellipsis, then the list is complete. */
11307 if (token->type == CPP_ELLIPSIS)
11309 /* Otherwise, there must be more parameters. Consume the
11311 cp_lexer_consume_token (parser->lexer);
11312 /* When parsing something like:
11314 int i(float f, double d)
11316 we can tell after seeing the declaration for "f" that we
11317 are not looking at an initialization of a variable "i",
11318 but rather at the declaration of a function "i".
11320 Due to the fact that the parsing of template arguments
11321 (as specified to a template-id) requires backtracking we
11322 cannot use this technique when inside a template argument
11324 if (!parser->in_template_argument_list_p
11325 && !parser->in_type_id_in_expr_p
11326 && cp_parser_parsing_tentatively (parser)
11327 && !cp_parser_committed_to_tentative_parse (parser)
11328 /* However, a parameter-declaration of the form
11329 "foat(f)" (which is a valid declaration of a
11330 parameter "f") can also be interpreted as an
11331 expression (the conversion of "f" to "float"). */
11332 && !parenthesized_p)
11333 cp_parser_commit_to_tentative_parse (parser);
11337 cp_parser_error (parser, "expected `,' or `...'");
11338 if (!cp_parser_parsing_tentatively (parser)
11339 || cp_parser_committed_to_tentative_parse (parser))
11340 cp_parser_skip_to_closing_parenthesis (parser,
11341 /*recovering=*/true,
11342 /*or_comma=*/false,
11343 /*consume_paren=*/false);
11348 /* We built up the list in reverse order; straighten it out now. */
11349 return nreverse (parameters);
11352 /* Parse a parameter declaration.
11354 parameter-declaration:
11355 decl-specifier-seq declarator
11356 decl-specifier-seq declarator = assignment-expression
11357 decl-specifier-seq abstract-declarator [opt]
11358 decl-specifier-seq abstract-declarator [opt] = assignment-expression
11360 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
11361 declares a template parameter. (In that case, a non-nested `>'
11362 token encountered during the parsing of the assignment-expression
11363 is not interpreted as a greater-than operator.)
11365 Returns a TREE_LIST representing the parameter-declaration. The
11366 TREE_PURPOSE is the default argument expression, or NULL_TREE if
11367 there is no default argument. The TREE_VALUE is a representation
11368 of the decl-specifier-seq and declarator. In particular, the
11369 TREE_VALUE will be a TREE_LIST whose TREE_PURPOSE represents the
11370 decl-specifier-seq and whose TREE_VALUE represents the declarator.
11371 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
11372 the declarator is of the form "(p)". */
11375 cp_parser_parameter_declaration (cp_parser *parser,
11376 bool template_parm_p,
11377 bool *parenthesized_p)
11379 int declares_class_or_enum;
11380 bool greater_than_is_operator_p;
11381 tree decl_specifiers;
11384 tree default_argument;
11387 const char *saved_message;
11389 /* In a template parameter, `>' is not an operator.
11393 When parsing a default template-argument for a non-type
11394 template-parameter, the first non-nested `>' is taken as the end
11395 of the template parameter-list rather than a greater-than
11397 greater_than_is_operator_p = !template_parm_p;
11399 /* Type definitions may not appear in parameter types. */
11400 saved_message = parser->type_definition_forbidden_message;
11401 parser->type_definition_forbidden_message
11402 = "types may not be defined in parameter types";
11404 /* Parse the declaration-specifiers. */
11406 = cp_parser_decl_specifier_seq (parser,
11407 CP_PARSER_FLAGS_NONE,
11409 &declares_class_or_enum);
11410 /* If an error occurred, there's no reason to attempt to parse the
11411 rest of the declaration. */
11412 if (cp_parser_error_occurred (parser))
11414 parser->type_definition_forbidden_message = saved_message;
11415 return error_mark_node;
11418 /* Peek at the next token. */
11419 token = cp_lexer_peek_token (parser->lexer);
11420 /* If the next token is a `)', `,', `=', `>', or `...', then there
11421 is no declarator. */
11422 if (token->type == CPP_CLOSE_PAREN
11423 || token->type == CPP_COMMA
11424 || token->type == CPP_EQ
11425 || token->type == CPP_ELLIPSIS
11426 || token->type == CPP_GREATER)
11428 declarator = NULL_TREE;
11429 if (parenthesized_p)
11430 *parenthesized_p = false;
11432 /* Otherwise, there should be a declarator. */
11435 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
11436 parser->default_arg_ok_p = false;
11438 /* After seeing a decl-specifier-seq, if the next token is not a
11439 "(", there is no possibility that the code is a valid
11440 expression. Therefore, if parsing tentatively, we commit at
11442 if (!parser->in_template_argument_list_p
11443 /* In an expression context, having seen:
11447 we cannot be sure whether we are looking at a
11448 function-type (taking a "char" as a parameter) or a cast
11449 of some object of type "char" to "int". */
11450 && !parser->in_type_id_in_expr_p
11451 && cp_parser_parsing_tentatively (parser)
11452 && !cp_parser_committed_to_tentative_parse (parser)
11453 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
11454 cp_parser_commit_to_tentative_parse (parser);
11455 /* Parse the declarator. */
11456 declarator = cp_parser_declarator (parser,
11457 CP_PARSER_DECLARATOR_EITHER,
11458 /*ctor_dtor_or_conv_p=*/NULL,
11460 parser->default_arg_ok_p = saved_default_arg_ok_p;
11461 /* After the declarator, allow more attributes. */
11462 attributes = chainon (attributes, cp_parser_attributes_opt (parser));
11465 /* The restriction on defining new types applies only to the type
11466 of the parameter, not to the default argument. */
11467 parser->type_definition_forbidden_message = saved_message;
11469 /* If the next token is `=', then process a default argument. */
11470 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
11472 bool saved_greater_than_is_operator_p;
11473 /* Consume the `='. */
11474 cp_lexer_consume_token (parser->lexer);
11476 /* If we are defining a class, then the tokens that make up the
11477 default argument must be saved and processed later. */
11478 if (!template_parm_p && at_class_scope_p ()
11479 && TYPE_BEING_DEFINED (current_class_type))
11481 unsigned depth = 0;
11483 /* Create a DEFAULT_ARG to represented the unparsed default
11485 default_argument = make_node (DEFAULT_ARG);
11486 DEFARG_TOKENS (default_argument) = cp_token_cache_new ();
11488 /* Add tokens until we have processed the entire default
11495 /* Peek at the next token. */
11496 token = cp_lexer_peek_token (parser->lexer);
11497 /* What we do depends on what token we have. */
11498 switch (token->type)
11500 /* In valid code, a default argument must be
11501 immediately followed by a `,' `)', or `...'. */
11503 case CPP_CLOSE_PAREN:
11505 /* If we run into a non-nested `;', `}', or `]',
11506 then the code is invalid -- but the default
11507 argument is certainly over. */
11508 case CPP_SEMICOLON:
11509 case CPP_CLOSE_BRACE:
11510 case CPP_CLOSE_SQUARE:
11513 /* Update DEPTH, if necessary. */
11514 else if (token->type == CPP_CLOSE_PAREN
11515 || token->type == CPP_CLOSE_BRACE
11516 || token->type == CPP_CLOSE_SQUARE)
11520 case CPP_OPEN_PAREN:
11521 case CPP_OPEN_SQUARE:
11522 case CPP_OPEN_BRACE:
11527 /* If we see a non-nested `>', and `>' is not an
11528 operator, then it marks the end of the default
11530 if (!depth && !greater_than_is_operator_p)
11534 /* If we run out of tokens, issue an error message. */
11536 error ("file ends in default argument");
11542 /* In these cases, we should look for template-ids.
11543 For example, if the default argument is
11544 `X<int, double>()', we need to do name lookup to
11545 figure out whether or not `X' is a template; if
11546 so, the `,' does not end the default argument.
11548 That is not yet done. */
11555 /* If we've reached the end, stop. */
11559 /* Add the token to the token block. */
11560 token = cp_lexer_consume_token (parser->lexer);
11561 cp_token_cache_push_token (DEFARG_TOKENS (default_argument),
11565 /* Outside of a class definition, we can just parse the
11566 assignment-expression. */
11569 bool saved_local_variables_forbidden_p;
11571 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
11573 saved_greater_than_is_operator_p
11574 = parser->greater_than_is_operator_p;
11575 parser->greater_than_is_operator_p = greater_than_is_operator_p;
11576 /* Local variable names (and the `this' keyword) may not
11577 appear in a default argument. */
11578 saved_local_variables_forbidden_p
11579 = parser->local_variables_forbidden_p;
11580 parser->local_variables_forbidden_p = true;
11581 /* Parse the assignment-expression. */
11582 default_argument = cp_parser_assignment_expression (parser);
11583 /* Restore saved state. */
11584 parser->greater_than_is_operator_p
11585 = saved_greater_than_is_operator_p;
11586 parser->local_variables_forbidden_p
11587 = saved_local_variables_forbidden_p;
11589 if (!parser->default_arg_ok_p)
11591 if (!flag_pedantic_errors)
11592 warning ("deprecated use of default argument for parameter of non-function");
11595 error ("default arguments are only permitted for function parameters");
11596 default_argument = NULL_TREE;
11601 default_argument = NULL_TREE;
11603 /* Create the representation of the parameter. */
11605 decl_specifiers = tree_cons (attributes, NULL_TREE, decl_specifiers);
11606 parameter = build_tree_list (default_argument,
11607 build_tree_list (decl_specifiers,
11613 /* Parse a function-body.
11616 compound_statement */
11619 cp_parser_function_body (cp_parser *parser)
11621 cp_parser_compound_statement (parser, false);
11624 /* Parse a ctor-initializer-opt followed by a function-body. Return
11625 true if a ctor-initializer was present. */
11628 cp_parser_ctor_initializer_opt_and_function_body (cp_parser *parser)
11631 bool ctor_initializer_p;
11633 /* Begin the function body. */
11634 body = begin_function_body ();
11635 /* Parse the optional ctor-initializer. */
11636 ctor_initializer_p = cp_parser_ctor_initializer_opt (parser);
11637 /* Parse the function-body. */
11638 cp_parser_function_body (parser);
11639 /* Finish the function body. */
11640 finish_function_body (body);
11642 return ctor_initializer_p;
11645 /* Parse an initializer.
11648 = initializer-clause
11649 ( expression-list )
11651 Returns a expression representing the initializer. If no
11652 initializer is present, NULL_TREE is returned.
11654 *IS_PARENTHESIZED_INIT is set to TRUE if the `( expression-list )'
11655 production is used, and zero otherwise. *IS_PARENTHESIZED_INIT is
11656 set to FALSE if there is no initializer present. If there is an
11657 initializer, and it is not a constant-expression, *NON_CONSTANT_P
11658 is set to true; otherwise it is set to false. */
11661 cp_parser_initializer (cp_parser* parser, bool* is_parenthesized_init,
11662 bool* non_constant_p)
11667 /* Peek at the next token. */
11668 token = cp_lexer_peek_token (parser->lexer);
11670 /* Let our caller know whether or not this initializer was
11672 *is_parenthesized_init = (token->type == CPP_OPEN_PAREN);
11673 /* Assume that the initializer is constant. */
11674 *non_constant_p = false;
11676 if (token->type == CPP_EQ)
11678 /* Consume the `='. */
11679 cp_lexer_consume_token (parser->lexer);
11680 /* Parse the initializer-clause. */
11681 init = cp_parser_initializer_clause (parser, non_constant_p);
11683 else if (token->type == CPP_OPEN_PAREN)
11684 init = cp_parser_parenthesized_expression_list (parser, false,
11688 /* Anything else is an error. */
11689 cp_parser_error (parser, "expected initializer");
11690 init = error_mark_node;
11696 /* Parse an initializer-clause.
11698 initializer-clause:
11699 assignment-expression
11700 { initializer-list , [opt] }
11703 Returns an expression representing the initializer.
11705 If the `assignment-expression' production is used the value
11706 returned is simply a representation for the expression.
11708 Otherwise, a CONSTRUCTOR is returned. The CONSTRUCTOR_ELTS will be
11709 the elements of the initializer-list (or NULL_TREE, if the last
11710 production is used). The TREE_TYPE for the CONSTRUCTOR will be
11711 NULL_TREE. There is no way to detect whether or not the optional
11712 trailing `,' was provided. NON_CONSTANT_P is as for
11713 cp_parser_initializer. */
11716 cp_parser_initializer_clause (cp_parser* parser, bool* non_constant_p)
11720 /* If it is not a `{', then we are looking at an
11721 assignment-expression. */
11722 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
11725 = cp_parser_constant_expression (parser,
11726 /*allow_non_constant_p=*/true,
11728 if (!*non_constant_p)
11729 initializer = fold_non_dependent_expr (initializer);
11733 /* Consume the `{' token. */
11734 cp_lexer_consume_token (parser->lexer);
11735 /* Create a CONSTRUCTOR to represent the braced-initializer. */
11736 initializer = make_node (CONSTRUCTOR);
11737 /* If it's not a `}', then there is a non-trivial initializer. */
11738 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
11740 /* Parse the initializer list. */
11741 CONSTRUCTOR_ELTS (initializer)
11742 = cp_parser_initializer_list (parser, non_constant_p);
11743 /* A trailing `,' token is allowed. */
11744 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
11745 cp_lexer_consume_token (parser->lexer);
11747 /* Now, there should be a trailing `}'. */
11748 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
11751 return initializer;
11754 /* Parse an initializer-list.
11758 initializer-list , initializer-clause
11763 identifier : initializer-clause
11764 initializer-list, identifier : initializer-clause
11766 Returns a TREE_LIST. The TREE_VALUE of each node is an expression
11767 for the initializer. If the TREE_PURPOSE is non-NULL, it is the
11768 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
11769 as for cp_parser_initializer. */
11772 cp_parser_initializer_list (cp_parser* parser, bool* non_constant_p)
11774 tree initializers = NULL_TREE;
11776 /* Assume all of the expressions are constant. */
11777 *non_constant_p = false;
11779 /* Parse the rest of the list. */
11785 bool clause_non_constant_p;
11787 /* If the next token is an identifier and the following one is a
11788 colon, we are looking at the GNU designated-initializer
11790 if (cp_parser_allow_gnu_extensions_p (parser)
11791 && cp_lexer_next_token_is (parser->lexer, CPP_NAME)
11792 && cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_COLON)
11794 /* Consume the identifier. */
11795 identifier = cp_lexer_consume_token (parser->lexer)->value;
11796 /* Consume the `:'. */
11797 cp_lexer_consume_token (parser->lexer);
11800 identifier = NULL_TREE;
11802 /* Parse the initializer. */
11803 initializer = cp_parser_initializer_clause (parser,
11804 &clause_non_constant_p);
11805 /* If any clause is non-constant, so is the entire initializer. */
11806 if (clause_non_constant_p)
11807 *non_constant_p = true;
11808 /* Add it to the list. */
11809 initializers = tree_cons (identifier, initializer, initializers);
11811 /* If the next token is not a comma, we have reached the end of
11813 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
11816 /* Peek at the next token. */
11817 token = cp_lexer_peek_nth_token (parser->lexer, 2);
11818 /* If the next token is a `}', then we're still done. An
11819 initializer-clause can have a trailing `,' after the
11820 initializer-list and before the closing `}'. */
11821 if (token->type == CPP_CLOSE_BRACE)
11824 /* Consume the `,' token. */
11825 cp_lexer_consume_token (parser->lexer);
11828 /* The initializers were built up in reverse order, so we need to
11829 reverse them now. */
11830 return nreverse (initializers);
11833 /* Classes [gram.class] */
11835 /* Parse a class-name.
11841 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
11842 to indicate that names looked up in dependent types should be
11843 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
11844 keyword has been used to indicate that the name that appears next
11845 is a template. TYPE_P is true iff the next name should be treated
11846 as class-name, even if it is declared to be some other kind of name
11847 as well. If CHECK_DEPENDENCY_P is FALSE, names are looked up in
11848 dependent scopes. If CLASS_HEAD_P is TRUE, this class is the class
11849 being defined in a class-head.
11851 Returns the TYPE_DECL representing the class. */
11854 cp_parser_class_name (cp_parser *parser,
11855 bool typename_keyword_p,
11856 bool template_keyword_p,
11858 bool check_dependency_p,
11860 bool is_declaration)
11867 /* All class-names start with an identifier. */
11868 token = cp_lexer_peek_token (parser->lexer);
11869 if (token->type != CPP_NAME && token->type != CPP_TEMPLATE_ID)
11871 cp_parser_error (parser, "expected class-name");
11872 return error_mark_node;
11875 /* PARSER->SCOPE can be cleared when parsing the template-arguments
11876 to a template-id, so we save it here. */
11877 scope = parser->scope;
11878 if (scope == error_mark_node)
11879 return error_mark_node;
11881 /* Any name names a type if we're following the `typename' keyword
11882 in a qualified name where the enclosing scope is type-dependent. */
11883 typename_p = (typename_keyword_p && scope && TYPE_P (scope)
11884 && dependent_type_p (scope));
11885 /* Handle the common case (an identifier, but not a template-id)
11887 if (token->type == CPP_NAME
11888 && !cp_parser_nth_token_starts_template_argument_list_p (parser, 2))
11892 /* Look for the identifier. */
11893 identifier = cp_parser_identifier (parser);
11894 /* If the next token isn't an identifier, we are certainly not
11895 looking at a class-name. */
11896 if (identifier == error_mark_node)
11897 decl = error_mark_node;
11898 /* If we know this is a type-name, there's no need to look it
11900 else if (typename_p)
11904 /* If the next token is a `::', then the name must be a type
11907 [basic.lookup.qual]
11909 During the lookup for a name preceding the :: scope
11910 resolution operator, object, function, and enumerator
11911 names are ignored. */
11912 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
11914 /* Look up the name. */
11915 decl = cp_parser_lookup_name (parser, identifier,
11917 /*is_template=*/false,
11918 /*is_namespace=*/false,
11919 check_dependency_p);
11924 /* Try a template-id. */
11925 decl = cp_parser_template_id (parser, template_keyword_p,
11926 check_dependency_p,
11928 if (decl == error_mark_node)
11929 return error_mark_node;
11932 decl = cp_parser_maybe_treat_template_as_class (decl, class_head_p);
11934 /* If this is a typename, create a TYPENAME_TYPE. */
11935 if (typename_p && decl != error_mark_node)
11937 decl = make_typename_type (scope, decl, /*complain=*/1);
11938 if (decl != error_mark_node)
11939 decl = TYPE_NAME (decl);
11942 /* Check to see that it is really the name of a class. */
11943 if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
11944 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
11945 && cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
11946 /* Situations like this:
11948 template <typename T> struct A {
11949 typename T::template X<int>::I i;
11952 are problematic. Is `T::template X<int>' a class-name? The
11953 standard does not seem to be definitive, but there is no other
11954 valid interpretation of the following `::'. Therefore, those
11955 names are considered class-names. */
11956 decl = TYPE_NAME (make_typename_type (scope, decl, tf_error));
11957 else if (decl == error_mark_node
11958 || TREE_CODE (decl) != TYPE_DECL
11959 || !IS_AGGR_TYPE (TREE_TYPE (decl)))
11961 cp_parser_error (parser, "expected class-name");
11962 return error_mark_node;
11968 /* Parse a class-specifier.
11971 class-head { member-specification [opt] }
11973 Returns the TREE_TYPE representing the class. */
11976 cp_parser_class_specifier (cp_parser* parser)
11980 tree attributes = NULL_TREE;
11981 int has_trailing_semicolon;
11982 bool nested_name_specifier_p;
11983 unsigned saved_num_template_parameter_lists;
11984 bool pop_p = false;
11986 push_deferring_access_checks (dk_no_deferred);
11988 /* Parse the class-head. */
11989 type = cp_parser_class_head (parser,
11990 &nested_name_specifier_p,
11992 /* If the class-head was a semantic disaster, skip the entire body
11996 cp_parser_skip_to_end_of_block_or_statement (parser);
11997 pop_deferring_access_checks ();
11998 return error_mark_node;
12001 /* Look for the `{'. */
12002 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "`{'"))
12004 pop_deferring_access_checks ();
12005 return error_mark_node;
12008 /* Issue an error message if type-definitions are forbidden here. */
12009 cp_parser_check_type_definition (parser);
12010 /* Remember that we are defining one more class. */
12011 ++parser->num_classes_being_defined;
12012 /* Inside the class, surrounding template-parameter-lists do not
12014 saved_num_template_parameter_lists
12015 = parser->num_template_parameter_lists;
12016 parser->num_template_parameter_lists = 0;
12018 /* Start the class. */
12019 if (nested_name_specifier_p)
12020 pop_p = push_scope (CP_DECL_CONTEXT (TYPE_MAIN_DECL (type)));
12021 type = begin_class_definition (type);
12022 if (type == error_mark_node)
12023 /* If the type is erroneous, skip the entire body of the class. */
12024 cp_parser_skip_to_closing_brace (parser);
12026 /* Parse the member-specification. */
12027 cp_parser_member_specification_opt (parser);
12028 /* Look for the trailing `}'. */
12029 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
12030 /* We get better error messages by noticing a common problem: a
12031 missing trailing `;'. */
12032 token = cp_lexer_peek_token (parser->lexer);
12033 has_trailing_semicolon = (token->type == CPP_SEMICOLON);
12034 /* Look for trailing attributes to apply to this class. */
12035 if (cp_parser_allow_gnu_extensions_p (parser))
12037 tree sub_attr = cp_parser_attributes_opt (parser);
12038 attributes = chainon (attributes, sub_attr);
12040 if (type != error_mark_node)
12041 type = finish_struct (type, attributes);
12043 pop_scope (CP_DECL_CONTEXT (TYPE_MAIN_DECL (type)));
12044 /* If this class is not itself within the scope of another class,
12045 then we need to parse the bodies of all of the queued function
12046 definitions. Note that the queued functions defined in a class
12047 are not always processed immediately following the
12048 class-specifier for that class. Consider:
12051 struct B { void f() { sizeof (A); } };
12054 If `f' were processed before the processing of `A' were
12055 completed, there would be no way to compute the size of `A'.
12056 Note that the nesting we are interested in here is lexical --
12057 not the semantic nesting given by TYPE_CONTEXT. In particular,
12060 struct A { struct B; };
12061 struct A::B { void f() { } };
12063 there is no need to delay the parsing of `A::B::f'. */
12064 if (--parser->num_classes_being_defined == 0)
12069 /* In a first pass, parse default arguments to the functions.
12070 Then, in a second pass, parse the bodies of the functions.
12071 This two-phased approach handles cases like:
12079 for (TREE_PURPOSE (parser->unparsed_functions_queues)
12080 = nreverse (TREE_PURPOSE (parser->unparsed_functions_queues));
12081 (queue_entry = TREE_PURPOSE (parser->unparsed_functions_queues));
12082 TREE_PURPOSE (parser->unparsed_functions_queues)
12083 = TREE_CHAIN (TREE_PURPOSE (parser->unparsed_functions_queues)))
12085 fn = TREE_VALUE (queue_entry);
12086 /* Make sure that any template parameters are in scope. */
12087 maybe_begin_member_template_processing (fn);
12088 /* If there are default arguments that have not yet been processed,
12089 take care of them now. */
12090 cp_parser_late_parsing_default_args (parser, fn);
12091 /* Remove any template parameters from the symbol table. */
12092 maybe_end_member_template_processing ();
12094 /* Now parse the body of the functions. */
12095 for (TREE_VALUE (parser->unparsed_functions_queues)
12096 = nreverse (TREE_VALUE (parser->unparsed_functions_queues));
12097 (queue_entry = TREE_VALUE (parser->unparsed_functions_queues));
12098 TREE_VALUE (parser->unparsed_functions_queues)
12099 = TREE_CHAIN (TREE_VALUE (parser->unparsed_functions_queues)))
12101 /* Figure out which function we need to process. */
12102 fn = TREE_VALUE (queue_entry);
12104 /* A hack to prevent garbage collection. */
12107 /* Parse the function. */
12108 cp_parser_late_parsing_for_member (parser, fn);
12114 /* Put back any saved access checks. */
12115 pop_deferring_access_checks ();
12117 /* Restore the count of active template-parameter-lists. */
12118 parser->num_template_parameter_lists
12119 = saved_num_template_parameter_lists;
12124 /* Parse a class-head.
12127 class-key identifier [opt] base-clause [opt]
12128 class-key nested-name-specifier identifier base-clause [opt]
12129 class-key nested-name-specifier [opt] template-id
12133 class-key attributes identifier [opt] base-clause [opt]
12134 class-key attributes nested-name-specifier identifier base-clause [opt]
12135 class-key attributes nested-name-specifier [opt] template-id
12138 Returns the TYPE of the indicated class. Sets
12139 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
12140 involving a nested-name-specifier was used, and FALSE otherwise.
12142 Returns NULL_TREE if the class-head is syntactically valid, but
12143 semantically invalid in a way that means we should skip the entire
12144 body of the class. */
12147 cp_parser_class_head (cp_parser* parser,
12148 bool* nested_name_specifier_p,
12149 tree *attributes_p)
12152 tree nested_name_specifier;
12153 enum tag_types class_key;
12154 tree id = NULL_TREE;
12155 tree type = NULL_TREE;
12157 bool template_id_p = false;
12158 bool qualified_p = false;
12159 bool invalid_nested_name_p = false;
12160 bool invalid_explicit_specialization_p = false;
12161 bool pop_p = false;
12162 unsigned num_templates;
12164 /* Assume no nested-name-specifier will be present. */
12165 *nested_name_specifier_p = false;
12166 /* Assume no template parameter lists will be used in defining the
12170 /* Look for the class-key. */
12171 class_key = cp_parser_class_key (parser);
12172 if (class_key == none_type)
12173 return error_mark_node;
12175 /* Parse the attributes. */
12176 attributes = cp_parser_attributes_opt (parser);
12178 /* If the next token is `::', that is invalid -- but sometimes
12179 people do try to write:
12183 Handle this gracefully by accepting the extra qualifier, and then
12184 issuing an error about it later if this really is a
12185 class-head. If it turns out just to be an elaborated type
12186 specifier, remain silent. */
12187 if (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false))
12188 qualified_p = true;
12190 push_deferring_access_checks (dk_no_check);
12192 /* Determine the name of the class. Begin by looking for an
12193 optional nested-name-specifier. */
12194 nested_name_specifier
12195 = cp_parser_nested_name_specifier_opt (parser,
12196 /*typename_keyword_p=*/false,
12197 /*check_dependency_p=*/false,
12199 /*is_declaration=*/false);
12200 /* If there was a nested-name-specifier, then there *must* be an
12202 if (nested_name_specifier)
12204 /* Although the grammar says `identifier', it really means
12205 `class-name' or `template-name'. You are only allowed to
12206 define a class that has already been declared with this
12209 The proposed resolution for Core Issue 180 says that whever
12210 you see `class T::X' you should treat `X' as a type-name.
12212 It is OK to define an inaccessible class; for example:
12214 class A { class B; };
12217 We do not know if we will see a class-name, or a
12218 template-name. We look for a class-name first, in case the
12219 class-name is a template-id; if we looked for the
12220 template-name first we would stop after the template-name. */
12221 cp_parser_parse_tentatively (parser);
12222 type = cp_parser_class_name (parser,
12223 /*typename_keyword_p=*/false,
12224 /*template_keyword_p=*/false,
12226 /*check_dependency_p=*/false,
12227 /*class_head_p=*/true,
12228 /*is_declaration=*/false);
12229 /* If that didn't work, ignore the nested-name-specifier. */
12230 if (!cp_parser_parse_definitely (parser))
12232 invalid_nested_name_p = true;
12233 id = cp_parser_identifier (parser);
12234 if (id == error_mark_node)
12237 /* If we could not find a corresponding TYPE, treat this
12238 declaration like an unqualified declaration. */
12239 if (type == error_mark_node)
12240 nested_name_specifier = NULL_TREE;
12241 /* Otherwise, count the number of templates used in TYPE and its
12242 containing scopes. */
12247 for (scope = TREE_TYPE (type);
12248 scope && TREE_CODE (scope) != NAMESPACE_DECL;
12249 scope = (TYPE_P (scope)
12250 ? TYPE_CONTEXT (scope)
12251 : DECL_CONTEXT (scope)))
12253 && CLASS_TYPE_P (scope)
12254 && CLASSTYPE_TEMPLATE_INFO (scope)
12255 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope))
12256 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (scope))
12260 /* Otherwise, the identifier is optional. */
12263 /* We don't know whether what comes next is a template-id,
12264 an identifier, or nothing at all. */
12265 cp_parser_parse_tentatively (parser);
12266 /* Check for a template-id. */
12267 id = cp_parser_template_id (parser,
12268 /*template_keyword_p=*/false,
12269 /*check_dependency_p=*/true,
12270 /*is_declaration=*/true);
12271 /* If that didn't work, it could still be an identifier. */
12272 if (!cp_parser_parse_definitely (parser))
12274 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
12275 id = cp_parser_identifier (parser);
12281 template_id_p = true;
12286 pop_deferring_access_checks ();
12289 cp_parser_check_for_invalid_template_id (parser, id);
12291 /* If it's not a `:' or a `{' then we can't really be looking at a
12292 class-head, since a class-head only appears as part of a
12293 class-specifier. We have to detect this situation before calling
12294 xref_tag, since that has irreversible side-effects. */
12295 if (!cp_parser_next_token_starts_class_definition_p (parser))
12297 cp_parser_error (parser, "expected `{' or `:'");
12298 return error_mark_node;
12301 /* At this point, we're going ahead with the class-specifier, even
12302 if some other problem occurs. */
12303 cp_parser_commit_to_tentative_parse (parser);
12304 /* Issue the error about the overly-qualified name now. */
12306 cp_parser_error (parser,
12307 "global qualification of class name is invalid");
12308 else if (invalid_nested_name_p)
12309 cp_parser_error (parser,
12310 "qualified name does not name a class");
12311 else if (nested_name_specifier)
12314 /* Figure out in what scope the declaration is being placed. */
12315 scope = current_scope ();
12317 scope = current_namespace;
12318 /* If that scope does not contain the scope in which the
12319 class was originally declared, the program is invalid. */
12320 if (scope && !is_ancestor (scope, nested_name_specifier))
12322 error ("declaration of `%D' in `%D' which does not "
12323 "enclose `%D'", type, scope, nested_name_specifier);
12329 A declarator-id shall not be qualified exception of the
12330 definition of a ... nested class outside of its class
12331 ... [or] a the definition or explicit instantiation of a
12332 class member of a namespace outside of its namespace. */
12333 if (scope == nested_name_specifier)
12335 pedwarn ("extra qualification ignored");
12336 nested_name_specifier = NULL_TREE;
12340 /* An explicit-specialization must be preceded by "template <>". If
12341 it is not, try to recover gracefully. */
12342 if (at_namespace_scope_p ()
12343 && parser->num_template_parameter_lists == 0
12346 error ("an explicit specialization must be preceded by 'template <>'");
12347 invalid_explicit_specialization_p = true;
12348 /* Take the same action that would have been taken by
12349 cp_parser_explicit_specialization. */
12350 ++parser->num_template_parameter_lists;
12351 begin_specialization ();
12353 /* There must be no "return" statements between this point and the
12354 end of this function; set "type "to the correct return value and
12355 use "goto done;" to return. */
12356 /* Make sure that the right number of template parameters were
12358 if (!cp_parser_check_template_parameters (parser, num_templates))
12360 /* If something went wrong, there is no point in even trying to
12361 process the class-definition. */
12366 /* Look up the type. */
12369 type = TREE_TYPE (id);
12370 maybe_process_partial_specialization (type);
12372 else if (!nested_name_specifier)
12374 /* If the class was unnamed, create a dummy name. */
12376 id = make_anon_name ();
12377 type = xref_tag (class_key, id, /*globalize=*/false,
12378 parser->num_template_parameter_lists);
12383 bool pop_p = false;
12387 template <typename T> struct S { struct T };
12388 template <typename T> struct S<T>::T { };
12390 we will get a TYPENAME_TYPE when processing the definition of
12391 `S::T'. We need to resolve it to the actual type before we
12392 try to define it. */
12393 if (TREE_CODE (TREE_TYPE (type)) == TYPENAME_TYPE)
12395 class_type = resolve_typename_type (TREE_TYPE (type),
12396 /*only_current_p=*/false);
12397 if (class_type != error_mark_node)
12398 type = TYPE_NAME (class_type);
12401 cp_parser_error (parser, "could not resolve typename type");
12402 type = error_mark_node;
12406 maybe_process_partial_specialization (TREE_TYPE (type));
12407 class_type = current_class_type;
12408 /* Enter the scope indicated by the nested-name-specifier. */
12409 if (nested_name_specifier)
12410 pop_p = push_scope (nested_name_specifier);
12411 /* Get the canonical version of this type. */
12412 type = TYPE_MAIN_DECL (TREE_TYPE (type));
12413 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
12414 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (type)))
12415 type = push_template_decl (type);
12416 type = TREE_TYPE (type);
12417 if (nested_name_specifier)
12419 *nested_name_specifier_p = true;
12421 pop_scope (nested_name_specifier);
12424 /* Indicate whether this class was declared as a `class' or as a
12426 if (TREE_CODE (type) == RECORD_TYPE)
12427 CLASSTYPE_DECLARED_CLASS (type) = (class_key == class_type);
12428 cp_parser_check_class_key (class_key, type);
12430 /* Enter the scope containing the class; the names of base classes
12431 should be looked up in that context. For example, given:
12433 struct A { struct B {}; struct C; };
12434 struct A::C : B {};
12437 if (nested_name_specifier)
12438 pop_p = push_scope (nested_name_specifier);
12439 /* Now, look for the base-clause. */
12440 token = cp_lexer_peek_token (parser->lexer);
12441 if (token->type == CPP_COLON)
12445 /* Get the list of base-classes. */
12446 bases = cp_parser_base_clause (parser);
12447 /* Process them. */
12448 xref_basetypes (type, bases);
12450 /* Leave the scope given by the nested-name-specifier. We will
12451 enter the class scope itself while processing the members. */
12453 pop_scope (nested_name_specifier);
12456 if (invalid_explicit_specialization_p)
12458 end_specialization ();
12459 --parser->num_template_parameter_lists;
12461 *attributes_p = attributes;
12465 /* Parse a class-key.
12472 Returns the kind of class-key specified, or none_type to indicate
12475 static enum tag_types
12476 cp_parser_class_key (cp_parser* parser)
12479 enum tag_types tag_type;
12481 /* Look for the class-key. */
12482 token = cp_parser_require (parser, CPP_KEYWORD, "class-key");
12486 /* Check to see if the TOKEN is a class-key. */
12487 tag_type = cp_parser_token_is_class_key (token);
12489 cp_parser_error (parser, "expected class-key");
12493 /* Parse an (optional) member-specification.
12495 member-specification:
12496 member-declaration member-specification [opt]
12497 access-specifier : member-specification [opt] */
12500 cp_parser_member_specification_opt (cp_parser* parser)
12507 /* Peek at the next token. */
12508 token = cp_lexer_peek_token (parser->lexer);
12509 /* If it's a `}', or EOF then we've seen all the members. */
12510 if (token->type == CPP_CLOSE_BRACE || token->type == CPP_EOF)
12513 /* See if this token is a keyword. */
12514 keyword = token->keyword;
12518 case RID_PROTECTED:
12520 /* Consume the access-specifier. */
12521 cp_lexer_consume_token (parser->lexer);
12522 /* Remember which access-specifier is active. */
12523 current_access_specifier = token->value;
12524 /* Look for the `:'. */
12525 cp_parser_require (parser, CPP_COLON, "`:'");
12529 /* Otherwise, the next construction must be a
12530 member-declaration. */
12531 cp_parser_member_declaration (parser);
12536 /* Parse a member-declaration.
12538 member-declaration:
12539 decl-specifier-seq [opt] member-declarator-list [opt] ;
12540 function-definition ; [opt]
12541 :: [opt] nested-name-specifier template [opt] unqualified-id ;
12543 template-declaration
12545 member-declarator-list:
12547 member-declarator-list , member-declarator
12550 declarator pure-specifier [opt]
12551 declarator constant-initializer [opt]
12552 identifier [opt] : constant-expression
12556 member-declaration:
12557 __extension__ member-declaration
12560 declarator attributes [opt] pure-specifier [opt]
12561 declarator attributes [opt] constant-initializer [opt]
12562 identifier [opt] attributes [opt] : constant-expression */
12565 cp_parser_member_declaration (cp_parser* parser)
12567 tree decl_specifiers;
12568 tree prefix_attributes;
12570 int declares_class_or_enum;
12573 int saved_pedantic;
12575 /* Check for the `__extension__' keyword. */
12576 if (cp_parser_extension_opt (parser, &saved_pedantic))
12579 cp_parser_member_declaration (parser);
12580 /* Restore the old value of the PEDANTIC flag. */
12581 pedantic = saved_pedantic;
12586 /* Check for a template-declaration. */
12587 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
12589 /* Parse the template-declaration. */
12590 cp_parser_template_declaration (parser, /*member_p=*/true);
12595 /* Check for a using-declaration. */
12596 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_USING))
12598 /* Parse the using-declaration. */
12599 cp_parser_using_declaration (parser);
12604 /* Parse the decl-specifier-seq. */
12606 = cp_parser_decl_specifier_seq (parser,
12607 CP_PARSER_FLAGS_OPTIONAL,
12608 &prefix_attributes,
12609 &declares_class_or_enum);
12610 /* Check for an invalid type-name. */
12611 if (cp_parser_parse_and_diagnose_invalid_type_name (parser))
12613 /* If there is no declarator, then the decl-specifier-seq should
12615 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
12617 /* If there was no decl-specifier-seq, and the next token is a
12618 `;', then we have something like:
12624 Each member-declaration shall declare at least one member
12625 name of the class. */
12626 if (!decl_specifiers)
12629 pedwarn ("extra semicolon");
12635 /* See if this declaration is a friend. */
12636 friend_p = cp_parser_friend_p (decl_specifiers);
12637 /* If there were decl-specifiers, check to see if there was
12638 a class-declaration. */
12639 type = check_tag_decl (decl_specifiers);
12640 /* Nested classes have already been added to the class, but
12641 a `friend' needs to be explicitly registered. */
12644 /* If the `friend' keyword was present, the friend must
12645 be introduced with a class-key. */
12646 if (!declares_class_or_enum)
12647 error ("a class-key must be used when declaring a friend");
12650 template <typename T> struct A {
12651 friend struct A<T>::B;
12654 A<T>::B will be represented by a TYPENAME_TYPE, and
12655 therefore not recognized by check_tag_decl. */
12660 for (specifier = decl_specifiers;
12662 specifier = TREE_CHAIN (specifier))
12664 tree s = TREE_VALUE (specifier);
12666 if (TREE_CODE (s) == IDENTIFIER_NODE)
12667 get_global_value_if_present (s, &type);
12668 if (TREE_CODE (s) == TYPE_DECL)
12677 if (!type || !TYPE_P (type))
12678 error ("friend declaration does not name a class or "
12681 make_friend_class (current_class_type, type,
12682 /*complain=*/true);
12684 /* If there is no TYPE, an error message will already have
12688 /* An anonymous aggregate has to be handled specially; such
12689 a declaration really declares a data member (with a
12690 particular type), as opposed to a nested class. */
12691 else if (ANON_AGGR_TYPE_P (type))
12693 /* Remove constructors and such from TYPE, now that we
12694 know it is an anonymous aggregate. */
12695 fixup_anonymous_aggr (type);
12696 /* And make the corresponding data member. */
12697 decl = build_decl (FIELD_DECL, NULL_TREE, type);
12698 /* Add it to the class. */
12699 finish_member_declaration (decl);
12702 cp_parser_check_access_in_redeclaration (TYPE_NAME (type));
12707 /* See if these declarations will be friends. */
12708 friend_p = cp_parser_friend_p (decl_specifiers);
12710 /* Keep going until we hit the `;' at the end of the
12712 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
12714 tree attributes = NULL_TREE;
12715 tree first_attribute;
12717 /* Peek at the next token. */
12718 token = cp_lexer_peek_token (parser->lexer);
12720 /* Check for a bitfield declaration. */
12721 if (token->type == CPP_COLON
12722 || (token->type == CPP_NAME
12723 && cp_lexer_peek_nth_token (parser->lexer, 2)->type
12729 /* Get the name of the bitfield. Note that we cannot just
12730 check TOKEN here because it may have been invalidated by
12731 the call to cp_lexer_peek_nth_token above. */
12732 if (cp_lexer_peek_token (parser->lexer)->type != CPP_COLON)
12733 identifier = cp_parser_identifier (parser);
12735 identifier = NULL_TREE;
12737 /* Consume the `:' token. */
12738 cp_lexer_consume_token (parser->lexer);
12739 /* Get the width of the bitfield. */
12741 = cp_parser_constant_expression (parser,
12742 /*allow_non_constant=*/false,
12745 /* Look for attributes that apply to the bitfield. */
12746 attributes = cp_parser_attributes_opt (parser);
12747 /* Remember which attributes are prefix attributes and
12749 first_attribute = attributes;
12750 /* Combine the attributes. */
12751 attributes = chainon (prefix_attributes, attributes);
12753 /* Create the bitfield declaration. */
12754 decl = grokbitfield (identifier,
12757 /* Apply the attributes. */
12758 cplus_decl_attributes (&decl, attributes, /*flags=*/0);
12764 tree asm_specification;
12765 int ctor_dtor_or_conv_p;
12767 /* Parse the declarator. */
12769 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
12770 &ctor_dtor_or_conv_p,
12771 /*parenthesized_p=*/NULL);
12773 /* If something went wrong parsing the declarator, make sure
12774 that we at least consume some tokens. */
12775 if (declarator == error_mark_node)
12777 /* Skip to the end of the statement. */
12778 cp_parser_skip_to_end_of_statement (parser);
12779 /* If the next token is not a semicolon, that is
12780 probably because we just skipped over the body of
12781 a function. So, we consume a semicolon if
12782 present, but do not issue an error message if it
12784 if (cp_lexer_next_token_is (parser->lexer,
12786 cp_lexer_consume_token (parser->lexer);
12790 cp_parser_check_for_definition_in_return_type
12791 (declarator, declares_class_or_enum);
12793 /* Look for an asm-specification. */
12794 asm_specification = cp_parser_asm_specification_opt (parser);
12795 /* Look for attributes that apply to the declaration. */
12796 attributes = cp_parser_attributes_opt (parser);
12797 /* Remember which attributes are prefix attributes and
12799 first_attribute = attributes;
12800 /* Combine the attributes. */
12801 attributes = chainon (prefix_attributes, attributes);
12803 /* If it's an `=', then we have a constant-initializer or a
12804 pure-specifier. It is not correct to parse the
12805 initializer before registering the member declaration
12806 since the member declaration should be in scope while
12807 its initializer is processed. However, the rest of the
12808 front end does not yet provide an interface that allows
12809 us to handle this correctly. */
12810 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
12814 A pure-specifier shall be used only in the declaration of
12815 a virtual function.
12817 A member-declarator can contain a constant-initializer
12818 only if it declares a static member of integral or
12821 Therefore, if the DECLARATOR is for a function, we look
12822 for a pure-specifier; otherwise, we look for a
12823 constant-initializer. When we call `grokfield', it will
12824 perform more stringent semantics checks. */
12825 if (TREE_CODE (declarator) == CALL_EXPR)
12826 initializer = cp_parser_pure_specifier (parser);
12828 /* Parse the initializer. */
12829 initializer = cp_parser_constant_initializer (parser);
12831 /* Otherwise, there is no initializer. */
12833 initializer = NULL_TREE;
12835 /* See if we are probably looking at a function
12836 definition. We are certainly not looking at at a
12837 member-declarator. Calling `grokfield' has
12838 side-effects, so we must not do it unless we are sure
12839 that we are looking at a member-declarator. */
12840 if (cp_parser_token_starts_function_definition_p
12841 (cp_lexer_peek_token (parser->lexer)))
12843 /* The grammar does not allow a pure-specifier to be
12844 used when a member function is defined. (It is
12845 possible that this fact is an oversight in the
12846 standard, since a pure function may be defined
12847 outside of the class-specifier. */
12849 error ("pure-specifier on function-definition");
12850 decl = cp_parser_save_member_function_body (parser,
12854 /* If the member was not a friend, declare it here. */
12856 finish_member_declaration (decl);
12857 /* Peek at the next token. */
12858 token = cp_lexer_peek_token (parser->lexer);
12859 /* If the next token is a semicolon, consume it. */
12860 if (token->type == CPP_SEMICOLON)
12861 cp_lexer_consume_token (parser->lexer);
12866 /* Create the declaration. */
12867 decl = grokfield (declarator, decl_specifiers,
12868 initializer, asm_specification,
12870 /* Any initialization must have been from a
12871 constant-expression. */
12872 if (decl && TREE_CODE (decl) == VAR_DECL && initializer)
12873 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = 1;
12877 /* Reset PREFIX_ATTRIBUTES. */
12878 while (attributes && TREE_CHAIN (attributes) != first_attribute)
12879 attributes = TREE_CHAIN (attributes);
12881 TREE_CHAIN (attributes) = NULL_TREE;
12883 /* If there is any qualification still in effect, clear it
12884 now; we will be starting fresh with the next declarator. */
12885 parser->scope = NULL_TREE;
12886 parser->qualifying_scope = NULL_TREE;
12887 parser->object_scope = NULL_TREE;
12888 /* If it's a `,', then there are more declarators. */
12889 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
12890 cp_lexer_consume_token (parser->lexer);
12891 /* If the next token isn't a `;', then we have a parse error. */
12892 else if (cp_lexer_next_token_is_not (parser->lexer,
12895 cp_parser_error (parser, "expected `;'");
12896 /* Skip tokens until we find a `;'. */
12897 cp_parser_skip_to_end_of_statement (parser);
12904 /* Add DECL to the list of members. */
12906 finish_member_declaration (decl);
12908 if (TREE_CODE (decl) == FUNCTION_DECL)
12909 cp_parser_save_default_args (parser, decl);
12914 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
12917 /* Parse a pure-specifier.
12922 Returns INTEGER_ZERO_NODE if a pure specifier is found.
12923 Otherwise, ERROR_MARK_NODE is returned. */
12926 cp_parser_pure_specifier (cp_parser* parser)
12930 /* Look for the `=' token. */
12931 if (!cp_parser_require (parser, CPP_EQ, "`='"))
12932 return error_mark_node;
12933 /* Look for the `0' token. */
12934 token = cp_parser_require (parser, CPP_NUMBER, "`0'");
12935 /* Unfortunately, this will accept `0L' and `0x00' as well. We need
12936 to get information from the lexer about how the number was
12937 spelled in order to fix this problem. */
12938 if (!token || !integer_zerop (token->value))
12939 return error_mark_node;
12941 return integer_zero_node;
12944 /* Parse a constant-initializer.
12946 constant-initializer:
12947 = constant-expression
12949 Returns a representation of the constant-expression. */
12952 cp_parser_constant_initializer (cp_parser* parser)
12954 /* Look for the `=' token. */
12955 if (!cp_parser_require (parser, CPP_EQ, "`='"))
12956 return error_mark_node;
12958 /* It is invalid to write:
12960 struct S { static const int i = { 7 }; };
12963 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
12965 cp_parser_error (parser,
12966 "a brace-enclosed initializer is not allowed here");
12967 /* Consume the opening brace. */
12968 cp_lexer_consume_token (parser->lexer);
12969 /* Skip the initializer. */
12970 cp_parser_skip_to_closing_brace (parser);
12971 /* Look for the trailing `}'. */
12972 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
12974 return error_mark_node;
12977 return cp_parser_constant_expression (parser,
12978 /*allow_non_constant=*/false,
12982 /* Derived classes [gram.class.derived] */
12984 /* Parse a base-clause.
12987 : base-specifier-list
12989 base-specifier-list:
12991 base-specifier-list , base-specifier
12993 Returns a TREE_LIST representing the base-classes, in the order in
12994 which they were declared. The representation of each node is as
12995 described by cp_parser_base_specifier.
12997 In the case that no bases are specified, this function will return
12998 NULL_TREE, not ERROR_MARK_NODE. */
13001 cp_parser_base_clause (cp_parser* parser)
13003 tree bases = NULL_TREE;
13005 /* Look for the `:' that begins the list. */
13006 cp_parser_require (parser, CPP_COLON, "`:'");
13008 /* Scan the base-specifier-list. */
13014 /* Look for the base-specifier. */
13015 base = cp_parser_base_specifier (parser);
13016 /* Add BASE to the front of the list. */
13017 if (base != error_mark_node)
13019 TREE_CHAIN (base) = bases;
13022 /* Peek at the next token. */
13023 token = cp_lexer_peek_token (parser->lexer);
13024 /* If it's not a comma, then the list is complete. */
13025 if (token->type != CPP_COMMA)
13027 /* Consume the `,'. */
13028 cp_lexer_consume_token (parser->lexer);
13031 /* PARSER->SCOPE may still be non-NULL at this point, if the last
13032 base class had a qualified name. However, the next name that
13033 appears is certainly not qualified. */
13034 parser->scope = NULL_TREE;
13035 parser->qualifying_scope = NULL_TREE;
13036 parser->object_scope = NULL_TREE;
13038 return nreverse (bases);
13041 /* Parse a base-specifier.
13044 :: [opt] nested-name-specifier [opt] class-name
13045 virtual access-specifier [opt] :: [opt] nested-name-specifier
13047 access-specifier virtual [opt] :: [opt] nested-name-specifier
13050 Returns a TREE_LIST. The TREE_PURPOSE will be one of
13051 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
13052 indicate the specifiers provided. The TREE_VALUE will be a TYPE
13053 (or the ERROR_MARK_NODE) indicating the type that was specified. */
13056 cp_parser_base_specifier (cp_parser* parser)
13060 bool virtual_p = false;
13061 bool duplicate_virtual_error_issued_p = false;
13062 bool duplicate_access_error_issued_p = false;
13063 bool class_scope_p, template_p;
13064 tree access = access_default_node;
13067 /* Process the optional `virtual' and `access-specifier'. */
13070 /* Peek at the next token. */
13071 token = cp_lexer_peek_token (parser->lexer);
13072 /* Process `virtual'. */
13073 switch (token->keyword)
13076 /* If `virtual' appears more than once, issue an error. */
13077 if (virtual_p && !duplicate_virtual_error_issued_p)
13079 cp_parser_error (parser,
13080 "`virtual' specified more than once in base-specified");
13081 duplicate_virtual_error_issued_p = true;
13086 /* Consume the `virtual' token. */
13087 cp_lexer_consume_token (parser->lexer);
13092 case RID_PROTECTED:
13094 /* If more than one access specifier appears, issue an
13096 if (access != access_default_node
13097 && !duplicate_access_error_issued_p)
13099 cp_parser_error (parser,
13100 "more than one access specifier in base-specified");
13101 duplicate_access_error_issued_p = true;
13104 access = ridpointers[(int) token->keyword];
13106 /* Consume the access-specifier. */
13107 cp_lexer_consume_token (parser->lexer);
13116 /* It is not uncommon to see programs mechanically, erroneously, use
13117 the 'typename' keyword to denote (dependent) qualified types
13118 as base classes. */
13119 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
13121 if (!processing_template_decl)
13122 error ("keyword `typename' not allowed outside of templates");
13124 error ("keyword `typename' not allowed in this context "
13125 "(the base class is implicitly a type)");
13126 cp_lexer_consume_token (parser->lexer);
13129 /* Look for the optional `::' operator. */
13130 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
13131 /* Look for the nested-name-specifier. The simplest way to
13136 The keyword `typename' is not permitted in a base-specifier or
13137 mem-initializer; in these contexts a qualified name that
13138 depends on a template-parameter is implicitly assumed to be a
13141 is to pretend that we have seen the `typename' keyword at this
13143 cp_parser_nested_name_specifier_opt (parser,
13144 /*typename_keyword_p=*/true,
13145 /*check_dependency_p=*/true,
13147 /*is_declaration=*/true);
13148 /* If the base class is given by a qualified name, assume that names
13149 we see are type names or templates, as appropriate. */
13150 class_scope_p = (parser->scope && TYPE_P (parser->scope));
13151 template_p = class_scope_p && cp_parser_optional_template_keyword (parser);
13153 /* Finally, look for the class-name. */
13154 type = cp_parser_class_name (parser,
13158 /*check_dependency_p=*/true,
13159 /*class_head_p=*/false,
13160 /*is_declaration=*/true);
13162 if (type == error_mark_node)
13163 return error_mark_node;
13165 return finish_base_specifier (TREE_TYPE (type), access, virtual_p);
13168 /* Exception handling [gram.exception] */
13170 /* Parse an (optional) exception-specification.
13172 exception-specification:
13173 throw ( type-id-list [opt] )
13175 Returns a TREE_LIST representing the exception-specification. The
13176 TREE_VALUE of each node is a type. */
13179 cp_parser_exception_specification_opt (cp_parser* parser)
13184 /* Peek at the next token. */
13185 token = cp_lexer_peek_token (parser->lexer);
13186 /* If it's not `throw', then there's no exception-specification. */
13187 if (!cp_parser_is_keyword (token, RID_THROW))
13190 /* Consume the `throw'. */
13191 cp_lexer_consume_token (parser->lexer);
13193 /* Look for the `('. */
13194 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13196 /* Peek at the next token. */
13197 token = cp_lexer_peek_token (parser->lexer);
13198 /* If it's not a `)', then there is a type-id-list. */
13199 if (token->type != CPP_CLOSE_PAREN)
13201 const char *saved_message;
13203 /* Types may not be defined in an exception-specification. */
13204 saved_message = parser->type_definition_forbidden_message;
13205 parser->type_definition_forbidden_message
13206 = "types may not be defined in an exception-specification";
13207 /* Parse the type-id-list. */
13208 type_id_list = cp_parser_type_id_list (parser);
13209 /* Restore the saved message. */
13210 parser->type_definition_forbidden_message = saved_message;
13213 type_id_list = empty_except_spec;
13215 /* Look for the `)'. */
13216 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13218 return type_id_list;
13221 /* Parse an (optional) type-id-list.
13225 type-id-list , type-id
13227 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
13228 in the order that the types were presented. */
13231 cp_parser_type_id_list (cp_parser* parser)
13233 tree types = NULL_TREE;
13240 /* Get the next type-id. */
13241 type = cp_parser_type_id (parser);
13242 /* Add it to the list. */
13243 types = add_exception_specifier (types, type, /*complain=*/1);
13244 /* Peek at the next token. */
13245 token = cp_lexer_peek_token (parser->lexer);
13246 /* If it is not a `,', we are done. */
13247 if (token->type != CPP_COMMA)
13249 /* Consume the `,'. */
13250 cp_lexer_consume_token (parser->lexer);
13253 return nreverse (types);
13256 /* Parse a try-block.
13259 try compound-statement handler-seq */
13262 cp_parser_try_block (cp_parser* parser)
13266 cp_parser_require_keyword (parser, RID_TRY, "`try'");
13267 try_block = begin_try_block ();
13268 cp_parser_compound_statement (parser, false);
13269 finish_try_block (try_block);
13270 cp_parser_handler_seq (parser);
13271 finish_handler_sequence (try_block);
13276 /* Parse a function-try-block.
13278 function-try-block:
13279 try ctor-initializer [opt] function-body handler-seq */
13282 cp_parser_function_try_block (cp_parser* parser)
13285 bool ctor_initializer_p;
13287 /* Look for the `try' keyword. */
13288 if (!cp_parser_require_keyword (parser, RID_TRY, "`try'"))
13290 /* Let the rest of the front-end know where we are. */
13291 try_block = begin_function_try_block ();
13292 /* Parse the function-body. */
13294 = cp_parser_ctor_initializer_opt_and_function_body (parser);
13295 /* We're done with the `try' part. */
13296 finish_function_try_block (try_block);
13297 /* Parse the handlers. */
13298 cp_parser_handler_seq (parser);
13299 /* We're done with the handlers. */
13300 finish_function_handler_sequence (try_block);
13302 return ctor_initializer_p;
13305 /* Parse a handler-seq.
13308 handler handler-seq [opt] */
13311 cp_parser_handler_seq (cp_parser* parser)
13317 /* Parse the handler. */
13318 cp_parser_handler (parser);
13319 /* Peek at the next token. */
13320 token = cp_lexer_peek_token (parser->lexer);
13321 /* If it's not `catch' then there are no more handlers. */
13322 if (!cp_parser_is_keyword (token, RID_CATCH))
13327 /* Parse a handler.
13330 catch ( exception-declaration ) compound-statement */
13333 cp_parser_handler (cp_parser* parser)
13338 cp_parser_require_keyword (parser, RID_CATCH, "`catch'");
13339 handler = begin_handler ();
13340 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13341 declaration = cp_parser_exception_declaration (parser);
13342 finish_handler_parms (declaration, handler);
13343 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13344 cp_parser_compound_statement (parser, false);
13345 finish_handler (handler);
13348 /* Parse an exception-declaration.
13350 exception-declaration:
13351 type-specifier-seq declarator
13352 type-specifier-seq abstract-declarator
13356 Returns a VAR_DECL for the declaration, or NULL_TREE if the
13357 ellipsis variant is used. */
13360 cp_parser_exception_declaration (cp_parser* parser)
13362 tree type_specifiers;
13364 const char *saved_message;
13366 /* If it's an ellipsis, it's easy to handle. */
13367 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
13369 /* Consume the `...' token. */
13370 cp_lexer_consume_token (parser->lexer);
13374 /* Types may not be defined in exception-declarations. */
13375 saved_message = parser->type_definition_forbidden_message;
13376 parser->type_definition_forbidden_message
13377 = "types may not be defined in exception-declarations";
13379 /* Parse the type-specifier-seq. */
13380 type_specifiers = cp_parser_type_specifier_seq (parser);
13381 /* If it's a `)', then there is no declarator. */
13382 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN))
13383 declarator = NULL_TREE;
13385 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_EITHER,
13386 /*ctor_dtor_or_conv_p=*/NULL,
13387 /*parenthesized_p=*/NULL);
13389 /* Restore the saved message. */
13390 parser->type_definition_forbidden_message = saved_message;
13392 return start_handler_parms (type_specifiers, declarator);
13395 /* Parse a throw-expression.
13398 throw assignment-expression [opt]
13400 Returns a THROW_EXPR representing the throw-expression. */
13403 cp_parser_throw_expression (cp_parser* parser)
13408 cp_parser_require_keyword (parser, RID_THROW, "`throw'");
13409 token = cp_lexer_peek_token (parser->lexer);
13410 /* Figure out whether or not there is an assignment-expression
13411 following the "throw" keyword. */
13412 if (token->type == CPP_COMMA
13413 || token->type == CPP_SEMICOLON
13414 || token->type == CPP_CLOSE_PAREN
13415 || token->type == CPP_CLOSE_SQUARE
13416 || token->type == CPP_CLOSE_BRACE
13417 || token->type == CPP_COLON)
13418 expression = NULL_TREE;
13420 expression = cp_parser_assignment_expression (parser);
13422 return build_throw (expression);
13425 /* GNU Extensions */
13427 /* Parse an (optional) asm-specification.
13430 asm ( string-literal )
13432 If the asm-specification is present, returns a STRING_CST
13433 corresponding to the string-literal. Otherwise, returns
13437 cp_parser_asm_specification_opt (cp_parser* parser)
13440 tree asm_specification;
13442 /* Peek at the next token. */
13443 token = cp_lexer_peek_token (parser->lexer);
13444 /* If the next token isn't the `asm' keyword, then there's no
13445 asm-specification. */
13446 if (!cp_parser_is_keyword (token, RID_ASM))
13449 /* Consume the `asm' token. */
13450 cp_lexer_consume_token (parser->lexer);
13451 /* Look for the `('. */
13452 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13454 /* Look for the string-literal. */
13455 token = cp_parser_require (parser, CPP_STRING, "string-literal");
13457 asm_specification = token->value;
13459 asm_specification = NULL_TREE;
13461 /* Look for the `)'. */
13462 cp_parser_require (parser, CPP_CLOSE_PAREN, "`('");
13464 return asm_specification;
13467 /* Parse an asm-operand-list.
13471 asm-operand-list , asm-operand
13474 string-literal ( expression )
13475 [ string-literal ] string-literal ( expression )
13477 Returns a TREE_LIST representing the operands. The TREE_VALUE of
13478 each node is the expression. The TREE_PURPOSE is itself a
13479 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
13480 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
13481 is a STRING_CST for the string literal before the parenthesis. */
13484 cp_parser_asm_operand_list (cp_parser* parser)
13486 tree asm_operands = NULL_TREE;
13490 tree string_literal;
13495 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
13497 /* Consume the `[' token. */
13498 cp_lexer_consume_token (parser->lexer);
13499 /* Read the operand name. */
13500 name = cp_parser_identifier (parser);
13501 if (name != error_mark_node)
13502 name = build_string (IDENTIFIER_LENGTH (name),
13503 IDENTIFIER_POINTER (name));
13504 /* Look for the closing `]'. */
13505 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
13509 /* Look for the string-literal. */
13510 token = cp_parser_require (parser, CPP_STRING, "string-literal");
13511 string_literal = token ? token->value : error_mark_node;
13512 c_lex_string_translate = 1;
13513 /* Look for the `('. */
13514 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13515 /* Parse the expression. */
13516 expression = cp_parser_expression (parser);
13517 /* Look for the `)'. */
13518 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13519 c_lex_string_translate = 0;
13520 /* Add this operand to the list. */
13521 asm_operands = tree_cons (build_tree_list (name, string_literal),
13524 /* If the next token is not a `,', there are no more
13526 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
13528 /* Consume the `,'. */
13529 cp_lexer_consume_token (parser->lexer);
13532 return nreverse (asm_operands);
13535 /* Parse an asm-clobber-list.
13539 asm-clobber-list , string-literal
13541 Returns a TREE_LIST, indicating the clobbers in the order that they
13542 appeared. The TREE_VALUE of each node is a STRING_CST. */
13545 cp_parser_asm_clobber_list (cp_parser* parser)
13547 tree clobbers = NULL_TREE;
13552 tree string_literal;
13554 /* Look for the string literal. */
13555 token = cp_parser_require (parser, CPP_STRING, "string-literal");
13556 string_literal = token ? token->value : error_mark_node;
13557 /* Add it to the list. */
13558 clobbers = tree_cons (NULL_TREE, string_literal, clobbers);
13559 /* If the next token is not a `,', then the list is
13561 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
13563 /* Consume the `,' token. */
13564 cp_lexer_consume_token (parser->lexer);
13570 /* Parse an (optional) series of attributes.
13573 attributes attribute
13576 __attribute__ (( attribute-list [opt] ))
13578 The return value is as for cp_parser_attribute_list. */
13581 cp_parser_attributes_opt (cp_parser* parser)
13583 tree attributes = NULL_TREE;
13588 tree attribute_list;
13590 /* Peek at the next token. */
13591 token = cp_lexer_peek_token (parser->lexer);
13592 /* If it's not `__attribute__', then we're done. */
13593 if (token->keyword != RID_ATTRIBUTE)
13596 /* Consume the `__attribute__' keyword. */
13597 cp_lexer_consume_token (parser->lexer);
13598 /* Look for the two `(' tokens. */
13599 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13600 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13602 /* Peek at the next token. */
13603 token = cp_lexer_peek_token (parser->lexer);
13604 if (token->type != CPP_CLOSE_PAREN)
13605 /* Parse the attribute-list. */
13606 attribute_list = cp_parser_attribute_list (parser);
13608 /* If the next token is a `)', then there is no attribute
13610 attribute_list = NULL;
13612 /* Look for the two `)' tokens. */
13613 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13614 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13616 /* Add these new attributes to the list. */
13617 attributes = chainon (attributes, attribute_list);
13623 /* Parse an attribute-list.
13627 attribute-list , attribute
13631 identifier ( identifier )
13632 identifier ( identifier , expression-list )
13633 identifier ( expression-list )
13635 Returns a TREE_LIST. Each node corresponds to an attribute. THe
13636 TREE_PURPOSE of each node is the identifier indicating which
13637 attribute is in use. The TREE_VALUE represents the arguments, if
13641 cp_parser_attribute_list (cp_parser* parser)
13643 tree attribute_list = NULL_TREE;
13645 c_lex_string_translate = 0;
13652 /* Look for the identifier. We also allow keywords here; for
13653 example `__attribute__ ((const))' is legal. */
13654 token = cp_lexer_peek_token (parser->lexer);
13655 if (token->type != CPP_NAME
13656 && token->type != CPP_KEYWORD)
13657 return error_mark_node;
13658 /* Consume the token. */
13659 token = cp_lexer_consume_token (parser->lexer);
13661 /* Save away the identifier that indicates which attribute this is. */
13662 identifier = token->value;
13663 attribute = build_tree_list (identifier, NULL_TREE);
13665 /* Peek at the next token. */
13666 token = cp_lexer_peek_token (parser->lexer);
13667 /* If it's an `(', then parse the attribute arguments. */
13668 if (token->type == CPP_OPEN_PAREN)
13672 arguments = (cp_parser_parenthesized_expression_list
13673 (parser, true, /*non_constant_p=*/NULL));
13674 /* Save the identifier and arguments away. */
13675 TREE_VALUE (attribute) = arguments;
13678 /* Add this attribute to the list. */
13679 TREE_CHAIN (attribute) = attribute_list;
13680 attribute_list = attribute;
13682 /* Now, look for more attributes. */
13683 token = cp_lexer_peek_token (parser->lexer);
13684 /* If the next token isn't a `,', we're done. */
13685 if (token->type != CPP_COMMA)
13688 /* Consume the comma and keep going. */
13689 cp_lexer_consume_token (parser->lexer);
13691 c_lex_string_translate = 1;
13693 /* We built up the list in reverse order. */
13694 return nreverse (attribute_list);
13697 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
13698 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
13699 current value of the PEDANTIC flag, regardless of whether or not
13700 the `__extension__' keyword is present. The caller is responsible
13701 for restoring the value of the PEDANTIC flag. */
13704 cp_parser_extension_opt (cp_parser* parser, int* saved_pedantic)
13706 /* Save the old value of the PEDANTIC flag. */
13707 *saved_pedantic = pedantic;
13709 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXTENSION))
13711 /* Consume the `__extension__' token. */
13712 cp_lexer_consume_token (parser->lexer);
13713 /* We're not being pedantic while the `__extension__' keyword is
13723 /* Parse a label declaration.
13726 __label__ label-declarator-seq ;
13728 label-declarator-seq:
13729 identifier , label-declarator-seq
13733 cp_parser_label_declaration (cp_parser* parser)
13735 /* Look for the `__label__' keyword. */
13736 cp_parser_require_keyword (parser, RID_LABEL, "`__label__'");
13742 /* Look for an identifier. */
13743 identifier = cp_parser_identifier (parser);
13744 /* Declare it as a lobel. */
13745 finish_label_decl (identifier);
13746 /* If the next token is a `;', stop. */
13747 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
13749 /* Look for the `,' separating the label declarations. */
13750 cp_parser_require (parser, CPP_COMMA, "`,'");
13753 /* Look for the final `;'. */
13754 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
13757 /* Support Functions */
13759 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
13760 NAME should have one of the representations used for an
13761 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
13762 is returned. If PARSER->SCOPE is a dependent type, then a
13763 SCOPE_REF is returned.
13765 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
13766 returned; the name was already resolved when the TEMPLATE_ID_EXPR
13767 was formed. Abstractly, such entities should not be passed to this
13768 function, because they do not need to be looked up, but it is
13769 simpler to check for this special case here, rather than at the
13772 In cases not explicitly covered above, this function returns a
13773 DECL, OVERLOAD, or baselink representing the result of the lookup.
13774 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
13777 If IS_TYPE is TRUE, bindings that do not refer to types are
13780 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
13783 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
13786 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
13790 cp_parser_lookup_name (cp_parser *parser, tree name,
13791 bool is_type, bool is_template, bool is_namespace,
13792 bool check_dependency)
13795 tree object_type = parser->context->object_type;
13797 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
13798 no longer valid. Note that if we are parsing tentatively, and
13799 the parse fails, OBJECT_TYPE will be automatically restored. */
13800 parser->context->object_type = NULL_TREE;
13802 if (name == error_mark_node)
13803 return error_mark_node;
13805 /* A template-id has already been resolved; there is no lookup to
13807 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
13809 if (BASELINK_P (name))
13811 my_friendly_assert ((TREE_CODE (BASELINK_FUNCTIONS (name))
13812 == TEMPLATE_ID_EXPR),
13817 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
13818 it should already have been checked to make sure that the name
13819 used matches the type being destroyed. */
13820 if (TREE_CODE (name) == BIT_NOT_EXPR)
13824 /* Figure out to which type this destructor applies. */
13826 type = parser->scope;
13827 else if (object_type)
13828 type = object_type;
13830 type = current_class_type;
13831 /* If that's not a class type, there is no destructor. */
13832 if (!type || !CLASS_TYPE_P (type))
13833 return error_mark_node;
13834 if (!CLASSTYPE_DESTRUCTORS (type))
13835 return error_mark_node;
13836 /* If it was a class type, return the destructor. */
13837 return CLASSTYPE_DESTRUCTORS (type);
13840 /* By this point, the NAME should be an ordinary identifier. If
13841 the id-expression was a qualified name, the qualifying scope is
13842 stored in PARSER->SCOPE at this point. */
13843 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE,
13846 /* Perform the lookup. */
13851 if (parser->scope == error_mark_node)
13852 return error_mark_node;
13854 /* If the SCOPE is dependent, the lookup must be deferred until
13855 the template is instantiated -- unless we are explicitly
13856 looking up names in uninstantiated templates. Even then, we
13857 cannot look up the name if the scope is not a class type; it
13858 might, for example, be a template type parameter. */
13859 dependent_p = (TYPE_P (parser->scope)
13860 && !(parser->in_declarator_p
13861 && currently_open_class (parser->scope))
13862 && dependent_type_p (parser->scope));
13863 if ((check_dependency || !CLASS_TYPE_P (parser->scope))
13867 /* The resolution to Core Issue 180 says that `struct A::B'
13868 should be considered a type-name, even if `A' is
13870 decl = TYPE_NAME (make_typename_type (parser->scope,
13873 else if (is_template)
13874 decl = make_unbound_class_template (parser->scope,
13878 decl = build_nt (SCOPE_REF, parser->scope, name);
13882 bool pop_p = false;
13884 /* If PARSER->SCOPE is a dependent type, then it must be a
13885 class type, and we must not be checking dependencies;
13886 otherwise, we would have processed this lookup above. So
13887 that PARSER->SCOPE is not considered a dependent base by
13888 lookup_member, we must enter the scope here. */
13890 pop_p = push_scope (parser->scope);
13891 /* If the PARSER->SCOPE is a a template specialization, it
13892 may be instantiated during name lookup. In that case,
13893 errors may be issued. Even if we rollback the current
13894 tentative parse, those errors are valid. */
13895 decl = lookup_qualified_name (parser->scope, name, is_type,
13896 /*complain=*/true);
13898 pop_scope (parser->scope);
13900 parser->qualifying_scope = parser->scope;
13901 parser->object_scope = NULL_TREE;
13903 else if (object_type)
13905 tree object_decl = NULL_TREE;
13906 /* Look up the name in the scope of the OBJECT_TYPE, unless the
13907 OBJECT_TYPE is not a class. */
13908 if (CLASS_TYPE_P (object_type))
13909 /* If the OBJECT_TYPE is a template specialization, it may
13910 be instantiated during name lookup. In that case, errors
13911 may be issued. Even if we rollback the current tentative
13912 parse, those errors are valid. */
13913 object_decl = lookup_member (object_type,
13915 /*protect=*/0, is_type);
13916 /* Look it up in the enclosing context, too. */
13917 decl = lookup_name_real (name, is_type, /*nonclass=*/0,
13920 parser->object_scope = object_type;
13921 parser->qualifying_scope = NULL_TREE;
13923 decl = object_decl;
13927 decl = lookup_name_real (name, is_type, /*nonclass=*/0,
13930 parser->qualifying_scope = NULL_TREE;
13931 parser->object_scope = NULL_TREE;
13934 /* If the lookup failed, let our caller know. */
13936 || decl == error_mark_node
13937 || (TREE_CODE (decl) == FUNCTION_DECL
13938 && DECL_ANTICIPATED (decl)))
13939 return error_mark_node;
13941 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
13942 if (TREE_CODE (decl) == TREE_LIST)
13944 /* The error message we have to print is too complicated for
13945 cp_parser_error, so we incorporate its actions directly. */
13946 if (!cp_parser_simulate_error (parser))
13948 error ("reference to `%D' is ambiguous", name);
13949 print_candidates (decl);
13951 return error_mark_node;
13954 my_friendly_assert (DECL_P (decl)
13955 || TREE_CODE (decl) == OVERLOAD
13956 || TREE_CODE (decl) == SCOPE_REF
13957 || TREE_CODE (decl) == UNBOUND_CLASS_TEMPLATE
13958 || BASELINK_P (decl),
13961 /* If we have resolved the name of a member declaration, check to
13962 see if the declaration is accessible. When the name resolves to
13963 set of overloaded functions, accessibility is checked when
13964 overload resolution is done.
13966 During an explicit instantiation, access is not checked at all,
13967 as per [temp.explicit]. */
13969 check_accessibility_of_qualified_id (decl, object_type, parser->scope);
13974 /* Like cp_parser_lookup_name, but for use in the typical case where
13975 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
13976 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
13979 cp_parser_lookup_name_simple (cp_parser* parser, tree name)
13981 return cp_parser_lookup_name (parser, name,
13983 /*is_template=*/false,
13984 /*is_namespace=*/false,
13985 /*check_dependency=*/true);
13988 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
13989 the current context, return the TYPE_DECL. If TAG_NAME_P is
13990 true, the DECL indicates the class being defined in a class-head,
13991 or declared in an elaborated-type-specifier.
13993 Otherwise, return DECL. */
13996 cp_parser_maybe_treat_template_as_class (tree decl, bool tag_name_p)
13998 /* If the TEMPLATE_DECL is being declared as part of a class-head,
13999 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
14002 template <typename T> struct B;
14005 template <typename T> struct A::B {};
14007 Similarly, in a elaborated-type-specifier:
14009 namespace N { struct X{}; }
14012 template <typename T> friend struct N::X;
14015 However, if the DECL refers to a class type, and we are in
14016 the scope of the class, then the name lookup automatically
14017 finds the TYPE_DECL created by build_self_reference rather
14018 than a TEMPLATE_DECL. For example, in:
14020 template <class T> struct S {
14024 there is no need to handle such case. */
14026 if (DECL_CLASS_TEMPLATE_P (decl) && tag_name_p)
14027 return DECL_TEMPLATE_RESULT (decl);
14032 /* If too many, or too few, template-parameter lists apply to the
14033 declarator, issue an error message. Returns TRUE if all went well,
14034 and FALSE otherwise. */
14037 cp_parser_check_declarator_template_parameters (cp_parser* parser,
14040 unsigned num_templates;
14042 /* We haven't seen any classes that involve template parameters yet. */
14045 switch (TREE_CODE (declarator))
14052 tree main_declarator = TREE_OPERAND (declarator, 0);
14054 cp_parser_check_declarator_template_parameters (parser,
14063 scope = TREE_OPERAND (declarator, 0);
14064 member = TREE_OPERAND (declarator, 1);
14066 /* If this is a pointer-to-member, then we are not interested
14067 in the SCOPE, because it does not qualify the thing that is
14069 if (TREE_CODE (member) == INDIRECT_REF)
14070 return (cp_parser_check_declarator_template_parameters
14073 while (scope && CLASS_TYPE_P (scope))
14075 /* You're supposed to have one `template <...>'
14076 for every template class, but you don't need one
14077 for a full specialization. For example:
14079 template <class T> struct S{};
14080 template <> struct S<int> { void f(); };
14081 void S<int>::f () {}
14083 is correct; there shouldn't be a `template <>' for
14084 the definition of `S<int>::f'. */
14085 if (CLASSTYPE_TEMPLATE_INFO (scope)
14086 && (CLASSTYPE_TEMPLATE_INSTANTIATION (scope)
14087 || uses_template_parms (CLASSTYPE_TI_ARGS (scope)))
14088 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope)))
14091 scope = TYPE_CONTEXT (scope);
14095 /* Fall through. */
14098 /* If the DECLARATOR has the form `X<y>' then it uses one
14099 additional level of template parameters. */
14100 if (TREE_CODE (declarator) == TEMPLATE_ID_EXPR)
14103 return cp_parser_check_template_parameters (parser,
14108 /* NUM_TEMPLATES were used in the current declaration. If that is
14109 invalid, return FALSE and issue an error messages. Otherwise,
14113 cp_parser_check_template_parameters (cp_parser* parser,
14114 unsigned num_templates)
14116 /* If there are more template classes than parameter lists, we have
14119 template <class T> void S<T>::R<T>::f (); */
14120 if (parser->num_template_parameter_lists < num_templates)
14122 error ("too few template-parameter-lists");
14125 /* If there are the same number of template classes and parameter
14126 lists, that's OK. */
14127 if (parser->num_template_parameter_lists == num_templates)
14129 /* If there are more, but only one more, then we are referring to a
14130 member template. That's OK too. */
14131 if (parser->num_template_parameter_lists == num_templates + 1)
14133 /* Otherwise, there are too many template parameter lists. We have
14136 template <class T> template <class U> void S::f(); */
14137 error ("too many template-parameter-lists");
14141 /* Parse a binary-expression of the general form:
14145 binary-expression <token> <expr>
14147 The TOKEN_TREE_MAP maps <token> types to <expr> codes. FN is used
14148 to parser the <expr>s. If the first production is used, then the
14149 value returned by FN is returned directly. Otherwise, a node with
14150 the indicated EXPR_TYPE is returned, with operands corresponding to
14151 the two sub-expressions. */
14154 cp_parser_binary_expression (cp_parser* parser,
14155 const cp_parser_token_tree_map token_tree_map,
14156 cp_parser_expression_fn fn)
14160 /* Parse the first expression. */
14161 lhs = (*fn) (parser);
14162 /* Now, look for more expressions. */
14166 const cp_parser_token_tree_map_node *map_node;
14169 /* Peek at the next token. */
14170 token = cp_lexer_peek_token (parser->lexer);
14171 /* If the token is `>', and that's not an operator at the
14172 moment, then we're done. */
14173 if (token->type == CPP_GREATER
14174 && !parser->greater_than_is_operator_p)
14176 /* If we find one of the tokens we want, build the corresponding
14177 tree representation. */
14178 for (map_node = token_tree_map;
14179 map_node->token_type != CPP_EOF;
14181 if (map_node->token_type == token->type)
14183 /* Assume that an overloaded operator will not be used. */
14184 bool overloaded_p = false;
14186 /* Consume the operator token. */
14187 cp_lexer_consume_token (parser->lexer);
14188 /* Parse the right-hand side of the expression. */
14189 rhs = (*fn) (parser);
14190 /* Build the binary tree node. */
14191 lhs = build_x_binary_op (map_node->tree_type, lhs, rhs,
14193 /* If the binary operator required the use of an
14194 overloaded operator, then this expression cannot be an
14195 integral constant-expression. An overloaded operator
14196 can be used even if both operands are otherwise
14197 permissible in an integral constant-expression if at
14198 least one of the operands is of enumeration type. */
14200 && (cp_parser_non_integral_constant_expression
14201 (parser, "calls to overloaded operators")))
14202 lhs = error_mark_node;
14206 /* If the token wasn't one of the ones we want, we're done. */
14207 if (map_node->token_type == CPP_EOF)
14214 /* Parse an optional `::' token indicating that the following name is
14215 from the global namespace. If so, PARSER->SCOPE is set to the
14216 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
14217 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
14218 Returns the new value of PARSER->SCOPE, if the `::' token is
14219 present, and NULL_TREE otherwise. */
14222 cp_parser_global_scope_opt (cp_parser* parser, bool current_scope_valid_p)
14226 /* Peek at the next token. */
14227 token = cp_lexer_peek_token (parser->lexer);
14228 /* If we're looking at a `::' token then we're starting from the
14229 global namespace, not our current location. */
14230 if (token->type == CPP_SCOPE)
14232 /* Consume the `::' token. */
14233 cp_lexer_consume_token (parser->lexer);
14234 /* Set the SCOPE so that we know where to start the lookup. */
14235 parser->scope = global_namespace;
14236 parser->qualifying_scope = global_namespace;
14237 parser->object_scope = NULL_TREE;
14239 return parser->scope;
14241 else if (!current_scope_valid_p)
14243 parser->scope = NULL_TREE;
14244 parser->qualifying_scope = NULL_TREE;
14245 parser->object_scope = NULL_TREE;
14251 /* Returns TRUE if the upcoming token sequence is the start of a
14252 constructor declarator. If FRIEND_P is true, the declarator is
14253 preceded by the `friend' specifier. */
14256 cp_parser_constructor_declarator_p (cp_parser *parser, bool friend_p)
14258 bool constructor_p;
14259 tree type_decl = NULL_TREE;
14260 bool nested_name_p;
14261 cp_token *next_token;
14263 /* The common case is that this is not a constructor declarator, so
14264 try to avoid doing lots of work if at all possible. It's not
14265 valid declare a constructor at function scope. */
14266 if (at_function_scope_p ())
14268 /* And only certain tokens can begin a constructor declarator. */
14269 next_token = cp_lexer_peek_token (parser->lexer);
14270 if (next_token->type != CPP_NAME
14271 && next_token->type != CPP_SCOPE
14272 && next_token->type != CPP_NESTED_NAME_SPECIFIER
14273 && next_token->type != CPP_TEMPLATE_ID)
14276 /* Parse tentatively; we are going to roll back all of the tokens
14278 cp_parser_parse_tentatively (parser);
14279 /* Assume that we are looking at a constructor declarator. */
14280 constructor_p = true;
14282 /* Look for the optional `::' operator. */
14283 cp_parser_global_scope_opt (parser,
14284 /*current_scope_valid_p=*/false);
14285 /* Look for the nested-name-specifier. */
14287 = (cp_parser_nested_name_specifier_opt (parser,
14288 /*typename_keyword_p=*/false,
14289 /*check_dependency_p=*/false,
14291 /*is_declaration=*/false)
14293 /* Outside of a class-specifier, there must be a
14294 nested-name-specifier. */
14295 if (!nested_name_p &&
14296 (!at_class_scope_p () || !TYPE_BEING_DEFINED (current_class_type)
14298 constructor_p = false;
14299 /* If we still think that this might be a constructor-declarator,
14300 look for a class-name. */
14305 template <typename T> struct S { S(); };
14306 template <typename T> S<T>::S ();
14308 we must recognize that the nested `S' names a class.
14311 template <typename T> S<T>::S<T> ();
14313 we must recognize that the nested `S' names a template. */
14314 type_decl = cp_parser_class_name (parser,
14315 /*typename_keyword_p=*/false,
14316 /*template_keyword_p=*/false,
14318 /*check_dependency_p=*/false,
14319 /*class_head_p=*/false,
14320 /*is_declaration=*/false);
14321 /* If there was no class-name, then this is not a constructor. */
14322 constructor_p = !cp_parser_error_occurred (parser);
14325 /* If we're still considering a constructor, we have to see a `(',
14326 to begin the parameter-declaration-clause, followed by either a
14327 `)', an `...', or a decl-specifier. We need to check for a
14328 type-specifier to avoid being fooled into thinking that:
14332 is a constructor. (It is actually a function named `f' that
14333 takes one parameter (of type `int') and returns a value of type
14336 && cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
14338 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN)
14339 && cp_lexer_next_token_is_not (parser->lexer, CPP_ELLIPSIS)
14340 /* A parameter declaration begins with a decl-specifier,
14341 which is either the "attribute" keyword, a storage class
14342 specifier, or (usually) a type-specifier. */
14343 && !cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE)
14344 && !cp_parser_storage_class_specifier_opt (parser))
14347 bool pop_p = false;
14348 unsigned saved_num_template_parameter_lists;
14350 /* Names appearing in the type-specifier should be looked up
14351 in the scope of the class. */
14352 if (current_class_type)
14356 type = TREE_TYPE (type_decl);
14357 if (TREE_CODE (type) == TYPENAME_TYPE)
14359 type = resolve_typename_type (type,
14360 /*only_current_p=*/false);
14361 if (type == error_mark_node)
14363 cp_parser_abort_tentative_parse (parser);
14367 pop_p = push_scope (type);
14370 /* Inside the constructor parameter list, surrounding
14371 template-parameter-lists do not apply. */
14372 saved_num_template_parameter_lists
14373 = parser->num_template_parameter_lists;
14374 parser->num_template_parameter_lists = 0;
14376 /* Look for the type-specifier. */
14377 cp_parser_type_specifier (parser,
14378 CP_PARSER_FLAGS_NONE,
14379 /*is_friend=*/false,
14380 /*is_declarator=*/true,
14381 /*declares_class_or_enum=*/NULL,
14382 /*is_cv_qualifier=*/NULL);
14384 parser->num_template_parameter_lists
14385 = saved_num_template_parameter_lists;
14387 /* Leave the scope of the class. */
14391 constructor_p = !cp_parser_error_occurred (parser);
14395 constructor_p = false;
14396 /* We did not really want to consume any tokens. */
14397 cp_parser_abort_tentative_parse (parser);
14399 return constructor_p;
14402 /* Parse the definition of the function given by the DECL_SPECIFIERS,
14403 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
14404 they must be performed once we are in the scope of the function.
14406 Returns the function defined. */
14409 cp_parser_function_definition_from_specifiers_and_declarator
14410 (cp_parser* parser,
14411 tree decl_specifiers,
14418 /* Begin the function-definition. */
14419 success_p = begin_function_definition (decl_specifiers,
14423 /* If there were names looked up in the decl-specifier-seq that we
14424 did not check, check them now. We must wait until we are in the
14425 scope of the function to perform the checks, since the function
14426 might be a friend. */
14427 perform_deferred_access_checks ();
14431 /* If begin_function_definition didn't like the definition, skip
14432 the entire function. */
14433 error ("invalid function declaration");
14434 cp_parser_skip_to_end_of_block_or_statement (parser);
14435 fn = error_mark_node;
14438 fn = cp_parser_function_definition_after_declarator (parser,
14439 /*inline_p=*/false);
14444 /* Parse the part of a function-definition that follows the
14445 declarator. INLINE_P is TRUE iff this function is an inline
14446 function defined with a class-specifier.
14448 Returns the function defined. */
14451 cp_parser_function_definition_after_declarator (cp_parser* parser,
14455 bool ctor_initializer_p = false;
14456 bool saved_in_unbraced_linkage_specification_p;
14457 unsigned saved_num_template_parameter_lists;
14459 /* If the next token is `return', then the code may be trying to
14460 make use of the "named return value" extension that G++ used to
14462 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_RETURN))
14464 /* Consume the `return' keyword. */
14465 cp_lexer_consume_token (parser->lexer);
14466 /* Look for the identifier that indicates what value is to be
14468 cp_parser_identifier (parser);
14469 /* Issue an error message. */
14470 error ("named return values are no longer supported");
14471 /* Skip tokens until we reach the start of the function body. */
14472 while (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE)
14473 && cp_lexer_next_token_is_not (parser->lexer, CPP_EOF))
14474 cp_lexer_consume_token (parser->lexer);
14476 /* The `extern' in `extern "C" void f () { ... }' does not apply to
14477 anything declared inside `f'. */
14478 saved_in_unbraced_linkage_specification_p
14479 = parser->in_unbraced_linkage_specification_p;
14480 parser->in_unbraced_linkage_specification_p = false;
14481 /* Inside the function, surrounding template-parameter-lists do not
14483 saved_num_template_parameter_lists
14484 = parser->num_template_parameter_lists;
14485 parser->num_template_parameter_lists = 0;
14486 /* If the next token is `try', then we are looking at a
14487 function-try-block. */
14488 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRY))
14489 ctor_initializer_p = cp_parser_function_try_block (parser);
14490 /* A function-try-block includes the function-body, so we only do
14491 this next part if we're not processing a function-try-block. */
14494 = cp_parser_ctor_initializer_opt_and_function_body (parser);
14496 /* Finish the function. */
14497 fn = finish_function ((ctor_initializer_p ? 1 : 0) |
14498 (inline_p ? 2 : 0));
14499 /* Generate code for it, if necessary. */
14500 expand_or_defer_fn (fn);
14501 /* Restore the saved values. */
14502 parser->in_unbraced_linkage_specification_p
14503 = saved_in_unbraced_linkage_specification_p;
14504 parser->num_template_parameter_lists
14505 = saved_num_template_parameter_lists;
14510 /* Parse a template-declaration, assuming that the `export' (and
14511 `extern') keywords, if present, has already been scanned. MEMBER_P
14512 is as for cp_parser_template_declaration. */
14515 cp_parser_template_declaration_after_export (cp_parser* parser, bool member_p)
14517 tree decl = NULL_TREE;
14518 tree parameter_list;
14519 bool friend_p = false;
14521 /* Look for the `template' keyword. */
14522 if (!cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'"))
14526 if (!cp_parser_require (parser, CPP_LESS, "`<'"))
14529 /* If the next token is `>', then we have an invalid
14530 specialization. Rather than complain about an invalid template
14531 parameter, issue an error message here. */
14532 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
14534 cp_parser_error (parser, "invalid explicit specialization");
14535 begin_specialization ();
14536 parameter_list = NULL_TREE;
14540 /* Parse the template parameters. */
14541 begin_template_parm_list ();
14542 parameter_list = cp_parser_template_parameter_list (parser);
14543 parameter_list = end_template_parm_list (parameter_list);
14546 /* Look for the `>'. */
14547 cp_parser_skip_until_found (parser, CPP_GREATER, "`>'");
14548 /* We just processed one more parameter list. */
14549 ++parser->num_template_parameter_lists;
14550 /* If the next token is `template', there are more template
14552 if (cp_lexer_next_token_is_keyword (parser->lexer,
14554 cp_parser_template_declaration_after_export (parser, member_p);
14557 decl = cp_parser_single_declaration (parser,
14561 /* If this is a member template declaration, let the front
14563 if (member_p && !friend_p && decl)
14565 if (TREE_CODE (decl) == TYPE_DECL)
14566 cp_parser_check_access_in_redeclaration (decl);
14568 decl = finish_member_template_decl (decl);
14570 else if (friend_p && decl && TREE_CODE (decl) == TYPE_DECL)
14571 make_friend_class (current_class_type, TREE_TYPE (decl),
14572 /*complain=*/true);
14574 /* We are done with the current parameter list. */
14575 --parser->num_template_parameter_lists;
14578 finish_template_decl (parameter_list);
14580 /* Register member declarations. */
14581 if (member_p && !friend_p && decl && !DECL_CLASS_TEMPLATE_P (decl))
14582 finish_member_declaration (decl);
14584 /* If DECL is a function template, we must return to parse it later.
14585 (Even though there is no definition, there might be default
14586 arguments that need handling.) */
14587 if (member_p && decl
14588 && (TREE_CODE (decl) == FUNCTION_DECL
14589 || DECL_FUNCTION_TEMPLATE_P (decl)))
14590 TREE_VALUE (parser->unparsed_functions_queues)
14591 = tree_cons (NULL_TREE, decl,
14592 TREE_VALUE (parser->unparsed_functions_queues));
14595 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
14596 `function-definition' sequence. MEMBER_P is true, this declaration
14597 appears in a class scope.
14599 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
14600 *FRIEND_P is set to TRUE iff the declaration is a friend. */
14603 cp_parser_single_declaration (cp_parser* parser,
14607 int declares_class_or_enum;
14608 tree decl = NULL_TREE;
14609 tree decl_specifiers;
14611 bool function_definition_p = false;
14613 /* Defer access checks until we know what is being declared. */
14614 push_deferring_access_checks (dk_deferred);
14616 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
14619 = cp_parser_decl_specifier_seq (parser,
14620 CP_PARSER_FLAGS_OPTIONAL,
14622 &declares_class_or_enum);
14624 *friend_p = cp_parser_friend_p (decl_specifiers);
14625 /* Gather up the access checks that occurred the
14626 decl-specifier-seq. */
14627 stop_deferring_access_checks ();
14629 /* Check for the declaration of a template class. */
14630 if (declares_class_or_enum)
14632 if (cp_parser_declares_only_class_p (parser))
14634 decl = shadow_tag (decl_specifiers);
14636 decl = TYPE_NAME (decl);
14638 decl = error_mark_node;
14643 /* If it's not a template class, try for a template function. If
14644 the next token is a `;', then this declaration does not declare
14645 anything. But, if there were errors in the decl-specifiers, then
14646 the error might well have come from an attempted class-specifier.
14647 In that case, there's no need to warn about a missing declarator. */
14649 && (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON)
14650 || !value_member (error_mark_node, decl_specifiers)))
14651 decl = cp_parser_init_declarator (parser,
14654 /*function_definition_allowed_p=*/true,
14656 declares_class_or_enum,
14657 &function_definition_p);
14659 pop_deferring_access_checks ();
14661 /* Clear any current qualification; whatever comes next is the start
14662 of something new. */
14663 parser->scope = NULL_TREE;
14664 parser->qualifying_scope = NULL_TREE;
14665 parser->object_scope = NULL_TREE;
14666 /* Look for a trailing `;' after the declaration. */
14667 if (!function_definition_p
14668 && !cp_parser_require (parser, CPP_SEMICOLON, "`;'"))
14669 cp_parser_skip_to_end_of_block_or_statement (parser);
14674 /* Parse a cast-expression that is not the operand of a unary "&". */
14677 cp_parser_simple_cast_expression (cp_parser *parser)
14679 return cp_parser_cast_expression (parser, /*address_p=*/false);
14682 /* Parse a functional cast to TYPE. Returns an expression
14683 representing the cast. */
14686 cp_parser_functional_cast (cp_parser* parser, tree type)
14688 tree expression_list;
14692 = cp_parser_parenthesized_expression_list (parser, false,
14693 /*non_constant_p=*/NULL);
14695 cast = build_functional_cast (type, expression_list);
14696 /* [expr.const]/1: In an integral constant expression "only type
14697 conversions to integral or enumeration type can be used". */
14698 if (cast != error_mark_node && !type_dependent_expression_p (type)
14699 && !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (type)))
14701 if (cp_parser_non_integral_constant_expression
14702 (parser, "a call to a constructor"))
14703 return error_mark_node;
14708 /* Save the tokens that make up the body of a member function defined
14709 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
14710 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
14711 specifiers applied to the declaration. Returns the FUNCTION_DECL
14712 for the member function. */
14715 cp_parser_save_member_function_body (cp_parser* parser,
14716 tree decl_specifiers,
14720 cp_token_cache *cache;
14723 /* Create the function-declaration. */
14724 fn = start_method (decl_specifiers, declarator, attributes);
14725 /* If something went badly wrong, bail out now. */
14726 if (fn == error_mark_node)
14728 /* If there's a function-body, skip it. */
14729 if (cp_parser_token_starts_function_definition_p
14730 (cp_lexer_peek_token (parser->lexer)))
14731 cp_parser_skip_to_end_of_block_or_statement (parser);
14732 return error_mark_node;
14735 /* Remember it, if there default args to post process. */
14736 cp_parser_save_default_args (parser, fn);
14738 /* Create a token cache. */
14739 cache = cp_token_cache_new ();
14740 /* Save away the tokens that make up the body of the
14742 cp_parser_cache_group (parser, cache, CPP_CLOSE_BRACE, /*depth=*/0);
14743 /* Handle function try blocks. */
14744 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_CATCH))
14745 cp_parser_cache_group (parser, cache, CPP_CLOSE_BRACE, /*depth=*/0);
14747 /* Save away the inline definition; we will process it when the
14748 class is complete. */
14749 DECL_PENDING_INLINE_INFO (fn) = cache;
14750 DECL_PENDING_INLINE_P (fn) = 1;
14752 /* We need to know that this was defined in the class, so that
14753 friend templates are handled correctly. */
14754 DECL_INITIALIZED_IN_CLASS_P (fn) = 1;
14756 /* We're done with the inline definition. */
14757 finish_method (fn);
14759 /* Add FN to the queue of functions to be parsed later. */
14760 TREE_VALUE (parser->unparsed_functions_queues)
14761 = tree_cons (NULL_TREE, fn,
14762 TREE_VALUE (parser->unparsed_functions_queues));
14767 /* Parse a template-argument-list, as well as the trailing ">" (but
14768 not the opening ">"). See cp_parser_template_argument_list for the
14772 cp_parser_enclosed_template_argument_list (cp_parser* parser)
14776 tree saved_qualifying_scope;
14777 tree saved_object_scope;
14778 bool saved_greater_than_is_operator_p;
14782 When parsing a template-id, the first non-nested `>' is taken as
14783 the end of the template-argument-list rather than a greater-than
14785 saved_greater_than_is_operator_p
14786 = parser->greater_than_is_operator_p;
14787 parser->greater_than_is_operator_p = false;
14788 /* Parsing the argument list may modify SCOPE, so we save it
14790 saved_scope = parser->scope;
14791 saved_qualifying_scope = parser->qualifying_scope;
14792 saved_object_scope = parser->object_scope;
14793 /* Parse the template-argument-list itself. */
14794 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
14795 arguments = NULL_TREE;
14797 arguments = cp_parser_template_argument_list (parser);
14798 /* Look for the `>' that ends the template-argument-list. If we find
14799 a '>>' instead, it's probably just a typo. */
14800 if (cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
14802 if (!saved_greater_than_is_operator_p)
14804 /* If we're in a nested template argument list, the '>>' has to be
14805 a typo for '> >'. We emit the error message, but we continue
14806 parsing and we push a '>' as next token, so that the argument
14807 list will be parsed correctly.. */
14809 error ("`>>' should be `> >' within a nested template argument list");
14810 token = cp_lexer_peek_token (parser->lexer);
14811 token->type = CPP_GREATER;
14815 /* If this is not a nested template argument list, the '>>' is
14816 a typo for '>'. Emit an error message and continue. */
14817 error ("spurious `>>', use `>' to terminate a template argument list");
14818 cp_lexer_consume_token (parser->lexer);
14821 else if (!cp_parser_require (parser, CPP_GREATER, "`>'"))
14822 error ("missing `>' to terminate the template argument list");
14823 /* The `>' token might be a greater-than operator again now. */
14824 parser->greater_than_is_operator_p
14825 = saved_greater_than_is_operator_p;
14826 /* Restore the SAVED_SCOPE. */
14827 parser->scope = saved_scope;
14828 parser->qualifying_scope = saved_qualifying_scope;
14829 parser->object_scope = saved_object_scope;
14834 /* MEMBER_FUNCTION is a member function, or a friend. If default
14835 arguments, or the body of the function have not yet been parsed,
14839 cp_parser_late_parsing_for_member (cp_parser* parser, tree member_function)
14841 cp_lexer *saved_lexer;
14843 /* If this member is a template, get the underlying
14845 if (DECL_FUNCTION_TEMPLATE_P (member_function))
14846 member_function = DECL_TEMPLATE_RESULT (member_function);
14848 /* There should not be any class definitions in progress at this
14849 point; the bodies of members are only parsed outside of all class
14851 my_friendly_assert (parser->num_classes_being_defined == 0, 20010816);
14852 /* While we're parsing the member functions we might encounter more
14853 classes. We want to handle them right away, but we don't want
14854 them getting mixed up with functions that are currently in the
14856 parser->unparsed_functions_queues
14857 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
14859 /* Make sure that any template parameters are in scope. */
14860 maybe_begin_member_template_processing (member_function);
14862 /* If the body of the function has not yet been parsed, parse it
14864 if (DECL_PENDING_INLINE_P (member_function))
14866 tree function_scope;
14867 cp_token_cache *tokens;
14869 /* The function is no longer pending; we are processing it. */
14870 tokens = DECL_PENDING_INLINE_INFO (member_function);
14871 DECL_PENDING_INLINE_INFO (member_function) = NULL;
14872 DECL_PENDING_INLINE_P (member_function) = 0;
14873 /* If this was an inline function in a local class, enter the scope
14874 of the containing function. */
14875 function_scope = decl_function_context (member_function);
14876 if (function_scope)
14877 push_function_context_to (function_scope);
14879 /* Save away the current lexer. */
14880 saved_lexer = parser->lexer;
14881 /* Make a new lexer to feed us the tokens saved for this function. */
14882 parser->lexer = cp_lexer_new_from_tokens (tokens);
14883 parser->lexer->next = saved_lexer;
14885 /* Set the current source position to be the location of the first
14886 token in the saved inline body. */
14887 cp_lexer_peek_token (parser->lexer);
14889 /* Let the front end know that we going to be defining this
14891 start_function (NULL_TREE, member_function, NULL_TREE,
14892 SF_PRE_PARSED | SF_INCLASS_INLINE);
14894 /* Now, parse the body of the function. */
14895 cp_parser_function_definition_after_declarator (parser,
14896 /*inline_p=*/true);
14898 /* Leave the scope of the containing function. */
14899 if (function_scope)
14900 pop_function_context_from (function_scope);
14901 /* Restore the lexer. */
14902 parser->lexer = saved_lexer;
14905 /* Remove any template parameters from the symbol table. */
14906 maybe_end_member_template_processing ();
14908 /* Restore the queue. */
14909 parser->unparsed_functions_queues
14910 = TREE_CHAIN (parser->unparsed_functions_queues);
14913 /* If DECL contains any default args, remember it on the unparsed
14914 functions queue. */
14917 cp_parser_save_default_args (cp_parser* parser, tree decl)
14921 for (probe = TYPE_ARG_TYPES (TREE_TYPE (decl));
14923 probe = TREE_CHAIN (probe))
14924 if (TREE_PURPOSE (probe))
14926 TREE_PURPOSE (parser->unparsed_functions_queues)
14927 = tree_cons (NULL_TREE, decl,
14928 TREE_PURPOSE (parser->unparsed_functions_queues));
14934 /* FN is a FUNCTION_DECL which may contains a parameter with an
14935 unparsed DEFAULT_ARG. Parse the default args now. */
14938 cp_parser_late_parsing_default_args (cp_parser *parser, tree fn)
14940 cp_lexer *saved_lexer;
14941 cp_token_cache *tokens;
14942 bool saved_local_variables_forbidden_p;
14945 /* While we're parsing the default args, we might (due to the
14946 statement expression extension) encounter more classes. We want
14947 to handle them right away, but we don't want them getting mixed
14948 up with default args that are currently in the queue. */
14949 parser->unparsed_functions_queues
14950 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
14952 for (parameters = TYPE_ARG_TYPES (TREE_TYPE (fn));
14954 parameters = TREE_CHAIN (parameters))
14956 if (!TREE_PURPOSE (parameters)
14957 || TREE_CODE (TREE_PURPOSE (parameters)) != DEFAULT_ARG)
14960 /* Save away the current lexer. */
14961 saved_lexer = parser->lexer;
14962 /* Create a new one, using the tokens we have saved. */
14963 tokens = DEFARG_TOKENS (TREE_PURPOSE (parameters));
14964 parser->lexer = cp_lexer_new_from_tokens (tokens);
14966 /* Set the current source position to be the location of the
14967 first token in the default argument. */
14968 cp_lexer_peek_token (parser->lexer);
14970 /* Local variable names (and the `this' keyword) may not appear
14971 in a default argument. */
14972 saved_local_variables_forbidden_p = parser->local_variables_forbidden_p;
14973 parser->local_variables_forbidden_p = true;
14974 /* Parse the assignment-expression. */
14975 if (DECL_CLASS_SCOPE_P (fn))
14976 push_nested_class (DECL_CONTEXT (fn));
14977 TREE_PURPOSE (parameters) = cp_parser_assignment_expression (parser);
14978 if (DECL_CLASS_SCOPE_P (fn))
14979 pop_nested_class ();
14981 /* If the token stream has not been completely used up, then
14982 there was extra junk after the end of the default
14984 if (!cp_lexer_next_token_is (parser->lexer, CPP_EOF))
14985 cp_parser_error (parser, "expected `,'");
14987 /* Restore saved state. */
14988 parser->lexer = saved_lexer;
14989 parser->local_variables_forbidden_p = saved_local_variables_forbidden_p;
14992 /* Restore the queue. */
14993 parser->unparsed_functions_queues
14994 = TREE_CHAIN (parser->unparsed_functions_queues);
14997 /* Parse the operand of `sizeof' (or a similar operator). Returns
14998 either a TYPE or an expression, depending on the form of the
14999 input. The KEYWORD indicates which kind of expression we have
15003 cp_parser_sizeof_operand (cp_parser* parser, enum rid keyword)
15005 static const char *format;
15006 tree expr = NULL_TREE;
15007 const char *saved_message;
15008 bool saved_integral_constant_expression_p;
15010 /* Initialize FORMAT the first time we get here. */
15012 format = "types may not be defined in `%s' expressions";
15014 /* Types cannot be defined in a `sizeof' expression. Save away the
15016 saved_message = parser->type_definition_forbidden_message;
15017 /* And create the new one. */
15018 parser->type_definition_forbidden_message
15019 = xmalloc (strlen (format)
15020 + strlen (IDENTIFIER_POINTER (ridpointers[keyword]))
15022 sprintf ((char *) parser->type_definition_forbidden_message,
15023 format, IDENTIFIER_POINTER (ridpointers[keyword]));
15025 /* The restrictions on constant-expressions do not apply inside
15026 sizeof expressions. */
15027 saved_integral_constant_expression_p = parser->integral_constant_expression_p;
15028 parser->integral_constant_expression_p = false;
15030 /* Do not actually evaluate the expression. */
15032 /* If it's a `(', then we might be looking at the type-id
15034 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
15037 bool saved_in_type_id_in_expr_p;
15039 /* We can't be sure yet whether we're looking at a type-id or an
15041 cp_parser_parse_tentatively (parser);
15042 /* Consume the `('. */
15043 cp_lexer_consume_token (parser->lexer);
15044 /* Parse the type-id. */
15045 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
15046 parser->in_type_id_in_expr_p = true;
15047 type = cp_parser_type_id (parser);
15048 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
15049 /* Now, look for the trailing `)'. */
15050 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
15051 /* If all went well, then we're done. */
15052 if (cp_parser_parse_definitely (parser))
15054 /* Build a list of decl-specifiers; right now, we have only
15055 a single type-specifier. */
15056 type = build_tree_list (NULL_TREE,
15059 /* Call grokdeclarator to figure out what type this is. */
15060 expr = grokdeclarator (NULL_TREE,
15064 /*attrlist=*/NULL);
15068 /* If the type-id production did not work out, then we must be
15069 looking at the unary-expression production. */
15071 expr = cp_parser_unary_expression (parser, /*address_p=*/false);
15072 /* Go back to evaluating expressions. */
15075 /* Free the message we created. */
15076 free ((char *) parser->type_definition_forbidden_message);
15077 /* And restore the old one. */
15078 parser->type_definition_forbidden_message = saved_message;
15079 parser->integral_constant_expression_p = saved_integral_constant_expression_p;
15084 /* If the current declaration has no declarator, return true. */
15087 cp_parser_declares_only_class_p (cp_parser *parser)
15089 /* If the next token is a `;' or a `,' then there is no
15091 return (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
15092 || cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
15095 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
15096 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
15099 cp_parser_friend_p (tree decl_specifiers)
15101 while (decl_specifiers)
15103 /* See if this decl-specifier is `friend'. */
15104 if (TREE_CODE (TREE_VALUE (decl_specifiers)) == IDENTIFIER_NODE
15105 && C_RID_CODE (TREE_VALUE (decl_specifiers)) == RID_FRIEND)
15108 /* Go on to the next decl-specifier. */
15109 decl_specifiers = TREE_CHAIN (decl_specifiers);
15115 /* If the next token is of the indicated TYPE, consume it. Otherwise,
15116 issue an error message indicating that TOKEN_DESC was expected.
15118 Returns the token consumed, if the token had the appropriate type.
15119 Otherwise, returns NULL. */
15122 cp_parser_require (cp_parser* parser,
15123 enum cpp_ttype type,
15124 const char* token_desc)
15126 if (cp_lexer_next_token_is (parser->lexer, type))
15127 return cp_lexer_consume_token (parser->lexer);
15130 /* Output the MESSAGE -- unless we're parsing tentatively. */
15131 if (!cp_parser_simulate_error (parser))
15133 char *message = concat ("expected ", token_desc, NULL);
15134 cp_parser_error (parser, message);
15141 /* Like cp_parser_require, except that tokens will be skipped until
15142 the desired token is found. An error message is still produced if
15143 the next token is not as expected. */
15146 cp_parser_skip_until_found (cp_parser* parser,
15147 enum cpp_ttype type,
15148 const char* token_desc)
15151 unsigned nesting_depth = 0;
15153 if (cp_parser_require (parser, type, token_desc))
15156 /* Skip tokens until the desired token is found. */
15159 /* Peek at the next token. */
15160 token = cp_lexer_peek_token (parser->lexer);
15161 /* If we've reached the token we want, consume it and
15163 if (token->type == type && !nesting_depth)
15165 cp_lexer_consume_token (parser->lexer);
15168 /* If we've run out of tokens, stop. */
15169 if (token->type == CPP_EOF)
15171 if (token->type == CPP_OPEN_BRACE
15172 || token->type == CPP_OPEN_PAREN
15173 || token->type == CPP_OPEN_SQUARE)
15175 else if (token->type == CPP_CLOSE_BRACE
15176 || token->type == CPP_CLOSE_PAREN
15177 || token->type == CPP_CLOSE_SQUARE)
15179 if (nesting_depth-- == 0)
15182 /* Consume this token. */
15183 cp_lexer_consume_token (parser->lexer);
15187 /* If the next token is the indicated keyword, consume it. Otherwise,
15188 issue an error message indicating that TOKEN_DESC was expected.
15190 Returns the token consumed, if the token had the appropriate type.
15191 Otherwise, returns NULL. */
15194 cp_parser_require_keyword (cp_parser* parser,
15196 const char* token_desc)
15198 cp_token *token = cp_parser_require (parser, CPP_KEYWORD, token_desc);
15200 if (token && token->keyword != keyword)
15202 dyn_string_t error_msg;
15204 /* Format the error message. */
15205 error_msg = dyn_string_new (0);
15206 dyn_string_append_cstr (error_msg, "expected ");
15207 dyn_string_append_cstr (error_msg, token_desc);
15208 cp_parser_error (parser, error_msg->s);
15209 dyn_string_delete (error_msg);
15216 /* Returns TRUE iff TOKEN is a token that can begin the body of a
15217 function-definition. */
15220 cp_parser_token_starts_function_definition_p (cp_token* token)
15222 return (/* An ordinary function-body begins with an `{'. */
15223 token->type == CPP_OPEN_BRACE
15224 /* A ctor-initializer begins with a `:'. */
15225 || token->type == CPP_COLON
15226 /* A function-try-block begins with `try'. */
15227 || token->keyword == RID_TRY
15228 /* The named return value extension begins with `return'. */
15229 || token->keyword == RID_RETURN);
15232 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
15236 cp_parser_next_token_starts_class_definition_p (cp_parser *parser)
15240 token = cp_lexer_peek_token (parser->lexer);
15241 return (token->type == CPP_OPEN_BRACE || token->type == CPP_COLON);
15244 /* Returns TRUE iff the next token is the "," or ">" ending a
15245 template-argument. ">>" is also accepted (after the full
15246 argument was parsed) because it's probably a typo for "> >",
15247 and there is a specific diagnostic for this. */
15250 cp_parser_next_token_ends_template_argument_p (cp_parser *parser)
15254 token = cp_lexer_peek_token (parser->lexer);
15255 return (token->type == CPP_COMMA || token->type == CPP_GREATER
15256 || token->type == CPP_RSHIFT);
15259 /* Returns TRUE iff the n-th token is a ">", or the n-th is a "[" and the
15260 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
15263 cp_parser_nth_token_starts_template_argument_list_p (cp_parser * parser,
15268 token = cp_lexer_peek_nth_token (parser->lexer, n);
15269 if (token->type == CPP_LESS)
15271 /* Check for the sequence `<::' in the original code. It would be lexed as
15272 `[:', where `[' is a digraph, and there is no whitespace before
15274 if (token->type == CPP_OPEN_SQUARE && token->flags & DIGRAPH)
15277 token2 = cp_lexer_peek_nth_token (parser->lexer, n+1);
15278 if (token2->type == CPP_COLON && !(token2->flags & PREV_WHITE))
15284 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
15285 or none_type otherwise. */
15287 static enum tag_types
15288 cp_parser_token_is_class_key (cp_token* token)
15290 switch (token->keyword)
15295 return record_type;
15304 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
15307 cp_parser_check_class_key (enum tag_types class_key, tree type)
15309 if ((TREE_CODE (type) == UNION_TYPE) != (class_key == union_type))
15310 pedwarn ("`%s' tag used in naming `%#T'",
15311 class_key == union_type ? "union"
15312 : class_key == record_type ? "struct" : "class",
15316 /* Issue an error message if DECL is redeclared with different
15317 access than its original declaration [class.access.spec/3].
15318 This applies to nested classes and nested class templates.
15321 static void cp_parser_check_access_in_redeclaration (tree decl)
15323 if (!CLASS_TYPE_P (TREE_TYPE (decl)))
15326 if ((TREE_PRIVATE (decl)
15327 != (current_access_specifier == access_private_node))
15328 || (TREE_PROTECTED (decl)
15329 != (current_access_specifier == access_protected_node)))
15330 error ("%D redeclared with different access", decl);
15333 /* Look for the `template' keyword, as a syntactic disambiguator.
15334 Return TRUE iff it is present, in which case it will be
15338 cp_parser_optional_template_keyword (cp_parser *parser)
15340 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
15342 /* The `template' keyword can only be used within templates;
15343 outside templates the parser can always figure out what is a
15344 template and what is not. */
15345 if (!processing_template_decl)
15347 error ("`template' (as a disambiguator) is only allowed "
15348 "within templates");
15349 /* If this part of the token stream is rescanned, the same
15350 error message would be generated. So, we purge the token
15351 from the stream. */
15352 cp_lexer_purge_token (parser->lexer);
15357 /* Consume the `template' keyword. */
15358 cp_lexer_consume_token (parser->lexer);
15366 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
15367 set PARSER->SCOPE, and perform other related actions. */
15370 cp_parser_pre_parsed_nested_name_specifier (cp_parser *parser)
15375 /* Get the stored value. */
15376 value = cp_lexer_consume_token (parser->lexer)->value;
15377 /* Perform any access checks that were deferred. */
15378 for (check = TREE_PURPOSE (value); check; check = TREE_CHAIN (check))
15379 perform_or_defer_access_check (TREE_PURPOSE (check), TREE_VALUE (check));
15380 /* Set the scope from the stored value. */
15381 parser->scope = TREE_VALUE (value);
15382 parser->qualifying_scope = TREE_TYPE (value);
15383 parser->object_scope = NULL_TREE;
15386 /* Add tokens to CACHE until a non-nested END token appears. */
15389 cp_parser_cache_group_1 (cp_parser *parser,
15390 cp_token_cache *cache,
15391 enum cpp_ttype end,
15398 /* Abort a parenthesized expression if we encounter a brace. */
15399 if ((end == CPP_CLOSE_PAREN || depth == 0)
15400 && cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
15402 /* If we've reached the end of the file, stop. */
15403 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
15405 /* Consume the next token. */
15406 token = cp_lexer_consume_token (parser->lexer);
15407 /* Add this token to the tokens we are saving. */
15408 cp_token_cache_push_token (cache, token);
15409 /* See if it starts a new group. */
15410 if (token->type == CPP_OPEN_BRACE)
15412 cp_parser_cache_group_1 (parser, cache, CPP_CLOSE_BRACE, depth + 1);
15416 else if (token->type == CPP_OPEN_PAREN)
15417 cp_parser_cache_group_1 (parser, cache, CPP_CLOSE_PAREN, depth + 1);
15418 else if (token->type == end)
15423 /* Convenient interface for cp_parser_cache_group_1 that makes sure we
15424 preserve string tokens in both translated and untranslated
15428 cp_parser_cache_group (cp_parser *parser,
15429 cp_token_cache *cache,
15430 enum cpp_ttype end,
15433 int saved_c_lex_string_translate;
15435 saved_c_lex_string_translate = c_lex_string_translate;
15436 c_lex_string_translate = -1;
15438 cp_parser_cache_group_1 (parser, cache, end, depth);
15440 c_lex_string_translate = saved_c_lex_string_translate;
15444 /* Begin parsing tentatively. We always save tokens while parsing
15445 tentatively so that if the tentative parsing fails we can restore the
15449 cp_parser_parse_tentatively (cp_parser* parser)
15451 /* Enter a new parsing context. */
15452 parser->context = cp_parser_context_new (parser->context);
15453 /* Begin saving tokens. */
15454 cp_lexer_save_tokens (parser->lexer);
15455 /* In order to avoid repetitive access control error messages,
15456 access checks are queued up until we are no longer parsing
15458 push_deferring_access_checks (dk_deferred);
15461 /* Commit to the currently active tentative parse. */
15464 cp_parser_commit_to_tentative_parse (cp_parser* parser)
15466 cp_parser_context *context;
15469 /* Mark all of the levels as committed. */
15470 lexer = parser->lexer;
15471 for (context = parser->context; context->next; context = context->next)
15473 if (context->status == CP_PARSER_STATUS_KIND_COMMITTED)
15475 context->status = CP_PARSER_STATUS_KIND_COMMITTED;
15476 while (!cp_lexer_saving_tokens (lexer))
15477 lexer = lexer->next;
15478 cp_lexer_commit_tokens (lexer);
15482 /* Abort the currently active tentative parse. All consumed tokens
15483 will be rolled back, and no diagnostics will be issued. */
15486 cp_parser_abort_tentative_parse (cp_parser* parser)
15488 cp_parser_simulate_error (parser);
15489 /* Now, pretend that we want to see if the construct was
15490 successfully parsed. */
15491 cp_parser_parse_definitely (parser);
15494 /* Stop parsing tentatively. If a parse error has occurred, restore the
15495 token stream. Otherwise, commit to the tokens we have consumed.
15496 Returns true if no error occurred; false otherwise. */
15499 cp_parser_parse_definitely (cp_parser* parser)
15501 bool error_occurred;
15502 cp_parser_context *context;
15504 /* Remember whether or not an error occurred, since we are about to
15505 destroy that information. */
15506 error_occurred = cp_parser_error_occurred (parser);
15507 /* Remove the topmost context from the stack. */
15508 context = parser->context;
15509 parser->context = context->next;
15510 /* If no parse errors occurred, commit to the tentative parse. */
15511 if (!error_occurred)
15513 /* Commit to the tokens read tentatively, unless that was
15515 if (context->status != CP_PARSER_STATUS_KIND_COMMITTED)
15516 cp_lexer_commit_tokens (parser->lexer);
15518 pop_to_parent_deferring_access_checks ();
15520 /* Otherwise, if errors occurred, roll back our state so that things
15521 are just as they were before we began the tentative parse. */
15524 cp_lexer_rollback_tokens (parser->lexer);
15525 pop_deferring_access_checks ();
15527 /* Add the context to the front of the free list. */
15528 context->next = cp_parser_context_free_list;
15529 cp_parser_context_free_list = context;
15531 return !error_occurred;
15534 /* Returns true if we are parsing tentatively -- but have decided that
15535 we will stick with this tentative parse, even if errors occur. */
15538 cp_parser_committed_to_tentative_parse (cp_parser* parser)
15540 return (cp_parser_parsing_tentatively (parser)
15541 && parser->context->status == CP_PARSER_STATUS_KIND_COMMITTED);
15544 /* Returns nonzero iff an error has occurred during the most recent
15545 tentative parse. */
15548 cp_parser_error_occurred (cp_parser* parser)
15550 return (cp_parser_parsing_tentatively (parser)
15551 && parser->context->status == CP_PARSER_STATUS_KIND_ERROR);
15554 /* Returns nonzero if GNU extensions are allowed. */
15557 cp_parser_allow_gnu_extensions_p (cp_parser* parser)
15559 return parser->allow_gnu_extensions_p;
15565 static GTY (()) cp_parser *the_parser;
15567 /* External interface. */
15569 /* Parse one entire translation unit. */
15572 c_parse_file (void)
15574 bool error_occurred;
15575 static bool already_called = false;
15577 if (already_called)
15579 sorry ("inter-module optimizations not implemented for C++");
15582 already_called = true;
15584 the_parser = cp_parser_new ();
15585 push_deferring_access_checks (flag_access_control
15586 ? dk_no_deferred : dk_no_check);
15587 error_occurred = cp_parser_translation_unit (the_parser);
15591 /* This variable must be provided by every front end. */
15595 #include "gt-cp-parser.h"