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"
45 A cp_lexer represents a stream of cp_tokens. It allows arbitrary
51 We use a circular buffer to store incoming tokens.
53 Some artifacts of the C++ language (such as the
54 expression/declaration ambiguity) require arbitrary look-ahead.
55 The strategy we adopt for dealing with these problems is to attempt
56 to parse one construct (e.g., the declaration) and fall back to the
57 other (e.g., the expression) if that attempt does not succeed.
58 Therefore, we must sometimes store an arbitrary number of tokens.
60 The parser routinely peeks at the next token, and then consumes it
61 later. That also requires a buffer in which to store the tokens.
63 In order to easily permit adding tokens to the end of the buffer,
64 while removing them from the beginning of the buffer, we use a
69 typedef struct cp_token GTY (())
71 /* The kind of token. */
72 ENUM_BITFIELD (cpp_ttype) type : 8;
73 /* If this token is a keyword, this value indicates which keyword.
74 Otherwise, this value is RID_MAX. */
75 ENUM_BITFIELD (rid) keyword : 8;
78 /* The value associated with this token, if any. */
80 /* The location at which this token was found. */
84 /* The number of tokens in a single token block.
85 Computed so that cp_token_block fits in a 512B allocation unit. */
87 #define CP_TOKEN_BLOCK_NUM_TOKENS ((512 - 3*sizeof (char*))/sizeof (cp_token))
89 /* A group of tokens. These groups are chained together to store
90 large numbers of tokens. (For example, a token block is created
91 when the body of an inline member function is first encountered;
92 the tokens are processed later after the class definition is
95 This somewhat ungainly data structure (as opposed to, say, a
96 variable-length array), is used due to constraints imposed by the
97 current garbage-collection methodology. If it is made more
98 flexible, we could perhaps simplify the data structures involved. */
100 typedef struct cp_token_block GTY (())
103 cp_token tokens[CP_TOKEN_BLOCK_NUM_TOKENS];
104 /* The number of tokens in this block. */
106 /* The next token block in the chain. */
107 struct cp_token_block *next;
108 /* The previous block in the chain. */
109 struct cp_token_block *prev;
112 typedef struct cp_token_cache GTY (())
114 /* The first block in the cache. NULL if there are no tokens in the
116 cp_token_block *first;
117 /* The last block in the cache. NULL If there are no tokens in the
119 cp_token_block *last;
124 static cp_token_cache *cp_token_cache_new
126 static void cp_token_cache_push_token
127 (cp_token_cache *, cp_token *);
129 /* Create a new cp_token_cache. */
131 static cp_token_cache *
132 cp_token_cache_new (void)
134 return GGC_CNEW (cp_token_cache);
137 /* Add *TOKEN to *CACHE. */
140 cp_token_cache_push_token (cp_token_cache *cache,
143 cp_token_block *b = cache->last;
145 /* See if we need to allocate a new token block. */
146 if (!b || b->num_tokens == CP_TOKEN_BLOCK_NUM_TOKENS)
148 b = GGC_CNEW (cp_token_block);
149 b->prev = cache->last;
152 cache->last->next = b;
156 cache->first = cache->last = b;
158 /* Add this token to the current token block. */
159 b->tokens[b->num_tokens++] = *token;
162 /* The cp_lexer structure represents the C++ lexer. It is responsible
163 for managing the token stream from the preprocessor and supplying
166 typedef struct cp_lexer GTY (())
168 /* The memory allocated for the buffer. Never NULL. */
169 cp_token * GTY ((length ("(%h.buffer_end - %h.buffer)"))) buffer;
170 /* A pointer just past the end of the memory allocated for the buffer. */
171 cp_token * GTY ((skip)) buffer_end;
172 /* The first valid token in the buffer, or NULL if none. */
173 cp_token * GTY ((skip)) first_token;
174 /* The next available token. If NEXT_TOKEN is NULL, then there are
175 no more available tokens. */
176 cp_token * GTY ((skip)) next_token;
177 /* A pointer just past the last available token. If FIRST_TOKEN is
178 NULL, however, there are no available tokens, and then this
179 location is simply the place in which the next token read will be
180 placed. If LAST_TOKEN == FIRST_TOKEN, then the buffer is full.
181 When the LAST_TOKEN == BUFFER, then the last token is at the
182 highest memory address in the BUFFER. */
183 cp_token * GTY ((skip)) last_token;
185 /* A stack indicating positions at which cp_lexer_save_tokens was
186 called. The top entry is the most recent position at which we
187 began saving tokens. The entries are differences in token
188 position between FIRST_TOKEN and the first saved token.
190 If the stack is non-empty, we are saving tokens. When a token is
191 consumed, the NEXT_TOKEN pointer will move, but the FIRST_TOKEN
192 pointer will not. The token stream will be preserved so that it
193 can be reexamined later.
195 If the stack is empty, then we are not saving tokens. Whenever a
196 token is consumed, the FIRST_TOKEN pointer will be moved, and the
197 consumed token will be gone forever. */
198 varray_type saved_tokens;
200 /* The STRING_CST tokens encountered while processing the current
202 varray_type string_tokens;
204 /* True if we should obtain more tokens from the preprocessor; false
205 if we are processing a saved token cache. */
208 /* True if we should output debugging information. */
211 /* The next lexer in a linked list of lexers. */
212 struct cp_lexer *next;
217 static cp_lexer *cp_lexer_new_main
219 static cp_lexer *cp_lexer_new_from_tokens
220 (struct cp_token_cache *);
221 static int cp_lexer_saving_tokens
223 static cp_token *cp_lexer_next_token
224 (cp_lexer *, cp_token *);
225 static cp_token *cp_lexer_prev_token
226 (cp_lexer *, cp_token *);
227 static ptrdiff_t cp_lexer_token_difference
228 (cp_lexer *, cp_token *, cp_token *);
229 static cp_token *cp_lexer_read_token
231 static void cp_lexer_maybe_grow_buffer
233 static void cp_lexer_get_preprocessor_token
234 (cp_lexer *, cp_token *);
235 static cp_token *cp_lexer_peek_token
237 static cp_token *cp_lexer_peek_nth_token
238 (cp_lexer *, size_t);
239 static inline bool cp_lexer_next_token_is
240 (cp_lexer *, enum cpp_ttype);
241 static bool cp_lexer_next_token_is_not
242 (cp_lexer *, enum cpp_ttype);
243 static bool cp_lexer_next_token_is_keyword
244 (cp_lexer *, enum rid);
245 static cp_token *cp_lexer_consume_token
247 static void cp_lexer_purge_token
249 static void cp_lexer_purge_tokens_after
250 (cp_lexer *, cp_token *);
251 static void cp_lexer_save_tokens
253 static void cp_lexer_commit_tokens
255 static void cp_lexer_rollback_tokens
257 static inline void cp_lexer_set_source_position_from_token
258 (cp_lexer *, const cp_token *);
259 static void cp_lexer_print_token
260 (FILE *, cp_token *);
261 static inline bool cp_lexer_debugging_p
263 static void cp_lexer_start_debugging
264 (cp_lexer *) ATTRIBUTE_UNUSED;
265 static void cp_lexer_stop_debugging
266 (cp_lexer *) ATTRIBUTE_UNUSED;
268 /* Manifest constants. */
270 #define CP_TOKEN_BUFFER_SIZE 5
271 #define CP_SAVED_TOKENS_SIZE 5
273 /* A token type for keywords, as opposed to ordinary identifiers. */
274 #define CPP_KEYWORD ((enum cpp_ttype) (N_TTYPES + 1))
276 /* A token type for template-ids. If a template-id is processed while
277 parsing tentatively, it is replaced with a CPP_TEMPLATE_ID token;
278 the value of the CPP_TEMPLATE_ID is whatever was returned by
279 cp_parser_template_id. */
280 #define CPP_TEMPLATE_ID ((enum cpp_ttype) (CPP_KEYWORD + 1))
282 /* A token type for nested-name-specifiers. If a
283 nested-name-specifier is processed while parsing tentatively, it is
284 replaced with a CPP_NESTED_NAME_SPECIFIER token; the value of the
285 CPP_NESTED_NAME_SPECIFIER is whatever was returned by
286 cp_parser_nested_name_specifier_opt. */
287 #define CPP_NESTED_NAME_SPECIFIER ((enum cpp_ttype) (CPP_TEMPLATE_ID + 1))
289 /* A token type for tokens that are not tokens at all; these are used
290 to mark the end of a token block. */
291 #define CPP_NONE (CPP_NESTED_NAME_SPECIFIER + 1)
295 /* The stream to which debugging output should be written. */
296 static FILE *cp_lexer_debug_stream;
298 /* Create a new main C++ lexer, the lexer that gets tokens from the
302 cp_lexer_new_main (void)
305 cp_token first_token;
307 /* It's possible that lexing the first token will load a PCH file,
308 which is a GC collection point. So we have to grab the first
309 token before allocating any memory. */
310 cp_lexer_get_preprocessor_token (NULL, &first_token);
311 c_common_no_more_pch ();
313 /* Allocate the memory. */
314 lexer = GGC_CNEW (cp_lexer);
316 /* Create the circular buffer. */
317 lexer->buffer = ggc_calloc (CP_TOKEN_BUFFER_SIZE, sizeof (cp_token));
318 lexer->buffer_end = lexer->buffer + CP_TOKEN_BUFFER_SIZE;
320 /* There is one token in the buffer. */
321 lexer->last_token = lexer->buffer + 1;
322 lexer->first_token = lexer->buffer;
323 lexer->next_token = lexer->buffer;
324 memcpy (lexer->buffer, &first_token, sizeof (cp_token));
326 /* This lexer obtains more tokens by calling c_lex. */
327 lexer->main_lexer_p = true;
329 /* Create the SAVED_TOKENS stack. */
330 VARRAY_INT_INIT (lexer->saved_tokens, CP_SAVED_TOKENS_SIZE, "saved_tokens");
332 /* Create the STRINGS array. */
333 VARRAY_TREE_INIT (lexer->string_tokens, 32, "strings");
335 /* Assume we are not debugging. */
336 lexer->debugging_p = false;
341 /* Create a new lexer whose token stream is primed with the TOKENS.
342 When these tokens are exhausted, no new tokens will be read. */
345 cp_lexer_new_from_tokens (cp_token_cache *tokens)
349 cp_token_block *block;
350 ptrdiff_t num_tokens;
352 /* Allocate the memory. */
353 lexer = GGC_CNEW (cp_lexer);
355 /* Create a new buffer, appropriately sized. */
357 for (block = tokens->first; block != NULL; block = block->next)
358 num_tokens += block->num_tokens;
359 lexer->buffer = GGC_NEWVEC (cp_token, num_tokens);
360 lexer->buffer_end = lexer->buffer + num_tokens;
362 /* Install the tokens. */
363 token = lexer->buffer;
364 for (block = tokens->first; block != NULL; block = block->next)
366 memcpy (token, block->tokens, block->num_tokens * sizeof (cp_token));
367 token += block->num_tokens;
370 /* The FIRST_TOKEN is the beginning of the buffer. */
371 lexer->first_token = lexer->buffer;
372 /* The next available token is also at the beginning of the buffer. */
373 lexer->next_token = lexer->buffer;
374 /* The buffer is full. */
375 lexer->last_token = lexer->first_token;
377 /* This lexer doesn't obtain more tokens. */
378 lexer->main_lexer_p = false;
380 /* Create the SAVED_TOKENS stack. */
381 VARRAY_INT_INIT (lexer->saved_tokens, CP_SAVED_TOKENS_SIZE, "saved_tokens");
383 /* Create the STRINGS array. */
384 VARRAY_TREE_INIT (lexer->string_tokens, 32, "strings");
386 /* Assume we are not debugging. */
387 lexer->debugging_p = false;
392 /* Returns nonzero if debugging information should be output. */
395 cp_lexer_debugging_p (cp_lexer *lexer)
397 return lexer->debugging_p;
400 /* Set the current source position from the information stored in
404 cp_lexer_set_source_position_from_token (cp_lexer *lexer ATTRIBUTE_UNUSED ,
405 const cp_token *token)
407 /* Ideally, the source position information would not be a global
408 variable, but it is. */
410 /* Update the line number. */
411 if (token->type != CPP_EOF)
412 input_location = token->location;
415 /* TOKEN points into the circular token buffer. Return a pointer to
416 the next token in the buffer. */
418 static inline cp_token *
419 cp_lexer_next_token (cp_lexer* lexer, cp_token* token)
422 if (token == lexer->buffer_end)
423 token = lexer->buffer;
427 /* TOKEN points into the circular token buffer. Return a pointer to
428 the previous token in the buffer. */
430 static inline cp_token *
431 cp_lexer_prev_token (cp_lexer* lexer, cp_token* token)
433 if (token == lexer->buffer)
434 token = lexer->buffer_end;
438 /* nonzero if we are presently saving tokens. */
441 cp_lexer_saving_tokens (const cp_lexer* lexer)
443 return VARRAY_ACTIVE_SIZE (lexer->saved_tokens) != 0;
446 /* Return a pointer to the token that is N tokens beyond TOKEN in the
450 cp_lexer_advance_token (cp_lexer *lexer, cp_token *token, ptrdiff_t n)
453 if (token >= lexer->buffer_end)
454 token = lexer->buffer + (token - lexer->buffer_end);
458 /* Returns the number of times that START would have to be incremented
459 to reach FINISH. If START and FINISH are the same, returns zero. */
462 cp_lexer_token_difference (cp_lexer* lexer, cp_token* start, cp_token* finish)
465 return finish - start;
467 return ((lexer->buffer_end - lexer->buffer)
471 /* Obtain another token from the C preprocessor and add it to the
472 token buffer. Returns the newly read token. */
475 cp_lexer_read_token (cp_lexer* lexer)
479 /* Make sure there is room in the buffer. */
480 cp_lexer_maybe_grow_buffer (lexer);
482 /* If there weren't any tokens, then this one will be the first. */
483 if (!lexer->first_token)
484 lexer->first_token = lexer->last_token;
485 /* Similarly, if there were no available tokens, there is one now. */
486 if (!lexer->next_token)
487 lexer->next_token = lexer->last_token;
489 /* Figure out where we're going to store the new token. */
490 token = lexer->last_token;
492 /* Get a new token from the preprocessor. */
493 cp_lexer_get_preprocessor_token (lexer, token);
495 /* Increment LAST_TOKEN. */
496 lexer->last_token = cp_lexer_next_token (lexer, token);
498 /* Strings should have type `const char []'. Right now, we will
499 have an ARRAY_TYPE that is constant rather than an array of
501 FIXME: Make fix_string_type get this right in the first place. */
502 if ((token->type == CPP_STRING || token->type == CPP_WSTRING)
503 && flag_const_strings)
505 if (c_lex_string_translate)
507 tree value = token->value;
510 /* We might as well go ahead and release the chained
511 translated string such that we can reuse its memory. */
512 if (TREE_CHAIN (value))
513 value = TREE_CHAIN (token->value);
515 /* Get the current type. It will be an ARRAY_TYPE. */
516 type = TREE_TYPE (value);
517 /* Use build_cplus_array_type to rebuild the array, thereby
518 getting the right type. */
519 type = build_cplus_array_type (TREE_TYPE (type),
521 /* Reset the type of the token. */
522 TREE_TYPE (value) = type;
529 /* If the circular buffer is full, make it bigger. */
532 cp_lexer_maybe_grow_buffer (cp_lexer* lexer)
534 /* If the buffer is full, enlarge it. */
535 if (lexer->last_token == lexer->first_token)
537 cp_token *new_buffer;
538 cp_token *old_buffer;
539 cp_token *new_first_token;
540 ptrdiff_t buffer_length;
541 size_t num_tokens_to_copy;
543 /* Remember the current buffer pointer. It will become invalid,
544 but we will need to do pointer arithmetic involving this
546 old_buffer = lexer->buffer;
547 /* Compute the current buffer size. */
548 buffer_length = lexer->buffer_end - lexer->buffer;
549 /* Allocate a buffer twice as big. */
550 new_buffer = ggc_realloc (lexer->buffer,
551 2 * buffer_length * sizeof (cp_token));
553 /* Because the buffer is circular, logically consecutive tokens
554 are not necessarily placed consecutively in memory.
555 Therefore, we must keep move the tokens that were before
556 FIRST_TOKEN to the second half of the newly allocated
558 num_tokens_to_copy = (lexer->first_token - old_buffer);
559 memcpy (new_buffer + buffer_length,
561 num_tokens_to_copy * sizeof (cp_token));
562 /* Clear the rest of the buffer. We never look at this storage,
563 but the garbage collector may. */
564 memset (new_buffer + buffer_length + num_tokens_to_copy, 0,
565 (buffer_length - num_tokens_to_copy) * sizeof (cp_token));
567 /* Now recompute all of the buffer pointers. */
569 = new_buffer + (lexer->first_token - old_buffer);
570 if (lexer->next_token != NULL)
572 ptrdiff_t next_token_delta;
574 if (lexer->next_token > lexer->first_token)
575 next_token_delta = lexer->next_token - lexer->first_token;
578 buffer_length - (lexer->first_token - lexer->next_token);
579 lexer->next_token = new_first_token + next_token_delta;
581 lexer->last_token = new_first_token + buffer_length;
582 lexer->buffer = new_buffer;
583 lexer->buffer_end = new_buffer + buffer_length * 2;
584 lexer->first_token = new_first_token;
588 /* Store the next token from the preprocessor in *TOKEN. */
591 cp_lexer_get_preprocessor_token (cp_lexer *lexer ATTRIBUTE_UNUSED ,
596 /* If this not the main lexer, return a terminating CPP_EOF token. */
597 if (lexer != NULL && !lexer->main_lexer_p)
599 token->type = CPP_EOF;
600 token->location = UNKNOWN_LOCATION;
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;
998 /* Decl-specifiers. */
1000 static void clear_decl_specs
1001 (cp_decl_specifier_seq *);
1003 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1006 clear_decl_specs (cp_decl_specifier_seq *decl_specs)
1008 memset (decl_specs, 0, sizeof (cp_decl_specifier_seq));
1013 /* Nothing other than the parser should be creating declarators;
1014 declarators are a semi-syntactic representation of C++ entities.
1015 Other parts of the front end that need to create entities (like
1016 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1018 static cp_declarator *make_id_declarator
1020 static cp_declarator *make_call_declarator
1021 (cp_declarator *, cp_parameter_declarator *, cp_cv_quals, tree);
1022 static cp_declarator *make_array_declarator
1023 (cp_declarator *, tree);
1024 static cp_declarator *make_pointer_declarator
1025 (cp_cv_quals, cp_declarator *);
1026 static cp_declarator *make_reference_declarator
1027 (cp_cv_quals, cp_declarator *);
1028 static cp_parameter_declarator *make_parameter_declarator
1029 (cp_decl_specifier_seq *, cp_declarator *, tree);
1030 static cp_declarator *make_ptrmem_declarator
1031 (cp_cv_quals, tree, cp_declarator *);
1033 cp_declarator *cp_error_declarator;
1035 /* The obstack on which declarators and related data structures are
1037 static struct obstack declarator_obstack;
1039 /* Alloc BYTES from the declarator memory pool. */
1041 static inline void *
1042 alloc_declarator (size_t bytes)
1044 return obstack_alloc (&declarator_obstack, bytes);
1047 /* Allocate a declarator of the indicated KIND. Clear fields that are
1048 common to all declarators. */
1050 static cp_declarator *
1051 make_declarator (cp_declarator_kind kind)
1053 cp_declarator *declarator;
1055 declarator = (cp_declarator *) alloc_declarator (sizeof (cp_declarator));
1056 declarator->kind = kind;
1057 declarator->attributes = NULL_TREE;
1058 declarator->declarator = NULL;
1063 /* Make a declarator for a generalized identifier. */
1066 make_id_declarator (tree id)
1068 cp_declarator *declarator;
1070 declarator = make_declarator (cdk_id);
1071 declarator->u.id.name = id;
1072 declarator->u.id.sfk = sfk_none;
1077 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1078 of modifiers such as const or volatile to apply to the pointer
1079 type, represented as identifiers. */
1082 make_pointer_declarator (cp_cv_quals cv_qualifiers, cp_declarator *target)
1084 cp_declarator *declarator;
1086 declarator = make_declarator (cdk_pointer);
1087 declarator->declarator = target;
1088 declarator->u.pointer.qualifiers = cv_qualifiers;
1089 declarator->u.pointer.class_type = NULL_TREE;
1094 /* Like make_pointer_declarator -- but for references. */
1097 make_reference_declarator (cp_cv_quals cv_qualifiers, cp_declarator *target)
1099 cp_declarator *declarator;
1101 declarator = make_declarator (cdk_reference);
1102 declarator->declarator = target;
1103 declarator->u.pointer.qualifiers = cv_qualifiers;
1104 declarator->u.pointer.class_type = NULL_TREE;
1109 /* Like make_pointer_declarator -- but for a pointer to a non-static
1110 member of CLASS_TYPE. */
1113 make_ptrmem_declarator (cp_cv_quals cv_qualifiers, tree class_type,
1114 cp_declarator *pointee)
1116 cp_declarator *declarator;
1118 declarator = make_declarator (cdk_ptrmem);
1119 declarator->declarator = pointee;
1120 declarator->u.pointer.qualifiers = cv_qualifiers;
1121 declarator->u.pointer.class_type = class_type;
1126 /* Make a declarator for the function given by TARGET, with the
1127 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1128 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1129 indicates what exceptions can be thrown. */
1132 make_call_declarator (cp_declarator *target,
1133 cp_parameter_declarator *parms,
1134 cp_cv_quals cv_qualifiers,
1135 tree exception_specification)
1137 cp_declarator *declarator;
1139 declarator = make_declarator (cdk_function);
1140 declarator->declarator = target;
1141 declarator->u.function.parameters = parms;
1142 declarator->u.function.qualifiers = cv_qualifiers;
1143 declarator->u.function.exception_specification = exception_specification;
1148 /* Make a declarator for an array of BOUNDS elements, each of which is
1149 defined by ELEMENT. */
1152 make_array_declarator (cp_declarator *element, tree bounds)
1154 cp_declarator *declarator;
1156 declarator = make_declarator (cdk_array);
1157 declarator->declarator = element;
1158 declarator->u.array.bounds = bounds;
1163 cp_parameter_declarator *no_parameters;
1165 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1166 DECLARATOR and DEFAULT_ARGUMENT. */
1168 cp_parameter_declarator *
1169 make_parameter_declarator (cp_decl_specifier_seq *decl_specifiers,
1170 cp_declarator *declarator,
1171 tree default_argument)
1173 cp_parameter_declarator *parameter;
1175 parameter = ((cp_parameter_declarator *)
1176 alloc_declarator (sizeof (cp_parameter_declarator)));
1177 parameter->next = NULL;
1178 if (decl_specifiers)
1179 parameter->decl_specifiers = *decl_specifiers;
1181 clear_decl_specs (¶meter->decl_specifiers);
1182 parameter->declarator = declarator;
1183 parameter->default_argument = default_argument;
1184 parameter->ellipsis_p = false;
1194 A cp_parser parses the token stream as specified by the C++
1195 grammar. Its job is purely parsing, not semantic analysis. For
1196 example, the parser breaks the token stream into declarators,
1197 expressions, statements, and other similar syntactic constructs.
1198 It does not check that the types of the expressions on either side
1199 of an assignment-statement are compatible, or that a function is
1200 not declared with a parameter of type `void'.
1202 The parser invokes routines elsewhere in the compiler to perform
1203 semantic analysis and to build up the abstract syntax tree for the
1206 The parser (and the template instantiation code, which is, in a
1207 way, a close relative of parsing) are the only parts of the
1208 compiler that should be calling push_scope and pop_scope, or
1209 related functions. The parser (and template instantiation code)
1210 keeps track of what scope is presently active; everything else
1211 should simply honor that. (The code that generates static
1212 initializers may also need to set the scope, in order to check
1213 access control correctly when emitting the initializers.)
1218 The parser is of the standard recursive-descent variety. Upcoming
1219 tokens in the token stream are examined in order to determine which
1220 production to use when parsing a non-terminal. Some C++ constructs
1221 require arbitrary look ahead to disambiguate. For example, it is
1222 impossible, in the general case, to tell whether a statement is an
1223 expression or declaration without scanning the entire statement.
1224 Therefore, the parser is capable of "parsing tentatively." When the
1225 parser is not sure what construct comes next, it enters this mode.
1226 Then, while we attempt to parse the construct, the parser queues up
1227 error messages, rather than issuing them immediately, and saves the
1228 tokens it consumes. If the construct is parsed successfully, the
1229 parser "commits", i.e., it issues any queued error messages and
1230 the tokens that were being preserved are permanently discarded.
1231 If, however, the construct is not parsed successfully, the parser
1232 rolls back its state completely so that it can resume parsing using
1233 a different alternative.
1238 The performance of the parser could probably be improved
1239 substantially. Some possible improvements include:
1241 - The expression parser recurses through the various levels of
1242 precedence as specified in the grammar, rather than using an
1243 operator-precedence technique. Therefore, parsing a simple
1244 identifier requires multiple recursive calls.
1246 - We could often eliminate the need to parse tentatively by
1247 looking ahead a little bit. In some places, this approach
1248 might not entirely eliminate the need to parse tentatively, but
1249 it might still speed up the average case. */
1251 /* Flags that are passed to some parsing functions. These values can
1252 be bitwise-ored together. */
1254 typedef enum cp_parser_flags
1257 CP_PARSER_FLAGS_NONE = 0x0,
1258 /* The construct is optional. If it is not present, then no error
1259 should be issued. */
1260 CP_PARSER_FLAGS_OPTIONAL = 0x1,
1261 /* When parsing a type-specifier, do not allow user-defined types. */
1262 CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES = 0x2
1265 /* The different kinds of declarators we want to parse. */
1267 typedef enum cp_parser_declarator_kind
1269 /* We want an abstract declarator. */
1270 CP_PARSER_DECLARATOR_ABSTRACT,
1271 /* We want a named declarator. */
1272 CP_PARSER_DECLARATOR_NAMED,
1273 /* We don't mind, but the name must be an unqualified-id. */
1274 CP_PARSER_DECLARATOR_EITHER
1275 } cp_parser_declarator_kind;
1277 /* A mapping from a token type to a corresponding tree node type. */
1279 typedef struct cp_parser_token_tree_map_node
1281 /* The token type. */
1282 ENUM_BITFIELD (cpp_ttype) token_type : 8;
1283 /* The corresponding tree code. */
1284 ENUM_BITFIELD (tree_code) tree_type : 8;
1285 } cp_parser_token_tree_map_node;
1287 /* A complete map consists of several ordinary entries, followed by a
1288 terminator. The terminating entry has a token_type of CPP_EOF. */
1290 typedef cp_parser_token_tree_map_node cp_parser_token_tree_map[];
1292 /* The status of a tentative parse. */
1294 typedef enum cp_parser_status_kind
1296 /* No errors have occurred. */
1297 CP_PARSER_STATUS_KIND_NO_ERROR,
1298 /* An error has occurred. */
1299 CP_PARSER_STATUS_KIND_ERROR,
1300 /* We are committed to this tentative parse, whether or not an error
1302 CP_PARSER_STATUS_KIND_COMMITTED
1303 } cp_parser_status_kind;
1305 /* Context that is saved and restored when parsing tentatively. */
1307 typedef struct cp_parser_context GTY (())
1309 /* If this is a tentative parsing context, the status of the
1311 enum cp_parser_status_kind status;
1312 /* If non-NULL, we have just seen a `x->' or `x.' expression. Names
1313 that are looked up in this context must be looked up both in the
1314 scope given by OBJECT_TYPE (the type of `x' or `*x') and also in
1315 the context of the containing expression. */
1317 /* The next parsing context in the stack. */
1318 struct cp_parser_context *next;
1319 } cp_parser_context;
1323 /* Constructors and destructors. */
1325 static cp_parser_context *cp_parser_context_new
1326 (cp_parser_context *);
1328 /* Class variables. */
1330 static GTY((deletable)) cp_parser_context* cp_parser_context_free_list;
1332 /* Constructors and destructors. */
1334 /* Construct a new context. The context below this one on the stack
1335 is given by NEXT. */
1337 static cp_parser_context *
1338 cp_parser_context_new (cp_parser_context* next)
1340 cp_parser_context *context;
1342 /* Allocate the storage. */
1343 if (cp_parser_context_free_list != NULL)
1345 /* Pull the first entry from the free list. */
1346 context = cp_parser_context_free_list;
1347 cp_parser_context_free_list = context->next;
1348 memset (context, 0, sizeof (*context));
1351 context = GGC_CNEW (cp_parser_context);
1352 /* No errors have occurred yet in this context. */
1353 context->status = CP_PARSER_STATUS_KIND_NO_ERROR;
1354 /* If this is not the bottomost context, copy information that we
1355 need from the previous context. */
1358 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1359 expression, then we are parsing one in this context, too. */
1360 context->object_type = next->object_type;
1361 /* Thread the stack. */
1362 context->next = next;
1368 /* The cp_parser structure represents the C++ parser. */
1370 typedef struct cp_parser GTY(())
1372 /* The lexer from which we are obtaining tokens. */
1375 /* The scope in which names should be looked up. If NULL_TREE, then
1376 we look up names in the scope that is currently open in the
1377 source program. If non-NULL, this is either a TYPE or
1378 NAMESPACE_DECL for the scope in which we should look.
1380 This value is not cleared automatically after a name is looked
1381 up, so we must be careful to clear it before starting a new look
1382 up sequence. (If it is not cleared, then `X::Y' followed by `Z'
1383 will look up `Z' in the scope of `X', rather than the current
1384 scope.) Unfortunately, it is difficult to tell when name lookup
1385 is complete, because we sometimes peek at a token, look it up,
1386 and then decide not to consume it. */
1389 /* OBJECT_SCOPE and QUALIFYING_SCOPE give the scopes in which the
1390 last lookup took place. OBJECT_SCOPE is used if an expression
1391 like "x->y" or "x.y" was used; it gives the type of "*x" or "x",
1392 respectively. QUALIFYING_SCOPE is used for an expression of the
1393 form "X::Y"; it refers to X. */
1395 tree qualifying_scope;
1397 /* A stack of parsing contexts. All but the bottom entry on the
1398 stack will be tentative contexts.
1400 We parse tentatively in order to determine which construct is in
1401 use in some situations. For example, in order to determine
1402 whether a statement is an expression-statement or a
1403 declaration-statement we parse it tentatively as a
1404 declaration-statement. If that fails, we then reparse the same
1405 token stream as an expression-statement. */
1406 cp_parser_context *context;
1408 /* True if we are parsing GNU C++. If this flag is not set, then
1409 GNU extensions are not recognized. */
1410 bool allow_gnu_extensions_p;
1412 /* TRUE if the `>' token should be interpreted as the greater-than
1413 operator. FALSE if it is the end of a template-id or
1414 template-parameter-list. */
1415 bool greater_than_is_operator_p;
1417 /* TRUE if default arguments are allowed within a parameter list
1418 that starts at this point. FALSE if only a gnu extension makes
1419 them permissible. */
1420 bool default_arg_ok_p;
1422 /* TRUE if we are parsing an integral constant-expression. See
1423 [expr.const] for a precise definition. */
1424 bool integral_constant_expression_p;
1426 /* TRUE if we are parsing an integral constant-expression -- but a
1427 non-constant expression should be permitted as well. This flag
1428 is used when parsing an array bound so that GNU variable-length
1429 arrays are tolerated. */
1430 bool allow_non_integral_constant_expression_p;
1432 /* TRUE if ALLOW_NON_CONSTANT_EXPRESSION_P is TRUE and something has
1433 been seen that makes the expression non-constant. */
1434 bool non_integral_constant_expression_p;
1436 /* TRUE if local variable names and `this' are forbidden in the
1438 bool local_variables_forbidden_p;
1440 /* TRUE if the declaration we are parsing is part of a
1441 linkage-specification of the form `extern string-literal
1443 bool in_unbraced_linkage_specification_p;
1445 /* TRUE if we are presently parsing a declarator, after the
1446 direct-declarator. */
1447 bool in_declarator_p;
1449 /* TRUE if we are presently parsing a template-argument-list. */
1450 bool in_template_argument_list_p;
1452 /* TRUE if we are presently parsing the body of an
1453 iteration-statement. */
1454 bool in_iteration_statement_p;
1456 /* TRUE if we are presently parsing the body of a switch
1458 bool in_switch_statement_p;
1460 /* TRUE if we are parsing a type-id in an expression context. In
1461 such a situation, both "type (expr)" and "type (type)" are valid
1463 bool in_type_id_in_expr_p;
1465 /* If non-NULL, then we are parsing a construct where new type
1466 definitions are not permitted. The string stored here will be
1467 issued as an error message if a type is defined. */
1468 const char *type_definition_forbidden_message;
1470 /* A list of lists. The outer list is a stack, used for member
1471 functions of local classes. At each level there are two sub-list,
1472 one on TREE_VALUE and one on TREE_PURPOSE. Each of those
1473 sub-lists has a FUNCTION_DECL or TEMPLATE_DECL on their
1474 TREE_VALUE's. The functions are chained in reverse declaration
1477 The TREE_PURPOSE sublist contains those functions with default
1478 arguments that need post processing, and the TREE_VALUE sublist
1479 contains those functions with definitions that need post
1482 These lists can only be processed once the outermost class being
1483 defined is complete. */
1484 tree unparsed_functions_queues;
1486 /* The number of classes whose definitions are currently in
1488 unsigned num_classes_being_defined;
1490 /* The number of template parameter lists that apply directly to the
1491 current declaration. */
1492 unsigned num_template_parameter_lists;
1495 /* The type of a function that parses some kind of expression. */
1496 typedef tree (*cp_parser_expression_fn) (cp_parser *);
1500 /* Constructors and destructors. */
1502 static cp_parser *cp_parser_new
1505 /* Routines to parse various constructs.
1507 Those that return `tree' will return the error_mark_node (rather
1508 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1509 Sometimes, they will return an ordinary node if error-recovery was
1510 attempted, even though a parse error occurred. So, to check
1511 whether or not a parse error occurred, you should always use
1512 cp_parser_error_occurred. If the construct is optional (indicated
1513 either by an `_opt' in the name of the function that does the
1514 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1515 the construct is not present. */
1517 /* Lexical conventions [gram.lex] */
1519 static tree cp_parser_identifier
1522 /* Basic concepts [gram.basic] */
1524 static bool cp_parser_translation_unit
1527 /* Expressions [gram.expr] */
1529 static tree cp_parser_primary_expression
1530 (cp_parser *, cp_id_kind *, tree *);
1531 static tree cp_parser_id_expression
1532 (cp_parser *, bool, bool, bool *, bool);
1533 static tree cp_parser_unqualified_id
1534 (cp_parser *, bool, bool, bool);
1535 static tree cp_parser_nested_name_specifier_opt
1536 (cp_parser *, bool, bool, bool, bool);
1537 static tree cp_parser_nested_name_specifier
1538 (cp_parser *, bool, bool, bool, bool);
1539 static tree cp_parser_class_or_namespace_name
1540 (cp_parser *, bool, bool, bool, bool, bool);
1541 static tree cp_parser_postfix_expression
1542 (cp_parser *, bool);
1543 static tree cp_parser_postfix_open_square_expression
1544 (cp_parser *, tree, bool);
1545 static tree cp_parser_postfix_dot_deref_expression
1546 (cp_parser *, enum cpp_ttype, tree, bool, cp_id_kind *);
1547 static tree cp_parser_parenthesized_expression_list
1548 (cp_parser *, bool, bool *);
1549 static void cp_parser_pseudo_destructor_name
1550 (cp_parser *, tree *, tree *);
1551 static tree cp_parser_unary_expression
1552 (cp_parser *, bool);
1553 static enum tree_code cp_parser_unary_operator
1555 static tree cp_parser_new_expression
1557 static tree cp_parser_new_placement
1559 static tree cp_parser_new_type_id
1560 (cp_parser *, tree *);
1561 static cp_declarator *cp_parser_new_declarator_opt
1563 static cp_declarator *cp_parser_direct_new_declarator
1565 static tree cp_parser_new_initializer
1567 static tree cp_parser_delete_expression
1569 static tree cp_parser_cast_expression
1570 (cp_parser *, bool);
1571 static tree cp_parser_pm_expression
1573 static tree cp_parser_multiplicative_expression
1575 static tree cp_parser_additive_expression
1577 static tree cp_parser_shift_expression
1579 static tree cp_parser_relational_expression
1581 static tree cp_parser_equality_expression
1583 static tree cp_parser_and_expression
1585 static tree cp_parser_exclusive_or_expression
1587 static tree cp_parser_inclusive_or_expression
1589 static tree cp_parser_logical_and_expression
1591 static tree cp_parser_logical_or_expression
1593 static tree cp_parser_question_colon_clause
1594 (cp_parser *, tree);
1595 static tree cp_parser_assignment_expression
1597 static enum tree_code cp_parser_assignment_operator_opt
1599 static tree cp_parser_expression
1601 static tree cp_parser_constant_expression
1602 (cp_parser *, bool, bool *);
1603 static tree cp_parser_builtin_offsetof
1606 /* Statements [gram.stmt.stmt] */
1608 static void cp_parser_statement
1609 (cp_parser *, tree);
1610 static tree cp_parser_labeled_statement
1611 (cp_parser *, tree);
1612 static tree cp_parser_expression_statement
1613 (cp_parser *, tree);
1614 static tree cp_parser_compound_statement
1615 (cp_parser *, tree, bool);
1616 static void cp_parser_statement_seq_opt
1617 (cp_parser *, tree);
1618 static tree cp_parser_selection_statement
1620 static tree cp_parser_condition
1622 static tree cp_parser_iteration_statement
1624 static void cp_parser_for_init_statement
1626 static tree cp_parser_jump_statement
1628 static void cp_parser_declaration_statement
1631 static tree cp_parser_implicitly_scoped_statement
1633 static void cp_parser_already_scoped_statement
1636 /* Declarations [gram.dcl.dcl] */
1638 static void cp_parser_declaration_seq_opt
1640 static void cp_parser_declaration
1642 static void cp_parser_block_declaration
1643 (cp_parser *, bool);
1644 static void cp_parser_simple_declaration
1645 (cp_parser *, bool);
1646 static void cp_parser_decl_specifier_seq
1647 (cp_parser *, cp_parser_flags, cp_decl_specifier_seq *, int *);
1648 static tree cp_parser_storage_class_specifier_opt
1650 static tree cp_parser_function_specifier_opt
1651 (cp_parser *, cp_decl_specifier_seq *);
1652 static tree cp_parser_type_specifier
1653 (cp_parser *, cp_parser_flags, cp_decl_specifier_seq *, bool,
1655 static tree cp_parser_simple_type_specifier
1656 (cp_parser *, cp_decl_specifier_seq *, cp_parser_flags);
1657 static tree cp_parser_type_name
1659 static tree cp_parser_elaborated_type_specifier
1660 (cp_parser *, bool, bool);
1661 static tree cp_parser_enum_specifier
1663 static void cp_parser_enumerator_list
1664 (cp_parser *, tree);
1665 static void cp_parser_enumerator_definition
1666 (cp_parser *, tree);
1667 static tree cp_parser_namespace_name
1669 static void cp_parser_namespace_definition
1671 static void cp_parser_namespace_body
1673 static tree cp_parser_qualified_namespace_specifier
1675 static void cp_parser_namespace_alias_definition
1677 static void cp_parser_using_declaration
1679 static void cp_parser_using_directive
1681 static void cp_parser_asm_definition
1683 static void cp_parser_linkage_specification
1686 /* Declarators [gram.dcl.decl] */
1688 static tree cp_parser_init_declarator
1689 (cp_parser *, cp_decl_specifier_seq *, bool, bool, int, bool *);
1690 static cp_declarator *cp_parser_declarator
1691 (cp_parser *, cp_parser_declarator_kind, int *, bool *);
1692 static cp_declarator *cp_parser_direct_declarator
1693 (cp_parser *, cp_parser_declarator_kind, int *);
1694 static enum tree_code cp_parser_ptr_operator
1695 (cp_parser *, tree *, cp_cv_quals *);
1696 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
1698 static tree cp_parser_declarator_id
1700 static tree cp_parser_type_id
1702 static void cp_parser_type_specifier_seq
1703 (cp_parser *, cp_decl_specifier_seq *);
1704 static cp_parameter_declarator *cp_parser_parameter_declaration_clause
1706 static cp_parameter_declarator *cp_parser_parameter_declaration_list
1707 (cp_parser *, bool *);
1708 static cp_parameter_declarator *cp_parser_parameter_declaration
1709 (cp_parser *, bool, bool *);
1710 static void cp_parser_function_body
1712 static tree cp_parser_initializer
1713 (cp_parser *, bool *, bool *);
1714 static tree cp_parser_initializer_clause
1715 (cp_parser *, bool *);
1716 static tree cp_parser_initializer_list
1717 (cp_parser *, bool *);
1719 static bool cp_parser_ctor_initializer_opt_and_function_body
1722 /* Classes [gram.class] */
1724 static tree cp_parser_class_name
1725 (cp_parser *, bool, bool, bool, bool, bool, bool);
1726 static tree cp_parser_class_specifier
1728 static tree cp_parser_class_head
1729 (cp_parser *, bool *, tree *);
1730 static enum tag_types cp_parser_class_key
1732 static void cp_parser_member_specification_opt
1734 static void cp_parser_member_declaration
1736 static tree cp_parser_pure_specifier
1738 static tree cp_parser_constant_initializer
1741 /* Derived classes [gram.class.derived] */
1743 static tree cp_parser_base_clause
1745 static tree cp_parser_base_specifier
1748 /* Special member functions [gram.special] */
1750 static tree cp_parser_conversion_function_id
1752 static tree cp_parser_conversion_type_id
1754 static cp_declarator *cp_parser_conversion_declarator_opt
1756 static bool cp_parser_ctor_initializer_opt
1758 static void cp_parser_mem_initializer_list
1760 static tree cp_parser_mem_initializer
1762 static tree cp_parser_mem_initializer_id
1765 /* Overloading [gram.over] */
1767 static tree cp_parser_operator_function_id
1769 static tree cp_parser_operator
1772 /* Templates [gram.temp] */
1774 static void cp_parser_template_declaration
1775 (cp_parser *, bool);
1776 static tree cp_parser_template_parameter_list
1778 static tree cp_parser_template_parameter
1779 (cp_parser *, bool *);
1780 static tree cp_parser_type_parameter
1782 static tree cp_parser_template_id
1783 (cp_parser *, bool, bool, bool);
1784 static tree cp_parser_template_name
1785 (cp_parser *, bool, bool, bool, bool *);
1786 static tree cp_parser_template_argument_list
1788 static tree cp_parser_template_argument
1790 static void cp_parser_explicit_instantiation
1792 static void cp_parser_explicit_specialization
1795 /* Exception handling [gram.exception] */
1797 static tree cp_parser_try_block
1799 static bool cp_parser_function_try_block
1801 static void cp_parser_handler_seq
1803 static void cp_parser_handler
1805 static tree cp_parser_exception_declaration
1807 static tree cp_parser_throw_expression
1809 static tree cp_parser_exception_specification_opt
1811 static tree cp_parser_type_id_list
1814 /* GNU Extensions */
1816 static tree cp_parser_asm_specification_opt
1818 static tree cp_parser_asm_operand_list
1820 static tree cp_parser_asm_clobber_list
1822 static tree cp_parser_attributes_opt
1824 static tree cp_parser_attribute_list
1826 static bool cp_parser_extension_opt
1827 (cp_parser *, int *);
1828 static void cp_parser_label_declaration
1831 /* Utility Routines */
1833 static tree cp_parser_lookup_name
1834 (cp_parser *, tree, bool, bool, bool, bool);
1835 static tree cp_parser_lookup_name_simple
1836 (cp_parser *, tree);
1837 static tree cp_parser_maybe_treat_template_as_class
1839 static bool cp_parser_check_declarator_template_parameters
1840 (cp_parser *, cp_declarator *);
1841 static bool cp_parser_check_template_parameters
1842 (cp_parser *, unsigned);
1843 static tree cp_parser_simple_cast_expression
1845 static tree cp_parser_binary_expression
1846 (cp_parser *, const cp_parser_token_tree_map, cp_parser_expression_fn);
1847 static tree cp_parser_global_scope_opt
1848 (cp_parser *, bool);
1849 static bool cp_parser_constructor_declarator_p
1850 (cp_parser *, bool);
1851 static tree cp_parser_function_definition_from_specifiers_and_declarator
1852 (cp_parser *, cp_decl_specifier_seq *, tree, const cp_declarator *);
1853 static tree cp_parser_function_definition_after_declarator
1854 (cp_parser *, bool);
1855 static void cp_parser_template_declaration_after_export
1856 (cp_parser *, bool);
1857 static tree cp_parser_single_declaration
1858 (cp_parser *, bool, bool *);
1859 static tree cp_parser_functional_cast
1860 (cp_parser *, tree);
1861 static tree cp_parser_save_member_function_body
1862 (cp_parser *, cp_decl_specifier_seq *, cp_declarator *, tree);
1863 static tree cp_parser_enclosed_template_argument_list
1865 static void cp_parser_save_default_args
1866 (cp_parser *, tree);
1867 static void cp_parser_late_parsing_for_member
1868 (cp_parser *, tree);
1869 static void cp_parser_late_parsing_default_args
1870 (cp_parser *, tree);
1871 static tree cp_parser_sizeof_operand
1872 (cp_parser *, enum rid);
1873 static bool cp_parser_declares_only_class_p
1875 static void cp_parser_set_storage_class
1876 (cp_decl_specifier_seq *, cp_storage_class);
1877 static void cp_parser_set_decl_spec_type
1878 (cp_decl_specifier_seq *, tree, bool);
1879 static bool cp_parser_friend_p
1880 (const cp_decl_specifier_seq *);
1881 static cp_token *cp_parser_require
1882 (cp_parser *, enum cpp_ttype, const char *);
1883 static cp_token *cp_parser_require_keyword
1884 (cp_parser *, enum rid, const char *);
1885 static bool cp_parser_token_starts_function_definition_p
1887 static bool cp_parser_next_token_starts_class_definition_p
1889 static bool cp_parser_next_token_ends_template_argument_p
1891 static bool cp_parser_nth_token_starts_template_argument_list_p
1892 (cp_parser *, size_t);
1893 static enum tag_types cp_parser_token_is_class_key
1895 static void cp_parser_check_class_key
1896 (enum tag_types, tree type);
1897 static void cp_parser_check_access_in_redeclaration
1899 static bool cp_parser_optional_template_keyword
1901 static void cp_parser_pre_parsed_nested_name_specifier
1903 static void cp_parser_cache_group
1904 (cp_parser *, cp_token_cache *, enum cpp_ttype, unsigned);
1905 static void cp_parser_parse_tentatively
1907 static void cp_parser_commit_to_tentative_parse
1909 static void cp_parser_abort_tentative_parse
1911 static bool cp_parser_parse_definitely
1913 static inline bool cp_parser_parsing_tentatively
1915 static bool cp_parser_committed_to_tentative_parse
1917 static void cp_parser_error
1918 (cp_parser *, const char *);
1919 static void cp_parser_name_lookup_error
1920 (cp_parser *, tree, tree, const char *);
1921 static bool cp_parser_simulate_error
1923 static void cp_parser_check_type_definition
1925 static void cp_parser_check_for_definition_in_return_type
1926 (cp_declarator *, int);
1927 static void cp_parser_check_for_invalid_template_id
1928 (cp_parser *, tree);
1929 static bool cp_parser_non_integral_constant_expression
1930 (cp_parser *, const char *);
1931 static void cp_parser_diagnose_invalid_type_name
1932 (cp_parser *, tree, tree);
1933 static bool cp_parser_parse_and_diagnose_invalid_type_name
1935 static int cp_parser_skip_to_closing_parenthesis
1936 (cp_parser *, bool, bool, bool);
1937 static void cp_parser_skip_to_end_of_statement
1939 static void cp_parser_consume_semicolon_at_end_of_statement
1941 static void cp_parser_skip_to_end_of_block_or_statement
1943 static void cp_parser_skip_to_closing_brace
1945 static void cp_parser_skip_until_found
1946 (cp_parser *, enum cpp_ttype, const char *);
1947 static bool cp_parser_error_occurred
1949 static bool cp_parser_allow_gnu_extensions_p
1951 static bool cp_parser_is_string_literal
1953 static bool cp_parser_is_keyword
1954 (cp_token *, enum rid);
1955 static tree cp_parser_make_typename_type
1956 (cp_parser *, tree, tree);
1958 /* Returns nonzero if we are parsing tentatively. */
1961 cp_parser_parsing_tentatively (cp_parser* parser)
1963 return parser->context->next != NULL;
1966 /* Returns nonzero if TOKEN is a string literal. */
1969 cp_parser_is_string_literal (cp_token* token)
1971 return (token->type == CPP_STRING || token->type == CPP_WSTRING);
1974 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
1977 cp_parser_is_keyword (cp_token* token, enum rid keyword)
1979 return token->keyword == keyword;
1982 /* Issue the indicated error MESSAGE. */
1985 cp_parser_error (cp_parser* parser, const char* message)
1987 /* Output the MESSAGE -- unless we're parsing tentatively. */
1988 if (!cp_parser_simulate_error (parser))
1991 token = cp_lexer_peek_token (parser->lexer);
1992 c_parse_error (message,
1993 /* Because c_parser_error does not understand
1994 CPP_KEYWORD, keywords are treated like
1996 (token->type == CPP_KEYWORD ? CPP_NAME : token->type),
2001 /* Issue an error about name-lookup failing. NAME is the
2002 IDENTIFIER_NODE DECL is the result of
2003 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2004 the thing that we hoped to find. */
2007 cp_parser_name_lookup_error (cp_parser* parser,
2010 const char* desired)
2012 /* If name lookup completely failed, tell the user that NAME was not
2014 if (decl == error_mark_node)
2016 if (parser->scope && parser->scope != global_namespace)
2017 error ("`%D::%D' has not been declared",
2018 parser->scope, name);
2019 else if (parser->scope == global_namespace)
2020 error ("`::%D' has not been declared", name);
2022 error ("`%D' has not been declared", name);
2024 else if (parser->scope && parser->scope != global_namespace)
2025 error ("`%D::%D' %s", parser->scope, name, desired);
2026 else if (parser->scope == global_namespace)
2027 error ("`::%D' %s", name, desired);
2029 error ("`%D' %s", name, desired);
2032 /* If we are parsing tentatively, remember that an error has occurred
2033 during this tentative parse. Returns true if the error was
2034 simulated; false if a message should be issued by the caller. */
2037 cp_parser_simulate_error (cp_parser* parser)
2039 if (cp_parser_parsing_tentatively (parser)
2040 && !cp_parser_committed_to_tentative_parse (parser))
2042 parser->context->status = CP_PARSER_STATUS_KIND_ERROR;
2048 /* This function is called when a type is defined. If type
2049 definitions are forbidden at this point, an error message is
2053 cp_parser_check_type_definition (cp_parser* parser)
2055 /* If types are forbidden here, issue a message. */
2056 if (parser->type_definition_forbidden_message)
2057 /* Use `%s' to print the string in case there are any escape
2058 characters in the message. */
2059 error ("%s", parser->type_definition_forbidden_message);
2062 /* This function is called when a declaration is parsed. If
2063 DECLARATOR is a function declarator and DECLARES_CLASS_OR_ENUM
2064 indicates that a type was defined in the decl-specifiers for DECL,
2065 then an error is issued. */
2068 cp_parser_check_for_definition_in_return_type (cp_declarator *declarator,
2069 int declares_class_or_enum)
2071 /* [dcl.fct] forbids type definitions in return types.
2072 Unfortunately, it's not easy to know whether or not we are
2073 processing a return type until after the fact. */
2075 && (declarator->kind == cdk_pointer
2076 || declarator->kind == cdk_reference
2077 || declarator->kind == cdk_ptrmem))
2078 declarator = declarator->declarator;
2080 && declarator->kind == cdk_function
2081 && declares_class_or_enum & 2)
2082 error ("new types may not be defined in a return type");
2085 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2086 "<" in any valid C++ program. If the next token is indeed "<",
2087 issue a message warning the user about what appears to be an
2088 invalid attempt to form a template-id. */
2091 cp_parser_check_for_invalid_template_id (cp_parser* parser,
2097 if (cp_lexer_next_token_is (parser->lexer, CPP_LESS))
2100 error ("`%T' is not a template", type);
2101 else if (TREE_CODE (type) == IDENTIFIER_NODE)
2102 error ("`%E' is not a template", type);
2104 error ("invalid template-id");
2105 /* Remember the location of the invalid "<". */
2106 if (cp_parser_parsing_tentatively (parser)
2107 && !cp_parser_committed_to_tentative_parse (parser))
2109 token = cp_lexer_peek_token (parser->lexer);
2110 token = cp_lexer_prev_token (parser->lexer, token);
2111 start = cp_lexer_token_difference (parser->lexer,
2112 parser->lexer->first_token,
2117 /* Consume the "<". */
2118 cp_lexer_consume_token (parser->lexer);
2119 /* Parse the template arguments. */
2120 cp_parser_enclosed_template_argument_list (parser);
2121 /* Permanently remove the invalid template arguments so that
2122 this error message is not issued again. */
2125 token = cp_lexer_advance_token (parser->lexer,
2126 parser->lexer->first_token,
2128 cp_lexer_purge_tokens_after (parser->lexer, token);
2133 /* If parsing an integral constant-expression, issue an error message
2134 about the fact that THING appeared and return true. Otherwise,
2135 return false, marking the current expression as non-constant. */
2138 cp_parser_non_integral_constant_expression (cp_parser *parser,
2141 if (parser->integral_constant_expression_p)
2143 if (!parser->allow_non_integral_constant_expression_p)
2145 error ("%s cannot appear in a constant-expression", thing);
2148 parser->non_integral_constant_expression_p = true;
2153 /* Emit a diagnostic for an invalid type name. Consider also if it is
2154 qualified or not and the result of a lookup, to provide a better
2158 cp_parser_diagnose_invalid_type_name (cp_parser *parser, tree scope, tree id)
2160 tree decl, old_scope;
2161 /* Try to lookup the identifier. */
2162 old_scope = parser->scope;
2163 parser->scope = scope;
2164 decl = cp_parser_lookup_name_simple (parser, id);
2165 parser->scope = old_scope;
2166 /* If the lookup found a template-name, it means that the user forgot
2167 to specify an argument list. Emit an useful error message. */
2168 if (TREE_CODE (decl) == TEMPLATE_DECL)
2169 error ("invalid use of template-name `%E' without an argument list",
2171 else if (!parser->scope)
2173 /* Issue an error message. */
2174 error ("`%E' does not name a type", id);
2175 /* If we're in a template class, it's possible that the user was
2176 referring to a type from a base class. For example:
2178 template <typename T> struct A { typedef T X; };
2179 template <typename T> struct B : public A<T> { X x; };
2181 The user should have said "typename A<T>::X". */
2182 if (processing_template_decl && current_class_type)
2186 for (b = TREE_CHAIN (TYPE_BINFO (current_class_type));
2190 tree base_type = BINFO_TYPE (b);
2191 if (CLASS_TYPE_P (base_type)
2192 && dependent_type_p (base_type))
2195 /* Go from a particular instantiation of the
2196 template (which will have an empty TYPE_FIELDs),
2197 to the main version. */
2198 base_type = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (base_type);
2199 for (field = TYPE_FIELDS (base_type);
2201 field = TREE_CHAIN (field))
2202 if (TREE_CODE (field) == TYPE_DECL
2203 && DECL_NAME (field) == id)
2205 inform ("(perhaps `typename %T::%E' was intended)",
2206 BINFO_TYPE (b), id);
2215 /* Here we diagnose qualified-ids where the scope is actually correct,
2216 but the identifier does not resolve to a valid type name. */
2219 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
2220 error ("`%E' in namespace `%E' does not name a type",
2222 else if (TYPE_P (parser->scope))
2223 error ("`%E' in class `%T' does not name a type",
2230 /* Check for a common situation where a type-name should be present,
2231 but is not, and issue a sensible error message. Returns true if an
2232 invalid type-name was detected.
2234 The situation handled by this function are variable declarations of the
2235 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2236 Usually, `ID' should name a type, but if we got here it means that it
2237 does not. We try to emit the best possible error message depending on
2238 how exactly the id-expression looks like.
2242 cp_parser_parse_and_diagnose_invalid_type_name (cp_parser *parser)
2246 cp_parser_parse_tentatively (parser);
2247 id = cp_parser_id_expression (parser,
2248 /*template_keyword_p=*/false,
2249 /*check_dependency_p=*/true,
2250 /*template_p=*/NULL,
2251 /*declarator_p=*/true);
2252 /* After the id-expression, there should be a plain identifier,
2253 otherwise this is not a simple variable declaration. Also, if
2254 the scope is dependent, we cannot do much. */
2255 if (!cp_lexer_next_token_is (parser->lexer, CPP_NAME)
2256 || (parser->scope && TYPE_P (parser->scope)
2257 && dependent_type_p (parser->scope)))
2259 cp_parser_abort_tentative_parse (parser);
2262 if (!cp_parser_parse_definitely (parser))
2265 /* If we got here, this cannot be a valid variable declaration, thus
2266 the cp_parser_id_expression must have resolved to a plain identifier
2267 node (not a TYPE_DECL or TEMPLATE_ID_EXPR). */
2268 my_friendly_assert (TREE_CODE (id) == IDENTIFIER_NODE, 20030203);
2269 /* Emit a diagnostic for the invalid type. */
2270 cp_parser_diagnose_invalid_type_name (parser, parser->scope, id);
2271 /* Skip to the end of the declaration; there's no point in
2272 trying to process it. */
2273 cp_parser_skip_to_end_of_block_or_statement (parser);
2277 /* Consume tokens up to, and including, the next non-nested closing `)'.
2278 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2279 are doing error recovery. Returns -1 if OR_COMMA is true and we
2280 found an unnested comma. */
2283 cp_parser_skip_to_closing_parenthesis (cp_parser *parser,
2288 unsigned paren_depth = 0;
2289 unsigned brace_depth = 0;
2290 int saved_c_lex_string_translate = c_lex_string_translate;
2293 if (recovering && !or_comma && cp_parser_parsing_tentatively (parser)
2294 && !cp_parser_committed_to_tentative_parse (parser))
2298 /* If we're looking ahead, keep both translated and untranslated
2300 c_lex_string_translate = -1;
2306 /* If we've run out of tokens, then there is no closing `)'. */
2307 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
2313 token = cp_lexer_peek_token (parser->lexer);
2315 /* This matches the processing in skip_to_end_of_statement. */
2316 if (token->type == CPP_SEMICOLON && !brace_depth)
2321 if (token->type == CPP_OPEN_BRACE)
2323 if (token->type == CPP_CLOSE_BRACE)
2331 if (recovering && or_comma && token->type == CPP_COMMA
2332 && !brace_depth && !paren_depth)
2340 /* If it is an `(', we have entered another level of nesting. */
2341 if (token->type == CPP_OPEN_PAREN)
2343 /* If it is a `)', then we might be done. */
2344 else if (token->type == CPP_CLOSE_PAREN && !paren_depth--)
2347 cp_lexer_consume_token (parser->lexer);
2355 /* Consume the token. */
2356 cp_lexer_consume_token (parser->lexer);
2359 c_lex_string_translate = saved_c_lex_string_translate;
2363 /* Consume tokens until we reach the end of the current statement.
2364 Normally, that will be just before consuming a `;'. However, if a
2365 non-nested `}' comes first, then we stop before consuming that. */
2368 cp_parser_skip_to_end_of_statement (cp_parser* parser)
2370 unsigned nesting_depth = 0;
2376 /* Peek at the next token. */
2377 token = cp_lexer_peek_token (parser->lexer);
2378 /* If we've run out of tokens, stop. */
2379 if (token->type == CPP_EOF)
2381 /* If the next token is a `;', we have reached the end of the
2383 if (token->type == CPP_SEMICOLON && !nesting_depth)
2385 /* If the next token is a non-nested `}', then we have reached
2386 the end of the current block. */
2387 if (token->type == CPP_CLOSE_BRACE)
2389 /* If this is a non-nested `}', stop before consuming it.
2390 That way, when confronted with something like:
2394 we stop before consuming the closing `}', even though we
2395 have not yet reached a `;'. */
2396 if (nesting_depth == 0)
2398 /* If it is the closing `}' for a block that we have
2399 scanned, stop -- but only after consuming the token.
2405 we will stop after the body of the erroneously declared
2406 function, but before consuming the following `typedef'
2408 if (--nesting_depth == 0)
2410 cp_lexer_consume_token (parser->lexer);
2414 /* If it the next token is a `{', then we are entering a new
2415 block. Consume the entire block. */
2416 else if (token->type == CPP_OPEN_BRACE)
2418 /* Consume the token. */
2419 cp_lexer_consume_token (parser->lexer);
2423 /* This function is called at the end of a statement or declaration.
2424 If the next token is a semicolon, it is consumed; otherwise, error
2425 recovery is attempted. */
2428 cp_parser_consume_semicolon_at_end_of_statement (cp_parser *parser)
2430 /* Look for the trailing `;'. */
2431 if (!cp_parser_require (parser, CPP_SEMICOLON, "`;'"))
2433 /* If there is additional (erroneous) input, skip to the end of
2435 cp_parser_skip_to_end_of_statement (parser);
2436 /* If the next token is now a `;', consume it. */
2437 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
2438 cp_lexer_consume_token (parser->lexer);
2442 /* Skip tokens until we have consumed an entire block, or until we
2443 have consumed a non-nested `;'. */
2446 cp_parser_skip_to_end_of_block_or_statement (cp_parser* parser)
2448 unsigned nesting_depth = 0;
2454 /* Peek at the next token. */
2455 token = cp_lexer_peek_token (parser->lexer);
2456 /* If we've run out of tokens, stop. */
2457 if (token->type == CPP_EOF)
2459 /* If the next token is a `;', we have reached the end of the
2461 if (token->type == CPP_SEMICOLON && !nesting_depth)
2463 /* Consume the `;'. */
2464 cp_lexer_consume_token (parser->lexer);
2467 /* Consume the token. */
2468 token = cp_lexer_consume_token (parser->lexer);
2469 /* If the next token is a non-nested `}', then we have reached
2470 the end of the current block. */
2471 if (token->type == CPP_CLOSE_BRACE
2472 && (nesting_depth == 0 || --nesting_depth == 0))
2474 /* If it the next token is a `{', then we are entering a new
2475 block. Consume the entire block. */
2476 if (token->type == CPP_OPEN_BRACE)
2481 /* Skip tokens until a non-nested closing curly brace is the next
2485 cp_parser_skip_to_closing_brace (cp_parser *parser)
2487 unsigned nesting_depth = 0;
2493 /* Peek at the next token. */
2494 token = cp_lexer_peek_token (parser->lexer);
2495 /* If we've run out of tokens, stop. */
2496 if (token->type == CPP_EOF)
2498 /* If the next token is a non-nested `}', then we have reached
2499 the end of the current block. */
2500 if (token->type == CPP_CLOSE_BRACE && nesting_depth-- == 0)
2502 /* If it the next token is a `{', then we are entering a new
2503 block. Consume the entire block. */
2504 else if (token->type == CPP_OPEN_BRACE)
2506 /* Consume the token. */
2507 cp_lexer_consume_token (parser->lexer);
2511 /* This is a simple wrapper around make_typename_type. When the id is
2512 an unresolved identifier node, we can provide a superior diagnostic
2513 using cp_parser_diagnose_invalid_type_name. */
2516 cp_parser_make_typename_type (cp_parser *parser, tree scope, tree id)
2519 if (TREE_CODE (id) == IDENTIFIER_NODE)
2521 result = make_typename_type (scope, id, /*complain=*/0);
2522 if (result == error_mark_node)
2523 cp_parser_diagnose_invalid_type_name (parser, scope, id);
2526 return make_typename_type (scope, id, tf_error);
2530 /* Create a new C++ parser. */
2533 cp_parser_new (void)
2538 /* cp_lexer_new_main is called before calling ggc_alloc because
2539 cp_lexer_new_main might load a PCH file. */
2540 lexer = cp_lexer_new_main ();
2542 parser = GGC_CNEW (cp_parser);
2543 parser->lexer = lexer;
2544 parser->context = cp_parser_context_new (NULL);
2546 /* For now, we always accept GNU extensions. */
2547 parser->allow_gnu_extensions_p = 1;
2549 /* The `>' token is a greater-than operator, not the end of a
2551 parser->greater_than_is_operator_p = true;
2553 parser->default_arg_ok_p = true;
2555 /* We are not parsing a constant-expression. */
2556 parser->integral_constant_expression_p = false;
2557 parser->allow_non_integral_constant_expression_p = false;
2558 parser->non_integral_constant_expression_p = false;
2560 /* Local variable names are not forbidden. */
2561 parser->local_variables_forbidden_p = false;
2563 /* We are not processing an `extern "C"' declaration. */
2564 parser->in_unbraced_linkage_specification_p = false;
2566 /* We are not processing a declarator. */
2567 parser->in_declarator_p = false;
2569 /* We are not processing a template-argument-list. */
2570 parser->in_template_argument_list_p = false;
2572 /* We are not in an iteration statement. */
2573 parser->in_iteration_statement_p = false;
2575 /* We are not in a switch statement. */
2576 parser->in_switch_statement_p = false;
2578 /* We are not parsing a type-id inside an expression. */
2579 parser->in_type_id_in_expr_p = false;
2581 /* The unparsed function queue is empty. */
2582 parser->unparsed_functions_queues = build_tree_list (NULL_TREE, NULL_TREE);
2584 /* There are no classes being defined. */
2585 parser->num_classes_being_defined = 0;
2587 /* No template parameters apply. */
2588 parser->num_template_parameter_lists = 0;
2593 /* Lexical conventions [gram.lex] */
2595 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
2599 cp_parser_identifier (cp_parser* parser)
2603 /* Look for the identifier. */
2604 token = cp_parser_require (parser, CPP_NAME, "identifier");
2605 /* Return the value. */
2606 return token ? token->value : error_mark_node;
2609 /* Basic concepts [gram.basic] */
2611 /* Parse a translation-unit.
2614 declaration-seq [opt]
2616 Returns TRUE if all went well. */
2619 cp_parser_translation_unit (cp_parser* parser)
2621 /* The address of the first non-permanent object on the declarator
2623 static void *declarator_obstack_base;
2627 /* Create the declarator obstack, if necessary. */
2628 if (!cp_error_declarator)
2630 gcc_obstack_init (&declarator_obstack);
2631 /* Create the error declarator. */
2632 cp_error_declarator = make_declarator (cdk_error);
2633 /* Create the empty parameter list. */
2634 no_parameters = make_parameter_declarator (NULL, NULL, NULL_TREE);
2635 /* Remember where the base of the declarator obstack lies. */
2636 declarator_obstack_base = obstack_next_free (&declarator_obstack);
2641 cp_parser_declaration_seq_opt (parser);
2643 /* If there are no tokens left then all went well. */
2644 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
2646 /* Consume the EOF token. */
2647 cp_parser_require (parser, CPP_EOF, "end-of-file");
2650 finish_translation_unit ();
2657 cp_parser_error (parser, "expected declaration");
2663 /* Make sure the declarator obstack was fully cleaned up. */
2664 my_friendly_assert (obstack_next_free (&declarator_obstack) ==
2665 declarator_obstack_base,
2668 /* All went well. */
2672 /* Expressions [gram.expr] */
2674 /* Parse a primary-expression.
2685 ( compound-statement )
2686 __builtin_va_arg ( assignment-expression , type-id )
2691 Returns a representation of the expression.
2693 *IDK indicates what kind of id-expression (if any) was present.
2695 *QUALIFYING_CLASS is set to a non-NULL value if the id-expression can be
2696 used as the operand of a pointer-to-member. In that case,
2697 *QUALIFYING_CLASS gives the class that is used as the qualifying
2698 class in the pointer-to-member. */
2701 cp_parser_primary_expression (cp_parser *parser,
2703 tree *qualifying_class)
2707 /* Assume the primary expression is not an id-expression. */
2708 *idk = CP_ID_KIND_NONE;
2709 /* And that it cannot be used as pointer-to-member. */
2710 *qualifying_class = NULL_TREE;
2712 /* Peek at the next token. */
2713 token = cp_lexer_peek_token (parser->lexer);
2714 switch (token->type)
2725 token = cp_lexer_consume_token (parser->lexer);
2726 return token->value;
2730 token = cp_lexer_consume_token (parser->lexer);
2731 if (TREE_CHAIN (token->value))
2732 return TREE_CHAIN (token->value);
2734 return token->value;
2736 case CPP_OPEN_PAREN:
2739 bool saved_greater_than_is_operator_p;
2741 /* Consume the `('. */
2742 cp_lexer_consume_token (parser->lexer);
2743 /* Within a parenthesized expression, a `>' token is always
2744 the greater-than operator. */
2745 saved_greater_than_is_operator_p
2746 = parser->greater_than_is_operator_p;
2747 parser->greater_than_is_operator_p = true;
2748 /* If we see `( { ' then we are looking at the beginning of
2749 a GNU statement-expression. */
2750 if (cp_parser_allow_gnu_extensions_p (parser)
2751 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
2753 /* Statement-expressions are not allowed by the standard. */
2755 pedwarn ("ISO C++ forbids braced-groups within expressions");
2757 /* And they're not allowed outside of a function-body; you
2758 cannot, for example, write:
2760 int i = ({ int j = 3; j + 1; });
2762 at class or namespace scope. */
2763 if (!at_function_scope_p ())
2764 error ("statement-expressions are allowed only inside functions");
2765 /* Start the statement-expression. */
2766 expr = begin_stmt_expr ();
2767 /* Parse the compound-statement. */
2768 cp_parser_compound_statement (parser, expr, false);
2770 expr = finish_stmt_expr (expr, false);
2774 /* Parse the parenthesized expression. */
2775 expr = cp_parser_expression (parser);
2776 /* Let the front end know that this expression was
2777 enclosed in parentheses. This matters in case, for
2778 example, the expression is of the form `A::B', since
2779 `&A::B' might be a pointer-to-member, but `&(A::B)' is
2781 finish_parenthesized_expr (expr);
2783 /* The `>' token might be the end of a template-id or
2784 template-parameter-list now. */
2785 parser->greater_than_is_operator_p
2786 = saved_greater_than_is_operator_p;
2787 /* Consume the `)'. */
2788 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
2789 cp_parser_skip_to_end_of_statement (parser);
2795 switch (token->keyword)
2797 /* These two are the boolean literals. */
2799 cp_lexer_consume_token (parser->lexer);
2800 return boolean_true_node;
2802 cp_lexer_consume_token (parser->lexer);
2803 return boolean_false_node;
2805 /* The `__null' literal. */
2807 cp_lexer_consume_token (parser->lexer);
2810 /* Recognize the `this' keyword. */
2812 cp_lexer_consume_token (parser->lexer);
2813 if (parser->local_variables_forbidden_p)
2815 error ("`this' may not be used in this context");
2816 return error_mark_node;
2818 /* Pointers cannot appear in constant-expressions. */
2819 if (cp_parser_non_integral_constant_expression (parser,
2821 return error_mark_node;
2822 return finish_this_expr ();
2824 /* The `operator' keyword can be the beginning of an
2829 case RID_FUNCTION_NAME:
2830 case RID_PRETTY_FUNCTION_NAME:
2831 case RID_C99_FUNCTION_NAME:
2832 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
2833 __func__ are the names of variables -- but they are
2834 treated specially. Therefore, they are handled here,
2835 rather than relying on the generic id-expression logic
2836 below. Grammatically, these names are id-expressions.
2838 Consume the token. */
2839 token = cp_lexer_consume_token (parser->lexer);
2840 /* Look up the name. */
2841 return finish_fname (token->value);
2848 /* The `__builtin_va_arg' construct is used to handle
2849 `va_arg'. Consume the `__builtin_va_arg' token. */
2850 cp_lexer_consume_token (parser->lexer);
2851 /* Look for the opening `('. */
2852 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
2853 /* Now, parse the assignment-expression. */
2854 expression = cp_parser_assignment_expression (parser);
2855 /* Look for the `,'. */
2856 cp_parser_require (parser, CPP_COMMA, "`,'");
2857 /* Parse the type-id. */
2858 type = cp_parser_type_id (parser);
2859 /* Look for the closing `)'. */
2860 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
2861 /* Using `va_arg' in a constant-expression is not
2863 if (cp_parser_non_integral_constant_expression (parser,
2865 return error_mark_node;
2866 return build_x_va_arg (expression, type);
2870 return cp_parser_builtin_offsetof (parser);
2873 cp_parser_error (parser, "expected primary-expression");
2874 return error_mark_node;
2877 /* An id-expression can start with either an identifier, a
2878 `::' as the beginning of a qualified-id, or the "operator"
2882 case CPP_TEMPLATE_ID:
2883 case CPP_NESTED_NAME_SPECIFIER:
2887 const char *error_msg;
2890 /* Parse the id-expression. */
2892 = cp_parser_id_expression (parser,
2893 /*template_keyword_p=*/false,
2894 /*check_dependency_p=*/true,
2895 /*template_p=*/NULL,
2896 /*declarator_p=*/false);
2897 if (id_expression == error_mark_node)
2898 return error_mark_node;
2899 /* If we have a template-id, then no further lookup is
2900 required. If the template-id was for a template-class, we
2901 will sometimes have a TYPE_DECL at this point. */
2902 else if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR
2903 || TREE_CODE (id_expression) == TYPE_DECL)
2904 decl = id_expression;
2905 /* Look up the name. */
2908 decl = cp_parser_lookup_name_simple (parser, id_expression);
2909 /* If name lookup gives us a SCOPE_REF, then the
2910 qualifying scope was dependent. Just propagate the
2912 if (TREE_CODE (decl) == SCOPE_REF)
2914 if (TYPE_P (TREE_OPERAND (decl, 0)))
2915 *qualifying_class = TREE_OPERAND (decl, 0);
2918 /* Check to see if DECL is a local variable in a context
2919 where that is forbidden. */
2920 if (parser->local_variables_forbidden_p
2921 && local_variable_p (decl))
2923 /* It might be that we only found DECL because we are
2924 trying to be generous with pre-ISO scoping rules.
2925 For example, consider:
2929 for (int i = 0; i < 10; ++i) {}
2930 extern void f(int j = i);
2933 Here, name look up will originally find the out
2934 of scope `i'. We need to issue a warning message,
2935 but then use the global `i'. */
2936 decl = check_for_out_of_scope_variable (decl);
2937 if (local_variable_p (decl))
2939 error ("local variable `%D' may not appear in this context",
2941 return error_mark_node;
2946 decl = finish_id_expression (id_expression, decl, parser->scope,
2947 idk, qualifying_class,
2948 parser->integral_constant_expression_p,
2949 parser->allow_non_integral_constant_expression_p,
2950 &parser->non_integral_constant_expression_p,
2953 cp_parser_error (parser, error_msg);
2957 /* Anything else is an error. */
2959 cp_parser_error (parser, "expected primary-expression");
2960 return error_mark_node;
2964 /* Parse an id-expression.
2971 :: [opt] nested-name-specifier template [opt] unqualified-id
2973 :: operator-function-id
2976 Return a representation of the unqualified portion of the
2977 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
2978 a `::' or nested-name-specifier.
2980 Often, if the id-expression was a qualified-id, the caller will
2981 want to make a SCOPE_REF to represent the qualified-id. This
2982 function does not do this in order to avoid wastefully creating
2983 SCOPE_REFs when they are not required.
2985 If TEMPLATE_KEYWORD_P is true, then we have just seen the
2988 If CHECK_DEPENDENCY_P is false, then names are looked up inside
2989 uninstantiated templates.
2991 If *TEMPLATE_P is non-NULL, it is set to true iff the
2992 `template' keyword is used to explicitly indicate that the entity
2993 named is a template.
2995 If DECLARATOR_P is true, the id-expression is appearing as part of
2996 a declarator, rather than as part of an expression. */
2999 cp_parser_id_expression (cp_parser *parser,
3000 bool template_keyword_p,
3001 bool check_dependency_p,
3005 bool global_scope_p;
3006 bool nested_name_specifier_p;
3008 /* Assume the `template' keyword was not used. */
3010 *template_p = false;
3012 /* Look for the optional `::' operator. */
3014 = (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false)
3016 /* Look for the optional nested-name-specifier. */
3017 nested_name_specifier_p
3018 = (cp_parser_nested_name_specifier_opt (parser,
3019 /*typename_keyword_p=*/false,
3022 /*is_declarator=*/false)
3024 /* If there is a nested-name-specifier, then we are looking at
3025 the first qualified-id production. */
3026 if (nested_name_specifier_p)
3029 tree saved_object_scope;
3030 tree saved_qualifying_scope;
3031 tree unqualified_id;
3034 /* See if the next token is the `template' keyword. */
3036 template_p = &is_template;
3037 *template_p = cp_parser_optional_template_keyword (parser);
3038 /* Name lookup we do during the processing of the
3039 unqualified-id might obliterate SCOPE. */
3040 saved_scope = parser->scope;
3041 saved_object_scope = parser->object_scope;
3042 saved_qualifying_scope = parser->qualifying_scope;
3043 /* Process the final unqualified-id. */
3044 unqualified_id = cp_parser_unqualified_id (parser, *template_p,
3047 /* Restore the SAVED_SCOPE for our caller. */
3048 parser->scope = saved_scope;
3049 parser->object_scope = saved_object_scope;
3050 parser->qualifying_scope = saved_qualifying_scope;
3052 return unqualified_id;
3054 /* Otherwise, if we are in global scope, then we are looking at one
3055 of the other qualified-id productions. */
3056 else if (global_scope_p)
3061 /* Peek at the next token. */
3062 token = cp_lexer_peek_token (parser->lexer);
3064 /* If it's an identifier, and the next token is not a "<", then
3065 we can avoid the template-id case. This is an optimization
3066 for this common case. */
3067 if (token->type == CPP_NAME
3068 && !cp_parser_nth_token_starts_template_argument_list_p
3070 return cp_parser_identifier (parser);
3072 cp_parser_parse_tentatively (parser);
3073 /* Try a template-id. */
3074 id = cp_parser_template_id (parser,
3075 /*template_keyword_p=*/false,
3076 /*check_dependency_p=*/true,
3078 /* If that worked, we're done. */
3079 if (cp_parser_parse_definitely (parser))
3082 /* Peek at the next token. (Changes in the token buffer may
3083 have invalidated the pointer obtained above.) */
3084 token = cp_lexer_peek_token (parser->lexer);
3086 switch (token->type)
3089 return cp_parser_identifier (parser);
3092 if (token->keyword == RID_OPERATOR)
3093 return cp_parser_operator_function_id (parser);
3097 cp_parser_error (parser, "expected id-expression");
3098 return error_mark_node;
3102 return cp_parser_unqualified_id (parser, template_keyword_p,
3103 /*check_dependency_p=*/true,
3107 /* Parse an unqualified-id.
3111 operator-function-id
3112 conversion-function-id
3116 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
3117 keyword, in a construct like `A::template ...'.
3119 Returns a representation of unqualified-id. For the `identifier'
3120 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
3121 production a BIT_NOT_EXPR is returned; the operand of the
3122 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
3123 other productions, see the documentation accompanying the
3124 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
3125 names are looked up in uninstantiated templates. If DECLARATOR_P
3126 is true, the unqualified-id is appearing as part of a declarator,
3127 rather than as part of an expression. */
3130 cp_parser_unqualified_id (cp_parser* parser,
3131 bool template_keyword_p,
3132 bool check_dependency_p,
3137 /* Peek at the next token. */
3138 token = cp_lexer_peek_token (parser->lexer);
3140 switch (token->type)
3146 /* We don't know yet whether or not this will be a
3148 cp_parser_parse_tentatively (parser);
3149 /* Try a template-id. */
3150 id = cp_parser_template_id (parser, template_keyword_p,
3153 /* If it worked, we're done. */
3154 if (cp_parser_parse_definitely (parser))
3156 /* Otherwise, it's an ordinary identifier. */
3157 return cp_parser_identifier (parser);
3160 case CPP_TEMPLATE_ID:
3161 return cp_parser_template_id (parser, template_keyword_p,
3168 tree qualifying_scope;
3172 /* Consume the `~' token. */
3173 cp_lexer_consume_token (parser->lexer);
3174 /* Parse the class-name. The standard, as written, seems to
3177 template <typename T> struct S { ~S (); };
3178 template <typename T> S<T>::~S() {}
3180 is invalid, since `~' must be followed by a class-name, but
3181 `S<T>' is dependent, and so not known to be a class.
3182 That's not right; we need to look in uninstantiated
3183 templates. A further complication arises from:
3185 template <typename T> void f(T t) {
3189 Here, it is not possible to look up `T' in the scope of `T'
3190 itself. We must look in both the current scope, and the
3191 scope of the containing complete expression.
3193 Yet another issue is:
3202 The standard does not seem to say that the `S' in `~S'
3203 should refer to the type `S' and not the data member
3206 /* DR 244 says that we look up the name after the "~" in the
3207 same scope as we looked up the qualifying name. That idea
3208 isn't fully worked out; it's more complicated than that. */
3209 scope = parser->scope;
3210 object_scope = parser->object_scope;
3211 qualifying_scope = parser->qualifying_scope;
3213 /* If the name is of the form "X::~X" it's OK. */
3214 if (scope && TYPE_P (scope)
3215 && cp_lexer_next_token_is (parser->lexer, CPP_NAME)
3216 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
3218 && (cp_lexer_peek_token (parser->lexer)->value
3219 == TYPE_IDENTIFIER (scope)))
3221 cp_lexer_consume_token (parser->lexer);
3222 return build_nt (BIT_NOT_EXPR, scope);
3225 /* If there was an explicit qualification (S::~T), first look
3226 in the scope given by the qualification (i.e., S). */
3229 cp_parser_parse_tentatively (parser);
3230 type_decl = cp_parser_class_name (parser,
3231 /*typename_keyword_p=*/false,
3232 /*template_keyword_p=*/false,
3234 /*check_dependency=*/false,
3235 /*class_head_p=*/false,
3237 if (cp_parser_parse_definitely (parser))
3238 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
3240 /* In "N::S::~S", look in "N" as well. */
3241 if (scope && qualifying_scope)
3243 cp_parser_parse_tentatively (parser);
3244 parser->scope = qualifying_scope;
3245 parser->object_scope = NULL_TREE;
3246 parser->qualifying_scope = NULL_TREE;
3248 = cp_parser_class_name (parser,
3249 /*typename_keyword_p=*/false,
3250 /*template_keyword_p=*/false,
3252 /*check_dependency=*/false,
3253 /*class_head_p=*/false,
3255 if (cp_parser_parse_definitely (parser))
3256 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
3258 /* In "p->S::~T", look in the scope given by "*p" as well. */
3259 else if (object_scope)
3261 cp_parser_parse_tentatively (parser);
3262 parser->scope = object_scope;
3263 parser->object_scope = NULL_TREE;
3264 parser->qualifying_scope = NULL_TREE;
3266 = cp_parser_class_name (parser,
3267 /*typename_keyword_p=*/false,
3268 /*template_keyword_p=*/false,
3270 /*check_dependency=*/false,
3271 /*class_head_p=*/false,
3273 if (cp_parser_parse_definitely (parser))
3274 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
3276 /* Look in the surrounding context. */
3277 parser->scope = NULL_TREE;
3278 parser->object_scope = NULL_TREE;
3279 parser->qualifying_scope = NULL_TREE;
3281 = cp_parser_class_name (parser,
3282 /*typename_keyword_p=*/false,
3283 /*template_keyword_p=*/false,
3285 /*check_dependency=*/false,
3286 /*class_head_p=*/false,
3288 /* If an error occurred, assume that the name of the
3289 destructor is the same as the name of the qualifying
3290 class. That allows us to keep parsing after running
3291 into ill-formed destructor names. */
3292 if (type_decl == error_mark_node && scope && TYPE_P (scope))
3293 return build_nt (BIT_NOT_EXPR, scope);
3294 else if (type_decl == error_mark_node)
3295 return error_mark_node;
3299 A typedef-name that names a class shall not be used as the
3300 identifier in the declarator for a destructor declaration. */
3302 && !DECL_IMPLICIT_TYPEDEF_P (type_decl)
3303 && !DECL_SELF_REFERENCE_P (type_decl))
3304 error ("typedef-name `%D' used as destructor declarator",
3307 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
3311 if (token->keyword == RID_OPERATOR)
3315 /* This could be a template-id, so we try that first. */
3316 cp_parser_parse_tentatively (parser);
3317 /* Try a template-id. */
3318 id = cp_parser_template_id (parser, template_keyword_p,
3319 /*check_dependency_p=*/true,
3321 /* If that worked, we're done. */
3322 if (cp_parser_parse_definitely (parser))
3324 /* We still don't know whether we're looking at an
3325 operator-function-id or a conversion-function-id. */
3326 cp_parser_parse_tentatively (parser);
3327 /* Try an operator-function-id. */
3328 id = cp_parser_operator_function_id (parser);
3329 /* If that didn't work, try a conversion-function-id. */
3330 if (!cp_parser_parse_definitely (parser))
3331 id = cp_parser_conversion_function_id (parser);
3338 cp_parser_error (parser, "expected unqualified-id");
3339 return error_mark_node;
3343 /* Parse an (optional) nested-name-specifier.
3345 nested-name-specifier:
3346 class-or-namespace-name :: nested-name-specifier [opt]
3347 class-or-namespace-name :: template nested-name-specifier [opt]
3349 PARSER->SCOPE should be set appropriately before this function is
3350 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
3351 effect. TYPE_P is TRUE if we non-type bindings should be ignored
3354 Sets PARSER->SCOPE to the class (TYPE) or namespace
3355 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
3356 it unchanged if there is no nested-name-specifier. Returns the new
3357 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
3359 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
3360 part of a declaration and/or decl-specifier. */
3363 cp_parser_nested_name_specifier_opt (cp_parser *parser,
3364 bool typename_keyword_p,
3365 bool check_dependency_p,
3367 bool is_declaration)
3369 bool success = false;
3370 tree access_check = NULL_TREE;
3374 /* If the next token corresponds to a nested name specifier, there
3375 is no need to reparse it. However, if CHECK_DEPENDENCY_P is
3376 false, it may have been true before, in which case something
3377 like `A<X>::B<Y>::C' may have resulted in a nested-name-specifier
3378 of `A<X>::', where it should now be `A<X>::B<Y>::'. So, when
3379 CHECK_DEPENDENCY_P is false, we have to fall through into the
3381 if (check_dependency_p
3382 && cp_lexer_next_token_is (parser->lexer, CPP_NESTED_NAME_SPECIFIER))
3384 cp_parser_pre_parsed_nested_name_specifier (parser);
3385 return parser->scope;
3388 /* Remember where the nested-name-specifier starts. */
3389 if (cp_parser_parsing_tentatively (parser)
3390 && !cp_parser_committed_to_tentative_parse (parser))
3392 token = cp_lexer_peek_token (parser->lexer);
3393 start = cp_lexer_token_difference (parser->lexer,
3394 parser->lexer->first_token,
3400 push_deferring_access_checks (dk_deferred);
3406 tree saved_qualifying_scope;
3407 bool template_keyword_p;
3409 /* Spot cases that cannot be the beginning of a
3410 nested-name-specifier. */
3411 token = cp_lexer_peek_token (parser->lexer);
3413 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
3414 the already parsed nested-name-specifier. */
3415 if (token->type == CPP_NESTED_NAME_SPECIFIER)
3417 /* Grab the nested-name-specifier and continue the loop. */
3418 cp_parser_pre_parsed_nested_name_specifier (parser);
3423 /* Spot cases that cannot be the beginning of a
3424 nested-name-specifier. On the second and subsequent times
3425 through the loop, we look for the `template' keyword. */
3426 if (success && token->keyword == RID_TEMPLATE)
3428 /* A template-id can start a nested-name-specifier. */
3429 else if (token->type == CPP_TEMPLATE_ID)
3433 /* If the next token is not an identifier, then it is
3434 definitely not a class-or-namespace-name. */
3435 if (token->type != CPP_NAME)
3437 /* If the following token is neither a `<' (to begin a
3438 template-id), nor a `::', then we are not looking at a
3439 nested-name-specifier. */
3440 token = cp_lexer_peek_nth_token (parser->lexer, 2);
3441 if (token->type != CPP_SCOPE
3442 && !cp_parser_nth_token_starts_template_argument_list_p
3447 /* The nested-name-specifier is optional, so we parse
3449 cp_parser_parse_tentatively (parser);
3451 /* Look for the optional `template' keyword, if this isn't the
3452 first time through the loop. */
3454 template_keyword_p = cp_parser_optional_template_keyword (parser);
3456 template_keyword_p = false;
3458 /* Save the old scope since the name lookup we are about to do
3459 might destroy it. */
3460 old_scope = parser->scope;
3461 saved_qualifying_scope = parser->qualifying_scope;
3462 /* Parse the qualifying entity. */
3464 = cp_parser_class_or_namespace_name (parser,
3470 /* Look for the `::' token. */
3471 cp_parser_require (parser, CPP_SCOPE, "`::'");
3473 /* If we found what we wanted, we keep going; otherwise, we're
3475 if (!cp_parser_parse_definitely (parser))
3477 bool error_p = false;
3479 /* Restore the OLD_SCOPE since it was valid before the
3480 failed attempt at finding the last
3481 class-or-namespace-name. */
3482 parser->scope = old_scope;
3483 parser->qualifying_scope = saved_qualifying_scope;
3484 /* If the next token is an identifier, and the one after
3485 that is a `::', then any valid interpretation would have
3486 found a class-or-namespace-name. */
3487 while (cp_lexer_next_token_is (parser->lexer, CPP_NAME)
3488 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
3490 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
3493 token = cp_lexer_consume_token (parser->lexer);
3498 decl = cp_parser_lookup_name_simple (parser, token->value);
3499 if (TREE_CODE (decl) == TEMPLATE_DECL)
3500 error ("`%D' used without template parameters",
3503 cp_parser_name_lookup_error
3504 (parser, token->value, decl,
3505 "is not a class or namespace");
3506 parser->scope = NULL_TREE;
3508 /* Treat this as a successful nested-name-specifier
3513 If the name found is not a class-name (clause
3514 _class_) or namespace-name (_namespace.def_), the
3515 program is ill-formed. */
3518 cp_lexer_consume_token (parser->lexer);
3523 /* We've found one valid nested-name-specifier. */
3525 /* Make sure we look in the right scope the next time through
3527 parser->scope = (TREE_CODE (new_scope) == TYPE_DECL
3528 ? TREE_TYPE (new_scope)
3530 /* If it is a class scope, try to complete it; we are about to
3531 be looking up names inside the class. */
3532 if (TYPE_P (parser->scope)
3533 /* Since checking types for dependency can be expensive,
3534 avoid doing it if the type is already complete. */
3535 && !COMPLETE_TYPE_P (parser->scope)
3536 /* Do not try to complete dependent types. */
3537 && !dependent_type_p (parser->scope))
3538 complete_type (parser->scope);
3541 /* Retrieve any deferred checks. Do not pop this access checks yet
3542 so the memory will not be reclaimed during token replacing below. */
3543 access_check = get_deferred_access_checks ();
3545 /* If parsing tentatively, replace the sequence of tokens that makes
3546 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
3547 token. That way, should we re-parse the token stream, we will
3548 not have to repeat the effort required to do the parse, nor will
3549 we issue duplicate error messages. */
3550 if (success && start >= 0)
3552 /* Find the token that corresponds to the start of the
3554 token = cp_lexer_advance_token (parser->lexer,
3555 parser->lexer->first_token,
3558 /* Reset the contents of the START token. */
3559 token->type = CPP_NESTED_NAME_SPECIFIER;
3560 token->value = build_tree_list (access_check, parser->scope);
3561 TREE_TYPE (token->value) = parser->qualifying_scope;
3562 token->keyword = RID_MAX;
3563 /* Purge all subsequent tokens. */
3564 cp_lexer_purge_tokens_after (parser->lexer, token);
3567 pop_deferring_access_checks ();
3568 return success ? parser->scope : NULL_TREE;
3571 /* Parse a nested-name-specifier. See
3572 cp_parser_nested_name_specifier_opt for details. This function
3573 behaves identically, except that it will an issue an error if no
3574 nested-name-specifier is present, and it will return
3575 ERROR_MARK_NODE, rather than NULL_TREE, if no nested-name-specifier
3579 cp_parser_nested_name_specifier (cp_parser *parser,
3580 bool typename_keyword_p,
3581 bool check_dependency_p,
3583 bool is_declaration)
3587 /* Look for the nested-name-specifier. */
3588 scope = cp_parser_nested_name_specifier_opt (parser,
3593 /* If it was not present, issue an error message. */
3596 cp_parser_error (parser, "expected nested-name-specifier");
3597 parser->scope = NULL_TREE;
3598 return error_mark_node;
3604 /* Parse a class-or-namespace-name.
3606 class-or-namespace-name:
3610 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
3611 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
3612 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
3613 TYPE_P is TRUE iff the next name should be taken as a class-name,
3614 even the same name is declared to be another entity in the same
3617 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
3618 specified by the class-or-namespace-name. If neither is found the
3619 ERROR_MARK_NODE is returned. */
3622 cp_parser_class_or_namespace_name (cp_parser *parser,
3623 bool typename_keyword_p,
3624 bool template_keyword_p,
3625 bool check_dependency_p,
3627 bool is_declaration)
3630 tree saved_qualifying_scope;
3631 tree saved_object_scope;
3635 /* Before we try to parse the class-name, we must save away the
3636 current PARSER->SCOPE since cp_parser_class_name will destroy
3638 saved_scope = parser->scope;
3639 saved_qualifying_scope = parser->qualifying_scope;
3640 saved_object_scope = parser->object_scope;
3641 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
3642 there is no need to look for a namespace-name. */
3643 only_class_p = template_keyword_p || (saved_scope && TYPE_P (saved_scope));
3645 cp_parser_parse_tentatively (parser);
3646 scope = cp_parser_class_name (parser,
3651 /*class_head_p=*/false,
3653 /* If that didn't work, try for a namespace-name. */
3654 if (!only_class_p && !cp_parser_parse_definitely (parser))
3656 /* Restore the saved scope. */
3657 parser->scope = saved_scope;
3658 parser->qualifying_scope = saved_qualifying_scope;
3659 parser->object_scope = saved_object_scope;
3660 /* If we are not looking at an identifier followed by the scope
3661 resolution operator, then this is not part of a
3662 nested-name-specifier. (Note that this function is only used
3663 to parse the components of a nested-name-specifier.) */
3664 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME)
3665 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SCOPE)
3666 return error_mark_node;
3667 scope = cp_parser_namespace_name (parser);
3673 /* Parse a postfix-expression.
3677 postfix-expression [ expression ]
3678 postfix-expression ( expression-list [opt] )
3679 simple-type-specifier ( expression-list [opt] )
3680 typename :: [opt] nested-name-specifier identifier
3681 ( expression-list [opt] )
3682 typename :: [opt] nested-name-specifier template [opt] template-id
3683 ( expression-list [opt] )
3684 postfix-expression . template [opt] id-expression
3685 postfix-expression -> template [opt] id-expression
3686 postfix-expression . pseudo-destructor-name
3687 postfix-expression -> pseudo-destructor-name
3688 postfix-expression ++
3689 postfix-expression --
3690 dynamic_cast < type-id > ( expression )
3691 static_cast < type-id > ( expression )
3692 reinterpret_cast < type-id > ( expression )
3693 const_cast < type-id > ( expression )
3694 typeid ( expression )
3700 ( type-id ) { initializer-list , [opt] }
3702 This extension is a GNU version of the C99 compound-literal
3703 construct. (The C99 grammar uses `type-name' instead of `type-id',
3704 but they are essentially the same concept.)
3706 If ADDRESS_P is true, the postfix expression is the operand of the
3709 Returns a representation of the expression. */
3712 cp_parser_postfix_expression (cp_parser *parser, bool address_p)
3716 cp_id_kind idk = CP_ID_KIND_NONE;
3717 tree postfix_expression = NULL_TREE;
3718 /* Non-NULL only if the current postfix-expression can be used to
3719 form a pointer-to-member. In that case, QUALIFYING_CLASS is the
3720 class used to qualify the member. */
3721 tree qualifying_class = NULL_TREE;
3723 /* Peek at the next token. */
3724 token = cp_lexer_peek_token (parser->lexer);
3725 /* Some of the productions are determined by keywords. */
3726 keyword = token->keyword;
3736 const char *saved_message;
3738 /* All of these can be handled in the same way from the point
3739 of view of parsing. Begin by consuming the token
3740 identifying the cast. */
3741 cp_lexer_consume_token (parser->lexer);
3743 /* New types cannot be defined in the cast. */
3744 saved_message = parser->type_definition_forbidden_message;
3745 parser->type_definition_forbidden_message
3746 = "types may not be defined in casts";
3748 /* Look for the opening `<'. */
3749 cp_parser_require (parser, CPP_LESS, "`<'");
3750 /* Parse the type to which we are casting. */
3751 type = cp_parser_type_id (parser);
3752 /* Look for the closing `>'. */
3753 cp_parser_require (parser, CPP_GREATER, "`>'");
3754 /* Restore the old message. */
3755 parser->type_definition_forbidden_message = saved_message;
3757 /* And the expression which is being cast. */
3758 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
3759 expression = cp_parser_expression (parser);
3760 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3762 /* Only type conversions to integral or enumeration types
3763 can be used in constant-expressions. */
3764 if (parser->integral_constant_expression_p
3765 && !dependent_type_p (type)
3766 && !INTEGRAL_OR_ENUMERATION_TYPE_P (type)
3767 && (cp_parser_non_integral_constant_expression
3769 "a cast to a type other than an integral or "
3770 "enumeration type")))
3771 return error_mark_node;
3777 = build_dynamic_cast (type, expression);
3781 = build_static_cast (type, expression);
3785 = build_reinterpret_cast (type, expression);
3789 = build_const_cast (type, expression);
3800 const char *saved_message;
3801 bool saved_in_type_id_in_expr_p;
3803 /* Consume the `typeid' token. */
3804 cp_lexer_consume_token (parser->lexer);
3805 /* Look for the `(' token. */
3806 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
3807 /* Types cannot be defined in a `typeid' expression. */
3808 saved_message = parser->type_definition_forbidden_message;
3809 parser->type_definition_forbidden_message
3810 = "types may not be defined in a `typeid\' expression";
3811 /* We can't be sure yet whether we're looking at a type-id or an
3813 cp_parser_parse_tentatively (parser);
3814 /* Try a type-id first. */
3815 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
3816 parser->in_type_id_in_expr_p = true;
3817 type = cp_parser_type_id (parser);
3818 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
3819 /* Look for the `)' token. Otherwise, we can't be sure that
3820 we're not looking at an expression: consider `typeid (int
3821 (3))', for example. */
3822 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3823 /* If all went well, simply lookup the type-id. */
3824 if (cp_parser_parse_definitely (parser))
3825 postfix_expression = get_typeid (type);
3826 /* Otherwise, fall back to the expression variant. */
3831 /* Look for an expression. */
3832 expression = cp_parser_expression (parser);
3833 /* Compute its typeid. */
3834 postfix_expression = build_typeid (expression);
3835 /* Look for the `)' token. */
3836 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3838 /* `typeid' may not appear in an integral constant expression. */
3839 if (cp_parser_non_integral_constant_expression(parser,
3840 "`typeid' operator"))
3841 return error_mark_node;
3842 /* Restore the saved message. */
3843 parser->type_definition_forbidden_message = saved_message;
3849 bool template_p = false;
3853 /* Consume the `typename' token. */
3854 cp_lexer_consume_token (parser->lexer);
3855 /* Look for the optional `::' operator. */
3856 cp_parser_global_scope_opt (parser,
3857 /*current_scope_valid_p=*/false);
3858 /* Look for the nested-name-specifier. */
3859 cp_parser_nested_name_specifier (parser,
3860 /*typename_keyword_p=*/true,
3861 /*check_dependency_p=*/true,
3863 /*is_declaration=*/true);
3864 /* Look for the optional `template' keyword. */
3865 template_p = cp_parser_optional_template_keyword (parser);
3866 /* We don't know whether we're looking at a template-id or an
3868 cp_parser_parse_tentatively (parser);
3869 /* Try a template-id. */
3870 id = cp_parser_template_id (parser, template_p,
3871 /*check_dependency_p=*/true,
3872 /*is_declaration=*/true);
3873 /* If that didn't work, try an identifier. */
3874 if (!cp_parser_parse_definitely (parser))
3875 id = cp_parser_identifier (parser);
3876 /* If we look up a template-id in a non-dependent qualifying
3877 scope, there's no need to create a dependent type. */
3878 if (TREE_CODE (id) == TYPE_DECL
3879 && !dependent_type_p (parser->scope))
3880 type = TREE_TYPE (id);
3881 /* Create a TYPENAME_TYPE to represent the type to which the
3882 functional cast is being performed. */
3884 type = make_typename_type (parser->scope, id,
3887 postfix_expression = cp_parser_functional_cast (parser, type);
3895 /* If the next thing is a simple-type-specifier, we may be
3896 looking at a functional cast. We could also be looking at
3897 an id-expression. So, we try the functional cast, and if
3898 that doesn't work we fall back to the primary-expression. */
3899 cp_parser_parse_tentatively (parser);
3900 /* Look for the simple-type-specifier. */
3901 type = cp_parser_simple_type_specifier (parser,
3902 /*decl_specs=*/NULL,
3903 CP_PARSER_FLAGS_NONE);
3904 /* Parse the cast itself. */
3905 if (!cp_parser_error_occurred (parser))
3907 = cp_parser_functional_cast (parser, type);
3908 /* If that worked, we're done. */
3909 if (cp_parser_parse_definitely (parser))
3912 /* If the functional-cast didn't work out, try a
3913 compound-literal. */
3914 if (cp_parser_allow_gnu_extensions_p (parser)
3915 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
3917 tree initializer_list = NULL_TREE;
3918 bool saved_in_type_id_in_expr_p;
3920 cp_parser_parse_tentatively (parser);
3921 /* Consume the `('. */
3922 cp_lexer_consume_token (parser->lexer);
3923 /* Parse the type. */
3924 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
3925 parser->in_type_id_in_expr_p = true;
3926 type = cp_parser_type_id (parser);
3927 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
3928 /* Look for the `)'. */
3929 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3930 /* Look for the `{'. */
3931 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
3932 /* If things aren't going well, there's no need to
3934 if (!cp_parser_error_occurred (parser))
3936 bool non_constant_p;
3937 /* Parse the initializer-list. */
3939 = cp_parser_initializer_list (parser, &non_constant_p);
3940 /* Allow a trailing `,'. */
3941 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
3942 cp_lexer_consume_token (parser->lexer);
3943 /* Look for the final `}'. */
3944 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
3946 /* If that worked, we're definitely looking at a
3947 compound-literal expression. */
3948 if (cp_parser_parse_definitely (parser))
3950 /* Warn the user that a compound literal is not
3951 allowed in standard C++. */
3953 pedwarn ("ISO C++ forbids compound-literals");
3954 /* Form the representation of the compound-literal. */
3956 = finish_compound_literal (type, initializer_list);
3961 /* It must be a primary-expression. */
3962 postfix_expression = cp_parser_primary_expression (parser,
3969 /* If we were avoiding committing to the processing of a
3970 qualified-id until we knew whether or not we had a
3971 pointer-to-member, we now know. */
3972 if (qualifying_class)
3976 /* Peek at the next token. */
3977 token = cp_lexer_peek_token (parser->lexer);
3978 done = (token->type != CPP_OPEN_SQUARE
3979 && token->type != CPP_OPEN_PAREN
3980 && token->type != CPP_DOT
3981 && token->type != CPP_DEREF
3982 && token->type != CPP_PLUS_PLUS
3983 && token->type != CPP_MINUS_MINUS);
3985 postfix_expression = finish_qualified_id_expr (qualifying_class,
3990 return postfix_expression;
3993 /* Keep looping until the postfix-expression is complete. */
3996 if (idk == CP_ID_KIND_UNQUALIFIED
3997 && TREE_CODE (postfix_expression) == IDENTIFIER_NODE
3998 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
3999 /* It is not a Koenig lookup function call. */
4001 = unqualified_name_lookup_error (postfix_expression);
4003 /* Peek at the next token. */
4004 token = cp_lexer_peek_token (parser->lexer);
4006 switch (token->type)
4008 case CPP_OPEN_SQUARE:
4010 = cp_parser_postfix_open_square_expression (parser,
4013 idk = CP_ID_KIND_NONE;
4016 case CPP_OPEN_PAREN:
4017 /* postfix-expression ( expression-list [opt] ) */
4020 tree args = (cp_parser_parenthesized_expression_list
4021 (parser, false, /*non_constant_p=*/NULL));
4023 if (args == error_mark_node)
4025 postfix_expression = error_mark_node;
4029 /* Function calls are not permitted in
4030 constant-expressions. */
4031 if (cp_parser_non_integral_constant_expression (parser,
4034 postfix_expression = error_mark_node;
4039 if (idk == CP_ID_KIND_UNQUALIFIED)
4041 /* We do not perform argument-dependent lookup if
4042 normal lookup finds a non-function, in accordance
4043 with the expected resolution of DR 218. */
4045 && (is_overloaded_fn (postfix_expression)
4046 || TREE_CODE (postfix_expression) == IDENTIFIER_NODE))
4050 = perform_koenig_lookup (postfix_expression, args);
4052 else if (TREE_CODE (postfix_expression) == IDENTIFIER_NODE)
4054 = unqualified_fn_lookup_error (postfix_expression);
4057 if (TREE_CODE (postfix_expression) == COMPONENT_REF)
4059 tree instance = TREE_OPERAND (postfix_expression, 0);
4060 tree fn = TREE_OPERAND (postfix_expression, 1);
4062 if (processing_template_decl
4063 && (type_dependent_expression_p (instance)
4064 || (!BASELINK_P (fn)
4065 && TREE_CODE (fn) != FIELD_DECL)
4066 || type_dependent_expression_p (fn)
4067 || any_type_dependent_arguments_p (args)))
4070 = build_min_nt (CALL_EXPR, postfix_expression,
4075 if (BASELINK_P (fn))
4077 = (build_new_method_call
4078 (instance, fn, args, NULL_TREE,
4079 (idk == CP_ID_KIND_QUALIFIED
4080 ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL)));
4083 = finish_call_expr (postfix_expression, args,
4084 /*disallow_virtual=*/false,
4085 /*koenig_p=*/false);
4087 else if (TREE_CODE (postfix_expression) == OFFSET_REF
4088 || TREE_CODE (postfix_expression) == MEMBER_REF
4089 || TREE_CODE (postfix_expression) == DOTSTAR_EXPR)
4090 postfix_expression = (build_offset_ref_call_from_tree
4091 (postfix_expression, args));
4092 else if (idk == CP_ID_KIND_QUALIFIED)
4093 /* A call to a static class member, or a namespace-scope
4096 = finish_call_expr (postfix_expression, args,
4097 /*disallow_virtual=*/true,
4100 /* All other function calls. */
4102 = finish_call_expr (postfix_expression, args,
4103 /*disallow_virtual=*/false,
4106 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
4107 idk = CP_ID_KIND_NONE;
4113 /* postfix-expression . template [opt] id-expression
4114 postfix-expression . pseudo-destructor-name
4115 postfix-expression -> template [opt] id-expression
4116 postfix-expression -> pseudo-destructor-name */
4118 /* Consume the `.' or `->' operator. */
4119 cp_lexer_consume_token (parser->lexer);
4122 = cp_parser_postfix_dot_deref_expression (parser, token->type,
4128 /* postfix-expression ++ */
4129 /* Consume the `++' token. */
4130 cp_lexer_consume_token (parser->lexer);
4131 /* Generate a representation for the complete expression. */
4133 = finish_increment_expr (postfix_expression,
4134 POSTINCREMENT_EXPR);
4135 /* Increments may not appear in constant-expressions. */
4136 if (cp_parser_non_integral_constant_expression (parser,
4138 postfix_expression = error_mark_node;
4139 idk = CP_ID_KIND_NONE;
4142 case CPP_MINUS_MINUS:
4143 /* postfix-expression -- */
4144 /* Consume the `--' token. */
4145 cp_lexer_consume_token (parser->lexer);
4146 /* Generate a representation for the complete expression. */
4148 = finish_increment_expr (postfix_expression,
4149 POSTDECREMENT_EXPR);
4150 /* Decrements may not appear in constant-expressions. */
4151 if (cp_parser_non_integral_constant_expression (parser,
4153 postfix_expression = error_mark_node;
4154 idk = CP_ID_KIND_NONE;
4158 return postfix_expression;
4162 /* We should never get here. */
4164 return error_mark_node;
4167 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
4168 by cp_parser_builtin_offsetof. We're looking for
4170 postfix-expression [ expression ]
4172 FOR_OFFSETOF is set if we're being called in that context, which
4173 changes how we deal with integer constant expressions. */
4176 cp_parser_postfix_open_square_expression (cp_parser *parser,
4177 tree postfix_expression,
4182 /* Consume the `[' token. */
4183 cp_lexer_consume_token (parser->lexer);
4185 /* Parse the index expression. */
4186 /* ??? For offsetof, there is a question of what to allow here. If
4187 offsetof is not being used in an integral constant expression context,
4188 then we *could* get the right answer by computing the value at runtime.
4189 If we are in an integral constant expression context, then we might
4190 could accept any constant expression; hard to say without analysis.
4191 Rather than open the barn door too wide right away, allow only integer
4192 constant expresions here. */
4194 index = cp_parser_constant_expression (parser, false, NULL);
4196 index = cp_parser_expression (parser);
4198 /* Look for the closing `]'. */
4199 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
4201 /* Build the ARRAY_REF. */
4202 postfix_expression = grok_array_decl (postfix_expression, index);
4204 /* When not doing offsetof, array references are not permitted in
4205 constant-expressions. */
4207 && (cp_parser_non_integral_constant_expression
4208 (parser, "an array reference")))
4209 postfix_expression = error_mark_node;
4211 return postfix_expression;
4214 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
4215 by cp_parser_builtin_offsetof. We're looking for
4217 postfix-expression . template [opt] id-expression
4218 postfix-expression . pseudo-destructor-name
4219 postfix-expression -> template [opt] id-expression
4220 postfix-expression -> pseudo-destructor-name
4222 FOR_OFFSETOF is set if we're being called in that context. That sorta
4223 limits what of the above we'll actually accept, but nevermind.
4224 TOKEN_TYPE is the "." or "->" token, which will already have been
4225 removed from the stream. */
4228 cp_parser_postfix_dot_deref_expression (cp_parser *parser,
4229 enum cpp_ttype token_type,
4230 tree postfix_expression,
4231 bool for_offsetof, cp_id_kind *idk)
4236 tree scope = NULL_TREE;
4238 /* If this is a `->' operator, dereference the pointer. */
4239 if (token_type == CPP_DEREF)
4240 postfix_expression = build_x_arrow (postfix_expression);
4241 /* Check to see whether or not the expression is type-dependent. */
4242 dependent_p = type_dependent_expression_p (postfix_expression);
4243 /* The identifier following the `->' or `.' is not qualified. */
4244 parser->scope = NULL_TREE;
4245 parser->qualifying_scope = NULL_TREE;
4246 parser->object_scope = NULL_TREE;
4247 *idk = CP_ID_KIND_NONE;
4248 /* Enter the scope corresponding to the type of the object
4249 given by the POSTFIX_EXPRESSION. */
4250 if (!dependent_p && TREE_TYPE (postfix_expression) != NULL_TREE)
4252 scope = TREE_TYPE (postfix_expression);
4253 /* According to the standard, no expression should ever have
4254 reference type. Unfortunately, we do not currently match
4255 the standard in this respect in that our internal representation
4256 of an expression may have reference type even when the standard
4257 says it does not. Therefore, we have to manually obtain the
4258 underlying type here. */
4259 scope = non_reference (scope);
4260 /* The type of the POSTFIX_EXPRESSION must be complete. */
4261 scope = complete_type_or_else (scope, NULL_TREE);
4262 /* Let the name lookup machinery know that we are processing a
4263 class member access expression. */
4264 parser->context->object_type = scope;
4265 /* If something went wrong, we want to be able to discern that case,
4266 as opposed to the case where there was no SCOPE due to the type
4267 of expression being dependent. */
4269 scope = error_mark_node;
4270 /* If the SCOPE was erroneous, make the various semantic analysis
4271 functions exit quickly -- and without issuing additional error
4273 if (scope == error_mark_node)
4274 postfix_expression = error_mark_node;
4277 /* If the SCOPE is not a scalar type, we are looking at an
4278 ordinary class member access expression, rather than a
4279 pseudo-destructor-name. */
4280 if (!scope || !SCALAR_TYPE_P (scope))
4282 template_p = cp_parser_optional_template_keyword (parser);
4283 /* Parse the id-expression. */
4284 name = cp_parser_id_expression (parser, template_p,
4285 /*check_dependency_p=*/true,
4286 /*template_p=*/NULL,
4287 /*declarator_p=*/false);
4288 /* In general, build a SCOPE_REF if the member name is qualified.
4289 However, if the name was not dependent and has already been
4290 resolved; there is no need to build the SCOPE_REF. For example;
4292 struct X { void f(); };
4293 template <typename T> void f(T* t) { t->X::f(); }
4295 Even though "t" is dependent, "X::f" is not and has been resolved
4296 to a BASELINK; there is no need to include scope information. */
4298 /* But we do need to remember that there was an explicit scope for
4299 virtual function calls. */
4301 *idk = CP_ID_KIND_QUALIFIED;
4303 if (name != error_mark_node && !BASELINK_P (name) && parser->scope)
4305 name = build_nt (SCOPE_REF, parser->scope, name);
4306 parser->scope = NULL_TREE;
4307 parser->qualifying_scope = NULL_TREE;
4308 parser->object_scope = NULL_TREE;
4310 if (scope && name && BASELINK_P (name))
4311 adjust_result_of_qualified_name_lookup
4312 (name, BINFO_TYPE (BASELINK_BINFO (name)), scope);
4314 = finish_class_member_access_expr (postfix_expression, name);
4316 /* Otherwise, try the pseudo-destructor-name production. */
4322 /* Parse the pseudo-destructor-name. */
4323 cp_parser_pseudo_destructor_name (parser, &s, &type);
4324 /* Form the call. */
4326 = finish_pseudo_destructor_expr (postfix_expression,
4327 s, TREE_TYPE (type));
4330 /* We no longer need to look up names in the scope of the object on
4331 the left-hand side of the `.' or `->' operator. */
4332 parser->context->object_type = NULL_TREE;
4334 /* Outside of offsetof, these operators may not appear in
4335 constant-expressions. */
4337 && (cp_parser_non_integral_constant_expression
4338 (parser, token_type == CPP_DEREF ? "'->'" : "`.'")))
4339 postfix_expression = error_mark_node;
4341 return postfix_expression;
4344 /* Parse a parenthesized expression-list.
4347 assignment-expression
4348 expression-list, assignment-expression
4353 identifier, expression-list
4355 Returns a TREE_LIST. The TREE_VALUE of each node is a
4356 representation of an assignment-expression. Note that a TREE_LIST
4357 is returned even if there is only a single expression in the list.
4358 error_mark_node is returned if the ( and or ) are
4359 missing. NULL_TREE is returned on no expressions. The parentheses
4360 are eaten. IS_ATTRIBUTE_LIST is true if this is really an attribute
4361 list being parsed. If NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P
4362 indicates whether or not all of the expressions in the list were
4366 cp_parser_parenthesized_expression_list (cp_parser* parser,
4367 bool is_attribute_list,
4368 bool *non_constant_p)
4370 tree expression_list = NULL_TREE;
4371 tree identifier = NULL_TREE;
4373 /* Assume all the expressions will be constant. */
4375 *non_constant_p = false;
4377 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
4378 return error_mark_node;
4380 /* Consume expressions until there are no more. */
4381 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
4386 /* At the beginning of attribute lists, check to see if the
4387 next token is an identifier. */
4388 if (is_attribute_list
4389 && cp_lexer_peek_token (parser->lexer)->type == CPP_NAME)
4393 /* Consume the identifier. */
4394 token = cp_lexer_consume_token (parser->lexer);
4395 /* Save the identifier. */
4396 identifier = token->value;
4400 /* Parse the next assignment-expression. */
4403 bool expr_non_constant_p;
4404 expr = (cp_parser_constant_expression
4405 (parser, /*allow_non_constant_p=*/true,
4406 &expr_non_constant_p));
4407 if (expr_non_constant_p)
4408 *non_constant_p = true;
4411 expr = cp_parser_assignment_expression (parser);
4413 /* Add it to the list. We add error_mark_node
4414 expressions to the list, so that we can still tell if
4415 the correct form for a parenthesized expression-list
4416 is found. That gives better errors. */
4417 expression_list = tree_cons (NULL_TREE, expr, expression_list);
4419 if (expr == error_mark_node)
4423 /* After the first item, attribute lists look the same as
4424 expression lists. */
4425 is_attribute_list = false;
4428 /* If the next token isn't a `,', then we are done. */
4429 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
4432 /* Otherwise, consume the `,' and keep going. */
4433 cp_lexer_consume_token (parser->lexer);
4436 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
4441 /* We try and resync to an unnested comma, as that will give the
4442 user better diagnostics. */
4443 ending = cp_parser_skip_to_closing_parenthesis (parser,
4444 /*recovering=*/true,
4446 /*consume_paren=*/true);
4450 return error_mark_node;
4453 /* We built up the list in reverse order so we must reverse it now. */
4454 expression_list = nreverse (expression_list);
4456 expression_list = tree_cons (NULL_TREE, identifier, expression_list);
4458 return expression_list;
4461 /* Parse a pseudo-destructor-name.
4463 pseudo-destructor-name:
4464 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
4465 :: [opt] nested-name-specifier template template-id :: ~ type-name
4466 :: [opt] nested-name-specifier [opt] ~ type-name
4468 If either of the first two productions is used, sets *SCOPE to the
4469 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
4470 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
4471 or ERROR_MARK_NODE if the parse fails. */
4474 cp_parser_pseudo_destructor_name (cp_parser* parser,
4478 bool nested_name_specifier_p;
4480 /* Look for the optional `::' operator. */
4481 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/true);
4482 /* Look for the optional nested-name-specifier. */
4483 nested_name_specifier_p
4484 = (cp_parser_nested_name_specifier_opt (parser,
4485 /*typename_keyword_p=*/false,
4486 /*check_dependency_p=*/true,
4488 /*is_declaration=*/true)
4490 /* Now, if we saw a nested-name-specifier, we might be doing the
4491 second production. */
4492 if (nested_name_specifier_p
4493 && cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
4495 /* Consume the `template' keyword. */
4496 cp_lexer_consume_token (parser->lexer);
4497 /* Parse the template-id. */
4498 cp_parser_template_id (parser,
4499 /*template_keyword_p=*/true,
4500 /*check_dependency_p=*/false,
4501 /*is_declaration=*/true);
4502 /* Look for the `::' token. */
4503 cp_parser_require (parser, CPP_SCOPE, "`::'");
4505 /* If the next token is not a `~', then there might be some
4506 additional qualification. */
4507 else if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMPL))
4509 /* Look for the type-name. */
4510 *scope = TREE_TYPE (cp_parser_type_name (parser));
4512 /* If we didn't get an aggregate type, or we don't have ::~,
4513 then something has gone wrong. Since the only caller of this
4514 function is looking for something after `.' or `->' after a
4515 scalar type, most likely the program is trying to get a
4516 member of a non-aggregate type. */
4517 if (*scope == error_mark_node
4518 || cp_lexer_next_token_is_not (parser->lexer, CPP_SCOPE)
4519 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_COMPL)
4521 cp_parser_error (parser, "request for member of non-aggregate type");
4522 *type = error_mark_node;
4526 /* Look for the `::' token. */
4527 cp_parser_require (parser, CPP_SCOPE, "`::'");
4532 /* Look for the `~'. */
4533 cp_parser_require (parser, CPP_COMPL, "`~'");
4534 /* Look for the type-name again. We are not responsible for
4535 checking that it matches the first type-name. */
4536 *type = cp_parser_type_name (parser);
4539 /* Parse a unary-expression.
4545 unary-operator cast-expression
4546 sizeof unary-expression
4554 __extension__ cast-expression
4555 __alignof__ unary-expression
4556 __alignof__ ( type-id )
4557 __real__ cast-expression
4558 __imag__ cast-expression
4561 ADDRESS_P is true iff the unary-expression is appearing as the
4562 operand of the `&' operator.
4564 Returns a representation of the expression. */
4567 cp_parser_unary_expression (cp_parser *parser, bool address_p)
4570 enum tree_code unary_operator;
4572 /* Peek at the next token. */
4573 token = cp_lexer_peek_token (parser->lexer);
4574 /* Some keywords give away the kind of expression. */
4575 if (token->type == CPP_KEYWORD)
4577 enum rid keyword = token->keyword;
4587 op = keyword == RID_ALIGNOF ? ALIGNOF_EXPR : SIZEOF_EXPR;
4588 /* Consume the token. */
4589 cp_lexer_consume_token (parser->lexer);
4590 /* Parse the operand. */
4591 operand = cp_parser_sizeof_operand (parser, keyword);
4593 if (TYPE_P (operand))
4594 return cxx_sizeof_or_alignof_type (operand, op, true);
4596 return cxx_sizeof_or_alignof_expr (operand, op);
4600 return cp_parser_new_expression (parser);
4603 return cp_parser_delete_expression (parser);
4607 /* The saved value of the PEDANTIC flag. */
4611 /* Save away the PEDANTIC flag. */
4612 cp_parser_extension_opt (parser, &saved_pedantic);
4613 /* Parse the cast-expression. */
4614 expr = cp_parser_simple_cast_expression (parser);
4615 /* Restore the PEDANTIC flag. */
4616 pedantic = saved_pedantic;
4626 /* Consume the `__real__' or `__imag__' token. */
4627 cp_lexer_consume_token (parser->lexer);
4628 /* Parse the cast-expression. */
4629 expression = cp_parser_simple_cast_expression (parser);
4630 /* Create the complete representation. */
4631 return build_x_unary_op ((keyword == RID_REALPART
4632 ? REALPART_EXPR : IMAGPART_EXPR),
4642 /* Look for the `:: new' and `:: delete', which also signal the
4643 beginning of a new-expression, or delete-expression,
4644 respectively. If the next token is `::', then it might be one of
4646 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
4650 /* See if the token after the `::' is one of the keywords in
4651 which we're interested. */
4652 keyword = cp_lexer_peek_nth_token (parser->lexer, 2)->keyword;
4653 /* If it's `new', we have a new-expression. */
4654 if (keyword == RID_NEW)
4655 return cp_parser_new_expression (parser);
4656 /* Similarly, for `delete'. */
4657 else if (keyword == RID_DELETE)
4658 return cp_parser_delete_expression (parser);
4661 /* Look for a unary operator. */
4662 unary_operator = cp_parser_unary_operator (token);
4663 /* The `++' and `--' operators can be handled similarly, even though
4664 they are not technically unary-operators in the grammar. */
4665 if (unary_operator == ERROR_MARK)
4667 if (token->type == CPP_PLUS_PLUS)
4668 unary_operator = PREINCREMENT_EXPR;
4669 else if (token->type == CPP_MINUS_MINUS)
4670 unary_operator = PREDECREMENT_EXPR;
4671 /* Handle the GNU address-of-label extension. */
4672 else if (cp_parser_allow_gnu_extensions_p (parser)
4673 && token->type == CPP_AND_AND)
4677 /* Consume the '&&' token. */
4678 cp_lexer_consume_token (parser->lexer);
4679 /* Look for the identifier. */
4680 identifier = cp_parser_identifier (parser);
4681 /* Create an expression representing the address. */
4682 return finish_label_address_expr (identifier);
4685 if (unary_operator != ERROR_MARK)
4687 tree cast_expression;
4688 tree expression = error_mark_node;
4689 const char *non_constant_p = NULL;
4691 /* Consume the operator token. */
4692 token = cp_lexer_consume_token (parser->lexer);
4693 /* Parse the cast-expression. */
4695 = cp_parser_cast_expression (parser, unary_operator == ADDR_EXPR);
4696 /* Now, build an appropriate representation. */
4697 switch (unary_operator)
4700 non_constant_p = "`*'";
4701 expression = build_x_indirect_ref (cast_expression, "unary *");
4705 non_constant_p = "`&'";
4708 expression = build_x_unary_op (unary_operator, cast_expression);
4711 case PREINCREMENT_EXPR:
4712 case PREDECREMENT_EXPR:
4713 non_constant_p = (unary_operator == PREINCREMENT_EXPR
4718 case TRUTH_NOT_EXPR:
4719 expression = finish_unary_op_expr (unary_operator, cast_expression);
4727 && cp_parser_non_integral_constant_expression (parser,
4729 expression = error_mark_node;
4734 return cp_parser_postfix_expression (parser, address_p);
4737 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
4738 unary-operator, the corresponding tree code is returned. */
4740 static enum tree_code
4741 cp_parser_unary_operator (cp_token* token)
4743 switch (token->type)
4746 return INDIRECT_REF;
4752 return CONVERT_EXPR;
4758 return TRUTH_NOT_EXPR;
4761 return BIT_NOT_EXPR;
4768 /* Parse a new-expression.
4771 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
4772 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
4774 Returns a representation of the expression. */
4777 cp_parser_new_expression (cp_parser* parser)
4779 bool global_scope_p;
4785 /* Look for the optional `::' operator. */
4787 = (cp_parser_global_scope_opt (parser,
4788 /*current_scope_valid_p=*/false)
4790 /* Look for the `new' operator. */
4791 cp_parser_require_keyword (parser, RID_NEW, "`new'");
4792 /* There's no easy way to tell a new-placement from the
4793 `( type-id )' construct. */
4794 cp_parser_parse_tentatively (parser);
4795 /* Look for a new-placement. */
4796 placement = cp_parser_new_placement (parser);
4797 /* If that didn't work out, there's no new-placement. */
4798 if (!cp_parser_parse_definitely (parser))
4799 placement = NULL_TREE;
4801 /* If the next token is a `(', then we have a parenthesized
4803 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
4805 /* Consume the `('. */
4806 cp_lexer_consume_token (parser->lexer);
4807 /* Parse the type-id. */
4808 type = cp_parser_type_id (parser);
4809 /* Look for the closing `)'. */
4810 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
4811 /* There should not be a direct-new-declarator in this production,
4812 but GCC used to allowed this, so we check and emit a sensible error
4813 message for this case. */
4814 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
4816 error ("array bound forbidden after parenthesized type-id");
4817 inform ("try removing the parentheses around the type-id");
4818 cp_parser_direct_new_declarator (parser);
4820 nelts = integer_one_node;
4822 /* Otherwise, there must be a new-type-id. */
4824 type = cp_parser_new_type_id (parser, &nelts);
4826 /* If the next token is a `(', then we have a new-initializer. */
4827 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
4828 initializer = cp_parser_new_initializer (parser);
4830 initializer = NULL_TREE;
4832 /* A new-expression may not appear in an integral constant
4834 if (cp_parser_non_integral_constant_expression (parser, "`new'"))
4835 return error_mark_node;
4837 /* Create a representation of the new-expression. */
4838 return build_new (placement, type, nelts, initializer, global_scope_p);
4841 /* Parse a new-placement.
4846 Returns the same representation as for an expression-list. */
4849 cp_parser_new_placement (cp_parser* parser)
4851 tree expression_list;
4853 /* Parse the expression-list. */
4854 expression_list = (cp_parser_parenthesized_expression_list
4855 (parser, false, /*non_constant_p=*/NULL));
4857 return expression_list;
4860 /* Parse a new-type-id.
4863 type-specifier-seq new-declarator [opt]
4865 Returns the TYPE allocated. If the new-type-id indicates an array
4866 type, *NELTS is set to the number of elements in the last array
4867 bound; the TYPE will not include the last array bound. */
4870 cp_parser_new_type_id (cp_parser* parser, tree *nelts)
4872 cp_decl_specifier_seq type_specifier_seq;
4873 cp_declarator *new_declarator;
4874 cp_declarator *declarator;
4875 cp_declarator *outer_declarator;
4876 const char *saved_message;
4879 /* The type-specifier sequence must not contain type definitions.
4880 (It cannot contain declarations of new types either, but if they
4881 are not definitions we will catch that because they are not
4883 saved_message = parser->type_definition_forbidden_message;
4884 parser->type_definition_forbidden_message
4885 = "types may not be defined in a new-type-id";
4886 /* Parse the type-specifier-seq. */
4887 cp_parser_type_specifier_seq (parser, &type_specifier_seq);
4888 /* Restore the old message. */
4889 parser->type_definition_forbidden_message = saved_message;
4890 /* Parse the new-declarator. */
4891 new_declarator = cp_parser_new_declarator_opt (parser);
4893 /* Determine the number of elements in the last array dimension, if
4896 /* Skip down to the last array dimension. */
4897 declarator = new_declarator;
4898 outer_declarator = NULL;
4899 while (declarator && (declarator->kind == cdk_pointer
4900 || declarator->kind == cdk_ptrmem))
4902 outer_declarator = declarator;
4903 declarator = declarator->declarator;
4906 && declarator->kind == cdk_array
4907 && declarator->declarator
4908 && declarator->declarator->kind == cdk_array)
4910 outer_declarator = declarator;
4911 declarator = declarator->declarator;
4914 if (declarator && declarator->kind == cdk_array)
4916 *nelts = declarator->u.array.bounds;
4917 if (*nelts == error_mark_node)
4918 *nelts = integer_one_node;
4919 else if (!processing_template_decl)
4921 if (!build_expr_type_conversion (WANT_INT | WANT_ENUM, *nelts,
4923 pedwarn ("size in array new must have integral type");
4924 *nelts = save_expr (cp_convert (sizetype, *nelts));
4925 if (*nelts == integer_zero_node)
4926 warning ("zero size array reserves no space");
4928 if (outer_declarator)
4929 outer_declarator->declarator = declarator->declarator;
4931 new_declarator = NULL;
4934 type = groktypename (&type_specifier_seq, new_declarator);
4935 if (TREE_CODE (type) == ARRAY_TYPE && *nelts == NULL_TREE)
4937 *nelts = array_type_nelts_top (type);
4938 type = TREE_TYPE (type);
4943 /* Parse an (optional) new-declarator.
4946 ptr-operator new-declarator [opt]
4947 direct-new-declarator
4949 Returns the declarator. */
4951 static cp_declarator *
4952 cp_parser_new_declarator_opt (cp_parser* parser)
4954 enum tree_code code;
4956 cp_cv_quals cv_quals;
4958 /* We don't know if there's a ptr-operator next, or not. */
4959 cp_parser_parse_tentatively (parser);
4960 /* Look for a ptr-operator. */
4961 code = cp_parser_ptr_operator (parser, &type, &cv_quals);
4962 /* If that worked, look for more new-declarators. */
4963 if (cp_parser_parse_definitely (parser))
4965 cp_declarator *declarator;
4967 /* Parse another optional declarator. */
4968 declarator = cp_parser_new_declarator_opt (parser);
4970 /* Create the representation of the declarator. */
4972 declarator = make_ptrmem_declarator (cv_quals, type, declarator);
4973 else if (code == INDIRECT_REF)
4974 declarator = make_pointer_declarator (cv_quals, declarator);
4976 declarator = make_reference_declarator (cv_quals, declarator);
4981 /* If the next token is a `[', there is a direct-new-declarator. */
4982 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
4983 return cp_parser_direct_new_declarator (parser);
4988 /* Parse a direct-new-declarator.
4990 direct-new-declarator:
4992 direct-new-declarator [constant-expression]
4996 static cp_declarator *
4997 cp_parser_direct_new_declarator (cp_parser* parser)
4999 cp_declarator *declarator = NULL;
5005 /* Look for the opening `['. */
5006 cp_parser_require (parser, CPP_OPEN_SQUARE, "`['");
5007 /* The first expression is not required to be constant. */
5010 expression = cp_parser_expression (parser);
5011 /* The standard requires that the expression have integral
5012 type. DR 74 adds enumeration types. We believe that the
5013 real intent is that these expressions be handled like the
5014 expression in a `switch' condition, which also allows
5015 classes with a single conversion to integral or
5016 enumeration type. */
5017 if (!processing_template_decl)
5020 = build_expr_type_conversion (WANT_INT | WANT_ENUM,
5025 error ("expression in new-declarator must have integral or enumeration type");
5026 expression = error_mark_node;
5030 /* But all the other expressions must be. */
5033 = cp_parser_constant_expression (parser,
5034 /*allow_non_constant=*/false,
5036 /* Look for the closing `]'. */
5037 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
5039 /* Add this bound to the declarator. */
5040 declarator = make_array_declarator (declarator, expression);
5042 /* If the next token is not a `[', then there are no more
5044 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_SQUARE))
5051 /* Parse a new-initializer.
5054 ( expression-list [opt] )
5056 Returns a representation of the expression-list. If there is no
5057 expression-list, VOID_ZERO_NODE is returned. */
5060 cp_parser_new_initializer (cp_parser* parser)
5062 tree expression_list;
5064 expression_list = (cp_parser_parenthesized_expression_list
5065 (parser, false, /*non_constant_p=*/NULL));
5066 if (!expression_list)
5067 expression_list = void_zero_node;
5069 return expression_list;
5072 /* Parse a delete-expression.
5075 :: [opt] delete cast-expression
5076 :: [opt] delete [ ] cast-expression
5078 Returns a representation of the expression. */
5081 cp_parser_delete_expression (cp_parser* parser)
5083 bool global_scope_p;
5087 /* Look for the optional `::' operator. */
5089 = (cp_parser_global_scope_opt (parser,
5090 /*current_scope_valid_p=*/false)
5092 /* Look for the `delete' keyword. */
5093 cp_parser_require_keyword (parser, RID_DELETE, "`delete'");
5094 /* See if the array syntax is in use. */
5095 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
5097 /* Consume the `[' token. */
5098 cp_lexer_consume_token (parser->lexer);
5099 /* Look for the `]' token. */
5100 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
5101 /* Remember that this is the `[]' construct. */
5107 /* Parse the cast-expression. */
5108 expression = cp_parser_simple_cast_expression (parser);
5110 /* A delete-expression may not appear in an integral constant
5112 if (cp_parser_non_integral_constant_expression (parser, "`delete'"))
5113 return error_mark_node;
5115 return delete_sanity (expression, NULL_TREE, array_p, global_scope_p);
5118 /* Parse a cast-expression.
5122 ( type-id ) cast-expression
5124 Returns a representation of the expression. */
5127 cp_parser_cast_expression (cp_parser *parser, bool address_p)
5129 /* If it's a `(', then we might be looking at a cast. */
5130 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
5132 tree type = NULL_TREE;
5133 tree expr = NULL_TREE;
5134 bool compound_literal_p;
5135 const char *saved_message;
5137 /* There's no way to know yet whether or not this is a cast.
5138 For example, `(int (3))' is a unary-expression, while `(int)
5139 3' is a cast. So, we resort to parsing tentatively. */
5140 cp_parser_parse_tentatively (parser);
5141 /* Types may not be defined in a cast. */
5142 saved_message = parser->type_definition_forbidden_message;
5143 parser->type_definition_forbidden_message
5144 = "types may not be defined in casts";
5145 /* Consume the `('. */
5146 cp_lexer_consume_token (parser->lexer);
5147 /* A very tricky bit is that `(struct S) { 3 }' is a
5148 compound-literal (which we permit in C++ as an extension).
5149 But, that construct is not a cast-expression -- it is a
5150 postfix-expression. (The reason is that `(struct S) { 3 }.i'
5151 is legal; if the compound-literal were a cast-expression,
5152 you'd need an extra set of parentheses.) But, if we parse
5153 the type-id, and it happens to be a class-specifier, then we
5154 will commit to the parse at that point, because we cannot
5155 undo the action that is done when creating a new class. So,
5156 then we cannot back up and do a postfix-expression.
5158 Therefore, we scan ahead to the closing `)', and check to see
5159 if the token after the `)' is a `{'. If so, we are not
5160 looking at a cast-expression.
5162 Save tokens so that we can put them back. */
5163 cp_lexer_save_tokens (parser->lexer);
5164 /* Skip tokens until the next token is a closing parenthesis.
5165 If we find the closing `)', and the next token is a `{', then
5166 we are looking at a compound-literal. */
5168 = (cp_parser_skip_to_closing_parenthesis (parser, false, false,
5169 /*consume_paren=*/true)
5170 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE));
5171 /* Roll back the tokens we skipped. */
5172 cp_lexer_rollback_tokens (parser->lexer);
5173 /* If we were looking at a compound-literal, simulate an error
5174 so that the call to cp_parser_parse_definitely below will
5176 if (compound_literal_p)
5177 cp_parser_simulate_error (parser);
5180 bool saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
5181 parser->in_type_id_in_expr_p = true;
5182 /* Look for the type-id. */
5183 type = cp_parser_type_id (parser);
5184 /* Look for the closing `)'. */
5185 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
5186 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
5189 /* Restore the saved message. */
5190 parser->type_definition_forbidden_message = saved_message;
5192 /* If ok so far, parse the dependent expression. We cannot be
5193 sure it is a cast. Consider `(T ())'. It is a parenthesized
5194 ctor of T, but looks like a cast to function returning T
5195 without a dependent expression. */
5196 if (!cp_parser_error_occurred (parser))
5197 expr = cp_parser_simple_cast_expression (parser);
5199 if (cp_parser_parse_definitely (parser))
5201 /* Warn about old-style casts, if so requested. */
5202 if (warn_old_style_cast
5203 && !in_system_header
5204 && !VOID_TYPE_P (type)
5205 && current_lang_name != lang_name_c)
5206 warning ("use of old-style cast");
5208 /* Only type conversions to integral or enumeration types
5209 can be used in constant-expressions. */
5210 if (parser->integral_constant_expression_p
5211 && !dependent_type_p (type)
5212 && !INTEGRAL_OR_ENUMERATION_TYPE_P (type)
5213 && (cp_parser_non_integral_constant_expression
5215 "a cast to a type other than an integral or "
5216 "enumeration type")))
5217 return error_mark_node;
5219 /* Perform the cast. */
5220 expr = build_c_cast (type, expr);
5225 /* If we get here, then it's not a cast, so it must be a
5226 unary-expression. */
5227 return cp_parser_unary_expression (parser, address_p);
5230 /* Parse a pm-expression.
5234 pm-expression .* cast-expression
5235 pm-expression ->* cast-expression
5237 Returns a representation of the expression. */
5240 cp_parser_pm_expression (cp_parser* parser)
5242 static const cp_parser_token_tree_map map = {
5243 { CPP_DEREF_STAR, MEMBER_REF },
5244 { CPP_DOT_STAR, DOTSTAR_EXPR },
5245 { CPP_EOF, ERROR_MARK }
5248 return cp_parser_binary_expression (parser, map,
5249 cp_parser_simple_cast_expression);
5252 /* Parse a multiplicative-expression.
5254 multiplicative-expression:
5256 multiplicative-expression * pm-expression
5257 multiplicative-expression / pm-expression
5258 multiplicative-expression % pm-expression
5260 Returns a representation of the expression. */
5263 cp_parser_multiplicative_expression (cp_parser* parser)
5265 static const cp_parser_token_tree_map map = {
5266 { CPP_MULT, MULT_EXPR },
5267 { CPP_DIV, TRUNC_DIV_EXPR },
5268 { CPP_MOD, TRUNC_MOD_EXPR },
5269 { CPP_EOF, ERROR_MARK }
5272 return cp_parser_binary_expression (parser,
5274 cp_parser_pm_expression);
5277 /* Parse an additive-expression.
5279 additive-expression:
5280 multiplicative-expression
5281 additive-expression + multiplicative-expression
5282 additive-expression - multiplicative-expression
5284 Returns a representation of the expression. */
5287 cp_parser_additive_expression (cp_parser* parser)
5289 static const cp_parser_token_tree_map map = {
5290 { CPP_PLUS, PLUS_EXPR },
5291 { CPP_MINUS, MINUS_EXPR },
5292 { CPP_EOF, ERROR_MARK }
5295 return cp_parser_binary_expression (parser,
5297 cp_parser_multiplicative_expression);
5300 /* Parse a shift-expression.
5304 shift-expression << additive-expression
5305 shift-expression >> additive-expression
5307 Returns a representation of the expression. */
5310 cp_parser_shift_expression (cp_parser* parser)
5312 static const cp_parser_token_tree_map map = {
5313 { CPP_LSHIFT, LSHIFT_EXPR },
5314 { CPP_RSHIFT, RSHIFT_EXPR },
5315 { CPP_EOF, ERROR_MARK }
5318 return cp_parser_binary_expression (parser,
5320 cp_parser_additive_expression);
5323 /* Parse a relational-expression.
5325 relational-expression:
5327 relational-expression < shift-expression
5328 relational-expression > shift-expression
5329 relational-expression <= shift-expression
5330 relational-expression >= shift-expression
5334 relational-expression:
5335 relational-expression <? shift-expression
5336 relational-expression >? shift-expression
5338 Returns a representation of the expression. */
5341 cp_parser_relational_expression (cp_parser* parser)
5343 static const cp_parser_token_tree_map map = {
5344 { CPP_LESS, LT_EXPR },
5345 { CPP_GREATER, GT_EXPR },
5346 { CPP_LESS_EQ, LE_EXPR },
5347 { CPP_GREATER_EQ, GE_EXPR },
5348 { CPP_MIN, MIN_EXPR },
5349 { CPP_MAX, MAX_EXPR },
5350 { CPP_EOF, ERROR_MARK }
5353 return cp_parser_binary_expression (parser,
5355 cp_parser_shift_expression);
5358 /* Parse an equality-expression.
5360 equality-expression:
5361 relational-expression
5362 equality-expression == relational-expression
5363 equality-expression != relational-expression
5365 Returns a representation of the expression. */
5368 cp_parser_equality_expression (cp_parser* parser)
5370 static const cp_parser_token_tree_map map = {
5371 { CPP_EQ_EQ, EQ_EXPR },
5372 { CPP_NOT_EQ, NE_EXPR },
5373 { CPP_EOF, ERROR_MARK }
5376 return cp_parser_binary_expression (parser,
5378 cp_parser_relational_expression);
5381 /* Parse an and-expression.
5385 and-expression & equality-expression
5387 Returns a representation of the expression. */
5390 cp_parser_and_expression (cp_parser* parser)
5392 static const cp_parser_token_tree_map map = {
5393 { CPP_AND, BIT_AND_EXPR },
5394 { CPP_EOF, ERROR_MARK }
5397 return cp_parser_binary_expression (parser,
5399 cp_parser_equality_expression);
5402 /* Parse an exclusive-or-expression.
5404 exclusive-or-expression:
5406 exclusive-or-expression ^ and-expression
5408 Returns a representation of the expression. */
5411 cp_parser_exclusive_or_expression (cp_parser* parser)
5413 static const cp_parser_token_tree_map map = {
5414 { CPP_XOR, BIT_XOR_EXPR },
5415 { CPP_EOF, ERROR_MARK }
5418 return cp_parser_binary_expression (parser,
5420 cp_parser_and_expression);
5424 /* Parse an inclusive-or-expression.
5426 inclusive-or-expression:
5427 exclusive-or-expression
5428 inclusive-or-expression | exclusive-or-expression
5430 Returns a representation of the expression. */
5433 cp_parser_inclusive_or_expression (cp_parser* parser)
5435 static const cp_parser_token_tree_map map = {
5436 { CPP_OR, BIT_IOR_EXPR },
5437 { CPP_EOF, ERROR_MARK }
5440 return cp_parser_binary_expression (parser,
5442 cp_parser_exclusive_or_expression);
5445 /* Parse a logical-and-expression.
5447 logical-and-expression:
5448 inclusive-or-expression
5449 logical-and-expression && inclusive-or-expression
5451 Returns a representation of the expression. */
5454 cp_parser_logical_and_expression (cp_parser* parser)
5456 static const cp_parser_token_tree_map map = {
5457 { CPP_AND_AND, TRUTH_ANDIF_EXPR },
5458 { CPP_EOF, ERROR_MARK }
5461 return cp_parser_binary_expression (parser,
5463 cp_parser_inclusive_or_expression);
5466 /* Parse a logical-or-expression.
5468 logical-or-expression:
5469 logical-and-expression
5470 logical-or-expression || logical-and-expression
5472 Returns a representation of the expression. */
5475 cp_parser_logical_or_expression (cp_parser* parser)
5477 static const cp_parser_token_tree_map map = {
5478 { CPP_OR_OR, TRUTH_ORIF_EXPR },
5479 { CPP_EOF, ERROR_MARK }
5482 return cp_parser_binary_expression (parser,
5484 cp_parser_logical_and_expression);
5487 /* Parse the `? expression : assignment-expression' part of a
5488 conditional-expression. The LOGICAL_OR_EXPR is the
5489 logical-or-expression that started the conditional-expression.
5490 Returns a representation of the entire conditional-expression.
5492 This routine is used by cp_parser_assignment_expression.
5494 ? expression : assignment-expression
5498 ? : assignment-expression */
5501 cp_parser_question_colon_clause (cp_parser* parser, tree logical_or_expr)
5504 tree assignment_expr;
5506 /* Consume the `?' token. */
5507 cp_lexer_consume_token (parser->lexer);
5508 if (cp_parser_allow_gnu_extensions_p (parser)
5509 && cp_lexer_next_token_is (parser->lexer, CPP_COLON))
5510 /* Implicit true clause. */
5513 /* Parse the expression. */
5514 expr = cp_parser_expression (parser);
5516 /* The next token should be a `:'. */
5517 cp_parser_require (parser, CPP_COLON, "`:'");
5518 /* Parse the assignment-expression. */
5519 assignment_expr = cp_parser_assignment_expression (parser);
5521 /* Build the conditional-expression. */
5522 return build_x_conditional_expr (logical_or_expr,
5527 /* Parse an assignment-expression.
5529 assignment-expression:
5530 conditional-expression
5531 logical-or-expression assignment-operator assignment_expression
5534 Returns a representation for the expression. */
5537 cp_parser_assignment_expression (cp_parser* parser)
5541 /* If the next token is the `throw' keyword, then we're looking at
5542 a throw-expression. */
5543 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_THROW))
5544 expr = cp_parser_throw_expression (parser);
5545 /* Otherwise, it must be that we are looking at a
5546 logical-or-expression. */
5549 /* Parse the logical-or-expression. */
5550 expr = cp_parser_logical_or_expression (parser);
5551 /* If the next token is a `?' then we're actually looking at a
5552 conditional-expression. */
5553 if (cp_lexer_next_token_is (parser->lexer, CPP_QUERY))
5554 return cp_parser_question_colon_clause (parser, expr);
5557 enum tree_code assignment_operator;
5559 /* If it's an assignment-operator, we're using the second
5562 = cp_parser_assignment_operator_opt (parser);
5563 if (assignment_operator != ERROR_MARK)
5567 /* Parse the right-hand side of the assignment. */
5568 rhs = cp_parser_assignment_expression (parser);
5569 /* An assignment may not appear in a
5570 constant-expression. */
5571 if (cp_parser_non_integral_constant_expression (parser,
5573 return error_mark_node;
5574 /* Build the assignment expression. */
5575 expr = build_x_modify_expr (expr,
5576 assignment_operator,
5585 /* Parse an (optional) assignment-operator.
5587 assignment-operator: one of
5588 = *= /= %= += -= >>= <<= &= ^= |=
5592 assignment-operator: one of
5595 If the next token is an assignment operator, the corresponding tree
5596 code is returned, and the token is consumed. For example, for
5597 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
5598 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
5599 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
5600 operator, ERROR_MARK is returned. */
5602 static enum tree_code
5603 cp_parser_assignment_operator_opt (cp_parser* parser)
5608 /* Peek at the next toen. */
5609 token = cp_lexer_peek_token (parser->lexer);
5611 switch (token->type)
5622 op = TRUNC_DIV_EXPR;
5626 op = TRUNC_MOD_EXPR;
5666 /* Nothing else is an assignment operator. */
5670 /* If it was an assignment operator, consume it. */
5671 if (op != ERROR_MARK)
5672 cp_lexer_consume_token (parser->lexer);
5677 /* Parse an expression.
5680 assignment-expression
5681 expression , assignment-expression
5683 Returns a representation of the expression. */
5686 cp_parser_expression (cp_parser* parser)
5688 tree expression = NULL_TREE;
5692 tree assignment_expression;
5694 /* Parse the next assignment-expression. */
5695 assignment_expression
5696 = cp_parser_assignment_expression (parser);
5697 /* If this is the first assignment-expression, we can just
5700 expression = assignment_expression;
5702 expression = build_x_compound_expr (expression,
5703 assignment_expression);
5704 /* If the next token is not a comma, then we are done with the
5706 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
5708 /* Consume the `,'. */
5709 cp_lexer_consume_token (parser->lexer);
5710 /* A comma operator cannot appear in a constant-expression. */
5711 if (cp_parser_non_integral_constant_expression (parser,
5712 "a comma operator"))
5713 expression = error_mark_node;
5719 /* Parse a constant-expression.
5721 constant-expression:
5722 conditional-expression
5724 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
5725 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
5726 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
5727 is false, NON_CONSTANT_P should be NULL. */
5730 cp_parser_constant_expression (cp_parser* parser,
5731 bool allow_non_constant_p,
5732 bool *non_constant_p)
5734 bool saved_integral_constant_expression_p;
5735 bool saved_allow_non_integral_constant_expression_p;
5736 bool saved_non_integral_constant_expression_p;
5739 /* It might seem that we could simply parse the
5740 conditional-expression, and then check to see if it were
5741 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
5742 one that the compiler can figure out is constant, possibly after
5743 doing some simplifications or optimizations. The standard has a
5744 precise definition of constant-expression, and we must honor
5745 that, even though it is somewhat more restrictive.
5751 is not a legal declaration, because `(2, 3)' is not a
5752 constant-expression. The `,' operator is forbidden in a
5753 constant-expression. However, GCC's constant-folding machinery
5754 will fold this operation to an INTEGER_CST for `3'. */
5756 /* Save the old settings. */
5757 saved_integral_constant_expression_p = parser->integral_constant_expression_p;
5758 saved_allow_non_integral_constant_expression_p
5759 = parser->allow_non_integral_constant_expression_p;
5760 saved_non_integral_constant_expression_p = parser->non_integral_constant_expression_p;
5761 /* We are now parsing a constant-expression. */
5762 parser->integral_constant_expression_p = true;
5763 parser->allow_non_integral_constant_expression_p = allow_non_constant_p;
5764 parser->non_integral_constant_expression_p = false;
5765 /* Although the grammar says "conditional-expression", we parse an
5766 "assignment-expression", which also permits "throw-expression"
5767 and the use of assignment operators. In the case that
5768 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
5769 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
5770 actually essential that we look for an assignment-expression.
5771 For example, cp_parser_initializer_clauses uses this function to
5772 determine whether a particular assignment-expression is in fact
5774 expression = cp_parser_assignment_expression (parser);
5775 /* Restore the old settings. */
5776 parser->integral_constant_expression_p = saved_integral_constant_expression_p;
5777 parser->allow_non_integral_constant_expression_p
5778 = saved_allow_non_integral_constant_expression_p;
5779 if (allow_non_constant_p)
5780 *non_constant_p = parser->non_integral_constant_expression_p;
5781 parser->non_integral_constant_expression_p = saved_non_integral_constant_expression_p;
5786 /* Parse __builtin_offsetof.
5788 offsetof-expression:
5789 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
5791 offsetof-member-designator:
5793 | offsetof-member-designator "." id-expression
5794 | offsetof-member-designator "[" expression "]"
5798 cp_parser_builtin_offsetof (cp_parser *parser)
5800 int save_ice_p, save_non_ice_p;
5804 /* We're about to accept non-integral-constant things, but will
5805 definitely yield an integral constant expression. Save and
5806 restore these values around our local parsing. */
5807 save_ice_p = parser->integral_constant_expression_p;
5808 save_non_ice_p = parser->non_integral_constant_expression_p;
5810 /* Consume the "__builtin_offsetof" token. */
5811 cp_lexer_consume_token (parser->lexer);
5812 /* Consume the opening `('. */
5813 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
5814 /* Parse the type-id. */
5815 type = cp_parser_type_id (parser);
5816 /* Look for the `,'. */
5817 cp_parser_require (parser, CPP_COMMA, "`,'");
5819 /* Build the (type *)null that begins the traditional offsetof macro. */
5820 expr = build_static_cast (build_pointer_type (type), null_pointer_node);
5822 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
5823 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DEREF, expr,
5827 cp_token *token = cp_lexer_peek_token (parser->lexer);
5828 switch (token->type)
5830 case CPP_OPEN_SQUARE:
5831 /* offsetof-member-designator "[" expression "]" */
5832 expr = cp_parser_postfix_open_square_expression (parser, expr, true);
5836 /* offsetof-member-designator "." identifier */
5837 cp_lexer_consume_token (parser->lexer);
5838 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DOT, expr,
5842 case CPP_CLOSE_PAREN:
5843 /* Consume the ")" token. */
5844 cp_lexer_consume_token (parser->lexer);
5848 /* Error. We know the following require will fail, but
5849 that gives the proper error message. */
5850 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
5851 cp_parser_skip_to_closing_parenthesis (parser, true, false, true);
5852 expr = error_mark_node;
5858 /* We've finished the parsing, now finish with the semantics. At present
5859 we're just mirroring the traditional macro implementation. Better
5860 would be to do the lowering of the ADDR_EXPR to flat pointer arithmetic
5861 here rather than in build_x_unary_op. */
5863 expr = (build_reinterpret_cast
5864 (build_reference_type (cp_build_qualified_type
5866 TYPE_QUAL_CONST | TYPE_QUAL_VOLATILE)),
5868 expr = build_x_unary_op (ADDR_EXPR, expr);
5869 expr = build_reinterpret_cast (size_type_node, expr);
5872 parser->integral_constant_expression_p = save_ice_p;
5873 parser->non_integral_constant_expression_p = save_non_ice_p;
5878 /* Statements [gram.stmt.stmt] */
5880 /* Parse a statement.
5884 expression-statement
5889 declaration-statement
5893 cp_parser_statement (cp_parser* parser, tree in_statement_expr)
5897 location_t statement_location;
5899 /* There is no statement yet. */
5900 statement = NULL_TREE;
5901 /* Peek at the next token. */
5902 token = cp_lexer_peek_token (parser->lexer);
5903 /* Remember the location of the first token in the statement. */
5904 statement_location = token->location;
5905 /* If this is a keyword, then that will often determine what kind of
5906 statement we have. */
5907 if (token->type == CPP_KEYWORD)
5909 enum rid keyword = token->keyword;
5915 statement = cp_parser_labeled_statement (parser,
5921 statement = cp_parser_selection_statement (parser);
5927 statement = cp_parser_iteration_statement (parser);
5934 statement = cp_parser_jump_statement (parser);
5938 statement = cp_parser_try_block (parser);
5942 /* It might be a keyword like `int' that can start a
5943 declaration-statement. */
5947 else if (token->type == CPP_NAME)
5949 /* If the next token is a `:', then we are looking at a
5950 labeled-statement. */
5951 token = cp_lexer_peek_nth_token (parser->lexer, 2);
5952 if (token->type == CPP_COLON)
5953 statement = cp_parser_labeled_statement (parser, in_statement_expr);
5955 /* Anything that starts with a `{' must be a compound-statement. */
5956 else if (token->type == CPP_OPEN_BRACE)
5957 statement = cp_parser_compound_statement (parser, NULL, false);
5959 /* Everything else must be a declaration-statement or an
5960 expression-statement. Try for the declaration-statement
5961 first, unless we are looking at a `;', in which case we know that
5962 we have an expression-statement. */
5965 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
5967 cp_parser_parse_tentatively (parser);
5968 /* Try to parse the declaration-statement. */
5969 cp_parser_declaration_statement (parser);
5970 /* If that worked, we're done. */
5971 if (cp_parser_parse_definitely (parser))
5974 /* Look for an expression-statement instead. */
5975 statement = cp_parser_expression_statement (parser, in_statement_expr);
5978 /* Set the line number for the statement. */
5979 if (statement && STATEMENT_CODE_P (TREE_CODE (statement)))
5980 SET_EXPR_LOCATION (statement, statement_location);
5983 /* Parse a labeled-statement.
5986 identifier : statement
5987 case constant-expression : statement
5993 case constant-expression ... constant-expression : statement
5995 Returns the new CASE_LABEL_EXPR, for a `case' or `default' label.
5996 For an ordinary label, returns a LABEL_EXPR. */
5999 cp_parser_labeled_statement (cp_parser* parser, tree in_statement_expr)
6002 tree statement = error_mark_node;
6004 /* The next token should be an identifier. */
6005 token = cp_lexer_peek_token (parser->lexer);
6006 if (token->type != CPP_NAME
6007 && token->type != CPP_KEYWORD)
6009 cp_parser_error (parser, "expected labeled-statement");
6010 return error_mark_node;
6013 switch (token->keyword)
6020 /* Consume the `case' token. */
6021 cp_lexer_consume_token (parser->lexer);
6022 /* Parse the constant-expression. */
6023 expr = cp_parser_constant_expression (parser,
6024 /*allow_non_constant_p=*/false,
6027 ellipsis = cp_lexer_peek_token (parser->lexer);
6028 if (ellipsis->type == CPP_ELLIPSIS)
6030 /* Consume the `...' token. */
6031 cp_lexer_consume_token (parser->lexer);
6033 cp_parser_constant_expression (parser,
6034 /*allow_non_constant_p=*/false,
6036 /* We don't need to emit warnings here, as the common code
6037 will do this for us. */
6040 expr_hi = NULL_TREE;
6042 if (!parser->in_switch_statement_p)
6043 error ("case label `%E' not within a switch statement", expr);
6045 statement = finish_case_label (expr, expr_hi);
6050 /* Consume the `default' token. */
6051 cp_lexer_consume_token (parser->lexer);
6052 if (!parser->in_switch_statement_p)
6053 error ("case label not within a switch statement");
6055 statement = finish_case_label (NULL_TREE, NULL_TREE);
6059 /* Anything else must be an ordinary label. */
6060 statement = finish_label_stmt (cp_parser_identifier (parser));
6064 /* Require the `:' token. */
6065 cp_parser_require (parser, CPP_COLON, "`:'");
6066 /* Parse the labeled statement. */
6067 cp_parser_statement (parser, in_statement_expr);
6069 /* Return the label, in the case of a `case' or `default' label. */
6073 /* Parse an expression-statement.
6075 expression-statement:
6078 Returns the new EXPR_STMT -- or NULL_TREE if the expression
6079 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
6080 indicates whether this expression-statement is part of an
6081 expression statement. */
6084 cp_parser_expression_statement (cp_parser* parser, tree in_statement_expr)
6086 tree statement = NULL_TREE;
6088 /* If the next token is a ';', then there is no expression
6090 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6091 statement = cp_parser_expression (parser);
6093 /* Consume the final `;'. */
6094 cp_parser_consume_semicolon_at_end_of_statement (parser);
6096 if (in_statement_expr
6097 && cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
6099 /* This is the final expression statement of a statement
6101 statement = finish_stmt_expr_expr (statement, in_statement_expr);
6104 statement = finish_expr_stmt (statement);
6111 /* Parse a compound-statement.
6114 { statement-seq [opt] }
6116 Returns a tree representing the statement. */
6119 cp_parser_compound_statement (cp_parser *parser, tree in_statement_expr,
6124 /* Consume the `{'. */
6125 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "`{'"))
6126 return error_mark_node;
6127 /* Begin the compound-statement. */
6128 compound_stmt = begin_compound_stmt (in_try ? BCS_TRY_BLOCK : 0);
6129 /* Parse an (optional) statement-seq. */
6130 cp_parser_statement_seq_opt (parser, in_statement_expr);
6131 /* Finish the compound-statement. */
6132 finish_compound_stmt (compound_stmt);
6133 /* Consume the `}'. */
6134 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
6136 return compound_stmt;
6139 /* Parse an (optional) statement-seq.
6143 statement-seq [opt] statement */
6146 cp_parser_statement_seq_opt (cp_parser* parser, tree in_statement_expr)
6148 /* Scan statements until there aren't any more. */
6151 /* If we're looking at a `}', then we've run out of statements. */
6152 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE)
6153 || cp_lexer_next_token_is (parser->lexer, CPP_EOF))
6156 /* Parse the statement. */
6157 cp_parser_statement (parser, in_statement_expr);
6161 /* Parse a selection-statement.
6163 selection-statement:
6164 if ( condition ) statement
6165 if ( condition ) statement else statement
6166 switch ( condition ) statement
6168 Returns the new IF_STMT or SWITCH_STMT. */
6171 cp_parser_selection_statement (cp_parser* parser)
6176 /* Peek at the next token. */
6177 token = cp_parser_require (parser, CPP_KEYWORD, "selection-statement");
6179 /* See what kind of keyword it is. */
6180 keyword = token->keyword;
6189 /* Look for the `('. */
6190 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
6192 cp_parser_skip_to_end_of_statement (parser);
6193 return error_mark_node;
6196 /* Begin the selection-statement. */
6197 if (keyword == RID_IF)
6198 statement = begin_if_stmt ();
6200 statement = begin_switch_stmt ();
6202 /* Parse the condition. */
6203 condition = cp_parser_condition (parser);
6204 /* Look for the `)'. */
6205 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
6206 cp_parser_skip_to_closing_parenthesis (parser, true, false,
6207 /*consume_paren=*/true);
6209 if (keyword == RID_IF)
6211 /* Add the condition. */
6212 finish_if_stmt_cond (condition, statement);
6214 /* Parse the then-clause. */
6215 cp_parser_implicitly_scoped_statement (parser);
6216 finish_then_clause (statement);
6218 /* If the next token is `else', parse the else-clause. */
6219 if (cp_lexer_next_token_is_keyword (parser->lexer,
6222 /* Consume the `else' keyword. */
6223 cp_lexer_consume_token (parser->lexer);
6224 begin_else_clause (statement);
6225 /* Parse the else-clause. */
6226 cp_parser_implicitly_scoped_statement (parser);
6227 finish_else_clause (statement);
6230 /* Now we're all done with the if-statement. */
6231 finish_if_stmt (statement);
6235 bool in_switch_statement_p;
6237 /* Add the condition. */
6238 finish_switch_cond (condition, statement);
6240 /* Parse the body of the switch-statement. */
6241 in_switch_statement_p = parser->in_switch_statement_p;
6242 parser->in_switch_statement_p = true;
6243 cp_parser_implicitly_scoped_statement (parser);
6244 parser->in_switch_statement_p = in_switch_statement_p;
6246 /* Now we're all done with the switch-statement. */
6247 finish_switch_stmt (statement);
6255 cp_parser_error (parser, "expected selection-statement");
6256 return error_mark_node;
6260 /* Parse a condition.
6264 type-specifier-seq declarator = assignment-expression
6269 type-specifier-seq declarator asm-specification [opt]
6270 attributes [opt] = assignment-expression
6272 Returns the expression that should be tested. */
6275 cp_parser_condition (cp_parser* parser)
6277 cp_decl_specifier_seq type_specifiers;
6278 const char *saved_message;
6280 /* Try the declaration first. */
6281 cp_parser_parse_tentatively (parser);
6282 /* New types are not allowed in the type-specifier-seq for a
6284 saved_message = parser->type_definition_forbidden_message;
6285 parser->type_definition_forbidden_message
6286 = "types may not be defined in conditions";
6287 /* Parse the type-specifier-seq. */
6288 cp_parser_type_specifier_seq (parser, &type_specifiers);
6289 /* Restore the saved message. */
6290 parser->type_definition_forbidden_message = saved_message;
6291 /* If all is well, we might be looking at a declaration. */
6292 if (!cp_parser_error_occurred (parser))
6295 tree asm_specification;
6297 cp_declarator *declarator;
6298 tree initializer = NULL_TREE;
6300 /* Parse the declarator. */
6301 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
6302 /*ctor_dtor_or_conv_p=*/NULL,
6303 /*parenthesized_p=*/NULL);
6304 /* Parse the attributes. */
6305 attributes = cp_parser_attributes_opt (parser);
6306 /* Parse the asm-specification. */
6307 asm_specification = cp_parser_asm_specification_opt (parser);
6308 /* If the next token is not an `=', then we might still be
6309 looking at an expression. For example:
6313 looks like a decl-specifier-seq and a declarator -- but then
6314 there is no `=', so this is an expression. */
6315 cp_parser_require (parser, CPP_EQ, "`='");
6316 /* If we did see an `=', then we are looking at a declaration
6318 if (cp_parser_parse_definitely (parser))
6322 /* Create the declaration. */
6323 decl = start_decl (declarator, &type_specifiers,
6324 /*initialized_p=*/true,
6325 attributes, /*prefix_attributes=*/NULL_TREE,
6327 /* Parse the assignment-expression. */
6328 initializer = cp_parser_assignment_expression (parser);
6330 /* Process the initializer. */
6331 cp_finish_decl (decl,
6334 LOOKUP_ONLYCONVERTING);
6336 pop_scope (DECL_CONTEXT (decl));
6338 return convert_from_reference (decl);
6341 /* If we didn't even get past the declarator successfully, we are
6342 definitely not looking at a declaration. */
6344 cp_parser_abort_tentative_parse (parser);
6346 /* Otherwise, we are looking at an expression. */
6347 return cp_parser_expression (parser);
6350 /* Parse an iteration-statement.
6352 iteration-statement:
6353 while ( condition ) statement
6354 do statement while ( expression ) ;
6355 for ( for-init-statement condition [opt] ; expression [opt] )
6358 Returns the new WHILE_STMT, DO_STMT, or FOR_STMT. */
6361 cp_parser_iteration_statement (cp_parser* parser)
6366 bool in_iteration_statement_p;
6369 /* Peek at the next token. */
6370 token = cp_parser_require (parser, CPP_KEYWORD, "iteration-statement");
6372 return error_mark_node;
6374 /* Remember whether or not we are already within an iteration
6376 in_iteration_statement_p = parser->in_iteration_statement_p;
6378 /* See what kind of keyword it is. */
6379 keyword = token->keyword;
6386 /* Begin the while-statement. */
6387 statement = begin_while_stmt ();
6388 /* Look for the `('. */
6389 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6390 /* Parse the condition. */
6391 condition = cp_parser_condition (parser);
6392 finish_while_stmt_cond (condition, statement);
6393 /* Look for the `)'. */
6394 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6395 /* Parse the dependent statement. */
6396 parser->in_iteration_statement_p = true;
6397 cp_parser_already_scoped_statement (parser);
6398 parser->in_iteration_statement_p = in_iteration_statement_p;
6399 /* We're done with the while-statement. */
6400 finish_while_stmt (statement);
6408 /* Begin the do-statement. */
6409 statement = begin_do_stmt ();
6410 /* Parse the body of the do-statement. */
6411 parser->in_iteration_statement_p = true;
6412 cp_parser_implicitly_scoped_statement (parser);
6413 parser->in_iteration_statement_p = in_iteration_statement_p;
6414 finish_do_body (statement);
6415 /* Look for the `while' keyword. */
6416 cp_parser_require_keyword (parser, RID_WHILE, "`while'");
6417 /* Look for the `('. */
6418 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6419 /* Parse the expression. */
6420 expression = cp_parser_expression (parser);
6421 /* We're done with the do-statement. */
6422 finish_do_stmt (expression, statement);
6423 /* Look for the `)'. */
6424 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6425 /* Look for the `;'. */
6426 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6432 tree condition = NULL_TREE;
6433 tree expression = NULL_TREE;
6435 /* Begin the for-statement. */
6436 statement = begin_for_stmt ();
6437 /* Look for the `('. */
6438 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6439 /* Parse the initialization. */
6440 cp_parser_for_init_statement (parser);
6441 finish_for_init_stmt (statement);
6443 /* If there's a condition, process it. */
6444 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6445 condition = cp_parser_condition (parser);
6446 finish_for_cond (condition, statement);
6447 /* Look for the `;'. */
6448 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6450 /* If there's an expression, process it. */
6451 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
6452 expression = cp_parser_expression (parser);
6453 finish_for_expr (expression, statement);
6454 /* Look for the `)'. */
6455 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6457 /* Parse the body of the for-statement. */
6458 parser->in_iteration_statement_p = true;
6459 cp_parser_already_scoped_statement (parser);
6460 parser->in_iteration_statement_p = in_iteration_statement_p;
6462 /* We're done with the for-statement. */
6463 finish_for_stmt (statement);
6468 cp_parser_error (parser, "expected iteration-statement");
6469 statement = error_mark_node;
6476 /* Parse a for-init-statement.
6479 expression-statement
6480 simple-declaration */
6483 cp_parser_for_init_statement (cp_parser* parser)
6485 /* If the next token is a `;', then we have an empty
6486 expression-statement. Grammatically, this is also a
6487 simple-declaration, but an invalid one, because it does not
6488 declare anything. Therefore, if we did not handle this case
6489 specially, we would issue an error message about an invalid
6491 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6493 /* We're going to speculatively look for a declaration, falling back
6494 to an expression, if necessary. */
6495 cp_parser_parse_tentatively (parser);
6496 /* Parse the declaration. */
6497 cp_parser_simple_declaration (parser,
6498 /*function_definition_allowed_p=*/false);
6499 /* If the tentative parse failed, then we shall need to look for an
6500 expression-statement. */
6501 if (cp_parser_parse_definitely (parser))
6505 cp_parser_expression_statement (parser, false);
6508 /* Parse a jump-statement.
6513 return expression [opt] ;
6521 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
6524 cp_parser_jump_statement (cp_parser* parser)
6526 tree statement = error_mark_node;
6530 /* Peek at the next token. */
6531 token = cp_parser_require (parser, CPP_KEYWORD, "jump-statement");
6533 return error_mark_node;
6535 /* See what kind of keyword it is. */
6536 keyword = token->keyword;
6540 if (!parser->in_switch_statement_p
6541 && !parser->in_iteration_statement_p)
6543 error ("break statement not within loop or switch");
6544 statement = error_mark_node;
6547 statement = finish_break_stmt ();
6548 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6552 if (!parser->in_iteration_statement_p)
6554 error ("continue statement not within a loop");
6555 statement = error_mark_node;
6558 statement = finish_continue_stmt ();
6559 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6566 /* If the next token is a `;', then there is no
6568 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6569 expr = cp_parser_expression (parser);
6572 /* Build the return-statement. */
6573 statement = finish_return_stmt (expr);
6574 /* Look for the final `;'. */
6575 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6580 /* Create the goto-statement. */
6581 if (cp_lexer_next_token_is (parser->lexer, CPP_MULT))
6583 /* Issue a warning about this use of a GNU extension. */
6585 pedwarn ("ISO C++ forbids computed gotos");
6586 /* Consume the '*' token. */
6587 cp_lexer_consume_token (parser->lexer);
6588 /* Parse the dependent expression. */
6589 finish_goto_stmt (cp_parser_expression (parser));
6592 finish_goto_stmt (cp_parser_identifier (parser));
6593 /* Look for the final `;'. */
6594 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6598 cp_parser_error (parser, "expected jump-statement");
6605 /* Parse a declaration-statement.
6607 declaration-statement:
6608 block-declaration */
6611 cp_parser_declaration_statement (cp_parser* parser)
6615 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
6616 p = obstack_alloc (&declarator_obstack, 0);
6618 /* Parse the block-declaration. */
6619 cp_parser_block_declaration (parser, /*statement_p=*/true);
6621 /* Free any declarators allocated. */
6622 obstack_free (&declarator_obstack, p);
6624 /* Finish off the statement. */
6628 /* Some dependent statements (like `if (cond) statement'), are
6629 implicitly in their own scope. In other words, if the statement is
6630 a single statement (as opposed to a compound-statement), it is
6631 none-the-less treated as if it were enclosed in braces. Any
6632 declarations appearing in the dependent statement are out of scope
6633 after control passes that point. This function parses a statement,
6634 but ensures that is in its own scope, even if it is not a
6637 Returns the new statement. */
6640 cp_parser_implicitly_scoped_statement (cp_parser* parser)
6644 /* If the token is not a `{', then we must take special action. */
6645 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
6647 /* Create a compound-statement. */
6648 statement = begin_compound_stmt (0);
6649 /* Parse the dependent-statement. */
6650 cp_parser_statement (parser, false);
6651 /* Finish the dummy compound-statement. */
6652 finish_compound_stmt (statement);
6654 /* Otherwise, we simply parse the statement directly. */
6656 statement = cp_parser_compound_statement (parser, NULL, false);
6658 /* Return the statement. */
6662 /* For some dependent statements (like `while (cond) statement'), we
6663 have already created a scope. Therefore, even if the dependent
6664 statement is a compound-statement, we do not want to create another
6668 cp_parser_already_scoped_statement (cp_parser* parser)
6670 /* If the token is a `{', then we must take special action. */
6671 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
6672 cp_parser_statement (parser, false);
6675 /* Avoid calling cp_parser_compound_statement, so that we
6676 don't create a new scope. Do everything else by hand. */
6677 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
6678 cp_parser_statement_seq_opt (parser, false);
6679 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
6683 /* Declarations [gram.dcl.dcl] */
6685 /* Parse an optional declaration-sequence.
6689 declaration-seq declaration */
6692 cp_parser_declaration_seq_opt (cp_parser* parser)
6698 token = cp_lexer_peek_token (parser->lexer);
6700 if (token->type == CPP_CLOSE_BRACE
6701 || token->type == CPP_EOF)
6704 if (token->type == CPP_SEMICOLON)
6706 /* A declaration consisting of a single semicolon is
6707 invalid. Allow it unless we're being pedantic. */
6708 if (pedantic && !in_system_header)
6709 pedwarn ("extra `;'");
6710 cp_lexer_consume_token (parser->lexer);
6714 /* The C lexer modifies PENDING_LANG_CHANGE when it wants the
6715 parser to enter or exit implicit `extern "C"' blocks. */
6716 while (pending_lang_change > 0)
6718 push_lang_context (lang_name_c);
6719 --pending_lang_change;
6721 while (pending_lang_change < 0)
6723 pop_lang_context ();
6724 ++pending_lang_change;
6727 /* Parse the declaration itself. */
6728 cp_parser_declaration (parser);
6732 /* Parse a declaration.
6737 template-declaration
6738 explicit-instantiation
6739 explicit-specialization
6740 linkage-specification
6741 namespace-definition
6746 __extension__ declaration */
6749 cp_parser_declaration (cp_parser* parser)
6756 /* Set this here since we can be called after
6757 pushing the linkage specification. */
6758 c_lex_string_translate = 1;
6760 /* Check for the `__extension__' keyword. */
6761 if (cp_parser_extension_opt (parser, &saved_pedantic))
6763 /* Parse the qualified declaration. */
6764 cp_parser_declaration (parser);
6765 /* Restore the PEDANTIC flag. */
6766 pedantic = saved_pedantic;
6771 /* Try to figure out what kind of declaration is present. */
6772 token1 = *cp_lexer_peek_token (parser->lexer);
6774 /* Don't translate the CPP_STRING in extern "C". */
6775 if (token1.keyword == RID_EXTERN)
6776 c_lex_string_translate = 0;
6778 if (token1.type != CPP_EOF)
6779 token2 = *cp_lexer_peek_nth_token (parser->lexer, 2);
6781 c_lex_string_translate = 1;
6783 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
6784 p = obstack_alloc (&declarator_obstack, 0);
6786 /* If the next token is `extern' and the following token is a string
6787 literal, then we have a linkage specification. */
6788 if (token1.keyword == RID_EXTERN
6789 && cp_parser_is_string_literal (&token2))
6790 cp_parser_linkage_specification (parser);
6791 /* If the next token is `template', then we have either a template
6792 declaration, an explicit instantiation, or an explicit
6794 else if (token1.keyword == RID_TEMPLATE)
6796 /* `template <>' indicates a template specialization. */
6797 if (token2.type == CPP_LESS
6798 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_GREATER)
6799 cp_parser_explicit_specialization (parser);
6800 /* `template <' indicates a template declaration. */
6801 else if (token2.type == CPP_LESS)
6802 cp_parser_template_declaration (parser, /*member_p=*/false);
6803 /* Anything else must be an explicit instantiation. */
6805 cp_parser_explicit_instantiation (parser);
6807 /* If the next token is `export', then we have a template
6809 else if (token1.keyword == RID_EXPORT)
6810 cp_parser_template_declaration (parser, /*member_p=*/false);
6811 /* If the next token is `extern', 'static' or 'inline' and the one
6812 after that is `template', we have a GNU extended explicit
6813 instantiation directive. */
6814 else if (cp_parser_allow_gnu_extensions_p (parser)
6815 && (token1.keyword == RID_EXTERN
6816 || token1.keyword == RID_STATIC
6817 || token1.keyword == RID_INLINE)
6818 && token2.keyword == RID_TEMPLATE)
6819 cp_parser_explicit_instantiation (parser);
6820 /* If the next token is `namespace', check for a named or unnamed
6821 namespace definition. */
6822 else if (token1.keyword == RID_NAMESPACE
6823 && (/* A named namespace definition. */
6824 (token2.type == CPP_NAME
6825 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
6827 /* An unnamed namespace definition. */
6828 || token2.type == CPP_OPEN_BRACE))
6829 cp_parser_namespace_definition (parser);
6830 /* We must have either a block declaration or a function
6833 /* Try to parse a block-declaration, or a function-definition. */
6834 cp_parser_block_declaration (parser, /*statement_p=*/false);
6836 /* Free any declarators allocated. */
6837 obstack_free (&declarator_obstack, p);
6840 /* Parse a block-declaration.
6845 namespace-alias-definition
6852 __extension__ block-declaration
6855 If STATEMENT_P is TRUE, then this block-declaration is occurring as
6856 part of a declaration-statement. */
6859 cp_parser_block_declaration (cp_parser *parser,
6865 /* Check for the `__extension__' keyword. */
6866 if (cp_parser_extension_opt (parser, &saved_pedantic))
6868 /* Parse the qualified declaration. */
6869 cp_parser_block_declaration (parser, statement_p);
6870 /* Restore the PEDANTIC flag. */
6871 pedantic = saved_pedantic;
6876 /* Peek at the next token to figure out which kind of declaration is
6878 token1 = cp_lexer_peek_token (parser->lexer);
6880 /* If the next keyword is `asm', we have an asm-definition. */
6881 if (token1->keyword == RID_ASM)
6884 cp_parser_commit_to_tentative_parse (parser);
6885 cp_parser_asm_definition (parser);
6887 /* If the next keyword is `namespace', we have a
6888 namespace-alias-definition. */
6889 else if (token1->keyword == RID_NAMESPACE)
6890 cp_parser_namespace_alias_definition (parser);
6891 /* If the next keyword is `using', we have either a
6892 using-declaration or a using-directive. */
6893 else if (token1->keyword == RID_USING)
6898 cp_parser_commit_to_tentative_parse (parser);
6899 /* If the token after `using' is `namespace', then we have a
6901 token2 = cp_lexer_peek_nth_token (parser->lexer, 2);
6902 if (token2->keyword == RID_NAMESPACE)
6903 cp_parser_using_directive (parser);
6904 /* Otherwise, it's a using-declaration. */
6906 cp_parser_using_declaration (parser);
6908 /* If the next keyword is `__label__' we have a label declaration. */
6909 else if (token1->keyword == RID_LABEL)
6912 cp_parser_commit_to_tentative_parse (parser);
6913 cp_parser_label_declaration (parser);
6915 /* Anything else must be a simple-declaration. */
6917 cp_parser_simple_declaration (parser, !statement_p);
6920 /* Parse a simple-declaration.
6923 decl-specifier-seq [opt] init-declarator-list [opt] ;
6925 init-declarator-list:
6927 init-declarator-list , init-declarator
6929 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
6930 function-definition as a simple-declaration. */
6933 cp_parser_simple_declaration (cp_parser* parser,
6934 bool function_definition_allowed_p)
6936 cp_decl_specifier_seq decl_specifiers;
6937 int declares_class_or_enum;
6938 bool saw_declarator;
6940 /* Defer access checks until we know what is being declared; the
6941 checks for names appearing in the decl-specifier-seq should be
6942 done as if we were in the scope of the thing being declared. */
6943 push_deferring_access_checks (dk_deferred);
6945 /* Parse the decl-specifier-seq. We have to keep track of whether
6946 or not the decl-specifier-seq declares a named class or
6947 enumeration type, since that is the only case in which the
6948 init-declarator-list is allowed to be empty.
6952 In a simple-declaration, the optional init-declarator-list can be
6953 omitted only when declaring a class or enumeration, that is when
6954 the decl-specifier-seq contains either a class-specifier, an
6955 elaborated-type-specifier, or an enum-specifier. */
6956 cp_parser_decl_specifier_seq (parser,
6957 CP_PARSER_FLAGS_OPTIONAL,
6959 &declares_class_or_enum);
6960 /* We no longer need to defer access checks. */
6961 stop_deferring_access_checks ();
6963 /* In a block scope, a valid declaration must always have a
6964 decl-specifier-seq. By not trying to parse declarators, we can
6965 resolve the declaration/expression ambiguity more quickly. */
6966 if (!function_definition_allowed_p
6967 && !decl_specifiers.any_specifiers_p)
6969 cp_parser_error (parser, "expected declaration");
6973 /* If the next two tokens are both identifiers, the code is
6974 erroneous. The usual cause of this situation is code like:
6978 where "T" should name a type -- but does not. */
6979 if (cp_parser_parse_and_diagnose_invalid_type_name (parser))
6981 /* If parsing tentatively, we should commit; we really are
6982 looking at a declaration. */
6983 cp_parser_commit_to_tentative_parse (parser);
6988 /* Keep going until we hit the `;' at the end of the simple
6990 saw_declarator = false;
6991 while (cp_lexer_next_token_is_not (parser->lexer,
6995 bool function_definition_p;
6998 saw_declarator = true;
6999 /* Parse the init-declarator. */
7000 decl = cp_parser_init_declarator (parser, &decl_specifiers,
7001 function_definition_allowed_p,
7003 declares_class_or_enum,
7004 &function_definition_p);
7005 /* If an error occurred while parsing tentatively, exit quickly.
7006 (That usually happens when in the body of a function; each
7007 statement is treated as a declaration-statement until proven
7009 if (cp_parser_error_occurred (parser))
7011 /* Handle function definitions specially. */
7012 if (function_definition_p)
7014 /* If the next token is a `,', then we are probably
7015 processing something like:
7019 which is erroneous. */
7020 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
7021 error ("mixing declarations and function-definitions is forbidden");
7022 /* Otherwise, we're done with the list of declarators. */
7025 pop_deferring_access_checks ();
7029 /* The next token should be either a `,' or a `;'. */
7030 token = cp_lexer_peek_token (parser->lexer);
7031 /* If it's a `,', there are more declarators to come. */
7032 if (token->type == CPP_COMMA)
7033 cp_lexer_consume_token (parser->lexer);
7034 /* If it's a `;', we are done. */
7035 else if (token->type == CPP_SEMICOLON)
7037 /* Anything else is an error. */
7040 cp_parser_error (parser, "expected `,' or `;'");
7041 /* Skip tokens until we reach the end of the statement. */
7042 cp_parser_skip_to_end_of_statement (parser);
7043 /* If the next token is now a `;', consume it. */
7044 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
7045 cp_lexer_consume_token (parser->lexer);
7048 /* After the first time around, a function-definition is not
7049 allowed -- even if it was OK at first. For example:
7054 function_definition_allowed_p = false;
7057 /* Issue an error message if no declarators are present, and the
7058 decl-specifier-seq does not itself declare a class or
7060 if (!saw_declarator)
7062 if (cp_parser_declares_only_class_p (parser))
7063 shadow_tag (&decl_specifiers);
7064 /* Perform any deferred access checks. */
7065 perform_deferred_access_checks ();
7068 /* Consume the `;'. */
7069 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
7072 pop_deferring_access_checks ();
7075 /* Parse a decl-specifier-seq.
7078 decl-specifier-seq [opt] decl-specifier
7081 storage-class-specifier
7092 Set *DECL_SPECS to a representation of the decl-specifier-seq.
7094 If FRIEND_IS_NOT_CLASS_P is non-NULL, and the `friend' specifier
7095 appears, and the entity that will be a friend is not going to be a
7096 class, then *FRIEND_IS_NOT_CLASS_P will be set to TRUE. Note that
7097 even if *FRIEND_IS_NOT_CLASS_P is FALSE, the entity to which
7098 friendship is granted might not be a class.
7100 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
7103 1: one of the decl-specifiers is an elaborated-type-specifier
7104 (i.e., a type declaration)
7105 2: one of the decl-specifiers is an enum-specifier or a
7106 class-specifier (i.e., a type definition)
7111 cp_parser_decl_specifier_seq (cp_parser* parser,
7112 cp_parser_flags flags,
7113 cp_decl_specifier_seq *decl_specs,
7114 int* declares_class_or_enum)
7116 bool constructor_possible_p = !parser->in_declarator_p;
7118 /* Clear DECL_SPECS. */
7119 clear_decl_specs (decl_specs);
7121 /* Assume no class or enumeration type is declared. */
7122 *declares_class_or_enum = 0;
7124 /* Keep reading specifiers until there are no more to read. */
7128 bool found_decl_spec;
7131 /* Peek at the next token. */
7132 token = cp_lexer_peek_token (parser->lexer);
7133 /* Handle attributes. */
7134 if (token->keyword == RID_ATTRIBUTE)
7136 /* Parse the attributes. */
7137 decl_specs->attributes
7138 = chainon (decl_specs->attributes,
7139 cp_parser_attributes_opt (parser));
7142 /* Assume we will find a decl-specifier keyword. */
7143 found_decl_spec = true;
7144 /* If the next token is an appropriate keyword, we can simply
7145 add it to the list. */
7146 switch (token->keyword)
7151 if (decl_specs->specs[(int) ds_friend]++)
7152 error ("duplicate `friend'");
7153 /* Consume the token. */
7154 cp_lexer_consume_token (parser->lexer);
7157 /* function-specifier:
7164 cp_parser_function_specifier_opt (parser, decl_specs);
7170 ++decl_specs->specs[(int) ds_typedef];
7171 /* Consume the token. */
7172 cp_lexer_consume_token (parser->lexer);
7173 /* A constructor declarator cannot appear in a typedef. */
7174 constructor_possible_p = false;
7175 /* The "typedef" keyword can only occur in a declaration; we
7176 may as well commit at this point. */
7177 cp_parser_commit_to_tentative_parse (parser);
7180 /* storage-class-specifier:
7190 /* Consume the token. */
7191 cp_lexer_consume_token (parser->lexer);
7192 cp_parser_set_storage_class (decl_specs, sc_auto);
7195 /* Consume the token. */
7196 cp_lexer_consume_token (parser->lexer);
7197 cp_parser_set_storage_class (decl_specs, sc_register);
7200 /* Consume the token. */
7201 cp_lexer_consume_token (parser->lexer);
7202 if (decl_specs->specs[(int) ds_thread])
7204 error ("`__thread' before `static'");
7205 decl_specs->specs[(int) ds_thread] = 0;
7207 cp_parser_set_storage_class (decl_specs, sc_static);
7210 /* Consume the token. */
7211 cp_lexer_consume_token (parser->lexer);
7212 if (decl_specs->specs[(int) ds_thread])
7214 error ("`__thread' before `extern'");
7215 decl_specs->specs[(int) ds_thread] = 0;
7217 cp_parser_set_storage_class (decl_specs, sc_extern);
7220 /* Consume the token. */
7221 cp_lexer_consume_token (parser->lexer);
7222 cp_parser_set_storage_class (decl_specs, sc_mutable);
7225 /* Consume the token. */
7226 cp_lexer_consume_token (parser->lexer);
7227 ++decl_specs->specs[(int) ds_thread];
7231 /* We did not yet find a decl-specifier yet. */
7232 found_decl_spec = false;
7236 /* Constructors are a special case. The `S' in `S()' is not a
7237 decl-specifier; it is the beginning of the declarator. */
7240 && constructor_possible_p
7241 && (cp_parser_constructor_declarator_p
7242 (parser, decl_specs->specs[(int) ds_friend] != 0)));
7244 /* If we don't have a DECL_SPEC yet, then we must be looking at
7245 a type-specifier. */
7246 if (!found_decl_spec && !constructor_p)
7248 int decl_spec_declares_class_or_enum;
7249 bool is_cv_qualifier;
7253 = cp_parser_type_specifier (parser, flags,
7255 /*is_declaration=*/true,
7256 &decl_spec_declares_class_or_enum,
7259 *declares_class_or_enum |= decl_spec_declares_class_or_enum;
7261 /* If this type-specifier referenced a user-defined type
7262 (a typedef, class-name, etc.), then we can't allow any
7263 more such type-specifiers henceforth.
7267 The longest sequence of decl-specifiers that could
7268 possibly be a type name is taken as the
7269 decl-specifier-seq of a declaration. The sequence shall
7270 be self-consistent as described below.
7274 As a general rule, at most one type-specifier is allowed
7275 in the complete decl-specifier-seq of a declaration. The
7276 only exceptions are the following:
7278 -- const or volatile can be combined with any other
7281 -- signed or unsigned can be combined with char, long,
7289 void g (const int Pc);
7291 Here, Pc is *not* part of the decl-specifier seq; it's
7292 the declarator. Therefore, once we see a type-specifier
7293 (other than a cv-qualifier), we forbid any additional
7294 user-defined types. We *do* still allow things like `int
7295 int' to be considered a decl-specifier-seq, and issue the
7296 error message later. */
7297 if (type_spec && !is_cv_qualifier)
7298 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
7299 /* A constructor declarator cannot follow a type-specifier. */
7302 constructor_possible_p = false;
7303 found_decl_spec = true;
7307 /* If we still do not have a DECL_SPEC, then there are no more
7309 if (!found_decl_spec)
7312 decl_specs->any_specifiers_p = true;
7313 /* After we see one decl-specifier, further decl-specifiers are
7315 flags |= CP_PARSER_FLAGS_OPTIONAL;
7318 /* Don't allow a friend specifier with a class definition. */
7319 if (decl_specs->specs[(int) ds_friend] != 0
7320 && (*declares_class_or_enum & 2))
7321 error ("class definition may not be declared a friend");
7324 /* Parse an (optional) storage-class-specifier.
7326 storage-class-specifier:
7335 storage-class-specifier:
7338 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
7341 cp_parser_storage_class_specifier_opt (cp_parser* parser)
7343 switch (cp_lexer_peek_token (parser->lexer)->keyword)
7351 /* Consume the token. */
7352 return cp_lexer_consume_token (parser->lexer)->value;
7359 /* Parse an (optional) function-specifier.
7366 Returns an IDENTIFIER_NODE corresponding to the keyword used.
7367 Updates DECL_SPECS, if it is non-NULL. */
7370 cp_parser_function_specifier_opt (cp_parser* parser,
7371 cp_decl_specifier_seq *decl_specs)
7373 switch (cp_lexer_peek_token (parser->lexer)->keyword)
7377 ++decl_specs->specs[(int) ds_inline];
7382 ++decl_specs->specs[(int) ds_virtual];
7387 ++decl_specs->specs[(int) ds_explicit];
7394 /* Consume the token. */
7395 return cp_lexer_consume_token (parser->lexer)->value;
7398 /* Parse a linkage-specification.
7400 linkage-specification:
7401 extern string-literal { declaration-seq [opt] }
7402 extern string-literal declaration */
7405 cp_parser_linkage_specification (cp_parser* parser)
7410 /* Look for the `extern' keyword. */
7411 cp_parser_require_keyword (parser, RID_EXTERN, "`extern'");
7413 /* Peek at the next token. */
7414 token = cp_lexer_peek_token (parser->lexer);
7415 /* If it's not a string-literal, then there's a problem. */
7416 if (!cp_parser_is_string_literal (token))
7418 cp_parser_error (parser, "expected language-name");
7421 /* Consume the token. */
7422 cp_lexer_consume_token (parser->lexer);
7424 /* Transform the literal into an identifier. If the literal is a
7425 wide-character string, or contains embedded NULs, then we can't
7426 handle it as the user wants. */
7427 if (token->type == CPP_WSTRING
7428 || (strlen (TREE_STRING_POINTER (token->value))
7429 != (size_t) (TREE_STRING_LENGTH (token->value) - 1)))
7431 cp_parser_error (parser, "invalid linkage-specification");
7432 /* Assume C++ linkage. */
7433 linkage = get_identifier ("c++");
7435 /* If the string is chained to another string, take the latter,
7436 that's the untranslated string. */
7437 else if (TREE_CHAIN (token->value))
7438 linkage = get_identifier (TREE_STRING_POINTER (TREE_CHAIN (token->value)));
7439 /* If it's a simple string constant, things are easier. */
7441 linkage = get_identifier (TREE_STRING_POINTER (token->value));
7443 /* We're now using the new linkage. */
7444 push_lang_context (linkage);
7446 /* If the next token is a `{', then we're using the first
7448 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
7450 /* Consume the `{' token. */
7451 cp_lexer_consume_token (parser->lexer);
7452 /* Parse the declarations. */
7453 cp_parser_declaration_seq_opt (parser);
7454 /* Look for the closing `}'. */
7455 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
7457 /* Otherwise, there's just one declaration. */
7460 bool saved_in_unbraced_linkage_specification_p;
7462 saved_in_unbraced_linkage_specification_p
7463 = parser->in_unbraced_linkage_specification_p;
7464 parser->in_unbraced_linkage_specification_p = true;
7465 have_extern_spec = true;
7466 cp_parser_declaration (parser);
7467 have_extern_spec = false;
7468 parser->in_unbraced_linkage_specification_p
7469 = saved_in_unbraced_linkage_specification_p;
7472 /* We're done with the linkage-specification. */
7473 pop_lang_context ();
7476 /* Special member functions [gram.special] */
7478 /* Parse a conversion-function-id.
7480 conversion-function-id:
7481 operator conversion-type-id
7483 Returns an IDENTIFIER_NODE representing the operator. */
7486 cp_parser_conversion_function_id (cp_parser* parser)
7490 tree saved_qualifying_scope;
7491 tree saved_object_scope;
7494 /* Look for the `operator' token. */
7495 if (!cp_parser_require_keyword (parser, RID_OPERATOR, "`operator'"))
7496 return error_mark_node;
7497 /* When we parse the conversion-type-id, the current scope will be
7498 reset. However, we need that information in able to look up the
7499 conversion function later, so we save it here. */
7500 saved_scope = parser->scope;
7501 saved_qualifying_scope = parser->qualifying_scope;
7502 saved_object_scope = parser->object_scope;
7503 /* We must enter the scope of the class so that the names of
7504 entities declared within the class are available in the
7505 conversion-type-id. For example, consider:
7512 S::operator I() { ... }
7514 In order to see that `I' is a type-name in the definition, we
7515 must be in the scope of `S'. */
7517 pop_p = push_scope (saved_scope);
7518 /* Parse the conversion-type-id. */
7519 type = cp_parser_conversion_type_id (parser);
7520 /* Leave the scope of the class, if any. */
7522 pop_scope (saved_scope);
7523 /* Restore the saved scope. */
7524 parser->scope = saved_scope;
7525 parser->qualifying_scope = saved_qualifying_scope;
7526 parser->object_scope = saved_object_scope;
7527 /* If the TYPE is invalid, indicate failure. */
7528 if (type == error_mark_node)
7529 return error_mark_node;
7530 return mangle_conv_op_name_for_type (type);
7533 /* Parse a conversion-type-id:
7536 type-specifier-seq conversion-declarator [opt]
7538 Returns the TYPE specified. */
7541 cp_parser_conversion_type_id (cp_parser* parser)
7544 cp_decl_specifier_seq type_specifiers;
7545 cp_declarator *declarator;
7547 /* Parse the attributes. */
7548 attributes = cp_parser_attributes_opt (parser);
7549 /* Parse the type-specifiers. */
7550 cp_parser_type_specifier_seq (parser, &type_specifiers);
7551 /* If that didn't work, stop. */
7552 if (type_specifiers.type == error_mark_node)
7553 return error_mark_node;
7554 /* Parse the conversion-declarator. */
7555 declarator = cp_parser_conversion_declarator_opt (parser);
7557 return grokdeclarator (declarator, &type_specifiers, TYPENAME,
7558 /*initialized=*/0, &attributes);
7561 /* Parse an (optional) conversion-declarator.
7563 conversion-declarator:
7564 ptr-operator conversion-declarator [opt]
7568 static cp_declarator *
7569 cp_parser_conversion_declarator_opt (cp_parser* parser)
7571 enum tree_code code;
7573 cp_cv_quals cv_quals;
7575 /* We don't know if there's a ptr-operator next, or not. */
7576 cp_parser_parse_tentatively (parser);
7577 /* Try the ptr-operator. */
7578 code = cp_parser_ptr_operator (parser, &class_type, &cv_quals);
7579 /* If it worked, look for more conversion-declarators. */
7580 if (cp_parser_parse_definitely (parser))
7582 cp_declarator *declarator;
7584 /* Parse another optional declarator. */
7585 declarator = cp_parser_conversion_declarator_opt (parser);
7587 /* Create the representation of the declarator. */
7589 declarator = make_ptrmem_declarator (cv_quals, class_type,
7591 else if (code == INDIRECT_REF)
7592 declarator = make_pointer_declarator (cv_quals, declarator);
7594 declarator = make_reference_declarator (cv_quals, declarator);
7602 /* Parse an (optional) ctor-initializer.
7605 : mem-initializer-list
7607 Returns TRUE iff the ctor-initializer was actually present. */
7610 cp_parser_ctor_initializer_opt (cp_parser* parser)
7612 /* If the next token is not a `:', then there is no
7613 ctor-initializer. */
7614 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
7616 /* Do default initialization of any bases and members. */
7617 if (DECL_CONSTRUCTOR_P (current_function_decl))
7618 finish_mem_initializers (NULL_TREE);
7623 /* Consume the `:' token. */
7624 cp_lexer_consume_token (parser->lexer);
7625 /* And the mem-initializer-list. */
7626 cp_parser_mem_initializer_list (parser);
7631 /* Parse a mem-initializer-list.
7633 mem-initializer-list:
7635 mem-initializer , mem-initializer-list */
7638 cp_parser_mem_initializer_list (cp_parser* parser)
7640 tree mem_initializer_list = NULL_TREE;
7642 /* Let the semantic analysis code know that we are starting the
7643 mem-initializer-list. */
7644 if (!DECL_CONSTRUCTOR_P (current_function_decl))
7645 error ("only constructors take base initializers");
7647 /* Loop through the list. */
7650 tree mem_initializer;
7652 /* Parse the mem-initializer. */
7653 mem_initializer = cp_parser_mem_initializer (parser);
7654 /* Add it to the list, unless it was erroneous. */
7655 if (mem_initializer)
7657 TREE_CHAIN (mem_initializer) = mem_initializer_list;
7658 mem_initializer_list = mem_initializer;
7660 /* If the next token is not a `,', we're done. */
7661 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
7663 /* Consume the `,' token. */
7664 cp_lexer_consume_token (parser->lexer);
7667 /* Perform semantic analysis. */
7668 if (DECL_CONSTRUCTOR_P (current_function_decl))
7669 finish_mem_initializers (mem_initializer_list);
7672 /* Parse a mem-initializer.
7675 mem-initializer-id ( expression-list [opt] )
7680 ( expression-list [opt] )
7682 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
7683 class) or FIELD_DECL (for a non-static data member) to initialize;
7684 the TREE_VALUE is the expression-list. */
7687 cp_parser_mem_initializer (cp_parser* parser)
7689 tree mem_initializer_id;
7690 tree expression_list;
7693 /* Find out what is being initialized. */
7694 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
7696 pedwarn ("anachronistic old-style base class initializer");
7697 mem_initializer_id = NULL_TREE;
7700 mem_initializer_id = cp_parser_mem_initializer_id (parser);
7701 member = expand_member_init (mem_initializer_id);
7702 if (member && !DECL_P (member))
7703 in_base_initializer = 1;
7706 = cp_parser_parenthesized_expression_list (parser, false,
7707 /*non_constant_p=*/NULL);
7708 if (!expression_list)
7709 expression_list = void_type_node;
7711 in_base_initializer = 0;
7713 return member ? build_tree_list (member, expression_list) : NULL_TREE;
7716 /* Parse a mem-initializer-id.
7719 :: [opt] nested-name-specifier [opt] class-name
7722 Returns a TYPE indicating the class to be initializer for the first
7723 production. Returns an IDENTIFIER_NODE indicating the data member
7724 to be initialized for the second production. */
7727 cp_parser_mem_initializer_id (cp_parser* parser)
7729 bool global_scope_p;
7730 bool nested_name_specifier_p;
7731 bool template_p = false;
7734 /* `typename' is not allowed in this context ([temp.res]). */
7735 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
7737 error ("keyword `typename' not allowed in this context (a qualified "
7738 "member initializer is implicitly a type)");
7739 cp_lexer_consume_token (parser->lexer);
7741 /* Look for the optional `::' operator. */
7743 = (cp_parser_global_scope_opt (parser,
7744 /*current_scope_valid_p=*/false)
7746 /* Look for the optional nested-name-specifier. The simplest way to
7751 The keyword `typename' is not permitted in a base-specifier or
7752 mem-initializer; in these contexts a qualified name that
7753 depends on a template-parameter is implicitly assumed to be a
7756 is to assume that we have seen the `typename' keyword at this
7758 nested_name_specifier_p
7759 = (cp_parser_nested_name_specifier_opt (parser,
7760 /*typename_keyword_p=*/true,
7761 /*check_dependency_p=*/true,
7763 /*is_declaration=*/true)
7765 if (nested_name_specifier_p)
7766 template_p = cp_parser_optional_template_keyword (parser);
7767 /* If there is a `::' operator or a nested-name-specifier, then we
7768 are definitely looking for a class-name. */
7769 if (global_scope_p || nested_name_specifier_p)
7770 return cp_parser_class_name (parser,
7771 /*typename_keyword_p=*/true,
7772 /*template_keyword_p=*/template_p,
7774 /*check_dependency_p=*/true,
7775 /*class_head_p=*/false,
7776 /*is_declaration=*/true);
7777 /* Otherwise, we could also be looking for an ordinary identifier. */
7778 cp_parser_parse_tentatively (parser);
7779 /* Try a class-name. */
7780 id = cp_parser_class_name (parser,
7781 /*typename_keyword_p=*/true,
7782 /*template_keyword_p=*/false,
7784 /*check_dependency_p=*/true,
7785 /*class_head_p=*/false,
7786 /*is_declaration=*/true);
7787 /* If we found one, we're done. */
7788 if (cp_parser_parse_definitely (parser))
7790 /* Otherwise, look for an ordinary identifier. */
7791 return cp_parser_identifier (parser);
7794 /* Overloading [gram.over] */
7796 /* Parse an operator-function-id.
7798 operator-function-id:
7801 Returns an IDENTIFIER_NODE for the operator which is a
7802 human-readable spelling of the identifier, e.g., `operator +'. */
7805 cp_parser_operator_function_id (cp_parser* parser)
7807 /* Look for the `operator' keyword. */
7808 if (!cp_parser_require_keyword (parser, RID_OPERATOR, "`operator'"))
7809 return error_mark_node;
7810 /* And then the name of the operator itself. */
7811 return cp_parser_operator (parser);
7814 /* Parse an operator.
7817 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
7818 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
7819 || ++ -- , ->* -> () []
7826 Returns an IDENTIFIER_NODE for the operator which is a
7827 human-readable spelling of the identifier, e.g., `operator +'. */
7830 cp_parser_operator (cp_parser* parser)
7832 tree id = NULL_TREE;
7835 /* Peek at the next token. */
7836 token = cp_lexer_peek_token (parser->lexer);
7837 /* Figure out which operator we have. */
7838 switch (token->type)
7844 /* The keyword should be either `new' or `delete'. */
7845 if (token->keyword == RID_NEW)
7847 else if (token->keyword == RID_DELETE)
7852 /* Consume the `new' or `delete' token. */
7853 cp_lexer_consume_token (parser->lexer);
7855 /* Peek at the next token. */
7856 token = cp_lexer_peek_token (parser->lexer);
7857 /* If it's a `[' token then this is the array variant of the
7859 if (token->type == CPP_OPEN_SQUARE)
7861 /* Consume the `[' token. */
7862 cp_lexer_consume_token (parser->lexer);
7863 /* Look for the `]' token. */
7864 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
7865 id = ansi_opname (op == NEW_EXPR
7866 ? VEC_NEW_EXPR : VEC_DELETE_EXPR);
7868 /* Otherwise, we have the non-array variant. */
7870 id = ansi_opname (op);
7876 id = ansi_opname (PLUS_EXPR);
7880 id = ansi_opname (MINUS_EXPR);
7884 id = ansi_opname (MULT_EXPR);
7888 id = ansi_opname (TRUNC_DIV_EXPR);
7892 id = ansi_opname (TRUNC_MOD_EXPR);
7896 id = ansi_opname (BIT_XOR_EXPR);
7900 id = ansi_opname (BIT_AND_EXPR);
7904 id = ansi_opname (BIT_IOR_EXPR);
7908 id = ansi_opname (BIT_NOT_EXPR);
7912 id = ansi_opname (TRUTH_NOT_EXPR);
7916 id = ansi_assopname (NOP_EXPR);
7920 id = ansi_opname (LT_EXPR);
7924 id = ansi_opname (GT_EXPR);
7928 id = ansi_assopname (PLUS_EXPR);
7932 id = ansi_assopname (MINUS_EXPR);
7936 id = ansi_assopname (MULT_EXPR);
7940 id = ansi_assopname (TRUNC_DIV_EXPR);
7944 id = ansi_assopname (TRUNC_MOD_EXPR);
7948 id = ansi_assopname (BIT_XOR_EXPR);
7952 id = ansi_assopname (BIT_AND_EXPR);
7956 id = ansi_assopname (BIT_IOR_EXPR);
7960 id = ansi_opname (LSHIFT_EXPR);
7964 id = ansi_opname (RSHIFT_EXPR);
7968 id = ansi_assopname (LSHIFT_EXPR);
7972 id = ansi_assopname (RSHIFT_EXPR);
7976 id = ansi_opname (EQ_EXPR);
7980 id = ansi_opname (NE_EXPR);
7984 id = ansi_opname (LE_EXPR);
7987 case CPP_GREATER_EQ:
7988 id = ansi_opname (GE_EXPR);
7992 id = ansi_opname (TRUTH_ANDIF_EXPR);
7996 id = ansi_opname (TRUTH_ORIF_EXPR);
8000 id = ansi_opname (POSTINCREMENT_EXPR);
8003 case CPP_MINUS_MINUS:
8004 id = ansi_opname (PREDECREMENT_EXPR);
8008 id = ansi_opname (COMPOUND_EXPR);
8011 case CPP_DEREF_STAR:
8012 id = ansi_opname (MEMBER_REF);
8016 id = ansi_opname (COMPONENT_REF);
8019 case CPP_OPEN_PAREN:
8020 /* Consume the `('. */
8021 cp_lexer_consume_token (parser->lexer);
8022 /* Look for the matching `)'. */
8023 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
8024 return ansi_opname (CALL_EXPR);
8026 case CPP_OPEN_SQUARE:
8027 /* Consume the `['. */
8028 cp_lexer_consume_token (parser->lexer);
8029 /* Look for the matching `]'. */
8030 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
8031 return ansi_opname (ARRAY_REF);
8035 id = ansi_opname (MIN_EXPR);
8039 id = ansi_opname (MAX_EXPR);
8043 id = ansi_assopname (MIN_EXPR);
8047 id = ansi_assopname (MAX_EXPR);
8051 /* Anything else is an error. */
8055 /* If we have selected an identifier, we need to consume the
8058 cp_lexer_consume_token (parser->lexer);
8059 /* Otherwise, no valid operator name was present. */
8062 cp_parser_error (parser, "expected operator");
8063 id = error_mark_node;
8069 /* Parse a template-declaration.
8071 template-declaration:
8072 export [opt] template < template-parameter-list > declaration
8074 If MEMBER_P is TRUE, this template-declaration occurs within a
8077 The grammar rule given by the standard isn't correct. What
8080 template-declaration:
8081 export [opt] template-parameter-list-seq
8082 decl-specifier-seq [opt] init-declarator [opt] ;
8083 export [opt] template-parameter-list-seq
8086 template-parameter-list-seq:
8087 template-parameter-list-seq [opt]
8088 template < template-parameter-list > */
8091 cp_parser_template_declaration (cp_parser* parser, bool member_p)
8093 /* Check for `export'. */
8094 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXPORT))
8096 /* Consume the `export' token. */
8097 cp_lexer_consume_token (parser->lexer);
8098 /* Warn that we do not support `export'. */
8099 warning ("keyword `export' not implemented, and will be ignored");
8102 cp_parser_template_declaration_after_export (parser, member_p);
8105 /* Parse a template-parameter-list.
8107 template-parameter-list:
8109 template-parameter-list , template-parameter
8111 Returns a TREE_LIST. Each node represents a template parameter.
8112 The nodes are connected via their TREE_CHAINs. */
8115 cp_parser_template_parameter_list (cp_parser* parser)
8117 tree parameter_list = NULL_TREE;
8125 /* Parse the template-parameter. */
8126 parameter = cp_parser_template_parameter (parser, &is_non_type);
8127 /* Add it to the list. */
8128 parameter_list = process_template_parm (parameter_list,
8131 /* Peek at the next token. */
8132 token = cp_lexer_peek_token (parser->lexer);
8133 /* If it's not a `,', we're done. */
8134 if (token->type != CPP_COMMA)
8136 /* Otherwise, consume the `,' token. */
8137 cp_lexer_consume_token (parser->lexer);
8140 return parameter_list;
8143 /* Parse a template-parameter.
8147 parameter-declaration
8149 Returns a TREE_LIST. The TREE_VALUE represents the parameter. The
8150 TREE_PURPOSE is the default value, if any. *IS_NON_TYPE is set to
8151 true iff this parameter is a non-type parameter. */
8154 cp_parser_template_parameter (cp_parser* parser, bool *is_non_type)
8157 cp_parameter_declarator *parameter_declarator;
8159 /* Assume it is a type parameter or a template parameter. */
8160 *is_non_type = false;
8161 /* Peek at the next token. */
8162 token = cp_lexer_peek_token (parser->lexer);
8163 /* If it is `class' or `template', we have a type-parameter. */
8164 if (token->keyword == RID_TEMPLATE)
8165 return cp_parser_type_parameter (parser);
8166 /* If it is `class' or `typename' we do not know yet whether it is a
8167 type parameter or a non-type parameter. Consider:
8169 template <typename T, typename T::X X> ...
8173 template <class C, class D*> ...
8175 Here, the first parameter is a type parameter, and the second is
8176 a non-type parameter. We can tell by looking at the token after
8177 the identifier -- if it is a `,', `=', or `>' then we have a type
8179 if (token->keyword == RID_TYPENAME || token->keyword == RID_CLASS)
8181 /* Peek at the token after `class' or `typename'. */
8182 token = cp_lexer_peek_nth_token (parser->lexer, 2);
8183 /* If it's an identifier, skip it. */
8184 if (token->type == CPP_NAME)
8185 token = cp_lexer_peek_nth_token (parser->lexer, 3);
8186 /* Now, see if the token looks like the end of a template
8188 if (token->type == CPP_COMMA
8189 || token->type == CPP_EQ
8190 || token->type == CPP_GREATER)
8191 return cp_parser_type_parameter (parser);
8194 /* Otherwise, it is a non-type parameter.
8198 When parsing a default template-argument for a non-type
8199 template-parameter, the first non-nested `>' is taken as the end
8200 of the template parameter-list rather than a greater-than
8202 *is_non_type = true;
8203 parameter_declarator
8204 = cp_parser_parameter_declaration (parser, /*template_parm_p=*/true,
8205 /*parenthesized_p=*/NULL);
8206 return (build_tree_list
8207 (parameter_declarator->default_argument,
8208 grokdeclarator (parameter_declarator->declarator,
8209 ¶meter_declarator->decl_specifiers,
8210 PARM, /*initialized=*/0,
8211 /*attrlist=*/NULL)));
8214 /* Parse a type-parameter.
8217 class identifier [opt]
8218 class identifier [opt] = type-id
8219 typename identifier [opt]
8220 typename identifier [opt] = type-id
8221 template < template-parameter-list > class identifier [opt]
8222 template < template-parameter-list > class identifier [opt]
8225 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
8226 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
8227 the declaration of the parameter. */
8230 cp_parser_type_parameter (cp_parser* parser)
8235 /* Look for a keyword to tell us what kind of parameter this is. */
8236 token = cp_parser_require (parser, CPP_KEYWORD,
8237 "`class', `typename', or `template'");
8239 return error_mark_node;
8241 switch (token->keyword)
8247 tree default_argument;
8249 /* If the next token is an identifier, then it names the
8251 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
8252 identifier = cp_parser_identifier (parser);
8254 identifier = NULL_TREE;
8256 /* Create the parameter. */
8257 parameter = finish_template_type_parm (class_type_node, identifier);
8259 /* If the next token is an `=', we have a default argument. */
8260 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
8262 /* Consume the `=' token. */
8263 cp_lexer_consume_token (parser->lexer);
8264 /* Parse the default-argument. */
8265 default_argument = cp_parser_type_id (parser);
8268 default_argument = NULL_TREE;
8270 /* Create the combined representation of the parameter and the
8271 default argument. */
8272 parameter = build_tree_list (default_argument, parameter);
8278 tree parameter_list;
8280 tree default_argument;
8282 /* Look for the `<'. */
8283 cp_parser_require (parser, CPP_LESS, "`<'");
8284 /* Parse the template-parameter-list. */
8285 begin_template_parm_list ();
8287 = cp_parser_template_parameter_list (parser);
8288 parameter_list = end_template_parm_list (parameter_list);
8289 /* Look for the `>'. */
8290 cp_parser_require (parser, CPP_GREATER, "`>'");
8291 /* Look for the `class' keyword. */
8292 cp_parser_require_keyword (parser, RID_CLASS, "`class'");
8293 /* If the next token is an `=', then there is a
8294 default-argument. If the next token is a `>', we are at
8295 the end of the parameter-list. If the next token is a `,',
8296 then we are at the end of this parameter. */
8297 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ)
8298 && cp_lexer_next_token_is_not (parser->lexer, CPP_GREATER)
8299 && cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
8300 identifier = cp_parser_identifier (parser);
8302 identifier = NULL_TREE;
8303 /* Create the template parameter. */
8304 parameter = finish_template_template_parm (class_type_node,
8307 /* If the next token is an `=', then there is a
8308 default-argument. */
8309 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
8313 /* Consume the `='. */
8314 cp_lexer_consume_token (parser->lexer);
8315 /* Parse the id-expression. */
8317 = cp_parser_id_expression (parser,
8318 /*template_keyword_p=*/false,
8319 /*check_dependency_p=*/true,
8320 /*template_p=*/&is_template,
8321 /*declarator_p=*/false);
8322 if (TREE_CODE (default_argument) == TYPE_DECL)
8323 /* If the id-expression was a template-id that refers to
8324 a template-class, we already have the declaration here,
8325 so no further lookup is needed. */
8328 /* Look up the name. */
8330 = cp_parser_lookup_name (parser, default_argument,
8332 /*is_template=*/is_template,
8333 /*is_namespace=*/false,
8334 /*check_dependency=*/true);
8335 /* See if the default argument is valid. */
8337 = check_template_template_default_arg (default_argument);
8340 default_argument = NULL_TREE;
8342 /* Create the combined representation of the parameter and the
8343 default argument. */
8344 parameter = build_tree_list (default_argument, parameter);
8349 /* Anything else is an error. */
8350 cp_parser_error (parser,
8351 "expected `class', `typename', or `template'");
8352 parameter = error_mark_node;
8358 /* Parse a template-id.
8361 template-name < template-argument-list [opt] >
8363 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
8364 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
8365 returned. Otherwise, if the template-name names a function, or set
8366 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
8367 names a class, returns a TYPE_DECL for the specialization.
8369 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
8370 uninstantiated templates. */
8373 cp_parser_template_id (cp_parser *parser,
8374 bool template_keyword_p,
8375 bool check_dependency_p,
8376 bool is_declaration)
8381 ptrdiff_t start_of_id;
8382 tree access_check = NULL_TREE;
8383 cp_token *next_token, *next_token_2;
8386 /* If the next token corresponds to a template-id, there is no need
8388 next_token = cp_lexer_peek_token (parser->lexer);
8389 if (next_token->type == CPP_TEMPLATE_ID)
8394 /* Get the stored value. */
8395 value = cp_lexer_consume_token (parser->lexer)->value;
8396 /* Perform any access checks that were deferred. */
8397 for (check = TREE_PURPOSE (value); check; check = TREE_CHAIN (check))
8398 perform_or_defer_access_check (TREE_PURPOSE (check),
8399 TREE_VALUE (check));
8400 /* Return the stored value. */
8401 return TREE_VALUE (value);
8404 /* Avoid performing name lookup if there is no possibility of
8405 finding a template-id. */
8406 if ((next_token->type != CPP_NAME && next_token->keyword != RID_OPERATOR)
8407 || (next_token->type == CPP_NAME
8408 && !cp_parser_nth_token_starts_template_argument_list_p
8411 cp_parser_error (parser, "expected template-id");
8412 return error_mark_node;
8415 /* Remember where the template-id starts. */
8416 if (cp_parser_parsing_tentatively (parser)
8417 && !cp_parser_committed_to_tentative_parse (parser))
8419 next_token = cp_lexer_peek_token (parser->lexer);
8420 start_of_id = cp_lexer_token_difference (parser->lexer,
8421 parser->lexer->first_token,
8427 push_deferring_access_checks (dk_deferred);
8429 /* Parse the template-name. */
8430 is_identifier = false;
8431 template = cp_parser_template_name (parser, template_keyword_p,
8435 if (template == error_mark_node || is_identifier)
8437 pop_deferring_access_checks ();
8441 /* If we find the sequence `[:' after a template-name, it's probably
8442 a digraph-typo for `< ::'. Substitute the tokens and check if we can
8443 parse correctly the argument list. */
8444 next_token = cp_lexer_peek_nth_token (parser->lexer, 1);
8445 next_token_2 = cp_lexer_peek_nth_token (parser->lexer, 2);
8446 if (next_token->type == CPP_OPEN_SQUARE
8447 && next_token->flags & DIGRAPH
8448 && next_token_2->type == CPP_COLON
8449 && !(next_token_2->flags & PREV_WHITE))
8451 cp_parser_parse_tentatively (parser);
8452 /* Change `:' into `::'. */
8453 next_token_2->type = CPP_SCOPE;
8454 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
8456 cp_lexer_consume_token (parser->lexer);
8457 /* Parse the arguments. */
8458 arguments = cp_parser_enclosed_template_argument_list (parser);
8459 if (!cp_parser_parse_definitely (parser))
8461 /* If we couldn't parse an argument list, then we revert our changes
8462 and return simply an error. Maybe this is not a template-id
8464 next_token_2->type = CPP_COLON;
8465 cp_parser_error (parser, "expected `<'");
8466 pop_deferring_access_checks ();
8467 return error_mark_node;
8469 /* Otherwise, emit an error about the invalid digraph, but continue
8470 parsing because we got our argument list. */
8471 pedwarn ("`<::' cannot begin a template-argument list");
8472 inform ("`<:' is an alternate spelling for `['. Insert whitespace "
8473 "between `<' and `::'");
8474 if (!flag_permissive)
8479 inform ("(if you use `-fpermissive' G++ will accept your code)");
8486 /* Look for the `<' that starts the template-argument-list. */
8487 if (!cp_parser_require (parser, CPP_LESS, "`<'"))
8489 pop_deferring_access_checks ();
8490 return error_mark_node;
8492 /* Parse the arguments. */
8493 arguments = cp_parser_enclosed_template_argument_list (parser);
8496 /* Build a representation of the specialization. */
8497 if (TREE_CODE (template) == IDENTIFIER_NODE)
8498 template_id = build_min_nt (TEMPLATE_ID_EXPR, template, arguments);
8499 else if (DECL_CLASS_TEMPLATE_P (template)
8500 || DECL_TEMPLATE_TEMPLATE_PARM_P (template))
8502 = finish_template_type (template, arguments,
8503 cp_lexer_next_token_is (parser->lexer,
8507 /* If it's not a class-template or a template-template, it should be
8508 a function-template. */
8509 my_friendly_assert ((DECL_FUNCTION_TEMPLATE_P (template)
8510 || TREE_CODE (template) == OVERLOAD
8511 || BASELINK_P (template)),
8514 template_id = lookup_template_function (template, arguments);
8517 /* Retrieve any deferred checks. Do not pop this access checks yet
8518 so the memory will not be reclaimed during token replacing below. */
8519 access_check = get_deferred_access_checks ();
8521 /* If parsing tentatively, replace the sequence of tokens that makes
8522 up the template-id with a CPP_TEMPLATE_ID token. That way,
8523 should we re-parse the token stream, we will not have to repeat
8524 the effort required to do the parse, nor will we issue duplicate
8525 error messages about problems during instantiation of the
8527 if (start_of_id >= 0)
8531 /* Find the token that corresponds to the start of the
8533 token = cp_lexer_advance_token (parser->lexer,
8534 parser->lexer->first_token,
8537 /* Reset the contents of the START_OF_ID token. */
8538 token->type = CPP_TEMPLATE_ID;
8539 token->value = build_tree_list (access_check, template_id);
8540 token->keyword = RID_MAX;
8541 /* Purge all subsequent tokens. */
8542 cp_lexer_purge_tokens_after (parser->lexer, token);
8545 pop_deferring_access_checks ();
8549 /* Parse a template-name.
8554 The standard should actually say:
8558 operator-function-id
8560 A defect report has been filed about this issue.
8562 A conversion-function-id cannot be a template name because they cannot
8563 be part of a template-id. In fact, looking at this code:
8567 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
8568 It is impossible to call a templated conversion-function-id with an
8569 explicit argument list, since the only allowed template parameter is
8570 the type to which it is converting.
8572 If TEMPLATE_KEYWORD_P is true, then we have just seen the
8573 `template' keyword, in a construction like:
8577 In that case `f' is taken to be a template-name, even though there
8578 is no way of knowing for sure.
8580 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
8581 name refers to a set of overloaded functions, at least one of which
8582 is a template, or an IDENTIFIER_NODE with the name of the template,
8583 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
8584 names are looked up inside uninstantiated templates. */
8587 cp_parser_template_name (cp_parser* parser,
8588 bool template_keyword_p,
8589 bool check_dependency_p,
8590 bool is_declaration,
8591 bool *is_identifier)
8597 /* If the next token is `operator', then we have either an
8598 operator-function-id or a conversion-function-id. */
8599 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_OPERATOR))
8601 /* We don't know whether we're looking at an
8602 operator-function-id or a conversion-function-id. */
8603 cp_parser_parse_tentatively (parser);
8604 /* Try an operator-function-id. */
8605 identifier = cp_parser_operator_function_id (parser);
8606 /* If that didn't work, try a conversion-function-id. */
8607 if (!cp_parser_parse_definitely (parser))
8609 cp_parser_error (parser, "expected template-name");
8610 return error_mark_node;
8613 /* Look for the identifier. */
8615 identifier = cp_parser_identifier (parser);
8617 /* If we didn't find an identifier, we don't have a template-id. */
8618 if (identifier == error_mark_node)
8619 return error_mark_node;
8621 /* If the name immediately followed the `template' keyword, then it
8622 is a template-name. However, if the next token is not `<', then
8623 we do not treat it as a template-name, since it is not being used
8624 as part of a template-id. This enables us to handle constructs
8627 template <typename T> struct S { S(); };
8628 template <typename T> S<T>::S();
8630 correctly. We would treat `S' as a template -- if it were `S<T>'
8631 -- but we do not if there is no `<'. */
8633 if (processing_template_decl
8634 && cp_parser_nth_token_starts_template_argument_list_p (parser, 1))
8636 /* In a declaration, in a dependent context, we pretend that the
8637 "template" keyword was present in order to improve error
8638 recovery. For example, given:
8640 template <typename T> void f(T::X<int>);
8642 we want to treat "X<int>" as a template-id. */
8644 && !template_keyword_p
8645 && parser->scope && TYPE_P (parser->scope)
8646 && dependent_type_p (parser->scope)
8647 /* Do not do this for dtors (or ctors), since they never
8648 need the template keyword before their name. */
8649 && !constructor_name_p (identifier, parser->scope))
8653 /* Explain what went wrong. */
8654 error ("non-template `%D' used as template", identifier);
8655 inform ("use `%T::template %D' to indicate that it is a template",
8656 parser->scope, identifier);
8657 /* If parsing tentatively, find the location of the "<"
8659 if (cp_parser_parsing_tentatively (parser)
8660 && !cp_parser_committed_to_tentative_parse (parser))
8662 cp_parser_simulate_error (parser);
8663 token = cp_lexer_peek_token (parser->lexer);
8664 token = cp_lexer_prev_token (parser->lexer, token);
8665 start = cp_lexer_token_difference (parser->lexer,
8666 parser->lexer->first_token,
8671 /* Parse the template arguments so that we can issue error
8672 messages about them. */
8673 cp_lexer_consume_token (parser->lexer);
8674 cp_parser_enclosed_template_argument_list (parser);
8675 /* Skip tokens until we find a good place from which to
8676 continue parsing. */
8677 cp_parser_skip_to_closing_parenthesis (parser,
8678 /*recovering=*/true,
8680 /*consume_paren=*/false);
8681 /* If parsing tentatively, permanently remove the
8682 template argument list. That will prevent duplicate
8683 error messages from being issued about the missing
8684 "template" keyword. */
8687 token = cp_lexer_advance_token (parser->lexer,
8688 parser->lexer->first_token,
8690 cp_lexer_purge_tokens_after (parser->lexer, token);
8693 *is_identifier = true;
8697 /* If the "template" keyword is present, then there is generally
8698 no point in doing name-lookup, so we just return IDENTIFIER.
8699 But, if the qualifying scope is non-dependent then we can
8700 (and must) do name-lookup normally. */
8701 if (template_keyword_p
8703 || (TYPE_P (parser->scope)
8704 && dependent_type_p (parser->scope))))
8708 /* Look up the name. */
8709 decl = cp_parser_lookup_name (parser, identifier,
8711 /*is_template=*/false,
8712 /*is_namespace=*/false,
8713 check_dependency_p);
8714 decl = maybe_get_template_decl_from_type_decl (decl);
8716 /* If DECL is a template, then the name was a template-name. */
8717 if (TREE_CODE (decl) == TEMPLATE_DECL)
8721 /* The standard does not explicitly indicate whether a name that
8722 names a set of overloaded declarations, some of which are
8723 templates, is a template-name. However, such a name should
8724 be a template-name; otherwise, there is no way to form a
8725 template-id for the overloaded templates. */
8726 fns = BASELINK_P (decl) ? BASELINK_FUNCTIONS (decl) : decl;
8727 if (TREE_CODE (fns) == OVERLOAD)
8731 for (fn = fns; fn; fn = OVL_NEXT (fn))
8732 if (TREE_CODE (OVL_CURRENT (fn)) == TEMPLATE_DECL)
8737 /* Otherwise, the name does not name a template. */
8738 cp_parser_error (parser, "expected template-name");
8739 return error_mark_node;
8743 /* If DECL is dependent, and refers to a function, then just return
8744 its name; we will look it up again during template instantiation. */
8745 if (DECL_FUNCTION_TEMPLATE_P (decl) || !DECL_P (decl))
8747 tree scope = CP_DECL_CONTEXT (get_first_fn (decl));
8748 if (TYPE_P (scope) && dependent_type_p (scope))
8755 /* Parse a template-argument-list.
8757 template-argument-list:
8759 template-argument-list , template-argument
8761 Returns a TREE_VEC containing the arguments. */
8764 cp_parser_template_argument_list (cp_parser* parser)
8766 tree fixed_args[10];
8767 unsigned n_args = 0;
8768 unsigned alloced = 10;
8769 tree *arg_ary = fixed_args;
8771 bool saved_in_template_argument_list_p;
8773 saved_in_template_argument_list_p = parser->in_template_argument_list_p;
8774 parser->in_template_argument_list_p = true;
8780 /* Consume the comma. */
8781 cp_lexer_consume_token (parser->lexer);
8783 /* Parse the template-argument. */
8784 argument = cp_parser_template_argument (parser);
8785 if (n_args == alloced)
8789 if (arg_ary == fixed_args)
8791 arg_ary = xmalloc (sizeof (tree) * alloced);
8792 memcpy (arg_ary, fixed_args, sizeof (tree) * n_args);
8795 arg_ary = xrealloc (arg_ary, sizeof (tree) * alloced);
8797 arg_ary[n_args++] = argument;
8799 while (cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
8801 vec = make_tree_vec (n_args);
8804 TREE_VEC_ELT (vec, n_args) = arg_ary[n_args];
8806 if (arg_ary != fixed_args)
8808 parser->in_template_argument_list_p = saved_in_template_argument_list_p;
8812 /* Parse a template-argument.
8815 assignment-expression
8819 The representation is that of an assignment-expression, type-id, or
8820 id-expression -- except that the qualified id-expression is
8821 evaluated, so that the value returned is either a DECL or an
8824 Although the standard says "assignment-expression", it forbids
8825 throw-expressions or assignments in the template argument.
8826 Therefore, we use "conditional-expression" instead. */
8829 cp_parser_template_argument (cp_parser* parser)
8834 bool maybe_type_id = false;
8837 tree qualifying_class;
8839 /* There's really no way to know what we're looking at, so we just
8840 try each alternative in order.
8844 In a template-argument, an ambiguity between a type-id and an
8845 expression is resolved to a type-id, regardless of the form of
8846 the corresponding template-parameter.
8848 Therefore, we try a type-id first. */
8849 cp_parser_parse_tentatively (parser);
8850 argument = cp_parser_type_id (parser);
8851 /* If there was no error parsing the type-id but the next token is a '>>',
8852 we probably found a typo for '> >'. But there are type-id which are
8853 also valid expressions. For instance:
8855 struct X { int operator >> (int); };
8856 template <int V> struct Foo {};
8859 Here 'X()' is a valid type-id of a function type, but the user just
8860 wanted to write the expression "X() >> 5". Thus, we remember that we
8861 found a valid type-id, but we still try to parse the argument as an
8862 expression to see what happens. */
8863 if (!cp_parser_error_occurred (parser)
8864 && cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
8866 maybe_type_id = true;
8867 cp_parser_abort_tentative_parse (parser);
8871 /* If the next token isn't a `,' or a `>', then this argument wasn't
8872 really finished. This means that the argument is not a valid
8874 if (!cp_parser_next_token_ends_template_argument_p (parser))
8875 cp_parser_error (parser, "expected template-argument");
8876 /* If that worked, we're done. */
8877 if (cp_parser_parse_definitely (parser))
8880 /* We're still not sure what the argument will be. */
8881 cp_parser_parse_tentatively (parser);
8882 /* Try a template. */
8883 argument = cp_parser_id_expression (parser,
8884 /*template_keyword_p=*/false,
8885 /*check_dependency_p=*/true,
8887 /*declarator_p=*/false);
8888 /* If the next token isn't a `,' or a `>', then this argument wasn't
8890 if (!cp_parser_next_token_ends_template_argument_p (parser))
8891 cp_parser_error (parser, "expected template-argument");
8892 if (!cp_parser_error_occurred (parser))
8894 /* Figure out what is being referred to. If the id-expression
8895 was for a class template specialization, then we will have a
8896 TYPE_DECL at this point. There is no need to do name lookup
8897 at this point in that case. */
8898 if (TREE_CODE (argument) != TYPE_DECL)
8899 argument = cp_parser_lookup_name (parser, argument,
8901 /*is_template=*/template_p,
8902 /*is_namespace=*/false,
8903 /*check_dependency=*/true);
8904 if (TREE_CODE (argument) != TEMPLATE_DECL
8905 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
8906 cp_parser_error (parser, "expected template-name");
8908 if (cp_parser_parse_definitely (parser))
8910 /* It must be a non-type argument. There permitted cases are given
8911 in [temp.arg.nontype]:
8913 -- an integral constant-expression of integral or enumeration
8916 -- the name of a non-type template-parameter; or
8918 -- the name of an object or function with external linkage...
8920 -- the address of an object or function with external linkage...
8922 -- a pointer to member... */
8923 /* Look for a non-type template parameter. */
8924 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
8926 cp_parser_parse_tentatively (parser);
8927 argument = cp_parser_primary_expression (parser,
8930 if (TREE_CODE (argument) != TEMPLATE_PARM_INDEX
8931 || !cp_parser_next_token_ends_template_argument_p (parser))
8932 cp_parser_simulate_error (parser);
8933 if (cp_parser_parse_definitely (parser))
8936 /* If the next token is "&", the argument must be the address of an
8937 object or function with external linkage. */
8938 address_p = cp_lexer_next_token_is (parser->lexer, CPP_AND);
8940 cp_lexer_consume_token (parser->lexer);
8941 /* See if we might have an id-expression. */
8942 token = cp_lexer_peek_token (parser->lexer);
8943 if (token->type == CPP_NAME
8944 || token->keyword == RID_OPERATOR
8945 || token->type == CPP_SCOPE
8946 || token->type == CPP_TEMPLATE_ID
8947 || token->type == CPP_NESTED_NAME_SPECIFIER)
8949 cp_parser_parse_tentatively (parser);
8950 argument = cp_parser_primary_expression (parser,
8953 if (cp_parser_error_occurred (parser)
8954 || !cp_parser_next_token_ends_template_argument_p (parser))
8955 cp_parser_abort_tentative_parse (parser);
8958 if (qualifying_class)
8959 argument = finish_qualified_id_expr (qualifying_class,
8963 if (TREE_CODE (argument) == VAR_DECL)
8965 /* A variable without external linkage might still be a
8966 valid constant-expression, so no error is issued here
8967 if the external-linkage check fails. */
8968 if (!DECL_EXTERNAL_LINKAGE_P (argument))
8969 cp_parser_simulate_error (parser);
8971 else if (is_overloaded_fn (argument))
8972 /* All overloaded functions are allowed; if the external
8973 linkage test does not pass, an error will be issued
8977 && (TREE_CODE (argument) == OFFSET_REF
8978 || TREE_CODE (argument) == SCOPE_REF))
8979 /* A pointer-to-member. */
8982 cp_parser_simulate_error (parser);
8984 if (cp_parser_parse_definitely (parser))
8987 argument = build_x_unary_op (ADDR_EXPR, argument);
8992 /* If the argument started with "&", there are no other valid
8993 alternatives at this point. */
8996 cp_parser_error (parser, "invalid non-type template argument");
8997 return error_mark_node;
8999 /* If the argument wasn't successfully parsed as a type-id followed
9000 by '>>', the argument can only be a constant expression now.
9001 Otherwise, we try parsing the constant-expression tentatively,
9002 because the argument could really be a type-id. */
9004 cp_parser_parse_tentatively (parser);
9005 argument = cp_parser_constant_expression (parser,
9006 /*allow_non_constant_p=*/false,
9007 /*non_constant_p=*/NULL);
9008 argument = fold_non_dependent_expr (argument);
9011 if (!cp_parser_next_token_ends_template_argument_p (parser))
9012 cp_parser_error (parser, "expected template-argument");
9013 if (cp_parser_parse_definitely (parser))
9015 /* We did our best to parse the argument as a non type-id, but that
9016 was the only alternative that matched (albeit with a '>' after
9017 it). We can assume it's just a typo from the user, and a
9018 diagnostic will then be issued. */
9019 return cp_parser_type_id (parser);
9022 /* Parse an explicit-instantiation.
9024 explicit-instantiation:
9025 template declaration
9027 Although the standard says `declaration', what it really means is:
9029 explicit-instantiation:
9030 template decl-specifier-seq [opt] declarator [opt] ;
9032 Things like `template int S<int>::i = 5, int S<double>::j;' are not
9033 supposed to be allowed. A defect report has been filed about this
9038 explicit-instantiation:
9039 storage-class-specifier template
9040 decl-specifier-seq [opt] declarator [opt] ;
9041 function-specifier template
9042 decl-specifier-seq [opt] declarator [opt] ; */
9045 cp_parser_explicit_instantiation (cp_parser* parser)
9047 int declares_class_or_enum;
9048 cp_decl_specifier_seq decl_specifiers;
9049 tree extension_specifier = NULL_TREE;
9051 /* Look for an (optional) storage-class-specifier or
9052 function-specifier. */
9053 if (cp_parser_allow_gnu_extensions_p (parser))
9056 = cp_parser_storage_class_specifier_opt (parser);
9057 if (!extension_specifier)
9059 = cp_parser_function_specifier_opt (parser,
9060 /*decl_specs=*/NULL);
9063 /* Look for the `template' keyword. */
9064 cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'");
9065 /* Let the front end know that we are processing an explicit
9067 begin_explicit_instantiation ();
9068 /* [temp.explicit] says that we are supposed to ignore access
9069 control while processing explicit instantiation directives. */
9070 push_deferring_access_checks (dk_no_check);
9071 /* Parse a decl-specifier-seq. */
9072 cp_parser_decl_specifier_seq (parser,
9073 CP_PARSER_FLAGS_OPTIONAL,
9075 &declares_class_or_enum);
9076 /* If there was exactly one decl-specifier, and it declared a class,
9077 and there's no declarator, then we have an explicit type
9079 if (declares_class_or_enum && cp_parser_declares_only_class_p (parser))
9083 type = check_tag_decl (&decl_specifiers);
9084 /* Turn access control back on for names used during
9085 template instantiation. */
9086 pop_deferring_access_checks ();
9088 do_type_instantiation (type, extension_specifier, /*complain=*/1);
9092 cp_declarator *declarator;
9095 /* Parse the declarator. */
9097 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
9098 /*ctor_dtor_or_conv_p=*/NULL,
9099 /*parenthesized_p=*/NULL);
9100 cp_parser_check_for_definition_in_return_type (declarator,
9101 declares_class_or_enum);
9102 if (declarator != cp_error_declarator)
9104 decl = grokdeclarator (declarator, &decl_specifiers,
9106 /* Turn access control back on for names used during
9107 template instantiation. */
9108 pop_deferring_access_checks ();
9109 /* Do the explicit instantiation. */
9110 do_decl_instantiation (decl, extension_specifier);
9114 pop_deferring_access_checks ();
9115 /* Skip the body of the explicit instantiation. */
9116 cp_parser_skip_to_end_of_statement (parser);
9119 /* We're done with the instantiation. */
9120 end_explicit_instantiation ();
9122 cp_parser_consume_semicolon_at_end_of_statement (parser);
9125 /* Parse an explicit-specialization.
9127 explicit-specialization:
9128 template < > declaration
9130 Although the standard says `declaration', what it really means is:
9132 explicit-specialization:
9133 template <> decl-specifier [opt] init-declarator [opt] ;
9134 template <> function-definition
9135 template <> explicit-specialization
9136 template <> template-declaration */
9139 cp_parser_explicit_specialization (cp_parser* parser)
9141 /* Look for the `template' keyword. */
9142 cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'");
9143 /* Look for the `<'. */
9144 cp_parser_require (parser, CPP_LESS, "`<'");
9145 /* Look for the `>'. */
9146 cp_parser_require (parser, CPP_GREATER, "`>'");
9147 /* We have processed another parameter list. */
9148 ++parser->num_template_parameter_lists;
9149 /* Let the front end know that we are beginning a specialization. */
9150 begin_specialization ();
9152 /* If the next keyword is `template', we need to figure out whether
9153 or not we're looking a template-declaration. */
9154 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
9156 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
9157 && cp_lexer_peek_nth_token (parser->lexer, 3)->type != CPP_GREATER)
9158 cp_parser_template_declaration_after_export (parser,
9159 /*member_p=*/false);
9161 cp_parser_explicit_specialization (parser);
9164 /* Parse the dependent declaration. */
9165 cp_parser_single_declaration (parser,
9169 /* We're done with the specialization. */
9170 end_specialization ();
9171 /* We're done with this parameter list. */
9172 --parser->num_template_parameter_lists;
9175 /* Parse a type-specifier.
9178 simple-type-specifier
9181 elaborated-type-specifier
9189 Returns a representation of the type-specifier. For a
9190 class-specifier, enum-specifier, or elaborated-type-specifier, a
9191 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
9193 If IS_FRIEND is TRUE then this type-specifier is being declared a
9194 `friend'. If IS_DECLARATION is TRUE, then this type-specifier is
9195 appearing in a decl-specifier-seq.
9197 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
9198 class-specifier, enum-specifier, or elaborated-type-specifier, then
9199 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
9200 if a type is declared; 2 if it is defined. Otherwise, it is set to
9203 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
9204 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
9208 cp_parser_type_specifier (cp_parser* parser,
9209 cp_parser_flags flags,
9210 cp_decl_specifier_seq *decl_specs,
9211 bool is_declaration,
9212 int* declares_class_or_enum,
9213 bool* is_cv_qualifier)
9215 tree type_spec = NULL_TREE;
9218 cp_decl_spec ds = ds_last;
9220 /* Assume this type-specifier does not declare a new type. */
9221 if (declares_class_or_enum)
9222 *declares_class_or_enum = 0;
9223 /* And that it does not specify a cv-qualifier. */
9224 if (is_cv_qualifier)
9225 *is_cv_qualifier = false;
9226 /* Peek at the next token. */
9227 token = cp_lexer_peek_token (parser->lexer);
9229 /* If we're looking at a keyword, we can use that to guide the
9230 production we choose. */
9231 keyword = token->keyword;
9234 /* Any of these indicate either a class-specifier, or an
9235 elaborated-type-specifier. */
9240 /* Parse tentatively so that we can back up if we don't find a
9241 class-specifier or enum-specifier. */
9242 cp_parser_parse_tentatively (parser);
9243 /* Look for the class-specifier or enum-specifier. */
9244 if (keyword == RID_ENUM)
9245 type_spec = cp_parser_enum_specifier (parser);
9247 type_spec = cp_parser_class_specifier (parser);
9249 /* If that worked, we're done. */
9250 if (cp_parser_parse_definitely (parser))
9252 if (declares_class_or_enum)
9253 *declares_class_or_enum = 2;
9255 cp_parser_set_decl_spec_type (decl_specs,
9257 /*user_defined_p=*/true);
9264 /* Look for an elaborated-type-specifier. */
9266 = (cp_parser_elaborated_type_specifier
9268 decl_specs && decl_specs->specs[(int) ds_friend],
9270 /* We're declaring a class or enum -- unless we're using
9272 if (declares_class_or_enum && keyword != RID_TYPENAME)
9273 *declares_class_or_enum = 1;
9275 cp_parser_set_decl_spec_type (decl_specs,
9277 /*user_defined_p=*/true);
9282 if (is_cv_qualifier)
9283 *is_cv_qualifier = true;
9288 if (is_cv_qualifier)
9289 *is_cv_qualifier = true;
9294 if (is_cv_qualifier)
9295 *is_cv_qualifier = true;
9299 /* The `__complex__' keyword is a GNU extension. */
9307 /* Handle simple keywords. */
9312 ++decl_specs->specs[(int)ds];
9313 decl_specs->any_specifiers_p = true;
9315 return cp_lexer_consume_token (parser->lexer)->value;
9318 /* If we do not already have a type-specifier, assume we are looking
9319 at a simple-type-specifier. */
9320 type_spec = cp_parser_simple_type_specifier (parser,
9324 /* If we didn't find a type-specifier, and a type-specifier was not
9325 optional in this context, issue an error message. */
9326 if (!type_spec && !(flags & CP_PARSER_FLAGS_OPTIONAL))
9328 cp_parser_error (parser, "expected type specifier");
9329 return error_mark_node;
9335 /* Parse a simple-type-specifier.
9337 simple-type-specifier:
9338 :: [opt] nested-name-specifier [opt] type-name
9339 :: [opt] nested-name-specifier template template-id
9354 simple-type-specifier:
9355 __typeof__ unary-expression
9356 __typeof__ ( type-id )
9358 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
9359 appropriately updated. */
9362 cp_parser_simple_type_specifier (cp_parser* parser,
9363 cp_decl_specifier_seq *decl_specs,
9364 cp_parser_flags flags)
9366 tree type = NULL_TREE;
9369 /* Peek at the next token. */
9370 token = cp_lexer_peek_token (parser->lexer);
9372 /* If we're looking at a keyword, things are easy. */
9373 switch (token->keyword)
9377 decl_specs->explicit_char_p = true;
9378 type = char_type_node;
9381 type = wchar_type_node;
9384 type = boolean_type_node;
9388 ++decl_specs->specs[(int) ds_short];
9389 type = short_integer_type_node;
9393 decl_specs->explicit_int_p = true;
9394 type = integer_type_node;
9398 ++decl_specs->specs[(int) ds_long];
9399 type = long_integer_type_node;
9403 ++decl_specs->specs[(int) ds_signed];
9404 type = integer_type_node;
9408 ++decl_specs->specs[(int) ds_unsigned];
9409 type = unsigned_type_node;
9412 type = float_type_node;
9415 type = double_type_node;
9418 type = void_type_node;
9422 /* Consume the `typeof' token. */
9423 cp_lexer_consume_token (parser->lexer);
9424 /* Parse the operand to `typeof'. */
9425 type = cp_parser_sizeof_operand (parser, RID_TYPEOF);
9426 /* If it is not already a TYPE, take its type. */
9428 type = finish_typeof (type);
9431 cp_parser_set_decl_spec_type (decl_specs, type,
9432 /*user_defined_p=*/true);
9440 /* If the type-specifier was for a built-in type, we're done. */
9445 /* Record the type. */
9447 && (token->keyword != RID_SIGNED
9448 && token->keyword != RID_UNSIGNED
9449 && token->keyword != RID_SHORT
9450 && token->keyword != RID_LONG))
9451 cp_parser_set_decl_spec_type (decl_specs,
9453 /*user_defined=*/false);
9455 decl_specs->any_specifiers_p = true;
9457 /* Consume the token. */
9458 id = cp_lexer_consume_token (parser->lexer)->value;
9460 /* There is no valid C++ program where a non-template type is
9461 followed by a "<". That usually indicates that the user thought
9462 that the type was a template. */
9463 cp_parser_check_for_invalid_template_id (parser, type);
9465 return TYPE_NAME (type);
9468 /* The type-specifier must be a user-defined type. */
9469 if (!(flags & CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES))
9474 /* Don't gobble tokens or issue error messages if this is an
9475 optional type-specifier. */
9476 if (flags & CP_PARSER_FLAGS_OPTIONAL)
9477 cp_parser_parse_tentatively (parser);
9479 /* Look for the optional `::' operator. */
9481 = (cp_parser_global_scope_opt (parser,
9482 /*current_scope_valid_p=*/false)
9484 /* Look for the nested-name specifier. */
9486 = (cp_parser_nested_name_specifier_opt (parser,
9487 /*typename_keyword_p=*/false,
9488 /*check_dependency_p=*/true,
9490 /*is_declaration=*/false)
9492 /* If we have seen a nested-name-specifier, and the next token
9493 is `template', then we are using the template-id production. */
9495 && cp_parser_optional_template_keyword (parser))
9497 /* Look for the template-id. */
9498 type = cp_parser_template_id (parser,
9499 /*template_keyword_p=*/true,
9500 /*check_dependency_p=*/true,
9501 /*is_declaration=*/false);
9502 /* If the template-id did not name a type, we are out of
9504 if (TREE_CODE (type) != TYPE_DECL)
9506 cp_parser_error (parser, "expected template-id for type");
9510 /* Otherwise, look for a type-name. */
9512 type = cp_parser_type_name (parser);
9513 /* Keep track of all name-lookups performed in class scopes. */
9517 && TREE_CODE (type) == TYPE_DECL
9518 && TREE_CODE (DECL_NAME (type)) == IDENTIFIER_NODE)
9519 maybe_note_name_used_in_class (DECL_NAME (type), type);
9520 /* If it didn't work out, we don't have a TYPE. */
9521 if ((flags & CP_PARSER_FLAGS_OPTIONAL)
9522 && !cp_parser_parse_definitely (parser))
9524 if (type && decl_specs)
9525 cp_parser_set_decl_spec_type (decl_specs, type,
9526 /*user_defined=*/true);
9529 /* If we didn't get a type-name, issue an error message. */
9530 if (!type && !(flags & CP_PARSER_FLAGS_OPTIONAL))
9532 cp_parser_error (parser, "expected type-name");
9533 return error_mark_node;
9536 /* There is no valid C++ program where a non-template type is
9537 followed by a "<". That usually indicates that the user thought
9538 that the type was a template. */
9539 if (type && type != error_mark_node)
9540 cp_parser_check_for_invalid_template_id (parser, TREE_TYPE (type));
9545 /* Parse a type-name.
9558 Returns a TYPE_DECL for the the type. */
9561 cp_parser_type_name (cp_parser* parser)
9566 /* We can't know yet whether it is a class-name or not. */
9567 cp_parser_parse_tentatively (parser);
9568 /* Try a class-name. */
9569 type_decl = cp_parser_class_name (parser,
9570 /*typename_keyword_p=*/false,
9571 /*template_keyword_p=*/false,
9573 /*check_dependency_p=*/true,
9574 /*class_head_p=*/false,
9575 /*is_declaration=*/false);
9576 /* If it's not a class-name, keep looking. */
9577 if (!cp_parser_parse_definitely (parser))
9579 /* It must be a typedef-name or an enum-name. */
9580 identifier = cp_parser_identifier (parser);
9581 if (identifier == error_mark_node)
9582 return error_mark_node;
9584 /* Look up the type-name. */
9585 type_decl = cp_parser_lookup_name_simple (parser, identifier);
9586 /* Issue an error if we did not find a type-name. */
9587 if (TREE_CODE (type_decl) != TYPE_DECL)
9589 if (!cp_parser_simulate_error (parser))
9590 cp_parser_name_lookup_error (parser, identifier, type_decl,
9592 type_decl = error_mark_node;
9594 /* Remember that the name was used in the definition of the
9595 current class so that we can check later to see if the
9596 meaning would have been different after the class was
9597 entirely defined. */
9598 else if (type_decl != error_mark_node
9600 maybe_note_name_used_in_class (identifier, type_decl);
9607 /* Parse an elaborated-type-specifier. Note that the grammar given
9608 here incorporates the resolution to DR68.
9610 elaborated-type-specifier:
9611 class-key :: [opt] nested-name-specifier [opt] identifier
9612 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
9613 enum :: [opt] nested-name-specifier [opt] identifier
9614 typename :: [opt] nested-name-specifier identifier
9615 typename :: [opt] nested-name-specifier template [opt]
9620 elaborated-type-specifier:
9621 class-key attributes :: [opt] nested-name-specifier [opt] identifier
9622 class-key attributes :: [opt] nested-name-specifier [opt]
9623 template [opt] template-id
9624 enum attributes :: [opt] nested-name-specifier [opt] identifier
9626 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
9627 declared `friend'. If IS_DECLARATION is TRUE, then this
9628 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
9629 something is being declared.
9631 Returns the TYPE specified. */
9634 cp_parser_elaborated_type_specifier (cp_parser* parser,
9636 bool is_declaration)
9638 enum tag_types tag_type;
9640 tree type = NULL_TREE;
9641 tree attributes = NULL_TREE;
9643 /* See if we're looking at the `enum' keyword. */
9644 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ENUM))
9646 /* Consume the `enum' token. */
9647 cp_lexer_consume_token (parser->lexer);
9648 /* Remember that it's an enumeration type. */
9649 tag_type = enum_type;
9650 /* Parse the attributes. */
9651 attributes = cp_parser_attributes_opt (parser);
9653 /* Or, it might be `typename'. */
9654 else if (cp_lexer_next_token_is_keyword (parser->lexer,
9657 /* Consume the `typename' token. */
9658 cp_lexer_consume_token (parser->lexer);
9659 /* Remember that it's a `typename' type. */
9660 tag_type = typename_type;
9661 /* The `typename' keyword is only allowed in templates. */
9662 if (!processing_template_decl)
9663 pedwarn ("using `typename' outside of template");
9665 /* Otherwise it must be a class-key. */
9668 tag_type = cp_parser_class_key (parser);
9669 if (tag_type == none_type)
9670 return error_mark_node;
9671 /* Parse the attributes. */
9672 attributes = cp_parser_attributes_opt (parser);
9675 /* Look for the `::' operator. */
9676 cp_parser_global_scope_opt (parser,
9677 /*current_scope_valid_p=*/false);
9678 /* Look for the nested-name-specifier. */
9679 if (tag_type == typename_type)
9681 if (cp_parser_nested_name_specifier (parser,
9682 /*typename_keyword_p=*/true,
9683 /*check_dependency_p=*/true,
9687 return error_mark_node;
9690 /* Even though `typename' is not present, the proposed resolution
9691 to Core Issue 180 says that in `class A<T>::B', `B' should be
9692 considered a type-name, even if `A<T>' is dependent. */
9693 cp_parser_nested_name_specifier_opt (parser,
9694 /*typename_keyword_p=*/true,
9695 /*check_dependency_p=*/true,
9698 /* For everything but enumeration types, consider a template-id. */
9699 if (tag_type != enum_type)
9701 bool template_p = false;
9704 /* Allow the `template' keyword. */
9705 template_p = cp_parser_optional_template_keyword (parser);
9706 /* If we didn't see `template', we don't know if there's a
9707 template-id or not. */
9709 cp_parser_parse_tentatively (parser);
9710 /* Parse the template-id. */
9711 decl = cp_parser_template_id (parser, template_p,
9712 /*check_dependency_p=*/true,
9714 /* If we didn't find a template-id, look for an ordinary
9716 if (!template_p && !cp_parser_parse_definitely (parser))
9718 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
9719 in effect, then we must assume that, upon instantiation, the
9720 template will correspond to a class. */
9721 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
9722 && tag_type == typename_type)
9723 type = make_typename_type (parser->scope, decl,
9726 type = TREE_TYPE (decl);
9729 /* For an enumeration type, consider only a plain identifier. */
9732 identifier = cp_parser_identifier (parser);
9734 if (identifier == error_mark_node)
9736 parser->scope = NULL_TREE;
9737 return error_mark_node;
9740 /* For a `typename', we needn't call xref_tag. */
9741 if (tag_type == typename_type)
9742 return cp_parser_make_typename_type (parser, parser->scope,
9744 /* Look up a qualified name in the usual way. */
9749 /* In an elaborated-type-specifier, names are assumed to name
9750 types, so we set IS_TYPE to TRUE when calling
9751 cp_parser_lookup_name. */
9752 decl = cp_parser_lookup_name (parser, identifier,
9754 /*is_template=*/false,
9755 /*is_namespace=*/false,
9756 /*check_dependency=*/true);
9758 /* If we are parsing friend declaration, DECL may be a
9759 TEMPLATE_DECL tree node here. However, we need to check
9760 whether this TEMPLATE_DECL results in valid code. Consider
9761 the following example:
9764 template <class T> class C {};
9767 template <class T> friend class N::C; // #1, valid code
9769 template <class T> class Y {
9770 friend class N::C; // #2, invalid code
9773 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
9774 name lookup of `N::C'. We see that friend declaration must
9775 be template for the code to be valid. Note that
9776 processing_template_decl does not work here since it is
9777 always 1 for the above two cases. */
9779 decl = (cp_parser_maybe_treat_template_as_class
9780 (decl, /*tag_name_p=*/is_friend
9781 && parser->num_template_parameter_lists));
9783 if (TREE_CODE (decl) != TYPE_DECL)
9785 error ("expected type-name");
9786 return error_mark_node;
9789 if (TREE_CODE (TREE_TYPE (decl)) != TYPENAME_TYPE)
9790 check_elaborated_type_specifier
9792 (parser->num_template_parameter_lists
9793 || DECL_SELF_REFERENCE_P (decl)));
9795 type = TREE_TYPE (decl);
9799 /* An elaborated-type-specifier sometimes introduces a new type and
9800 sometimes names an existing type. Normally, the rule is that it
9801 introduces a new type only if there is not an existing type of
9802 the same name already in scope. For example, given:
9805 void f() { struct S s; }
9807 the `struct S' in the body of `f' is the same `struct S' as in
9808 the global scope; the existing definition is used. However, if
9809 there were no global declaration, this would introduce a new
9810 local class named `S'.
9812 An exception to this rule applies to the following code:
9814 namespace N { struct S; }
9816 Here, the elaborated-type-specifier names a new type
9817 unconditionally; even if there is already an `S' in the
9818 containing scope this declaration names a new type.
9819 This exception only applies if the elaborated-type-specifier
9820 forms the complete declaration:
9824 A declaration consisting solely of `class-key identifier ;' is
9825 either a redeclaration of the name in the current scope or a
9826 forward declaration of the identifier as a class name. It
9827 introduces the name into the current scope.
9829 We are in this situation precisely when the next token is a `;'.
9831 An exception to the exception is that a `friend' declaration does
9832 *not* name a new type; i.e., given:
9834 struct S { friend struct T; };
9836 `T' is not a new type in the scope of `S'.
9838 Also, `new struct S' or `sizeof (struct S)' never results in the
9839 definition of a new type; a new type can only be declared in a
9840 declaration context. */
9842 /* Warn about attributes. They are ignored. */
9844 warning ("type attributes are honored only at type definition");
9846 type = xref_tag (tag_type, identifier,
9849 || cp_lexer_next_token_is_not (parser->lexer,
9851 parser->num_template_parameter_lists);
9854 if (tag_type != enum_type)
9855 cp_parser_check_class_key (tag_type, type);
9857 /* A "<" cannot follow an elaborated type specifier. If that
9858 happens, the user was probably trying to form a template-id. */
9859 cp_parser_check_for_invalid_template_id (parser, type);
9864 /* Parse an enum-specifier.
9867 enum identifier [opt] { enumerator-list [opt] }
9869 Returns an ENUM_TYPE representing the enumeration. */
9872 cp_parser_enum_specifier (cp_parser* parser)
9875 tree identifier = NULL_TREE;
9878 /* Look for the `enum' keyword. */
9879 if (!cp_parser_require_keyword (parser, RID_ENUM, "`enum'"))
9880 return error_mark_node;
9881 /* Peek at the next token. */
9882 token = cp_lexer_peek_token (parser->lexer);
9884 /* See if it is an identifier. */
9885 if (token->type == CPP_NAME)
9886 identifier = cp_parser_identifier (parser);
9888 /* Look for the `{'. */
9889 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "`{'"))
9890 return error_mark_node;
9892 /* At this point, we're going ahead with the enum-specifier, even
9893 if some other problem occurs. */
9894 cp_parser_commit_to_tentative_parse (parser);
9896 /* Issue an error message if type-definitions are forbidden here. */
9897 cp_parser_check_type_definition (parser);
9899 /* Create the new type. */
9900 type = start_enum (identifier ? identifier : make_anon_name ());
9902 /* Peek at the next token. */
9903 token = cp_lexer_peek_token (parser->lexer);
9904 /* If it's not a `}', then there are some enumerators. */
9905 if (token->type != CPP_CLOSE_BRACE)
9906 cp_parser_enumerator_list (parser, type);
9907 /* Look for the `}'. */
9908 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
9910 /* Finish up the enumeration. */
9916 /* Parse an enumerator-list. The enumerators all have the indicated
9920 enumerator-definition
9921 enumerator-list , enumerator-definition */
9924 cp_parser_enumerator_list (cp_parser* parser, tree type)
9930 /* Parse an enumerator-definition. */
9931 cp_parser_enumerator_definition (parser, type);
9932 /* Peek at the next token. */
9933 token = cp_lexer_peek_token (parser->lexer);
9934 /* If it's not a `,', then we've reached the end of the
9936 if (token->type != CPP_COMMA)
9938 /* Otherwise, consume the `,' and keep going. */
9939 cp_lexer_consume_token (parser->lexer);
9940 /* If the next token is a `}', there is a trailing comma. */
9941 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
9943 if (pedantic && !in_system_header)
9944 pedwarn ("comma at end of enumerator list");
9950 /* Parse an enumerator-definition. The enumerator has the indicated
9953 enumerator-definition:
9955 enumerator = constant-expression
9961 cp_parser_enumerator_definition (cp_parser* parser, tree type)
9967 /* Look for the identifier. */
9968 identifier = cp_parser_identifier (parser);
9969 if (identifier == error_mark_node)
9972 /* Peek at the next token. */
9973 token = cp_lexer_peek_token (parser->lexer);
9974 /* If it's an `=', then there's an explicit value. */
9975 if (token->type == CPP_EQ)
9977 /* Consume the `=' token. */
9978 cp_lexer_consume_token (parser->lexer);
9979 /* Parse the value. */
9980 value = cp_parser_constant_expression (parser,
9981 /*allow_non_constant_p=*/false,
9987 /* Create the enumerator. */
9988 build_enumerator (identifier, value, type);
9991 /* Parse a namespace-name.
9994 original-namespace-name
9997 Returns the NAMESPACE_DECL for the namespace. */
10000 cp_parser_namespace_name (cp_parser* parser)
10003 tree namespace_decl;
10005 /* Get the name of the namespace. */
10006 identifier = cp_parser_identifier (parser);
10007 if (identifier == error_mark_node)
10008 return error_mark_node;
10010 /* Look up the identifier in the currently active scope. Look only
10011 for namespaces, due to:
10013 [basic.lookup.udir]
10015 When looking up a namespace-name in a using-directive or alias
10016 definition, only namespace names are considered.
10020 [basic.lookup.qual]
10022 During the lookup of a name preceding the :: scope resolution
10023 operator, object, function, and enumerator names are ignored.
10025 (Note that cp_parser_class_or_namespace_name only calls this
10026 function if the token after the name is the scope resolution
10028 namespace_decl = cp_parser_lookup_name (parser, identifier,
10030 /*is_template=*/false,
10031 /*is_namespace=*/true,
10032 /*check_dependency=*/true);
10033 /* If it's not a namespace, issue an error. */
10034 if (namespace_decl == error_mark_node
10035 || TREE_CODE (namespace_decl) != NAMESPACE_DECL)
10037 cp_parser_error (parser, "expected namespace-name");
10038 namespace_decl = error_mark_node;
10041 return namespace_decl;
10044 /* Parse a namespace-definition.
10046 namespace-definition:
10047 named-namespace-definition
10048 unnamed-namespace-definition
10050 named-namespace-definition:
10051 original-namespace-definition
10052 extension-namespace-definition
10054 original-namespace-definition:
10055 namespace identifier { namespace-body }
10057 extension-namespace-definition:
10058 namespace original-namespace-name { namespace-body }
10060 unnamed-namespace-definition:
10061 namespace { namespace-body } */
10064 cp_parser_namespace_definition (cp_parser* parser)
10068 /* Look for the `namespace' keyword. */
10069 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10071 /* Get the name of the namespace. We do not attempt to distinguish
10072 between an original-namespace-definition and an
10073 extension-namespace-definition at this point. The semantic
10074 analysis routines are responsible for that. */
10075 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
10076 identifier = cp_parser_identifier (parser);
10078 identifier = NULL_TREE;
10080 /* Look for the `{' to start the namespace. */
10081 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
10082 /* Start the namespace. */
10083 push_namespace (identifier);
10084 /* Parse the body of the namespace. */
10085 cp_parser_namespace_body (parser);
10086 /* Finish the namespace. */
10088 /* Look for the final `}'. */
10089 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
10092 /* Parse a namespace-body.
10095 declaration-seq [opt] */
10098 cp_parser_namespace_body (cp_parser* parser)
10100 cp_parser_declaration_seq_opt (parser);
10103 /* Parse a namespace-alias-definition.
10105 namespace-alias-definition:
10106 namespace identifier = qualified-namespace-specifier ; */
10109 cp_parser_namespace_alias_definition (cp_parser* parser)
10112 tree namespace_specifier;
10114 /* Look for the `namespace' keyword. */
10115 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10116 /* Look for the identifier. */
10117 identifier = cp_parser_identifier (parser);
10118 if (identifier == error_mark_node)
10120 /* Look for the `=' token. */
10121 cp_parser_require (parser, CPP_EQ, "`='");
10122 /* Look for the qualified-namespace-specifier. */
10123 namespace_specifier
10124 = cp_parser_qualified_namespace_specifier (parser);
10125 /* Look for the `;' token. */
10126 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10128 /* Register the alias in the symbol table. */
10129 do_namespace_alias (identifier, namespace_specifier);
10132 /* Parse a qualified-namespace-specifier.
10134 qualified-namespace-specifier:
10135 :: [opt] nested-name-specifier [opt] namespace-name
10137 Returns a NAMESPACE_DECL corresponding to the specified
10141 cp_parser_qualified_namespace_specifier (cp_parser* parser)
10143 /* Look for the optional `::'. */
10144 cp_parser_global_scope_opt (parser,
10145 /*current_scope_valid_p=*/false);
10147 /* Look for the optional nested-name-specifier. */
10148 cp_parser_nested_name_specifier_opt (parser,
10149 /*typename_keyword_p=*/false,
10150 /*check_dependency_p=*/true,
10152 /*is_declaration=*/true);
10154 return cp_parser_namespace_name (parser);
10157 /* Parse a using-declaration.
10160 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
10161 using :: unqualified-id ; */
10164 cp_parser_using_declaration (cp_parser* parser)
10167 bool typename_p = false;
10168 bool global_scope_p;
10174 /* Look for the `using' keyword. */
10175 cp_parser_require_keyword (parser, RID_USING, "`using'");
10177 /* Peek at the next token. */
10178 token = cp_lexer_peek_token (parser->lexer);
10179 /* See if it's `typename'. */
10180 if (token->keyword == RID_TYPENAME)
10182 /* Remember that we've seen it. */
10184 /* Consume the `typename' token. */
10185 cp_lexer_consume_token (parser->lexer);
10188 /* Look for the optional global scope qualification. */
10190 = (cp_parser_global_scope_opt (parser,
10191 /*current_scope_valid_p=*/false)
10194 /* If we saw `typename', or didn't see `::', then there must be a
10195 nested-name-specifier present. */
10196 if (typename_p || !global_scope_p)
10197 qscope = cp_parser_nested_name_specifier (parser, typename_p,
10198 /*check_dependency_p=*/true,
10200 /*is_declaration=*/true);
10201 /* Otherwise, we could be in either of the two productions. In that
10202 case, treat the nested-name-specifier as optional. */
10204 qscope = cp_parser_nested_name_specifier_opt (parser,
10205 /*typename_keyword_p=*/false,
10206 /*check_dependency_p=*/true,
10208 /*is_declaration=*/true);
10210 qscope = global_namespace;
10212 /* Parse the unqualified-id. */
10213 identifier = cp_parser_unqualified_id (parser,
10214 /*template_keyword_p=*/false,
10215 /*check_dependency_p=*/true,
10216 /*declarator_p=*/true);
10218 /* The function we call to handle a using-declaration is different
10219 depending on what scope we are in. */
10220 if (identifier == error_mark_node)
10222 else if (TREE_CODE (identifier) != IDENTIFIER_NODE
10223 && TREE_CODE (identifier) != BIT_NOT_EXPR)
10224 /* [namespace.udecl]
10226 A using declaration shall not name a template-id. */
10227 error ("a template-id may not appear in a using-declaration");
10230 scope = current_scope ();
10231 if (scope && TYPE_P (scope))
10233 /* Create the USING_DECL. */
10234 decl = do_class_using_decl (build_nt (SCOPE_REF,
10237 /* Add it to the list of members in this class. */
10238 finish_member_declaration (decl);
10242 decl = cp_parser_lookup_name_simple (parser, identifier);
10243 if (decl == error_mark_node)
10244 cp_parser_name_lookup_error (parser, identifier, decl, NULL);
10246 do_local_using_decl (decl, qscope, identifier);
10248 do_toplevel_using_decl (decl, qscope, identifier);
10252 /* Look for the final `;'. */
10253 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10256 /* Parse a using-directive.
10259 using namespace :: [opt] nested-name-specifier [opt]
10260 namespace-name ; */
10263 cp_parser_using_directive (cp_parser* parser)
10265 tree namespace_decl;
10268 /* Look for the `using' keyword. */
10269 cp_parser_require_keyword (parser, RID_USING, "`using'");
10270 /* And the `namespace' keyword. */
10271 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10272 /* Look for the optional `::' operator. */
10273 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
10274 /* And the optional nested-name-specifier. */
10275 cp_parser_nested_name_specifier_opt (parser,
10276 /*typename_keyword_p=*/false,
10277 /*check_dependency_p=*/true,
10279 /*is_declaration=*/true);
10280 /* Get the namespace being used. */
10281 namespace_decl = cp_parser_namespace_name (parser);
10282 /* And any specified attributes. */
10283 attribs = cp_parser_attributes_opt (parser);
10284 /* Update the symbol table. */
10285 parse_using_directive (namespace_decl, attribs);
10286 /* Look for the final `;'. */
10287 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10290 /* Parse an asm-definition.
10293 asm ( string-literal ) ;
10298 asm volatile [opt] ( string-literal ) ;
10299 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
10300 asm volatile [opt] ( string-literal : asm-operand-list [opt]
10301 : asm-operand-list [opt] ) ;
10302 asm volatile [opt] ( string-literal : asm-operand-list [opt]
10303 : asm-operand-list [opt]
10304 : asm-operand-list [opt] ) ; */
10307 cp_parser_asm_definition (cp_parser* parser)
10311 tree outputs = NULL_TREE;
10312 tree inputs = NULL_TREE;
10313 tree clobbers = NULL_TREE;
10315 bool volatile_p = false;
10316 bool extended_p = false;
10318 /* Look for the `asm' keyword. */
10319 cp_parser_require_keyword (parser, RID_ASM, "`asm'");
10320 /* See if the next token is `volatile'. */
10321 if (cp_parser_allow_gnu_extensions_p (parser)
10322 && cp_lexer_next_token_is_keyword (parser->lexer, RID_VOLATILE))
10324 /* Remember that we saw the `volatile' keyword. */
10326 /* Consume the token. */
10327 cp_lexer_consume_token (parser->lexer);
10329 /* Look for the opening `('. */
10330 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
10331 /* Look for the string. */
10332 c_lex_string_translate = 0;
10333 token = cp_parser_require (parser, CPP_STRING, "asm body");
10336 string = token->value;
10337 /* If we're allowing GNU extensions, check for the extended assembly
10338 syntax. Unfortunately, the `:' tokens need not be separated by
10339 a space in C, and so, for compatibility, we tolerate that here
10340 too. Doing that means that we have to treat the `::' operator as
10342 if (cp_parser_allow_gnu_extensions_p (parser)
10343 && at_function_scope_p ()
10344 && (cp_lexer_next_token_is (parser->lexer, CPP_COLON)
10345 || cp_lexer_next_token_is (parser->lexer, CPP_SCOPE)))
10347 bool inputs_p = false;
10348 bool clobbers_p = false;
10350 /* The extended syntax was used. */
10353 /* Look for outputs. */
10354 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
10356 /* Consume the `:'. */
10357 cp_lexer_consume_token (parser->lexer);
10358 /* Parse the output-operands. */
10359 if (cp_lexer_next_token_is_not (parser->lexer,
10361 && cp_lexer_next_token_is_not (parser->lexer,
10363 && cp_lexer_next_token_is_not (parser->lexer,
10365 outputs = cp_parser_asm_operand_list (parser);
10367 /* If the next token is `::', there are no outputs, and the
10368 next token is the beginning of the inputs. */
10369 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
10370 /* The inputs are coming next. */
10373 /* Look for inputs. */
10375 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
10377 /* Consume the `:' or `::'. */
10378 cp_lexer_consume_token (parser->lexer);
10379 /* Parse the output-operands. */
10380 if (cp_lexer_next_token_is_not (parser->lexer,
10382 && cp_lexer_next_token_is_not (parser->lexer,
10384 inputs = cp_parser_asm_operand_list (parser);
10386 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
10387 /* The clobbers are coming next. */
10390 /* Look for clobbers. */
10392 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
10394 /* Consume the `:' or `::'. */
10395 cp_lexer_consume_token (parser->lexer);
10396 /* Parse the clobbers. */
10397 if (cp_lexer_next_token_is_not (parser->lexer,
10399 clobbers = cp_parser_asm_clobber_list (parser);
10402 /* Look for the closing `)'. */
10403 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
10404 cp_parser_skip_to_closing_parenthesis (parser, true, false,
10405 /*consume_paren=*/true);
10406 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10408 /* Create the ASM_EXPR. */
10409 if (at_function_scope_p ())
10411 asm_stmt = finish_asm_stmt (volatile_p, string, outputs,
10413 /* If the extended syntax was not used, mark the ASM_EXPR. */
10415 ASM_INPUT_P (asm_stmt) = 1;
10418 assemble_asm (string);
10421 c_lex_string_translate = 1;
10424 /* Declarators [gram.dcl.decl] */
10426 /* Parse an init-declarator.
10429 declarator initializer [opt]
10434 declarator asm-specification [opt] attributes [opt] initializer [opt]
10436 function-definition:
10437 decl-specifier-seq [opt] declarator ctor-initializer [opt]
10439 decl-specifier-seq [opt] declarator function-try-block
10443 function-definition:
10444 __extension__ function-definition
10446 The DECL_SPECIFIERS and PREFIX_ATTRIBUTES apply to this declarator.
10447 Returns a representation of the entity declared. If MEMBER_P is TRUE,
10448 then this declarator appears in a class scope. The new DECL created
10449 by this declarator is returned.
10451 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
10452 for a function-definition here as well. If the declarator is a
10453 declarator for a function-definition, *FUNCTION_DEFINITION_P will
10454 be TRUE upon return. By that point, the function-definition will
10455 have been completely parsed.
10457 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
10461 cp_parser_init_declarator (cp_parser* parser,
10462 cp_decl_specifier_seq *decl_specifiers,
10463 bool function_definition_allowed_p,
10465 int declares_class_or_enum,
10466 bool* function_definition_p)
10469 cp_declarator *declarator;
10470 tree prefix_attributes;
10472 tree asm_specification;
10474 tree decl = NULL_TREE;
10476 bool is_initialized;
10477 bool is_parenthesized_init;
10478 bool is_non_constant_init;
10479 int ctor_dtor_or_conv_p;
10481 bool pop_p = false;
10483 /* Gather the attributes that were provided with the
10484 decl-specifiers. */
10485 prefix_attributes = decl_specifiers->attributes;
10487 /* Assume that this is not the declarator for a function
10489 if (function_definition_p)
10490 *function_definition_p = false;
10492 /* Defer access checks while parsing the declarator; we cannot know
10493 what names are accessible until we know what is being
10495 resume_deferring_access_checks ();
10497 /* Parse the declarator. */
10499 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
10500 &ctor_dtor_or_conv_p,
10501 /*parenthesized_p=*/NULL);
10502 /* Gather up the deferred checks. */
10503 stop_deferring_access_checks ();
10505 /* If the DECLARATOR was erroneous, there's no need to go
10507 if (declarator == cp_error_declarator)
10508 return error_mark_node;
10510 cp_parser_check_for_definition_in_return_type (declarator,
10511 declares_class_or_enum);
10513 /* Figure out what scope the entity declared by the DECLARATOR is
10514 located in. `grokdeclarator' sometimes changes the scope, so
10515 we compute it now. */
10516 scope = get_scope_of_declarator (declarator);
10518 /* If we're allowing GNU extensions, look for an asm-specification
10520 if (cp_parser_allow_gnu_extensions_p (parser))
10522 /* Look for an asm-specification. */
10523 asm_specification = cp_parser_asm_specification_opt (parser);
10524 /* And attributes. */
10525 attributes = cp_parser_attributes_opt (parser);
10529 asm_specification = NULL_TREE;
10530 attributes = NULL_TREE;
10533 /* Peek at the next token. */
10534 token = cp_lexer_peek_token (parser->lexer);
10535 /* Check to see if the token indicates the start of a
10536 function-definition. */
10537 if (cp_parser_token_starts_function_definition_p (token))
10539 if (!function_definition_allowed_p)
10541 /* If a function-definition should not appear here, issue an
10543 cp_parser_error (parser,
10544 "a function-definition is not allowed here");
10545 return error_mark_node;
10549 /* Neither attributes nor an asm-specification are allowed
10550 on a function-definition. */
10551 if (asm_specification)
10552 error ("an asm-specification is not allowed on a function-definition");
10554 error ("attributes are not allowed on a function-definition");
10555 /* This is a function-definition. */
10556 *function_definition_p = true;
10558 /* Parse the function definition. */
10560 decl = cp_parser_save_member_function_body (parser,
10563 prefix_attributes);
10566 = (cp_parser_function_definition_from_specifiers_and_declarator
10567 (parser, decl_specifiers, prefix_attributes, declarator));
10575 Only in function declarations for constructors, destructors, and
10576 type conversions can the decl-specifier-seq be omitted.
10578 We explicitly postpone this check past the point where we handle
10579 function-definitions because we tolerate function-definitions
10580 that are missing their return types in some modes. */
10581 if (!decl_specifiers->any_specifiers_p && ctor_dtor_or_conv_p <= 0)
10583 cp_parser_error (parser,
10584 "expected constructor, destructor, or type conversion");
10585 return error_mark_node;
10588 /* An `=' or an `(' indicates an initializer. */
10589 is_initialized = (token->type == CPP_EQ
10590 || token->type == CPP_OPEN_PAREN);
10591 /* If the init-declarator isn't initialized and isn't followed by a
10592 `,' or `;', it's not a valid init-declarator. */
10593 if (!is_initialized
10594 && token->type != CPP_COMMA
10595 && token->type != CPP_SEMICOLON)
10597 cp_parser_error (parser, "expected init-declarator");
10598 return error_mark_node;
10601 /* Because start_decl has side-effects, we should only call it if we
10602 know we're going ahead. By this point, we know that we cannot
10603 possibly be looking at any other construct. */
10604 cp_parser_commit_to_tentative_parse (parser);
10606 /* If the decl specifiers were bad, issue an error now that we're
10607 sure this was intended to be a declarator. Then continue
10608 declaring the variable(s), as int, to try to cut down on further
10610 if (decl_specifiers->any_specifiers_p
10611 && decl_specifiers->type == error_mark_node)
10613 cp_parser_error (parser, "invalid type in declaration");
10614 decl_specifiers->type = integer_type_node;
10617 /* Check to see whether or not this declaration is a friend. */
10618 friend_p = cp_parser_friend_p (decl_specifiers);
10620 /* Check that the number of template-parameter-lists is OK. */
10621 if (!cp_parser_check_declarator_template_parameters (parser, declarator))
10622 return error_mark_node;
10624 /* Enter the newly declared entry in the symbol table. If we're
10625 processing a declaration in a class-specifier, we wait until
10626 after processing the initializer. */
10629 if (parser->in_unbraced_linkage_specification_p)
10631 decl_specifiers->storage_class = sc_extern;
10632 have_extern_spec = false;
10634 decl = start_decl (declarator, decl_specifiers,
10635 is_initialized, attributes, prefix_attributes,
10639 /* Enter the SCOPE. That way unqualified names appearing in the
10640 initializer will be looked up in SCOPE. */
10641 pop_p = push_scope (scope);
10643 /* Perform deferred access control checks, now that we know in which
10644 SCOPE the declared entity resides. */
10645 if (!member_p && decl)
10647 tree saved_current_function_decl = NULL_TREE;
10649 /* If the entity being declared is a function, pretend that we
10650 are in its scope. If it is a `friend', it may have access to
10651 things that would not otherwise be accessible. */
10652 if (TREE_CODE (decl) == FUNCTION_DECL)
10654 saved_current_function_decl = current_function_decl;
10655 current_function_decl = decl;
10658 /* Perform the access control checks for the declarator and the
10659 the decl-specifiers. */
10660 perform_deferred_access_checks ();
10662 /* Restore the saved value. */
10663 if (TREE_CODE (decl) == FUNCTION_DECL)
10664 current_function_decl = saved_current_function_decl;
10667 /* Parse the initializer. */
10668 if (is_initialized)
10669 initializer = cp_parser_initializer (parser,
10670 &is_parenthesized_init,
10671 &is_non_constant_init);
10674 initializer = NULL_TREE;
10675 is_parenthesized_init = false;
10676 is_non_constant_init = true;
10679 /* The old parser allows attributes to appear after a parenthesized
10680 initializer. Mark Mitchell proposed removing this functionality
10681 on the GCC mailing lists on 2002-08-13. This parser accepts the
10682 attributes -- but ignores them. */
10683 if (cp_parser_allow_gnu_extensions_p (parser) && is_parenthesized_init)
10684 if (cp_parser_attributes_opt (parser))
10685 warning ("attributes after parenthesized initializer ignored");
10687 /* For an in-class declaration, use `grokfield' to create the
10693 decl = grokfield (declarator, decl_specifiers,
10694 initializer, /*asmspec=*/NULL_TREE,
10695 /*attributes=*/NULL_TREE);
10696 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
10697 cp_parser_save_default_args (parser, decl);
10700 /* Finish processing the declaration. But, skip friend
10702 if (!friend_p && decl && decl != error_mark_node)
10704 cp_finish_decl (decl,
10707 /* If the initializer is in parentheses, then this is
10708 a direct-initialization, which means that an
10709 `explicit' constructor is OK. Otherwise, an
10710 `explicit' constructor cannot be used. */
10711 ((is_parenthesized_init || !is_initialized)
10712 ? 0 : LOOKUP_ONLYCONVERTING));
10714 pop_scope (DECL_CONTEXT (decl));
10717 /* Remember whether or not variables were initialized by
10718 constant-expressions. */
10719 if (decl && TREE_CODE (decl) == VAR_DECL
10720 && is_initialized && !is_non_constant_init)
10721 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
10726 /* Parse a declarator.
10730 ptr-operator declarator
10732 abstract-declarator:
10733 ptr-operator abstract-declarator [opt]
10734 direct-abstract-declarator
10739 attributes [opt] direct-declarator
10740 attributes [opt] ptr-operator declarator
10742 abstract-declarator:
10743 attributes [opt] ptr-operator abstract-declarator [opt]
10744 attributes [opt] direct-abstract-declarator
10746 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
10747 detect constructor, destructor or conversion operators. It is set
10748 to -1 if the declarator is a name, and +1 if it is a
10749 function. Otherwise it is set to zero. Usually you just want to
10750 test for >0, but internally the negative value is used.
10752 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
10753 a decl-specifier-seq unless it declares a constructor, destructor,
10754 or conversion. It might seem that we could check this condition in
10755 semantic analysis, rather than parsing, but that makes it difficult
10756 to handle something like `f()'. We want to notice that there are
10757 no decl-specifiers, and therefore realize that this is an
10758 expression, not a declaration.)
10760 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
10761 the declarator is a direct-declarator of the form "(...)". */
10763 static cp_declarator *
10764 cp_parser_declarator (cp_parser* parser,
10765 cp_parser_declarator_kind dcl_kind,
10766 int* ctor_dtor_or_conv_p,
10767 bool* parenthesized_p)
10770 cp_declarator *declarator;
10771 enum tree_code code;
10772 cp_cv_quals cv_quals;
10774 tree attributes = NULL_TREE;
10776 /* Assume this is not a constructor, destructor, or type-conversion
10778 if (ctor_dtor_or_conv_p)
10779 *ctor_dtor_or_conv_p = 0;
10781 if (cp_parser_allow_gnu_extensions_p (parser))
10782 attributes = cp_parser_attributes_opt (parser);
10784 /* Peek at the next token. */
10785 token = cp_lexer_peek_token (parser->lexer);
10787 /* Check for the ptr-operator production. */
10788 cp_parser_parse_tentatively (parser);
10789 /* Parse the ptr-operator. */
10790 code = cp_parser_ptr_operator (parser,
10793 /* If that worked, then we have a ptr-operator. */
10794 if (cp_parser_parse_definitely (parser))
10796 /* If a ptr-operator was found, then this declarator was not
10798 if (parenthesized_p)
10799 *parenthesized_p = true;
10800 /* The dependent declarator is optional if we are parsing an
10801 abstract-declarator. */
10802 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED)
10803 cp_parser_parse_tentatively (parser);
10805 /* Parse the dependent declarator. */
10806 declarator = cp_parser_declarator (parser, dcl_kind,
10807 /*ctor_dtor_or_conv_p=*/NULL,
10808 /*parenthesized_p=*/NULL);
10810 /* If we are parsing an abstract-declarator, we must handle the
10811 case where the dependent declarator is absent. */
10812 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED
10813 && !cp_parser_parse_definitely (parser))
10816 /* Build the representation of the ptr-operator. */
10818 declarator = make_ptrmem_declarator (cv_quals,
10821 else if (code == INDIRECT_REF)
10822 declarator = make_pointer_declarator (cv_quals, declarator);
10824 declarator = make_reference_declarator (cv_quals, declarator);
10826 /* Everything else is a direct-declarator. */
10829 if (parenthesized_p)
10830 *parenthesized_p = cp_lexer_next_token_is (parser->lexer,
10832 declarator = cp_parser_direct_declarator (parser, dcl_kind,
10833 ctor_dtor_or_conv_p);
10836 if (attributes && declarator != cp_error_declarator)
10837 declarator->attributes = attributes;
10842 /* Parse a direct-declarator or direct-abstract-declarator.
10846 direct-declarator ( parameter-declaration-clause )
10847 cv-qualifier-seq [opt]
10848 exception-specification [opt]
10849 direct-declarator [ constant-expression [opt] ]
10852 direct-abstract-declarator:
10853 direct-abstract-declarator [opt]
10854 ( parameter-declaration-clause )
10855 cv-qualifier-seq [opt]
10856 exception-specification [opt]
10857 direct-abstract-declarator [opt] [ constant-expression [opt] ]
10858 ( abstract-declarator )
10860 Returns a representation of the declarator. DCL_KIND is
10861 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
10862 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
10863 we are parsing a direct-declarator. It is
10864 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
10865 of ambiguity we prefer an abstract declarator, as per
10866 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P is as for
10867 cp_parser_declarator. */
10869 static cp_declarator *
10870 cp_parser_direct_declarator (cp_parser* parser,
10871 cp_parser_declarator_kind dcl_kind,
10872 int* ctor_dtor_or_conv_p)
10875 cp_declarator *declarator = NULL;
10876 tree scope = NULL_TREE;
10877 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
10878 bool saved_in_declarator_p = parser->in_declarator_p;
10880 bool pop_p = false;
10884 /* Peek at the next token. */
10885 token = cp_lexer_peek_token (parser->lexer);
10886 if (token->type == CPP_OPEN_PAREN)
10888 /* This is either a parameter-declaration-clause, or a
10889 parenthesized declarator. When we know we are parsing a
10890 named declarator, it must be a parenthesized declarator
10891 if FIRST is true. For instance, `(int)' is a
10892 parameter-declaration-clause, with an omitted
10893 direct-abstract-declarator. But `((*))', is a
10894 parenthesized abstract declarator. Finally, when T is a
10895 template parameter `(T)' is a
10896 parameter-declaration-clause, and not a parenthesized
10899 We first try and parse a parameter-declaration-clause,
10900 and then try a nested declarator (if FIRST is true).
10902 It is not an error for it not to be a
10903 parameter-declaration-clause, even when FIRST is
10909 The first is the declaration of a function while the
10910 second is a the definition of a variable, including its
10913 Having seen only the parenthesis, we cannot know which of
10914 these two alternatives should be selected. Even more
10915 complex are examples like:
10920 The former is a function-declaration; the latter is a
10921 variable initialization.
10923 Thus again, we try a parameter-declaration-clause, and if
10924 that fails, we back out and return. */
10926 if (!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
10928 cp_parameter_declarator *params;
10929 unsigned saved_num_template_parameter_lists;
10931 cp_parser_parse_tentatively (parser);
10933 /* Consume the `('. */
10934 cp_lexer_consume_token (parser->lexer);
10937 /* If this is going to be an abstract declarator, we're
10938 in a declarator and we can't have default args. */
10939 parser->default_arg_ok_p = false;
10940 parser->in_declarator_p = true;
10943 /* Inside the function parameter list, surrounding
10944 template-parameter-lists do not apply. */
10945 saved_num_template_parameter_lists
10946 = parser->num_template_parameter_lists;
10947 parser->num_template_parameter_lists = 0;
10949 /* Parse the parameter-declaration-clause. */
10950 params = cp_parser_parameter_declaration_clause (parser);
10952 parser->num_template_parameter_lists
10953 = saved_num_template_parameter_lists;
10955 /* If all went well, parse the cv-qualifier-seq and the
10956 exception-specification. */
10957 if (cp_parser_parse_definitely (parser))
10959 cp_cv_quals cv_quals;
10960 tree exception_specification;
10962 if (ctor_dtor_or_conv_p)
10963 *ctor_dtor_or_conv_p = *ctor_dtor_or_conv_p < 0;
10965 /* Consume the `)'. */
10966 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
10968 /* Parse the cv-qualifier-seq. */
10969 cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
10970 /* And the exception-specification. */
10971 exception_specification
10972 = cp_parser_exception_specification_opt (parser);
10974 /* Create the function-declarator. */
10975 declarator = make_call_declarator (declarator,
10978 exception_specification);
10979 /* Any subsequent parameter lists are to do with
10980 return type, so are not those of the declared
10982 parser->default_arg_ok_p = false;
10984 /* Repeat the main loop. */
10989 /* If this is the first, we can try a parenthesized
10993 bool saved_in_type_id_in_expr_p;
10995 parser->default_arg_ok_p = saved_default_arg_ok_p;
10996 parser->in_declarator_p = saved_in_declarator_p;
10998 /* Consume the `('. */
10999 cp_lexer_consume_token (parser->lexer);
11000 /* Parse the nested declarator. */
11001 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
11002 parser->in_type_id_in_expr_p = true;
11004 = cp_parser_declarator (parser, dcl_kind, ctor_dtor_or_conv_p,
11005 /*parenthesized_p=*/NULL);
11006 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
11008 /* Expect a `)'. */
11009 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
11010 declarator = cp_error_declarator;
11011 if (declarator == cp_error_declarator)
11014 goto handle_declarator;
11016 /* Otherwise, we must be done. */
11020 else if ((!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
11021 && token->type == CPP_OPEN_SQUARE)
11023 /* Parse an array-declarator. */
11026 if (ctor_dtor_or_conv_p)
11027 *ctor_dtor_or_conv_p = 0;
11030 parser->default_arg_ok_p = false;
11031 parser->in_declarator_p = true;
11032 /* Consume the `['. */
11033 cp_lexer_consume_token (parser->lexer);
11034 /* Peek at the next token. */
11035 token = cp_lexer_peek_token (parser->lexer);
11036 /* If the next token is `]', then there is no
11037 constant-expression. */
11038 if (token->type != CPP_CLOSE_SQUARE)
11040 bool non_constant_p;
11043 = cp_parser_constant_expression (parser,
11044 /*allow_non_constant=*/true,
11046 if (!non_constant_p)
11047 bounds = fold_non_dependent_expr (bounds);
11050 bounds = NULL_TREE;
11051 /* Look for the closing `]'. */
11052 if (!cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'"))
11054 declarator = cp_error_declarator;
11058 declarator = make_array_declarator (declarator, bounds);
11060 else if (first && dcl_kind != CP_PARSER_DECLARATOR_ABSTRACT)
11064 /* Parse a declarator-id */
11065 if (dcl_kind == CP_PARSER_DECLARATOR_EITHER)
11066 cp_parser_parse_tentatively (parser);
11067 id = cp_parser_declarator_id (parser);
11068 if (dcl_kind == CP_PARSER_DECLARATOR_EITHER)
11070 if (!cp_parser_parse_definitely (parser))
11071 id = error_mark_node;
11072 else if (TREE_CODE (id) != IDENTIFIER_NODE)
11074 cp_parser_error (parser, "expected unqualified-id");
11075 id = error_mark_node;
11079 if (id == error_mark_node)
11081 declarator = cp_error_declarator;
11085 if (TREE_CODE (id) == SCOPE_REF && !current_scope ())
11087 tree scope = TREE_OPERAND (id, 0);
11089 /* In the declaration of a member of a template class
11090 outside of the class itself, the SCOPE will sometimes
11091 be a TYPENAME_TYPE. For example, given:
11093 template <typename T>
11094 int S<T>::R::i = 3;
11096 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
11097 this context, we must resolve S<T>::R to an ordinary
11098 type, rather than a typename type.
11100 The reason we normally avoid resolving TYPENAME_TYPEs
11101 is that a specialization of `S' might render
11102 `S<T>::R' not a type. However, if `S' is
11103 specialized, then this `i' will not be used, so there
11104 is no harm in resolving the types here. */
11105 if (TREE_CODE (scope) == TYPENAME_TYPE)
11109 /* Resolve the TYPENAME_TYPE. */
11110 type = resolve_typename_type (scope,
11111 /*only_current_p=*/false);
11112 /* If that failed, the declarator is invalid. */
11113 if (type == error_mark_node)
11114 error ("`%T::%D' is not a type",
11115 TYPE_CONTEXT (scope),
11116 TYPE_IDENTIFIER (scope));
11117 /* Build a new DECLARATOR. */
11118 id = build_nt (SCOPE_REF, type, TREE_OPERAND (id, 1));
11122 declarator = make_id_declarator (id);
11126 tree unqualified_name;
11128 if (TREE_CODE (id) == SCOPE_REF
11129 && CLASS_TYPE_P (TREE_OPERAND (id, 0)))
11131 class_type = TREE_OPERAND (id, 0);
11132 unqualified_name = TREE_OPERAND (id, 1);
11136 class_type = current_class_type;
11137 unqualified_name = id;
11142 if (TREE_CODE (unqualified_name) == BIT_NOT_EXPR)
11143 declarator->u.id.sfk = sfk_destructor;
11144 else if (IDENTIFIER_TYPENAME_P (unqualified_name))
11145 declarator->u.id.sfk = sfk_conversion;
11146 else if (constructor_name_p (unqualified_name,
11148 || (TREE_CODE (unqualified_name) == TYPE_DECL
11149 && same_type_p (TREE_TYPE (unqualified_name),
11151 declarator->u.id.sfk = sfk_constructor;
11153 if (ctor_dtor_or_conv_p && declarator->u.id.sfk != sfk_none)
11154 *ctor_dtor_or_conv_p = -1;
11155 if (TREE_CODE (id) == SCOPE_REF
11156 && TREE_CODE (unqualified_name) == TYPE_DECL
11157 && CLASSTYPE_USE_TEMPLATE (TREE_TYPE (unqualified_name)))
11159 error ("invalid use of constructor as a template");
11160 inform ("use `%T::%D' instead of `%T::%T' to name the "
11161 "constructor in a qualified name", class_type,
11162 DECL_NAME (TYPE_TI_TEMPLATE (class_type)),
11163 class_type, class_type);
11168 handle_declarator:;
11169 scope = get_scope_of_declarator (declarator);
11171 /* Any names that appear after the declarator-id for a
11172 member are looked up in the containing scope. */
11173 pop_p = push_scope (scope);
11174 parser->in_declarator_p = true;
11175 if ((ctor_dtor_or_conv_p && *ctor_dtor_or_conv_p)
11176 || (declarator && declarator->kind == cdk_id))
11177 /* Default args are only allowed on function
11179 parser->default_arg_ok_p = saved_default_arg_ok_p;
11181 parser->default_arg_ok_p = false;
11190 /* For an abstract declarator, we might wind up with nothing at this
11191 point. That's an error; the declarator is not optional. */
11193 cp_parser_error (parser, "expected declarator");
11195 /* If we entered a scope, we must exit it now. */
11199 parser->default_arg_ok_p = saved_default_arg_ok_p;
11200 parser->in_declarator_p = saved_in_declarator_p;
11205 /* Parse a ptr-operator.
11208 * cv-qualifier-seq [opt]
11210 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
11215 & cv-qualifier-seq [opt]
11217 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
11218 Returns ADDR_EXPR if a reference was used. In the case of a
11219 pointer-to-member, *TYPE is filled in with the TYPE containing the
11220 member. *CV_QUALS is filled in with the cv-qualifier-seq, or
11221 TYPE_UNQUALIFIED, if there are no cv-qualifiers. Returns
11222 ERROR_MARK if an error occurred. */
11224 static enum tree_code
11225 cp_parser_ptr_operator (cp_parser* parser,
11227 cp_cv_quals *cv_quals)
11229 enum tree_code code = ERROR_MARK;
11232 /* Assume that it's not a pointer-to-member. */
11234 /* And that there are no cv-qualifiers. */
11235 *cv_quals = TYPE_UNQUALIFIED;
11237 /* Peek at the next token. */
11238 token = cp_lexer_peek_token (parser->lexer);
11239 /* If it's a `*' or `&' we have a pointer or reference. */
11240 if (token->type == CPP_MULT || token->type == CPP_AND)
11242 /* Remember which ptr-operator we were processing. */
11243 code = (token->type == CPP_AND ? ADDR_EXPR : INDIRECT_REF);
11245 /* Consume the `*' or `&'. */
11246 cp_lexer_consume_token (parser->lexer);
11248 /* A `*' can be followed by a cv-qualifier-seq, and so can a
11249 `&', if we are allowing GNU extensions. (The only qualifier
11250 that can legally appear after `&' is `restrict', but that is
11251 enforced during semantic analysis. */
11252 if (code == INDIRECT_REF
11253 || cp_parser_allow_gnu_extensions_p (parser))
11254 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
11258 /* Try the pointer-to-member case. */
11259 cp_parser_parse_tentatively (parser);
11260 /* Look for the optional `::' operator. */
11261 cp_parser_global_scope_opt (parser,
11262 /*current_scope_valid_p=*/false);
11263 /* Look for the nested-name specifier. */
11264 cp_parser_nested_name_specifier (parser,
11265 /*typename_keyword_p=*/false,
11266 /*check_dependency_p=*/true,
11268 /*is_declaration=*/false);
11269 /* If we found it, and the next token is a `*', then we are
11270 indeed looking at a pointer-to-member operator. */
11271 if (!cp_parser_error_occurred (parser)
11272 && cp_parser_require (parser, CPP_MULT, "`*'"))
11274 /* The type of which the member is a member is given by the
11276 *type = parser->scope;
11277 /* The next name will not be qualified. */
11278 parser->scope = NULL_TREE;
11279 parser->qualifying_scope = NULL_TREE;
11280 parser->object_scope = NULL_TREE;
11281 /* Indicate that the `*' operator was used. */
11282 code = INDIRECT_REF;
11283 /* Look for the optional cv-qualifier-seq. */
11284 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
11286 /* If that didn't work we don't have a ptr-operator. */
11287 if (!cp_parser_parse_definitely (parser))
11288 cp_parser_error (parser, "expected ptr-operator");
11294 /* Parse an (optional) cv-qualifier-seq.
11297 cv-qualifier cv-qualifier-seq [opt]
11308 Returns a bitmask representing the cv-qualifiers. */
11311 cp_parser_cv_qualifier_seq_opt (cp_parser* parser)
11313 cp_cv_quals cv_quals = TYPE_UNQUALIFIED;
11318 cp_cv_quals cv_qualifier;
11320 /* Peek at the next token. */
11321 token = cp_lexer_peek_token (parser->lexer);
11322 /* See if it's a cv-qualifier. */
11323 switch (token->keyword)
11326 cv_qualifier = TYPE_QUAL_CONST;
11330 cv_qualifier = TYPE_QUAL_VOLATILE;
11334 cv_qualifier = TYPE_QUAL_RESTRICT;
11338 cv_qualifier = TYPE_UNQUALIFIED;
11345 if (cv_quals & cv_qualifier)
11347 error ("duplicate cv-qualifier");
11348 cp_lexer_purge_token (parser->lexer);
11352 cp_lexer_consume_token (parser->lexer);
11353 cv_quals |= cv_qualifier;
11360 /* Parse a declarator-id.
11364 :: [opt] nested-name-specifier [opt] type-name
11366 In the `id-expression' case, the value returned is as for
11367 cp_parser_id_expression if the id-expression was an unqualified-id.
11368 If the id-expression was a qualified-id, then a SCOPE_REF is
11369 returned. The first operand is the scope (either a NAMESPACE_DECL
11370 or TREE_TYPE), but the second is still just a representation of an
11374 cp_parser_declarator_id (cp_parser* parser)
11376 tree id_expression;
11378 /* The expression must be an id-expression. Assume that qualified
11379 names are the names of types so that:
11382 int S<T>::R::i = 3;
11384 will work; we must treat `S<T>::R' as the name of a type.
11385 Similarly, assume that qualified names are templates, where
11389 int S<T>::R<T>::i = 3;
11392 id_expression = cp_parser_id_expression (parser,
11393 /*template_keyword_p=*/false,
11394 /*check_dependency_p=*/false,
11395 /*template_p=*/NULL,
11396 /*declarator_p=*/true);
11397 /* If the name was qualified, create a SCOPE_REF to represent
11401 id_expression = build_nt (SCOPE_REF, parser->scope, id_expression);
11402 parser->scope = NULL_TREE;
11405 return id_expression;
11408 /* Parse a type-id.
11411 type-specifier-seq abstract-declarator [opt]
11413 Returns the TYPE specified. */
11416 cp_parser_type_id (cp_parser* parser)
11418 cp_decl_specifier_seq type_specifier_seq;
11419 cp_declarator *abstract_declarator;
11421 /* Parse the type-specifier-seq. */
11422 cp_parser_type_specifier_seq (parser, &type_specifier_seq);
11423 if (type_specifier_seq.type == error_mark_node)
11424 return error_mark_node;
11426 /* There might or might not be an abstract declarator. */
11427 cp_parser_parse_tentatively (parser);
11428 /* Look for the declarator. */
11429 abstract_declarator
11430 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_ABSTRACT, NULL,
11431 /*parenthesized_p=*/NULL);
11432 /* Check to see if there really was a declarator. */
11433 if (!cp_parser_parse_definitely (parser))
11434 abstract_declarator = NULL;
11436 return groktypename (&type_specifier_seq, abstract_declarator);
11439 /* Parse a type-specifier-seq.
11441 type-specifier-seq:
11442 type-specifier type-specifier-seq [opt]
11446 type-specifier-seq:
11447 attributes type-specifier-seq [opt]
11449 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
11452 cp_parser_type_specifier_seq (cp_parser* parser,
11453 cp_decl_specifier_seq *type_specifier_seq)
11455 bool seen_type_specifier = false;
11457 /* Clear the TYPE_SPECIFIER_SEQ. */
11458 clear_decl_specs (type_specifier_seq);
11460 /* Parse the type-specifiers and attributes. */
11463 tree type_specifier;
11465 /* Check for attributes first. */
11466 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
11468 type_specifier_seq->attributes =
11469 chainon (type_specifier_seq->attributes,
11470 cp_parser_attributes_opt (parser));
11474 /* Look for the type-specifier. */
11475 type_specifier = cp_parser_type_specifier (parser,
11476 CP_PARSER_FLAGS_OPTIONAL,
11477 type_specifier_seq,
11478 /*is_declaration=*/false,
11481 /* If the first type-specifier could not be found, this is not a
11482 type-specifier-seq at all. */
11483 if (!seen_type_specifier && !type_specifier)
11485 cp_parser_error (parser, "expected type-specifier");
11486 type_specifier_seq->type = error_mark_node;
11489 /* If subsequent type-specifiers could not be found, the
11490 type-specifier-seq is complete. */
11491 else if (seen_type_specifier && !type_specifier)
11494 seen_type_specifier = true;
11500 /* Parse a parameter-declaration-clause.
11502 parameter-declaration-clause:
11503 parameter-declaration-list [opt] ... [opt]
11504 parameter-declaration-list , ...
11506 Returns a representation for the parameter declarations. A return
11507 value of NULL indicates a parameter-declaration-clause consisting
11508 only of an ellipsis. */
11510 static cp_parameter_declarator *
11511 cp_parser_parameter_declaration_clause (cp_parser* parser)
11513 cp_parameter_declarator *parameters;
11518 /* Peek at the next token. */
11519 token = cp_lexer_peek_token (parser->lexer);
11520 /* Check for trivial parameter-declaration-clauses. */
11521 if (token->type == CPP_ELLIPSIS)
11523 /* Consume the `...' token. */
11524 cp_lexer_consume_token (parser->lexer);
11527 else if (token->type == CPP_CLOSE_PAREN)
11528 /* There are no parameters. */
11530 #ifndef NO_IMPLICIT_EXTERN_C
11531 if (in_system_header && current_class_type == NULL
11532 && current_lang_name == lang_name_c)
11536 return no_parameters;
11538 /* Check for `(void)', too, which is a special case. */
11539 else if (token->keyword == RID_VOID
11540 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
11541 == CPP_CLOSE_PAREN))
11543 /* Consume the `void' token. */
11544 cp_lexer_consume_token (parser->lexer);
11545 /* There are no parameters. */
11546 return no_parameters;
11549 /* Parse the parameter-declaration-list. */
11550 parameters = cp_parser_parameter_declaration_list (parser, &is_error);
11551 /* If a parse error occurred while parsing the
11552 parameter-declaration-list, then the entire
11553 parameter-declaration-clause is erroneous. */
11557 /* Peek at the next token. */
11558 token = cp_lexer_peek_token (parser->lexer);
11559 /* If it's a `,', the clause should terminate with an ellipsis. */
11560 if (token->type == CPP_COMMA)
11562 /* Consume the `,'. */
11563 cp_lexer_consume_token (parser->lexer);
11564 /* Expect an ellipsis. */
11566 = (cp_parser_require (parser, CPP_ELLIPSIS, "`...'") != NULL);
11568 /* It might also be `...' if the optional trailing `,' was
11570 else if (token->type == CPP_ELLIPSIS)
11572 /* Consume the `...' token. */
11573 cp_lexer_consume_token (parser->lexer);
11574 /* And remember that we saw it. */
11578 ellipsis_p = false;
11580 /* Finish the parameter list. */
11581 if (parameters && ellipsis_p)
11582 parameters->ellipsis_p = true;
11587 /* Parse a parameter-declaration-list.
11589 parameter-declaration-list:
11590 parameter-declaration
11591 parameter-declaration-list , parameter-declaration
11593 Returns a representation of the parameter-declaration-list, as for
11594 cp_parser_parameter_declaration_clause. However, the
11595 `void_list_node' is never appended to the list. Upon return,
11596 *IS_ERROR will be true iff an error occurred. */
11598 static cp_parameter_declarator *
11599 cp_parser_parameter_declaration_list (cp_parser* parser, bool *is_error)
11601 cp_parameter_declarator *parameters = NULL;
11602 cp_parameter_declarator **tail = ¶meters;
11604 /* Assume all will go well. */
11607 /* Look for more parameters. */
11610 cp_parameter_declarator *parameter;
11611 bool parenthesized_p;
11612 /* Parse the parameter. */
11614 = cp_parser_parameter_declaration (parser,
11615 /*template_parm_p=*/false,
11618 /* If a parse error occurred parsing the parameter declaration,
11619 then the entire parameter-declaration-list is erroneous. */
11626 /* Add the new parameter to the list. */
11628 tail = ¶meter->next;
11630 /* Peek at the next token. */
11631 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN)
11632 || cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
11633 /* The parameter-declaration-list is complete. */
11635 else if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
11639 /* Peek at the next token. */
11640 token = cp_lexer_peek_nth_token (parser->lexer, 2);
11641 /* If it's an ellipsis, then the list is complete. */
11642 if (token->type == CPP_ELLIPSIS)
11644 /* Otherwise, there must be more parameters. Consume the
11646 cp_lexer_consume_token (parser->lexer);
11647 /* When parsing something like:
11649 int i(float f, double d)
11651 we can tell after seeing the declaration for "f" that we
11652 are not looking at an initialization of a variable "i",
11653 but rather at the declaration of a function "i".
11655 Due to the fact that the parsing of template arguments
11656 (as specified to a template-id) requires backtracking we
11657 cannot use this technique when inside a template argument
11659 if (!parser->in_template_argument_list_p
11660 && !parser->in_type_id_in_expr_p
11661 && cp_parser_parsing_tentatively (parser)
11662 && !cp_parser_committed_to_tentative_parse (parser)
11663 /* However, a parameter-declaration of the form
11664 "foat(f)" (which is a valid declaration of a
11665 parameter "f") can also be interpreted as an
11666 expression (the conversion of "f" to "float"). */
11667 && !parenthesized_p)
11668 cp_parser_commit_to_tentative_parse (parser);
11672 cp_parser_error (parser, "expected `,' or `...'");
11673 if (!cp_parser_parsing_tentatively (parser)
11674 || cp_parser_committed_to_tentative_parse (parser))
11675 cp_parser_skip_to_closing_parenthesis (parser,
11676 /*recovering=*/true,
11677 /*or_comma=*/false,
11678 /*consume_paren=*/false);
11686 /* Parse a parameter declaration.
11688 parameter-declaration:
11689 decl-specifier-seq declarator
11690 decl-specifier-seq declarator = assignment-expression
11691 decl-specifier-seq abstract-declarator [opt]
11692 decl-specifier-seq abstract-declarator [opt] = assignment-expression
11694 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
11695 declares a template parameter. (In that case, a non-nested `>'
11696 token encountered during the parsing of the assignment-expression
11697 is not interpreted as a greater-than operator.)
11699 Returns a representation of the parameter, or NULL if an error
11700 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
11701 true iff the declarator is of the form "(p)". */
11703 static cp_parameter_declarator *
11704 cp_parser_parameter_declaration (cp_parser *parser,
11705 bool template_parm_p,
11706 bool *parenthesized_p)
11708 int declares_class_or_enum;
11709 bool greater_than_is_operator_p;
11710 cp_decl_specifier_seq decl_specifiers;
11711 cp_declarator *declarator;
11712 tree default_argument;
11714 const char *saved_message;
11716 /* In a template parameter, `>' is not an operator.
11720 When parsing a default template-argument for a non-type
11721 template-parameter, the first non-nested `>' is taken as the end
11722 of the template parameter-list rather than a greater-than
11724 greater_than_is_operator_p = !template_parm_p;
11726 /* Type definitions may not appear in parameter types. */
11727 saved_message = parser->type_definition_forbidden_message;
11728 parser->type_definition_forbidden_message
11729 = "types may not be defined in parameter types";
11731 /* Parse the declaration-specifiers. */
11732 cp_parser_decl_specifier_seq (parser,
11733 CP_PARSER_FLAGS_NONE,
11735 &declares_class_or_enum);
11736 /* If an error occurred, there's no reason to attempt to parse the
11737 rest of the declaration. */
11738 if (cp_parser_error_occurred (parser))
11740 parser->type_definition_forbidden_message = saved_message;
11744 /* Peek at the next token. */
11745 token = cp_lexer_peek_token (parser->lexer);
11746 /* If the next token is a `)', `,', `=', `>', or `...', then there
11747 is no declarator. */
11748 if (token->type == CPP_CLOSE_PAREN
11749 || token->type == CPP_COMMA
11750 || token->type == CPP_EQ
11751 || token->type == CPP_ELLIPSIS
11752 || token->type == CPP_GREATER)
11755 if (parenthesized_p)
11756 *parenthesized_p = false;
11758 /* Otherwise, there should be a declarator. */
11761 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
11762 parser->default_arg_ok_p = false;
11764 /* After seeing a decl-specifier-seq, if the next token is not a
11765 "(", there is no possibility that the code is a valid
11766 expression. Therefore, if parsing tentatively, we commit at
11768 if (!parser->in_template_argument_list_p
11769 /* In an expression context, having seen:
11773 we cannot be sure whether we are looking at a
11774 function-type (taking a "char" as a parameter) or a cast
11775 of some object of type "char" to "int". */
11776 && !parser->in_type_id_in_expr_p
11777 && cp_parser_parsing_tentatively (parser)
11778 && !cp_parser_committed_to_tentative_parse (parser)
11779 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
11780 cp_parser_commit_to_tentative_parse (parser);
11781 /* Parse the declarator. */
11782 declarator = cp_parser_declarator (parser,
11783 CP_PARSER_DECLARATOR_EITHER,
11784 /*ctor_dtor_or_conv_p=*/NULL,
11786 parser->default_arg_ok_p = saved_default_arg_ok_p;
11787 /* After the declarator, allow more attributes. */
11788 decl_specifiers.attributes
11789 = chainon (decl_specifiers.attributes,
11790 cp_parser_attributes_opt (parser));
11793 /* The restriction on defining new types applies only to the type
11794 of the parameter, not to the default argument. */
11795 parser->type_definition_forbidden_message = saved_message;
11797 /* If the next token is `=', then process a default argument. */
11798 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
11800 bool saved_greater_than_is_operator_p;
11801 /* Consume the `='. */
11802 cp_lexer_consume_token (parser->lexer);
11804 /* If we are defining a class, then the tokens that make up the
11805 default argument must be saved and processed later. */
11806 if (!template_parm_p && at_class_scope_p ()
11807 && TYPE_BEING_DEFINED (current_class_type))
11809 unsigned depth = 0;
11811 /* Create a DEFAULT_ARG to represented the unparsed default
11813 default_argument = make_node (DEFAULT_ARG);
11814 DEFARG_TOKENS (default_argument) = cp_token_cache_new ();
11816 /* Add tokens until we have processed the entire default
11823 /* Peek at the next token. */
11824 token = cp_lexer_peek_token (parser->lexer);
11825 /* What we do depends on what token we have. */
11826 switch (token->type)
11828 /* In valid code, a default argument must be
11829 immediately followed by a `,' `)', or `...'. */
11831 case CPP_CLOSE_PAREN:
11833 /* If we run into a non-nested `;', `}', or `]',
11834 then the code is invalid -- but the default
11835 argument is certainly over. */
11836 case CPP_SEMICOLON:
11837 case CPP_CLOSE_BRACE:
11838 case CPP_CLOSE_SQUARE:
11841 /* Update DEPTH, if necessary. */
11842 else if (token->type == CPP_CLOSE_PAREN
11843 || token->type == CPP_CLOSE_BRACE
11844 || token->type == CPP_CLOSE_SQUARE)
11848 case CPP_OPEN_PAREN:
11849 case CPP_OPEN_SQUARE:
11850 case CPP_OPEN_BRACE:
11855 /* If we see a non-nested `>', and `>' is not an
11856 operator, then it marks the end of the default
11858 if (!depth && !greater_than_is_operator_p)
11862 /* If we run out of tokens, issue an error message. */
11864 error ("file ends in default argument");
11870 /* In these cases, we should look for template-ids.
11871 For example, if the default argument is
11872 `X<int, double>()', we need to do name lookup to
11873 figure out whether or not `X' is a template; if
11874 so, the `,' does not end the default argument.
11876 That is not yet done. */
11883 /* If we've reached the end, stop. */
11887 /* Add the token to the token block. */
11888 token = cp_lexer_consume_token (parser->lexer);
11889 cp_token_cache_push_token (DEFARG_TOKENS (default_argument),
11893 /* Outside of a class definition, we can just parse the
11894 assignment-expression. */
11897 bool saved_local_variables_forbidden_p;
11899 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
11901 saved_greater_than_is_operator_p
11902 = parser->greater_than_is_operator_p;
11903 parser->greater_than_is_operator_p = greater_than_is_operator_p;
11904 /* Local variable names (and the `this' keyword) may not
11905 appear in a default argument. */
11906 saved_local_variables_forbidden_p
11907 = parser->local_variables_forbidden_p;
11908 parser->local_variables_forbidden_p = true;
11909 /* Parse the assignment-expression. */
11910 default_argument = cp_parser_assignment_expression (parser);
11911 /* Restore saved state. */
11912 parser->greater_than_is_operator_p
11913 = saved_greater_than_is_operator_p;
11914 parser->local_variables_forbidden_p
11915 = saved_local_variables_forbidden_p;
11917 if (!parser->default_arg_ok_p)
11919 if (!flag_pedantic_errors)
11920 warning ("deprecated use of default argument for parameter of non-function");
11923 error ("default arguments are only permitted for function parameters");
11924 default_argument = NULL_TREE;
11929 default_argument = NULL_TREE;
11931 return make_parameter_declarator (&decl_specifiers,
11936 /* Parse a function-body.
11939 compound_statement */
11942 cp_parser_function_body (cp_parser *parser)
11944 cp_parser_compound_statement (parser, NULL, false);
11947 /* Parse a ctor-initializer-opt followed by a function-body. Return
11948 true if a ctor-initializer was present. */
11951 cp_parser_ctor_initializer_opt_and_function_body (cp_parser *parser)
11954 bool ctor_initializer_p;
11956 /* Begin the function body. */
11957 body = begin_function_body ();
11958 /* Parse the optional ctor-initializer. */
11959 ctor_initializer_p = cp_parser_ctor_initializer_opt (parser);
11960 /* Parse the function-body. */
11961 cp_parser_function_body (parser);
11962 /* Finish the function body. */
11963 finish_function_body (body);
11965 return ctor_initializer_p;
11968 /* Parse an initializer.
11971 = initializer-clause
11972 ( expression-list )
11974 Returns a expression representing the initializer. If no
11975 initializer is present, NULL_TREE is returned.
11977 *IS_PARENTHESIZED_INIT is set to TRUE if the `( expression-list )'
11978 production is used, and zero otherwise. *IS_PARENTHESIZED_INIT is
11979 set to FALSE if there is no initializer present. If there is an
11980 initializer, and it is not a constant-expression, *NON_CONSTANT_P
11981 is set to true; otherwise it is set to false. */
11984 cp_parser_initializer (cp_parser* parser, bool* is_parenthesized_init,
11985 bool* non_constant_p)
11990 /* Peek at the next token. */
11991 token = cp_lexer_peek_token (parser->lexer);
11993 /* Let our caller know whether or not this initializer was
11995 *is_parenthesized_init = (token->type == CPP_OPEN_PAREN);
11996 /* Assume that the initializer is constant. */
11997 *non_constant_p = false;
11999 if (token->type == CPP_EQ)
12001 /* Consume the `='. */
12002 cp_lexer_consume_token (parser->lexer);
12003 /* Parse the initializer-clause. */
12004 init = cp_parser_initializer_clause (parser, non_constant_p);
12006 else if (token->type == CPP_OPEN_PAREN)
12007 init = cp_parser_parenthesized_expression_list (parser, false,
12011 /* Anything else is an error. */
12012 cp_parser_error (parser, "expected initializer");
12013 init = error_mark_node;
12019 /* Parse an initializer-clause.
12021 initializer-clause:
12022 assignment-expression
12023 { initializer-list , [opt] }
12026 Returns an expression representing the initializer.
12028 If the `assignment-expression' production is used the value
12029 returned is simply a representation for the expression.
12031 Otherwise, a CONSTRUCTOR is returned. The CONSTRUCTOR_ELTS will be
12032 the elements of the initializer-list (or NULL_TREE, if the last
12033 production is used). The TREE_TYPE for the CONSTRUCTOR will be
12034 NULL_TREE. There is no way to detect whether or not the optional
12035 trailing `,' was provided. NON_CONSTANT_P is as for
12036 cp_parser_initializer. */
12039 cp_parser_initializer_clause (cp_parser* parser, bool* non_constant_p)
12043 /* If it is not a `{', then we are looking at an
12044 assignment-expression. */
12045 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
12048 = cp_parser_constant_expression (parser,
12049 /*allow_non_constant_p=*/true,
12051 if (!*non_constant_p)
12052 initializer = fold_non_dependent_expr (initializer);
12056 /* Consume the `{' token. */
12057 cp_lexer_consume_token (parser->lexer);
12058 /* Create a CONSTRUCTOR to represent the braced-initializer. */
12059 initializer = make_node (CONSTRUCTOR);
12060 /* If it's not a `}', then there is a non-trivial initializer. */
12061 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
12063 /* Parse the initializer list. */
12064 CONSTRUCTOR_ELTS (initializer)
12065 = cp_parser_initializer_list (parser, non_constant_p);
12066 /* A trailing `,' token is allowed. */
12067 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
12068 cp_lexer_consume_token (parser->lexer);
12070 /* Now, there should be a trailing `}'. */
12071 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
12074 return initializer;
12077 /* Parse an initializer-list.
12081 initializer-list , initializer-clause
12086 identifier : initializer-clause
12087 initializer-list, identifier : initializer-clause
12089 Returns a TREE_LIST. The TREE_VALUE of each node is an expression
12090 for the initializer. If the TREE_PURPOSE is non-NULL, it is the
12091 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
12092 as for cp_parser_initializer. */
12095 cp_parser_initializer_list (cp_parser* parser, bool* non_constant_p)
12097 tree initializers = NULL_TREE;
12099 /* Assume all of the expressions are constant. */
12100 *non_constant_p = false;
12102 /* Parse the rest of the list. */
12108 bool clause_non_constant_p;
12110 /* If the next token is an identifier and the following one is a
12111 colon, we are looking at the GNU designated-initializer
12113 if (cp_parser_allow_gnu_extensions_p (parser)
12114 && cp_lexer_next_token_is (parser->lexer, CPP_NAME)
12115 && cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_COLON)
12117 /* Consume the identifier. */
12118 identifier = cp_lexer_consume_token (parser->lexer)->value;
12119 /* Consume the `:'. */
12120 cp_lexer_consume_token (parser->lexer);
12123 identifier = NULL_TREE;
12125 /* Parse the initializer. */
12126 initializer = cp_parser_initializer_clause (parser,
12127 &clause_non_constant_p);
12128 /* If any clause is non-constant, so is the entire initializer. */
12129 if (clause_non_constant_p)
12130 *non_constant_p = true;
12131 /* Add it to the list. */
12132 initializers = tree_cons (identifier, initializer, initializers);
12134 /* If the next token is not a comma, we have reached the end of
12136 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
12139 /* Peek at the next token. */
12140 token = cp_lexer_peek_nth_token (parser->lexer, 2);
12141 /* If the next token is a `}', then we're still done. An
12142 initializer-clause can have a trailing `,' after the
12143 initializer-list and before the closing `}'. */
12144 if (token->type == CPP_CLOSE_BRACE)
12147 /* Consume the `,' token. */
12148 cp_lexer_consume_token (parser->lexer);
12151 /* The initializers were built up in reverse order, so we need to
12152 reverse them now. */
12153 return nreverse (initializers);
12156 /* Classes [gram.class] */
12158 /* Parse a class-name.
12164 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
12165 to indicate that names looked up in dependent types should be
12166 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
12167 keyword has been used to indicate that the name that appears next
12168 is a template. TYPE_P is true iff the next name should be treated
12169 as class-name, even if it is declared to be some other kind of name
12170 as well. If CHECK_DEPENDENCY_P is FALSE, names are looked up in
12171 dependent scopes. If CLASS_HEAD_P is TRUE, this class is the class
12172 being defined in a class-head.
12174 Returns the TYPE_DECL representing the class. */
12177 cp_parser_class_name (cp_parser *parser,
12178 bool typename_keyword_p,
12179 bool template_keyword_p,
12181 bool check_dependency_p,
12183 bool is_declaration)
12190 /* All class-names start with an identifier. */
12191 token = cp_lexer_peek_token (parser->lexer);
12192 if (token->type != CPP_NAME && token->type != CPP_TEMPLATE_ID)
12194 cp_parser_error (parser, "expected class-name");
12195 return error_mark_node;
12198 /* PARSER->SCOPE can be cleared when parsing the template-arguments
12199 to a template-id, so we save it here. */
12200 scope = parser->scope;
12201 if (scope == error_mark_node)
12202 return error_mark_node;
12204 /* Any name names a type if we're following the `typename' keyword
12205 in a qualified name where the enclosing scope is type-dependent. */
12206 typename_p = (typename_keyword_p && scope && TYPE_P (scope)
12207 && dependent_type_p (scope));
12208 /* Handle the common case (an identifier, but not a template-id)
12210 if (token->type == CPP_NAME
12211 && !cp_parser_nth_token_starts_template_argument_list_p (parser, 2))
12215 /* Look for the identifier. */
12216 identifier = cp_parser_identifier (parser);
12217 /* If the next token isn't an identifier, we are certainly not
12218 looking at a class-name. */
12219 if (identifier == error_mark_node)
12220 decl = error_mark_node;
12221 /* If we know this is a type-name, there's no need to look it
12223 else if (typename_p)
12227 /* If the next token is a `::', then the name must be a type
12230 [basic.lookup.qual]
12232 During the lookup for a name preceding the :: scope
12233 resolution operator, object, function, and enumerator
12234 names are ignored. */
12235 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
12237 /* Look up the name. */
12238 decl = cp_parser_lookup_name (parser, identifier,
12240 /*is_template=*/false,
12241 /*is_namespace=*/false,
12242 check_dependency_p);
12247 /* Try a template-id. */
12248 decl = cp_parser_template_id (parser, template_keyword_p,
12249 check_dependency_p,
12251 if (decl == error_mark_node)
12252 return error_mark_node;
12255 decl = cp_parser_maybe_treat_template_as_class (decl, class_head_p);
12257 /* If this is a typename, create a TYPENAME_TYPE. */
12258 if (typename_p && decl != error_mark_node)
12260 decl = make_typename_type (scope, decl, /*complain=*/1);
12261 if (decl != error_mark_node)
12262 decl = TYPE_NAME (decl);
12265 /* Check to see that it is really the name of a class. */
12266 if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
12267 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
12268 && cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
12269 /* Situations like this:
12271 template <typename T> struct A {
12272 typename T::template X<int>::I i;
12275 are problematic. Is `T::template X<int>' a class-name? The
12276 standard does not seem to be definitive, but there is no other
12277 valid interpretation of the following `::'. Therefore, those
12278 names are considered class-names. */
12279 decl = TYPE_NAME (make_typename_type (scope, decl, tf_error));
12280 else if (decl == error_mark_node
12281 || TREE_CODE (decl) != TYPE_DECL
12282 || !IS_AGGR_TYPE (TREE_TYPE (decl)))
12284 cp_parser_error (parser, "expected class-name");
12285 return error_mark_node;
12291 /* Parse a class-specifier.
12294 class-head { member-specification [opt] }
12296 Returns the TREE_TYPE representing the class. */
12299 cp_parser_class_specifier (cp_parser* parser)
12303 tree attributes = NULL_TREE;
12304 int has_trailing_semicolon;
12305 bool nested_name_specifier_p;
12306 unsigned saved_num_template_parameter_lists;
12307 bool pop_p = false;
12308 tree scope = NULL_TREE;
12310 push_deferring_access_checks (dk_no_deferred);
12312 /* Parse the class-head. */
12313 type = cp_parser_class_head (parser,
12314 &nested_name_specifier_p,
12316 /* If the class-head was a semantic disaster, skip the entire body
12320 cp_parser_skip_to_end_of_block_or_statement (parser);
12321 pop_deferring_access_checks ();
12322 return error_mark_node;
12325 /* Look for the `{'. */
12326 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "`{'"))
12328 pop_deferring_access_checks ();
12329 return error_mark_node;
12332 /* Issue an error message if type-definitions are forbidden here. */
12333 cp_parser_check_type_definition (parser);
12334 /* Remember that we are defining one more class. */
12335 ++parser->num_classes_being_defined;
12336 /* Inside the class, surrounding template-parameter-lists do not
12338 saved_num_template_parameter_lists
12339 = parser->num_template_parameter_lists;
12340 parser->num_template_parameter_lists = 0;
12342 /* Start the class. */
12343 if (nested_name_specifier_p)
12345 scope = CP_DECL_CONTEXT (TYPE_MAIN_DECL (type));
12346 pop_p = push_scope (scope);
12348 type = begin_class_definition (type);
12350 if (type == error_mark_node)
12351 /* If the type is erroneous, skip the entire body of the class. */
12352 cp_parser_skip_to_closing_brace (parser);
12354 /* Parse the member-specification. */
12355 cp_parser_member_specification_opt (parser);
12357 /* Look for the trailing `}'. */
12358 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
12359 /* We get better error messages by noticing a common problem: a
12360 missing trailing `;'. */
12361 token = cp_lexer_peek_token (parser->lexer);
12362 has_trailing_semicolon = (token->type == CPP_SEMICOLON);
12363 /* Look for trailing attributes to apply to this class. */
12364 if (cp_parser_allow_gnu_extensions_p (parser))
12366 tree sub_attr = cp_parser_attributes_opt (parser);
12367 attributes = chainon (attributes, sub_attr);
12369 if (type != error_mark_node)
12370 type = finish_struct (type, attributes);
12373 /* If this class is not itself within the scope of another class,
12374 then we need to parse the bodies of all of the queued function
12375 definitions. Note that the queued functions defined in a class
12376 are not always processed immediately following the
12377 class-specifier for that class. Consider:
12380 struct B { void f() { sizeof (A); } };
12383 If `f' were processed before the processing of `A' were
12384 completed, there would be no way to compute the size of `A'.
12385 Note that the nesting we are interested in here is lexical --
12386 not the semantic nesting given by TYPE_CONTEXT. In particular,
12389 struct A { struct B; };
12390 struct A::B { void f() { } };
12392 there is no need to delay the parsing of `A::B::f'. */
12393 if (--parser->num_classes_being_defined == 0)
12400 /* In a first pass, parse default arguments to the functions.
12401 Then, in a second pass, parse the bodies of the functions.
12402 This two-phased approach handles cases like:
12410 class_type = NULL_TREE;
12412 for (TREE_PURPOSE (parser->unparsed_functions_queues)
12413 = nreverse (TREE_PURPOSE (parser->unparsed_functions_queues));
12414 (queue_entry = TREE_PURPOSE (parser->unparsed_functions_queues));
12415 TREE_PURPOSE (parser->unparsed_functions_queues)
12416 = TREE_CHAIN (TREE_PURPOSE (parser->unparsed_functions_queues)))
12418 fn = TREE_VALUE (queue_entry);
12419 /* If there are default arguments that have not yet been processed,
12420 take care of them now. */
12421 if (class_type != TREE_PURPOSE (queue_entry))
12424 pop_scope (class_type);
12425 class_type = TREE_PURPOSE (queue_entry);
12426 pop_p = push_scope (class_type);
12428 /* Make sure that any template parameters are in scope. */
12429 maybe_begin_member_template_processing (fn);
12430 /* Parse the default argument expressions. */
12431 cp_parser_late_parsing_default_args (parser, fn);
12432 /* Remove any template parameters from the symbol table. */
12433 maybe_end_member_template_processing ();
12436 pop_scope (class_type);
12437 /* Now parse the body of the functions. */
12438 for (TREE_VALUE (parser->unparsed_functions_queues)
12439 = nreverse (TREE_VALUE (parser->unparsed_functions_queues));
12440 (queue_entry = TREE_VALUE (parser->unparsed_functions_queues));
12441 TREE_VALUE (parser->unparsed_functions_queues)
12442 = TREE_CHAIN (TREE_VALUE (parser->unparsed_functions_queues)))
12444 /* Figure out which function we need to process. */
12445 fn = TREE_VALUE (queue_entry);
12447 /* A hack to prevent garbage collection. */
12450 /* Parse the function. */
12451 cp_parser_late_parsing_for_member (parser, fn);
12456 /* Put back any saved access checks. */
12457 pop_deferring_access_checks ();
12459 /* Restore the count of active template-parameter-lists. */
12460 parser->num_template_parameter_lists
12461 = saved_num_template_parameter_lists;
12466 /* Parse a class-head.
12469 class-key identifier [opt] base-clause [opt]
12470 class-key nested-name-specifier identifier base-clause [opt]
12471 class-key nested-name-specifier [opt] template-id
12475 class-key attributes identifier [opt] base-clause [opt]
12476 class-key attributes nested-name-specifier identifier base-clause [opt]
12477 class-key attributes nested-name-specifier [opt] template-id
12480 Returns the TYPE of the indicated class. Sets
12481 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
12482 involving a nested-name-specifier was used, and FALSE otherwise.
12484 Returns NULL_TREE if the class-head is syntactically valid, but
12485 semantically invalid in a way that means we should skip the entire
12486 body of the class. */
12489 cp_parser_class_head (cp_parser* parser,
12490 bool* nested_name_specifier_p,
12491 tree *attributes_p)
12493 tree nested_name_specifier;
12494 enum tag_types class_key;
12495 tree id = NULL_TREE;
12496 tree type = NULL_TREE;
12498 bool template_id_p = false;
12499 bool qualified_p = false;
12500 bool invalid_nested_name_p = false;
12501 bool invalid_explicit_specialization_p = false;
12502 bool pop_p = false;
12503 unsigned num_templates;
12506 /* Assume no nested-name-specifier will be present. */
12507 *nested_name_specifier_p = false;
12508 /* Assume no template parameter lists will be used in defining the
12512 /* Look for the class-key. */
12513 class_key = cp_parser_class_key (parser);
12514 if (class_key == none_type)
12515 return error_mark_node;
12517 /* Parse the attributes. */
12518 attributes = cp_parser_attributes_opt (parser);
12520 /* If the next token is `::', that is invalid -- but sometimes
12521 people do try to write:
12525 Handle this gracefully by accepting the extra qualifier, and then
12526 issuing an error about it later if this really is a
12527 class-head. If it turns out just to be an elaborated type
12528 specifier, remain silent. */
12529 if (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false))
12530 qualified_p = true;
12532 push_deferring_access_checks (dk_no_check);
12534 /* Determine the name of the class. Begin by looking for an
12535 optional nested-name-specifier. */
12536 nested_name_specifier
12537 = cp_parser_nested_name_specifier_opt (parser,
12538 /*typename_keyword_p=*/false,
12539 /*check_dependency_p=*/false,
12541 /*is_declaration=*/false);
12542 /* If there was a nested-name-specifier, then there *must* be an
12544 if (nested_name_specifier)
12546 /* Although the grammar says `identifier', it really means
12547 `class-name' or `template-name'. You are only allowed to
12548 define a class that has already been declared with this
12551 The proposed resolution for Core Issue 180 says that whever
12552 you see `class T::X' you should treat `X' as a type-name.
12554 It is OK to define an inaccessible class; for example:
12556 class A { class B; };
12559 We do not know if we will see a class-name, or a
12560 template-name. We look for a class-name first, in case the
12561 class-name is a template-id; if we looked for the
12562 template-name first we would stop after the template-name. */
12563 cp_parser_parse_tentatively (parser);
12564 type = cp_parser_class_name (parser,
12565 /*typename_keyword_p=*/false,
12566 /*template_keyword_p=*/false,
12568 /*check_dependency_p=*/false,
12569 /*class_head_p=*/true,
12570 /*is_declaration=*/false);
12571 /* If that didn't work, ignore the nested-name-specifier. */
12572 if (!cp_parser_parse_definitely (parser))
12574 invalid_nested_name_p = true;
12575 id = cp_parser_identifier (parser);
12576 if (id == error_mark_node)
12579 /* If we could not find a corresponding TYPE, treat this
12580 declaration like an unqualified declaration. */
12581 if (type == error_mark_node)
12582 nested_name_specifier = NULL_TREE;
12583 /* Otherwise, count the number of templates used in TYPE and its
12584 containing scopes. */
12589 for (scope = TREE_TYPE (type);
12590 scope && TREE_CODE (scope) != NAMESPACE_DECL;
12591 scope = (TYPE_P (scope)
12592 ? TYPE_CONTEXT (scope)
12593 : DECL_CONTEXT (scope)))
12595 && CLASS_TYPE_P (scope)
12596 && CLASSTYPE_TEMPLATE_INFO (scope)
12597 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope))
12598 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (scope))
12602 /* Otherwise, the identifier is optional. */
12605 /* We don't know whether what comes next is a template-id,
12606 an identifier, or nothing at all. */
12607 cp_parser_parse_tentatively (parser);
12608 /* Check for a template-id. */
12609 id = cp_parser_template_id (parser,
12610 /*template_keyword_p=*/false,
12611 /*check_dependency_p=*/true,
12612 /*is_declaration=*/true);
12613 /* If that didn't work, it could still be an identifier. */
12614 if (!cp_parser_parse_definitely (parser))
12616 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
12617 id = cp_parser_identifier (parser);
12623 template_id_p = true;
12628 pop_deferring_access_checks ();
12631 cp_parser_check_for_invalid_template_id (parser, id);
12633 /* If it's not a `:' or a `{' then we can't really be looking at a
12634 class-head, since a class-head only appears as part of a
12635 class-specifier. We have to detect this situation before calling
12636 xref_tag, since that has irreversible side-effects. */
12637 if (!cp_parser_next_token_starts_class_definition_p (parser))
12639 cp_parser_error (parser, "expected `{' or `:'");
12640 return error_mark_node;
12643 /* At this point, we're going ahead with the class-specifier, even
12644 if some other problem occurs. */
12645 cp_parser_commit_to_tentative_parse (parser);
12646 /* Issue the error about the overly-qualified name now. */
12648 cp_parser_error (parser,
12649 "global qualification of class name is invalid");
12650 else if (invalid_nested_name_p)
12651 cp_parser_error (parser,
12652 "qualified name does not name a class");
12653 else if (nested_name_specifier)
12656 /* Figure out in what scope the declaration is being placed. */
12657 scope = current_scope ();
12659 scope = current_namespace;
12660 /* If that scope does not contain the scope in which the
12661 class was originally declared, the program is invalid. */
12662 if (scope && !is_ancestor (scope, nested_name_specifier))
12664 error ("declaration of `%D' in `%D' which does not "
12665 "enclose `%D'", type, scope, nested_name_specifier);
12671 A declarator-id shall not be qualified exception of the
12672 definition of a ... nested class outside of its class
12673 ... [or] a the definition or explicit instantiation of a
12674 class member of a namespace outside of its namespace. */
12675 if (scope == nested_name_specifier)
12677 pedwarn ("extra qualification ignored");
12678 nested_name_specifier = NULL_TREE;
12682 /* An explicit-specialization must be preceded by "template <>". If
12683 it is not, try to recover gracefully. */
12684 if (at_namespace_scope_p ()
12685 && parser->num_template_parameter_lists == 0
12688 error ("an explicit specialization must be preceded by 'template <>'");
12689 invalid_explicit_specialization_p = true;
12690 /* Take the same action that would have been taken by
12691 cp_parser_explicit_specialization. */
12692 ++parser->num_template_parameter_lists;
12693 begin_specialization ();
12695 /* There must be no "return" statements between this point and the
12696 end of this function; set "type "to the correct return value and
12697 use "goto done;" to return. */
12698 /* Make sure that the right number of template parameters were
12700 if (!cp_parser_check_template_parameters (parser, num_templates))
12702 /* If something went wrong, there is no point in even trying to
12703 process the class-definition. */
12708 /* Look up the type. */
12711 type = TREE_TYPE (id);
12712 maybe_process_partial_specialization (type);
12714 else if (!nested_name_specifier)
12716 /* If the class was unnamed, create a dummy name. */
12718 id = make_anon_name ();
12719 type = xref_tag (class_key, id, /*globalize=*/false,
12720 parser->num_template_parameter_lists);
12725 bool pop_p = false;
12729 template <typename T> struct S { struct T };
12730 template <typename T> struct S<T>::T { };
12732 we will get a TYPENAME_TYPE when processing the definition of
12733 `S::T'. We need to resolve it to the actual type before we
12734 try to define it. */
12735 if (TREE_CODE (TREE_TYPE (type)) == TYPENAME_TYPE)
12737 class_type = resolve_typename_type (TREE_TYPE (type),
12738 /*only_current_p=*/false);
12739 if (class_type != error_mark_node)
12740 type = TYPE_NAME (class_type);
12743 cp_parser_error (parser, "could not resolve typename type");
12744 type = error_mark_node;
12748 maybe_process_partial_specialization (TREE_TYPE (type));
12749 class_type = current_class_type;
12750 /* Enter the scope indicated by the nested-name-specifier. */
12751 if (nested_name_specifier)
12752 pop_p = push_scope (nested_name_specifier);
12753 /* Get the canonical version of this type. */
12754 type = TYPE_MAIN_DECL (TREE_TYPE (type));
12755 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
12756 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (type)))
12757 type = push_template_decl (type);
12758 type = TREE_TYPE (type);
12759 if (nested_name_specifier)
12761 *nested_name_specifier_p = true;
12763 pop_scope (nested_name_specifier);
12766 /* Indicate whether this class was declared as a `class' or as a
12768 if (TREE_CODE (type) == RECORD_TYPE)
12769 CLASSTYPE_DECLARED_CLASS (type) = (class_key == class_type);
12770 cp_parser_check_class_key (class_key, type);
12772 /* Enter the scope containing the class; the names of base classes
12773 should be looked up in that context. For example, given:
12775 struct A { struct B {}; struct C; };
12776 struct A::C : B {};
12779 if (nested_name_specifier)
12780 pop_p = push_scope (nested_name_specifier);
12784 /* Get the list of base-classes, if there is one. */
12785 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
12786 bases = cp_parser_base_clause (parser);
12788 /* Process the base classes. */
12789 xref_basetypes (type, bases);
12791 /* Leave the scope given by the nested-name-specifier. We will
12792 enter the class scope itself while processing the members. */
12794 pop_scope (nested_name_specifier);
12797 if (invalid_explicit_specialization_p)
12799 end_specialization ();
12800 --parser->num_template_parameter_lists;
12802 *attributes_p = attributes;
12806 /* Parse a class-key.
12813 Returns the kind of class-key specified, or none_type to indicate
12816 static enum tag_types
12817 cp_parser_class_key (cp_parser* parser)
12820 enum tag_types tag_type;
12822 /* Look for the class-key. */
12823 token = cp_parser_require (parser, CPP_KEYWORD, "class-key");
12827 /* Check to see if the TOKEN is a class-key. */
12828 tag_type = cp_parser_token_is_class_key (token);
12830 cp_parser_error (parser, "expected class-key");
12834 /* Parse an (optional) member-specification.
12836 member-specification:
12837 member-declaration member-specification [opt]
12838 access-specifier : member-specification [opt] */
12841 cp_parser_member_specification_opt (cp_parser* parser)
12848 /* Peek at the next token. */
12849 token = cp_lexer_peek_token (parser->lexer);
12850 /* If it's a `}', or EOF then we've seen all the members. */
12851 if (token->type == CPP_CLOSE_BRACE || token->type == CPP_EOF)
12854 /* See if this token is a keyword. */
12855 keyword = token->keyword;
12859 case RID_PROTECTED:
12861 /* Consume the access-specifier. */
12862 cp_lexer_consume_token (parser->lexer);
12863 /* Remember which access-specifier is active. */
12864 current_access_specifier = token->value;
12865 /* Look for the `:'. */
12866 cp_parser_require (parser, CPP_COLON, "`:'");
12870 /* Otherwise, the next construction must be a
12871 member-declaration. */
12872 cp_parser_member_declaration (parser);
12877 /* Parse a member-declaration.
12879 member-declaration:
12880 decl-specifier-seq [opt] member-declarator-list [opt] ;
12881 function-definition ; [opt]
12882 :: [opt] nested-name-specifier template [opt] unqualified-id ;
12884 template-declaration
12886 member-declarator-list:
12888 member-declarator-list , member-declarator
12891 declarator pure-specifier [opt]
12892 declarator constant-initializer [opt]
12893 identifier [opt] : constant-expression
12897 member-declaration:
12898 __extension__ member-declaration
12901 declarator attributes [opt] pure-specifier [opt]
12902 declarator attributes [opt] constant-initializer [opt]
12903 identifier [opt] attributes [opt] : constant-expression */
12906 cp_parser_member_declaration (cp_parser* parser)
12908 cp_decl_specifier_seq decl_specifiers;
12909 tree prefix_attributes;
12911 int declares_class_or_enum;
12914 int saved_pedantic;
12916 /* Check for the `__extension__' keyword. */
12917 if (cp_parser_extension_opt (parser, &saved_pedantic))
12920 cp_parser_member_declaration (parser);
12921 /* Restore the old value of the PEDANTIC flag. */
12922 pedantic = saved_pedantic;
12927 /* Check for a template-declaration. */
12928 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
12930 /* Parse the template-declaration. */
12931 cp_parser_template_declaration (parser, /*member_p=*/true);
12936 /* Check for a using-declaration. */
12937 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_USING))
12939 /* Parse the using-declaration. */
12940 cp_parser_using_declaration (parser);
12945 /* Parse the decl-specifier-seq. */
12946 cp_parser_decl_specifier_seq (parser,
12947 CP_PARSER_FLAGS_OPTIONAL,
12949 &declares_class_or_enum);
12950 prefix_attributes = decl_specifiers.attributes;
12951 decl_specifiers.attributes = NULL_TREE;
12952 /* Check for an invalid type-name. */
12953 if (cp_parser_parse_and_diagnose_invalid_type_name (parser))
12955 /* If there is no declarator, then the decl-specifier-seq should
12957 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
12959 /* If there was no decl-specifier-seq, and the next token is a
12960 `;', then we have something like:
12966 Each member-declaration shall declare at least one member
12967 name of the class. */
12968 if (!decl_specifiers.any_specifiers_p)
12971 pedwarn ("extra semicolon");
12977 /* See if this declaration is a friend. */
12978 friend_p = cp_parser_friend_p (&decl_specifiers);
12979 /* If there were decl-specifiers, check to see if there was
12980 a class-declaration. */
12981 type = check_tag_decl (&decl_specifiers);
12982 /* Nested classes have already been added to the class, but
12983 a `friend' needs to be explicitly registered. */
12986 /* If the `friend' keyword was present, the friend must
12987 be introduced with a class-key. */
12988 if (!declares_class_or_enum)
12989 error ("a class-key must be used when declaring a friend");
12992 template <typename T> struct A {
12993 friend struct A<T>::B;
12996 A<T>::B will be represented by a TYPENAME_TYPE, and
12997 therefore not recognized by check_tag_decl. */
12999 && decl_specifiers.type
13000 && TYPE_P (decl_specifiers.type))
13001 type = decl_specifiers.type;
13002 if (!type || !TYPE_P (type))
13003 error ("friend declaration does not name a class or "
13006 make_friend_class (current_class_type, type,
13007 /*complain=*/true);
13009 /* If there is no TYPE, an error message will already have
13011 else if (!type || type == error_mark_node)
13013 /* An anonymous aggregate has to be handled specially; such
13014 a declaration really declares a data member (with a
13015 particular type), as opposed to a nested class. */
13016 else if (ANON_AGGR_TYPE_P (type))
13018 /* Remove constructors and such from TYPE, now that we
13019 know it is an anonymous aggregate. */
13020 fixup_anonymous_aggr (type);
13021 /* And make the corresponding data member. */
13022 decl = build_decl (FIELD_DECL, NULL_TREE, type);
13023 /* Add it to the class. */
13024 finish_member_declaration (decl);
13027 cp_parser_check_access_in_redeclaration (TYPE_NAME (type));
13032 /* See if these declarations will be friends. */
13033 friend_p = cp_parser_friend_p (&decl_specifiers);
13035 /* Keep going until we hit the `;' at the end of the
13037 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
13039 tree attributes = NULL_TREE;
13040 tree first_attribute;
13042 /* Peek at the next token. */
13043 token = cp_lexer_peek_token (parser->lexer);
13045 /* Check for a bitfield declaration. */
13046 if (token->type == CPP_COLON
13047 || (token->type == CPP_NAME
13048 && cp_lexer_peek_nth_token (parser->lexer, 2)->type
13054 /* Get the name of the bitfield. Note that we cannot just
13055 check TOKEN here because it may have been invalidated by
13056 the call to cp_lexer_peek_nth_token above. */
13057 if (cp_lexer_peek_token (parser->lexer)->type != CPP_COLON)
13058 identifier = cp_parser_identifier (parser);
13060 identifier = NULL_TREE;
13062 /* Consume the `:' token. */
13063 cp_lexer_consume_token (parser->lexer);
13064 /* Get the width of the bitfield. */
13066 = cp_parser_constant_expression (parser,
13067 /*allow_non_constant=*/false,
13070 /* Look for attributes that apply to the bitfield. */
13071 attributes = cp_parser_attributes_opt (parser);
13072 /* Remember which attributes are prefix attributes and
13074 first_attribute = attributes;
13075 /* Combine the attributes. */
13076 attributes = chainon (prefix_attributes, attributes);
13078 /* Create the bitfield declaration. */
13079 decl = grokbitfield (identifier
13080 ? make_id_declarator (identifier)
13084 /* Apply the attributes. */
13085 cplus_decl_attributes (&decl, attributes, /*flags=*/0);
13089 cp_declarator *declarator;
13091 tree asm_specification;
13092 int ctor_dtor_or_conv_p;
13094 /* Parse the declarator. */
13096 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
13097 &ctor_dtor_or_conv_p,
13098 /*parenthesized_p=*/NULL);
13100 /* If something went wrong parsing the declarator, make sure
13101 that we at least consume some tokens. */
13102 if (declarator == cp_error_declarator)
13104 /* Skip to the end of the statement. */
13105 cp_parser_skip_to_end_of_statement (parser);
13106 /* If the next token is not a semicolon, that is
13107 probably because we just skipped over the body of
13108 a function. So, we consume a semicolon if
13109 present, but do not issue an error message if it
13111 if (cp_lexer_next_token_is (parser->lexer,
13113 cp_lexer_consume_token (parser->lexer);
13117 cp_parser_check_for_definition_in_return_type
13118 (declarator, declares_class_or_enum);
13120 /* Look for an asm-specification. */
13121 asm_specification = cp_parser_asm_specification_opt (parser);
13122 /* Look for attributes that apply to the declaration. */
13123 attributes = cp_parser_attributes_opt (parser);
13124 /* Remember which attributes are prefix attributes and
13126 first_attribute = attributes;
13127 /* Combine the attributes. */
13128 attributes = chainon (prefix_attributes, attributes);
13130 /* If it's an `=', then we have a constant-initializer or a
13131 pure-specifier. It is not correct to parse the
13132 initializer before registering the member declaration
13133 since the member declaration should be in scope while
13134 its initializer is processed. However, the rest of the
13135 front end does not yet provide an interface that allows
13136 us to handle this correctly. */
13137 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
13141 A pure-specifier shall be used only in the declaration of
13142 a virtual function.
13144 A member-declarator can contain a constant-initializer
13145 only if it declares a static member of integral or
13148 Therefore, if the DECLARATOR is for a function, we look
13149 for a pure-specifier; otherwise, we look for a
13150 constant-initializer. When we call `grokfield', it will
13151 perform more stringent semantics checks. */
13152 if (declarator->kind == cdk_function)
13153 initializer = cp_parser_pure_specifier (parser);
13155 /* Parse the initializer. */
13156 initializer = cp_parser_constant_initializer (parser);
13158 /* Otherwise, there is no initializer. */
13160 initializer = NULL_TREE;
13162 /* See if we are probably looking at a function
13163 definition. We are certainly not looking at at a
13164 member-declarator. Calling `grokfield' has
13165 side-effects, so we must not do it unless we are sure
13166 that we are looking at a member-declarator. */
13167 if (cp_parser_token_starts_function_definition_p
13168 (cp_lexer_peek_token (parser->lexer)))
13170 /* The grammar does not allow a pure-specifier to be
13171 used when a member function is defined. (It is
13172 possible that this fact is an oversight in the
13173 standard, since a pure function may be defined
13174 outside of the class-specifier. */
13176 error ("pure-specifier on function-definition");
13177 decl = cp_parser_save_member_function_body (parser,
13181 /* If the member was not a friend, declare it here. */
13183 finish_member_declaration (decl);
13184 /* Peek at the next token. */
13185 token = cp_lexer_peek_token (parser->lexer);
13186 /* If the next token is a semicolon, consume it. */
13187 if (token->type == CPP_SEMICOLON)
13188 cp_lexer_consume_token (parser->lexer);
13193 /* Create the declaration. */
13194 decl = grokfield (declarator, &decl_specifiers,
13195 initializer, asm_specification,
13197 /* Any initialization must have been from a
13198 constant-expression. */
13199 if (decl && TREE_CODE (decl) == VAR_DECL && initializer)
13200 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = 1;
13204 /* Reset PREFIX_ATTRIBUTES. */
13205 while (attributes && TREE_CHAIN (attributes) != first_attribute)
13206 attributes = TREE_CHAIN (attributes);
13208 TREE_CHAIN (attributes) = NULL_TREE;
13210 /* If there is any qualification still in effect, clear it
13211 now; we will be starting fresh with the next declarator. */
13212 parser->scope = NULL_TREE;
13213 parser->qualifying_scope = NULL_TREE;
13214 parser->object_scope = NULL_TREE;
13215 /* If it's a `,', then there are more declarators. */
13216 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
13217 cp_lexer_consume_token (parser->lexer);
13218 /* If the next token isn't a `;', then we have a parse error. */
13219 else if (cp_lexer_next_token_is_not (parser->lexer,
13222 cp_parser_error (parser, "expected `;'");
13223 /* Skip tokens until we find a `;'. */
13224 cp_parser_skip_to_end_of_statement (parser);
13231 /* Add DECL to the list of members. */
13233 finish_member_declaration (decl);
13235 if (TREE_CODE (decl) == FUNCTION_DECL)
13236 cp_parser_save_default_args (parser, decl);
13241 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
13244 /* Parse a pure-specifier.
13249 Returns INTEGER_ZERO_NODE if a pure specifier is found.
13250 Otherwise, ERROR_MARK_NODE is returned. */
13253 cp_parser_pure_specifier (cp_parser* parser)
13257 /* Look for the `=' token. */
13258 if (!cp_parser_require (parser, CPP_EQ, "`='"))
13259 return error_mark_node;
13260 /* Look for the `0' token. */
13261 token = cp_parser_require (parser, CPP_NUMBER, "`0'");
13262 /* Unfortunately, this will accept `0L' and `0x00' as well. We need
13263 to get information from the lexer about how the number was
13264 spelled in order to fix this problem. */
13265 if (!token || !integer_zerop (token->value))
13266 return error_mark_node;
13268 return integer_zero_node;
13271 /* Parse a constant-initializer.
13273 constant-initializer:
13274 = constant-expression
13276 Returns a representation of the constant-expression. */
13279 cp_parser_constant_initializer (cp_parser* parser)
13281 /* Look for the `=' token. */
13282 if (!cp_parser_require (parser, CPP_EQ, "`='"))
13283 return error_mark_node;
13285 /* It is invalid to write:
13287 struct S { static const int i = { 7 }; };
13290 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
13292 cp_parser_error (parser,
13293 "a brace-enclosed initializer is not allowed here");
13294 /* Consume the opening brace. */
13295 cp_lexer_consume_token (parser->lexer);
13296 /* Skip the initializer. */
13297 cp_parser_skip_to_closing_brace (parser);
13298 /* Look for the trailing `}'. */
13299 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
13301 return error_mark_node;
13304 return cp_parser_constant_expression (parser,
13305 /*allow_non_constant=*/false,
13309 /* Derived classes [gram.class.derived] */
13311 /* Parse a base-clause.
13314 : base-specifier-list
13316 base-specifier-list:
13318 base-specifier-list , base-specifier
13320 Returns a TREE_LIST representing the base-classes, in the order in
13321 which they were declared. The representation of each node is as
13322 described by cp_parser_base_specifier.
13324 In the case that no bases are specified, this function will return
13325 NULL_TREE, not ERROR_MARK_NODE. */
13328 cp_parser_base_clause (cp_parser* parser)
13330 tree bases = NULL_TREE;
13332 /* Look for the `:' that begins the list. */
13333 cp_parser_require (parser, CPP_COLON, "`:'");
13335 /* Scan the base-specifier-list. */
13341 /* Look for the base-specifier. */
13342 base = cp_parser_base_specifier (parser);
13343 /* Add BASE to the front of the list. */
13344 if (base != error_mark_node)
13346 TREE_CHAIN (base) = bases;
13349 /* Peek at the next token. */
13350 token = cp_lexer_peek_token (parser->lexer);
13351 /* If it's not a comma, then the list is complete. */
13352 if (token->type != CPP_COMMA)
13354 /* Consume the `,'. */
13355 cp_lexer_consume_token (parser->lexer);
13358 /* PARSER->SCOPE may still be non-NULL at this point, if the last
13359 base class had a qualified name. However, the next name that
13360 appears is certainly not qualified. */
13361 parser->scope = NULL_TREE;
13362 parser->qualifying_scope = NULL_TREE;
13363 parser->object_scope = NULL_TREE;
13365 return nreverse (bases);
13368 /* Parse a base-specifier.
13371 :: [opt] nested-name-specifier [opt] class-name
13372 virtual access-specifier [opt] :: [opt] nested-name-specifier
13374 access-specifier virtual [opt] :: [opt] nested-name-specifier
13377 Returns a TREE_LIST. The TREE_PURPOSE will be one of
13378 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
13379 indicate the specifiers provided. The TREE_VALUE will be a TYPE
13380 (or the ERROR_MARK_NODE) indicating the type that was specified. */
13383 cp_parser_base_specifier (cp_parser* parser)
13387 bool virtual_p = false;
13388 bool duplicate_virtual_error_issued_p = false;
13389 bool duplicate_access_error_issued_p = false;
13390 bool class_scope_p, template_p;
13391 tree access = access_default_node;
13394 /* Process the optional `virtual' and `access-specifier'. */
13397 /* Peek at the next token. */
13398 token = cp_lexer_peek_token (parser->lexer);
13399 /* Process `virtual'. */
13400 switch (token->keyword)
13403 /* If `virtual' appears more than once, issue an error. */
13404 if (virtual_p && !duplicate_virtual_error_issued_p)
13406 cp_parser_error (parser,
13407 "`virtual' specified more than once in base-specified");
13408 duplicate_virtual_error_issued_p = true;
13413 /* Consume the `virtual' token. */
13414 cp_lexer_consume_token (parser->lexer);
13419 case RID_PROTECTED:
13421 /* If more than one access specifier appears, issue an
13423 if (access != access_default_node
13424 && !duplicate_access_error_issued_p)
13426 cp_parser_error (parser,
13427 "more than one access specifier in base-specified");
13428 duplicate_access_error_issued_p = true;
13431 access = ridpointers[(int) token->keyword];
13433 /* Consume the access-specifier. */
13434 cp_lexer_consume_token (parser->lexer);
13443 /* It is not uncommon to see programs mechanically, erroneously, use
13444 the 'typename' keyword to denote (dependent) qualified types
13445 as base classes. */
13446 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
13448 if (!processing_template_decl)
13449 error ("keyword `typename' not allowed outside of templates");
13451 error ("keyword `typename' not allowed in this context "
13452 "(the base class is implicitly a type)");
13453 cp_lexer_consume_token (parser->lexer);
13456 /* Look for the optional `::' operator. */
13457 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
13458 /* Look for the nested-name-specifier. The simplest way to
13463 The keyword `typename' is not permitted in a base-specifier or
13464 mem-initializer; in these contexts a qualified name that
13465 depends on a template-parameter is implicitly assumed to be a
13468 is to pretend that we have seen the `typename' keyword at this
13470 cp_parser_nested_name_specifier_opt (parser,
13471 /*typename_keyword_p=*/true,
13472 /*check_dependency_p=*/true,
13474 /*is_declaration=*/true);
13475 /* If the base class is given by a qualified name, assume that names
13476 we see are type names or templates, as appropriate. */
13477 class_scope_p = (parser->scope && TYPE_P (parser->scope));
13478 template_p = class_scope_p && cp_parser_optional_template_keyword (parser);
13480 /* Finally, look for the class-name. */
13481 type = cp_parser_class_name (parser,
13485 /*check_dependency_p=*/true,
13486 /*class_head_p=*/false,
13487 /*is_declaration=*/true);
13489 if (type == error_mark_node)
13490 return error_mark_node;
13492 return finish_base_specifier (TREE_TYPE (type), access, virtual_p);
13495 /* Exception handling [gram.exception] */
13497 /* Parse an (optional) exception-specification.
13499 exception-specification:
13500 throw ( type-id-list [opt] )
13502 Returns a TREE_LIST representing the exception-specification. The
13503 TREE_VALUE of each node is a type. */
13506 cp_parser_exception_specification_opt (cp_parser* parser)
13511 /* Peek at the next token. */
13512 token = cp_lexer_peek_token (parser->lexer);
13513 /* If it's not `throw', then there's no exception-specification. */
13514 if (!cp_parser_is_keyword (token, RID_THROW))
13517 /* Consume the `throw'. */
13518 cp_lexer_consume_token (parser->lexer);
13520 /* Look for the `('. */
13521 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13523 /* Peek at the next token. */
13524 token = cp_lexer_peek_token (parser->lexer);
13525 /* If it's not a `)', then there is a type-id-list. */
13526 if (token->type != CPP_CLOSE_PAREN)
13528 const char *saved_message;
13530 /* Types may not be defined in an exception-specification. */
13531 saved_message = parser->type_definition_forbidden_message;
13532 parser->type_definition_forbidden_message
13533 = "types may not be defined in an exception-specification";
13534 /* Parse the type-id-list. */
13535 type_id_list = cp_parser_type_id_list (parser);
13536 /* Restore the saved message. */
13537 parser->type_definition_forbidden_message = saved_message;
13540 type_id_list = empty_except_spec;
13542 /* Look for the `)'. */
13543 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13545 return type_id_list;
13548 /* Parse an (optional) type-id-list.
13552 type-id-list , type-id
13554 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
13555 in the order that the types were presented. */
13558 cp_parser_type_id_list (cp_parser* parser)
13560 tree types = NULL_TREE;
13567 /* Get the next type-id. */
13568 type = cp_parser_type_id (parser);
13569 /* Add it to the list. */
13570 types = add_exception_specifier (types, type, /*complain=*/1);
13571 /* Peek at the next token. */
13572 token = cp_lexer_peek_token (parser->lexer);
13573 /* If it is not a `,', we are done. */
13574 if (token->type != CPP_COMMA)
13576 /* Consume the `,'. */
13577 cp_lexer_consume_token (parser->lexer);
13580 return nreverse (types);
13583 /* Parse a try-block.
13586 try compound-statement handler-seq */
13589 cp_parser_try_block (cp_parser* parser)
13593 cp_parser_require_keyword (parser, RID_TRY, "`try'");
13594 try_block = begin_try_block ();
13595 cp_parser_compound_statement (parser, NULL, true);
13596 finish_try_block (try_block);
13597 cp_parser_handler_seq (parser);
13598 finish_handler_sequence (try_block);
13603 /* Parse a function-try-block.
13605 function-try-block:
13606 try ctor-initializer [opt] function-body handler-seq */
13609 cp_parser_function_try_block (cp_parser* parser)
13612 bool ctor_initializer_p;
13614 /* Look for the `try' keyword. */
13615 if (!cp_parser_require_keyword (parser, RID_TRY, "`try'"))
13617 /* Let the rest of the front-end know where we are. */
13618 try_block = begin_function_try_block ();
13619 /* Parse the function-body. */
13621 = cp_parser_ctor_initializer_opt_and_function_body (parser);
13622 /* We're done with the `try' part. */
13623 finish_function_try_block (try_block);
13624 /* Parse the handlers. */
13625 cp_parser_handler_seq (parser);
13626 /* We're done with the handlers. */
13627 finish_function_handler_sequence (try_block);
13629 return ctor_initializer_p;
13632 /* Parse a handler-seq.
13635 handler handler-seq [opt] */
13638 cp_parser_handler_seq (cp_parser* parser)
13644 /* Parse the handler. */
13645 cp_parser_handler (parser);
13646 /* Peek at the next token. */
13647 token = cp_lexer_peek_token (parser->lexer);
13648 /* If it's not `catch' then there are no more handlers. */
13649 if (!cp_parser_is_keyword (token, RID_CATCH))
13654 /* Parse a handler.
13657 catch ( exception-declaration ) compound-statement */
13660 cp_parser_handler (cp_parser* parser)
13665 cp_parser_require_keyword (parser, RID_CATCH, "`catch'");
13666 handler = begin_handler ();
13667 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13668 declaration = cp_parser_exception_declaration (parser);
13669 finish_handler_parms (declaration, handler);
13670 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13671 cp_parser_compound_statement (parser, NULL, false);
13672 finish_handler (handler);
13675 /* Parse an exception-declaration.
13677 exception-declaration:
13678 type-specifier-seq declarator
13679 type-specifier-seq abstract-declarator
13683 Returns a VAR_DECL for the declaration, or NULL_TREE if the
13684 ellipsis variant is used. */
13687 cp_parser_exception_declaration (cp_parser* parser)
13690 cp_decl_specifier_seq type_specifiers;
13691 cp_declarator *declarator;
13692 const char *saved_message;
13694 /* If it's an ellipsis, it's easy to handle. */
13695 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
13697 /* Consume the `...' token. */
13698 cp_lexer_consume_token (parser->lexer);
13702 /* Types may not be defined in exception-declarations. */
13703 saved_message = parser->type_definition_forbidden_message;
13704 parser->type_definition_forbidden_message
13705 = "types may not be defined in exception-declarations";
13707 /* Parse the type-specifier-seq. */
13708 cp_parser_type_specifier_seq (parser, &type_specifiers);
13709 /* If it's a `)', then there is no declarator. */
13710 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN))
13713 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_EITHER,
13714 /*ctor_dtor_or_conv_p=*/NULL,
13715 /*parenthesized_p=*/NULL);
13717 /* Restore the saved message. */
13718 parser->type_definition_forbidden_message = saved_message;
13720 if (type_specifiers.any_specifiers_p)
13722 decl = grokdeclarator (declarator, &type_specifiers, CATCHPARM, 1, NULL);
13723 if (decl == NULL_TREE)
13724 error ("invalid catch parameter");
13732 /* Parse a throw-expression.
13735 throw assignment-expression [opt]
13737 Returns a THROW_EXPR representing the throw-expression. */
13740 cp_parser_throw_expression (cp_parser* parser)
13745 cp_parser_require_keyword (parser, RID_THROW, "`throw'");
13746 token = cp_lexer_peek_token (parser->lexer);
13747 /* Figure out whether or not there is an assignment-expression
13748 following the "throw" keyword. */
13749 if (token->type == CPP_COMMA
13750 || token->type == CPP_SEMICOLON
13751 || token->type == CPP_CLOSE_PAREN
13752 || token->type == CPP_CLOSE_SQUARE
13753 || token->type == CPP_CLOSE_BRACE
13754 || token->type == CPP_COLON)
13755 expression = NULL_TREE;
13757 expression = cp_parser_assignment_expression (parser);
13759 return build_throw (expression);
13762 /* GNU Extensions */
13764 /* Parse an (optional) asm-specification.
13767 asm ( string-literal )
13769 If the asm-specification is present, returns a STRING_CST
13770 corresponding to the string-literal. Otherwise, returns
13774 cp_parser_asm_specification_opt (cp_parser* parser)
13777 tree asm_specification;
13779 /* Peek at the next token. */
13780 token = cp_lexer_peek_token (parser->lexer);
13781 /* If the next token isn't the `asm' keyword, then there's no
13782 asm-specification. */
13783 if (!cp_parser_is_keyword (token, RID_ASM))
13786 /* Consume the `asm' token. */
13787 cp_lexer_consume_token (parser->lexer);
13788 /* Look for the `('. */
13789 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13791 /* Look for the string-literal. */
13792 token = cp_parser_require (parser, CPP_STRING, "string-literal");
13794 asm_specification = token->value;
13796 asm_specification = NULL_TREE;
13798 /* Look for the `)'. */
13799 cp_parser_require (parser, CPP_CLOSE_PAREN, "`('");
13801 return asm_specification;
13804 /* Parse an asm-operand-list.
13808 asm-operand-list , asm-operand
13811 string-literal ( expression )
13812 [ string-literal ] string-literal ( expression )
13814 Returns a TREE_LIST representing the operands. The TREE_VALUE of
13815 each node is the expression. The TREE_PURPOSE is itself a
13816 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
13817 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
13818 is a STRING_CST for the string literal before the parenthesis. */
13821 cp_parser_asm_operand_list (cp_parser* parser)
13823 tree asm_operands = NULL_TREE;
13827 tree string_literal;
13832 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
13834 /* Consume the `[' token. */
13835 cp_lexer_consume_token (parser->lexer);
13836 /* Read the operand name. */
13837 name = cp_parser_identifier (parser);
13838 if (name != error_mark_node)
13839 name = build_string (IDENTIFIER_LENGTH (name),
13840 IDENTIFIER_POINTER (name));
13841 /* Look for the closing `]'. */
13842 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
13846 /* Look for the string-literal. */
13847 token = cp_parser_require (parser, CPP_STRING, "string-literal");
13848 string_literal = token ? token->value : error_mark_node;
13849 c_lex_string_translate = 1;
13850 /* Look for the `('. */
13851 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13852 /* Parse the expression. */
13853 expression = cp_parser_expression (parser);
13854 /* Look for the `)'. */
13855 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13856 c_lex_string_translate = 0;
13857 /* Add this operand to the list. */
13858 asm_operands = tree_cons (build_tree_list (name, string_literal),
13861 /* If the next token is not a `,', there are no more
13863 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
13865 /* Consume the `,'. */
13866 cp_lexer_consume_token (parser->lexer);
13869 return nreverse (asm_operands);
13872 /* Parse an asm-clobber-list.
13876 asm-clobber-list , string-literal
13878 Returns a TREE_LIST, indicating the clobbers in the order that they
13879 appeared. The TREE_VALUE of each node is a STRING_CST. */
13882 cp_parser_asm_clobber_list (cp_parser* parser)
13884 tree clobbers = NULL_TREE;
13889 tree string_literal;
13891 /* Look for the string literal. */
13892 token = cp_parser_require (parser, CPP_STRING, "string-literal");
13893 string_literal = token ? token->value : error_mark_node;
13894 /* Add it to the list. */
13895 clobbers = tree_cons (NULL_TREE, string_literal, clobbers);
13896 /* If the next token is not a `,', then the list is
13898 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
13900 /* Consume the `,' token. */
13901 cp_lexer_consume_token (parser->lexer);
13907 /* Parse an (optional) series of attributes.
13910 attributes attribute
13913 __attribute__ (( attribute-list [opt] ))
13915 The return value is as for cp_parser_attribute_list. */
13918 cp_parser_attributes_opt (cp_parser* parser)
13920 tree attributes = NULL_TREE;
13925 tree attribute_list;
13927 /* Peek at the next token. */
13928 token = cp_lexer_peek_token (parser->lexer);
13929 /* If it's not `__attribute__', then we're done. */
13930 if (token->keyword != RID_ATTRIBUTE)
13933 /* Consume the `__attribute__' keyword. */
13934 cp_lexer_consume_token (parser->lexer);
13935 /* Look for the two `(' tokens. */
13936 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13937 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13939 /* Peek at the next token. */
13940 token = cp_lexer_peek_token (parser->lexer);
13941 if (token->type != CPP_CLOSE_PAREN)
13942 /* Parse the attribute-list. */
13943 attribute_list = cp_parser_attribute_list (parser);
13945 /* If the next token is a `)', then there is no attribute
13947 attribute_list = NULL;
13949 /* Look for the two `)' tokens. */
13950 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13951 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13953 /* Add these new attributes to the list. */
13954 attributes = chainon (attributes, attribute_list);
13960 /* Parse an attribute-list.
13964 attribute-list , attribute
13968 identifier ( identifier )
13969 identifier ( identifier , expression-list )
13970 identifier ( expression-list )
13972 Returns a TREE_LIST. Each node corresponds to an attribute. THe
13973 TREE_PURPOSE of each node is the identifier indicating which
13974 attribute is in use. The TREE_VALUE represents the arguments, if
13978 cp_parser_attribute_list (cp_parser* parser)
13980 tree attribute_list = NULL_TREE;
13982 c_lex_string_translate = 0;
13989 /* Look for the identifier. We also allow keywords here; for
13990 example `__attribute__ ((const))' is legal. */
13991 token = cp_lexer_peek_token (parser->lexer);
13992 if (token->type != CPP_NAME
13993 && token->type != CPP_KEYWORD)
13994 return error_mark_node;
13995 /* Consume the token. */
13996 token = cp_lexer_consume_token (parser->lexer);
13998 /* Save away the identifier that indicates which attribute this is. */
13999 identifier = token->value;
14000 attribute = build_tree_list (identifier, NULL_TREE);
14002 /* Peek at the next token. */
14003 token = cp_lexer_peek_token (parser->lexer);
14004 /* If it's an `(', then parse the attribute arguments. */
14005 if (token->type == CPP_OPEN_PAREN)
14009 arguments = (cp_parser_parenthesized_expression_list
14010 (parser, true, /*non_constant_p=*/NULL));
14011 /* Save the identifier and arguments away. */
14012 TREE_VALUE (attribute) = arguments;
14015 /* Add this attribute to the list. */
14016 TREE_CHAIN (attribute) = attribute_list;
14017 attribute_list = attribute;
14019 /* Now, look for more attributes. */
14020 token = cp_lexer_peek_token (parser->lexer);
14021 /* If the next token isn't a `,', we're done. */
14022 if (token->type != CPP_COMMA)
14025 /* Consume the comma and keep going. */
14026 cp_lexer_consume_token (parser->lexer);
14028 c_lex_string_translate = 1;
14030 /* We built up the list in reverse order. */
14031 return nreverse (attribute_list);
14034 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
14035 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
14036 current value of the PEDANTIC flag, regardless of whether or not
14037 the `__extension__' keyword is present. The caller is responsible
14038 for restoring the value of the PEDANTIC flag. */
14041 cp_parser_extension_opt (cp_parser* parser, int* saved_pedantic)
14043 /* Save the old value of the PEDANTIC flag. */
14044 *saved_pedantic = pedantic;
14046 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXTENSION))
14048 /* Consume the `__extension__' token. */
14049 cp_lexer_consume_token (parser->lexer);
14050 /* We're not being pedantic while the `__extension__' keyword is
14060 /* Parse a label declaration.
14063 __label__ label-declarator-seq ;
14065 label-declarator-seq:
14066 identifier , label-declarator-seq
14070 cp_parser_label_declaration (cp_parser* parser)
14072 /* Look for the `__label__' keyword. */
14073 cp_parser_require_keyword (parser, RID_LABEL, "`__label__'");
14079 /* Look for an identifier. */
14080 identifier = cp_parser_identifier (parser);
14081 /* Declare it as a lobel. */
14082 finish_label_decl (identifier);
14083 /* If the next token is a `;', stop. */
14084 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
14086 /* Look for the `,' separating the label declarations. */
14087 cp_parser_require (parser, CPP_COMMA, "`,'");
14090 /* Look for the final `;'. */
14091 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
14094 /* Support Functions */
14096 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
14097 NAME should have one of the representations used for an
14098 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
14099 is returned. If PARSER->SCOPE is a dependent type, then a
14100 SCOPE_REF is returned.
14102 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
14103 returned; the name was already resolved when the TEMPLATE_ID_EXPR
14104 was formed. Abstractly, such entities should not be passed to this
14105 function, because they do not need to be looked up, but it is
14106 simpler to check for this special case here, rather than at the
14109 In cases not explicitly covered above, this function returns a
14110 DECL, OVERLOAD, or baselink representing the result of the lookup.
14111 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
14114 If IS_TYPE is TRUE, bindings that do not refer to types are
14117 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
14120 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
14123 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
14127 cp_parser_lookup_name (cp_parser *parser, tree name,
14128 bool is_type, bool is_template, bool is_namespace,
14129 bool check_dependency)
14132 tree object_type = parser->context->object_type;
14134 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
14135 no longer valid. Note that if we are parsing tentatively, and
14136 the parse fails, OBJECT_TYPE will be automatically restored. */
14137 parser->context->object_type = NULL_TREE;
14139 if (name == error_mark_node)
14140 return error_mark_node;
14142 /* A template-id has already been resolved; there is no lookup to
14144 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
14146 if (BASELINK_P (name))
14148 my_friendly_assert ((TREE_CODE (BASELINK_FUNCTIONS (name))
14149 == TEMPLATE_ID_EXPR),
14154 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
14155 it should already have been checked to make sure that the name
14156 used matches the type being destroyed. */
14157 if (TREE_CODE (name) == BIT_NOT_EXPR)
14161 /* Figure out to which type this destructor applies. */
14163 type = parser->scope;
14164 else if (object_type)
14165 type = object_type;
14167 type = current_class_type;
14168 /* If that's not a class type, there is no destructor. */
14169 if (!type || !CLASS_TYPE_P (type))
14170 return error_mark_node;
14171 if (!CLASSTYPE_DESTRUCTORS (type))
14172 return error_mark_node;
14173 /* If it was a class type, return the destructor. */
14174 return CLASSTYPE_DESTRUCTORS (type);
14177 /* By this point, the NAME should be an ordinary identifier. If
14178 the id-expression was a qualified name, the qualifying scope is
14179 stored in PARSER->SCOPE at this point. */
14180 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE,
14183 /* Perform the lookup. */
14188 if (parser->scope == error_mark_node)
14189 return error_mark_node;
14191 /* If the SCOPE is dependent, the lookup must be deferred until
14192 the template is instantiated -- unless we are explicitly
14193 looking up names in uninstantiated templates. Even then, we
14194 cannot look up the name if the scope is not a class type; it
14195 might, for example, be a template type parameter. */
14196 dependent_p = (TYPE_P (parser->scope)
14197 && !(parser->in_declarator_p
14198 && currently_open_class (parser->scope))
14199 && dependent_type_p (parser->scope));
14200 if ((check_dependency || !CLASS_TYPE_P (parser->scope))
14204 /* The resolution to Core Issue 180 says that `struct A::B'
14205 should be considered a type-name, even if `A' is
14207 decl = TYPE_NAME (make_typename_type (parser->scope,
14210 else if (is_template)
14211 decl = make_unbound_class_template (parser->scope,
14215 decl = build_nt (SCOPE_REF, parser->scope, name);
14219 bool pop_p = false;
14221 /* If PARSER->SCOPE is a dependent type, then it must be a
14222 class type, and we must not be checking dependencies;
14223 otherwise, we would have processed this lookup above. So
14224 that PARSER->SCOPE is not considered a dependent base by
14225 lookup_member, we must enter the scope here. */
14227 pop_p = push_scope (parser->scope);
14228 /* If the PARSER->SCOPE is a a template specialization, it
14229 may be instantiated during name lookup. In that case,
14230 errors may be issued. Even if we rollback the current
14231 tentative parse, those errors are valid. */
14232 decl = lookup_qualified_name (parser->scope, name, is_type,
14233 /*complain=*/true);
14235 pop_scope (parser->scope);
14237 parser->qualifying_scope = parser->scope;
14238 parser->object_scope = NULL_TREE;
14240 else if (object_type)
14242 tree object_decl = NULL_TREE;
14243 /* Look up the name in the scope of the OBJECT_TYPE, unless the
14244 OBJECT_TYPE is not a class. */
14245 if (CLASS_TYPE_P (object_type))
14246 /* If the OBJECT_TYPE is a template specialization, it may
14247 be instantiated during name lookup. In that case, errors
14248 may be issued. Even if we rollback the current tentative
14249 parse, those errors are valid. */
14250 object_decl = lookup_member (object_type,
14252 /*protect=*/0, is_type);
14253 /* Look it up in the enclosing context, too. */
14254 decl = lookup_name_real (name, is_type, /*nonclass=*/0,
14255 /*block_p=*/true, is_namespace,
14257 parser->object_scope = object_type;
14258 parser->qualifying_scope = NULL_TREE;
14260 decl = object_decl;
14264 decl = lookup_name_real (name, is_type, /*nonclass=*/0,
14265 /*block_p=*/true, is_namespace,
14267 parser->qualifying_scope = NULL_TREE;
14268 parser->object_scope = NULL_TREE;
14271 /* If the lookup failed, let our caller know. */
14273 || decl == error_mark_node
14274 || (TREE_CODE (decl) == FUNCTION_DECL
14275 && DECL_ANTICIPATED (decl)))
14276 return error_mark_node;
14278 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
14279 if (TREE_CODE (decl) == TREE_LIST)
14281 /* The error message we have to print is too complicated for
14282 cp_parser_error, so we incorporate its actions directly. */
14283 if (!cp_parser_simulate_error (parser))
14285 error ("reference to `%D' is ambiguous", name);
14286 print_candidates (decl);
14288 return error_mark_node;
14291 my_friendly_assert (DECL_P (decl)
14292 || TREE_CODE (decl) == OVERLOAD
14293 || TREE_CODE (decl) == SCOPE_REF
14294 || TREE_CODE (decl) == UNBOUND_CLASS_TEMPLATE
14295 || BASELINK_P (decl),
14298 /* If we have resolved the name of a member declaration, check to
14299 see if the declaration is accessible. When the name resolves to
14300 set of overloaded functions, accessibility is checked when
14301 overload resolution is done.
14303 During an explicit instantiation, access is not checked at all,
14304 as per [temp.explicit]. */
14306 check_accessibility_of_qualified_id (decl, object_type, parser->scope);
14311 /* Like cp_parser_lookup_name, but for use in the typical case where
14312 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
14313 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
14316 cp_parser_lookup_name_simple (cp_parser* parser, tree name)
14318 return cp_parser_lookup_name (parser, name,
14320 /*is_template=*/false,
14321 /*is_namespace=*/false,
14322 /*check_dependency=*/true);
14325 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
14326 the current context, return the TYPE_DECL. If TAG_NAME_P is
14327 true, the DECL indicates the class being defined in a class-head,
14328 or declared in an elaborated-type-specifier.
14330 Otherwise, return DECL. */
14333 cp_parser_maybe_treat_template_as_class (tree decl, bool tag_name_p)
14335 /* If the TEMPLATE_DECL is being declared as part of a class-head,
14336 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
14339 template <typename T> struct B;
14342 template <typename T> struct A::B {};
14344 Similarly, in a elaborated-type-specifier:
14346 namespace N { struct X{}; }
14349 template <typename T> friend struct N::X;
14352 However, if the DECL refers to a class type, and we are in
14353 the scope of the class, then the name lookup automatically
14354 finds the TYPE_DECL created by build_self_reference rather
14355 than a TEMPLATE_DECL. For example, in:
14357 template <class T> struct S {
14361 there is no need to handle such case. */
14363 if (DECL_CLASS_TEMPLATE_P (decl) && tag_name_p)
14364 return DECL_TEMPLATE_RESULT (decl);
14369 /* If too many, or too few, template-parameter lists apply to the
14370 declarator, issue an error message. Returns TRUE if all went well,
14371 and FALSE otherwise. */
14374 cp_parser_check_declarator_template_parameters (cp_parser* parser,
14375 cp_declarator *declarator)
14377 unsigned num_templates;
14379 /* We haven't seen any classes that involve template parameters yet. */
14382 switch (declarator->kind)
14385 if (TREE_CODE (declarator->u.id.name) == SCOPE_REF)
14390 scope = TREE_OPERAND (declarator->u.id.name, 0);
14391 member = TREE_OPERAND (declarator->u.id.name, 1);
14393 while (scope && CLASS_TYPE_P (scope))
14395 /* You're supposed to have one `template <...>'
14396 for every template class, but you don't need one
14397 for a full specialization. For example:
14399 template <class T> struct S{};
14400 template <> struct S<int> { void f(); };
14401 void S<int>::f () {}
14403 is correct; there shouldn't be a `template <>' for
14404 the definition of `S<int>::f'. */
14405 if (CLASSTYPE_TEMPLATE_INFO (scope)
14406 && (CLASSTYPE_TEMPLATE_INSTANTIATION (scope)
14407 || uses_template_parms (CLASSTYPE_TI_ARGS (scope)))
14408 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope)))
14411 scope = TYPE_CONTEXT (scope);
14415 /* If the DECLARATOR has the form `X<y>' then it uses one
14416 additional level of template parameters. */
14417 if (TREE_CODE (declarator->u.id.name) == TEMPLATE_ID_EXPR)
14420 return cp_parser_check_template_parameters (parser,
14426 case cdk_reference:
14428 return (cp_parser_check_declarator_template_parameters
14429 (parser, declarator->declarator));
14440 /* NUM_TEMPLATES were used in the current declaration. If that is
14441 invalid, return FALSE and issue an error messages. Otherwise,
14445 cp_parser_check_template_parameters (cp_parser* parser,
14446 unsigned num_templates)
14448 /* If there are more template classes than parameter lists, we have
14451 template <class T> void S<T>::R<T>::f (); */
14452 if (parser->num_template_parameter_lists < num_templates)
14454 error ("too few template-parameter-lists");
14457 /* If there are the same number of template classes and parameter
14458 lists, that's OK. */
14459 if (parser->num_template_parameter_lists == num_templates)
14461 /* If there are more, but only one more, then we are referring to a
14462 member template. That's OK too. */
14463 if (parser->num_template_parameter_lists == num_templates + 1)
14465 /* Otherwise, there are too many template parameter lists. We have
14468 template <class T> template <class U> void S::f(); */
14469 error ("too many template-parameter-lists");
14473 /* Parse a binary-expression of the general form:
14477 binary-expression <token> <expr>
14479 The TOKEN_TREE_MAP maps <token> types to <expr> codes. FN is used
14480 to parser the <expr>s. If the first production is used, then the
14481 value returned by FN is returned directly. Otherwise, a node with
14482 the indicated EXPR_TYPE is returned, with operands corresponding to
14483 the two sub-expressions. */
14486 cp_parser_binary_expression (cp_parser* parser,
14487 const cp_parser_token_tree_map token_tree_map,
14488 cp_parser_expression_fn fn)
14492 /* Parse the first expression. */
14493 lhs = (*fn) (parser);
14494 /* Now, look for more expressions. */
14498 const cp_parser_token_tree_map_node *map_node;
14501 /* Peek at the next token. */
14502 token = cp_lexer_peek_token (parser->lexer);
14503 /* If the token is `>', and that's not an operator at the
14504 moment, then we're done. */
14505 if (token->type == CPP_GREATER
14506 && !parser->greater_than_is_operator_p)
14508 /* If we find one of the tokens we want, build the corresponding
14509 tree representation. */
14510 for (map_node = token_tree_map;
14511 map_node->token_type != CPP_EOF;
14513 if (map_node->token_type == token->type)
14515 /* Assume that an overloaded operator will not be used. */
14516 bool overloaded_p = false;
14518 /* Consume the operator token. */
14519 cp_lexer_consume_token (parser->lexer);
14520 /* Parse the right-hand side of the expression. */
14521 rhs = (*fn) (parser);
14522 /* Build the binary tree node. */
14523 lhs = build_x_binary_op (map_node->tree_type, lhs, rhs,
14525 /* If the binary operator required the use of an
14526 overloaded operator, then this expression cannot be an
14527 integral constant-expression. An overloaded operator
14528 can be used even if both operands are otherwise
14529 permissible in an integral constant-expression if at
14530 least one of the operands is of enumeration type. */
14532 && (cp_parser_non_integral_constant_expression
14533 (parser, "calls to overloaded operators")))
14534 lhs = error_mark_node;
14538 /* If the token wasn't one of the ones we want, we're done. */
14539 if (map_node->token_type == CPP_EOF)
14546 /* Parse an optional `::' token indicating that the following name is
14547 from the global namespace. If so, PARSER->SCOPE is set to the
14548 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
14549 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
14550 Returns the new value of PARSER->SCOPE, if the `::' token is
14551 present, and NULL_TREE otherwise. */
14554 cp_parser_global_scope_opt (cp_parser* parser, bool current_scope_valid_p)
14558 /* Peek at the next token. */
14559 token = cp_lexer_peek_token (parser->lexer);
14560 /* If we're looking at a `::' token then we're starting from the
14561 global namespace, not our current location. */
14562 if (token->type == CPP_SCOPE)
14564 /* Consume the `::' token. */
14565 cp_lexer_consume_token (parser->lexer);
14566 /* Set the SCOPE so that we know where to start the lookup. */
14567 parser->scope = global_namespace;
14568 parser->qualifying_scope = global_namespace;
14569 parser->object_scope = NULL_TREE;
14571 return parser->scope;
14573 else if (!current_scope_valid_p)
14575 parser->scope = NULL_TREE;
14576 parser->qualifying_scope = NULL_TREE;
14577 parser->object_scope = NULL_TREE;
14583 /* Returns TRUE if the upcoming token sequence is the start of a
14584 constructor declarator. If FRIEND_P is true, the declarator is
14585 preceded by the `friend' specifier. */
14588 cp_parser_constructor_declarator_p (cp_parser *parser, bool friend_p)
14590 bool constructor_p;
14591 tree type_decl = NULL_TREE;
14592 bool nested_name_p;
14593 cp_token *next_token;
14595 /* The common case is that this is not a constructor declarator, so
14596 try to avoid doing lots of work if at all possible. It's not
14597 valid declare a constructor at function scope. */
14598 if (at_function_scope_p ())
14600 /* And only certain tokens can begin a constructor declarator. */
14601 next_token = cp_lexer_peek_token (parser->lexer);
14602 if (next_token->type != CPP_NAME
14603 && next_token->type != CPP_SCOPE
14604 && next_token->type != CPP_NESTED_NAME_SPECIFIER
14605 && next_token->type != CPP_TEMPLATE_ID)
14608 /* Parse tentatively; we are going to roll back all of the tokens
14610 cp_parser_parse_tentatively (parser);
14611 /* Assume that we are looking at a constructor declarator. */
14612 constructor_p = true;
14614 /* Look for the optional `::' operator. */
14615 cp_parser_global_scope_opt (parser,
14616 /*current_scope_valid_p=*/false);
14617 /* Look for the nested-name-specifier. */
14619 = (cp_parser_nested_name_specifier_opt (parser,
14620 /*typename_keyword_p=*/false,
14621 /*check_dependency_p=*/false,
14623 /*is_declaration=*/false)
14625 /* Outside of a class-specifier, there must be a
14626 nested-name-specifier. */
14627 if (!nested_name_p &&
14628 (!at_class_scope_p () || !TYPE_BEING_DEFINED (current_class_type)
14630 constructor_p = false;
14631 /* If we still think that this might be a constructor-declarator,
14632 look for a class-name. */
14637 template <typename T> struct S { S(); };
14638 template <typename T> S<T>::S ();
14640 we must recognize that the nested `S' names a class.
14643 template <typename T> S<T>::S<T> ();
14645 we must recognize that the nested `S' names a template. */
14646 type_decl = cp_parser_class_name (parser,
14647 /*typename_keyword_p=*/false,
14648 /*template_keyword_p=*/false,
14650 /*check_dependency_p=*/false,
14651 /*class_head_p=*/false,
14652 /*is_declaration=*/false);
14653 /* If there was no class-name, then this is not a constructor. */
14654 constructor_p = !cp_parser_error_occurred (parser);
14657 /* If we're still considering a constructor, we have to see a `(',
14658 to begin the parameter-declaration-clause, followed by either a
14659 `)', an `...', or a decl-specifier. We need to check for a
14660 type-specifier to avoid being fooled into thinking that:
14664 is a constructor. (It is actually a function named `f' that
14665 takes one parameter (of type `int') and returns a value of type
14668 && cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
14670 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN)
14671 && cp_lexer_next_token_is_not (parser->lexer, CPP_ELLIPSIS)
14672 /* A parameter declaration begins with a decl-specifier,
14673 which is either the "attribute" keyword, a storage class
14674 specifier, or (usually) a type-specifier. */
14675 && !cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE)
14676 && !cp_parser_storage_class_specifier_opt (parser))
14679 bool pop_p = false;
14680 unsigned saved_num_template_parameter_lists;
14682 /* Names appearing in the type-specifier should be looked up
14683 in the scope of the class. */
14684 if (current_class_type)
14688 type = TREE_TYPE (type_decl);
14689 if (TREE_CODE (type) == TYPENAME_TYPE)
14691 type = resolve_typename_type (type,
14692 /*only_current_p=*/false);
14693 if (type == error_mark_node)
14695 cp_parser_abort_tentative_parse (parser);
14699 pop_p = push_scope (type);
14702 /* Inside the constructor parameter list, surrounding
14703 template-parameter-lists do not apply. */
14704 saved_num_template_parameter_lists
14705 = parser->num_template_parameter_lists;
14706 parser->num_template_parameter_lists = 0;
14708 /* Look for the type-specifier. */
14709 cp_parser_type_specifier (parser,
14710 CP_PARSER_FLAGS_NONE,
14711 /*decl_specs=*/NULL,
14712 /*is_declarator=*/true,
14713 /*declares_class_or_enum=*/NULL,
14714 /*is_cv_qualifier=*/NULL);
14716 parser->num_template_parameter_lists
14717 = saved_num_template_parameter_lists;
14719 /* Leave the scope of the class. */
14723 constructor_p = !cp_parser_error_occurred (parser);
14727 constructor_p = false;
14728 /* We did not really want to consume any tokens. */
14729 cp_parser_abort_tentative_parse (parser);
14731 return constructor_p;
14734 /* Parse the definition of the function given by the DECL_SPECIFIERS,
14735 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
14736 they must be performed once we are in the scope of the function.
14738 Returns the function defined. */
14741 cp_parser_function_definition_from_specifiers_and_declarator
14742 (cp_parser* parser,
14743 cp_decl_specifier_seq *decl_specifiers,
14745 const cp_declarator *declarator)
14750 /* Begin the function-definition. */
14751 success_p = start_function (decl_specifiers, declarator, attributes);
14753 /* The things we're about to see are not directly qualified by any
14754 template headers we've seen thus far. */
14755 reset_specialization ();
14757 /* If there were names looked up in the decl-specifier-seq that we
14758 did not check, check them now. We must wait until we are in the
14759 scope of the function to perform the checks, since the function
14760 might be a friend. */
14761 perform_deferred_access_checks ();
14765 /* Skip the entire function. */
14766 error ("invalid function declaration");
14767 cp_parser_skip_to_end_of_block_or_statement (parser);
14768 fn = error_mark_node;
14771 fn = cp_parser_function_definition_after_declarator (parser,
14772 /*inline_p=*/false);
14777 /* Parse the part of a function-definition that follows the
14778 declarator. INLINE_P is TRUE iff this function is an inline
14779 function defined with a class-specifier.
14781 Returns the function defined. */
14784 cp_parser_function_definition_after_declarator (cp_parser* parser,
14788 bool ctor_initializer_p = false;
14789 bool saved_in_unbraced_linkage_specification_p;
14790 unsigned saved_num_template_parameter_lists;
14792 /* If the next token is `return', then the code may be trying to
14793 make use of the "named return value" extension that G++ used to
14795 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_RETURN))
14797 /* Consume the `return' keyword. */
14798 cp_lexer_consume_token (parser->lexer);
14799 /* Look for the identifier that indicates what value is to be
14801 cp_parser_identifier (parser);
14802 /* Issue an error message. */
14803 error ("named return values are no longer supported");
14804 /* Skip tokens until we reach the start of the function body. */
14805 while (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE)
14806 && cp_lexer_next_token_is_not (parser->lexer, CPP_EOF))
14807 cp_lexer_consume_token (parser->lexer);
14809 /* The `extern' in `extern "C" void f () { ... }' does not apply to
14810 anything declared inside `f'. */
14811 saved_in_unbraced_linkage_specification_p
14812 = parser->in_unbraced_linkage_specification_p;
14813 parser->in_unbraced_linkage_specification_p = false;
14814 /* Inside the function, surrounding template-parameter-lists do not
14816 saved_num_template_parameter_lists
14817 = parser->num_template_parameter_lists;
14818 parser->num_template_parameter_lists = 0;
14819 /* If the next token is `try', then we are looking at a
14820 function-try-block. */
14821 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRY))
14822 ctor_initializer_p = cp_parser_function_try_block (parser);
14823 /* A function-try-block includes the function-body, so we only do
14824 this next part if we're not processing a function-try-block. */
14827 = cp_parser_ctor_initializer_opt_and_function_body (parser);
14829 /* Finish the function. */
14830 fn = finish_function ((ctor_initializer_p ? 1 : 0) |
14831 (inline_p ? 2 : 0));
14832 /* Generate code for it, if necessary. */
14833 expand_or_defer_fn (fn);
14834 /* Restore the saved values. */
14835 parser->in_unbraced_linkage_specification_p
14836 = saved_in_unbraced_linkage_specification_p;
14837 parser->num_template_parameter_lists
14838 = saved_num_template_parameter_lists;
14843 /* Parse a template-declaration, assuming that the `export' (and
14844 `extern') keywords, if present, has already been scanned. MEMBER_P
14845 is as for cp_parser_template_declaration. */
14848 cp_parser_template_declaration_after_export (cp_parser* parser, bool member_p)
14850 tree decl = NULL_TREE;
14851 tree parameter_list;
14852 bool friend_p = false;
14854 /* Look for the `template' keyword. */
14855 if (!cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'"))
14859 if (!cp_parser_require (parser, CPP_LESS, "`<'"))
14862 /* If the next token is `>', then we have an invalid
14863 specialization. Rather than complain about an invalid template
14864 parameter, issue an error message here. */
14865 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
14867 cp_parser_error (parser, "invalid explicit specialization");
14868 begin_specialization ();
14869 parameter_list = NULL_TREE;
14873 /* Parse the template parameters. */
14874 begin_template_parm_list ();
14875 parameter_list = cp_parser_template_parameter_list (parser);
14876 parameter_list = end_template_parm_list (parameter_list);
14879 /* Look for the `>'. */
14880 cp_parser_skip_until_found (parser, CPP_GREATER, "`>'");
14881 /* We just processed one more parameter list. */
14882 ++parser->num_template_parameter_lists;
14883 /* If the next token is `template', there are more template
14885 if (cp_lexer_next_token_is_keyword (parser->lexer,
14887 cp_parser_template_declaration_after_export (parser, member_p);
14890 /* There are no access checks when parsing a template, as we do not
14891 know if a specialization will be a friend. */
14892 push_deferring_access_checks (dk_no_check);
14894 decl = cp_parser_single_declaration (parser,
14898 pop_deferring_access_checks ();
14900 /* If this is a member template declaration, let the front
14902 if (member_p && !friend_p && decl)
14904 if (TREE_CODE (decl) == TYPE_DECL)
14905 cp_parser_check_access_in_redeclaration (decl);
14907 decl = finish_member_template_decl (decl);
14909 else if (friend_p && decl && TREE_CODE (decl) == TYPE_DECL)
14910 make_friend_class (current_class_type, TREE_TYPE (decl),
14911 /*complain=*/true);
14913 /* We are done with the current parameter list. */
14914 --parser->num_template_parameter_lists;
14917 finish_template_decl (parameter_list);
14919 /* Register member declarations. */
14920 if (member_p && !friend_p && decl && !DECL_CLASS_TEMPLATE_P (decl))
14921 finish_member_declaration (decl);
14923 /* If DECL is a function template, we must return to parse it later.
14924 (Even though there is no definition, there might be default
14925 arguments that need handling.) */
14926 if (member_p && decl
14927 && (TREE_CODE (decl) == FUNCTION_DECL
14928 || DECL_FUNCTION_TEMPLATE_P (decl)))
14929 TREE_VALUE (parser->unparsed_functions_queues)
14930 = tree_cons (NULL_TREE, decl,
14931 TREE_VALUE (parser->unparsed_functions_queues));
14934 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
14935 `function-definition' sequence. MEMBER_P is true, this declaration
14936 appears in a class scope.
14938 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
14939 *FRIEND_P is set to TRUE iff the declaration is a friend. */
14942 cp_parser_single_declaration (cp_parser* parser,
14946 int declares_class_or_enum;
14947 tree decl = NULL_TREE;
14948 cp_decl_specifier_seq decl_specifiers;
14949 bool function_definition_p = false;
14951 /* Defer access checks until we know what is being declared. */
14952 push_deferring_access_checks (dk_deferred);
14954 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
14956 cp_parser_decl_specifier_seq (parser,
14957 CP_PARSER_FLAGS_OPTIONAL,
14959 &declares_class_or_enum);
14961 *friend_p = cp_parser_friend_p (&decl_specifiers);
14962 /* Gather up the access checks that occurred the
14963 decl-specifier-seq. */
14964 stop_deferring_access_checks ();
14966 /* Check for the declaration of a template class. */
14967 if (declares_class_or_enum)
14969 if (cp_parser_declares_only_class_p (parser))
14971 decl = shadow_tag (&decl_specifiers);
14972 if (decl && decl != error_mark_node)
14973 decl = TYPE_NAME (decl);
14975 decl = error_mark_node;
14980 /* If it's not a template class, try for a template function. If
14981 the next token is a `;', then this declaration does not declare
14982 anything. But, if there were errors in the decl-specifiers, then
14983 the error might well have come from an attempted class-specifier.
14984 In that case, there's no need to warn about a missing declarator. */
14986 && (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON)
14987 || decl_specifiers.type != error_mark_node))
14988 decl = cp_parser_init_declarator (parser,
14990 /*function_definition_allowed_p=*/true,
14992 declares_class_or_enum,
14993 &function_definition_p);
14995 pop_deferring_access_checks ();
14997 /* Clear any current qualification; whatever comes next is the start
14998 of something new. */
14999 parser->scope = NULL_TREE;
15000 parser->qualifying_scope = NULL_TREE;
15001 parser->object_scope = NULL_TREE;
15002 /* Look for a trailing `;' after the declaration. */
15003 if (!function_definition_p
15004 && !cp_parser_require (parser, CPP_SEMICOLON, "`;'"))
15005 cp_parser_skip_to_end_of_block_or_statement (parser);
15010 /* Parse a cast-expression that is not the operand of a unary "&". */
15013 cp_parser_simple_cast_expression (cp_parser *parser)
15015 return cp_parser_cast_expression (parser, /*address_p=*/false);
15018 /* Parse a functional cast to TYPE. Returns an expression
15019 representing the cast. */
15022 cp_parser_functional_cast (cp_parser* parser, tree type)
15024 tree expression_list;
15028 = cp_parser_parenthesized_expression_list (parser, false,
15029 /*non_constant_p=*/NULL);
15031 cast = build_functional_cast (type, expression_list);
15032 /* [expr.const]/1: In an integral constant expression "only type
15033 conversions to integral or enumeration type can be used". */
15034 if (cast != error_mark_node && !type_dependent_expression_p (type)
15035 && !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (type)))
15037 if (cp_parser_non_integral_constant_expression
15038 (parser, "a call to a constructor"))
15039 return error_mark_node;
15044 /* Save the tokens that make up the body of a member function defined
15045 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
15046 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
15047 specifiers applied to the declaration. Returns the FUNCTION_DECL
15048 for the member function. */
15051 cp_parser_save_member_function_body (cp_parser* parser,
15052 cp_decl_specifier_seq *decl_specifiers,
15053 cp_declarator *declarator,
15056 cp_token_cache *cache;
15059 /* Create the function-declaration. */
15060 fn = start_method (decl_specifiers, declarator, attributes);
15061 /* If something went badly wrong, bail out now. */
15062 if (fn == error_mark_node)
15064 /* If there's a function-body, skip it. */
15065 if (cp_parser_token_starts_function_definition_p
15066 (cp_lexer_peek_token (parser->lexer)))
15067 cp_parser_skip_to_end_of_block_or_statement (parser);
15068 return error_mark_node;
15071 /* Remember it, if there default args to post process. */
15072 cp_parser_save_default_args (parser, fn);
15074 /* Create a token cache. */
15075 cache = cp_token_cache_new ();
15076 /* Save away the tokens that make up the body of the
15078 cp_parser_cache_group (parser, cache, CPP_CLOSE_BRACE, /*depth=*/0);
15079 /* Handle function try blocks. */
15080 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_CATCH))
15081 cp_parser_cache_group (parser, cache, CPP_CLOSE_BRACE, /*depth=*/0);
15083 /* Save away the inline definition; we will process it when the
15084 class is complete. */
15085 DECL_PENDING_INLINE_INFO (fn) = cache;
15086 DECL_PENDING_INLINE_P (fn) = 1;
15088 /* We need to know that this was defined in the class, so that
15089 friend templates are handled correctly. */
15090 DECL_INITIALIZED_IN_CLASS_P (fn) = 1;
15092 /* We're done with the inline definition. */
15093 finish_method (fn);
15095 /* Add FN to the queue of functions to be parsed later. */
15096 TREE_VALUE (parser->unparsed_functions_queues)
15097 = tree_cons (NULL_TREE, fn,
15098 TREE_VALUE (parser->unparsed_functions_queues));
15103 /* Parse a template-argument-list, as well as the trailing ">" (but
15104 not the opening ">"). See cp_parser_template_argument_list for the
15108 cp_parser_enclosed_template_argument_list (cp_parser* parser)
15112 tree saved_qualifying_scope;
15113 tree saved_object_scope;
15114 bool saved_greater_than_is_operator_p;
15118 When parsing a template-id, the first non-nested `>' is taken as
15119 the end of the template-argument-list rather than a greater-than
15121 saved_greater_than_is_operator_p
15122 = parser->greater_than_is_operator_p;
15123 parser->greater_than_is_operator_p = false;
15124 /* Parsing the argument list may modify SCOPE, so we save it
15126 saved_scope = parser->scope;
15127 saved_qualifying_scope = parser->qualifying_scope;
15128 saved_object_scope = parser->object_scope;
15129 /* Parse the template-argument-list itself. */
15130 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
15131 arguments = NULL_TREE;
15133 arguments = cp_parser_template_argument_list (parser);
15134 /* Look for the `>' that ends the template-argument-list. If we find
15135 a '>>' instead, it's probably just a typo. */
15136 if (cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
15138 if (!saved_greater_than_is_operator_p)
15140 /* If we're in a nested template argument list, the '>>' has to be
15141 a typo for '> >'. We emit the error message, but we continue
15142 parsing and we push a '>' as next token, so that the argument
15143 list will be parsed correctly.. */
15145 error ("`>>' should be `> >' within a nested template argument list");
15146 token = cp_lexer_peek_token (parser->lexer);
15147 token->type = CPP_GREATER;
15151 /* If this is not a nested template argument list, the '>>' is
15152 a typo for '>'. Emit an error message and continue. */
15153 error ("spurious `>>', use `>' to terminate a template argument list");
15154 cp_lexer_consume_token (parser->lexer);
15157 else if (!cp_parser_require (parser, CPP_GREATER, "`>'"))
15158 error ("missing `>' to terminate the template argument list");
15159 /* The `>' token might be a greater-than operator again now. */
15160 parser->greater_than_is_operator_p
15161 = saved_greater_than_is_operator_p;
15162 /* Restore the SAVED_SCOPE. */
15163 parser->scope = saved_scope;
15164 parser->qualifying_scope = saved_qualifying_scope;
15165 parser->object_scope = saved_object_scope;
15170 /* MEMBER_FUNCTION is a member function, or a friend. If default
15171 arguments, or the body of the function have not yet been parsed,
15175 cp_parser_late_parsing_for_member (cp_parser* parser, tree member_function)
15177 cp_lexer *saved_lexer;
15179 /* If this member is a template, get the underlying
15181 if (DECL_FUNCTION_TEMPLATE_P (member_function))
15182 member_function = DECL_TEMPLATE_RESULT (member_function);
15184 /* There should not be any class definitions in progress at this
15185 point; the bodies of members are only parsed outside of all class
15187 my_friendly_assert (parser->num_classes_being_defined == 0, 20010816);
15188 /* While we're parsing the member functions we might encounter more
15189 classes. We want to handle them right away, but we don't want
15190 them getting mixed up with functions that are currently in the
15192 parser->unparsed_functions_queues
15193 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
15195 /* Make sure that any template parameters are in scope. */
15196 maybe_begin_member_template_processing (member_function);
15198 /* If the body of the function has not yet been parsed, parse it
15200 if (DECL_PENDING_INLINE_P (member_function))
15202 tree function_scope;
15203 cp_token_cache *tokens;
15205 /* The function is no longer pending; we are processing it. */
15206 tokens = DECL_PENDING_INLINE_INFO (member_function);
15207 DECL_PENDING_INLINE_INFO (member_function) = NULL;
15208 DECL_PENDING_INLINE_P (member_function) = 0;
15209 /* If this was an inline function in a local class, enter the scope
15210 of the containing function. */
15211 function_scope = decl_function_context (member_function);
15212 if (function_scope)
15213 push_function_context_to (function_scope);
15215 /* Save away the current lexer. */
15216 saved_lexer = parser->lexer;
15217 /* Make a new lexer to feed us the tokens saved for this function. */
15218 parser->lexer = cp_lexer_new_from_tokens (tokens);
15219 parser->lexer->next = saved_lexer;
15221 /* Set the current source position to be the location of the first
15222 token in the saved inline body. */
15223 cp_lexer_peek_token (parser->lexer);
15225 /* Let the front end know that we going to be defining this
15227 start_preparsed_function (member_function, NULL_TREE,
15228 SF_PRE_PARSED | SF_INCLASS_INLINE);
15230 /* Now, parse the body of the function. */
15231 cp_parser_function_definition_after_declarator (parser,
15232 /*inline_p=*/true);
15234 /* Leave the scope of the containing function. */
15235 if (function_scope)
15236 pop_function_context_from (function_scope);
15237 /* Restore the lexer. */
15238 parser->lexer = saved_lexer;
15241 /* Remove any template parameters from the symbol table. */
15242 maybe_end_member_template_processing ();
15244 /* Restore the queue. */
15245 parser->unparsed_functions_queues
15246 = TREE_CHAIN (parser->unparsed_functions_queues);
15249 /* If DECL contains any default args, remember it on the unparsed
15250 functions queue. */
15253 cp_parser_save_default_args (cp_parser* parser, tree decl)
15257 for (probe = TYPE_ARG_TYPES (TREE_TYPE (decl));
15259 probe = TREE_CHAIN (probe))
15260 if (TREE_PURPOSE (probe))
15262 TREE_PURPOSE (parser->unparsed_functions_queues)
15263 = tree_cons (current_class_type, decl,
15264 TREE_PURPOSE (parser->unparsed_functions_queues));
15270 /* FN is a FUNCTION_DECL which may contains a parameter with an
15271 unparsed DEFAULT_ARG. Parse the default args now. This function
15272 assumes that the current scope is the scope in which the default
15273 argument should be processed. */
15276 cp_parser_late_parsing_default_args (cp_parser *parser, tree fn)
15278 cp_lexer *saved_lexer;
15279 cp_token_cache *tokens;
15280 bool saved_local_variables_forbidden_p;
15283 /* While we're parsing the default args, we might (due to the
15284 statement expression extension) encounter more classes. We want
15285 to handle them right away, but we don't want them getting mixed
15286 up with default args that are currently in the queue. */
15287 parser->unparsed_functions_queues
15288 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
15290 for (parameters = TYPE_ARG_TYPES (TREE_TYPE (fn));
15292 parameters = TREE_CHAIN (parameters))
15294 if (!TREE_PURPOSE (parameters)
15295 || TREE_CODE (TREE_PURPOSE (parameters)) != DEFAULT_ARG)
15298 /* Save away the current lexer. */
15299 saved_lexer = parser->lexer;
15300 /* Create a new one, using the tokens we have saved. */
15301 tokens = DEFARG_TOKENS (TREE_PURPOSE (parameters));
15302 parser->lexer = cp_lexer_new_from_tokens (tokens);
15304 /* Set the current source position to be the location of the
15305 first token in the default argument. */
15306 cp_lexer_peek_token (parser->lexer);
15308 /* Local variable names (and the `this' keyword) may not appear
15309 in a default argument. */
15310 saved_local_variables_forbidden_p = parser->local_variables_forbidden_p;
15311 parser->local_variables_forbidden_p = true;
15312 /* Parse the assignment-expression. */
15313 TREE_PURPOSE (parameters) = cp_parser_assignment_expression (parser);
15315 /* If the token stream has not been completely used up, then
15316 there was extra junk after the end of the default
15318 if (!cp_lexer_next_token_is (parser->lexer, CPP_EOF))
15319 cp_parser_error (parser, "expected `,'");
15321 /* Restore saved state. */
15322 parser->lexer = saved_lexer;
15323 parser->local_variables_forbidden_p = saved_local_variables_forbidden_p;
15326 /* Restore the queue. */
15327 parser->unparsed_functions_queues
15328 = TREE_CHAIN (parser->unparsed_functions_queues);
15331 /* Parse the operand of `sizeof' (or a similar operator). Returns
15332 either a TYPE or an expression, depending on the form of the
15333 input. The KEYWORD indicates which kind of expression we have
15337 cp_parser_sizeof_operand (cp_parser* parser, enum rid keyword)
15339 static const char *format;
15340 tree expr = NULL_TREE;
15341 const char *saved_message;
15342 bool saved_integral_constant_expression_p;
15344 /* Initialize FORMAT the first time we get here. */
15346 format = "types may not be defined in `%s' expressions";
15348 /* Types cannot be defined in a `sizeof' expression. Save away the
15350 saved_message = parser->type_definition_forbidden_message;
15351 /* And create the new one. */
15352 parser->type_definition_forbidden_message
15353 = xmalloc (strlen (format)
15354 + strlen (IDENTIFIER_POINTER (ridpointers[keyword]))
15356 sprintf ((char *) parser->type_definition_forbidden_message,
15357 format, IDENTIFIER_POINTER (ridpointers[keyword]));
15359 /* The restrictions on constant-expressions do not apply inside
15360 sizeof expressions. */
15361 saved_integral_constant_expression_p = parser->integral_constant_expression_p;
15362 parser->integral_constant_expression_p = false;
15364 /* Do not actually evaluate the expression. */
15366 /* If it's a `(', then we might be looking at the type-id
15368 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
15371 bool saved_in_type_id_in_expr_p;
15373 /* We can't be sure yet whether we're looking at a type-id or an
15375 cp_parser_parse_tentatively (parser);
15376 /* Consume the `('. */
15377 cp_lexer_consume_token (parser->lexer);
15378 /* Parse the type-id. */
15379 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
15380 parser->in_type_id_in_expr_p = true;
15381 type = cp_parser_type_id (parser);
15382 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
15383 /* Now, look for the trailing `)'. */
15384 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
15385 /* If all went well, then we're done. */
15386 if (cp_parser_parse_definitely (parser))
15388 cp_decl_specifier_seq decl_specs;
15390 /* Build a trivial decl-specifier-seq. */
15391 clear_decl_specs (&decl_specs);
15392 decl_specs.type = type;
15394 /* Call grokdeclarator to figure out what type this is. */
15395 expr = grokdeclarator (NULL,
15399 /*attrlist=*/NULL);
15403 /* If the type-id production did not work out, then we must be
15404 looking at the unary-expression production. */
15406 expr = cp_parser_unary_expression (parser, /*address_p=*/false);
15407 /* Go back to evaluating expressions. */
15410 /* Free the message we created. */
15411 free ((char *) parser->type_definition_forbidden_message);
15412 /* And restore the old one. */
15413 parser->type_definition_forbidden_message = saved_message;
15414 parser->integral_constant_expression_p = saved_integral_constant_expression_p;
15419 /* If the current declaration has no declarator, return true. */
15422 cp_parser_declares_only_class_p (cp_parser *parser)
15424 /* If the next token is a `;' or a `,' then there is no
15426 return (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
15427 || cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
15430 /* Update the DECL_SPECS to reflect the STORAGE_CLASS. */
15433 cp_parser_set_storage_class (cp_decl_specifier_seq *decl_specs,
15434 cp_storage_class storage_class)
15436 if (decl_specs->storage_class != sc_none)
15437 decl_specs->multiple_storage_classes_p = true;
15439 decl_specs->storage_class = storage_class;
15442 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If USER_DEFINED_P
15443 is true, the type is a user-defined type; otherwise it is a
15444 built-in type specified by a keyword. */
15447 cp_parser_set_decl_spec_type (cp_decl_specifier_seq *decl_specs,
15449 bool user_defined_p)
15451 decl_specs->any_specifiers_p = true;
15453 /* If the user tries to redeclare a built-in type (with, for example,
15454 in "typedef int wchar_t;") we remember that this is what
15455 happened. In system headers, we ignore these declarations so
15456 that G++ can work with system headers that are not C++-safe. */
15457 if (decl_specs->specs[(int) ds_typedef]
15459 && (decl_specs->type
15460 || decl_specs->specs[(int) ds_long]
15461 || decl_specs->specs[(int) ds_short]
15462 || decl_specs->specs[(int) ds_unsigned]
15463 || decl_specs->specs[(int) ds_signed]))
15465 decl_specs->redefined_builtin_type = type_spec;
15466 if (!decl_specs->type)
15468 decl_specs->type = type_spec;
15469 decl_specs->user_defined_type_p = false;
15472 else if (decl_specs->type)
15473 decl_specs->multiple_types_p = true;
15476 decl_specs->type = type_spec;
15477 decl_specs->user_defined_type_p = user_defined_p;
15478 decl_specs->redefined_builtin_type = NULL_TREE;
15482 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
15483 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
15486 cp_parser_friend_p (const cp_decl_specifier_seq *decl_specifiers)
15488 return decl_specifiers->specs[(int) ds_friend] != 0;
15491 /* If the next token is of the indicated TYPE, consume it. Otherwise,
15492 issue an error message indicating that TOKEN_DESC was expected.
15494 Returns the token consumed, if the token had the appropriate type.
15495 Otherwise, returns NULL. */
15498 cp_parser_require (cp_parser* parser,
15499 enum cpp_ttype type,
15500 const char* token_desc)
15502 if (cp_lexer_next_token_is (parser->lexer, type))
15503 return cp_lexer_consume_token (parser->lexer);
15506 /* Output the MESSAGE -- unless we're parsing tentatively. */
15507 if (!cp_parser_simulate_error (parser))
15509 char *message = concat ("expected ", token_desc, NULL);
15510 cp_parser_error (parser, message);
15517 /* Like cp_parser_require, except that tokens will be skipped until
15518 the desired token is found. An error message is still produced if
15519 the next token is not as expected. */
15522 cp_parser_skip_until_found (cp_parser* parser,
15523 enum cpp_ttype type,
15524 const char* token_desc)
15527 unsigned nesting_depth = 0;
15529 if (cp_parser_require (parser, type, token_desc))
15532 /* Skip tokens until the desired token is found. */
15535 /* Peek at the next token. */
15536 token = cp_lexer_peek_token (parser->lexer);
15537 /* If we've reached the token we want, consume it and
15539 if (token->type == type && !nesting_depth)
15541 cp_lexer_consume_token (parser->lexer);
15544 /* If we've run out of tokens, stop. */
15545 if (token->type == CPP_EOF)
15547 if (token->type == CPP_OPEN_BRACE
15548 || token->type == CPP_OPEN_PAREN
15549 || token->type == CPP_OPEN_SQUARE)
15551 else if (token->type == CPP_CLOSE_BRACE
15552 || token->type == CPP_CLOSE_PAREN
15553 || token->type == CPP_CLOSE_SQUARE)
15555 if (nesting_depth-- == 0)
15558 /* Consume this token. */
15559 cp_lexer_consume_token (parser->lexer);
15563 /* If the next token is the indicated keyword, consume it. Otherwise,
15564 issue an error message indicating that TOKEN_DESC was expected.
15566 Returns the token consumed, if the token had the appropriate type.
15567 Otherwise, returns NULL. */
15570 cp_parser_require_keyword (cp_parser* parser,
15572 const char* token_desc)
15574 cp_token *token = cp_parser_require (parser, CPP_KEYWORD, token_desc);
15576 if (token && token->keyword != keyword)
15578 dyn_string_t error_msg;
15580 /* Format the error message. */
15581 error_msg = dyn_string_new (0);
15582 dyn_string_append_cstr (error_msg, "expected ");
15583 dyn_string_append_cstr (error_msg, token_desc);
15584 cp_parser_error (parser, error_msg->s);
15585 dyn_string_delete (error_msg);
15592 /* Returns TRUE iff TOKEN is a token that can begin the body of a
15593 function-definition. */
15596 cp_parser_token_starts_function_definition_p (cp_token* token)
15598 return (/* An ordinary function-body begins with an `{'. */
15599 token->type == CPP_OPEN_BRACE
15600 /* A ctor-initializer begins with a `:'. */
15601 || token->type == CPP_COLON
15602 /* A function-try-block begins with `try'. */
15603 || token->keyword == RID_TRY
15604 /* The named return value extension begins with `return'. */
15605 || token->keyword == RID_RETURN);
15608 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
15612 cp_parser_next_token_starts_class_definition_p (cp_parser *parser)
15616 token = cp_lexer_peek_token (parser->lexer);
15617 return (token->type == CPP_OPEN_BRACE || token->type == CPP_COLON);
15620 /* Returns TRUE iff the next token is the "," or ">" ending a
15621 template-argument. ">>" is also accepted (after the full
15622 argument was parsed) because it's probably a typo for "> >",
15623 and there is a specific diagnostic for this. */
15626 cp_parser_next_token_ends_template_argument_p (cp_parser *parser)
15630 token = cp_lexer_peek_token (parser->lexer);
15631 return (token->type == CPP_COMMA || token->type == CPP_GREATER
15632 || token->type == CPP_RSHIFT);
15635 /* Returns TRUE iff the n-th token is a ">", or the n-th is a "[" and the
15636 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
15639 cp_parser_nth_token_starts_template_argument_list_p (cp_parser * parser,
15644 token = cp_lexer_peek_nth_token (parser->lexer, n);
15645 if (token->type == CPP_LESS)
15647 /* Check for the sequence `<::' in the original code. It would be lexed as
15648 `[:', where `[' is a digraph, and there is no whitespace before
15650 if (token->type == CPP_OPEN_SQUARE && token->flags & DIGRAPH)
15653 token2 = cp_lexer_peek_nth_token (parser->lexer, n+1);
15654 if (token2->type == CPP_COLON && !(token2->flags & PREV_WHITE))
15660 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
15661 or none_type otherwise. */
15663 static enum tag_types
15664 cp_parser_token_is_class_key (cp_token* token)
15666 switch (token->keyword)
15671 return record_type;
15680 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
15683 cp_parser_check_class_key (enum tag_types class_key, tree type)
15685 if ((TREE_CODE (type) == UNION_TYPE) != (class_key == union_type))
15686 pedwarn ("`%s' tag used in naming `%#T'",
15687 class_key == union_type ? "union"
15688 : class_key == record_type ? "struct" : "class",
15692 /* Issue an error message if DECL is redeclared with different
15693 access than its original declaration [class.access.spec/3].
15694 This applies to nested classes and nested class templates.
15697 static void cp_parser_check_access_in_redeclaration (tree decl)
15699 if (!CLASS_TYPE_P (TREE_TYPE (decl)))
15702 if ((TREE_PRIVATE (decl)
15703 != (current_access_specifier == access_private_node))
15704 || (TREE_PROTECTED (decl)
15705 != (current_access_specifier == access_protected_node)))
15706 error ("%D redeclared with different access", decl);
15709 /* Look for the `template' keyword, as a syntactic disambiguator.
15710 Return TRUE iff it is present, in which case it will be
15714 cp_parser_optional_template_keyword (cp_parser *parser)
15716 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
15718 /* The `template' keyword can only be used within templates;
15719 outside templates the parser can always figure out what is a
15720 template and what is not. */
15721 if (!processing_template_decl)
15723 error ("`template' (as a disambiguator) is only allowed "
15724 "within templates");
15725 /* If this part of the token stream is rescanned, the same
15726 error message would be generated. So, we purge the token
15727 from the stream. */
15728 cp_lexer_purge_token (parser->lexer);
15733 /* Consume the `template' keyword. */
15734 cp_lexer_consume_token (parser->lexer);
15742 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
15743 set PARSER->SCOPE, and perform other related actions. */
15746 cp_parser_pre_parsed_nested_name_specifier (cp_parser *parser)
15751 /* Get the stored value. */
15752 value = cp_lexer_consume_token (parser->lexer)->value;
15753 /* Perform any access checks that were deferred. */
15754 for (check = TREE_PURPOSE (value); check; check = TREE_CHAIN (check))
15755 perform_or_defer_access_check (TREE_PURPOSE (check), TREE_VALUE (check));
15756 /* Set the scope from the stored value. */
15757 parser->scope = TREE_VALUE (value);
15758 parser->qualifying_scope = TREE_TYPE (value);
15759 parser->object_scope = NULL_TREE;
15762 /* Add tokens to CACHE until a non-nested END token appears. */
15765 cp_parser_cache_group_1 (cp_parser *parser,
15766 cp_token_cache *cache,
15767 enum cpp_ttype end,
15774 /* Abort a parenthesized expression if we encounter a brace. */
15775 if ((end == CPP_CLOSE_PAREN || depth == 0)
15776 && cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
15778 /* If we've reached the end of the file, stop. */
15779 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
15781 /* Consume the next token. */
15782 token = cp_lexer_consume_token (parser->lexer);
15783 /* Add this token to the tokens we are saving. */
15784 cp_token_cache_push_token (cache, token);
15785 /* See if it starts a new group. */
15786 if (token->type == CPP_OPEN_BRACE)
15788 cp_parser_cache_group_1 (parser, cache, CPP_CLOSE_BRACE, depth + 1);
15792 else if (token->type == CPP_OPEN_PAREN)
15793 cp_parser_cache_group_1 (parser, cache, CPP_CLOSE_PAREN, depth + 1);
15794 else if (token->type == end)
15799 /* Convenient interface for cp_parser_cache_group_1 that makes sure we
15800 preserve string tokens in both translated and untranslated
15804 cp_parser_cache_group (cp_parser *parser,
15805 cp_token_cache *cache,
15806 enum cpp_ttype end,
15809 int saved_c_lex_string_translate;
15811 saved_c_lex_string_translate = c_lex_string_translate;
15812 c_lex_string_translate = -1;
15814 cp_parser_cache_group_1 (parser, cache, end, depth);
15816 c_lex_string_translate = saved_c_lex_string_translate;
15820 /* Begin parsing tentatively. We always save tokens while parsing
15821 tentatively so that if the tentative parsing fails we can restore the
15825 cp_parser_parse_tentatively (cp_parser* parser)
15827 /* Enter a new parsing context. */
15828 parser->context = cp_parser_context_new (parser->context);
15829 /* Begin saving tokens. */
15830 cp_lexer_save_tokens (parser->lexer);
15831 /* In order to avoid repetitive access control error messages,
15832 access checks are queued up until we are no longer parsing
15834 push_deferring_access_checks (dk_deferred);
15837 /* Commit to the currently active tentative parse. */
15840 cp_parser_commit_to_tentative_parse (cp_parser* parser)
15842 cp_parser_context *context;
15845 /* Mark all of the levels as committed. */
15846 lexer = parser->lexer;
15847 for (context = parser->context; context->next; context = context->next)
15849 if (context->status == CP_PARSER_STATUS_KIND_COMMITTED)
15851 context->status = CP_PARSER_STATUS_KIND_COMMITTED;
15852 while (!cp_lexer_saving_tokens (lexer))
15853 lexer = lexer->next;
15854 cp_lexer_commit_tokens (lexer);
15858 /* Abort the currently active tentative parse. All consumed tokens
15859 will be rolled back, and no diagnostics will be issued. */
15862 cp_parser_abort_tentative_parse (cp_parser* parser)
15864 cp_parser_simulate_error (parser);
15865 /* Now, pretend that we want to see if the construct was
15866 successfully parsed. */
15867 cp_parser_parse_definitely (parser);
15870 /* Stop parsing tentatively. If a parse error has occurred, restore the
15871 token stream. Otherwise, commit to the tokens we have consumed.
15872 Returns true if no error occurred; false otherwise. */
15875 cp_parser_parse_definitely (cp_parser* parser)
15877 bool error_occurred;
15878 cp_parser_context *context;
15880 /* Remember whether or not an error occurred, since we are about to
15881 destroy that information. */
15882 error_occurred = cp_parser_error_occurred (parser);
15883 /* Remove the topmost context from the stack. */
15884 context = parser->context;
15885 parser->context = context->next;
15886 /* If no parse errors occurred, commit to the tentative parse. */
15887 if (!error_occurred)
15889 /* Commit to the tokens read tentatively, unless that was
15891 if (context->status != CP_PARSER_STATUS_KIND_COMMITTED)
15892 cp_lexer_commit_tokens (parser->lexer);
15894 pop_to_parent_deferring_access_checks ();
15896 /* Otherwise, if errors occurred, roll back our state so that things
15897 are just as they were before we began the tentative parse. */
15900 cp_lexer_rollback_tokens (parser->lexer);
15901 pop_deferring_access_checks ();
15903 /* Add the context to the front of the free list. */
15904 context->next = cp_parser_context_free_list;
15905 cp_parser_context_free_list = context;
15907 return !error_occurred;
15910 /* Returns true if we are parsing tentatively -- but have decided that
15911 we will stick with this tentative parse, even if errors occur. */
15914 cp_parser_committed_to_tentative_parse (cp_parser* parser)
15916 return (cp_parser_parsing_tentatively (parser)
15917 && parser->context->status == CP_PARSER_STATUS_KIND_COMMITTED);
15920 /* Returns nonzero iff an error has occurred during the most recent
15921 tentative parse. */
15924 cp_parser_error_occurred (cp_parser* parser)
15926 return (cp_parser_parsing_tentatively (parser)
15927 && parser->context->status == CP_PARSER_STATUS_KIND_ERROR);
15930 /* Returns nonzero if GNU extensions are allowed. */
15933 cp_parser_allow_gnu_extensions_p (cp_parser* parser)
15935 return parser->allow_gnu_extensions_p;
15941 static GTY (()) cp_parser *the_parser;
15943 /* External interface. */
15945 /* Parse one entire translation unit. */
15948 c_parse_file (void)
15950 bool error_occurred;
15951 static bool already_called = false;
15953 if (already_called)
15955 sorry ("inter-module optimizations not implemented for C++");
15958 already_called = true;
15960 the_parser = cp_parser_new ();
15961 push_deferring_access_checks (flag_access_control
15962 ? dk_no_deferred : dk_no_check);
15963 error_occurred = cp_parser_translation_unit (the_parser);
15967 /* This variable must be provided by every front end. */
15971 #include "gt-cp-parser.h"