2 Copyright (C) 2000, 2001, 2002, 2003, 2004,
3 2005 Free Software Foundation, Inc.
4 Written by Mark Mitchell <mark@codesourcery.com>.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it
9 under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GCC is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
25 #include "coretypes.h"
27 #include "dyn-string.h"
35 #include "diagnostic.h"
44 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
45 and c-lex.c) and the C++ parser. */
49 typedef struct cp_token GTY (())
51 /* The kind of token. */
52 ENUM_BITFIELD (cpp_ttype) type : 8;
53 /* If this token is a keyword, this value indicates which keyword.
54 Otherwise, this value is RID_MAX. */
55 ENUM_BITFIELD (rid) keyword : 8;
58 /* True if this token is from a system header. */
59 BOOL_BITFIELD in_system_header : 1;
60 /* True if this token is from a context where it is implicitly extern "C" */
61 BOOL_BITFIELD implicit_extern_c : 1;
62 /* The value associated with this token, if any. */
64 /* The location at which this token was found. */
68 /* We use a stack of token pointer for saving token sets. */
69 typedef struct cp_token *cp_token_position;
70 DEF_VEC_P (cp_token_position);
71 DEF_VEC_ALLOC_P (cp_token_position,heap);
73 static const cp_token eof_token =
75 CPP_EOF, RID_MAX, 0, 0, 0, NULL_TREE,
76 #if USE_MAPPED_LOCATION
83 /* The cp_lexer structure represents the C++ lexer. It is responsible
84 for managing the token stream from the preprocessor and supplying
85 it to the parser. Tokens are never added to the cp_lexer after
88 typedef struct cp_lexer GTY (())
90 /* The memory allocated for the buffer. NULL if this lexer does not
91 own the token buffer. */
92 cp_token * GTY ((length ("%h.buffer_length"))) buffer;
93 /* If the lexer owns the buffer, this is the number of tokens in the
97 /* A pointer just past the last available token. The tokens
98 in this lexer are [buffer, last_token). */
99 cp_token_position GTY ((skip)) last_token;
101 /* The next available token. If NEXT_TOKEN is &eof_token, then there are
102 no more available tokens. */
103 cp_token_position GTY ((skip)) next_token;
105 /* A stack indicating positions at which cp_lexer_save_tokens was
106 called. The top entry is the most recent position at which we
107 began saving tokens. If the stack is non-empty, we are saving
109 VEC(cp_token_position,heap) *GTY ((skip)) saved_tokens;
111 /* True if we should output debugging information. */
114 /* The next lexer in a linked list of lexers. */
115 struct cp_lexer *next;
118 /* cp_token_cache is a range of tokens. There is no need to represent
119 allocate heap memory for it, since tokens are never removed from the
120 lexer's array. There is also no need for the GC to walk through
121 a cp_token_cache, since everything in here is referenced through
124 typedef struct cp_token_cache GTY(())
126 /* The beginning of the token range. */
127 cp_token * GTY((skip)) first;
129 /* Points immediately after the last token in the range. */
130 cp_token * GTY ((skip)) last;
135 static cp_lexer *cp_lexer_new_main
137 static cp_lexer *cp_lexer_new_from_tokens
138 (cp_token_cache *tokens);
139 static void cp_lexer_destroy
141 static int cp_lexer_saving_tokens
143 static cp_token_position cp_lexer_token_position
145 static cp_token *cp_lexer_token_at
146 (cp_lexer *, cp_token_position);
147 static void cp_lexer_get_preprocessor_token
148 (cp_lexer *, cp_token *);
149 static inline cp_token *cp_lexer_peek_token
151 static cp_token *cp_lexer_peek_nth_token
152 (cp_lexer *, size_t);
153 static inline bool cp_lexer_next_token_is
154 (cp_lexer *, enum cpp_ttype);
155 static bool cp_lexer_next_token_is_not
156 (cp_lexer *, enum cpp_ttype);
157 static bool cp_lexer_next_token_is_keyword
158 (cp_lexer *, enum rid);
159 static cp_token *cp_lexer_consume_token
161 static void cp_lexer_purge_token
163 static void cp_lexer_purge_tokens_after
164 (cp_lexer *, cp_token_position);
165 static void cp_lexer_handle_pragma
167 static void cp_lexer_save_tokens
169 static void cp_lexer_commit_tokens
171 static void cp_lexer_rollback_tokens
173 #ifdef ENABLE_CHECKING
174 static void cp_lexer_print_token
175 (FILE *, cp_token *);
176 static inline bool cp_lexer_debugging_p
178 static void cp_lexer_start_debugging
179 (cp_lexer *) ATTRIBUTE_UNUSED;
180 static void cp_lexer_stop_debugging
181 (cp_lexer *) ATTRIBUTE_UNUSED;
183 /* If we define cp_lexer_debug_stream to NULL it will provoke warnings
184 about passing NULL to functions that require non-NULL arguments
185 (fputs, fprintf). It will never be used, so all we need is a value
186 of the right type that's guaranteed not to be NULL. */
187 #define cp_lexer_debug_stream stdout
188 #define cp_lexer_print_token(str, tok) (void) 0
189 #define cp_lexer_debugging_p(lexer) 0
190 #endif /* ENABLE_CHECKING */
192 static cp_token_cache *cp_token_cache_new
193 (cp_token *, cp_token *);
195 /* Manifest constants. */
196 #define CP_LEXER_BUFFER_SIZE 10000
197 #define CP_SAVED_TOKEN_STACK 5
199 /* A token type for keywords, as opposed to ordinary identifiers. */
200 #define CPP_KEYWORD ((enum cpp_ttype) (N_TTYPES + 1))
202 /* A token type for template-ids. If a template-id is processed while
203 parsing tentatively, it is replaced with a CPP_TEMPLATE_ID token;
204 the value of the CPP_TEMPLATE_ID is whatever was returned by
205 cp_parser_template_id. */
206 #define CPP_TEMPLATE_ID ((enum cpp_ttype) (CPP_KEYWORD + 1))
208 /* A token type for nested-name-specifiers. If a
209 nested-name-specifier is processed while parsing tentatively, it is
210 replaced with a CPP_NESTED_NAME_SPECIFIER token; the value of the
211 CPP_NESTED_NAME_SPECIFIER is whatever was returned by
212 cp_parser_nested_name_specifier_opt. */
213 #define CPP_NESTED_NAME_SPECIFIER ((enum cpp_ttype) (CPP_TEMPLATE_ID + 1))
215 /* A token type for tokens that are not tokens at all; these are used
216 to represent slots in the array where there used to be a token
217 that has now been deleted. */
218 #define CPP_PURGED ((enum cpp_ttype) (CPP_NESTED_NAME_SPECIFIER + 1))
220 /* The number of token types, including C++-specific ones. */
221 #define N_CP_TTYPES ((int) (CPP_PURGED + 1))
225 #ifdef ENABLE_CHECKING
226 /* The stream to which debugging output should be written. */
227 static FILE *cp_lexer_debug_stream;
228 #endif /* ENABLE_CHECKING */
230 /* Create a new main C++ lexer, the lexer that gets tokens from the
234 cp_lexer_new_main (void)
236 cp_token first_token;
243 /* It's possible that lexing the first token will load a PCH file,
244 which is a GC collection point. So we have to grab the first
245 token before allocating any memory. Pragmas must not be deferred
246 as -fpch-preprocess can generate a pragma to load the PCH file in
247 the preprocessed output used by -save-temps. */
248 cp_lexer_get_preprocessor_token (NULL, &first_token);
250 /* Tell cpplib we want CPP_PRAGMA tokens. */
251 cpp_get_options (parse_in)->defer_pragmas = true;
253 /* Tell c_lex not to merge string constants. */
254 c_lex_return_raw_strings = true;
256 c_common_no_more_pch ();
258 /* Allocate the memory. */
259 lexer = GGC_CNEW (cp_lexer);
261 #ifdef ENABLE_CHECKING
262 /* Initially we are not debugging. */
263 lexer->debugging_p = false;
264 #endif /* ENABLE_CHECKING */
265 lexer->saved_tokens = VEC_alloc (cp_token_position, heap,
266 CP_SAVED_TOKEN_STACK);
268 /* Create the buffer. */
269 alloc = CP_LEXER_BUFFER_SIZE;
270 buffer = ggc_alloc (alloc * sizeof (cp_token));
272 /* Put the first token in the buffer. */
277 /* Get the remaining tokens from the preprocessor. */
278 while (pos->type != CPP_EOF)
285 buffer = ggc_realloc (buffer, alloc * sizeof (cp_token));
286 pos = buffer + space;
288 cp_lexer_get_preprocessor_token (lexer, pos);
290 lexer->buffer = buffer;
291 lexer->buffer_length = alloc - space;
292 lexer->last_token = pos;
293 lexer->next_token = lexer->buffer_length ? buffer : (cp_token *)&eof_token;
295 /* Pragma processing (via cpp_handle_deferred_pragma) may result in
296 direct calls to c_lex. Those callers all expect c_lex to do
297 string constant concatenation. */
298 c_lex_return_raw_strings = false;
300 gcc_assert (lexer->next_token->type != CPP_PURGED);
304 /* Create a new lexer whose token stream is primed with the tokens in
305 CACHE. When these tokens are exhausted, no new tokens will be read. */
308 cp_lexer_new_from_tokens (cp_token_cache *cache)
310 cp_token *first = cache->first;
311 cp_token *last = cache->last;
312 cp_lexer *lexer = GGC_CNEW (cp_lexer);
314 /* We do not own the buffer. */
315 lexer->buffer = NULL;
316 lexer->buffer_length = 0;
317 lexer->next_token = first == last ? (cp_token *)&eof_token : first;
318 lexer->last_token = last;
320 lexer->saved_tokens = VEC_alloc (cp_token_position, heap,
321 CP_SAVED_TOKEN_STACK);
323 #ifdef ENABLE_CHECKING
324 /* Initially we are not debugging. */
325 lexer->debugging_p = false;
328 gcc_assert (lexer->next_token->type != CPP_PURGED);
332 /* Frees all resources associated with LEXER. */
335 cp_lexer_destroy (cp_lexer *lexer)
338 ggc_free (lexer->buffer);
339 VEC_free (cp_token_position, heap, lexer->saved_tokens);
343 /* Returns nonzero if debugging information should be output. */
345 #ifdef ENABLE_CHECKING
348 cp_lexer_debugging_p (cp_lexer *lexer)
350 return lexer->debugging_p;
353 #endif /* ENABLE_CHECKING */
355 static inline cp_token_position
356 cp_lexer_token_position (cp_lexer *lexer, bool previous_p)
358 gcc_assert (!previous_p || lexer->next_token != &eof_token);
360 return lexer->next_token - previous_p;
363 static inline cp_token *
364 cp_lexer_token_at (cp_lexer *lexer ATTRIBUTE_UNUSED, cp_token_position pos)
369 /* nonzero if we are presently saving tokens. */
372 cp_lexer_saving_tokens (const cp_lexer* lexer)
374 return VEC_length (cp_token_position, lexer->saved_tokens) != 0;
377 /* Store the next token from the preprocessor in *TOKEN. Return true
381 cp_lexer_get_preprocessor_token (cp_lexer *lexer ATTRIBUTE_UNUSED ,
384 static int is_extern_c = 0;
386 /* Get a new token from the preprocessor. */
388 = c_lex_with_flags (&token->value, &token->location, &token->flags);
389 token->in_system_header = in_system_header;
391 /* On some systems, some header files are surrounded by an
392 implicit extern "C" block. Set a flag in the token if it
393 comes from such a header. */
394 is_extern_c += pending_lang_change;
395 pending_lang_change = 0;
396 token->implicit_extern_c = is_extern_c > 0;
398 /* Check to see if this token is a keyword. */
399 if (token->type == CPP_NAME
400 && C_IS_RESERVED_WORD (token->value))
402 /* Mark this token as a keyword. */
403 token->type = CPP_KEYWORD;
404 /* Record which keyword. */
405 token->keyword = C_RID_CODE (token->value);
406 /* Update the value. Some keywords are mapped to particular
407 entities, rather than simply having the value of the
408 corresponding IDENTIFIER_NODE. For example, `__const' is
409 mapped to `const'. */
410 token->value = ridpointers[token->keyword];
412 /* Handle Objective-C++ keywords. */
413 else if (token->type == CPP_AT_NAME)
415 token->type = CPP_KEYWORD;
416 switch (C_RID_CODE (token->value))
418 /* Map 'class' to '@class', 'private' to '@private', etc. */
419 case RID_CLASS: token->keyword = RID_AT_CLASS; break;
420 case RID_PRIVATE: token->keyword = RID_AT_PRIVATE; break;
421 case RID_PROTECTED: token->keyword = RID_AT_PROTECTED; break;
422 case RID_PUBLIC: token->keyword = RID_AT_PUBLIC; break;
423 case RID_THROW: token->keyword = RID_AT_THROW; break;
424 case RID_TRY: token->keyword = RID_AT_TRY; break;
425 case RID_CATCH: token->keyword = RID_AT_CATCH; break;
426 default: token->keyword = C_RID_CODE (token->value);
430 token->keyword = RID_MAX;
433 /* Update the globals input_location and in_system_header from TOKEN. */
435 cp_lexer_set_source_position_from_token (cp_token *token)
437 if (token->type != CPP_EOF)
439 input_location = token->location;
440 in_system_header = token->in_system_header;
444 /* Return a pointer to the next token in the token stream, but do not
447 static inline cp_token *
448 cp_lexer_peek_token (cp_lexer *lexer)
450 if (cp_lexer_debugging_p (lexer))
452 fputs ("cp_lexer: peeking at token: ", cp_lexer_debug_stream);
453 cp_lexer_print_token (cp_lexer_debug_stream, lexer->next_token);
454 putc ('\n', cp_lexer_debug_stream);
456 return lexer->next_token;
459 /* Return true if the next token has the indicated TYPE. */
462 cp_lexer_next_token_is (cp_lexer* lexer, enum cpp_ttype type)
464 return cp_lexer_peek_token (lexer)->type == type;
467 /* Return true if the next token does not have the indicated TYPE. */
470 cp_lexer_next_token_is_not (cp_lexer* lexer, enum cpp_ttype type)
472 return !cp_lexer_next_token_is (lexer, type);
475 /* Return true if the next token is the indicated KEYWORD. */
478 cp_lexer_next_token_is_keyword (cp_lexer* lexer, enum rid keyword)
482 /* Peek at the next token. */
483 token = cp_lexer_peek_token (lexer);
484 /* Check to see if it is the indicated keyword. */
485 return token->keyword == keyword;
488 /* Return a pointer to the Nth token in the token stream. If N is 1,
489 then this is precisely equivalent to cp_lexer_peek_token (except
490 that it is not inline). One would like to disallow that case, but
491 there is one case (cp_parser_nth_token_starts_template_id) where
492 the caller passes a variable for N and it might be 1. */
495 cp_lexer_peek_nth_token (cp_lexer* lexer, size_t n)
499 /* N is 1-based, not zero-based. */
502 if (cp_lexer_debugging_p (lexer))
503 fprintf (cp_lexer_debug_stream,
504 "cp_lexer: peeking ahead %ld at token: ", (long)n);
507 token = lexer->next_token;
508 gcc_assert (!n || token != &eof_token);
512 if (token == lexer->last_token)
514 token = (cp_token *)&eof_token;
518 if (token->type != CPP_PURGED)
522 if (cp_lexer_debugging_p (lexer))
524 cp_lexer_print_token (cp_lexer_debug_stream, token);
525 putc ('\n', cp_lexer_debug_stream);
531 /* Return the next token, and advance the lexer's next_token pointer
532 to point to the next non-purged token. */
535 cp_lexer_consume_token (cp_lexer* lexer)
537 cp_token *token = lexer->next_token;
539 gcc_assert (token != &eof_token);
544 if (lexer->next_token == lexer->last_token)
546 lexer->next_token = (cp_token *)&eof_token;
551 while (lexer->next_token->type == CPP_PURGED);
553 cp_lexer_set_source_position_from_token (token);
555 /* Provide debugging output. */
556 if (cp_lexer_debugging_p (lexer))
558 fputs ("cp_lexer: consuming token: ", cp_lexer_debug_stream);
559 cp_lexer_print_token (cp_lexer_debug_stream, token);
560 putc ('\n', cp_lexer_debug_stream);
566 /* Permanently remove the next token from the token stream, and
567 advance the next_token pointer to refer to the next non-purged
571 cp_lexer_purge_token (cp_lexer *lexer)
573 cp_token *tok = lexer->next_token;
575 gcc_assert (tok != &eof_token);
576 tok->type = CPP_PURGED;
577 tok->location = UNKNOWN_LOCATION;
578 tok->value = NULL_TREE;
579 tok->keyword = RID_MAX;
584 if (tok == lexer->last_token)
586 tok = (cp_token *)&eof_token;
590 while (tok->type == CPP_PURGED);
591 lexer->next_token = tok;
594 /* Permanently remove all tokens after TOK, up to, but not
595 including, the token that will be returned next by
596 cp_lexer_peek_token. */
599 cp_lexer_purge_tokens_after (cp_lexer *lexer, cp_token *tok)
601 cp_token *peek = lexer->next_token;
603 if (peek == &eof_token)
604 peek = lexer->last_token;
606 gcc_assert (tok < peek);
608 for ( tok += 1; tok != peek; tok += 1)
610 tok->type = CPP_PURGED;
611 tok->location = UNKNOWN_LOCATION;
612 tok->value = NULL_TREE;
613 tok->keyword = RID_MAX;
617 /* Consume and handle a pragma token. */
619 cp_lexer_handle_pragma (cp_lexer *lexer)
622 cp_token *token = cp_lexer_consume_token (lexer);
623 gcc_assert (token->type == CPP_PRAGMA);
624 gcc_assert (token->value);
626 s.len = TREE_STRING_LENGTH (token->value);
627 s.text = (const unsigned char *) TREE_STRING_POINTER (token->value);
629 cpp_handle_deferred_pragma (parse_in, &s);
631 /* Clearing token->value here means that we will get an ICE if we
632 try to process this #pragma again (which should be impossible). */
636 /* Begin saving tokens. All tokens consumed after this point will be
640 cp_lexer_save_tokens (cp_lexer* lexer)
642 /* Provide debugging output. */
643 if (cp_lexer_debugging_p (lexer))
644 fprintf (cp_lexer_debug_stream, "cp_lexer: saving tokens\n");
646 VEC_safe_push (cp_token_position, heap,
647 lexer->saved_tokens, lexer->next_token);
650 /* Commit to the portion of the token stream most recently saved. */
653 cp_lexer_commit_tokens (cp_lexer* lexer)
655 /* Provide debugging output. */
656 if (cp_lexer_debugging_p (lexer))
657 fprintf (cp_lexer_debug_stream, "cp_lexer: committing tokens\n");
659 VEC_pop (cp_token_position, lexer->saved_tokens);
662 /* Return all tokens saved since the last call to cp_lexer_save_tokens
663 to the token stream. Stop saving tokens. */
666 cp_lexer_rollback_tokens (cp_lexer* lexer)
668 /* Provide debugging output. */
669 if (cp_lexer_debugging_p (lexer))
670 fprintf (cp_lexer_debug_stream, "cp_lexer: restoring tokens\n");
672 lexer->next_token = VEC_pop (cp_token_position, lexer->saved_tokens);
675 /* Print a representation of the TOKEN on the STREAM. */
677 #ifdef ENABLE_CHECKING
680 cp_lexer_print_token (FILE * stream, cp_token *token)
682 /* We don't use cpp_type2name here because the parser defines
683 a few tokens of its own. */
684 static const char *const token_names[] = {
685 /* cpplib-defined token types */
691 /* C++ parser token types - see "Manifest constants", above. */
694 "NESTED_NAME_SPECIFIER",
698 /* If we have a name for the token, print it out. Otherwise, we
699 simply give the numeric code. */
700 gcc_assert (token->type < ARRAY_SIZE(token_names));
701 fputs (token_names[token->type], stream);
703 /* For some tokens, print the associated data. */
707 /* Some keywords have a value that is not an IDENTIFIER_NODE.
708 For example, `struct' is mapped to an INTEGER_CST. */
709 if (TREE_CODE (token->value) != IDENTIFIER_NODE)
711 /* else fall through */
713 fputs (IDENTIFIER_POINTER (token->value), stream);
719 fprintf (stream, " \"%s\"", TREE_STRING_POINTER (token->value));
727 /* Start emitting debugging information. */
730 cp_lexer_start_debugging (cp_lexer* lexer)
732 lexer->debugging_p = true;
735 /* Stop emitting debugging information. */
738 cp_lexer_stop_debugging (cp_lexer* lexer)
740 lexer->debugging_p = false;
743 #endif /* ENABLE_CHECKING */
745 /* Create a new cp_token_cache, representing a range of tokens. */
747 static cp_token_cache *
748 cp_token_cache_new (cp_token *first, cp_token *last)
750 cp_token_cache *cache = GGC_NEW (cp_token_cache);
751 cache->first = first;
757 /* Decl-specifiers. */
759 static void clear_decl_specs
760 (cp_decl_specifier_seq *);
762 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
765 clear_decl_specs (cp_decl_specifier_seq *decl_specs)
767 memset (decl_specs, 0, sizeof (cp_decl_specifier_seq));
772 /* Nothing other than the parser should be creating declarators;
773 declarators are a semi-syntactic representation of C++ entities.
774 Other parts of the front end that need to create entities (like
775 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
777 static cp_declarator *make_call_declarator
778 (cp_declarator *, cp_parameter_declarator *, cp_cv_quals, tree);
779 static cp_declarator *make_array_declarator
780 (cp_declarator *, tree);
781 static cp_declarator *make_pointer_declarator
782 (cp_cv_quals, cp_declarator *);
783 static cp_declarator *make_reference_declarator
784 (cp_cv_quals, cp_declarator *);
785 static cp_parameter_declarator *make_parameter_declarator
786 (cp_decl_specifier_seq *, cp_declarator *, tree);
787 static cp_declarator *make_ptrmem_declarator
788 (cp_cv_quals, tree, cp_declarator *);
790 cp_declarator *cp_error_declarator;
792 /* The obstack on which declarators and related data structures are
794 static struct obstack declarator_obstack;
796 /* Alloc BYTES from the declarator memory pool. */
799 alloc_declarator (size_t bytes)
801 return obstack_alloc (&declarator_obstack, bytes);
804 /* Allocate a declarator of the indicated KIND. Clear fields that are
805 common to all declarators. */
807 static cp_declarator *
808 make_declarator (cp_declarator_kind kind)
810 cp_declarator *declarator;
812 declarator = (cp_declarator *) alloc_declarator (sizeof (cp_declarator));
813 declarator->kind = kind;
814 declarator->attributes = NULL_TREE;
815 declarator->declarator = NULL;
820 /* Make a declarator for a generalized identifier. If non-NULL, the
821 identifier is QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is
822 just UNQUALIFIED_NAME. */
824 static cp_declarator *
825 make_id_declarator (tree qualifying_scope, tree unqualified_name)
827 cp_declarator *declarator;
829 /* It is valid to write:
831 class C { void f(); };
835 The standard is not clear about whether `typedef const C D' is
836 legal; as of 2002-09-15 the committee is considering that
837 question. EDG 3.0 allows that syntax. Therefore, we do as
839 if (qualifying_scope && TYPE_P (qualifying_scope))
840 qualifying_scope = TYPE_MAIN_VARIANT (qualifying_scope);
842 declarator = make_declarator (cdk_id);
843 declarator->u.id.qualifying_scope = qualifying_scope;
844 declarator->u.id.unqualified_name = unqualified_name;
845 declarator->u.id.sfk = sfk_none;
850 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
851 of modifiers such as const or volatile to apply to the pointer
852 type, represented as identifiers. */
855 make_pointer_declarator (cp_cv_quals cv_qualifiers, cp_declarator *target)
857 cp_declarator *declarator;
859 declarator = make_declarator (cdk_pointer);
860 declarator->declarator = target;
861 declarator->u.pointer.qualifiers = cv_qualifiers;
862 declarator->u.pointer.class_type = NULL_TREE;
867 /* Like make_pointer_declarator -- but for references. */
870 make_reference_declarator (cp_cv_quals cv_qualifiers, cp_declarator *target)
872 cp_declarator *declarator;
874 declarator = make_declarator (cdk_reference);
875 declarator->declarator = target;
876 declarator->u.pointer.qualifiers = cv_qualifiers;
877 declarator->u.pointer.class_type = NULL_TREE;
882 /* Like make_pointer_declarator -- but for a pointer to a non-static
883 member of CLASS_TYPE. */
886 make_ptrmem_declarator (cp_cv_quals cv_qualifiers, tree class_type,
887 cp_declarator *pointee)
889 cp_declarator *declarator;
891 declarator = make_declarator (cdk_ptrmem);
892 declarator->declarator = pointee;
893 declarator->u.pointer.qualifiers = cv_qualifiers;
894 declarator->u.pointer.class_type = class_type;
899 /* Make a declarator for the function given by TARGET, with the
900 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
901 "const"-qualified member function. The EXCEPTION_SPECIFICATION
902 indicates what exceptions can be thrown. */
905 make_call_declarator (cp_declarator *target,
906 cp_parameter_declarator *parms,
907 cp_cv_quals cv_qualifiers,
908 tree exception_specification)
910 cp_declarator *declarator;
912 declarator = make_declarator (cdk_function);
913 declarator->declarator = target;
914 declarator->u.function.parameters = parms;
915 declarator->u.function.qualifiers = cv_qualifiers;
916 declarator->u.function.exception_specification = exception_specification;
921 /* Make a declarator for an array of BOUNDS elements, each of which is
922 defined by ELEMENT. */
925 make_array_declarator (cp_declarator *element, tree bounds)
927 cp_declarator *declarator;
929 declarator = make_declarator (cdk_array);
930 declarator->declarator = element;
931 declarator->u.array.bounds = bounds;
936 cp_parameter_declarator *no_parameters;
938 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
939 DECLARATOR and DEFAULT_ARGUMENT. */
941 cp_parameter_declarator *
942 make_parameter_declarator (cp_decl_specifier_seq *decl_specifiers,
943 cp_declarator *declarator,
944 tree default_argument)
946 cp_parameter_declarator *parameter;
948 parameter = ((cp_parameter_declarator *)
949 alloc_declarator (sizeof (cp_parameter_declarator)));
950 parameter->next = NULL;
952 parameter->decl_specifiers = *decl_specifiers;
954 clear_decl_specs (¶meter->decl_specifiers);
955 parameter->declarator = declarator;
956 parameter->default_argument = default_argument;
957 parameter->ellipsis_p = false;
967 A cp_parser parses the token stream as specified by the C++
968 grammar. Its job is purely parsing, not semantic analysis. For
969 example, the parser breaks the token stream into declarators,
970 expressions, statements, and other similar syntactic constructs.
971 It does not check that the types of the expressions on either side
972 of an assignment-statement are compatible, or that a function is
973 not declared with a parameter of type `void'.
975 The parser invokes routines elsewhere in the compiler to perform
976 semantic analysis and to build up the abstract syntax tree for the
979 The parser (and the template instantiation code, which is, in a
980 way, a close relative of parsing) are the only parts of the
981 compiler that should be calling push_scope and pop_scope, or
982 related functions. The parser (and template instantiation code)
983 keeps track of what scope is presently active; everything else
984 should simply honor that. (The code that generates static
985 initializers may also need to set the scope, in order to check
986 access control correctly when emitting the initializers.)
991 The parser is of the standard recursive-descent variety. Upcoming
992 tokens in the token stream are examined in order to determine which
993 production to use when parsing a non-terminal. Some C++ constructs
994 require arbitrary look ahead to disambiguate. For example, it is
995 impossible, in the general case, to tell whether a statement is an
996 expression or declaration without scanning the entire statement.
997 Therefore, the parser is capable of "parsing tentatively." When the
998 parser is not sure what construct comes next, it enters this mode.
999 Then, while we attempt to parse the construct, the parser queues up
1000 error messages, rather than issuing them immediately, and saves the
1001 tokens it consumes. If the construct is parsed successfully, the
1002 parser "commits", i.e., it issues any queued error messages and
1003 the tokens that were being preserved are permanently discarded.
1004 If, however, the construct is not parsed successfully, the parser
1005 rolls back its state completely so that it can resume parsing using
1006 a different alternative.
1011 The performance of the parser could probably be improved substantially.
1012 We could often eliminate the need to parse tentatively by looking ahead
1013 a little bit. In some places, this approach might not entirely eliminate
1014 the need to parse tentatively, but it might still speed up the average
1017 /* Flags that are passed to some parsing functions. These values can
1018 be bitwise-ored together. */
1020 typedef enum cp_parser_flags
1023 CP_PARSER_FLAGS_NONE = 0x0,
1024 /* The construct is optional. If it is not present, then no error
1025 should be issued. */
1026 CP_PARSER_FLAGS_OPTIONAL = 0x1,
1027 /* When parsing a type-specifier, do not allow user-defined types. */
1028 CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES = 0x2
1031 /* The different kinds of declarators we want to parse. */
1033 typedef enum cp_parser_declarator_kind
1035 /* We want an abstract declarator. */
1036 CP_PARSER_DECLARATOR_ABSTRACT,
1037 /* We want a named declarator. */
1038 CP_PARSER_DECLARATOR_NAMED,
1039 /* We don't mind, but the name must be an unqualified-id. */
1040 CP_PARSER_DECLARATOR_EITHER
1041 } cp_parser_declarator_kind;
1043 /* The precedence values used to parse binary expressions. The minimum value
1044 of PREC must be 1, because zero is reserved to quickly discriminate
1045 binary operators from other tokens. */
1050 PREC_LOGICAL_OR_EXPRESSION,
1051 PREC_LOGICAL_AND_EXPRESSION,
1052 PREC_INCLUSIVE_OR_EXPRESSION,
1053 PREC_EXCLUSIVE_OR_EXPRESSION,
1054 PREC_AND_EXPRESSION,
1055 PREC_EQUALITY_EXPRESSION,
1056 PREC_RELATIONAL_EXPRESSION,
1057 PREC_SHIFT_EXPRESSION,
1058 PREC_ADDITIVE_EXPRESSION,
1059 PREC_MULTIPLICATIVE_EXPRESSION,
1061 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1064 /* A mapping from a token type to a corresponding tree node type, with a
1065 precedence value. */
1067 typedef struct cp_parser_binary_operations_map_node
1069 /* The token type. */
1070 enum cpp_ttype token_type;
1071 /* The corresponding tree code. */
1072 enum tree_code tree_type;
1073 /* The precedence of this operator. */
1074 enum cp_parser_prec prec;
1075 } cp_parser_binary_operations_map_node;
1077 /* The status of a tentative parse. */
1079 typedef enum cp_parser_status_kind
1081 /* No errors have occurred. */
1082 CP_PARSER_STATUS_KIND_NO_ERROR,
1083 /* An error has occurred. */
1084 CP_PARSER_STATUS_KIND_ERROR,
1085 /* We are committed to this tentative parse, whether or not an error
1087 CP_PARSER_STATUS_KIND_COMMITTED
1088 } cp_parser_status_kind;
1090 typedef struct cp_parser_expression_stack_entry
1093 enum tree_code tree_type;
1095 } cp_parser_expression_stack_entry;
1097 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1098 entries because precedence levels on the stack are monotonically
1100 typedef struct cp_parser_expression_stack_entry
1101 cp_parser_expression_stack[NUM_PREC_VALUES];
1103 /* Context that is saved and restored when parsing tentatively. */
1104 typedef struct cp_parser_context GTY (())
1106 /* If this is a tentative parsing context, the status of the
1108 enum cp_parser_status_kind status;
1109 /* If non-NULL, we have just seen a `x->' or `x.' expression. Names
1110 that are looked up in this context must be looked up both in the
1111 scope given by OBJECT_TYPE (the type of `x' or `*x') and also in
1112 the context of the containing expression. */
1115 /* The next parsing context in the stack. */
1116 struct cp_parser_context *next;
1117 } cp_parser_context;
1121 /* Constructors and destructors. */
1123 static cp_parser_context *cp_parser_context_new
1124 (cp_parser_context *);
1126 /* Class variables. */
1128 static GTY((deletable)) cp_parser_context* cp_parser_context_free_list;
1130 /* The operator-precedence table used by cp_parser_binary_expression.
1131 Transformed into an associative array (binops_by_token) by
1134 static const cp_parser_binary_operations_map_node binops[] = {
1135 { CPP_DEREF_STAR, MEMBER_REF, PREC_PM_EXPRESSION },
1136 { CPP_DOT_STAR, DOTSTAR_EXPR, PREC_PM_EXPRESSION },
1138 { CPP_MULT, MULT_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1139 { CPP_DIV, TRUNC_DIV_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1140 { CPP_MOD, TRUNC_MOD_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1142 { CPP_PLUS, PLUS_EXPR, PREC_ADDITIVE_EXPRESSION },
1143 { CPP_MINUS, MINUS_EXPR, PREC_ADDITIVE_EXPRESSION },
1145 { CPP_LSHIFT, LSHIFT_EXPR, PREC_SHIFT_EXPRESSION },
1146 { CPP_RSHIFT, RSHIFT_EXPR, PREC_SHIFT_EXPRESSION },
1148 { CPP_LESS, LT_EXPR, PREC_RELATIONAL_EXPRESSION },
1149 { CPP_GREATER, GT_EXPR, PREC_RELATIONAL_EXPRESSION },
1150 { CPP_LESS_EQ, LE_EXPR, PREC_RELATIONAL_EXPRESSION },
1151 { CPP_GREATER_EQ, GE_EXPR, PREC_RELATIONAL_EXPRESSION },
1152 { CPP_MIN, MIN_EXPR, PREC_RELATIONAL_EXPRESSION },
1153 { CPP_MAX, MAX_EXPR, PREC_RELATIONAL_EXPRESSION },
1155 { CPP_EQ_EQ, EQ_EXPR, PREC_EQUALITY_EXPRESSION },
1156 { CPP_NOT_EQ, NE_EXPR, PREC_EQUALITY_EXPRESSION },
1158 { CPP_AND, BIT_AND_EXPR, PREC_AND_EXPRESSION },
1160 { CPP_XOR, BIT_XOR_EXPR, PREC_EXCLUSIVE_OR_EXPRESSION },
1162 { CPP_OR, BIT_IOR_EXPR, PREC_INCLUSIVE_OR_EXPRESSION },
1164 { CPP_AND_AND, TRUTH_ANDIF_EXPR, PREC_LOGICAL_AND_EXPRESSION },
1166 { CPP_OR_OR, TRUTH_ORIF_EXPR, PREC_LOGICAL_OR_EXPRESSION }
1169 /* The same as binops, but initialized by cp_parser_new so that
1170 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1172 static cp_parser_binary_operations_map_node binops_by_token[N_CP_TTYPES];
1174 /* Constructors and destructors. */
1176 /* Construct a new context. The context below this one on the stack
1177 is given by NEXT. */
1179 static cp_parser_context *
1180 cp_parser_context_new (cp_parser_context* next)
1182 cp_parser_context *context;
1184 /* Allocate the storage. */
1185 if (cp_parser_context_free_list != NULL)
1187 /* Pull the first entry from the free list. */
1188 context = cp_parser_context_free_list;
1189 cp_parser_context_free_list = context->next;
1190 memset (context, 0, sizeof (*context));
1193 context = GGC_CNEW (cp_parser_context);
1195 /* No errors have occurred yet in this context. */
1196 context->status = CP_PARSER_STATUS_KIND_NO_ERROR;
1197 /* If this is not the bottomost context, copy information that we
1198 need from the previous context. */
1201 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1202 expression, then we are parsing one in this context, too. */
1203 context->object_type = next->object_type;
1204 /* Thread the stack. */
1205 context->next = next;
1211 /* The cp_parser structure represents the C++ parser. */
1213 typedef struct cp_parser GTY(())
1215 /* The lexer from which we are obtaining tokens. */
1218 /* The scope in which names should be looked up. If NULL_TREE, then
1219 we look up names in the scope that is currently open in the
1220 source program. If non-NULL, this is either a TYPE or
1221 NAMESPACE_DECL for the scope in which we should look. It can
1222 also be ERROR_MARK, when we've parsed a bogus scope.
1224 This value is not cleared automatically after a name is looked
1225 up, so we must be careful to clear it before starting a new look
1226 up sequence. (If it is not cleared, then `X::Y' followed by `Z'
1227 will look up `Z' in the scope of `X', rather than the current
1228 scope.) Unfortunately, it is difficult to tell when name lookup
1229 is complete, because we sometimes peek at a token, look it up,
1230 and then decide not to consume it. */
1233 /* OBJECT_SCOPE and QUALIFYING_SCOPE give the scopes in which the
1234 last lookup took place. OBJECT_SCOPE is used if an expression
1235 like "x->y" or "x.y" was used; it gives the type of "*x" or "x",
1236 respectively. QUALIFYING_SCOPE is used for an expression of the
1237 form "X::Y"; it refers to X. */
1239 tree qualifying_scope;
1241 /* A stack of parsing contexts. All but the bottom entry on the
1242 stack will be tentative contexts.
1244 We parse tentatively in order to determine which construct is in
1245 use in some situations. For example, in order to determine
1246 whether a statement is an expression-statement or a
1247 declaration-statement we parse it tentatively as a
1248 declaration-statement. If that fails, we then reparse the same
1249 token stream as an expression-statement. */
1250 cp_parser_context *context;
1252 /* True if we are parsing GNU C++. If this flag is not set, then
1253 GNU extensions are not recognized. */
1254 bool allow_gnu_extensions_p;
1256 /* TRUE if the `>' token should be interpreted as the greater-than
1257 operator. FALSE if it is the end of a template-id or
1258 template-parameter-list. */
1259 bool greater_than_is_operator_p;
1261 /* TRUE if default arguments are allowed within a parameter list
1262 that starts at this point. FALSE if only a gnu extension makes
1263 them permissible. */
1264 bool default_arg_ok_p;
1266 /* TRUE if we are parsing an integral constant-expression. See
1267 [expr.const] for a precise definition. */
1268 bool integral_constant_expression_p;
1270 /* TRUE if we are parsing an integral constant-expression -- but a
1271 non-constant expression should be permitted as well. This flag
1272 is used when parsing an array bound so that GNU variable-length
1273 arrays are tolerated. */
1274 bool allow_non_integral_constant_expression_p;
1276 /* TRUE if ALLOW_NON_CONSTANT_EXPRESSION_P is TRUE and something has
1277 been seen that makes the expression non-constant. */
1278 bool non_integral_constant_expression_p;
1280 /* TRUE if local variable names and `this' are forbidden in the
1282 bool local_variables_forbidden_p;
1284 /* TRUE if the declaration we are parsing is part of a
1285 linkage-specification of the form `extern string-literal
1287 bool in_unbraced_linkage_specification_p;
1289 /* TRUE if we are presently parsing a declarator, after the
1290 direct-declarator. */
1291 bool in_declarator_p;
1293 /* TRUE if we are presently parsing a template-argument-list. */
1294 bool in_template_argument_list_p;
1296 /* TRUE if we are presently parsing the body of an
1297 iteration-statement. */
1298 bool in_iteration_statement_p;
1300 /* TRUE if we are presently parsing the body of a switch
1302 bool in_switch_statement_p;
1304 /* TRUE if we are parsing a type-id in an expression context. In
1305 such a situation, both "type (expr)" and "type (type)" are valid
1307 bool in_type_id_in_expr_p;
1309 /* TRUE if we are currently in a header file where declarations are
1310 implicitly extern "C". */
1311 bool implicit_extern_c;
1313 /* TRUE if strings in expressions should be translated to the execution
1315 bool translate_strings_p;
1317 /* If non-NULL, then we are parsing a construct where new type
1318 definitions are not permitted. The string stored here will be
1319 issued as an error message if a type is defined. */
1320 const char *type_definition_forbidden_message;
1322 /* A list of lists. The outer list is a stack, used for member
1323 functions of local classes. At each level there are two sub-list,
1324 one on TREE_VALUE and one on TREE_PURPOSE. Each of those
1325 sub-lists has a FUNCTION_DECL or TEMPLATE_DECL on their
1326 TREE_VALUE's. The functions are chained in reverse declaration
1329 The TREE_PURPOSE sublist contains those functions with default
1330 arguments that need post processing, and the TREE_VALUE sublist
1331 contains those functions with definitions that need post
1334 These lists can only be processed once the outermost class being
1335 defined is complete. */
1336 tree unparsed_functions_queues;
1338 /* The number of classes whose definitions are currently in
1340 unsigned num_classes_being_defined;
1342 /* The number of template parameter lists that apply directly to the
1343 current declaration. */
1344 unsigned num_template_parameter_lists;
1347 /* The type of a function that parses some kind of expression. */
1348 typedef tree (*cp_parser_expression_fn) (cp_parser *);
1352 /* Constructors and destructors. */
1354 static cp_parser *cp_parser_new
1357 /* Routines to parse various constructs.
1359 Those that return `tree' will return the error_mark_node (rather
1360 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1361 Sometimes, they will return an ordinary node if error-recovery was
1362 attempted, even though a parse error occurred. So, to check
1363 whether or not a parse error occurred, you should always use
1364 cp_parser_error_occurred. If the construct is optional (indicated
1365 either by an `_opt' in the name of the function that does the
1366 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1367 the construct is not present. */
1369 /* Lexical conventions [gram.lex] */
1371 static tree cp_parser_identifier
1373 static tree cp_parser_string_literal
1374 (cp_parser *, bool, bool);
1376 /* Basic concepts [gram.basic] */
1378 static bool cp_parser_translation_unit
1381 /* Expressions [gram.expr] */
1383 static tree cp_parser_primary_expression
1384 (cp_parser *, bool, cp_id_kind *, tree *);
1385 static tree cp_parser_id_expression
1386 (cp_parser *, bool, bool, bool *, bool);
1387 static tree cp_parser_unqualified_id
1388 (cp_parser *, bool, bool, bool);
1389 static tree cp_parser_nested_name_specifier_opt
1390 (cp_parser *, bool, bool, bool, bool);
1391 static tree cp_parser_nested_name_specifier
1392 (cp_parser *, bool, bool, bool, bool);
1393 static tree cp_parser_class_or_namespace_name
1394 (cp_parser *, bool, bool, bool, bool, bool);
1395 static tree cp_parser_postfix_expression
1396 (cp_parser *, bool, bool);
1397 static tree cp_parser_postfix_open_square_expression
1398 (cp_parser *, tree, bool);
1399 static tree cp_parser_postfix_dot_deref_expression
1400 (cp_parser *, enum cpp_ttype, tree, bool, cp_id_kind *);
1401 static tree cp_parser_parenthesized_expression_list
1402 (cp_parser *, bool, bool, bool *);
1403 static void cp_parser_pseudo_destructor_name
1404 (cp_parser *, tree *, tree *);
1405 static tree cp_parser_unary_expression
1406 (cp_parser *, bool, bool);
1407 static enum tree_code cp_parser_unary_operator
1409 static tree cp_parser_new_expression
1411 static tree cp_parser_new_placement
1413 static tree cp_parser_new_type_id
1414 (cp_parser *, tree *);
1415 static cp_declarator *cp_parser_new_declarator_opt
1417 static cp_declarator *cp_parser_direct_new_declarator
1419 static tree cp_parser_new_initializer
1421 static tree cp_parser_delete_expression
1423 static tree cp_parser_cast_expression
1424 (cp_parser *, bool, bool);
1425 static tree cp_parser_binary_expression
1426 (cp_parser *, bool);
1427 static tree cp_parser_question_colon_clause
1428 (cp_parser *, tree);
1429 static tree cp_parser_assignment_expression
1430 (cp_parser *, bool);
1431 static enum tree_code cp_parser_assignment_operator_opt
1433 static tree cp_parser_expression
1434 (cp_parser *, bool);
1435 static tree cp_parser_constant_expression
1436 (cp_parser *, bool, bool *);
1437 static tree cp_parser_builtin_offsetof
1440 /* Statements [gram.stmt.stmt] */
1442 static void cp_parser_statement
1443 (cp_parser *, tree);
1444 static tree cp_parser_labeled_statement
1445 (cp_parser *, tree);
1446 static tree cp_parser_expression_statement
1447 (cp_parser *, tree);
1448 static tree cp_parser_compound_statement
1449 (cp_parser *, tree, bool);
1450 static void cp_parser_statement_seq_opt
1451 (cp_parser *, tree);
1452 static tree cp_parser_selection_statement
1454 static tree cp_parser_condition
1456 static tree cp_parser_iteration_statement
1458 static void cp_parser_for_init_statement
1460 static tree cp_parser_jump_statement
1462 static void cp_parser_declaration_statement
1465 static tree cp_parser_implicitly_scoped_statement
1467 static void cp_parser_already_scoped_statement
1470 /* Declarations [gram.dcl.dcl] */
1472 static void cp_parser_declaration_seq_opt
1474 static void cp_parser_declaration
1476 static void cp_parser_block_declaration
1477 (cp_parser *, bool);
1478 static void cp_parser_simple_declaration
1479 (cp_parser *, bool);
1480 static void cp_parser_decl_specifier_seq
1481 (cp_parser *, cp_parser_flags, cp_decl_specifier_seq *, int *);
1482 static tree cp_parser_storage_class_specifier_opt
1484 static tree cp_parser_function_specifier_opt
1485 (cp_parser *, cp_decl_specifier_seq *);
1486 static tree cp_parser_type_specifier
1487 (cp_parser *, cp_parser_flags, cp_decl_specifier_seq *, bool,
1489 static tree cp_parser_simple_type_specifier
1490 (cp_parser *, cp_decl_specifier_seq *, cp_parser_flags);
1491 static tree cp_parser_type_name
1493 static tree cp_parser_elaborated_type_specifier
1494 (cp_parser *, bool, bool);
1495 static tree cp_parser_enum_specifier
1497 static void cp_parser_enumerator_list
1498 (cp_parser *, tree);
1499 static void cp_parser_enumerator_definition
1500 (cp_parser *, tree);
1501 static tree cp_parser_namespace_name
1503 static void cp_parser_namespace_definition
1505 static void cp_parser_namespace_body
1507 static tree cp_parser_qualified_namespace_specifier
1509 static void cp_parser_namespace_alias_definition
1511 static void cp_parser_using_declaration
1513 static void cp_parser_using_directive
1515 static void cp_parser_asm_definition
1517 static void cp_parser_linkage_specification
1520 /* Declarators [gram.dcl.decl] */
1522 static tree cp_parser_init_declarator
1523 (cp_parser *, cp_decl_specifier_seq *, bool, bool, int, bool *);
1524 static cp_declarator *cp_parser_declarator
1525 (cp_parser *, cp_parser_declarator_kind, int *, bool *, bool);
1526 static cp_declarator *cp_parser_direct_declarator
1527 (cp_parser *, cp_parser_declarator_kind, int *, bool);
1528 static enum tree_code cp_parser_ptr_operator
1529 (cp_parser *, tree *, cp_cv_quals *);
1530 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
1532 static tree cp_parser_declarator_id
1534 static tree cp_parser_type_id
1536 static void cp_parser_type_specifier_seq
1537 (cp_parser *, bool, cp_decl_specifier_seq *);
1538 static cp_parameter_declarator *cp_parser_parameter_declaration_clause
1540 static cp_parameter_declarator *cp_parser_parameter_declaration_list
1541 (cp_parser *, bool *);
1542 static cp_parameter_declarator *cp_parser_parameter_declaration
1543 (cp_parser *, bool, bool *);
1544 static void cp_parser_function_body
1546 static tree cp_parser_initializer
1547 (cp_parser *, bool *, bool *);
1548 static tree cp_parser_initializer_clause
1549 (cp_parser *, bool *);
1550 static VEC(constructor_elt,gc) *cp_parser_initializer_list
1551 (cp_parser *, bool *);
1553 static bool cp_parser_ctor_initializer_opt_and_function_body
1556 /* Classes [gram.class] */
1558 static tree cp_parser_class_name
1559 (cp_parser *, bool, bool, enum tag_types, bool, bool, bool);
1560 static tree cp_parser_class_specifier
1562 static tree cp_parser_class_head
1563 (cp_parser *, bool *, tree *);
1564 static enum tag_types cp_parser_class_key
1566 static void cp_parser_member_specification_opt
1568 static void cp_parser_member_declaration
1570 static tree cp_parser_pure_specifier
1572 static tree cp_parser_constant_initializer
1575 /* Derived classes [gram.class.derived] */
1577 static tree cp_parser_base_clause
1579 static tree cp_parser_base_specifier
1582 /* Special member functions [gram.special] */
1584 static tree cp_parser_conversion_function_id
1586 static tree cp_parser_conversion_type_id
1588 static cp_declarator *cp_parser_conversion_declarator_opt
1590 static bool cp_parser_ctor_initializer_opt
1592 static void cp_parser_mem_initializer_list
1594 static tree cp_parser_mem_initializer
1596 static tree cp_parser_mem_initializer_id
1599 /* Overloading [gram.over] */
1601 static tree cp_parser_operator_function_id
1603 static tree cp_parser_operator
1606 /* Templates [gram.temp] */
1608 static void cp_parser_template_declaration
1609 (cp_parser *, bool);
1610 static tree cp_parser_template_parameter_list
1612 static tree cp_parser_template_parameter
1613 (cp_parser *, bool *);
1614 static tree cp_parser_type_parameter
1616 static tree cp_parser_template_id
1617 (cp_parser *, bool, bool, bool);
1618 static tree cp_parser_template_name
1619 (cp_parser *, bool, bool, bool, bool *);
1620 static tree cp_parser_template_argument_list
1622 static tree cp_parser_template_argument
1624 static void cp_parser_explicit_instantiation
1626 static void cp_parser_explicit_specialization
1629 /* Exception handling [gram.exception] */
1631 static tree cp_parser_try_block
1633 static bool cp_parser_function_try_block
1635 static void cp_parser_handler_seq
1637 static void cp_parser_handler
1639 static tree cp_parser_exception_declaration
1641 static tree cp_parser_throw_expression
1643 static tree cp_parser_exception_specification_opt
1645 static tree cp_parser_type_id_list
1648 /* GNU Extensions */
1650 static tree cp_parser_asm_specification_opt
1652 static tree cp_parser_asm_operand_list
1654 static tree cp_parser_asm_clobber_list
1656 static tree cp_parser_attributes_opt
1658 static tree cp_parser_attribute_list
1660 static bool cp_parser_extension_opt
1661 (cp_parser *, int *);
1662 static void cp_parser_label_declaration
1665 /* Objective-C++ Productions */
1667 static tree cp_parser_objc_message_receiver
1669 static tree cp_parser_objc_message_args
1671 static tree cp_parser_objc_message_expression
1673 static tree cp_parser_objc_encode_expression
1675 static tree cp_parser_objc_defs_expression
1677 static tree cp_parser_objc_protocol_expression
1679 static tree cp_parser_objc_selector_expression
1681 static tree cp_parser_objc_expression
1683 static bool cp_parser_objc_selector_p
1685 static tree cp_parser_objc_selector
1687 static tree cp_parser_objc_protocol_refs_opt
1689 static void cp_parser_objc_declaration
1691 static tree cp_parser_objc_statement
1694 /* Utility Routines */
1696 static tree cp_parser_lookup_name
1697 (cp_parser *, tree, enum tag_types, bool, bool, bool, bool *);
1698 static tree cp_parser_lookup_name_simple
1699 (cp_parser *, tree);
1700 static tree cp_parser_maybe_treat_template_as_class
1702 static bool cp_parser_check_declarator_template_parameters
1703 (cp_parser *, cp_declarator *);
1704 static bool cp_parser_check_template_parameters
1705 (cp_parser *, unsigned);
1706 static tree cp_parser_simple_cast_expression
1708 static tree cp_parser_global_scope_opt
1709 (cp_parser *, bool);
1710 static bool cp_parser_constructor_declarator_p
1711 (cp_parser *, bool);
1712 static tree cp_parser_function_definition_from_specifiers_and_declarator
1713 (cp_parser *, cp_decl_specifier_seq *, tree, const cp_declarator *);
1714 static tree cp_parser_function_definition_after_declarator
1715 (cp_parser *, bool);
1716 static void cp_parser_template_declaration_after_export
1717 (cp_parser *, bool);
1718 static tree cp_parser_single_declaration
1719 (cp_parser *, bool, bool *);
1720 static tree cp_parser_functional_cast
1721 (cp_parser *, tree);
1722 static tree cp_parser_save_member_function_body
1723 (cp_parser *, cp_decl_specifier_seq *, cp_declarator *, tree);
1724 static tree cp_parser_enclosed_template_argument_list
1726 static void cp_parser_save_default_args
1727 (cp_parser *, tree);
1728 static void cp_parser_late_parsing_for_member
1729 (cp_parser *, tree);
1730 static void cp_parser_late_parsing_default_args
1731 (cp_parser *, tree);
1732 static tree cp_parser_sizeof_operand
1733 (cp_parser *, enum rid);
1734 static bool cp_parser_declares_only_class_p
1736 static void cp_parser_set_storage_class
1737 (cp_decl_specifier_seq *, cp_storage_class);
1738 static void cp_parser_set_decl_spec_type
1739 (cp_decl_specifier_seq *, tree, bool);
1740 static bool cp_parser_friend_p
1741 (const cp_decl_specifier_seq *);
1742 static cp_token *cp_parser_require
1743 (cp_parser *, enum cpp_ttype, const char *);
1744 static cp_token *cp_parser_require_keyword
1745 (cp_parser *, enum rid, const char *);
1746 static bool cp_parser_token_starts_function_definition_p
1748 static bool cp_parser_next_token_starts_class_definition_p
1750 static bool cp_parser_next_token_ends_template_argument_p
1752 static bool cp_parser_nth_token_starts_template_argument_list_p
1753 (cp_parser *, size_t);
1754 static enum tag_types cp_parser_token_is_class_key
1756 static void cp_parser_check_class_key
1757 (enum tag_types, tree type);
1758 static void cp_parser_check_access_in_redeclaration
1760 static bool cp_parser_optional_template_keyword
1762 static void cp_parser_pre_parsed_nested_name_specifier
1764 static void cp_parser_cache_group
1765 (cp_parser *, enum cpp_ttype, unsigned);
1766 static void cp_parser_parse_tentatively
1768 static void cp_parser_commit_to_tentative_parse
1770 static void cp_parser_abort_tentative_parse
1772 static bool cp_parser_parse_definitely
1774 static inline bool cp_parser_parsing_tentatively
1776 static bool cp_parser_uncommitted_to_tentative_parse_p
1778 static void cp_parser_error
1779 (cp_parser *, const char *);
1780 static void cp_parser_name_lookup_error
1781 (cp_parser *, tree, tree, const char *);
1782 static bool cp_parser_simulate_error
1784 static void cp_parser_check_type_definition
1786 static void cp_parser_check_for_definition_in_return_type
1787 (cp_declarator *, tree);
1788 static void cp_parser_check_for_invalid_template_id
1789 (cp_parser *, tree);
1790 static bool cp_parser_non_integral_constant_expression
1791 (cp_parser *, const char *);
1792 static void cp_parser_diagnose_invalid_type_name
1793 (cp_parser *, tree, tree);
1794 static bool cp_parser_parse_and_diagnose_invalid_type_name
1796 static int cp_parser_skip_to_closing_parenthesis
1797 (cp_parser *, bool, bool, bool);
1798 static void cp_parser_skip_to_end_of_statement
1800 static void cp_parser_consume_semicolon_at_end_of_statement
1802 static void cp_parser_skip_to_end_of_block_or_statement
1804 static void cp_parser_skip_to_closing_brace
1806 static void cp_parser_skip_until_found
1807 (cp_parser *, enum cpp_ttype, const char *);
1808 static bool cp_parser_error_occurred
1810 static bool cp_parser_allow_gnu_extensions_p
1812 static bool cp_parser_is_string_literal
1814 static bool cp_parser_is_keyword
1815 (cp_token *, enum rid);
1816 static tree cp_parser_make_typename_type
1817 (cp_parser *, tree, tree);
1819 /* Returns nonzero if we are parsing tentatively. */
1822 cp_parser_parsing_tentatively (cp_parser* parser)
1824 return parser->context->next != NULL;
1827 /* Returns nonzero if TOKEN is a string literal. */
1830 cp_parser_is_string_literal (cp_token* token)
1832 return (token->type == CPP_STRING || token->type == CPP_WSTRING);
1835 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
1838 cp_parser_is_keyword (cp_token* token, enum rid keyword)
1840 return token->keyword == keyword;
1843 /* A minimum or maximum operator has been seen. As these are
1844 deprecated, issue a warning. */
1847 cp_parser_warn_min_max (void)
1849 if (warn_deprecated && !in_system_header)
1850 warning (0, "minimum/maximum operators are deprecated");
1853 /* If not parsing tentatively, issue a diagnostic of the form
1854 FILE:LINE: MESSAGE before TOKEN
1855 where TOKEN is the next token in the input stream. MESSAGE
1856 (specified by the caller) is usually of the form "expected
1860 cp_parser_error (cp_parser* parser, const char* message)
1862 if (!cp_parser_simulate_error (parser))
1864 cp_token *token = cp_lexer_peek_token (parser->lexer);
1865 /* This diagnostic makes more sense if it is tagged to the line
1866 of the token we just peeked at. */
1867 cp_lexer_set_source_position_from_token (token);
1868 if (token->type == CPP_PRAGMA)
1870 error ("%<#pragma%> is not allowed here");
1871 cp_lexer_purge_token (parser->lexer);
1874 c_parse_error (message,
1875 /* Because c_parser_error does not understand
1876 CPP_KEYWORD, keywords are treated like
1878 (token->type == CPP_KEYWORD ? CPP_NAME : token->type),
1883 /* Issue an error about name-lookup failing. NAME is the
1884 IDENTIFIER_NODE DECL is the result of
1885 the lookup (as returned from cp_parser_lookup_name). DESIRED is
1886 the thing that we hoped to find. */
1889 cp_parser_name_lookup_error (cp_parser* parser,
1892 const char* desired)
1894 /* If name lookup completely failed, tell the user that NAME was not
1896 if (decl == error_mark_node)
1898 if (parser->scope && parser->scope != global_namespace)
1899 error ("%<%D::%D%> has not been declared",
1900 parser->scope, name);
1901 else if (parser->scope == global_namespace)
1902 error ("%<::%D%> has not been declared", name);
1903 else if (parser->object_scope
1904 && !CLASS_TYPE_P (parser->object_scope))
1905 error ("request for member %qD in non-class type %qT",
1906 name, parser->object_scope);
1907 else if (parser->object_scope)
1908 error ("%<%T::%D%> has not been declared",
1909 parser->object_scope, name);
1911 error ("%qD has not been declared", name);
1913 else if (parser->scope && parser->scope != global_namespace)
1914 error ("%<%D::%D%> %s", parser->scope, name, desired);
1915 else if (parser->scope == global_namespace)
1916 error ("%<::%D%> %s", name, desired);
1918 error ("%qD %s", name, desired);
1921 /* If we are parsing tentatively, remember that an error has occurred
1922 during this tentative parse. Returns true if the error was
1923 simulated; false if a message should be issued by the caller. */
1926 cp_parser_simulate_error (cp_parser* parser)
1928 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
1930 parser->context->status = CP_PARSER_STATUS_KIND_ERROR;
1936 /* This function is called when a type is defined. If type
1937 definitions are forbidden at this point, an error message is
1941 cp_parser_check_type_definition (cp_parser* parser)
1943 /* If types are forbidden here, issue a message. */
1944 if (parser->type_definition_forbidden_message)
1945 /* Use `%s' to print the string in case there are any escape
1946 characters in the message. */
1947 error ("%s", parser->type_definition_forbidden_message);
1950 /* This function is called when the DECLARATOR is processed. The TYPE
1951 was a type defined in the decl-specifiers. If it is invalid to
1952 define a type in the decl-specifiers for DECLARATOR, an error is
1956 cp_parser_check_for_definition_in_return_type (cp_declarator *declarator,
1959 /* [dcl.fct] forbids type definitions in return types.
1960 Unfortunately, it's not easy to know whether or not we are
1961 processing a return type until after the fact. */
1963 && (declarator->kind == cdk_pointer
1964 || declarator->kind == cdk_reference
1965 || declarator->kind == cdk_ptrmem))
1966 declarator = declarator->declarator;
1968 && declarator->kind == cdk_function)
1970 error ("new types may not be defined in a return type");
1971 inform ("(perhaps a semicolon is missing after the definition of %qT)",
1976 /* A type-specifier (TYPE) has been parsed which cannot be followed by
1977 "<" in any valid C++ program. If the next token is indeed "<",
1978 issue a message warning the user about what appears to be an
1979 invalid attempt to form a template-id. */
1982 cp_parser_check_for_invalid_template_id (cp_parser* parser,
1985 cp_token_position start = 0;
1987 if (cp_lexer_next_token_is (parser->lexer, CPP_LESS))
1990 error ("%qT is not a template", type);
1991 else if (TREE_CODE (type) == IDENTIFIER_NODE)
1992 error ("%qE is not a template", type);
1994 error ("invalid template-id");
1995 /* Remember the location of the invalid "<". */
1996 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
1997 start = cp_lexer_token_position (parser->lexer, true);
1998 /* Consume the "<". */
1999 cp_lexer_consume_token (parser->lexer);
2000 /* Parse the template arguments. */
2001 cp_parser_enclosed_template_argument_list (parser);
2002 /* Permanently remove the invalid template arguments so that
2003 this error message is not issued again. */
2005 cp_lexer_purge_tokens_after (parser->lexer, start);
2009 /* If parsing an integral constant-expression, issue an error message
2010 about the fact that THING appeared and return true. Otherwise,
2011 return false. In either case, set
2012 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2015 cp_parser_non_integral_constant_expression (cp_parser *parser,
2018 parser->non_integral_constant_expression_p = true;
2019 if (parser->integral_constant_expression_p)
2021 if (!parser->allow_non_integral_constant_expression_p)
2023 error ("%s cannot appear in a constant-expression", thing);
2030 /* Emit a diagnostic for an invalid type name. SCOPE is the
2031 qualifying scope (or NULL, if none) for ID. This function commits
2032 to the current active tentative parse, if any. (Otherwise, the
2033 problematic construct might be encountered again later, resulting
2034 in duplicate error messages.) */
2037 cp_parser_diagnose_invalid_type_name (cp_parser *parser, tree scope, tree id)
2039 tree decl, old_scope;
2040 /* Try to lookup the identifier. */
2041 old_scope = parser->scope;
2042 parser->scope = scope;
2043 decl = cp_parser_lookup_name_simple (parser, id);
2044 parser->scope = old_scope;
2045 /* If the lookup found a template-name, it means that the user forgot
2046 to specify an argument list. Emit a useful error message. */
2047 if (TREE_CODE (decl) == TEMPLATE_DECL)
2048 error ("invalid use of template-name %qE without an argument list",
2050 else if (!parser->scope || parser->scope == error_mark_node)
2052 /* Issue an error message. */
2053 error ("%qE does not name a type", id);
2054 /* If we're in a template class, it's possible that the user was
2055 referring to a type from a base class. For example:
2057 template <typename T> struct A { typedef T X; };
2058 template <typename T> struct B : public A<T> { X x; };
2060 The user should have said "typename A<T>::X". */
2061 if (processing_template_decl && current_class_type
2062 && TYPE_BINFO (current_class_type))
2066 for (b = TREE_CHAIN (TYPE_BINFO (current_class_type));
2070 tree base_type = BINFO_TYPE (b);
2071 if (CLASS_TYPE_P (base_type)
2072 && dependent_type_p (base_type))
2075 /* Go from a particular instantiation of the
2076 template (which will have an empty TYPE_FIELDs),
2077 to the main version. */
2078 base_type = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (base_type);
2079 for (field = TYPE_FIELDS (base_type);
2081 field = TREE_CHAIN (field))
2082 if (TREE_CODE (field) == TYPE_DECL
2083 && DECL_NAME (field) == id)
2085 inform ("(perhaps %<typename %T::%E%> was intended)",
2086 BINFO_TYPE (b), id);
2095 /* Here we diagnose qualified-ids where the scope is actually correct,
2096 but the identifier does not resolve to a valid type name. */
2099 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
2100 error ("%qE in namespace %qE does not name a type",
2102 else if (TYPE_P (parser->scope))
2103 error ("%qE in class %qT does not name a type", id, parser->scope);
2107 cp_parser_commit_to_tentative_parse (parser);
2110 /* Check for a common situation where a type-name should be present,
2111 but is not, and issue a sensible error message. Returns true if an
2112 invalid type-name was detected.
2114 The situation handled by this function are variable declarations of the
2115 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2116 Usually, `ID' should name a type, but if we got here it means that it
2117 does not. We try to emit the best possible error message depending on
2118 how exactly the id-expression looks like.
2122 cp_parser_parse_and_diagnose_invalid_type_name (cp_parser *parser)
2126 cp_parser_parse_tentatively (parser);
2127 id = cp_parser_id_expression (parser,
2128 /*template_keyword_p=*/false,
2129 /*check_dependency_p=*/true,
2130 /*template_p=*/NULL,
2131 /*declarator_p=*/true);
2132 /* After the id-expression, there should be a plain identifier,
2133 otherwise this is not a simple variable declaration. Also, if
2134 the scope is dependent, we cannot do much. */
2135 if (!cp_lexer_next_token_is (parser->lexer, CPP_NAME)
2136 || (parser->scope && TYPE_P (parser->scope)
2137 && dependent_type_p (parser->scope)))
2139 cp_parser_abort_tentative_parse (parser);
2142 if (!cp_parser_parse_definitely (parser)
2143 || TREE_CODE (id) != IDENTIFIER_NODE)
2146 /* Emit a diagnostic for the invalid type. */
2147 cp_parser_diagnose_invalid_type_name (parser, parser->scope, id);
2148 /* Skip to the end of the declaration; there's no point in
2149 trying to process it. */
2150 cp_parser_skip_to_end_of_block_or_statement (parser);
2154 /* Consume tokens up to, and including, the next non-nested closing `)'.
2155 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2156 are doing error recovery. Returns -1 if OR_COMMA is true and we
2157 found an unnested comma. */
2160 cp_parser_skip_to_closing_parenthesis (cp_parser *parser,
2165 unsigned paren_depth = 0;
2166 unsigned brace_depth = 0;
2169 if (recovering && !or_comma
2170 && cp_parser_uncommitted_to_tentative_parse_p (parser))
2177 /* If we've run out of tokens, then there is no closing `)'. */
2178 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
2184 token = cp_lexer_peek_token (parser->lexer);
2186 /* This matches the processing in skip_to_end_of_statement. */
2187 if (token->type == CPP_SEMICOLON && !brace_depth)
2192 if (token->type == CPP_OPEN_BRACE)
2194 if (token->type == CPP_CLOSE_BRACE)
2202 if (recovering && or_comma && token->type == CPP_COMMA
2203 && !brace_depth && !paren_depth)
2211 /* If it is an `(', we have entered another level of nesting. */
2212 if (token->type == CPP_OPEN_PAREN)
2214 /* If it is a `)', then we might be done. */
2215 else if (token->type == CPP_CLOSE_PAREN && !paren_depth--)
2218 cp_lexer_consume_token (parser->lexer);
2226 /* Consume the token. */
2227 cp_lexer_consume_token (parser->lexer);
2233 /* Consume tokens until we reach the end of the current statement.
2234 Normally, that will be just before consuming a `;'. However, if a
2235 non-nested `}' comes first, then we stop before consuming that. */
2238 cp_parser_skip_to_end_of_statement (cp_parser* parser)
2240 unsigned nesting_depth = 0;
2246 /* Peek at the next token. */
2247 token = cp_lexer_peek_token (parser->lexer);
2248 /* If we've run out of tokens, stop. */
2249 if (token->type == CPP_EOF)
2251 /* If the next token is a `;', we have reached the end of the
2253 if (token->type == CPP_SEMICOLON && !nesting_depth)
2255 /* If the next token is a non-nested `}', then we have reached
2256 the end of the current block. */
2257 if (token->type == CPP_CLOSE_BRACE)
2259 /* If this is a non-nested `}', stop before consuming it.
2260 That way, when confronted with something like:
2264 we stop before consuming the closing `}', even though we
2265 have not yet reached a `;'. */
2266 if (nesting_depth == 0)
2268 /* If it is the closing `}' for a block that we have
2269 scanned, stop -- but only after consuming the token.
2275 we will stop after the body of the erroneously declared
2276 function, but before consuming the following `typedef'
2278 if (--nesting_depth == 0)
2280 cp_lexer_consume_token (parser->lexer);
2284 /* If it the next token is a `{', then we are entering a new
2285 block. Consume the entire block. */
2286 else if (token->type == CPP_OPEN_BRACE)
2288 /* Consume the token. */
2289 cp_lexer_consume_token (parser->lexer);
2293 /* This function is called at the end of a statement or declaration.
2294 If the next token is a semicolon, it is consumed; otherwise, error
2295 recovery is attempted. */
2298 cp_parser_consume_semicolon_at_end_of_statement (cp_parser *parser)
2300 /* Look for the trailing `;'. */
2301 if (!cp_parser_require (parser, CPP_SEMICOLON, "`;'"))
2303 /* If there is additional (erroneous) input, skip to the end of
2305 cp_parser_skip_to_end_of_statement (parser);
2306 /* If the next token is now a `;', consume it. */
2307 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
2308 cp_lexer_consume_token (parser->lexer);
2312 /* Skip tokens until we have consumed an entire block, or until we
2313 have consumed a non-nested `;'. */
2316 cp_parser_skip_to_end_of_block_or_statement (cp_parser* parser)
2318 int nesting_depth = 0;
2320 while (nesting_depth >= 0)
2322 cp_token *token = cp_lexer_peek_token (parser->lexer);
2324 if (token->type == CPP_EOF)
2327 switch (token->type)
2330 /* If we've run out of tokens, stop. */
2335 /* Stop if this is an unnested ';'. */
2340 case CPP_CLOSE_BRACE:
2341 /* Stop if this is an unnested '}', or closes the outermost
2348 case CPP_OPEN_BRACE:
2357 /* Consume the token. */
2358 cp_lexer_consume_token (parser->lexer);
2363 /* Skip tokens until a non-nested closing curly brace is the next
2367 cp_parser_skip_to_closing_brace (cp_parser *parser)
2369 unsigned nesting_depth = 0;
2375 /* Peek at the next token. */
2376 token = cp_lexer_peek_token (parser->lexer);
2377 /* If we've run out of tokens, stop. */
2378 if (token->type == CPP_EOF)
2380 /* If the next token is a non-nested `}', then we have reached
2381 the end of the current block. */
2382 if (token->type == CPP_CLOSE_BRACE && nesting_depth-- == 0)
2384 /* If it the next token is a `{', then we are entering a new
2385 block. Consume the entire block. */
2386 else if (token->type == CPP_OPEN_BRACE)
2388 /* Consume the token. */
2389 cp_lexer_consume_token (parser->lexer);
2393 /* This is a simple wrapper around make_typename_type. When the id is
2394 an unresolved identifier node, we can provide a superior diagnostic
2395 using cp_parser_diagnose_invalid_type_name. */
2398 cp_parser_make_typename_type (cp_parser *parser, tree scope, tree id)
2401 if (TREE_CODE (id) == IDENTIFIER_NODE)
2403 result = make_typename_type (scope, id, typename_type,
2405 if (result == error_mark_node)
2406 cp_parser_diagnose_invalid_type_name (parser, scope, id);
2409 return make_typename_type (scope, id, typename_type, tf_error);
2413 /* Create a new C++ parser. */
2416 cp_parser_new (void)
2422 /* cp_lexer_new_main is called before calling ggc_alloc because
2423 cp_lexer_new_main might load a PCH file. */
2424 lexer = cp_lexer_new_main ();
2426 /* Initialize the binops_by_token so that we can get the tree
2427 directly from the token. */
2428 for (i = 0; i < sizeof (binops) / sizeof (binops[0]); i++)
2429 binops_by_token[binops[i].token_type] = binops[i];
2431 parser = GGC_CNEW (cp_parser);
2432 parser->lexer = lexer;
2433 parser->context = cp_parser_context_new (NULL);
2435 /* For now, we always accept GNU extensions. */
2436 parser->allow_gnu_extensions_p = 1;
2438 /* The `>' token is a greater-than operator, not the end of a
2440 parser->greater_than_is_operator_p = true;
2442 parser->default_arg_ok_p = true;
2444 /* We are not parsing a constant-expression. */
2445 parser->integral_constant_expression_p = false;
2446 parser->allow_non_integral_constant_expression_p = false;
2447 parser->non_integral_constant_expression_p = false;
2449 /* Local variable names are not forbidden. */
2450 parser->local_variables_forbidden_p = false;
2452 /* We are not processing an `extern "C"' declaration. */
2453 parser->in_unbraced_linkage_specification_p = false;
2455 /* We are not processing a declarator. */
2456 parser->in_declarator_p = false;
2458 /* We are not processing a template-argument-list. */
2459 parser->in_template_argument_list_p = false;
2461 /* We are not in an iteration statement. */
2462 parser->in_iteration_statement_p = false;
2464 /* We are not in a switch statement. */
2465 parser->in_switch_statement_p = false;
2467 /* We are not parsing a type-id inside an expression. */
2468 parser->in_type_id_in_expr_p = false;
2470 /* Declarations aren't implicitly extern "C". */
2471 parser->implicit_extern_c = false;
2473 /* String literals should be translated to the execution character set. */
2474 parser->translate_strings_p = true;
2476 /* The unparsed function queue is empty. */
2477 parser->unparsed_functions_queues = build_tree_list (NULL_TREE, NULL_TREE);
2479 /* There are no classes being defined. */
2480 parser->num_classes_being_defined = 0;
2482 /* No template parameters apply. */
2483 parser->num_template_parameter_lists = 0;
2488 /* Create a cp_lexer structure which will emit the tokens in CACHE
2489 and push it onto the parser's lexer stack. This is used for delayed
2490 parsing of in-class method bodies and default arguments, and should
2491 not be confused with tentative parsing. */
2493 cp_parser_push_lexer_for_tokens (cp_parser *parser, cp_token_cache *cache)
2495 cp_lexer *lexer = cp_lexer_new_from_tokens (cache);
2496 lexer->next = parser->lexer;
2497 parser->lexer = lexer;
2499 /* Move the current source position to that of the first token in the
2501 cp_lexer_set_source_position_from_token (lexer->next_token);
2504 /* Pop the top lexer off the parser stack. This is never used for the
2505 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
2507 cp_parser_pop_lexer (cp_parser *parser)
2509 cp_lexer *lexer = parser->lexer;
2510 parser->lexer = lexer->next;
2511 cp_lexer_destroy (lexer);
2513 /* Put the current source position back where it was before this
2514 lexer was pushed. */
2515 cp_lexer_set_source_position_from_token (parser->lexer->next_token);
2518 /* Lexical conventions [gram.lex] */
2520 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
2524 cp_parser_identifier (cp_parser* parser)
2528 /* Look for the identifier. */
2529 token = cp_parser_require (parser, CPP_NAME, "identifier");
2530 /* Return the value. */
2531 return token ? token->value : error_mark_node;
2534 /* Parse a sequence of adjacent string constants. Returns a
2535 TREE_STRING representing the combined, nul-terminated string
2536 constant. If TRANSLATE is true, translate the string to the
2537 execution character set. If WIDE_OK is true, a wide string is
2540 C++98 [lex.string] says that if a narrow string literal token is
2541 adjacent to a wide string literal token, the behavior is undefined.
2542 However, C99 6.4.5p4 says that this results in a wide string literal.
2543 We follow C99 here, for consistency with the C front end.
2545 This code is largely lifted from lex_string() in c-lex.c.
2547 FUTURE: ObjC++ will need to handle @-strings here. */
2549 cp_parser_string_literal (cp_parser *parser, bool translate, bool wide_ok)
2554 struct obstack str_ob;
2555 cpp_string str, istr, *strs;
2558 tok = cp_lexer_peek_token (parser->lexer);
2559 if (!cp_parser_is_string_literal (tok))
2561 cp_parser_error (parser, "expected string-literal");
2562 return error_mark_node;
2565 /* Try to avoid the overhead of creating and destroying an obstack
2566 for the common case of just one string. */
2567 if (!cp_parser_is_string_literal
2568 (cp_lexer_peek_nth_token (parser->lexer, 2)))
2570 cp_lexer_consume_token (parser->lexer);
2572 str.text = (const unsigned char *)TREE_STRING_POINTER (tok->value);
2573 str.len = TREE_STRING_LENGTH (tok->value);
2575 if (tok->type == CPP_WSTRING)
2582 gcc_obstack_init (&str_ob);
2587 cp_lexer_consume_token (parser->lexer);
2589 str.text = (unsigned char *)TREE_STRING_POINTER (tok->value);
2590 str.len = TREE_STRING_LENGTH (tok->value);
2591 if (tok->type == CPP_WSTRING)
2594 obstack_grow (&str_ob, &str, sizeof (cpp_string));
2596 tok = cp_lexer_peek_token (parser->lexer);
2598 while (cp_parser_is_string_literal (tok));
2600 strs = (cpp_string *) obstack_finish (&str_ob);
2603 if (wide && !wide_ok)
2605 cp_parser_error (parser, "a wide string is invalid in this context");
2609 if ((translate ? cpp_interpret_string : cpp_interpret_string_notranslate)
2610 (parse_in, strs, count, &istr, wide))
2612 value = build_string (istr.len, (char *)istr.text);
2613 free ((void *)istr.text);
2615 TREE_TYPE (value) = wide ? wchar_array_type_node : char_array_type_node;
2616 value = fix_string_type (value);
2619 /* cpp_interpret_string has issued an error. */
2620 value = error_mark_node;
2623 obstack_free (&str_ob, 0);
2629 /* Basic concepts [gram.basic] */
2631 /* Parse a translation-unit.
2634 declaration-seq [opt]
2636 Returns TRUE if all went well. */
2639 cp_parser_translation_unit (cp_parser* parser)
2641 /* The address of the first non-permanent object on the declarator
2643 static void *declarator_obstack_base;
2647 /* Create the declarator obstack, if necessary. */
2648 if (!cp_error_declarator)
2650 gcc_obstack_init (&declarator_obstack);
2651 /* Create the error declarator. */
2652 cp_error_declarator = make_declarator (cdk_error);
2653 /* Create the empty parameter list. */
2654 no_parameters = make_parameter_declarator (NULL, NULL, NULL_TREE);
2655 /* Remember where the base of the declarator obstack lies. */
2656 declarator_obstack_base = obstack_next_free (&declarator_obstack);
2659 cp_parser_declaration_seq_opt (parser);
2661 /* If there are no tokens left then all went well. */
2662 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
2664 /* Get rid of the token array; we don't need it any more. */
2665 cp_lexer_destroy (parser->lexer);
2666 parser->lexer = NULL;
2668 /* This file might have been a context that's implicitly extern
2669 "C". If so, pop the lang context. (Only relevant for PCH.) */
2670 if (parser->implicit_extern_c)
2672 pop_lang_context ();
2673 parser->implicit_extern_c = false;
2677 finish_translation_unit ();
2683 cp_parser_error (parser, "expected declaration");
2687 /* Make sure the declarator obstack was fully cleaned up. */
2688 gcc_assert (obstack_next_free (&declarator_obstack)
2689 == declarator_obstack_base);
2691 /* All went well. */
2695 /* Expressions [gram.expr] */
2697 /* Parse a primary-expression.
2708 ( compound-statement )
2709 __builtin_va_arg ( assignment-expression , type-id )
2711 Objective-C++ Extension:
2719 CAST_P is true if this primary expression is the target of a cast.
2721 Returns a representation of the expression.
2723 *IDK indicates what kind of id-expression (if any) was present.
2725 *QUALIFYING_CLASS is set to a non-NULL value if the id-expression can be
2726 used as the operand of a pointer-to-member. In that case,
2727 *QUALIFYING_CLASS gives the class that is used as the qualifying
2728 class in the pointer-to-member. */
2731 cp_parser_primary_expression (cp_parser *parser,
2734 tree *qualifying_class)
2738 /* Assume the primary expression is not an id-expression. */
2739 *idk = CP_ID_KIND_NONE;
2740 /* And that it cannot be used as pointer-to-member. */
2741 *qualifying_class = NULL_TREE;
2743 /* Peek at the next token. */
2744 token = cp_lexer_peek_token (parser->lexer);
2745 switch (token->type)
2756 token = cp_lexer_consume_token (parser->lexer);
2757 /* Floating-point literals are only allowed in an integral
2758 constant expression if they are cast to an integral or
2759 enumeration type. */
2760 if (TREE_CODE (token->value) == REAL_CST
2761 && parser->integral_constant_expression_p
2764 /* CAST_P will be set even in invalid code like "int(2.7 +
2765 ...)". Therefore, we have to check that the next token
2766 is sure to end the cast. */
2769 cp_token *next_token;
2771 next_token = cp_lexer_peek_token (parser->lexer);
2772 if (/* The comma at the end of an
2773 enumerator-definition. */
2774 next_token->type != CPP_COMMA
2775 /* The curly brace at the end of an enum-specifier. */
2776 && next_token->type != CPP_CLOSE_BRACE
2777 /* The end of a statement. */
2778 && next_token->type != CPP_SEMICOLON
2779 /* The end of the cast-expression. */
2780 && next_token->type != CPP_CLOSE_PAREN
2781 /* The end of an array bound. */
2782 && next_token->type != CPP_CLOSE_SQUARE
2783 /* The closing ">" in a template-argument-list. */
2784 && (next_token->type != CPP_GREATER
2785 || parser->greater_than_is_operator_p))
2789 /* If we are within a cast, then the constraint that the
2790 cast is to an integral or enumeration type will be
2791 checked at that point. If we are not within a cast, then
2792 this code is invalid. */
2794 cp_parser_non_integral_constant_expression
2795 (parser, "floating-point literal");
2797 return token->value;
2801 /* ??? Should wide strings be allowed when parser->translate_strings_p
2802 is false (i.e. in attributes)? If not, we can kill the third
2803 argument to cp_parser_string_literal. */
2804 return cp_parser_string_literal (parser,
2805 parser->translate_strings_p,
2808 case CPP_OPEN_PAREN:
2811 bool saved_greater_than_is_operator_p;
2813 /* Consume the `('. */
2814 cp_lexer_consume_token (parser->lexer);
2815 /* Within a parenthesized expression, a `>' token is always
2816 the greater-than operator. */
2817 saved_greater_than_is_operator_p
2818 = parser->greater_than_is_operator_p;
2819 parser->greater_than_is_operator_p = true;
2820 /* If we see `( { ' then we are looking at the beginning of
2821 a GNU statement-expression. */
2822 if (cp_parser_allow_gnu_extensions_p (parser)
2823 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
2825 /* Statement-expressions are not allowed by the standard. */
2827 pedwarn ("ISO C++ forbids braced-groups within expressions");
2829 /* And they're not allowed outside of a function-body; you
2830 cannot, for example, write:
2832 int i = ({ int j = 3; j + 1; });
2834 at class or namespace scope. */
2835 if (!at_function_scope_p ())
2836 error ("statement-expressions are allowed only inside functions");
2837 /* Start the statement-expression. */
2838 expr = begin_stmt_expr ();
2839 /* Parse the compound-statement. */
2840 cp_parser_compound_statement (parser, expr, false);
2842 expr = finish_stmt_expr (expr, false);
2846 /* Parse the parenthesized expression. */
2847 expr = cp_parser_expression (parser, cast_p);
2848 /* Let the front end know that this expression was
2849 enclosed in parentheses. This matters in case, for
2850 example, the expression is of the form `A::B', since
2851 `&A::B' might be a pointer-to-member, but `&(A::B)' is
2853 finish_parenthesized_expr (expr);
2855 /* The `>' token might be the end of a template-id or
2856 template-parameter-list now. */
2857 parser->greater_than_is_operator_p
2858 = saved_greater_than_is_operator_p;
2859 /* Consume the `)'. */
2860 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
2861 cp_parser_skip_to_end_of_statement (parser);
2867 switch (token->keyword)
2869 /* These two are the boolean literals. */
2871 cp_lexer_consume_token (parser->lexer);
2872 return boolean_true_node;
2874 cp_lexer_consume_token (parser->lexer);
2875 return boolean_false_node;
2877 /* The `__null' literal. */
2879 cp_lexer_consume_token (parser->lexer);
2882 /* Recognize the `this' keyword. */
2884 cp_lexer_consume_token (parser->lexer);
2885 if (parser->local_variables_forbidden_p)
2887 error ("%<this%> may not be used in this context");
2888 return error_mark_node;
2890 /* Pointers cannot appear in constant-expressions. */
2891 if (cp_parser_non_integral_constant_expression (parser,
2893 return error_mark_node;
2894 return finish_this_expr ();
2896 /* The `operator' keyword can be the beginning of an
2901 case RID_FUNCTION_NAME:
2902 case RID_PRETTY_FUNCTION_NAME:
2903 case RID_C99_FUNCTION_NAME:
2904 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
2905 __func__ are the names of variables -- but they are
2906 treated specially. Therefore, they are handled here,
2907 rather than relying on the generic id-expression logic
2908 below. Grammatically, these names are id-expressions.
2910 Consume the token. */
2911 token = cp_lexer_consume_token (parser->lexer);
2912 /* Look up the name. */
2913 return finish_fname (token->value);
2920 /* The `__builtin_va_arg' construct is used to handle
2921 `va_arg'. Consume the `__builtin_va_arg' token. */
2922 cp_lexer_consume_token (parser->lexer);
2923 /* Look for the opening `('. */
2924 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
2925 /* Now, parse the assignment-expression. */
2926 expression = cp_parser_assignment_expression (parser,
2928 /* Look for the `,'. */
2929 cp_parser_require (parser, CPP_COMMA, "`,'");
2930 /* Parse the type-id. */
2931 type = cp_parser_type_id (parser);
2932 /* Look for the closing `)'. */
2933 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
2934 /* Using `va_arg' in a constant-expression is not
2936 if (cp_parser_non_integral_constant_expression (parser,
2938 return error_mark_node;
2939 return build_x_va_arg (expression, type);
2943 return cp_parser_builtin_offsetof (parser);
2945 /* Objective-C++ expressions. */
2947 case RID_AT_PROTOCOL:
2948 case RID_AT_SELECTOR:
2949 return cp_parser_objc_expression (parser);
2952 cp_parser_error (parser, "expected primary-expression");
2953 return error_mark_node;
2956 /* An id-expression can start with either an identifier, a
2957 `::' as the beginning of a qualified-id, or the "operator"
2961 case CPP_TEMPLATE_ID:
2962 case CPP_NESTED_NAME_SPECIFIER:
2966 const char *error_msg;
2969 /* Parse the id-expression. */
2971 = cp_parser_id_expression (parser,
2972 /*template_keyword_p=*/false,
2973 /*check_dependency_p=*/true,
2974 /*template_p=*/NULL,
2975 /*declarator_p=*/false);
2976 if (id_expression == error_mark_node)
2977 return error_mark_node;
2978 /* If we have a template-id, then no further lookup is
2979 required. If the template-id was for a template-class, we
2980 will sometimes have a TYPE_DECL at this point. */
2981 else if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR
2982 || TREE_CODE (id_expression) == TYPE_DECL)
2983 decl = id_expression;
2984 /* Look up the name. */
2989 decl = cp_parser_lookup_name (parser, id_expression,
2991 /*is_template=*/false,
2992 /*is_namespace=*/false,
2993 /*check_dependency=*/true,
2995 /* If the lookup was ambiguous, an error will already have
2998 return error_mark_node;
3000 /* In Objective-C++, an instance variable (ivar) may be preferred
3001 to whatever cp_parser_lookup_name() found. */
3002 decl = objc_lookup_ivar (decl, id_expression);
3004 /* If name lookup gives us a SCOPE_REF, then the
3005 qualifying scope was dependent. Just propagate the
3007 if (TREE_CODE (decl) == SCOPE_REF)
3009 if (TYPE_P (TREE_OPERAND (decl, 0)))
3010 *qualifying_class = TREE_OPERAND (decl, 0);
3013 /* Check to see if DECL is a local variable in a context
3014 where that is forbidden. */
3015 if (parser->local_variables_forbidden_p
3016 && local_variable_p (decl))
3018 /* It might be that we only found DECL because we are
3019 trying to be generous with pre-ISO scoping rules.
3020 For example, consider:
3024 for (int i = 0; i < 10; ++i) {}
3025 extern void f(int j = i);
3028 Here, name look up will originally find the out
3029 of scope `i'. We need to issue a warning message,
3030 but then use the global `i'. */
3031 decl = check_for_out_of_scope_variable (decl);
3032 if (local_variable_p (decl))
3034 error ("local variable %qD may not appear in this context",
3036 return error_mark_node;
3041 decl = finish_id_expression (id_expression, decl, parser->scope,
3042 idk, qualifying_class,
3043 parser->integral_constant_expression_p,
3044 parser->allow_non_integral_constant_expression_p,
3045 &parser->non_integral_constant_expression_p,
3048 cp_parser_error (parser, error_msg);
3052 /* Anything else is an error. */
3054 /* ...unless we have an Objective-C++ message or string literal, that is. */
3055 if (c_dialect_objc ()
3056 && (token->type == CPP_OPEN_SQUARE || token->type == CPP_OBJC_STRING))
3057 return cp_parser_objc_expression (parser);
3059 cp_parser_error (parser, "expected primary-expression");
3060 return error_mark_node;
3064 /* Parse an id-expression.
3071 :: [opt] nested-name-specifier template [opt] unqualified-id
3073 :: operator-function-id
3076 Return a representation of the unqualified portion of the
3077 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
3078 a `::' or nested-name-specifier.
3080 Often, if the id-expression was a qualified-id, the caller will
3081 want to make a SCOPE_REF to represent the qualified-id. This
3082 function does not do this in order to avoid wastefully creating
3083 SCOPE_REFs when they are not required.
3085 If TEMPLATE_KEYWORD_P is true, then we have just seen the
3088 If CHECK_DEPENDENCY_P is false, then names are looked up inside
3089 uninstantiated templates.
3091 If *TEMPLATE_P is non-NULL, it is set to true iff the
3092 `template' keyword is used to explicitly indicate that the entity
3093 named is a template.
3095 If DECLARATOR_P is true, the id-expression is appearing as part of
3096 a declarator, rather than as part of an expression. */
3099 cp_parser_id_expression (cp_parser *parser,
3100 bool template_keyword_p,
3101 bool check_dependency_p,
3105 bool global_scope_p;
3106 bool nested_name_specifier_p;
3108 /* Assume the `template' keyword was not used. */
3110 *template_p = false;
3112 /* Look for the optional `::' operator. */
3114 = (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false)
3116 /* Look for the optional nested-name-specifier. */
3117 nested_name_specifier_p
3118 = (cp_parser_nested_name_specifier_opt (parser,
3119 /*typename_keyword_p=*/false,
3124 /* If there is a nested-name-specifier, then we are looking at
3125 the first qualified-id production. */
3126 if (nested_name_specifier_p)
3129 tree saved_object_scope;
3130 tree saved_qualifying_scope;
3131 tree unqualified_id;
3134 /* See if the next token is the `template' keyword. */
3136 template_p = &is_template;
3137 *template_p = cp_parser_optional_template_keyword (parser);
3138 /* Name lookup we do during the processing of the
3139 unqualified-id might obliterate SCOPE. */
3140 saved_scope = parser->scope;
3141 saved_object_scope = parser->object_scope;
3142 saved_qualifying_scope = parser->qualifying_scope;
3143 /* Process the final unqualified-id. */
3144 unqualified_id = cp_parser_unqualified_id (parser, *template_p,
3147 /* Restore the SAVED_SCOPE for our caller. */
3148 parser->scope = saved_scope;
3149 parser->object_scope = saved_object_scope;
3150 parser->qualifying_scope = saved_qualifying_scope;
3152 return unqualified_id;
3154 /* Otherwise, if we are in global scope, then we are looking at one
3155 of the other qualified-id productions. */
3156 else if (global_scope_p)
3161 /* Peek at the next token. */
3162 token = cp_lexer_peek_token (parser->lexer);
3164 /* If it's an identifier, and the next token is not a "<", then
3165 we can avoid the template-id case. This is an optimization
3166 for this common case. */
3167 if (token->type == CPP_NAME
3168 && !cp_parser_nth_token_starts_template_argument_list_p
3170 return cp_parser_identifier (parser);
3172 cp_parser_parse_tentatively (parser);
3173 /* Try a template-id. */
3174 id = cp_parser_template_id (parser,
3175 /*template_keyword_p=*/false,
3176 /*check_dependency_p=*/true,
3178 /* If that worked, we're done. */
3179 if (cp_parser_parse_definitely (parser))
3182 /* Peek at the next token. (Changes in the token buffer may
3183 have invalidated the pointer obtained above.) */
3184 token = cp_lexer_peek_token (parser->lexer);
3186 switch (token->type)
3189 return cp_parser_identifier (parser);
3192 if (token->keyword == RID_OPERATOR)
3193 return cp_parser_operator_function_id (parser);
3197 cp_parser_error (parser, "expected id-expression");
3198 return error_mark_node;
3202 return cp_parser_unqualified_id (parser, template_keyword_p,
3203 /*check_dependency_p=*/true,
3207 /* Parse an unqualified-id.
3211 operator-function-id
3212 conversion-function-id
3216 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
3217 keyword, in a construct like `A::template ...'.
3219 Returns a representation of unqualified-id. For the `identifier'
3220 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
3221 production a BIT_NOT_EXPR is returned; the operand of the
3222 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
3223 other productions, see the documentation accompanying the
3224 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
3225 names are looked up in uninstantiated templates. If DECLARATOR_P
3226 is true, the unqualified-id is appearing as part of a declarator,
3227 rather than as part of an expression. */
3230 cp_parser_unqualified_id (cp_parser* parser,
3231 bool template_keyword_p,
3232 bool check_dependency_p,
3237 /* Peek at the next token. */
3238 token = cp_lexer_peek_token (parser->lexer);
3240 switch (token->type)
3246 /* We don't know yet whether or not this will be a
3248 cp_parser_parse_tentatively (parser);
3249 /* Try a template-id. */
3250 id = cp_parser_template_id (parser, template_keyword_p,
3253 /* If it worked, we're done. */
3254 if (cp_parser_parse_definitely (parser))
3256 /* Otherwise, it's an ordinary identifier. */
3257 return cp_parser_identifier (parser);
3260 case CPP_TEMPLATE_ID:
3261 return cp_parser_template_id (parser, template_keyword_p,
3268 tree qualifying_scope;
3273 /* Consume the `~' token. */
3274 cp_lexer_consume_token (parser->lexer);
3275 /* Parse the class-name. The standard, as written, seems to
3278 template <typename T> struct S { ~S (); };
3279 template <typename T> S<T>::~S() {}
3281 is invalid, since `~' must be followed by a class-name, but
3282 `S<T>' is dependent, and so not known to be a class.
3283 That's not right; we need to look in uninstantiated
3284 templates. A further complication arises from:
3286 template <typename T> void f(T t) {
3290 Here, it is not possible to look up `T' in the scope of `T'
3291 itself. We must look in both the current scope, and the
3292 scope of the containing complete expression.
3294 Yet another issue is:
3303 The standard does not seem to say that the `S' in `~S'
3304 should refer to the type `S' and not the data member
3307 /* DR 244 says that we look up the name after the "~" in the
3308 same scope as we looked up the qualifying name. That idea
3309 isn't fully worked out; it's more complicated than that. */
3310 scope = parser->scope;
3311 object_scope = parser->object_scope;
3312 qualifying_scope = parser->qualifying_scope;
3314 /* If the name is of the form "X::~X" it's OK. */
3315 if (scope && TYPE_P (scope)
3316 && cp_lexer_next_token_is (parser->lexer, CPP_NAME)
3317 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
3319 && (cp_lexer_peek_token (parser->lexer)->value
3320 == TYPE_IDENTIFIER (scope)))
3322 cp_lexer_consume_token (parser->lexer);
3323 return build_nt (BIT_NOT_EXPR, scope);
3326 /* If there was an explicit qualification (S::~T), first look
3327 in the scope given by the qualification (i.e., S). */
3329 type_decl = NULL_TREE;
3332 cp_parser_parse_tentatively (parser);
3333 type_decl = cp_parser_class_name (parser,
3334 /*typename_keyword_p=*/false,
3335 /*template_keyword_p=*/false,
3337 /*check_dependency=*/false,
3338 /*class_head_p=*/false,
3340 if (cp_parser_parse_definitely (parser))
3343 /* In "N::S::~S", look in "N" as well. */
3344 if (!done && scope && qualifying_scope)
3346 cp_parser_parse_tentatively (parser);
3347 parser->scope = qualifying_scope;
3348 parser->object_scope = NULL_TREE;
3349 parser->qualifying_scope = NULL_TREE;
3351 = cp_parser_class_name (parser,
3352 /*typename_keyword_p=*/false,
3353 /*template_keyword_p=*/false,
3355 /*check_dependency=*/false,
3356 /*class_head_p=*/false,
3358 if (cp_parser_parse_definitely (parser))
3361 /* In "p->S::~T", look in the scope given by "*p" as well. */
3362 else if (!done && object_scope)
3364 cp_parser_parse_tentatively (parser);
3365 parser->scope = object_scope;
3366 parser->object_scope = NULL_TREE;
3367 parser->qualifying_scope = NULL_TREE;
3369 = cp_parser_class_name (parser,
3370 /*typename_keyword_p=*/false,
3371 /*template_keyword_p=*/false,
3373 /*check_dependency=*/false,
3374 /*class_head_p=*/false,
3376 if (cp_parser_parse_definitely (parser))
3379 /* Look in the surrounding context. */
3382 parser->scope = NULL_TREE;
3383 parser->object_scope = NULL_TREE;
3384 parser->qualifying_scope = NULL_TREE;
3386 = cp_parser_class_name (parser,
3387 /*typename_keyword_p=*/false,
3388 /*template_keyword_p=*/false,
3390 /*check_dependency=*/false,
3391 /*class_head_p=*/false,
3394 /* If an error occurred, assume that the name of the
3395 destructor is the same as the name of the qualifying
3396 class. That allows us to keep parsing after running
3397 into ill-formed destructor names. */
3398 if (type_decl == error_mark_node && scope && TYPE_P (scope))
3399 return build_nt (BIT_NOT_EXPR, scope);
3400 else if (type_decl == error_mark_node)
3401 return error_mark_node;
3405 A typedef-name that names a class shall not be used as the
3406 identifier in the declarator for a destructor declaration. */
3408 && !DECL_IMPLICIT_TYPEDEF_P (type_decl)
3409 && !DECL_SELF_REFERENCE_P (type_decl)
3410 && !cp_parser_uncommitted_to_tentative_parse_p (parser))
3411 error ("typedef-name %qD used as destructor declarator",
3414 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
3418 if (token->keyword == RID_OPERATOR)
3422 /* This could be a template-id, so we try that first. */
3423 cp_parser_parse_tentatively (parser);
3424 /* Try a template-id. */
3425 id = cp_parser_template_id (parser, template_keyword_p,
3426 /*check_dependency_p=*/true,
3428 /* If that worked, we're done. */
3429 if (cp_parser_parse_definitely (parser))
3431 /* We still don't know whether we're looking at an
3432 operator-function-id or a conversion-function-id. */
3433 cp_parser_parse_tentatively (parser);
3434 /* Try an operator-function-id. */
3435 id = cp_parser_operator_function_id (parser);
3436 /* If that didn't work, try a conversion-function-id. */
3437 if (!cp_parser_parse_definitely (parser))
3438 id = cp_parser_conversion_function_id (parser);
3445 cp_parser_error (parser, "expected unqualified-id");
3446 return error_mark_node;
3450 /* Parse an (optional) nested-name-specifier.
3452 nested-name-specifier:
3453 class-or-namespace-name :: nested-name-specifier [opt]
3454 class-or-namespace-name :: template nested-name-specifier [opt]
3456 PARSER->SCOPE should be set appropriately before this function is
3457 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
3458 effect. TYPE_P is TRUE if we non-type bindings should be ignored
3461 Sets PARSER->SCOPE to the class (TYPE) or namespace
3462 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
3463 it unchanged if there is no nested-name-specifier. Returns the new
3464 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
3466 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
3467 part of a declaration and/or decl-specifier. */
3470 cp_parser_nested_name_specifier_opt (cp_parser *parser,
3471 bool typename_keyword_p,
3472 bool check_dependency_p,
3474 bool is_declaration)
3476 bool success = false;
3477 tree access_check = NULL_TREE;
3478 cp_token_position start = 0;
3481 /* If the next token corresponds to a nested name specifier, there
3482 is no need to reparse it. However, if CHECK_DEPENDENCY_P is
3483 false, it may have been true before, in which case something
3484 like `A<X>::B<Y>::C' may have resulted in a nested-name-specifier
3485 of `A<X>::', where it should now be `A<X>::B<Y>::'. So, when
3486 CHECK_DEPENDENCY_P is false, we have to fall through into the
3488 if (check_dependency_p
3489 && cp_lexer_next_token_is (parser->lexer, CPP_NESTED_NAME_SPECIFIER))
3491 cp_parser_pre_parsed_nested_name_specifier (parser);
3492 return parser->scope;
3495 /* Remember where the nested-name-specifier starts. */
3496 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
3497 start = cp_lexer_token_position (parser->lexer, false);
3499 push_deferring_access_checks (dk_deferred);
3505 tree saved_qualifying_scope;
3506 bool template_keyword_p;
3508 /* Spot cases that cannot be the beginning of a
3509 nested-name-specifier. */
3510 token = cp_lexer_peek_token (parser->lexer);
3512 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
3513 the already parsed nested-name-specifier. */
3514 if (token->type == CPP_NESTED_NAME_SPECIFIER)
3516 /* Grab the nested-name-specifier and continue the loop. */
3517 cp_parser_pre_parsed_nested_name_specifier (parser);
3522 /* Spot cases that cannot be the beginning of a
3523 nested-name-specifier. On the second and subsequent times
3524 through the loop, we look for the `template' keyword. */
3525 if (success && token->keyword == RID_TEMPLATE)
3527 /* A template-id can start a nested-name-specifier. */
3528 else if (token->type == CPP_TEMPLATE_ID)
3532 /* If the next token is not an identifier, then it is
3533 definitely not a class-or-namespace-name. */
3534 if (token->type != CPP_NAME)
3536 /* If the following token is neither a `<' (to begin a
3537 template-id), nor a `::', then we are not looking at a
3538 nested-name-specifier. */
3539 token = cp_lexer_peek_nth_token (parser->lexer, 2);
3540 if (token->type != CPP_SCOPE
3541 && !cp_parser_nth_token_starts_template_argument_list_p
3546 /* The nested-name-specifier is optional, so we parse
3548 cp_parser_parse_tentatively (parser);
3550 /* Look for the optional `template' keyword, if this isn't the
3551 first time through the loop. */
3553 template_keyword_p = cp_parser_optional_template_keyword (parser);
3555 template_keyword_p = false;
3557 /* Save the old scope since the name lookup we are about to do
3558 might destroy it. */
3559 old_scope = parser->scope;
3560 saved_qualifying_scope = parser->qualifying_scope;
3561 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
3562 look up names in "X<T>::I" in order to determine that "Y" is
3563 a template. So, if we have a typename at this point, we make
3564 an effort to look through it. */
3566 && !typename_keyword_p
3568 && TREE_CODE (parser->scope) == TYPENAME_TYPE)
3569 parser->scope = resolve_typename_type (parser->scope,
3570 /*only_current_p=*/false);
3571 /* Parse the qualifying entity. */
3573 = cp_parser_class_or_namespace_name (parser,
3579 /* Look for the `::' token. */
3580 cp_parser_require (parser, CPP_SCOPE, "`::'");
3582 /* If we found what we wanted, we keep going; otherwise, we're
3584 if (!cp_parser_parse_definitely (parser))
3586 bool error_p = false;
3588 /* Restore the OLD_SCOPE since it was valid before the
3589 failed attempt at finding the last
3590 class-or-namespace-name. */
3591 parser->scope = old_scope;
3592 parser->qualifying_scope = saved_qualifying_scope;
3593 /* If the next token is an identifier, and the one after
3594 that is a `::', then any valid interpretation would have
3595 found a class-or-namespace-name. */
3596 while (cp_lexer_next_token_is (parser->lexer, CPP_NAME)
3597 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
3599 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
3602 token = cp_lexer_consume_token (parser->lexer);
3607 decl = cp_parser_lookup_name_simple (parser, token->value);
3608 if (TREE_CODE (decl) == TEMPLATE_DECL)
3609 error ("%qD used without template parameters", decl);
3611 cp_parser_name_lookup_error
3612 (parser, token->value, decl,
3613 "is not a class or namespace");
3614 parser->scope = NULL_TREE;
3616 /* Treat this as a successful nested-name-specifier
3621 If the name found is not a class-name (clause
3622 _class_) or namespace-name (_namespace.def_), the
3623 program is ill-formed. */
3626 cp_lexer_consume_token (parser->lexer);
3631 /* We've found one valid nested-name-specifier. */
3633 /* Make sure we look in the right scope the next time through
3635 parser->scope = (TREE_CODE (new_scope) == TYPE_DECL
3636 ? TREE_TYPE (new_scope)
3638 /* If it is a class scope, try to complete it; we are about to
3639 be looking up names inside the class. */
3640 if (TYPE_P (parser->scope)
3641 /* Since checking types for dependency can be expensive,
3642 avoid doing it if the type is already complete. */
3643 && !COMPLETE_TYPE_P (parser->scope)
3644 /* Do not try to complete dependent types. */
3645 && !dependent_type_p (parser->scope))
3646 complete_type (parser->scope);
3649 /* Retrieve any deferred checks. Do not pop this access checks yet
3650 so the memory will not be reclaimed during token replacing below. */
3651 access_check = get_deferred_access_checks ();
3653 /* If parsing tentatively, replace the sequence of tokens that makes
3654 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
3655 token. That way, should we re-parse the token stream, we will
3656 not have to repeat the effort required to do the parse, nor will
3657 we issue duplicate error messages. */
3658 if (success && start)
3660 cp_token *token = cp_lexer_token_at (parser->lexer, start);
3662 /* Reset the contents of the START token. */
3663 token->type = CPP_NESTED_NAME_SPECIFIER;
3664 token->value = build_tree_list (access_check, parser->scope);
3665 TREE_TYPE (token->value) = parser->qualifying_scope;
3666 token->keyword = RID_MAX;
3668 /* Purge all subsequent tokens. */
3669 cp_lexer_purge_tokens_after (parser->lexer, start);
3672 pop_deferring_access_checks ();
3673 return success ? parser->scope : NULL_TREE;
3676 /* Parse a nested-name-specifier. See
3677 cp_parser_nested_name_specifier_opt for details. This function
3678 behaves identically, except that it will an issue an error if no
3679 nested-name-specifier is present. */
3682 cp_parser_nested_name_specifier (cp_parser *parser,
3683 bool typename_keyword_p,
3684 bool check_dependency_p,
3686 bool is_declaration)
3690 /* Look for the nested-name-specifier. */
3691 scope = cp_parser_nested_name_specifier_opt (parser,
3696 /* If it was not present, issue an error message. */
3699 cp_parser_error (parser, "expected nested-name-specifier");
3700 parser->scope = NULL_TREE;
3706 /* Parse a class-or-namespace-name.
3708 class-or-namespace-name:
3712 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
3713 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
3714 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
3715 TYPE_P is TRUE iff the next name should be taken as a class-name,
3716 even the same name is declared to be another entity in the same
3719 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
3720 specified by the class-or-namespace-name. If neither is found the
3721 ERROR_MARK_NODE is returned. */
3724 cp_parser_class_or_namespace_name (cp_parser *parser,
3725 bool typename_keyword_p,
3726 bool template_keyword_p,
3727 bool check_dependency_p,
3729 bool is_declaration)
3732 tree saved_qualifying_scope;
3733 tree saved_object_scope;
3737 /* Before we try to parse the class-name, we must save away the
3738 current PARSER->SCOPE since cp_parser_class_name will destroy
3740 saved_scope = parser->scope;
3741 saved_qualifying_scope = parser->qualifying_scope;
3742 saved_object_scope = parser->object_scope;
3743 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
3744 there is no need to look for a namespace-name. */
3745 only_class_p = template_keyword_p || (saved_scope && TYPE_P (saved_scope));
3747 cp_parser_parse_tentatively (parser);
3748 scope = cp_parser_class_name (parser,
3751 type_p ? class_type : none_type,
3753 /*class_head_p=*/false,
3755 /* If that didn't work, try for a namespace-name. */
3756 if (!only_class_p && !cp_parser_parse_definitely (parser))
3758 /* Restore the saved scope. */
3759 parser->scope = saved_scope;
3760 parser->qualifying_scope = saved_qualifying_scope;
3761 parser->object_scope = saved_object_scope;
3762 /* If we are not looking at an identifier followed by the scope
3763 resolution operator, then this is not part of a
3764 nested-name-specifier. (Note that this function is only used
3765 to parse the components of a nested-name-specifier.) */
3766 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME)
3767 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SCOPE)
3768 return error_mark_node;
3769 scope = cp_parser_namespace_name (parser);
3775 /* Parse a postfix-expression.
3779 postfix-expression [ expression ]
3780 postfix-expression ( expression-list [opt] )
3781 simple-type-specifier ( expression-list [opt] )
3782 typename :: [opt] nested-name-specifier identifier
3783 ( expression-list [opt] )
3784 typename :: [opt] nested-name-specifier template [opt] template-id
3785 ( expression-list [opt] )
3786 postfix-expression . template [opt] id-expression
3787 postfix-expression -> template [opt] id-expression
3788 postfix-expression . pseudo-destructor-name
3789 postfix-expression -> pseudo-destructor-name
3790 postfix-expression ++
3791 postfix-expression --
3792 dynamic_cast < type-id > ( expression )
3793 static_cast < type-id > ( expression )
3794 reinterpret_cast < type-id > ( expression )
3795 const_cast < type-id > ( expression )
3796 typeid ( expression )
3802 ( type-id ) { initializer-list , [opt] }
3804 This extension is a GNU version of the C99 compound-literal
3805 construct. (The C99 grammar uses `type-name' instead of `type-id',
3806 but they are essentially the same concept.)
3808 If ADDRESS_P is true, the postfix expression is the operand of the
3809 `&' operator. CAST_P is true if this expression is the target of a
3812 Returns a representation of the expression. */
3815 cp_parser_postfix_expression (cp_parser *parser, bool address_p, bool cast_p)
3819 cp_id_kind idk = CP_ID_KIND_NONE;
3820 tree postfix_expression = NULL_TREE;
3821 /* Non-NULL only if the current postfix-expression can be used to
3822 form a pointer-to-member. In that case, QUALIFYING_CLASS is the
3823 class used to qualify the member. */
3824 tree qualifying_class = NULL_TREE;
3826 /* Peek at the next token. */
3827 token = cp_lexer_peek_token (parser->lexer);
3828 /* Some of the productions are determined by keywords. */
3829 keyword = token->keyword;
3839 const char *saved_message;
3841 /* All of these can be handled in the same way from the point
3842 of view of parsing. Begin by consuming the token
3843 identifying the cast. */
3844 cp_lexer_consume_token (parser->lexer);
3846 /* New types cannot be defined in the cast. */
3847 saved_message = parser->type_definition_forbidden_message;
3848 parser->type_definition_forbidden_message
3849 = "types may not be defined in casts";
3851 /* Look for the opening `<'. */
3852 cp_parser_require (parser, CPP_LESS, "`<'");
3853 /* Parse the type to which we are casting. */
3854 type = cp_parser_type_id (parser);
3855 /* Look for the closing `>'. */
3856 cp_parser_require (parser, CPP_GREATER, "`>'");
3857 /* Restore the old message. */
3858 parser->type_definition_forbidden_message = saved_message;
3860 /* And the expression which is being cast. */
3861 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
3862 expression = cp_parser_expression (parser, /*cast_p=*/true);
3863 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3865 /* Only type conversions to integral or enumeration types
3866 can be used in constant-expressions. */
3867 if (parser->integral_constant_expression_p
3868 && !dependent_type_p (type)
3869 && !INTEGRAL_OR_ENUMERATION_TYPE_P (type)
3870 && (cp_parser_non_integral_constant_expression
3872 "a cast to a type other than an integral or "
3873 "enumeration type")))
3874 return error_mark_node;
3880 = build_dynamic_cast (type, expression);
3884 = build_static_cast (type, expression);
3888 = build_reinterpret_cast (type, expression);
3892 = build_const_cast (type, expression);
3903 const char *saved_message;
3904 bool saved_in_type_id_in_expr_p;
3906 /* Consume the `typeid' token. */
3907 cp_lexer_consume_token (parser->lexer);
3908 /* Look for the `(' token. */
3909 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
3910 /* Types cannot be defined in a `typeid' expression. */
3911 saved_message = parser->type_definition_forbidden_message;
3912 parser->type_definition_forbidden_message
3913 = "types may not be defined in a `typeid\' expression";
3914 /* We can't be sure yet whether we're looking at a type-id or an
3916 cp_parser_parse_tentatively (parser);
3917 /* Try a type-id first. */
3918 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
3919 parser->in_type_id_in_expr_p = true;
3920 type = cp_parser_type_id (parser);
3921 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
3922 /* Look for the `)' token. Otherwise, we can't be sure that
3923 we're not looking at an expression: consider `typeid (int
3924 (3))', for example. */
3925 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3926 /* If all went well, simply lookup the type-id. */
3927 if (cp_parser_parse_definitely (parser))
3928 postfix_expression = get_typeid (type);
3929 /* Otherwise, fall back to the expression variant. */
3934 /* Look for an expression. */
3935 expression = cp_parser_expression (parser, /*cast_p=*/false);
3936 /* Compute its typeid. */
3937 postfix_expression = build_typeid (expression);
3938 /* Look for the `)' token. */
3939 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3941 /* `typeid' may not appear in an integral constant expression. */
3942 if (cp_parser_non_integral_constant_expression(parser,
3943 "`typeid' operator"))
3944 return error_mark_node;
3945 /* Restore the saved message. */
3946 parser->type_definition_forbidden_message = saved_message;
3952 bool template_p = false;
3957 /* Consume the `typename' token. */
3958 cp_lexer_consume_token (parser->lexer);
3959 /* Look for the optional `::' operator. */
3960 cp_parser_global_scope_opt (parser,
3961 /*current_scope_valid_p=*/false);
3962 /* Look for the nested-name-specifier. In case of error here,
3963 consume the trailing id to avoid subsequent error messages
3965 scope = cp_parser_nested_name_specifier (parser,
3966 /*typename_keyword_p=*/true,
3967 /*check_dependency_p=*/true,
3969 /*is_declaration=*/true);
3971 /* Look for the optional `template' keyword. */
3972 template_p = cp_parser_optional_template_keyword (parser);
3973 /* We don't know whether we're looking at a template-id or an
3975 cp_parser_parse_tentatively (parser);
3976 /* Try a template-id. */
3977 id = cp_parser_template_id (parser, template_p,
3978 /*check_dependency_p=*/true,
3979 /*is_declaration=*/true);
3980 /* If that didn't work, try an identifier. */
3981 if (!cp_parser_parse_definitely (parser))
3982 id = cp_parser_identifier (parser);
3984 /* Don't process id if nested name specifier is invalid. */
3985 if (!scope || scope == error_mark_node)
3986 return error_mark_node;
3987 /* If we look up a template-id in a non-dependent qualifying
3988 scope, there's no need to create a dependent type. */
3989 else if (TREE_CODE (id) == TYPE_DECL
3990 && !dependent_type_p (parser->scope))
3991 type = TREE_TYPE (id);
3992 /* Create a TYPENAME_TYPE to represent the type to which the
3993 functional cast is being performed. */
3995 type = make_typename_type (parser->scope, id,
3999 postfix_expression = cp_parser_functional_cast (parser, type);
4007 /* If the next thing is a simple-type-specifier, we may be
4008 looking at a functional cast. We could also be looking at
4009 an id-expression. So, we try the functional cast, and if
4010 that doesn't work we fall back to the primary-expression. */
4011 cp_parser_parse_tentatively (parser);
4012 /* Look for the simple-type-specifier. */
4013 type = cp_parser_simple_type_specifier (parser,
4014 /*decl_specs=*/NULL,
4015 CP_PARSER_FLAGS_NONE);
4016 /* Parse the cast itself. */
4017 if (!cp_parser_error_occurred (parser))
4019 = cp_parser_functional_cast (parser, type);
4020 /* If that worked, we're done. */
4021 if (cp_parser_parse_definitely (parser))
4024 /* If the functional-cast didn't work out, try a
4025 compound-literal. */
4026 if (cp_parser_allow_gnu_extensions_p (parser)
4027 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
4029 VEC(constructor_elt,gc) *initializer_list = NULL;
4030 bool saved_in_type_id_in_expr_p;
4032 cp_parser_parse_tentatively (parser);
4033 /* Consume the `('. */
4034 cp_lexer_consume_token (parser->lexer);
4035 /* Parse the type. */
4036 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
4037 parser->in_type_id_in_expr_p = true;
4038 type = cp_parser_type_id (parser);
4039 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
4040 /* Look for the `)'. */
4041 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
4042 /* Look for the `{'. */
4043 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
4044 /* If things aren't going well, there's no need to
4046 if (!cp_parser_error_occurred (parser))
4048 bool non_constant_p;
4049 /* Parse the initializer-list. */
4051 = cp_parser_initializer_list (parser, &non_constant_p);
4052 /* Allow a trailing `,'. */
4053 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
4054 cp_lexer_consume_token (parser->lexer);
4055 /* Look for the final `}'. */
4056 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
4058 /* If that worked, we're definitely looking at a
4059 compound-literal expression. */
4060 if (cp_parser_parse_definitely (parser))
4062 /* Warn the user that a compound literal is not
4063 allowed in standard C++. */
4065 pedwarn ("ISO C++ forbids compound-literals");
4066 /* Form the representation of the compound-literal. */
4068 = finish_compound_literal (type, initializer_list);
4073 /* It must be a primary-expression. */
4074 postfix_expression = cp_parser_primary_expression (parser,
4082 /* If we were avoiding committing to the processing of a
4083 qualified-id until we knew whether or not we had a
4084 pointer-to-member, we now know. */
4085 if (qualifying_class)
4089 /* Peek at the next token. */
4090 token = cp_lexer_peek_token (parser->lexer);
4091 done = (token->type != CPP_OPEN_SQUARE
4092 && token->type != CPP_OPEN_PAREN
4093 && token->type != CPP_DOT
4094 && token->type != CPP_DEREF
4095 && token->type != CPP_PLUS_PLUS
4096 && token->type != CPP_MINUS_MINUS);
4098 postfix_expression = finish_qualified_id_expr (qualifying_class,
4103 return postfix_expression;
4106 /* Keep looping until the postfix-expression is complete. */
4109 if (idk == CP_ID_KIND_UNQUALIFIED
4110 && TREE_CODE (postfix_expression) == IDENTIFIER_NODE
4111 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
4112 /* It is not a Koenig lookup function call. */
4114 = unqualified_name_lookup_error (postfix_expression);
4116 /* Peek at the next token. */
4117 token = cp_lexer_peek_token (parser->lexer);
4119 switch (token->type)
4121 case CPP_OPEN_SQUARE:
4123 = cp_parser_postfix_open_square_expression (parser,
4126 idk = CP_ID_KIND_NONE;
4129 case CPP_OPEN_PAREN:
4130 /* postfix-expression ( expression-list [opt] ) */
4133 bool is_builtin_constant_p;
4134 bool saved_integral_constant_expression_p = false;
4135 bool saved_non_integral_constant_expression_p = false;
4138 is_builtin_constant_p
4139 = DECL_IS_BUILTIN_CONSTANT_P (postfix_expression);
4140 if (is_builtin_constant_p)
4142 /* The whole point of __builtin_constant_p is to allow
4143 non-constant expressions to appear as arguments. */
4144 saved_integral_constant_expression_p
4145 = parser->integral_constant_expression_p;
4146 saved_non_integral_constant_expression_p
4147 = parser->non_integral_constant_expression_p;
4148 parser->integral_constant_expression_p = false;
4150 args = (cp_parser_parenthesized_expression_list
4151 (parser, /*is_attribute_list=*/false,
4153 /*non_constant_p=*/NULL));
4154 if (is_builtin_constant_p)
4156 parser->integral_constant_expression_p
4157 = saved_integral_constant_expression_p;
4158 parser->non_integral_constant_expression_p
4159 = saved_non_integral_constant_expression_p;
4162 if (args == error_mark_node)
4164 postfix_expression = error_mark_node;
4168 /* Function calls are not permitted in
4169 constant-expressions. */
4170 if (! builtin_valid_in_constant_expr_p (postfix_expression)
4171 && cp_parser_non_integral_constant_expression (parser,
4174 postfix_expression = error_mark_node;
4179 if (idk == CP_ID_KIND_UNQUALIFIED)
4181 if (TREE_CODE (postfix_expression) == IDENTIFIER_NODE)
4187 = perform_koenig_lookup (postfix_expression, args);
4191 = unqualified_fn_lookup_error (postfix_expression);
4193 /* We do not perform argument-dependent lookup if
4194 normal lookup finds a non-function, in accordance
4195 with the expected resolution of DR 218. */
4196 else if (args && is_overloaded_fn (postfix_expression))
4198 tree fn = get_first_fn (postfix_expression);
4200 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4201 fn = OVL_CURRENT (TREE_OPERAND (fn, 0));
4203 /* Only do argument dependent lookup if regular
4204 lookup does not find a set of member functions.
4205 [basic.lookup.koenig]/2a */
4206 if (!DECL_FUNCTION_MEMBER_P (fn))
4210 = perform_koenig_lookup (postfix_expression, args);
4215 if (TREE_CODE (postfix_expression) == COMPONENT_REF)
4217 tree instance = TREE_OPERAND (postfix_expression, 0);
4218 tree fn = TREE_OPERAND (postfix_expression, 1);
4220 if (processing_template_decl
4221 && (type_dependent_expression_p (instance)
4222 || (!BASELINK_P (fn)
4223 && TREE_CODE (fn) != FIELD_DECL)
4224 || type_dependent_expression_p (fn)
4225 || any_type_dependent_arguments_p (args)))
4228 = build_min_nt (CALL_EXPR, postfix_expression,
4233 if (BASELINK_P (fn))
4235 = (build_new_method_call
4236 (instance, fn, args, NULL_TREE,
4237 (idk == CP_ID_KIND_QUALIFIED
4238 ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL)));
4241 = finish_call_expr (postfix_expression, args,
4242 /*disallow_virtual=*/false,
4243 /*koenig_p=*/false);
4245 else if (TREE_CODE (postfix_expression) == OFFSET_REF
4246 || TREE_CODE (postfix_expression) == MEMBER_REF
4247 || TREE_CODE (postfix_expression) == DOTSTAR_EXPR)
4248 postfix_expression = (build_offset_ref_call_from_tree
4249 (postfix_expression, args));
4250 else if (idk == CP_ID_KIND_QUALIFIED)
4251 /* A call to a static class member, or a namespace-scope
4254 = finish_call_expr (postfix_expression, args,
4255 /*disallow_virtual=*/true,
4258 /* All other function calls. */
4260 = finish_call_expr (postfix_expression, args,
4261 /*disallow_virtual=*/false,
4264 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
4265 idk = CP_ID_KIND_NONE;
4271 /* postfix-expression . template [opt] id-expression
4272 postfix-expression . pseudo-destructor-name
4273 postfix-expression -> template [opt] id-expression
4274 postfix-expression -> pseudo-destructor-name */
4276 /* Consume the `.' or `->' operator. */
4277 cp_lexer_consume_token (parser->lexer);
4280 = cp_parser_postfix_dot_deref_expression (parser, token->type,
4286 /* postfix-expression ++ */
4287 /* Consume the `++' token. */
4288 cp_lexer_consume_token (parser->lexer);
4289 /* Generate a representation for the complete expression. */
4291 = finish_increment_expr (postfix_expression,
4292 POSTINCREMENT_EXPR);
4293 /* Increments may not appear in constant-expressions. */
4294 if (cp_parser_non_integral_constant_expression (parser,
4296 postfix_expression = error_mark_node;
4297 idk = CP_ID_KIND_NONE;
4300 case CPP_MINUS_MINUS:
4301 /* postfix-expression -- */
4302 /* Consume the `--' token. */
4303 cp_lexer_consume_token (parser->lexer);
4304 /* Generate a representation for the complete expression. */
4306 = finish_increment_expr (postfix_expression,
4307 POSTDECREMENT_EXPR);
4308 /* Decrements may not appear in constant-expressions. */
4309 if (cp_parser_non_integral_constant_expression (parser,
4311 postfix_expression = error_mark_node;
4312 idk = CP_ID_KIND_NONE;
4316 return postfix_expression;
4320 /* We should never get here. */
4322 return error_mark_node;
4325 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
4326 by cp_parser_builtin_offsetof. We're looking for
4328 postfix-expression [ expression ]
4330 FOR_OFFSETOF is set if we're being called in that context, which
4331 changes how we deal with integer constant expressions. */
4334 cp_parser_postfix_open_square_expression (cp_parser *parser,
4335 tree postfix_expression,
4340 /* Consume the `[' token. */
4341 cp_lexer_consume_token (parser->lexer);
4343 /* Parse the index expression. */
4344 /* ??? For offsetof, there is a question of what to allow here. If
4345 offsetof is not being used in an integral constant expression context,
4346 then we *could* get the right answer by computing the value at runtime.
4347 If we are in an integral constant expression context, then we might
4348 could accept any constant expression; hard to say without analysis.
4349 Rather than open the barn door too wide right away, allow only integer
4350 constant expressions here. */
4352 index = cp_parser_constant_expression (parser, false, NULL);
4354 index = cp_parser_expression (parser, /*cast_p=*/false);
4356 /* Look for the closing `]'. */
4357 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
4359 /* Build the ARRAY_REF. */
4360 postfix_expression = grok_array_decl (postfix_expression, index);
4362 /* When not doing offsetof, array references are not permitted in
4363 constant-expressions. */
4365 && (cp_parser_non_integral_constant_expression
4366 (parser, "an array reference")))
4367 postfix_expression = error_mark_node;
4369 return postfix_expression;
4372 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
4373 by cp_parser_builtin_offsetof. We're looking for
4375 postfix-expression . template [opt] id-expression
4376 postfix-expression . pseudo-destructor-name
4377 postfix-expression -> template [opt] id-expression
4378 postfix-expression -> pseudo-destructor-name
4380 FOR_OFFSETOF is set if we're being called in that context. That sorta
4381 limits what of the above we'll actually accept, but nevermind.
4382 TOKEN_TYPE is the "." or "->" token, which will already have been
4383 removed from the stream. */
4386 cp_parser_postfix_dot_deref_expression (cp_parser *parser,
4387 enum cpp_ttype token_type,
4388 tree postfix_expression,
4389 bool for_offsetof, cp_id_kind *idk)
4394 bool pseudo_destructor_p;
4395 tree scope = NULL_TREE;
4397 /* If this is a `->' operator, dereference the pointer. */
4398 if (token_type == CPP_DEREF)
4399 postfix_expression = build_x_arrow (postfix_expression);
4400 /* Check to see whether or not the expression is type-dependent. */
4401 dependent_p = type_dependent_expression_p (postfix_expression);
4402 /* The identifier following the `->' or `.' is not qualified. */
4403 parser->scope = NULL_TREE;
4404 parser->qualifying_scope = NULL_TREE;
4405 parser->object_scope = NULL_TREE;
4406 *idk = CP_ID_KIND_NONE;
4407 /* Enter the scope corresponding to the type of the object
4408 given by the POSTFIX_EXPRESSION. */
4409 if (!dependent_p && TREE_TYPE (postfix_expression) != NULL_TREE)
4411 scope = TREE_TYPE (postfix_expression);
4412 /* According to the standard, no expression should ever have
4413 reference type. Unfortunately, we do not currently match
4414 the standard in this respect in that our internal representation
4415 of an expression may have reference type even when the standard
4416 says it does not. Therefore, we have to manually obtain the
4417 underlying type here. */
4418 scope = non_reference (scope);
4419 /* The type of the POSTFIX_EXPRESSION must be complete. */
4420 scope = complete_type_or_else (scope, NULL_TREE);
4421 /* Let the name lookup machinery know that we are processing a
4422 class member access expression. */
4423 parser->context->object_type = scope;
4424 /* If something went wrong, we want to be able to discern that case,
4425 as opposed to the case where there was no SCOPE due to the type
4426 of expression being dependent. */
4428 scope = error_mark_node;
4429 /* If the SCOPE was erroneous, make the various semantic analysis
4430 functions exit quickly -- and without issuing additional error
4432 if (scope == error_mark_node)
4433 postfix_expression = error_mark_node;
4436 /* Assume this expression is not a pseudo-destructor access. */
4437 pseudo_destructor_p = false;
4439 /* If the SCOPE is a scalar type, then, if this is a valid program,
4440 we must be looking at a pseudo-destructor-name. */
4441 if (scope && SCALAR_TYPE_P (scope))
4446 cp_parser_parse_tentatively (parser);
4447 /* Parse the pseudo-destructor-name. */
4449 cp_parser_pseudo_destructor_name (parser, &s, &type);
4450 if (cp_parser_parse_definitely (parser))
4452 pseudo_destructor_p = true;
4454 = finish_pseudo_destructor_expr (postfix_expression,
4455 s, TREE_TYPE (type));
4459 if (!pseudo_destructor_p)
4461 /* If the SCOPE is not a scalar type, we are looking at an
4462 ordinary class member access expression, rather than a
4463 pseudo-destructor-name. */
4464 template_p = cp_parser_optional_template_keyword (parser);
4465 /* Parse the id-expression. */
4466 name = cp_parser_id_expression (parser, template_p,
4467 /*check_dependency_p=*/true,
4468 /*template_p=*/NULL,
4469 /*declarator_p=*/false);
4470 /* In general, build a SCOPE_REF if the member name is qualified.
4471 However, if the name was not dependent and has already been
4472 resolved; there is no need to build the SCOPE_REF. For example;
4474 struct X { void f(); };
4475 template <typename T> void f(T* t) { t->X::f(); }
4477 Even though "t" is dependent, "X::f" is not and has been resolved
4478 to a BASELINK; there is no need to include scope information. */
4480 /* But we do need to remember that there was an explicit scope for
4481 virtual function calls. */
4483 *idk = CP_ID_KIND_QUALIFIED;
4485 /* If the name is a template-id that names a type, we will get a
4486 TYPE_DECL here. That is invalid code. */
4487 if (TREE_CODE (name) == TYPE_DECL)
4489 error ("invalid use of %qD", name);
4490 postfix_expression = error_mark_node;
4494 if (name != error_mark_node && !BASELINK_P (name) && parser->scope)
4496 name = build_nt (SCOPE_REF, parser->scope, name);
4497 parser->scope = NULL_TREE;
4498 parser->qualifying_scope = NULL_TREE;
4499 parser->object_scope = NULL_TREE;
4501 if (scope && name && BASELINK_P (name))
4502 adjust_result_of_qualified_name_lookup
4503 (name, BINFO_TYPE (BASELINK_BINFO (name)), scope);
4505 = finish_class_member_access_expr (postfix_expression, name);
4509 /* We no longer need to look up names in the scope of the object on
4510 the left-hand side of the `.' or `->' operator. */
4511 parser->context->object_type = NULL_TREE;
4513 /* Outside of offsetof, these operators may not appear in
4514 constant-expressions. */
4516 && (cp_parser_non_integral_constant_expression
4517 (parser, token_type == CPP_DEREF ? "'->'" : "`.'")))
4518 postfix_expression = error_mark_node;
4520 return postfix_expression;
4523 /* Parse a parenthesized expression-list.
4526 assignment-expression
4527 expression-list, assignment-expression
4532 identifier, expression-list
4534 CAST_P is true if this expression is the target of a cast.
4536 Returns a TREE_LIST. The TREE_VALUE of each node is a
4537 representation of an assignment-expression. Note that a TREE_LIST
4538 is returned even if there is only a single expression in the list.
4539 error_mark_node is returned if the ( and or ) are
4540 missing. NULL_TREE is returned on no expressions. The parentheses
4541 are eaten. IS_ATTRIBUTE_LIST is true if this is really an attribute
4542 list being parsed. If NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P
4543 indicates whether or not all of the expressions in the list were
4547 cp_parser_parenthesized_expression_list (cp_parser* parser,
4548 bool is_attribute_list,
4550 bool *non_constant_p)
4552 tree expression_list = NULL_TREE;
4553 bool fold_expr_p = is_attribute_list;
4554 tree identifier = NULL_TREE;
4556 /* Assume all the expressions will be constant. */
4558 *non_constant_p = false;
4560 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
4561 return error_mark_node;
4563 /* Consume expressions until there are no more. */
4564 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
4569 /* At the beginning of attribute lists, check to see if the
4570 next token is an identifier. */
4571 if (is_attribute_list
4572 && cp_lexer_peek_token (parser->lexer)->type == CPP_NAME)
4576 /* Consume the identifier. */
4577 token = cp_lexer_consume_token (parser->lexer);
4578 /* Save the identifier. */
4579 identifier = token->value;
4583 /* Parse the next assignment-expression. */
4586 bool expr_non_constant_p;
4587 expr = (cp_parser_constant_expression
4588 (parser, /*allow_non_constant_p=*/true,
4589 &expr_non_constant_p));
4590 if (expr_non_constant_p)
4591 *non_constant_p = true;
4594 expr = cp_parser_assignment_expression (parser, cast_p);
4597 expr = fold_non_dependent_expr (expr);
4599 /* Add it to the list. We add error_mark_node
4600 expressions to the list, so that we can still tell if
4601 the correct form for a parenthesized expression-list
4602 is found. That gives better errors. */
4603 expression_list = tree_cons (NULL_TREE, expr, expression_list);
4605 if (expr == error_mark_node)
4609 /* After the first item, attribute lists look the same as
4610 expression lists. */
4611 is_attribute_list = false;
4614 /* If the next token isn't a `,', then we are done. */
4615 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
4618 /* Otherwise, consume the `,' and keep going. */
4619 cp_lexer_consume_token (parser->lexer);
4622 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
4627 /* We try and resync to an unnested comma, as that will give the
4628 user better diagnostics. */
4629 ending = cp_parser_skip_to_closing_parenthesis (parser,
4630 /*recovering=*/true,
4632 /*consume_paren=*/true);
4636 return error_mark_node;
4639 /* We built up the list in reverse order so we must reverse it now. */
4640 expression_list = nreverse (expression_list);
4642 expression_list = tree_cons (NULL_TREE, identifier, expression_list);
4644 return expression_list;
4647 /* Parse a pseudo-destructor-name.
4649 pseudo-destructor-name:
4650 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
4651 :: [opt] nested-name-specifier template template-id :: ~ type-name
4652 :: [opt] nested-name-specifier [opt] ~ type-name
4654 If either of the first two productions is used, sets *SCOPE to the
4655 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
4656 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
4657 or ERROR_MARK_NODE if the parse fails. */
4660 cp_parser_pseudo_destructor_name (cp_parser* parser,
4664 bool nested_name_specifier_p;
4666 /* Assume that things will not work out. */
4667 *type = error_mark_node;
4669 /* Look for the optional `::' operator. */
4670 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/true);
4671 /* Look for the optional nested-name-specifier. */
4672 nested_name_specifier_p
4673 = (cp_parser_nested_name_specifier_opt (parser,
4674 /*typename_keyword_p=*/false,
4675 /*check_dependency_p=*/true,
4677 /*is_declaration=*/true)
4679 /* Now, if we saw a nested-name-specifier, we might be doing the
4680 second production. */
4681 if (nested_name_specifier_p
4682 && cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
4684 /* Consume the `template' keyword. */
4685 cp_lexer_consume_token (parser->lexer);
4686 /* Parse the template-id. */
4687 cp_parser_template_id (parser,
4688 /*template_keyword_p=*/true,
4689 /*check_dependency_p=*/false,
4690 /*is_declaration=*/true);
4691 /* Look for the `::' token. */
4692 cp_parser_require (parser, CPP_SCOPE, "`::'");
4694 /* If the next token is not a `~', then there might be some
4695 additional qualification. */
4696 else if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMPL))
4698 /* Look for the type-name. */
4699 *scope = TREE_TYPE (cp_parser_type_name (parser));
4701 if (*scope == error_mark_node)
4704 /* If we don't have ::~, then something has gone wrong. Since
4705 the only caller of this function is looking for something
4706 after `.' or `->' after a scalar type, most likely the
4707 program is trying to get a member of a non-aggregate
4709 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SCOPE)
4710 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_COMPL)
4712 cp_parser_error (parser, "request for member of non-aggregate type");
4716 /* Look for the `::' token. */
4717 cp_parser_require (parser, CPP_SCOPE, "`::'");
4722 /* Look for the `~'. */
4723 cp_parser_require (parser, CPP_COMPL, "`~'");
4724 /* Look for the type-name again. We are not responsible for
4725 checking that it matches the first type-name. */
4726 *type = cp_parser_type_name (parser);
4729 /* Parse a unary-expression.
4735 unary-operator cast-expression
4736 sizeof unary-expression
4744 __extension__ cast-expression
4745 __alignof__ unary-expression
4746 __alignof__ ( type-id )
4747 __real__ cast-expression
4748 __imag__ cast-expression
4751 ADDRESS_P is true iff the unary-expression is appearing as the
4752 operand of the `&' operator. CAST_P is true if this expression is
4753 the target of a cast.
4755 Returns a representation of the expression. */
4758 cp_parser_unary_expression (cp_parser *parser, bool address_p, bool cast_p)
4761 enum tree_code unary_operator;
4763 /* Peek at the next token. */
4764 token = cp_lexer_peek_token (parser->lexer);
4765 /* Some keywords give away the kind of expression. */
4766 if (token->type == CPP_KEYWORD)
4768 enum rid keyword = token->keyword;
4778 op = keyword == RID_ALIGNOF ? ALIGNOF_EXPR : SIZEOF_EXPR;
4779 /* Consume the token. */
4780 cp_lexer_consume_token (parser->lexer);
4781 /* Parse the operand. */
4782 operand = cp_parser_sizeof_operand (parser, keyword);
4784 if (TYPE_P (operand))
4785 return cxx_sizeof_or_alignof_type (operand, op, true);
4787 return cxx_sizeof_or_alignof_expr (operand, op);
4791 return cp_parser_new_expression (parser);
4794 return cp_parser_delete_expression (parser);
4798 /* The saved value of the PEDANTIC flag. */
4802 /* Save away the PEDANTIC flag. */
4803 cp_parser_extension_opt (parser, &saved_pedantic);
4804 /* Parse the cast-expression. */
4805 expr = cp_parser_simple_cast_expression (parser);
4806 /* Restore the PEDANTIC flag. */
4807 pedantic = saved_pedantic;
4817 /* Consume the `__real__' or `__imag__' token. */
4818 cp_lexer_consume_token (parser->lexer);
4819 /* Parse the cast-expression. */
4820 expression = cp_parser_simple_cast_expression (parser);
4821 /* Create the complete representation. */
4822 return build_x_unary_op ((keyword == RID_REALPART
4823 ? REALPART_EXPR : IMAGPART_EXPR),
4833 /* Look for the `:: new' and `:: delete', which also signal the
4834 beginning of a new-expression, or delete-expression,
4835 respectively. If the next token is `::', then it might be one of
4837 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
4841 /* See if the token after the `::' is one of the keywords in
4842 which we're interested. */
4843 keyword = cp_lexer_peek_nth_token (parser->lexer, 2)->keyword;
4844 /* If it's `new', we have a new-expression. */
4845 if (keyword == RID_NEW)
4846 return cp_parser_new_expression (parser);
4847 /* Similarly, for `delete'. */
4848 else if (keyword == RID_DELETE)
4849 return cp_parser_delete_expression (parser);
4852 /* Look for a unary operator. */
4853 unary_operator = cp_parser_unary_operator (token);
4854 /* The `++' and `--' operators can be handled similarly, even though
4855 they are not technically unary-operators in the grammar. */
4856 if (unary_operator == ERROR_MARK)
4858 if (token->type == CPP_PLUS_PLUS)
4859 unary_operator = PREINCREMENT_EXPR;
4860 else if (token->type == CPP_MINUS_MINUS)
4861 unary_operator = PREDECREMENT_EXPR;
4862 /* Handle the GNU address-of-label extension. */
4863 else if (cp_parser_allow_gnu_extensions_p (parser)
4864 && token->type == CPP_AND_AND)
4868 /* Consume the '&&' token. */
4869 cp_lexer_consume_token (parser->lexer);
4870 /* Look for the identifier. */
4871 identifier = cp_parser_identifier (parser);
4872 /* Create an expression representing the address. */
4873 return finish_label_address_expr (identifier);
4876 if (unary_operator != ERROR_MARK)
4878 tree cast_expression;
4879 tree expression = error_mark_node;
4880 const char *non_constant_p = NULL;
4882 /* Consume the operator token. */
4883 token = cp_lexer_consume_token (parser->lexer);
4884 /* Parse the cast-expression. */
4886 = cp_parser_cast_expression (parser,
4887 unary_operator == ADDR_EXPR,
4889 /* Now, build an appropriate representation. */
4890 switch (unary_operator)
4893 non_constant_p = "`*'";
4894 expression = build_x_indirect_ref (cast_expression, "unary *");
4898 non_constant_p = "`&'";
4901 expression = build_x_unary_op (unary_operator, cast_expression);
4904 case PREINCREMENT_EXPR:
4905 case PREDECREMENT_EXPR:
4906 non_constant_p = (unary_operator == PREINCREMENT_EXPR
4909 case UNARY_PLUS_EXPR:
4911 case TRUTH_NOT_EXPR:
4912 expression = finish_unary_op_expr (unary_operator, cast_expression);
4920 && cp_parser_non_integral_constant_expression (parser,
4922 expression = error_mark_node;
4927 return cp_parser_postfix_expression (parser, address_p, cast_p);
4930 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
4931 unary-operator, the corresponding tree code is returned. */
4933 static enum tree_code
4934 cp_parser_unary_operator (cp_token* token)
4936 switch (token->type)
4939 return INDIRECT_REF;
4945 return UNARY_PLUS_EXPR;
4951 return TRUTH_NOT_EXPR;
4954 return BIT_NOT_EXPR;
4961 /* Parse a new-expression.
4964 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
4965 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
4967 Returns a representation of the expression. */
4970 cp_parser_new_expression (cp_parser* parser)
4972 bool global_scope_p;
4978 /* Look for the optional `::' operator. */
4980 = (cp_parser_global_scope_opt (parser,
4981 /*current_scope_valid_p=*/false)
4983 /* Look for the `new' operator. */
4984 cp_parser_require_keyword (parser, RID_NEW, "`new'");
4985 /* There's no easy way to tell a new-placement from the
4986 `( type-id )' construct. */
4987 cp_parser_parse_tentatively (parser);
4988 /* Look for a new-placement. */
4989 placement = cp_parser_new_placement (parser);
4990 /* If that didn't work out, there's no new-placement. */
4991 if (!cp_parser_parse_definitely (parser))
4992 placement = NULL_TREE;
4994 /* If the next token is a `(', then we have a parenthesized
4996 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
4998 /* Consume the `('. */
4999 cp_lexer_consume_token (parser->lexer);
5000 /* Parse the type-id. */
5001 type = cp_parser_type_id (parser);
5002 /* Look for the closing `)'. */
5003 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
5004 /* There should not be a direct-new-declarator in this production,
5005 but GCC used to allowed this, so we check and emit a sensible error
5006 message for this case. */
5007 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
5009 error ("array bound forbidden after parenthesized type-id");
5010 inform ("try removing the parentheses around the type-id");
5011 cp_parser_direct_new_declarator (parser);
5015 /* Otherwise, there must be a new-type-id. */
5017 type = cp_parser_new_type_id (parser, &nelts);
5019 /* If the next token is a `(', then we have a new-initializer. */
5020 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
5021 initializer = cp_parser_new_initializer (parser);
5023 initializer = NULL_TREE;
5025 /* A new-expression may not appear in an integral constant
5027 if (cp_parser_non_integral_constant_expression (parser, "`new'"))
5028 return error_mark_node;
5030 /* Create a representation of the new-expression. */
5031 return build_new (placement, type, nelts, initializer, global_scope_p);
5034 /* Parse a new-placement.
5039 Returns the same representation as for an expression-list. */
5042 cp_parser_new_placement (cp_parser* parser)
5044 tree expression_list;
5046 /* Parse the expression-list. */
5047 expression_list = (cp_parser_parenthesized_expression_list
5048 (parser, false, /*cast_p=*/false,
5049 /*non_constant_p=*/NULL));
5051 return expression_list;
5054 /* Parse a new-type-id.
5057 type-specifier-seq new-declarator [opt]
5059 Returns the TYPE allocated. If the new-type-id indicates an array
5060 type, *NELTS is set to the number of elements in the last array
5061 bound; the TYPE will not include the last array bound. */
5064 cp_parser_new_type_id (cp_parser* parser, tree *nelts)
5066 cp_decl_specifier_seq type_specifier_seq;
5067 cp_declarator *new_declarator;
5068 cp_declarator *declarator;
5069 cp_declarator *outer_declarator;
5070 const char *saved_message;
5073 /* The type-specifier sequence must not contain type definitions.
5074 (It cannot contain declarations of new types either, but if they
5075 are not definitions we will catch that because they are not
5077 saved_message = parser->type_definition_forbidden_message;
5078 parser->type_definition_forbidden_message
5079 = "types may not be defined in a new-type-id";
5080 /* Parse the type-specifier-seq. */
5081 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
5082 &type_specifier_seq);
5083 /* Restore the old message. */
5084 parser->type_definition_forbidden_message = saved_message;
5085 /* Parse the new-declarator. */
5086 new_declarator = cp_parser_new_declarator_opt (parser);
5088 /* Determine the number of elements in the last array dimension, if
5091 /* Skip down to the last array dimension. */
5092 declarator = new_declarator;
5093 outer_declarator = NULL;
5094 while (declarator && (declarator->kind == cdk_pointer
5095 || declarator->kind == cdk_ptrmem))
5097 outer_declarator = declarator;
5098 declarator = declarator->declarator;
5101 && declarator->kind == cdk_array
5102 && declarator->declarator
5103 && declarator->declarator->kind == cdk_array)
5105 outer_declarator = declarator;
5106 declarator = declarator->declarator;
5109 if (declarator && declarator->kind == cdk_array)
5111 *nelts = declarator->u.array.bounds;
5112 if (*nelts == error_mark_node)
5113 *nelts = integer_one_node;
5115 if (outer_declarator)
5116 outer_declarator->declarator = declarator->declarator;
5118 new_declarator = NULL;
5121 type = groktypename (&type_specifier_seq, new_declarator);
5122 if (TREE_CODE (type) == ARRAY_TYPE && *nelts == NULL_TREE)
5124 *nelts = array_type_nelts_top (type);
5125 type = TREE_TYPE (type);
5130 /* Parse an (optional) new-declarator.
5133 ptr-operator new-declarator [opt]
5134 direct-new-declarator
5136 Returns the declarator. */
5138 static cp_declarator *
5139 cp_parser_new_declarator_opt (cp_parser* parser)
5141 enum tree_code code;
5143 cp_cv_quals cv_quals;
5145 /* We don't know if there's a ptr-operator next, or not. */
5146 cp_parser_parse_tentatively (parser);
5147 /* Look for a ptr-operator. */
5148 code = cp_parser_ptr_operator (parser, &type, &cv_quals);
5149 /* If that worked, look for more new-declarators. */
5150 if (cp_parser_parse_definitely (parser))
5152 cp_declarator *declarator;
5154 /* Parse another optional declarator. */
5155 declarator = cp_parser_new_declarator_opt (parser);
5157 /* Create the representation of the declarator. */
5159 declarator = make_ptrmem_declarator (cv_quals, type, declarator);
5160 else if (code == INDIRECT_REF)
5161 declarator = make_pointer_declarator (cv_quals, declarator);
5163 declarator = make_reference_declarator (cv_quals, declarator);
5168 /* If the next token is a `[', there is a direct-new-declarator. */
5169 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
5170 return cp_parser_direct_new_declarator (parser);
5175 /* Parse a direct-new-declarator.
5177 direct-new-declarator:
5179 direct-new-declarator [constant-expression]
5183 static cp_declarator *
5184 cp_parser_direct_new_declarator (cp_parser* parser)
5186 cp_declarator *declarator = NULL;
5192 /* Look for the opening `['. */
5193 cp_parser_require (parser, CPP_OPEN_SQUARE, "`['");
5194 /* The first expression is not required to be constant. */
5197 expression = cp_parser_expression (parser, /*cast_p=*/false);
5198 /* The standard requires that the expression have integral
5199 type. DR 74 adds enumeration types. We believe that the
5200 real intent is that these expressions be handled like the
5201 expression in a `switch' condition, which also allows
5202 classes with a single conversion to integral or
5203 enumeration type. */
5204 if (!processing_template_decl)
5207 = build_expr_type_conversion (WANT_INT | WANT_ENUM,
5212 error ("expression in new-declarator must have integral "
5213 "or enumeration type");
5214 expression = error_mark_node;
5218 /* But all the other expressions must be. */
5221 = cp_parser_constant_expression (parser,
5222 /*allow_non_constant=*/false,
5224 /* Look for the closing `]'. */
5225 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
5227 /* Add this bound to the declarator. */
5228 declarator = make_array_declarator (declarator, expression);
5230 /* If the next token is not a `[', then there are no more
5232 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_SQUARE))
5239 /* Parse a new-initializer.
5242 ( expression-list [opt] )
5244 Returns a representation of the expression-list. If there is no
5245 expression-list, VOID_ZERO_NODE is returned. */
5248 cp_parser_new_initializer (cp_parser* parser)
5250 tree expression_list;
5252 expression_list = (cp_parser_parenthesized_expression_list
5253 (parser, false, /*cast_p=*/false,
5254 /*non_constant_p=*/NULL));
5255 if (!expression_list)
5256 expression_list = void_zero_node;
5258 return expression_list;
5261 /* Parse a delete-expression.
5264 :: [opt] delete cast-expression
5265 :: [opt] delete [ ] cast-expression
5267 Returns a representation of the expression. */
5270 cp_parser_delete_expression (cp_parser* parser)
5272 bool global_scope_p;
5276 /* Look for the optional `::' operator. */
5278 = (cp_parser_global_scope_opt (parser,
5279 /*current_scope_valid_p=*/false)
5281 /* Look for the `delete' keyword. */
5282 cp_parser_require_keyword (parser, RID_DELETE, "`delete'");
5283 /* See if the array syntax is in use. */
5284 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
5286 /* Consume the `[' token. */
5287 cp_lexer_consume_token (parser->lexer);
5288 /* Look for the `]' token. */
5289 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
5290 /* Remember that this is the `[]' construct. */
5296 /* Parse the cast-expression. */
5297 expression = cp_parser_simple_cast_expression (parser);
5299 /* A delete-expression may not appear in an integral constant
5301 if (cp_parser_non_integral_constant_expression (parser, "`delete'"))
5302 return error_mark_node;
5304 return delete_sanity (expression, NULL_TREE, array_p, global_scope_p);
5307 /* Parse a cast-expression.
5311 ( type-id ) cast-expression
5313 ADDRESS_P is true iff the unary-expression is appearing as the
5314 operand of the `&' operator. CAST_P is true if this expression is
5315 the target of a cast.
5317 Returns a representation of the expression. */
5320 cp_parser_cast_expression (cp_parser *parser, bool address_p, bool cast_p)
5322 /* If it's a `(', then we might be looking at a cast. */
5323 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
5325 tree type = NULL_TREE;
5326 tree expr = NULL_TREE;
5327 bool compound_literal_p;
5328 const char *saved_message;
5330 /* There's no way to know yet whether or not this is a cast.
5331 For example, `(int (3))' is a unary-expression, while `(int)
5332 3' is a cast. So, we resort to parsing tentatively. */
5333 cp_parser_parse_tentatively (parser);
5334 /* Types may not be defined in a cast. */
5335 saved_message = parser->type_definition_forbidden_message;
5336 parser->type_definition_forbidden_message
5337 = "types may not be defined in casts";
5338 /* Consume the `('. */
5339 cp_lexer_consume_token (parser->lexer);
5340 /* A very tricky bit is that `(struct S) { 3 }' is a
5341 compound-literal (which we permit in C++ as an extension).
5342 But, that construct is not a cast-expression -- it is a
5343 postfix-expression. (The reason is that `(struct S) { 3 }.i'
5344 is legal; if the compound-literal were a cast-expression,
5345 you'd need an extra set of parentheses.) But, if we parse
5346 the type-id, and it happens to be a class-specifier, then we
5347 will commit to the parse at that point, because we cannot
5348 undo the action that is done when creating a new class. So,
5349 then we cannot back up and do a postfix-expression.
5351 Therefore, we scan ahead to the closing `)', and check to see
5352 if the token after the `)' is a `{'. If so, we are not
5353 looking at a cast-expression.
5355 Save tokens so that we can put them back. */
5356 cp_lexer_save_tokens (parser->lexer);
5357 /* Skip tokens until the next token is a closing parenthesis.
5358 If we find the closing `)', and the next token is a `{', then
5359 we are looking at a compound-literal. */
5361 = (cp_parser_skip_to_closing_parenthesis (parser, false, false,
5362 /*consume_paren=*/true)
5363 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE));
5364 /* Roll back the tokens we skipped. */
5365 cp_lexer_rollback_tokens (parser->lexer);
5366 /* If we were looking at a compound-literal, simulate an error
5367 so that the call to cp_parser_parse_definitely below will
5369 if (compound_literal_p)
5370 cp_parser_simulate_error (parser);
5373 bool saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
5374 parser->in_type_id_in_expr_p = true;
5375 /* Look for the type-id. */
5376 type = cp_parser_type_id (parser);
5377 /* Look for the closing `)'. */
5378 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
5379 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
5382 /* Restore the saved message. */
5383 parser->type_definition_forbidden_message = saved_message;
5385 /* If ok so far, parse the dependent expression. We cannot be
5386 sure it is a cast. Consider `(T ())'. It is a parenthesized
5387 ctor of T, but looks like a cast to function returning T
5388 without a dependent expression. */
5389 if (!cp_parser_error_occurred (parser))
5390 expr = cp_parser_cast_expression (parser,
5391 /*address_p=*/false,
5394 if (cp_parser_parse_definitely (parser))
5396 /* Warn about old-style casts, if so requested. */
5397 if (warn_old_style_cast
5398 && !in_system_header
5399 && !VOID_TYPE_P (type)
5400 && current_lang_name != lang_name_c)
5401 warning (0, "use of old-style cast");
5403 /* Only type conversions to integral or enumeration types
5404 can be used in constant-expressions. */
5405 if (parser->integral_constant_expression_p
5406 && !dependent_type_p (type)
5407 && !INTEGRAL_OR_ENUMERATION_TYPE_P (type)
5408 && (cp_parser_non_integral_constant_expression
5410 "a cast to a type other than an integral or "
5411 "enumeration type")))
5412 return error_mark_node;
5414 /* Perform the cast. */
5415 expr = build_c_cast (type, expr);
5420 /* If we get here, then it's not a cast, so it must be a
5421 unary-expression. */
5422 return cp_parser_unary_expression (parser, address_p, cast_p);
5425 /* Parse a binary expression of the general form:
5429 pm-expression .* cast-expression
5430 pm-expression ->* cast-expression
5432 multiplicative-expression:
5434 multiplicative-expression * pm-expression
5435 multiplicative-expression / pm-expression
5436 multiplicative-expression % pm-expression
5438 additive-expression:
5439 multiplicative-expression
5440 additive-expression + multiplicative-expression
5441 additive-expression - multiplicative-expression
5445 shift-expression << additive-expression
5446 shift-expression >> additive-expression
5448 relational-expression:
5450 relational-expression < shift-expression
5451 relational-expression > shift-expression
5452 relational-expression <= shift-expression
5453 relational-expression >= shift-expression
5457 relational-expression:
5458 relational-expression <? shift-expression
5459 relational-expression >? shift-expression
5461 equality-expression:
5462 relational-expression
5463 equality-expression == relational-expression
5464 equality-expression != relational-expression
5468 and-expression & equality-expression
5470 exclusive-or-expression:
5472 exclusive-or-expression ^ and-expression
5474 inclusive-or-expression:
5475 exclusive-or-expression
5476 inclusive-or-expression | exclusive-or-expression
5478 logical-and-expression:
5479 inclusive-or-expression
5480 logical-and-expression && inclusive-or-expression
5482 logical-or-expression:
5483 logical-and-expression
5484 logical-or-expression || logical-and-expression
5486 All these are implemented with a single function like:
5489 simple-cast-expression
5490 binary-expression <token> binary-expression
5492 CAST_P is true if this expression is the target of a cast.
5494 The binops_by_token map is used to get the tree codes for each <token> type.
5495 binary-expressions are associated according to a precedence table. */
5497 #define TOKEN_PRECEDENCE(token) \
5498 ((token->type == CPP_GREATER && !parser->greater_than_is_operator_p) \
5499 ? PREC_NOT_OPERATOR \
5500 : binops_by_token[token->type].prec)
5503 cp_parser_binary_expression (cp_parser* parser, bool cast_p)
5505 cp_parser_expression_stack stack;
5506 cp_parser_expression_stack_entry *sp = &stack[0];
5509 enum tree_code tree_type;
5510 enum cp_parser_prec prec = PREC_NOT_OPERATOR, new_prec, lookahead_prec;
5513 /* Parse the first expression. */
5514 lhs = cp_parser_cast_expression (parser, /*address_p=*/false, cast_p);
5518 /* Get an operator token. */
5519 token = cp_lexer_peek_token (parser->lexer);
5520 if (token->type == CPP_MIN || token->type == CPP_MAX)
5521 cp_parser_warn_min_max ();
5523 new_prec = TOKEN_PRECEDENCE (token);
5525 /* Popping an entry off the stack means we completed a subexpression:
5526 - either we found a token which is not an operator (`>' where it is not
5527 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
5528 will happen repeatedly;
5529 - or, we found an operator which has lower priority. This is the case
5530 where the recursive descent *ascends*, as in `3 * 4 + 5' after
5532 if (new_prec <= prec)
5541 tree_type = binops_by_token[token->type].tree_type;
5543 /* We used the operator token. */
5544 cp_lexer_consume_token (parser->lexer);
5546 /* Extract another operand. It may be the RHS of this expression
5547 or the LHS of a new, higher priority expression. */
5548 rhs = cp_parser_simple_cast_expression (parser);
5550 /* Get another operator token. Look up its precedence to avoid
5551 building a useless (immediately popped) stack entry for common
5552 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
5553 token = cp_lexer_peek_token (parser->lexer);
5554 lookahead_prec = TOKEN_PRECEDENCE (token);
5555 if (lookahead_prec > new_prec)
5557 /* ... and prepare to parse the RHS of the new, higher priority
5558 expression. Since precedence levels on the stack are
5559 monotonically increasing, we do not have to care about
5562 sp->tree_type = tree_type;
5567 new_prec = lookahead_prec;
5571 /* If the stack is not empty, we have parsed into LHS the right side
5572 (`4' in the example above) of an expression we had suspended.
5573 We can use the information on the stack to recover the LHS (`3')
5574 from the stack together with the tree code (`MULT_EXPR'), and
5575 the precedence of the higher level subexpression
5576 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
5577 which will be used to actually build the additive expression. */
5580 tree_type = sp->tree_type;
5585 overloaded_p = false;
5586 lhs = build_x_binary_op (tree_type, lhs, rhs, &overloaded_p);
5588 /* If the binary operator required the use of an overloaded operator,
5589 then this expression cannot be an integral constant-expression.
5590 An overloaded operator can be used even if both operands are
5591 otherwise permissible in an integral constant-expression if at
5592 least one of the operands is of enumeration type. */
5595 && (cp_parser_non_integral_constant_expression
5596 (parser, "calls to overloaded operators")))
5597 return error_mark_node;
5604 /* Parse the `? expression : assignment-expression' part of a
5605 conditional-expression. The LOGICAL_OR_EXPR is the
5606 logical-or-expression that started the conditional-expression.
5607 Returns a representation of the entire conditional-expression.
5609 This routine is used by cp_parser_assignment_expression.
5611 ? expression : assignment-expression
5615 ? : assignment-expression */
5618 cp_parser_question_colon_clause (cp_parser* parser, tree logical_or_expr)
5621 tree assignment_expr;
5623 /* Consume the `?' token. */
5624 cp_lexer_consume_token (parser->lexer);
5625 if (cp_parser_allow_gnu_extensions_p (parser)
5626 && cp_lexer_next_token_is (parser->lexer, CPP_COLON))
5627 /* Implicit true clause. */
5630 /* Parse the expression. */
5631 expr = cp_parser_expression (parser, /*cast_p=*/false);
5633 /* The next token should be a `:'. */
5634 cp_parser_require (parser, CPP_COLON, "`:'");
5635 /* Parse the assignment-expression. */
5636 assignment_expr = cp_parser_assignment_expression (parser, /*cast_p=*/false);
5638 /* Build the conditional-expression. */
5639 return build_x_conditional_expr (logical_or_expr,
5644 /* Parse an assignment-expression.
5646 assignment-expression:
5647 conditional-expression
5648 logical-or-expression assignment-operator assignment_expression
5651 CAST_P is true if this expression is the target of a cast.
5653 Returns a representation for the expression. */
5656 cp_parser_assignment_expression (cp_parser* parser, bool cast_p)
5660 /* If the next token is the `throw' keyword, then we're looking at
5661 a throw-expression. */
5662 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_THROW))
5663 expr = cp_parser_throw_expression (parser);
5664 /* Otherwise, it must be that we are looking at a
5665 logical-or-expression. */
5668 /* Parse the binary expressions (logical-or-expression). */
5669 expr = cp_parser_binary_expression (parser, cast_p);
5670 /* If the next token is a `?' then we're actually looking at a
5671 conditional-expression. */
5672 if (cp_lexer_next_token_is (parser->lexer, CPP_QUERY))
5673 return cp_parser_question_colon_clause (parser, expr);
5676 enum tree_code assignment_operator;
5678 /* If it's an assignment-operator, we're using the second
5681 = cp_parser_assignment_operator_opt (parser);
5682 if (assignment_operator != ERROR_MARK)
5686 /* Parse the right-hand side of the assignment. */
5687 rhs = cp_parser_assignment_expression (parser, cast_p);
5688 /* An assignment may not appear in a
5689 constant-expression. */
5690 if (cp_parser_non_integral_constant_expression (parser,
5692 return error_mark_node;
5693 /* Build the assignment expression. */
5694 expr = build_x_modify_expr (expr,
5695 assignment_operator,
5704 /* Parse an (optional) assignment-operator.
5706 assignment-operator: one of
5707 = *= /= %= += -= >>= <<= &= ^= |=
5711 assignment-operator: one of
5714 If the next token is an assignment operator, the corresponding tree
5715 code is returned, and the token is consumed. For example, for
5716 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
5717 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
5718 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
5719 operator, ERROR_MARK is returned. */
5721 static enum tree_code
5722 cp_parser_assignment_operator_opt (cp_parser* parser)
5727 /* Peek at the next toen. */
5728 token = cp_lexer_peek_token (parser->lexer);
5730 switch (token->type)
5741 op = TRUNC_DIV_EXPR;
5745 op = TRUNC_MOD_EXPR;
5778 cp_parser_warn_min_max ();
5783 cp_parser_warn_min_max ();
5787 /* Nothing else is an assignment operator. */
5791 /* If it was an assignment operator, consume it. */
5792 if (op != ERROR_MARK)
5793 cp_lexer_consume_token (parser->lexer);
5798 /* Parse an expression.
5801 assignment-expression
5802 expression , assignment-expression
5804 CAST_P is true if this expression is the target of a cast.
5806 Returns a representation of the expression. */
5809 cp_parser_expression (cp_parser* parser, bool cast_p)
5811 tree expression = NULL_TREE;
5815 tree assignment_expression;
5817 /* Parse the next assignment-expression. */
5818 assignment_expression
5819 = cp_parser_assignment_expression (parser, cast_p);
5820 /* If this is the first assignment-expression, we can just
5823 expression = assignment_expression;
5825 expression = build_x_compound_expr (expression,
5826 assignment_expression);
5827 /* If the next token is not a comma, then we are done with the
5829 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
5831 /* Consume the `,'. */
5832 cp_lexer_consume_token (parser->lexer);
5833 /* A comma operator cannot appear in a constant-expression. */
5834 if (cp_parser_non_integral_constant_expression (parser,
5835 "a comma operator"))
5836 expression = error_mark_node;
5842 /* Parse a constant-expression.
5844 constant-expression:
5845 conditional-expression
5847 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
5848 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
5849 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
5850 is false, NON_CONSTANT_P should be NULL. */
5853 cp_parser_constant_expression (cp_parser* parser,
5854 bool allow_non_constant_p,
5855 bool *non_constant_p)
5857 bool saved_integral_constant_expression_p;
5858 bool saved_allow_non_integral_constant_expression_p;
5859 bool saved_non_integral_constant_expression_p;
5862 /* It might seem that we could simply parse the
5863 conditional-expression, and then check to see if it were
5864 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
5865 one that the compiler can figure out is constant, possibly after
5866 doing some simplifications or optimizations. The standard has a
5867 precise definition of constant-expression, and we must honor
5868 that, even though it is somewhat more restrictive.
5874 is not a legal declaration, because `(2, 3)' is not a
5875 constant-expression. The `,' operator is forbidden in a
5876 constant-expression. However, GCC's constant-folding machinery
5877 will fold this operation to an INTEGER_CST for `3'. */
5879 /* Save the old settings. */
5880 saved_integral_constant_expression_p = parser->integral_constant_expression_p;
5881 saved_allow_non_integral_constant_expression_p
5882 = parser->allow_non_integral_constant_expression_p;
5883 saved_non_integral_constant_expression_p = parser->non_integral_constant_expression_p;
5884 /* We are now parsing a constant-expression. */
5885 parser->integral_constant_expression_p = true;
5886 parser->allow_non_integral_constant_expression_p = allow_non_constant_p;
5887 parser->non_integral_constant_expression_p = false;
5888 /* Although the grammar says "conditional-expression", we parse an
5889 "assignment-expression", which also permits "throw-expression"
5890 and the use of assignment operators. In the case that
5891 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
5892 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
5893 actually essential that we look for an assignment-expression.
5894 For example, cp_parser_initializer_clauses uses this function to
5895 determine whether a particular assignment-expression is in fact
5897 expression = cp_parser_assignment_expression (parser, /*cast_p=*/false);
5898 /* Restore the old settings. */
5899 parser->integral_constant_expression_p
5900 = saved_integral_constant_expression_p;
5901 parser->allow_non_integral_constant_expression_p
5902 = saved_allow_non_integral_constant_expression_p;
5903 if (allow_non_constant_p)
5904 *non_constant_p = parser->non_integral_constant_expression_p;
5905 else if (parser->non_integral_constant_expression_p)
5906 expression = error_mark_node;
5907 parser->non_integral_constant_expression_p
5908 = saved_non_integral_constant_expression_p;
5913 /* Parse __builtin_offsetof.
5915 offsetof-expression:
5916 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
5918 offsetof-member-designator:
5920 | offsetof-member-designator "." id-expression
5921 | offsetof-member-designator "[" expression "]"
5925 cp_parser_builtin_offsetof (cp_parser *parser)
5927 int save_ice_p, save_non_ice_p;
5931 /* We're about to accept non-integral-constant things, but will
5932 definitely yield an integral constant expression. Save and
5933 restore these values around our local parsing. */
5934 save_ice_p = parser->integral_constant_expression_p;
5935 save_non_ice_p = parser->non_integral_constant_expression_p;
5937 /* Consume the "__builtin_offsetof" token. */
5938 cp_lexer_consume_token (parser->lexer);
5939 /* Consume the opening `('. */
5940 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
5941 /* Parse the type-id. */
5942 type = cp_parser_type_id (parser);
5943 /* Look for the `,'. */
5944 cp_parser_require (parser, CPP_COMMA, "`,'");
5946 /* Build the (type *)null that begins the traditional offsetof macro. */
5947 expr = build_static_cast (build_pointer_type (type), null_pointer_node);
5949 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
5950 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DEREF, expr,
5954 cp_token *token = cp_lexer_peek_token (parser->lexer);
5955 switch (token->type)
5957 case CPP_OPEN_SQUARE:
5958 /* offsetof-member-designator "[" expression "]" */
5959 expr = cp_parser_postfix_open_square_expression (parser, expr, true);
5963 /* offsetof-member-designator "." identifier */
5964 cp_lexer_consume_token (parser->lexer);
5965 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DOT, expr,
5969 case CPP_CLOSE_PAREN:
5970 /* Consume the ")" token. */
5971 cp_lexer_consume_token (parser->lexer);
5975 /* Error. We know the following require will fail, but
5976 that gives the proper error message. */
5977 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
5978 cp_parser_skip_to_closing_parenthesis (parser, true, false, true);
5979 expr = error_mark_node;
5985 /* If we're processing a template, we can't finish the semantics yet.
5986 Otherwise we can fold the entire expression now. */
5987 if (processing_template_decl)
5988 expr = build1 (OFFSETOF_EXPR, size_type_node, expr);
5990 expr = fold_offsetof (expr);
5993 parser->integral_constant_expression_p = save_ice_p;
5994 parser->non_integral_constant_expression_p = save_non_ice_p;
5999 /* Statements [gram.stmt.stmt] */
6001 /* Parse a statement.
6005 expression-statement
6010 declaration-statement
6014 cp_parser_statement (cp_parser* parser, tree in_statement_expr)
6018 location_t statement_location;
6020 /* There is no statement yet. */
6021 statement = NULL_TREE;
6022 /* Peek at the next token. */
6023 token = cp_lexer_peek_token (parser->lexer);
6024 /* Remember the location of the first token in the statement. */
6025 statement_location = token->location;
6026 /* If this is a keyword, then that will often determine what kind of
6027 statement we have. */
6028 if (token->type == CPP_KEYWORD)
6030 enum rid keyword = token->keyword;
6036 statement = cp_parser_labeled_statement (parser,
6042 statement = cp_parser_selection_statement (parser);
6048 statement = cp_parser_iteration_statement (parser);
6055 statement = cp_parser_jump_statement (parser);
6058 /* Objective-C++ exception-handling constructs. */
6061 case RID_AT_FINALLY:
6062 case RID_AT_SYNCHRONIZED:
6064 statement = cp_parser_objc_statement (parser);
6068 statement = cp_parser_try_block (parser);
6072 /* It might be a keyword like `int' that can start a
6073 declaration-statement. */
6077 else if (token->type == CPP_NAME)
6079 /* If the next token is a `:', then we are looking at a
6080 labeled-statement. */
6081 token = cp_lexer_peek_nth_token (parser->lexer, 2);
6082 if (token->type == CPP_COLON)
6083 statement = cp_parser_labeled_statement (parser, in_statement_expr);
6085 /* Anything that starts with a `{' must be a compound-statement. */
6086 else if (token->type == CPP_OPEN_BRACE)
6087 statement = cp_parser_compound_statement (parser, NULL, false);
6088 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
6089 a statement all its own. */
6090 else if (token->type == CPP_PRAGMA)
6092 cp_lexer_handle_pragma (parser->lexer);
6096 /* Everything else must be a declaration-statement or an
6097 expression-statement. Try for the declaration-statement
6098 first, unless we are looking at a `;', in which case we know that
6099 we have an expression-statement. */
6102 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6104 cp_parser_parse_tentatively (parser);
6105 /* Try to parse the declaration-statement. */
6106 cp_parser_declaration_statement (parser);
6107 /* If that worked, we're done. */
6108 if (cp_parser_parse_definitely (parser))
6111 /* Look for an expression-statement instead. */
6112 statement = cp_parser_expression_statement (parser, in_statement_expr);
6115 /* Set the line number for the statement. */
6116 if (statement && STATEMENT_CODE_P (TREE_CODE (statement)))
6117 SET_EXPR_LOCATION (statement, statement_location);
6120 /* Parse a labeled-statement.
6123 identifier : statement
6124 case constant-expression : statement
6130 case constant-expression ... constant-expression : statement
6132 Returns the new CASE_LABEL_EXPR, for a `case' or `default' label.
6133 For an ordinary label, returns a LABEL_EXPR. */
6136 cp_parser_labeled_statement (cp_parser* parser, tree in_statement_expr)
6139 tree statement = error_mark_node;
6141 /* The next token should be an identifier. */
6142 token = cp_lexer_peek_token (parser->lexer);
6143 if (token->type != CPP_NAME
6144 && token->type != CPP_KEYWORD)
6146 cp_parser_error (parser, "expected labeled-statement");
6147 return error_mark_node;
6150 switch (token->keyword)
6157 /* Consume the `case' token. */
6158 cp_lexer_consume_token (parser->lexer);
6159 /* Parse the constant-expression. */
6160 expr = cp_parser_constant_expression (parser,
6161 /*allow_non_constant_p=*/false,
6164 ellipsis = cp_lexer_peek_token (parser->lexer);
6165 if (ellipsis->type == CPP_ELLIPSIS)
6167 /* Consume the `...' token. */
6168 cp_lexer_consume_token (parser->lexer);
6170 cp_parser_constant_expression (parser,
6171 /*allow_non_constant_p=*/false,
6173 /* We don't need to emit warnings here, as the common code
6174 will do this for us. */
6177 expr_hi = NULL_TREE;
6179 if (!parser->in_switch_statement_p)
6180 error ("case label %qE not within a switch statement", expr);
6182 statement = finish_case_label (expr, expr_hi);
6187 /* Consume the `default' token. */
6188 cp_lexer_consume_token (parser->lexer);
6189 if (!parser->in_switch_statement_p)
6190 error ("case label not within a switch statement");
6192 statement = finish_case_label (NULL_TREE, NULL_TREE);
6196 /* Anything else must be an ordinary label. */
6197 statement = finish_label_stmt (cp_parser_identifier (parser));
6201 /* Require the `:' token. */
6202 cp_parser_require (parser, CPP_COLON, "`:'");
6203 /* Parse the labeled statement. */
6204 cp_parser_statement (parser, in_statement_expr);
6206 /* Return the label, in the case of a `case' or `default' label. */
6210 /* Parse an expression-statement.
6212 expression-statement:
6215 Returns the new EXPR_STMT -- or NULL_TREE if the expression
6216 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
6217 indicates whether this expression-statement is part of an
6218 expression statement. */
6221 cp_parser_expression_statement (cp_parser* parser, tree in_statement_expr)
6223 tree statement = NULL_TREE;
6225 /* If the next token is a ';', then there is no expression
6227 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6228 statement = cp_parser_expression (parser, /*cast_p=*/false);
6230 /* Consume the final `;'. */
6231 cp_parser_consume_semicolon_at_end_of_statement (parser);
6233 if (in_statement_expr
6234 && cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
6235 /* This is the final expression statement of a statement
6237 statement = finish_stmt_expr_expr (statement, in_statement_expr);
6239 statement = finish_expr_stmt (statement);
6246 /* Parse a compound-statement.
6249 { statement-seq [opt] }
6251 Returns a tree representing the statement. */
6254 cp_parser_compound_statement (cp_parser *parser, tree in_statement_expr,
6259 /* Consume the `{'. */
6260 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "`{'"))
6261 return error_mark_node;
6262 /* Begin the compound-statement. */
6263 compound_stmt = begin_compound_stmt (in_try ? BCS_TRY_BLOCK : 0);
6264 /* Parse an (optional) statement-seq. */
6265 cp_parser_statement_seq_opt (parser, in_statement_expr);
6266 /* Finish the compound-statement. */
6267 finish_compound_stmt (compound_stmt);
6268 /* Consume the `}'. */
6269 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
6271 return compound_stmt;
6274 /* Parse an (optional) statement-seq.
6278 statement-seq [opt] statement */
6281 cp_parser_statement_seq_opt (cp_parser* parser, tree in_statement_expr)
6283 /* Scan statements until there aren't any more. */
6286 /* If we're looking at a `}', then we've run out of statements. */
6287 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE)
6288 || cp_lexer_next_token_is (parser->lexer, CPP_EOF))
6291 /* Parse the statement. */
6292 cp_parser_statement (parser, in_statement_expr);
6296 /* Parse a selection-statement.
6298 selection-statement:
6299 if ( condition ) statement
6300 if ( condition ) statement else statement
6301 switch ( condition ) statement
6303 Returns the new IF_STMT or SWITCH_STMT. */
6306 cp_parser_selection_statement (cp_parser* parser)
6311 /* Peek at the next token. */
6312 token = cp_parser_require (parser, CPP_KEYWORD, "selection-statement");
6314 /* See what kind of keyword it is. */
6315 keyword = token->keyword;
6324 /* Look for the `('. */
6325 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
6327 cp_parser_skip_to_end_of_statement (parser);
6328 return error_mark_node;
6331 /* Begin the selection-statement. */
6332 if (keyword == RID_IF)
6333 statement = begin_if_stmt ();
6335 statement = begin_switch_stmt ();
6337 /* Parse the condition. */
6338 condition = cp_parser_condition (parser);
6339 /* Look for the `)'. */
6340 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
6341 cp_parser_skip_to_closing_parenthesis (parser, true, false,
6342 /*consume_paren=*/true);
6344 if (keyword == RID_IF)
6346 /* Add the condition. */
6347 finish_if_stmt_cond (condition, statement);
6349 /* Parse the then-clause. */
6350 cp_parser_implicitly_scoped_statement (parser);
6351 finish_then_clause (statement);
6353 /* If the next token is `else', parse the else-clause. */
6354 if (cp_lexer_next_token_is_keyword (parser->lexer,
6357 /* Consume the `else' keyword. */
6358 cp_lexer_consume_token (parser->lexer);
6359 begin_else_clause (statement);
6360 /* Parse the else-clause. */
6361 cp_parser_implicitly_scoped_statement (parser);
6362 finish_else_clause (statement);
6365 /* Now we're all done with the if-statement. */
6366 finish_if_stmt (statement);
6370 bool in_switch_statement_p;
6372 /* Add the condition. */
6373 finish_switch_cond (condition, statement);
6375 /* Parse the body of the switch-statement. */
6376 in_switch_statement_p = parser->in_switch_statement_p;
6377 parser->in_switch_statement_p = true;
6378 cp_parser_implicitly_scoped_statement (parser);
6379 parser->in_switch_statement_p = in_switch_statement_p;
6381 /* Now we're all done with the switch-statement. */
6382 finish_switch_stmt (statement);
6390 cp_parser_error (parser, "expected selection-statement");
6391 return error_mark_node;
6395 /* Parse a condition.
6399 type-specifier-seq declarator = assignment-expression
6404 type-specifier-seq declarator asm-specification [opt]
6405 attributes [opt] = assignment-expression
6407 Returns the expression that should be tested. */
6410 cp_parser_condition (cp_parser* parser)
6412 cp_decl_specifier_seq type_specifiers;
6413 const char *saved_message;
6415 /* Try the declaration first. */
6416 cp_parser_parse_tentatively (parser);
6417 /* New types are not allowed in the type-specifier-seq for a
6419 saved_message = parser->type_definition_forbidden_message;
6420 parser->type_definition_forbidden_message
6421 = "types may not be defined in conditions";
6422 /* Parse the type-specifier-seq. */
6423 cp_parser_type_specifier_seq (parser, /*is_condition==*/true,
6425 /* Restore the saved message. */
6426 parser->type_definition_forbidden_message = saved_message;
6427 /* If all is well, we might be looking at a declaration. */
6428 if (!cp_parser_error_occurred (parser))
6431 tree asm_specification;
6433 cp_declarator *declarator;
6434 tree initializer = NULL_TREE;
6436 /* Parse the declarator. */
6437 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
6438 /*ctor_dtor_or_conv_p=*/NULL,
6439 /*parenthesized_p=*/NULL,
6440 /*member_p=*/false);
6441 /* Parse the attributes. */
6442 attributes = cp_parser_attributes_opt (parser);
6443 /* Parse the asm-specification. */
6444 asm_specification = cp_parser_asm_specification_opt (parser);
6445 /* If the next token is not an `=', then we might still be
6446 looking at an expression. For example:
6450 looks like a decl-specifier-seq and a declarator -- but then
6451 there is no `=', so this is an expression. */
6452 cp_parser_require (parser, CPP_EQ, "`='");
6453 /* If we did see an `=', then we are looking at a declaration
6455 if (cp_parser_parse_definitely (parser))
6459 /* Create the declaration. */
6460 decl = start_decl (declarator, &type_specifiers,
6461 /*initialized_p=*/true,
6462 attributes, /*prefix_attributes=*/NULL_TREE,
6464 /* Parse the assignment-expression. */
6465 initializer = cp_parser_assignment_expression (parser,
6468 /* Process the initializer. */
6469 cp_finish_decl (decl,
6472 LOOKUP_ONLYCONVERTING);
6475 pop_scope (pushed_scope);
6477 return convert_from_reference (decl);
6480 /* If we didn't even get past the declarator successfully, we are
6481 definitely not looking at a declaration. */
6483 cp_parser_abort_tentative_parse (parser);
6485 /* Otherwise, we are looking at an expression. */
6486 return cp_parser_expression (parser, /*cast_p=*/false);
6489 /* Parse an iteration-statement.
6491 iteration-statement:
6492 while ( condition ) statement
6493 do statement while ( expression ) ;
6494 for ( for-init-statement condition [opt] ; expression [opt] )
6497 Returns the new WHILE_STMT, DO_STMT, or FOR_STMT. */
6500 cp_parser_iteration_statement (cp_parser* parser)
6505 bool in_iteration_statement_p;
6508 /* Peek at the next token. */
6509 token = cp_parser_require (parser, CPP_KEYWORD, "iteration-statement");
6511 return error_mark_node;
6513 /* Remember whether or not we are already within an iteration
6515 in_iteration_statement_p = parser->in_iteration_statement_p;
6517 /* See what kind of keyword it is. */
6518 keyword = token->keyword;
6525 /* Begin the while-statement. */
6526 statement = begin_while_stmt ();
6527 /* Look for the `('. */
6528 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6529 /* Parse the condition. */
6530 condition = cp_parser_condition (parser);
6531 finish_while_stmt_cond (condition, statement);
6532 /* Look for the `)'. */
6533 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6534 /* Parse the dependent statement. */
6535 parser->in_iteration_statement_p = true;
6536 cp_parser_already_scoped_statement (parser);
6537 parser->in_iteration_statement_p = in_iteration_statement_p;
6538 /* We're done with the while-statement. */
6539 finish_while_stmt (statement);
6547 /* Begin the do-statement. */
6548 statement = begin_do_stmt ();
6549 /* Parse the body of the do-statement. */
6550 parser->in_iteration_statement_p = true;
6551 cp_parser_implicitly_scoped_statement (parser);
6552 parser->in_iteration_statement_p = in_iteration_statement_p;
6553 finish_do_body (statement);
6554 /* Look for the `while' keyword. */
6555 cp_parser_require_keyword (parser, RID_WHILE, "`while'");
6556 /* Look for the `('. */
6557 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6558 /* Parse the expression. */
6559 expression = cp_parser_expression (parser, /*cast_p=*/false);
6560 /* We're done with the do-statement. */
6561 finish_do_stmt (expression, statement);
6562 /* Look for the `)'. */
6563 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6564 /* Look for the `;'. */
6565 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6571 tree condition = NULL_TREE;
6572 tree expression = NULL_TREE;
6574 /* Begin the for-statement. */
6575 statement = begin_for_stmt ();
6576 /* Look for the `('. */
6577 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6578 /* Parse the initialization. */
6579 cp_parser_for_init_statement (parser);
6580 finish_for_init_stmt (statement);
6582 /* If there's a condition, process it. */
6583 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6584 condition = cp_parser_condition (parser);
6585 finish_for_cond (condition, statement);
6586 /* Look for the `;'. */
6587 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6589 /* If there's an expression, process it. */
6590 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
6591 expression = cp_parser_expression (parser, /*cast_p=*/false);
6592 finish_for_expr (expression, statement);
6593 /* Look for the `)'. */
6594 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6596 /* Parse the body of the for-statement. */
6597 parser->in_iteration_statement_p = true;
6598 cp_parser_already_scoped_statement (parser);
6599 parser->in_iteration_statement_p = in_iteration_statement_p;
6601 /* We're done with the for-statement. */
6602 finish_for_stmt (statement);
6607 cp_parser_error (parser, "expected iteration-statement");
6608 statement = error_mark_node;
6615 /* Parse a for-init-statement.
6618 expression-statement
6619 simple-declaration */
6622 cp_parser_for_init_statement (cp_parser* parser)
6624 /* If the next token is a `;', then we have an empty
6625 expression-statement. Grammatically, this is also a
6626 simple-declaration, but an invalid one, because it does not
6627 declare anything. Therefore, if we did not handle this case
6628 specially, we would issue an error message about an invalid
6630 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6632 /* We're going to speculatively look for a declaration, falling back
6633 to an expression, if necessary. */
6634 cp_parser_parse_tentatively (parser);
6635 /* Parse the declaration. */
6636 cp_parser_simple_declaration (parser,
6637 /*function_definition_allowed_p=*/false);
6638 /* If the tentative parse failed, then we shall need to look for an
6639 expression-statement. */
6640 if (cp_parser_parse_definitely (parser))
6644 cp_parser_expression_statement (parser, false);
6647 /* Parse a jump-statement.
6652 return expression [opt] ;
6660 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
6663 cp_parser_jump_statement (cp_parser* parser)
6665 tree statement = error_mark_node;
6669 /* Peek at the next token. */
6670 token = cp_parser_require (parser, CPP_KEYWORD, "jump-statement");
6672 return error_mark_node;
6674 /* See what kind of keyword it is. */
6675 keyword = token->keyword;
6679 if (!parser->in_switch_statement_p
6680 && !parser->in_iteration_statement_p)
6682 error ("break statement not within loop or switch");
6683 statement = error_mark_node;
6686 statement = finish_break_stmt ();
6687 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
6691 if (!parser->in_iteration_statement_p)
6693 error ("continue statement not within a loop");
6694 statement = error_mark_node;
6697 statement = finish_continue_stmt ();
6698 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
6705 /* If the next token is a `;', then there is no
6707 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6708 expr = cp_parser_expression (parser, /*cast_p=*/false);
6711 /* Build the return-statement. */
6712 statement = finish_return_stmt (expr);
6713 /* Look for the final `;'. */
6714 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
6719 /* Create the goto-statement. */
6720 if (cp_lexer_next_token_is (parser->lexer, CPP_MULT))
6722 /* Issue a warning about this use of a GNU extension. */
6724 pedwarn ("ISO C++ forbids computed gotos");
6725 /* Consume the '*' token. */
6726 cp_lexer_consume_token (parser->lexer);
6727 /* Parse the dependent expression. */
6728 finish_goto_stmt (cp_parser_expression (parser, /*cast_p=*/false));
6731 finish_goto_stmt (cp_parser_identifier (parser));
6732 /* Look for the final `;'. */
6733 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
6737 cp_parser_error (parser, "expected jump-statement");
6744 /* Parse a declaration-statement.
6746 declaration-statement:
6747 block-declaration */
6750 cp_parser_declaration_statement (cp_parser* parser)
6754 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
6755 p = obstack_alloc (&declarator_obstack, 0);
6757 /* Parse the block-declaration. */
6758 cp_parser_block_declaration (parser, /*statement_p=*/true);
6760 /* Free any declarators allocated. */
6761 obstack_free (&declarator_obstack, p);
6763 /* Finish off the statement. */
6767 /* Some dependent statements (like `if (cond) statement'), are
6768 implicitly in their own scope. In other words, if the statement is
6769 a single statement (as opposed to a compound-statement), it is
6770 none-the-less treated as if it were enclosed in braces. Any
6771 declarations appearing in the dependent statement are out of scope
6772 after control passes that point. This function parses a statement,
6773 but ensures that is in its own scope, even if it is not a
6776 Returns the new statement. */
6779 cp_parser_implicitly_scoped_statement (cp_parser* parser)
6783 /* If the token is not a `{', then we must take special action. */
6784 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
6786 /* Create a compound-statement. */
6787 statement = begin_compound_stmt (0);
6788 /* Parse the dependent-statement. */
6789 cp_parser_statement (parser, false);
6790 /* Finish the dummy compound-statement. */
6791 finish_compound_stmt (statement);
6793 /* Otherwise, we simply parse the statement directly. */
6795 statement = cp_parser_compound_statement (parser, NULL, false);
6797 /* Return the statement. */
6801 /* For some dependent statements (like `while (cond) statement'), we
6802 have already created a scope. Therefore, even if the dependent
6803 statement is a compound-statement, we do not want to create another
6807 cp_parser_already_scoped_statement (cp_parser* parser)
6809 /* If the token is a `{', then we must take special action. */
6810 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
6811 cp_parser_statement (parser, false);
6814 /* Avoid calling cp_parser_compound_statement, so that we
6815 don't create a new scope. Do everything else by hand. */
6816 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
6817 cp_parser_statement_seq_opt (parser, false);
6818 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
6822 /* Declarations [gram.dcl.dcl] */
6824 /* Parse an optional declaration-sequence.
6828 declaration-seq declaration */
6831 cp_parser_declaration_seq_opt (cp_parser* parser)
6837 token = cp_lexer_peek_token (parser->lexer);
6839 if (token->type == CPP_CLOSE_BRACE
6840 || token->type == CPP_EOF)
6843 if (token->type == CPP_SEMICOLON)
6845 /* A declaration consisting of a single semicolon is
6846 invalid. Allow it unless we're being pedantic. */
6847 cp_lexer_consume_token (parser->lexer);
6848 if (pedantic && !in_system_header)
6849 pedwarn ("extra %<;%>");
6853 /* If we're entering or exiting a region that's implicitly
6854 extern "C", modify the lang context appropriately. */
6855 if (!parser->implicit_extern_c && token->implicit_extern_c)
6857 push_lang_context (lang_name_c);
6858 parser->implicit_extern_c = true;
6860 else if (parser->implicit_extern_c && !token->implicit_extern_c)
6862 pop_lang_context ();
6863 parser->implicit_extern_c = false;
6866 if (token->type == CPP_PRAGMA)
6868 /* A top-level declaration can consist solely of a #pragma.
6869 A nested declaration cannot, so this is done here and not
6870 in cp_parser_declaration. (A #pragma at block scope is
6871 handled in cp_parser_statement.) */
6872 cp_lexer_handle_pragma (parser->lexer);
6876 /* Parse the declaration itself. */
6877 cp_parser_declaration (parser);
6881 /* Parse a declaration.
6886 template-declaration
6887 explicit-instantiation
6888 explicit-specialization
6889 linkage-specification
6890 namespace-definition
6895 __extension__ declaration */
6898 cp_parser_declaration (cp_parser* parser)
6905 /* Check for the `__extension__' keyword. */
6906 if (cp_parser_extension_opt (parser, &saved_pedantic))
6908 /* Parse the qualified declaration. */
6909 cp_parser_declaration (parser);
6910 /* Restore the PEDANTIC flag. */
6911 pedantic = saved_pedantic;
6916 /* Try to figure out what kind of declaration is present. */
6917 token1 = *cp_lexer_peek_token (parser->lexer);
6919 if (token1.type != CPP_EOF)
6920 token2 = *cp_lexer_peek_nth_token (parser->lexer, 2);
6922 token2.type = token2.keyword = RID_MAX;
6924 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
6925 p = obstack_alloc (&declarator_obstack, 0);
6927 /* If the next token is `extern' and the following token is a string
6928 literal, then we have a linkage specification. */
6929 if (token1.keyword == RID_EXTERN
6930 && cp_parser_is_string_literal (&token2))
6931 cp_parser_linkage_specification (parser);
6932 /* If the next token is `template', then we have either a template
6933 declaration, an explicit instantiation, or an explicit
6935 else if (token1.keyword == RID_TEMPLATE)
6937 /* `template <>' indicates a template specialization. */
6938 if (token2.type == CPP_LESS
6939 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_GREATER)
6940 cp_parser_explicit_specialization (parser);
6941 /* `template <' indicates a template declaration. */
6942 else if (token2.type == CPP_LESS)
6943 cp_parser_template_declaration (parser, /*member_p=*/false);
6944 /* Anything else must be an explicit instantiation. */
6946 cp_parser_explicit_instantiation (parser);
6948 /* If the next token is `export', then we have a template
6950 else if (token1.keyword == RID_EXPORT)
6951 cp_parser_template_declaration (parser, /*member_p=*/false);
6952 /* If the next token is `extern', 'static' or 'inline' and the one
6953 after that is `template', we have a GNU extended explicit
6954 instantiation directive. */
6955 else if (cp_parser_allow_gnu_extensions_p (parser)
6956 && (token1.keyword == RID_EXTERN
6957 || token1.keyword == RID_STATIC
6958 || token1.keyword == RID_INLINE)
6959 && token2.keyword == RID_TEMPLATE)
6960 cp_parser_explicit_instantiation (parser);
6961 /* If the next token is `namespace', check for a named or unnamed
6962 namespace definition. */
6963 else if (token1.keyword == RID_NAMESPACE
6964 && (/* A named namespace definition. */
6965 (token2.type == CPP_NAME
6966 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
6968 /* An unnamed namespace definition. */
6969 || token2.type == CPP_OPEN_BRACE))
6970 cp_parser_namespace_definition (parser);
6971 /* Objective-C++ declaration/definition. */
6972 else if (c_dialect_objc () && OBJC_IS_AT_KEYWORD (token1.keyword))
6973 cp_parser_objc_declaration (parser);
6974 /* We must have either a block declaration or a function
6977 /* Try to parse a block-declaration, or a function-definition. */
6978 cp_parser_block_declaration (parser, /*statement_p=*/false);
6980 /* Free any declarators allocated. */
6981 obstack_free (&declarator_obstack, p);
6984 /* Parse a block-declaration.
6989 namespace-alias-definition
6996 __extension__ block-declaration
6999 If STATEMENT_P is TRUE, then this block-declaration is occurring as
7000 part of a declaration-statement. */
7003 cp_parser_block_declaration (cp_parser *parser,
7009 /* Check for the `__extension__' keyword. */
7010 if (cp_parser_extension_opt (parser, &saved_pedantic))
7012 /* Parse the qualified declaration. */
7013 cp_parser_block_declaration (parser, statement_p);
7014 /* Restore the PEDANTIC flag. */
7015 pedantic = saved_pedantic;
7020 /* Peek at the next token to figure out which kind of declaration is
7022 token1 = cp_lexer_peek_token (parser->lexer);
7024 /* If the next keyword is `asm', we have an asm-definition. */
7025 if (token1->keyword == RID_ASM)
7028 cp_parser_commit_to_tentative_parse (parser);
7029 cp_parser_asm_definition (parser);
7031 /* If the next keyword is `namespace', we have a
7032 namespace-alias-definition. */
7033 else if (token1->keyword == RID_NAMESPACE)
7034 cp_parser_namespace_alias_definition (parser);
7035 /* If the next keyword is `using', we have either a
7036 using-declaration or a using-directive. */
7037 else if (token1->keyword == RID_USING)
7042 cp_parser_commit_to_tentative_parse (parser);
7043 /* If the token after `using' is `namespace', then we have a
7045 token2 = cp_lexer_peek_nth_token (parser->lexer, 2);
7046 if (token2->keyword == RID_NAMESPACE)
7047 cp_parser_using_directive (parser);
7048 /* Otherwise, it's a using-declaration. */
7050 cp_parser_using_declaration (parser);
7052 /* If the next keyword is `__label__' we have a label declaration. */
7053 else if (token1->keyword == RID_LABEL)
7056 cp_parser_commit_to_tentative_parse (parser);
7057 cp_parser_label_declaration (parser);
7059 /* Anything else must be a simple-declaration. */
7061 cp_parser_simple_declaration (parser, !statement_p);
7064 /* Parse a simple-declaration.
7067 decl-specifier-seq [opt] init-declarator-list [opt] ;
7069 init-declarator-list:
7071 init-declarator-list , init-declarator
7073 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
7074 function-definition as a simple-declaration. */
7077 cp_parser_simple_declaration (cp_parser* parser,
7078 bool function_definition_allowed_p)
7080 cp_decl_specifier_seq decl_specifiers;
7081 int declares_class_or_enum;
7082 bool saw_declarator;
7084 /* Defer access checks until we know what is being declared; the
7085 checks for names appearing in the decl-specifier-seq should be
7086 done as if we were in the scope of the thing being declared. */
7087 push_deferring_access_checks (dk_deferred);
7089 /* Parse the decl-specifier-seq. We have to keep track of whether
7090 or not the decl-specifier-seq declares a named class or
7091 enumeration type, since that is the only case in which the
7092 init-declarator-list is allowed to be empty.
7096 In a simple-declaration, the optional init-declarator-list can be
7097 omitted only when declaring a class or enumeration, that is when
7098 the decl-specifier-seq contains either a class-specifier, an
7099 elaborated-type-specifier, or an enum-specifier. */
7100 cp_parser_decl_specifier_seq (parser,
7101 CP_PARSER_FLAGS_OPTIONAL,
7103 &declares_class_or_enum);
7104 /* We no longer need to defer access checks. */
7105 stop_deferring_access_checks ();
7107 /* In a block scope, a valid declaration must always have a
7108 decl-specifier-seq. By not trying to parse declarators, we can
7109 resolve the declaration/expression ambiguity more quickly. */
7110 if (!function_definition_allowed_p
7111 && !decl_specifiers.any_specifiers_p)
7113 cp_parser_error (parser, "expected declaration");
7117 /* If the next two tokens are both identifiers, the code is
7118 erroneous. The usual cause of this situation is code like:
7122 where "T" should name a type -- but does not. */
7123 if (!decl_specifiers.type
7124 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
7126 /* If parsing tentatively, we should commit; we really are
7127 looking at a declaration. */
7128 cp_parser_commit_to_tentative_parse (parser);
7133 /* If we have seen at least one decl-specifier, and the next token
7134 is not a parenthesis, then we must be looking at a declaration.
7135 (After "int (" we might be looking at a functional cast.) */
7136 if (decl_specifiers.any_specifiers_p
7137 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
7138 cp_parser_commit_to_tentative_parse (parser);
7140 /* Keep going until we hit the `;' at the end of the simple
7142 saw_declarator = false;
7143 while (cp_lexer_next_token_is_not (parser->lexer,
7147 bool function_definition_p;
7150 saw_declarator = true;
7151 /* Parse the init-declarator. */
7152 decl = cp_parser_init_declarator (parser, &decl_specifiers,
7153 function_definition_allowed_p,
7155 declares_class_or_enum,
7156 &function_definition_p);
7157 /* If an error occurred while parsing tentatively, exit quickly.
7158 (That usually happens when in the body of a function; each
7159 statement is treated as a declaration-statement until proven
7161 if (cp_parser_error_occurred (parser))
7163 /* Handle function definitions specially. */
7164 if (function_definition_p)
7166 /* If the next token is a `,', then we are probably
7167 processing something like:
7171 which is erroneous. */
7172 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
7173 error ("mixing declarations and function-definitions is forbidden");
7174 /* Otherwise, we're done with the list of declarators. */
7177 pop_deferring_access_checks ();
7181 /* The next token should be either a `,' or a `;'. */
7182 token = cp_lexer_peek_token (parser->lexer);
7183 /* If it's a `,', there are more declarators to come. */
7184 if (token->type == CPP_COMMA)
7185 cp_lexer_consume_token (parser->lexer);
7186 /* If it's a `;', we are done. */
7187 else if (token->type == CPP_SEMICOLON)
7189 /* Anything else is an error. */
7192 /* If we have already issued an error message we don't need
7193 to issue another one. */
7194 if (decl != error_mark_node
7195 || cp_parser_uncommitted_to_tentative_parse_p (parser))
7196 cp_parser_error (parser, "expected %<,%> or %<;%>");
7197 /* Skip tokens until we reach the end of the statement. */
7198 cp_parser_skip_to_end_of_statement (parser);
7199 /* If the next token is now a `;', consume it. */
7200 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
7201 cp_lexer_consume_token (parser->lexer);
7204 /* After the first time around, a function-definition is not
7205 allowed -- even if it was OK at first. For example:
7210 function_definition_allowed_p = false;
7213 /* Issue an error message if no declarators are present, and the
7214 decl-specifier-seq does not itself declare a class or
7216 if (!saw_declarator)
7218 if (cp_parser_declares_only_class_p (parser))
7219 shadow_tag (&decl_specifiers);
7220 /* Perform any deferred access checks. */
7221 perform_deferred_access_checks ();
7224 /* Consume the `;'. */
7225 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
7228 pop_deferring_access_checks ();
7231 /* Parse a decl-specifier-seq.
7234 decl-specifier-seq [opt] decl-specifier
7237 storage-class-specifier
7248 Set *DECL_SPECS to a representation of the decl-specifier-seq.
7250 The parser flags FLAGS is used to control type-specifier parsing.
7252 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
7255 1: one of the decl-specifiers is an elaborated-type-specifier
7256 (i.e., a type declaration)
7257 2: one of the decl-specifiers is an enum-specifier or a
7258 class-specifier (i.e., a type definition)
7263 cp_parser_decl_specifier_seq (cp_parser* parser,
7264 cp_parser_flags flags,
7265 cp_decl_specifier_seq *decl_specs,
7266 int* declares_class_or_enum)
7268 bool constructor_possible_p = !parser->in_declarator_p;
7270 /* Clear DECL_SPECS. */
7271 clear_decl_specs (decl_specs);
7273 /* Assume no class or enumeration type is declared. */
7274 *declares_class_or_enum = 0;
7276 /* Keep reading specifiers until there are no more to read. */
7280 bool found_decl_spec;
7283 /* Peek at the next token. */
7284 token = cp_lexer_peek_token (parser->lexer);
7285 /* Handle attributes. */
7286 if (token->keyword == RID_ATTRIBUTE)
7288 /* Parse the attributes. */
7289 decl_specs->attributes
7290 = chainon (decl_specs->attributes,
7291 cp_parser_attributes_opt (parser));
7294 /* Assume we will find a decl-specifier keyword. */
7295 found_decl_spec = true;
7296 /* If the next token is an appropriate keyword, we can simply
7297 add it to the list. */
7298 switch (token->keyword)
7303 if (decl_specs->specs[(int) ds_friend]++)
7304 error ("duplicate %<friend%>");
7305 /* Consume the token. */
7306 cp_lexer_consume_token (parser->lexer);
7309 /* function-specifier:
7316 cp_parser_function_specifier_opt (parser, decl_specs);
7322 ++decl_specs->specs[(int) ds_typedef];
7323 /* Consume the token. */
7324 cp_lexer_consume_token (parser->lexer);
7325 /* A constructor declarator cannot appear in a typedef. */
7326 constructor_possible_p = false;
7327 /* The "typedef" keyword can only occur in a declaration; we
7328 may as well commit at this point. */
7329 cp_parser_commit_to_tentative_parse (parser);
7332 /* storage-class-specifier:
7342 /* Consume the token. */
7343 cp_lexer_consume_token (parser->lexer);
7344 cp_parser_set_storage_class (decl_specs, sc_auto);
7347 /* Consume the token. */
7348 cp_lexer_consume_token (parser->lexer);
7349 cp_parser_set_storage_class (decl_specs, sc_register);
7352 /* Consume the token. */
7353 cp_lexer_consume_token (parser->lexer);
7354 if (decl_specs->specs[(int) ds_thread])
7356 error ("%<__thread%> before %<static%>");
7357 decl_specs->specs[(int) ds_thread] = 0;
7359 cp_parser_set_storage_class (decl_specs, sc_static);
7362 /* Consume the token. */
7363 cp_lexer_consume_token (parser->lexer);
7364 if (decl_specs->specs[(int) ds_thread])
7366 error ("%<__thread%> before %<extern%>");
7367 decl_specs->specs[(int) ds_thread] = 0;
7369 cp_parser_set_storage_class (decl_specs, sc_extern);
7372 /* Consume the token. */
7373 cp_lexer_consume_token (parser->lexer);
7374 cp_parser_set_storage_class (decl_specs, sc_mutable);
7377 /* Consume the token. */
7378 cp_lexer_consume_token (parser->lexer);
7379 ++decl_specs->specs[(int) ds_thread];
7383 /* We did not yet find a decl-specifier yet. */
7384 found_decl_spec = false;
7388 /* Constructors are a special case. The `S' in `S()' is not a
7389 decl-specifier; it is the beginning of the declarator. */
7392 && constructor_possible_p
7393 && (cp_parser_constructor_declarator_p
7394 (parser, decl_specs->specs[(int) ds_friend] != 0)));
7396 /* If we don't have a DECL_SPEC yet, then we must be looking at
7397 a type-specifier. */
7398 if (!found_decl_spec && !constructor_p)
7400 int decl_spec_declares_class_or_enum;
7401 bool is_cv_qualifier;
7405 = cp_parser_type_specifier (parser, flags,
7407 /*is_declaration=*/true,
7408 &decl_spec_declares_class_or_enum,
7411 *declares_class_or_enum |= decl_spec_declares_class_or_enum;
7413 /* If this type-specifier referenced a user-defined type
7414 (a typedef, class-name, etc.), then we can't allow any
7415 more such type-specifiers henceforth.
7419 The longest sequence of decl-specifiers that could
7420 possibly be a type name is taken as the
7421 decl-specifier-seq of a declaration. The sequence shall
7422 be self-consistent as described below.
7426 As a general rule, at most one type-specifier is allowed
7427 in the complete decl-specifier-seq of a declaration. The
7428 only exceptions are the following:
7430 -- const or volatile can be combined with any other
7433 -- signed or unsigned can be combined with char, long,
7441 void g (const int Pc);
7443 Here, Pc is *not* part of the decl-specifier seq; it's
7444 the declarator. Therefore, once we see a type-specifier
7445 (other than a cv-qualifier), we forbid any additional
7446 user-defined types. We *do* still allow things like `int
7447 int' to be considered a decl-specifier-seq, and issue the
7448 error message later. */
7449 if (type_spec && !is_cv_qualifier)
7450 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
7451 /* A constructor declarator cannot follow a type-specifier. */
7454 constructor_possible_p = false;
7455 found_decl_spec = true;
7459 /* If we still do not have a DECL_SPEC, then there are no more
7461 if (!found_decl_spec)
7464 decl_specs->any_specifiers_p = true;
7465 /* After we see one decl-specifier, further decl-specifiers are
7467 flags |= CP_PARSER_FLAGS_OPTIONAL;
7470 /* Don't allow a friend specifier with a class definition. */
7471 if (decl_specs->specs[(int) ds_friend] != 0
7472 && (*declares_class_or_enum & 2))
7473 error ("class definition may not be declared a friend");
7476 /* Parse an (optional) storage-class-specifier.
7478 storage-class-specifier:
7487 storage-class-specifier:
7490 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
7493 cp_parser_storage_class_specifier_opt (cp_parser* parser)
7495 switch (cp_lexer_peek_token (parser->lexer)->keyword)
7503 /* Consume the token. */
7504 return cp_lexer_consume_token (parser->lexer)->value;
7511 /* Parse an (optional) function-specifier.
7518 Returns an IDENTIFIER_NODE corresponding to the keyword used.
7519 Updates DECL_SPECS, if it is non-NULL. */
7522 cp_parser_function_specifier_opt (cp_parser* parser,
7523 cp_decl_specifier_seq *decl_specs)
7525 switch (cp_lexer_peek_token (parser->lexer)->keyword)
7529 ++decl_specs->specs[(int) ds_inline];
7534 ++decl_specs->specs[(int) ds_virtual];
7539 ++decl_specs->specs[(int) ds_explicit];
7546 /* Consume the token. */
7547 return cp_lexer_consume_token (parser->lexer)->value;
7550 /* Parse a linkage-specification.
7552 linkage-specification:
7553 extern string-literal { declaration-seq [opt] }
7554 extern string-literal declaration */
7557 cp_parser_linkage_specification (cp_parser* parser)
7561 /* Look for the `extern' keyword. */
7562 cp_parser_require_keyword (parser, RID_EXTERN, "`extern'");
7564 /* Look for the string-literal. */
7565 linkage = cp_parser_string_literal (parser, false, false);
7567 /* Transform the literal into an identifier. If the literal is a
7568 wide-character string, or contains embedded NULs, then we can't
7569 handle it as the user wants. */
7570 if (strlen (TREE_STRING_POINTER (linkage))
7571 != (size_t) (TREE_STRING_LENGTH (linkage) - 1))
7573 cp_parser_error (parser, "invalid linkage-specification");
7574 /* Assume C++ linkage. */
7575 linkage = lang_name_cplusplus;
7578 linkage = get_identifier (TREE_STRING_POINTER (linkage));
7580 /* We're now using the new linkage. */
7581 push_lang_context (linkage);
7583 /* If the next token is a `{', then we're using the first
7585 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
7587 /* Consume the `{' token. */
7588 cp_lexer_consume_token (parser->lexer);
7589 /* Parse the declarations. */
7590 cp_parser_declaration_seq_opt (parser);
7591 /* Look for the closing `}'. */
7592 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
7594 /* Otherwise, there's just one declaration. */
7597 bool saved_in_unbraced_linkage_specification_p;
7599 saved_in_unbraced_linkage_specification_p
7600 = parser->in_unbraced_linkage_specification_p;
7601 parser->in_unbraced_linkage_specification_p = true;
7602 have_extern_spec = true;
7603 cp_parser_declaration (parser);
7604 have_extern_spec = false;
7605 parser->in_unbraced_linkage_specification_p
7606 = saved_in_unbraced_linkage_specification_p;
7609 /* We're done with the linkage-specification. */
7610 pop_lang_context ();
7613 /* Special member functions [gram.special] */
7615 /* Parse a conversion-function-id.
7617 conversion-function-id:
7618 operator conversion-type-id
7620 Returns an IDENTIFIER_NODE representing the operator. */
7623 cp_parser_conversion_function_id (cp_parser* parser)
7627 tree saved_qualifying_scope;
7628 tree saved_object_scope;
7629 tree pushed_scope = NULL_TREE;
7631 /* Look for the `operator' token. */
7632 if (!cp_parser_require_keyword (parser, RID_OPERATOR, "`operator'"))
7633 return error_mark_node;
7634 /* When we parse the conversion-type-id, the current scope will be
7635 reset. However, we need that information in able to look up the
7636 conversion function later, so we save it here. */
7637 saved_scope = parser->scope;
7638 saved_qualifying_scope = parser->qualifying_scope;
7639 saved_object_scope = parser->object_scope;
7640 /* We must enter the scope of the class so that the names of
7641 entities declared within the class are available in the
7642 conversion-type-id. For example, consider:
7649 S::operator I() { ... }
7651 In order to see that `I' is a type-name in the definition, we
7652 must be in the scope of `S'. */
7654 pushed_scope = push_scope (saved_scope);
7655 /* Parse the conversion-type-id. */
7656 type = cp_parser_conversion_type_id (parser);
7657 /* Leave the scope of the class, if any. */
7659 pop_scope (pushed_scope);
7660 /* Restore the saved scope. */
7661 parser->scope = saved_scope;
7662 parser->qualifying_scope = saved_qualifying_scope;
7663 parser->object_scope = saved_object_scope;
7664 /* If the TYPE is invalid, indicate failure. */
7665 if (type == error_mark_node)
7666 return error_mark_node;
7667 return mangle_conv_op_name_for_type (type);
7670 /* Parse a conversion-type-id:
7673 type-specifier-seq conversion-declarator [opt]
7675 Returns the TYPE specified. */
7678 cp_parser_conversion_type_id (cp_parser* parser)
7681 cp_decl_specifier_seq type_specifiers;
7682 cp_declarator *declarator;
7683 tree type_specified;
7685 /* Parse the attributes. */
7686 attributes = cp_parser_attributes_opt (parser);
7687 /* Parse the type-specifiers. */
7688 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
7690 /* If that didn't work, stop. */
7691 if (type_specifiers.type == error_mark_node)
7692 return error_mark_node;
7693 /* Parse the conversion-declarator. */
7694 declarator = cp_parser_conversion_declarator_opt (parser);
7696 type_specified = grokdeclarator (declarator, &type_specifiers, TYPENAME,
7697 /*initialized=*/0, &attributes);
7699 cplus_decl_attributes (&type_specified, attributes, /*flags=*/0);
7700 return type_specified;
7703 /* Parse an (optional) conversion-declarator.
7705 conversion-declarator:
7706 ptr-operator conversion-declarator [opt]
7710 static cp_declarator *
7711 cp_parser_conversion_declarator_opt (cp_parser* parser)
7713 enum tree_code code;
7715 cp_cv_quals cv_quals;
7717 /* We don't know if there's a ptr-operator next, or not. */
7718 cp_parser_parse_tentatively (parser);
7719 /* Try the ptr-operator. */
7720 code = cp_parser_ptr_operator (parser, &class_type, &cv_quals);
7721 /* If it worked, look for more conversion-declarators. */
7722 if (cp_parser_parse_definitely (parser))
7724 cp_declarator *declarator;
7726 /* Parse another optional declarator. */
7727 declarator = cp_parser_conversion_declarator_opt (parser);
7729 /* Create the representation of the declarator. */
7731 declarator = make_ptrmem_declarator (cv_quals, class_type,
7733 else if (code == INDIRECT_REF)
7734 declarator = make_pointer_declarator (cv_quals, declarator);
7736 declarator = make_reference_declarator (cv_quals, declarator);
7744 /* Parse an (optional) ctor-initializer.
7747 : mem-initializer-list
7749 Returns TRUE iff the ctor-initializer was actually present. */
7752 cp_parser_ctor_initializer_opt (cp_parser* parser)
7754 /* If the next token is not a `:', then there is no
7755 ctor-initializer. */
7756 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
7758 /* Do default initialization of any bases and members. */
7759 if (DECL_CONSTRUCTOR_P (current_function_decl))
7760 finish_mem_initializers (NULL_TREE);
7765 /* Consume the `:' token. */
7766 cp_lexer_consume_token (parser->lexer);
7767 /* And the mem-initializer-list. */
7768 cp_parser_mem_initializer_list (parser);
7773 /* Parse a mem-initializer-list.
7775 mem-initializer-list:
7777 mem-initializer , mem-initializer-list */
7780 cp_parser_mem_initializer_list (cp_parser* parser)
7782 tree mem_initializer_list = NULL_TREE;
7784 /* Let the semantic analysis code know that we are starting the
7785 mem-initializer-list. */
7786 if (!DECL_CONSTRUCTOR_P (current_function_decl))
7787 error ("only constructors take base initializers");
7789 /* Loop through the list. */
7792 tree mem_initializer;
7794 /* Parse the mem-initializer. */
7795 mem_initializer = cp_parser_mem_initializer (parser);
7796 /* Add it to the list, unless it was erroneous. */
7797 if (mem_initializer)
7799 TREE_CHAIN (mem_initializer) = mem_initializer_list;
7800 mem_initializer_list = mem_initializer;
7802 /* If the next token is not a `,', we're done. */
7803 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
7805 /* Consume the `,' token. */
7806 cp_lexer_consume_token (parser->lexer);
7809 /* Perform semantic analysis. */
7810 if (DECL_CONSTRUCTOR_P (current_function_decl))
7811 finish_mem_initializers (mem_initializer_list);
7814 /* Parse a mem-initializer.
7817 mem-initializer-id ( expression-list [opt] )
7822 ( expression-list [opt] )
7824 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
7825 class) or FIELD_DECL (for a non-static data member) to initialize;
7826 the TREE_VALUE is the expression-list. */
7829 cp_parser_mem_initializer (cp_parser* parser)
7831 tree mem_initializer_id;
7832 tree expression_list;
7835 /* Find out what is being initialized. */
7836 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
7838 pedwarn ("anachronistic old-style base class initializer");
7839 mem_initializer_id = NULL_TREE;
7842 mem_initializer_id = cp_parser_mem_initializer_id (parser);
7843 member = expand_member_init (mem_initializer_id);
7844 if (member && !DECL_P (member))
7845 in_base_initializer = 1;
7848 = cp_parser_parenthesized_expression_list (parser, false,
7850 /*non_constant_p=*/NULL);
7851 if (!expression_list)
7852 expression_list = void_type_node;
7854 in_base_initializer = 0;
7856 return member ? build_tree_list (member, expression_list) : NULL_TREE;
7859 /* Parse a mem-initializer-id.
7862 :: [opt] nested-name-specifier [opt] class-name
7865 Returns a TYPE indicating the class to be initializer for the first
7866 production. Returns an IDENTIFIER_NODE indicating the data member
7867 to be initialized for the second production. */
7870 cp_parser_mem_initializer_id (cp_parser* parser)
7872 bool global_scope_p;
7873 bool nested_name_specifier_p;
7874 bool template_p = false;
7877 /* `typename' is not allowed in this context ([temp.res]). */
7878 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
7880 error ("keyword %<typename%> not allowed in this context (a qualified "
7881 "member initializer is implicitly a type)");
7882 cp_lexer_consume_token (parser->lexer);
7884 /* Look for the optional `::' operator. */
7886 = (cp_parser_global_scope_opt (parser,
7887 /*current_scope_valid_p=*/false)
7889 /* Look for the optional nested-name-specifier. The simplest way to
7894 The keyword `typename' is not permitted in a base-specifier or
7895 mem-initializer; in these contexts a qualified name that
7896 depends on a template-parameter is implicitly assumed to be a
7899 is to assume that we have seen the `typename' keyword at this
7901 nested_name_specifier_p
7902 = (cp_parser_nested_name_specifier_opt (parser,
7903 /*typename_keyword_p=*/true,
7904 /*check_dependency_p=*/true,
7906 /*is_declaration=*/true)
7908 if (nested_name_specifier_p)
7909 template_p = cp_parser_optional_template_keyword (parser);
7910 /* If there is a `::' operator or a nested-name-specifier, then we
7911 are definitely looking for a class-name. */
7912 if (global_scope_p || nested_name_specifier_p)
7913 return cp_parser_class_name (parser,
7914 /*typename_keyword_p=*/true,
7915 /*template_keyword_p=*/template_p,
7917 /*check_dependency_p=*/true,
7918 /*class_head_p=*/false,
7919 /*is_declaration=*/true);
7920 /* Otherwise, we could also be looking for an ordinary identifier. */
7921 cp_parser_parse_tentatively (parser);
7922 /* Try a class-name. */
7923 id = cp_parser_class_name (parser,
7924 /*typename_keyword_p=*/true,
7925 /*template_keyword_p=*/false,
7927 /*check_dependency_p=*/true,
7928 /*class_head_p=*/false,
7929 /*is_declaration=*/true);
7930 /* If we found one, we're done. */
7931 if (cp_parser_parse_definitely (parser))
7933 /* Otherwise, look for an ordinary identifier. */
7934 return cp_parser_identifier (parser);
7937 /* Overloading [gram.over] */
7939 /* Parse an operator-function-id.
7941 operator-function-id:
7944 Returns an IDENTIFIER_NODE for the operator which is a
7945 human-readable spelling of the identifier, e.g., `operator +'. */
7948 cp_parser_operator_function_id (cp_parser* parser)
7950 /* Look for the `operator' keyword. */
7951 if (!cp_parser_require_keyword (parser, RID_OPERATOR, "`operator'"))
7952 return error_mark_node;
7953 /* And then the name of the operator itself. */
7954 return cp_parser_operator (parser);
7957 /* Parse an operator.
7960 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
7961 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
7962 || ++ -- , ->* -> () []
7969 Returns an IDENTIFIER_NODE for the operator which is a
7970 human-readable spelling of the identifier, e.g., `operator +'. */
7973 cp_parser_operator (cp_parser* parser)
7975 tree id = NULL_TREE;
7978 /* Peek at the next token. */
7979 token = cp_lexer_peek_token (parser->lexer);
7980 /* Figure out which operator we have. */
7981 switch (token->type)
7987 /* The keyword should be either `new' or `delete'. */
7988 if (token->keyword == RID_NEW)
7990 else if (token->keyword == RID_DELETE)
7995 /* Consume the `new' or `delete' token. */
7996 cp_lexer_consume_token (parser->lexer);
7998 /* Peek at the next token. */
7999 token = cp_lexer_peek_token (parser->lexer);
8000 /* If it's a `[' token then this is the array variant of the
8002 if (token->type == CPP_OPEN_SQUARE)
8004 /* Consume the `[' token. */
8005 cp_lexer_consume_token (parser->lexer);
8006 /* Look for the `]' token. */
8007 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
8008 id = ansi_opname (op == NEW_EXPR
8009 ? VEC_NEW_EXPR : VEC_DELETE_EXPR);
8011 /* Otherwise, we have the non-array variant. */
8013 id = ansi_opname (op);
8019 id = ansi_opname (PLUS_EXPR);
8023 id = ansi_opname (MINUS_EXPR);
8027 id = ansi_opname (MULT_EXPR);
8031 id = ansi_opname (TRUNC_DIV_EXPR);
8035 id = ansi_opname (TRUNC_MOD_EXPR);
8039 id = ansi_opname (BIT_XOR_EXPR);
8043 id = ansi_opname (BIT_AND_EXPR);
8047 id = ansi_opname (BIT_IOR_EXPR);
8051 id = ansi_opname (BIT_NOT_EXPR);
8055 id = ansi_opname (TRUTH_NOT_EXPR);
8059 id = ansi_assopname (NOP_EXPR);
8063 id = ansi_opname (LT_EXPR);
8067 id = ansi_opname (GT_EXPR);
8071 id = ansi_assopname (PLUS_EXPR);
8075 id = ansi_assopname (MINUS_EXPR);
8079 id = ansi_assopname (MULT_EXPR);
8083 id = ansi_assopname (TRUNC_DIV_EXPR);
8087 id = ansi_assopname (TRUNC_MOD_EXPR);
8091 id = ansi_assopname (BIT_XOR_EXPR);
8095 id = ansi_assopname (BIT_AND_EXPR);
8099 id = ansi_assopname (BIT_IOR_EXPR);
8103 id = ansi_opname (LSHIFT_EXPR);
8107 id = ansi_opname (RSHIFT_EXPR);
8111 id = ansi_assopname (LSHIFT_EXPR);
8115 id = ansi_assopname (RSHIFT_EXPR);
8119 id = ansi_opname (EQ_EXPR);
8123 id = ansi_opname (NE_EXPR);
8127 id = ansi_opname (LE_EXPR);
8130 case CPP_GREATER_EQ:
8131 id = ansi_opname (GE_EXPR);
8135 id = ansi_opname (TRUTH_ANDIF_EXPR);
8139 id = ansi_opname (TRUTH_ORIF_EXPR);
8143 id = ansi_opname (POSTINCREMENT_EXPR);
8146 case CPP_MINUS_MINUS:
8147 id = ansi_opname (PREDECREMENT_EXPR);
8151 id = ansi_opname (COMPOUND_EXPR);
8154 case CPP_DEREF_STAR:
8155 id = ansi_opname (MEMBER_REF);
8159 id = ansi_opname (COMPONENT_REF);
8162 case CPP_OPEN_PAREN:
8163 /* Consume the `('. */
8164 cp_lexer_consume_token (parser->lexer);
8165 /* Look for the matching `)'. */
8166 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
8167 return ansi_opname (CALL_EXPR);
8169 case CPP_OPEN_SQUARE:
8170 /* Consume the `['. */
8171 cp_lexer_consume_token (parser->lexer);
8172 /* Look for the matching `]'. */
8173 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
8174 return ansi_opname (ARRAY_REF);
8178 id = ansi_opname (MIN_EXPR);
8179 cp_parser_warn_min_max ();
8183 id = ansi_opname (MAX_EXPR);
8184 cp_parser_warn_min_max ();
8188 id = ansi_assopname (MIN_EXPR);
8189 cp_parser_warn_min_max ();
8193 id = ansi_assopname (MAX_EXPR);
8194 cp_parser_warn_min_max ();
8198 /* Anything else is an error. */
8202 /* If we have selected an identifier, we need to consume the
8205 cp_lexer_consume_token (parser->lexer);
8206 /* Otherwise, no valid operator name was present. */
8209 cp_parser_error (parser, "expected operator");
8210 id = error_mark_node;
8216 /* Parse a template-declaration.
8218 template-declaration:
8219 export [opt] template < template-parameter-list > declaration
8221 If MEMBER_P is TRUE, this template-declaration occurs within a
8224 The grammar rule given by the standard isn't correct. What
8227 template-declaration:
8228 export [opt] template-parameter-list-seq
8229 decl-specifier-seq [opt] init-declarator [opt] ;
8230 export [opt] template-parameter-list-seq
8233 template-parameter-list-seq:
8234 template-parameter-list-seq [opt]
8235 template < template-parameter-list > */
8238 cp_parser_template_declaration (cp_parser* parser, bool member_p)
8240 /* Check for `export'. */
8241 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXPORT))
8243 /* Consume the `export' token. */
8244 cp_lexer_consume_token (parser->lexer);
8245 /* Warn that we do not support `export'. */
8246 warning (0, "keyword %<export%> not implemented, and will be ignored");
8249 cp_parser_template_declaration_after_export (parser, member_p);
8252 /* Parse a template-parameter-list.
8254 template-parameter-list:
8256 template-parameter-list , template-parameter
8258 Returns a TREE_LIST. Each node represents a template parameter.
8259 The nodes are connected via their TREE_CHAINs. */
8262 cp_parser_template_parameter_list (cp_parser* parser)
8264 tree parameter_list = NULL_TREE;
8272 /* Parse the template-parameter. */
8273 parameter = cp_parser_template_parameter (parser, &is_non_type);
8274 /* Add it to the list. */
8275 if (parameter != error_mark_node)
8276 parameter_list = process_template_parm (parameter_list,
8279 /* Peek at the next token. */
8280 token = cp_lexer_peek_token (parser->lexer);
8281 /* If it's not a `,', we're done. */
8282 if (token->type != CPP_COMMA)
8284 /* Otherwise, consume the `,' token. */
8285 cp_lexer_consume_token (parser->lexer);
8288 return parameter_list;
8291 /* Parse a template-parameter.
8295 parameter-declaration
8297 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
8298 the parameter. The TREE_PURPOSE is the default value, if any.
8299 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
8300 iff this parameter is a non-type parameter. */
8303 cp_parser_template_parameter (cp_parser* parser, bool *is_non_type)
8306 cp_parameter_declarator *parameter_declarator;
8309 /* Assume it is a type parameter or a template parameter. */
8310 *is_non_type = false;
8311 /* Peek at the next token. */
8312 token = cp_lexer_peek_token (parser->lexer);
8313 /* If it is `class' or `template', we have a type-parameter. */
8314 if (token->keyword == RID_TEMPLATE)
8315 return cp_parser_type_parameter (parser);
8316 /* If it is `class' or `typename' we do not know yet whether it is a
8317 type parameter or a non-type parameter. Consider:
8319 template <typename T, typename T::X X> ...
8323 template <class C, class D*> ...
8325 Here, the first parameter is a type parameter, and the second is
8326 a non-type parameter. We can tell by looking at the token after
8327 the identifier -- if it is a `,', `=', or `>' then we have a type
8329 if (token->keyword == RID_TYPENAME || token->keyword == RID_CLASS)
8331 /* Peek at the token after `class' or `typename'. */
8332 token = cp_lexer_peek_nth_token (parser->lexer, 2);
8333 /* If it's an identifier, skip it. */
8334 if (token->type == CPP_NAME)
8335 token = cp_lexer_peek_nth_token (parser->lexer, 3);
8336 /* Now, see if the token looks like the end of a template
8338 if (token->type == CPP_COMMA
8339 || token->type == CPP_EQ
8340 || token->type == CPP_GREATER)
8341 return cp_parser_type_parameter (parser);
8344 /* Otherwise, it is a non-type parameter.
8348 When parsing a default template-argument for a non-type
8349 template-parameter, the first non-nested `>' is taken as the end
8350 of the template parameter-list rather than a greater-than
8352 *is_non_type = true;
8353 parameter_declarator
8354 = cp_parser_parameter_declaration (parser, /*template_parm_p=*/true,
8355 /*parenthesized_p=*/NULL);
8356 parm = grokdeclarator (parameter_declarator->declarator,
8357 ¶meter_declarator->decl_specifiers,
8358 PARM, /*initialized=*/0,
8360 if (parm == error_mark_node)
8361 return error_mark_node;
8362 return build_tree_list (parameter_declarator->default_argument, parm);
8365 /* Parse a type-parameter.
8368 class identifier [opt]
8369 class identifier [opt] = type-id
8370 typename identifier [opt]
8371 typename identifier [opt] = type-id
8372 template < template-parameter-list > class identifier [opt]
8373 template < template-parameter-list > class identifier [opt]
8376 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
8377 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
8378 the declaration of the parameter. */
8381 cp_parser_type_parameter (cp_parser* parser)
8386 /* Look for a keyword to tell us what kind of parameter this is. */
8387 token = cp_parser_require (parser, CPP_KEYWORD,
8388 "`class', `typename', or `template'");
8390 return error_mark_node;
8392 switch (token->keyword)
8398 tree default_argument;
8400 /* If the next token is an identifier, then it names the
8402 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
8403 identifier = cp_parser_identifier (parser);
8405 identifier = NULL_TREE;
8407 /* Create the parameter. */
8408 parameter = finish_template_type_parm (class_type_node, identifier);
8410 /* If the next token is an `=', we have a default argument. */
8411 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
8413 /* Consume the `=' token. */
8414 cp_lexer_consume_token (parser->lexer);
8415 /* Parse the default-argument. */
8416 default_argument = cp_parser_type_id (parser);
8419 default_argument = NULL_TREE;
8421 /* Create the combined representation of the parameter and the
8422 default argument. */
8423 parameter = build_tree_list (default_argument, parameter);
8429 tree parameter_list;
8431 tree default_argument;
8433 /* Look for the `<'. */
8434 cp_parser_require (parser, CPP_LESS, "`<'");
8435 /* Parse the template-parameter-list. */
8436 begin_template_parm_list ();
8438 = cp_parser_template_parameter_list (parser);
8439 parameter_list = end_template_parm_list (parameter_list);
8440 /* Look for the `>'. */
8441 cp_parser_require (parser, CPP_GREATER, "`>'");
8442 /* Look for the `class' keyword. */
8443 cp_parser_require_keyword (parser, RID_CLASS, "`class'");
8444 /* If the next token is an `=', then there is a
8445 default-argument. If the next token is a `>', we are at
8446 the end of the parameter-list. If the next token is a `,',
8447 then we are at the end of this parameter. */
8448 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ)
8449 && cp_lexer_next_token_is_not (parser->lexer, CPP_GREATER)
8450 && cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
8452 identifier = cp_parser_identifier (parser);
8453 /* Treat invalid names as if the parameter were nameless. */
8454 if (identifier == error_mark_node)
8455 identifier = NULL_TREE;
8458 identifier = NULL_TREE;
8460 /* Create the template parameter. */
8461 parameter = finish_template_template_parm (class_type_node,
8464 /* If the next token is an `=', then there is a
8465 default-argument. */
8466 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
8470 /* Consume the `='. */
8471 cp_lexer_consume_token (parser->lexer);
8472 /* Parse the id-expression. */
8474 = cp_parser_id_expression (parser,
8475 /*template_keyword_p=*/false,
8476 /*check_dependency_p=*/true,
8477 /*template_p=*/&is_template,
8478 /*declarator_p=*/false);
8479 if (TREE_CODE (default_argument) == TYPE_DECL)
8480 /* If the id-expression was a template-id that refers to
8481 a template-class, we already have the declaration here,
8482 so no further lookup is needed. */
8485 /* Look up the name. */
8487 = cp_parser_lookup_name (parser, default_argument,
8489 /*is_template=*/is_template,
8490 /*is_namespace=*/false,
8491 /*check_dependency=*/true,
8492 /*ambiguous_p=*/NULL);
8493 /* See if the default argument is valid. */
8495 = check_template_template_default_arg (default_argument);
8498 default_argument = NULL_TREE;
8500 /* Create the combined representation of the parameter and the
8501 default argument. */
8502 parameter = build_tree_list (default_argument, parameter);
8514 /* Parse a template-id.
8517 template-name < template-argument-list [opt] >
8519 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
8520 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
8521 returned. Otherwise, if the template-name names a function, or set
8522 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
8523 names a class, returns a TYPE_DECL for the specialization.
8525 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
8526 uninstantiated templates. */
8529 cp_parser_template_id (cp_parser *parser,
8530 bool template_keyword_p,
8531 bool check_dependency_p,
8532 bool is_declaration)
8537 cp_token_position start_of_id = 0;
8538 tree access_check = NULL_TREE;
8539 cp_token *next_token, *next_token_2;
8542 /* If the next token corresponds to a template-id, there is no need
8544 next_token = cp_lexer_peek_token (parser->lexer);
8545 if (next_token->type == CPP_TEMPLATE_ID)
8550 /* Get the stored value. */
8551 value = cp_lexer_consume_token (parser->lexer)->value;
8552 /* Perform any access checks that were deferred. */
8553 for (check = TREE_PURPOSE (value); check; check = TREE_CHAIN (check))
8554 perform_or_defer_access_check (TREE_PURPOSE (check),
8555 TREE_VALUE (check));
8556 /* Return the stored value. */
8557 return TREE_VALUE (value);
8560 /* Avoid performing name lookup if there is no possibility of
8561 finding a template-id. */
8562 if ((next_token->type != CPP_NAME && next_token->keyword != RID_OPERATOR)
8563 || (next_token->type == CPP_NAME
8564 && !cp_parser_nth_token_starts_template_argument_list_p
8567 cp_parser_error (parser, "expected template-id");
8568 return error_mark_node;
8571 /* Remember where the template-id starts. */
8572 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
8573 start_of_id = cp_lexer_token_position (parser->lexer, false);
8575 push_deferring_access_checks (dk_deferred);
8577 /* Parse the template-name. */
8578 is_identifier = false;
8579 template = cp_parser_template_name (parser, template_keyword_p,
8583 if (template == error_mark_node || is_identifier)
8585 pop_deferring_access_checks ();
8589 /* If we find the sequence `[:' after a template-name, it's probably
8590 a digraph-typo for `< ::'. Substitute the tokens and check if we can
8591 parse correctly the argument list. */
8592 next_token = cp_lexer_peek_token (parser->lexer);
8593 next_token_2 = cp_lexer_peek_nth_token (parser->lexer, 2);
8594 if (next_token->type == CPP_OPEN_SQUARE
8595 && next_token->flags & DIGRAPH
8596 && next_token_2->type == CPP_COLON
8597 && !(next_token_2->flags & PREV_WHITE))
8599 cp_parser_parse_tentatively (parser);
8600 /* Change `:' into `::'. */
8601 next_token_2->type = CPP_SCOPE;
8602 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
8604 cp_lexer_consume_token (parser->lexer);
8605 /* Parse the arguments. */
8606 arguments = cp_parser_enclosed_template_argument_list (parser);
8607 if (!cp_parser_parse_definitely (parser))
8609 /* If we couldn't parse an argument list, then we revert our changes
8610 and return simply an error. Maybe this is not a template-id
8612 next_token_2->type = CPP_COLON;
8613 cp_parser_error (parser, "expected %<<%>");
8614 pop_deferring_access_checks ();
8615 return error_mark_node;
8617 /* Otherwise, emit an error about the invalid digraph, but continue
8618 parsing because we got our argument list. */
8619 pedwarn ("%<<::%> cannot begin a template-argument list");
8620 inform ("%<<:%> is an alternate spelling for %<[%>. Insert whitespace "
8621 "between %<<%> and %<::%>");
8622 if (!flag_permissive)
8627 inform ("(if you use -fpermissive G++ will accept your code)");
8634 /* Look for the `<' that starts the template-argument-list. */
8635 if (!cp_parser_require (parser, CPP_LESS, "`<'"))
8637 pop_deferring_access_checks ();
8638 return error_mark_node;
8640 /* Parse the arguments. */
8641 arguments = cp_parser_enclosed_template_argument_list (parser);
8644 /* Build a representation of the specialization. */
8645 if (TREE_CODE (template) == IDENTIFIER_NODE)
8646 template_id = build_min_nt (TEMPLATE_ID_EXPR, template, arguments);
8647 else if (DECL_CLASS_TEMPLATE_P (template)
8648 || DECL_TEMPLATE_TEMPLATE_PARM_P (template))
8650 = finish_template_type (template, arguments,
8651 cp_lexer_next_token_is (parser->lexer,
8655 /* If it's not a class-template or a template-template, it should be
8656 a function-template. */
8657 gcc_assert ((DECL_FUNCTION_TEMPLATE_P (template)
8658 || TREE_CODE (template) == OVERLOAD
8659 || BASELINK_P (template)));
8661 template_id = lookup_template_function (template, arguments);
8664 /* Retrieve any deferred checks. Do not pop this access checks yet
8665 so the memory will not be reclaimed during token replacing below. */
8666 access_check = get_deferred_access_checks ();
8668 /* If parsing tentatively, replace the sequence of tokens that makes
8669 up the template-id with a CPP_TEMPLATE_ID token. That way,
8670 should we re-parse the token stream, we will not have to repeat
8671 the effort required to do the parse, nor will we issue duplicate
8672 error messages about problems during instantiation of the
8676 cp_token *token = cp_lexer_token_at (parser->lexer, start_of_id);
8678 /* Reset the contents of the START_OF_ID token. */
8679 token->type = CPP_TEMPLATE_ID;
8680 token->value = build_tree_list (access_check, template_id);
8681 token->keyword = RID_MAX;
8683 /* Purge all subsequent tokens. */
8684 cp_lexer_purge_tokens_after (parser->lexer, start_of_id);
8686 /* ??? Can we actually assume that, if template_id ==
8687 error_mark_node, we will have issued a diagnostic to the
8688 user, as opposed to simply marking the tentative parse as
8690 if (cp_parser_error_occurred (parser) && template_id != error_mark_node)
8691 error ("parse error in template argument list");
8694 pop_deferring_access_checks ();
8698 /* Parse a template-name.
8703 The standard should actually say:
8707 operator-function-id
8709 A defect report has been filed about this issue.
8711 A conversion-function-id cannot be a template name because they cannot
8712 be part of a template-id. In fact, looking at this code:
8716 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
8717 It is impossible to call a templated conversion-function-id with an
8718 explicit argument list, since the only allowed template parameter is
8719 the type to which it is converting.
8721 If TEMPLATE_KEYWORD_P is true, then we have just seen the
8722 `template' keyword, in a construction like:
8726 In that case `f' is taken to be a template-name, even though there
8727 is no way of knowing for sure.
8729 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
8730 name refers to a set of overloaded functions, at least one of which
8731 is a template, or an IDENTIFIER_NODE with the name of the template,
8732 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
8733 names are looked up inside uninstantiated templates. */
8736 cp_parser_template_name (cp_parser* parser,
8737 bool template_keyword_p,
8738 bool check_dependency_p,
8739 bool is_declaration,
8740 bool *is_identifier)
8746 /* If the next token is `operator', then we have either an
8747 operator-function-id or a conversion-function-id. */
8748 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_OPERATOR))
8750 /* We don't know whether we're looking at an
8751 operator-function-id or a conversion-function-id. */
8752 cp_parser_parse_tentatively (parser);
8753 /* Try an operator-function-id. */
8754 identifier = cp_parser_operator_function_id (parser);
8755 /* If that didn't work, try a conversion-function-id. */
8756 if (!cp_parser_parse_definitely (parser))
8758 cp_parser_error (parser, "expected template-name");
8759 return error_mark_node;
8762 /* Look for the identifier. */
8764 identifier = cp_parser_identifier (parser);
8766 /* If we didn't find an identifier, we don't have a template-id. */
8767 if (identifier == error_mark_node)
8768 return error_mark_node;
8770 /* If the name immediately followed the `template' keyword, then it
8771 is a template-name. However, if the next token is not `<', then
8772 we do not treat it as a template-name, since it is not being used
8773 as part of a template-id. This enables us to handle constructs
8776 template <typename T> struct S { S(); };
8777 template <typename T> S<T>::S();
8779 correctly. We would treat `S' as a template -- if it were `S<T>'
8780 -- but we do not if there is no `<'. */
8782 if (processing_template_decl
8783 && cp_parser_nth_token_starts_template_argument_list_p (parser, 1))
8785 /* In a declaration, in a dependent context, we pretend that the
8786 "template" keyword was present in order to improve error
8787 recovery. For example, given:
8789 template <typename T> void f(T::X<int>);
8791 we want to treat "X<int>" as a template-id. */
8793 && !template_keyword_p
8794 && parser->scope && TYPE_P (parser->scope)
8795 && check_dependency_p
8796 && dependent_type_p (parser->scope)
8797 /* Do not do this for dtors (or ctors), since they never
8798 need the template keyword before their name. */
8799 && !constructor_name_p (identifier, parser->scope))
8801 cp_token_position start = 0;
8803 /* Explain what went wrong. */
8804 error ("non-template %qD used as template", identifier);
8805 inform ("use %<%T::template %D%> to indicate that it is a template",
8806 parser->scope, identifier);
8807 /* If parsing tentatively, find the location of the "<" token. */
8808 if (cp_parser_simulate_error (parser))
8809 start = cp_lexer_token_position (parser->lexer, true);
8810 /* Parse the template arguments so that we can issue error
8811 messages about them. */
8812 cp_lexer_consume_token (parser->lexer);
8813 cp_parser_enclosed_template_argument_list (parser);
8814 /* Skip tokens until we find a good place from which to
8815 continue parsing. */
8816 cp_parser_skip_to_closing_parenthesis (parser,
8817 /*recovering=*/true,
8819 /*consume_paren=*/false);
8820 /* If parsing tentatively, permanently remove the
8821 template argument list. That will prevent duplicate
8822 error messages from being issued about the missing
8823 "template" keyword. */
8825 cp_lexer_purge_tokens_after (parser->lexer, start);
8827 *is_identifier = true;
8831 /* If the "template" keyword is present, then there is generally
8832 no point in doing name-lookup, so we just return IDENTIFIER.
8833 But, if the qualifying scope is non-dependent then we can
8834 (and must) do name-lookup normally. */
8835 if (template_keyword_p
8837 || (TYPE_P (parser->scope)
8838 && dependent_type_p (parser->scope))))
8842 /* Look up the name. */
8843 decl = cp_parser_lookup_name (parser, identifier,
8845 /*is_template=*/false,
8846 /*is_namespace=*/false,
8848 /*ambiguous_p=*/NULL);
8849 decl = maybe_get_template_decl_from_type_decl (decl);
8851 /* If DECL is a template, then the name was a template-name. */
8852 if (TREE_CODE (decl) == TEMPLATE_DECL)
8856 tree fn = NULL_TREE;
8858 /* The standard does not explicitly indicate whether a name that
8859 names a set of overloaded declarations, some of which are
8860 templates, is a template-name. However, such a name should
8861 be a template-name; otherwise, there is no way to form a
8862 template-id for the overloaded templates. */
8863 fns = BASELINK_P (decl) ? BASELINK_FUNCTIONS (decl) : decl;
8864 if (TREE_CODE (fns) == OVERLOAD)
8865 for (fn = fns; fn; fn = OVL_NEXT (fn))
8866 if (TREE_CODE (OVL_CURRENT (fn)) == TEMPLATE_DECL)
8871 /* The name does not name a template. */
8872 cp_parser_error (parser, "expected template-name");
8873 return error_mark_node;
8877 /* If DECL is dependent, and refers to a function, then just return
8878 its name; we will look it up again during template instantiation. */
8879 if (DECL_FUNCTION_TEMPLATE_P (decl) || !DECL_P (decl))
8881 tree scope = CP_DECL_CONTEXT (get_first_fn (decl));
8882 if (TYPE_P (scope) && dependent_type_p (scope))
8889 /* Parse a template-argument-list.
8891 template-argument-list:
8893 template-argument-list , template-argument
8895 Returns a TREE_VEC containing the arguments. */
8898 cp_parser_template_argument_list (cp_parser* parser)
8900 tree fixed_args[10];
8901 unsigned n_args = 0;
8902 unsigned alloced = 10;
8903 tree *arg_ary = fixed_args;
8905 bool saved_in_template_argument_list_p;
8907 saved_in_template_argument_list_p = parser->in_template_argument_list_p;
8908 parser->in_template_argument_list_p = true;
8914 /* Consume the comma. */
8915 cp_lexer_consume_token (parser->lexer);
8917 /* Parse the template-argument. */
8918 argument = cp_parser_template_argument (parser);
8919 if (n_args == alloced)
8923 if (arg_ary == fixed_args)
8925 arg_ary = xmalloc (sizeof (tree) * alloced);
8926 memcpy (arg_ary, fixed_args, sizeof (tree) * n_args);
8929 arg_ary = xrealloc (arg_ary, sizeof (tree) * alloced);
8931 arg_ary[n_args++] = argument;
8933 while (cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
8935 vec = make_tree_vec (n_args);
8938 TREE_VEC_ELT (vec, n_args) = arg_ary[n_args];
8940 if (arg_ary != fixed_args)
8942 parser->in_template_argument_list_p = saved_in_template_argument_list_p;
8946 /* Parse a template-argument.
8949 assignment-expression
8953 The representation is that of an assignment-expression, type-id, or
8954 id-expression -- except that the qualified id-expression is
8955 evaluated, so that the value returned is either a DECL or an
8958 Although the standard says "assignment-expression", it forbids
8959 throw-expressions or assignments in the template argument.
8960 Therefore, we use "conditional-expression" instead. */
8963 cp_parser_template_argument (cp_parser* parser)
8968 bool maybe_type_id = false;
8971 tree qualifying_class;
8973 /* There's really no way to know what we're looking at, so we just
8974 try each alternative in order.
8978 In a template-argument, an ambiguity between a type-id and an
8979 expression is resolved to a type-id, regardless of the form of
8980 the corresponding template-parameter.
8982 Therefore, we try a type-id first. */
8983 cp_parser_parse_tentatively (parser);
8984 argument = cp_parser_type_id (parser);
8985 /* If there was no error parsing the type-id but the next token is a '>>',
8986 we probably found a typo for '> >'. But there are type-id which are
8987 also valid expressions. For instance:
8989 struct X { int operator >> (int); };
8990 template <int V> struct Foo {};
8993 Here 'X()' is a valid type-id of a function type, but the user just
8994 wanted to write the expression "X() >> 5". Thus, we remember that we
8995 found a valid type-id, but we still try to parse the argument as an
8996 expression to see what happens. */
8997 if (!cp_parser_error_occurred (parser)
8998 && cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
9000 maybe_type_id = true;
9001 cp_parser_abort_tentative_parse (parser);
9005 /* If the next token isn't a `,' or a `>', then this argument wasn't
9006 really finished. This means that the argument is not a valid
9008 if (!cp_parser_next_token_ends_template_argument_p (parser))
9009 cp_parser_error (parser, "expected template-argument");
9010 /* If that worked, we're done. */
9011 if (cp_parser_parse_definitely (parser))
9014 /* We're still not sure what the argument will be. */
9015 cp_parser_parse_tentatively (parser);
9016 /* Try a template. */
9017 argument = cp_parser_id_expression (parser,
9018 /*template_keyword_p=*/false,
9019 /*check_dependency_p=*/true,
9021 /*declarator_p=*/false);
9022 /* If the next token isn't a `,' or a `>', then this argument wasn't
9024 if (!cp_parser_next_token_ends_template_argument_p (parser))
9025 cp_parser_error (parser, "expected template-argument");
9026 if (!cp_parser_error_occurred (parser))
9028 /* Figure out what is being referred to. If the id-expression
9029 was for a class template specialization, then we will have a
9030 TYPE_DECL at this point. There is no need to do name lookup
9031 at this point in that case. */
9032 if (TREE_CODE (argument) != TYPE_DECL)
9033 argument = cp_parser_lookup_name (parser, argument,
9035 /*is_template=*/template_p,
9036 /*is_namespace=*/false,
9037 /*check_dependency=*/true,
9038 /*ambiguous_p=*/NULL);
9039 if (TREE_CODE (argument) != TEMPLATE_DECL
9040 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
9041 cp_parser_error (parser, "expected template-name");
9043 if (cp_parser_parse_definitely (parser))
9045 /* It must be a non-type argument. There permitted cases are given
9046 in [temp.arg.nontype]:
9048 -- an integral constant-expression of integral or enumeration
9051 -- the name of a non-type template-parameter; or
9053 -- the name of an object or function with external linkage...
9055 -- the address of an object or function with external linkage...
9057 -- a pointer to member... */
9058 /* Look for a non-type template parameter. */
9059 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
9061 cp_parser_parse_tentatively (parser);
9062 argument = cp_parser_primary_expression (parser,
9066 if (TREE_CODE (argument) != TEMPLATE_PARM_INDEX
9067 || !cp_parser_next_token_ends_template_argument_p (parser))
9068 cp_parser_simulate_error (parser);
9069 if (cp_parser_parse_definitely (parser))
9073 /* If the next token is "&", the argument must be the address of an
9074 object or function with external linkage. */
9075 address_p = cp_lexer_next_token_is (parser->lexer, CPP_AND);
9077 cp_lexer_consume_token (parser->lexer);
9078 /* See if we might have an id-expression. */
9079 token = cp_lexer_peek_token (parser->lexer);
9080 if (token->type == CPP_NAME
9081 || token->keyword == RID_OPERATOR
9082 || token->type == CPP_SCOPE
9083 || token->type == CPP_TEMPLATE_ID
9084 || token->type == CPP_NESTED_NAME_SPECIFIER)
9086 cp_parser_parse_tentatively (parser);
9087 argument = cp_parser_primary_expression (parser,
9091 if (cp_parser_error_occurred (parser)
9092 || !cp_parser_next_token_ends_template_argument_p (parser))
9093 cp_parser_abort_tentative_parse (parser);
9096 if (TREE_CODE (argument) == INDIRECT_REF)
9098 gcc_assert (REFERENCE_REF_P (argument));
9099 argument = TREE_OPERAND (argument, 0);
9102 if (qualifying_class)
9103 argument = finish_qualified_id_expr (qualifying_class,
9107 if (TREE_CODE (argument) == VAR_DECL)
9109 /* A variable without external linkage might still be a
9110 valid constant-expression, so no error is issued here
9111 if the external-linkage check fails. */
9112 if (!DECL_EXTERNAL_LINKAGE_P (argument))
9113 cp_parser_simulate_error (parser);
9115 else if (is_overloaded_fn (argument))
9116 /* All overloaded functions are allowed; if the external
9117 linkage test does not pass, an error will be issued
9121 && (TREE_CODE (argument) == OFFSET_REF
9122 || TREE_CODE (argument) == SCOPE_REF))
9123 /* A pointer-to-member. */
9125 else if (TREE_CODE (argument) == TEMPLATE_PARM_INDEX)
9128 cp_parser_simulate_error (parser);
9130 if (cp_parser_parse_definitely (parser))
9133 argument = build_x_unary_op (ADDR_EXPR, argument);
9138 /* If the argument started with "&", there are no other valid
9139 alternatives at this point. */
9142 cp_parser_error (parser, "invalid non-type template argument");
9143 return error_mark_node;
9146 /* If the argument wasn't successfully parsed as a type-id followed
9147 by '>>', the argument can only be a constant expression now.
9148 Otherwise, we try parsing the constant-expression tentatively,
9149 because the argument could really be a type-id. */
9151 cp_parser_parse_tentatively (parser);
9152 argument = cp_parser_constant_expression (parser,
9153 /*allow_non_constant_p=*/false,
9154 /*non_constant_p=*/NULL);
9155 argument = fold_non_dependent_expr (argument);
9158 if (!cp_parser_next_token_ends_template_argument_p (parser))
9159 cp_parser_error (parser, "expected template-argument");
9160 if (cp_parser_parse_definitely (parser))
9162 /* We did our best to parse the argument as a non type-id, but that
9163 was the only alternative that matched (albeit with a '>' after
9164 it). We can assume it's just a typo from the user, and a
9165 diagnostic will then be issued. */
9166 return cp_parser_type_id (parser);
9169 /* Parse an explicit-instantiation.
9171 explicit-instantiation:
9172 template declaration
9174 Although the standard says `declaration', what it really means is:
9176 explicit-instantiation:
9177 template decl-specifier-seq [opt] declarator [opt] ;
9179 Things like `template int S<int>::i = 5, int S<double>::j;' are not
9180 supposed to be allowed. A defect report has been filed about this
9185 explicit-instantiation:
9186 storage-class-specifier template
9187 decl-specifier-seq [opt] declarator [opt] ;
9188 function-specifier template
9189 decl-specifier-seq [opt] declarator [opt] ; */
9192 cp_parser_explicit_instantiation (cp_parser* parser)
9194 int declares_class_or_enum;
9195 cp_decl_specifier_seq decl_specifiers;
9196 tree extension_specifier = NULL_TREE;
9198 /* Look for an (optional) storage-class-specifier or
9199 function-specifier. */
9200 if (cp_parser_allow_gnu_extensions_p (parser))
9203 = cp_parser_storage_class_specifier_opt (parser);
9204 if (!extension_specifier)
9206 = cp_parser_function_specifier_opt (parser,
9207 /*decl_specs=*/NULL);
9210 /* Look for the `template' keyword. */
9211 cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'");
9212 /* Let the front end know that we are processing an explicit
9214 begin_explicit_instantiation ();
9215 /* [temp.explicit] says that we are supposed to ignore access
9216 control while processing explicit instantiation directives. */
9217 push_deferring_access_checks (dk_no_check);
9218 /* Parse a decl-specifier-seq. */
9219 cp_parser_decl_specifier_seq (parser,
9220 CP_PARSER_FLAGS_OPTIONAL,
9222 &declares_class_or_enum);
9223 /* If there was exactly one decl-specifier, and it declared a class,
9224 and there's no declarator, then we have an explicit type
9226 if (declares_class_or_enum && cp_parser_declares_only_class_p (parser))
9230 type = check_tag_decl (&decl_specifiers);
9231 /* Turn access control back on for names used during
9232 template instantiation. */
9233 pop_deferring_access_checks ();
9235 do_type_instantiation (type, extension_specifier, /*complain=*/1);
9239 cp_declarator *declarator;
9242 /* Parse the declarator. */
9244 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
9245 /*ctor_dtor_or_conv_p=*/NULL,
9246 /*parenthesized_p=*/NULL,
9247 /*member_p=*/false);
9248 if (declares_class_or_enum & 2)
9249 cp_parser_check_for_definition_in_return_type (declarator,
9250 decl_specifiers.type);
9251 if (declarator != cp_error_declarator)
9253 decl = grokdeclarator (declarator, &decl_specifiers,
9255 /* Turn access control back on for names used during
9256 template instantiation. */
9257 pop_deferring_access_checks ();
9258 /* Do the explicit instantiation. */
9259 do_decl_instantiation (decl, extension_specifier);
9263 pop_deferring_access_checks ();
9264 /* Skip the body of the explicit instantiation. */
9265 cp_parser_skip_to_end_of_statement (parser);
9268 /* We're done with the instantiation. */
9269 end_explicit_instantiation ();
9271 cp_parser_consume_semicolon_at_end_of_statement (parser);
9274 /* Parse an explicit-specialization.
9276 explicit-specialization:
9277 template < > declaration
9279 Although the standard says `declaration', what it really means is:
9281 explicit-specialization:
9282 template <> decl-specifier [opt] init-declarator [opt] ;
9283 template <> function-definition
9284 template <> explicit-specialization
9285 template <> template-declaration */
9288 cp_parser_explicit_specialization (cp_parser* parser)
9290 /* Look for the `template' keyword. */
9291 cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'");
9292 /* Look for the `<'. */
9293 cp_parser_require (parser, CPP_LESS, "`<'");
9294 /* Look for the `>'. */
9295 cp_parser_require (parser, CPP_GREATER, "`>'");
9296 /* We have processed another parameter list. */
9297 ++parser->num_template_parameter_lists;
9298 /* Let the front end know that we are beginning a specialization. */
9299 begin_specialization ();
9301 /* If the next keyword is `template', we need to figure out whether
9302 or not we're looking a template-declaration. */
9303 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
9305 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
9306 && cp_lexer_peek_nth_token (parser->lexer, 3)->type != CPP_GREATER)
9307 cp_parser_template_declaration_after_export (parser,
9308 /*member_p=*/false);
9310 cp_parser_explicit_specialization (parser);
9313 /* Parse the dependent declaration. */
9314 cp_parser_single_declaration (parser,
9318 /* We're done with the specialization. */
9319 end_specialization ();
9320 /* We're done with this parameter list. */
9321 --parser->num_template_parameter_lists;
9324 /* Parse a type-specifier.
9327 simple-type-specifier
9330 elaborated-type-specifier
9338 Returns a representation of the type-specifier. For a
9339 class-specifier, enum-specifier, or elaborated-type-specifier, a
9340 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
9342 The parser flags FLAGS is used to control type-specifier parsing.
9344 If IS_DECLARATION is TRUE, then this type-specifier is appearing
9345 in a decl-specifier-seq.
9347 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
9348 class-specifier, enum-specifier, or elaborated-type-specifier, then
9349 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
9350 if a type is declared; 2 if it is defined. Otherwise, it is set to
9353 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
9354 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
9358 cp_parser_type_specifier (cp_parser* parser,
9359 cp_parser_flags flags,
9360 cp_decl_specifier_seq *decl_specs,
9361 bool is_declaration,
9362 int* declares_class_or_enum,
9363 bool* is_cv_qualifier)
9365 tree type_spec = NULL_TREE;
9368 cp_decl_spec ds = ds_last;
9370 /* Assume this type-specifier does not declare a new type. */
9371 if (declares_class_or_enum)
9372 *declares_class_or_enum = 0;
9373 /* And that it does not specify a cv-qualifier. */
9374 if (is_cv_qualifier)
9375 *is_cv_qualifier = false;
9376 /* Peek at the next token. */
9377 token = cp_lexer_peek_token (parser->lexer);
9379 /* If we're looking at a keyword, we can use that to guide the
9380 production we choose. */
9381 keyword = token->keyword;
9385 /* 'enum' [identifier] '{' introduces an enum-specifier;
9386 'enum' <anything else> introduces an elaborated-type-specifier. */
9387 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_OPEN_BRACE
9388 || (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_NAME
9389 && cp_lexer_peek_nth_token (parser->lexer, 3)->type
9392 if (parser->num_template_parameter_lists)
9394 error ("template declaration of %qs", "enum");
9395 cp_parser_skip_to_end_of_block_or_statement (parser);
9396 type_spec = error_mark_node;
9399 type_spec = cp_parser_enum_specifier (parser);
9401 if (declares_class_or_enum)
9402 *declares_class_or_enum = 2;
9404 cp_parser_set_decl_spec_type (decl_specs,
9406 /*user_defined_p=*/true);
9410 goto elaborated_type_specifier;
9412 /* Any of these indicate either a class-specifier, or an
9413 elaborated-type-specifier. */
9417 /* Parse tentatively so that we can back up if we don't find a
9419 cp_parser_parse_tentatively (parser);
9420 /* Look for the class-specifier. */
9421 type_spec = cp_parser_class_specifier (parser);
9422 /* If that worked, we're done. */
9423 if (cp_parser_parse_definitely (parser))
9425 if (declares_class_or_enum)
9426 *declares_class_or_enum = 2;
9428 cp_parser_set_decl_spec_type (decl_specs,
9430 /*user_defined_p=*/true);
9435 elaborated_type_specifier:
9436 /* We're declaring (not defining) a class or enum. */
9437 if (declares_class_or_enum)
9438 *declares_class_or_enum = 1;
9442 /* Look for an elaborated-type-specifier. */
9444 = (cp_parser_elaborated_type_specifier
9446 decl_specs && decl_specs->specs[(int) ds_friend],
9449 cp_parser_set_decl_spec_type (decl_specs,
9451 /*user_defined_p=*/true);
9456 if (is_cv_qualifier)
9457 *is_cv_qualifier = true;
9462 if (is_cv_qualifier)
9463 *is_cv_qualifier = true;
9468 if (is_cv_qualifier)
9469 *is_cv_qualifier = true;
9473 /* The `__complex__' keyword is a GNU extension. */
9481 /* Handle simple keywords. */
9486 ++decl_specs->specs[(int)ds];
9487 decl_specs->any_specifiers_p = true;
9489 return cp_lexer_consume_token (parser->lexer)->value;
9492 /* If we do not already have a type-specifier, assume we are looking
9493 at a simple-type-specifier. */
9494 type_spec = cp_parser_simple_type_specifier (parser,
9498 /* If we didn't find a type-specifier, and a type-specifier was not
9499 optional in this context, issue an error message. */
9500 if (!type_spec && !(flags & CP_PARSER_FLAGS_OPTIONAL))
9502 cp_parser_error (parser, "expected type specifier");
9503 return error_mark_node;
9509 /* Parse a simple-type-specifier.
9511 simple-type-specifier:
9512 :: [opt] nested-name-specifier [opt] type-name
9513 :: [opt] nested-name-specifier template template-id
9528 simple-type-specifier:
9529 __typeof__ unary-expression
9530 __typeof__ ( type-id )
9532 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
9533 appropriately updated. */
9536 cp_parser_simple_type_specifier (cp_parser* parser,
9537 cp_decl_specifier_seq *decl_specs,
9538 cp_parser_flags flags)
9540 tree type = NULL_TREE;
9543 /* Peek at the next token. */
9544 token = cp_lexer_peek_token (parser->lexer);
9546 /* If we're looking at a keyword, things are easy. */
9547 switch (token->keyword)
9551 decl_specs->explicit_char_p = true;
9552 type = char_type_node;
9555 type = wchar_type_node;
9558 type = boolean_type_node;
9562 ++decl_specs->specs[(int) ds_short];
9563 type = short_integer_type_node;
9567 decl_specs->explicit_int_p = true;
9568 type = integer_type_node;
9572 ++decl_specs->specs[(int) ds_long];
9573 type = long_integer_type_node;
9577 ++decl_specs->specs[(int) ds_signed];
9578 type = integer_type_node;
9582 ++decl_specs->specs[(int) ds_unsigned];
9583 type = unsigned_type_node;
9586 type = float_type_node;
9589 type = double_type_node;
9592 type = void_type_node;
9596 /* Consume the `typeof' token. */
9597 cp_lexer_consume_token (parser->lexer);
9598 /* Parse the operand to `typeof'. */
9599 type = cp_parser_sizeof_operand (parser, RID_TYPEOF);
9600 /* If it is not already a TYPE, take its type. */
9602 type = finish_typeof (type);
9605 cp_parser_set_decl_spec_type (decl_specs, type,
9606 /*user_defined_p=*/true);
9614 /* If the type-specifier was for a built-in type, we're done. */
9619 /* Record the type. */
9621 && (token->keyword != RID_SIGNED
9622 && token->keyword != RID_UNSIGNED
9623 && token->keyword != RID_SHORT
9624 && token->keyword != RID_LONG))
9625 cp_parser_set_decl_spec_type (decl_specs,
9627 /*user_defined=*/false);
9629 decl_specs->any_specifiers_p = true;
9631 /* Consume the token. */
9632 id = cp_lexer_consume_token (parser->lexer)->value;
9634 /* There is no valid C++ program where a non-template type is
9635 followed by a "<". That usually indicates that the user thought
9636 that the type was a template. */
9637 cp_parser_check_for_invalid_template_id (parser, type);
9639 return TYPE_NAME (type);
9642 /* The type-specifier must be a user-defined type. */
9643 if (!(flags & CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES))
9648 /* Don't gobble tokens or issue error messages if this is an
9649 optional type-specifier. */
9650 if (flags & CP_PARSER_FLAGS_OPTIONAL)
9651 cp_parser_parse_tentatively (parser);
9653 /* Look for the optional `::' operator. */
9655 = (cp_parser_global_scope_opt (parser,
9656 /*current_scope_valid_p=*/false)
9658 /* Look for the nested-name specifier. */
9660 = (cp_parser_nested_name_specifier_opt (parser,
9661 /*typename_keyword_p=*/false,
9662 /*check_dependency_p=*/true,
9664 /*is_declaration=*/false)
9666 /* If we have seen a nested-name-specifier, and the next token
9667 is `template', then we are using the template-id production. */
9669 && cp_parser_optional_template_keyword (parser))
9671 /* Look for the template-id. */
9672 type = cp_parser_template_id (parser,
9673 /*template_keyword_p=*/true,
9674 /*check_dependency_p=*/true,
9675 /*is_declaration=*/false);
9676 /* If the template-id did not name a type, we are out of
9678 if (TREE_CODE (type) != TYPE_DECL)
9680 cp_parser_error (parser, "expected template-id for type");
9684 /* Otherwise, look for a type-name. */
9686 type = cp_parser_type_name (parser);
9687 /* Keep track of all name-lookups performed in class scopes. */
9691 && TREE_CODE (type) == TYPE_DECL
9692 && TREE_CODE (DECL_NAME (type)) == IDENTIFIER_NODE)
9693 maybe_note_name_used_in_class (DECL_NAME (type), type);
9694 /* If it didn't work out, we don't have a TYPE. */
9695 if ((flags & CP_PARSER_FLAGS_OPTIONAL)
9696 && !cp_parser_parse_definitely (parser))
9698 if (type && decl_specs)
9699 cp_parser_set_decl_spec_type (decl_specs, type,
9700 /*user_defined=*/true);
9703 /* If we didn't get a type-name, issue an error message. */
9704 if (!type && !(flags & CP_PARSER_FLAGS_OPTIONAL))
9706 cp_parser_error (parser, "expected type-name");
9707 return error_mark_node;
9710 /* There is no valid C++ program where a non-template type is
9711 followed by a "<". That usually indicates that the user thought
9712 that the type was a template. */
9713 if (type && type != error_mark_node)
9715 /* As a last-ditch effort, see if TYPE is an Objective-C type.
9716 If it is, then the '<'...'>' enclose protocol names rather than
9717 template arguments, and so everything is fine. */
9718 if (c_dialect_objc ()
9719 && (objc_is_id (type) || objc_is_class_name (type)))
9721 tree protos = cp_parser_objc_protocol_refs_opt (parser);
9722 tree qual_type = objc_get_protocol_qualified_type (type, protos);
9724 /* Clobber the "unqualified" type previously entered into
9725 DECL_SPECS with the new, improved protocol-qualified version. */
9727 decl_specs->type = qual_type;
9732 cp_parser_check_for_invalid_template_id (parser, TREE_TYPE (type));
9738 /* Parse a type-name.
9751 Returns a TYPE_DECL for the type. */
9754 cp_parser_type_name (cp_parser* parser)
9759 /* We can't know yet whether it is a class-name or not. */
9760 cp_parser_parse_tentatively (parser);
9761 /* Try a class-name. */
9762 type_decl = cp_parser_class_name (parser,
9763 /*typename_keyword_p=*/false,
9764 /*template_keyword_p=*/false,
9766 /*check_dependency_p=*/true,
9767 /*class_head_p=*/false,
9768 /*is_declaration=*/false);
9769 /* If it's not a class-name, keep looking. */
9770 if (!cp_parser_parse_definitely (parser))
9772 /* It must be a typedef-name or an enum-name. */
9773 identifier = cp_parser_identifier (parser);
9774 if (identifier == error_mark_node)
9775 return error_mark_node;
9777 /* Look up the type-name. */
9778 type_decl = cp_parser_lookup_name_simple (parser, identifier);
9780 if (TREE_CODE (type_decl) != TYPE_DECL
9781 && (objc_is_id (identifier) || objc_is_class_name (identifier)))
9783 /* See if this is an Objective-C type. */
9784 tree protos = cp_parser_objc_protocol_refs_opt (parser);
9785 tree type = objc_get_protocol_qualified_type (identifier, protos);
9787 type_decl = TYPE_NAME (type);
9790 /* Issue an error if we did not find a type-name. */
9791 if (TREE_CODE (type_decl) != TYPE_DECL)
9793 if (!cp_parser_simulate_error (parser))
9794 cp_parser_name_lookup_error (parser, identifier, type_decl,
9796 type_decl = error_mark_node;
9798 /* Remember that the name was used in the definition of the
9799 current class so that we can check later to see if the
9800 meaning would have been different after the class was
9801 entirely defined. */
9802 else if (type_decl != error_mark_node
9804 maybe_note_name_used_in_class (identifier, type_decl);
9811 /* Parse an elaborated-type-specifier. Note that the grammar given
9812 here incorporates the resolution to DR68.
9814 elaborated-type-specifier:
9815 class-key :: [opt] nested-name-specifier [opt] identifier
9816 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
9817 enum :: [opt] nested-name-specifier [opt] identifier
9818 typename :: [opt] nested-name-specifier identifier
9819 typename :: [opt] nested-name-specifier template [opt]
9824 elaborated-type-specifier:
9825 class-key attributes :: [opt] nested-name-specifier [opt] identifier
9826 class-key attributes :: [opt] nested-name-specifier [opt]
9827 template [opt] template-id
9828 enum attributes :: [opt] nested-name-specifier [opt] identifier
9830 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
9831 declared `friend'. If IS_DECLARATION is TRUE, then this
9832 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
9833 something is being declared.
9835 Returns the TYPE specified. */
9838 cp_parser_elaborated_type_specifier (cp_parser* parser,
9840 bool is_declaration)
9842 enum tag_types tag_type;
9844 tree type = NULL_TREE;
9845 tree attributes = NULL_TREE;
9847 /* See if we're looking at the `enum' keyword. */
9848 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ENUM))
9850 /* Consume the `enum' token. */
9851 cp_lexer_consume_token (parser->lexer);
9852 /* Remember that it's an enumeration type. */
9853 tag_type = enum_type;
9854 /* Parse the attributes. */
9855 attributes = cp_parser_attributes_opt (parser);
9857 /* Or, it might be `typename'. */
9858 else if (cp_lexer_next_token_is_keyword (parser->lexer,
9861 /* Consume the `typename' token. */
9862 cp_lexer_consume_token (parser->lexer);
9863 /* Remember that it's a `typename' type. */
9864 tag_type = typename_type;
9865 /* The `typename' keyword is only allowed in templates. */
9866 if (!processing_template_decl)
9867 pedwarn ("using %<typename%> outside of template");
9869 /* Otherwise it must be a class-key. */
9872 tag_type = cp_parser_class_key (parser);
9873 if (tag_type == none_type)
9874 return error_mark_node;
9875 /* Parse the attributes. */
9876 attributes = cp_parser_attributes_opt (parser);
9879 /* Look for the `::' operator. */
9880 cp_parser_global_scope_opt (parser,
9881 /*current_scope_valid_p=*/false);
9882 /* Look for the nested-name-specifier. */
9883 if (tag_type == typename_type)
9885 if (!cp_parser_nested_name_specifier (parser,
9886 /*typename_keyword_p=*/true,
9887 /*check_dependency_p=*/true,
9890 return error_mark_node;
9893 /* Even though `typename' is not present, the proposed resolution
9894 to Core Issue 180 says that in `class A<T>::B', `B' should be
9895 considered a type-name, even if `A<T>' is dependent. */
9896 cp_parser_nested_name_specifier_opt (parser,
9897 /*typename_keyword_p=*/true,
9898 /*check_dependency_p=*/true,
9901 /* For everything but enumeration types, consider a template-id. */
9902 if (tag_type != enum_type)
9904 bool template_p = false;
9907 /* Allow the `template' keyword. */
9908 template_p = cp_parser_optional_template_keyword (parser);
9909 /* If we didn't see `template', we don't know if there's a
9910 template-id or not. */
9912 cp_parser_parse_tentatively (parser);
9913 /* Parse the template-id. */
9914 decl = cp_parser_template_id (parser, template_p,
9915 /*check_dependency_p=*/true,
9917 /* If we didn't find a template-id, look for an ordinary
9919 if (!template_p && !cp_parser_parse_definitely (parser))
9921 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
9922 in effect, then we must assume that, upon instantiation, the
9923 template will correspond to a class. */
9924 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
9925 && tag_type == typename_type)
9926 type = make_typename_type (parser->scope, decl,
9930 type = TREE_TYPE (decl);
9933 /* For an enumeration type, consider only a plain identifier. */
9936 identifier = cp_parser_identifier (parser);
9938 if (identifier == error_mark_node)
9940 parser->scope = NULL_TREE;
9941 return error_mark_node;
9944 /* For a `typename', we needn't call xref_tag. */
9945 if (tag_type == typename_type
9946 && TREE_CODE (parser->scope) != NAMESPACE_DECL)
9947 return cp_parser_make_typename_type (parser, parser->scope,
9949 /* Look up a qualified name in the usual way. */
9954 decl = cp_parser_lookup_name (parser, identifier,
9956 /*is_template=*/false,
9957 /*is_namespace=*/false,
9958 /*check_dependency=*/true,
9959 /*ambiguous_p=*/NULL);
9961 /* If we are parsing friend declaration, DECL may be a
9962 TEMPLATE_DECL tree node here. However, we need to check
9963 whether this TEMPLATE_DECL results in valid code. Consider
9964 the following example:
9967 template <class T> class C {};
9970 template <class T> friend class N::C; // #1, valid code
9972 template <class T> class Y {
9973 friend class N::C; // #2, invalid code
9976 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
9977 name lookup of `N::C'. We see that friend declaration must
9978 be template for the code to be valid. Note that
9979 processing_template_decl does not work here since it is
9980 always 1 for the above two cases. */
9982 decl = (cp_parser_maybe_treat_template_as_class
9983 (decl, /*tag_name_p=*/is_friend
9984 && parser->num_template_parameter_lists));
9986 if (TREE_CODE (decl) != TYPE_DECL)
9988 cp_parser_diagnose_invalid_type_name (parser,
9991 return error_mark_node;
9994 if (TREE_CODE (TREE_TYPE (decl)) != TYPENAME_TYPE)
9995 check_elaborated_type_specifier
9997 (parser->num_template_parameter_lists
9998 || DECL_SELF_REFERENCE_P (decl)));
10000 type = TREE_TYPE (decl);
10004 /* An elaborated-type-specifier sometimes introduces a new type and
10005 sometimes names an existing type. Normally, the rule is that it
10006 introduces a new type only if there is not an existing type of
10007 the same name already in scope. For example, given:
10010 void f() { struct S s; }
10012 the `struct S' in the body of `f' is the same `struct S' as in
10013 the global scope; the existing definition is used. However, if
10014 there were no global declaration, this would introduce a new
10015 local class named `S'.
10017 An exception to this rule applies to the following code:
10019 namespace N { struct S; }
10021 Here, the elaborated-type-specifier names a new type
10022 unconditionally; even if there is already an `S' in the
10023 containing scope this declaration names a new type.
10024 This exception only applies if the elaborated-type-specifier
10025 forms the complete declaration:
10029 A declaration consisting solely of `class-key identifier ;' is
10030 either a redeclaration of the name in the current scope or a
10031 forward declaration of the identifier as a class name. It
10032 introduces the name into the current scope.
10034 We are in this situation precisely when the next token is a `;'.
10036 An exception to the exception is that a `friend' declaration does
10037 *not* name a new type; i.e., given:
10039 struct S { friend struct T; };
10041 `T' is not a new type in the scope of `S'.
10043 Also, `new struct S' or `sizeof (struct S)' never results in the
10044 definition of a new type; a new type can only be declared in a
10045 declaration context. */
10049 /* Friends have special name lookup rules. */
10050 ts = ts_within_enclosing_non_class;
10051 else if (is_declaration
10052 && cp_lexer_next_token_is (parser->lexer,
10054 /* This is a `class-key identifier ;' */
10059 /* Warn about attributes. They are ignored. */
10061 warning (OPT_Wattributes,
10062 "type attributes are honored only at type definition");
10064 type = xref_tag (tag_type, identifier, ts,
10065 parser->num_template_parameter_lists);
10068 if (tag_type != enum_type)
10069 cp_parser_check_class_key (tag_type, type);
10071 /* A "<" cannot follow an elaborated type specifier. If that
10072 happens, the user was probably trying to form a template-id. */
10073 cp_parser_check_for_invalid_template_id (parser, type);
10078 /* Parse an enum-specifier.
10081 enum identifier [opt] { enumerator-list [opt] }
10084 enum identifier [opt] { enumerator-list [opt] } attributes
10086 Returns an ENUM_TYPE representing the enumeration. */
10089 cp_parser_enum_specifier (cp_parser* parser)
10094 /* Caller guarantees that the current token is 'enum', an identifier
10095 possibly follows, and the token after that is an opening brace.
10096 If we don't have an identifier, fabricate an anonymous name for
10097 the enumeration being defined. */
10098 cp_lexer_consume_token (parser->lexer);
10100 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
10101 identifier = cp_parser_identifier (parser);
10103 identifier = make_anon_name ();
10105 /* Issue an error message if type-definitions are forbidden here. */
10106 cp_parser_check_type_definition (parser);
10108 /* Create the new type. We do this before consuming the opening brace
10109 so the enum will be recorded as being on the line of its tag (or the
10110 'enum' keyword, if there is no tag). */
10111 type = start_enum (identifier);
10113 /* Consume the opening brace. */
10114 cp_lexer_consume_token (parser->lexer);
10116 /* If the next token is not '}', then there are some enumerators. */
10117 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
10118 cp_parser_enumerator_list (parser, type);
10120 /* Consume the final '}'. */
10121 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
10123 /* Look for trailing attributes to apply to this enumeration, and
10124 apply them if appropriate. */
10125 if (cp_parser_allow_gnu_extensions_p (parser))
10127 tree trailing_attr = cp_parser_attributes_opt (parser);
10128 cplus_decl_attributes (&type,
10130 (int) ATTR_FLAG_TYPE_IN_PLACE);
10133 /* Finish up the enumeration. */
10134 finish_enum (type);
10139 /* Parse an enumerator-list. The enumerators all have the indicated
10143 enumerator-definition
10144 enumerator-list , enumerator-definition */
10147 cp_parser_enumerator_list (cp_parser* parser, tree type)
10151 /* Parse an enumerator-definition. */
10152 cp_parser_enumerator_definition (parser, type);
10154 /* If the next token is not a ',', we've reached the end of
10156 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
10158 /* Otherwise, consume the `,' and keep going. */
10159 cp_lexer_consume_token (parser->lexer);
10160 /* If the next token is a `}', there is a trailing comma. */
10161 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
10163 if (pedantic && !in_system_header)
10164 pedwarn ("comma at end of enumerator list");
10170 /* Parse an enumerator-definition. The enumerator has the indicated
10173 enumerator-definition:
10175 enumerator = constant-expression
10181 cp_parser_enumerator_definition (cp_parser* parser, tree type)
10186 /* Look for the identifier. */
10187 identifier = cp_parser_identifier (parser);
10188 if (identifier == error_mark_node)
10191 /* If the next token is an '=', then there is an explicit value. */
10192 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
10194 /* Consume the `=' token. */
10195 cp_lexer_consume_token (parser->lexer);
10196 /* Parse the value. */
10197 value = cp_parser_constant_expression (parser,
10198 /*allow_non_constant_p=*/false,
10204 /* Create the enumerator. */
10205 build_enumerator (identifier, value, type);
10208 /* Parse a namespace-name.
10211 original-namespace-name
10214 Returns the NAMESPACE_DECL for the namespace. */
10217 cp_parser_namespace_name (cp_parser* parser)
10220 tree namespace_decl;
10222 /* Get the name of the namespace. */
10223 identifier = cp_parser_identifier (parser);
10224 if (identifier == error_mark_node)
10225 return error_mark_node;
10227 /* Look up the identifier in the currently active scope. Look only
10228 for namespaces, due to:
10230 [basic.lookup.udir]
10232 When looking up a namespace-name in a using-directive or alias
10233 definition, only namespace names are considered.
10237 [basic.lookup.qual]
10239 During the lookup of a name preceding the :: scope resolution
10240 operator, object, function, and enumerator names are ignored.
10242 (Note that cp_parser_class_or_namespace_name only calls this
10243 function if the token after the name is the scope resolution
10245 namespace_decl = cp_parser_lookup_name (parser, identifier,
10247 /*is_template=*/false,
10248 /*is_namespace=*/true,
10249 /*check_dependency=*/true,
10250 /*ambiguous_p=*/NULL);
10251 /* If it's not a namespace, issue an error. */
10252 if (namespace_decl == error_mark_node
10253 || TREE_CODE (namespace_decl) != NAMESPACE_DECL)
10255 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
10256 error ("%qD is not a namespace-name", identifier);
10257 cp_parser_error (parser, "expected namespace-name");
10258 namespace_decl = error_mark_node;
10261 return namespace_decl;
10264 /* Parse a namespace-definition.
10266 namespace-definition:
10267 named-namespace-definition
10268 unnamed-namespace-definition
10270 named-namespace-definition:
10271 original-namespace-definition
10272 extension-namespace-definition
10274 original-namespace-definition:
10275 namespace identifier { namespace-body }
10277 extension-namespace-definition:
10278 namespace original-namespace-name { namespace-body }
10280 unnamed-namespace-definition:
10281 namespace { namespace-body } */
10284 cp_parser_namespace_definition (cp_parser* parser)
10288 /* Look for the `namespace' keyword. */
10289 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10291 /* Get the name of the namespace. We do not attempt to distinguish
10292 between an original-namespace-definition and an
10293 extension-namespace-definition at this point. The semantic
10294 analysis routines are responsible for that. */
10295 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
10296 identifier = cp_parser_identifier (parser);
10298 identifier = NULL_TREE;
10300 /* Look for the `{' to start the namespace. */
10301 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
10302 /* Start the namespace. */
10303 push_namespace (identifier);
10304 /* Parse the body of the namespace. */
10305 cp_parser_namespace_body (parser);
10306 /* Finish the namespace. */
10308 /* Look for the final `}'. */
10309 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
10312 /* Parse a namespace-body.
10315 declaration-seq [opt] */
10318 cp_parser_namespace_body (cp_parser* parser)
10320 cp_parser_declaration_seq_opt (parser);
10323 /* Parse a namespace-alias-definition.
10325 namespace-alias-definition:
10326 namespace identifier = qualified-namespace-specifier ; */
10329 cp_parser_namespace_alias_definition (cp_parser* parser)
10332 tree namespace_specifier;
10334 /* Look for the `namespace' keyword. */
10335 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10336 /* Look for the identifier. */
10337 identifier = cp_parser_identifier (parser);
10338 if (identifier == error_mark_node)
10340 /* Look for the `=' token. */
10341 cp_parser_require (parser, CPP_EQ, "`='");
10342 /* Look for the qualified-namespace-specifier. */
10343 namespace_specifier
10344 = cp_parser_qualified_namespace_specifier (parser);
10345 /* Look for the `;' token. */
10346 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10348 /* Register the alias in the symbol table. */
10349 do_namespace_alias (identifier, namespace_specifier);
10352 /* Parse a qualified-namespace-specifier.
10354 qualified-namespace-specifier:
10355 :: [opt] nested-name-specifier [opt] namespace-name
10357 Returns a NAMESPACE_DECL corresponding to the specified
10361 cp_parser_qualified_namespace_specifier (cp_parser* parser)
10363 /* Look for the optional `::'. */
10364 cp_parser_global_scope_opt (parser,
10365 /*current_scope_valid_p=*/false);
10367 /* Look for the optional nested-name-specifier. */
10368 cp_parser_nested_name_specifier_opt (parser,
10369 /*typename_keyword_p=*/false,
10370 /*check_dependency_p=*/true,
10372 /*is_declaration=*/true);
10374 return cp_parser_namespace_name (parser);
10377 /* Parse a using-declaration.
10380 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
10381 using :: unqualified-id ; */
10384 cp_parser_using_declaration (cp_parser* parser)
10387 bool typename_p = false;
10388 bool global_scope_p;
10393 /* Look for the `using' keyword. */
10394 cp_parser_require_keyword (parser, RID_USING, "`using'");
10396 /* Peek at the next token. */
10397 token = cp_lexer_peek_token (parser->lexer);
10398 /* See if it's `typename'. */
10399 if (token->keyword == RID_TYPENAME)
10401 /* Remember that we've seen it. */
10403 /* Consume the `typename' token. */
10404 cp_lexer_consume_token (parser->lexer);
10407 /* Look for the optional global scope qualification. */
10409 = (cp_parser_global_scope_opt (parser,
10410 /*current_scope_valid_p=*/false)
10413 /* If we saw `typename', or didn't see `::', then there must be a
10414 nested-name-specifier present. */
10415 if (typename_p || !global_scope_p)
10416 qscope = cp_parser_nested_name_specifier (parser, typename_p,
10417 /*check_dependency_p=*/true,
10419 /*is_declaration=*/true);
10420 /* Otherwise, we could be in either of the two productions. In that
10421 case, treat the nested-name-specifier as optional. */
10423 qscope = cp_parser_nested_name_specifier_opt (parser,
10424 /*typename_keyword_p=*/false,
10425 /*check_dependency_p=*/true,
10427 /*is_declaration=*/true);
10429 qscope = global_namespace;
10431 /* Parse the unqualified-id. */
10432 identifier = cp_parser_unqualified_id (parser,
10433 /*template_keyword_p=*/false,
10434 /*check_dependency_p=*/true,
10435 /*declarator_p=*/true);
10437 /* The function we call to handle a using-declaration is different
10438 depending on what scope we are in. */
10439 if (identifier == error_mark_node)
10441 else if (TREE_CODE (identifier) != IDENTIFIER_NODE
10442 && TREE_CODE (identifier) != BIT_NOT_EXPR)
10443 /* [namespace.udecl]
10445 A using declaration shall not name a template-id. */
10446 error ("a template-id may not appear in a using-declaration");
10449 if (at_class_scope_p ())
10451 /* Create the USING_DECL. */
10452 decl = do_class_using_decl (parser->scope, identifier);
10453 /* Add it to the list of members in this class. */
10454 finish_member_declaration (decl);
10458 decl = cp_parser_lookup_name_simple (parser, identifier);
10459 if (decl == error_mark_node)
10460 cp_parser_name_lookup_error (parser, identifier, decl, NULL);
10461 else if (!at_namespace_scope_p ())
10462 do_local_using_decl (decl, qscope, identifier);
10464 do_toplevel_using_decl (decl, qscope, identifier);
10468 /* Look for the final `;'. */
10469 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10472 /* Parse a using-directive.
10475 using namespace :: [opt] nested-name-specifier [opt]
10476 namespace-name ; */
10479 cp_parser_using_directive (cp_parser* parser)
10481 tree namespace_decl;
10484 /* Look for the `using' keyword. */
10485 cp_parser_require_keyword (parser, RID_USING, "`using'");
10486 /* And the `namespace' keyword. */
10487 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10488 /* Look for the optional `::' operator. */
10489 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
10490 /* And the optional nested-name-specifier. */
10491 cp_parser_nested_name_specifier_opt (parser,
10492 /*typename_keyword_p=*/false,
10493 /*check_dependency_p=*/true,
10495 /*is_declaration=*/true);
10496 /* Get the namespace being used. */
10497 namespace_decl = cp_parser_namespace_name (parser);
10498 /* And any specified attributes. */
10499 attribs = cp_parser_attributes_opt (parser);
10500 /* Update the symbol table. */
10501 parse_using_directive (namespace_decl, attribs);
10502 /* Look for the final `;'. */
10503 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10506 /* Parse an asm-definition.
10509 asm ( string-literal ) ;
10514 asm volatile [opt] ( string-literal ) ;
10515 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
10516 asm volatile [opt] ( string-literal : asm-operand-list [opt]
10517 : asm-operand-list [opt] ) ;
10518 asm volatile [opt] ( string-literal : asm-operand-list [opt]
10519 : asm-operand-list [opt]
10520 : asm-operand-list [opt] ) ; */
10523 cp_parser_asm_definition (cp_parser* parser)
10526 tree outputs = NULL_TREE;
10527 tree inputs = NULL_TREE;
10528 tree clobbers = NULL_TREE;
10530 bool volatile_p = false;
10531 bool extended_p = false;
10533 /* Look for the `asm' keyword. */
10534 cp_parser_require_keyword (parser, RID_ASM, "`asm'");
10535 /* See if the next token is `volatile'. */
10536 if (cp_parser_allow_gnu_extensions_p (parser)
10537 && cp_lexer_next_token_is_keyword (parser->lexer, RID_VOLATILE))
10539 /* Remember that we saw the `volatile' keyword. */
10541 /* Consume the token. */
10542 cp_lexer_consume_token (parser->lexer);
10544 /* Look for the opening `('. */
10545 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
10547 /* Look for the string. */
10548 string = cp_parser_string_literal (parser, false, false);
10549 if (string == error_mark_node)
10551 cp_parser_skip_to_closing_parenthesis (parser, true, false,
10552 /*consume_paren=*/true);
10556 /* If we're allowing GNU extensions, check for the extended assembly
10557 syntax. Unfortunately, the `:' tokens need not be separated by
10558 a space in C, and so, for compatibility, we tolerate that here
10559 too. Doing that means that we have to treat the `::' operator as
10561 if (cp_parser_allow_gnu_extensions_p (parser)
10562 && at_function_scope_p ()
10563 && (cp_lexer_next_token_is (parser->lexer, CPP_COLON)
10564 || cp_lexer_next_token_is (parser->lexer, CPP_SCOPE)))
10566 bool inputs_p = false;
10567 bool clobbers_p = false;
10569 /* The extended syntax was used. */
10572 /* Look for outputs. */
10573 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
10575 /* Consume the `:'. */
10576 cp_lexer_consume_token (parser->lexer);
10577 /* Parse the output-operands. */
10578 if (cp_lexer_next_token_is_not (parser->lexer,
10580 && cp_lexer_next_token_is_not (parser->lexer,
10582 && cp_lexer_next_token_is_not (parser->lexer,
10584 outputs = cp_parser_asm_operand_list (parser);
10586 /* If the next token is `::', there are no outputs, and the
10587 next token is the beginning of the inputs. */
10588 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
10589 /* The inputs are coming next. */
10592 /* Look for inputs. */
10594 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
10596 /* Consume the `:' or `::'. */
10597 cp_lexer_consume_token (parser->lexer);
10598 /* Parse the output-operands. */
10599 if (cp_lexer_next_token_is_not (parser->lexer,
10601 && cp_lexer_next_token_is_not (parser->lexer,
10603 inputs = cp_parser_asm_operand_list (parser);
10605 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
10606 /* The clobbers are coming next. */
10609 /* Look for clobbers. */
10611 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
10613 /* Consume the `:' or `::'. */
10614 cp_lexer_consume_token (parser->lexer);
10615 /* Parse the clobbers. */
10616 if (cp_lexer_next_token_is_not (parser->lexer,
10618 clobbers = cp_parser_asm_clobber_list (parser);
10621 /* Look for the closing `)'. */
10622 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
10623 cp_parser_skip_to_closing_parenthesis (parser, true, false,
10624 /*consume_paren=*/true);
10625 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10627 /* Create the ASM_EXPR. */
10628 if (at_function_scope_p ())
10630 asm_stmt = finish_asm_stmt (volatile_p, string, outputs,
10632 /* If the extended syntax was not used, mark the ASM_EXPR. */
10635 tree temp = asm_stmt;
10636 if (TREE_CODE (temp) == CLEANUP_POINT_EXPR)
10637 temp = TREE_OPERAND (temp, 0);
10639 ASM_INPUT_P (temp) = 1;
10643 assemble_asm (string);
10646 /* Declarators [gram.dcl.decl] */
10648 /* Parse an init-declarator.
10651 declarator initializer [opt]
10656 declarator asm-specification [opt] attributes [opt] initializer [opt]
10658 function-definition:
10659 decl-specifier-seq [opt] declarator ctor-initializer [opt]
10661 decl-specifier-seq [opt] declarator function-try-block
10665 function-definition:
10666 __extension__ function-definition
10668 The DECL_SPECIFIERS and PREFIX_ATTRIBUTES apply to this declarator.
10669 Returns a representation of the entity declared. If MEMBER_P is TRUE,
10670 then this declarator appears in a class scope. The new DECL created
10671 by this declarator is returned.
10673 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
10674 for a function-definition here as well. If the declarator is a
10675 declarator for a function-definition, *FUNCTION_DEFINITION_P will
10676 be TRUE upon return. By that point, the function-definition will
10677 have been completely parsed.
10679 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
10683 cp_parser_init_declarator (cp_parser* parser,
10684 cp_decl_specifier_seq *decl_specifiers,
10685 bool function_definition_allowed_p,
10687 int declares_class_or_enum,
10688 bool* function_definition_p)
10691 cp_declarator *declarator;
10692 tree prefix_attributes;
10694 tree asm_specification;
10696 tree decl = NULL_TREE;
10698 bool is_initialized;
10699 bool is_parenthesized_init;
10700 bool is_non_constant_init;
10701 int ctor_dtor_or_conv_p;
10703 tree pushed_scope = NULL;
10705 /* Gather the attributes that were provided with the
10706 decl-specifiers. */
10707 prefix_attributes = decl_specifiers->attributes;
10709 /* Assume that this is not the declarator for a function
10711 if (function_definition_p)
10712 *function_definition_p = false;
10714 /* Defer access checks while parsing the declarator; we cannot know
10715 what names are accessible until we know what is being
10717 resume_deferring_access_checks ();
10719 /* Parse the declarator. */
10721 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
10722 &ctor_dtor_or_conv_p,
10723 /*parenthesized_p=*/NULL,
10724 /*member_p=*/false);
10725 /* Gather up the deferred checks. */
10726 stop_deferring_access_checks ();
10728 /* If the DECLARATOR was erroneous, there's no need to go
10730 if (declarator == cp_error_declarator)
10731 return error_mark_node;
10733 if (declares_class_or_enum & 2)
10734 cp_parser_check_for_definition_in_return_type (declarator,
10735 decl_specifiers->type);
10737 /* Figure out what scope the entity declared by the DECLARATOR is
10738 located in. `grokdeclarator' sometimes changes the scope, so
10739 we compute it now. */
10740 scope = get_scope_of_declarator (declarator);
10742 /* If we're allowing GNU extensions, look for an asm-specification
10744 if (cp_parser_allow_gnu_extensions_p (parser))
10746 /* Look for an asm-specification. */
10747 asm_specification = cp_parser_asm_specification_opt (parser);
10748 /* And attributes. */
10749 attributes = cp_parser_attributes_opt (parser);
10753 asm_specification = NULL_TREE;
10754 attributes = NULL_TREE;
10757 /* Peek at the next token. */
10758 token = cp_lexer_peek_token (parser->lexer);
10759 /* Check to see if the token indicates the start of a
10760 function-definition. */
10761 if (cp_parser_token_starts_function_definition_p (token))
10763 if (!function_definition_allowed_p)
10765 /* If a function-definition should not appear here, issue an
10767 cp_parser_error (parser,
10768 "a function-definition is not allowed here");
10769 return error_mark_node;
10773 /* Neither attributes nor an asm-specification are allowed
10774 on a function-definition. */
10775 if (asm_specification)
10776 error ("an asm-specification is not allowed on a function-definition");
10778 error ("attributes are not allowed on a function-definition");
10779 /* This is a function-definition. */
10780 *function_definition_p = true;
10782 /* Parse the function definition. */
10784 decl = cp_parser_save_member_function_body (parser,
10787 prefix_attributes);
10790 = (cp_parser_function_definition_from_specifiers_and_declarator
10791 (parser, decl_specifiers, prefix_attributes, declarator));
10799 Only in function declarations for constructors, destructors, and
10800 type conversions can the decl-specifier-seq be omitted.
10802 We explicitly postpone this check past the point where we handle
10803 function-definitions because we tolerate function-definitions
10804 that are missing their return types in some modes. */
10805 if (!decl_specifiers->any_specifiers_p && ctor_dtor_or_conv_p <= 0)
10807 cp_parser_error (parser,
10808 "expected constructor, destructor, or type conversion");
10809 return error_mark_node;
10812 /* An `=' or an `(' indicates an initializer. */
10813 is_initialized = (token->type == CPP_EQ
10814 || token->type == CPP_OPEN_PAREN);
10815 /* If the init-declarator isn't initialized and isn't followed by a
10816 `,' or `;', it's not a valid init-declarator. */
10817 if (!is_initialized
10818 && token->type != CPP_COMMA
10819 && token->type != CPP_SEMICOLON)
10821 cp_parser_error (parser, "expected initializer");
10822 return error_mark_node;
10825 /* Because start_decl has side-effects, we should only call it if we
10826 know we're going ahead. By this point, we know that we cannot
10827 possibly be looking at any other construct. */
10828 cp_parser_commit_to_tentative_parse (parser);
10830 /* If the decl specifiers were bad, issue an error now that we're
10831 sure this was intended to be a declarator. Then continue
10832 declaring the variable(s), as int, to try to cut down on further
10834 if (decl_specifiers->any_specifiers_p
10835 && decl_specifiers->type == error_mark_node)
10837 cp_parser_error (parser, "invalid type in declaration");
10838 decl_specifiers->type = integer_type_node;
10841 /* Check to see whether or not this declaration is a friend. */
10842 friend_p = cp_parser_friend_p (decl_specifiers);
10844 /* Check that the number of template-parameter-lists is OK. */
10845 if (!cp_parser_check_declarator_template_parameters (parser, declarator))
10846 return error_mark_node;
10848 /* Enter the newly declared entry in the symbol table. If we're
10849 processing a declaration in a class-specifier, we wait until
10850 after processing the initializer. */
10853 if (parser->in_unbraced_linkage_specification_p)
10855 decl_specifiers->storage_class = sc_extern;
10856 have_extern_spec = false;
10858 decl = start_decl (declarator, decl_specifiers,
10859 is_initialized, attributes, prefix_attributes,
10863 /* Enter the SCOPE. That way unqualified names appearing in the
10864 initializer will be looked up in SCOPE. */
10865 pushed_scope = push_scope (scope);
10867 /* Perform deferred access control checks, now that we know in which
10868 SCOPE the declared entity resides. */
10869 if (!member_p && decl)
10871 tree saved_current_function_decl = NULL_TREE;
10873 /* If the entity being declared is a function, pretend that we
10874 are in its scope. If it is a `friend', it may have access to
10875 things that would not otherwise be accessible. */
10876 if (TREE_CODE (decl) == FUNCTION_DECL)
10878 saved_current_function_decl = current_function_decl;
10879 current_function_decl = decl;
10882 /* Perform the access control checks for the declarator and the
10883 the decl-specifiers. */
10884 perform_deferred_access_checks ();
10886 /* Restore the saved value. */
10887 if (TREE_CODE (decl) == FUNCTION_DECL)
10888 current_function_decl = saved_current_function_decl;
10891 /* Parse the initializer. */
10892 if (is_initialized)
10893 initializer = cp_parser_initializer (parser,
10894 &is_parenthesized_init,
10895 &is_non_constant_init);
10898 initializer = NULL_TREE;
10899 is_parenthesized_init = false;
10900 is_non_constant_init = true;
10903 /* The old parser allows attributes to appear after a parenthesized
10904 initializer. Mark Mitchell proposed removing this functionality
10905 on the GCC mailing lists on 2002-08-13. This parser accepts the
10906 attributes -- but ignores them. */
10907 if (cp_parser_allow_gnu_extensions_p (parser) && is_parenthesized_init)
10908 if (cp_parser_attributes_opt (parser))
10909 warning (OPT_Wattributes,
10910 "attributes after parenthesized initializer ignored");
10912 /* For an in-class declaration, use `grokfield' to create the
10918 pop_scope (pushed_scope);
10919 pushed_scope = false;
10921 decl = grokfield (declarator, decl_specifiers,
10922 initializer, /*asmspec=*/NULL_TREE,
10923 /*attributes=*/NULL_TREE);
10924 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
10925 cp_parser_save_default_args (parser, decl);
10928 /* Finish processing the declaration. But, skip friend
10930 if (!friend_p && decl && decl != error_mark_node)
10932 cp_finish_decl (decl,
10935 /* If the initializer is in parentheses, then this is
10936 a direct-initialization, which means that an
10937 `explicit' constructor is OK. Otherwise, an
10938 `explicit' constructor cannot be used. */
10939 ((is_parenthesized_init || !is_initialized)
10940 ? 0 : LOOKUP_ONLYCONVERTING));
10942 if (!friend_p && pushed_scope)
10943 pop_scope (pushed_scope);
10945 /* Remember whether or not variables were initialized by
10946 constant-expressions. */
10947 if (decl && TREE_CODE (decl) == VAR_DECL
10948 && is_initialized && !is_non_constant_init)
10949 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
10954 /* Parse a declarator.
10958 ptr-operator declarator
10960 abstract-declarator:
10961 ptr-operator abstract-declarator [opt]
10962 direct-abstract-declarator
10967 attributes [opt] direct-declarator
10968 attributes [opt] ptr-operator declarator
10970 abstract-declarator:
10971 attributes [opt] ptr-operator abstract-declarator [opt]
10972 attributes [opt] direct-abstract-declarator
10974 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
10975 detect constructor, destructor or conversion operators. It is set
10976 to -1 if the declarator is a name, and +1 if it is a
10977 function. Otherwise it is set to zero. Usually you just want to
10978 test for >0, but internally the negative value is used.
10980 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
10981 a decl-specifier-seq unless it declares a constructor, destructor,
10982 or conversion. It might seem that we could check this condition in
10983 semantic analysis, rather than parsing, but that makes it difficult
10984 to handle something like `f()'. We want to notice that there are
10985 no decl-specifiers, and therefore realize that this is an
10986 expression, not a declaration.)
10988 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
10989 the declarator is a direct-declarator of the form "(...)".
10991 MEMBER_P is true iff this declarator is a member-declarator. */
10993 static cp_declarator *
10994 cp_parser_declarator (cp_parser* parser,
10995 cp_parser_declarator_kind dcl_kind,
10996 int* ctor_dtor_or_conv_p,
10997 bool* parenthesized_p,
11001 cp_declarator *declarator;
11002 enum tree_code code;
11003 cp_cv_quals cv_quals;
11005 tree attributes = NULL_TREE;
11007 /* Assume this is not a constructor, destructor, or type-conversion
11009 if (ctor_dtor_or_conv_p)
11010 *ctor_dtor_or_conv_p = 0;
11012 if (cp_parser_allow_gnu_extensions_p (parser))
11013 attributes = cp_parser_attributes_opt (parser);
11015 /* Peek at the next token. */
11016 token = cp_lexer_peek_token (parser->lexer);
11018 /* Check for the ptr-operator production. */
11019 cp_parser_parse_tentatively (parser);
11020 /* Parse the ptr-operator. */
11021 code = cp_parser_ptr_operator (parser,
11024 /* If that worked, then we have a ptr-operator. */
11025 if (cp_parser_parse_definitely (parser))
11027 /* If a ptr-operator was found, then this declarator was not
11029 if (parenthesized_p)
11030 *parenthesized_p = true;
11031 /* The dependent declarator is optional if we are parsing an
11032 abstract-declarator. */
11033 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED)
11034 cp_parser_parse_tentatively (parser);
11036 /* Parse the dependent declarator. */
11037 declarator = cp_parser_declarator (parser, dcl_kind,
11038 /*ctor_dtor_or_conv_p=*/NULL,
11039 /*parenthesized_p=*/NULL,
11040 /*member_p=*/false);
11042 /* If we are parsing an abstract-declarator, we must handle the
11043 case where the dependent declarator is absent. */
11044 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED
11045 && !cp_parser_parse_definitely (parser))
11048 /* Build the representation of the ptr-operator. */
11050 declarator = make_ptrmem_declarator (cv_quals,
11053 else if (code == INDIRECT_REF)
11054 declarator = make_pointer_declarator (cv_quals, declarator);
11056 declarator = make_reference_declarator (cv_quals, declarator);
11058 /* Everything else is a direct-declarator. */
11061 if (parenthesized_p)
11062 *parenthesized_p = cp_lexer_next_token_is (parser->lexer,
11064 declarator = cp_parser_direct_declarator (parser, dcl_kind,
11065 ctor_dtor_or_conv_p,
11069 if (attributes && declarator != cp_error_declarator)
11070 declarator->attributes = attributes;
11075 /* Parse a direct-declarator or direct-abstract-declarator.
11079 direct-declarator ( parameter-declaration-clause )
11080 cv-qualifier-seq [opt]
11081 exception-specification [opt]
11082 direct-declarator [ constant-expression [opt] ]
11085 direct-abstract-declarator:
11086 direct-abstract-declarator [opt]
11087 ( parameter-declaration-clause )
11088 cv-qualifier-seq [opt]
11089 exception-specification [opt]
11090 direct-abstract-declarator [opt] [ constant-expression [opt] ]
11091 ( abstract-declarator )
11093 Returns a representation of the declarator. DCL_KIND is
11094 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
11095 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
11096 we are parsing a direct-declarator. It is
11097 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
11098 of ambiguity we prefer an abstract declarator, as per
11099 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
11100 cp_parser_declarator. */
11102 static cp_declarator *
11103 cp_parser_direct_declarator (cp_parser* parser,
11104 cp_parser_declarator_kind dcl_kind,
11105 int* ctor_dtor_or_conv_p,
11109 cp_declarator *declarator = NULL;
11110 tree scope = NULL_TREE;
11111 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
11112 bool saved_in_declarator_p = parser->in_declarator_p;
11114 tree pushed_scope = NULL_TREE;
11118 /* Peek at the next token. */
11119 token = cp_lexer_peek_token (parser->lexer);
11120 if (token->type == CPP_OPEN_PAREN)
11122 /* This is either a parameter-declaration-clause, or a
11123 parenthesized declarator. When we know we are parsing a
11124 named declarator, it must be a parenthesized declarator
11125 if FIRST is true. For instance, `(int)' is a
11126 parameter-declaration-clause, with an omitted
11127 direct-abstract-declarator. But `((*))', is a
11128 parenthesized abstract declarator. Finally, when T is a
11129 template parameter `(T)' is a
11130 parameter-declaration-clause, and not a parenthesized
11133 We first try and parse a parameter-declaration-clause,
11134 and then try a nested declarator (if FIRST is true).
11136 It is not an error for it not to be a
11137 parameter-declaration-clause, even when FIRST is
11143 The first is the declaration of a function while the
11144 second is a the definition of a variable, including its
11147 Having seen only the parenthesis, we cannot know which of
11148 these two alternatives should be selected. Even more
11149 complex are examples like:
11154 The former is a function-declaration; the latter is a
11155 variable initialization.
11157 Thus again, we try a parameter-declaration-clause, and if
11158 that fails, we back out and return. */
11160 if (!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
11162 cp_parameter_declarator *params;
11163 unsigned saved_num_template_parameter_lists;
11165 /* In a member-declarator, the only valid interpretation
11166 of a parenthesis is the start of a
11167 parameter-declaration-clause. (It is invalid to
11168 initialize a static data member with a parenthesized
11169 initializer; only the "=" form of initialization is
11172 cp_parser_parse_tentatively (parser);
11174 /* Consume the `('. */
11175 cp_lexer_consume_token (parser->lexer);
11178 /* If this is going to be an abstract declarator, we're
11179 in a declarator and we can't have default args. */
11180 parser->default_arg_ok_p = false;
11181 parser->in_declarator_p = true;
11184 /* Inside the function parameter list, surrounding
11185 template-parameter-lists do not apply. */
11186 saved_num_template_parameter_lists
11187 = parser->num_template_parameter_lists;
11188 parser->num_template_parameter_lists = 0;
11190 /* Parse the parameter-declaration-clause. */
11191 params = cp_parser_parameter_declaration_clause (parser);
11193 parser->num_template_parameter_lists
11194 = saved_num_template_parameter_lists;
11196 /* If all went well, parse the cv-qualifier-seq and the
11197 exception-specification. */
11198 if (member_p || cp_parser_parse_definitely (parser))
11200 cp_cv_quals cv_quals;
11201 tree exception_specification;
11203 if (ctor_dtor_or_conv_p)
11204 *ctor_dtor_or_conv_p = *ctor_dtor_or_conv_p < 0;
11206 /* Consume the `)'. */
11207 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
11209 /* Parse the cv-qualifier-seq. */
11210 cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
11211 /* And the exception-specification. */
11212 exception_specification
11213 = cp_parser_exception_specification_opt (parser);
11215 /* Create the function-declarator. */
11216 declarator = make_call_declarator (declarator,
11219 exception_specification);
11220 /* Any subsequent parameter lists are to do with
11221 return type, so are not those of the declared
11223 parser->default_arg_ok_p = false;
11225 /* Repeat the main loop. */
11230 /* If this is the first, we can try a parenthesized
11234 bool saved_in_type_id_in_expr_p;
11236 parser->default_arg_ok_p = saved_default_arg_ok_p;
11237 parser->in_declarator_p = saved_in_declarator_p;
11239 /* Consume the `('. */
11240 cp_lexer_consume_token (parser->lexer);
11241 /* Parse the nested declarator. */
11242 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
11243 parser->in_type_id_in_expr_p = true;
11245 = cp_parser_declarator (parser, dcl_kind, ctor_dtor_or_conv_p,
11246 /*parenthesized_p=*/NULL,
11248 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
11250 /* Expect a `)'. */
11251 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
11252 declarator = cp_error_declarator;
11253 if (declarator == cp_error_declarator)
11256 goto handle_declarator;
11258 /* Otherwise, we must be done. */
11262 else if ((!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
11263 && token->type == CPP_OPEN_SQUARE)
11265 /* Parse an array-declarator. */
11268 if (ctor_dtor_or_conv_p)
11269 *ctor_dtor_or_conv_p = 0;
11272 parser->default_arg_ok_p = false;
11273 parser->in_declarator_p = true;
11274 /* Consume the `['. */
11275 cp_lexer_consume_token (parser->lexer);
11276 /* Peek at the next token. */
11277 token = cp_lexer_peek_token (parser->lexer);
11278 /* If the next token is `]', then there is no
11279 constant-expression. */
11280 if (token->type != CPP_CLOSE_SQUARE)
11282 bool non_constant_p;
11285 = cp_parser_constant_expression (parser,
11286 /*allow_non_constant=*/true,
11288 if (!non_constant_p)
11289 bounds = fold_non_dependent_expr (bounds);
11290 /* Normally, the array bound must be an integral constant
11291 expression. However, as an extension, we allow VLAs
11292 in function scopes. */
11293 else if (!at_function_scope_p ())
11295 error ("array bound is not an integer constant");
11296 bounds = error_mark_node;
11300 bounds = NULL_TREE;
11301 /* Look for the closing `]'. */
11302 if (!cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'"))
11304 declarator = cp_error_declarator;
11308 declarator = make_array_declarator (declarator, bounds);
11310 else if (first && dcl_kind != CP_PARSER_DECLARATOR_ABSTRACT)
11312 tree qualifying_scope;
11313 tree unqualified_name;
11315 /* Parse a declarator-id */
11316 if (dcl_kind == CP_PARSER_DECLARATOR_EITHER)
11317 cp_parser_parse_tentatively (parser);
11318 unqualified_name = cp_parser_declarator_id (parser);
11319 qualifying_scope = parser->scope;
11320 if (dcl_kind == CP_PARSER_DECLARATOR_EITHER)
11322 if (!cp_parser_parse_definitely (parser))
11323 unqualified_name = error_mark_node;
11324 else if (qualifying_scope
11325 || (TREE_CODE (unqualified_name)
11326 != IDENTIFIER_NODE))
11328 cp_parser_error (parser, "expected unqualified-id");
11329 unqualified_name = error_mark_node;
11333 if (unqualified_name == error_mark_node)
11335 declarator = cp_error_declarator;
11339 if (qualifying_scope && at_namespace_scope_p ()
11340 && TREE_CODE (qualifying_scope) == TYPENAME_TYPE)
11342 /* In the declaration of a member of a template class
11343 outside of the class itself, the SCOPE will sometimes
11344 be a TYPENAME_TYPE. For example, given:
11346 template <typename T>
11347 int S<T>::R::i = 3;
11349 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
11350 this context, we must resolve S<T>::R to an ordinary
11351 type, rather than a typename type.
11353 The reason we normally avoid resolving TYPENAME_TYPEs
11354 is that a specialization of `S' might render
11355 `S<T>::R' not a type. However, if `S' is
11356 specialized, then this `i' will not be used, so there
11357 is no harm in resolving the types here. */
11360 /* Resolve the TYPENAME_TYPE. */
11361 type = resolve_typename_type (qualifying_scope,
11362 /*only_current_p=*/false);
11363 /* If that failed, the declarator is invalid. */
11364 if (type == error_mark_node)
11365 error ("%<%T::%D%> is not a type",
11366 TYPE_CONTEXT (qualifying_scope),
11367 TYPE_IDENTIFIER (qualifying_scope));
11368 qualifying_scope = type;
11371 declarator = make_id_declarator (qualifying_scope,
11373 declarator->id_loc = token->location;
11374 if (unqualified_name)
11378 if (qualifying_scope
11379 && CLASS_TYPE_P (qualifying_scope))
11380 class_type = qualifying_scope;
11382 class_type = current_class_type;
11386 if (TREE_CODE (unqualified_name) == BIT_NOT_EXPR)
11387 declarator->u.id.sfk = sfk_destructor;
11388 else if (IDENTIFIER_TYPENAME_P (unqualified_name))
11389 declarator->u.id.sfk = sfk_conversion;
11390 else if (/* There's no way to declare a constructor
11391 for an anonymous type, even if the type
11392 got a name for linkage purposes. */
11393 !TYPE_WAS_ANONYMOUS (class_type)
11394 && (constructor_name_p (unqualified_name,
11396 || (TREE_CODE (unqualified_name) == TYPE_DECL
11398 (TREE_TYPE (unqualified_name),
11400 declarator->u.id.sfk = sfk_constructor;
11402 if (ctor_dtor_or_conv_p && declarator->u.id.sfk != sfk_none)
11403 *ctor_dtor_or_conv_p = -1;
11404 if (qualifying_scope
11405 && TREE_CODE (unqualified_name) == TYPE_DECL
11406 && CLASSTYPE_USE_TEMPLATE (TREE_TYPE (unqualified_name)))
11408 error ("invalid use of constructor as a template");
11409 inform ("use %<%T::%D%> instead of %<%T::%T%> to name "
11410 "the constructor in a qualified name",
11412 DECL_NAME (TYPE_TI_TEMPLATE (class_type)),
11413 class_type, class_type);
11418 handle_declarator:;
11419 scope = get_scope_of_declarator (declarator);
11421 /* Any names that appear after the declarator-id for a
11422 member are looked up in the containing scope. */
11423 pushed_scope = push_scope (scope);
11424 parser->in_declarator_p = true;
11425 if ((ctor_dtor_or_conv_p && *ctor_dtor_or_conv_p)
11426 || (declarator && declarator->kind == cdk_id))
11427 /* Default args are only allowed on function
11429 parser->default_arg_ok_p = saved_default_arg_ok_p;
11431 parser->default_arg_ok_p = false;
11440 /* For an abstract declarator, we might wind up with nothing at this
11441 point. That's an error; the declarator is not optional. */
11443 cp_parser_error (parser, "expected declarator");
11445 /* If we entered a scope, we must exit it now. */
11447 pop_scope (pushed_scope);
11449 parser->default_arg_ok_p = saved_default_arg_ok_p;
11450 parser->in_declarator_p = saved_in_declarator_p;
11455 /* Parse a ptr-operator.
11458 * cv-qualifier-seq [opt]
11460 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
11465 & cv-qualifier-seq [opt]
11467 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
11468 Returns ADDR_EXPR if a reference was used. In the case of a
11469 pointer-to-member, *TYPE is filled in with the TYPE containing the
11470 member. *CV_QUALS is filled in with the cv-qualifier-seq, or
11471 TYPE_UNQUALIFIED, if there are no cv-qualifiers. Returns
11472 ERROR_MARK if an error occurred. */
11474 static enum tree_code
11475 cp_parser_ptr_operator (cp_parser* parser,
11477 cp_cv_quals *cv_quals)
11479 enum tree_code code = ERROR_MARK;
11482 /* Assume that it's not a pointer-to-member. */
11484 /* And that there are no cv-qualifiers. */
11485 *cv_quals = TYPE_UNQUALIFIED;
11487 /* Peek at the next token. */
11488 token = cp_lexer_peek_token (parser->lexer);
11489 /* If it's a `*' or `&' we have a pointer or reference. */
11490 if (token->type == CPP_MULT || token->type == CPP_AND)
11492 /* Remember which ptr-operator we were processing. */
11493 code = (token->type == CPP_AND ? ADDR_EXPR : INDIRECT_REF);
11495 /* Consume the `*' or `&'. */
11496 cp_lexer_consume_token (parser->lexer);
11498 /* A `*' can be followed by a cv-qualifier-seq, and so can a
11499 `&', if we are allowing GNU extensions. (The only qualifier
11500 that can legally appear after `&' is `restrict', but that is
11501 enforced during semantic analysis. */
11502 if (code == INDIRECT_REF
11503 || cp_parser_allow_gnu_extensions_p (parser))
11504 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
11508 /* Try the pointer-to-member case. */
11509 cp_parser_parse_tentatively (parser);
11510 /* Look for the optional `::' operator. */
11511 cp_parser_global_scope_opt (parser,
11512 /*current_scope_valid_p=*/false);
11513 /* Look for the nested-name specifier. */
11514 cp_parser_nested_name_specifier (parser,
11515 /*typename_keyword_p=*/false,
11516 /*check_dependency_p=*/true,
11518 /*is_declaration=*/false);
11519 /* If we found it, and the next token is a `*', then we are
11520 indeed looking at a pointer-to-member operator. */
11521 if (!cp_parser_error_occurred (parser)
11522 && cp_parser_require (parser, CPP_MULT, "`*'"))
11524 /* The type of which the member is a member is given by the
11526 *type = parser->scope;
11527 /* The next name will not be qualified. */
11528 parser->scope = NULL_TREE;
11529 parser->qualifying_scope = NULL_TREE;
11530 parser->object_scope = NULL_TREE;
11531 /* Indicate that the `*' operator was used. */
11532 code = INDIRECT_REF;
11533 /* Look for the optional cv-qualifier-seq. */
11534 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
11536 /* If that didn't work we don't have a ptr-operator. */
11537 if (!cp_parser_parse_definitely (parser))
11538 cp_parser_error (parser, "expected ptr-operator");
11544 /* Parse an (optional) cv-qualifier-seq.
11547 cv-qualifier cv-qualifier-seq [opt]
11558 Returns a bitmask representing the cv-qualifiers. */
11561 cp_parser_cv_qualifier_seq_opt (cp_parser* parser)
11563 cp_cv_quals cv_quals = TYPE_UNQUALIFIED;
11568 cp_cv_quals cv_qualifier;
11570 /* Peek at the next token. */
11571 token = cp_lexer_peek_token (parser->lexer);
11572 /* See if it's a cv-qualifier. */
11573 switch (token->keyword)
11576 cv_qualifier = TYPE_QUAL_CONST;
11580 cv_qualifier = TYPE_QUAL_VOLATILE;
11584 cv_qualifier = TYPE_QUAL_RESTRICT;
11588 cv_qualifier = TYPE_UNQUALIFIED;
11595 if (cv_quals & cv_qualifier)
11597 error ("duplicate cv-qualifier");
11598 cp_lexer_purge_token (parser->lexer);
11602 cp_lexer_consume_token (parser->lexer);
11603 cv_quals |= cv_qualifier;
11610 /* Parse a declarator-id.
11614 :: [opt] nested-name-specifier [opt] type-name
11616 In the `id-expression' case, the value returned is as for
11617 cp_parser_id_expression if the id-expression was an unqualified-id.
11618 If the id-expression was a qualified-id, then a SCOPE_REF is
11619 returned. The first operand is the scope (either a NAMESPACE_DECL
11620 or TREE_TYPE), but the second is still just a representation of an
11624 cp_parser_declarator_id (cp_parser* parser)
11626 /* The expression must be an id-expression. Assume that qualified
11627 names are the names of types so that:
11630 int S<T>::R::i = 3;
11632 will work; we must treat `S<T>::R' as the name of a type.
11633 Similarly, assume that qualified names are templates, where
11637 int S<T>::R<T>::i = 3;
11640 return cp_parser_id_expression (parser,
11641 /*template_keyword_p=*/false,
11642 /*check_dependency_p=*/false,
11643 /*template_p=*/NULL,
11644 /*declarator_p=*/true);
11647 /* Parse a type-id.
11650 type-specifier-seq abstract-declarator [opt]
11652 Returns the TYPE specified. */
11655 cp_parser_type_id (cp_parser* parser)
11657 cp_decl_specifier_seq type_specifier_seq;
11658 cp_declarator *abstract_declarator;
11660 /* Parse the type-specifier-seq. */
11661 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
11662 &type_specifier_seq);
11663 if (type_specifier_seq.type == error_mark_node)
11664 return error_mark_node;
11666 /* There might or might not be an abstract declarator. */
11667 cp_parser_parse_tentatively (parser);
11668 /* Look for the declarator. */
11669 abstract_declarator
11670 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_ABSTRACT, NULL,
11671 /*parenthesized_p=*/NULL,
11672 /*member_p=*/false);
11673 /* Check to see if there really was a declarator. */
11674 if (!cp_parser_parse_definitely (parser))
11675 abstract_declarator = NULL;
11677 return groktypename (&type_specifier_seq, abstract_declarator);
11680 /* Parse a type-specifier-seq.
11682 type-specifier-seq:
11683 type-specifier type-specifier-seq [opt]
11687 type-specifier-seq:
11688 attributes type-specifier-seq [opt]
11690 If IS_CONDITION is true, we are at the start of a "condition",
11691 e.g., we've just seen "if (".
11693 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
11696 cp_parser_type_specifier_seq (cp_parser* parser,
11698 cp_decl_specifier_seq *type_specifier_seq)
11700 bool seen_type_specifier = false;
11701 cp_parser_flags flags = CP_PARSER_FLAGS_OPTIONAL;
11703 /* Clear the TYPE_SPECIFIER_SEQ. */
11704 clear_decl_specs (type_specifier_seq);
11706 /* Parse the type-specifiers and attributes. */
11709 tree type_specifier;
11710 bool is_cv_qualifier;
11712 /* Check for attributes first. */
11713 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
11715 type_specifier_seq->attributes =
11716 chainon (type_specifier_seq->attributes,
11717 cp_parser_attributes_opt (parser));
11721 /* Look for the type-specifier. */
11722 type_specifier = cp_parser_type_specifier (parser,
11724 type_specifier_seq,
11725 /*is_declaration=*/false,
11728 if (!type_specifier)
11730 /* If the first type-specifier could not be found, this is not a
11731 type-specifier-seq at all. */
11732 if (!seen_type_specifier)
11734 cp_parser_error (parser, "expected type-specifier");
11735 type_specifier_seq->type = error_mark_node;
11738 /* If subsequent type-specifiers could not be found, the
11739 type-specifier-seq is complete. */
11743 seen_type_specifier = true;
11744 /* The standard says that a condition can be:
11746 type-specifier-seq declarator = assignment-expression
11753 we should treat the "S" as a declarator, not as a
11754 type-specifier. The standard doesn't say that explicitly for
11755 type-specifier-seq, but it does say that for
11756 decl-specifier-seq in an ordinary declaration. Perhaps it
11757 would be clearer just to allow a decl-specifier-seq here, and
11758 then add a semantic restriction that if any decl-specifiers
11759 that are not type-specifiers appear, the program is invalid. */
11760 if (is_condition && !is_cv_qualifier)
11761 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
11767 /* Parse a parameter-declaration-clause.
11769 parameter-declaration-clause:
11770 parameter-declaration-list [opt] ... [opt]
11771 parameter-declaration-list , ...
11773 Returns a representation for the parameter declarations. A return
11774 value of NULL indicates a parameter-declaration-clause consisting
11775 only of an ellipsis. */
11777 static cp_parameter_declarator *
11778 cp_parser_parameter_declaration_clause (cp_parser* parser)
11780 cp_parameter_declarator *parameters;
11785 /* Peek at the next token. */
11786 token = cp_lexer_peek_token (parser->lexer);
11787 /* Check for trivial parameter-declaration-clauses. */
11788 if (token->type == CPP_ELLIPSIS)
11790 /* Consume the `...' token. */
11791 cp_lexer_consume_token (parser->lexer);
11794 else if (token->type == CPP_CLOSE_PAREN)
11795 /* There are no parameters. */
11797 #ifndef NO_IMPLICIT_EXTERN_C
11798 if (in_system_header && current_class_type == NULL
11799 && current_lang_name == lang_name_c)
11803 return no_parameters;
11805 /* Check for `(void)', too, which is a special case. */
11806 else if (token->keyword == RID_VOID
11807 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
11808 == CPP_CLOSE_PAREN))
11810 /* Consume the `void' token. */
11811 cp_lexer_consume_token (parser->lexer);
11812 /* There are no parameters. */
11813 return no_parameters;
11816 /* Parse the parameter-declaration-list. */
11817 parameters = cp_parser_parameter_declaration_list (parser, &is_error);
11818 /* If a parse error occurred while parsing the
11819 parameter-declaration-list, then the entire
11820 parameter-declaration-clause is erroneous. */
11824 /* Peek at the next token. */
11825 token = cp_lexer_peek_token (parser->lexer);
11826 /* If it's a `,', the clause should terminate with an ellipsis. */
11827 if (token->type == CPP_COMMA)
11829 /* Consume the `,'. */
11830 cp_lexer_consume_token (parser->lexer);
11831 /* Expect an ellipsis. */
11833 = (cp_parser_require (parser, CPP_ELLIPSIS, "`...'") != NULL);
11835 /* It might also be `...' if the optional trailing `,' was
11837 else if (token->type == CPP_ELLIPSIS)
11839 /* Consume the `...' token. */
11840 cp_lexer_consume_token (parser->lexer);
11841 /* And remember that we saw it. */
11845 ellipsis_p = false;
11847 /* Finish the parameter list. */
11848 if (parameters && ellipsis_p)
11849 parameters->ellipsis_p = true;
11854 /* Parse a parameter-declaration-list.
11856 parameter-declaration-list:
11857 parameter-declaration
11858 parameter-declaration-list , parameter-declaration
11860 Returns a representation of the parameter-declaration-list, as for
11861 cp_parser_parameter_declaration_clause. However, the
11862 `void_list_node' is never appended to the list. Upon return,
11863 *IS_ERROR will be true iff an error occurred. */
11865 static cp_parameter_declarator *
11866 cp_parser_parameter_declaration_list (cp_parser* parser, bool *is_error)
11868 cp_parameter_declarator *parameters = NULL;
11869 cp_parameter_declarator **tail = ¶meters;
11871 /* Assume all will go well. */
11874 /* Look for more parameters. */
11877 cp_parameter_declarator *parameter;
11878 bool parenthesized_p;
11879 /* Parse the parameter. */
11881 = cp_parser_parameter_declaration (parser,
11882 /*template_parm_p=*/false,
11885 /* If a parse error occurred parsing the parameter declaration,
11886 then the entire parameter-declaration-list is erroneous. */
11893 /* Add the new parameter to the list. */
11895 tail = ¶meter->next;
11897 /* Peek at the next token. */
11898 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN)
11899 || cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS)
11900 /* These are for Objective-C++ */
11901 || cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
11902 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
11903 /* The parameter-declaration-list is complete. */
11905 else if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
11909 /* Peek at the next token. */
11910 token = cp_lexer_peek_nth_token (parser->lexer, 2);
11911 /* If it's an ellipsis, then the list is complete. */
11912 if (token->type == CPP_ELLIPSIS)
11914 /* Otherwise, there must be more parameters. Consume the
11916 cp_lexer_consume_token (parser->lexer);
11917 /* When parsing something like:
11919 int i(float f, double d)
11921 we can tell after seeing the declaration for "f" that we
11922 are not looking at an initialization of a variable "i",
11923 but rather at the declaration of a function "i".
11925 Due to the fact that the parsing of template arguments
11926 (as specified to a template-id) requires backtracking we
11927 cannot use this technique when inside a template argument
11929 if (!parser->in_template_argument_list_p
11930 && !parser->in_type_id_in_expr_p
11931 && cp_parser_uncommitted_to_tentative_parse_p (parser)
11932 /* However, a parameter-declaration of the form
11933 "foat(f)" (which is a valid declaration of a
11934 parameter "f") can also be interpreted as an
11935 expression (the conversion of "f" to "float"). */
11936 && !parenthesized_p)
11937 cp_parser_commit_to_tentative_parse (parser);
11941 cp_parser_error (parser, "expected %<,%> or %<...%>");
11942 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
11943 cp_parser_skip_to_closing_parenthesis (parser,
11944 /*recovering=*/true,
11945 /*or_comma=*/false,
11946 /*consume_paren=*/false);
11954 /* Parse a parameter declaration.
11956 parameter-declaration:
11957 decl-specifier-seq declarator
11958 decl-specifier-seq declarator = assignment-expression
11959 decl-specifier-seq abstract-declarator [opt]
11960 decl-specifier-seq abstract-declarator [opt] = assignment-expression
11962 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
11963 declares a template parameter. (In that case, a non-nested `>'
11964 token encountered during the parsing of the assignment-expression
11965 is not interpreted as a greater-than operator.)
11967 Returns a representation of the parameter, or NULL if an error
11968 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
11969 true iff the declarator is of the form "(p)". */
11971 static cp_parameter_declarator *
11972 cp_parser_parameter_declaration (cp_parser *parser,
11973 bool template_parm_p,
11974 bool *parenthesized_p)
11976 int declares_class_or_enum;
11977 bool greater_than_is_operator_p;
11978 cp_decl_specifier_seq decl_specifiers;
11979 cp_declarator *declarator;
11980 tree default_argument;
11982 const char *saved_message;
11984 /* In a template parameter, `>' is not an operator.
11988 When parsing a default template-argument for a non-type
11989 template-parameter, the first non-nested `>' is taken as the end
11990 of the template parameter-list rather than a greater-than
11992 greater_than_is_operator_p = !template_parm_p;
11994 /* Type definitions may not appear in parameter types. */
11995 saved_message = parser->type_definition_forbidden_message;
11996 parser->type_definition_forbidden_message
11997 = "types may not be defined in parameter types";
11999 /* Parse the declaration-specifiers. */
12000 cp_parser_decl_specifier_seq (parser,
12001 CP_PARSER_FLAGS_NONE,
12003 &declares_class_or_enum);
12004 /* If an error occurred, there's no reason to attempt to parse the
12005 rest of the declaration. */
12006 if (cp_parser_error_occurred (parser))
12008 parser->type_definition_forbidden_message = saved_message;
12012 /* Peek at the next token. */
12013 token = cp_lexer_peek_token (parser->lexer);
12014 /* If the next token is a `)', `,', `=', `>', or `...', then there
12015 is no declarator. */
12016 if (token->type == CPP_CLOSE_PAREN
12017 || token->type == CPP_COMMA
12018 || token->type == CPP_EQ
12019 || token->type == CPP_ELLIPSIS
12020 || token->type == CPP_GREATER)
12023 if (parenthesized_p)
12024 *parenthesized_p = false;
12026 /* Otherwise, there should be a declarator. */
12029 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
12030 parser->default_arg_ok_p = false;
12032 /* After seeing a decl-specifier-seq, if the next token is not a
12033 "(", there is no possibility that the code is a valid
12034 expression. Therefore, if parsing tentatively, we commit at
12036 if (!parser->in_template_argument_list_p
12037 /* In an expression context, having seen:
12041 we cannot be sure whether we are looking at a
12042 function-type (taking a "char" as a parameter) or a cast
12043 of some object of type "char" to "int". */
12044 && !parser->in_type_id_in_expr_p
12045 && cp_parser_uncommitted_to_tentative_parse_p (parser)
12046 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
12047 cp_parser_commit_to_tentative_parse (parser);
12048 /* Parse the declarator. */
12049 declarator = cp_parser_declarator (parser,
12050 CP_PARSER_DECLARATOR_EITHER,
12051 /*ctor_dtor_or_conv_p=*/NULL,
12053 /*member_p=*/false);
12054 parser->default_arg_ok_p = saved_default_arg_ok_p;
12055 /* After the declarator, allow more attributes. */
12056 decl_specifiers.attributes
12057 = chainon (decl_specifiers.attributes,
12058 cp_parser_attributes_opt (parser));
12061 /* The restriction on defining new types applies only to the type
12062 of the parameter, not to the default argument. */
12063 parser->type_definition_forbidden_message = saved_message;
12065 /* If the next token is `=', then process a default argument. */
12066 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
12068 bool saved_greater_than_is_operator_p;
12069 /* Consume the `='. */
12070 cp_lexer_consume_token (parser->lexer);
12072 /* If we are defining a class, then the tokens that make up the
12073 default argument must be saved and processed later. */
12074 if (!template_parm_p && at_class_scope_p ()
12075 && TYPE_BEING_DEFINED (current_class_type))
12077 unsigned depth = 0;
12078 cp_token *first_token;
12081 /* Add tokens until we have processed the entire default
12082 argument. We add the range [first_token, token). */
12083 first_token = cp_lexer_peek_token (parser->lexer);
12088 /* Peek at the next token. */
12089 token = cp_lexer_peek_token (parser->lexer);
12090 /* What we do depends on what token we have. */
12091 switch (token->type)
12093 /* In valid code, a default argument must be
12094 immediately followed by a `,' `)', or `...'. */
12096 case CPP_CLOSE_PAREN:
12098 /* If we run into a non-nested `;', `}', or `]',
12099 then the code is invalid -- but the default
12100 argument is certainly over. */
12101 case CPP_SEMICOLON:
12102 case CPP_CLOSE_BRACE:
12103 case CPP_CLOSE_SQUARE:
12106 /* Update DEPTH, if necessary. */
12107 else if (token->type == CPP_CLOSE_PAREN
12108 || token->type == CPP_CLOSE_BRACE
12109 || token->type == CPP_CLOSE_SQUARE)
12113 case CPP_OPEN_PAREN:
12114 case CPP_OPEN_SQUARE:
12115 case CPP_OPEN_BRACE:
12120 /* If we see a non-nested `>', and `>' is not an
12121 operator, then it marks the end of the default
12123 if (!depth && !greater_than_is_operator_p)
12127 /* If we run out of tokens, issue an error message. */
12129 error ("file ends in default argument");
12135 /* In these cases, we should look for template-ids.
12136 For example, if the default argument is
12137 `X<int, double>()', we need to do name lookup to
12138 figure out whether or not `X' is a template; if
12139 so, the `,' does not end the default argument.
12141 That is not yet done. */
12148 /* If we've reached the end, stop. */
12152 /* Add the token to the token block. */
12153 token = cp_lexer_consume_token (parser->lexer);
12156 /* Create a DEFAULT_ARG to represented the unparsed default
12158 default_argument = make_node (DEFAULT_ARG);
12159 DEFARG_TOKENS (default_argument)
12160 = cp_token_cache_new (first_token, token);
12161 DEFARG_INSTANTIATIONS (default_argument) = NULL;
12163 /* Outside of a class definition, we can just parse the
12164 assignment-expression. */
12167 bool saved_local_variables_forbidden_p;
12169 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
12171 saved_greater_than_is_operator_p
12172 = parser->greater_than_is_operator_p;
12173 parser->greater_than_is_operator_p = greater_than_is_operator_p;
12174 /* Local variable names (and the `this' keyword) may not
12175 appear in a default argument. */
12176 saved_local_variables_forbidden_p
12177 = parser->local_variables_forbidden_p;
12178 parser->local_variables_forbidden_p = true;
12179 /* Parse the assignment-expression. */
12181 = cp_parser_assignment_expression (parser, /*cast_p=*/false);
12182 /* Restore saved state. */
12183 parser->greater_than_is_operator_p
12184 = saved_greater_than_is_operator_p;
12185 parser->local_variables_forbidden_p
12186 = saved_local_variables_forbidden_p;
12188 if (!parser->default_arg_ok_p)
12190 if (!flag_pedantic_errors)
12191 warning (0, "deprecated use of default argument for parameter of non-function");
12194 error ("default arguments are only permitted for function parameters");
12195 default_argument = NULL_TREE;
12200 default_argument = NULL_TREE;
12202 return make_parameter_declarator (&decl_specifiers,
12207 /* Parse a function-body.
12210 compound_statement */
12213 cp_parser_function_body (cp_parser *parser)
12215 cp_parser_compound_statement (parser, NULL, false);
12218 /* Parse a ctor-initializer-opt followed by a function-body. Return
12219 true if a ctor-initializer was present. */
12222 cp_parser_ctor_initializer_opt_and_function_body (cp_parser *parser)
12225 bool ctor_initializer_p;
12227 /* Begin the function body. */
12228 body = begin_function_body ();
12229 /* Parse the optional ctor-initializer. */
12230 ctor_initializer_p = cp_parser_ctor_initializer_opt (parser);
12231 /* Parse the function-body. */
12232 cp_parser_function_body (parser);
12233 /* Finish the function body. */
12234 finish_function_body (body);
12236 return ctor_initializer_p;
12239 /* Parse an initializer.
12242 = initializer-clause
12243 ( expression-list )
12245 Returns an expression representing the initializer. If no
12246 initializer is present, NULL_TREE is returned.
12248 *IS_PARENTHESIZED_INIT is set to TRUE if the `( expression-list )'
12249 production is used, and zero otherwise. *IS_PARENTHESIZED_INIT is
12250 set to FALSE if there is no initializer present. If there is an
12251 initializer, and it is not a constant-expression, *NON_CONSTANT_P
12252 is set to true; otherwise it is set to false. */
12255 cp_parser_initializer (cp_parser* parser, bool* is_parenthesized_init,
12256 bool* non_constant_p)
12261 /* Peek at the next token. */
12262 token = cp_lexer_peek_token (parser->lexer);
12264 /* Let our caller know whether or not this initializer was
12266 *is_parenthesized_init = (token->type == CPP_OPEN_PAREN);
12267 /* Assume that the initializer is constant. */
12268 *non_constant_p = false;
12270 if (token->type == CPP_EQ)
12272 /* Consume the `='. */
12273 cp_lexer_consume_token (parser->lexer);
12274 /* Parse the initializer-clause. */
12275 init = cp_parser_initializer_clause (parser, non_constant_p);
12277 else if (token->type == CPP_OPEN_PAREN)
12278 init = cp_parser_parenthesized_expression_list (parser, false,
12283 /* Anything else is an error. */
12284 cp_parser_error (parser, "expected initializer");
12285 init = error_mark_node;
12291 /* Parse an initializer-clause.
12293 initializer-clause:
12294 assignment-expression
12295 { initializer-list , [opt] }
12298 Returns an expression representing the initializer.
12300 If the `assignment-expression' production is used the value
12301 returned is simply a representation for the expression.
12303 Otherwise, a CONSTRUCTOR is returned. The CONSTRUCTOR_ELTS will be
12304 the elements of the initializer-list (or NULL, if the last
12305 production is used). The TREE_TYPE for the CONSTRUCTOR will be
12306 NULL_TREE. There is no way to detect whether or not the optional
12307 trailing `,' was provided. NON_CONSTANT_P is as for
12308 cp_parser_initializer. */
12311 cp_parser_initializer_clause (cp_parser* parser, bool* non_constant_p)
12315 /* Assume the expression is constant. */
12316 *non_constant_p = false;
12318 /* If it is not a `{', then we are looking at an
12319 assignment-expression. */
12320 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
12323 = cp_parser_constant_expression (parser,
12324 /*allow_non_constant_p=*/true,
12326 if (!*non_constant_p)
12327 initializer = fold_non_dependent_expr (initializer);
12331 /* Consume the `{' token. */
12332 cp_lexer_consume_token (parser->lexer);
12333 /* Create a CONSTRUCTOR to represent the braced-initializer. */
12334 initializer = make_node (CONSTRUCTOR);
12335 /* If it's not a `}', then there is a non-trivial initializer. */
12336 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
12338 /* Parse the initializer list. */
12339 CONSTRUCTOR_ELTS (initializer)
12340 = cp_parser_initializer_list (parser, non_constant_p);
12341 /* A trailing `,' token is allowed. */
12342 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
12343 cp_lexer_consume_token (parser->lexer);
12345 /* Now, there should be a trailing `}'. */
12346 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
12349 return initializer;
12352 /* Parse an initializer-list.
12356 initializer-list , initializer-clause
12361 identifier : initializer-clause
12362 initializer-list, identifier : initializer-clause
12364 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
12365 for the initializer. If the INDEX of the elt is non-NULL, it is the
12366 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
12367 as for cp_parser_initializer. */
12369 static VEC(constructor_elt,gc) *
12370 cp_parser_initializer_list (cp_parser* parser, bool* non_constant_p)
12372 VEC(constructor_elt,gc) *v = NULL;
12374 /* Assume all of the expressions are constant. */
12375 *non_constant_p = false;
12377 /* Parse the rest of the list. */
12383 bool clause_non_constant_p;
12385 /* If the next token is an identifier and the following one is a
12386 colon, we are looking at the GNU designated-initializer
12388 if (cp_parser_allow_gnu_extensions_p (parser)
12389 && cp_lexer_next_token_is (parser->lexer, CPP_NAME)
12390 && cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_COLON)
12392 /* Consume the identifier. */
12393 identifier = cp_lexer_consume_token (parser->lexer)->value;
12394 /* Consume the `:'. */
12395 cp_lexer_consume_token (parser->lexer);
12398 identifier = NULL_TREE;
12400 /* Parse the initializer. */
12401 initializer = cp_parser_initializer_clause (parser,
12402 &clause_non_constant_p);
12403 /* If any clause is non-constant, so is the entire initializer. */
12404 if (clause_non_constant_p)
12405 *non_constant_p = true;
12407 /* Add it to the vector. */
12408 CONSTRUCTOR_APPEND_ELT(v, identifier, initializer);
12410 /* If the next token is not a comma, we have reached the end of
12412 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
12415 /* Peek at the next token. */
12416 token = cp_lexer_peek_nth_token (parser->lexer, 2);
12417 /* If the next token is a `}', then we're still done. An
12418 initializer-clause can have a trailing `,' after the
12419 initializer-list and before the closing `}'. */
12420 if (token->type == CPP_CLOSE_BRACE)
12423 /* Consume the `,' token. */
12424 cp_lexer_consume_token (parser->lexer);
12430 /* Classes [gram.class] */
12432 /* Parse a class-name.
12438 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
12439 to indicate that names looked up in dependent types should be
12440 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
12441 keyword has been used to indicate that the name that appears next
12442 is a template. TAG_TYPE indicates the explicit tag given before
12443 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
12444 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
12445 is the class being defined in a class-head.
12447 Returns the TYPE_DECL representing the class. */
12450 cp_parser_class_name (cp_parser *parser,
12451 bool typename_keyword_p,
12452 bool template_keyword_p,
12453 enum tag_types tag_type,
12454 bool check_dependency_p,
12456 bool is_declaration)
12463 /* All class-names start with an identifier. */
12464 token = cp_lexer_peek_token (parser->lexer);
12465 if (token->type != CPP_NAME && token->type != CPP_TEMPLATE_ID)
12467 cp_parser_error (parser, "expected class-name");
12468 return error_mark_node;
12471 /* PARSER->SCOPE can be cleared when parsing the template-arguments
12472 to a template-id, so we save it here. */
12473 scope = parser->scope;
12474 if (scope == error_mark_node)
12475 return error_mark_node;
12477 /* Any name names a type if we're following the `typename' keyword
12478 in a qualified name where the enclosing scope is type-dependent. */
12479 typename_p = (typename_keyword_p && scope && TYPE_P (scope)
12480 && dependent_type_p (scope));
12481 /* Handle the common case (an identifier, but not a template-id)
12483 if (token->type == CPP_NAME
12484 && !cp_parser_nth_token_starts_template_argument_list_p (parser, 2))
12488 /* Look for the identifier. */
12489 identifier = cp_parser_identifier (parser);
12490 /* If the next token isn't an identifier, we are certainly not
12491 looking at a class-name. */
12492 if (identifier == error_mark_node)
12493 decl = error_mark_node;
12494 /* If we know this is a type-name, there's no need to look it
12496 else if (typename_p)
12500 /* If the next token is a `::', then the name must be a type
12503 [basic.lookup.qual]
12505 During the lookup for a name preceding the :: scope
12506 resolution operator, object, function, and enumerator
12507 names are ignored. */
12508 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
12509 tag_type = typename_type;
12510 /* Look up the name. */
12511 decl = cp_parser_lookup_name (parser, identifier,
12513 /*is_template=*/false,
12514 /*is_namespace=*/false,
12515 check_dependency_p,
12516 /*ambiguous_p=*/NULL);
12521 /* Try a template-id. */
12522 decl = cp_parser_template_id (parser, template_keyword_p,
12523 check_dependency_p,
12525 if (decl == error_mark_node)
12526 return error_mark_node;
12529 decl = cp_parser_maybe_treat_template_as_class (decl, class_head_p);
12531 /* If this is a typename, create a TYPENAME_TYPE. */
12532 if (typename_p && decl != error_mark_node)
12534 decl = make_typename_type (scope, decl, typename_type, /*complain=*/1);
12535 if (decl != error_mark_node)
12536 decl = TYPE_NAME (decl);
12539 /* Check to see that it is really the name of a class. */
12540 if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
12541 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
12542 && cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
12543 /* Situations like this:
12545 template <typename T> struct A {
12546 typename T::template X<int>::I i;
12549 are problematic. Is `T::template X<int>' a class-name? The
12550 standard does not seem to be definitive, but there is no other
12551 valid interpretation of the following `::'. Therefore, those
12552 names are considered class-names. */
12553 decl = TYPE_NAME (make_typename_type (scope, decl, tag_type, tf_error));
12554 else if (decl == error_mark_node
12555 || TREE_CODE (decl) != TYPE_DECL
12556 || TREE_TYPE (decl) == error_mark_node
12557 || !IS_AGGR_TYPE (TREE_TYPE (decl)))
12559 cp_parser_error (parser, "expected class-name");
12560 return error_mark_node;
12566 /* Parse a class-specifier.
12569 class-head { member-specification [opt] }
12571 Returns the TREE_TYPE representing the class. */
12574 cp_parser_class_specifier (cp_parser* parser)
12578 tree attributes = NULL_TREE;
12579 int has_trailing_semicolon;
12580 bool nested_name_specifier_p;
12581 unsigned saved_num_template_parameter_lists;
12582 tree old_scope = NULL_TREE;
12583 tree scope = NULL_TREE;
12585 push_deferring_access_checks (dk_no_deferred);
12587 /* Parse the class-head. */
12588 type = cp_parser_class_head (parser,
12589 &nested_name_specifier_p,
12591 /* If the class-head was a semantic disaster, skip the entire body
12595 cp_parser_skip_to_end_of_block_or_statement (parser);
12596 pop_deferring_access_checks ();
12597 return error_mark_node;
12600 /* Look for the `{'. */
12601 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "`{'"))
12603 pop_deferring_access_checks ();
12604 return error_mark_node;
12607 /* Issue an error message if type-definitions are forbidden here. */
12608 cp_parser_check_type_definition (parser);
12609 /* Remember that we are defining one more class. */
12610 ++parser->num_classes_being_defined;
12611 /* Inside the class, surrounding template-parameter-lists do not
12613 saved_num_template_parameter_lists
12614 = parser->num_template_parameter_lists;
12615 parser->num_template_parameter_lists = 0;
12617 /* Start the class. */
12618 if (nested_name_specifier_p)
12620 scope = CP_DECL_CONTEXT (TYPE_MAIN_DECL (type));
12621 old_scope = push_inner_scope (scope);
12623 type = begin_class_definition (type);
12625 if (type == error_mark_node)
12626 /* If the type is erroneous, skip the entire body of the class. */
12627 cp_parser_skip_to_closing_brace (parser);
12629 /* Parse the member-specification. */
12630 cp_parser_member_specification_opt (parser);
12632 /* Look for the trailing `}'. */
12633 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
12634 /* We get better error messages by noticing a common problem: a
12635 missing trailing `;'. */
12636 token = cp_lexer_peek_token (parser->lexer);
12637 has_trailing_semicolon = (token->type == CPP_SEMICOLON);
12638 /* Look for trailing attributes to apply to this class. */
12639 if (cp_parser_allow_gnu_extensions_p (parser))
12641 tree sub_attr = cp_parser_attributes_opt (parser);
12642 attributes = chainon (attributes, sub_attr);
12644 if (type != error_mark_node)
12645 type = finish_struct (type, attributes);
12646 if (nested_name_specifier_p)
12647 pop_inner_scope (old_scope, scope);
12648 /* If this class is not itself within the scope of another class,
12649 then we need to parse the bodies of all of the queued function
12650 definitions. Note that the queued functions defined in a class
12651 are not always processed immediately following the
12652 class-specifier for that class. Consider:
12655 struct B { void f() { sizeof (A); } };
12658 If `f' were processed before the processing of `A' were
12659 completed, there would be no way to compute the size of `A'.
12660 Note that the nesting we are interested in here is lexical --
12661 not the semantic nesting given by TYPE_CONTEXT. In particular,
12664 struct A { struct B; };
12665 struct A::B { void f() { } };
12667 there is no need to delay the parsing of `A::B::f'. */
12668 if (--parser->num_classes_being_defined == 0)
12672 tree class_type = NULL_TREE;
12673 tree pushed_scope = NULL_TREE;
12675 /* In a first pass, parse default arguments to the functions.
12676 Then, in a second pass, parse the bodies of the functions.
12677 This two-phased approach handles cases like:
12685 for (TREE_PURPOSE (parser->unparsed_functions_queues)
12686 = nreverse (TREE_PURPOSE (parser->unparsed_functions_queues));
12687 (queue_entry = TREE_PURPOSE (parser->unparsed_functions_queues));
12688 TREE_PURPOSE (parser->unparsed_functions_queues)
12689 = TREE_CHAIN (TREE_PURPOSE (parser->unparsed_functions_queues)))
12691 fn = TREE_VALUE (queue_entry);
12692 /* If there are default arguments that have not yet been processed,
12693 take care of them now. */
12694 if (class_type != TREE_PURPOSE (queue_entry))
12697 pop_scope (pushed_scope);
12698 class_type = TREE_PURPOSE (queue_entry);
12699 pushed_scope = push_scope (class_type);
12701 /* Make sure that any template parameters are in scope. */
12702 maybe_begin_member_template_processing (fn);
12703 /* Parse the default argument expressions. */
12704 cp_parser_late_parsing_default_args (parser, fn);
12705 /* Remove any template parameters from the symbol table. */
12706 maybe_end_member_template_processing ();
12709 pop_scope (pushed_scope);
12710 /* Now parse the body of the functions. */
12711 for (TREE_VALUE (parser->unparsed_functions_queues)
12712 = nreverse (TREE_VALUE (parser->unparsed_functions_queues));
12713 (queue_entry = TREE_VALUE (parser->unparsed_functions_queues));
12714 TREE_VALUE (parser->unparsed_functions_queues)
12715 = TREE_CHAIN (TREE_VALUE (parser->unparsed_functions_queues)))
12717 /* Figure out which function we need to process. */
12718 fn = TREE_VALUE (queue_entry);
12719 /* Parse the function. */
12720 cp_parser_late_parsing_for_member (parser, fn);
12724 /* Put back any saved access checks. */
12725 pop_deferring_access_checks ();
12727 /* Restore the count of active template-parameter-lists. */
12728 parser->num_template_parameter_lists
12729 = saved_num_template_parameter_lists;
12734 /* Parse a class-head.
12737 class-key identifier [opt] base-clause [opt]
12738 class-key nested-name-specifier identifier base-clause [opt]
12739 class-key nested-name-specifier [opt] template-id
12743 class-key attributes identifier [opt] base-clause [opt]
12744 class-key attributes nested-name-specifier identifier base-clause [opt]
12745 class-key attributes nested-name-specifier [opt] template-id
12748 Returns the TYPE of the indicated class. Sets
12749 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
12750 involving a nested-name-specifier was used, and FALSE otherwise.
12752 Returns error_mark_node if this is not a class-head.
12754 Returns NULL_TREE if the class-head is syntactically valid, but
12755 semantically invalid in a way that means we should skip the entire
12756 body of the class. */
12759 cp_parser_class_head (cp_parser* parser,
12760 bool* nested_name_specifier_p,
12761 tree *attributes_p)
12763 tree nested_name_specifier;
12764 enum tag_types class_key;
12765 tree id = NULL_TREE;
12766 tree type = NULL_TREE;
12768 bool template_id_p = false;
12769 bool qualified_p = false;
12770 bool invalid_nested_name_p = false;
12771 bool invalid_explicit_specialization_p = false;
12772 tree pushed_scope = NULL_TREE;
12773 unsigned num_templates;
12776 /* Assume no nested-name-specifier will be present. */
12777 *nested_name_specifier_p = false;
12778 /* Assume no template parameter lists will be used in defining the
12782 /* Look for the class-key. */
12783 class_key = cp_parser_class_key (parser);
12784 if (class_key == none_type)
12785 return error_mark_node;
12787 /* Parse the attributes. */
12788 attributes = cp_parser_attributes_opt (parser);
12790 /* If the next token is `::', that is invalid -- but sometimes
12791 people do try to write:
12795 Handle this gracefully by accepting the extra qualifier, and then
12796 issuing an error about it later if this really is a
12797 class-head. If it turns out just to be an elaborated type
12798 specifier, remain silent. */
12799 if (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false))
12800 qualified_p = true;
12802 push_deferring_access_checks (dk_no_check);
12804 /* Determine the name of the class. Begin by looking for an
12805 optional nested-name-specifier. */
12806 nested_name_specifier
12807 = cp_parser_nested_name_specifier_opt (parser,
12808 /*typename_keyword_p=*/false,
12809 /*check_dependency_p=*/false,
12811 /*is_declaration=*/false);
12812 /* If there was a nested-name-specifier, then there *must* be an
12814 if (nested_name_specifier)
12816 /* Although the grammar says `identifier', it really means
12817 `class-name' or `template-name'. You are only allowed to
12818 define a class that has already been declared with this
12821 The proposed resolution for Core Issue 180 says that whever
12822 you see `class T::X' you should treat `X' as a type-name.
12824 It is OK to define an inaccessible class; for example:
12826 class A { class B; };
12829 We do not know if we will see a class-name, or a
12830 template-name. We look for a class-name first, in case the
12831 class-name is a template-id; if we looked for the
12832 template-name first we would stop after the template-name. */
12833 cp_parser_parse_tentatively (parser);
12834 type = cp_parser_class_name (parser,
12835 /*typename_keyword_p=*/false,
12836 /*template_keyword_p=*/false,
12838 /*check_dependency_p=*/false,
12839 /*class_head_p=*/true,
12840 /*is_declaration=*/false);
12841 /* If that didn't work, ignore the nested-name-specifier. */
12842 if (!cp_parser_parse_definitely (parser))
12844 invalid_nested_name_p = true;
12845 id = cp_parser_identifier (parser);
12846 if (id == error_mark_node)
12849 /* If we could not find a corresponding TYPE, treat this
12850 declaration like an unqualified declaration. */
12851 if (type == error_mark_node)
12852 nested_name_specifier = NULL_TREE;
12853 /* Otherwise, count the number of templates used in TYPE and its
12854 containing scopes. */
12859 for (scope = TREE_TYPE (type);
12860 scope && TREE_CODE (scope) != NAMESPACE_DECL;
12861 scope = (TYPE_P (scope)
12862 ? TYPE_CONTEXT (scope)
12863 : DECL_CONTEXT (scope)))
12865 && CLASS_TYPE_P (scope)
12866 && CLASSTYPE_TEMPLATE_INFO (scope)
12867 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope))
12868 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (scope))
12872 /* Otherwise, the identifier is optional. */
12875 /* We don't know whether what comes next is a template-id,
12876 an identifier, or nothing at all. */
12877 cp_parser_parse_tentatively (parser);
12878 /* Check for a template-id. */
12879 id = cp_parser_template_id (parser,
12880 /*template_keyword_p=*/false,
12881 /*check_dependency_p=*/true,
12882 /*is_declaration=*/true);
12883 /* If that didn't work, it could still be an identifier. */
12884 if (!cp_parser_parse_definitely (parser))
12886 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
12887 id = cp_parser_identifier (parser);
12893 template_id_p = true;
12898 pop_deferring_access_checks ();
12901 cp_parser_check_for_invalid_template_id (parser, id);
12903 /* If it's not a `:' or a `{' then we can't really be looking at a
12904 class-head, since a class-head only appears as part of a
12905 class-specifier. We have to detect this situation before calling
12906 xref_tag, since that has irreversible side-effects. */
12907 if (!cp_parser_next_token_starts_class_definition_p (parser))
12909 cp_parser_error (parser, "expected %<{%> or %<:%>");
12910 return error_mark_node;
12913 /* At this point, we're going ahead with the class-specifier, even
12914 if some other problem occurs. */
12915 cp_parser_commit_to_tentative_parse (parser);
12916 /* Issue the error about the overly-qualified name now. */
12918 cp_parser_error (parser,
12919 "global qualification of class name is invalid");
12920 else if (invalid_nested_name_p)
12921 cp_parser_error (parser,
12922 "qualified name does not name a class");
12923 else if (nested_name_specifier)
12927 /* Reject typedef-names in class heads. */
12928 if (!DECL_IMPLICIT_TYPEDEF_P (type))
12930 error ("invalid class name in declaration of %qD", type);
12935 /* Figure out in what scope the declaration is being placed. */
12936 scope = current_scope ();
12937 /* If that scope does not contain the scope in which the
12938 class was originally declared, the program is invalid. */
12939 if (scope && !is_ancestor (scope, nested_name_specifier))
12941 error ("declaration of %qD in %qD which does not enclose %qD",
12942 type, scope, nested_name_specifier);
12948 A declarator-id shall not be qualified exception of the
12949 definition of a ... nested class outside of its class
12950 ... [or] a the definition or explicit instantiation of a
12951 class member of a namespace outside of its namespace. */
12952 if (scope == nested_name_specifier)
12954 pedwarn ("extra qualification ignored");
12955 nested_name_specifier = NULL_TREE;
12959 /* An explicit-specialization must be preceded by "template <>". If
12960 it is not, try to recover gracefully. */
12961 if (at_namespace_scope_p ()
12962 && parser->num_template_parameter_lists == 0
12965 error ("an explicit specialization must be preceded by %<template <>%>");
12966 invalid_explicit_specialization_p = true;
12967 /* Take the same action that would have been taken by
12968 cp_parser_explicit_specialization. */
12969 ++parser->num_template_parameter_lists;
12970 begin_specialization ();
12972 /* There must be no "return" statements between this point and the
12973 end of this function; set "type "to the correct return value and
12974 use "goto done;" to return. */
12975 /* Make sure that the right number of template parameters were
12977 if (!cp_parser_check_template_parameters (parser, num_templates))
12979 /* If something went wrong, there is no point in even trying to
12980 process the class-definition. */
12985 /* Look up the type. */
12988 type = TREE_TYPE (id);
12989 maybe_process_partial_specialization (type);
12990 if (nested_name_specifier)
12991 pushed_scope = push_scope (nested_name_specifier);
12993 else if (nested_name_specifier)
12999 template <typename T> struct S { struct T };
13000 template <typename T> struct S<T>::T { };
13002 we will get a TYPENAME_TYPE when processing the definition of
13003 `S::T'. We need to resolve it to the actual type before we
13004 try to define it. */
13005 if (TREE_CODE (TREE_TYPE (type)) == TYPENAME_TYPE)
13007 class_type = resolve_typename_type (TREE_TYPE (type),
13008 /*only_current_p=*/false);
13009 if (class_type != error_mark_node)
13010 type = TYPE_NAME (class_type);
13013 cp_parser_error (parser, "could not resolve typename type");
13014 type = error_mark_node;
13018 maybe_process_partial_specialization (TREE_TYPE (type));
13019 class_type = current_class_type;
13020 /* Enter the scope indicated by the nested-name-specifier. */
13021 pushed_scope = push_scope (nested_name_specifier);
13022 /* Get the canonical version of this type. */
13023 type = TYPE_MAIN_DECL (TREE_TYPE (type));
13024 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
13025 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (type)))
13027 type = push_template_decl (type);
13028 if (type == error_mark_node)
13035 type = TREE_TYPE (type);
13036 *nested_name_specifier_p = true;
13038 else /* The name is not a nested name. */
13040 /* If the class was unnamed, create a dummy name. */
13042 id = make_anon_name ();
13043 type = xref_tag (class_key, id, /*tag_scope=*/ts_current,
13044 parser->num_template_parameter_lists);
13047 /* Indicate whether this class was declared as a `class' or as a
13049 if (TREE_CODE (type) == RECORD_TYPE)
13050 CLASSTYPE_DECLARED_CLASS (type) = (class_key == class_type);
13051 cp_parser_check_class_key (class_key, type);
13053 /* If this type was already complete, and we see another definition,
13054 that's an error. */
13055 if (type != error_mark_node && COMPLETE_TYPE_P (type))
13057 error ("redefinition of %q#T", type);
13058 error ("previous definition of %q+#T", type);
13063 /* We will have entered the scope containing the class; the names of
13064 base classes should be looked up in that context. For example:
13066 struct A { struct B {}; struct C; };
13067 struct A::C : B {};
13072 /* Get the list of base-classes, if there is one. */
13073 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
13074 bases = cp_parser_base_clause (parser);
13076 /* Process the base classes. */
13077 xref_basetypes (type, bases);
13080 /* Leave the scope given by the nested-name-specifier. We will
13081 enter the class scope itself while processing the members. */
13083 pop_scope (pushed_scope);
13085 if (invalid_explicit_specialization_p)
13087 end_specialization ();
13088 --parser->num_template_parameter_lists;
13090 *attributes_p = attributes;
13094 /* Parse a class-key.
13101 Returns the kind of class-key specified, or none_type to indicate
13104 static enum tag_types
13105 cp_parser_class_key (cp_parser* parser)
13108 enum tag_types tag_type;
13110 /* Look for the class-key. */
13111 token = cp_parser_require (parser, CPP_KEYWORD, "class-key");
13115 /* Check to see if the TOKEN is a class-key. */
13116 tag_type = cp_parser_token_is_class_key (token);
13118 cp_parser_error (parser, "expected class-key");
13122 /* Parse an (optional) member-specification.
13124 member-specification:
13125 member-declaration member-specification [opt]
13126 access-specifier : member-specification [opt] */
13129 cp_parser_member_specification_opt (cp_parser* parser)
13136 /* Peek at the next token. */
13137 token = cp_lexer_peek_token (parser->lexer);
13138 /* If it's a `}', or EOF then we've seen all the members. */
13139 if (token->type == CPP_CLOSE_BRACE || token->type == CPP_EOF)
13142 /* See if this token is a keyword. */
13143 keyword = token->keyword;
13147 case RID_PROTECTED:
13149 /* Consume the access-specifier. */
13150 cp_lexer_consume_token (parser->lexer);
13151 /* Remember which access-specifier is active. */
13152 current_access_specifier = token->value;
13153 /* Look for the `:'. */
13154 cp_parser_require (parser, CPP_COLON, "`:'");
13158 /* Accept #pragmas at class scope. */
13159 if (token->type == CPP_PRAGMA)
13161 cp_lexer_handle_pragma (parser->lexer);
13165 /* Otherwise, the next construction must be a
13166 member-declaration. */
13167 cp_parser_member_declaration (parser);
13172 /* Parse a member-declaration.
13174 member-declaration:
13175 decl-specifier-seq [opt] member-declarator-list [opt] ;
13176 function-definition ; [opt]
13177 :: [opt] nested-name-specifier template [opt] unqualified-id ;
13179 template-declaration
13181 member-declarator-list:
13183 member-declarator-list , member-declarator
13186 declarator pure-specifier [opt]
13187 declarator constant-initializer [opt]
13188 identifier [opt] : constant-expression
13192 member-declaration:
13193 __extension__ member-declaration
13196 declarator attributes [opt] pure-specifier [opt]
13197 declarator attributes [opt] constant-initializer [opt]
13198 identifier [opt] attributes [opt] : constant-expression */
13201 cp_parser_member_declaration (cp_parser* parser)
13203 cp_decl_specifier_seq decl_specifiers;
13204 tree prefix_attributes;
13206 int declares_class_or_enum;
13209 int saved_pedantic;
13211 /* Check for the `__extension__' keyword. */
13212 if (cp_parser_extension_opt (parser, &saved_pedantic))
13215 cp_parser_member_declaration (parser);
13216 /* Restore the old value of the PEDANTIC flag. */
13217 pedantic = saved_pedantic;
13222 /* Check for a template-declaration. */
13223 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
13225 /* Parse the template-declaration. */
13226 cp_parser_template_declaration (parser, /*member_p=*/true);
13231 /* Check for a using-declaration. */
13232 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_USING))
13234 /* Parse the using-declaration. */
13235 cp_parser_using_declaration (parser);
13240 /* Check for @defs. */
13241 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_DEFS))
13244 tree ivar_chains = cp_parser_objc_defs_expression (parser);
13245 ivar = ivar_chains;
13249 ivar = TREE_CHAIN (member);
13250 TREE_CHAIN (member) = NULL_TREE;
13251 finish_member_declaration (member);
13256 /* Parse the decl-specifier-seq. */
13257 cp_parser_decl_specifier_seq (parser,
13258 CP_PARSER_FLAGS_OPTIONAL,
13260 &declares_class_or_enum);
13261 prefix_attributes = decl_specifiers.attributes;
13262 decl_specifiers.attributes = NULL_TREE;
13263 /* Check for an invalid type-name. */
13264 if (!decl_specifiers.type
13265 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
13267 /* If there is no declarator, then the decl-specifier-seq should
13269 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
13271 /* If there was no decl-specifier-seq, and the next token is a
13272 `;', then we have something like:
13278 Each member-declaration shall declare at least one member
13279 name of the class. */
13280 if (!decl_specifiers.any_specifiers_p)
13282 cp_token *token = cp_lexer_peek_token (parser->lexer);
13283 if (pedantic && !token->in_system_header)
13284 pedwarn ("%Hextra %<;%>", &token->location);
13290 /* See if this declaration is a friend. */
13291 friend_p = cp_parser_friend_p (&decl_specifiers);
13292 /* If there were decl-specifiers, check to see if there was
13293 a class-declaration. */
13294 type = check_tag_decl (&decl_specifiers);
13295 /* Nested classes have already been added to the class, but
13296 a `friend' needs to be explicitly registered. */
13299 /* If the `friend' keyword was present, the friend must
13300 be introduced with a class-key. */
13301 if (!declares_class_or_enum)
13302 error ("a class-key must be used when declaring a friend");
13305 template <typename T> struct A {
13306 friend struct A<T>::B;
13309 A<T>::B will be represented by a TYPENAME_TYPE, and
13310 therefore not recognized by check_tag_decl. */
13312 && decl_specifiers.type
13313 && TYPE_P (decl_specifiers.type))
13314 type = decl_specifiers.type;
13315 if (!type || !TYPE_P (type))
13316 error ("friend declaration does not name a class or "
13319 make_friend_class (current_class_type, type,
13320 /*complain=*/true);
13322 /* If there is no TYPE, an error message will already have
13324 else if (!type || type == error_mark_node)
13326 /* An anonymous aggregate has to be handled specially; such
13327 a declaration really declares a data member (with a
13328 particular type), as opposed to a nested class. */
13329 else if (ANON_AGGR_TYPE_P (type))
13331 /* Remove constructors and such from TYPE, now that we
13332 know it is an anonymous aggregate. */
13333 fixup_anonymous_aggr (type);
13334 /* And make the corresponding data member. */
13335 decl = build_decl (FIELD_DECL, NULL_TREE, type);
13336 /* Add it to the class. */
13337 finish_member_declaration (decl);
13340 cp_parser_check_access_in_redeclaration (TYPE_NAME (type));
13345 /* See if these declarations will be friends. */
13346 friend_p = cp_parser_friend_p (&decl_specifiers);
13348 /* Keep going until we hit the `;' at the end of the
13350 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
13352 tree attributes = NULL_TREE;
13353 tree first_attribute;
13355 /* Peek at the next token. */
13356 token = cp_lexer_peek_token (parser->lexer);
13358 /* Check for a bitfield declaration. */
13359 if (token->type == CPP_COLON
13360 || (token->type == CPP_NAME
13361 && cp_lexer_peek_nth_token (parser->lexer, 2)->type
13367 /* Get the name of the bitfield. Note that we cannot just
13368 check TOKEN here because it may have been invalidated by
13369 the call to cp_lexer_peek_nth_token above. */
13370 if (cp_lexer_peek_token (parser->lexer)->type != CPP_COLON)
13371 identifier = cp_parser_identifier (parser);
13373 identifier = NULL_TREE;
13375 /* Consume the `:' token. */
13376 cp_lexer_consume_token (parser->lexer);
13377 /* Get the width of the bitfield. */
13379 = cp_parser_constant_expression (parser,
13380 /*allow_non_constant=*/false,
13383 /* Look for attributes that apply to the bitfield. */
13384 attributes = cp_parser_attributes_opt (parser);
13385 /* Remember which attributes are prefix attributes and
13387 first_attribute = attributes;
13388 /* Combine the attributes. */
13389 attributes = chainon (prefix_attributes, attributes);
13391 /* Create the bitfield declaration. */
13392 decl = grokbitfield (identifier
13393 ? make_id_declarator (NULL_TREE,
13398 /* Apply the attributes. */
13399 cplus_decl_attributes (&decl, attributes, /*flags=*/0);
13403 cp_declarator *declarator;
13405 tree asm_specification;
13406 int ctor_dtor_or_conv_p;
13408 /* Parse the declarator. */
13410 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
13411 &ctor_dtor_or_conv_p,
13412 /*parenthesized_p=*/NULL,
13413 /*member_p=*/true);
13415 /* If something went wrong parsing the declarator, make sure
13416 that we at least consume some tokens. */
13417 if (declarator == cp_error_declarator)
13419 /* Skip to the end of the statement. */
13420 cp_parser_skip_to_end_of_statement (parser);
13421 /* If the next token is not a semicolon, that is
13422 probably because we just skipped over the body of
13423 a function. So, we consume a semicolon if
13424 present, but do not issue an error message if it
13426 if (cp_lexer_next_token_is (parser->lexer,
13428 cp_lexer_consume_token (parser->lexer);
13432 if (declares_class_or_enum & 2)
13433 cp_parser_check_for_definition_in_return_type
13434 (declarator, decl_specifiers.type);
13436 /* Look for an asm-specification. */
13437 asm_specification = cp_parser_asm_specification_opt (parser);
13438 /* Look for attributes that apply to the declaration. */
13439 attributes = cp_parser_attributes_opt (parser);
13440 /* Remember which attributes are prefix attributes and
13442 first_attribute = attributes;
13443 /* Combine the attributes. */
13444 attributes = chainon (prefix_attributes, attributes);
13446 /* If it's an `=', then we have a constant-initializer or a
13447 pure-specifier. It is not correct to parse the
13448 initializer before registering the member declaration
13449 since the member declaration should be in scope while
13450 its initializer is processed. However, the rest of the
13451 front end does not yet provide an interface that allows
13452 us to handle this correctly. */
13453 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
13457 A pure-specifier shall be used only in the declaration of
13458 a virtual function.
13460 A member-declarator can contain a constant-initializer
13461 only if it declares a static member of integral or
13464 Therefore, if the DECLARATOR is for a function, we look
13465 for a pure-specifier; otherwise, we look for a
13466 constant-initializer. When we call `grokfield', it will
13467 perform more stringent semantics checks. */
13468 if (declarator->kind == cdk_function)
13469 initializer = cp_parser_pure_specifier (parser);
13471 /* Parse the initializer. */
13472 initializer = cp_parser_constant_initializer (parser);
13474 /* Otherwise, there is no initializer. */
13476 initializer = NULL_TREE;
13478 /* See if we are probably looking at a function
13479 definition. We are certainly not looking at a
13480 member-declarator. Calling `grokfield' has
13481 side-effects, so we must not do it unless we are sure
13482 that we are looking at a member-declarator. */
13483 if (cp_parser_token_starts_function_definition_p
13484 (cp_lexer_peek_token (parser->lexer)))
13486 /* The grammar does not allow a pure-specifier to be
13487 used when a member function is defined. (It is
13488 possible that this fact is an oversight in the
13489 standard, since a pure function may be defined
13490 outside of the class-specifier. */
13492 error ("pure-specifier on function-definition");
13493 decl = cp_parser_save_member_function_body (parser,
13497 /* If the member was not a friend, declare it here. */
13499 finish_member_declaration (decl);
13500 /* Peek at the next token. */
13501 token = cp_lexer_peek_token (parser->lexer);
13502 /* If the next token is a semicolon, consume it. */
13503 if (token->type == CPP_SEMICOLON)
13504 cp_lexer_consume_token (parser->lexer);
13509 /* Create the declaration. */
13510 decl = grokfield (declarator, &decl_specifiers,
13511 initializer, asm_specification,
13513 /* Any initialization must have been from a
13514 constant-expression. */
13515 if (decl && TREE_CODE (decl) == VAR_DECL && initializer)
13516 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = 1;
13520 /* Reset PREFIX_ATTRIBUTES. */
13521 while (attributes && TREE_CHAIN (attributes) != first_attribute)
13522 attributes = TREE_CHAIN (attributes);
13524 TREE_CHAIN (attributes) = NULL_TREE;
13526 /* If there is any qualification still in effect, clear it
13527 now; we will be starting fresh with the next declarator. */
13528 parser->scope = NULL_TREE;
13529 parser->qualifying_scope = NULL_TREE;
13530 parser->object_scope = NULL_TREE;
13531 /* If it's a `,', then there are more declarators. */
13532 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
13533 cp_lexer_consume_token (parser->lexer);
13534 /* If the next token isn't a `;', then we have a parse error. */
13535 else if (cp_lexer_next_token_is_not (parser->lexer,
13538 cp_parser_error (parser, "expected %<;%>");
13539 /* Skip tokens until we find a `;'. */
13540 cp_parser_skip_to_end_of_statement (parser);
13547 /* Add DECL to the list of members. */
13549 finish_member_declaration (decl);
13551 if (TREE_CODE (decl) == FUNCTION_DECL)
13552 cp_parser_save_default_args (parser, decl);
13557 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
13560 /* Parse a pure-specifier.
13565 Returns INTEGER_ZERO_NODE if a pure specifier is found.
13566 Otherwise, ERROR_MARK_NODE is returned. */
13569 cp_parser_pure_specifier (cp_parser* parser)
13573 /* Look for the `=' token. */
13574 if (!cp_parser_require (parser, CPP_EQ, "`='"))
13575 return error_mark_node;
13576 /* Look for the `0' token. */
13577 token = cp_lexer_consume_token (parser->lexer);
13578 if (token->type != CPP_NUMBER || !integer_zerop (token->value))
13580 cp_parser_error (parser,
13581 "invalid pure specifier (only `= 0' is allowed)");
13582 cp_parser_skip_to_end_of_statement (parser);
13583 return error_mark_node;
13586 /* FIXME: Unfortunately, this will accept `0L' and `0x00' as well.
13587 We need to get information from the lexer about how the number
13588 was spelled in order to fix this problem. */
13589 return integer_zero_node;
13592 /* Parse a constant-initializer.
13594 constant-initializer:
13595 = constant-expression
13597 Returns a representation of the constant-expression. */
13600 cp_parser_constant_initializer (cp_parser* parser)
13602 /* Look for the `=' token. */
13603 if (!cp_parser_require (parser, CPP_EQ, "`='"))
13604 return error_mark_node;
13606 /* It is invalid to write:
13608 struct S { static const int i = { 7 }; };
13611 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
13613 cp_parser_error (parser,
13614 "a brace-enclosed initializer is not allowed here");
13615 /* Consume the opening brace. */
13616 cp_lexer_consume_token (parser->lexer);
13617 /* Skip the initializer. */
13618 cp_parser_skip_to_closing_brace (parser);
13619 /* Look for the trailing `}'. */
13620 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
13622 return error_mark_node;
13625 return cp_parser_constant_expression (parser,
13626 /*allow_non_constant=*/false,
13630 /* Derived classes [gram.class.derived] */
13632 /* Parse a base-clause.
13635 : base-specifier-list
13637 base-specifier-list:
13639 base-specifier-list , base-specifier
13641 Returns a TREE_LIST representing the base-classes, in the order in
13642 which they were declared. The representation of each node is as
13643 described by cp_parser_base_specifier.
13645 In the case that no bases are specified, this function will return
13646 NULL_TREE, not ERROR_MARK_NODE. */
13649 cp_parser_base_clause (cp_parser* parser)
13651 tree bases = NULL_TREE;
13653 /* Look for the `:' that begins the list. */
13654 cp_parser_require (parser, CPP_COLON, "`:'");
13656 /* Scan the base-specifier-list. */
13662 /* Look for the base-specifier. */
13663 base = cp_parser_base_specifier (parser);
13664 /* Add BASE to the front of the list. */
13665 if (base != error_mark_node)
13667 TREE_CHAIN (base) = bases;
13670 /* Peek at the next token. */
13671 token = cp_lexer_peek_token (parser->lexer);
13672 /* If it's not a comma, then the list is complete. */
13673 if (token->type != CPP_COMMA)
13675 /* Consume the `,'. */
13676 cp_lexer_consume_token (parser->lexer);
13679 /* PARSER->SCOPE may still be non-NULL at this point, if the last
13680 base class had a qualified name. However, the next name that
13681 appears is certainly not qualified. */
13682 parser->scope = NULL_TREE;
13683 parser->qualifying_scope = NULL_TREE;
13684 parser->object_scope = NULL_TREE;
13686 return nreverse (bases);
13689 /* Parse a base-specifier.
13692 :: [opt] nested-name-specifier [opt] class-name
13693 virtual access-specifier [opt] :: [opt] nested-name-specifier
13695 access-specifier virtual [opt] :: [opt] nested-name-specifier
13698 Returns a TREE_LIST. The TREE_PURPOSE will be one of
13699 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
13700 indicate the specifiers provided. The TREE_VALUE will be a TYPE
13701 (or the ERROR_MARK_NODE) indicating the type that was specified. */
13704 cp_parser_base_specifier (cp_parser* parser)
13708 bool virtual_p = false;
13709 bool duplicate_virtual_error_issued_p = false;
13710 bool duplicate_access_error_issued_p = false;
13711 bool class_scope_p, template_p;
13712 tree access = access_default_node;
13715 /* Process the optional `virtual' and `access-specifier'. */
13718 /* Peek at the next token. */
13719 token = cp_lexer_peek_token (parser->lexer);
13720 /* Process `virtual'. */
13721 switch (token->keyword)
13724 /* If `virtual' appears more than once, issue an error. */
13725 if (virtual_p && !duplicate_virtual_error_issued_p)
13727 cp_parser_error (parser,
13728 "%<virtual%> specified more than once in base-specified");
13729 duplicate_virtual_error_issued_p = true;
13734 /* Consume the `virtual' token. */
13735 cp_lexer_consume_token (parser->lexer);
13740 case RID_PROTECTED:
13742 /* If more than one access specifier appears, issue an
13744 if (access != access_default_node
13745 && !duplicate_access_error_issued_p)
13747 cp_parser_error (parser,
13748 "more than one access specifier in base-specified");
13749 duplicate_access_error_issued_p = true;
13752 access = ridpointers[(int) token->keyword];
13754 /* Consume the access-specifier. */
13755 cp_lexer_consume_token (parser->lexer);
13764 /* It is not uncommon to see programs mechanically, erroneously, use
13765 the 'typename' keyword to denote (dependent) qualified types
13766 as base classes. */
13767 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
13769 if (!processing_template_decl)
13770 error ("keyword %<typename%> not allowed outside of templates");
13772 error ("keyword %<typename%> not allowed in this context "
13773 "(the base class is implicitly a type)");
13774 cp_lexer_consume_token (parser->lexer);
13777 /* Look for the optional `::' operator. */
13778 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
13779 /* Look for the nested-name-specifier. The simplest way to
13784 The keyword `typename' is not permitted in a base-specifier or
13785 mem-initializer; in these contexts a qualified name that
13786 depends on a template-parameter is implicitly assumed to be a
13789 is to pretend that we have seen the `typename' keyword at this
13791 cp_parser_nested_name_specifier_opt (parser,
13792 /*typename_keyword_p=*/true,
13793 /*check_dependency_p=*/true,
13795 /*is_declaration=*/true);
13796 /* If the base class is given by a qualified name, assume that names
13797 we see are type names or templates, as appropriate. */
13798 class_scope_p = (parser->scope && TYPE_P (parser->scope));
13799 template_p = class_scope_p && cp_parser_optional_template_keyword (parser);
13801 /* Finally, look for the class-name. */
13802 type = cp_parser_class_name (parser,
13806 /*check_dependency_p=*/true,
13807 /*class_head_p=*/false,
13808 /*is_declaration=*/true);
13810 if (type == error_mark_node)
13811 return error_mark_node;
13813 return finish_base_specifier (TREE_TYPE (type), access, virtual_p);
13816 /* Exception handling [gram.exception] */
13818 /* Parse an (optional) exception-specification.
13820 exception-specification:
13821 throw ( type-id-list [opt] )
13823 Returns a TREE_LIST representing the exception-specification. The
13824 TREE_VALUE of each node is a type. */
13827 cp_parser_exception_specification_opt (cp_parser* parser)
13832 /* Peek at the next token. */
13833 token = cp_lexer_peek_token (parser->lexer);
13834 /* If it's not `throw', then there's no exception-specification. */
13835 if (!cp_parser_is_keyword (token, RID_THROW))
13838 /* Consume the `throw'. */
13839 cp_lexer_consume_token (parser->lexer);
13841 /* Look for the `('. */
13842 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13844 /* Peek at the next token. */
13845 token = cp_lexer_peek_token (parser->lexer);
13846 /* If it's not a `)', then there is a type-id-list. */
13847 if (token->type != CPP_CLOSE_PAREN)
13849 const char *saved_message;
13851 /* Types may not be defined in an exception-specification. */
13852 saved_message = parser->type_definition_forbidden_message;
13853 parser->type_definition_forbidden_message
13854 = "types may not be defined in an exception-specification";
13855 /* Parse the type-id-list. */
13856 type_id_list = cp_parser_type_id_list (parser);
13857 /* Restore the saved message. */
13858 parser->type_definition_forbidden_message = saved_message;
13861 type_id_list = empty_except_spec;
13863 /* Look for the `)'. */
13864 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13866 return type_id_list;
13869 /* Parse an (optional) type-id-list.
13873 type-id-list , type-id
13875 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
13876 in the order that the types were presented. */
13879 cp_parser_type_id_list (cp_parser* parser)
13881 tree types = NULL_TREE;
13888 /* Get the next type-id. */
13889 type = cp_parser_type_id (parser);
13890 /* Add it to the list. */
13891 types = add_exception_specifier (types, type, /*complain=*/1);
13892 /* Peek at the next token. */
13893 token = cp_lexer_peek_token (parser->lexer);
13894 /* If it is not a `,', we are done. */
13895 if (token->type != CPP_COMMA)
13897 /* Consume the `,'. */
13898 cp_lexer_consume_token (parser->lexer);
13901 return nreverse (types);
13904 /* Parse a try-block.
13907 try compound-statement handler-seq */
13910 cp_parser_try_block (cp_parser* parser)
13914 cp_parser_require_keyword (parser, RID_TRY, "`try'");
13915 try_block = begin_try_block ();
13916 cp_parser_compound_statement (parser, NULL, true);
13917 finish_try_block (try_block);
13918 cp_parser_handler_seq (parser);
13919 finish_handler_sequence (try_block);
13924 /* Parse a function-try-block.
13926 function-try-block:
13927 try ctor-initializer [opt] function-body handler-seq */
13930 cp_parser_function_try_block (cp_parser* parser)
13933 bool ctor_initializer_p;
13935 /* Look for the `try' keyword. */
13936 if (!cp_parser_require_keyword (parser, RID_TRY, "`try'"))
13938 /* Let the rest of the front-end know where we are. */
13939 try_block = begin_function_try_block ();
13940 /* Parse the function-body. */
13942 = cp_parser_ctor_initializer_opt_and_function_body (parser);
13943 /* We're done with the `try' part. */
13944 finish_function_try_block (try_block);
13945 /* Parse the handlers. */
13946 cp_parser_handler_seq (parser);
13947 /* We're done with the handlers. */
13948 finish_function_handler_sequence (try_block);
13950 return ctor_initializer_p;
13953 /* Parse a handler-seq.
13956 handler handler-seq [opt] */
13959 cp_parser_handler_seq (cp_parser* parser)
13965 /* Parse the handler. */
13966 cp_parser_handler (parser);
13967 /* Peek at the next token. */
13968 token = cp_lexer_peek_token (parser->lexer);
13969 /* If it's not `catch' then there are no more handlers. */
13970 if (!cp_parser_is_keyword (token, RID_CATCH))
13975 /* Parse a handler.
13978 catch ( exception-declaration ) compound-statement */
13981 cp_parser_handler (cp_parser* parser)
13986 cp_parser_require_keyword (parser, RID_CATCH, "`catch'");
13987 handler = begin_handler ();
13988 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13989 declaration = cp_parser_exception_declaration (parser);
13990 finish_handler_parms (declaration, handler);
13991 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13992 cp_parser_compound_statement (parser, NULL, false);
13993 finish_handler (handler);
13996 /* Parse an exception-declaration.
13998 exception-declaration:
13999 type-specifier-seq declarator
14000 type-specifier-seq abstract-declarator
14004 Returns a VAR_DECL for the declaration, or NULL_TREE if the
14005 ellipsis variant is used. */
14008 cp_parser_exception_declaration (cp_parser* parser)
14011 cp_decl_specifier_seq type_specifiers;
14012 cp_declarator *declarator;
14013 const char *saved_message;
14015 /* If it's an ellipsis, it's easy to handle. */
14016 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
14018 /* Consume the `...' token. */
14019 cp_lexer_consume_token (parser->lexer);
14023 /* Types may not be defined in exception-declarations. */
14024 saved_message = parser->type_definition_forbidden_message;
14025 parser->type_definition_forbidden_message
14026 = "types may not be defined in exception-declarations";
14028 /* Parse the type-specifier-seq. */
14029 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
14031 /* If it's a `)', then there is no declarator. */
14032 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN))
14035 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_EITHER,
14036 /*ctor_dtor_or_conv_p=*/NULL,
14037 /*parenthesized_p=*/NULL,
14038 /*member_p=*/false);
14040 /* Restore the saved message. */
14041 parser->type_definition_forbidden_message = saved_message;
14043 if (type_specifiers.any_specifiers_p)
14045 decl = grokdeclarator (declarator, &type_specifiers, CATCHPARM, 1, NULL);
14046 if (decl == NULL_TREE)
14047 error ("invalid catch parameter");
14055 /* Parse a throw-expression.
14058 throw assignment-expression [opt]
14060 Returns a THROW_EXPR representing the throw-expression. */
14063 cp_parser_throw_expression (cp_parser* parser)
14068 cp_parser_require_keyword (parser, RID_THROW, "`throw'");
14069 token = cp_lexer_peek_token (parser->lexer);
14070 /* Figure out whether or not there is an assignment-expression
14071 following the "throw" keyword. */
14072 if (token->type == CPP_COMMA
14073 || token->type == CPP_SEMICOLON
14074 || token->type == CPP_CLOSE_PAREN
14075 || token->type == CPP_CLOSE_SQUARE
14076 || token->type == CPP_CLOSE_BRACE
14077 || token->type == CPP_COLON)
14078 expression = NULL_TREE;
14080 expression = cp_parser_assignment_expression (parser,
14083 return build_throw (expression);
14086 /* GNU Extensions */
14088 /* Parse an (optional) asm-specification.
14091 asm ( string-literal )
14093 If the asm-specification is present, returns a STRING_CST
14094 corresponding to the string-literal. Otherwise, returns
14098 cp_parser_asm_specification_opt (cp_parser* parser)
14101 tree asm_specification;
14103 /* Peek at the next token. */
14104 token = cp_lexer_peek_token (parser->lexer);
14105 /* If the next token isn't the `asm' keyword, then there's no
14106 asm-specification. */
14107 if (!cp_parser_is_keyword (token, RID_ASM))
14110 /* Consume the `asm' token. */
14111 cp_lexer_consume_token (parser->lexer);
14112 /* Look for the `('. */
14113 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14115 /* Look for the string-literal. */
14116 asm_specification = cp_parser_string_literal (parser, false, false);
14118 /* Look for the `)'. */
14119 cp_parser_require (parser, CPP_CLOSE_PAREN, "`('");
14121 return asm_specification;
14124 /* Parse an asm-operand-list.
14128 asm-operand-list , asm-operand
14131 string-literal ( expression )
14132 [ string-literal ] string-literal ( expression )
14134 Returns a TREE_LIST representing the operands. The TREE_VALUE of
14135 each node is the expression. The TREE_PURPOSE is itself a
14136 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
14137 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
14138 is a STRING_CST for the string literal before the parenthesis. */
14141 cp_parser_asm_operand_list (cp_parser* parser)
14143 tree asm_operands = NULL_TREE;
14147 tree string_literal;
14151 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
14153 /* Consume the `[' token. */
14154 cp_lexer_consume_token (parser->lexer);
14155 /* Read the operand name. */
14156 name = cp_parser_identifier (parser);
14157 if (name != error_mark_node)
14158 name = build_string (IDENTIFIER_LENGTH (name),
14159 IDENTIFIER_POINTER (name));
14160 /* Look for the closing `]'. */
14161 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
14165 /* Look for the string-literal. */
14166 string_literal = cp_parser_string_literal (parser, false, false);
14168 /* Look for the `('. */
14169 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14170 /* Parse the expression. */
14171 expression = cp_parser_expression (parser, /*cast_p=*/false);
14172 /* Look for the `)'. */
14173 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14175 /* Add this operand to the list. */
14176 asm_operands = tree_cons (build_tree_list (name, string_literal),
14179 /* If the next token is not a `,', there are no more
14181 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
14183 /* Consume the `,'. */
14184 cp_lexer_consume_token (parser->lexer);
14187 return nreverse (asm_operands);
14190 /* Parse an asm-clobber-list.
14194 asm-clobber-list , string-literal
14196 Returns a TREE_LIST, indicating the clobbers in the order that they
14197 appeared. The TREE_VALUE of each node is a STRING_CST. */
14200 cp_parser_asm_clobber_list (cp_parser* parser)
14202 tree clobbers = NULL_TREE;
14206 tree string_literal;
14208 /* Look for the string literal. */
14209 string_literal = cp_parser_string_literal (parser, false, false);
14210 /* Add it to the list. */
14211 clobbers = tree_cons (NULL_TREE, string_literal, clobbers);
14212 /* If the next token is not a `,', then the list is
14214 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
14216 /* Consume the `,' token. */
14217 cp_lexer_consume_token (parser->lexer);
14223 /* Parse an (optional) series of attributes.
14226 attributes attribute
14229 __attribute__ (( attribute-list [opt] ))
14231 The return value is as for cp_parser_attribute_list. */
14234 cp_parser_attributes_opt (cp_parser* parser)
14236 tree attributes = NULL_TREE;
14241 tree attribute_list;
14243 /* Peek at the next token. */
14244 token = cp_lexer_peek_token (parser->lexer);
14245 /* If it's not `__attribute__', then we're done. */
14246 if (token->keyword != RID_ATTRIBUTE)
14249 /* Consume the `__attribute__' keyword. */
14250 cp_lexer_consume_token (parser->lexer);
14251 /* Look for the two `(' tokens. */
14252 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14253 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14255 /* Peek at the next token. */
14256 token = cp_lexer_peek_token (parser->lexer);
14257 if (token->type != CPP_CLOSE_PAREN)
14258 /* Parse the attribute-list. */
14259 attribute_list = cp_parser_attribute_list (parser);
14261 /* If the next token is a `)', then there is no attribute
14263 attribute_list = NULL;
14265 /* Look for the two `)' tokens. */
14266 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14267 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14269 /* Add these new attributes to the list. */
14270 attributes = chainon (attributes, attribute_list);
14276 /* Parse an attribute-list.
14280 attribute-list , attribute
14284 identifier ( identifier )
14285 identifier ( identifier , expression-list )
14286 identifier ( expression-list )
14288 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
14289 to an attribute. The TREE_PURPOSE of each node is the identifier
14290 indicating which attribute is in use. The TREE_VALUE represents
14291 the arguments, if any. */
14294 cp_parser_attribute_list (cp_parser* parser)
14296 tree attribute_list = NULL_TREE;
14297 bool save_translate_strings_p = parser->translate_strings_p;
14299 parser->translate_strings_p = false;
14306 /* Look for the identifier. We also allow keywords here; for
14307 example `__attribute__ ((const))' is legal. */
14308 token = cp_lexer_peek_token (parser->lexer);
14309 if (token->type == CPP_NAME
14310 || token->type == CPP_KEYWORD)
14312 /* Consume the token. */
14313 token = cp_lexer_consume_token (parser->lexer);
14315 /* Save away the identifier that indicates which attribute
14317 identifier = token->value;
14318 attribute = build_tree_list (identifier, NULL_TREE);
14320 /* Peek at the next token. */
14321 token = cp_lexer_peek_token (parser->lexer);
14322 /* If it's an `(', then parse the attribute arguments. */
14323 if (token->type == CPP_OPEN_PAREN)
14327 arguments = (cp_parser_parenthesized_expression_list
14328 (parser, true, /*cast_p=*/false,
14329 /*non_constant_p=*/NULL));
14330 /* Save the identifier and arguments away. */
14331 TREE_VALUE (attribute) = arguments;
14334 /* Add this attribute to the list. */
14335 TREE_CHAIN (attribute) = attribute_list;
14336 attribute_list = attribute;
14338 token = cp_lexer_peek_token (parser->lexer);
14340 /* Now, look for more attributes. If the next token isn't a
14341 `,', we're done. */
14342 if (token->type != CPP_COMMA)
14345 /* Consume the comma and keep going. */
14346 cp_lexer_consume_token (parser->lexer);
14348 parser->translate_strings_p = save_translate_strings_p;
14350 /* We built up the list in reverse order. */
14351 return nreverse (attribute_list);
14354 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
14355 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
14356 current value of the PEDANTIC flag, regardless of whether or not
14357 the `__extension__' keyword is present. The caller is responsible
14358 for restoring the value of the PEDANTIC flag. */
14361 cp_parser_extension_opt (cp_parser* parser, int* saved_pedantic)
14363 /* Save the old value of the PEDANTIC flag. */
14364 *saved_pedantic = pedantic;
14366 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXTENSION))
14368 /* Consume the `__extension__' token. */
14369 cp_lexer_consume_token (parser->lexer);
14370 /* We're not being pedantic while the `__extension__' keyword is
14380 /* Parse a label declaration.
14383 __label__ label-declarator-seq ;
14385 label-declarator-seq:
14386 identifier , label-declarator-seq
14390 cp_parser_label_declaration (cp_parser* parser)
14392 /* Look for the `__label__' keyword. */
14393 cp_parser_require_keyword (parser, RID_LABEL, "`__label__'");
14399 /* Look for an identifier. */
14400 identifier = cp_parser_identifier (parser);
14401 /* If we failed, stop. */
14402 if (identifier == error_mark_node)
14404 /* Declare it as a label. */
14405 finish_label_decl (identifier);
14406 /* If the next token is a `;', stop. */
14407 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
14409 /* Look for the `,' separating the label declarations. */
14410 cp_parser_require (parser, CPP_COMMA, "`,'");
14413 /* Look for the final `;'. */
14414 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
14417 /* Support Functions */
14419 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
14420 NAME should have one of the representations used for an
14421 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
14422 is returned. If PARSER->SCOPE is a dependent type, then a
14423 SCOPE_REF is returned.
14425 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
14426 returned; the name was already resolved when the TEMPLATE_ID_EXPR
14427 was formed. Abstractly, such entities should not be passed to this
14428 function, because they do not need to be looked up, but it is
14429 simpler to check for this special case here, rather than at the
14432 In cases not explicitly covered above, this function returns a
14433 DECL, OVERLOAD, or baselink representing the result of the lookup.
14434 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
14437 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
14438 (e.g., "struct") that was used. In that case bindings that do not
14439 refer to types are ignored.
14441 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
14444 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
14447 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
14450 If AMBIGUOUS_P is non-NULL, it is set to true if name-lookup
14451 results in an ambiguity, and false otherwise. */
14454 cp_parser_lookup_name (cp_parser *parser, tree name,
14455 enum tag_types tag_type,
14456 bool is_template, bool is_namespace,
14457 bool check_dependency,
14462 tree object_type = parser->context->object_type;
14464 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
14465 flags |= LOOKUP_COMPLAIN;
14467 /* Assume that the lookup will be unambiguous. */
14469 *ambiguous_p = false;
14471 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
14472 no longer valid. Note that if we are parsing tentatively, and
14473 the parse fails, OBJECT_TYPE will be automatically restored. */
14474 parser->context->object_type = NULL_TREE;
14476 if (name == error_mark_node)
14477 return error_mark_node;
14479 /* A template-id has already been resolved; there is no lookup to
14481 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
14483 if (BASELINK_P (name))
14485 gcc_assert (TREE_CODE (BASELINK_FUNCTIONS (name))
14486 == TEMPLATE_ID_EXPR);
14490 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
14491 it should already have been checked to make sure that the name
14492 used matches the type being destroyed. */
14493 if (TREE_CODE (name) == BIT_NOT_EXPR)
14497 /* Figure out to which type this destructor applies. */
14499 type = parser->scope;
14500 else if (object_type)
14501 type = object_type;
14503 type = current_class_type;
14504 /* If that's not a class type, there is no destructor. */
14505 if (!type || !CLASS_TYPE_P (type))
14506 return error_mark_node;
14507 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
14508 lazily_declare_fn (sfk_destructor, type);
14509 if (!CLASSTYPE_DESTRUCTORS (type))
14510 return error_mark_node;
14511 /* If it was a class type, return the destructor. */
14512 return CLASSTYPE_DESTRUCTORS (type);
14515 /* By this point, the NAME should be an ordinary identifier. If
14516 the id-expression was a qualified name, the qualifying scope is
14517 stored in PARSER->SCOPE at this point. */
14518 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
14520 /* Perform the lookup. */
14525 if (parser->scope == error_mark_node)
14526 return error_mark_node;
14528 /* If the SCOPE is dependent, the lookup must be deferred until
14529 the template is instantiated -- unless we are explicitly
14530 looking up names in uninstantiated templates. Even then, we
14531 cannot look up the name if the scope is not a class type; it
14532 might, for example, be a template type parameter. */
14533 dependent_p = (TYPE_P (parser->scope)
14534 && !(parser->in_declarator_p
14535 && currently_open_class (parser->scope))
14536 && dependent_type_p (parser->scope));
14537 if ((check_dependency || !CLASS_TYPE_P (parser->scope))
14544 /* The resolution to Core Issue 180 says that `struct
14545 A::B' should be considered a type-name, even if `A'
14547 type = make_typename_type (parser->scope, name, tag_type,
14549 decl = TYPE_NAME (type);
14551 else if (is_template)
14552 decl = make_unbound_class_template (parser->scope,
14556 decl = build_nt (SCOPE_REF, parser->scope, name);
14560 tree pushed_scope = NULL_TREE;
14562 /* If PARSER->SCOPE is a dependent type, then it must be a
14563 class type, and we must not be checking dependencies;
14564 otherwise, we would have processed this lookup above. So
14565 that PARSER->SCOPE is not considered a dependent base by
14566 lookup_member, we must enter the scope here. */
14568 pushed_scope = push_scope (parser->scope);
14569 /* If the PARSER->SCOPE is a template specialization, it
14570 may be instantiated during name lookup. In that case,
14571 errors may be issued. Even if we rollback the current
14572 tentative parse, those errors are valid. */
14573 decl = lookup_qualified_name (parser->scope, name,
14574 tag_type != none_type,
14575 /*complain=*/true);
14577 pop_scope (pushed_scope);
14579 parser->qualifying_scope = parser->scope;
14580 parser->object_scope = NULL_TREE;
14582 else if (object_type)
14584 tree object_decl = NULL_TREE;
14585 /* Look up the name in the scope of the OBJECT_TYPE, unless the
14586 OBJECT_TYPE is not a class. */
14587 if (CLASS_TYPE_P (object_type))
14588 /* If the OBJECT_TYPE is a template specialization, it may
14589 be instantiated during name lookup. In that case, errors
14590 may be issued. Even if we rollback the current tentative
14591 parse, those errors are valid. */
14592 object_decl = lookup_member (object_type,
14595 tag_type != none_type);
14596 /* Look it up in the enclosing context, too. */
14597 decl = lookup_name_real (name, tag_type != none_type,
14599 /*block_p=*/true, is_namespace, flags);
14600 parser->object_scope = object_type;
14601 parser->qualifying_scope = NULL_TREE;
14603 decl = object_decl;
14607 decl = lookup_name_real (name, tag_type != none_type,
14609 /*block_p=*/true, is_namespace, flags);
14610 parser->qualifying_scope = NULL_TREE;
14611 parser->object_scope = NULL_TREE;
14614 /* If the lookup failed, let our caller know. */
14615 if (!decl || decl == error_mark_node)
14616 return error_mark_node;
14618 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
14619 if (TREE_CODE (decl) == TREE_LIST)
14622 *ambiguous_p = true;
14623 /* The error message we have to print is too complicated for
14624 cp_parser_error, so we incorporate its actions directly. */
14625 if (!cp_parser_simulate_error (parser))
14627 error ("reference to %qD is ambiguous", name);
14628 print_candidates (decl);
14630 return error_mark_node;
14633 gcc_assert (DECL_P (decl)
14634 || TREE_CODE (decl) == OVERLOAD
14635 || TREE_CODE (decl) == SCOPE_REF
14636 || TREE_CODE (decl) == UNBOUND_CLASS_TEMPLATE
14637 || BASELINK_P (decl));
14639 /* If we have resolved the name of a member declaration, check to
14640 see if the declaration is accessible. When the name resolves to
14641 set of overloaded functions, accessibility is checked when
14642 overload resolution is done.
14644 During an explicit instantiation, access is not checked at all,
14645 as per [temp.explicit]. */
14647 check_accessibility_of_qualified_id (decl, object_type, parser->scope);
14652 /* Like cp_parser_lookup_name, but for use in the typical case where
14653 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
14654 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
14657 cp_parser_lookup_name_simple (cp_parser* parser, tree name)
14659 return cp_parser_lookup_name (parser, name,
14661 /*is_template=*/false,
14662 /*is_namespace=*/false,
14663 /*check_dependency=*/true,
14664 /*ambiguous_p=*/NULL);
14667 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
14668 the current context, return the TYPE_DECL. If TAG_NAME_P is
14669 true, the DECL indicates the class being defined in a class-head,
14670 or declared in an elaborated-type-specifier.
14672 Otherwise, return DECL. */
14675 cp_parser_maybe_treat_template_as_class (tree decl, bool tag_name_p)
14677 /* If the TEMPLATE_DECL is being declared as part of a class-head,
14678 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
14681 template <typename T> struct B;
14684 template <typename T> struct A::B {};
14686 Similarly, in an elaborated-type-specifier:
14688 namespace N { struct X{}; }
14691 template <typename T> friend struct N::X;
14694 However, if the DECL refers to a class type, and we are in
14695 the scope of the class, then the name lookup automatically
14696 finds the TYPE_DECL created by build_self_reference rather
14697 than a TEMPLATE_DECL. For example, in:
14699 template <class T> struct S {
14703 there is no need to handle such case. */
14705 if (DECL_CLASS_TEMPLATE_P (decl) && tag_name_p)
14706 return DECL_TEMPLATE_RESULT (decl);
14711 /* If too many, or too few, template-parameter lists apply to the
14712 declarator, issue an error message. Returns TRUE if all went well,
14713 and FALSE otherwise. */
14716 cp_parser_check_declarator_template_parameters (cp_parser* parser,
14717 cp_declarator *declarator)
14719 unsigned num_templates;
14721 /* We haven't seen any classes that involve template parameters yet. */
14724 switch (declarator->kind)
14727 if (declarator->u.id.qualifying_scope)
14732 scope = declarator->u.id.qualifying_scope;
14733 member = declarator->u.id.unqualified_name;
14735 while (scope && CLASS_TYPE_P (scope))
14737 /* You're supposed to have one `template <...>'
14738 for every template class, but you don't need one
14739 for a full specialization. For example:
14741 template <class T> struct S{};
14742 template <> struct S<int> { void f(); };
14743 void S<int>::f () {}
14745 is correct; there shouldn't be a `template <>' for
14746 the definition of `S<int>::f'. */
14747 if (CLASSTYPE_TEMPLATE_INFO (scope)
14748 && (CLASSTYPE_TEMPLATE_INSTANTIATION (scope)
14749 || uses_template_parms (CLASSTYPE_TI_ARGS (scope)))
14750 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope)))
14753 scope = TYPE_CONTEXT (scope);
14756 else if (TREE_CODE (declarator->u.id.unqualified_name)
14757 == TEMPLATE_ID_EXPR)
14758 /* If the DECLARATOR has the form `X<y>' then it uses one
14759 additional level of template parameters. */
14762 return cp_parser_check_template_parameters (parser,
14768 case cdk_reference:
14770 return (cp_parser_check_declarator_template_parameters
14771 (parser, declarator->declarator));
14777 gcc_unreachable ();
14782 /* NUM_TEMPLATES were used in the current declaration. If that is
14783 invalid, return FALSE and issue an error messages. Otherwise,
14787 cp_parser_check_template_parameters (cp_parser* parser,
14788 unsigned num_templates)
14790 /* If there are more template classes than parameter lists, we have
14793 template <class T> void S<T>::R<T>::f (); */
14794 if (parser->num_template_parameter_lists < num_templates)
14796 error ("too few template-parameter-lists");
14799 /* If there are the same number of template classes and parameter
14800 lists, that's OK. */
14801 if (parser->num_template_parameter_lists == num_templates)
14803 /* If there are more, but only one more, then we are referring to a
14804 member template. That's OK too. */
14805 if (parser->num_template_parameter_lists == num_templates + 1)
14807 /* Otherwise, there are too many template parameter lists. We have
14810 template <class T> template <class U> void S::f(); */
14811 error ("too many template-parameter-lists");
14815 /* Parse an optional `::' token indicating that the following name is
14816 from the global namespace. If so, PARSER->SCOPE is set to the
14817 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
14818 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
14819 Returns the new value of PARSER->SCOPE, if the `::' token is
14820 present, and NULL_TREE otherwise. */
14823 cp_parser_global_scope_opt (cp_parser* parser, bool current_scope_valid_p)
14827 /* Peek at the next token. */
14828 token = cp_lexer_peek_token (parser->lexer);
14829 /* If we're looking at a `::' token then we're starting from the
14830 global namespace, not our current location. */
14831 if (token->type == CPP_SCOPE)
14833 /* Consume the `::' token. */
14834 cp_lexer_consume_token (parser->lexer);
14835 /* Set the SCOPE so that we know where to start the lookup. */
14836 parser->scope = global_namespace;
14837 parser->qualifying_scope = global_namespace;
14838 parser->object_scope = NULL_TREE;
14840 return parser->scope;
14842 else if (!current_scope_valid_p)
14844 parser->scope = NULL_TREE;
14845 parser->qualifying_scope = NULL_TREE;
14846 parser->object_scope = NULL_TREE;
14852 /* Returns TRUE if the upcoming token sequence is the start of a
14853 constructor declarator. If FRIEND_P is true, the declarator is
14854 preceded by the `friend' specifier. */
14857 cp_parser_constructor_declarator_p (cp_parser *parser, bool friend_p)
14859 bool constructor_p;
14860 tree type_decl = NULL_TREE;
14861 bool nested_name_p;
14862 cp_token *next_token;
14864 /* The common case is that this is not a constructor declarator, so
14865 try to avoid doing lots of work if at all possible. It's not
14866 valid declare a constructor at function scope. */
14867 if (at_function_scope_p ())
14869 /* And only certain tokens can begin a constructor declarator. */
14870 next_token = cp_lexer_peek_token (parser->lexer);
14871 if (next_token->type != CPP_NAME
14872 && next_token->type != CPP_SCOPE
14873 && next_token->type != CPP_NESTED_NAME_SPECIFIER
14874 && next_token->type != CPP_TEMPLATE_ID)
14877 /* Parse tentatively; we are going to roll back all of the tokens
14879 cp_parser_parse_tentatively (parser);
14880 /* Assume that we are looking at a constructor declarator. */
14881 constructor_p = true;
14883 /* Look for the optional `::' operator. */
14884 cp_parser_global_scope_opt (parser,
14885 /*current_scope_valid_p=*/false);
14886 /* Look for the nested-name-specifier. */
14888 = (cp_parser_nested_name_specifier_opt (parser,
14889 /*typename_keyword_p=*/false,
14890 /*check_dependency_p=*/false,
14892 /*is_declaration=*/false)
14894 /* Outside of a class-specifier, there must be a
14895 nested-name-specifier. */
14896 if (!nested_name_p &&
14897 (!at_class_scope_p () || !TYPE_BEING_DEFINED (current_class_type)
14899 constructor_p = false;
14900 /* If we still think that this might be a constructor-declarator,
14901 look for a class-name. */
14906 template <typename T> struct S { S(); };
14907 template <typename T> S<T>::S ();
14909 we must recognize that the nested `S' names a class.
14912 template <typename T> S<T>::S<T> ();
14914 we must recognize that the nested `S' names a template. */
14915 type_decl = cp_parser_class_name (parser,
14916 /*typename_keyword_p=*/false,
14917 /*template_keyword_p=*/false,
14919 /*check_dependency_p=*/false,
14920 /*class_head_p=*/false,
14921 /*is_declaration=*/false);
14922 /* If there was no class-name, then this is not a constructor. */
14923 constructor_p = !cp_parser_error_occurred (parser);
14926 /* If we're still considering a constructor, we have to see a `(',
14927 to begin the parameter-declaration-clause, followed by either a
14928 `)', an `...', or a decl-specifier. We need to check for a
14929 type-specifier to avoid being fooled into thinking that:
14933 is a constructor. (It is actually a function named `f' that
14934 takes one parameter (of type `int') and returns a value of type
14937 && cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
14939 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN)
14940 && cp_lexer_next_token_is_not (parser->lexer, CPP_ELLIPSIS)
14941 /* A parameter declaration begins with a decl-specifier,
14942 which is either the "attribute" keyword, a storage class
14943 specifier, or (usually) a type-specifier. */
14944 && !cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE)
14945 && !cp_parser_storage_class_specifier_opt (parser))
14948 tree pushed_scope = NULL_TREE;
14949 unsigned saved_num_template_parameter_lists;
14951 /* Names appearing in the type-specifier should be looked up
14952 in the scope of the class. */
14953 if (current_class_type)
14957 type = TREE_TYPE (type_decl);
14958 if (TREE_CODE (type) == TYPENAME_TYPE)
14960 type = resolve_typename_type (type,
14961 /*only_current_p=*/false);
14962 if (type == error_mark_node)
14964 cp_parser_abort_tentative_parse (parser);
14968 pushed_scope = push_scope (type);
14971 /* Inside the constructor parameter list, surrounding
14972 template-parameter-lists do not apply. */
14973 saved_num_template_parameter_lists
14974 = parser->num_template_parameter_lists;
14975 parser->num_template_parameter_lists = 0;
14977 /* Look for the type-specifier. */
14978 cp_parser_type_specifier (parser,
14979 CP_PARSER_FLAGS_NONE,
14980 /*decl_specs=*/NULL,
14981 /*is_declarator=*/true,
14982 /*declares_class_or_enum=*/NULL,
14983 /*is_cv_qualifier=*/NULL);
14985 parser->num_template_parameter_lists
14986 = saved_num_template_parameter_lists;
14988 /* Leave the scope of the class. */
14990 pop_scope (pushed_scope);
14992 constructor_p = !cp_parser_error_occurred (parser);
14996 constructor_p = false;
14997 /* We did not really want to consume any tokens. */
14998 cp_parser_abort_tentative_parse (parser);
15000 return constructor_p;
15003 /* Parse the definition of the function given by the DECL_SPECIFIERS,
15004 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
15005 they must be performed once we are in the scope of the function.
15007 Returns the function defined. */
15010 cp_parser_function_definition_from_specifiers_and_declarator
15011 (cp_parser* parser,
15012 cp_decl_specifier_seq *decl_specifiers,
15014 const cp_declarator *declarator)
15019 /* Begin the function-definition. */
15020 success_p = start_function (decl_specifiers, declarator, attributes);
15022 /* The things we're about to see are not directly qualified by any
15023 template headers we've seen thus far. */
15024 reset_specialization ();
15026 /* If there were names looked up in the decl-specifier-seq that we
15027 did not check, check them now. We must wait until we are in the
15028 scope of the function to perform the checks, since the function
15029 might be a friend. */
15030 perform_deferred_access_checks ();
15034 /* Skip the entire function. */
15035 error ("invalid function declaration");
15036 cp_parser_skip_to_end_of_block_or_statement (parser);
15037 fn = error_mark_node;
15040 fn = cp_parser_function_definition_after_declarator (parser,
15041 /*inline_p=*/false);
15046 /* Parse the part of a function-definition that follows the
15047 declarator. INLINE_P is TRUE iff this function is an inline
15048 function defined with a class-specifier.
15050 Returns the function defined. */
15053 cp_parser_function_definition_after_declarator (cp_parser* parser,
15057 bool ctor_initializer_p = false;
15058 bool saved_in_unbraced_linkage_specification_p;
15059 unsigned saved_num_template_parameter_lists;
15061 /* If the next token is `return', then the code may be trying to
15062 make use of the "named return value" extension that G++ used to
15064 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_RETURN))
15066 /* Consume the `return' keyword. */
15067 cp_lexer_consume_token (parser->lexer);
15068 /* Look for the identifier that indicates what value is to be
15070 cp_parser_identifier (parser);
15071 /* Issue an error message. */
15072 error ("named return values are no longer supported");
15073 /* Skip tokens until we reach the start of the function body. */
15074 while (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE)
15075 && cp_lexer_next_token_is_not (parser->lexer, CPP_EOF))
15076 cp_lexer_consume_token (parser->lexer);
15078 /* The `extern' in `extern "C" void f () { ... }' does not apply to
15079 anything declared inside `f'. */
15080 saved_in_unbraced_linkage_specification_p
15081 = parser->in_unbraced_linkage_specification_p;
15082 parser->in_unbraced_linkage_specification_p = false;
15083 /* Inside the function, surrounding template-parameter-lists do not
15085 saved_num_template_parameter_lists
15086 = parser->num_template_parameter_lists;
15087 parser->num_template_parameter_lists = 0;
15088 /* If the next token is `try', then we are looking at a
15089 function-try-block. */
15090 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRY))
15091 ctor_initializer_p = cp_parser_function_try_block (parser);
15092 /* A function-try-block includes the function-body, so we only do
15093 this next part if we're not processing a function-try-block. */
15096 = cp_parser_ctor_initializer_opt_and_function_body (parser);
15098 /* Finish the function. */
15099 fn = finish_function ((ctor_initializer_p ? 1 : 0) |
15100 (inline_p ? 2 : 0));
15101 /* Generate code for it, if necessary. */
15102 expand_or_defer_fn (fn);
15103 /* Restore the saved values. */
15104 parser->in_unbraced_linkage_specification_p
15105 = saved_in_unbraced_linkage_specification_p;
15106 parser->num_template_parameter_lists
15107 = saved_num_template_parameter_lists;
15112 /* Parse a template-declaration, assuming that the `export' (and
15113 `extern') keywords, if present, has already been scanned. MEMBER_P
15114 is as for cp_parser_template_declaration. */
15117 cp_parser_template_declaration_after_export (cp_parser* parser, bool member_p)
15119 tree decl = NULL_TREE;
15120 tree parameter_list;
15121 bool friend_p = false;
15123 /* Look for the `template' keyword. */
15124 if (!cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'"))
15128 if (!cp_parser_require (parser, CPP_LESS, "`<'"))
15131 /* If the next token is `>', then we have an invalid
15132 specialization. Rather than complain about an invalid template
15133 parameter, issue an error message here. */
15134 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
15136 cp_parser_error (parser, "invalid explicit specialization");
15137 begin_specialization ();
15138 parameter_list = NULL_TREE;
15142 /* Parse the template parameters. */
15143 begin_template_parm_list ();
15144 parameter_list = cp_parser_template_parameter_list (parser);
15145 parameter_list = end_template_parm_list (parameter_list);
15148 /* Look for the `>'. */
15149 cp_parser_skip_until_found (parser, CPP_GREATER, "`>'");
15150 /* We just processed one more parameter list. */
15151 ++parser->num_template_parameter_lists;
15152 /* If the next token is `template', there are more template
15154 if (cp_lexer_next_token_is_keyword (parser->lexer,
15156 cp_parser_template_declaration_after_export (parser, member_p);
15159 /* There are no access checks when parsing a template, as we do not
15160 know if a specialization will be a friend. */
15161 push_deferring_access_checks (dk_no_check);
15163 decl = cp_parser_single_declaration (parser,
15167 pop_deferring_access_checks ();
15169 /* If this is a member template declaration, let the front
15171 if (member_p && !friend_p && decl)
15173 if (TREE_CODE (decl) == TYPE_DECL)
15174 cp_parser_check_access_in_redeclaration (decl);
15176 decl = finish_member_template_decl (decl);
15178 else if (friend_p && decl && TREE_CODE (decl) == TYPE_DECL)
15179 make_friend_class (current_class_type, TREE_TYPE (decl),
15180 /*complain=*/true);
15182 /* We are done with the current parameter list. */
15183 --parser->num_template_parameter_lists;
15186 finish_template_decl (parameter_list);
15188 /* Register member declarations. */
15189 if (member_p && !friend_p && decl && !DECL_CLASS_TEMPLATE_P (decl))
15190 finish_member_declaration (decl);
15192 /* If DECL is a function template, we must return to parse it later.
15193 (Even though there is no definition, there might be default
15194 arguments that need handling.) */
15195 if (member_p && decl
15196 && (TREE_CODE (decl) == FUNCTION_DECL
15197 || DECL_FUNCTION_TEMPLATE_P (decl)))
15198 TREE_VALUE (parser->unparsed_functions_queues)
15199 = tree_cons (NULL_TREE, decl,
15200 TREE_VALUE (parser->unparsed_functions_queues));
15203 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
15204 `function-definition' sequence. MEMBER_P is true, this declaration
15205 appears in a class scope.
15207 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
15208 *FRIEND_P is set to TRUE iff the declaration is a friend. */
15211 cp_parser_single_declaration (cp_parser* parser,
15215 int declares_class_or_enum;
15216 tree decl = NULL_TREE;
15217 cp_decl_specifier_seq decl_specifiers;
15218 bool function_definition_p = false;
15220 /* This function is only used when processing a template
15222 gcc_assert (innermost_scope_kind () == sk_template_parms
15223 || innermost_scope_kind () == sk_template_spec);
15225 /* Defer access checks until we know what is being declared. */
15226 push_deferring_access_checks (dk_deferred);
15228 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
15230 cp_parser_decl_specifier_seq (parser,
15231 CP_PARSER_FLAGS_OPTIONAL,
15233 &declares_class_or_enum);
15235 *friend_p = cp_parser_friend_p (&decl_specifiers);
15237 /* There are no template typedefs. */
15238 if (decl_specifiers.specs[(int) ds_typedef])
15240 error ("template declaration of %qs", "typedef");
15241 decl = error_mark_node;
15244 /* Gather up the access checks that occurred the
15245 decl-specifier-seq. */
15246 stop_deferring_access_checks ();
15248 /* Check for the declaration of a template class. */
15249 if (declares_class_or_enum)
15251 if (cp_parser_declares_only_class_p (parser))
15253 decl = shadow_tag (&decl_specifiers);
15258 friend template <typename T> struct A<T>::B;
15261 A<T>::B will be represented by a TYPENAME_TYPE, and
15262 therefore not recognized by shadow_tag. */
15263 if (friend_p && *friend_p
15265 && decl_specifiers.type
15266 && TYPE_P (decl_specifiers.type))
15267 decl = decl_specifiers.type;
15269 if (decl && decl != error_mark_node)
15270 decl = TYPE_NAME (decl);
15272 decl = error_mark_node;
15275 /* If it's not a template class, try for a template function. If
15276 the next token is a `;', then this declaration does not declare
15277 anything. But, if there were errors in the decl-specifiers, then
15278 the error might well have come from an attempted class-specifier.
15279 In that case, there's no need to warn about a missing declarator. */
15281 && (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON)
15282 || decl_specifiers.type != error_mark_node))
15283 decl = cp_parser_init_declarator (parser,
15285 /*function_definition_allowed_p=*/true,
15287 declares_class_or_enum,
15288 &function_definition_p);
15290 pop_deferring_access_checks ();
15292 /* Clear any current qualification; whatever comes next is the start
15293 of something new. */
15294 parser->scope = NULL_TREE;
15295 parser->qualifying_scope = NULL_TREE;
15296 parser->object_scope = NULL_TREE;
15297 /* Look for a trailing `;' after the declaration. */
15298 if (!function_definition_p
15299 && (decl == error_mark_node
15300 || !cp_parser_require (parser, CPP_SEMICOLON, "`;'")))
15301 cp_parser_skip_to_end_of_block_or_statement (parser);
15306 /* Parse a cast-expression that is not the operand of a unary "&". */
15309 cp_parser_simple_cast_expression (cp_parser *parser)
15311 return cp_parser_cast_expression (parser, /*address_p=*/false,
15315 /* Parse a functional cast to TYPE. Returns an expression
15316 representing the cast. */
15319 cp_parser_functional_cast (cp_parser* parser, tree type)
15321 tree expression_list;
15325 = cp_parser_parenthesized_expression_list (parser, false,
15327 /*non_constant_p=*/NULL);
15329 cast = build_functional_cast (type, expression_list);
15330 /* [expr.const]/1: In an integral constant expression "only type
15331 conversions to integral or enumeration type can be used". */
15332 if (cast != error_mark_node && !type_dependent_expression_p (type)
15333 && !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (type)))
15335 if (cp_parser_non_integral_constant_expression
15336 (parser, "a call to a constructor"))
15337 return error_mark_node;
15342 /* Save the tokens that make up the body of a member function defined
15343 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
15344 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
15345 specifiers applied to the declaration. Returns the FUNCTION_DECL
15346 for the member function. */
15349 cp_parser_save_member_function_body (cp_parser* parser,
15350 cp_decl_specifier_seq *decl_specifiers,
15351 cp_declarator *declarator,
15358 /* Create the function-declaration. */
15359 fn = start_method (decl_specifiers, declarator, attributes);
15360 /* If something went badly wrong, bail out now. */
15361 if (fn == error_mark_node)
15363 /* If there's a function-body, skip it. */
15364 if (cp_parser_token_starts_function_definition_p
15365 (cp_lexer_peek_token (parser->lexer)))
15366 cp_parser_skip_to_end_of_block_or_statement (parser);
15367 return error_mark_node;
15370 /* Remember it, if there default args to post process. */
15371 cp_parser_save_default_args (parser, fn);
15373 /* Save away the tokens that make up the body of the
15375 first = parser->lexer->next_token;
15376 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
15377 /* Handle function try blocks. */
15378 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_CATCH))
15379 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
15380 last = parser->lexer->next_token;
15382 /* Save away the inline definition; we will process it when the
15383 class is complete. */
15384 DECL_PENDING_INLINE_INFO (fn) = cp_token_cache_new (first, last);
15385 DECL_PENDING_INLINE_P (fn) = 1;
15387 /* We need to know that this was defined in the class, so that
15388 friend templates are handled correctly. */
15389 DECL_INITIALIZED_IN_CLASS_P (fn) = 1;
15391 /* We're done with the inline definition. */
15392 finish_method (fn);
15394 /* Add FN to the queue of functions to be parsed later. */
15395 TREE_VALUE (parser->unparsed_functions_queues)
15396 = tree_cons (NULL_TREE, fn,
15397 TREE_VALUE (parser->unparsed_functions_queues));
15402 /* Parse a template-argument-list, as well as the trailing ">" (but
15403 not the opening ">"). See cp_parser_template_argument_list for the
15407 cp_parser_enclosed_template_argument_list (cp_parser* parser)
15411 tree saved_qualifying_scope;
15412 tree saved_object_scope;
15413 bool saved_greater_than_is_operator_p;
15417 When parsing a template-id, the first non-nested `>' is taken as
15418 the end of the template-argument-list rather than a greater-than
15420 saved_greater_than_is_operator_p
15421 = parser->greater_than_is_operator_p;
15422 parser->greater_than_is_operator_p = false;
15423 /* Parsing the argument list may modify SCOPE, so we save it
15425 saved_scope = parser->scope;
15426 saved_qualifying_scope = parser->qualifying_scope;
15427 saved_object_scope = parser->object_scope;
15428 /* Parse the template-argument-list itself. */
15429 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
15430 arguments = NULL_TREE;
15432 arguments = cp_parser_template_argument_list (parser);
15433 /* Look for the `>' that ends the template-argument-list. If we find
15434 a '>>' instead, it's probably just a typo. */
15435 if (cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
15437 if (!saved_greater_than_is_operator_p)
15439 /* If we're in a nested template argument list, the '>>' has
15440 to be a typo for '> >'. We emit the error message, but we
15441 continue parsing and we push a '>' as next token, so that
15442 the argument list will be parsed correctly. Note that the
15443 global source location is still on the token before the
15444 '>>', so we need to say explicitly where we want it. */
15445 cp_token *token = cp_lexer_peek_token (parser->lexer);
15446 error ("%H%<>>%> should be %<> >%> "
15447 "within a nested template argument list",
15450 /* ??? Proper recovery should terminate two levels of
15451 template argument list here. */
15452 token->type = CPP_GREATER;
15456 /* If this is not a nested template argument list, the '>>'
15457 is a typo for '>'. Emit an error message and continue.
15458 Same deal about the token location, but here we can get it
15459 right by consuming the '>>' before issuing the diagnostic. */
15460 cp_lexer_consume_token (parser->lexer);
15461 error ("spurious %<>>%>, use %<>%> to terminate "
15462 "a template argument list");
15465 else if (!cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
15466 error ("missing %<>%> to terminate the template argument list");
15468 /* It's what we want, a '>'; consume it. */
15469 cp_lexer_consume_token (parser->lexer);
15470 /* The `>' token might be a greater-than operator again now. */
15471 parser->greater_than_is_operator_p
15472 = saved_greater_than_is_operator_p;
15473 /* Restore the SAVED_SCOPE. */
15474 parser->scope = saved_scope;
15475 parser->qualifying_scope = saved_qualifying_scope;
15476 parser->object_scope = saved_object_scope;
15481 /* MEMBER_FUNCTION is a member function, or a friend. If default
15482 arguments, or the body of the function have not yet been parsed,
15486 cp_parser_late_parsing_for_member (cp_parser* parser, tree member_function)
15488 /* If this member is a template, get the underlying
15490 if (DECL_FUNCTION_TEMPLATE_P (member_function))
15491 member_function = DECL_TEMPLATE_RESULT (member_function);
15493 /* There should not be any class definitions in progress at this
15494 point; the bodies of members are only parsed outside of all class
15496 gcc_assert (parser->num_classes_being_defined == 0);
15497 /* While we're parsing the member functions we might encounter more
15498 classes. We want to handle them right away, but we don't want
15499 them getting mixed up with functions that are currently in the
15501 parser->unparsed_functions_queues
15502 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
15504 /* Make sure that any template parameters are in scope. */
15505 maybe_begin_member_template_processing (member_function);
15507 /* If the body of the function has not yet been parsed, parse it
15509 if (DECL_PENDING_INLINE_P (member_function))
15511 tree function_scope;
15512 cp_token_cache *tokens;
15514 /* The function is no longer pending; we are processing it. */
15515 tokens = DECL_PENDING_INLINE_INFO (member_function);
15516 DECL_PENDING_INLINE_INFO (member_function) = NULL;
15517 DECL_PENDING_INLINE_P (member_function) = 0;
15519 /* If this is a local class, enter the scope of the containing
15521 function_scope = current_function_decl;
15522 if (function_scope)
15523 push_function_context_to (function_scope);
15526 /* Push the body of the function onto the lexer stack. */
15527 cp_parser_push_lexer_for_tokens (parser, tokens);
15529 /* Let the front end know that we going to be defining this
15531 start_preparsed_function (member_function, NULL_TREE,
15532 SF_PRE_PARSED | SF_INCLASS_INLINE);
15534 /* Don't do access checking if it is a templated function. */
15535 if (processing_template_decl)
15536 push_deferring_access_checks (dk_no_check);
15538 /* Now, parse the body of the function. */
15539 cp_parser_function_definition_after_declarator (parser,
15540 /*inline_p=*/true);
15542 if (processing_template_decl)
15543 pop_deferring_access_checks ();
15545 /* Leave the scope of the containing function. */
15546 if (function_scope)
15547 pop_function_context_from (function_scope);
15548 cp_parser_pop_lexer (parser);
15551 /* Remove any template parameters from the symbol table. */
15552 maybe_end_member_template_processing ();
15554 /* Restore the queue. */
15555 parser->unparsed_functions_queues
15556 = TREE_CHAIN (parser->unparsed_functions_queues);
15559 /* If DECL contains any default args, remember it on the unparsed
15560 functions queue. */
15563 cp_parser_save_default_args (cp_parser* parser, tree decl)
15567 for (probe = TYPE_ARG_TYPES (TREE_TYPE (decl));
15569 probe = TREE_CHAIN (probe))
15570 if (TREE_PURPOSE (probe))
15572 TREE_PURPOSE (parser->unparsed_functions_queues)
15573 = tree_cons (current_class_type, decl,
15574 TREE_PURPOSE (parser->unparsed_functions_queues));
15580 /* FN is a FUNCTION_DECL which may contains a parameter with an
15581 unparsed DEFAULT_ARG. Parse the default args now. This function
15582 assumes that the current scope is the scope in which the default
15583 argument should be processed. */
15586 cp_parser_late_parsing_default_args (cp_parser *parser, tree fn)
15588 bool saved_local_variables_forbidden_p;
15591 /* While we're parsing the default args, we might (due to the
15592 statement expression extension) encounter more classes. We want
15593 to handle them right away, but we don't want them getting mixed
15594 up with default args that are currently in the queue. */
15595 parser->unparsed_functions_queues
15596 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
15598 /* Local variable names (and the `this' keyword) may not appear
15599 in a default argument. */
15600 saved_local_variables_forbidden_p = parser->local_variables_forbidden_p;
15601 parser->local_variables_forbidden_p = true;
15603 for (parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
15605 parm = TREE_CHAIN (parm))
15607 cp_token_cache *tokens;
15608 tree default_arg = TREE_PURPOSE (parm);
15610 VEC(tree,gc) *insts;
15617 if (TREE_CODE (default_arg) != DEFAULT_ARG)
15618 /* This can happen for a friend declaration for a function
15619 already declared with default arguments. */
15622 /* Push the saved tokens for the default argument onto the parser's
15624 tokens = DEFARG_TOKENS (default_arg);
15625 cp_parser_push_lexer_for_tokens (parser, tokens);
15627 /* Parse the assignment-expression. */
15628 parsed_arg = cp_parser_assignment_expression (parser, /*cast_p=*/false);
15630 TREE_PURPOSE (parm) = parsed_arg;
15632 /* Update any instantiations we've already created. */
15633 for (insts = DEFARG_INSTANTIATIONS (default_arg), ix = 0;
15634 VEC_iterate (tree, insts, ix, copy); ix++)
15635 TREE_PURPOSE (copy) = parsed_arg;
15637 /* If the token stream has not been completely used up, then
15638 there was extra junk after the end of the default
15640 if (!cp_lexer_next_token_is (parser->lexer, CPP_EOF))
15641 cp_parser_error (parser, "expected %<,%>");
15643 /* Revert to the main lexer. */
15644 cp_parser_pop_lexer (parser);
15647 /* Restore the state of local_variables_forbidden_p. */
15648 parser->local_variables_forbidden_p = saved_local_variables_forbidden_p;
15650 /* Restore the queue. */
15651 parser->unparsed_functions_queues
15652 = TREE_CHAIN (parser->unparsed_functions_queues);
15655 /* Parse the operand of `sizeof' (or a similar operator). Returns
15656 either a TYPE or an expression, depending on the form of the
15657 input. The KEYWORD indicates which kind of expression we have
15661 cp_parser_sizeof_operand (cp_parser* parser, enum rid keyword)
15663 static const char *format;
15664 tree expr = NULL_TREE;
15665 const char *saved_message;
15666 bool saved_integral_constant_expression_p;
15667 bool saved_non_integral_constant_expression_p;
15669 /* Initialize FORMAT the first time we get here. */
15671 format = "types may not be defined in '%s' expressions";
15673 /* Types cannot be defined in a `sizeof' expression. Save away the
15675 saved_message = parser->type_definition_forbidden_message;
15676 /* And create the new one. */
15677 parser->type_definition_forbidden_message
15678 = xmalloc (strlen (format)
15679 + strlen (IDENTIFIER_POINTER (ridpointers[keyword]))
15681 sprintf ((char *) parser->type_definition_forbidden_message,
15682 format, IDENTIFIER_POINTER (ridpointers[keyword]));
15684 /* The restrictions on constant-expressions do not apply inside
15685 sizeof expressions. */
15686 saved_integral_constant_expression_p
15687 = parser->integral_constant_expression_p;
15688 saved_non_integral_constant_expression_p
15689 = parser->non_integral_constant_expression_p;
15690 parser->integral_constant_expression_p = false;
15692 /* Do not actually evaluate the expression. */
15694 /* If it's a `(', then we might be looking at the type-id
15696 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
15699 bool saved_in_type_id_in_expr_p;
15701 /* We can't be sure yet whether we're looking at a type-id or an
15703 cp_parser_parse_tentatively (parser);
15704 /* Consume the `('. */
15705 cp_lexer_consume_token (parser->lexer);
15706 /* Parse the type-id. */
15707 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
15708 parser->in_type_id_in_expr_p = true;
15709 type = cp_parser_type_id (parser);
15710 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
15711 /* Now, look for the trailing `)'. */
15712 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
15713 /* If all went well, then we're done. */
15714 if (cp_parser_parse_definitely (parser))
15716 cp_decl_specifier_seq decl_specs;
15718 /* Build a trivial decl-specifier-seq. */
15719 clear_decl_specs (&decl_specs);
15720 decl_specs.type = type;
15722 /* Call grokdeclarator to figure out what type this is. */
15723 expr = grokdeclarator (NULL,
15727 /*attrlist=*/NULL);
15731 /* If the type-id production did not work out, then we must be
15732 looking at the unary-expression production. */
15734 expr = cp_parser_unary_expression (parser, /*address_p=*/false,
15736 /* Go back to evaluating expressions. */
15739 /* Free the message we created. */
15740 free ((char *) parser->type_definition_forbidden_message);
15741 /* And restore the old one. */
15742 parser->type_definition_forbidden_message = saved_message;
15743 parser->integral_constant_expression_p
15744 = saved_integral_constant_expression_p;
15745 parser->non_integral_constant_expression_p
15746 = saved_non_integral_constant_expression_p;
15751 /* If the current declaration has no declarator, return true. */
15754 cp_parser_declares_only_class_p (cp_parser *parser)
15756 /* If the next token is a `;' or a `,' then there is no
15758 return (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
15759 || cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
15762 /* Update the DECL_SPECS to reflect the STORAGE_CLASS. */
15765 cp_parser_set_storage_class (cp_decl_specifier_seq *decl_specs,
15766 cp_storage_class storage_class)
15768 if (decl_specs->storage_class != sc_none)
15769 decl_specs->multiple_storage_classes_p = true;
15771 decl_specs->storage_class = storage_class;
15774 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If USER_DEFINED_P
15775 is true, the type is a user-defined type; otherwise it is a
15776 built-in type specified by a keyword. */
15779 cp_parser_set_decl_spec_type (cp_decl_specifier_seq *decl_specs,
15781 bool user_defined_p)
15783 decl_specs->any_specifiers_p = true;
15785 /* If the user tries to redeclare bool or wchar_t (with, for
15786 example, in "typedef int wchar_t;") we remember that this is what
15787 happened. In system headers, we ignore these declarations so
15788 that G++ can work with system headers that are not C++-safe. */
15789 if (decl_specs->specs[(int) ds_typedef]
15791 && (type_spec == boolean_type_node
15792 || type_spec == wchar_type_node)
15793 && (decl_specs->type
15794 || decl_specs->specs[(int) ds_long]
15795 || decl_specs->specs[(int) ds_short]
15796 || decl_specs->specs[(int) ds_unsigned]
15797 || decl_specs->specs[(int) ds_signed]))
15799 decl_specs->redefined_builtin_type = type_spec;
15800 if (!decl_specs->type)
15802 decl_specs->type = type_spec;
15803 decl_specs->user_defined_type_p = false;
15806 else if (decl_specs->type)
15807 decl_specs->multiple_types_p = true;
15810 decl_specs->type = type_spec;
15811 decl_specs->user_defined_type_p = user_defined_p;
15812 decl_specs->redefined_builtin_type = NULL_TREE;
15816 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
15817 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
15820 cp_parser_friend_p (const cp_decl_specifier_seq *decl_specifiers)
15822 return decl_specifiers->specs[(int) ds_friend] != 0;
15825 /* If the next token is of the indicated TYPE, consume it. Otherwise,
15826 issue an error message indicating that TOKEN_DESC was expected.
15828 Returns the token consumed, if the token had the appropriate type.
15829 Otherwise, returns NULL. */
15832 cp_parser_require (cp_parser* parser,
15833 enum cpp_ttype type,
15834 const char* token_desc)
15836 if (cp_lexer_next_token_is (parser->lexer, type))
15837 return cp_lexer_consume_token (parser->lexer);
15840 /* Output the MESSAGE -- unless we're parsing tentatively. */
15841 if (!cp_parser_simulate_error (parser))
15843 char *message = concat ("expected ", token_desc, NULL);
15844 cp_parser_error (parser, message);
15851 /* Like cp_parser_require, except that tokens will be skipped until
15852 the desired token is found. An error message is still produced if
15853 the next token is not as expected. */
15856 cp_parser_skip_until_found (cp_parser* parser,
15857 enum cpp_ttype type,
15858 const char* token_desc)
15861 unsigned nesting_depth = 0;
15863 if (cp_parser_require (parser, type, token_desc))
15866 /* Skip tokens until the desired token is found. */
15869 /* Peek at the next token. */
15870 token = cp_lexer_peek_token (parser->lexer);
15871 /* If we've reached the token we want, consume it and
15873 if (token->type == type && !nesting_depth)
15875 cp_lexer_consume_token (parser->lexer);
15878 /* If we've run out of tokens, stop. */
15879 if (token->type == CPP_EOF)
15881 if (token->type == CPP_OPEN_BRACE
15882 || token->type == CPP_OPEN_PAREN
15883 || token->type == CPP_OPEN_SQUARE)
15885 else if (token->type == CPP_CLOSE_BRACE
15886 || token->type == CPP_CLOSE_PAREN
15887 || token->type == CPP_CLOSE_SQUARE)
15889 if (nesting_depth-- == 0)
15892 /* Consume this token. */
15893 cp_lexer_consume_token (parser->lexer);
15897 /* If the next token is the indicated keyword, consume it. Otherwise,
15898 issue an error message indicating that TOKEN_DESC was expected.
15900 Returns the token consumed, if the token had the appropriate type.
15901 Otherwise, returns NULL. */
15904 cp_parser_require_keyword (cp_parser* parser,
15906 const char* token_desc)
15908 cp_token *token = cp_parser_require (parser, CPP_KEYWORD, token_desc);
15910 if (token && token->keyword != keyword)
15912 dyn_string_t error_msg;
15914 /* Format the error message. */
15915 error_msg = dyn_string_new (0);
15916 dyn_string_append_cstr (error_msg, "expected ");
15917 dyn_string_append_cstr (error_msg, token_desc);
15918 cp_parser_error (parser, error_msg->s);
15919 dyn_string_delete (error_msg);
15926 /* Returns TRUE iff TOKEN is a token that can begin the body of a
15927 function-definition. */
15930 cp_parser_token_starts_function_definition_p (cp_token* token)
15932 return (/* An ordinary function-body begins with an `{'. */
15933 token->type == CPP_OPEN_BRACE
15934 /* A ctor-initializer begins with a `:'. */
15935 || token->type == CPP_COLON
15936 /* A function-try-block begins with `try'. */
15937 || token->keyword == RID_TRY
15938 /* The named return value extension begins with `return'. */
15939 || token->keyword == RID_RETURN);
15942 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
15946 cp_parser_next_token_starts_class_definition_p (cp_parser *parser)
15950 token = cp_lexer_peek_token (parser->lexer);
15951 return (token->type == CPP_OPEN_BRACE || token->type == CPP_COLON);
15954 /* Returns TRUE iff the next token is the "," or ">" ending a
15955 template-argument. */
15958 cp_parser_next_token_ends_template_argument_p (cp_parser *parser)
15962 token = cp_lexer_peek_token (parser->lexer);
15963 return (token->type == CPP_COMMA || token->type == CPP_GREATER);
15966 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
15967 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
15970 cp_parser_nth_token_starts_template_argument_list_p (cp_parser * parser,
15975 token = cp_lexer_peek_nth_token (parser->lexer, n);
15976 if (token->type == CPP_LESS)
15978 /* Check for the sequence `<::' in the original code. It would be lexed as
15979 `[:', where `[' is a digraph, and there is no whitespace before
15981 if (token->type == CPP_OPEN_SQUARE && token->flags & DIGRAPH)
15984 token2 = cp_lexer_peek_nth_token (parser->lexer, n+1);
15985 if (token2->type == CPP_COLON && !(token2->flags & PREV_WHITE))
15991 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
15992 or none_type otherwise. */
15994 static enum tag_types
15995 cp_parser_token_is_class_key (cp_token* token)
15997 switch (token->keyword)
16002 return record_type;
16011 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
16014 cp_parser_check_class_key (enum tag_types class_key, tree type)
16016 if ((TREE_CODE (type) == UNION_TYPE) != (class_key == union_type))
16017 pedwarn ("%qs tag used in naming %q#T",
16018 class_key == union_type ? "union"
16019 : class_key == record_type ? "struct" : "class",
16023 /* Issue an error message if DECL is redeclared with different
16024 access than its original declaration [class.access.spec/3].
16025 This applies to nested classes and nested class templates.
16029 cp_parser_check_access_in_redeclaration (tree decl)
16031 if (!CLASS_TYPE_P (TREE_TYPE (decl)))
16034 if ((TREE_PRIVATE (decl)
16035 != (current_access_specifier == access_private_node))
16036 || (TREE_PROTECTED (decl)
16037 != (current_access_specifier == access_protected_node)))
16038 error ("%qD redeclared with different access", decl);
16041 /* Look for the `template' keyword, as a syntactic disambiguator.
16042 Return TRUE iff it is present, in which case it will be
16046 cp_parser_optional_template_keyword (cp_parser *parser)
16048 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
16050 /* The `template' keyword can only be used within templates;
16051 outside templates the parser can always figure out what is a
16052 template and what is not. */
16053 if (!processing_template_decl)
16055 error ("%<template%> (as a disambiguator) is only allowed "
16056 "within templates");
16057 /* If this part of the token stream is rescanned, the same
16058 error message would be generated. So, we purge the token
16059 from the stream. */
16060 cp_lexer_purge_token (parser->lexer);
16065 /* Consume the `template' keyword. */
16066 cp_lexer_consume_token (parser->lexer);
16074 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
16075 set PARSER->SCOPE, and perform other related actions. */
16078 cp_parser_pre_parsed_nested_name_specifier (cp_parser *parser)
16083 /* Get the stored value. */
16084 value = cp_lexer_consume_token (parser->lexer)->value;
16085 /* Perform any access checks that were deferred. */
16086 for (check = TREE_PURPOSE (value); check; check = TREE_CHAIN (check))
16087 perform_or_defer_access_check (TREE_PURPOSE (check), TREE_VALUE (check));
16088 /* Set the scope from the stored value. */
16089 parser->scope = TREE_VALUE (value);
16090 parser->qualifying_scope = TREE_TYPE (value);
16091 parser->object_scope = NULL_TREE;
16094 /* Consume tokens up through a non-nested END token. */
16097 cp_parser_cache_group (cp_parser *parser,
16098 enum cpp_ttype end,
16105 /* Abort a parenthesized expression if we encounter a brace. */
16106 if ((end == CPP_CLOSE_PAREN || depth == 0)
16107 && cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
16109 /* If we've reached the end of the file, stop. */
16110 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
16112 /* Consume the next token. */
16113 token = cp_lexer_consume_token (parser->lexer);
16114 /* See if it starts a new group. */
16115 if (token->type == CPP_OPEN_BRACE)
16117 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, depth + 1);
16121 else if (token->type == CPP_OPEN_PAREN)
16122 cp_parser_cache_group (parser, CPP_CLOSE_PAREN, depth + 1);
16123 else if (token->type == end)
16128 /* Begin parsing tentatively. We always save tokens while parsing
16129 tentatively so that if the tentative parsing fails we can restore the
16133 cp_parser_parse_tentatively (cp_parser* parser)
16135 /* Enter a new parsing context. */
16136 parser->context = cp_parser_context_new (parser->context);
16137 /* Begin saving tokens. */
16138 cp_lexer_save_tokens (parser->lexer);
16139 /* In order to avoid repetitive access control error messages,
16140 access checks are queued up until we are no longer parsing
16142 push_deferring_access_checks (dk_deferred);
16145 /* Commit to the currently active tentative parse. */
16148 cp_parser_commit_to_tentative_parse (cp_parser* parser)
16150 cp_parser_context *context;
16153 /* Mark all of the levels as committed. */
16154 lexer = parser->lexer;
16155 for (context = parser->context; context->next; context = context->next)
16157 if (context->status == CP_PARSER_STATUS_KIND_COMMITTED)
16159 context->status = CP_PARSER_STATUS_KIND_COMMITTED;
16160 while (!cp_lexer_saving_tokens (lexer))
16161 lexer = lexer->next;
16162 cp_lexer_commit_tokens (lexer);
16166 /* Abort the currently active tentative parse. All consumed tokens
16167 will be rolled back, and no diagnostics will be issued. */
16170 cp_parser_abort_tentative_parse (cp_parser* parser)
16172 cp_parser_simulate_error (parser);
16173 /* Now, pretend that we want to see if the construct was
16174 successfully parsed. */
16175 cp_parser_parse_definitely (parser);
16178 /* Stop parsing tentatively. If a parse error has occurred, restore the
16179 token stream. Otherwise, commit to the tokens we have consumed.
16180 Returns true if no error occurred; false otherwise. */
16183 cp_parser_parse_definitely (cp_parser* parser)
16185 bool error_occurred;
16186 cp_parser_context *context;
16188 /* Remember whether or not an error occurred, since we are about to
16189 destroy that information. */
16190 error_occurred = cp_parser_error_occurred (parser);
16191 /* Remove the topmost context from the stack. */
16192 context = parser->context;
16193 parser->context = context->next;
16194 /* If no parse errors occurred, commit to the tentative parse. */
16195 if (!error_occurred)
16197 /* Commit to the tokens read tentatively, unless that was
16199 if (context->status != CP_PARSER_STATUS_KIND_COMMITTED)
16200 cp_lexer_commit_tokens (parser->lexer);
16202 pop_to_parent_deferring_access_checks ();
16204 /* Otherwise, if errors occurred, roll back our state so that things
16205 are just as they were before we began the tentative parse. */
16208 cp_lexer_rollback_tokens (parser->lexer);
16209 pop_deferring_access_checks ();
16211 /* Add the context to the front of the free list. */
16212 context->next = cp_parser_context_free_list;
16213 cp_parser_context_free_list = context;
16215 return !error_occurred;
16218 /* Returns true if we are parsing tentatively and are not committed to
16219 this tentative parse. */
16222 cp_parser_uncommitted_to_tentative_parse_p (cp_parser* parser)
16224 return (cp_parser_parsing_tentatively (parser)
16225 && parser->context->status != CP_PARSER_STATUS_KIND_COMMITTED);
16228 /* Returns nonzero iff an error has occurred during the most recent
16229 tentative parse. */
16232 cp_parser_error_occurred (cp_parser* parser)
16234 return (cp_parser_parsing_tentatively (parser)
16235 && parser->context->status == CP_PARSER_STATUS_KIND_ERROR);
16238 /* Returns nonzero if GNU extensions are allowed. */
16241 cp_parser_allow_gnu_extensions_p (cp_parser* parser)
16243 return parser->allow_gnu_extensions_p;
16246 /* Objective-C++ Productions */
16249 /* Parse an Objective-C expression, which feeds into a primary-expression
16253 objc-message-expression
16254 objc-string-literal
16255 objc-encode-expression
16256 objc-protocol-expression
16257 objc-selector-expression
16259 Returns a tree representation of the expression. */
16262 cp_parser_objc_expression (cp_parser* parser)
16264 /* Try to figure out what kind of declaration is present. */
16265 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
16269 case CPP_OPEN_SQUARE:
16270 return cp_parser_objc_message_expression (parser);
16272 case CPP_OBJC_STRING:
16273 kwd = cp_lexer_consume_token (parser->lexer);
16274 return objc_build_string_object (kwd->value);
16277 switch (kwd->keyword)
16279 case RID_AT_ENCODE:
16280 return cp_parser_objc_encode_expression (parser);
16282 case RID_AT_PROTOCOL:
16283 return cp_parser_objc_protocol_expression (parser);
16285 case RID_AT_SELECTOR:
16286 return cp_parser_objc_selector_expression (parser);
16292 error ("misplaced %<@%D%> Objective-C++ construct", kwd->value);
16293 cp_parser_skip_to_end_of_block_or_statement (parser);
16296 return error_mark_node;
16299 /* Parse an Objective-C message expression.
16301 objc-message-expression:
16302 [ objc-message-receiver objc-message-args ]
16304 Returns a representation of an Objective-C message. */
16307 cp_parser_objc_message_expression (cp_parser* parser)
16309 tree receiver, messageargs;
16311 cp_lexer_consume_token (parser->lexer); /* Eat '['. */
16312 receiver = cp_parser_objc_message_receiver (parser);
16313 messageargs = cp_parser_objc_message_args (parser);
16314 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
16316 return objc_build_message_expr (build_tree_list (receiver, messageargs));
16319 /* Parse an objc-message-receiver.
16321 objc-message-receiver:
16323 simple-type-specifier
16325 Returns a representation of the type or expression. */
16328 cp_parser_objc_message_receiver (cp_parser* parser)
16332 /* An Objective-C message receiver may be either (1) a type
16333 or (2) an expression. */
16334 cp_parser_parse_tentatively (parser);
16335 rcv = cp_parser_expression (parser, false);
16337 if (cp_parser_parse_definitely (parser))
16340 rcv = cp_parser_simple_type_specifier (parser,
16341 /*decl_specs=*/NULL,
16342 CP_PARSER_FLAGS_NONE);
16344 return objc_get_class_reference (rcv);
16347 /* Parse the arguments and selectors comprising an Objective-C message.
16352 objc-selector-args , objc-comma-args
16354 objc-selector-args:
16355 objc-selector [opt] : assignment-expression
16356 objc-selector-args objc-selector [opt] : assignment-expression
16359 assignment-expression
16360 objc-comma-args , assignment-expression
16362 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
16363 selector arguments and TREE_VALUE containing a list of comma
16367 cp_parser_objc_message_args (cp_parser* parser)
16369 tree sel_args = NULL_TREE, addl_args = NULL_TREE;
16370 bool maybe_unary_selector_p = true;
16371 cp_token *token = cp_lexer_peek_token (parser->lexer);
16373 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
16375 tree selector = NULL_TREE, arg;
16377 if (token->type != CPP_COLON)
16378 selector = cp_parser_objc_selector (parser);
16380 /* Detect if we have a unary selector. */
16381 if (maybe_unary_selector_p
16382 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
16383 return build_tree_list (selector, NULL_TREE);
16385 maybe_unary_selector_p = false;
16386 cp_parser_require (parser, CPP_COLON, "`:'");
16387 arg = cp_parser_assignment_expression (parser, false);
16390 = chainon (sel_args,
16391 build_tree_list (selector, arg));
16393 token = cp_lexer_peek_token (parser->lexer);
16396 /* Handle non-selector arguments, if any. */
16397 while (token->type == CPP_COMMA)
16401 cp_lexer_consume_token (parser->lexer);
16402 arg = cp_parser_assignment_expression (parser, false);
16405 = chainon (addl_args,
16406 build_tree_list (NULL_TREE, arg));
16408 token = cp_lexer_peek_token (parser->lexer);
16411 return build_tree_list (sel_args, addl_args);
16414 /* Parse an Objective-C encode expression.
16416 objc-encode-expression:
16417 @encode objc-typename
16419 Returns an encoded representation of the type argument. */
16422 cp_parser_objc_encode_expression (cp_parser* parser)
16426 cp_lexer_consume_token (parser->lexer); /* Eat '@encode'. */
16427 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
16428 type = complete_type (cp_parser_type_id (parser));
16429 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
16433 error ("%<@encode%> must specify a type as an argument");
16434 return error_mark_node;
16437 return objc_build_encode_expr (type);
16440 /* Parse an Objective-C @defs expression. */
16443 cp_parser_objc_defs_expression (cp_parser *parser)
16447 cp_lexer_consume_token (parser->lexer); /* Eat '@defs'. */
16448 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
16449 name = cp_parser_identifier (parser);
16450 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
16452 return objc_get_class_ivars (name);
16455 /* Parse an Objective-C protocol expression.
16457 objc-protocol-expression:
16458 @protocol ( identifier )
16460 Returns a representation of the protocol expression. */
16463 cp_parser_objc_protocol_expression (cp_parser* parser)
16467 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
16468 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
16469 proto = cp_parser_identifier (parser);
16470 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
16472 return objc_build_protocol_expr (proto);
16475 /* Parse an Objective-C selector expression.
16477 objc-selector-expression:
16478 @selector ( objc-method-signature )
16480 objc-method-signature:
16486 objc-selector-seq objc-selector :
16488 Returns a representation of the method selector. */
16491 cp_parser_objc_selector_expression (cp_parser* parser)
16493 tree sel_seq = NULL_TREE;
16494 bool maybe_unary_selector_p = true;
16497 cp_lexer_consume_token (parser->lexer); /* Eat '@selector'. */
16498 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
16499 token = cp_lexer_peek_token (parser->lexer);
16501 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON
16502 || token->type == CPP_SCOPE)
16504 tree selector = NULL_TREE;
16506 if (token->type != CPP_COLON
16507 || token->type == CPP_SCOPE)
16508 selector = cp_parser_objc_selector (parser);
16510 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON)
16511 && cp_lexer_next_token_is_not (parser->lexer, CPP_SCOPE))
16513 /* Detect if we have a unary selector. */
16514 if (maybe_unary_selector_p)
16516 sel_seq = selector;
16517 goto finish_selector;
16521 cp_parser_error (parser, "expected %<:%>");
16524 maybe_unary_selector_p = false;
16525 token = cp_lexer_consume_token (parser->lexer);
16527 if (token->type == CPP_SCOPE)
16530 = chainon (sel_seq,
16531 build_tree_list (selector, NULL_TREE));
16533 = chainon (sel_seq,
16534 build_tree_list (NULL_TREE, NULL_TREE));
16538 = chainon (sel_seq,
16539 build_tree_list (selector, NULL_TREE));
16541 token = cp_lexer_peek_token (parser->lexer);
16545 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
16547 return objc_build_selector_expr (sel_seq);
16550 /* Parse a list of identifiers.
16552 objc-identifier-list:
16554 objc-identifier-list , identifier
16556 Returns a TREE_LIST of identifier nodes. */
16559 cp_parser_objc_identifier_list (cp_parser* parser)
16561 tree list = build_tree_list (NULL_TREE, cp_parser_identifier (parser));
16562 cp_token *sep = cp_lexer_peek_token (parser->lexer);
16564 while (sep->type == CPP_COMMA)
16566 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
16567 list = chainon (list,
16568 build_tree_list (NULL_TREE,
16569 cp_parser_identifier (parser)));
16570 sep = cp_lexer_peek_token (parser->lexer);
16576 /* Parse an Objective-C alias declaration.
16578 objc-alias-declaration:
16579 @compatibility_alias identifier identifier ;
16581 This function registers the alias mapping with the Objective-C front-end.
16582 It returns nothing. */
16585 cp_parser_objc_alias_declaration (cp_parser* parser)
16589 cp_lexer_consume_token (parser->lexer); /* Eat '@compatibility_alias'. */
16590 alias = cp_parser_identifier (parser);
16591 orig = cp_parser_identifier (parser);
16592 objc_declare_alias (alias, orig);
16593 cp_parser_consume_semicolon_at_end_of_statement (parser);
16596 /* Parse an Objective-C class forward-declaration.
16598 objc-class-declaration:
16599 @class objc-identifier-list ;
16601 The function registers the forward declarations with the Objective-C
16602 front-end. It returns nothing. */
16605 cp_parser_objc_class_declaration (cp_parser* parser)
16607 cp_lexer_consume_token (parser->lexer); /* Eat '@class'. */
16608 objc_declare_class (cp_parser_objc_identifier_list (parser));
16609 cp_parser_consume_semicolon_at_end_of_statement (parser);
16612 /* Parse a list of Objective-C protocol references.
16614 objc-protocol-refs-opt:
16615 objc-protocol-refs [opt]
16617 objc-protocol-refs:
16618 < objc-identifier-list >
16620 Returns a TREE_LIST of identifiers, if any. */
16623 cp_parser_objc_protocol_refs_opt (cp_parser* parser)
16625 tree protorefs = NULL_TREE;
16627 if(cp_lexer_next_token_is (parser->lexer, CPP_LESS))
16629 cp_lexer_consume_token (parser->lexer); /* Eat '<'. */
16630 protorefs = cp_parser_objc_identifier_list (parser);
16631 cp_parser_require (parser, CPP_GREATER, "`>'");
16637 /* Parse a Objective-C visibility specification. */
16640 cp_parser_objc_visibility_spec (cp_parser* parser)
16642 cp_token *vis = cp_lexer_peek_token (parser->lexer);
16644 switch (vis->keyword)
16646 case RID_AT_PRIVATE:
16647 objc_set_visibility (2);
16649 case RID_AT_PROTECTED:
16650 objc_set_visibility (0);
16652 case RID_AT_PUBLIC:
16653 objc_set_visibility (1);
16659 /* Eat '@private'/'@protected'/'@public'. */
16660 cp_lexer_consume_token (parser->lexer);
16663 /* Parse an Objective-C method type. */
16666 cp_parser_objc_method_type (cp_parser* parser)
16668 objc_set_method_type
16669 (cp_lexer_consume_token (parser->lexer)->type == CPP_PLUS
16674 /* Parse an Objective-C protocol qualifier. */
16677 cp_parser_objc_protocol_qualifiers (cp_parser* parser)
16679 tree quals = NULL_TREE, node;
16680 cp_token *token = cp_lexer_peek_token (parser->lexer);
16682 node = token->value;
16684 while (node && TREE_CODE (node) == IDENTIFIER_NODE
16685 && (node == ridpointers [(int) RID_IN]
16686 || node == ridpointers [(int) RID_OUT]
16687 || node == ridpointers [(int) RID_INOUT]
16688 || node == ridpointers [(int) RID_BYCOPY]
16689 || node == ridpointers [(int) RID_BYREF]
16690 || node == ridpointers [(int) RID_ONEWAY]))
16692 quals = tree_cons (NULL_TREE, node, quals);
16693 cp_lexer_consume_token (parser->lexer);
16694 token = cp_lexer_peek_token (parser->lexer);
16695 node = token->value;
16701 /* Parse an Objective-C typename. */
16704 cp_parser_objc_typename (cp_parser* parser)
16706 tree typename = NULL_TREE;
16708 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
16710 tree proto_quals, cp_type = NULL_TREE;
16712 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
16713 proto_quals = cp_parser_objc_protocol_qualifiers (parser);
16715 /* An ObjC type name may consist of just protocol qualifiers, in which
16716 case the type shall default to 'id'. */
16717 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
16718 cp_type = cp_parser_type_id (parser);
16720 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
16721 typename = build_tree_list (proto_quals, cp_type);
16727 /* Check to see if TYPE refers to an Objective-C selector name. */
16730 cp_parser_objc_selector_p (enum cpp_ttype type)
16732 return (type == CPP_NAME || type == CPP_KEYWORD
16733 || type == CPP_AND_AND || type == CPP_AND_EQ || type == CPP_AND
16734 || type == CPP_OR || type == CPP_COMPL || type == CPP_NOT
16735 || type == CPP_NOT_EQ || type == CPP_OR_OR || type == CPP_OR_EQ
16736 || type == CPP_XOR || type == CPP_XOR_EQ);
16739 /* Parse an Objective-C selector. */
16742 cp_parser_objc_selector (cp_parser* parser)
16744 cp_token *token = cp_lexer_consume_token (parser->lexer);
16746 if (!cp_parser_objc_selector_p (token->type))
16748 error ("invalid Objective-C++ selector name");
16749 return error_mark_node;
16752 /* C++ operator names are allowed to appear in ObjC selectors. */
16753 switch (token->type)
16755 case CPP_AND_AND: return get_identifier ("and");
16756 case CPP_AND_EQ: return get_identifier ("and_eq");
16757 case CPP_AND: return get_identifier ("bitand");
16758 case CPP_OR: return get_identifier ("bitor");
16759 case CPP_COMPL: return get_identifier ("compl");
16760 case CPP_NOT: return get_identifier ("not");
16761 case CPP_NOT_EQ: return get_identifier ("not_eq");
16762 case CPP_OR_OR: return get_identifier ("or");
16763 case CPP_OR_EQ: return get_identifier ("or_eq");
16764 case CPP_XOR: return get_identifier ("xor");
16765 case CPP_XOR_EQ: return get_identifier ("xor_eq");
16766 default: return token->value;
16770 /* Parse an Objective-C params list. */
16773 cp_parser_objc_method_keyword_params (cp_parser* parser)
16775 tree params = NULL_TREE;
16776 bool maybe_unary_selector_p = true;
16777 cp_token *token = cp_lexer_peek_token (parser->lexer);
16779 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
16781 tree selector = NULL_TREE, typename, identifier;
16783 if (token->type != CPP_COLON)
16784 selector = cp_parser_objc_selector (parser);
16786 /* Detect if we have a unary selector. */
16787 if (maybe_unary_selector_p
16788 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
16791 maybe_unary_selector_p = false;
16792 cp_parser_require (parser, CPP_COLON, "`:'");
16793 typename = cp_parser_objc_typename (parser);
16794 identifier = cp_parser_identifier (parser);
16798 objc_build_keyword_decl (selector,
16802 token = cp_lexer_peek_token (parser->lexer);
16808 /* Parse the non-keyword Objective-C params. */
16811 cp_parser_objc_method_tail_params_opt (cp_parser* parser, bool *ellipsisp)
16813 tree params = make_node (TREE_LIST);
16814 cp_token *token = cp_lexer_peek_token (parser->lexer);
16815 *ellipsisp = false; /* Initially, assume no ellipsis. */
16817 while (token->type == CPP_COMMA)
16819 cp_parameter_declarator *parmdecl;
16822 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
16823 token = cp_lexer_peek_token (parser->lexer);
16825 if (token->type == CPP_ELLIPSIS)
16827 cp_lexer_consume_token (parser->lexer); /* Eat '...'. */
16832 parmdecl = cp_parser_parameter_declaration (parser, false, NULL);
16833 parm = grokdeclarator (parmdecl->declarator,
16834 &parmdecl->decl_specifiers,
16835 PARM, /*initialized=*/0,
16836 /*attrlist=*/NULL);
16838 chainon (params, build_tree_list (NULL_TREE, parm));
16839 token = cp_lexer_peek_token (parser->lexer);
16845 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
16848 cp_parser_objc_interstitial_code (cp_parser* parser)
16850 cp_token *token = cp_lexer_peek_token (parser->lexer);
16852 /* If the next token is `extern' and the following token is a string
16853 literal, then we have a linkage specification. */
16854 if (token->keyword == RID_EXTERN
16855 && cp_parser_is_string_literal (cp_lexer_peek_nth_token (parser->lexer, 2)))
16856 cp_parser_linkage_specification (parser);
16857 /* Handle #pragma, if any. */
16858 else if (token->type == CPP_PRAGMA)
16859 cp_lexer_handle_pragma (parser->lexer);
16860 /* Allow stray semicolons. */
16861 else if (token->type == CPP_SEMICOLON)
16862 cp_lexer_consume_token (parser->lexer);
16863 /* Finally, try to parse a block-declaration, or a function-definition. */
16865 cp_parser_block_declaration (parser, /*statement_p=*/false);
16868 /* Parse a method signature. */
16871 cp_parser_objc_method_signature (cp_parser* parser)
16873 tree rettype, kwdparms, optparms;
16874 bool ellipsis = false;
16876 cp_parser_objc_method_type (parser);
16877 rettype = cp_parser_objc_typename (parser);
16878 kwdparms = cp_parser_objc_method_keyword_params (parser);
16879 optparms = cp_parser_objc_method_tail_params_opt (parser, &ellipsis);
16881 return objc_build_method_signature (rettype, kwdparms, optparms, ellipsis);
16884 /* Pars an Objective-C method prototype list. */
16887 cp_parser_objc_method_prototype_list (cp_parser* parser)
16889 cp_token *token = cp_lexer_peek_token (parser->lexer);
16891 while (token->keyword != RID_AT_END)
16893 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
16895 objc_add_method_declaration
16896 (cp_parser_objc_method_signature (parser));
16897 cp_parser_consume_semicolon_at_end_of_statement (parser);
16900 /* Allow for interspersed non-ObjC++ code. */
16901 cp_parser_objc_interstitial_code (parser);
16903 token = cp_lexer_peek_token (parser->lexer);
16906 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
16907 objc_finish_interface ();
16910 /* Parse an Objective-C method definition list. */
16913 cp_parser_objc_method_definition_list (cp_parser* parser)
16915 cp_token *token = cp_lexer_peek_token (parser->lexer);
16917 while (token->keyword != RID_AT_END)
16921 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
16923 push_deferring_access_checks (dk_deferred);
16924 objc_start_method_definition
16925 (cp_parser_objc_method_signature (parser));
16927 /* For historical reasons, we accept an optional semicolon. */
16928 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
16929 cp_lexer_consume_token (parser->lexer);
16931 perform_deferred_access_checks ();
16932 stop_deferring_access_checks ();
16933 meth = cp_parser_function_definition_after_declarator (parser,
16935 pop_deferring_access_checks ();
16936 objc_finish_method_definition (meth);
16939 /* Allow for interspersed non-ObjC++ code. */
16940 cp_parser_objc_interstitial_code (parser);
16942 token = cp_lexer_peek_token (parser->lexer);
16945 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
16946 objc_finish_implementation ();
16949 /* Parse Objective-C ivars. */
16952 cp_parser_objc_class_ivars (cp_parser* parser)
16954 cp_token *token = cp_lexer_peek_token (parser->lexer);
16956 if (token->type != CPP_OPEN_BRACE)
16957 return; /* No ivars specified. */
16959 cp_lexer_consume_token (parser->lexer); /* Eat '{'. */
16960 token = cp_lexer_peek_token (parser->lexer);
16962 while (token->type != CPP_CLOSE_BRACE)
16964 cp_decl_specifier_seq declspecs;
16965 int decl_class_or_enum_p;
16966 tree prefix_attributes;
16968 cp_parser_objc_visibility_spec (parser);
16970 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
16973 cp_parser_decl_specifier_seq (parser,
16974 CP_PARSER_FLAGS_OPTIONAL,
16976 &decl_class_or_enum_p);
16977 prefix_attributes = declspecs.attributes;
16978 declspecs.attributes = NULL_TREE;
16980 /* Keep going until we hit the `;' at the end of the
16982 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
16984 tree width = NULL_TREE, attributes, first_attribute, decl;
16985 cp_declarator *declarator = NULL;
16986 int ctor_dtor_or_conv_p;
16988 /* Check for a (possibly unnamed) bitfield declaration. */
16989 token = cp_lexer_peek_token (parser->lexer);
16990 if (token->type == CPP_COLON)
16993 if (token->type == CPP_NAME
16994 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
16997 /* Get the name of the bitfield. */
16998 declarator = make_id_declarator (NULL_TREE,
16999 cp_parser_identifier (parser));
17002 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
17003 /* Get the width of the bitfield. */
17005 = cp_parser_constant_expression (parser,
17006 /*allow_non_constant=*/false,
17011 /* Parse the declarator. */
17013 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
17014 &ctor_dtor_or_conv_p,
17015 /*parenthesized_p=*/NULL,
17016 /*member_p=*/false);
17019 /* Look for attributes that apply to the ivar. */
17020 attributes = cp_parser_attributes_opt (parser);
17021 /* Remember which attributes are prefix attributes and
17023 first_attribute = attributes;
17024 /* Combine the attributes. */
17025 attributes = chainon (prefix_attributes, attributes);
17029 /* Create the bitfield declaration. */
17030 decl = grokbitfield (declarator, &declspecs, width);
17031 cplus_decl_attributes (&decl, attributes, /*flags=*/0);
17034 decl = grokfield (declarator, &declspecs, NULL_TREE,
17035 NULL_TREE, attributes);
17037 /* Add the instance variable. */
17038 objc_add_instance_variable (decl);
17040 /* Reset PREFIX_ATTRIBUTES. */
17041 while (attributes && TREE_CHAIN (attributes) != first_attribute)
17042 attributes = TREE_CHAIN (attributes);
17044 TREE_CHAIN (attributes) = NULL_TREE;
17046 token = cp_lexer_peek_token (parser->lexer);
17048 if (token->type == CPP_COMMA)
17050 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
17056 cp_parser_consume_semicolon_at_end_of_statement (parser);
17057 token = cp_lexer_peek_token (parser->lexer);
17060 cp_lexer_consume_token (parser->lexer); /* Eat '}'. */
17061 /* For historical reasons, we accept an optional semicolon. */
17062 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
17063 cp_lexer_consume_token (parser->lexer);
17066 /* Parse an Objective-C protocol declaration. */
17069 cp_parser_objc_protocol_declaration (cp_parser* parser)
17071 tree proto, protorefs;
17074 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
17075 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME))
17077 error ("identifier expected after %<@protocol%>");
17081 /* See if we have a forward declaration or a definition. */
17082 tok = cp_lexer_peek_nth_token (parser->lexer, 2);
17084 /* Try a forward declaration first. */
17085 if (tok->type == CPP_COMMA || tok->type == CPP_SEMICOLON)
17087 objc_declare_protocols (cp_parser_objc_identifier_list (parser));
17089 cp_parser_consume_semicolon_at_end_of_statement (parser);
17092 /* Ok, we got a full-fledged definition (or at least should). */
17095 proto = cp_parser_identifier (parser);
17096 protorefs = cp_parser_objc_protocol_refs_opt (parser);
17097 objc_start_protocol (proto, protorefs);
17098 cp_parser_objc_method_prototype_list (parser);
17102 /* Parse an Objective-C superclass or category. */
17105 cp_parser_objc_superclass_or_category (cp_parser *parser, tree *super,
17108 cp_token *next = cp_lexer_peek_token (parser->lexer);
17110 *super = *categ = NULL_TREE;
17111 if (next->type == CPP_COLON)
17113 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
17114 *super = cp_parser_identifier (parser);
17116 else if (next->type == CPP_OPEN_PAREN)
17118 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
17119 *categ = cp_parser_identifier (parser);
17120 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17124 /* Parse an Objective-C class interface. */
17127 cp_parser_objc_class_interface (cp_parser* parser)
17129 tree name, super, categ, protos;
17131 cp_lexer_consume_token (parser->lexer); /* Eat '@interface'. */
17132 name = cp_parser_identifier (parser);
17133 cp_parser_objc_superclass_or_category (parser, &super, &categ);
17134 protos = cp_parser_objc_protocol_refs_opt (parser);
17136 /* We have either a class or a category on our hands. */
17138 objc_start_category_interface (name, categ, protos);
17141 objc_start_class_interface (name, super, protos);
17142 /* Handle instance variable declarations, if any. */
17143 cp_parser_objc_class_ivars (parser);
17144 objc_continue_interface ();
17147 cp_parser_objc_method_prototype_list (parser);
17150 /* Parse an Objective-C class implementation. */
17153 cp_parser_objc_class_implementation (cp_parser* parser)
17155 tree name, super, categ;
17157 cp_lexer_consume_token (parser->lexer); /* Eat '@implementation'. */
17158 name = cp_parser_identifier (parser);
17159 cp_parser_objc_superclass_or_category (parser, &super, &categ);
17161 /* We have either a class or a category on our hands. */
17163 objc_start_category_implementation (name, categ);
17166 objc_start_class_implementation (name, super);
17167 /* Handle instance variable declarations, if any. */
17168 cp_parser_objc_class_ivars (parser);
17169 objc_continue_implementation ();
17172 cp_parser_objc_method_definition_list (parser);
17175 /* Consume the @end token and finish off the implementation. */
17178 cp_parser_objc_end_implementation (cp_parser* parser)
17180 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
17181 objc_finish_implementation ();
17184 /* Parse an Objective-C declaration. */
17187 cp_parser_objc_declaration (cp_parser* parser)
17189 /* Try to figure out what kind of declaration is present. */
17190 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
17192 switch (kwd->keyword)
17195 cp_parser_objc_alias_declaration (parser);
17198 cp_parser_objc_class_declaration (parser);
17200 case RID_AT_PROTOCOL:
17201 cp_parser_objc_protocol_declaration (parser);
17203 case RID_AT_INTERFACE:
17204 cp_parser_objc_class_interface (parser);
17206 case RID_AT_IMPLEMENTATION:
17207 cp_parser_objc_class_implementation (parser);
17210 cp_parser_objc_end_implementation (parser);
17213 error ("misplaced %<@%D%> Objective-C++ construct", kwd->value);
17214 cp_parser_skip_to_end_of_block_or_statement (parser);
17218 /* Parse an Objective-C try-catch-finally statement.
17220 objc-try-catch-finally-stmt:
17221 @try compound-statement objc-catch-clause-seq [opt]
17222 objc-finally-clause [opt]
17224 objc-catch-clause-seq:
17225 objc-catch-clause objc-catch-clause-seq [opt]
17228 @catch ( exception-declaration ) compound-statement
17230 objc-finally-clause
17231 @finally compound-statement
17233 Returns NULL_TREE. */
17236 cp_parser_objc_try_catch_finally_statement (cp_parser *parser) {
17237 location_t location;
17240 cp_parser_require_keyword (parser, RID_AT_TRY, "`@try'");
17241 location = cp_lexer_peek_token (parser->lexer)->location;
17242 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
17243 node, lest it get absorbed into the surrounding block. */
17244 stmt = push_stmt_list ();
17245 cp_parser_compound_statement (parser, NULL, false);
17246 objc_begin_try_stmt (location, pop_stmt_list (stmt));
17248 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_CATCH))
17250 cp_parameter_declarator *parmdecl;
17253 cp_lexer_consume_token (parser->lexer);
17254 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
17255 parmdecl = cp_parser_parameter_declaration (parser, false, NULL);
17256 parm = grokdeclarator (parmdecl->declarator,
17257 &parmdecl->decl_specifiers,
17258 PARM, /*initialized=*/0,
17259 /*attrlist=*/NULL);
17260 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17261 objc_begin_catch_clause (parm);
17262 cp_parser_compound_statement (parser, NULL, false);
17263 objc_finish_catch_clause ();
17266 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_FINALLY))
17268 cp_lexer_consume_token (parser->lexer);
17269 location = cp_lexer_peek_token (parser->lexer)->location;
17270 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
17271 node, lest it get absorbed into the surrounding block. */
17272 stmt = push_stmt_list ();
17273 cp_parser_compound_statement (parser, NULL, false);
17274 objc_build_finally_clause (location, pop_stmt_list (stmt));
17277 return objc_finish_try_stmt ();
17280 /* Parse an Objective-C synchronized statement.
17282 objc-synchronized-stmt:
17283 @synchronized ( expression ) compound-statement
17285 Returns NULL_TREE. */
17288 cp_parser_objc_synchronized_statement (cp_parser *parser) {
17289 location_t location;
17292 cp_parser_require_keyword (parser, RID_AT_SYNCHRONIZED, "`@synchronized'");
17294 location = cp_lexer_peek_token (parser->lexer)->location;
17295 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
17296 lock = cp_parser_expression (parser, false);
17297 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17299 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
17300 node, lest it get absorbed into the surrounding block. */
17301 stmt = push_stmt_list ();
17302 cp_parser_compound_statement (parser, NULL, false);
17304 return objc_build_synchronized (location, lock, pop_stmt_list (stmt));
17307 /* Parse an Objective-C throw statement.
17310 @throw assignment-expression [opt] ;
17312 Returns a constructed '@throw' statement. */
17315 cp_parser_objc_throw_statement (cp_parser *parser) {
17316 tree expr = NULL_TREE;
17318 cp_parser_require_keyword (parser, RID_AT_THROW, "`@throw'");
17320 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
17321 expr = cp_parser_assignment_expression (parser, false);
17323 cp_parser_consume_semicolon_at_end_of_statement (parser);
17325 return objc_build_throw_stmt (expr);
17328 /* Parse an Objective-C statement. */
17331 cp_parser_objc_statement (cp_parser * parser) {
17332 /* Try to figure out what kind of declaration is present. */
17333 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
17335 switch (kwd->keyword)
17338 return cp_parser_objc_try_catch_finally_statement (parser);
17339 case RID_AT_SYNCHRONIZED:
17340 return cp_parser_objc_synchronized_statement (parser);
17342 return cp_parser_objc_throw_statement (parser);
17344 error ("misplaced %<@%D%> Objective-C++ construct", kwd->value);
17345 cp_parser_skip_to_end_of_block_or_statement (parser);
17348 return error_mark_node;
17353 static GTY (()) cp_parser *the_parser;
17355 /* External interface. */
17357 /* Parse one entire translation unit. */
17360 c_parse_file (void)
17362 bool error_occurred;
17363 static bool already_called = false;
17365 if (already_called)
17367 sorry ("inter-module optimizations not implemented for C++");
17370 already_called = true;
17372 the_parser = cp_parser_new ();
17373 push_deferring_access_checks (flag_access_control
17374 ? dk_no_deferred : dk_no_check);
17375 error_occurred = cp_parser_translation_unit (the_parser);
17379 /* This variable must be provided by every front end. */
17383 #include "gt-cp-parser.h"