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 ADDRESS_P, then we use finish_qualified_id_expr so
9103 that we get a pointer-to-member, if appropriate.
9104 However, if ADDRESS_P is false, we don't want to turn
9105 "T::f" into "(*this).T::f". */
9106 if (qualifying_class && address_p)
9107 argument = finish_qualified_id_expr (qualifying_class,
9110 /*address_p=*/true);
9111 else if (TREE_CODE (argument) == BASELINK)
9112 /* We don't need the information about what class was used
9113 to name the overloaded functions. */
9114 argument = BASELINK_FUNCTIONS (argument);
9116 if (TREE_CODE (argument) == VAR_DECL)
9118 /* A variable without external linkage might still be a
9119 valid constant-expression, so no error is issued here
9120 if the external-linkage check fails. */
9121 if (!DECL_EXTERNAL_LINKAGE_P (argument))
9122 cp_parser_simulate_error (parser);
9124 else if (is_overloaded_fn (argument))
9125 /* All overloaded functions are allowed; if the external
9126 linkage test does not pass, an error will be issued
9130 && (TREE_CODE (argument) == OFFSET_REF
9131 || TREE_CODE (argument) == SCOPE_REF))
9132 /* A pointer-to-member. */
9134 else if (TREE_CODE (argument) == TEMPLATE_PARM_INDEX)
9137 cp_parser_simulate_error (parser);
9139 if (cp_parser_parse_definitely (parser))
9142 argument = build_x_unary_op (ADDR_EXPR, argument);
9147 /* If the argument started with "&", there are no other valid
9148 alternatives at this point. */
9151 cp_parser_error (parser, "invalid non-type template argument");
9152 return error_mark_node;
9155 /* If the argument wasn't successfully parsed as a type-id followed
9156 by '>>', the argument can only be a constant expression now.
9157 Otherwise, we try parsing the constant-expression tentatively,
9158 because the argument could really be a type-id. */
9160 cp_parser_parse_tentatively (parser);
9161 argument = cp_parser_constant_expression (parser,
9162 /*allow_non_constant_p=*/false,
9163 /*non_constant_p=*/NULL);
9164 argument = fold_non_dependent_expr (argument);
9167 if (!cp_parser_next_token_ends_template_argument_p (parser))
9168 cp_parser_error (parser, "expected template-argument");
9169 if (cp_parser_parse_definitely (parser))
9171 /* We did our best to parse the argument as a non type-id, but that
9172 was the only alternative that matched (albeit with a '>' after
9173 it). We can assume it's just a typo from the user, and a
9174 diagnostic will then be issued. */
9175 return cp_parser_type_id (parser);
9178 /* Parse an explicit-instantiation.
9180 explicit-instantiation:
9181 template declaration
9183 Although the standard says `declaration', what it really means is:
9185 explicit-instantiation:
9186 template decl-specifier-seq [opt] declarator [opt] ;
9188 Things like `template int S<int>::i = 5, int S<double>::j;' are not
9189 supposed to be allowed. A defect report has been filed about this
9194 explicit-instantiation:
9195 storage-class-specifier template
9196 decl-specifier-seq [opt] declarator [opt] ;
9197 function-specifier template
9198 decl-specifier-seq [opt] declarator [opt] ; */
9201 cp_parser_explicit_instantiation (cp_parser* parser)
9203 int declares_class_or_enum;
9204 cp_decl_specifier_seq decl_specifiers;
9205 tree extension_specifier = NULL_TREE;
9207 /* Look for an (optional) storage-class-specifier or
9208 function-specifier. */
9209 if (cp_parser_allow_gnu_extensions_p (parser))
9212 = cp_parser_storage_class_specifier_opt (parser);
9213 if (!extension_specifier)
9215 = cp_parser_function_specifier_opt (parser,
9216 /*decl_specs=*/NULL);
9219 /* Look for the `template' keyword. */
9220 cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'");
9221 /* Let the front end know that we are processing an explicit
9223 begin_explicit_instantiation ();
9224 /* [temp.explicit] says that we are supposed to ignore access
9225 control while processing explicit instantiation directives. */
9226 push_deferring_access_checks (dk_no_check);
9227 /* Parse a decl-specifier-seq. */
9228 cp_parser_decl_specifier_seq (parser,
9229 CP_PARSER_FLAGS_OPTIONAL,
9231 &declares_class_or_enum);
9232 /* If there was exactly one decl-specifier, and it declared a class,
9233 and there's no declarator, then we have an explicit type
9235 if (declares_class_or_enum && cp_parser_declares_only_class_p (parser))
9239 type = check_tag_decl (&decl_specifiers);
9240 /* Turn access control back on for names used during
9241 template instantiation. */
9242 pop_deferring_access_checks ();
9244 do_type_instantiation (type, extension_specifier, /*complain=*/1);
9248 cp_declarator *declarator;
9251 /* Parse the declarator. */
9253 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
9254 /*ctor_dtor_or_conv_p=*/NULL,
9255 /*parenthesized_p=*/NULL,
9256 /*member_p=*/false);
9257 if (declares_class_or_enum & 2)
9258 cp_parser_check_for_definition_in_return_type (declarator,
9259 decl_specifiers.type);
9260 if (declarator != cp_error_declarator)
9262 decl = grokdeclarator (declarator, &decl_specifiers,
9264 /* Turn access control back on for names used during
9265 template instantiation. */
9266 pop_deferring_access_checks ();
9267 /* Do the explicit instantiation. */
9268 do_decl_instantiation (decl, extension_specifier);
9272 pop_deferring_access_checks ();
9273 /* Skip the body of the explicit instantiation. */
9274 cp_parser_skip_to_end_of_statement (parser);
9277 /* We're done with the instantiation. */
9278 end_explicit_instantiation ();
9280 cp_parser_consume_semicolon_at_end_of_statement (parser);
9283 /* Parse an explicit-specialization.
9285 explicit-specialization:
9286 template < > declaration
9288 Although the standard says `declaration', what it really means is:
9290 explicit-specialization:
9291 template <> decl-specifier [opt] init-declarator [opt] ;
9292 template <> function-definition
9293 template <> explicit-specialization
9294 template <> template-declaration */
9297 cp_parser_explicit_specialization (cp_parser* parser)
9299 /* Look for the `template' keyword. */
9300 cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'");
9301 /* Look for the `<'. */
9302 cp_parser_require (parser, CPP_LESS, "`<'");
9303 /* Look for the `>'. */
9304 cp_parser_require (parser, CPP_GREATER, "`>'");
9305 /* We have processed another parameter list. */
9306 ++parser->num_template_parameter_lists;
9307 /* Let the front end know that we are beginning a specialization. */
9308 begin_specialization ();
9310 /* If the next keyword is `template', we need to figure out whether
9311 or not we're looking a template-declaration. */
9312 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
9314 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
9315 && cp_lexer_peek_nth_token (parser->lexer, 3)->type != CPP_GREATER)
9316 cp_parser_template_declaration_after_export (parser,
9317 /*member_p=*/false);
9319 cp_parser_explicit_specialization (parser);
9322 /* Parse the dependent declaration. */
9323 cp_parser_single_declaration (parser,
9327 /* We're done with the specialization. */
9328 end_specialization ();
9329 /* We're done with this parameter list. */
9330 --parser->num_template_parameter_lists;
9333 /* Parse a type-specifier.
9336 simple-type-specifier
9339 elaborated-type-specifier
9347 Returns a representation of the type-specifier. For a
9348 class-specifier, enum-specifier, or elaborated-type-specifier, a
9349 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
9351 The parser flags FLAGS is used to control type-specifier parsing.
9353 If IS_DECLARATION is TRUE, then this type-specifier is appearing
9354 in a decl-specifier-seq.
9356 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
9357 class-specifier, enum-specifier, or elaborated-type-specifier, then
9358 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
9359 if a type is declared; 2 if it is defined. Otherwise, it is set to
9362 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
9363 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
9367 cp_parser_type_specifier (cp_parser* parser,
9368 cp_parser_flags flags,
9369 cp_decl_specifier_seq *decl_specs,
9370 bool is_declaration,
9371 int* declares_class_or_enum,
9372 bool* is_cv_qualifier)
9374 tree type_spec = NULL_TREE;
9377 cp_decl_spec ds = ds_last;
9379 /* Assume this type-specifier does not declare a new type. */
9380 if (declares_class_or_enum)
9381 *declares_class_or_enum = 0;
9382 /* And that it does not specify a cv-qualifier. */
9383 if (is_cv_qualifier)
9384 *is_cv_qualifier = false;
9385 /* Peek at the next token. */
9386 token = cp_lexer_peek_token (parser->lexer);
9388 /* If we're looking at a keyword, we can use that to guide the
9389 production we choose. */
9390 keyword = token->keyword;
9394 /* 'enum' [identifier] '{' introduces an enum-specifier;
9395 'enum' <anything else> introduces an elaborated-type-specifier. */
9396 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_OPEN_BRACE
9397 || (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_NAME
9398 && cp_lexer_peek_nth_token (parser->lexer, 3)->type
9401 if (parser->num_template_parameter_lists)
9403 error ("template declaration of %qs", "enum");
9404 cp_parser_skip_to_end_of_block_or_statement (parser);
9405 type_spec = error_mark_node;
9408 type_spec = cp_parser_enum_specifier (parser);
9410 if (declares_class_or_enum)
9411 *declares_class_or_enum = 2;
9413 cp_parser_set_decl_spec_type (decl_specs,
9415 /*user_defined_p=*/true);
9419 goto elaborated_type_specifier;
9421 /* Any of these indicate either a class-specifier, or an
9422 elaborated-type-specifier. */
9426 /* Parse tentatively so that we can back up if we don't find a
9428 cp_parser_parse_tentatively (parser);
9429 /* Look for the class-specifier. */
9430 type_spec = cp_parser_class_specifier (parser);
9431 /* If that worked, we're done. */
9432 if (cp_parser_parse_definitely (parser))
9434 if (declares_class_or_enum)
9435 *declares_class_or_enum = 2;
9437 cp_parser_set_decl_spec_type (decl_specs,
9439 /*user_defined_p=*/true);
9444 elaborated_type_specifier:
9445 /* We're declaring (not defining) a class or enum. */
9446 if (declares_class_or_enum)
9447 *declares_class_or_enum = 1;
9451 /* Look for an elaborated-type-specifier. */
9453 = (cp_parser_elaborated_type_specifier
9455 decl_specs && decl_specs->specs[(int) ds_friend],
9458 cp_parser_set_decl_spec_type (decl_specs,
9460 /*user_defined_p=*/true);
9465 if (is_cv_qualifier)
9466 *is_cv_qualifier = true;
9471 if (is_cv_qualifier)
9472 *is_cv_qualifier = true;
9477 if (is_cv_qualifier)
9478 *is_cv_qualifier = true;
9482 /* The `__complex__' keyword is a GNU extension. */
9490 /* Handle simple keywords. */
9495 ++decl_specs->specs[(int)ds];
9496 decl_specs->any_specifiers_p = true;
9498 return cp_lexer_consume_token (parser->lexer)->value;
9501 /* If we do not already have a type-specifier, assume we are looking
9502 at a simple-type-specifier. */
9503 type_spec = cp_parser_simple_type_specifier (parser,
9507 /* If we didn't find a type-specifier, and a type-specifier was not
9508 optional in this context, issue an error message. */
9509 if (!type_spec && !(flags & CP_PARSER_FLAGS_OPTIONAL))
9511 cp_parser_error (parser, "expected type specifier");
9512 return error_mark_node;
9518 /* Parse a simple-type-specifier.
9520 simple-type-specifier:
9521 :: [opt] nested-name-specifier [opt] type-name
9522 :: [opt] nested-name-specifier template template-id
9537 simple-type-specifier:
9538 __typeof__ unary-expression
9539 __typeof__ ( type-id )
9541 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
9542 appropriately updated. */
9545 cp_parser_simple_type_specifier (cp_parser* parser,
9546 cp_decl_specifier_seq *decl_specs,
9547 cp_parser_flags flags)
9549 tree type = NULL_TREE;
9552 /* Peek at the next token. */
9553 token = cp_lexer_peek_token (parser->lexer);
9555 /* If we're looking at a keyword, things are easy. */
9556 switch (token->keyword)
9560 decl_specs->explicit_char_p = true;
9561 type = char_type_node;
9564 type = wchar_type_node;
9567 type = boolean_type_node;
9571 ++decl_specs->specs[(int) ds_short];
9572 type = short_integer_type_node;
9576 decl_specs->explicit_int_p = true;
9577 type = integer_type_node;
9581 ++decl_specs->specs[(int) ds_long];
9582 type = long_integer_type_node;
9586 ++decl_specs->specs[(int) ds_signed];
9587 type = integer_type_node;
9591 ++decl_specs->specs[(int) ds_unsigned];
9592 type = unsigned_type_node;
9595 type = float_type_node;
9598 type = double_type_node;
9601 type = void_type_node;
9605 /* Consume the `typeof' token. */
9606 cp_lexer_consume_token (parser->lexer);
9607 /* Parse the operand to `typeof'. */
9608 type = cp_parser_sizeof_operand (parser, RID_TYPEOF);
9609 /* If it is not already a TYPE, take its type. */
9611 type = finish_typeof (type);
9614 cp_parser_set_decl_spec_type (decl_specs, type,
9615 /*user_defined_p=*/true);
9623 /* If the type-specifier was for a built-in type, we're done. */
9628 /* Record the type. */
9630 && (token->keyword != RID_SIGNED
9631 && token->keyword != RID_UNSIGNED
9632 && token->keyword != RID_SHORT
9633 && token->keyword != RID_LONG))
9634 cp_parser_set_decl_spec_type (decl_specs,
9636 /*user_defined=*/false);
9638 decl_specs->any_specifiers_p = true;
9640 /* Consume the token. */
9641 id = cp_lexer_consume_token (parser->lexer)->value;
9643 /* There is no valid C++ program where a non-template type is
9644 followed by a "<". That usually indicates that the user thought
9645 that the type was a template. */
9646 cp_parser_check_for_invalid_template_id (parser, type);
9648 return TYPE_NAME (type);
9651 /* The type-specifier must be a user-defined type. */
9652 if (!(flags & CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES))
9657 /* Don't gobble tokens or issue error messages if this is an
9658 optional type-specifier. */
9659 if (flags & CP_PARSER_FLAGS_OPTIONAL)
9660 cp_parser_parse_tentatively (parser);
9662 /* Look for the optional `::' operator. */
9664 = (cp_parser_global_scope_opt (parser,
9665 /*current_scope_valid_p=*/false)
9667 /* Look for the nested-name specifier. */
9669 = (cp_parser_nested_name_specifier_opt (parser,
9670 /*typename_keyword_p=*/false,
9671 /*check_dependency_p=*/true,
9673 /*is_declaration=*/false)
9675 /* If we have seen a nested-name-specifier, and the next token
9676 is `template', then we are using the template-id production. */
9678 && cp_parser_optional_template_keyword (parser))
9680 /* Look for the template-id. */
9681 type = cp_parser_template_id (parser,
9682 /*template_keyword_p=*/true,
9683 /*check_dependency_p=*/true,
9684 /*is_declaration=*/false);
9685 /* If the template-id did not name a type, we are out of
9687 if (TREE_CODE (type) != TYPE_DECL)
9689 cp_parser_error (parser, "expected template-id for type");
9693 /* Otherwise, look for a type-name. */
9695 type = cp_parser_type_name (parser);
9696 /* Keep track of all name-lookups performed in class scopes. */
9700 && TREE_CODE (type) == TYPE_DECL
9701 && TREE_CODE (DECL_NAME (type)) == IDENTIFIER_NODE)
9702 maybe_note_name_used_in_class (DECL_NAME (type), type);
9703 /* If it didn't work out, we don't have a TYPE. */
9704 if ((flags & CP_PARSER_FLAGS_OPTIONAL)
9705 && !cp_parser_parse_definitely (parser))
9707 if (type && decl_specs)
9708 cp_parser_set_decl_spec_type (decl_specs, type,
9709 /*user_defined=*/true);
9712 /* If we didn't get a type-name, issue an error message. */
9713 if (!type && !(flags & CP_PARSER_FLAGS_OPTIONAL))
9715 cp_parser_error (parser, "expected type-name");
9716 return error_mark_node;
9719 /* There is no valid C++ program where a non-template type is
9720 followed by a "<". That usually indicates that the user thought
9721 that the type was a template. */
9722 if (type && type != error_mark_node)
9724 /* As a last-ditch effort, see if TYPE is an Objective-C type.
9725 If it is, then the '<'...'>' enclose protocol names rather than
9726 template arguments, and so everything is fine. */
9727 if (c_dialect_objc ()
9728 && (objc_is_id (type) || objc_is_class_name (type)))
9730 tree protos = cp_parser_objc_protocol_refs_opt (parser);
9731 tree qual_type = objc_get_protocol_qualified_type (type, protos);
9733 /* Clobber the "unqualified" type previously entered into
9734 DECL_SPECS with the new, improved protocol-qualified version. */
9736 decl_specs->type = qual_type;
9741 cp_parser_check_for_invalid_template_id (parser, TREE_TYPE (type));
9747 /* Parse a type-name.
9760 Returns a TYPE_DECL for the type. */
9763 cp_parser_type_name (cp_parser* parser)
9768 /* We can't know yet whether it is a class-name or not. */
9769 cp_parser_parse_tentatively (parser);
9770 /* Try a class-name. */
9771 type_decl = cp_parser_class_name (parser,
9772 /*typename_keyword_p=*/false,
9773 /*template_keyword_p=*/false,
9775 /*check_dependency_p=*/true,
9776 /*class_head_p=*/false,
9777 /*is_declaration=*/false);
9778 /* If it's not a class-name, keep looking. */
9779 if (!cp_parser_parse_definitely (parser))
9781 /* It must be a typedef-name or an enum-name. */
9782 identifier = cp_parser_identifier (parser);
9783 if (identifier == error_mark_node)
9784 return error_mark_node;
9786 /* Look up the type-name. */
9787 type_decl = cp_parser_lookup_name_simple (parser, identifier);
9789 if (TREE_CODE (type_decl) != TYPE_DECL
9790 && (objc_is_id (identifier) || objc_is_class_name (identifier)))
9792 /* See if this is an Objective-C type. */
9793 tree protos = cp_parser_objc_protocol_refs_opt (parser);
9794 tree type = objc_get_protocol_qualified_type (identifier, protos);
9796 type_decl = TYPE_NAME (type);
9799 /* Issue an error if we did not find a type-name. */
9800 if (TREE_CODE (type_decl) != TYPE_DECL)
9802 if (!cp_parser_simulate_error (parser))
9803 cp_parser_name_lookup_error (parser, identifier, type_decl,
9805 type_decl = error_mark_node;
9807 /* Remember that the name was used in the definition of the
9808 current class so that we can check later to see if the
9809 meaning would have been different after the class was
9810 entirely defined. */
9811 else if (type_decl != error_mark_node
9813 maybe_note_name_used_in_class (identifier, type_decl);
9820 /* Parse an elaborated-type-specifier. Note that the grammar given
9821 here incorporates the resolution to DR68.
9823 elaborated-type-specifier:
9824 class-key :: [opt] nested-name-specifier [opt] identifier
9825 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
9826 enum :: [opt] nested-name-specifier [opt] identifier
9827 typename :: [opt] nested-name-specifier identifier
9828 typename :: [opt] nested-name-specifier template [opt]
9833 elaborated-type-specifier:
9834 class-key attributes :: [opt] nested-name-specifier [opt] identifier
9835 class-key attributes :: [opt] nested-name-specifier [opt]
9836 template [opt] template-id
9837 enum attributes :: [opt] nested-name-specifier [opt] identifier
9839 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
9840 declared `friend'. If IS_DECLARATION is TRUE, then this
9841 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
9842 something is being declared.
9844 Returns the TYPE specified. */
9847 cp_parser_elaborated_type_specifier (cp_parser* parser,
9849 bool is_declaration)
9851 enum tag_types tag_type;
9853 tree type = NULL_TREE;
9854 tree attributes = NULL_TREE;
9856 /* See if we're looking at the `enum' keyword. */
9857 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ENUM))
9859 /* Consume the `enum' token. */
9860 cp_lexer_consume_token (parser->lexer);
9861 /* Remember that it's an enumeration type. */
9862 tag_type = enum_type;
9863 /* Parse the attributes. */
9864 attributes = cp_parser_attributes_opt (parser);
9866 /* Or, it might be `typename'. */
9867 else if (cp_lexer_next_token_is_keyword (parser->lexer,
9870 /* Consume the `typename' token. */
9871 cp_lexer_consume_token (parser->lexer);
9872 /* Remember that it's a `typename' type. */
9873 tag_type = typename_type;
9874 /* The `typename' keyword is only allowed in templates. */
9875 if (!processing_template_decl)
9876 pedwarn ("using %<typename%> outside of template");
9878 /* Otherwise it must be a class-key. */
9881 tag_type = cp_parser_class_key (parser);
9882 if (tag_type == none_type)
9883 return error_mark_node;
9884 /* Parse the attributes. */
9885 attributes = cp_parser_attributes_opt (parser);
9888 /* Look for the `::' operator. */
9889 cp_parser_global_scope_opt (parser,
9890 /*current_scope_valid_p=*/false);
9891 /* Look for the nested-name-specifier. */
9892 if (tag_type == typename_type)
9894 if (!cp_parser_nested_name_specifier (parser,
9895 /*typename_keyword_p=*/true,
9896 /*check_dependency_p=*/true,
9899 return error_mark_node;
9902 /* Even though `typename' is not present, the proposed resolution
9903 to Core Issue 180 says that in `class A<T>::B', `B' should be
9904 considered a type-name, even if `A<T>' is dependent. */
9905 cp_parser_nested_name_specifier_opt (parser,
9906 /*typename_keyword_p=*/true,
9907 /*check_dependency_p=*/true,
9910 /* For everything but enumeration types, consider a template-id. */
9911 if (tag_type != enum_type)
9913 bool template_p = false;
9916 /* Allow the `template' keyword. */
9917 template_p = cp_parser_optional_template_keyword (parser);
9918 /* If we didn't see `template', we don't know if there's a
9919 template-id or not. */
9921 cp_parser_parse_tentatively (parser);
9922 /* Parse the template-id. */
9923 decl = cp_parser_template_id (parser, template_p,
9924 /*check_dependency_p=*/true,
9926 /* If we didn't find a template-id, look for an ordinary
9928 if (!template_p && !cp_parser_parse_definitely (parser))
9930 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
9931 in effect, then we must assume that, upon instantiation, the
9932 template will correspond to a class. */
9933 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
9934 && tag_type == typename_type)
9935 type = make_typename_type (parser->scope, decl,
9939 type = TREE_TYPE (decl);
9942 /* For an enumeration type, consider only a plain identifier. */
9945 identifier = cp_parser_identifier (parser);
9947 if (identifier == error_mark_node)
9949 parser->scope = NULL_TREE;
9950 return error_mark_node;
9953 /* For a `typename', we needn't call xref_tag. */
9954 if (tag_type == typename_type
9955 && TREE_CODE (parser->scope) != NAMESPACE_DECL)
9956 return cp_parser_make_typename_type (parser, parser->scope,
9958 /* Look up a qualified name in the usual way. */
9963 decl = cp_parser_lookup_name (parser, identifier,
9965 /*is_template=*/false,
9966 /*is_namespace=*/false,
9967 /*check_dependency=*/true,
9968 /*ambiguous_p=*/NULL);
9970 /* If we are parsing friend declaration, DECL may be a
9971 TEMPLATE_DECL tree node here. However, we need to check
9972 whether this TEMPLATE_DECL results in valid code. Consider
9973 the following example:
9976 template <class T> class C {};
9979 template <class T> friend class N::C; // #1, valid code
9981 template <class T> class Y {
9982 friend class N::C; // #2, invalid code
9985 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
9986 name lookup of `N::C'. We see that friend declaration must
9987 be template for the code to be valid. Note that
9988 processing_template_decl does not work here since it is
9989 always 1 for the above two cases. */
9991 decl = (cp_parser_maybe_treat_template_as_class
9992 (decl, /*tag_name_p=*/is_friend
9993 && parser->num_template_parameter_lists));
9995 if (TREE_CODE (decl) != TYPE_DECL)
9997 cp_parser_diagnose_invalid_type_name (parser,
10000 return error_mark_node;
10003 if (TREE_CODE (TREE_TYPE (decl)) != TYPENAME_TYPE)
10004 check_elaborated_type_specifier
10006 (parser->num_template_parameter_lists
10007 || DECL_SELF_REFERENCE_P (decl)));
10009 type = TREE_TYPE (decl);
10013 /* An elaborated-type-specifier sometimes introduces a new type and
10014 sometimes names an existing type. Normally, the rule is that it
10015 introduces a new type only if there is not an existing type of
10016 the same name already in scope. For example, given:
10019 void f() { struct S s; }
10021 the `struct S' in the body of `f' is the same `struct S' as in
10022 the global scope; the existing definition is used. However, if
10023 there were no global declaration, this would introduce a new
10024 local class named `S'.
10026 An exception to this rule applies to the following code:
10028 namespace N { struct S; }
10030 Here, the elaborated-type-specifier names a new type
10031 unconditionally; even if there is already an `S' in the
10032 containing scope this declaration names a new type.
10033 This exception only applies if the elaborated-type-specifier
10034 forms the complete declaration:
10038 A declaration consisting solely of `class-key identifier ;' is
10039 either a redeclaration of the name in the current scope or a
10040 forward declaration of the identifier as a class name. It
10041 introduces the name into the current scope.
10043 We are in this situation precisely when the next token is a `;'.
10045 An exception to the exception is that a `friend' declaration does
10046 *not* name a new type; i.e., given:
10048 struct S { friend struct T; };
10050 `T' is not a new type in the scope of `S'.
10052 Also, `new struct S' or `sizeof (struct S)' never results in the
10053 definition of a new type; a new type can only be declared in a
10054 declaration context. */
10058 /* Friends have special name lookup rules. */
10059 ts = ts_within_enclosing_non_class;
10060 else if (is_declaration
10061 && cp_lexer_next_token_is (parser->lexer,
10063 /* This is a `class-key identifier ;' */
10068 /* Warn about attributes. They are ignored. */
10070 warning (OPT_Wattributes,
10071 "type attributes are honored only at type definition");
10073 type = xref_tag (tag_type, identifier, ts,
10074 parser->num_template_parameter_lists);
10077 if (tag_type != enum_type)
10078 cp_parser_check_class_key (tag_type, type);
10080 /* A "<" cannot follow an elaborated type specifier. If that
10081 happens, the user was probably trying to form a template-id. */
10082 cp_parser_check_for_invalid_template_id (parser, type);
10087 /* Parse an enum-specifier.
10090 enum identifier [opt] { enumerator-list [opt] }
10093 enum identifier [opt] { enumerator-list [opt] } attributes
10095 Returns an ENUM_TYPE representing the enumeration. */
10098 cp_parser_enum_specifier (cp_parser* parser)
10103 /* Caller guarantees that the current token is 'enum', an identifier
10104 possibly follows, and the token after that is an opening brace.
10105 If we don't have an identifier, fabricate an anonymous name for
10106 the enumeration being defined. */
10107 cp_lexer_consume_token (parser->lexer);
10109 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
10110 identifier = cp_parser_identifier (parser);
10112 identifier = make_anon_name ();
10114 /* Issue an error message if type-definitions are forbidden here. */
10115 cp_parser_check_type_definition (parser);
10117 /* Create the new type. We do this before consuming the opening brace
10118 so the enum will be recorded as being on the line of its tag (or the
10119 'enum' keyword, if there is no tag). */
10120 type = start_enum (identifier);
10122 /* Consume the opening brace. */
10123 cp_lexer_consume_token (parser->lexer);
10125 /* If the next token is not '}', then there are some enumerators. */
10126 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
10127 cp_parser_enumerator_list (parser, type);
10129 /* Consume the final '}'. */
10130 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
10132 /* Look for trailing attributes to apply to this enumeration, and
10133 apply them if appropriate. */
10134 if (cp_parser_allow_gnu_extensions_p (parser))
10136 tree trailing_attr = cp_parser_attributes_opt (parser);
10137 cplus_decl_attributes (&type,
10139 (int) ATTR_FLAG_TYPE_IN_PLACE);
10142 /* Finish up the enumeration. */
10143 finish_enum (type);
10148 /* Parse an enumerator-list. The enumerators all have the indicated
10152 enumerator-definition
10153 enumerator-list , enumerator-definition */
10156 cp_parser_enumerator_list (cp_parser* parser, tree type)
10160 /* Parse an enumerator-definition. */
10161 cp_parser_enumerator_definition (parser, type);
10163 /* If the next token is not a ',', we've reached the end of
10165 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
10167 /* Otherwise, consume the `,' and keep going. */
10168 cp_lexer_consume_token (parser->lexer);
10169 /* If the next token is a `}', there is a trailing comma. */
10170 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
10172 if (pedantic && !in_system_header)
10173 pedwarn ("comma at end of enumerator list");
10179 /* Parse an enumerator-definition. The enumerator has the indicated
10182 enumerator-definition:
10184 enumerator = constant-expression
10190 cp_parser_enumerator_definition (cp_parser* parser, tree type)
10195 /* Look for the identifier. */
10196 identifier = cp_parser_identifier (parser);
10197 if (identifier == error_mark_node)
10200 /* If the next token is an '=', then there is an explicit value. */
10201 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
10203 /* Consume the `=' token. */
10204 cp_lexer_consume_token (parser->lexer);
10205 /* Parse the value. */
10206 value = cp_parser_constant_expression (parser,
10207 /*allow_non_constant_p=*/false,
10213 /* Create the enumerator. */
10214 build_enumerator (identifier, value, type);
10217 /* Parse a namespace-name.
10220 original-namespace-name
10223 Returns the NAMESPACE_DECL for the namespace. */
10226 cp_parser_namespace_name (cp_parser* parser)
10229 tree namespace_decl;
10231 /* Get the name of the namespace. */
10232 identifier = cp_parser_identifier (parser);
10233 if (identifier == error_mark_node)
10234 return error_mark_node;
10236 /* Look up the identifier in the currently active scope. Look only
10237 for namespaces, due to:
10239 [basic.lookup.udir]
10241 When looking up a namespace-name in a using-directive or alias
10242 definition, only namespace names are considered.
10246 [basic.lookup.qual]
10248 During the lookup of a name preceding the :: scope resolution
10249 operator, object, function, and enumerator names are ignored.
10251 (Note that cp_parser_class_or_namespace_name only calls this
10252 function if the token after the name is the scope resolution
10254 namespace_decl = cp_parser_lookup_name (parser, identifier,
10256 /*is_template=*/false,
10257 /*is_namespace=*/true,
10258 /*check_dependency=*/true,
10259 /*ambiguous_p=*/NULL);
10260 /* If it's not a namespace, issue an error. */
10261 if (namespace_decl == error_mark_node
10262 || TREE_CODE (namespace_decl) != NAMESPACE_DECL)
10264 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
10265 error ("%qD is not a namespace-name", identifier);
10266 cp_parser_error (parser, "expected namespace-name");
10267 namespace_decl = error_mark_node;
10270 return namespace_decl;
10273 /* Parse a namespace-definition.
10275 namespace-definition:
10276 named-namespace-definition
10277 unnamed-namespace-definition
10279 named-namespace-definition:
10280 original-namespace-definition
10281 extension-namespace-definition
10283 original-namespace-definition:
10284 namespace identifier { namespace-body }
10286 extension-namespace-definition:
10287 namespace original-namespace-name { namespace-body }
10289 unnamed-namespace-definition:
10290 namespace { namespace-body } */
10293 cp_parser_namespace_definition (cp_parser* parser)
10297 /* Look for the `namespace' keyword. */
10298 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10300 /* Get the name of the namespace. We do not attempt to distinguish
10301 between an original-namespace-definition and an
10302 extension-namespace-definition at this point. The semantic
10303 analysis routines are responsible for that. */
10304 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
10305 identifier = cp_parser_identifier (parser);
10307 identifier = NULL_TREE;
10309 /* Look for the `{' to start the namespace. */
10310 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
10311 /* Start the namespace. */
10312 push_namespace (identifier);
10313 /* Parse the body of the namespace. */
10314 cp_parser_namespace_body (parser);
10315 /* Finish the namespace. */
10317 /* Look for the final `}'. */
10318 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
10321 /* Parse a namespace-body.
10324 declaration-seq [opt] */
10327 cp_parser_namespace_body (cp_parser* parser)
10329 cp_parser_declaration_seq_opt (parser);
10332 /* Parse a namespace-alias-definition.
10334 namespace-alias-definition:
10335 namespace identifier = qualified-namespace-specifier ; */
10338 cp_parser_namespace_alias_definition (cp_parser* parser)
10341 tree namespace_specifier;
10343 /* Look for the `namespace' keyword. */
10344 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10345 /* Look for the identifier. */
10346 identifier = cp_parser_identifier (parser);
10347 if (identifier == error_mark_node)
10349 /* Look for the `=' token. */
10350 cp_parser_require (parser, CPP_EQ, "`='");
10351 /* Look for the qualified-namespace-specifier. */
10352 namespace_specifier
10353 = cp_parser_qualified_namespace_specifier (parser);
10354 /* Look for the `;' token. */
10355 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10357 /* Register the alias in the symbol table. */
10358 do_namespace_alias (identifier, namespace_specifier);
10361 /* Parse a qualified-namespace-specifier.
10363 qualified-namespace-specifier:
10364 :: [opt] nested-name-specifier [opt] namespace-name
10366 Returns a NAMESPACE_DECL corresponding to the specified
10370 cp_parser_qualified_namespace_specifier (cp_parser* parser)
10372 /* Look for the optional `::'. */
10373 cp_parser_global_scope_opt (parser,
10374 /*current_scope_valid_p=*/false);
10376 /* Look for the optional nested-name-specifier. */
10377 cp_parser_nested_name_specifier_opt (parser,
10378 /*typename_keyword_p=*/false,
10379 /*check_dependency_p=*/true,
10381 /*is_declaration=*/true);
10383 return cp_parser_namespace_name (parser);
10386 /* Parse a using-declaration.
10389 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
10390 using :: unqualified-id ; */
10393 cp_parser_using_declaration (cp_parser* parser)
10396 bool typename_p = false;
10397 bool global_scope_p;
10402 /* Look for the `using' keyword. */
10403 cp_parser_require_keyword (parser, RID_USING, "`using'");
10405 /* Peek at the next token. */
10406 token = cp_lexer_peek_token (parser->lexer);
10407 /* See if it's `typename'. */
10408 if (token->keyword == RID_TYPENAME)
10410 /* Remember that we've seen it. */
10412 /* Consume the `typename' token. */
10413 cp_lexer_consume_token (parser->lexer);
10416 /* Look for the optional global scope qualification. */
10418 = (cp_parser_global_scope_opt (parser,
10419 /*current_scope_valid_p=*/false)
10422 /* If we saw `typename', or didn't see `::', then there must be a
10423 nested-name-specifier present. */
10424 if (typename_p || !global_scope_p)
10425 qscope = cp_parser_nested_name_specifier (parser, typename_p,
10426 /*check_dependency_p=*/true,
10428 /*is_declaration=*/true);
10429 /* Otherwise, we could be in either of the two productions. In that
10430 case, treat the nested-name-specifier as optional. */
10432 qscope = cp_parser_nested_name_specifier_opt (parser,
10433 /*typename_keyword_p=*/false,
10434 /*check_dependency_p=*/true,
10436 /*is_declaration=*/true);
10438 qscope = global_namespace;
10440 /* Parse the unqualified-id. */
10441 identifier = cp_parser_unqualified_id (parser,
10442 /*template_keyword_p=*/false,
10443 /*check_dependency_p=*/true,
10444 /*declarator_p=*/true);
10446 /* The function we call to handle a using-declaration is different
10447 depending on what scope we are in. */
10448 if (identifier == error_mark_node)
10450 else if (TREE_CODE (identifier) != IDENTIFIER_NODE
10451 && TREE_CODE (identifier) != BIT_NOT_EXPR)
10452 /* [namespace.udecl]
10454 A using declaration shall not name a template-id. */
10455 error ("a template-id may not appear in a using-declaration");
10458 if (at_class_scope_p ())
10460 /* Create the USING_DECL. */
10461 decl = do_class_using_decl (parser->scope, identifier);
10462 /* Add it to the list of members in this class. */
10463 finish_member_declaration (decl);
10467 decl = cp_parser_lookup_name_simple (parser, identifier);
10468 if (decl == error_mark_node)
10469 cp_parser_name_lookup_error (parser, identifier, decl, NULL);
10470 else if (!at_namespace_scope_p ())
10471 do_local_using_decl (decl, qscope, identifier);
10473 do_toplevel_using_decl (decl, qscope, identifier);
10477 /* Look for the final `;'. */
10478 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10481 /* Parse a using-directive.
10484 using namespace :: [opt] nested-name-specifier [opt]
10485 namespace-name ; */
10488 cp_parser_using_directive (cp_parser* parser)
10490 tree namespace_decl;
10493 /* Look for the `using' keyword. */
10494 cp_parser_require_keyword (parser, RID_USING, "`using'");
10495 /* And the `namespace' keyword. */
10496 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10497 /* Look for the optional `::' operator. */
10498 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
10499 /* And the optional nested-name-specifier. */
10500 cp_parser_nested_name_specifier_opt (parser,
10501 /*typename_keyword_p=*/false,
10502 /*check_dependency_p=*/true,
10504 /*is_declaration=*/true);
10505 /* Get the namespace being used. */
10506 namespace_decl = cp_parser_namespace_name (parser);
10507 /* And any specified attributes. */
10508 attribs = cp_parser_attributes_opt (parser);
10509 /* Update the symbol table. */
10510 parse_using_directive (namespace_decl, attribs);
10511 /* Look for the final `;'. */
10512 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10515 /* Parse an asm-definition.
10518 asm ( string-literal ) ;
10523 asm volatile [opt] ( string-literal ) ;
10524 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
10525 asm volatile [opt] ( string-literal : asm-operand-list [opt]
10526 : asm-operand-list [opt] ) ;
10527 asm volatile [opt] ( string-literal : asm-operand-list [opt]
10528 : asm-operand-list [opt]
10529 : asm-operand-list [opt] ) ; */
10532 cp_parser_asm_definition (cp_parser* parser)
10535 tree outputs = NULL_TREE;
10536 tree inputs = NULL_TREE;
10537 tree clobbers = NULL_TREE;
10539 bool volatile_p = false;
10540 bool extended_p = false;
10542 /* Look for the `asm' keyword. */
10543 cp_parser_require_keyword (parser, RID_ASM, "`asm'");
10544 /* See if the next token is `volatile'. */
10545 if (cp_parser_allow_gnu_extensions_p (parser)
10546 && cp_lexer_next_token_is_keyword (parser->lexer, RID_VOLATILE))
10548 /* Remember that we saw the `volatile' keyword. */
10550 /* Consume the token. */
10551 cp_lexer_consume_token (parser->lexer);
10553 /* Look for the opening `('. */
10554 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
10556 /* Look for the string. */
10557 string = cp_parser_string_literal (parser, false, false);
10558 if (string == error_mark_node)
10560 cp_parser_skip_to_closing_parenthesis (parser, true, false,
10561 /*consume_paren=*/true);
10565 /* If we're allowing GNU extensions, check for the extended assembly
10566 syntax. Unfortunately, the `:' tokens need not be separated by
10567 a space in C, and so, for compatibility, we tolerate that here
10568 too. Doing that means that we have to treat the `::' operator as
10570 if (cp_parser_allow_gnu_extensions_p (parser)
10571 && at_function_scope_p ()
10572 && (cp_lexer_next_token_is (parser->lexer, CPP_COLON)
10573 || cp_lexer_next_token_is (parser->lexer, CPP_SCOPE)))
10575 bool inputs_p = false;
10576 bool clobbers_p = false;
10578 /* The extended syntax was used. */
10581 /* Look for outputs. */
10582 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
10584 /* Consume the `:'. */
10585 cp_lexer_consume_token (parser->lexer);
10586 /* Parse the output-operands. */
10587 if (cp_lexer_next_token_is_not (parser->lexer,
10589 && cp_lexer_next_token_is_not (parser->lexer,
10591 && cp_lexer_next_token_is_not (parser->lexer,
10593 outputs = cp_parser_asm_operand_list (parser);
10595 /* If the next token is `::', there are no outputs, and the
10596 next token is the beginning of the inputs. */
10597 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
10598 /* The inputs are coming next. */
10601 /* Look for inputs. */
10603 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
10605 /* Consume the `:' or `::'. */
10606 cp_lexer_consume_token (parser->lexer);
10607 /* Parse the output-operands. */
10608 if (cp_lexer_next_token_is_not (parser->lexer,
10610 && cp_lexer_next_token_is_not (parser->lexer,
10612 inputs = cp_parser_asm_operand_list (parser);
10614 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
10615 /* The clobbers are coming next. */
10618 /* Look for clobbers. */
10620 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
10622 /* Consume the `:' or `::'. */
10623 cp_lexer_consume_token (parser->lexer);
10624 /* Parse the clobbers. */
10625 if (cp_lexer_next_token_is_not (parser->lexer,
10627 clobbers = cp_parser_asm_clobber_list (parser);
10630 /* Look for the closing `)'. */
10631 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
10632 cp_parser_skip_to_closing_parenthesis (parser, true, false,
10633 /*consume_paren=*/true);
10634 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10636 /* Create the ASM_EXPR. */
10637 if (at_function_scope_p ())
10639 asm_stmt = finish_asm_stmt (volatile_p, string, outputs,
10641 /* If the extended syntax was not used, mark the ASM_EXPR. */
10644 tree temp = asm_stmt;
10645 if (TREE_CODE (temp) == CLEANUP_POINT_EXPR)
10646 temp = TREE_OPERAND (temp, 0);
10648 ASM_INPUT_P (temp) = 1;
10652 assemble_asm (string);
10655 /* Declarators [gram.dcl.decl] */
10657 /* Parse an init-declarator.
10660 declarator initializer [opt]
10665 declarator asm-specification [opt] attributes [opt] initializer [opt]
10667 function-definition:
10668 decl-specifier-seq [opt] declarator ctor-initializer [opt]
10670 decl-specifier-seq [opt] declarator function-try-block
10674 function-definition:
10675 __extension__ function-definition
10677 The DECL_SPECIFIERS and PREFIX_ATTRIBUTES apply to this declarator.
10678 Returns a representation of the entity declared. If MEMBER_P is TRUE,
10679 then this declarator appears in a class scope. The new DECL created
10680 by this declarator is returned.
10682 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
10683 for a function-definition here as well. If the declarator is a
10684 declarator for a function-definition, *FUNCTION_DEFINITION_P will
10685 be TRUE upon return. By that point, the function-definition will
10686 have been completely parsed.
10688 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
10692 cp_parser_init_declarator (cp_parser* parser,
10693 cp_decl_specifier_seq *decl_specifiers,
10694 bool function_definition_allowed_p,
10696 int declares_class_or_enum,
10697 bool* function_definition_p)
10700 cp_declarator *declarator;
10701 tree prefix_attributes;
10703 tree asm_specification;
10705 tree decl = NULL_TREE;
10707 bool is_initialized;
10708 bool is_parenthesized_init;
10709 bool is_non_constant_init;
10710 int ctor_dtor_or_conv_p;
10712 tree pushed_scope = NULL;
10714 /* Gather the attributes that were provided with the
10715 decl-specifiers. */
10716 prefix_attributes = decl_specifiers->attributes;
10718 /* Assume that this is not the declarator for a function
10720 if (function_definition_p)
10721 *function_definition_p = false;
10723 /* Defer access checks while parsing the declarator; we cannot know
10724 what names are accessible until we know what is being
10726 resume_deferring_access_checks ();
10728 /* Parse the declarator. */
10730 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
10731 &ctor_dtor_or_conv_p,
10732 /*parenthesized_p=*/NULL,
10733 /*member_p=*/false);
10734 /* Gather up the deferred checks. */
10735 stop_deferring_access_checks ();
10737 /* If the DECLARATOR was erroneous, there's no need to go
10739 if (declarator == cp_error_declarator)
10740 return error_mark_node;
10742 if (declares_class_or_enum & 2)
10743 cp_parser_check_for_definition_in_return_type (declarator,
10744 decl_specifiers->type);
10746 /* Figure out what scope the entity declared by the DECLARATOR is
10747 located in. `grokdeclarator' sometimes changes the scope, so
10748 we compute it now. */
10749 scope = get_scope_of_declarator (declarator);
10751 /* If we're allowing GNU extensions, look for an asm-specification
10753 if (cp_parser_allow_gnu_extensions_p (parser))
10755 /* Look for an asm-specification. */
10756 asm_specification = cp_parser_asm_specification_opt (parser);
10757 /* And attributes. */
10758 attributes = cp_parser_attributes_opt (parser);
10762 asm_specification = NULL_TREE;
10763 attributes = NULL_TREE;
10766 /* Peek at the next token. */
10767 token = cp_lexer_peek_token (parser->lexer);
10768 /* Check to see if the token indicates the start of a
10769 function-definition. */
10770 if (cp_parser_token_starts_function_definition_p (token))
10772 if (!function_definition_allowed_p)
10774 /* If a function-definition should not appear here, issue an
10776 cp_parser_error (parser,
10777 "a function-definition is not allowed here");
10778 return error_mark_node;
10782 /* Neither attributes nor an asm-specification are allowed
10783 on a function-definition. */
10784 if (asm_specification)
10785 error ("an asm-specification is not allowed on a function-definition");
10787 error ("attributes are not allowed on a function-definition");
10788 /* This is a function-definition. */
10789 *function_definition_p = true;
10791 /* Parse the function definition. */
10793 decl = cp_parser_save_member_function_body (parser,
10796 prefix_attributes);
10799 = (cp_parser_function_definition_from_specifiers_and_declarator
10800 (parser, decl_specifiers, prefix_attributes, declarator));
10808 Only in function declarations for constructors, destructors, and
10809 type conversions can the decl-specifier-seq be omitted.
10811 We explicitly postpone this check past the point where we handle
10812 function-definitions because we tolerate function-definitions
10813 that are missing their return types in some modes. */
10814 if (!decl_specifiers->any_specifiers_p && ctor_dtor_or_conv_p <= 0)
10816 cp_parser_error (parser,
10817 "expected constructor, destructor, or type conversion");
10818 return error_mark_node;
10821 /* An `=' or an `(' indicates an initializer. */
10822 is_initialized = (token->type == CPP_EQ
10823 || token->type == CPP_OPEN_PAREN);
10824 /* If the init-declarator isn't initialized and isn't followed by a
10825 `,' or `;', it's not a valid init-declarator. */
10826 if (!is_initialized
10827 && token->type != CPP_COMMA
10828 && token->type != CPP_SEMICOLON)
10830 cp_parser_error (parser, "expected initializer");
10831 return error_mark_node;
10834 /* Because start_decl has side-effects, we should only call it if we
10835 know we're going ahead. By this point, we know that we cannot
10836 possibly be looking at any other construct. */
10837 cp_parser_commit_to_tentative_parse (parser);
10839 /* If the decl specifiers were bad, issue an error now that we're
10840 sure this was intended to be a declarator. Then continue
10841 declaring the variable(s), as int, to try to cut down on further
10843 if (decl_specifiers->any_specifiers_p
10844 && decl_specifiers->type == error_mark_node)
10846 cp_parser_error (parser, "invalid type in declaration");
10847 decl_specifiers->type = integer_type_node;
10850 /* Check to see whether or not this declaration is a friend. */
10851 friend_p = cp_parser_friend_p (decl_specifiers);
10853 /* Check that the number of template-parameter-lists is OK. */
10854 if (!cp_parser_check_declarator_template_parameters (parser, declarator))
10855 return error_mark_node;
10857 /* Enter the newly declared entry in the symbol table. If we're
10858 processing a declaration in a class-specifier, we wait until
10859 after processing the initializer. */
10862 if (parser->in_unbraced_linkage_specification_p)
10864 decl_specifiers->storage_class = sc_extern;
10865 have_extern_spec = false;
10867 decl = start_decl (declarator, decl_specifiers,
10868 is_initialized, attributes, prefix_attributes,
10872 /* Enter the SCOPE. That way unqualified names appearing in the
10873 initializer will be looked up in SCOPE. */
10874 pushed_scope = push_scope (scope);
10876 /* Perform deferred access control checks, now that we know in which
10877 SCOPE the declared entity resides. */
10878 if (!member_p && decl)
10880 tree saved_current_function_decl = NULL_TREE;
10882 /* If the entity being declared is a function, pretend that we
10883 are in its scope. If it is a `friend', it may have access to
10884 things that would not otherwise be accessible. */
10885 if (TREE_CODE (decl) == FUNCTION_DECL)
10887 saved_current_function_decl = current_function_decl;
10888 current_function_decl = decl;
10891 /* Perform the access control checks for the declarator and the
10892 the decl-specifiers. */
10893 perform_deferred_access_checks ();
10895 /* Restore the saved value. */
10896 if (TREE_CODE (decl) == FUNCTION_DECL)
10897 current_function_decl = saved_current_function_decl;
10900 /* Parse the initializer. */
10901 if (is_initialized)
10902 initializer = cp_parser_initializer (parser,
10903 &is_parenthesized_init,
10904 &is_non_constant_init);
10907 initializer = NULL_TREE;
10908 is_parenthesized_init = false;
10909 is_non_constant_init = true;
10912 /* The old parser allows attributes to appear after a parenthesized
10913 initializer. Mark Mitchell proposed removing this functionality
10914 on the GCC mailing lists on 2002-08-13. This parser accepts the
10915 attributes -- but ignores them. */
10916 if (cp_parser_allow_gnu_extensions_p (parser) && is_parenthesized_init)
10917 if (cp_parser_attributes_opt (parser))
10918 warning (OPT_Wattributes,
10919 "attributes after parenthesized initializer ignored");
10921 /* For an in-class declaration, use `grokfield' to create the
10927 pop_scope (pushed_scope);
10928 pushed_scope = false;
10930 decl = grokfield (declarator, decl_specifiers,
10931 initializer, /*asmspec=*/NULL_TREE,
10932 /*attributes=*/NULL_TREE);
10933 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
10934 cp_parser_save_default_args (parser, decl);
10937 /* Finish processing the declaration. But, skip friend
10939 if (!friend_p && decl && decl != error_mark_node)
10941 cp_finish_decl (decl,
10944 /* If the initializer is in parentheses, then this is
10945 a direct-initialization, which means that an
10946 `explicit' constructor is OK. Otherwise, an
10947 `explicit' constructor cannot be used. */
10948 ((is_parenthesized_init || !is_initialized)
10949 ? 0 : LOOKUP_ONLYCONVERTING));
10951 if (!friend_p && pushed_scope)
10952 pop_scope (pushed_scope);
10954 /* Remember whether or not variables were initialized by
10955 constant-expressions. */
10956 if (decl && TREE_CODE (decl) == VAR_DECL
10957 && is_initialized && !is_non_constant_init)
10958 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
10963 /* Parse a declarator.
10967 ptr-operator declarator
10969 abstract-declarator:
10970 ptr-operator abstract-declarator [opt]
10971 direct-abstract-declarator
10976 attributes [opt] direct-declarator
10977 attributes [opt] ptr-operator declarator
10979 abstract-declarator:
10980 attributes [opt] ptr-operator abstract-declarator [opt]
10981 attributes [opt] direct-abstract-declarator
10983 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
10984 detect constructor, destructor or conversion operators. It is set
10985 to -1 if the declarator is a name, and +1 if it is a
10986 function. Otherwise it is set to zero. Usually you just want to
10987 test for >0, but internally the negative value is used.
10989 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
10990 a decl-specifier-seq unless it declares a constructor, destructor,
10991 or conversion. It might seem that we could check this condition in
10992 semantic analysis, rather than parsing, but that makes it difficult
10993 to handle something like `f()'. We want to notice that there are
10994 no decl-specifiers, and therefore realize that this is an
10995 expression, not a declaration.)
10997 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
10998 the declarator is a direct-declarator of the form "(...)".
11000 MEMBER_P is true iff this declarator is a member-declarator. */
11002 static cp_declarator *
11003 cp_parser_declarator (cp_parser* parser,
11004 cp_parser_declarator_kind dcl_kind,
11005 int* ctor_dtor_or_conv_p,
11006 bool* parenthesized_p,
11010 cp_declarator *declarator;
11011 enum tree_code code;
11012 cp_cv_quals cv_quals;
11014 tree attributes = NULL_TREE;
11016 /* Assume this is not a constructor, destructor, or type-conversion
11018 if (ctor_dtor_or_conv_p)
11019 *ctor_dtor_or_conv_p = 0;
11021 if (cp_parser_allow_gnu_extensions_p (parser))
11022 attributes = cp_parser_attributes_opt (parser);
11024 /* Peek at the next token. */
11025 token = cp_lexer_peek_token (parser->lexer);
11027 /* Check for the ptr-operator production. */
11028 cp_parser_parse_tentatively (parser);
11029 /* Parse the ptr-operator. */
11030 code = cp_parser_ptr_operator (parser,
11033 /* If that worked, then we have a ptr-operator. */
11034 if (cp_parser_parse_definitely (parser))
11036 /* If a ptr-operator was found, then this declarator was not
11038 if (parenthesized_p)
11039 *parenthesized_p = true;
11040 /* The dependent declarator is optional if we are parsing an
11041 abstract-declarator. */
11042 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED)
11043 cp_parser_parse_tentatively (parser);
11045 /* Parse the dependent declarator. */
11046 declarator = cp_parser_declarator (parser, dcl_kind,
11047 /*ctor_dtor_or_conv_p=*/NULL,
11048 /*parenthesized_p=*/NULL,
11049 /*member_p=*/false);
11051 /* If we are parsing an abstract-declarator, we must handle the
11052 case where the dependent declarator is absent. */
11053 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED
11054 && !cp_parser_parse_definitely (parser))
11057 /* Build the representation of the ptr-operator. */
11059 declarator = make_ptrmem_declarator (cv_quals,
11062 else if (code == INDIRECT_REF)
11063 declarator = make_pointer_declarator (cv_quals, declarator);
11065 declarator = make_reference_declarator (cv_quals, declarator);
11067 /* Everything else is a direct-declarator. */
11070 if (parenthesized_p)
11071 *parenthesized_p = cp_lexer_next_token_is (parser->lexer,
11073 declarator = cp_parser_direct_declarator (parser, dcl_kind,
11074 ctor_dtor_or_conv_p,
11078 if (attributes && declarator != cp_error_declarator)
11079 declarator->attributes = attributes;
11084 /* Parse a direct-declarator or direct-abstract-declarator.
11088 direct-declarator ( parameter-declaration-clause )
11089 cv-qualifier-seq [opt]
11090 exception-specification [opt]
11091 direct-declarator [ constant-expression [opt] ]
11094 direct-abstract-declarator:
11095 direct-abstract-declarator [opt]
11096 ( parameter-declaration-clause )
11097 cv-qualifier-seq [opt]
11098 exception-specification [opt]
11099 direct-abstract-declarator [opt] [ constant-expression [opt] ]
11100 ( abstract-declarator )
11102 Returns a representation of the declarator. DCL_KIND is
11103 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
11104 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
11105 we are parsing a direct-declarator. It is
11106 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
11107 of ambiguity we prefer an abstract declarator, as per
11108 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
11109 cp_parser_declarator. */
11111 static cp_declarator *
11112 cp_parser_direct_declarator (cp_parser* parser,
11113 cp_parser_declarator_kind dcl_kind,
11114 int* ctor_dtor_or_conv_p,
11118 cp_declarator *declarator = NULL;
11119 tree scope = NULL_TREE;
11120 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
11121 bool saved_in_declarator_p = parser->in_declarator_p;
11123 tree pushed_scope = NULL_TREE;
11127 /* Peek at the next token. */
11128 token = cp_lexer_peek_token (parser->lexer);
11129 if (token->type == CPP_OPEN_PAREN)
11131 /* This is either a parameter-declaration-clause, or a
11132 parenthesized declarator. When we know we are parsing a
11133 named declarator, it must be a parenthesized declarator
11134 if FIRST is true. For instance, `(int)' is a
11135 parameter-declaration-clause, with an omitted
11136 direct-abstract-declarator. But `((*))', is a
11137 parenthesized abstract declarator. Finally, when T is a
11138 template parameter `(T)' is a
11139 parameter-declaration-clause, and not a parenthesized
11142 We first try and parse a parameter-declaration-clause,
11143 and then try a nested declarator (if FIRST is true).
11145 It is not an error for it not to be a
11146 parameter-declaration-clause, even when FIRST is
11152 The first is the declaration of a function while the
11153 second is a the definition of a variable, including its
11156 Having seen only the parenthesis, we cannot know which of
11157 these two alternatives should be selected. Even more
11158 complex are examples like:
11163 The former is a function-declaration; the latter is a
11164 variable initialization.
11166 Thus again, we try a parameter-declaration-clause, and if
11167 that fails, we back out and return. */
11169 if (!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
11171 cp_parameter_declarator *params;
11172 unsigned saved_num_template_parameter_lists;
11174 /* In a member-declarator, the only valid interpretation
11175 of a parenthesis is the start of a
11176 parameter-declaration-clause. (It is invalid to
11177 initialize a static data member with a parenthesized
11178 initializer; only the "=" form of initialization is
11181 cp_parser_parse_tentatively (parser);
11183 /* Consume the `('. */
11184 cp_lexer_consume_token (parser->lexer);
11187 /* If this is going to be an abstract declarator, we're
11188 in a declarator and we can't have default args. */
11189 parser->default_arg_ok_p = false;
11190 parser->in_declarator_p = true;
11193 /* Inside the function parameter list, surrounding
11194 template-parameter-lists do not apply. */
11195 saved_num_template_parameter_lists
11196 = parser->num_template_parameter_lists;
11197 parser->num_template_parameter_lists = 0;
11199 /* Parse the parameter-declaration-clause. */
11200 params = cp_parser_parameter_declaration_clause (parser);
11202 parser->num_template_parameter_lists
11203 = saved_num_template_parameter_lists;
11205 /* If all went well, parse the cv-qualifier-seq and the
11206 exception-specification. */
11207 if (member_p || cp_parser_parse_definitely (parser))
11209 cp_cv_quals cv_quals;
11210 tree exception_specification;
11212 if (ctor_dtor_or_conv_p)
11213 *ctor_dtor_or_conv_p = *ctor_dtor_or_conv_p < 0;
11215 /* Consume the `)'. */
11216 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
11218 /* Parse the cv-qualifier-seq. */
11219 cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
11220 /* And the exception-specification. */
11221 exception_specification
11222 = cp_parser_exception_specification_opt (parser);
11224 /* Create the function-declarator. */
11225 declarator = make_call_declarator (declarator,
11228 exception_specification);
11229 /* Any subsequent parameter lists are to do with
11230 return type, so are not those of the declared
11232 parser->default_arg_ok_p = false;
11234 /* Repeat the main loop. */
11239 /* If this is the first, we can try a parenthesized
11243 bool saved_in_type_id_in_expr_p;
11245 parser->default_arg_ok_p = saved_default_arg_ok_p;
11246 parser->in_declarator_p = saved_in_declarator_p;
11248 /* Consume the `('. */
11249 cp_lexer_consume_token (parser->lexer);
11250 /* Parse the nested declarator. */
11251 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
11252 parser->in_type_id_in_expr_p = true;
11254 = cp_parser_declarator (parser, dcl_kind, ctor_dtor_or_conv_p,
11255 /*parenthesized_p=*/NULL,
11257 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
11259 /* Expect a `)'. */
11260 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
11261 declarator = cp_error_declarator;
11262 if (declarator == cp_error_declarator)
11265 goto handle_declarator;
11267 /* Otherwise, we must be done. */
11271 else if ((!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
11272 && token->type == CPP_OPEN_SQUARE)
11274 /* Parse an array-declarator. */
11277 if (ctor_dtor_or_conv_p)
11278 *ctor_dtor_or_conv_p = 0;
11281 parser->default_arg_ok_p = false;
11282 parser->in_declarator_p = true;
11283 /* Consume the `['. */
11284 cp_lexer_consume_token (parser->lexer);
11285 /* Peek at the next token. */
11286 token = cp_lexer_peek_token (parser->lexer);
11287 /* If the next token is `]', then there is no
11288 constant-expression. */
11289 if (token->type != CPP_CLOSE_SQUARE)
11291 bool non_constant_p;
11294 = cp_parser_constant_expression (parser,
11295 /*allow_non_constant=*/true,
11297 if (!non_constant_p)
11298 bounds = fold_non_dependent_expr (bounds);
11299 /* Normally, the array bound must be an integral constant
11300 expression. However, as an extension, we allow VLAs
11301 in function scopes. */
11302 else if (!at_function_scope_p ())
11304 error ("array bound is not an integer constant");
11305 bounds = error_mark_node;
11309 bounds = NULL_TREE;
11310 /* Look for the closing `]'. */
11311 if (!cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'"))
11313 declarator = cp_error_declarator;
11317 declarator = make_array_declarator (declarator, bounds);
11319 else if (first && dcl_kind != CP_PARSER_DECLARATOR_ABSTRACT)
11321 tree qualifying_scope;
11322 tree unqualified_name;
11324 /* Parse a declarator-id */
11325 if (dcl_kind == CP_PARSER_DECLARATOR_EITHER)
11326 cp_parser_parse_tentatively (parser);
11327 unqualified_name = cp_parser_declarator_id (parser);
11328 qualifying_scope = parser->scope;
11329 if (dcl_kind == CP_PARSER_DECLARATOR_EITHER)
11331 if (!cp_parser_parse_definitely (parser))
11332 unqualified_name = error_mark_node;
11333 else if (qualifying_scope
11334 || (TREE_CODE (unqualified_name)
11335 != IDENTIFIER_NODE))
11337 cp_parser_error (parser, "expected unqualified-id");
11338 unqualified_name = error_mark_node;
11342 if (unqualified_name == error_mark_node)
11344 declarator = cp_error_declarator;
11348 if (qualifying_scope && at_namespace_scope_p ()
11349 && TREE_CODE (qualifying_scope) == TYPENAME_TYPE)
11351 /* In the declaration of a member of a template class
11352 outside of the class itself, the SCOPE will sometimes
11353 be a TYPENAME_TYPE. For example, given:
11355 template <typename T>
11356 int S<T>::R::i = 3;
11358 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
11359 this context, we must resolve S<T>::R to an ordinary
11360 type, rather than a typename type.
11362 The reason we normally avoid resolving TYPENAME_TYPEs
11363 is that a specialization of `S' might render
11364 `S<T>::R' not a type. However, if `S' is
11365 specialized, then this `i' will not be used, so there
11366 is no harm in resolving the types here. */
11369 /* Resolve the TYPENAME_TYPE. */
11370 type = resolve_typename_type (qualifying_scope,
11371 /*only_current_p=*/false);
11372 /* If that failed, the declarator is invalid. */
11373 if (type == error_mark_node)
11374 error ("%<%T::%D%> is not a type",
11375 TYPE_CONTEXT (qualifying_scope),
11376 TYPE_IDENTIFIER (qualifying_scope));
11377 qualifying_scope = type;
11380 declarator = make_id_declarator (qualifying_scope,
11382 declarator->id_loc = token->location;
11383 if (unqualified_name)
11387 if (qualifying_scope
11388 && CLASS_TYPE_P (qualifying_scope))
11389 class_type = qualifying_scope;
11391 class_type = current_class_type;
11395 if (TREE_CODE (unqualified_name) == BIT_NOT_EXPR)
11396 declarator->u.id.sfk = sfk_destructor;
11397 else if (IDENTIFIER_TYPENAME_P (unqualified_name))
11398 declarator->u.id.sfk = sfk_conversion;
11399 else if (/* There's no way to declare a constructor
11400 for an anonymous type, even if the type
11401 got a name for linkage purposes. */
11402 !TYPE_WAS_ANONYMOUS (class_type)
11403 && (constructor_name_p (unqualified_name,
11405 || (TREE_CODE (unqualified_name) == TYPE_DECL
11407 (TREE_TYPE (unqualified_name),
11409 declarator->u.id.sfk = sfk_constructor;
11411 if (ctor_dtor_or_conv_p && declarator->u.id.sfk != sfk_none)
11412 *ctor_dtor_or_conv_p = -1;
11413 if (qualifying_scope
11414 && TREE_CODE (unqualified_name) == TYPE_DECL
11415 && CLASSTYPE_USE_TEMPLATE (TREE_TYPE (unqualified_name)))
11417 error ("invalid use of constructor as a template");
11418 inform ("use %<%T::%D%> instead of %<%T::%T%> to name "
11419 "the constructor in a qualified name",
11421 DECL_NAME (TYPE_TI_TEMPLATE (class_type)),
11422 class_type, class_type);
11427 handle_declarator:;
11428 scope = get_scope_of_declarator (declarator);
11430 /* Any names that appear after the declarator-id for a
11431 member are looked up in the containing scope. */
11432 pushed_scope = push_scope (scope);
11433 parser->in_declarator_p = true;
11434 if ((ctor_dtor_or_conv_p && *ctor_dtor_or_conv_p)
11435 || (declarator && declarator->kind == cdk_id))
11436 /* Default args are only allowed on function
11438 parser->default_arg_ok_p = saved_default_arg_ok_p;
11440 parser->default_arg_ok_p = false;
11449 /* For an abstract declarator, we might wind up with nothing at this
11450 point. That's an error; the declarator is not optional. */
11452 cp_parser_error (parser, "expected declarator");
11454 /* If we entered a scope, we must exit it now. */
11456 pop_scope (pushed_scope);
11458 parser->default_arg_ok_p = saved_default_arg_ok_p;
11459 parser->in_declarator_p = saved_in_declarator_p;
11464 /* Parse a ptr-operator.
11467 * cv-qualifier-seq [opt]
11469 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
11474 & cv-qualifier-seq [opt]
11476 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
11477 Returns ADDR_EXPR if a reference was used. In the case of a
11478 pointer-to-member, *TYPE is filled in with the TYPE containing the
11479 member. *CV_QUALS is filled in with the cv-qualifier-seq, or
11480 TYPE_UNQUALIFIED, if there are no cv-qualifiers. Returns
11481 ERROR_MARK if an error occurred. */
11483 static enum tree_code
11484 cp_parser_ptr_operator (cp_parser* parser,
11486 cp_cv_quals *cv_quals)
11488 enum tree_code code = ERROR_MARK;
11491 /* Assume that it's not a pointer-to-member. */
11493 /* And that there are no cv-qualifiers. */
11494 *cv_quals = TYPE_UNQUALIFIED;
11496 /* Peek at the next token. */
11497 token = cp_lexer_peek_token (parser->lexer);
11498 /* If it's a `*' or `&' we have a pointer or reference. */
11499 if (token->type == CPP_MULT || token->type == CPP_AND)
11501 /* Remember which ptr-operator we were processing. */
11502 code = (token->type == CPP_AND ? ADDR_EXPR : INDIRECT_REF);
11504 /* Consume the `*' or `&'. */
11505 cp_lexer_consume_token (parser->lexer);
11507 /* A `*' can be followed by a cv-qualifier-seq, and so can a
11508 `&', if we are allowing GNU extensions. (The only qualifier
11509 that can legally appear after `&' is `restrict', but that is
11510 enforced during semantic analysis. */
11511 if (code == INDIRECT_REF
11512 || cp_parser_allow_gnu_extensions_p (parser))
11513 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
11517 /* Try the pointer-to-member case. */
11518 cp_parser_parse_tentatively (parser);
11519 /* Look for the optional `::' operator. */
11520 cp_parser_global_scope_opt (parser,
11521 /*current_scope_valid_p=*/false);
11522 /* Look for the nested-name specifier. */
11523 cp_parser_nested_name_specifier (parser,
11524 /*typename_keyword_p=*/false,
11525 /*check_dependency_p=*/true,
11527 /*is_declaration=*/false);
11528 /* If we found it, and the next token is a `*', then we are
11529 indeed looking at a pointer-to-member operator. */
11530 if (!cp_parser_error_occurred (parser)
11531 && cp_parser_require (parser, CPP_MULT, "`*'"))
11533 /* The type of which the member is a member is given by the
11535 *type = parser->scope;
11536 /* The next name will not be qualified. */
11537 parser->scope = NULL_TREE;
11538 parser->qualifying_scope = NULL_TREE;
11539 parser->object_scope = NULL_TREE;
11540 /* Indicate that the `*' operator was used. */
11541 code = INDIRECT_REF;
11542 /* Look for the optional cv-qualifier-seq. */
11543 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
11545 /* If that didn't work we don't have a ptr-operator. */
11546 if (!cp_parser_parse_definitely (parser))
11547 cp_parser_error (parser, "expected ptr-operator");
11553 /* Parse an (optional) cv-qualifier-seq.
11556 cv-qualifier cv-qualifier-seq [opt]
11567 Returns a bitmask representing the cv-qualifiers. */
11570 cp_parser_cv_qualifier_seq_opt (cp_parser* parser)
11572 cp_cv_quals cv_quals = TYPE_UNQUALIFIED;
11577 cp_cv_quals cv_qualifier;
11579 /* Peek at the next token. */
11580 token = cp_lexer_peek_token (parser->lexer);
11581 /* See if it's a cv-qualifier. */
11582 switch (token->keyword)
11585 cv_qualifier = TYPE_QUAL_CONST;
11589 cv_qualifier = TYPE_QUAL_VOLATILE;
11593 cv_qualifier = TYPE_QUAL_RESTRICT;
11597 cv_qualifier = TYPE_UNQUALIFIED;
11604 if (cv_quals & cv_qualifier)
11606 error ("duplicate cv-qualifier");
11607 cp_lexer_purge_token (parser->lexer);
11611 cp_lexer_consume_token (parser->lexer);
11612 cv_quals |= cv_qualifier;
11619 /* Parse a declarator-id.
11623 :: [opt] nested-name-specifier [opt] type-name
11625 In the `id-expression' case, the value returned is as for
11626 cp_parser_id_expression if the id-expression was an unqualified-id.
11627 If the id-expression was a qualified-id, then a SCOPE_REF is
11628 returned. The first operand is the scope (either a NAMESPACE_DECL
11629 or TREE_TYPE), but the second is still just a representation of an
11633 cp_parser_declarator_id (cp_parser* parser)
11635 /* The expression must be an id-expression. Assume that qualified
11636 names are the names of types so that:
11639 int S<T>::R::i = 3;
11641 will work; we must treat `S<T>::R' as the name of a type.
11642 Similarly, assume that qualified names are templates, where
11646 int S<T>::R<T>::i = 3;
11649 return cp_parser_id_expression (parser,
11650 /*template_keyword_p=*/false,
11651 /*check_dependency_p=*/false,
11652 /*template_p=*/NULL,
11653 /*declarator_p=*/true);
11656 /* Parse a type-id.
11659 type-specifier-seq abstract-declarator [opt]
11661 Returns the TYPE specified. */
11664 cp_parser_type_id (cp_parser* parser)
11666 cp_decl_specifier_seq type_specifier_seq;
11667 cp_declarator *abstract_declarator;
11669 /* Parse the type-specifier-seq. */
11670 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
11671 &type_specifier_seq);
11672 if (type_specifier_seq.type == error_mark_node)
11673 return error_mark_node;
11675 /* There might or might not be an abstract declarator. */
11676 cp_parser_parse_tentatively (parser);
11677 /* Look for the declarator. */
11678 abstract_declarator
11679 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_ABSTRACT, NULL,
11680 /*parenthesized_p=*/NULL,
11681 /*member_p=*/false);
11682 /* Check to see if there really was a declarator. */
11683 if (!cp_parser_parse_definitely (parser))
11684 abstract_declarator = NULL;
11686 return groktypename (&type_specifier_seq, abstract_declarator);
11689 /* Parse a type-specifier-seq.
11691 type-specifier-seq:
11692 type-specifier type-specifier-seq [opt]
11696 type-specifier-seq:
11697 attributes type-specifier-seq [opt]
11699 If IS_CONDITION is true, we are at the start of a "condition",
11700 e.g., we've just seen "if (".
11702 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
11705 cp_parser_type_specifier_seq (cp_parser* parser,
11707 cp_decl_specifier_seq *type_specifier_seq)
11709 bool seen_type_specifier = false;
11710 cp_parser_flags flags = CP_PARSER_FLAGS_OPTIONAL;
11712 /* Clear the TYPE_SPECIFIER_SEQ. */
11713 clear_decl_specs (type_specifier_seq);
11715 /* Parse the type-specifiers and attributes. */
11718 tree type_specifier;
11719 bool is_cv_qualifier;
11721 /* Check for attributes first. */
11722 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
11724 type_specifier_seq->attributes =
11725 chainon (type_specifier_seq->attributes,
11726 cp_parser_attributes_opt (parser));
11730 /* Look for the type-specifier. */
11731 type_specifier = cp_parser_type_specifier (parser,
11733 type_specifier_seq,
11734 /*is_declaration=*/false,
11737 if (!type_specifier)
11739 /* If the first type-specifier could not be found, this is not a
11740 type-specifier-seq at all. */
11741 if (!seen_type_specifier)
11743 cp_parser_error (parser, "expected type-specifier");
11744 type_specifier_seq->type = error_mark_node;
11747 /* If subsequent type-specifiers could not be found, the
11748 type-specifier-seq is complete. */
11752 seen_type_specifier = true;
11753 /* The standard says that a condition can be:
11755 type-specifier-seq declarator = assignment-expression
11762 we should treat the "S" as a declarator, not as a
11763 type-specifier. The standard doesn't say that explicitly for
11764 type-specifier-seq, but it does say that for
11765 decl-specifier-seq in an ordinary declaration. Perhaps it
11766 would be clearer just to allow a decl-specifier-seq here, and
11767 then add a semantic restriction that if any decl-specifiers
11768 that are not type-specifiers appear, the program is invalid. */
11769 if (is_condition && !is_cv_qualifier)
11770 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
11776 /* Parse a parameter-declaration-clause.
11778 parameter-declaration-clause:
11779 parameter-declaration-list [opt] ... [opt]
11780 parameter-declaration-list , ...
11782 Returns a representation for the parameter declarations. A return
11783 value of NULL indicates a parameter-declaration-clause consisting
11784 only of an ellipsis. */
11786 static cp_parameter_declarator *
11787 cp_parser_parameter_declaration_clause (cp_parser* parser)
11789 cp_parameter_declarator *parameters;
11794 /* Peek at the next token. */
11795 token = cp_lexer_peek_token (parser->lexer);
11796 /* Check for trivial parameter-declaration-clauses. */
11797 if (token->type == CPP_ELLIPSIS)
11799 /* Consume the `...' token. */
11800 cp_lexer_consume_token (parser->lexer);
11803 else if (token->type == CPP_CLOSE_PAREN)
11804 /* There are no parameters. */
11806 #ifndef NO_IMPLICIT_EXTERN_C
11807 if (in_system_header && current_class_type == NULL
11808 && current_lang_name == lang_name_c)
11812 return no_parameters;
11814 /* Check for `(void)', too, which is a special case. */
11815 else if (token->keyword == RID_VOID
11816 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
11817 == CPP_CLOSE_PAREN))
11819 /* Consume the `void' token. */
11820 cp_lexer_consume_token (parser->lexer);
11821 /* There are no parameters. */
11822 return no_parameters;
11825 /* Parse the parameter-declaration-list. */
11826 parameters = cp_parser_parameter_declaration_list (parser, &is_error);
11827 /* If a parse error occurred while parsing the
11828 parameter-declaration-list, then the entire
11829 parameter-declaration-clause is erroneous. */
11833 /* Peek at the next token. */
11834 token = cp_lexer_peek_token (parser->lexer);
11835 /* If it's a `,', the clause should terminate with an ellipsis. */
11836 if (token->type == CPP_COMMA)
11838 /* Consume the `,'. */
11839 cp_lexer_consume_token (parser->lexer);
11840 /* Expect an ellipsis. */
11842 = (cp_parser_require (parser, CPP_ELLIPSIS, "`...'") != NULL);
11844 /* It might also be `...' if the optional trailing `,' was
11846 else if (token->type == CPP_ELLIPSIS)
11848 /* Consume the `...' token. */
11849 cp_lexer_consume_token (parser->lexer);
11850 /* And remember that we saw it. */
11854 ellipsis_p = false;
11856 /* Finish the parameter list. */
11857 if (parameters && ellipsis_p)
11858 parameters->ellipsis_p = true;
11863 /* Parse a parameter-declaration-list.
11865 parameter-declaration-list:
11866 parameter-declaration
11867 parameter-declaration-list , parameter-declaration
11869 Returns a representation of the parameter-declaration-list, as for
11870 cp_parser_parameter_declaration_clause. However, the
11871 `void_list_node' is never appended to the list. Upon return,
11872 *IS_ERROR will be true iff an error occurred. */
11874 static cp_parameter_declarator *
11875 cp_parser_parameter_declaration_list (cp_parser* parser, bool *is_error)
11877 cp_parameter_declarator *parameters = NULL;
11878 cp_parameter_declarator **tail = ¶meters;
11880 /* Assume all will go well. */
11883 /* Look for more parameters. */
11886 cp_parameter_declarator *parameter;
11887 bool parenthesized_p;
11888 /* Parse the parameter. */
11890 = cp_parser_parameter_declaration (parser,
11891 /*template_parm_p=*/false,
11894 /* If a parse error occurred parsing the parameter declaration,
11895 then the entire parameter-declaration-list is erroneous. */
11902 /* Add the new parameter to the list. */
11904 tail = ¶meter->next;
11906 /* Peek at the next token. */
11907 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN)
11908 || cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS)
11909 /* These are for Objective-C++ */
11910 || cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
11911 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
11912 /* The parameter-declaration-list is complete. */
11914 else if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
11918 /* Peek at the next token. */
11919 token = cp_lexer_peek_nth_token (parser->lexer, 2);
11920 /* If it's an ellipsis, then the list is complete. */
11921 if (token->type == CPP_ELLIPSIS)
11923 /* Otherwise, there must be more parameters. Consume the
11925 cp_lexer_consume_token (parser->lexer);
11926 /* When parsing something like:
11928 int i(float f, double d)
11930 we can tell after seeing the declaration for "f" that we
11931 are not looking at an initialization of a variable "i",
11932 but rather at the declaration of a function "i".
11934 Due to the fact that the parsing of template arguments
11935 (as specified to a template-id) requires backtracking we
11936 cannot use this technique when inside a template argument
11938 if (!parser->in_template_argument_list_p
11939 && !parser->in_type_id_in_expr_p
11940 && cp_parser_uncommitted_to_tentative_parse_p (parser)
11941 /* However, a parameter-declaration of the form
11942 "foat(f)" (which is a valid declaration of a
11943 parameter "f") can also be interpreted as an
11944 expression (the conversion of "f" to "float"). */
11945 && !parenthesized_p)
11946 cp_parser_commit_to_tentative_parse (parser);
11950 cp_parser_error (parser, "expected %<,%> or %<...%>");
11951 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
11952 cp_parser_skip_to_closing_parenthesis (parser,
11953 /*recovering=*/true,
11954 /*or_comma=*/false,
11955 /*consume_paren=*/false);
11963 /* Parse a parameter declaration.
11965 parameter-declaration:
11966 decl-specifier-seq declarator
11967 decl-specifier-seq declarator = assignment-expression
11968 decl-specifier-seq abstract-declarator [opt]
11969 decl-specifier-seq abstract-declarator [opt] = assignment-expression
11971 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
11972 declares a template parameter. (In that case, a non-nested `>'
11973 token encountered during the parsing of the assignment-expression
11974 is not interpreted as a greater-than operator.)
11976 Returns a representation of the parameter, or NULL if an error
11977 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
11978 true iff the declarator is of the form "(p)". */
11980 static cp_parameter_declarator *
11981 cp_parser_parameter_declaration (cp_parser *parser,
11982 bool template_parm_p,
11983 bool *parenthesized_p)
11985 int declares_class_or_enum;
11986 bool greater_than_is_operator_p;
11987 cp_decl_specifier_seq decl_specifiers;
11988 cp_declarator *declarator;
11989 tree default_argument;
11991 const char *saved_message;
11993 /* In a template parameter, `>' is not an operator.
11997 When parsing a default template-argument for a non-type
11998 template-parameter, the first non-nested `>' is taken as the end
11999 of the template parameter-list rather than a greater-than
12001 greater_than_is_operator_p = !template_parm_p;
12003 /* Type definitions may not appear in parameter types. */
12004 saved_message = parser->type_definition_forbidden_message;
12005 parser->type_definition_forbidden_message
12006 = "types may not be defined in parameter types";
12008 /* Parse the declaration-specifiers. */
12009 cp_parser_decl_specifier_seq (parser,
12010 CP_PARSER_FLAGS_NONE,
12012 &declares_class_or_enum);
12013 /* If an error occurred, there's no reason to attempt to parse the
12014 rest of the declaration. */
12015 if (cp_parser_error_occurred (parser))
12017 parser->type_definition_forbidden_message = saved_message;
12021 /* Peek at the next token. */
12022 token = cp_lexer_peek_token (parser->lexer);
12023 /* If the next token is a `)', `,', `=', `>', or `...', then there
12024 is no declarator. */
12025 if (token->type == CPP_CLOSE_PAREN
12026 || token->type == CPP_COMMA
12027 || token->type == CPP_EQ
12028 || token->type == CPP_ELLIPSIS
12029 || token->type == CPP_GREATER)
12032 if (parenthesized_p)
12033 *parenthesized_p = false;
12035 /* Otherwise, there should be a declarator. */
12038 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
12039 parser->default_arg_ok_p = false;
12041 /* After seeing a decl-specifier-seq, if the next token is not a
12042 "(", there is no possibility that the code is a valid
12043 expression. Therefore, if parsing tentatively, we commit at
12045 if (!parser->in_template_argument_list_p
12046 /* In an expression context, having seen:
12050 we cannot be sure whether we are looking at a
12051 function-type (taking a "char" as a parameter) or a cast
12052 of some object of type "char" to "int". */
12053 && !parser->in_type_id_in_expr_p
12054 && cp_parser_uncommitted_to_tentative_parse_p (parser)
12055 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
12056 cp_parser_commit_to_tentative_parse (parser);
12057 /* Parse the declarator. */
12058 declarator = cp_parser_declarator (parser,
12059 CP_PARSER_DECLARATOR_EITHER,
12060 /*ctor_dtor_or_conv_p=*/NULL,
12062 /*member_p=*/false);
12063 parser->default_arg_ok_p = saved_default_arg_ok_p;
12064 /* After the declarator, allow more attributes. */
12065 decl_specifiers.attributes
12066 = chainon (decl_specifiers.attributes,
12067 cp_parser_attributes_opt (parser));
12070 /* The restriction on defining new types applies only to the type
12071 of the parameter, not to the default argument. */
12072 parser->type_definition_forbidden_message = saved_message;
12074 /* If the next token is `=', then process a default argument. */
12075 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
12077 bool saved_greater_than_is_operator_p;
12078 /* Consume the `='. */
12079 cp_lexer_consume_token (parser->lexer);
12081 /* If we are defining a class, then the tokens that make up the
12082 default argument must be saved and processed later. */
12083 if (!template_parm_p && at_class_scope_p ()
12084 && TYPE_BEING_DEFINED (current_class_type))
12086 unsigned depth = 0;
12087 cp_token *first_token;
12090 /* Add tokens until we have processed the entire default
12091 argument. We add the range [first_token, token). */
12092 first_token = cp_lexer_peek_token (parser->lexer);
12097 /* Peek at the next token. */
12098 token = cp_lexer_peek_token (parser->lexer);
12099 /* What we do depends on what token we have. */
12100 switch (token->type)
12102 /* In valid code, a default argument must be
12103 immediately followed by a `,' `)', or `...'. */
12105 case CPP_CLOSE_PAREN:
12107 /* If we run into a non-nested `;', `}', or `]',
12108 then the code is invalid -- but the default
12109 argument is certainly over. */
12110 case CPP_SEMICOLON:
12111 case CPP_CLOSE_BRACE:
12112 case CPP_CLOSE_SQUARE:
12115 /* Update DEPTH, if necessary. */
12116 else if (token->type == CPP_CLOSE_PAREN
12117 || token->type == CPP_CLOSE_BRACE
12118 || token->type == CPP_CLOSE_SQUARE)
12122 case CPP_OPEN_PAREN:
12123 case CPP_OPEN_SQUARE:
12124 case CPP_OPEN_BRACE:
12129 /* If we see a non-nested `>', and `>' is not an
12130 operator, then it marks the end of the default
12132 if (!depth && !greater_than_is_operator_p)
12136 /* If we run out of tokens, issue an error message. */
12138 error ("file ends in default argument");
12144 /* In these cases, we should look for template-ids.
12145 For example, if the default argument is
12146 `X<int, double>()', we need to do name lookup to
12147 figure out whether or not `X' is a template; if
12148 so, the `,' does not end the default argument.
12150 That is not yet done. */
12157 /* If we've reached the end, stop. */
12161 /* Add the token to the token block. */
12162 token = cp_lexer_consume_token (parser->lexer);
12165 /* Create a DEFAULT_ARG to represented the unparsed default
12167 default_argument = make_node (DEFAULT_ARG);
12168 DEFARG_TOKENS (default_argument)
12169 = cp_token_cache_new (first_token, token);
12170 DEFARG_INSTANTIATIONS (default_argument) = NULL;
12172 /* Outside of a class definition, we can just parse the
12173 assignment-expression. */
12176 bool saved_local_variables_forbidden_p;
12178 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
12180 saved_greater_than_is_operator_p
12181 = parser->greater_than_is_operator_p;
12182 parser->greater_than_is_operator_p = greater_than_is_operator_p;
12183 /* Local variable names (and the `this' keyword) may not
12184 appear in a default argument. */
12185 saved_local_variables_forbidden_p
12186 = parser->local_variables_forbidden_p;
12187 parser->local_variables_forbidden_p = true;
12188 /* Parse the assignment-expression. */
12190 = cp_parser_assignment_expression (parser, /*cast_p=*/false);
12191 /* Restore saved state. */
12192 parser->greater_than_is_operator_p
12193 = saved_greater_than_is_operator_p;
12194 parser->local_variables_forbidden_p
12195 = saved_local_variables_forbidden_p;
12197 if (!parser->default_arg_ok_p)
12199 if (!flag_pedantic_errors)
12200 warning (0, "deprecated use of default argument for parameter of non-function");
12203 error ("default arguments are only permitted for function parameters");
12204 default_argument = NULL_TREE;
12209 default_argument = NULL_TREE;
12211 return make_parameter_declarator (&decl_specifiers,
12216 /* Parse a function-body.
12219 compound_statement */
12222 cp_parser_function_body (cp_parser *parser)
12224 cp_parser_compound_statement (parser, NULL, false);
12227 /* Parse a ctor-initializer-opt followed by a function-body. Return
12228 true if a ctor-initializer was present. */
12231 cp_parser_ctor_initializer_opt_and_function_body (cp_parser *parser)
12234 bool ctor_initializer_p;
12236 /* Begin the function body. */
12237 body = begin_function_body ();
12238 /* Parse the optional ctor-initializer. */
12239 ctor_initializer_p = cp_parser_ctor_initializer_opt (parser);
12240 /* Parse the function-body. */
12241 cp_parser_function_body (parser);
12242 /* Finish the function body. */
12243 finish_function_body (body);
12245 return ctor_initializer_p;
12248 /* Parse an initializer.
12251 = initializer-clause
12252 ( expression-list )
12254 Returns an expression representing the initializer. If no
12255 initializer is present, NULL_TREE is returned.
12257 *IS_PARENTHESIZED_INIT is set to TRUE if the `( expression-list )'
12258 production is used, and zero otherwise. *IS_PARENTHESIZED_INIT is
12259 set to FALSE if there is no initializer present. If there is an
12260 initializer, and it is not a constant-expression, *NON_CONSTANT_P
12261 is set to true; otherwise it is set to false. */
12264 cp_parser_initializer (cp_parser* parser, bool* is_parenthesized_init,
12265 bool* non_constant_p)
12270 /* Peek at the next token. */
12271 token = cp_lexer_peek_token (parser->lexer);
12273 /* Let our caller know whether or not this initializer was
12275 *is_parenthesized_init = (token->type == CPP_OPEN_PAREN);
12276 /* Assume that the initializer is constant. */
12277 *non_constant_p = false;
12279 if (token->type == CPP_EQ)
12281 /* Consume the `='. */
12282 cp_lexer_consume_token (parser->lexer);
12283 /* Parse the initializer-clause. */
12284 init = cp_parser_initializer_clause (parser, non_constant_p);
12286 else if (token->type == CPP_OPEN_PAREN)
12287 init = cp_parser_parenthesized_expression_list (parser, false,
12292 /* Anything else is an error. */
12293 cp_parser_error (parser, "expected initializer");
12294 init = error_mark_node;
12300 /* Parse an initializer-clause.
12302 initializer-clause:
12303 assignment-expression
12304 { initializer-list , [opt] }
12307 Returns an expression representing the initializer.
12309 If the `assignment-expression' production is used the value
12310 returned is simply a representation for the expression.
12312 Otherwise, a CONSTRUCTOR is returned. The CONSTRUCTOR_ELTS will be
12313 the elements of the initializer-list (or NULL, if the last
12314 production is used). The TREE_TYPE for the CONSTRUCTOR will be
12315 NULL_TREE. There is no way to detect whether or not the optional
12316 trailing `,' was provided. NON_CONSTANT_P is as for
12317 cp_parser_initializer. */
12320 cp_parser_initializer_clause (cp_parser* parser, bool* non_constant_p)
12324 /* Assume the expression is constant. */
12325 *non_constant_p = false;
12327 /* If it is not a `{', then we are looking at an
12328 assignment-expression. */
12329 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
12332 = cp_parser_constant_expression (parser,
12333 /*allow_non_constant_p=*/true,
12335 if (!*non_constant_p)
12336 initializer = fold_non_dependent_expr (initializer);
12340 /* Consume the `{' token. */
12341 cp_lexer_consume_token (parser->lexer);
12342 /* Create a CONSTRUCTOR to represent the braced-initializer. */
12343 initializer = make_node (CONSTRUCTOR);
12344 /* If it's not a `}', then there is a non-trivial initializer. */
12345 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
12347 /* Parse the initializer list. */
12348 CONSTRUCTOR_ELTS (initializer)
12349 = cp_parser_initializer_list (parser, non_constant_p);
12350 /* A trailing `,' token is allowed. */
12351 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
12352 cp_lexer_consume_token (parser->lexer);
12354 /* Now, there should be a trailing `}'. */
12355 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
12358 return initializer;
12361 /* Parse an initializer-list.
12365 initializer-list , initializer-clause
12370 identifier : initializer-clause
12371 initializer-list, identifier : initializer-clause
12373 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
12374 for the initializer. If the INDEX of the elt is non-NULL, it is the
12375 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
12376 as for cp_parser_initializer. */
12378 static VEC(constructor_elt,gc) *
12379 cp_parser_initializer_list (cp_parser* parser, bool* non_constant_p)
12381 VEC(constructor_elt,gc) *v = NULL;
12383 /* Assume all of the expressions are constant. */
12384 *non_constant_p = false;
12386 /* Parse the rest of the list. */
12392 bool clause_non_constant_p;
12394 /* If the next token is an identifier and the following one is a
12395 colon, we are looking at the GNU designated-initializer
12397 if (cp_parser_allow_gnu_extensions_p (parser)
12398 && cp_lexer_next_token_is (parser->lexer, CPP_NAME)
12399 && cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_COLON)
12401 /* Consume the identifier. */
12402 identifier = cp_lexer_consume_token (parser->lexer)->value;
12403 /* Consume the `:'. */
12404 cp_lexer_consume_token (parser->lexer);
12407 identifier = NULL_TREE;
12409 /* Parse the initializer. */
12410 initializer = cp_parser_initializer_clause (parser,
12411 &clause_non_constant_p);
12412 /* If any clause is non-constant, so is the entire initializer. */
12413 if (clause_non_constant_p)
12414 *non_constant_p = true;
12416 /* Add it to the vector. */
12417 CONSTRUCTOR_APPEND_ELT(v, identifier, initializer);
12419 /* If the next token is not a comma, we have reached the end of
12421 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
12424 /* Peek at the next token. */
12425 token = cp_lexer_peek_nth_token (parser->lexer, 2);
12426 /* If the next token is a `}', then we're still done. An
12427 initializer-clause can have a trailing `,' after the
12428 initializer-list and before the closing `}'. */
12429 if (token->type == CPP_CLOSE_BRACE)
12432 /* Consume the `,' token. */
12433 cp_lexer_consume_token (parser->lexer);
12439 /* Classes [gram.class] */
12441 /* Parse a class-name.
12447 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
12448 to indicate that names looked up in dependent types should be
12449 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
12450 keyword has been used to indicate that the name that appears next
12451 is a template. TAG_TYPE indicates the explicit tag given before
12452 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
12453 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
12454 is the class being defined in a class-head.
12456 Returns the TYPE_DECL representing the class. */
12459 cp_parser_class_name (cp_parser *parser,
12460 bool typename_keyword_p,
12461 bool template_keyword_p,
12462 enum tag_types tag_type,
12463 bool check_dependency_p,
12465 bool is_declaration)
12472 /* All class-names start with an identifier. */
12473 token = cp_lexer_peek_token (parser->lexer);
12474 if (token->type != CPP_NAME && token->type != CPP_TEMPLATE_ID)
12476 cp_parser_error (parser, "expected class-name");
12477 return error_mark_node;
12480 /* PARSER->SCOPE can be cleared when parsing the template-arguments
12481 to a template-id, so we save it here. */
12482 scope = parser->scope;
12483 if (scope == error_mark_node)
12484 return error_mark_node;
12486 /* Any name names a type if we're following the `typename' keyword
12487 in a qualified name where the enclosing scope is type-dependent. */
12488 typename_p = (typename_keyword_p && scope && TYPE_P (scope)
12489 && dependent_type_p (scope));
12490 /* Handle the common case (an identifier, but not a template-id)
12492 if (token->type == CPP_NAME
12493 && !cp_parser_nth_token_starts_template_argument_list_p (parser, 2))
12497 /* Look for the identifier. */
12498 identifier = cp_parser_identifier (parser);
12499 /* If the next token isn't an identifier, we are certainly not
12500 looking at a class-name. */
12501 if (identifier == error_mark_node)
12502 decl = error_mark_node;
12503 /* If we know this is a type-name, there's no need to look it
12505 else if (typename_p)
12509 /* If the next token is a `::', then the name must be a type
12512 [basic.lookup.qual]
12514 During the lookup for a name preceding the :: scope
12515 resolution operator, object, function, and enumerator
12516 names are ignored. */
12517 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
12518 tag_type = typename_type;
12519 /* Look up the name. */
12520 decl = cp_parser_lookup_name (parser, identifier,
12522 /*is_template=*/false,
12523 /*is_namespace=*/false,
12524 check_dependency_p,
12525 /*ambiguous_p=*/NULL);
12530 /* Try a template-id. */
12531 decl = cp_parser_template_id (parser, template_keyword_p,
12532 check_dependency_p,
12534 if (decl == error_mark_node)
12535 return error_mark_node;
12538 decl = cp_parser_maybe_treat_template_as_class (decl, class_head_p);
12540 /* If this is a typename, create a TYPENAME_TYPE. */
12541 if (typename_p && decl != error_mark_node)
12543 decl = make_typename_type (scope, decl, typename_type, /*complain=*/1);
12544 if (decl != error_mark_node)
12545 decl = TYPE_NAME (decl);
12548 /* Check to see that it is really the name of a class. */
12549 if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
12550 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
12551 && cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
12552 /* Situations like this:
12554 template <typename T> struct A {
12555 typename T::template X<int>::I i;
12558 are problematic. Is `T::template X<int>' a class-name? The
12559 standard does not seem to be definitive, but there is no other
12560 valid interpretation of the following `::'. Therefore, those
12561 names are considered class-names. */
12562 decl = TYPE_NAME (make_typename_type (scope, decl, tag_type, tf_error));
12563 else if (decl == error_mark_node
12564 || TREE_CODE (decl) != TYPE_DECL
12565 || TREE_TYPE (decl) == error_mark_node
12566 || !IS_AGGR_TYPE (TREE_TYPE (decl)))
12568 cp_parser_error (parser, "expected class-name");
12569 return error_mark_node;
12575 /* Parse a class-specifier.
12578 class-head { member-specification [opt] }
12580 Returns the TREE_TYPE representing the class. */
12583 cp_parser_class_specifier (cp_parser* parser)
12587 tree attributes = NULL_TREE;
12588 int has_trailing_semicolon;
12589 bool nested_name_specifier_p;
12590 unsigned saved_num_template_parameter_lists;
12591 tree old_scope = NULL_TREE;
12592 tree scope = NULL_TREE;
12594 push_deferring_access_checks (dk_no_deferred);
12596 /* Parse the class-head. */
12597 type = cp_parser_class_head (parser,
12598 &nested_name_specifier_p,
12600 /* If the class-head was a semantic disaster, skip the entire body
12604 cp_parser_skip_to_end_of_block_or_statement (parser);
12605 pop_deferring_access_checks ();
12606 return error_mark_node;
12609 /* Look for the `{'. */
12610 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "`{'"))
12612 pop_deferring_access_checks ();
12613 return error_mark_node;
12616 /* Issue an error message if type-definitions are forbidden here. */
12617 cp_parser_check_type_definition (parser);
12618 /* Remember that we are defining one more class. */
12619 ++parser->num_classes_being_defined;
12620 /* Inside the class, surrounding template-parameter-lists do not
12622 saved_num_template_parameter_lists
12623 = parser->num_template_parameter_lists;
12624 parser->num_template_parameter_lists = 0;
12626 /* Start the class. */
12627 if (nested_name_specifier_p)
12629 scope = CP_DECL_CONTEXT (TYPE_MAIN_DECL (type));
12630 old_scope = push_inner_scope (scope);
12632 type = begin_class_definition (type);
12634 if (type == error_mark_node)
12635 /* If the type is erroneous, skip the entire body of the class. */
12636 cp_parser_skip_to_closing_brace (parser);
12638 /* Parse the member-specification. */
12639 cp_parser_member_specification_opt (parser);
12641 /* Look for the trailing `}'. */
12642 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
12643 /* We get better error messages by noticing a common problem: a
12644 missing trailing `;'. */
12645 token = cp_lexer_peek_token (parser->lexer);
12646 has_trailing_semicolon = (token->type == CPP_SEMICOLON);
12647 /* Look for trailing attributes to apply to this class. */
12648 if (cp_parser_allow_gnu_extensions_p (parser))
12650 tree sub_attr = cp_parser_attributes_opt (parser);
12651 attributes = chainon (attributes, sub_attr);
12653 if (type != error_mark_node)
12654 type = finish_struct (type, attributes);
12655 if (nested_name_specifier_p)
12656 pop_inner_scope (old_scope, scope);
12657 /* If this class is not itself within the scope of another class,
12658 then we need to parse the bodies of all of the queued function
12659 definitions. Note that the queued functions defined in a class
12660 are not always processed immediately following the
12661 class-specifier for that class. Consider:
12664 struct B { void f() { sizeof (A); } };
12667 If `f' were processed before the processing of `A' were
12668 completed, there would be no way to compute the size of `A'.
12669 Note that the nesting we are interested in here is lexical --
12670 not the semantic nesting given by TYPE_CONTEXT. In particular,
12673 struct A { struct B; };
12674 struct A::B { void f() { } };
12676 there is no need to delay the parsing of `A::B::f'. */
12677 if (--parser->num_classes_being_defined == 0)
12681 tree class_type = NULL_TREE;
12682 tree pushed_scope = NULL_TREE;
12684 /* In a first pass, parse default arguments to the functions.
12685 Then, in a second pass, parse the bodies of the functions.
12686 This two-phased approach handles cases like:
12694 for (TREE_PURPOSE (parser->unparsed_functions_queues)
12695 = nreverse (TREE_PURPOSE (parser->unparsed_functions_queues));
12696 (queue_entry = TREE_PURPOSE (parser->unparsed_functions_queues));
12697 TREE_PURPOSE (parser->unparsed_functions_queues)
12698 = TREE_CHAIN (TREE_PURPOSE (parser->unparsed_functions_queues)))
12700 fn = TREE_VALUE (queue_entry);
12701 /* If there are default arguments that have not yet been processed,
12702 take care of them now. */
12703 if (class_type != TREE_PURPOSE (queue_entry))
12706 pop_scope (pushed_scope);
12707 class_type = TREE_PURPOSE (queue_entry);
12708 pushed_scope = push_scope (class_type);
12710 /* Make sure that any template parameters are in scope. */
12711 maybe_begin_member_template_processing (fn);
12712 /* Parse the default argument expressions. */
12713 cp_parser_late_parsing_default_args (parser, fn);
12714 /* Remove any template parameters from the symbol table. */
12715 maybe_end_member_template_processing ();
12718 pop_scope (pushed_scope);
12719 /* Now parse the body of the functions. */
12720 for (TREE_VALUE (parser->unparsed_functions_queues)
12721 = nreverse (TREE_VALUE (parser->unparsed_functions_queues));
12722 (queue_entry = TREE_VALUE (parser->unparsed_functions_queues));
12723 TREE_VALUE (parser->unparsed_functions_queues)
12724 = TREE_CHAIN (TREE_VALUE (parser->unparsed_functions_queues)))
12726 /* Figure out which function we need to process. */
12727 fn = TREE_VALUE (queue_entry);
12728 /* Parse the function. */
12729 cp_parser_late_parsing_for_member (parser, fn);
12733 /* Put back any saved access checks. */
12734 pop_deferring_access_checks ();
12736 /* Restore the count of active template-parameter-lists. */
12737 parser->num_template_parameter_lists
12738 = saved_num_template_parameter_lists;
12743 /* Parse a class-head.
12746 class-key identifier [opt] base-clause [opt]
12747 class-key nested-name-specifier identifier base-clause [opt]
12748 class-key nested-name-specifier [opt] template-id
12752 class-key attributes identifier [opt] base-clause [opt]
12753 class-key attributes nested-name-specifier identifier base-clause [opt]
12754 class-key attributes nested-name-specifier [opt] template-id
12757 Returns the TYPE of the indicated class. Sets
12758 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
12759 involving a nested-name-specifier was used, and FALSE otherwise.
12761 Returns error_mark_node if this is not a class-head.
12763 Returns NULL_TREE if the class-head is syntactically valid, but
12764 semantically invalid in a way that means we should skip the entire
12765 body of the class. */
12768 cp_parser_class_head (cp_parser* parser,
12769 bool* nested_name_specifier_p,
12770 tree *attributes_p)
12772 tree nested_name_specifier;
12773 enum tag_types class_key;
12774 tree id = NULL_TREE;
12775 tree type = NULL_TREE;
12777 bool template_id_p = false;
12778 bool qualified_p = false;
12779 bool invalid_nested_name_p = false;
12780 bool invalid_explicit_specialization_p = false;
12781 tree pushed_scope = NULL_TREE;
12782 unsigned num_templates;
12785 /* Assume no nested-name-specifier will be present. */
12786 *nested_name_specifier_p = false;
12787 /* Assume no template parameter lists will be used in defining the
12791 /* Look for the class-key. */
12792 class_key = cp_parser_class_key (parser);
12793 if (class_key == none_type)
12794 return error_mark_node;
12796 /* Parse the attributes. */
12797 attributes = cp_parser_attributes_opt (parser);
12799 /* If the next token is `::', that is invalid -- but sometimes
12800 people do try to write:
12804 Handle this gracefully by accepting the extra qualifier, and then
12805 issuing an error about it later if this really is a
12806 class-head. If it turns out just to be an elaborated type
12807 specifier, remain silent. */
12808 if (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false))
12809 qualified_p = true;
12811 push_deferring_access_checks (dk_no_check);
12813 /* Determine the name of the class. Begin by looking for an
12814 optional nested-name-specifier. */
12815 nested_name_specifier
12816 = cp_parser_nested_name_specifier_opt (parser,
12817 /*typename_keyword_p=*/false,
12818 /*check_dependency_p=*/false,
12820 /*is_declaration=*/false);
12821 /* If there was a nested-name-specifier, then there *must* be an
12823 if (nested_name_specifier)
12825 /* Although the grammar says `identifier', it really means
12826 `class-name' or `template-name'. You are only allowed to
12827 define a class that has already been declared with this
12830 The proposed resolution for Core Issue 180 says that whever
12831 you see `class T::X' you should treat `X' as a type-name.
12833 It is OK to define an inaccessible class; for example:
12835 class A { class B; };
12838 We do not know if we will see a class-name, or a
12839 template-name. We look for a class-name first, in case the
12840 class-name is a template-id; if we looked for the
12841 template-name first we would stop after the template-name. */
12842 cp_parser_parse_tentatively (parser);
12843 type = cp_parser_class_name (parser,
12844 /*typename_keyword_p=*/false,
12845 /*template_keyword_p=*/false,
12847 /*check_dependency_p=*/false,
12848 /*class_head_p=*/true,
12849 /*is_declaration=*/false);
12850 /* If that didn't work, ignore the nested-name-specifier. */
12851 if (!cp_parser_parse_definitely (parser))
12853 invalid_nested_name_p = true;
12854 id = cp_parser_identifier (parser);
12855 if (id == error_mark_node)
12858 /* If we could not find a corresponding TYPE, treat this
12859 declaration like an unqualified declaration. */
12860 if (type == error_mark_node)
12861 nested_name_specifier = NULL_TREE;
12862 /* Otherwise, count the number of templates used in TYPE and its
12863 containing scopes. */
12868 for (scope = TREE_TYPE (type);
12869 scope && TREE_CODE (scope) != NAMESPACE_DECL;
12870 scope = (TYPE_P (scope)
12871 ? TYPE_CONTEXT (scope)
12872 : DECL_CONTEXT (scope)))
12874 && CLASS_TYPE_P (scope)
12875 && CLASSTYPE_TEMPLATE_INFO (scope)
12876 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope))
12877 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (scope))
12881 /* Otherwise, the identifier is optional. */
12884 /* We don't know whether what comes next is a template-id,
12885 an identifier, or nothing at all. */
12886 cp_parser_parse_tentatively (parser);
12887 /* Check for a template-id. */
12888 id = cp_parser_template_id (parser,
12889 /*template_keyword_p=*/false,
12890 /*check_dependency_p=*/true,
12891 /*is_declaration=*/true);
12892 /* If that didn't work, it could still be an identifier. */
12893 if (!cp_parser_parse_definitely (parser))
12895 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
12896 id = cp_parser_identifier (parser);
12902 template_id_p = true;
12907 pop_deferring_access_checks ();
12910 cp_parser_check_for_invalid_template_id (parser, id);
12912 /* If it's not a `:' or a `{' then we can't really be looking at a
12913 class-head, since a class-head only appears as part of a
12914 class-specifier. We have to detect this situation before calling
12915 xref_tag, since that has irreversible side-effects. */
12916 if (!cp_parser_next_token_starts_class_definition_p (parser))
12918 cp_parser_error (parser, "expected %<{%> or %<:%>");
12919 return error_mark_node;
12922 /* At this point, we're going ahead with the class-specifier, even
12923 if some other problem occurs. */
12924 cp_parser_commit_to_tentative_parse (parser);
12925 /* Issue the error about the overly-qualified name now. */
12927 cp_parser_error (parser,
12928 "global qualification of class name is invalid");
12929 else if (invalid_nested_name_p)
12930 cp_parser_error (parser,
12931 "qualified name does not name a class");
12932 else if (nested_name_specifier)
12936 /* Reject typedef-names in class heads. */
12937 if (!DECL_IMPLICIT_TYPEDEF_P (type))
12939 error ("invalid class name in declaration of %qD", type);
12944 /* Figure out in what scope the declaration is being placed. */
12945 scope = current_scope ();
12946 /* If that scope does not contain the scope in which the
12947 class was originally declared, the program is invalid. */
12948 if (scope && !is_ancestor (scope, nested_name_specifier))
12950 error ("declaration of %qD in %qD which does not enclose %qD",
12951 type, scope, nested_name_specifier);
12957 A declarator-id shall not be qualified exception of the
12958 definition of a ... nested class outside of its class
12959 ... [or] a the definition or explicit instantiation of a
12960 class member of a namespace outside of its namespace. */
12961 if (scope == nested_name_specifier)
12963 pedwarn ("extra qualification ignored");
12964 nested_name_specifier = NULL_TREE;
12968 /* An explicit-specialization must be preceded by "template <>". If
12969 it is not, try to recover gracefully. */
12970 if (at_namespace_scope_p ()
12971 && parser->num_template_parameter_lists == 0
12974 error ("an explicit specialization must be preceded by %<template <>%>");
12975 invalid_explicit_specialization_p = true;
12976 /* Take the same action that would have been taken by
12977 cp_parser_explicit_specialization. */
12978 ++parser->num_template_parameter_lists;
12979 begin_specialization ();
12981 /* There must be no "return" statements between this point and the
12982 end of this function; set "type "to the correct return value and
12983 use "goto done;" to return. */
12984 /* Make sure that the right number of template parameters were
12986 if (!cp_parser_check_template_parameters (parser, num_templates))
12988 /* If something went wrong, there is no point in even trying to
12989 process the class-definition. */
12994 /* Look up the type. */
12997 type = TREE_TYPE (id);
12998 maybe_process_partial_specialization (type);
12999 if (nested_name_specifier)
13000 pushed_scope = push_scope (nested_name_specifier);
13002 else if (nested_name_specifier)
13008 template <typename T> struct S { struct T };
13009 template <typename T> struct S<T>::T { };
13011 we will get a TYPENAME_TYPE when processing the definition of
13012 `S::T'. We need to resolve it to the actual type before we
13013 try to define it. */
13014 if (TREE_CODE (TREE_TYPE (type)) == TYPENAME_TYPE)
13016 class_type = resolve_typename_type (TREE_TYPE (type),
13017 /*only_current_p=*/false);
13018 if (class_type != error_mark_node)
13019 type = TYPE_NAME (class_type);
13022 cp_parser_error (parser, "could not resolve typename type");
13023 type = error_mark_node;
13027 maybe_process_partial_specialization (TREE_TYPE (type));
13028 class_type = current_class_type;
13029 /* Enter the scope indicated by the nested-name-specifier. */
13030 pushed_scope = push_scope (nested_name_specifier);
13031 /* Get the canonical version of this type. */
13032 type = TYPE_MAIN_DECL (TREE_TYPE (type));
13033 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
13034 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (type)))
13036 type = push_template_decl (type);
13037 if (type == error_mark_node)
13044 type = TREE_TYPE (type);
13045 *nested_name_specifier_p = true;
13047 else /* The name is not a nested name. */
13049 /* If the class was unnamed, create a dummy name. */
13051 id = make_anon_name ();
13052 type = xref_tag (class_key, id, /*tag_scope=*/ts_current,
13053 parser->num_template_parameter_lists);
13056 /* Indicate whether this class was declared as a `class' or as a
13058 if (TREE_CODE (type) == RECORD_TYPE)
13059 CLASSTYPE_DECLARED_CLASS (type) = (class_key == class_type);
13060 cp_parser_check_class_key (class_key, type);
13062 /* If this type was already complete, and we see another definition,
13063 that's an error. */
13064 if (type != error_mark_node && COMPLETE_TYPE_P (type))
13066 error ("redefinition of %q#T", type);
13067 error ("previous definition of %q+#T", type);
13072 /* We will have entered the scope containing the class; the names of
13073 base classes should be looked up in that context. For example:
13075 struct A { struct B {}; struct C; };
13076 struct A::C : B {};
13081 /* Get the list of base-classes, if there is one. */
13082 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
13083 bases = cp_parser_base_clause (parser);
13085 /* Process the base classes. */
13086 xref_basetypes (type, bases);
13089 /* Leave the scope given by the nested-name-specifier. We will
13090 enter the class scope itself while processing the members. */
13092 pop_scope (pushed_scope);
13094 if (invalid_explicit_specialization_p)
13096 end_specialization ();
13097 --parser->num_template_parameter_lists;
13099 *attributes_p = attributes;
13103 /* Parse a class-key.
13110 Returns the kind of class-key specified, or none_type to indicate
13113 static enum tag_types
13114 cp_parser_class_key (cp_parser* parser)
13117 enum tag_types tag_type;
13119 /* Look for the class-key. */
13120 token = cp_parser_require (parser, CPP_KEYWORD, "class-key");
13124 /* Check to see if the TOKEN is a class-key. */
13125 tag_type = cp_parser_token_is_class_key (token);
13127 cp_parser_error (parser, "expected class-key");
13131 /* Parse an (optional) member-specification.
13133 member-specification:
13134 member-declaration member-specification [opt]
13135 access-specifier : member-specification [opt] */
13138 cp_parser_member_specification_opt (cp_parser* parser)
13145 /* Peek at the next token. */
13146 token = cp_lexer_peek_token (parser->lexer);
13147 /* If it's a `}', or EOF then we've seen all the members. */
13148 if (token->type == CPP_CLOSE_BRACE || token->type == CPP_EOF)
13151 /* See if this token is a keyword. */
13152 keyword = token->keyword;
13156 case RID_PROTECTED:
13158 /* Consume the access-specifier. */
13159 cp_lexer_consume_token (parser->lexer);
13160 /* Remember which access-specifier is active. */
13161 current_access_specifier = token->value;
13162 /* Look for the `:'. */
13163 cp_parser_require (parser, CPP_COLON, "`:'");
13167 /* Accept #pragmas at class scope. */
13168 if (token->type == CPP_PRAGMA)
13170 cp_lexer_handle_pragma (parser->lexer);
13174 /* Otherwise, the next construction must be a
13175 member-declaration. */
13176 cp_parser_member_declaration (parser);
13181 /* Parse a member-declaration.
13183 member-declaration:
13184 decl-specifier-seq [opt] member-declarator-list [opt] ;
13185 function-definition ; [opt]
13186 :: [opt] nested-name-specifier template [opt] unqualified-id ;
13188 template-declaration
13190 member-declarator-list:
13192 member-declarator-list , member-declarator
13195 declarator pure-specifier [opt]
13196 declarator constant-initializer [opt]
13197 identifier [opt] : constant-expression
13201 member-declaration:
13202 __extension__ member-declaration
13205 declarator attributes [opt] pure-specifier [opt]
13206 declarator attributes [opt] constant-initializer [opt]
13207 identifier [opt] attributes [opt] : constant-expression */
13210 cp_parser_member_declaration (cp_parser* parser)
13212 cp_decl_specifier_seq decl_specifiers;
13213 tree prefix_attributes;
13215 int declares_class_or_enum;
13218 int saved_pedantic;
13220 /* Check for the `__extension__' keyword. */
13221 if (cp_parser_extension_opt (parser, &saved_pedantic))
13224 cp_parser_member_declaration (parser);
13225 /* Restore the old value of the PEDANTIC flag. */
13226 pedantic = saved_pedantic;
13231 /* Check for a template-declaration. */
13232 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
13234 /* Parse the template-declaration. */
13235 cp_parser_template_declaration (parser, /*member_p=*/true);
13240 /* Check for a using-declaration. */
13241 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_USING))
13243 /* Parse the using-declaration. */
13244 cp_parser_using_declaration (parser);
13249 /* Check for @defs. */
13250 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_DEFS))
13253 tree ivar_chains = cp_parser_objc_defs_expression (parser);
13254 ivar = ivar_chains;
13258 ivar = TREE_CHAIN (member);
13259 TREE_CHAIN (member) = NULL_TREE;
13260 finish_member_declaration (member);
13265 /* Parse the decl-specifier-seq. */
13266 cp_parser_decl_specifier_seq (parser,
13267 CP_PARSER_FLAGS_OPTIONAL,
13269 &declares_class_or_enum);
13270 prefix_attributes = decl_specifiers.attributes;
13271 decl_specifiers.attributes = NULL_TREE;
13272 /* Check for an invalid type-name. */
13273 if (!decl_specifiers.type
13274 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
13276 /* If there is no declarator, then the decl-specifier-seq should
13278 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
13280 /* If there was no decl-specifier-seq, and the next token is a
13281 `;', then we have something like:
13287 Each member-declaration shall declare at least one member
13288 name of the class. */
13289 if (!decl_specifiers.any_specifiers_p)
13291 cp_token *token = cp_lexer_peek_token (parser->lexer);
13292 if (pedantic && !token->in_system_header)
13293 pedwarn ("%Hextra %<;%>", &token->location);
13299 /* See if this declaration is a friend. */
13300 friend_p = cp_parser_friend_p (&decl_specifiers);
13301 /* If there were decl-specifiers, check to see if there was
13302 a class-declaration. */
13303 type = check_tag_decl (&decl_specifiers);
13304 /* Nested classes have already been added to the class, but
13305 a `friend' needs to be explicitly registered. */
13308 /* If the `friend' keyword was present, the friend must
13309 be introduced with a class-key. */
13310 if (!declares_class_or_enum)
13311 error ("a class-key must be used when declaring a friend");
13314 template <typename T> struct A {
13315 friend struct A<T>::B;
13318 A<T>::B will be represented by a TYPENAME_TYPE, and
13319 therefore not recognized by check_tag_decl. */
13321 && decl_specifiers.type
13322 && TYPE_P (decl_specifiers.type))
13323 type = decl_specifiers.type;
13324 if (!type || !TYPE_P (type))
13325 error ("friend declaration does not name a class or "
13328 make_friend_class (current_class_type, type,
13329 /*complain=*/true);
13331 /* If there is no TYPE, an error message will already have
13333 else if (!type || type == error_mark_node)
13335 /* An anonymous aggregate has to be handled specially; such
13336 a declaration really declares a data member (with a
13337 particular type), as opposed to a nested class. */
13338 else if (ANON_AGGR_TYPE_P (type))
13340 /* Remove constructors and such from TYPE, now that we
13341 know it is an anonymous aggregate. */
13342 fixup_anonymous_aggr (type);
13343 /* And make the corresponding data member. */
13344 decl = build_decl (FIELD_DECL, NULL_TREE, type);
13345 /* Add it to the class. */
13346 finish_member_declaration (decl);
13349 cp_parser_check_access_in_redeclaration (TYPE_NAME (type));
13354 /* See if these declarations will be friends. */
13355 friend_p = cp_parser_friend_p (&decl_specifiers);
13357 /* Keep going until we hit the `;' at the end of the
13359 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
13361 tree attributes = NULL_TREE;
13362 tree first_attribute;
13364 /* Peek at the next token. */
13365 token = cp_lexer_peek_token (parser->lexer);
13367 /* Check for a bitfield declaration. */
13368 if (token->type == CPP_COLON
13369 || (token->type == CPP_NAME
13370 && cp_lexer_peek_nth_token (parser->lexer, 2)->type
13376 /* Get the name of the bitfield. Note that we cannot just
13377 check TOKEN here because it may have been invalidated by
13378 the call to cp_lexer_peek_nth_token above. */
13379 if (cp_lexer_peek_token (parser->lexer)->type != CPP_COLON)
13380 identifier = cp_parser_identifier (parser);
13382 identifier = NULL_TREE;
13384 /* Consume the `:' token. */
13385 cp_lexer_consume_token (parser->lexer);
13386 /* Get the width of the bitfield. */
13388 = cp_parser_constant_expression (parser,
13389 /*allow_non_constant=*/false,
13392 /* Look for attributes that apply to the bitfield. */
13393 attributes = cp_parser_attributes_opt (parser);
13394 /* Remember which attributes are prefix attributes and
13396 first_attribute = attributes;
13397 /* Combine the attributes. */
13398 attributes = chainon (prefix_attributes, attributes);
13400 /* Create the bitfield declaration. */
13401 decl = grokbitfield (identifier
13402 ? make_id_declarator (NULL_TREE,
13407 /* Apply the attributes. */
13408 cplus_decl_attributes (&decl, attributes, /*flags=*/0);
13412 cp_declarator *declarator;
13414 tree asm_specification;
13415 int ctor_dtor_or_conv_p;
13417 /* Parse the declarator. */
13419 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
13420 &ctor_dtor_or_conv_p,
13421 /*parenthesized_p=*/NULL,
13422 /*member_p=*/true);
13424 /* If something went wrong parsing the declarator, make sure
13425 that we at least consume some tokens. */
13426 if (declarator == cp_error_declarator)
13428 /* Skip to the end of the statement. */
13429 cp_parser_skip_to_end_of_statement (parser);
13430 /* If the next token is not a semicolon, that is
13431 probably because we just skipped over the body of
13432 a function. So, we consume a semicolon if
13433 present, but do not issue an error message if it
13435 if (cp_lexer_next_token_is (parser->lexer,
13437 cp_lexer_consume_token (parser->lexer);
13441 if (declares_class_or_enum & 2)
13442 cp_parser_check_for_definition_in_return_type
13443 (declarator, decl_specifiers.type);
13445 /* Look for an asm-specification. */
13446 asm_specification = cp_parser_asm_specification_opt (parser);
13447 /* Look for attributes that apply to the declaration. */
13448 attributes = cp_parser_attributes_opt (parser);
13449 /* Remember which attributes are prefix attributes and
13451 first_attribute = attributes;
13452 /* Combine the attributes. */
13453 attributes = chainon (prefix_attributes, attributes);
13455 /* If it's an `=', then we have a constant-initializer or a
13456 pure-specifier. It is not correct to parse the
13457 initializer before registering the member declaration
13458 since the member declaration should be in scope while
13459 its initializer is processed. However, the rest of the
13460 front end does not yet provide an interface that allows
13461 us to handle this correctly. */
13462 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
13466 A pure-specifier shall be used only in the declaration of
13467 a virtual function.
13469 A member-declarator can contain a constant-initializer
13470 only if it declares a static member of integral or
13473 Therefore, if the DECLARATOR is for a function, we look
13474 for a pure-specifier; otherwise, we look for a
13475 constant-initializer. When we call `grokfield', it will
13476 perform more stringent semantics checks. */
13477 if (declarator->kind == cdk_function)
13478 initializer = cp_parser_pure_specifier (parser);
13480 /* Parse the initializer. */
13481 initializer = cp_parser_constant_initializer (parser);
13483 /* Otherwise, there is no initializer. */
13485 initializer = NULL_TREE;
13487 /* See if we are probably looking at a function
13488 definition. We are certainly not looking at a
13489 member-declarator. Calling `grokfield' has
13490 side-effects, so we must not do it unless we are sure
13491 that we are looking at a member-declarator. */
13492 if (cp_parser_token_starts_function_definition_p
13493 (cp_lexer_peek_token (parser->lexer)))
13495 /* The grammar does not allow a pure-specifier to be
13496 used when a member function is defined. (It is
13497 possible that this fact is an oversight in the
13498 standard, since a pure function may be defined
13499 outside of the class-specifier. */
13501 error ("pure-specifier on function-definition");
13502 decl = cp_parser_save_member_function_body (parser,
13506 /* If the member was not a friend, declare it here. */
13508 finish_member_declaration (decl);
13509 /* Peek at the next token. */
13510 token = cp_lexer_peek_token (parser->lexer);
13511 /* If the next token is a semicolon, consume it. */
13512 if (token->type == CPP_SEMICOLON)
13513 cp_lexer_consume_token (parser->lexer);
13518 /* Create the declaration. */
13519 decl = grokfield (declarator, &decl_specifiers,
13520 initializer, asm_specification,
13522 /* Any initialization must have been from a
13523 constant-expression. */
13524 if (decl && TREE_CODE (decl) == VAR_DECL && initializer)
13525 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = 1;
13529 /* Reset PREFIX_ATTRIBUTES. */
13530 while (attributes && TREE_CHAIN (attributes) != first_attribute)
13531 attributes = TREE_CHAIN (attributes);
13533 TREE_CHAIN (attributes) = NULL_TREE;
13535 /* If there is any qualification still in effect, clear it
13536 now; we will be starting fresh with the next declarator. */
13537 parser->scope = NULL_TREE;
13538 parser->qualifying_scope = NULL_TREE;
13539 parser->object_scope = NULL_TREE;
13540 /* If it's a `,', then there are more declarators. */
13541 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
13542 cp_lexer_consume_token (parser->lexer);
13543 /* If the next token isn't a `;', then we have a parse error. */
13544 else if (cp_lexer_next_token_is_not (parser->lexer,
13547 cp_parser_error (parser, "expected %<;%>");
13548 /* Skip tokens until we find a `;'. */
13549 cp_parser_skip_to_end_of_statement (parser);
13556 /* Add DECL to the list of members. */
13558 finish_member_declaration (decl);
13560 if (TREE_CODE (decl) == FUNCTION_DECL)
13561 cp_parser_save_default_args (parser, decl);
13566 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
13569 /* Parse a pure-specifier.
13574 Returns INTEGER_ZERO_NODE if a pure specifier is found.
13575 Otherwise, ERROR_MARK_NODE is returned. */
13578 cp_parser_pure_specifier (cp_parser* parser)
13582 /* Look for the `=' token. */
13583 if (!cp_parser_require (parser, CPP_EQ, "`='"))
13584 return error_mark_node;
13585 /* Look for the `0' token. */
13586 token = cp_lexer_consume_token (parser->lexer);
13587 if (token->type != CPP_NUMBER || !integer_zerop (token->value))
13589 cp_parser_error (parser,
13590 "invalid pure specifier (only `= 0' is allowed)");
13591 cp_parser_skip_to_end_of_statement (parser);
13592 return error_mark_node;
13595 /* FIXME: Unfortunately, this will accept `0L' and `0x00' as well.
13596 We need to get information from the lexer about how the number
13597 was spelled in order to fix this problem. */
13598 return integer_zero_node;
13601 /* Parse a constant-initializer.
13603 constant-initializer:
13604 = constant-expression
13606 Returns a representation of the constant-expression. */
13609 cp_parser_constant_initializer (cp_parser* parser)
13611 /* Look for the `=' token. */
13612 if (!cp_parser_require (parser, CPP_EQ, "`='"))
13613 return error_mark_node;
13615 /* It is invalid to write:
13617 struct S { static const int i = { 7 }; };
13620 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
13622 cp_parser_error (parser,
13623 "a brace-enclosed initializer is not allowed here");
13624 /* Consume the opening brace. */
13625 cp_lexer_consume_token (parser->lexer);
13626 /* Skip the initializer. */
13627 cp_parser_skip_to_closing_brace (parser);
13628 /* Look for the trailing `}'. */
13629 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
13631 return error_mark_node;
13634 return cp_parser_constant_expression (parser,
13635 /*allow_non_constant=*/false,
13639 /* Derived classes [gram.class.derived] */
13641 /* Parse a base-clause.
13644 : base-specifier-list
13646 base-specifier-list:
13648 base-specifier-list , base-specifier
13650 Returns a TREE_LIST representing the base-classes, in the order in
13651 which they were declared. The representation of each node is as
13652 described by cp_parser_base_specifier.
13654 In the case that no bases are specified, this function will return
13655 NULL_TREE, not ERROR_MARK_NODE. */
13658 cp_parser_base_clause (cp_parser* parser)
13660 tree bases = NULL_TREE;
13662 /* Look for the `:' that begins the list. */
13663 cp_parser_require (parser, CPP_COLON, "`:'");
13665 /* Scan the base-specifier-list. */
13671 /* Look for the base-specifier. */
13672 base = cp_parser_base_specifier (parser);
13673 /* Add BASE to the front of the list. */
13674 if (base != error_mark_node)
13676 TREE_CHAIN (base) = bases;
13679 /* Peek at the next token. */
13680 token = cp_lexer_peek_token (parser->lexer);
13681 /* If it's not a comma, then the list is complete. */
13682 if (token->type != CPP_COMMA)
13684 /* Consume the `,'. */
13685 cp_lexer_consume_token (parser->lexer);
13688 /* PARSER->SCOPE may still be non-NULL at this point, if the last
13689 base class had a qualified name. However, the next name that
13690 appears is certainly not qualified. */
13691 parser->scope = NULL_TREE;
13692 parser->qualifying_scope = NULL_TREE;
13693 parser->object_scope = NULL_TREE;
13695 return nreverse (bases);
13698 /* Parse a base-specifier.
13701 :: [opt] nested-name-specifier [opt] class-name
13702 virtual access-specifier [opt] :: [opt] nested-name-specifier
13704 access-specifier virtual [opt] :: [opt] nested-name-specifier
13707 Returns a TREE_LIST. The TREE_PURPOSE will be one of
13708 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
13709 indicate the specifiers provided. The TREE_VALUE will be a TYPE
13710 (or the ERROR_MARK_NODE) indicating the type that was specified. */
13713 cp_parser_base_specifier (cp_parser* parser)
13717 bool virtual_p = false;
13718 bool duplicate_virtual_error_issued_p = false;
13719 bool duplicate_access_error_issued_p = false;
13720 bool class_scope_p, template_p;
13721 tree access = access_default_node;
13724 /* Process the optional `virtual' and `access-specifier'. */
13727 /* Peek at the next token. */
13728 token = cp_lexer_peek_token (parser->lexer);
13729 /* Process `virtual'. */
13730 switch (token->keyword)
13733 /* If `virtual' appears more than once, issue an error. */
13734 if (virtual_p && !duplicate_virtual_error_issued_p)
13736 cp_parser_error (parser,
13737 "%<virtual%> specified more than once in base-specified");
13738 duplicate_virtual_error_issued_p = true;
13743 /* Consume the `virtual' token. */
13744 cp_lexer_consume_token (parser->lexer);
13749 case RID_PROTECTED:
13751 /* If more than one access specifier appears, issue an
13753 if (access != access_default_node
13754 && !duplicate_access_error_issued_p)
13756 cp_parser_error (parser,
13757 "more than one access specifier in base-specified");
13758 duplicate_access_error_issued_p = true;
13761 access = ridpointers[(int) token->keyword];
13763 /* Consume the access-specifier. */
13764 cp_lexer_consume_token (parser->lexer);
13773 /* It is not uncommon to see programs mechanically, erroneously, use
13774 the 'typename' keyword to denote (dependent) qualified types
13775 as base classes. */
13776 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
13778 if (!processing_template_decl)
13779 error ("keyword %<typename%> not allowed outside of templates");
13781 error ("keyword %<typename%> not allowed in this context "
13782 "(the base class is implicitly a type)");
13783 cp_lexer_consume_token (parser->lexer);
13786 /* Look for the optional `::' operator. */
13787 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
13788 /* Look for the nested-name-specifier. The simplest way to
13793 The keyword `typename' is not permitted in a base-specifier or
13794 mem-initializer; in these contexts a qualified name that
13795 depends on a template-parameter is implicitly assumed to be a
13798 is to pretend that we have seen the `typename' keyword at this
13800 cp_parser_nested_name_specifier_opt (parser,
13801 /*typename_keyword_p=*/true,
13802 /*check_dependency_p=*/true,
13804 /*is_declaration=*/true);
13805 /* If the base class is given by a qualified name, assume that names
13806 we see are type names or templates, as appropriate. */
13807 class_scope_p = (parser->scope && TYPE_P (parser->scope));
13808 template_p = class_scope_p && cp_parser_optional_template_keyword (parser);
13810 /* Finally, look for the class-name. */
13811 type = cp_parser_class_name (parser,
13815 /*check_dependency_p=*/true,
13816 /*class_head_p=*/false,
13817 /*is_declaration=*/true);
13819 if (type == error_mark_node)
13820 return error_mark_node;
13822 return finish_base_specifier (TREE_TYPE (type), access, virtual_p);
13825 /* Exception handling [gram.exception] */
13827 /* Parse an (optional) exception-specification.
13829 exception-specification:
13830 throw ( type-id-list [opt] )
13832 Returns a TREE_LIST representing the exception-specification. The
13833 TREE_VALUE of each node is a type. */
13836 cp_parser_exception_specification_opt (cp_parser* parser)
13841 /* Peek at the next token. */
13842 token = cp_lexer_peek_token (parser->lexer);
13843 /* If it's not `throw', then there's no exception-specification. */
13844 if (!cp_parser_is_keyword (token, RID_THROW))
13847 /* Consume the `throw'. */
13848 cp_lexer_consume_token (parser->lexer);
13850 /* Look for the `('. */
13851 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13853 /* Peek at the next token. */
13854 token = cp_lexer_peek_token (parser->lexer);
13855 /* If it's not a `)', then there is a type-id-list. */
13856 if (token->type != CPP_CLOSE_PAREN)
13858 const char *saved_message;
13860 /* Types may not be defined in an exception-specification. */
13861 saved_message = parser->type_definition_forbidden_message;
13862 parser->type_definition_forbidden_message
13863 = "types may not be defined in an exception-specification";
13864 /* Parse the type-id-list. */
13865 type_id_list = cp_parser_type_id_list (parser);
13866 /* Restore the saved message. */
13867 parser->type_definition_forbidden_message = saved_message;
13870 type_id_list = empty_except_spec;
13872 /* Look for the `)'. */
13873 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13875 return type_id_list;
13878 /* Parse an (optional) type-id-list.
13882 type-id-list , type-id
13884 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
13885 in the order that the types were presented. */
13888 cp_parser_type_id_list (cp_parser* parser)
13890 tree types = NULL_TREE;
13897 /* Get the next type-id. */
13898 type = cp_parser_type_id (parser);
13899 /* Add it to the list. */
13900 types = add_exception_specifier (types, type, /*complain=*/1);
13901 /* Peek at the next token. */
13902 token = cp_lexer_peek_token (parser->lexer);
13903 /* If it is not a `,', we are done. */
13904 if (token->type != CPP_COMMA)
13906 /* Consume the `,'. */
13907 cp_lexer_consume_token (parser->lexer);
13910 return nreverse (types);
13913 /* Parse a try-block.
13916 try compound-statement handler-seq */
13919 cp_parser_try_block (cp_parser* parser)
13923 cp_parser_require_keyword (parser, RID_TRY, "`try'");
13924 try_block = begin_try_block ();
13925 cp_parser_compound_statement (parser, NULL, true);
13926 finish_try_block (try_block);
13927 cp_parser_handler_seq (parser);
13928 finish_handler_sequence (try_block);
13933 /* Parse a function-try-block.
13935 function-try-block:
13936 try ctor-initializer [opt] function-body handler-seq */
13939 cp_parser_function_try_block (cp_parser* parser)
13942 bool ctor_initializer_p;
13944 /* Look for the `try' keyword. */
13945 if (!cp_parser_require_keyword (parser, RID_TRY, "`try'"))
13947 /* Let the rest of the front-end know where we are. */
13948 try_block = begin_function_try_block ();
13949 /* Parse the function-body. */
13951 = cp_parser_ctor_initializer_opt_and_function_body (parser);
13952 /* We're done with the `try' part. */
13953 finish_function_try_block (try_block);
13954 /* Parse the handlers. */
13955 cp_parser_handler_seq (parser);
13956 /* We're done with the handlers. */
13957 finish_function_handler_sequence (try_block);
13959 return ctor_initializer_p;
13962 /* Parse a handler-seq.
13965 handler handler-seq [opt] */
13968 cp_parser_handler_seq (cp_parser* parser)
13974 /* Parse the handler. */
13975 cp_parser_handler (parser);
13976 /* Peek at the next token. */
13977 token = cp_lexer_peek_token (parser->lexer);
13978 /* If it's not `catch' then there are no more handlers. */
13979 if (!cp_parser_is_keyword (token, RID_CATCH))
13984 /* Parse a handler.
13987 catch ( exception-declaration ) compound-statement */
13990 cp_parser_handler (cp_parser* parser)
13995 cp_parser_require_keyword (parser, RID_CATCH, "`catch'");
13996 handler = begin_handler ();
13997 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13998 declaration = cp_parser_exception_declaration (parser);
13999 finish_handler_parms (declaration, handler);
14000 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14001 cp_parser_compound_statement (parser, NULL, false);
14002 finish_handler (handler);
14005 /* Parse an exception-declaration.
14007 exception-declaration:
14008 type-specifier-seq declarator
14009 type-specifier-seq abstract-declarator
14013 Returns a VAR_DECL for the declaration, or NULL_TREE if the
14014 ellipsis variant is used. */
14017 cp_parser_exception_declaration (cp_parser* parser)
14020 cp_decl_specifier_seq type_specifiers;
14021 cp_declarator *declarator;
14022 const char *saved_message;
14024 /* If it's an ellipsis, it's easy to handle. */
14025 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
14027 /* Consume the `...' token. */
14028 cp_lexer_consume_token (parser->lexer);
14032 /* Types may not be defined in exception-declarations. */
14033 saved_message = parser->type_definition_forbidden_message;
14034 parser->type_definition_forbidden_message
14035 = "types may not be defined in exception-declarations";
14037 /* Parse the type-specifier-seq. */
14038 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
14040 /* If it's a `)', then there is no declarator. */
14041 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN))
14044 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_EITHER,
14045 /*ctor_dtor_or_conv_p=*/NULL,
14046 /*parenthesized_p=*/NULL,
14047 /*member_p=*/false);
14049 /* Restore the saved message. */
14050 parser->type_definition_forbidden_message = saved_message;
14052 if (type_specifiers.any_specifiers_p)
14054 decl = grokdeclarator (declarator, &type_specifiers, CATCHPARM, 1, NULL);
14055 if (decl == NULL_TREE)
14056 error ("invalid catch parameter");
14064 /* Parse a throw-expression.
14067 throw assignment-expression [opt]
14069 Returns a THROW_EXPR representing the throw-expression. */
14072 cp_parser_throw_expression (cp_parser* parser)
14077 cp_parser_require_keyword (parser, RID_THROW, "`throw'");
14078 token = cp_lexer_peek_token (parser->lexer);
14079 /* Figure out whether or not there is an assignment-expression
14080 following the "throw" keyword. */
14081 if (token->type == CPP_COMMA
14082 || token->type == CPP_SEMICOLON
14083 || token->type == CPP_CLOSE_PAREN
14084 || token->type == CPP_CLOSE_SQUARE
14085 || token->type == CPP_CLOSE_BRACE
14086 || token->type == CPP_COLON)
14087 expression = NULL_TREE;
14089 expression = cp_parser_assignment_expression (parser,
14092 return build_throw (expression);
14095 /* GNU Extensions */
14097 /* Parse an (optional) asm-specification.
14100 asm ( string-literal )
14102 If the asm-specification is present, returns a STRING_CST
14103 corresponding to the string-literal. Otherwise, returns
14107 cp_parser_asm_specification_opt (cp_parser* parser)
14110 tree asm_specification;
14112 /* Peek at the next token. */
14113 token = cp_lexer_peek_token (parser->lexer);
14114 /* If the next token isn't the `asm' keyword, then there's no
14115 asm-specification. */
14116 if (!cp_parser_is_keyword (token, RID_ASM))
14119 /* Consume the `asm' token. */
14120 cp_lexer_consume_token (parser->lexer);
14121 /* Look for the `('. */
14122 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14124 /* Look for the string-literal. */
14125 asm_specification = cp_parser_string_literal (parser, false, false);
14127 /* Look for the `)'. */
14128 cp_parser_require (parser, CPP_CLOSE_PAREN, "`('");
14130 return asm_specification;
14133 /* Parse an asm-operand-list.
14137 asm-operand-list , asm-operand
14140 string-literal ( expression )
14141 [ string-literal ] string-literal ( expression )
14143 Returns a TREE_LIST representing the operands. The TREE_VALUE of
14144 each node is the expression. The TREE_PURPOSE is itself a
14145 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
14146 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
14147 is a STRING_CST for the string literal before the parenthesis. */
14150 cp_parser_asm_operand_list (cp_parser* parser)
14152 tree asm_operands = NULL_TREE;
14156 tree string_literal;
14160 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
14162 /* Consume the `[' token. */
14163 cp_lexer_consume_token (parser->lexer);
14164 /* Read the operand name. */
14165 name = cp_parser_identifier (parser);
14166 if (name != error_mark_node)
14167 name = build_string (IDENTIFIER_LENGTH (name),
14168 IDENTIFIER_POINTER (name));
14169 /* Look for the closing `]'. */
14170 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
14174 /* Look for the string-literal. */
14175 string_literal = cp_parser_string_literal (parser, false, false);
14177 /* Look for the `('. */
14178 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14179 /* Parse the expression. */
14180 expression = cp_parser_expression (parser, /*cast_p=*/false);
14181 /* Look for the `)'. */
14182 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14184 /* Add this operand to the list. */
14185 asm_operands = tree_cons (build_tree_list (name, string_literal),
14188 /* If the next token is not a `,', there are no more
14190 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
14192 /* Consume the `,'. */
14193 cp_lexer_consume_token (parser->lexer);
14196 return nreverse (asm_operands);
14199 /* Parse an asm-clobber-list.
14203 asm-clobber-list , string-literal
14205 Returns a TREE_LIST, indicating the clobbers in the order that they
14206 appeared. The TREE_VALUE of each node is a STRING_CST. */
14209 cp_parser_asm_clobber_list (cp_parser* parser)
14211 tree clobbers = NULL_TREE;
14215 tree string_literal;
14217 /* Look for the string literal. */
14218 string_literal = cp_parser_string_literal (parser, false, false);
14219 /* Add it to the list. */
14220 clobbers = tree_cons (NULL_TREE, string_literal, clobbers);
14221 /* If the next token is not a `,', then the list is
14223 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
14225 /* Consume the `,' token. */
14226 cp_lexer_consume_token (parser->lexer);
14232 /* Parse an (optional) series of attributes.
14235 attributes attribute
14238 __attribute__ (( attribute-list [opt] ))
14240 The return value is as for cp_parser_attribute_list. */
14243 cp_parser_attributes_opt (cp_parser* parser)
14245 tree attributes = NULL_TREE;
14250 tree attribute_list;
14252 /* Peek at the next token. */
14253 token = cp_lexer_peek_token (parser->lexer);
14254 /* If it's not `__attribute__', then we're done. */
14255 if (token->keyword != RID_ATTRIBUTE)
14258 /* Consume the `__attribute__' keyword. */
14259 cp_lexer_consume_token (parser->lexer);
14260 /* Look for the two `(' tokens. */
14261 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14262 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14264 /* Peek at the next token. */
14265 token = cp_lexer_peek_token (parser->lexer);
14266 if (token->type != CPP_CLOSE_PAREN)
14267 /* Parse the attribute-list. */
14268 attribute_list = cp_parser_attribute_list (parser);
14270 /* If the next token is a `)', then there is no attribute
14272 attribute_list = NULL;
14274 /* Look for the two `)' tokens. */
14275 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14276 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14278 /* Add these new attributes to the list. */
14279 attributes = chainon (attributes, attribute_list);
14285 /* Parse an attribute-list.
14289 attribute-list , attribute
14293 identifier ( identifier )
14294 identifier ( identifier , expression-list )
14295 identifier ( expression-list )
14297 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
14298 to an attribute. The TREE_PURPOSE of each node is the identifier
14299 indicating which attribute is in use. The TREE_VALUE represents
14300 the arguments, if any. */
14303 cp_parser_attribute_list (cp_parser* parser)
14305 tree attribute_list = NULL_TREE;
14306 bool save_translate_strings_p = parser->translate_strings_p;
14308 parser->translate_strings_p = false;
14315 /* Look for the identifier. We also allow keywords here; for
14316 example `__attribute__ ((const))' is legal. */
14317 token = cp_lexer_peek_token (parser->lexer);
14318 if (token->type == CPP_NAME
14319 || token->type == CPP_KEYWORD)
14321 /* Consume the token. */
14322 token = cp_lexer_consume_token (parser->lexer);
14324 /* Save away the identifier that indicates which attribute
14326 identifier = token->value;
14327 attribute = build_tree_list (identifier, NULL_TREE);
14329 /* Peek at the next token. */
14330 token = cp_lexer_peek_token (parser->lexer);
14331 /* If it's an `(', then parse the attribute arguments. */
14332 if (token->type == CPP_OPEN_PAREN)
14336 arguments = (cp_parser_parenthesized_expression_list
14337 (parser, true, /*cast_p=*/false,
14338 /*non_constant_p=*/NULL));
14339 /* Save the identifier and arguments away. */
14340 TREE_VALUE (attribute) = arguments;
14343 /* Add this attribute to the list. */
14344 TREE_CHAIN (attribute) = attribute_list;
14345 attribute_list = attribute;
14347 token = cp_lexer_peek_token (parser->lexer);
14349 /* Now, look for more attributes. If the next token isn't a
14350 `,', we're done. */
14351 if (token->type != CPP_COMMA)
14354 /* Consume the comma and keep going. */
14355 cp_lexer_consume_token (parser->lexer);
14357 parser->translate_strings_p = save_translate_strings_p;
14359 /* We built up the list in reverse order. */
14360 return nreverse (attribute_list);
14363 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
14364 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
14365 current value of the PEDANTIC flag, regardless of whether or not
14366 the `__extension__' keyword is present. The caller is responsible
14367 for restoring the value of the PEDANTIC flag. */
14370 cp_parser_extension_opt (cp_parser* parser, int* saved_pedantic)
14372 /* Save the old value of the PEDANTIC flag. */
14373 *saved_pedantic = pedantic;
14375 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXTENSION))
14377 /* Consume the `__extension__' token. */
14378 cp_lexer_consume_token (parser->lexer);
14379 /* We're not being pedantic while the `__extension__' keyword is
14389 /* Parse a label declaration.
14392 __label__ label-declarator-seq ;
14394 label-declarator-seq:
14395 identifier , label-declarator-seq
14399 cp_parser_label_declaration (cp_parser* parser)
14401 /* Look for the `__label__' keyword. */
14402 cp_parser_require_keyword (parser, RID_LABEL, "`__label__'");
14408 /* Look for an identifier. */
14409 identifier = cp_parser_identifier (parser);
14410 /* If we failed, stop. */
14411 if (identifier == error_mark_node)
14413 /* Declare it as a label. */
14414 finish_label_decl (identifier);
14415 /* If the next token is a `;', stop. */
14416 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
14418 /* Look for the `,' separating the label declarations. */
14419 cp_parser_require (parser, CPP_COMMA, "`,'");
14422 /* Look for the final `;'. */
14423 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
14426 /* Support Functions */
14428 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
14429 NAME should have one of the representations used for an
14430 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
14431 is returned. If PARSER->SCOPE is a dependent type, then a
14432 SCOPE_REF is returned.
14434 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
14435 returned; the name was already resolved when the TEMPLATE_ID_EXPR
14436 was formed. Abstractly, such entities should not be passed to this
14437 function, because they do not need to be looked up, but it is
14438 simpler to check for this special case here, rather than at the
14441 In cases not explicitly covered above, this function returns a
14442 DECL, OVERLOAD, or baselink representing the result of the lookup.
14443 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
14446 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
14447 (e.g., "struct") that was used. In that case bindings that do not
14448 refer to types are ignored.
14450 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
14453 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
14456 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
14459 If AMBIGUOUS_P is non-NULL, it is set to true if name-lookup
14460 results in an ambiguity, and false otherwise. */
14463 cp_parser_lookup_name (cp_parser *parser, tree name,
14464 enum tag_types tag_type,
14465 bool is_template, bool is_namespace,
14466 bool check_dependency,
14471 tree object_type = parser->context->object_type;
14473 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
14474 flags |= LOOKUP_COMPLAIN;
14476 /* Assume that the lookup will be unambiguous. */
14478 *ambiguous_p = false;
14480 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
14481 no longer valid. Note that if we are parsing tentatively, and
14482 the parse fails, OBJECT_TYPE will be automatically restored. */
14483 parser->context->object_type = NULL_TREE;
14485 if (name == error_mark_node)
14486 return error_mark_node;
14488 /* A template-id has already been resolved; there is no lookup to
14490 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
14492 if (BASELINK_P (name))
14494 gcc_assert (TREE_CODE (BASELINK_FUNCTIONS (name))
14495 == TEMPLATE_ID_EXPR);
14499 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
14500 it should already have been checked to make sure that the name
14501 used matches the type being destroyed. */
14502 if (TREE_CODE (name) == BIT_NOT_EXPR)
14506 /* Figure out to which type this destructor applies. */
14508 type = parser->scope;
14509 else if (object_type)
14510 type = object_type;
14512 type = current_class_type;
14513 /* If that's not a class type, there is no destructor. */
14514 if (!type || !CLASS_TYPE_P (type))
14515 return error_mark_node;
14516 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
14517 lazily_declare_fn (sfk_destructor, type);
14518 if (!CLASSTYPE_DESTRUCTORS (type))
14519 return error_mark_node;
14520 /* If it was a class type, return the destructor. */
14521 return CLASSTYPE_DESTRUCTORS (type);
14524 /* By this point, the NAME should be an ordinary identifier. If
14525 the id-expression was a qualified name, the qualifying scope is
14526 stored in PARSER->SCOPE at this point. */
14527 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
14529 /* Perform the lookup. */
14534 if (parser->scope == error_mark_node)
14535 return error_mark_node;
14537 /* If the SCOPE is dependent, the lookup must be deferred until
14538 the template is instantiated -- unless we are explicitly
14539 looking up names in uninstantiated templates. Even then, we
14540 cannot look up the name if the scope is not a class type; it
14541 might, for example, be a template type parameter. */
14542 dependent_p = (TYPE_P (parser->scope)
14543 && !(parser->in_declarator_p
14544 && currently_open_class (parser->scope))
14545 && dependent_type_p (parser->scope));
14546 if ((check_dependency || !CLASS_TYPE_P (parser->scope))
14553 /* The resolution to Core Issue 180 says that `struct
14554 A::B' should be considered a type-name, even if `A'
14556 type = make_typename_type (parser->scope, name, tag_type,
14558 decl = TYPE_NAME (type);
14560 else if (is_template)
14561 decl = make_unbound_class_template (parser->scope,
14565 decl = build_nt (SCOPE_REF, parser->scope, name);
14569 tree pushed_scope = NULL_TREE;
14571 /* If PARSER->SCOPE is a dependent type, then it must be a
14572 class type, and we must not be checking dependencies;
14573 otherwise, we would have processed this lookup above. So
14574 that PARSER->SCOPE is not considered a dependent base by
14575 lookup_member, we must enter the scope here. */
14577 pushed_scope = push_scope (parser->scope);
14578 /* If the PARSER->SCOPE is a template specialization, it
14579 may be instantiated during name lookup. In that case,
14580 errors may be issued. Even if we rollback the current
14581 tentative parse, those errors are valid. */
14582 decl = lookup_qualified_name (parser->scope, name,
14583 tag_type != none_type,
14584 /*complain=*/true);
14586 pop_scope (pushed_scope);
14588 parser->qualifying_scope = parser->scope;
14589 parser->object_scope = NULL_TREE;
14591 else if (object_type)
14593 tree object_decl = NULL_TREE;
14594 /* Look up the name in the scope of the OBJECT_TYPE, unless the
14595 OBJECT_TYPE is not a class. */
14596 if (CLASS_TYPE_P (object_type))
14597 /* If the OBJECT_TYPE is a template specialization, it may
14598 be instantiated during name lookup. In that case, errors
14599 may be issued. Even if we rollback the current tentative
14600 parse, those errors are valid. */
14601 object_decl = lookup_member (object_type,
14604 tag_type != none_type);
14605 /* Look it up in the enclosing context, too. */
14606 decl = lookup_name_real (name, tag_type != none_type,
14608 /*block_p=*/true, is_namespace, flags);
14609 parser->object_scope = object_type;
14610 parser->qualifying_scope = NULL_TREE;
14612 decl = object_decl;
14616 decl = lookup_name_real (name, tag_type != none_type,
14618 /*block_p=*/true, is_namespace, flags);
14619 parser->qualifying_scope = NULL_TREE;
14620 parser->object_scope = NULL_TREE;
14623 /* If the lookup failed, let our caller know. */
14624 if (!decl || decl == error_mark_node)
14625 return error_mark_node;
14627 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
14628 if (TREE_CODE (decl) == TREE_LIST)
14631 *ambiguous_p = true;
14632 /* The error message we have to print is too complicated for
14633 cp_parser_error, so we incorporate its actions directly. */
14634 if (!cp_parser_simulate_error (parser))
14636 error ("reference to %qD is ambiguous", name);
14637 print_candidates (decl);
14639 return error_mark_node;
14642 gcc_assert (DECL_P (decl)
14643 || TREE_CODE (decl) == OVERLOAD
14644 || TREE_CODE (decl) == SCOPE_REF
14645 || TREE_CODE (decl) == UNBOUND_CLASS_TEMPLATE
14646 || BASELINK_P (decl));
14648 /* If we have resolved the name of a member declaration, check to
14649 see if the declaration is accessible. When the name resolves to
14650 set of overloaded functions, accessibility is checked when
14651 overload resolution is done.
14653 During an explicit instantiation, access is not checked at all,
14654 as per [temp.explicit]. */
14656 check_accessibility_of_qualified_id (decl, object_type, parser->scope);
14661 /* Like cp_parser_lookup_name, but for use in the typical case where
14662 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
14663 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
14666 cp_parser_lookup_name_simple (cp_parser* parser, tree name)
14668 return cp_parser_lookup_name (parser, name,
14670 /*is_template=*/false,
14671 /*is_namespace=*/false,
14672 /*check_dependency=*/true,
14673 /*ambiguous_p=*/NULL);
14676 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
14677 the current context, return the TYPE_DECL. If TAG_NAME_P is
14678 true, the DECL indicates the class being defined in a class-head,
14679 or declared in an elaborated-type-specifier.
14681 Otherwise, return DECL. */
14684 cp_parser_maybe_treat_template_as_class (tree decl, bool tag_name_p)
14686 /* If the TEMPLATE_DECL is being declared as part of a class-head,
14687 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
14690 template <typename T> struct B;
14693 template <typename T> struct A::B {};
14695 Similarly, in an elaborated-type-specifier:
14697 namespace N { struct X{}; }
14700 template <typename T> friend struct N::X;
14703 However, if the DECL refers to a class type, and we are in
14704 the scope of the class, then the name lookup automatically
14705 finds the TYPE_DECL created by build_self_reference rather
14706 than a TEMPLATE_DECL. For example, in:
14708 template <class T> struct S {
14712 there is no need to handle such case. */
14714 if (DECL_CLASS_TEMPLATE_P (decl) && tag_name_p)
14715 return DECL_TEMPLATE_RESULT (decl);
14720 /* If too many, or too few, template-parameter lists apply to the
14721 declarator, issue an error message. Returns TRUE if all went well,
14722 and FALSE otherwise. */
14725 cp_parser_check_declarator_template_parameters (cp_parser* parser,
14726 cp_declarator *declarator)
14728 unsigned num_templates;
14730 /* We haven't seen any classes that involve template parameters yet. */
14733 switch (declarator->kind)
14736 if (declarator->u.id.qualifying_scope)
14741 scope = declarator->u.id.qualifying_scope;
14742 member = declarator->u.id.unqualified_name;
14744 while (scope && CLASS_TYPE_P (scope))
14746 /* You're supposed to have one `template <...>'
14747 for every template class, but you don't need one
14748 for a full specialization. For example:
14750 template <class T> struct S{};
14751 template <> struct S<int> { void f(); };
14752 void S<int>::f () {}
14754 is correct; there shouldn't be a `template <>' for
14755 the definition of `S<int>::f'. */
14756 if (CLASSTYPE_TEMPLATE_INFO (scope)
14757 && (CLASSTYPE_TEMPLATE_INSTANTIATION (scope)
14758 || uses_template_parms (CLASSTYPE_TI_ARGS (scope)))
14759 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope)))
14762 scope = TYPE_CONTEXT (scope);
14765 else if (TREE_CODE (declarator->u.id.unqualified_name)
14766 == TEMPLATE_ID_EXPR)
14767 /* If the DECLARATOR has the form `X<y>' then it uses one
14768 additional level of template parameters. */
14771 return cp_parser_check_template_parameters (parser,
14777 case cdk_reference:
14779 return (cp_parser_check_declarator_template_parameters
14780 (parser, declarator->declarator));
14786 gcc_unreachable ();
14791 /* NUM_TEMPLATES were used in the current declaration. If that is
14792 invalid, return FALSE and issue an error messages. Otherwise,
14796 cp_parser_check_template_parameters (cp_parser* parser,
14797 unsigned num_templates)
14799 /* If there are more template classes than parameter lists, we have
14802 template <class T> void S<T>::R<T>::f (); */
14803 if (parser->num_template_parameter_lists < num_templates)
14805 error ("too few template-parameter-lists");
14808 /* If there are the same number of template classes and parameter
14809 lists, that's OK. */
14810 if (parser->num_template_parameter_lists == num_templates)
14812 /* If there are more, but only one more, then we are referring to a
14813 member template. That's OK too. */
14814 if (parser->num_template_parameter_lists == num_templates + 1)
14816 /* Otherwise, there are too many template parameter lists. We have
14819 template <class T> template <class U> void S::f(); */
14820 error ("too many template-parameter-lists");
14824 /* Parse an optional `::' token indicating that the following name is
14825 from the global namespace. If so, PARSER->SCOPE is set to the
14826 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
14827 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
14828 Returns the new value of PARSER->SCOPE, if the `::' token is
14829 present, and NULL_TREE otherwise. */
14832 cp_parser_global_scope_opt (cp_parser* parser, bool current_scope_valid_p)
14836 /* Peek at the next token. */
14837 token = cp_lexer_peek_token (parser->lexer);
14838 /* If we're looking at a `::' token then we're starting from the
14839 global namespace, not our current location. */
14840 if (token->type == CPP_SCOPE)
14842 /* Consume the `::' token. */
14843 cp_lexer_consume_token (parser->lexer);
14844 /* Set the SCOPE so that we know where to start the lookup. */
14845 parser->scope = global_namespace;
14846 parser->qualifying_scope = global_namespace;
14847 parser->object_scope = NULL_TREE;
14849 return parser->scope;
14851 else if (!current_scope_valid_p)
14853 parser->scope = NULL_TREE;
14854 parser->qualifying_scope = NULL_TREE;
14855 parser->object_scope = NULL_TREE;
14861 /* Returns TRUE if the upcoming token sequence is the start of a
14862 constructor declarator. If FRIEND_P is true, the declarator is
14863 preceded by the `friend' specifier. */
14866 cp_parser_constructor_declarator_p (cp_parser *parser, bool friend_p)
14868 bool constructor_p;
14869 tree type_decl = NULL_TREE;
14870 bool nested_name_p;
14871 cp_token *next_token;
14873 /* The common case is that this is not a constructor declarator, so
14874 try to avoid doing lots of work if at all possible. It's not
14875 valid declare a constructor at function scope. */
14876 if (at_function_scope_p ())
14878 /* And only certain tokens can begin a constructor declarator. */
14879 next_token = cp_lexer_peek_token (parser->lexer);
14880 if (next_token->type != CPP_NAME
14881 && next_token->type != CPP_SCOPE
14882 && next_token->type != CPP_NESTED_NAME_SPECIFIER
14883 && next_token->type != CPP_TEMPLATE_ID)
14886 /* Parse tentatively; we are going to roll back all of the tokens
14888 cp_parser_parse_tentatively (parser);
14889 /* Assume that we are looking at a constructor declarator. */
14890 constructor_p = true;
14892 /* Look for the optional `::' operator. */
14893 cp_parser_global_scope_opt (parser,
14894 /*current_scope_valid_p=*/false);
14895 /* Look for the nested-name-specifier. */
14897 = (cp_parser_nested_name_specifier_opt (parser,
14898 /*typename_keyword_p=*/false,
14899 /*check_dependency_p=*/false,
14901 /*is_declaration=*/false)
14903 /* Outside of a class-specifier, there must be a
14904 nested-name-specifier. */
14905 if (!nested_name_p &&
14906 (!at_class_scope_p () || !TYPE_BEING_DEFINED (current_class_type)
14908 constructor_p = false;
14909 /* If we still think that this might be a constructor-declarator,
14910 look for a class-name. */
14915 template <typename T> struct S { S(); };
14916 template <typename T> S<T>::S ();
14918 we must recognize that the nested `S' names a class.
14921 template <typename T> S<T>::S<T> ();
14923 we must recognize that the nested `S' names a template. */
14924 type_decl = cp_parser_class_name (parser,
14925 /*typename_keyword_p=*/false,
14926 /*template_keyword_p=*/false,
14928 /*check_dependency_p=*/false,
14929 /*class_head_p=*/false,
14930 /*is_declaration=*/false);
14931 /* If there was no class-name, then this is not a constructor. */
14932 constructor_p = !cp_parser_error_occurred (parser);
14935 /* If we're still considering a constructor, we have to see a `(',
14936 to begin the parameter-declaration-clause, followed by either a
14937 `)', an `...', or a decl-specifier. We need to check for a
14938 type-specifier to avoid being fooled into thinking that:
14942 is a constructor. (It is actually a function named `f' that
14943 takes one parameter (of type `int') and returns a value of type
14946 && cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
14948 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN)
14949 && cp_lexer_next_token_is_not (parser->lexer, CPP_ELLIPSIS)
14950 /* A parameter declaration begins with a decl-specifier,
14951 which is either the "attribute" keyword, a storage class
14952 specifier, or (usually) a type-specifier. */
14953 && !cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE)
14954 && !cp_parser_storage_class_specifier_opt (parser))
14957 tree pushed_scope = NULL_TREE;
14958 unsigned saved_num_template_parameter_lists;
14960 /* Names appearing in the type-specifier should be looked up
14961 in the scope of the class. */
14962 if (current_class_type)
14966 type = TREE_TYPE (type_decl);
14967 if (TREE_CODE (type) == TYPENAME_TYPE)
14969 type = resolve_typename_type (type,
14970 /*only_current_p=*/false);
14971 if (type == error_mark_node)
14973 cp_parser_abort_tentative_parse (parser);
14977 pushed_scope = push_scope (type);
14980 /* Inside the constructor parameter list, surrounding
14981 template-parameter-lists do not apply. */
14982 saved_num_template_parameter_lists
14983 = parser->num_template_parameter_lists;
14984 parser->num_template_parameter_lists = 0;
14986 /* Look for the type-specifier. */
14987 cp_parser_type_specifier (parser,
14988 CP_PARSER_FLAGS_NONE,
14989 /*decl_specs=*/NULL,
14990 /*is_declarator=*/true,
14991 /*declares_class_or_enum=*/NULL,
14992 /*is_cv_qualifier=*/NULL);
14994 parser->num_template_parameter_lists
14995 = saved_num_template_parameter_lists;
14997 /* Leave the scope of the class. */
14999 pop_scope (pushed_scope);
15001 constructor_p = !cp_parser_error_occurred (parser);
15005 constructor_p = false;
15006 /* We did not really want to consume any tokens. */
15007 cp_parser_abort_tentative_parse (parser);
15009 return constructor_p;
15012 /* Parse the definition of the function given by the DECL_SPECIFIERS,
15013 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
15014 they must be performed once we are in the scope of the function.
15016 Returns the function defined. */
15019 cp_parser_function_definition_from_specifiers_and_declarator
15020 (cp_parser* parser,
15021 cp_decl_specifier_seq *decl_specifiers,
15023 const cp_declarator *declarator)
15028 /* Begin the function-definition. */
15029 success_p = start_function (decl_specifiers, declarator, attributes);
15031 /* The things we're about to see are not directly qualified by any
15032 template headers we've seen thus far. */
15033 reset_specialization ();
15035 /* If there were names looked up in the decl-specifier-seq that we
15036 did not check, check them now. We must wait until we are in the
15037 scope of the function to perform the checks, since the function
15038 might be a friend. */
15039 perform_deferred_access_checks ();
15043 /* Skip the entire function. */
15044 error ("invalid function declaration");
15045 cp_parser_skip_to_end_of_block_or_statement (parser);
15046 fn = error_mark_node;
15049 fn = cp_parser_function_definition_after_declarator (parser,
15050 /*inline_p=*/false);
15055 /* Parse the part of a function-definition that follows the
15056 declarator. INLINE_P is TRUE iff this function is an inline
15057 function defined with a class-specifier.
15059 Returns the function defined. */
15062 cp_parser_function_definition_after_declarator (cp_parser* parser,
15066 bool ctor_initializer_p = false;
15067 bool saved_in_unbraced_linkage_specification_p;
15068 unsigned saved_num_template_parameter_lists;
15070 /* If the next token is `return', then the code may be trying to
15071 make use of the "named return value" extension that G++ used to
15073 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_RETURN))
15075 /* Consume the `return' keyword. */
15076 cp_lexer_consume_token (parser->lexer);
15077 /* Look for the identifier that indicates what value is to be
15079 cp_parser_identifier (parser);
15080 /* Issue an error message. */
15081 error ("named return values are no longer supported");
15082 /* Skip tokens until we reach the start of the function body. */
15083 while (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE)
15084 && cp_lexer_next_token_is_not (parser->lexer, CPP_EOF))
15085 cp_lexer_consume_token (parser->lexer);
15087 /* The `extern' in `extern "C" void f () { ... }' does not apply to
15088 anything declared inside `f'. */
15089 saved_in_unbraced_linkage_specification_p
15090 = parser->in_unbraced_linkage_specification_p;
15091 parser->in_unbraced_linkage_specification_p = false;
15092 /* Inside the function, surrounding template-parameter-lists do not
15094 saved_num_template_parameter_lists
15095 = parser->num_template_parameter_lists;
15096 parser->num_template_parameter_lists = 0;
15097 /* If the next token is `try', then we are looking at a
15098 function-try-block. */
15099 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRY))
15100 ctor_initializer_p = cp_parser_function_try_block (parser);
15101 /* A function-try-block includes the function-body, so we only do
15102 this next part if we're not processing a function-try-block. */
15105 = cp_parser_ctor_initializer_opt_and_function_body (parser);
15107 /* Finish the function. */
15108 fn = finish_function ((ctor_initializer_p ? 1 : 0) |
15109 (inline_p ? 2 : 0));
15110 /* Generate code for it, if necessary. */
15111 expand_or_defer_fn (fn);
15112 /* Restore the saved values. */
15113 parser->in_unbraced_linkage_specification_p
15114 = saved_in_unbraced_linkage_specification_p;
15115 parser->num_template_parameter_lists
15116 = saved_num_template_parameter_lists;
15121 /* Parse a template-declaration, assuming that the `export' (and
15122 `extern') keywords, if present, has already been scanned. MEMBER_P
15123 is as for cp_parser_template_declaration. */
15126 cp_parser_template_declaration_after_export (cp_parser* parser, bool member_p)
15128 tree decl = NULL_TREE;
15129 tree parameter_list;
15130 bool friend_p = false;
15132 /* Look for the `template' keyword. */
15133 if (!cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'"))
15137 if (!cp_parser_require (parser, CPP_LESS, "`<'"))
15140 /* If the next token is `>', then we have an invalid
15141 specialization. Rather than complain about an invalid template
15142 parameter, issue an error message here. */
15143 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
15145 cp_parser_error (parser, "invalid explicit specialization");
15146 begin_specialization ();
15147 parameter_list = NULL_TREE;
15151 /* Parse the template parameters. */
15152 begin_template_parm_list ();
15153 parameter_list = cp_parser_template_parameter_list (parser);
15154 parameter_list = end_template_parm_list (parameter_list);
15157 /* Look for the `>'. */
15158 cp_parser_skip_until_found (parser, CPP_GREATER, "`>'");
15159 /* We just processed one more parameter list. */
15160 ++parser->num_template_parameter_lists;
15161 /* If the next token is `template', there are more template
15163 if (cp_lexer_next_token_is_keyword (parser->lexer,
15165 cp_parser_template_declaration_after_export (parser, member_p);
15168 /* There are no access checks when parsing a template, as we do not
15169 know if a specialization will be a friend. */
15170 push_deferring_access_checks (dk_no_check);
15172 decl = cp_parser_single_declaration (parser,
15176 pop_deferring_access_checks ();
15178 /* If this is a member template declaration, let the front
15180 if (member_p && !friend_p && decl)
15182 if (TREE_CODE (decl) == TYPE_DECL)
15183 cp_parser_check_access_in_redeclaration (decl);
15185 decl = finish_member_template_decl (decl);
15187 else if (friend_p && decl && TREE_CODE (decl) == TYPE_DECL)
15188 make_friend_class (current_class_type, TREE_TYPE (decl),
15189 /*complain=*/true);
15191 /* We are done with the current parameter list. */
15192 --parser->num_template_parameter_lists;
15195 finish_template_decl (parameter_list);
15197 /* Register member declarations. */
15198 if (member_p && !friend_p && decl && !DECL_CLASS_TEMPLATE_P (decl))
15199 finish_member_declaration (decl);
15201 /* If DECL is a function template, we must return to parse it later.
15202 (Even though there is no definition, there might be default
15203 arguments that need handling.) */
15204 if (member_p && decl
15205 && (TREE_CODE (decl) == FUNCTION_DECL
15206 || DECL_FUNCTION_TEMPLATE_P (decl)))
15207 TREE_VALUE (parser->unparsed_functions_queues)
15208 = tree_cons (NULL_TREE, decl,
15209 TREE_VALUE (parser->unparsed_functions_queues));
15212 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
15213 `function-definition' sequence. MEMBER_P is true, this declaration
15214 appears in a class scope.
15216 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
15217 *FRIEND_P is set to TRUE iff the declaration is a friend. */
15220 cp_parser_single_declaration (cp_parser* parser,
15224 int declares_class_or_enum;
15225 tree decl = NULL_TREE;
15226 cp_decl_specifier_seq decl_specifiers;
15227 bool function_definition_p = false;
15229 /* This function is only used when processing a template
15231 gcc_assert (innermost_scope_kind () == sk_template_parms
15232 || innermost_scope_kind () == sk_template_spec);
15234 /* Defer access checks until we know what is being declared. */
15235 push_deferring_access_checks (dk_deferred);
15237 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
15239 cp_parser_decl_specifier_seq (parser,
15240 CP_PARSER_FLAGS_OPTIONAL,
15242 &declares_class_or_enum);
15244 *friend_p = cp_parser_friend_p (&decl_specifiers);
15246 /* There are no template typedefs. */
15247 if (decl_specifiers.specs[(int) ds_typedef])
15249 error ("template declaration of %qs", "typedef");
15250 decl = error_mark_node;
15253 /* Gather up the access checks that occurred the
15254 decl-specifier-seq. */
15255 stop_deferring_access_checks ();
15257 /* Check for the declaration of a template class. */
15258 if (declares_class_or_enum)
15260 if (cp_parser_declares_only_class_p (parser))
15262 decl = shadow_tag (&decl_specifiers);
15267 friend template <typename T> struct A<T>::B;
15270 A<T>::B will be represented by a TYPENAME_TYPE, and
15271 therefore not recognized by shadow_tag. */
15272 if (friend_p && *friend_p
15274 && decl_specifiers.type
15275 && TYPE_P (decl_specifiers.type))
15276 decl = decl_specifiers.type;
15278 if (decl && decl != error_mark_node)
15279 decl = TYPE_NAME (decl);
15281 decl = error_mark_node;
15284 /* If it's not a template class, try for a template function. If
15285 the next token is a `;', then this declaration does not declare
15286 anything. But, if there were errors in the decl-specifiers, then
15287 the error might well have come from an attempted class-specifier.
15288 In that case, there's no need to warn about a missing declarator. */
15290 && (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON)
15291 || decl_specifiers.type != error_mark_node))
15292 decl = cp_parser_init_declarator (parser,
15294 /*function_definition_allowed_p=*/true,
15296 declares_class_or_enum,
15297 &function_definition_p);
15299 pop_deferring_access_checks ();
15301 /* Clear any current qualification; whatever comes next is the start
15302 of something new. */
15303 parser->scope = NULL_TREE;
15304 parser->qualifying_scope = NULL_TREE;
15305 parser->object_scope = NULL_TREE;
15306 /* Look for a trailing `;' after the declaration. */
15307 if (!function_definition_p
15308 && (decl == error_mark_node
15309 || !cp_parser_require (parser, CPP_SEMICOLON, "`;'")))
15310 cp_parser_skip_to_end_of_block_or_statement (parser);
15315 /* Parse a cast-expression that is not the operand of a unary "&". */
15318 cp_parser_simple_cast_expression (cp_parser *parser)
15320 return cp_parser_cast_expression (parser, /*address_p=*/false,
15324 /* Parse a functional cast to TYPE. Returns an expression
15325 representing the cast. */
15328 cp_parser_functional_cast (cp_parser* parser, tree type)
15330 tree expression_list;
15334 = cp_parser_parenthesized_expression_list (parser, false,
15336 /*non_constant_p=*/NULL);
15338 cast = build_functional_cast (type, expression_list);
15339 /* [expr.const]/1: In an integral constant expression "only type
15340 conversions to integral or enumeration type can be used". */
15341 if (cast != error_mark_node && !type_dependent_expression_p (type)
15342 && !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (type)))
15344 if (cp_parser_non_integral_constant_expression
15345 (parser, "a call to a constructor"))
15346 return error_mark_node;
15351 /* Save the tokens that make up the body of a member function defined
15352 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
15353 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
15354 specifiers applied to the declaration. Returns the FUNCTION_DECL
15355 for the member function. */
15358 cp_parser_save_member_function_body (cp_parser* parser,
15359 cp_decl_specifier_seq *decl_specifiers,
15360 cp_declarator *declarator,
15367 /* Create the function-declaration. */
15368 fn = start_method (decl_specifiers, declarator, attributes);
15369 /* If something went badly wrong, bail out now. */
15370 if (fn == error_mark_node)
15372 /* If there's a function-body, skip it. */
15373 if (cp_parser_token_starts_function_definition_p
15374 (cp_lexer_peek_token (parser->lexer)))
15375 cp_parser_skip_to_end_of_block_or_statement (parser);
15376 return error_mark_node;
15379 /* Remember it, if there default args to post process. */
15380 cp_parser_save_default_args (parser, fn);
15382 /* Save away the tokens that make up the body of the
15384 first = parser->lexer->next_token;
15385 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
15386 /* Handle function try blocks. */
15387 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_CATCH))
15388 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
15389 last = parser->lexer->next_token;
15391 /* Save away the inline definition; we will process it when the
15392 class is complete. */
15393 DECL_PENDING_INLINE_INFO (fn) = cp_token_cache_new (first, last);
15394 DECL_PENDING_INLINE_P (fn) = 1;
15396 /* We need to know that this was defined in the class, so that
15397 friend templates are handled correctly. */
15398 DECL_INITIALIZED_IN_CLASS_P (fn) = 1;
15400 /* We're done with the inline definition. */
15401 finish_method (fn);
15403 /* Add FN to the queue of functions to be parsed later. */
15404 TREE_VALUE (parser->unparsed_functions_queues)
15405 = tree_cons (NULL_TREE, fn,
15406 TREE_VALUE (parser->unparsed_functions_queues));
15411 /* Parse a template-argument-list, as well as the trailing ">" (but
15412 not the opening ">"). See cp_parser_template_argument_list for the
15416 cp_parser_enclosed_template_argument_list (cp_parser* parser)
15420 tree saved_qualifying_scope;
15421 tree saved_object_scope;
15422 bool saved_greater_than_is_operator_p;
15423 bool saved_skip_evaluation;
15427 When parsing a template-id, the first non-nested `>' is taken as
15428 the end of the template-argument-list rather than a greater-than
15430 saved_greater_than_is_operator_p
15431 = parser->greater_than_is_operator_p;
15432 parser->greater_than_is_operator_p = false;
15433 /* Parsing the argument list may modify SCOPE, so we save it
15435 saved_scope = parser->scope;
15436 saved_qualifying_scope = parser->qualifying_scope;
15437 saved_object_scope = parser->object_scope;
15438 /* We need to evaluate the template arguments, even though this
15439 template-id may be nested within a "sizeof". */
15440 saved_skip_evaluation = skip_evaluation;
15441 skip_evaluation = false;
15442 /* Parse the template-argument-list itself. */
15443 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
15444 arguments = NULL_TREE;
15446 arguments = cp_parser_template_argument_list (parser);
15447 /* Look for the `>' that ends the template-argument-list. If we find
15448 a '>>' instead, it's probably just a typo. */
15449 if (cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
15451 if (!saved_greater_than_is_operator_p)
15453 /* If we're in a nested template argument list, the '>>' has
15454 to be a typo for '> >'. We emit the error message, but we
15455 continue parsing and we push a '>' as next token, so that
15456 the argument list will be parsed correctly. Note that the
15457 global source location is still on the token before the
15458 '>>', so we need to say explicitly where we want it. */
15459 cp_token *token = cp_lexer_peek_token (parser->lexer);
15460 error ("%H%<>>%> should be %<> >%> "
15461 "within a nested template argument list",
15464 /* ??? Proper recovery should terminate two levels of
15465 template argument list here. */
15466 token->type = CPP_GREATER;
15470 /* If this is not a nested template argument list, the '>>'
15471 is a typo for '>'. Emit an error message and continue.
15472 Same deal about the token location, but here we can get it
15473 right by consuming the '>>' before issuing the diagnostic. */
15474 cp_lexer_consume_token (parser->lexer);
15475 error ("spurious %<>>%>, use %<>%> to terminate "
15476 "a template argument list");
15479 else if (!cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
15480 error ("missing %<>%> to terminate the template argument list");
15482 /* It's what we want, a '>'; consume it. */
15483 cp_lexer_consume_token (parser->lexer);
15484 /* The `>' token might be a greater-than operator again now. */
15485 parser->greater_than_is_operator_p
15486 = saved_greater_than_is_operator_p;
15487 /* Restore the SAVED_SCOPE. */
15488 parser->scope = saved_scope;
15489 parser->qualifying_scope = saved_qualifying_scope;
15490 parser->object_scope = saved_object_scope;
15491 skip_evaluation = saved_skip_evaluation;
15496 /* MEMBER_FUNCTION is a member function, or a friend. If default
15497 arguments, or the body of the function have not yet been parsed,
15501 cp_parser_late_parsing_for_member (cp_parser* parser, tree member_function)
15503 /* If this member is a template, get the underlying
15505 if (DECL_FUNCTION_TEMPLATE_P (member_function))
15506 member_function = DECL_TEMPLATE_RESULT (member_function);
15508 /* There should not be any class definitions in progress at this
15509 point; the bodies of members are only parsed outside of all class
15511 gcc_assert (parser->num_classes_being_defined == 0);
15512 /* While we're parsing the member functions we might encounter more
15513 classes. We want to handle them right away, but we don't want
15514 them getting mixed up with functions that are currently in the
15516 parser->unparsed_functions_queues
15517 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
15519 /* Make sure that any template parameters are in scope. */
15520 maybe_begin_member_template_processing (member_function);
15522 /* If the body of the function has not yet been parsed, parse it
15524 if (DECL_PENDING_INLINE_P (member_function))
15526 tree function_scope;
15527 cp_token_cache *tokens;
15529 /* The function is no longer pending; we are processing it. */
15530 tokens = DECL_PENDING_INLINE_INFO (member_function);
15531 DECL_PENDING_INLINE_INFO (member_function) = NULL;
15532 DECL_PENDING_INLINE_P (member_function) = 0;
15534 /* If this is a local class, enter the scope of the containing
15536 function_scope = current_function_decl;
15537 if (function_scope)
15538 push_function_context_to (function_scope);
15541 /* Push the body of the function onto the lexer stack. */
15542 cp_parser_push_lexer_for_tokens (parser, tokens);
15544 /* Let the front end know that we going to be defining this
15546 start_preparsed_function (member_function, NULL_TREE,
15547 SF_PRE_PARSED | SF_INCLASS_INLINE);
15549 /* Don't do access checking if it is a templated function. */
15550 if (processing_template_decl)
15551 push_deferring_access_checks (dk_no_check);
15553 /* Now, parse the body of the function. */
15554 cp_parser_function_definition_after_declarator (parser,
15555 /*inline_p=*/true);
15557 if (processing_template_decl)
15558 pop_deferring_access_checks ();
15560 /* Leave the scope of the containing function. */
15561 if (function_scope)
15562 pop_function_context_from (function_scope);
15563 cp_parser_pop_lexer (parser);
15566 /* Remove any template parameters from the symbol table. */
15567 maybe_end_member_template_processing ();
15569 /* Restore the queue. */
15570 parser->unparsed_functions_queues
15571 = TREE_CHAIN (parser->unparsed_functions_queues);
15574 /* If DECL contains any default args, remember it on the unparsed
15575 functions queue. */
15578 cp_parser_save_default_args (cp_parser* parser, tree decl)
15582 for (probe = TYPE_ARG_TYPES (TREE_TYPE (decl));
15584 probe = TREE_CHAIN (probe))
15585 if (TREE_PURPOSE (probe))
15587 TREE_PURPOSE (parser->unparsed_functions_queues)
15588 = tree_cons (current_class_type, decl,
15589 TREE_PURPOSE (parser->unparsed_functions_queues));
15595 /* FN is a FUNCTION_DECL which may contains a parameter with an
15596 unparsed DEFAULT_ARG. Parse the default args now. This function
15597 assumes that the current scope is the scope in which the default
15598 argument should be processed. */
15601 cp_parser_late_parsing_default_args (cp_parser *parser, tree fn)
15603 bool saved_local_variables_forbidden_p;
15606 /* While we're parsing the default args, we might (due to the
15607 statement expression extension) encounter more classes. We want
15608 to handle them right away, but we don't want them getting mixed
15609 up with default args that are currently in the queue. */
15610 parser->unparsed_functions_queues
15611 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
15613 /* Local variable names (and the `this' keyword) may not appear
15614 in a default argument. */
15615 saved_local_variables_forbidden_p = parser->local_variables_forbidden_p;
15616 parser->local_variables_forbidden_p = true;
15618 for (parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
15620 parm = TREE_CHAIN (parm))
15622 cp_token_cache *tokens;
15623 tree default_arg = TREE_PURPOSE (parm);
15625 VEC(tree,gc) *insts;
15632 if (TREE_CODE (default_arg) != DEFAULT_ARG)
15633 /* This can happen for a friend declaration for a function
15634 already declared with default arguments. */
15637 /* Push the saved tokens for the default argument onto the parser's
15639 tokens = DEFARG_TOKENS (default_arg);
15640 cp_parser_push_lexer_for_tokens (parser, tokens);
15642 /* Parse the assignment-expression. */
15643 parsed_arg = cp_parser_assignment_expression (parser, /*cast_p=*/false);
15645 TREE_PURPOSE (parm) = parsed_arg;
15647 /* Update any instantiations we've already created. */
15648 for (insts = DEFARG_INSTANTIATIONS (default_arg), ix = 0;
15649 VEC_iterate (tree, insts, ix, copy); ix++)
15650 TREE_PURPOSE (copy) = parsed_arg;
15652 /* If the token stream has not been completely used up, then
15653 there was extra junk after the end of the default
15655 if (!cp_lexer_next_token_is (parser->lexer, CPP_EOF))
15656 cp_parser_error (parser, "expected %<,%>");
15658 /* Revert to the main lexer. */
15659 cp_parser_pop_lexer (parser);
15662 /* Restore the state of local_variables_forbidden_p. */
15663 parser->local_variables_forbidden_p = saved_local_variables_forbidden_p;
15665 /* Restore the queue. */
15666 parser->unparsed_functions_queues
15667 = TREE_CHAIN (parser->unparsed_functions_queues);
15670 /* Parse the operand of `sizeof' (or a similar operator). Returns
15671 either a TYPE or an expression, depending on the form of the
15672 input. The KEYWORD indicates which kind of expression we have
15676 cp_parser_sizeof_operand (cp_parser* parser, enum rid keyword)
15678 static const char *format;
15679 tree expr = NULL_TREE;
15680 const char *saved_message;
15681 bool saved_integral_constant_expression_p;
15682 bool saved_non_integral_constant_expression_p;
15684 /* Initialize FORMAT the first time we get here. */
15686 format = "types may not be defined in '%s' expressions";
15688 /* Types cannot be defined in a `sizeof' expression. Save away the
15690 saved_message = parser->type_definition_forbidden_message;
15691 /* And create the new one. */
15692 parser->type_definition_forbidden_message
15693 = xmalloc (strlen (format)
15694 + strlen (IDENTIFIER_POINTER (ridpointers[keyword]))
15696 sprintf ((char *) parser->type_definition_forbidden_message,
15697 format, IDENTIFIER_POINTER (ridpointers[keyword]));
15699 /* The restrictions on constant-expressions do not apply inside
15700 sizeof expressions. */
15701 saved_integral_constant_expression_p
15702 = parser->integral_constant_expression_p;
15703 saved_non_integral_constant_expression_p
15704 = parser->non_integral_constant_expression_p;
15705 parser->integral_constant_expression_p = false;
15707 /* Do not actually evaluate the expression. */
15709 /* If it's a `(', then we might be looking at the type-id
15711 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
15714 bool saved_in_type_id_in_expr_p;
15716 /* We can't be sure yet whether we're looking at a type-id or an
15718 cp_parser_parse_tentatively (parser);
15719 /* Consume the `('. */
15720 cp_lexer_consume_token (parser->lexer);
15721 /* Parse the type-id. */
15722 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
15723 parser->in_type_id_in_expr_p = true;
15724 type = cp_parser_type_id (parser);
15725 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
15726 /* Now, look for the trailing `)'. */
15727 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
15728 /* If all went well, then we're done. */
15729 if (cp_parser_parse_definitely (parser))
15731 cp_decl_specifier_seq decl_specs;
15733 /* Build a trivial decl-specifier-seq. */
15734 clear_decl_specs (&decl_specs);
15735 decl_specs.type = type;
15737 /* Call grokdeclarator to figure out what type this is. */
15738 expr = grokdeclarator (NULL,
15742 /*attrlist=*/NULL);
15746 /* If the type-id production did not work out, then we must be
15747 looking at the unary-expression production. */
15749 expr = cp_parser_unary_expression (parser, /*address_p=*/false,
15751 /* Go back to evaluating expressions. */
15754 /* Free the message we created. */
15755 free ((char *) parser->type_definition_forbidden_message);
15756 /* And restore the old one. */
15757 parser->type_definition_forbidden_message = saved_message;
15758 parser->integral_constant_expression_p
15759 = saved_integral_constant_expression_p;
15760 parser->non_integral_constant_expression_p
15761 = saved_non_integral_constant_expression_p;
15766 /* If the current declaration has no declarator, return true. */
15769 cp_parser_declares_only_class_p (cp_parser *parser)
15771 /* If the next token is a `;' or a `,' then there is no
15773 return (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
15774 || cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
15777 /* Update the DECL_SPECS to reflect the STORAGE_CLASS. */
15780 cp_parser_set_storage_class (cp_decl_specifier_seq *decl_specs,
15781 cp_storage_class storage_class)
15783 if (decl_specs->storage_class != sc_none)
15784 decl_specs->multiple_storage_classes_p = true;
15786 decl_specs->storage_class = storage_class;
15789 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If USER_DEFINED_P
15790 is true, the type is a user-defined type; otherwise it is a
15791 built-in type specified by a keyword. */
15794 cp_parser_set_decl_spec_type (cp_decl_specifier_seq *decl_specs,
15796 bool user_defined_p)
15798 decl_specs->any_specifiers_p = true;
15800 /* If the user tries to redeclare bool or wchar_t (with, for
15801 example, in "typedef int wchar_t;") we remember that this is what
15802 happened. In system headers, we ignore these declarations so
15803 that G++ can work with system headers that are not C++-safe. */
15804 if (decl_specs->specs[(int) ds_typedef]
15806 && (type_spec == boolean_type_node
15807 || type_spec == wchar_type_node)
15808 && (decl_specs->type
15809 || decl_specs->specs[(int) ds_long]
15810 || decl_specs->specs[(int) ds_short]
15811 || decl_specs->specs[(int) ds_unsigned]
15812 || decl_specs->specs[(int) ds_signed]))
15814 decl_specs->redefined_builtin_type = type_spec;
15815 if (!decl_specs->type)
15817 decl_specs->type = type_spec;
15818 decl_specs->user_defined_type_p = false;
15821 else if (decl_specs->type)
15822 decl_specs->multiple_types_p = true;
15825 decl_specs->type = type_spec;
15826 decl_specs->user_defined_type_p = user_defined_p;
15827 decl_specs->redefined_builtin_type = NULL_TREE;
15831 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
15832 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
15835 cp_parser_friend_p (const cp_decl_specifier_seq *decl_specifiers)
15837 return decl_specifiers->specs[(int) ds_friend] != 0;
15840 /* If the next token is of the indicated TYPE, consume it. Otherwise,
15841 issue an error message indicating that TOKEN_DESC was expected.
15843 Returns the token consumed, if the token had the appropriate type.
15844 Otherwise, returns NULL. */
15847 cp_parser_require (cp_parser* parser,
15848 enum cpp_ttype type,
15849 const char* token_desc)
15851 if (cp_lexer_next_token_is (parser->lexer, type))
15852 return cp_lexer_consume_token (parser->lexer);
15855 /* Output the MESSAGE -- unless we're parsing tentatively. */
15856 if (!cp_parser_simulate_error (parser))
15858 char *message = concat ("expected ", token_desc, NULL);
15859 cp_parser_error (parser, message);
15866 /* Like cp_parser_require, except that tokens will be skipped until
15867 the desired token is found. An error message is still produced if
15868 the next token is not as expected. */
15871 cp_parser_skip_until_found (cp_parser* parser,
15872 enum cpp_ttype type,
15873 const char* token_desc)
15876 unsigned nesting_depth = 0;
15878 if (cp_parser_require (parser, type, token_desc))
15881 /* Skip tokens until the desired token is found. */
15884 /* Peek at the next token. */
15885 token = cp_lexer_peek_token (parser->lexer);
15886 /* If we've reached the token we want, consume it and
15888 if (token->type == type && !nesting_depth)
15890 cp_lexer_consume_token (parser->lexer);
15893 /* If we've run out of tokens, stop. */
15894 if (token->type == CPP_EOF)
15896 if (token->type == CPP_OPEN_BRACE
15897 || token->type == CPP_OPEN_PAREN
15898 || token->type == CPP_OPEN_SQUARE)
15900 else if (token->type == CPP_CLOSE_BRACE
15901 || token->type == CPP_CLOSE_PAREN
15902 || token->type == CPP_CLOSE_SQUARE)
15904 if (nesting_depth-- == 0)
15907 /* Consume this token. */
15908 cp_lexer_consume_token (parser->lexer);
15912 /* If the next token is the indicated keyword, consume it. Otherwise,
15913 issue an error message indicating that TOKEN_DESC was expected.
15915 Returns the token consumed, if the token had the appropriate type.
15916 Otherwise, returns NULL. */
15919 cp_parser_require_keyword (cp_parser* parser,
15921 const char* token_desc)
15923 cp_token *token = cp_parser_require (parser, CPP_KEYWORD, token_desc);
15925 if (token && token->keyword != keyword)
15927 dyn_string_t error_msg;
15929 /* Format the error message. */
15930 error_msg = dyn_string_new (0);
15931 dyn_string_append_cstr (error_msg, "expected ");
15932 dyn_string_append_cstr (error_msg, token_desc);
15933 cp_parser_error (parser, error_msg->s);
15934 dyn_string_delete (error_msg);
15941 /* Returns TRUE iff TOKEN is a token that can begin the body of a
15942 function-definition. */
15945 cp_parser_token_starts_function_definition_p (cp_token* token)
15947 return (/* An ordinary function-body begins with an `{'. */
15948 token->type == CPP_OPEN_BRACE
15949 /* A ctor-initializer begins with a `:'. */
15950 || token->type == CPP_COLON
15951 /* A function-try-block begins with `try'. */
15952 || token->keyword == RID_TRY
15953 /* The named return value extension begins with `return'. */
15954 || token->keyword == RID_RETURN);
15957 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
15961 cp_parser_next_token_starts_class_definition_p (cp_parser *parser)
15965 token = cp_lexer_peek_token (parser->lexer);
15966 return (token->type == CPP_OPEN_BRACE || token->type == CPP_COLON);
15969 /* Returns TRUE iff the next token is the "," or ">" ending a
15970 template-argument. */
15973 cp_parser_next_token_ends_template_argument_p (cp_parser *parser)
15977 token = cp_lexer_peek_token (parser->lexer);
15978 return (token->type == CPP_COMMA || token->type == CPP_GREATER);
15981 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
15982 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
15985 cp_parser_nth_token_starts_template_argument_list_p (cp_parser * parser,
15990 token = cp_lexer_peek_nth_token (parser->lexer, n);
15991 if (token->type == CPP_LESS)
15993 /* Check for the sequence `<::' in the original code. It would be lexed as
15994 `[:', where `[' is a digraph, and there is no whitespace before
15996 if (token->type == CPP_OPEN_SQUARE && token->flags & DIGRAPH)
15999 token2 = cp_lexer_peek_nth_token (parser->lexer, n+1);
16000 if (token2->type == CPP_COLON && !(token2->flags & PREV_WHITE))
16006 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
16007 or none_type otherwise. */
16009 static enum tag_types
16010 cp_parser_token_is_class_key (cp_token* token)
16012 switch (token->keyword)
16017 return record_type;
16026 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
16029 cp_parser_check_class_key (enum tag_types class_key, tree type)
16031 if ((TREE_CODE (type) == UNION_TYPE) != (class_key == union_type))
16032 pedwarn ("%qs tag used in naming %q#T",
16033 class_key == union_type ? "union"
16034 : class_key == record_type ? "struct" : "class",
16038 /* Issue an error message if DECL is redeclared with different
16039 access than its original declaration [class.access.spec/3].
16040 This applies to nested classes and nested class templates.
16044 cp_parser_check_access_in_redeclaration (tree decl)
16046 if (!CLASS_TYPE_P (TREE_TYPE (decl)))
16049 if ((TREE_PRIVATE (decl)
16050 != (current_access_specifier == access_private_node))
16051 || (TREE_PROTECTED (decl)
16052 != (current_access_specifier == access_protected_node)))
16053 error ("%qD redeclared with different access", decl);
16056 /* Look for the `template' keyword, as a syntactic disambiguator.
16057 Return TRUE iff it is present, in which case it will be
16061 cp_parser_optional_template_keyword (cp_parser *parser)
16063 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
16065 /* The `template' keyword can only be used within templates;
16066 outside templates the parser can always figure out what is a
16067 template and what is not. */
16068 if (!processing_template_decl)
16070 error ("%<template%> (as a disambiguator) is only allowed "
16071 "within templates");
16072 /* If this part of the token stream is rescanned, the same
16073 error message would be generated. So, we purge the token
16074 from the stream. */
16075 cp_lexer_purge_token (parser->lexer);
16080 /* Consume the `template' keyword. */
16081 cp_lexer_consume_token (parser->lexer);
16089 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
16090 set PARSER->SCOPE, and perform other related actions. */
16093 cp_parser_pre_parsed_nested_name_specifier (cp_parser *parser)
16098 /* Get the stored value. */
16099 value = cp_lexer_consume_token (parser->lexer)->value;
16100 /* Perform any access checks that were deferred. */
16101 for (check = TREE_PURPOSE (value); check; check = TREE_CHAIN (check))
16102 perform_or_defer_access_check (TREE_PURPOSE (check), TREE_VALUE (check));
16103 /* Set the scope from the stored value. */
16104 parser->scope = TREE_VALUE (value);
16105 parser->qualifying_scope = TREE_TYPE (value);
16106 parser->object_scope = NULL_TREE;
16109 /* Consume tokens up through a non-nested END token. */
16112 cp_parser_cache_group (cp_parser *parser,
16113 enum cpp_ttype end,
16120 /* Abort a parenthesized expression if we encounter a brace. */
16121 if ((end == CPP_CLOSE_PAREN || depth == 0)
16122 && cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
16124 /* If we've reached the end of the file, stop. */
16125 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
16127 /* Consume the next token. */
16128 token = cp_lexer_consume_token (parser->lexer);
16129 /* See if it starts a new group. */
16130 if (token->type == CPP_OPEN_BRACE)
16132 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, depth + 1);
16136 else if (token->type == CPP_OPEN_PAREN)
16137 cp_parser_cache_group (parser, CPP_CLOSE_PAREN, depth + 1);
16138 else if (token->type == end)
16143 /* Begin parsing tentatively. We always save tokens while parsing
16144 tentatively so that if the tentative parsing fails we can restore the
16148 cp_parser_parse_tentatively (cp_parser* parser)
16150 /* Enter a new parsing context. */
16151 parser->context = cp_parser_context_new (parser->context);
16152 /* Begin saving tokens. */
16153 cp_lexer_save_tokens (parser->lexer);
16154 /* In order to avoid repetitive access control error messages,
16155 access checks are queued up until we are no longer parsing
16157 push_deferring_access_checks (dk_deferred);
16160 /* Commit to the currently active tentative parse. */
16163 cp_parser_commit_to_tentative_parse (cp_parser* parser)
16165 cp_parser_context *context;
16168 /* Mark all of the levels as committed. */
16169 lexer = parser->lexer;
16170 for (context = parser->context; context->next; context = context->next)
16172 if (context->status == CP_PARSER_STATUS_KIND_COMMITTED)
16174 context->status = CP_PARSER_STATUS_KIND_COMMITTED;
16175 while (!cp_lexer_saving_tokens (lexer))
16176 lexer = lexer->next;
16177 cp_lexer_commit_tokens (lexer);
16181 /* Abort the currently active tentative parse. All consumed tokens
16182 will be rolled back, and no diagnostics will be issued. */
16185 cp_parser_abort_tentative_parse (cp_parser* parser)
16187 cp_parser_simulate_error (parser);
16188 /* Now, pretend that we want to see if the construct was
16189 successfully parsed. */
16190 cp_parser_parse_definitely (parser);
16193 /* Stop parsing tentatively. If a parse error has occurred, restore the
16194 token stream. Otherwise, commit to the tokens we have consumed.
16195 Returns true if no error occurred; false otherwise. */
16198 cp_parser_parse_definitely (cp_parser* parser)
16200 bool error_occurred;
16201 cp_parser_context *context;
16203 /* Remember whether or not an error occurred, since we are about to
16204 destroy that information. */
16205 error_occurred = cp_parser_error_occurred (parser);
16206 /* Remove the topmost context from the stack. */
16207 context = parser->context;
16208 parser->context = context->next;
16209 /* If no parse errors occurred, commit to the tentative parse. */
16210 if (!error_occurred)
16212 /* Commit to the tokens read tentatively, unless that was
16214 if (context->status != CP_PARSER_STATUS_KIND_COMMITTED)
16215 cp_lexer_commit_tokens (parser->lexer);
16217 pop_to_parent_deferring_access_checks ();
16219 /* Otherwise, if errors occurred, roll back our state so that things
16220 are just as they were before we began the tentative parse. */
16223 cp_lexer_rollback_tokens (parser->lexer);
16224 pop_deferring_access_checks ();
16226 /* Add the context to the front of the free list. */
16227 context->next = cp_parser_context_free_list;
16228 cp_parser_context_free_list = context;
16230 return !error_occurred;
16233 /* Returns true if we are parsing tentatively and are not committed to
16234 this tentative parse. */
16237 cp_parser_uncommitted_to_tentative_parse_p (cp_parser* parser)
16239 return (cp_parser_parsing_tentatively (parser)
16240 && parser->context->status != CP_PARSER_STATUS_KIND_COMMITTED);
16243 /* Returns nonzero iff an error has occurred during the most recent
16244 tentative parse. */
16247 cp_parser_error_occurred (cp_parser* parser)
16249 return (cp_parser_parsing_tentatively (parser)
16250 && parser->context->status == CP_PARSER_STATUS_KIND_ERROR);
16253 /* Returns nonzero if GNU extensions are allowed. */
16256 cp_parser_allow_gnu_extensions_p (cp_parser* parser)
16258 return parser->allow_gnu_extensions_p;
16261 /* Objective-C++ Productions */
16264 /* Parse an Objective-C expression, which feeds into a primary-expression
16268 objc-message-expression
16269 objc-string-literal
16270 objc-encode-expression
16271 objc-protocol-expression
16272 objc-selector-expression
16274 Returns a tree representation of the expression. */
16277 cp_parser_objc_expression (cp_parser* parser)
16279 /* Try to figure out what kind of declaration is present. */
16280 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
16284 case CPP_OPEN_SQUARE:
16285 return cp_parser_objc_message_expression (parser);
16287 case CPP_OBJC_STRING:
16288 kwd = cp_lexer_consume_token (parser->lexer);
16289 return objc_build_string_object (kwd->value);
16292 switch (kwd->keyword)
16294 case RID_AT_ENCODE:
16295 return cp_parser_objc_encode_expression (parser);
16297 case RID_AT_PROTOCOL:
16298 return cp_parser_objc_protocol_expression (parser);
16300 case RID_AT_SELECTOR:
16301 return cp_parser_objc_selector_expression (parser);
16307 error ("misplaced %<@%D%> Objective-C++ construct", kwd->value);
16308 cp_parser_skip_to_end_of_block_or_statement (parser);
16311 return error_mark_node;
16314 /* Parse an Objective-C message expression.
16316 objc-message-expression:
16317 [ objc-message-receiver objc-message-args ]
16319 Returns a representation of an Objective-C message. */
16322 cp_parser_objc_message_expression (cp_parser* parser)
16324 tree receiver, messageargs;
16326 cp_lexer_consume_token (parser->lexer); /* Eat '['. */
16327 receiver = cp_parser_objc_message_receiver (parser);
16328 messageargs = cp_parser_objc_message_args (parser);
16329 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
16331 return objc_build_message_expr (build_tree_list (receiver, messageargs));
16334 /* Parse an objc-message-receiver.
16336 objc-message-receiver:
16338 simple-type-specifier
16340 Returns a representation of the type or expression. */
16343 cp_parser_objc_message_receiver (cp_parser* parser)
16347 /* An Objective-C message receiver may be either (1) a type
16348 or (2) an expression. */
16349 cp_parser_parse_tentatively (parser);
16350 rcv = cp_parser_expression (parser, false);
16352 if (cp_parser_parse_definitely (parser))
16355 rcv = cp_parser_simple_type_specifier (parser,
16356 /*decl_specs=*/NULL,
16357 CP_PARSER_FLAGS_NONE);
16359 return objc_get_class_reference (rcv);
16362 /* Parse the arguments and selectors comprising an Objective-C message.
16367 objc-selector-args , objc-comma-args
16369 objc-selector-args:
16370 objc-selector [opt] : assignment-expression
16371 objc-selector-args objc-selector [opt] : assignment-expression
16374 assignment-expression
16375 objc-comma-args , assignment-expression
16377 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
16378 selector arguments and TREE_VALUE containing a list of comma
16382 cp_parser_objc_message_args (cp_parser* parser)
16384 tree sel_args = NULL_TREE, addl_args = NULL_TREE;
16385 bool maybe_unary_selector_p = true;
16386 cp_token *token = cp_lexer_peek_token (parser->lexer);
16388 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
16390 tree selector = NULL_TREE, arg;
16392 if (token->type != CPP_COLON)
16393 selector = cp_parser_objc_selector (parser);
16395 /* Detect if we have a unary selector. */
16396 if (maybe_unary_selector_p
16397 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
16398 return build_tree_list (selector, NULL_TREE);
16400 maybe_unary_selector_p = false;
16401 cp_parser_require (parser, CPP_COLON, "`:'");
16402 arg = cp_parser_assignment_expression (parser, false);
16405 = chainon (sel_args,
16406 build_tree_list (selector, arg));
16408 token = cp_lexer_peek_token (parser->lexer);
16411 /* Handle non-selector arguments, if any. */
16412 while (token->type == CPP_COMMA)
16416 cp_lexer_consume_token (parser->lexer);
16417 arg = cp_parser_assignment_expression (parser, false);
16420 = chainon (addl_args,
16421 build_tree_list (NULL_TREE, arg));
16423 token = cp_lexer_peek_token (parser->lexer);
16426 return build_tree_list (sel_args, addl_args);
16429 /* Parse an Objective-C encode expression.
16431 objc-encode-expression:
16432 @encode objc-typename
16434 Returns an encoded representation of the type argument. */
16437 cp_parser_objc_encode_expression (cp_parser* parser)
16441 cp_lexer_consume_token (parser->lexer); /* Eat '@encode'. */
16442 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
16443 type = complete_type (cp_parser_type_id (parser));
16444 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
16448 error ("%<@encode%> must specify a type as an argument");
16449 return error_mark_node;
16452 return objc_build_encode_expr (type);
16455 /* Parse an Objective-C @defs expression. */
16458 cp_parser_objc_defs_expression (cp_parser *parser)
16462 cp_lexer_consume_token (parser->lexer); /* Eat '@defs'. */
16463 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
16464 name = cp_parser_identifier (parser);
16465 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
16467 return objc_get_class_ivars (name);
16470 /* Parse an Objective-C protocol expression.
16472 objc-protocol-expression:
16473 @protocol ( identifier )
16475 Returns a representation of the protocol expression. */
16478 cp_parser_objc_protocol_expression (cp_parser* parser)
16482 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
16483 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
16484 proto = cp_parser_identifier (parser);
16485 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
16487 return objc_build_protocol_expr (proto);
16490 /* Parse an Objective-C selector expression.
16492 objc-selector-expression:
16493 @selector ( objc-method-signature )
16495 objc-method-signature:
16501 objc-selector-seq objc-selector :
16503 Returns a representation of the method selector. */
16506 cp_parser_objc_selector_expression (cp_parser* parser)
16508 tree sel_seq = NULL_TREE;
16509 bool maybe_unary_selector_p = true;
16512 cp_lexer_consume_token (parser->lexer); /* Eat '@selector'. */
16513 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
16514 token = cp_lexer_peek_token (parser->lexer);
16516 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON
16517 || token->type == CPP_SCOPE)
16519 tree selector = NULL_TREE;
16521 if (token->type != CPP_COLON
16522 || token->type == CPP_SCOPE)
16523 selector = cp_parser_objc_selector (parser);
16525 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON)
16526 && cp_lexer_next_token_is_not (parser->lexer, CPP_SCOPE))
16528 /* Detect if we have a unary selector. */
16529 if (maybe_unary_selector_p)
16531 sel_seq = selector;
16532 goto finish_selector;
16536 cp_parser_error (parser, "expected %<:%>");
16539 maybe_unary_selector_p = false;
16540 token = cp_lexer_consume_token (parser->lexer);
16542 if (token->type == CPP_SCOPE)
16545 = chainon (sel_seq,
16546 build_tree_list (selector, NULL_TREE));
16548 = chainon (sel_seq,
16549 build_tree_list (NULL_TREE, NULL_TREE));
16553 = chainon (sel_seq,
16554 build_tree_list (selector, NULL_TREE));
16556 token = cp_lexer_peek_token (parser->lexer);
16560 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
16562 return objc_build_selector_expr (sel_seq);
16565 /* Parse a list of identifiers.
16567 objc-identifier-list:
16569 objc-identifier-list , identifier
16571 Returns a TREE_LIST of identifier nodes. */
16574 cp_parser_objc_identifier_list (cp_parser* parser)
16576 tree list = build_tree_list (NULL_TREE, cp_parser_identifier (parser));
16577 cp_token *sep = cp_lexer_peek_token (parser->lexer);
16579 while (sep->type == CPP_COMMA)
16581 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
16582 list = chainon (list,
16583 build_tree_list (NULL_TREE,
16584 cp_parser_identifier (parser)));
16585 sep = cp_lexer_peek_token (parser->lexer);
16591 /* Parse an Objective-C alias declaration.
16593 objc-alias-declaration:
16594 @compatibility_alias identifier identifier ;
16596 This function registers the alias mapping with the Objective-C front-end.
16597 It returns nothing. */
16600 cp_parser_objc_alias_declaration (cp_parser* parser)
16604 cp_lexer_consume_token (parser->lexer); /* Eat '@compatibility_alias'. */
16605 alias = cp_parser_identifier (parser);
16606 orig = cp_parser_identifier (parser);
16607 objc_declare_alias (alias, orig);
16608 cp_parser_consume_semicolon_at_end_of_statement (parser);
16611 /* Parse an Objective-C class forward-declaration.
16613 objc-class-declaration:
16614 @class objc-identifier-list ;
16616 The function registers the forward declarations with the Objective-C
16617 front-end. It returns nothing. */
16620 cp_parser_objc_class_declaration (cp_parser* parser)
16622 cp_lexer_consume_token (parser->lexer); /* Eat '@class'. */
16623 objc_declare_class (cp_parser_objc_identifier_list (parser));
16624 cp_parser_consume_semicolon_at_end_of_statement (parser);
16627 /* Parse a list of Objective-C protocol references.
16629 objc-protocol-refs-opt:
16630 objc-protocol-refs [opt]
16632 objc-protocol-refs:
16633 < objc-identifier-list >
16635 Returns a TREE_LIST of identifiers, if any. */
16638 cp_parser_objc_protocol_refs_opt (cp_parser* parser)
16640 tree protorefs = NULL_TREE;
16642 if(cp_lexer_next_token_is (parser->lexer, CPP_LESS))
16644 cp_lexer_consume_token (parser->lexer); /* Eat '<'. */
16645 protorefs = cp_parser_objc_identifier_list (parser);
16646 cp_parser_require (parser, CPP_GREATER, "`>'");
16652 /* Parse a Objective-C visibility specification. */
16655 cp_parser_objc_visibility_spec (cp_parser* parser)
16657 cp_token *vis = cp_lexer_peek_token (parser->lexer);
16659 switch (vis->keyword)
16661 case RID_AT_PRIVATE:
16662 objc_set_visibility (2);
16664 case RID_AT_PROTECTED:
16665 objc_set_visibility (0);
16667 case RID_AT_PUBLIC:
16668 objc_set_visibility (1);
16674 /* Eat '@private'/'@protected'/'@public'. */
16675 cp_lexer_consume_token (parser->lexer);
16678 /* Parse an Objective-C method type. */
16681 cp_parser_objc_method_type (cp_parser* parser)
16683 objc_set_method_type
16684 (cp_lexer_consume_token (parser->lexer)->type == CPP_PLUS
16689 /* Parse an Objective-C protocol qualifier. */
16692 cp_parser_objc_protocol_qualifiers (cp_parser* parser)
16694 tree quals = NULL_TREE, node;
16695 cp_token *token = cp_lexer_peek_token (parser->lexer);
16697 node = token->value;
16699 while (node && TREE_CODE (node) == IDENTIFIER_NODE
16700 && (node == ridpointers [(int) RID_IN]
16701 || node == ridpointers [(int) RID_OUT]
16702 || node == ridpointers [(int) RID_INOUT]
16703 || node == ridpointers [(int) RID_BYCOPY]
16704 || node == ridpointers [(int) RID_BYREF]
16705 || node == ridpointers [(int) RID_ONEWAY]))
16707 quals = tree_cons (NULL_TREE, node, quals);
16708 cp_lexer_consume_token (parser->lexer);
16709 token = cp_lexer_peek_token (parser->lexer);
16710 node = token->value;
16716 /* Parse an Objective-C typename. */
16719 cp_parser_objc_typename (cp_parser* parser)
16721 tree typename = NULL_TREE;
16723 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
16725 tree proto_quals, cp_type = NULL_TREE;
16727 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
16728 proto_quals = cp_parser_objc_protocol_qualifiers (parser);
16730 /* An ObjC type name may consist of just protocol qualifiers, in which
16731 case the type shall default to 'id'. */
16732 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
16733 cp_type = cp_parser_type_id (parser);
16735 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
16736 typename = build_tree_list (proto_quals, cp_type);
16742 /* Check to see if TYPE refers to an Objective-C selector name. */
16745 cp_parser_objc_selector_p (enum cpp_ttype type)
16747 return (type == CPP_NAME || type == CPP_KEYWORD
16748 || type == CPP_AND_AND || type == CPP_AND_EQ || type == CPP_AND
16749 || type == CPP_OR || type == CPP_COMPL || type == CPP_NOT
16750 || type == CPP_NOT_EQ || type == CPP_OR_OR || type == CPP_OR_EQ
16751 || type == CPP_XOR || type == CPP_XOR_EQ);
16754 /* Parse an Objective-C selector. */
16757 cp_parser_objc_selector (cp_parser* parser)
16759 cp_token *token = cp_lexer_consume_token (parser->lexer);
16761 if (!cp_parser_objc_selector_p (token->type))
16763 error ("invalid Objective-C++ selector name");
16764 return error_mark_node;
16767 /* C++ operator names are allowed to appear in ObjC selectors. */
16768 switch (token->type)
16770 case CPP_AND_AND: return get_identifier ("and");
16771 case CPP_AND_EQ: return get_identifier ("and_eq");
16772 case CPP_AND: return get_identifier ("bitand");
16773 case CPP_OR: return get_identifier ("bitor");
16774 case CPP_COMPL: return get_identifier ("compl");
16775 case CPP_NOT: return get_identifier ("not");
16776 case CPP_NOT_EQ: return get_identifier ("not_eq");
16777 case CPP_OR_OR: return get_identifier ("or");
16778 case CPP_OR_EQ: return get_identifier ("or_eq");
16779 case CPP_XOR: return get_identifier ("xor");
16780 case CPP_XOR_EQ: return get_identifier ("xor_eq");
16781 default: return token->value;
16785 /* Parse an Objective-C params list. */
16788 cp_parser_objc_method_keyword_params (cp_parser* parser)
16790 tree params = NULL_TREE;
16791 bool maybe_unary_selector_p = true;
16792 cp_token *token = cp_lexer_peek_token (parser->lexer);
16794 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
16796 tree selector = NULL_TREE, typename, identifier;
16798 if (token->type != CPP_COLON)
16799 selector = cp_parser_objc_selector (parser);
16801 /* Detect if we have a unary selector. */
16802 if (maybe_unary_selector_p
16803 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
16806 maybe_unary_selector_p = false;
16807 cp_parser_require (parser, CPP_COLON, "`:'");
16808 typename = cp_parser_objc_typename (parser);
16809 identifier = cp_parser_identifier (parser);
16813 objc_build_keyword_decl (selector,
16817 token = cp_lexer_peek_token (parser->lexer);
16823 /* Parse the non-keyword Objective-C params. */
16826 cp_parser_objc_method_tail_params_opt (cp_parser* parser, bool *ellipsisp)
16828 tree params = make_node (TREE_LIST);
16829 cp_token *token = cp_lexer_peek_token (parser->lexer);
16830 *ellipsisp = false; /* Initially, assume no ellipsis. */
16832 while (token->type == CPP_COMMA)
16834 cp_parameter_declarator *parmdecl;
16837 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
16838 token = cp_lexer_peek_token (parser->lexer);
16840 if (token->type == CPP_ELLIPSIS)
16842 cp_lexer_consume_token (parser->lexer); /* Eat '...'. */
16847 parmdecl = cp_parser_parameter_declaration (parser, false, NULL);
16848 parm = grokdeclarator (parmdecl->declarator,
16849 &parmdecl->decl_specifiers,
16850 PARM, /*initialized=*/0,
16851 /*attrlist=*/NULL);
16853 chainon (params, build_tree_list (NULL_TREE, parm));
16854 token = cp_lexer_peek_token (parser->lexer);
16860 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
16863 cp_parser_objc_interstitial_code (cp_parser* parser)
16865 cp_token *token = cp_lexer_peek_token (parser->lexer);
16867 /* If the next token is `extern' and the following token is a string
16868 literal, then we have a linkage specification. */
16869 if (token->keyword == RID_EXTERN
16870 && cp_parser_is_string_literal (cp_lexer_peek_nth_token (parser->lexer, 2)))
16871 cp_parser_linkage_specification (parser);
16872 /* Handle #pragma, if any. */
16873 else if (token->type == CPP_PRAGMA)
16874 cp_lexer_handle_pragma (parser->lexer);
16875 /* Allow stray semicolons. */
16876 else if (token->type == CPP_SEMICOLON)
16877 cp_lexer_consume_token (parser->lexer);
16878 /* Finally, try to parse a block-declaration, or a function-definition. */
16880 cp_parser_block_declaration (parser, /*statement_p=*/false);
16883 /* Parse a method signature. */
16886 cp_parser_objc_method_signature (cp_parser* parser)
16888 tree rettype, kwdparms, optparms;
16889 bool ellipsis = false;
16891 cp_parser_objc_method_type (parser);
16892 rettype = cp_parser_objc_typename (parser);
16893 kwdparms = cp_parser_objc_method_keyword_params (parser);
16894 optparms = cp_parser_objc_method_tail_params_opt (parser, &ellipsis);
16896 return objc_build_method_signature (rettype, kwdparms, optparms, ellipsis);
16899 /* Pars an Objective-C method prototype list. */
16902 cp_parser_objc_method_prototype_list (cp_parser* parser)
16904 cp_token *token = cp_lexer_peek_token (parser->lexer);
16906 while (token->keyword != RID_AT_END)
16908 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
16910 objc_add_method_declaration
16911 (cp_parser_objc_method_signature (parser));
16912 cp_parser_consume_semicolon_at_end_of_statement (parser);
16915 /* Allow for interspersed non-ObjC++ code. */
16916 cp_parser_objc_interstitial_code (parser);
16918 token = cp_lexer_peek_token (parser->lexer);
16921 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
16922 objc_finish_interface ();
16925 /* Parse an Objective-C method definition list. */
16928 cp_parser_objc_method_definition_list (cp_parser* parser)
16930 cp_token *token = cp_lexer_peek_token (parser->lexer);
16932 while (token->keyword != RID_AT_END)
16936 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
16938 push_deferring_access_checks (dk_deferred);
16939 objc_start_method_definition
16940 (cp_parser_objc_method_signature (parser));
16942 /* For historical reasons, we accept an optional semicolon. */
16943 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
16944 cp_lexer_consume_token (parser->lexer);
16946 perform_deferred_access_checks ();
16947 stop_deferring_access_checks ();
16948 meth = cp_parser_function_definition_after_declarator (parser,
16950 pop_deferring_access_checks ();
16951 objc_finish_method_definition (meth);
16954 /* Allow for interspersed non-ObjC++ code. */
16955 cp_parser_objc_interstitial_code (parser);
16957 token = cp_lexer_peek_token (parser->lexer);
16960 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
16961 objc_finish_implementation ();
16964 /* Parse Objective-C ivars. */
16967 cp_parser_objc_class_ivars (cp_parser* parser)
16969 cp_token *token = cp_lexer_peek_token (parser->lexer);
16971 if (token->type != CPP_OPEN_BRACE)
16972 return; /* No ivars specified. */
16974 cp_lexer_consume_token (parser->lexer); /* Eat '{'. */
16975 token = cp_lexer_peek_token (parser->lexer);
16977 while (token->type != CPP_CLOSE_BRACE)
16979 cp_decl_specifier_seq declspecs;
16980 int decl_class_or_enum_p;
16981 tree prefix_attributes;
16983 cp_parser_objc_visibility_spec (parser);
16985 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
16988 cp_parser_decl_specifier_seq (parser,
16989 CP_PARSER_FLAGS_OPTIONAL,
16991 &decl_class_or_enum_p);
16992 prefix_attributes = declspecs.attributes;
16993 declspecs.attributes = NULL_TREE;
16995 /* Keep going until we hit the `;' at the end of the
16997 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
16999 tree width = NULL_TREE, attributes, first_attribute, decl;
17000 cp_declarator *declarator = NULL;
17001 int ctor_dtor_or_conv_p;
17003 /* Check for a (possibly unnamed) bitfield declaration. */
17004 token = cp_lexer_peek_token (parser->lexer);
17005 if (token->type == CPP_COLON)
17008 if (token->type == CPP_NAME
17009 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
17012 /* Get the name of the bitfield. */
17013 declarator = make_id_declarator (NULL_TREE,
17014 cp_parser_identifier (parser));
17017 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
17018 /* Get the width of the bitfield. */
17020 = cp_parser_constant_expression (parser,
17021 /*allow_non_constant=*/false,
17026 /* Parse the declarator. */
17028 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
17029 &ctor_dtor_or_conv_p,
17030 /*parenthesized_p=*/NULL,
17031 /*member_p=*/false);
17034 /* Look for attributes that apply to the ivar. */
17035 attributes = cp_parser_attributes_opt (parser);
17036 /* Remember which attributes are prefix attributes and
17038 first_attribute = attributes;
17039 /* Combine the attributes. */
17040 attributes = chainon (prefix_attributes, attributes);
17044 /* Create the bitfield declaration. */
17045 decl = grokbitfield (declarator, &declspecs, width);
17046 cplus_decl_attributes (&decl, attributes, /*flags=*/0);
17049 decl = grokfield (declarator, &declspecs, NULL_TREE,
17050 NULL_TREE, attributes);
17052 /* Add the instance variable. */
17053 objc_add_instance_variable (decl);
17055 /* Reset PREFIX_ATTRIBUTES. */
17056 while (attributes && TREE_CHAIN (attributes) != first_attribute)
17057 attributes = TREE_CHAIN (attributes);
17059 TREE_CHAIN (attributes) = NULL_TREE;
17061 token = cp_lexer_peek_token (parser->lexer);
17063 if (token->type == CPP_COMMA)
17065 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
17071 cp_parser_consume_semicolon_at_end_of_statement (parser);
17072 token = cp_lexer_peek_token (parser->lexer);
17075 cp_lexer_consume_token (parser->lexer); /* Eat '}'. */
17076 /* For historical reasons, we accept an optional semicolon. */
17077 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
17078 cp_lexer_consume_token (parser->lexer);
17081 /* Parse an Objective-C protocol declaration. */
17084 cp_parser_objc_protocol_declaration (cp_parser* parser)
17086 tree proto, protorefs;
17089 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
17090 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME))
17092 error ("identifier expected after %<@protocol%>");
17096 /* See if we have a forward declaration or a definition. */
17097 tok = cp_lexer_peek_nth_token (parser->lexer, 2);
17099 /* Try a forward declaration first. */
17100 if (tok->type == CPP_COMMA || tok->type == CPP_SEMICOLON)
17102 objc_declare_protocols (cp_parser_objc_identifier_list (parser));
17104 cp_parser_consume_semicolon_at_end_of_statement (parser);
17107 /* Ok, we got a full-fledged definition (or at least should). */
17110 proto = cp_parser_identifier (parser);
17111 protorefs = cp_parser_objc_protocol_refs_opt (parser);
17112 objc_start_protocol (proto, protorefs);
17113 cp_parser_objc_method_prototype_list (parser);
17117 /* Parse an Objective-C superclass or category. */
17120 cp_parser_objc_superclass_or_category (cp_parser *parser, tree *super,
17123 cp_token *next = cp_lexer_peek_token (parser->lexer);
17125 *super = *categ = NULL_TREE;
17126 if (next->type == CPP_COLON)
17128 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
17129 *super = cp_parser_identifier (parser);
17131 else if (next->type == CPP_OPEN_PAREN)
17133 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
17134 *categ = cp_parser_identifier (parser);
17135 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17139 /* Parse an Objective-C class interface. */
17142 cp_parser_objc_class_interface (cp_parser* parser)
17144 tree name, super, categ, protos;
17146 cp_lexer_consume_token (parser->lexer); /* Eat '@interface'. */
17147 name = cp_parser_identifier (parser);
17148 cp_parser_objc_superclass_or_category (parser, &super, &categ);
17149 protos = cp_parser_objc_protocol_refs_opt (parser);
17151 /* We have either a class or a category on our hands. */
17153 objc_start_category_interface (name, categ, protos);
17156 objc_start_class_interface (name, super, protos);
17157 /* Handle instance variable declarations, if any. */
17158 cp_parser_objc_class_ivars (parser);
17159 objc_continue_interface ();
17162 cp_parser_objc_method_prototype_list (parser);
17165 /* Parse an Objective-C class implementation. */
17168 cp_parser_objc_class_implementation (cp_parser* parser)
17170 tree name, super, categ;
17172 cp_lexer_consume_token (parser->lexer); /* Eat '@implementation'. */
17173 name = cp_parser_identifier (parser);
17174 cp_parser_objc_superclass_or_category (parser, &super, &categ);
17176 /* We have either a class or a category on our hands. */
17178 objc_start_category_implementation (name, categ);
17181 objc_start_class_implementation (name, super);
17182 /* Handle instance variable declarations, if any. */
17183 cp_parser_objc_class_ivars (parser);
17184 objc_continue_implementation ();
17187 cp_parser_objc_method_definition_list (parser);
17190 /* Consume the @end token and finish off the implementation. */
17193 cp_parser_objc_end_implementation (cp_parser* parser)
17195 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
17196 objc_finish_implementation ();
17199 /* Parse an Objective-C declaration. */
17202 cp_parser_objc_declaration (cp_parser* parser)
17204 /* Try to figure out what kind of declaration is present. */
17205 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
17207 switch (kwd->keyword)
17210 cp_parser_objc_alias_declaration (parser);
17213 cp_parser_objc_class_declaration (parser);
17215 case RID_AT_PROTOCOL:
17216 cp_parser_objc_protocol_declaration (parser);
17218 case RID_AT_INTERFACE:
17219 cp_parser_objc_class_interface (parser);
17221 case RID_AT_IMPLEMENTATION:
17222 cp_parser_objc_class_implementation (parser);
17225 cp_parser_objc_end_implementation (parser);
17228 error ("misplaced %<@%D%> Objective-C++ construct", kwd->value);
17229 cp_parser_skip_to_end_of_block_or_statement (parser);
17233 /* Parse an Objective-C try-catch-finally statement.
17235 objc-try-catch-finally-stmt:
17236 @try compound-statement objc-catch-clause-seq [opt]
17237 objc-finally-clause [opt]
17239 objc-catch-clause-seq:
17240 objc-catch-clause objc-catch-clause-seq [opt]
17243 @catch ( exception-declaration ) compound-statement
17245 objc-finally-clause
17246 @finally compound-statement
17248 Returns NULL_TREE. */
17251 cp_parser_objc_try_catch_finally_statement (cp_parser *parser) {
17252 location_t location;
17255 cp_parser_require_keyword (parser, RID_AT_TRY, "`@try'");
17256 location = cp_lexer_peek_token (parser->lexer)->location;
17257 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
17258 node, lest it get absorbed into the surrounding block. */
17259 stmt = push_stmt_list ();
17260 cp_parser_compound_statement (parser, NULL, false);
17261 objc_begin_try_stmt (location, pop_stmt_list (stmt));
17263 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_CATCH))
17265 cp_parameter_declarator *parmdecl;
17268 cp_lexer_consume_token (parser->lexer);
17269 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
17270 parmdecl = cp_parser_parameter_declaration (parser, false, NULL);
17271 parm = grokdeclarator (parmdecl->declarator,
17272 &parmdecl->decl_specifiers,
17273 PARM, /*initialized=*/0,
17274 /*attrlist=*/NULL);
17275 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17276 objc_begin_catch_clause (parm);
17277 cp_parser_compound_statement (parser, NULL, false);
17278 objc_finish_catch_clause ();
17281 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_FINALLY))
17283 cp_lexer_consume_token (parser->lexer);
17284 location = cp_lexer_peek_token (parser->lexer)->location;
17285 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
17286 node, lest it get absorbed into the surrounding block. */
17287 stmt = push_stmt_list ();
17288 cp_parser_compound_statement (parser, NULL, false);
17289 objc_build_finally_clause (location, pop_stmt_list (stmt));
17292 return objc_finish_try_stmt ();
17295 /* Parse an Objective-C synchronized statement.
17297 objc-synchronized-stmt:
17298 @synchronized ( expression ) compound-statement
17300 Returns NULL_TREE. */
17303 cp_parser_objc_synchronized_statement (cp_parser *parser) {
17304 location_t location;
17307 cp_parser_require_keyword (parser, RID_AT_SYNCHRONIZED, "`@synchronized'");
17309 location = cp_lexer_peek_token (parser->lexer)->location;
17310 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
17311 lock = cp_parser_expression (parser, false);
17312 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17314 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
17315 node, lest it get absorbed into the surrounding block. */
17316 stmt = push_stmt_list ();
17317 cp_parser_compound_statement (parser, NULL, false);
17319 return objc_build_synchronized (location, lock, pop_stmt_list (stmt));
17322 /* Parse an Objective-C throw statement.
17325 @throw assignment-expression [opt] ;
17327 Returns a constructed '@throw' statement. */
17330 cp_parser_objc_throw_statement (cp_parser *parser) {
17331 tree expr = NULL_TREE;
17333 cp_parser_require_keyword (parser, RID_AT_THROW, "`@throw'");
17335 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
17336 expr = cp_parser_assignment_expression (parser, false);
17338 cp_parser_consume_semicolon_at_end_of_statement (parser);
17340 return objc_build_throw_stmt (expr);
17343 /* Parse an Objective-C statement. */
17346 cp_parser_objc_statement (cp_parser * parser) {
17347 /* Try to figure out what kind of declaration is present. */
17348 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
17350 switch (kwd->keyword)
17353 return cp_parser_objc_try_catch_finally_statement (parser);
17354 case RID_AT_SYNCHRONIZED:
17355 return cp_parser_objc_synchronized_statement (parser);
17357 return cp_parser_objc_throw_statement (parser);
17359 error ("misplaced %<@%D%> Objective-C++ construct", kwd->value);
17360 cp_parser_skip_to_end_of_block_or_statement (parser);
17363 return error_mark_node;
17368 static GTY (()) cp_parser *the_parser;
17370 /* External interface. */
17372 /* Parse one entire translation unit. */
17375 c_parse_file (void)
17377 bool error_occurred;
17378 static bool already_called = false;
17380 if (already_called)
17382 sorry ("inter-module optimizations not implemented for C++");
17385 already_called = true;
17387 the_parser = cp_parser_new ();
17388 push_deferring_access_checks (flag_access_control
17389 ? dk_no_deferred : dk_no_check);
17390 error_occurred = cp_parser_translation_unit (the_parser);
17394 /* This variable must be provided by every front end. */
17398 #include "gt-cp-parser.h"