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, 59 Temple Place - Suite 330, 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. */
500 gcc_assert (n > 0 && lexer->next_token != &eof_token);
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;
511 if (token == lexer->last_token)
513 token = (cp_token *)&eof_token;
517 if (token->type != CPP_PURGED)
521 if (cp_lexer_debugging_p (lexer))
523 cp_lexer_print_token (cp_lexer_debug_stream, token);
524 putc ('\n', cp_lexer_debug_stream);
530 /* Return the next token, and advance the lexer's next_token pointer
531 to point to the next non-purged token. */
534 cp_lexer_consume_token (cp_lexer* lexer)
536 cp_token *token = lexer->next_token;
538 gcc_assert (token != &eof_token);
543 if (lexer->next_token == lexer->last_token)
545 lexer->next_token = (cp_token *)&eof_token;
550 while (lexer->next_token->type == CPP_PURGED);
552 cp_lexer_set_source_position_from_token (token);
554 /* Provide debugging output. */
555 if (cp_lexer_debugging_p (lexer))
557 fputs ("cp_lexer: consuming token: ", cp_lexer_debug_stream);
558 cp_lexer_print_token (cp_lexer_debug_stream, token);
559 putc ('\n', cp_lexer_debug_stream);
565 /* Permanently remove the next token from the token stream, and
566 advance the next_token pointer to refer to the next non-purged
570 cp_lexer_purge_token (cp_lexer *lexer)
572 cp_token *tok = lexer->next_token;
574 gcc_assert (tok != &eof_token);
575 tok->type = CPP_PURGED;
576 tok->location = UNKNOWN_LOCATION;
577 tok->value = NULL_TREE;
578 tok->keyword = RID_MAX;
583 if (tok == lexer->last_token)
585 tok = (cp_token *)&eof_token;
589 while (tok->type == CPP_PURGED);
590 lexer->next_token = tok;
593 /* Permanently remove all tokens after TOK, up to, but not
594 including, the token that will be returned next by
595 cp_lexer_peek_token. */
598 cp_lexer_purge_tokens_after (cp_lexer *lexer, cp_token *tok)
600 cp_token *peek = lexer->next_token;
602 if (peek == &eof_token)
603 peek = lexer->last_token;
605 gcc_assert (tok < peek);
607 for ( tok += 1; tok != peek; tok += 1)
609 tok->type = CPP_PURGED;
610 tok->location = UNKNOWN_LOCATION;
611 tok->value = NULL_TREE;
612 tok->keyword = RID_MAX;
616 /* Consume and handle a pragma token. */
618 cp_lexer_handle_pragma (cp_lexer *lexer)
621 cp_token *token = cp_lexer_consume_token (lexer);
622 gcc_assert (token->type == CPP_PRAGMA);
623 gcc_assert (token->value);
625 s.len = TREE_STRING_LENGTH (token->value);
626 s.text = (const unsigned char *) TREE_STRING_POINTER (token->value);
628 cpp_handle_deferred_pragma (parse_in, &s);
630 /* Clearing token->value here means that we will get an ICE if we
631 try to process this #pragma again (which should be impossible). */
635 /* Begin saving tokens. All tokens consumed after this point will be
639 cp_lexer_save_tokens (cp_lexer* lexer)
641 /* Provide debugging output. */
642 if (cp_lexer_debugging_p (lexer))
643 fprintf (cp_lexer_debug_stream, "cp_lexer: saving tokens\n");
645 VEC_safe_push (cp_token_position, heap,
646 lexer->saved_tokens, lexer->next_token);
649 /* Commit to the portion of the token stream most recently saved. */
652 cp_lexer_commit_tokens (cp_lexer* lexer)
654 /* Provide debugging output. */
655 if (cp_lexer_debugging_p (lexer))
656 fprintf (cp_lexer_debug_stream, "cp_lexer: committing tokens\n");
658 VEC_pop (cp_token_position, lexer->saved_tokens);
661 /* Return all tokens saved since the last call to cp_lexer_save_tokens
662 to the token stream. Stop saving tokens. */
665 cp_lexer_rollback_tokens (cp_lexer* lexer)
667 /* Provide debugging output. */
668 if (cp_lexer_debugging_p (lexer))
669 fprintf (cp_lexer_debug_stream, "cp_lexer: restoring tokens\n");
671 lexer->next_token = VEC_pop (cp_token_position, lexer->saved_tokens);
674 /* Print a representation of the TOKEN on the STREAM. */
676 #ifdef ENABLE_CHECKING
679 cp_lexer_print_token (FILE * stream, cp_token *token)
681 /* We don't use cpp_type2name here because the parser defines
682 a few tokens of its own. */
683 static const char *const token_names[] = {
684 /* cpplib-defined token types */
690 /* C++ parser token types - see "Manifest constants", above. */
693 "NESTED_NAME_SPECIFIER",
697 /* If we have a name for the token, print it out. Otherwise, we
698 simply give the numeric code. */
699 gcc_assert (token->type < ARRAY_SIZE(token_names));
700 fputs (token_names[token->type], stream);
702 /* For some tokens, print the associated data. */
706 /* Some keywords have a value that is not an IDENTIFIER_NODE.
707 For example, `struct' is mapped to an INTEGER_CST. */
708 if (TREE_CODE (token->value) != IDENTIFIER_NODE)
710 /* else fall through */
712 fputs (IDENTIFIER_POINTER (token->value), stream);
718 fprintf (stream, " \"%s\"", TREE_STRING_POINTER (token->value));
726 /* Start emitting debugging information. */
729 cp_lexer_start_debugging (cp_lexer* lexer)
731 lexer->debugging_p = true;
734 /* Stop emitting debugging information. */
737 cp_lexer_stop_debugging (cp_lexer* lexer)
739 lexer->debugging_p = false;
742 #endif /* ENABLE_CHECKING */
744 /* Create a new cp_token_cache, representing a range of tokens. */
746 static cp_token_cache *
747 cp_token_cache_new (cp_token *first, cp_token *last)
749 cp_token_cache *cache = GGC_NEW (cp_token_cache);
750 cache->first = first;
756 /* Decl-specifiers. */
758 static void clear_decl_specs
759 (cp_decl_specifier_seq *);
761 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
764 clear_decl_specs (cp_decl_specifier_seq *decl_specs)
766 memset (decl_specs, 0, sizeof (cp_decl_specifier_seq));
771 /* Nothing other than the parser should be creating declarators;
772 declarators are a semi-syntactic representation of C++ entities.
773 Other parts of the front end that need to create entities (like
774 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
776 static cp_declarator *make_call_declarator
777 (cp_declarator *, cp_parameter_declarator *, cp_cv_quals, tree);
778 static cp_declarator *make_array_declarator
779 (cp_declarator *, tree);
780 static cp_declarator *make_pointer_declarator
781 (cp_cv_quals, cp_declarator *);
782 static cp_declarator *make_reference_declarator
783 (cp_cv_quals, cp_declarator *);
784 static cp_parameter_declarator *make_parameter_declarator
785 (cp_decl_specifier_seq *, cp_declarator *, tree);
786 static cp_declarator *make_ptrmem_declarator
787 (cp_cv_quals, tree, cp_declarator *);
789 cp_declarator *cp_error_declarator;
791 /* The obstack on which declarators and related data structures are
793 static struct obstack declarator_obstack;
795 /* Alloc BYTES from the declarator memory pool. */
798 alloc_declarator (size_t bytes)
800 return obstack_alloc (&declarator_obstack, bytes);
803 /* Allocate a declarator of the indicated KIND. Clear fields that are
804 common to all declarators. */
806 static cp_declarator *
807 make_declarator (cp_declarator_kind kind)
809 cp_declarator *declarator;
811 declarator = (cp_declarator *) alloc_declarator (sizeof (cp_declarator));
812 declarator->kind = kind;
813 declarator->attributes = NULL_TREE;
814 declarator->declarator = NULL;
819 /* Make a declarator for a generalized identifier. If non-NULL, the
820 identifier is QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is
821 just UNQUALIFIED_NAME. */
823 static cp_declarator *
824 make_id_declarator (tree qualifying_scope, tree unqualified_name)
826 cp_declarator *declarator;
828 /* It is valid to write:
830 class C { void f(); };
834 The standard is not clear about whether `typedef const C D' is
835 legal; as of 2002-09-15 the committee is considering that
836 question. EDG 3.0 allows that syntax. Therefore, we do as
838 if (qualifying_scope && TYPE_P (qualifying_scope))
839 qualifying_scope = TYPE_MAIN_VARIANT (qualifying_scope);
841 declarator = make_declarator (cdk_id);
842 declarator->u.id.qualifying_scope = qualifying_scope;
843 declarator->u.id.unqualified_name = unqualified_name;
844 declarator->u.id.sfk = sfk_none;
849 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
850 of modifiers such as const or volatile to apply to the pointer
851 type, represented as identifiers. */
854 make_pointer_declarator (cp_cv_quals cv_qualifiers, cp_declarator *target)
856 cp_declarator *declarator;
858 declarator = make_declarator (cdk_pointer);
859 declarator->declarator = target;
860 declarator->u.pointer.qualifiers = cv_qualifiers;
861 declarator->u.pointer.class_type = NULL_TREE;
866 /* Like make_pointer_declarator -- but for references. */
869 make_reference_declarator (cp_cv_quals cv_qualifiers, cp_declarator *target)
871 cp_declarator *declarator;
873 declarator = make_declarator (cdk_reference);
874 declarator->declarator = target;
875 declarator->u.pointer.qualifiers = cv_qualifiers;
876 declarator->u.pointer.class_type = NULL_TREE;
881 /* Like make_pointer_declarator -- but for a pointer to a non-static
882 member of CLASS_TYPE. */
885 make_ptrmem_declarator (cp_cv_quals cv_qualifiers, tree class_type,
886 cp_declarator *pointee)
888 cp_declarator *declarator;
890 declarator = make_declarator (cdk_ptrmem);
891 declarator->declarator = pointee;
892 declarator->u.pointer.qualifiers = cv_qualifiers;
893 declarator->u.pointer.class_type = class_type;
898 /* Make a declarator for the function given by TARGET, with the
899 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
900 "const"-qualified member function. The EXCEPTION_SPECIFICATION
901 indicates what exceptions can be thrown. */
904 make_call_declarator (cp_declarator *target,
905 cp_parameter_declarator *parms,
906 cp_cv_quals cv_qualifiers,
907 tree exception_specification)
909 cp_declarator *declarator;
911 declarator = make_declarator (cdk_function);
912 declarator->declarator = target;
913 declarator->u.function.parameters = parms;
914 declarator->u.function.qualifiers = cv_qualifiers;
915 declarator->u.function.exception_specification = exception_specification;
920 /* Make a declarator for an array of BOUNDS elements, each of which is
921 defined by ELEMENT. */
924 make_array_declarator (cp_declarator *element, tree bounds)
926 cp_declarator *declarator;
928 declarator = make_declarator (cdk_array);
929 declarator->declarator = element;
930 declarator->u.array.bounds = bounds;
935 cp_parameter_declarator *no_parameters;
937 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
938 DECLARATOR and DEFAULT_ARGUMENT. */
940 cp_parameter_declarator *
941 make_parameter_declarator (cp_decl_specifier_seq *decl_specifiers,
942 cp_declarator *declarator,
943 tree default_argument)
945 cp_parameter_declarator *parameter;
947 parameter = ((cp_parameter_declarator *)
948 alloc_declarator (sizeof (cp_parameter_declarator)));
949 parameter->next = NULL;
951 parameter->decl_specifiers = *decl_specifiers;
953 clear_decl_specs (¶meter->decl_specifiers);
954 parameter->declarator = declarator;
955 parameter->default_argument = default_argument;
956 parameter->ellipsis_p = false;
966 A cp_parser parses the token stream as specified by the C++
967 grammar. Its job is purely parsing, not semantic analysis. For
968 example, the parser breaks the token stream into declarators,
969 expressions, statements, and other similar syntactic constructs.
970 It does not check that the types of the expressions on either side
971 of an assignment-statement are compatible, or that a function is
972 not declared with a parameter of type `void'.
974 The parser invokes routines elsewhere in the compiler to perform
975 semantic analysis and to build up the abstract syntax tree for the
978 The parser (and the template instantiation code, which is, in a
979 way, a close relative of parsing) are the only parts of the
980 compiler that should be calling push_scope and pop_scope, or
981 related functions. The parser (and template instantiation code)
982 keeps track of what scope is presently active; everything else
983 should simply honor that. (The code that generates static
984 initializers may also need to set the scope, in order to check
985 access control correctly when emitting the initializers.)
990 The parser is of the standard recursive-descent variety. Upcoming
991 tokens in the token stream are examined in order to determine which
992 production to use when parsing a non-terminal. Some C++ constructs
993 require arbitrary look ahead to disambiguate. For example, it is
994 impossible, in the general case, to tell whether a statement is an
995 expression or declaration without scanning the entire statement.
996 Therefore, the parser is capable of "parsing tentatively." When the
997 parser is not sure what construct comes next, it enters this mode.
998 Then, while we attempt to parse the construct, the parser queues up
999 error messages, rather than issuing them immediately, and saves the
1000 tokens it consumes. If the construct is parsed successfully, the
1001 parser "commits", i.e., it issues any queued error messages and
1002 the tokens that were being preserved are permanently discarded.
1003 If, however, the construct is not parsed successfully, the parser
1004 rolls back its state completely so that it can resume parsing using
1005 a different alternative.
1010 The performance of the parser could probably be improved substantially.
1011 We could often eliminate the need to parse tentatively by looking ahead
1012 a little bit. In some places, this approach might not entirely eliminate
1013 the need to parse tentatively, but it might still speed up the average
1016 /* Flags that are passed to some parsing functions. These values can
1017 be bitwise-ored together. */
1019 typedef enum cp_parser_flags
1022 CP_PARSER_FLAGS_NONE = 0x0,
1023 /* The construct is optional. If it is not present, then no error
1024 should be issued. */
1025 CP_PARSER_FLAGS_OPTIONAL = 0x1,
1026 /* When parsing a type-specifier, do not allow user-defined types. */
1027 CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES = 0x2
1030 /* The different kinds of declarators we want to parse. */
1032 typedef enum cp_parser_declarator_kind
1034 /* We want an abstract declarator. */
1035 CP_PARSER_DECLARATOR_ABSTRACT,
1036 /* We want a named declarator. */
1037 CP_PARSER_DECLARATOR_NAMED,
1038 /* We don't mind, but the name must be an unqualified-id. */
1039 CP_PARSER_DECLARATOR_EITHER
1040 } cp_parser_declarator_kind;
1042 /* The precedence values used to parse binary expressions. The minimum value
1043 of PREC must be 1, because zero is reserved to quickly discriminate
1044 binary operators from other tokens. */
1049 PREC_LOGICAL_OR_EXPRESSION,
1050 PREC_LOGICAL_AND_EXPRESSION,
1051 PREC_INCLUSIVE_OR_EXPRESSION,
1052 PREC_EXCLUSIVE_OR_EXPRESSION,
1053 PREC_AND_EXPRESSION,
1054 PREC_EQUALITY_EXPRESSION,
1055 PREC_RELATIONAL_EXPRESSION,
1056 PREC_SHIFT_EXPRESSION,
1057 PREC_ADDITIVE_EXPRESSION,
1058 PREC_MULTIPLICATIVE_EXPRESSION,
1060 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1063 /* A mapping from a token type to a corresponding tree node type, with a
1064 precedence value. */
1066 typedef struct cp_parser_binary_operations_map_node
1068 /* The token type. */
1069 enum cpp_ttype token_type;
1070 /* The corresponding tree code. */
1071 enum tree_code tree_type;
1072 /* The precedence of this operator. */
1073 enum cp_parser_prec prec;
1074 } cp_parser_binary_operations_map_node;
1076 /* The status of a tentative parse. */
1078 typedef enum cp_parser_status_kind
1080 /* No errors have occurred. */
1081 CP_PARSER_STATUS_KIND_NO_ERROR,
1082 /* An error has occurred. */
1083 CP_PARSER_STATUS_KIND_ERROR,
1084 /* We are committed to this tentative parse, whether or not an error
1086 CP_PARSER_STATUS_KIND_COMMITTED
1087 } cp_parser_status_kind;
1089 typedef struct cp_parser_expression_stack_entry
1092 enum tree_code tree_type;
1094 } cp_parser_expression_stack_entry;
1096 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1097 entries because precedence levels on the stack are monotonically
1099 typedef struct cp_parser_expression_stack_entry
1100 cp_parser_expression_stack[NUM_PREC_VALUES];
1102 /* Context that is saved and restored when parsing tentatively. */
1103 typedef struct cp_parser_context GTY (())
1105 /* If this is a tentative parsing context, the status of the
1107 enum cp_parser_status_kind status;
1108 /* If non-NULL, we have just seen a `x->' or `x.' expression. Names
1109 that are looked up in this context must be looked up both in the
1110 scope given by OBJECT_TYPE (the type of `x' or `*x') and also in
1111 the context of the containing expression. */
1114 /* The next parsing context in the stack. */
1115 struct cp_parser_context *next;
1116 } cp_parser_context;
1120 /* Constructors and destructors. */
1122 static cp_parser_context *cp_parser_context_new
1123 (cp_parser_context *);
1125 /* Class variables. */
1127 static GTY((deletable)) cp_parser_context* cp_parser_context_free_list;
1129 /* The operator-precedence table used by cp_parser_binary_expression.
1130 Transformed into an associative array (binops_by_token) by
1133 static const cp_parser_binary_operations_map_node binops[] = {
1134 { CPP_DEREF_STAR, MEMBER_REF, PREC_PM_EXPRESSION },
1135 { CPP_DOT_STAR, DOTSTAR_EXPR, PREC_PM_EXPRESSION },
1137 { CPP_MULT, MULT_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1138 { CPP_DIV, TRUNC_DIV_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1139 { CPP_MOD, TRUNC_MOD_EXPR, PREC_MULTIPLICATIVE_EXPRESSION },
1141 { CPP_PLUS, PLUS_EXPR, PREC_ADDITIVE_EXPRESSION },
1142 { CPP_MINUS, MINUS_EXPR, PREC_ADDITIVE_EXPRESSION },
1144 { CPP_LSHIFT, LSHIFT_EXPR, PREC_SHIFT_EXPRESSION },
1145 { CPP_RSHIFT, RSHIFT_EXPR, PREC_SHIFT_EXPRESSION },
1147 { CPP_LESS, LT_EXPR, PREC_RELATIONAL_EXPRESSION },
1148 { CPP_GREATER, GT_EXPR, PREC_RELATIONAL_EXPRESSION },
1149 { CPP_LESS_EQ, LE_EXPR, PREC_RELATIONAL_EXPRESSION },
1150 { CPP_GREATER_EQ, GE_EXPR, PREC_RELATIONAL_EXPRESSION },
1151 { CPP_MIN, MIN_EXPR, PREC_RELATIONAL_EXPRESSION },
1152 { CPP_MAX, MAX_EXPR, PREC_RELATIONAL_EXPRESSION },
1154 { CPP_EQ_EQ, EQ_EXPR, PREC_EQUALITY_EXPRESSION },
1155 { CPP_NOT_EQ, NE_EXPR, PREC_EQUALITY_EXPRESSION },
1157 { CPP_AND, BIT_AND_EXPR, PREC_AND_EXPRESSION },
1159 { CPP_XOR, BIT_XOR_EXPR, PREC_EXCLUSIVE_OR_EXPRESSION },
1161 { CPP_OR, BIT_IOR_EXPR, PREC_INCLUSIVE_OR_EXPRESSION },
1163 { CPP_AND_AND, TRUTH_ANDIF_EXPR, PREC_LOGICAL_AND_EXPRESSION },
1165 { CPP_OR_OR, TRUTH_ORIF_EXPR, PREC_LOGICAL_OR_EXPRESSION }
1168 /* The same as binops, but initialized by cp_parser_new so that
1169 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1171 static cp_parser_binary_operations_map_node binops_by_token[N_CP_TTYPES];
1173 /* Constructors and destructors. */
1175 /* Construct a new context. The context below this one on the stack
1176 is given by NEXT. */
1178 static cp_parser_context *
1179 cp_parser_context_new (cp_parser_context* next)
1181 cp_parser_context *context;
1183 /* Allocate the storage. */
1184 if (cp_parser_context_free_list != NULL)
1186 /* Pull the first entry from the free list. */
1187 context = cp_parser_context_free_list;
1188 cp_parser_context_free_list = context->next;
1189 memset (context, 0, sizeof (*context));
1192 context = GGC_CNEW (cp_parser_context);
1194 /* No errors have occurred yet in this context. */
1195 context->status = CP_PARSER_STATUS_KIND_NO_ERROR;
1196 /* If this is not the bottomost context, copy information that we
1197 need from the previous context. */
1200 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1201 expression, then we are parsing one in this context, too. */
1202 context->object_type = next->object_type;
1203 /* Thread the stack. */
1204 context->next = next;
1210 /* The cp_parser structure represents the C++ parser. */
1212 typedef struct cp_parser GTY(())
1214 /* The lexer from which we are obtaining tokens. */
1217 /* The scope in which names should be looked up. If NULL_TREE, then
1218 we look up names in the scope that is currently open in the
1219 source program. If non-NULL, this is either a TYPE or
1220 NAMESPACE_DECL for the scope in which we should look.
1222 This value is not cleared automatically after a name is looked
1223 up, so we must be careful to clear it before starting a new look
1224 up sequence. (If it is not cleared, then `X::Y' followed by `Z'
1225 will look up `Z' in the scope of `X', rather than the current
1226 scope.) Unfortunately, it is difficult to tell when name lookup
1227 is complete, because we sometimes peek at a token, look it up,
1228 and then decide not to consume it. */
1231 /* OBJECT_SCOPE and QUALIFYING_SCOPE give the scopes in which the
1232 last lookup took place. OBJECT_SCOPE is used if an expression
1233 like "x->y" or "x.y" was used; it gives the type of "*x" or "x",
1234 respectively. QUALIFYING_SCOPE is used for an expression of the
1235 form "X::Y"; it refers to X. */
1237 tree qualifying_scope;
1239 /* A stack of parsing contexts. All but the bottom entry on the
1240 stack will be tentative contexts.
1242 We parse tentatively in order to determine which construct is in
1243 use in some situations. For example, in order to determine
1244 whether a statement is an expression-statement or a
1245 declaration-statement we parse it tentatively as a
1246 declaration-statement. If that fails, we then reparse the same
1247 token stream as an expression-statement. */
1248 cp_parser_context *context;
1250 /* True if we are parsing GNU C++. If this flag is not set, then
1251 GNU extensions are not recognized. */
1252 bool allow_gnu_extensions_p;
1254 /* TRUE if the `>' token should be interpreted as the greater-than
1255 operator. FALSE if it is the end of a template-id or
1256 template-parameter-list. */
1257 bool greater_than_is_operator_p;
1259 /* TRUE if default arguments are allowed within a parameter list
1260 that starts at this point. FALSE if only a gnu extension makes
1261 them permissible. */
1262 bool default_arg_ok_p;
1264 /* TRUE if we are parsing an integral constant-expression. See
1265 [expr.const] for a precise definition. */
1266 bool integral_constant_expression_p;
1268 /* TRUE if we are parsing an integral constant-expression -- but a
1269 non-constant expression should be permitted as well. This flag
1270 is used when parsing an array bound so that GNU variable-length
1271 arrays are tolerated. */
1272 bool allow_non_integral_constant_expression_p;
1274 /* TRUE if ALLOW_NON_CONSTANT_EXPRESSION_P is TRUE and something has
1275 been seen that makes the expression non-constant. */
1276 bool non_integral_constant_expression_p;
1278 /* TRUE if local variable names and `this' are forbidden in the
1280 bool local_variables_forbidden_p;
1282 /* TRUE if the declaration we are parsing is part of a
1283 linkage-specification of the form `extern string-literal
1285 bool in_unbraced_linkage_specification_p;
1287 /* TRUE if we are presently parsing a declarator, after the
1288 direct-declarator. */
1289 bool in_declarator_p;
1291 /* TRUE if we are presently parsing a template-argument-list. */
1292 bool in_template_argument_list_p;
1294 /* TRUE if we are presently parsing the body of an
1295 iteration-statement. */
1296 bool in_iteration_statement_p;
1298 /* TRUE if we are presently parsing the body of a switch
1300 bool in_switch_statement_p;
1302 /* TRUE if we are parsing a type-id in an expression context. In
1303 such a situation, both "type (expr)" and "type (type)" are valid
1305 bool in_type_id_in_expr_p;
1307 /* TRUE if we are currently in a header file where declarations are
1308 implicitly extern "C". */
1309 bool implicit_extern_c;
1311 /* TRUE if strings in expressions should be translated to the execution
1313 bool translate_strings_p;
1315 /* If non-NULL, then we are parsing a construct where new type
1316 definitions are not permitted. The string stored here will be
1317 issued as an error message if a type is defined. */
1318 const char *type_definition_forbidden_message;
1320 /* A list of lists. The outer list is a stack, used for member
1321 functions of local classes. At each level there are two sub-list,
1322 one on TREE_VALUE and one on TREE_PURPOSE. Each of those
1323 sub-lists has a FUNCTION_DECL or TEMPLATE_DECL on their
1324 TREE_VALUE's. The functions are chained in reverse declaration
1327 The TREE_PURPOSE sublist contains those functions with default
1328 arguments that need post processing, and the TREE_VALUE sublist
1329 contains those functions with definitions that need post
1332 These lists can only be processed once the outermost class being
1333 defined is complete. */
1334 tree unparsed_functions_queues;
1336 /* The number of classes whose definitions are currently in
1338 unsigned num_classes_being_defined;
1340 /* The number of template parameter lists that apply directly to the
1341 current declaration. */
1342 unsigned num_template_parameter_lists;
1345 /* The type of a function that parses some kind of expression. */
1346 typedef tree (*cp_parser_expression_fn) (cp_parser *);
1350 /* Constructors and destructors. */
1352 static cp_parser *cp_parser_new
1355 /* Routines to parse various constructs.
1357 Those that return `tree' will return the error_mark_node (rather
1358 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1359 Sometimes, they will return an ordinary node if error-recovery was
1360 attempted, even though a parse error occurred. So, to check
1361 whether or not a parse error occurred, you should always use
1362 cp_parser_error_occurred. If the construct is optional (indicated
1363 either by an `_opt' in the name of the function that does the
1364 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1365 the construct is not present. */
1367 /* Lexical conventions [gram.lex] */
1369 static tree cp_parser_identifier
1371 static tree cp_parser_string_literal
1372 (cp_parser *, bool, bool);
1374 /* Basic concepts [gram.basic] */
1376 static bool cp_parser_translation_unit
1379 /* Expressions [gram.expr] */
1381 static tree cp_parser_primary_expression
1382 (cp_parser *, bool, cp_id_kind *, tree *);
1383 static tree cp_parser_id_expression
1384 (cp_parser *, bool, bool, bool *, bool);
1385 static tree cp_parser_unqualified_id
1386 (cp_parser *, bool, bool, bool);
1387 static tree cp_parser_nested_name_specifier_opt
1388 (cp_parser *, bool, bool, bool, bool);
1389 static tree cp_parser_nested_name_specifier
1390 (cp_parser *, bool, bool, bool, bool);
1391 static tree cp_parser_class_or_namespace_name
1392 (cp_parser *, bool, bool, bool, bool, bool);
1393 static tree cp_parser_postfix_expression
1394 (cp_parser *, bool, bool);
1395 static tree cp_parser_postfix_open_square_expression
1396 (cp_parser *, tree, bool);
1397 static tree cp_parser_postfix_dot_deref_expression
1398 (cp_parser *, enum cpp_ttype, tree, bool, cp_id_kind *);
1399 static tree cp_parser_parenthesized_expression_list
1400 (cp_parser *, bool, bool, bool *);
1401 static void cp_parser_pseudo_destructor_name
1402 (cp_parser *, tree *, tree *);
1403 static tree cp_parser_unary_expression
1404 (cp_parser *, bool, bool);
1405 static enum tree_code cp_parser_unary_operator
1407 static tree cp_parser_new_expression
1409 static tree cp_parser_new_placement
1411 static tree cp_parser_new_type_id
1412 (cp_parser *, tree *);
1413 static cp_declarator *cp_parser_new_declarator_opt
1415 static cp_declarator *cp_parser_direct_new_declarator
1417 static tree cp_parser_new_initializer
1419 static tree cp_parser_delete_expression
1421 static tree cp_parser_cast_expression
1422 (cp_parser *, bool, bool);
1423 static tree cp_parser_binary_expression
1424 (cp_parser *, bool);
1425 static tree cp_parser_question_colon_clause
1426 (cp_parser *, tree);
1427 static tree cp_parser_assignment_expression
1428 (cp_parser *, bool);
1429 static enum tree_code cp_parser_assignment_operator_opt
1431 static tree cp_parser_expression
1432 (cp_parser *, bool);
1433 static tree cp_parser_constant_expression
1434 (cp_parser *, bool, bool *);
1435 static tree cp_parser_builtin_offsetof
1438 /* Statements [gram.stmt.stmt] */
1440 static void cp_parser_statement
1441 (cp_parser *, tree);
1442 static tree cp_parser_labeled_statement
1443 (cp_parser *, tree);
1444 static tree cp_parser_expression_statement
1445 (cp_parser *, tree);
1446 static tree cp_parser_compound_statement
1447 (cp_parser *, tree, bool);
1448 static void cp_parser_statement_seq_opt
1449 (cp_parser *, tree);
1450 static tree cp_parser_selection_statement
1452 static tree cp_parser_condition
1454 static tree cp_parser_iteration_statement
1456 static void cp_parser_for_init_statement
1458 static tree cp_parser_jump_statement
1460 static void cp_parser_declaration_statement
1463 static tree cp_parser_implicitly_scoped_statement
1465 static void cp_parser_already_scoped_statement
1468 /* Declarations [gram.dcl.dcl] */
1470 static void cp_parser_declaration_seq_opt
1472 static void cp_parser_declaration
1474 static void cp_parser_block_declaration
1475 (cp_parser *, bool);
1476 static void cp_parser_simple_declaration
1477 (cp_parser *, bool);
1478 static void cp_parser_decl_specifier_seq
1479 (cp_parser *, cp_parser_flags, cp_decl_specifier_seq *, int *);
1480 static tree cp_parser_storage_class_specifier_opt
1482 static tree cp_parser_function_specifier_opt
1483 (cp_parser *, cp_decl_specifier_seq *);
1484 static tree cp_parser_type_specifier
1485 (cp_parser *, cp_parser_flags, cp_decl_specifier_seq *, bool,
1487 static tree cp_parser_simple_type_specifier
1488 (cp_parser *, cp_decl_specifier_seq *, cp_parser_flags);
1489 static tree cp_parser_type_name
1491 static tree cp_parser_elaborated_type_specifier
1492 (cp_parser *, bool, bool);
1493 static tree cp_parser_enum_specifier
1495 static void cp_parser_enumerator_list
1496 (cp_parser *, tree);
1497 static void cp_parser_enumerator_definition
1498 (cp_parser *, tree);
1499 static tree cp_parser_namespace_name
1501 static void cp_parser_namespace_definition
1503 static void cp_parser_namespace_body
1505 static tree cp_parser_qualified_namespace_specifier
1507 static void cp_parser_namespace_alias_definition
1509 static void cp_parser_using_declaration
1511 static void cp_parser_using_directive
1513 static void cp_parser_asm_definition
1515 static void cp_parser_linkage_specification
1518 /* Declarators [gram.dcl.decl] */
1520 static tree cp_parser_init_declarator
1521 (cp_parser *, cp_decl_specifier_seq *, bool, bool, int, bool *);
1522 static cp_declarator *cp_parser_declarator
1523 (cp_parser *, cp_parser_declarator_kind, int *, bool *, bool);
1524 static cp_declarator *cp_parser_direct_declarator
1525 (cp_parser *, cp_parser_declarator_kind, int *, bool);
1526 static enum tree_code cp_parser_ptr_operator
1527 (cp_parser *, tree *, cp_cv_quals *);
1528 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
1530 static tree cp_parser_declarator_id
1532 static tree cp_parser_type_id
1534 static void cp_parser_type_specifier_seq
1535 (cp_parser *, bool, cp_decl_specifier_seq *);
1536 static cp_parameter_declarator *cp_parser_parameter_declaration_clause
1538 static cp_parameter_declarator *cp_parser_parameter_declaration_list
1539 (cp_parser *, bool *);
1540 static cp_parameter_declarator *cp_parser_parameter_declaration
1541 (cp_parser *, bool, bool *);
1542 static void cp_parser_function_body
1544 static tree cp_parser_initializer
1545 (cp_parser *, bool *, bool *);
1546 static tree cp_parser_initializer_clause
1547 (cp_parser *, bool *);
1548 static tree cp_parser_initializer_list
1549 (cp_parser *, bool *);
1551 static bool cp_parser_ctor_initializer_opt_and_function_body
1554 /* Classes [gram.class] */
1556 static tree cp_parser_class_name
1557 (cp_parser *, bool, bool, enum tag_types, bool, bool, bool);
1558 static tree cp_parser_class_specifier
1560 static tree cp_parser_class_head
1561 (cp_parser *, bool *, tree *);
1562 static enum tag_types cp_parser_class_key
1564 static void cp_parser_member_specification_opt
1566 static void cp_parser_member_declaration
1568 static tree cp_parser_pure_specifier
1570 static tree cp_parser_constant_initializer
1573 /* Derived classes [gram.class.derived] */
1575 static tree cp_parser_base_clause
1577 static tree cp_parser_base_specifier
1580 /* Special member functions [gram.special] */
1582 static tree cp_parser_conversion_function_id
1584 static tree cp_parser_conversion_type_id
1586 static cp_declarator *cp_parser_conversion_declarator_opt
1588 static bool cp_parser_ctor_initializer_opt
1590 static void cp_parser_mem_initializer_list
1592 static tree cp_parser_mem_initializer
1594 static tree cp_parser_mem_initializer_id
1597 /* Overloading [gram.over] */
1599 static tree cp_parser_operator_function_id
1601 static tree cp_parser_operator
1604 /* Templates [gram.temp] */
1606 static void cp_parser_template_declaration
1607 (cp_parser *, bool);
1608 static tree cp_parser_template_parameter_list
1610 static tree cp_parser_template_parameter
1611 (cp_parser *, bool *);
1612 static tree cp_parser_type_parameter
1614 static tree cp_parser_template_id
1615 (cp_parser *, bool, bool, bool);
1616 static tree cp_parser_template_name
1617 (cp_parser *, bool, bool, bool, bool *);
1618 static tree cp_parser_template_argument_list
1620 static tree cp_parser_template_argument
1622 static void cp_parser_explicit_instantiation
1624 static void cp_parser_explicit_specialization
1627 /* Exception handling [gram.exception] */
1629 static tree cp_parser_try_block
1631 static bool cp_parser_function_try_block
1633 static void cp_parser_handler_seq
1635 static void cp_parser_handler
1637 static tree cp_parser_exception_declaration
1639 static tree cp_parser_throw_expression
1641 static tree cp_parser_exception_specification_opt
1643 static tree cp_parser_type_id_list
1646 /* GNU Extensions */
1648 static tree cp_parser_asm_specification_opt
1650 static tree cp_parser_asm_operand_list
1652 static tree cp_parser_asm_clobber_list
1654 static tree cp_parser_attributes_opt
1656 static tree cp_parser_attribute_list
1658 static bool cp_parser_extension_opt
1659 (cp_parser *, int *);
1660 static void cp_parser_label_declaration
1663 /* Objective-C++ Productions */
1665 static tree cp_parser_objc_message_receiver
1667 static tree cp_parser_objc_message_args
1669 static tree cp_parser_objc_message_expression
1671 static tree cp_parser_objc_encode_expression
1673 static tree cp_parser_objc_defs_expression
1675 static tree cp_parser_objc_protocol_expression
1677 static tree cp_parser_objc_selector_expression
1679 static tree cp_parser_objc_expression
1681 static bool cp_parser_objc_selector_p
1683 static tree cp_parser_objc_selector
1685 static tree cp_parser_objc_protocol_refs_opt
1687 static void cp_parser_objc_declaration
1689 static tree cp_parser_objc_statement
1692 /* Utility Routines */
1694 static tree cp_parser_lookup_name
1695 (cp_parser *, tree, enum tag_types, bool, bool, bool, bool *);
1696 static tree cp_parser_lookup_name_simple
1697 (cp_parser *, tree);
1698 static tree cp_parser_maybe_treat_template_as_class
1700 static bool cp_parser_check_declarator_template_parameters
1701 (cp_parser *, cp_declarator *);
1702 static bool cp_parser_check_template_parameters
1703 (cp_parser *, unsigned);
1704 static tree cp_parser_simple_cast_expression
1706 static tree cp_parser_global_scope_opt
1707 (cp_parser *, bool);
1708 static bool cp_parser_constructor_declarator_p
1709 (cp_parser *, bool);
1710 static tree cp_parser_function_definition_from_specifiers_and_declarator
1711 (cp_parser *, cp_decl_specifier_seq *, tree, const cp_declarator *);
1712 static tree cp_parser_function_definition_after_declarator
1713 (cp_parser *, bool);
1714 static void cp_parser_template_declaration_after_export
1715 (cp_parser *, bool);
1716 static tree cp_parser_single_declaration
1717 (cp_parser *, bool, bool *);
1718 static tree cp_parser_functional_cast
1719 (cp_parser *, tree);
1720 static tree cp_parser_save_member_function_body
1721 (cp_parser *, cp_decl_specifier_seq *, cp_declarator *, tree);
1722 static tree cp_parser_enclosed_template_argument_list
1724 static void cp_parser_save_default_args
1725 (cp_parser *, tree);
1726 static void cp_parser_late_parsing_for_member
1727 (cp_parser *, tree);
1728 static void cp_parser_late_parsing_default_args
1729 (cp_parser *, tree);
1730 static tree cp_parser_sizeof_operand
1731 (cp_parser *, enum rid);
1732 static bool cp_parser_declares_only_class_p
1734 static void cp_parser_set_storage_class
1735 (cp_decl_specifier_seq *, cp_storage_class);
1736 static void cp_parser_set_decl_spec_type
1737 (cp_decl_specifier_seq *, tree, bool);
1738 static bool cp_parser_friend_p
1739 (const cp_decl_specifier_seq *);
1740 static cp_token *cp_parser_require
1741 (cp_parser *, enum cpp_ttype, const char *);
1742 static cp_token *cp_parser_require_keyword
1743 (cp_parser *, enum rid, const char *);
1744 static bool cp_parser_token_starts_function_definition_p
1746 static bool cp_parser_next_token_starts_class_definition_p
1748 static bool cp_parser_next_token_ends_template_argument_p
1750 static bool cp_parser_nth_token_starts_template_argument_list_p
1751 (cp_parser *, size_t);
1752 static enum tag_types cp_parser_token_is_class_key
1754 static void cp_parser_check_class_key
1755 (enum tag_types, tree type);
1756 static void cp_parser_check_access_in_redeclaration
1758 static bool cp_parser_optional_template_keyword
1760 static void cp_parser_pre_parsed_nested_name_specifier
1762 static void cp_parser_cache_group
1763 (cp_parser *, enum cpp_ttype, unsigned);
1764 static void cp_parser_parse_tentatively
1766 static void cp_parser_commit_to_tentative_parse
1768 static void cp_parser_abort_tentative_parse
1770 static bool cp_parser_parse_definitely
1772 static inline bool cp_parser_parsing_tentatively
1774 static bool cp_parser_uncommitted_to_tentative_parse_p
1776 static void cp_parser_error
1777 (cp_parser *, const char *);
1778 static void cp_parser_name_lookup_error
1779 (cp_parser *, tree, tree, const char *);
1780 static bool cp_parser_simulate_error
1782 static void cp_parser_check_type_definition
1784 static void cp_parser_check_for_definition_in_return_type
1785 (cp_declarator *, tree);
1786 static void cp_parser_check_for_invalid_template_id
1787 (cp_parser *, tree);
1788 static bool cp_parser_non_integral_constant_expression
1789 (cp_parser *, const char *);
1790 static void cp_parser_diagnose_invalid_type_name
1791 (cp_parser *, tree, tree);
1792 static bool cp_parser_parse_and_diagnose_invalid_type_name
1794 static int cp_parser_skip_to_closing_parenthesis
1795 (cp_parser *, bool, bool, bool);
1796 static void cp_parser_skip_to_end_of_statement
1798 static void cp_parser_consume_semicolon_at_end_of_statement
1800 static void cp_parser_skip_to_end_of_block_or_statement
1802 static void cp_parser_skip_to_closing_brace
1804 static void cp_parser_skip_until_found
1805 (cp_parser *, enum cpp_ttype, const char *);
1806 static bool cp_parser_error_occurred
1808 static bool cp_parser_allow_gnu_extensions_p
1810 static bool cp_parser_is_string_literal
1812 static bool cp_parser_is_keyword
1813 (cp_token *, enum rid);
1814 static tree cp_parser_make_typename_type
1815 (cp_parser *, tree, tree);
1817 /* Returns nonzero if we are parsing tentatively. */
1820 cp_parser_parsing_tentatively (cp_parser* parser)
1822 return parser->context->next != NULL;
1825 /* Returns nonzero if TOKEN is a string literal. */
1828 cp_parser_is_string_literal (cp_token* token)
1830 return (token->type == CPP_STRING || token->type == CPP_WSTRING);
1833 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
1836 cp_parser_is_keyword (cp_token* token, enum rid keyword)
1838 return token->keyword == keyword;
1841 /* A minimum or maximum operator has been seen. As these are
1842 deprecated, issue a warning. */
1845 cp_parser_warn_min_max (void)
1847 if (warn_deprecated && !in_system_header)
1848 warning (0, "minimum/maximum operators are deprecated");
1851 /* If not parsing tentatively, issue a diagnostic of the form
1852 FILE:LINE: MESSAGE before TOKEN
1853 where TOKEN is the next token in the input stream. MESSAGE
1854 (specified by the caller) is usually of the form "expected
1858 cp_parser_error (cp_parser* parser, const char* message)
1860 if (!cp_parser_simulate_error (parser))
1862 cp_token *token = cp_lexer_peek_token (parser->lexer);
1863 /* This diagnostic makes more sense if it is tagged to the line
1864 of the token we just peeked at. */
1865 cp_lexer_set_source_position_from_token (token);
1866 if (token->type == CPP_PRAGMA)
1868 error ("%<#pragma%> is not allowed here");
1869 cp_lexer_purge_token (parser->lexer);
1872 c_parse_error (message,
1873 /* Because c_parser_error does not understand
1874 CPP_KEYWORD, keywords are treated like
1876 (token->type == CPP_KEYWORD ? CPP_NAME : token->type),
1881 /* Issue an error about name-lookup failing. NAME is the
1882 IDENTIFIER_NODE DECL is the result of
1883 the lookup (as returned from cp_parser_lookup_name). DESIRED is
1884 the thing that we hoped to find. */
1887 cp_parser_name_lookup_error (cp_parser* parser,
1890 const char* desired)
1892 /* If name lookup completely failed, tell the user that NAME was not
1894 if (decl == error_mark_node)
1896 if (parser->scope && parser->scope != global_namespace)
1897 error ("%<%D::%D%> has not been declared",
1898 parser->scope, name);
1899 else if (parser->scope == global_namespace)
1900 error ("%<::%D%> has not been declared", name);
1901 else if (parser->object_scope
1902 && !CLASS_TYPE_P (parser->object_scope))
1903 error ("request for member %qD in non-class type %qT",
1904 name, parser->object_scope);
1905 else if (parser->object_scope)
1906 error ("%<%T::%D%> has not been declared",
1907 parser->object_scope, name);
1909 error ("%qD has not been declared", name);
1911 else if (parser->scope && parser->scope != global_namespace)
1912 error ("%<%D::%D%> %s", parser->scope, name, desired);
1913 else if (parser->scope == global_namespace)
1914 error ("%<::%D%> %s", name, desired);
1916 error ("%qD %s", name, desired);
1919 /* If we are parsing tentatively, remember that an error has occurred
1920 during this tentative parse. Returns true if the error was
1921 simulated; false if a message should be issued by the caller. */
1924 cp_parser_simulate_error (cp_parser* parser)
1926 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
1928 parser->context->status = CP_PARSER_STATUS_KIND_ERROR;
1934 /* This function is called when a type is defined. If type
1935 definitions are forbidden at this point, an error message is
1939 cp_parser_check_type_definition (cp_parser* parser)
1941 /* If types are forbidden here, issue a message. */
1942 if (parser->type_definition_forbidden_message)
1943 /* Use `%s' to print the string in case there are any escape
1944 characters in the message. */
1945 error ("%s", parser->type_definition_forbidden_message);
1948 /* This function is called when the DECLARATOR is processed. The TYPE
1949 was a type defined in the decl-specifiers. If it is invalid to
1950 define a type in the decl-specifiers for DECLARATOR, an error is
1954 cp_parser_check_for_definition_in_return_type (cp_declarator *declarator,
1957 /* [dcl.fct] forbids type definitions in return types.
1958 Unfortunately, it's not easy to know whether or not we are
1959 processing a return type until after the fact. */
1961 && (declarator->kind == cdk_pointer
1962 || declarator->kind == cdk_reference
1963 || declarator->kind == cdk_ptrmem))
1964 declarator = declarator->declarator;
1966 && declarator->kind == cdk_function)
1968 error ("new types may not be defined in a return type");
1969 inform ("(perhaps a semicolon is missing after the definition of %qT)",
1974 /* A type-specifier (TYPE) has been parsed which cannot be followed by
1975 "<" in any valid C++ program. If the next token is indeed "<",
1976 issue a message warning the user about what appears to be an
1977 invalid attempt to form a template-id. */
1980 cp_parser_check_for_invalid_template_id (cp_parser* parser,
1983 cp_token_position start = 0;
1985 if (cp_lexer_next_token_is (parser->lexer, CPP_LESS))
1988 error ("%qT is not a template", type);
1989 else if (TREE_CODE (type) == IDENTIFIER_NODE)
1990 error ("%qE is not a template", type);
1992 error ("invalid template-id");
1993 /* Remember the location of the invalid "<". */
1994 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
1995 start = cp_lexer_token_position (parser->lexer, true);
1996 /* Consume the "<". */
1997 cp_lexer_consume_token (parser->lexer);
1998 /* Parse the template arguments. */
1999 cp_parser_enclosed_template_argument_list (parser);
2000 /* Permanently remove the invalid template arguments so that
2001 this error message is not issued again. */
2003 cp_lexer_purge_tokens_after (parser->lexer, start);
2007 /* If parsing an integral constant-expression, issue an error message
2008 about the fact that THING appeared and return true. Otherwise,
2009 return false. In either case, set
2010 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2013 cp_parser_non_integral_constant_expression (cp_parser *parser,
2016 parser->non_integral_constant_expression_p = true;
2017 if (parser->integral_constant_expression_p)
2019 if (!parser->allow_non_integral_constant_expression_p)
2021 error ("%s cannot appear in a constant-expression", thing);
2028 /* Emit a diagnostic for an invalid type name. SCOPE is the
2029 qualifying scope (or NULL, if none) for ID. This function commits
2030 to the current active tentative parse, if any. (Otherwise, the
2031 problematic construct might be encountered again later, resulting
2032 in duplicate error messages.) */
2035 cp_parser_diagnose_invalid_type_name (cp_parser *parser, tree scope, tree id)
2037 tree decl, old_scope;
2038 /* Try to lookup the identifier. */
2039 old_scope = parser->scope;
2040 parser->scope = scope;
2041 decl = cp_parser_lookup_name_simple (parser, id);
2042 parser->scope = old_scope;
2043 /* If the lookup found a template-name, it means that the user forgot
2044 to specify an argument list. Emit an useful error message. */
2045 if (TREE_CODE (decl) == TEMPLATE_DECL)
2046 error ("invalid use of template-name %qE without an argument list",
2048 else if (!parser->scope)
2050 /* Issue an error message. */
2051 error ("%qE does not name a type", id);
2052 /* If we're in a template class, it's possible that the user was
2053 referring to a type from a base class. For example:
2055 template <typename T> struct A { typedef T X; };
2056 template <typename T> struct B : public A<T> { X x; };
2058 The user should have said "typename A<T>::X". */
2059 if (processing_template_decl && current_class_type
2060 && TYPE_BINFO (current_class_type))
2064 for (b = TREE_CHAIN (TYPE_BINFO (current_class_type));
2068 tree base_type = BINFO_TYPE (b);
2069 if (CLASS_TYPE_P (base_type)
2070 && dependent_type_p (base_type))
2073 /* Go from a particular instantiation of the
2074 template (which will have an empty TYPE_FIELDs),
2075 to the main version. */
2076 base_type = CLASSTYPE_PRIMARY_TEMPLATE_TYPE (base_type);
2077 for (field = TYPE_FIELDS (base_type);
2079 field = TREE_CHAIN (field))
2080 if (TREE_CODE (field) == TYPE_DECL
2081 && DECL_NAME (field) == id)
2083 inform ("(perhaps %<typename %T::%E%> was intended)",
2084 BINFO_TYPE (b), id);
2093 /* Here we diagnose qualified-ids where the scope is actually correct,
2094 but the identifier does not resolve to a valid type name. */
2097 if (TREE_CODE (parser->scope) == NAMESPACE_DECL)
2098 error ("%qE in namespace %qE does not name a type",
2100 else if (TYPE_P (parser->scope))
2101 error ("%qE in class %qT does not name a type", id, parser->scope);
2105 cp_parser_commit_to_tentative_parse (parser);
2108 /* Check for a common situation where a type-name should be present,
2109 but is not, and issue a sensible error message. Returns true if an
2110 invalid type-name was detected.
2112 The situation handled by this function are variable declarations of the
2113 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2114 Usually, `ID' should name a type, but if we got here it means that it
2115 does not. We try to emit the best possible error message depending on
2116 how exactly the id-expression looks like.
2120 cp_parser_parse_and_diagnose_invalid_type_name (cp_parser *parser)
2124 cp_parser_parse_tentatively (parser);
2125 id = cp_parser_id_expression (parser,
2126 /*template_keyword_p=*/false,
2127 /*check_dependency_p=*/true,
2128 /*template_p=*/NULL,
2129 /*declarator_p=*/true);
2130 /* After the id-expression, there should be a plain identifier,
2131 otherwise this is not a simple variable declaration. Also, if
2132 the scope is dependent, we cannot do much. */
2133 if (!cp_lexer_next_token_is (parser->lexer, CPP_NAME)
2134 || (parser->scope && TYPE_P (parser->scope)
2135 && dependent_type_p (parser->scope)))
2137 cp_parser_abort_tentative_parse (parser);
2140 if (!cp_parser_parse_definitely (parser)
2141 || TREE_CODE (id) != IDENTIFIER_NODE)
2144 /* Emit a diagnostic for the invalid type. */
2145 cp_parser_diagnose_invalid_type_name (parser, parser->scope, id);
2146 /* Skip to the end of the declaration; there's no point in
2147 trying to process it. */
2148 cp_parser_skip_to_end_of_block_or_statement (parser);
2152 /* Consume tokens up to, and including, the next non-nested closing `)'.
2153 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2154 are doing error recovery. Returns -1 if OR_COMMA is true and we
2155 found an unnested comma. */
2158 cp_parser_skip_to_closing_parenthesis (cp_parser *parser,
2163 unsigned paren_depth = 0;
2164 unsigned brace_depth = 0;
2167 if (recovering && !or_comma
2168 && cp_parser_uncommitted_to_tentative_parse_p (parser))
2175 /* If we've run out of tokens, then there is no closing `)'. */
2176 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
2182 token = cp_lexer_peek_token (parser->lexer);
2184 /* This matches the processing in skip_to_end_of_statement. */
2185 if (token->type == CPP_SEMICOLON && !brace_depth)
2190 if (token->type == CPP_OPEN_BRACE)
2192 if (token->type == CPP_CLOSE_BRACE)
2200 if (recovering && or_comma && token->type == CPP_COMMA
2201 && !brace_depth && !paren_depth)
2209 /* If it is an `(', we have entered another level of nesting. */
2210 if (token->type == CPP_OPEN_PAREN)
2212 /* If it is a `)', then we might be done. */
2213 else if (token->type == CPP_CLOSE_PAREN && !paren_depth--)
2216 cp_lexer_consume_token (parser->lexer);
2224 /* Consume the token. */
2225 cp_lexer_consume_token (parser->lexer);
2231 /* Consume tokens until we reach the end of the current statement.
2232 Normally, that will be just before consuming a `;'. However, if a
2233 non-nested `}' comes first, then we stop before consuming that. */
2236 cp_parser_skip_to_end_of_statement (cp_parser* parser)
2238 unsigned nesting_depth = 0;
2244 /* Peek at the next token. */
2245 token = cp_lexer_peek_token (parser->lexer);
2246 /* If we've run out of tokens, stop. */
2247 if (token->type == CPP_EOF)
2249 /* If the next token is a `;', we have reached the end of the
2251 if (token->type == CPP_SEMICOLON && !nesting_depth)
2253 /* If the next token is a non-nested `}', then we have reached
2254 the end of the current block. */
2255 if (token->type == CPP_CLOSE_BRACE)
2257 /* If this is a non-nested `}', stop before consuming it.
2258 That way, when confronted with something like:
2262 we stop before consuming the closing `}', even though we
2263 have not yet reached a `;'. */
2264 if (nesting_depth == 0)
2266 /* If it is the closing `}' for a block that we have
2267 scanned, stop -- but only after consuming the token.
2273 we will stop after the body of the erroneously declared
2274 function, but before consuming the following `typedef'
2276 if (--nesting_depth == 0)
2278 cp_lexer_consume_token (parser->lexer);
2282 /* If it the next token is a `{', then we are entering a new
2283 block. Consume the entire block. */
2284 else if (token->type == CPP_OPEN_BRACE)
2286 /* Consume the token. */
2287 cp_lexer_consume_token (parser->lexer);
2291 /* This function is called at the end of a statement or declaration.
2292 If the next token is a semicolon, it is consumed; otherwise, error
2293 recovery is attempted. */
2296 cp_parser_consume_semicolon_at_end_of_statement (cp_parser *parser)
2298 /* Look for the trailing `;'. */
2299 if (!cp_parser_require (parser, CPP_SEMICOLON, "`;'"))
2301 /* If there is additional (erroneous) input, skip to the end of
2303 cp_parser_skip_to_end_of_statement (parser);
2304 /* If the next token is now a `;', consume it. */
2305 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
2306 cp_lexer_consume_token (parser->lexer);
2310 /* Skip tokens until we have consumed an entire block, or until we
2311 have consumed a non-nested `;'. */
2314 cp_parser_skip_to_end_of_block_or_statement (cp_parser* parser)
2316 unsigned nesting_depth = 0;
2322 /* Peek at the next token. */
2323 token = cp_lexer_peek_token (parser->lexer);
2324 /* If we've run out of tokens, stop. */
2325 if (token->type == CPP_EOF)
2327 /* If the next token is a `;', we have reached the end of the
2329 if (token->type == CPP_SEMICOLON && !nesting_depth)
2331 /* Consume the `;'. */
2332 cp_lexer_consume_token (parser->lexer);
2335 /* Consume the token. */
2336 token = cp_lexer_consume_token (parser->lexer);
2337 /* If the next token is a non-nested `}', then we have reached
2338 the end of the current block. */
2339 if (token->type == CPP_CLOSE_BRACE
2340 && (nesting_depth == 0 || --nesting_depth == 0))
2342 /* If it the next token is a `{', then we are entering a new
2343 block. Consume the entire block. */
2344 if (token->type == CPP_OPEN_BRACE)
2349 /* Skip tokens until a non-nested closing curly brace is the next
2353 cp_parser_skip_to_closing_brace (cp_parser *parser)
2355 unsigned nesting_depth = 0;
2361 /* Peek at the next token. */
2362 token = cp_lexer_peek_token (parser->lexer);
2363 /* If we've run out of tokens, stop. */
2364 if (token->type == CPP_EOF)
2366 /* If the next token is a non-nested `}', then we have reached
2367 the end of the current block. */
2368 if (token->type == CPP_CLOSE_BRACE && nesting_depth-- == 0)
2370 /* If it the next token is a `{', then we are entering a new
2371 block. Consume the entire block. */
2372 else if (token->type == CPP_OPEN_BRACE)
2374 /* Consume the token. */
2375 cp_lexer_consume_token (parser->lexer);
2379 /* This is a simple wrapper around make_typename_type. When the id is
2380 an unresolved identifier node, we can provide a superior diagnostic
2381 using cp_parser_diagnose_invalid_type_name. */
2384 cp_parser_make_typename_type (cp_parser *parser, tree scope, tree id)
2387 if (TREE_CODE (id) == IDENTIFIER_NODE)
2389 result = make_typename_type (scope, id, typename_type,
2391 if (result == error_mark_node)
2392 cp_parser_diagnose_invalid_type_name (parser, scope, id);
2395 return make_typename_type (scope, id, typename_type, tf_error);
2399 /* Create a new C++ parser. */
2402 cp_parser_new (void)
2408 /* cp_lexer_new_main is called before calling ggc_alloc because
2409 cp_lexer_new_main might load a PCH file. */
2410 lexer = cp_lexer_new_main ();
2412 /* Initialize the binops_by_token so that we can get the tree
2413 directly from the token. */
2414 for (i = 0; i < sizeof (binops) / sizeof (binops[0]); i++)
2415 binops_by_token[binops[i].token_type] = binops[i];
2417 parser = GGC_CNEW (cp_parser);
2418 parser->lexer = lexer;
2419 parser->context = cp_parser_context_new (NULL);
2421 /* For now, we always accept GNU extensions. */
2422 parser->allow_gnu_extensions_p = 1;
2424 /* The `>' token is a greater-than operator, not the end of a
2426 parser->greater_than_is_operator_p = true;
2428 parser->default_arg_ok_p = true;
2430 /* We are not parsing a constant-expression. */
2431 parser->integral_constant_expression_p = false;
2432 parser->allow_non_integral_constant_expression_p = false;
2433 parser->non_integral_constant_expression_p = false;
2435 /* Local variable names are not forbidden. */
2436 parser->local_variables_forbidden_p = false;
2438 /* We are not processing an `extern "C"' declaration. */
2439 parser->in_unbraced_linkage_specification_p = false;
2441 /* We are not processing a declarator. */
2442 parser->in_declarator_p = false;
2444 /* We are not processing a template-argument-list. */
2445 parser->in_template_argument_list_p = false;
2447 /* We are not in an iteration statement. */
2448 parser->in_iteration_statement_p = false;
2450 /* We are not in a switch statement. */
2451 parser->in_switch_statement_p = false;
2453 /* We are not parsing a type-id inside an expression. */
2454 parser->in_type_id_in_expr_p = false;
2456 /* Declarations aren't implicitly extern "C". */
2457 parser->implicit_extern_c = false;
2459 /* String literals should be translated to the execution character set. */
2460 parser->translate_strings_p = true;
2462 /* The unparsed function queue is empty. */
2463 parser->unparsed_functions_queues = build_tree_list (NULL_TREE, NULL_TREE);
2465 /* There are no classes being defined. */
2466 parser->num_classes_being_defined = 0;
2468 /* No template parameters apply. */
2469 parser->num_template_parameter_lists = 0;
2474 /* Create a cp_lexer structure which will emit the tokens in CACHE
2475 and push it onto the parser's lexer stack. This is used for delayed
2476 parsing of in-class method bodies and default arguments, and should
2477 not be confused with tentative parsing. */
2479 cp_parser_push_lexer_for_tokens (cp_parser *parser, cp_token_cache *cache)
2481 cp_lexer *lexer = cp_lexer_new_from_tokens (cache);
2482 lexer->next = parser->lexer;
2483 parser->lexer = lexer;
2485 /* Move the current source position to that of the first token in the
2487 cp_lexer_set_source_position_from_token (lexer->next_token);
2490 /* Pop the top lexer off the parser stack. This is never used for the
2491 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
2493 cp_parser_pop_lexer (cp_parser *parser)
2495 cp_lexer *lexer = parser->lexer;
2496 parser->lexer = lexer->next;
2497 cp_lexer_destroy (lexer);
2499 /* Put the current source position back where it was before this
2500 lexer was pushed. */
2501 cp_lexer_set_source_position_from_token (parser->lexer->next_token);
2504 /* Lexical conventions [gram.lex] */
2506 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
2510 cp_parser_identifier (cp_parser* parser)
2514 /* Look for the identifier. */
2515 token = cp_parser_require (parser, CPP_NAME, "identifier");
2516 /* Return the value. */
2517 return token ? token->value : error_mark_node;
2520 /* Parse a sequence of adjacent string constants. Returns a
2521 TREE_STRING representing the combined, nul-terminated string
2522 constant. If TRANSLATE is true, translate the string to the
2523 execution character set. If WIDE_OK is true, a wide string is
2526 C++98 [lex.string] says that if a narrow string literal token is
2527 adjacent to a wide string literal token, the behavior is undefined.
2528 However, C99 6.4.5p4 says that this results in a wide string literal.
2529 We follow C99 here, for consistency with the C front end.
2531 This code is largely lifted from lex_string() in c-lex.c.
2533 FUTURE: ObjC++ will need to handle @-strings here. */
2535 cp_parser_string_literal (cp_parser *parser, bool translate, bool wide_ok)
2540 struct obstack str_ob;
2541 cpp_string str, istr, *strs;
2544 tok = cp_lexer_peek_token (parser->lexer);
2545 if (!cp_parser_is_string_literal (tok))
2547 cp_parser_error (parser, "expected string-literal");
2548 return error_mark_node;
2551 /* Try to avoid the overhead of creating and destroying an obstack
2552 for the common case of just one string. */
2553 if (!cp_parser_is_string_literal
2554 (cp_lexer_peek_nth_token (parser->lexer, 2)))
2556 cp_lexer_consume_token (parser->lexer);
2558 str.text = (const unsigned char *)TREE_STRING_POINTER (tok->value);
2559 str.len = TREE_STRING_LENGTH (tok->value);
2561 if (tok->type == CPP_WSTRING)
2568 gcc_obstack_init (&str_ob);
2573 cp_lexer_consume_token (parser->lexer);
2575 str.text = (unsigned char *)TREE_STRING_POINTER (tok->value);
2576 str.len = TREE_STRING_LENGTH (tok->value);
2577 if (tok->type == CPP_WSTRING)
2580 obstack_grow (&str_ob, &str, sizeof (cpp_string));
2582 tok = cp_lexer_peek_token (parser->lexer);
2584 while (cp_parser_is_string_literal (tok));
2586 strs = (cpp_string *) obstack_finish (&str_ob);
2589 if (wide && !wide_ok)
2591 cp_parser_error (parser, "a wide string is invalid in this context");
2595 if ((translate ? cpp_interpret_string : cpp_interpret_string_notranslate)
2596 (parse_in, strs, count, &istr, wide))
2598 value = build_string (istr.len, (char *)istr.text);
2599 free ((void *)istr.text);
2601 TREE_TYPE (value) = wide ? wchar_array_type_node : char_array_type_node;
2602 value = fix_string_type (value);
2605 /* cpp_interpret_string has issued an error. */
2606 value = error_mark_node;
2609 obstack_free (&str_ob, 0);
2615 /* Basic concepts [gram.basic] */
2617 /* Parse a translation-unit.
2620 declaration-seq [opt]
2622 Returns TRUE if all went well. */
2625 cp_parser_translation_unit (cp_parser* parser)
2627 /* The address of the first non-permanent object on the declarator
2629 static void *declarator_obstack_base;
2633 /* Create the declarator obstack, if necessary. */
2634 if (!cp_error_declarator)
2636 gcc_obstack_init (&declarator_obstack);
2637 /* Create the error declarator. */
2638 cp_error_declarator = make_declarator (cdk_error);
2639 /* Create the empty parameter list. */
2640 no_parameters = make_parameter_declarator (NULL, NULL, NULL_TREE);
2641 /* Remember where the base of the declarator obstack lies. */
2642 declarator_obstack_base = obstack_next_free (&declarator_obstack);
2647 cp_parser_declaration_seq_opt (parser);
2649 /* If there are no tokens left then all went well. */
2650 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
2652 /* Get rid of the token array; we don't need it any more. */
2653 cp_lexer_destroy (parser->lexer);
2654 parser->lexer = NULL;
2656 /* This file might have been a context that's implicitly extern
2657 "C". If so, pop the lang context. (Only relevant for PCH.) */
2658 if (parser->implicit_extern_c)
2660 pop_lang_context ();
2661 parser->implicit_extern_c = false;
2665 finish_translation_unit ();
2672 cp_parser_error (parser, "expected declaration");
2678 /* Make sure the declarator obstack was fully cleaned up. */
2679 gcc_assert (obstack_next_free (&declarator_obstack)
2680 == declarator_obstack_base);
2682 /* All went well. */
2686 /* Expressions [gram.expr] */
2688 /* Parse a primary-expression.
2699 ( compound-statement )
2700 __builtin_va_arg ( assignment-expression , type-id )
2702 Objective-C++ Extension:
2710 CAST_P is true if this primary expression is the target of a cast.
2712 Returns a representation of the expression.
2714 *IDK indicates what kind of id-expression (if any) was present.
2716 *QUALIFYING_CLASS is set to a non-NULL value if the id-expression can be
2717 used as the operand of a pointer-to-member. In that case,
2718 *QUALIFYING_CLASS gives the class that is used as the qualifying
2719 class in the pointer-to-member. */
2722 cp_parser_primary_expression (cp_parser *parser,
2725 tree *qualifying_class)
2729 /* Assume the primary expression is not an id-expression. */
2730 *idk = CP_ID_KIND_NONE;
2731 /* And that it cannot be used as pointer-to-member. */
2732 *qualifying_class = NULL_TREE;
2734 /* Peek at the next token. */
2735 token = cp_lexer_peek_token (parser->lexer);
2736 switch (token->type)
2747 token = cp_lexer_consume_token (parser->lexer);
2748 /* Floating-point literals are only allowed in an integral
2749 constant expression if they are cast to an integral or
2750 enumeration type. */
2751 if (TREE_CODE (token->value) == REAL_CST
2752 && parser->integral_constant_expression_p
2755 /* CAST_P will be set even in invalid code like "int(2.7 +
2756 ...)". Therefore, we have to check that the next token
2757 is sure to end the cast. */
2760 cp_token *next_token;
2762 next_token = cp_lexer_peek_token (parser->lexer);
2763 if (/* The comma at the end of an
2764 enumerator-definition. */
2765 next_token->type != CPP_COMMA
2766 /* The curly brace at the end of an enum-specifier. */
2767 && next_token->type != CPP_CLOSE_BRACE
2768 /* The end of a statement. */
2769 && next_token->type != CPP_SEMICOLON
2770 /* The end of the cast-expression. */
2771 && next_token->type != CPP_CLOSE_PAREN
2772 /* The end of an array bound. */
2773 && next_token->type != CPP_CLOSE_SQUARE)
2777 /* If we are within a cast, then the constraint that the
2778 cast is to an integral or enumeration type will be
2779 checked at that point. If we are not within a cast, then
2780 this code is invalid. */
2782 cp_parser_non_integral_constant_expression
2783 (parser, "floating-point literal");
2785 return token->value;
2789 /* ??? Should wide strings be allowed when parser->translate_strings_p
2790 is false (i.e. in attributes)? If not, we can kill the third
2791 argument to cp_parser_string_literal. */
2792 return cp_parser_string_literal (parser,
2793 parser->translate_strings_p,
2796 case CPP_OPEN_PAREN:
2799 bool saved_greater_than_is_operator_p;
2801 /* Consume the `('. */
2802 cp_lexer_consume_token (parser->lexer);
2803 /* Within a parenthesized expression, a `>' token is always
2804 the greater-than operator. */
2805 saved_greater_than_is_operator_p
2806 = parser->greater_than_is_operator_p;
2807 parser->greater_than_is_operator_p = true;
2808 /* If we see `( { ' then we are looking at the beginning of
2809 a GNU statement-expression. */
2810 if (cp_parser_allow_gnu_extensions_p (parser)
2811 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
2813 /* Statement-expressions are not allowed by the standard. */
2815 pedwarn ("ISO C++ forbids braced-groups within expressions");
2817 /* And they're not allowed outside of a function-body; you
2818 cannot, for example, write:
2820 int i = ({ int j = 3; j + 1; });
2822 at class or namespace scope. */
2823 if (!at_function_scope_p ())
2824 error ("statement-expressions are allowed only inside functions");
2825 /* Start the statement-expression. */
2826 expr = begin_stmt_expr ();
2827 /* Parse the compound-statement. */
2828 cp_parser_compound_statement (parser, expr, false);
2830 expr = finish_stmt_expr (expr, false);
2834 /* Parse the parenthesized expression. */
2835 expr = cp_parser_expression (parser, cast_p);
2836 /* Let the front end know that this expression was
2837 enclosed in parentheses. This matters in case, for
2838 example, the expression is of the form `A::B', since
2839 `&A::B' might be a pointer-to-member, but `&(A::B)' is
2841 finish_parenthesized_expr (expr);
2843 /* The `>' token might be the end of a template-id or
2844 template-parameter-list now. */
2845 parser->greater_than_is_operator_p
2846 = saved_greater_than_is_operator_p;
2847 /* Consume the `)'. */
2848 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
2849 cp_parser_skip_to_end_of_statement (parser);
2855 switch (token->keyword)
2857 /* These two are the boolean literals. */
2859 cp_lexer_consume_token (parser->lexer);
2860 return boolean_true_node;
2862 cp_lexer_consume_token (parser->lexer);
2863 return boolean_false_node;
2865 /* The `__null' literal. */
2867 cp_lexer_consume_token (parser->lexer);
2870 /* Recognize the `this' keyword. */
2872 cp_lexer_consume_token (parser->lexer);
2873 if (parser->local_variables_forbidden_p)
2875 error ("%<this%> may not be used in this context");
2876 return error_mark_node;
2878 /* Pointers cannot appear in constant-expressions. */
2879 if (cp_parser_non_integral_constant_expression (parser,
2881 return error_mark_node;
2882 return finish_this_expr ();
2884 /* The `operator' keyword can be the beginning of an
2889 case RID_FUNCTION_NAME:
2890 case RID_PRETTY_FUNCTION_NAME:
2891 case RID_C99_FUNCTION_NAME:
2892 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
2893 __func__ are the names of variables -- but they are
2894 treated specially. Therefore, they are handled here,
2895 rather than relying on the generic id-expression logic
2896 below. Grammatically, these names are id-expressions.
2898 Consume the token. */
2899 token = cp_lexer_consume_token (parser->lexer);
2900 /* Look up the name. */
2901 return finish_fname (token->value);
2908 /* The `__builtin_va_arg' construct is used to handle
2909 `va_arg'. Consume the `__builtin_va_arg' token. */
2910 cp_lexer_consume_token (parser->lexer);
2911 /* Look for the opening `('. */
2912 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
2913 /* Now, parse the assignment-expression. */
2914 expression = cp_parser_assignment_expression (parser,
2916 /* Look for the `,'. */
2917 cp_parser_require (parser, CPP_COMMA, "`,'");
2918 /* Parse the type-id. */
2919 type = cp_parser_type_id (parser);
2920 /* Look for the closing `)'. */
2921 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
2922 /* Using `va_arg' in a constant-expression is not
2924 if (cp_parser_non_integral_constant_expression (parser,
2926 return error_mark_node;
2927 return build_x_va_arg (expression, type);
2931 return cp_parser_builtin_offsetof (parser);
2933 /* Objective-C++ expressions. */
2935 case RID_AT_PROTOCOL:
2936 case RID_AT_SELECTOR:
2937 return cp_parser_objc_expression (parser);
2940 cp_parser_error (parser, "expected primary-expression");
2941 return error_mark_node;
2944 /* An id-expression can start with either an identifier, a
2945 `::' as the beginning of a qualified-id, or the "operator"
2949 case CPP_TEMPLATE_ID:
2950 case CPP_NESTED_NAME_SPECIFIER:
2954 const char *error_msg;
2957 /* Parse the id-expression. */
2959 = cp_parser_id_expression (parser,
2960 /*template_keyword_p=*/false,
2961 /*check_dependency_p=*/true,
2962 /*template_p=*/NULL,
2963 /*declarator_p=*/false);
2964 if (id_expression == error_mark_node)
2965 return error_mark_node;
2966 /* If we have a template-id, then no further lookup is
2967 required. If the template-id was for a template-class, we
2968 will sometimes have a TYPE_DECL at this point. */
2969 else if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR
2970 || TREE_CODE (id_expression) == TYPE_DECL)
2971 decl = id_expression;
2972 /* Look up the name. */
2977 decl = cp_parser_lookup_name (parser, id_expression,
2979 /*is_template=*/false,
2980 /*is_namespace=*/false,
2981 /*check_dependency=*/true,
2983 /* If the lookup was ambiguous, an error will already have
2986 return error_mark_node;
2988 /* In Objective-C++, an instance variable (ivar) may be preferred
2989 to whatever cp_parser_lookup_name() found. */
2990 decl = objc_lookup_ivar (decl, id_expression);
2992 /* If name lookup gives us a SCOPE_REF, then the
2993 qualifying scope was dependent. Just propagate the
2995 if (TREE_CODE (decl) == SCOPE_REF)
2997 if (TYPE_P (TREE_OPERAND (decl, 0)))
2998 *qualifying_class = TREE_OPERAND (decl, 0);
3001 /* Check to see if DECL is a local variable in a context
3002 where that is forbidden. */
3003 if (parser->local_variables_forbidden_p
3004 && local_variable_p (decl))
3006 /* It might be that we only found DECL because we are
3007 trying to be generous with pre-ISO scoping rules.
3008 For example, consider:
3012 for (int i = 0; i < 10; ++i) {}
3013 extern void f(int j = i);
3016 Here, name look up will originally find the out
3017 of scope `i'. We need to issue a warning message,
3018 but then use the global `i'. */
3019 decl = check_for_out_of_scope_variable (decl);
3020 if (local_variable_p (decl))
3022 error ("local variable %qD may not appear in this context",
3024 return error_mark_node;
3029 decl = finish_id_expression (id_expression, decl, parser->scope,
3030 idk, qualifying_class,
3031 parser->integral_constant_expression_p,
3032 parser->allow_non_integral_constant_expression_p,
3033 &parser->non_integral_constant_expression_p,
3036 cp_parser_error (parser, error_msg);
3040 /* Anything else is an error. */
3042 /* ...unless we have an Objective-C++ message or string literal, that is. */
3043 if (c_dialect_objc ()
3044 && (token->type == CPP_OPEN_SQUARE || token->type == CPP_OBJC_STRING))
3045 return cp_parser_objc_expression (parser);
3047 cp_parser_error (parser, "expected primary-expression");
3048 return error_mark_node;
3052 /* Parse an id-expression.
3059 :: [opt] nested-name-specifier template [opt] unqualified-id
3061 :: operator-function-id
3064 Return a representation of the unqualified portion of the
3065 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
3066 a `::' or nested-name-specifier.
3068 Often, if the id-expression was a qualified-id, the caller will
3069 want to make a SCOPE_REF to represent the qualified-id. This
3070 function does not do this in order to avoid wastefully creating
3071 SCOPE_REFs when they are not required.
3073 If TEMPLATE_KEYWORD_P is true, then we have just seen the
3076 If CHECK_DEPENDENCY_P is false, then names are looked up inside
3077 uninstantiated templates.
3079 If *TEMPLATE_P is non-NULL, it is set to true iff the
3080 `template' keyword is used to explicitly indicate that the entity
3081 named is a template.
3083 If DECLARATOR_P is true, the id-expression is appearing as part of
3084 a declarator, rather than as part of an expression. */
3087 cp_parser_id_expression (cp_parser *parser,
3088 bool template_keyword_p,
3089 bool check_dependency_p,
3093 bool global_scope_p;
3094 bool nested_name_specifier_p;
3096 /* Assume the `template' keyword was not used. */
3098 *template_p = false;
3100 /* Look for the optional `::' operator. */
3102 = (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false)
3104 /* Look for the optional nested-name-specifier. */
3105 nested_name_specifier_p
3106 = (cp_parser_nested_name_specifier_opt (parser,
3107 /*typename_keyword_p=*/false,
3112 /* If there is a nested-name-specifier, then we are looking at
3113 the first qualified-id production. */
3114 if (nested_name_specifier_p)
3117 tree saved_object_scope;
3118 tree saved_qualifying_scope;
3119 tree unqualified_id;
3122 /* See if the next token is the `template' keyword. */
3124 template_p = &is_template;
3125 *template_p = cp_parser_optional_template_keyword (parser);
3126 /* Name lookup we do during the processing of the
3127 unqualified-id might obliterate SCOPE. */
3128 saved_scope = parser->scope;
3129 saved_object_scope = parser->object_scope;
3130 saved_qualifying_scope = parser->qualifying_scope;
3131 /* Process the final unqualified-id. */
3132 unqualified_id = cp_parser_unqualified_id (parser, *template_p,
3135 /* Restore the SAVED_SCOPE for our caller. */
3136 parser->scope = saved_scope;
3137 parser->object_scope = saved_object_scope;
3138 parser->qualifying_scope = saved_qualifying_scope;
3140 return unqualified_id;
3142 /* Otherwise, if we are in global scope, then we are looking at one
3143 of the other qualified-id productions. */
3144 else if (global_scope_p)
3149 /* Peek at the next token. */
3150 token = cp_lexer_peek_token (parser->lexer);
3152 /* If it's an identifier, and the next token is not a "<", then
3153 we can avoid the template-id case. This is an optimization
3154 for this common case. */
3155 if (token->type == CPP_NAME
3156 && !cp_parser_nth_token_starts_template_argument_list_p
3158 return cp_parser_identifier (parser);
3160 cp_parser_parse_tentatively (parser);
3161 /* Try a template-id. */
3162 id = cp_parser_template_id (parser,
3163 /*template_keyword_p=*/false,
3164 /*check_dependency_p=*/true,
3166 /* If that worked, we're done. */
3167 if (cp_parser_parse_definitely (parser))
3170 /* Peek at the next token. (Changes in the token buffer may
3171 have invalidated the pointer obtained above.) */
3172 token = cp_lexer_peek_token (parser->lexer);
3174 switch (token->type)
3177 return cp_parser_identifier (parser);
3180 if (token->keyword == RID_OPERATOR)
3181 return cp_parser_operator_function_id (parser);
3185 cp_parser_error (parser, "expected id-expression");
3186 return error_mark_node;
3190 return cp_parser_unqualified_id (parser, template_keyword_p,
3191 /*check_dependency_p=*/true,
3195 /* Parse an unqualified-id.
3199 operator-function-id
3200 conversion-function-id
3204 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
3205 keyword, in a construct like `A::template ...'.
3207 Returns a representation of unqualified-id. For the `identifier'
3208 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
3209 production a BIT_NOT_EXPR is returned; the operand of the
3210 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
3211 other productions, see the documentation accompanying the
3212 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
3213 names are looked up in uninstantiated templates. If DECLARATOR_P
3214 is true, the unqualified-id is appearing as part of a declarator,
3215 rather than as part of an expression. */
3218 cp_parser_unqualified_id (cp_parser* parser,
3219 bool template_keyword_p,
3220 bool check_dependency_p,
3225 /* Peek at the next token. */
3226 token = cp_lexer_peek_token (parser->lexer);
3228 switch (token->type)
3234 /* We don't know yet whether or not this will be a
3236 cp_parser_parse_tentatively (parser);
3237 /* Try a template-id. */
3238 id = cp_parser_template_id (parser, template_keyword_p,
3241 /* If it worked, we're done. */
3242 if (cp_parser_parse_definitely (parser))
3244 /* Otherwise, it's an ordinary identifier. */
3245 return cp_parser_identifier (parser);
3248 case CPP_TEMPLATE_ID:
3249 return cp_parser_template_id (parser, template_keyword_p,
3256 tree qualifying_scope;
3261 /* Consume the `~' token. */
3262 cp_lexer_consume_token (parser->lexer);
3263 /* Parse the class-name. The standard, as written, seems to
3266 template <typename T> struct S { ~S (); };
3267 template <typename T> S<T>::~S() {}
3269 is invalid, since `~' must be followed by a class-name, but
3270 `S<T>' is dependent, and so not known to be a class.
3271 That's not right; we need to look in uninstantiated
3272 templates. A further complication arises from:
3274 template <typename T> void f(T t) {
3278 Here, it is not possible to look up `T' in the scope of `T'
3279 itself. We must look in both the current scope, and the
3280 scope of the containing complete expression.
3282 Yet another issue is:
3291 The standard does not seem to say that the `S' in `~S'
3292 should refer to the type `S' and not the data member
3295 /* DR 244 says that we look up the name after the "~" in the
3296 same scope as we looked up the qualifying name. That idea
3297 isn't fully worked out; it's more complicated than that. */
3298 scope = parser->scope;
3299 object_scope = parser->object_scope;
3300 qualifying_scope = parser->qualifying_scope;
3302 /* If the name is of the form "X::~X" it's OK. */
3303 if (scope && TYPE_P (scope)
3304 && cp_lexer_next_token_is (parser->lexer, CPP_NAME)
3305 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
3307 && (cp_lexer_peek_token (parser->lexer)->value
3308 == TYPE_IDENTIFIER (scope)))
3310 cp_lexer_consume_token (parser->lexer);
3311 return build_nt (BIT_NOT_EXPR, scope);
3314 /* If there was an explicit qualification (S::~T), first look
3315 in the scope given by the qualification (i.e., S). */
3317 type_decl = NULL_TREE;
3320 cp_parser_parse_tentatively (parser);
3321 type_decl = cp_parser_class_name (parser,
3322 /*typename_keyword_p=*/false,
3323 /*template_keyword_p=*/false,
3325 /*check_dependency=*/false,
3326 /*class_head_p=*/false,
3328 if (cp_parser_parse_definitely (parser))
3331 /* In "N::S::~S", look in "N" as well. */
3332 if (!done && scope && qualifying_scope)
3334 cp_parser_parse_tentatively (parser);
3335 parser->scope = qualifying_scope;
3336 parser->object_scope = NULL_TREE;
3337 parser->qualifying_scope = NULL_TREE;
3339 = cp_parser_class_name (parser,
3340 /*typename_keyword_p=*/false,
3341 /*template_keyword_p=*/false,
3343 /*check_dependency=*/false,
3344 /*class_head_p=*/false,
3346 if (cp_parser_parse_definitely (parser))
3349 /* In "p->S::~T", look in the scope given by "*p" as well. */
3350 else if (!done && object_scope)
3352 cp_parser_parse_tentatively (parser);
3353 parser->scope = object_scope;
3354 parser->object_scope = NULL_TREE;
3355 parser->qualifying_scope = NULL_TREE;
3357 = cp_parser_class_name (parser,
3358 /*typename_keyword_p=*/false,
3359 /*template_keyword_p=*/false,
3361 /*check_dependency=*/false,
3362 /*class_head_p=*/false,
3364 if (cp_parser_parse_definitely (parser))
3367 /* Look in the surrounding context. */
3370 parser->scope = NULL_TREE;
3371 parser->object_scope = NULL_TREE;
3372 parser->qualifying_scope = NULL_TREE;
3374 = cp_parser_class_name (parser,
3375 /*typename_keyword_p=*/false,
3376 /*template_keyword_p=*/false,
3378 /*check_dependency=*/false,
3379 /*class_head_p=*/false,
3382 /* If an error occurred, assume that the name of the
3383 destructor is the same as the name of the qualifying
3384 class. That allows us to keep parsing after running
3385 into ill-formed destructor names. */
3386 if (type_decl == error_mark_node && scope && TYPE_P (scope))
3387 return build_nt (BIT_NOT_EXPR, scope);
3388 else if (type_decl == error_mark_node)
3389 return error_mark_node;
3393 A typedef-name that names a class shall not be used as the
3394 identifier in the declarator for a destructor declaration. */
3396 && !DECL_IMPLICIT_TYPEDEF_P (type_decl)
3397 && !DECL_SELF_REFERENCE_P (type_decl)
3398 && !cp_parser_uncommitted_to_tentative_parse_p (parser))
3399 error ("typedef-name %qD used as destructor declarator",
3402 return build_nt (BIT_NOT_EXPR, TREE_TYPE (type_decl));
3406 if (token->keyword == RID_OPERATOR)
3410 /* This could be a template-id, so we try that first. */
3411 cp_parser_parse_tentatively (parser);
3412 /* Try a template-id. */
3413 id = cp_parser_template_id (parser, template_keyword_p,
3414 /*check_dependency_p=*/true,
3416 /* If that worked, we're done. */
3417 if (cp_parser_parse_definitely (parser))
3419 /* We still don't know whether we're looking at an
3420 operator-function-id or a conversion-function-id. */
3421 cp_parser_parse_tentatively (parser);
3422 /* Try an operator-function-id. */
3423 id = cp_parser_operator_function_id (parser);
3424 /* If that didn't work, try a conversion-function-id. */
3425 if (!cp_parser_parse_definitely (parser))
3426 id = cp_parser_conversion_function_id (parser);
3433 cp_parser_error (parser, "expected unqualified-id");
3434 return error_mark_node;
3438 /* Parse an (optional) nested-name-specifier.
3440 nested-name-specifier:
3441 class-or-namespace-name :: nested-name-specifier [opt]
3442 class-or-namespace-name :: template nested-name-specifier [opt]
3444 PARSER->SCOPE should be set appropriately before this function is
3445 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
3446 effect. TYPE_P is TRUE if we non-type bindings should be ignored
3449 Sets PARSER->SCOPE to the class (TYPE) or namespace
3450 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
3451 it unchanged if there is no nested-name-specifier. Returns the new
3452 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
3454 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
3455 part of a declaration and/or decl-specifier. */
3458 cp_parser_nested_name_specifier_opt (cp_parser *parser,
3459 bool typename_keyword_p,
3460 bool check_dependency_p,
3462 bool is_declaration)
3464 bool success = false;
3465 tree access_check = NULL_TREE;
3466 cp_token_position start = 0;
3469 /* If the next token corresponds to a nested name specifier, there
3470 is no need to reparse it. However, if CHECK_DEPENDENCY_P is
3471 false, it may have been true before, in which case something
3472 like `A<X>::B<Y>::C' may have resulted in a nested-name-specifier
3473 of `A<X>::', where it should now be `A<X>::B<Y>::'. So, when
3474 CHECK_DEPENDENCY_P is false, we have to fall through into the
3476 if (check_dependency_p
3477 && cp_lexer_next_token_is (parser->lexer, CPP_NESTED_NAME_SPECIFIER))
3479 cp_parser_pre_parsed_nested_name_specifier (parser);
3480 return parser->scope;
3483 /* Remember where the nested-name-specifier starts. */
3484 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
3485 start = cp_lexer_token_position (parser->lexer, false);
3487 push_deferring_access_checks (dk_deferred);
3493 tree saved_qualifying_scope;
3494 bool template_keyword_p;
3496 /* Spot cases that cannot be the beginning of a
3497 nested-name-specifier. */
3498 token = cp_lexer_peek_token (parser->lexer);
3500 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
3501 the already parsed nested-name-specifier. */
3502 if (token->type == CPP_NESTED_NAME_SPECIFIER)
3504 /* Grab the nested-name-specifier and continue the loop. */
3505 cp_parser_pre_parsed_nested_name_specifier (parser);
3510 /* Spot cases that cannot be the beginning of a
3511 nested-name-specifier. On the second and subsequent times
3512 through the loop, we look for the `template' keyword. */
3513 if (success && token->keyword == RID_TEMPLATE)
3515 /* A template-id can start a nested-name-specifier. */
3516 else if (token->type == CPP_TEMPLATE_ID)
3520 /* If the next token is not an identifier, then it is
3521 definitely not a class-or-namespace-name. */
3522 if (token->type != CPP_NAME)
3524 /* If the following token is neither a `<' (to begin a
3525 template-id), nor a `::', then we are not looking at a
3526 nested-name-specifier. */
3527 token = cp_lexer_peek_nth_token (parser->lexer, 2);
3528 if (token->type != CPP_SCOPE
3529 && !cp_parser_nth_token_starts_template_argument_list_p
3534 /* The nested-name-specifier is optional, so we parse
3536 cp_parser_parse_tentatively (parser);
3538 /* Look for the optional `template' keyword, if this isn't the
3539 first time through the loop. */
3541 template_keyword_p = cp_parser_optional_template_keyword (parser);
3543 template_keyword_p = false;
3545 /* Save the old scope since the name lookup we are about to do
3546 might destroy it. */
3547 old_scope = parser->scope;
3548 saved_qualifying_scope = parser->qualifying_scope;
3549 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
3550 look up names in "X<T>::I" in order to determine that "Y" is
3551 a template. So, if we have a typename at this point, we make
3552 an effort to look through it. */
3554 && !typename_keyword_p
3556 && TREE_CODE (parser->scope) == TYPENAME_TYPE)
3557 parser->scope = resolve_typename_type (parser->scope,
3558 /*only_current_p=*/false);
3559 /* Parse the qualifying entity. */
3561 = cp_parser_class_or_namespace_name (parser,
3567 /* Look for the `::' token. */
3568 cp_parser_require (parser, CPP_SCOPE, "`::'");
3570 /* If we found what we wanted, we keep going; otherwise, we're
3572 if (!cp_parser_parse_definitely (parser))
3574 bool error_p = false;
3576 /* Restore the OLD_SCOPE since it was valid before the
3577 failed attempt at finding the last
3578 class-or-namespace-name. */
3579 parser->scope = old_scope;
3580 parser->qualifying_scope = saved_qualifying_scope;
3581 /* If the next token is an identifier, and the one after
3582 that is a `::', then any valid interpretation would have
3583 found a class-or-namespace-name. */
3584 while (cp_lexer_next_token_is (parser->lexer, CPP_NAME)
3585 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
3587 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
3590 token = cp_lexer_consume_token (parser->lexer);
3595 decl = cp_parser_lookup_name_simple (parser, token->value);
3596 if (TREE_CODE (decl) == TEMPLATE_DECL)
3597 error ("%qD used without template parameters", decl);
3599 cp_parser_name_lookup_error
3600 (parser, token->value, decl,
3601 "is not a class or namespace");
3602 parser->scope = NULL_TREE;
3604 /* Treat this as a successful nested-name-specifier
3609 If the name found is not a class-name (clause
3610 _class_) or namespace-name (_namespace.def_), the
3611 program is ill-formed. */
3614 cp_lexer_consume_token (parser->lexer);
3619 /* We've found one valid nested-name-specifier. */
3621 /* Make sure we look in the right scope the next time through
3623 parser->scope = (TREE_CODE (new_scope) == TYPE_DECL
3624 ? TREE_TYPE (new_scope)
3626 /* If it is a class scope, try to complete it; we are about to
3627 be looking up names inside the class. */
3628 if (TYPE_P (parser->scope)
3629 /* Since checking types for dependency can be expensive,
3630 avoid doing it if the type is already complete. */
3631 && !COMPLETE_TYPE_P (parser->scope)
3632 /* Do not try to complete dependent types. */
3633 && !dependent_type_p (parser->scope))
3634 complete_type (parser->scope);
3637 /* Retrieve any deferred checks. Do not pop this access checks yet
3638 so the memory will not be reclaimed during token replacing below. */
3639 access_check = get_deferred_access_checks ();
3641 /* If parsing tentatively, replace the sequence of tokens that makes
3642 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
3643 token. That way, should we re-parse the token stream, we will
3644 not have to repeat the effort required to do the parse, nor will
3645 we issue duplicate error messages. */
3646 if (success && start)
3648 cp_token *token = cp_lexer_token_at (parser->lexer, start);
3650 /* Reset the contents of the START token. */
3651 token->type = CPP_NESTED_NAME_SPECIFIER;
3652 token->value = build_tree_list (access_check, parser->scope);
3653 TREE_TYPE (token->value) = parser->qualifying_scope;
3654 token->keyword = RID_MAX;
3656 /* Purge all subsequent tokens. */
3657 cp_lexer_purge_tokens_after (parser->lexer, start);
3660 pop_deferring_access_checks ();
3661 return success ? parser->scope : NULL_TREE;
3664 /* Parse a nested-name-specifier. See
3665 cp_parser_nested_name_specifier_opt for details. This function
3666 behaves identically, except that it will an issue an error if no
3667 nested-name-specifier is present, and it will return
3668 ERROR_MARK_NODE, rather than NULL_TREE, if no nested-name-specifier
3672 cp_parser_nested_name_specifier (cp_parser *parser,
3673 bool typename_keyword_p,
3674 bool check_dependency_p,
3676 bool is_declaration)
3680 /* Look for the nested-name-specifier. */
3681 scope = cp_parser_nested_name_specifier_opt (parser,
3686 /* If it was not present, issue an error message. */
3689 cp_parser_error (parser, "expected nested-name-specifier");
3690 parser->scope = NULL_TREE;
3691 return error_mark_node;
3697 /* Parse a class-or-namespace-name.
3699 class-or-namespace-name:
3703 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
3704 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
3705 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
3706 TYPE_P is TRUE iff the next name should be taken as a class-name,
3707 even the same name is declared to be another entity in the same
3710 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
3711 specified by the class-or-namespace-name. If neither is found the
3712 ERROR_MARK_NODE is returned. */
3715 cp_parser_class_or_namespace_name (cp_parser *parser,
3716 bool typename_keyword_p,
3717 bool template_keyword_p,
3718 bool check_dependency_p,
3720 bool is_declaration)
3723 tree saved_qualifying_scope;
3724 tree saved_object_scope;
3728 /* Before we try to parse the class-name, we must save away the
3729 current PARSER->SCOPE since cp_parser_class_name will destroy
3731 saved_scope = parser->scope;
3732 saved_qualifying_scope = parser->qualifying_scope;
3733 saved_object_scope = parser->object_scope;
3734 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
3735 there is no need to look for a namespace-name. */
3736 only_class_p = template_keyword_p || (saved_scope && TYPE_P (saved_scope));
3738 cp_parser_parse_tentatively (parser);
3739 scope = cp_parser_class_name (parser,
3742 type_p ? class_type : none_type,
3744 /*class_head_p=*/false,
3746 /* If that didn't work, try for a namespace-name. */
3747 if (!only_class_p && !cp_parser_parse_definitely (parser))
3749 /* Restore the saved scope. */
3750 parser->scope = saved_scope;
3751 parser->qualifying_scope = saved_qualifying_scope;
3752 parser->object_scope = saved_object_scope;
3753 /* If we are not looking at an identifier followed by the scope
3754 resolution operator, then this is not part of a
3755 nested-name-specifier. (Note that this function is only used
3756 to parse the components of a nested-name-specifier.) */
3757 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME)
3758 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_SCOPE)
3759 return error_mark_node;
3760 scope = cp_parser_namespace_name (parser);
3766 /* Parse a postfix-expression.
3770 postfix-expression [ expression ]
3771 postfix-expression ( expression-list [opt] )
3772 simple-type-specifier ( expression-list [opt] )
3773 typename :: [opt] nested-name-specifier identifier
3774 ( expression-list [opt] )
3775 typename :: [opt] nested-name-specifier template [opt] template-id
3776 ( expression-list [opt] )
3777 postfix-expression . template [opt] id-expression
3778 postfix-expression -> template [opt] id-expression
3779 postfix-expression . pseudo-destructor-name
3780 postfix-expression -> pseudo-destructor-name
3781 postfix-expression ++
3782 postfix-expression --
3783 dynamic_cast < type-id > ( expression )
3784 static_cast < type-id > ( expression )
3785 reinterpret_cast < type-id > ( expression )
3786 const_cast < type-id > ( expression )
3787 typeid ( expression )
3793 ( type-id ) { initializer-list , [opt] }
3795 This extension is a GNU version of the C99 compound-literal
3796 construct. (The C99 grammar uses `type-name' instead of `type-id',
3797 but they are essentially the same concept.)
3799 If ADDRESS_P is true, the postfix expression is the operand of the
3800 `&' operator. CAST_P is true if this expression is the target of a
3803 Returns a representation of the expression. */
3806 cp_parser_postfix_expression (cp_parser *parser, bool address_p, bool cast_p)
3810 cp_id_kind idk = CP_ID_KIND_NONE;
3811 tree postfix_expression = NULL_TREE;
3812 /* Non-NULL only if the current postfix-expression can be used to
3813 form a pointer-to-member. In that case, QUALIFYING_CLASS is the
3814 class used to qualify the member. */
3815 tree qualifying_class = NULL_TREE;
3817 /* Peek at the next token. */
3818 token = cp_lexer_peek_token (parser->lexer);
3819 /* Some of the productions are determined by keywords. */
3820 keyword = token->keyword;
3830 const char *saved_message;
3832 /* All of these can be handled in the same way from the point
3833 of view of parsing. Begin by consuming the token
3834 identifying the cast. */
3835 cp_lexer_consume_token (parser->lexer);
3837 /* New types cannot be defined in the cast. */
3838 saved_message = parser->type_definition_forbidden_message;
3839 parser->type_definition_forbidden_message
3840 = "types may not be defined in casts";
3842 /* Look for the opening `<'. */
3843 cp_parser_require (parser, CPP_LESS, "`<'");
3844 /* Parse the type to which we are casting. */
3845 type = cp_parser_type_id (parser);
3846 /* Look for the closing `>'. */
3847 cp_parser_require (parser, CPP_GREATER, "`>'");
3848 /* Restore the old message. */
3849 parser->type_definition_forbidden_message = saved_message;
3851 /* And the expression which is being cast. */
3852 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
3853 expression = cp_parser_expression (parser, /*cast_p=*/true);
3854 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3856 /* Only type conversions to integral or enumeration types
3857 can be used in constant-expressions. */
3858 if (parser->integral_constant_expression_p
3859 && !dependent_type_p (type)
3860 && !INTEGRAL_OR_ENUMERATION_TYPE_P (type)
3861 && (cp_parser_non_integral_constant_expression
3863 "a cast to a type other than an integral or "
3864 "enumeration type")))
3865 return error_mark_node;
3871 = build_dynamic_cast (type, expression);
3875 = build_static_cast (type, expression);
3879 = build_reinterpret_cast (type, expression);
3883 = build_const_cast (type, expression);
3894 const char *saved_message;
3895 bool saved_in_type_id_in_expr_p;
3897 /* Consume the `typeid' token. */
3898 cp_lexer_consume_token (parser->lexer);
3899 /* Look for the `(' token. */
3900 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
3901 /* Types cannot be defined in a `typeid' expression. */
3902 saved_message = parser->type_definition_forbidden_message;
3903 parser->type_definition_forbidden_message
3904 = "types may not be defined in a `typeid\' expression";
3905 /* We can't be sure yet whether we're looking at a type-id or an
3907 cp_parser_parse_tentatively (parser);
3908 /* Try a type-id first. */
3909 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
3910 parser->in_type_id_in_expr_p = true;
3911 type = cp_parser_type_id (parser);
3912 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
3913 /* Look for the `)' token. Otherwise, we can't be sure that
3914 we're not looking at an expression: consider `typeid (int
3915 (3))', for example. */
3916 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3917 /* If all went well, simply lookup the type-id. */
3918 if (cp_parser_parse_definitely (parser))
3919 postfix_expression = get_typeid (type);
3920 /* Otherwise, fall back to the expression variant. */
3925 /* Look for an expression. */
3926 expression = cp_parser_expression (parser, /*cast_p=*/false);
3927 /* Compute its typeid. */
3928 postfix_expression = build_typeid (expression);
3929 /* Look for the `)' token. */
3930 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
3932 /* `typeid' may not appear in an integral constant expression. */
3933 if (cp_parser_non_integral_constant_expression(parser,
3934 "`typeid' operator"))
3935 return error_mark_node;
3936 /* Restore the saved message. */
3937 parser->type_definition_forbidden_message = saved_message;
3943 bool template_p = false;
3948 /* Consume the `typename' token. */
3949 cp_lexer_consume_token (parser->lexer);
3950 /* Look for the optional `::' operator. */
3951 cp_parser_global_scope_opt (parser,
3952 /*current_scope_valid_p=*/false);
3953 /* Look for the nested-name-specifier. In case of error here,
3954 consume the trailing id to avoid subsequent error messages
3956 scope = cp_parser_nested_name_specifier (parser,
3957 /*typename_keyword_p=*/true,
3958 /*check_dependency_p=*/true,
3960 /*is_declaration=*/true);
3962 /* Look for the optional `template' keyword. */
3963 template_p = cp_parser_optional_template_keyword (parser);
3964 /* We don't know whether we're looking at a template-id or an
3966 cp_parser_parse_tentatively (parser);
3967 /* Try a template-id. */
3968 id = cp_parser_template_id (parser, template_p,
3969 /*check_dependency_p=*/true,
3970 /*is_declaration=*/true);
3971 /* If that didn't work, try an identifier. */
3972 if (!cp_parser_parse_definitely (parser))
3973 id = cp_parser_identifier (parser);
3975 /* Don't process id if nested name specifier is invalid. */
3976 if (scope == error_mark_node)
3977 return error_mark_node;
3978 /* If we look up a template-id in a non-dependent qualifying
3979 scope, there's no need to create a dependent type. */
3980 else if (TREE_CODE (id) == TYPE_DECL
3981 && !dependent_type_p (parser->scope))
3982 type = TREE_TYPE (id);
3983 /* Create a TYPENAME_TYPE to represent the type to which the
3984 functional cast is being performed. */
3986 type = make_typename_type (parser->scope, id,
3990 postfix_expression = cp_parser_functional_cast (parser, type);
3998 /* If the next thing is a simple-type-specifier, we may be
3999 looking at a functional cast. We could also be looking at
4000 an id-expression. So, we try the functional cast, and if
4001 that doesn't work we fall back to the primary-expression. */
4002 cp_parser_parse_tentatively (parser);
4003 /* Look for the simple-type-specifier. */
4004 type = cp_parser_simple_type_specifier (parser,
4005 /*decl_specs=*/NULL,
4006 CP_PARSER_FLAGS_NONE);
4007 /* Parse the cast itself. */
4008 if (!cp_parser_error_occurred (parser))
4010 = cp_parser_functional_cast (parser, type);
4011 /* If that worked, we're done. */
4012 if (cp_parser_parse_definitely (parser))
4015 /* If the functional-cast didn't work out, try a
4016 compound-literal. */
4017 if (cp_parser_allow_gnu_extensions_p (parser)
4018 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
4020 tree initializer_list = NULL_TREE;
4021 bool saved_in_type_id_in_expr_p;
4023 cp_parser_parse_tentatively (parser);
4024 /* Consume the `('. */
4025 cp_lexer_consume_token (parser->lexer);
4026 /* Parse the type. */
4027 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
4028 parser->in_type_id_in_expr_p = true;
4029 type = cp_parser_type_id (parser);
4030 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
4031 /* Look for the `)'. */
4032 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
4033 /* Look for the `{'. */
4034 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
4035 /* If things aren't going well, there's no need to
4037 if (!cp_parser_error_occurred (parser))
4039 bool non_constant_p;
4040 /* Parse the initializer-list. */
4042 = cp_parser_initializer_list (parser, &non_constant_p);
4043 /* Allow a trailing `,'. */
4044 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
4045 cp_lexer_consume_token (parser->lexer);
4046 /* Look for the final `}'. */
4047 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
4049 /* If that worked, we're definitely looking at a
4050 compound-literal expression. */
4051 if (cp_parser_parse_definitely (parser))
4053 /* Warn the user that a compound literal is not
4054 allowed in standard C++. */
4056 pedwarn ("ISO C++ forbids compound-literals");
4057 /* Form the representation of the compound-literal. */
4059 = finish_compound_literal (type, initializer_list);
4064 /* It must be a primary-expression. */
4065 postfix_expression = cp_parser_primary_expression (parser,
4073 /* If we were avoiding committing to the processing of a
4074 qualified-id until we knew whether or not we had a
4075 pointer-to-member, we now know. */
4076 if (qualifying_class)
4080 /* Peek at the next token. */
4081 token = cp_lexer_peek_token (parser->lexer);
4082 done = (token->type != CPP_OPEN_SQUARE
4083 && token->type != CPP_OPEN_PAREN
4084 && token->type != CPP_DOT
4085 && token->type != CPP_DEREF
4086 && token->type != CPP_PLUS_PLUS
4087 && token->type != CPP_MINUS_MINUS);
4089 postfix_expression = finish_qualified_id_expr (qualifying_class,
4094 return postfix_expression;
4097 /* Keep looping until the postfix-expression is complete. */
4100 if (idk == CP_ID_KIND_UNQUALIFIED
4101 && TREE_CODE (postfix_expression) == IDENTIFIER_NODE
4102 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
4103 /* It is not a Koenig lookup function call. */
4105 = unqualified_name_lookup_error (postfix_expression);
4107 /* Peek at the next token. */
4108 token = cp_lexer_peek_token (parser->lexer);
4110 switch (token->type)
4112 case CPP_OPEN_SQUARE:
4114 = cp_parser_postfix_open_square_expression (parser,
4117 idk = CP_ID_KIND_NONE;
4120 case CPP_OPEN_PAREN:
4121 /* postfix-expression ( expression-list [opt] ) */
4124 tree args = (cp_parser_parenthesized_expression_list
4127 /*non_constant_p=*/NULL));
4129 if (args == error_mark_node)
4131 postfix_expression = error_mark_node;
4135 /* Function calls are not permitted in
4136 constant-expressions. */
4137 if (! builtin_valid_in_constant_expr_p (postfix_expression)
4138 && cp_parser_non_integral_constant_expression (parser,
4141 postfix_expression = error_mark_node;
4146 if (idk == CP_ID_KIND_UNQUALIFIED)
4148 if (TREE_CODE (postfix_expression) == IDENTIFIER_NODE)
4154 = perform_koenig_lookup (postfix_expression, args);
4158 = unqualified_fn_lookup_error (postfix_expression);
4160 /* We do not perform argument-dependent lookup if
4161 normal lookup finds a non-function, in accordance
4162 with the expected resolution of DR 218. */
4163 else if (args && is_overloaded_fn (postfix_expression))
4165 tree fn = get_first_fn (postfix_expression);
4167 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4168 fn = OVL_CURRENT (TREE_OPERAND (fn, 0));
4170 /* Only do argument dependent lookup if regular
4171 lookup does not find a set of member functions.
4172 [basic.lookup.koenig]/2a */
4173 if (!DECL_FUNCTION_MEMBER_P (fn))
4177 = perform_koenig_lookup (postfix_expression, args);
4182 if (TREE_CODE (postfix_expression) == COMPONENT_REF)
4184 tree instance = TREE_OPERAND (postfix_expression, 0);
4185 tree fn = TREE_OPERAND (postfix_expression, 1);
4187 if (processing_template_decl
4188 && (type_dependent_expression_p (instance)
4189 || (!BASELINK_P (fn)
4190 && TREE_CODE (fn) != FIELD_DECL)
4191 || type_dependent_expression_p (fn)
4192 || any_type_dependent_arguments_p (args)))
4195 = build_min_nt (CALL_EXPR, postfix_expression,
4200 if (BASELINK_P (fn))
4202 = (build_new_method_call
4203 (instance, fn, args, NULL_TREE,
4204 (idk == CP_ID_KIND_QUALIFIED
4205 ? LOOKUP_NONVIRTUAL : LOOKUP_NORMAL)));
4208 = finish_call_expr (postfix_expression, args,
4209 /*disallow_virtual=*/false,
4210 /*koenig_p=*/false);
4212 else if (TREE_CODE (postfix_expression) == OFFSET_REF
4213 || TREE_CODE (postfix_expression) == MEMBER_REF
4214 || TREE_CODE (postfix_expression) == DOTSTAR_EXPR)
4215 postfix_expression = (build_offset_ref_call_from_tree
4216 (postfix_expression, args));
4217 else if (idk == CP_ID_KIND_QUALIFIED)
4218 /* A call to a static class member, or a namespace-scope
4221 = finish_call_expr (postfix_expression, args,
4222 /*disallow_virtual=*/true,
4225 /* All other function calls. */
4227 = finish_call_expr (postfix_expression, args,
4228 /*disallow_virtual=*/false,
4231 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
4232 idk = CP_ID_KIND_NONE;
4238 /* postfix-expression . template [opt] id-expression
4239 postfix-expression . pseudo-destructor-name
4240 postfix-expression -> template [opt] id-expression
4241 postfix-expression -> pseudo-destructor-name */
4243 /* Consume the `.' or `->' operator. */
4244 cp_lexer_consume_token (parser->lexer);
4247 = cp_parser_postfix_dot_deref_expression (parser, token->type,
4253 /* postfix-expression ++ */
4254 /* Consume the `++' token. */
4255 cp_lexer_consume_token (parser->lexer);
4256 /* Generate a representation for the complete expression. */
4258 = finish_increment_expr (postfix_expression,
4259 POSTINCREMENT_EXPR);
4260 /* Increments may not appear in constant-expressions. */
4261 if (cp_parser_non_integral_constant_expression (parser,
4263 postfix_expression = error_mark_node;
4264 idk = CP_ID_KIND_NONE;
4267 case CPP_MINUS_MINUS:
4268 /* postfix-expression -- */
4269 /* Consume the `--' token. */
4270 cp_lexer_consume_token (parser->lexer);
4271 /* Generate a representation for the complete expression. */
4273 = finish_increment_expr (postfix_expression,
4274 POSTDECREMENT_EXPR);
4275 /* Decrements may not appear in constant-expressions. */
4276 if (cp_parser_non_integral_constant_expression (parser,
4278 postfix_expression = error_mark_node;
4279 idk = CP_ID_KIND_NONE;
4283 return postfix_expression;
4287 /* We should never get here. */
4289 return error_mark_node;
4292 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
4293 by cp_parser_builtin_offsetof. We're looking for
4295 postfix-expression [ expression ]
4297 FOR_OFFSETOF is set if we're being called in that context, which
4298 changes how we deal with integer constant expressions. */
4301 cp_parser_postfix_open_square_expression (cp_parser *parser,
4302 tree postfix_expression,
4307 /* Consume the `[' token. */
4308 cp_lexer_consume_token (parser->lexer);
4310 /* Parse the index expression. */
4311 /* ??? For offsetof, there is a question of what to allow here. If
4312 offsetof is not being used in an integral constant expression context,
4313 then we *could* get the right answer by computing the value at runtime.
4314 If we are in an integral constant expression context, then we might
4315 could accept any constant expression; hard to say without analysis.
4316 Rather than open the barn door too wide right away, allow only integer
4317 constant expressions here. */
4319 index = cp_parser_constant_expression (parser, false, NULL);
4321 index = cp_parser_expression (parser, /*cast_p=*/false);
4323 /* Look for the closing `]'. */
4324 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
4326 /* Build the ARRAY_REF. */
4327 postfix_expression = grok_array_decl (postfix_expression, index);
4329 /* When not doing offsetof, array references are not permitted in
4330 constant-expressions. */
4332 && (cp_parser_non_integral_constant_expression
4333 (parser, "an array reference")))
4334 postfix_expression = error_mark_node;
4336 return postfix_expression;
4339 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
4340 by cp_parser_builtin_offsetof. We're looking for
4342 postfix-expression . template [opt] id-expression
4343 postfix-expression . pseudo-destructor-name
4344 postfix-expression -> template [opt] id-expression
4345 postfix-expression -> pseudo-destructor-name
4347 FOR_OFFSETOF is set if we're being called in that context. That sorta
4348 limits what of the above we'll actually accept, but nevermind.
4349 TOKEN_TYPE is the "." or "->" token, which will already have been
4350 removed from the stream. */
4353 cp_parser_postfix_dot_deref_expression (cp_parser *parser,
4354 enum cpp_ttype token_type,
4355 tree postfix_expression,
4356 bool for_offsetof, cp_id_kind *idk)
4361 bool pseudo_destructor_p;
4362 tree scope = NULL_TREE;
4364 /* If this is a `->' operator, dereference the pointer. */
4365 if (token_type == CPP_DEREF)
4366 postfix_expression = build_x_arrow (postfix_expression);
4367 /* Check to see whether or not the expression is type-dependent. */
4368 dependent_p = type_dependent_expression_p (postfix_expression);
4369 /* The identifier following the `->' or `.' is not qualified. */
4370 parser->scope = NULL_TREE;
4371 parser->qualifying_scope = NULL_TREE;
4372 parser->object_scope = NULL_TREE;
4373 *idk = CP_ID_KIND_NONE;
4374 /* Enter the scope corresponding to the type of the object
4375 given by the POSTFIX_EXPRESSION. */
4376 if (!dependent_p && TREE_TYPE (postfix_expression) != NULL_TREE)
4378 scope = TREE_TYPE (postfix_expression);
4379 /* According to the standard, no expression should ever have
4380 reference type. Unfortunately, we do not currently match
4381 the standard in this respect in that our internal representation
4382 of an expression may have reference type even when the standard
4383 says it does not. Therefore, we have to manually obtain the
4384 underlying type here. */
4385 scope = non_reference (scope);
4386 /* The type of the POSTFIX_EXPRESSION must be complete. */
4387 scope = complete_type_or_else (scope, NULL_TREE);
4388 /* Let the name lookup machinery know that we are processing a
4389 class member access expression. */
4390 parser->context->object_type = scope;
4391 /* If something went wrong, we want to be able to discern that case,
4392 as opposed to the case where there was no SCOPE due to the type
4393 of expression being dependent. */
4395 scope = error_mark_node;
4396 /* If the SCOPE was erroneous, make the various semantic analysis
4397 functions exit quickly -- and without issuing additional error
4399 if (scope == error_mark_node)
4400 postfix_expression = error_mark_node;
4403 /* Assume this expression is not a pseudo-destructor access. */
4404 pseudo_destructor_p = false;
4406 /* If the SCOPE is a scalar type, then, if this is a valid program,
4407 we must be looking at a pseudo-destructor-name. */
4408 if (scope && SCALAR_TYPE_P (scope))
4413 cp_parser_parse_tentatively (parser);
4414 /* Parse the pseudo-destructor-name. */
4416 cp_parser_pseudo_destructor_name (parser, &s, &type);
4417 if (cp_parser_parse_definitely (parser))
4419 pseudo_destructor_p = true;
4421 = finish_pseudo_destructor_expr (postfix_expression,
4422 s, TREE_TYPE (type));
4426 if (!pseudo_destructor_p)
4428 /* If the SCOPE is not a scalar type, we are looking at an
4429 ordinary class member access expression, rather than a
4430 pseudo-destructor-name. */
4431 template_p = cp_parser_optional_template_keyword (parser);
4432 /* Parse the id-expression. */
4433 name = cp_parser_id_expression (parser, template_p,
4434 /*check_dependency_p=*/true,
4435 /*template_p=*/NULL,
4436 /*declarator_p=*/false);
4437 /* In general, build a SCOPE_REF if the member name is qualified.
4438 However, if the name was not dependent and has already been
4439 resolved; there is no need to build the SCOPE_REF. For example;
4441 struct X { void f(); };
4442 template <typename T> void f(T* t) { t->X::f(); }
4444 Even though "t" is dependent, "X::f" is not and has been resolved
4445 to a BASELINK; there is no need to include scope information. */
4447 /* But we do need to remember that there was an explicit scope for
4448 virtual function calls. */
4450 *idk = CP_ID_KIND_QUALIFIED;
4452 /* If the name is a template-id that names a type, we will get a
4453 TYPE_DECL here. That is invalid code. */
4454 if (TREE_CODE (name) == TYPE_DECL)
4456 error ("invalid use of %qD", name);
4457 postfix_expression = error_mark_node;
4461 if (name != error_mark_node && !BASELINK_P (name) && parser->scope)
4463 name = build_nt (SCOPE_REF, parser->scope, name);
4464 parser->scope = NULL_TREE;
4465 parser->qualifying_scope = NULL_TREE;
4466 parser->object_scope = NULL_TREE;
4468 if (scope && name && BASELINK_P (name))
4469 adjust_result_of_qualified_name_lookup
4470 (name, BINFO_TYPE (BASELINK_BINFO (name)), scope);
4472 = finish_class_member_access_expr (postfix_expression, name);
4476 /* We no longer need to look up names in the scope of the object on
4477 the left-hand side of the `.' or `->' operator. */
4478 parser->context->object_type = NULL_TREE;
4480 /* Outside of offsetof, these operators may not appear in
4481 constant-expressions. */
4483 && (cp_parser_non_integral_constant_expression
4484 (parser, token_type == CPP_DEREF ? "'->'" : "`.'")))
4485 postfix_expression = error_mark_node;
4487 return postfix_expression;
4490 /* Parse a parenthesized expression-list.
4493 assignment-expression
4494 expression-list, assignment-expression
4499 identifier, expression-list
4501 CAST_P is true if this expression is the target of a cast.
4503 Returns a TREE_LIST. The TREE_VALUE of each node is a
4504 representation of an assignment-expression. Note that a TREE_LIST
4505 is returned even if there is only a single expression in the list.
4506 error_mark_node is returned if the ( and or ) are
4507 missing. NULL_TREE is returned on no expressions. The parentheses
4508 are eaten. IS_ATTRIBUTE_LIST is true if this is really an attribute
4509 list being parsed. If NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P
4510 indicates whether or not all of the expressions in the list were
4514 cp_parser_parenthesized_expression_list (cp_parser* parser,
4515 bool is_attribute_list,
4517 bool *non_constant_p)
4519 tree expression_list = NULL_TREE;
4520 bool fold_expr_p = is_attribute_list;
4521 tree identifier = NULL_TREE;
4523 /* Assume all the expressions will be constant. */
4525 *non_constant_p = false;
4527 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
4528 return error_mark_node;
4530 /* Consume expressions until there are no more. */
4531 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
4536 /* At the beginning of attribute lists, check to see if the
4537 next token is an identifier. */
4538 if (is_attribute_list
4539 && cp_lexer_peek_token (parser->lexer)->type == CPP_NAME)
4543 /* Consume the identifier. */
4544 token = cp_lexer_consume_token (parser->lexer);
4545 /* Save the identifier. */
4546 identifier = token->value;
4550 /* Parse the next assignment-expression. */
4553 bool expr_non_constant_p;
4554 expr = (cp_parser_constant_expression
4555 (parser, /*allow_non_constant_p=*/true,
4556 &expr_non_constant_p));
4557 if (expr_non_constant_p)
4558 *non_constant_p = true;
4561 expr = cp_parser_assignment_expression (parser, cast_p);
4564 expr = fold_non_dependent_expr (expr);
4566 /* Add it to the list. We add error_mark_node
4567 expressions to the list, so that we can still tell if
4568 the correct form for a parenthesized expression-list
4569 is found. That gives better errors. */
4570 expression_list = tree_cons (NULL_TREE, expr, expression_list);
4572 if (expr == error_mark_node)
4576 /* After the first item, attribute lists look the same as
4577 expression lists. */
4578 is_attribute_list = false;
4581 /* If the next token isn't a `,', then we are done. */
4582 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
4585 /* Otherwise, consume the `,' and keep going. */
4586 cp_lexer_consume_token (parser->lexer);
4589 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
4594 /* We try and resync to an unnested comma, as that will give the
4595 user better diagnostics. */
4596 ending = cp_parser_skip_to_closing_parenthesis (parser,
4597 /*recovering=*/true,
4599 /*consume_paren=*/true);
4603 return error_mark_node;
4606 /* We built up the list in reverse order so we must reverse it now. */
4607 expression_list = nreverse (expression_list);
4609 expression_list = tree_cons (NULL_TREE, identifier, expression_list);
4611 return expression_list;
4614 /* Parse a pseudo-destructor-name.
4616 pseudo-destructor-name:
4617 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
4618 :: [opt] nested-name-specifier template template-id :: ~ type-name
4619 :: [opt] nested-name-specifier [opt] ~ type-name
4621 If either of the first two productions is used, sets *SCOPE to the
4622 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
4623 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
4624 or ERROR_MARK_NODE if the parse fails. */
4627 cp_parser_pseudo_destructor_name (cp_parser* parser,
4631 bool nested_name_specifier_p;
4633 /* Assume that things will not work out. */
4634 *type = error_mark_node;
4636 /* Look for the optional `::' operator. */
4637 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/true);
4638 /* Look for the optional nested-name-specifier. */
4639 nested_name_specifier_p
4640 = (cp_parser_nested_name_specifier_opt (parser,
4641 /*typename_keyword_p=*/false,
4642 /*check_dependency_p=*/true,
4644 /*is_declaration=*/true)
4646 /* Now, if we saw a nested-name-specifier, we might be doing the
4647 second production. */
4648 if (nested_name_specifier_p
4649 && cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
4651 /* Consume the `template' keyword. */
4652 cp_lexer_consume_token (parser->lexer);
4653 /* Parse the template-id. */
4654 cp_parser_template_id (parser,
4655 /*template_keyword_p=*/true,
4656 /*check_dependency_p=*/false,
4657 /*is_declaration=*/true);
4658 /* Look for the `::' token. */
4659 cp_parser_require (parser, CPP_SCOPE, "`::'");
4661 /* If the next token is not a `~', then there might be some
4662 additional qualification. */
4663 else if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMPL))
4665 /* Look for the type-name. */
4666 *scope = TREE_TYPE (cp_parser_type_name (parser));
4668 if (*scope == error_mark_node)
4671 /* If we don't have ::~, then something has gone wrong. Since
4672 the only caller of this function is looking for something
4673 after `.' or `->' after a scalar type, most likely the
4674 program is trying to get a member of a non-aggregate
4676 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SCOPE)
4677 || cp_lexer_peek_nth_token (parser->lexer, 2)->type != CPP_COMPL)
4679 cp_parser_error (parser, "request for member of non-aggregate type");
4683 /* Look for the `::' token. */
4684 cp_parser_require (parser, CPP_SCOPE, "`::'");
4689 /* Look for the `~'. */
4690 cp_parser_require (parser, CPP_COMPL, "`~'");
4691 /* Look for the type-name again. We are not responsible for
4692 checking that it matches the first type-name. */
4693 *type = cp_parser_type_name (parser);
4696 /* Parse a unary-expression.
4702 unary-operator cast-expression
4703 sizeof unary-expression
4711 __extension__ cast-expression
4712 __alignof__ unary-expression
4713 __alignof__ ( type-id )
4714 __real__ cast-expression
4715 __imag__ cast-expression
4718 ADDRESS_P is true iff the unary-expression is appearing as the
4719 operand of the `&' operator. CAST_P is true if this expression is
4720 the target of a cast.
4722 Returns a representation of the expression. */
4725 cp_parser_unary_expression (cp_parser *parser, bool address_p, bool cast_p)
4728 enum tree_code unary_operator;
4730 /* Peek at the next token. */
4731 token = cp_lexer_peek_token (parser->lexer);
4732 /* Some keywords give away the kind of expression. */
4733 if (token->type == CPP_KEYWORD)
4735 enum rid keyword = token->keyword;
4745 op = keyword == RID_ALIGNOF ? ALIGNOF_EXPR : SIZEOF_EXPR;
4746 /* Consume the token. */
4747 cp_lexer_consume_token (parser->lexer);
4748 /* Parse the operand. */
4749 operand = cp_parser_sizeof_operand (parser, keyword);
4751 if (TYPE_P (operand))
4752 return cxx_sizeof_or_alignof_type (operand, op, true);
4754 return cxx_sizeof_or_alignof_expr (operand, op);
4758 return cp_parser_new_expression (parser);
4761 return cp_parser_delete_expression (parser);
4765 /* The saved value of the PEDANTIC flag. */
4769 /* Save away the PEDANTIC flag. */
4770 cp_parser_extension_opt (parser, &saved_pedantic);
4771 /* Parse the cast-expression. */
4772 expr = cp_parser_simple_cast_expression (parser);
4773 /* Restore the PEDANTIC flag. */
4774 pedantic = saved_pedantic;
4784 /* Consume the `__real__' or `__imag__' token. */
4785 cp_lexer_consume_token (parser->lexer);
4786 /* Parse the cast-expression. */
4787 expression = cp_parser_simple_cast_expression (parser);
4788 /* Create the complete representation. */
4789 return build_x_unary_op ((keyword == RID_REALPART
4790 ? REALPART_EXPR : IMAGPART_EXPR),
4800 /* Look for the `:: new' and `:: delete', which also signal the
4801 beginning of a new-expression, or delete-expression,
4802 respectively. If the next token is `::', then it might be one of
4804 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
4808 /* See if the token after the `::' is one of the keywords in
4809 which we're interested. */
4810 keyword = cp_lexer_peek_nth_token (parser->lexer, 2)->keyword;
4811 /* If it's `new', we have a new-expression. */
4812 if (keyword == RID_NEW)
4813 return cp_parser_new_expression (parser);
4814 /* Similarly, for `delete'. */
4815 else if (keyword == RID_DELETE)
4816 return cp_parser_delete_expression (parser);
4819 /* Look for a unary operator. */
4820 unary_operator = cp_parser_unary_operator (token);
4821 /* The `++' and `--' operators can be handled similarly, even though
4822 they are not technically unary-operators in the grammar. */
4823 if (unary_operator == ERROR_MARK)
4825 if (token->type == CPP_PLUS_PLUS)
4826 unary_operator = PREINCREMENT_EXPR;
4827 else if (token->type == CPP_MINUS_MINUS)
4828 unary_operator = PREDECREMENT_EXPR;
4829 /* Handle the GNU address-of-label extension. */
4830 else if (cp_parser_allow_gnu_extensions_p (parser)
4831 && token->type == CPP_AND_AND)
4835 /* Consume the '&&' token. */
4836 cp_lexer_consume_token (parser->lexer);
4837 /* Look for the identifier. */
4838 identifier = cp_parser_identifier (parser);
4839 /* Create an expression representing the address. */
4840 return finish_label_address_expr (identifier);
4843 if (unary_operator != ERROR_MARK)
4845 tree cast_expression;
4846 tree expression = error_mark_node;
4847 const char *non_constant_p = NULL;
4849 /* Consume the operator token. */
4850 token = cp_lexer_consume_token (parser->lexer);
4851 /* Parse the cast-expression. */
4853 = cp_parser_cast_expression (parser,
4854 unary_operator == ADDR_EXPR,
4856 /* Now, build an appropriate representation. */
4857 switch (unary_operator)
4860 non_constant_p = "`*'";
4861 expression = build_x_indirect_ref (cast_expression, "unary *");
4865 non_constant_p = "`&'";
4868 expression = build_x_unary_op (unary_operator, cast_expression);
4871 case PREINCREMENT_EXPR:
4872 case PREDECREMENT_EXPR:
4873 non_constant_p = (unary_operator == PREINCREMENT_EXPR
4878 case TRUTH_NOT_EXPR:
4879 expression = finish_unary_op_expr (unary_operator, cast_expression);
4887 && cp_parser_non_integral_constant_expression (parser,
4889 expression = error_mark_node;
4894 return cp_parser_postfix_expression (parser, address_p, cast_p);
4897 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
4898 unary-operator, the corresponding tree code is returned. */
4900 static enum tree_code
4901 cp_parser_unary_operator (cp_token* token)
4903 switch (token->type)
4906 return INDIRECT_REF;
4912 return CONVERT_EXPR;
4918 return TRUTH_NOT_EXPR;
4921 return BIT_NOT_EXPR;
4928 /* Parse a new-expression.
4931 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
4932 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
4934 Returns a representation of the expression. */
4937 cp_parser_new_expression (cp_parser* parser)
4939 bool global_scope_p;
4945 /* Look for the optional `::' operator. */
4947 = (cp_parser_global_scope_opt (parser,
4948 /*current_scope_valid_p=*/false)
4950 /* Look for the `new' operator. */
4951 cp_parser_require_keyword (parser, RID_NEW, "`new'");
4952 /* There's no easy way to tell a new-placement from the
4953 `( type-id )' construct. */
4954 cp_parser_parse_tentatively (parser);
4955 /* Look for a new-placement. */
4956 placement = cp_parser_new_placement (parser);
4957 /* If that didn't work out, there's no new-placement. */
4958 if (!cp_parser_parse_definitely (parser))
4959 placement = NULL_TREE;
4961 /* If the next token is a `(', then we have a parenthesized
4963 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
4965 /* Consume the `('. */
4966 cp_lexer_consume_token (parser->lexer);
4967 /* Parse the type-id. */
4968 type = cp_parser_type_id (parser);
4969 /* Look for the closing `)'. */
4970 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
4971 /* There should not be a direct-new-declarator in this production,
4972 but GCC used to allowed this, so we check and emit a sensible error
4973 message for this case. */
4974 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
4976 error ("array bound forbidden after parenthesized type-id");
4977 inform ("try removing the parentheses around the type-id");
4978 cp_parser_direct_new_declarator (parser);
4982 /* Otherwise, there must be a new-type-id. */
4984 type = cp_parser_new_type_id (parser, &nelts);
4986 /* If the next token is a `(', then we have a new-initializer. */
4987 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
4988 initializer = cp_parser_new_initializer (parser);
4990 initializer = NULL_TREE;
4992 /* A new-expression may not appear in an integral constant
4994 if (cp_parser_non_integral_constant_expression (parser, "`new'"))
4995 return error_mark_node;
4997 /* Create a representation of the new-expression. */
4998 return build_new (placement, type, nelts, initializer, global_scope_p);
5001 /* Parse a new-placement.
5006 Returns the same representation as for an expression-list. */
5009 cp_parser_new_placement (cp_parser* parser)
5011 tree expression_list;
5013 /* Parse the expression-list. */
5014 expression_list = (cp_parser_parenthesized_expression_list
5015 (parser, false, /*cast_p=*/false,
5016 /*non_constant_p=*/NULL));
5018 return expression_list;
5021 /* Parse a new-type-id.
5024 type-specifier-seq new-declarator [opt]
5026 Returns the TYPE allocated. If the new-type-id indicates an array
5027 type, *NELTS is set to the number of elements in the last array
5028 bound; the TYPE will not include the last array bound. */
5031 cp_parser_new_type_id (cp_parser* parser, tree *nelts)
5033 cp_decl_specifier_seq type_specifier_seq;
5034 cp_declarator *new_declarator;
5035 cp_declarator *declarator;
5036 cp_declarator *outer_declarator;
5037 const char *saved_message;
5040 /* The type-specifier sequence must not contain type definitions.
5041 (It cannot contain declarations of new types either, but if they
5042 are not definitions we will catch that because they are not
5044 saved_message = parser->type_definition_forbidden_message;
5045 parser->type_definition_forbidden_message
5046 = "types may not be defined in a new-type-id";
5047 /* Parse the type-specifier-seq. */
5048 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
5049 &type_specifier_seq);
5050 /* Restore the old message. */
5051 parser->type_definition_forbidden_message = saved_message;
5052 /* Parse the new-declarator. */
5053 new_declarator = cp_parser_new_declarator_opt (parser);
5055 /* Determine the number of elements in the last array dimension, if
5058 /* Skip down to the last array dimension. */
5059 declarator = new_declarator;
5060 outer_declarator = NULL;
5061 while (declarator && (declarator->kind == cdk_pointer
5062 || declarator->kind == cdk_ptrmem))
5064 outer_declarator = declarator;
5065 declarator = declarator->declarator;
5068 && declarator->kind == cdk_array
5069 && declarator->declarator
5070 && declarator->declarator->kind == cdk_array)
5072 outer_declarator = declarator;
5073 declarator = declarator->declarator;
5076 if (declarator && declarator->kind == cdk_array)
5078 *nelts = declarator->u.array.bounds;
5079 if (*nelts == error_mark_node)
5080 *nelts = integer_one_node;
5082 if (outer_declarator)
5083 outer_declarator->declarator = declarator->declarator;
5085 new_declarator = NULL;
5088 type = groktypename (&type_specifier_seq, new_declarator);
5089 if (TREE_CODE (type) == ARRAY_TYPE && *nelts == NULL_TREE)
5091 *nelts = array_type_nelts_top (type);
5092 type = TREE_TYPE (type);
5097 /* Parse an (optional) new-declarator.
5100 ptr-operator new-declarator [opt]
5101 direct-new-declarator
5103 Returns the declarator. */
5105 static cp_declarator *
5106 cp_parser_new_declarator_opt (cp_parser* parser)
5108 enum tree_code code;
5110 cp_cv_quals cv_quals;
5112 /* We don't know if there's a ptr-operator next, or not. */
5113 cp_parser_parse_tentatively (parser);
5114 /* Look for a ptr-operator. */
5115 code = cp_parser_ptr_operator (parser, &type, &cv_quals);
5116 /* If that worked, look for more new-declarators. */
5117 if (cp_parser_parse_definitely (parser))
5119 cp_declarator *declarator;
5121 /* Parse another optional declarator. */
5122 declarator = cp_parser_new_declarator_opt (parser);
5124 /* Create the representation of the declarator. */
5126 declarator = make_ptrmem_declarator (cv_quals, type, declarator);
5127 else if (code == INDIRECT_REF)
5128 declarator = make_pointer_declarator (cv_quals, declarator);
5130 declarator = make_reference_declarator (cv_quals, declarator);
5135 /* If the next token is a `[', there is a direct-new-declarator. */
5136 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
5137 return cp_parser_direct_new_declarator (parser);
5142 /* Parse a direct-new-declarator.
5144 direct-new-declarator:
5146 direct-new-declarator [constant-expression]
5150 static cp_declarator *
5151 cp_parser_direct_new_declarator (cp_parser* parser)
5153 cp_declarator *declarator = NULL;
5159 /* Look for the opening `['. */
5160 cp_parser_require (parser, CPP_OPEN_SQUARE, "`['");
5161 /* The first expression is not required to be constant. */
5164 expression = cp_parser_expression (parser, /*cast_p=*/false);
5165 /* The standard requires that the expression have integral
5166 type. DR 74 adds enumeration types. We believe that the
5167 real intent is that these expressions be handled like the
5168 expression in a `switch' condition, which also allows
5169 classes with a single conversion to integral or
5170 enumeration type. */
5171 if (!processing_template_decl)
5174 = build_expr_type_conversion (WANT_INT | WANT_ENUM,
5179 error ("expression in new-declarator must have integral "
5180 "or enumeration type");
5181 expression = error_mark_node;
5185 /* But all the other expressions must be. */
5188 = cp_parser_constant_expression (parser,
5189 /*allow_non_constant=*/false,
5191 /* Look for the closing `]'. */
5192 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
5194 /* Add this bound to the declarator. */
5195 declarator = make_array_declarator (declarator, expression);
5197 /* If the next token is not a `[', then there are no more
5199 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_SQUARE))
5206 /* Parse a new-initializer.
5209 ( expression-list [opt] )
5211 Returns a representation of the expression-list. If there is no
5212 expression-list, VOID_ZERO_NODE is returned. */
5215 cp_parser_new_initializer (cp_parser* parser)
5217 tree expression_list;
5219 expression_list = (cp_parser_parenthesized_expression_list
5220 (parser, false, /*cast_p=*/false,
5221 /*non_constant_p=*/NULL));
5222 if (!expression_list)
5223 expression_list = void_zero_node;
5225 return expression_list;
5228 /* Parse a delete-expression.
5231 :: [opt] delete cast-expression
5232 :: [opt] delete [ ] cast-expression
5234 Returns a representation of the expression. */
5237 cp_parser_delete_expression (cp_parser* parser)
5239 bool global_scope_p;
5243 /* Look for the optional `::' operator. */
5245 = (cp_parser_global_scope_opt (parser,
5246 /*current_scope_valid_p=*/false)
5248 /* Look for the `delete' keyword. */
5249 cp_parser_require_keyword (parser, RID_DELETE, "`delete'");
5250 /* See if the array syntax is in use. */
5251 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
5253 /* Consume the `[' token. */
5254 cp_lexer_consume_token (parser->lexer);
5255 /* Look for the `]' token. */
5256 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
5257 /* Remember that this is the `[]' construct. */
5263 /* Parse the cast-expression. */
5264 expression = cp_parser_simple_cast_expression (parser);
5266 /* A delete-expression may not appear in an integral constant
5268 if (cp_parser_non_integral_constant_expression (parser, "`delete'"))
5269 return error_mark_node;
5271 return delete_sanity (expression, NULL_TREE, array_p, global_scope_p);
5274 /* Parse a cast-expression.
5278 ( type-id ) cast-expression
5280 ADDRESS_P is true iff the unary-expression is appearing as the
5281 operand of the `&' operator. CAST_P is true if this expression is
5282 the target of a cast.
5284 Returns a representation of the expression. */
5287 cp_parser_cast_expression (cp_parser *parser, bool address_p, bool cast_p)
5289 /* If it's a `(', then we might be looking at a cast. */
5290 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
5292 tree type = NULL_TREE;
5293 tree expr = NULL_TREE;
5294 bool compound_literal_p;
5295 const char *saved_message;
5297 /* There's no way to know yet whether or not this is a cast.
5298 For example, `(int (3))' is a unary-expression, while `(int)
5299 3' is a cast. So, we resort to parsing tentatively. */
5300 cp_parser_parse_tentatively (parser);
5301 /* Types may not be defined in a cast. */
5302 saved_message = parser->type_definition_forbidden_message;
5303 parser->type_definition_forbidden_message
5304 = "types may not be defined in casts";
5305 /* Consume the `('. */
5306 cp_lexer_consume_token (parser->lexer);
5307 /* A very tricky bit is that `(struct S) { 3 }' is a
5308 compound-literal (which we permit in C++ as an extension).
5309 But, that construct is not a cast-expression -- it is a
5310 postfix-expression. (The reason is that `(struct S) { 3 }.i'
5311 is legal; if the compound-literal were a cast-expression,
5312 you'd need an extra set of parentheses.) But, if we parse
5313 the type-id, and it happens to be a class-specifier, then we
5314 will commit to the parse at that point, because we cannot
5315 undo the action that is done when creating a new class. So,
5316 then we cannot back up and do a postfix-expression.
5318 Therefore, we scan ahead to the closing `)', and check to see
5319 if the token after the `)' is a `{'. If so, we are not
5320 looking at a cast-expression.
5322 Save tokens so that we can put them back. */
5323 cp_lexer_save_tokens (parser->lexer);
5324 /* Skip tokens until the next token is a closing parenthesis.
5325 If we find the closing `)', and the next token is a `{', then
5326 we are looking at a compound-literal. */
5328 = (cp_parser_skip_to_closing_parenthesis (parser, false, false,
5329 /*consume_paren=*/true)
5330 && cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE));
5331 /* Roll back the tokens we skipped. */
5332 cp_lexer_rollback_tokens (parser->lexer);
5333 /* If we were looking at a compound-literal, simulate an error
5334 so that the call to cp_parser_parse_definitely below will
5336 if (compound_literal_p)
5337 cp_parser_simulate_error (parser);
5340 bool saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
5341 parser->in_type_id_in_expr_p = true;
5342 /* Look for the type-id. */
5343 type = cp_parser_type_id (parser);
5344 /* Look for the closing `)'. */
5345 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
5346 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
5349 /* Restore the saved message. */
5350 parser->type_definition_forbidden_message = saved_message;
5352 /* If ok so far, parse the dependent expression. We cannot be
5353 sure it is a cast. Consider `(T ())'. It is a parenthesized
5354 ctor of T, but looks like a cast to function returning T
5355 without a dependent expression. */
5356 if (!cp_parser_error_occurred (parser))
5357 expr = cp_parser_cast_expression (parser,
5358 /*address_p=*/false,
5361 if (cp_parser_parse_definitely (parser))
5363 /* Warn about old-style casts, if so requested. */
5364 if (warn_old_style_cast
5365 && !in_system_header
5366 && !VOID_TYPE_P (type)
5367 && current_lang_name != lang_name_c)
5368 warning (0, "use of old-style cast");
5370 /* Only type conversions to integral or enumeration types
5371 can be used in constant-expressions. */
5372 if (parser->integral_constant_expression_p
5373 && !dependent_type_p (type)
5374 && !INTEGRAL_OR_ENUMERATION_TYPE_P (type)
5375 && (cp_parser_non_integral_constant_expression
5377 "a cast to a type other than an integral or "
5378 "enumeration type")))
5379 return error_mark_node;
5381 /* Perform the cast. */
5382 expr = build_c_cast (type, expr);
5387 /* If we get here, then it's not a cast, so it must be a
5388 unary-expression. */
5389 return cp_parser_unary_expression (parser, address_p, cast_p);
5392 /* Parse a binary expression of the general form:
5396 pm-expression .* cast-expression
5397 pm-expression ->* cast-expression
5399 multiplicative-expression:
5401 multiplicative-expression * pm-expression
5402 multiplicative-expression / pm-expression
5403 multiplicative-expression % pm-expression
5405 additive-expression:
5406 multiplicative-expression
5407 additive-expression + multiplicative-expression
5408 additive-expression - multiplicative-expression
5412 shift-expression << additive-expression
5413 shift-expression >> additive-expression
5415 relational-expression:
5417 relational-expression < shift-expression
5418 relational-expression > shift-expression
5419 relational-expression <= shift-expression
5420 relational-expression >= shift-expression
5424 relational-expression:
5425 relational-expression <? shift-expression
5426 relational-expression >? shift-expression
5428 equality-expression:
5429 relational-expression
5430 equality-expression == relational-expression
5431 equality-expression != relational-expression
5435 and-expression & equality-expression
5437 exclusive-or-expression:
5439 exclusive-or-expression ^ and-expression
5441 inclusive-or-expression:
5442 exclusive-or-expression
5443 inclusive-or-expression | exclusive-or-expression
5445 logical-and-expression:
5446 inclusive-or-expression
5447 logical-and-expression && inclusive-or-expression
5449 logical-or-expression:
5450 logical-and-expression
5451 logical-or-expression || logical-and-expression
5453 All these are implemented with a single function like:
5456 simple-cast-expression
5457 binary-expression <token> binary-expression
5459 CAST_P is true if this expression is the target of a cast.
5461 The binops_by_token map is used to get the tree codes for each <token> type.
5462 binary-expressions are associated according to a precedence table. */
5464 #define TOKEN_PRECEDENCE(token) \
5465 ((token->type == CPP_GREATER && !parser->greater_than_is_operator_p) \
5466 ? PREC_NOT_OPERATOR \
5467 : binops_by_token[token->type].prec)
5470 cp_parser_binary_expression (cp_parser* parser, bool cast_p)
5472 cp_parser_expression_stack stack;
5473 cp_parser_expression_stack_entry *sp = &stack[0];
5476 enum tree_code tree_type;
5477 enum cp_parser_prec prec = PREC_NOT_OPERATOR, new_prec, lookahead_prec;
5480 /* Parse the first expression. */
5481 lhs = cp_parser_cast_expression (parser, /*address_p=*/false, cast_p);
5485 /* Get an operator token. */
5486 token = cp_lexer_peek_token (parser->lexer);
5487 if (token->type == CPP_MIN || token->type == CPP_MAX)
5488 cp_parser_warn_min_max ();
5490 new_prec = TOKEN_PRECEDENCE (token);
5492 /* Popping an entry off the stack means we completed a subexpression:
5493 - either we found a token which is not an operator (`>' where it is not
5494 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
5495 will happen repeatedly;
5496 - or, we found an operator which has lower priority. This is the case
5497 where the recursive descent *ascends*, as in `3 * 4 + 5' after
5499 if (new_prec <= prec)
5508 tree_type = binops_by_token[token->type].tree_type;
5510 /* We used the operator token. */
5511 cp_lexer_consume_token (parser->lexer);
5513 /* Extract another operand. It may be the RHS of this expression
5514 or the LHS of a new, higher priority expression. */
5515 rhs = cp_parser_simple_cast_expression (parser);
5517 /* Get another operator token. Look up its precedence to avoid
5518 building a useless (immediately popped) stack entry for common
5519 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
5520 token = cp_lexer_peek_token (parser->lexer);
5521 lookahead_prec = TOKEN_PRECEDENCE (token);
5522 if (lookahead_prec > new_prec)
5524 /* ... and prepare to parse the RHS of the new, higher priority
5525 expression. Since precedence levels on the stack are
5526 monotonically increasing, we do not have to care about
5529 sp->tree_type = tree_type;
5534 new_prec = lookahead_prec;
5538 /* If the stack is not empty, we have parsed into LHS the right side
5539 (`4' in the example above) of an expression we had suspended.
5540 We can use the information on the stack to recover the LHS (`3')
5541 from the stack together with the tree code (`MULT_EXPR'), and
5542 the precedence of the higher level subexpression
5543 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
5544 which will be used to actually build the additive expression. */
5547 tree_type = sp->tree_type;
5552 overloaded_p = false;
5553 lhs = build_x_binary_op (tree_type, lhs, rhs, &overloaded_p);
5555 /* If the binary operator required the use of an overloaded operator,
5556 then this expression cannot be an integral constant-expression.
5557 An overloaded operator can be used even if both operands are
5558 otherwise permissible in an integral constant-expression if at
5559 least one of the operands is of enumeration type. */
5562 && (cp_parser_non_integral_constant_expression
5563 (parser, "calls to overloaded operators")))
5564 return error_mark_node;
5571 /* Parse the `? expression : assignment-expression' part of a
5572 conditional-expression. The LOGICAL_OR_EXPR is the
5573 logical-or-expression that started the conditional-expression.
5574 Returns a representation of the entire conditional-expression.
5576 This routine is used by cp_parser_assignment_expression.
5578 ? expression : assignment-expression
5582 ? : assignment-expression */
5585 cp_parser_question_colon_clause (cp_parser* parser, tree logical_or_expr)
5588 tree assignment_expr;
5590 /* Consume the `?' token. */
5591 cp_lexer_consume_token (parser->lexer);
5592 if (cp_parser_allow_gnu_extensions_p (parser)
5593 && cp_lexer_next_token_is (parser->lexer, CPP_COLON))
5594 /* Implicit true clause. */
5597 /* Parse the expression. */
5598 expr = cp_parser_expression (parser, /*cast_p=*/false);
5600 /* The next token should be a `:'. */
5601 cp_parser_require (parser, CPP_COLON, "`:'");
5602 /* Parse the assignment-expression. */
5603 assignment_expr = cp_parser_assignment_expression (parser, /*cast_p=*/false);
5605 /* Build the conditional-expression. */
5606 return build_x_conditional_expr (logical_or_expr,
5611 /* Parse an assignment-expression.
5613 assignment-expression:
5614 conditional-expression
5615 logical-or-expression assignment-operator assignment_expression
5618 CAST_P is true if this expression is the target of a cast.
5620 Returns a representation for the expression. */
5623 cp_parser_assignment_expression (cp_parser* parser, bool cast_p)
5627 /* If the next token is the `throw' keyword, then we're looking at
5628 a throw-expression. */
5629 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_THROW))
5630 expr = cp_parser_throw_expression (parser);
5631 /* Otherwise, it must be that we are looking at a
5632 logical-or-expression. */
5635 /* Parse the binary expressions (logical-or-expression). */
5636 expr = cp_parser_binary_expression (parser, cast_p);
5637 /* If the next token is a `?' then we're actually looking at a
5638 conditional-expression. */
5639 if (cp_lexer_next_token_is (parser->lexer, CPP_QUERY))
5640 return cp_parser_question_colon_clause (parser, expr);
5643 enum tree_code assignment_operator;
5645 /* If it's an assignment-operator, we're using the second
5648 = cp_parser_assignment_operator_opt (parser);
5649 if (assignment_operator != ERROR_MARK)
5653 /* Parse the right-hand side of the assignment. */
5654 rhs = cp_parser_assignment_expression (parser, cast_p);
5655 /* An assignment may not appear in a
5656 constant-expression. */
5657 if (cp_parser_non_integral_constant_expression (parser,
5659 return error_mark_node;
5660 /* Build the assignment expression. */
5661 expr = build_x_modify_expr (expr,
5662 assignment_operator,
5671 /* Parse an (optional) assignment-operator.
5673 assignment-operator: one of
5674 = *= /= %= += -= >>= <<= &= ^= |=
5678 assignment-operator: one of
5681 If the next token is an assignment operator, the corresponding tree
5682 code is returned, and the token is consumed. For example, for
5683 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
5684 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
5685 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
5686 operator, ERROR_MARK is returned. */
5688 static enum tree_code
5689 cp_parser_assignment_operator_opt (cp_parser* parser)
5694 /* Peek at the next toen. */
5695 token = cp_lexer_peek_token (parser->lexer);
5697 switch (token->type)
5708 op = TRUNC_DIV_EXPR;
5712 op = TRUNC_MOD_EXPR;
5745 cp_parser_warn_min_max ();
5750 cp_parser_warn_min_max ();
5754 /* Nothing else is an assignment operator. */
5758 /* If it was an assignment operator, consume it. */
5759 if (op != ERROR_MARK)
5760 cp_lexer_consume_token (parser->lexer);
5765 /* Parse an expression.
5768 assignment-expression
5769 expression , assignment-expression
5771 CAST_P is true if this expression is the target of a cast.
5773 Returns a representation of the expression. */
5776 cp_parser_expression (cp_parser* parser, bool cast_p)
5778 tree expression = NULL_TREE;
5782 tree assignment_expression;
5784 /* Parse the next assignment-expression. */
5785 assignment_expression
5786 = cp_parser_assignment_expression (parser, cast_p);
5787 /* If this is the first assignment-expression, we can just
5790 expression = assignment_expression;
5792 expression = build_x_compound_expr (expression,
5793 assignment_expression);
5794 /* If the next token is not a comma, then we are done with the
5796 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
5798 /* Consume the `,'. */
5799 cp_lexer_consume_token (parser->lexer);
5800 /* A comma operator cannot appear in a constant-expression. */
5801 if (cp_parser_non_integral_constant_expression (parser,
5802 "a comma operator"))
5803 expression = error_mark_node;
5809 /* Parse a constant-expression.
5811 constant-expression:
5812 conditional-expression
5814 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
5815 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
5816 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
5817 is false, NON_CONSTANT_P should be NULL. */
5820 cp_parser_constant_expression (cp_parser* parser,
5821 bool allow_non_constant_p,
5822 bool *non_constant_p)
5824 bool saved_integral_constant_expression_p;
5825 bool saved_allow_non_integral_constant_expression_p;
5826 bool saved_non_integral_constant_expression_p;
5829 /* It might seem that we could simply parse the
5830 conditional-expression, and then check to see if it were
5831 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
5832 one that the compiler can figure out is constant, possibly after
5833 doing some simplifications or optimizations. The standard has a
5834 precise definition of constant-expression, and we must honor
5835 that, even though it is somewhat more restrictive.
5841 is not a legal declaration, because `(2, 3)' is not a
5842 constant-expression. The `,' operator is forbidden in a
5843 constant-expression. However, GCC's constant-folding machinery
5844 will fold this operation to an INTEGER_CST for `3'. */
5846 /* Save the old settings. */
5847 saved_integral_constant_expression_p = parser->integral_constant_expression_p;
5848 saved_allow_non_integral_constant_expression_p
5849 = parser->allow_non_integral_constant_expression_p;
5850 saved_non_integral_constant_expression_p = parser->non_integral_constant_expression_p;
5851 /* We are now parsing a constant-expression. */
5852 parser->integral_constant_expression_p = true;
5853 parser->allow_non_integral_constant_expression_p = allow_non_constant_p;
5854 parser->non_integral_constant_expression_p = false;
5855 /* Although the grammar says "conditional-expression", we parse an
5856 "assignment-expression", which also permits "throw-expression"
5857 and the use of assignment operators. In the case that
5858 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
5859 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
5860 actually essential that we look for an assignment-expression.
5861 For example, cp_parser_initializer_clauses uses this function to
5862 determine whether a particular assignment-expression is in fact
5864 expression = cp_parser_assignment_expression (parser, /*cast_p=*/false);
5865 /* Restore the old settings. */
5866 parser->integral_constant_expression_p
5867 = saved_integral_constant_expression_p;
5868 parser->allow_non_integral_constant_expression_p
5869 = saved_allow_non_integral_constant_expression_p;
5870 if (allow_non_constant_p)
5871 *non_constant_p = parser->non_integral_constant_expression_p;
5872 else if (parser->non_integral_constant_expression_p)
5873 expression = error_mark_node;
5874 parser->non_integral_constant_expression_p
5875 = saved_non_integral_constant_expression_p;
5880 /* Parse __builtin_offsetof.
5882 offsetof-expression:
5883 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
5885 offsetof-member-designator:
5887 | offsetof-member-designator "." id-expression
5888 | offsetof-member-designator "[" expression "]"
5892 cp_parser_builtin_offsetof (cp_parser *parser)
5894 int save_ice_p, save_non_ice_p;
5898 /* We're about to accept non-integral-constant things, but will
5899 definitely yield an integral constant expression. Save and
5900 restore these values around our local parsing. */
5901 save_ice_p = parser->integral_constant_expression_p;
5902 save_non_ice_p = parser->non_integral_constant_expression_p;
5904 /* Consume the "__builtin_offsetof" token. */
5905 cp_lexer_consume_token (parser->lexer);
5906 /* Consume the opening `('. */
5907 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
5908 /* Parse the type-id. */
5909 type = cp_parser_type_id (parser);
5910 /* Look for the `,'. */
5911 cp_parser_require (parser, CPP_COMMA, "`,'");
5913 /* Build the (type *)null that begins the traditional offsetof macro. */
5914 expr = build_static_cast (build_pointer_type (type), null_pointer_node);
5916 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
5917 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DEREF, expr,
5921 cp_token *token = cp_lexer_peek_token (parser->lexer);
5922 switch (token->type)
5924 case CPP_OPEN_SQUARE:
5925 /* offsetof-member-designator "[" expression "]" */
5926 expr = cp_parser_postfix_open_square_expression (parser, expr, true);
5930 /* offsetof-member-designator "." identifier */
5931 cp_lexer_consume_token (parser->lexer);
5932 expr = cp_parser_postfix_dot_deref_expression (parser, CPP_DOT, expr,
5936 case CPP_CLOSE_PAREN:
5937 /* Consume the ")" token. */
5938 cp_lexer_consume_token (parser->lexer);
5942 /* Error. We know the following require will fail, but
5943 that gives the proper error message. */
5944 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
5945 cp_parser_skip_to_closing_parenthesis (parser, true, false, true);
5946 expr = error_mark_node;
5952 /* If we're processing a template, we can't finish the semantics yet.
5953 Otherwise we can fold the entire expression now. */
5954 if (processing_template_decl)
5955 expr = build1 (OFFSETOF_EXPR, size_type_node, expr);
5957 expr = fold_offsetof (expr);
5960 parser->integral_constant_expression_p = save_ice_p;
5961 parser->non_integral_constant_expression_p = save_non_ice_p;
5966 /* Statements [gram.stmt.stmt] */
5968 /* Parse a statement.
5972 expression-statement
5977 declaration-statement
5981 cp_parser_statement (cp_parser* parser, tree in_statement_expr)
5985 location_t statement_location;
5987 /* There is no statement yet. */
5988 statement = NULL_TREE;
5989 /* Peek at the next token. */
5990 token = cp_lexer_peek_token (parser->lexer);
5991 /* Remember the location of the first token in the statement. */
5992 statement_location = token->location;
5993 /* If this is a keyword, then that will often determine what kind of
5994 statement we have. */
5995 if (token->type == CPP_KEYWORD)
5997 enum rid keyword = token->keyword;
6003 statement = cp_parser_labeled_statement (parser,
6009 statement = cp_parser_selection_statement (parser);
6015 statement = cp_parser_iteration_statement (parser);
6022 statement = cp_parser_jump_statement (parser);
6025 /* Objective-C++ exception-handling constructs. */
6028 case RID_AT_FINALLY:
6029 case RID_AT_SYNCHRONIZED:
6031 statement = cp_parser_objc_statement (parser);
6035 statement = cp_parser_try_block (parser);
6039 /* It might be a keyword like `int' that can start a
6040 declaration-statement. */
6044 else if (token->type == CPP_NAME)
6046 /* If the next token is a `:', then we are looking at a
6047 labeled-statement. */
6048 token = cp_lexer_peek_nth_token (parser->lexer, 2);
6049 if (token->type == CPP_COLON)
6050 statement = cp_parser_labeled_statement (parser, in_statement_expr);
6052 /* Anything that starts with a `{' must be a compound-statement. */
6053 else if (token->type == CPP_OPEN_BRACE)
6054 statement = cp_parser_compound_statement (parser, NULL, false);
6055 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
6056 a statement all its own. */
6057 else if (token->type == CPP_PRAGMA)
6059 cp_lexer_handle_pragma (parser->lexer);
6063 /* Everything else must be a declaration-statement or an
6064 expression-statement. Try for the declaration-statement
6065 first, unless we are looking at a `;', in which case we know that
6066 we have an expression-statement. */
6069 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6071 cp_parser_parse_tentatively (parser);
6072 /* Try to parse the declaration-statement. */
6073 cp_parser_declaration_statement (parser);
6074 /* If that worked, we're done. */
6075 if (cp_parser_parse_definitely (parser))
6078 /* Look for an expression-statement instead. */
6079 statement = cp_parser_expression_statement (parser, in_statement_expr);
6082 /* Set the line number for the statement. */
6083 if (statement && STATEMENT_CODE_P (TREE_CODE (statement)))
6084 SET_EXPR_LOCATION (statement, statement_location);
6087 /* Parse a labeled-statement.
6090 identifier : statement
6091 case constant-expression : statement
6097 case constant-expression ... constant-expression : statement
6099 Returns the new CASE_LABEL_EXPR, for a `case' or `default' label.
6100 For an ordinary label, returns a LABEL_EXPR. */
6103 cp_parser_labeled_statement (cp_parser* parser, tree in_statement_expr)
6106 tree statement = error_mark_node;
6108 /* The next token should be an identifier. */
6109 token = cp_lexer_peek_token (parser->lexer);
6110 if (token->type != CPP_NAME
6111 && token->type != CPP_KEYWORD)
6113 cp_parser_error (parser, "expected labeled-statement");
6114 return error_mark_node;
6117 switch (token->keyword)
6124 /* Consume the `case' token. */
6125 cp_lexer_consume_token (parser->lexer);
6126 /* Parse the constant-expression. */
6127 expr = cp_parser_constant_expression (parser,
6128 /*allow_non_constant_p=*/false,
6131 ellipsis = cp_lexer_peek_token (parser->lexer);
6132 if (ellipsis->type == CPP_ELLIPSIS)
6134 /* Consume the `...' token. */
6135 cp_lexer_consume_token (parser->lexer);
6137 cp_parser_constant_expression (parser,
6138 /*allow_non_constant_p=*/false,
6140 /* We don't need to emit warnings here, as the common code
6141 will do this for us. */
6144 expr_hi = NULL_TREE;
6146 if (!parser->in_switch_statement_p)
6147 error ("case label %qE not within a switch statement", expr);
6149 statement = finish_case_label (expr, expr_hi);
6154 /* Consume the `default' token. */
6155 cp_lexer_consume_token (parser->lexer);
6156 if (!parser->in_switch_statement_p)
6157 error ("case label not within a switch statement");
6159 statement = finish_case_label (NULL_TREE, NULL_TREE);
6163 /* Anything else must be an ordinary label. */
6164 statement = finish_label_stmt (cp_parser_identifier (parser));
6168 /* Require the `:' token. */
6169 cp_parser_require (parser, CPP_COLON, "`:'");
6170 /* Parse the labeled statement. */
6171 cp_parser_statement (parser, in_statement_expr);
6173 /* Return the label, in the case of a `case' or `default' label. */
6177 /* Parse an expression-statement.
6179 expression-statement:
6182 Returns the new EXPR_STMT -- or NULL_TREE if the expression
6183 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
6184 indicates whether this expression-statement is part of an
6185 expression statement. */
6188 cp_parser_expression_statement (cp_parser* parser, tree in_statement_expr)
6190 tree statement = NULL_TREE;
6192 /* If the next token is a ';', then there is no expression
6194 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6195 statement = cp_parser_expression (parser, /*cast_p=*/false);
6197 /* Consume the final `;'. */
6198 cp_parser_consume_semicolon_at_end_of_statement (parser);
6200 if (in_statement_expr
6201 && cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
6202 /* This is the final expression statement of a statement
6204 statement = finish_stmt_expr_expr (statement, in_statement_expr);
6206 statement = finish_expr_stmt (statement);
6213 /* Parse a compound-statement.
6216 { statement-seq [opt] }
6218 Returns a tree representing the statement. */
6221 cp_parser_compound_statement (cp_parser *parser, tree in_statement_expr,
6226 /* Consume the `{'. */
6227 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "`{'"))
6228 return error_mark_node;
6229 /* Begin the compound-statement. */
6230 compound_stmt = begin_compound_stmt (in_try ? BCS_TRY_BLOCK : 0);
6231 /* Parse an (optional) statement-seq. */
6232 cp_parser_statement_seq_opt (parser, in_statement_expr);
6233 /* Finish the compound-statement. */
6234 finish_compound_stmt (compound_stmt);
6235 /* Consume the `}'. */
6236 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
6238 return compound_stmt;
6241 /* Parse an (optional) statement-seq.
6245 statement-seq [opt] statement */
6248 cp_parser_statement_seq_opt (cp_parser* parser, tree in_statement_expr)
6250 /* Scan statements until there aren't any more. */
6253 /* If we're looking at a `}', then we've run out of statements. */
6254 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE)
6255 || cp_lexer_next_token_is (parser->lexer, CPP_EOF))
6258 /* Parse the statement. */
6259 cp_parser_statement (parser, in_statement_expr);
6263 /* Parse a selection-statement.
6265 selection-statement:
6266 if ( condition ) statement
6267 if ( condition ) statement else statement
6268 switch ( condition ) statement
6270 Returns the new IF_STMT or SWITCH_STMT. */
6273 cp_parser_selection_statement (cp_parser* parser)
6278 /* Peek at the next token. */
6279 token = cp_parser_require (parser, CPP_KEYWORD, "selection-statement");
6281 /* See what kind of keyword it is. */
6282 keyword = token->keyword;
6291 /* Look for the `('. */
6292 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
6294 cp_parser_skip_to_end_of_statement (parser);
6295 return error_mark_node;
6298 /* Begin the selection-statement. */
6299 if (keyword == RID_IF)
6300 statement = begin_if_stmt ();
6302 statement = begin_switch_stmt ();
6304 /* Parse the condition. */
6305 condition = cp_parser_condition (parser);
6306 /* Look for the `)'. */
6307 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
6308 cp_parser_skip_to_closing_parenthesis (parser, true, false,
6309 /*consume_paren=*/true);
6311 if (keyword == RID_IF)
6313 /* Add the condition. */
6314 finish_if_stmt_cond (condition, statement);
6316 /* Parse the then-clause. */
6317 cp_parser_implicitly_scoped_statement (parser);
6318 finish_then_clause (statement);
6320 /* If the next token is `else', parse the else-clause. */
6321 if (cp_lexer_next_token_is_keyword (parser->lexer,
6324 /* Consume the `else' keyword. */
6325 cp_lexer_consume_token (parser->lexer);
6326 begin_else_clause (statement);
6327 /* Parse the else-clause. */
6328 cp_parser_implicitly_scoped_statement (parser);
6329 finish_else_clause (statement);
6332 /* Now we're all done with the if-statement. */
6333 finish_if_stmt (statement);
6337 bool in_switch_statement_p;
6339 /* Add the condition. */
6340 finish_switch_cond (condition, statement);
6342 /* Parse the body of the switch-statement. */
6343 in_switch_statement_p = parser->in_switch_statement_p;
6344 parser->in_switch_statement_p = true;
6345 cp_parser_implicitly_scoped_statement (parser);
6346 parser->in_switch_statement_p = in_switch_statement_p;
6348 /* Now we're all done with the switch-statement. */
6349 finish_switch_stmt (statement);
6357 cp_parser_error (parser, "expected selection-statement");
6358 return error_mark_node;
6362 /* Parse a condition.
6366 type-specifier-seq declarator = assignment-expression
6371 type-specifier-seq declarator asm-specification [opt]
6372 attributes [opt] = assignment-expression
6374 Returns the expression that should be tested. */
6377 cp_parser_condition (cp_parser* parser)
6379 cp_decl_specifier_seq type_specifiers;
6380 const char *saved_message;
6382 /* Try the declaration first. */
6383 cp_parser_parse_tentatively (parser);
6384 /* New types are not allowed in the type-specifier-seq for a
6386 saved_message = parser->type_definition_forbidden_message;
6387 parser->type_definition_forbidden_message
6388 = "types may not be defined in conditions";
6389 /* Parse the type-specifier-seq. */
6390 cp_parser_type_specifier_seq (parser, /*is_condition==*/true,
6392 /* Restore the saved message. */
6393 parser->type_definition_forbidden_message = saved_message;
6394 /* If all is well, we might be looking at a declaration. */
6395 if (!cp_parser_error_occurred (parser))
6398 tree asm_specification;
6400 cp_declarator *declarator;
6401 tree initializer = NULL_TREE;
6403 /* Parse the declarator. */
6404 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
6405 /*ctor_dtor_or_conv_p=*/NULL,
6406 /*parenthesized_p=*/NULL,
6407 /*member_p=*/false);
6408 /* Parse the attributes. */
6409 attributes = cp_parser_attributes_opt (parser);
6410 /* Parse the asm-specification. */
6411 asm_specification = cp_parser_asm_specification_opt (parser);
6412 /* If the next token is not an `=', then we might still be
6413 looking at an expression. For example:
6417 looks like a decl-specifier-seq and a declarator -- but then
6418 there is no `=', so this is an expression. */
6419 cp_parser_require (parser, CPP_EQ, "`='");
6420 /* If we did see an `=', then we are looking at a declaration
6422 if (cp_parser_parse_definitely (parser))
6426 /* Create the declaration. */
6427 decl = start_decl (declarator, &type_specifiers,
6428 /*initialized_p=*/true,
6429 attributes, /*prefix_attributes=*/NULL_TREE,
6431 /* Parse the assignment-expression. */
6432 initializer = cp_parser_assignment_expression (parser,
6435 /* Process the initializer. */
6436 cp_finish_decl (decl,
6439 LOOKUP_ONLYCONVERTING);
6442 pop_scope (pushed_scope);
6444 return convert_from_reference (decl);
6447 /* If we didn't even get past the declarator successfully, we are
6448 definitely not looking at a declaration. */
6450 cp_parser_abort_tentative_parse (parser);
6452 /* Otherwise, we are looking at an expression. */
6453 return cp_parser_expression (parser, /*cast_p=*/false);
6456 /* Parse an iteration-statement.
6458 iteration-statement:
6459 while ( condition ) statement
6460 do statement while ( expression ) ;
6461 for ( for-init-statement condition [opt] ; expression [opt] )
6464 Returns the new WHILE_STMT, DO_STMT, or FOR_STMT. */
6467 cp_parser_iteration_statement (cp_parser* parser)
6472 bool in_iteration_statement_p;
6475 /* Peek at the next token. */
6476 token = cp_parser_require (parser, CPP_KEYWORD, "iteration-statement");
6478 return error_mark_node;
6480 /* Remember whether or not we are already within an iteration
6482 in_iteration_statement_p = parser->in_iteration_statement_p;
6484 /* See what kind of keyword it is. */
6485 keyword = token->keyword;
6492 /* Begin the while-statement. */
6493 statement = begin_while_stmt ();
6494 /* Look for the `('. */
6495 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6496 /* Parse the condition. */
6497 condition = cp_parser_condition (parser);
6498 finish_while_stmt_cond (condition, statement);
6499 /* Look for the `)'. */
6500 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6501 /* Parse the dependent statement. */
6502 parser->in_iteration_statement_p = true;
6503 cp_parser_already_scoped_statement (parser);
6504 parser->in_iteration_statement_p = in_iteration_statement_p;
6505 /* We're done with the while-statement. */
6506 finish_while_stmt (statement);
6514 /* Begin the do-statement. */
6515 statement = begin_do_stmt ();
6516 /* Parse the body of the do-statement. */
6517 parser->in_iteration_statement_p = true;
6518 cp_parser_implicitly_scoped_statement (parser);
6519 parser->in_iteration_statement_p = in_iteration_statement_p;
6520 finish_do_body (statement);
6521 /* Look for the `while' keyword. */
6522 cp_parser_require_keyword (parser, RID_WHILE, "`while'");
6523 /* Look for the `('. */
6524 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6525 /* Parse the expression. */
6526 expression = cp_parser_expression (parser, /*cast_p=*/false);
6527 /* We're done with the do-statement. */
6528 finish_do_stmt (expression, statement);
6529 /* Look for the `)'. */
6530 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6531 /* Look for the `;'. */
6532 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6538 tree condition = NULL_TREE;
6539 tree expression = NULL_TREE;
6541 /* Begin the for-statement. */
6542 statement = begin_for_stmt ();
6543 /* Look for the `('. */
6544 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
6545 /* Parse the initialization. */
6546 cp_parser_for_init_statement (parser);
6547 finish_for_init_stmt (statement);
6549 /* If there's a condition, process it. */
6550 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6551 condition = cp_parser_condition (parser);
6552 finish_for_cond (condition, statement);
6553 /* Look for the `;'. */
6554 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
6556 /* If there's an expression, process it. */
6557 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
6558 expression = cp_parser_expression (parser, /*cast_p=*/false);
6559 finish_for_expr (expression, statement);
6560 /* Look for the `)'. */
6561 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
6563 /* Parse the body of the for-statement. */
6564 parser->in_iteration_statement_p = true;
6565 cp_parser_already_scoped_statement (parser);
6566 parser->in_iteration_statement_p = in_iteration_statement_p;
6568 /* We're done with the for-statement. */
6569 finish_for_stmt (statement);
6574 cp_parser_error (parser, "expected iteration-statement");
6575 statement = error_mark_node;
6582 /* Parse a for-init-statement.
6585 expression-statement
6586 simple-declaration */
6589 cp_parser_for_init_statement (cp_parser* parser)
6591 /* If the next token is a `;', then we have an empty
6592 expression-statement. Grammatically, this is also a
6593 simple-declaration, but an invalid one, because it does not
6594 declare anything. Therefore, if we did not handle this case
6595 specially, we would issue an error message about an invalid
6597 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6599 /* We're going to speculatively look for a declaration, falling back
6600 to an expression, if necessary. */
6601 cp_parser_parse_tentatively (parser);
6602 /* Parse the declaration. */
6603 cp_parser_simple_declaration (parser,
6604 /*function_definition_allowed_p=*/false);
6605 /* If the tentative parse failed, then we shall need to look for an
6606 expression-statement. */
6607 if (cp_parser_parse_definitely (parser))
6611 cp_parser_expression_statement (parser, false);
6614 /* Parse a jump-statement.
6619 return expression [opt] ;
6627 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
6630 cp_parser_jump_statement (cp_parser* parser)
6632 tree statement = error_mark_node;
6636 /* Peek at the next token. */
6637 token = cp_parser_require (parser, CPP_KEYWORD, "jump-statement");
6639 return error_mark_node;
6641 /* See what kind of keyword it is. */
6642 keyword = token->keyword;
6646 if (!parser->in_switch_statement_p
6647 && !parser->in_iteration_statement_p)
6649 error ("break statement not within loop or switch");
6650 statement = error_mark_node;
6653 statement = finish_break_stmt ();
6654 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
6658 if (!parser->in_iteration_statement_p)
6660 error ("continue statement not within a loop");
6661 statement = error_mark_node;
6664 statement = finish_continue_stmt ();
6665 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
6672 /* If the next token is a `;', then there is no
6674 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
6675 expr = cp_parser_expression (parser, /*cast_p=*/false);
6678 /* Build the return-statement. */
6679 statement = finish_return_stmt (expr);
6680 /* Look for the final `;'. */
6681 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
6686 /* Create the goto-statement. */
6687 if (cp_lexer_next_token_is (parser->lexer, CPP_MULT))
6689 /* Issue a warning about this use of a GNU extension. */
6691 pedwarn ("ISO C++ forbids computed gotos");
6692 /* Consume the '*' token. */
6693 cp_lexer_consume_token (parser->lexer);
6694 /* Parse the dependent expression. */
6695 finish_goto_stmt (cp_parser_expression (parser, /*cast_p=*/false));
6698 finish_goto_stmt (cp_parser_identifier (parser));
6699 /* Look for the final `;'. */
6700 cp_parser_require (parser, CPP_SEMICOLON, "%<;%>");
6704 cp_parser_error (parser, "expected jump-statement");
6711 /* Parse a declaration-statement.
6713 declaration-statement:
6714 block-declaration */
6717 cp_parser_declaration_statement (cp_parser* parser)
6721 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
6722 p = obstack_alloc (&declarator_obstack, 0);
6724 /* Parse the block-declaration. */
6725 cp_parser_block_declaration (parser, /*statement_p=*/true);
6727 /* Free any declarators allocated. */
6728 obstack_free (&declarator_obstack, p);
6730 /* Finish off the statement. */
6734 /* Some dependent statements (like `if (cond) statement'), are
6735 implicitly in their own scope. In other words, if the statement is
6736 a single statement (as opposed to a compound-statement), it is
6737 none-the-less treated as if it were enclosed in braces. Any
6738 declarations appearing in the dependent statement are out of scope
6739 after control passes that point. This function parses a statement,
6740 but ensures that is in its own scope, even if it is not a
6743 Returns the new statement. */
6746 cp_parser_implicitly_scoped_statement (cp_parser* parser)
6750 /* If the token is not a `{', then we must take special action. */
6751 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
6753 /* Create a compound-statement. */
6754 statement = begin_compound_stmt (0);
6755 /* Parse the dependent-statement. */
6756 cp_parser_statement (parser, false);
6757 /* Finish the dummy compound-statement. */
6758 finish_compound_stmt (statement);
6760 /* Otherwise, we simply parse the statement directly. */
6762 statement = cp_parser_compound_statement (parser, NULL, false);
6764 /* Return the statement. */
6768 /* For some dependent statements (like `while (cond) statement'), we
6769 have already created a scope. Therefore, even if the dependent
6770 statement is a compound-statement, we do not want to create another
6774 cp_parser_already_scoped_statement (cp_parser* parser)
6776 /* If the token is a `{', then we must take special action. */
6777 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
6778 cp_parser_statement (parser, false);
6781 /* Avoid calling cp_parser_compound_statement, so that we
6782 don't create a new scope. Do everything else by hand. */
6783 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
6784 cp_parser_statement_seq_opt (parser, false);
6785 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
6789 /* Declarations [gram.dcl.dcl] */
6791 /* Parse an optional declaration-sequence.
6795 declaration-seq declaration */
6798 cp_parser_declaration_seq_opt (cp_parser* parser)
6804 token = cp_lexer_peek_token (parser->lexer);
6806 if (token->type == CPP_CLOSE_BRACE
6807 || token->type == CPP_EOF)
6810 if (token->type == CPP_SEMICOLON)
6812 /* A declaration consisting of a single semicolon is
6813 invalid. Allow it unless we're being pedantic. */
6814 cp_lexer_consume_token (parser->lexer);
6815 if (pedantic && !in_system_header)
6816 pedwarn ("extra %<;%>");
6820 /* If we're entering or exiting a region that's implicitly
6821 extern "C", modify the lang context appropriately. */
6822 if (!parser->implicit_extern_c && token->implicit_extern_c)
6824 push_lang_context (lang_name_c);
6825 parser->implicit_extern_c = true;
6827 else if (parser->implicit_extern_c && !token->implicit_extern_c)
6829 pop_lang_context ();
6830 parser->implicit_extern_c = false;
6833 if (token->type == CPP_PRAGMA)
6835 /* A top-level declaration can consist solely of a #pragma.
6836 A nested declaration cannot, so this is done here and not
6837 in cp_parser_declaration. (A #pragma at block scope is
6838 handled in cp_parser_statement.) */
6839 cp_lexer_handle_pragma (parser->lexer);
6843 /* Parse the declaration itself. */
6844 cp_parser_declaration (parser);
6848 /* Parse a declaration.
6853 template-declaration
6854 explicit-instantiation
6855 explicit-specialization
6856 linkage-specification
6857 namespace-definition
6862 __extension__ declaration */
6865 cp_parser_declaration (cp_parser* parser)
6872 /* Check for the `__extension__' keyword. */
6873 if (cp_parser_extension_opt (parser, &saved_pedantic))
6875 /* Parse the qualified declaration. */
6876 cp_parser_declaration (parser);
6877 /* Restore the PEDANTIC flag. */
6878 pedantic = saved_pedantic;
6883 /* Try to figure out what kind of declaration is present. */
6884 token1 = *cp_lexer_peek_token (parser->lexer);
6886 if (token1.type != CPP_EOF)
6887 token2 = *cp_lexer_peek_nth_token (parser->lexer, 2);
6889 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
6890 p = obstack_alloc (&declarator_obstack, 0);
6892 /* If the next token is `extern' and the following token is a string
6893 literal, then we have a linkage specification. */
6894 if (token1.keyword == RID_EXTERN
6895 && cp_parser_is_string_literal (&token2))
6896 cp_parser_linkage_specification (parser);
6897 /* If the next token is `template', then we have either a template
6898 declaration, an explicit instantiation, or an explicit
6900 else if (token1.keyword == RID_TEMPLATE)
6902 /* `template <>' indicates a template specialization. */
6903 if (token2.type == CPP_LESS
6904 && cp_lexer_peek_nth_token (parser->lexer, 3)->type == CPP_GREATER)
6905 cp_parser_explicit_specialization (parser);
6906 /* `template <' indicates a template declaration. */
6907 else if (token2.type == CPP_LESS)
6908 cp_parser_template_declaration (parser, /*member_p=*/false);
6909 /* Anything else must be an explicit instantiation. */
6911 cp_parser_explicit_instantiation (parser);
6913 /* If the next token is `export', then we have a template
6915 else if (token1.keyword == RID_EXPORT)
6916 cp_parser_template_declaration (parser, /*member_p=*/false);
6917 /* If the next token is `extern', 'static' or 'inline' and the one
6918 after that is `template', we have a GNU extended explicit
6919 instantiation directive. */
6920 else if (cp_parser_allow_gnu_extensions_p (parser)
6921 && (token1.keyword == RID_EXTERN
6922 || token1.keyword == RID_STATIC
6923 || token1.keyword == RID_INLINE)
6924 && token2.keyword == RID_TEMPLATE)
6925 cp_parser_explicit_instantiation (parser);
6926 /* If the next token is `namespace', check for a named or unnamed
6927 namespace definition. */
6928 else if (token1.keyword == RID_NAMESPACE
6929 && (/* A named namespace definition. */
6930 (token2.type == CPP_NAME
6931 && (cp_lexer_peek_nth_token (parser->lexer, 3)->type
6933 /* An unnamed namespace definition. */
6934 || token2.type == CPP_OPEN_BRACE))
6935 cp_parser_namespace_definition (parser);
6936 /* Objective-C++ declaration/definition. */
6937 else if (c_dialect_objc () && OBJC_IS_AT_KEYWORD (token1.keyword))
6938 cp_parser_objc_declaration (parser);
6939 /* We must have either a block declaration or a function
6942 /* Try to parse a block-declaration, or a function-definition. */
6943 cp_parser_block_declaration (parser, /*statement_p=*/false);
6945 /* Free any declarators allocated. */
6946 obstack_free (&declarator_obstack, p);
6949 /* Parse a block-declaration.
6954 namespace-alias-definition
6961 __extension__ block-declaration
6964 If STATEMENT_P is TRUE, then this block-declaration is occurring as
6965 part of a declaration-statement. */
6968 cp_parser_block_declaration (cp_parser *parser,
6974 /* Check for the `__extension__' keyword. */
6975 if (cp_parser_extension_opt (parser, &saved_pedantic))
6977 /* Parse the qualified declaration. */
6978 cp_parser_block_declaration (parser, statement_p);
6979 /* Restore the PEDANTIC flag. */
6980 pedantic = saved_pedantic;
6985 /* Peek at the next token to figure out which kind of declaration is
6987 token1 = cp_lexer_peek_token (parser->lexer);
6989 /* If the next keyword is `asm', we have an asm-definition. */
6990 if (token1->keyword == RID_ASM)
6993 cp_parser_commit_to_tentative_parse (parser);
6994 cp_parser_asm_definition (parser);
6996 /* If the next keyword is `namespace', we have a
6997 namespace-alias-definition. */
6998 else if (token1->keyword == RID_NAMESPACE)
6999 cp_parser_namespace_alias_definition (parser);
7000 /* If the next keyword is `using', we have either a
7001 using-declaration or a using-directive. */
7002 else if (token1->keyword == RID_USING)
7007 cp_parser_commit_to_tentative_parse (parser);
7008 /* If the token after `using' is `namespace', then we have a
7010 token2 = cp_lexer_peek_nth_token (parser->lexer, 2);
7011 if (token2->keyword == RID_NAMESPACE)
7012 cp_parser_using_directive (parser);
7013 /* Otherwise, it's a using-declaration. */
7015 cp_parser_using_declaration (parser);
7017 /* If the next keyword is `__label__' we have a label declaration. */
7018 else if (token1->keyword == RID_LABEL)
7021 cp_parser_commit_to_tentative_parse (parser);
7022 cp_parser_label_declaration (parser);
7024 /* Anything else must be a simple-declaration. */
7026 cp_parser_simple_declaration (parser, !statement_p);
7029 /* Parse a simple-declaration.
7032 decl-specifier-seq [opt] init-declarator-list [opt] ;
7034 init-declarator-list:
7036 init-declarator-list , init-declarator
7038 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
7039 function-definition as a simple-declaration. */
7042 cp_parser_simple_declaration (cp_parser* parser,
7043 bool function_definition_allowed_p)
7045 cp_decl_specifier_seq decl_specifiers;
7046 int declares_class_or_enum;
7047 bool saw_declarator;
7049 /* Defer access checks until we know what is being declared; the
7050 checks for names appearing in the decl-specifier-seq should be
7051 done as if we were in the scope of the thing being declared. */
7052 push_deferring_access_checks (dk_deferred);
7054 /* Parse the decl-specifier-seq. We have to keep track of whether
7055 or not the decl-specifier-seq declares a named class or
7056 enumeration type, since that is the only case in which the
7057 init-declarator-list is allowed to be empty.
7061 In a simple-declaration, the optional init-declarator-list can be
7062 omitted only when declaring a class or enumeration, that is when
7063 the decl-specifier-seq contains either a class-specifier, an
7064 elaborated-type-specifier, or an enum-specifier. */
7065 cp_parser_decl_specifier_seq (parser,
7066 CP_PARSER_FLAGS_OPTIONAL,
7068 &declares_class_or_enum);
7069 /* We no longer need to defer access checks. */
7070 stop_deferring_access_checks ();
7072 /* In a block scope, a valid declaration must always have a
7073 decl-specifier-seq. By not trying to parse declarators, we can
7074 resolve the declaration/expression ambiguity more quickly. */
7075 if (!function_definition_allowed_p
7076 && !decl_specifiers.any_specifiers_p)
7078 cp_parser_error (parser, "expected declaration");
7082 /* If the next two tokens are both identifiers, the code is
7083 erroneous. The usual cause of this situation is code like:
7087 where "T" should name a type -- but does not. */
7088 if (!decl_specifiers.type
7089 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
7091 /* If parsing tentatively, we should commit; we really are
7092 looking at a declaration. */
7093 cp_parser_commit_to_tentative_parse (parser);
7098 /* If we have seen at least one decl-specifier, and the next token
7099 is not a parenthesis, then we must be looking at a declaration.
7100 (After "int (" we might be looking at a functional cast.) */
7101 if (decl_specifiers.any_specifiers_p
7102 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
7103 cp_parser_commit_to_tentative_parse (parser);
7105 /* Keep going until we hit the `;' at the end of the simple
7107 saw_declarator = false;
7108 while (cp_lexer_next_token_is_not (parser->lexer,
7112 bool function_definition_p;
7115 saw_declarator = true;
7116 /* Parse the init-declarator. */
7117 decl = cp_parser_init_declarator (parser, &decl_specifiers,
7118 function_definition_allowed_p,
7120 declares_class_or_enum,
7121 &function_definition_p);
7122 /* If an error occurred while parsing tentatively, exit quickly.
7123 (That usually happens when in the body of a function; each
7124 statement is treated as a declaration-statement until proven
7126 if (cp_parser_error_occurred (parser))
7128 /* Handle function definitions specially. */
7129 if (function_definition_p)
7131 /* If the next token is a `,', then we are probably
7132 processing something like:
7136 which is erroneous. */
7137 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
7138 error ("mixing declarations and function-definitions is forbidden");
7139 /* Otherwise, we're done with the list of declarators. */
7142 pop_deferring_access_checks ();
7146 /* The next token should be either a `,' or a `;'. */
7147 token = cp_lexer_peek_token (parser->lexer);
7148 /* If it's a `,', there are more declarators to come. */
7149 if (token->type == CPP_COMMA)
7150 cp_lexer_consume_token (parser->lexer);
7151 /* If it's a `;', we are done. */
7152 else if (token->type == CPP_SEMICOLON)
7154 /* Anything else is an error. */
7157 /* If we have already issued an error message we don't need
7158 to issue another one. */
7159 if (decl != error_mark_node
7160 || cp_parser_uncommitted_to_tentative_parse_p (parser))
7161 cp_parser_error (parser, "expected %<,%> or %<;%>");
7162 /* Skip tokens until we reach the end of the statement. */
7163 cp_parser_skip_to_end_of_statement (parser);
7164 /* If the next token is now a `;', consume it. */
7165 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
7166 cp_lexer_consume_token (parser->lexer);
7169 /* After the first time around, a function-definition is not
7170 allowed -- even if it was OK at first. For example:
7175 function_definition_allowed_p = false;
7178 /* Issue an error message if no declarators are present, and the
7179 decl-specifier-seq does not itself declare a class or
7181 if (!saw_declarator)
7183 if (cp_parser_declares_only_class_p (parser))
7184 shadow_tag (&decl_specifiers);
7185 /* Perform any deferred access checks. */
7186 perform_deferred_access_checks ();
7189 /* Consume the `;'. */
7190 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
7193 pop_deferring_access_checks ();
7196 /* Parse a decl-specifier-seq.
7199 decl-specifier-seq [opt] decl-specifier
7202 storage-class-specifier
7213 Set *DECL_SPECS to a representation of the decl-specifier-seq.
7215 The parser flags FLAGS is used to control type-specifier parsing.
7217 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
7220 1: one of the decl-specifiers is an elaborated-type-specifier
7221 (i.e., a type declaration)
7222 2: one of the decl-specifiers is an enum-specifier or a
7223 class-specifier (i.e., a type definition)
7228 cp_parser_decl_specifier_seq (cp_parser* parser,
7229 cp_parser_flags flags,
7230 cp_decl_specifier_seq *decl_specs,
7231 int* declares_class_or_enum)
7233 bool constructor_possible_p = !parser->in_declarator_p;
7235 /* Clear DECL_SPECS. */
7236 clear_decl_specs (decl_specs);
7238 /* Assume no class or enumeration type is declared. */
7239 *declares_class_or_enum = 0;
7241 /* Keep reading specifiers until there are no more to read. */
7245 bool found_decl_spec;
7248 /* Peek at the next token. */
7249 token = cp_lexer_peek_token (parser->lexer);
7250 /* Handle attributes. */
7251 if (token->keyword == RID_ATTRIBUTE)
7253 /* Parse the attributes. */
7254 decl_specs->attributes
7255 = chainon (decl_specs->attributes,
7256 cp_parser_attributes_opt (parser));
7259 /* Assume we will find a decl-specifier keyword. */
7260 found_decl_spec = true;
7261 /* If the next token is an appropriate keyword, we can simply
7262 add it to the list. */
7263 switch (token->keyword)
7268 if (decl_specs->specs[(int) ds_friend]++)
7269 error ("duplicate %<friend%>");
7270 /* Consume the token. */
7271 cp_lexer_consume_token (parser->lexer);
7274 /* function-specifier:
7281 cp_parser_function_specifier_opt (parser, decl_specs);
7287 ++decl_specs->specs[(int) ds_typedef];
7288 /* Consume the token. */
7289 cp_lexer_consume_token (parser->lexer);
7290 /* A constructor declarator cannot appear in a typedef. */
7291 constructor_possible_p = false;
7292 /* The "typedef" keyword can only occur in a declaration; we
7293 may as well commit at this point. */
7294 cp_parser_commit_to_tentative_parse (parser);
7297 /* storage-class-specifier:
7307 /* Consume the token. */
7308 cp_lexer_consume_token (parser->lexer);
7309 cp_parser_set_storage_class (decl_specs, sc_auto);
7312 /* Consume the token. */
7313 cp_lexer_consume_token (parser->lexer);
7314 cp_parser_set_storage_class (decl_specs, sc_register);
7317 /* Consume the token. */
7318 cp_lexer_consume_token (parser->lexer);
7319 if (decl_specs->specs[(int) ds_thread])
7321 error ("%<__thread%> before %<static%>");
7322 decl_specs->specs[(int) ds_thread] = 0;
7324 cp_parser_set_storage_class (decl_specs, sc_static);
7327 /* Consume the token. */
7328 cp_lexer_consume_token (parser->lexer);
7329 if (decl_specs->specs[(int) ds_thread])
7331 error ("%<__thread%> before %<extern%>");
7332 decl_specs->specs[(int) ds_thread] = 0;
7334 cp_parser_set_storage_class (decl_specs, sc_extern);
7337 /* Consume the token. */
7338 cp_lexer_consume_token (parser->lexer);
7339 cp_parser_set_storage_class (decl_specs, sc_mutable);
7342 /* Consume the token. */
7343 cp_lexer_consume_token (parser->lexer);
7344 ++decl_specs->specs[(int) ds_thread];
7348 /* We did not yet find a decl-specifier yet. */
7349 found_decl_spec = false;
7353 /* Constructors are a special case. The `S' in `S()' is not a
7354 decl-specifier; it is the beginning of the declarator. */
7357 && constructor_possible_p
7358 && (cp_parser_constructor_declarator_p
7359 (parser, decl_specs->specs[(int) ds_friend] != 0)));
7361 /* If we don't have a DECL_SPEC yet, then we must be looking at
7362 a type-specifier. */
7363 if (!found_decl_spec && !constructor_p)
7365 int decl_spec_declares_class_or_enum;
7366 bool is_cv_qualifier;
7370 = cp_parser_type_specifier (parser, flags,
7372 /*is_declaration=*/true,
7373 &decl_spec_declares_class_or_enum,
7376 *declares_class_or_enum |= decl_spec_declares_class_or_enum;
7378 /* If this type-specifier referenced a user-defined type
7379 (a typedef, class-name, etc.), then we can't allow any
7380 more such type-specifiers henceforth.
7384 The longest sequence of decl-specifiers that could
7385 possibly be a type name is taken as the
7386 decl-specifier-seq of a declaration. The sequence shall
7387 be self-consistent as described below.
7391 As a general rule, at most one type-specifier is allowed
7392 in the complete decl-specifier-seq of a declaration. The
7393 only exceptions are the following:
7395 -- const or volatile can be combined with any other
7398 -- signed or unsigned can be combined with char, long,
7406 void g (const int Pc);
7408 Here, Pc is *not* part of the decl-specifier seq; it's
7409 the declarator. Therefore, once we see a type-specifier
7410 (other than a cv-qualifier), we forbid any additional
7411 user-defined types. We *do* still allow things like `int
7412 int' to be considered a decl-specifier-seq, and issue the
7413 error message later. */
7414 if (type_spec && !is_cv_qualifier)
7415 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
7416 /* A constructor declarator cannot follow a type-specifier. */
7419 constructor_possible_p = false;
7420 found_decl_spec = true;
7424 /* If we still do not have a DECL_SPEC, then there are no more
7426 if (!found_decl_spec)
7429 decl_specs->any_specifiers_p = true;
7430 /* After we see one decl-specifier, further decl-specifiers are
7432 flags |= CP_PARSER_FLAGS_OPTIONAL;
7435 /* Don't allow a friend specifier with a class definition. */
7436 if (decl_specs->specs[(int) ds_friend] != 0
7437 && (*declares_class_or_enum & 2))
7438 error ("class definition may not be declared a friend");
7441 /* Parse an (optional) storage-class-specifier.
7443 storage-class-specifier:
7452 storage-class-specifier:
7455 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
7458 cp_parser_storage_class_specifier_opt (cp_parser* parser)
7460 switch (cp_lexer_peek_token (parser->lexer)->keyword)
7468 /* Consume the token. */
7469 return cp_lexer_consume_token (parser->lexer)->value;
7476 /* Parse an (optional) function-specifier.
7483 Returns an IDENTIFIER_NODE corresponding to the keyword used.
7484 Updates DECL_SPECS, if it is non-NULL. */
7487 cp_parser_function_specifier_opt (cp_parser* parser,
7488 cp_decl_specifier_seq *decl_specs)
7490 switch (cp_lexer_peek_token (parser->lexer)->keyword)
7494 ++decl_specs->specs[(int) ds_inline];
7499 ++decl_specs->specs[(int) ds_virtual];
7504 ++decl_specs->specs[(int) ds_explicit];
7511 /* Consume the token. */
7512 return cp_lexer_consume_token (parser->lexer)->value;
7515 /* Parse a linkage-specification.
7517 linkage-specification:
7518 extern string-literal { declaration-seq [opt] }
7519 extern string-literal declaration */
7522 cp_parser_linkage_specification (cp_parser* parser)
7526 /* Look for the `extern' keyword. */
7527 cp_parser_require_keyword (parser, RID_EXTERN, "`extern'");
7529 /* Look for the string-literal. */
7530 linkage = cp_parser_string_literal (parser, false, false);
7532 /* Transform the literal into an identifier. If the literal is a
7533 wide-character string, or contains embedded NULs, then we can't
7534 handle it as the user wants. */
7535 if (strlen (TREE_STRING_POINTER (linkage))
7536 != (size_t) (TREE_STRING_LENGTH (linkage) - 1))
7538 cp_parser_error (parser, "invalid linkage-specification");
7539 /* Assume C++ linkage. */
7540 linkage = lang_name_cplusplus;
7543 linkage = get_identifier (TREE_STRING_POINTER (linkage));
7545 /* We're now using the new linkage. */
7546 push_lang_context (linkage);
7548 /* If the next token is a `{', then we're using the first
7550 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
7552 /* Consume the `{' token. */
7553 cp_lexer_consume_token (parser->lexer);
7554 /* Parse the declarations. */
7555 cp_parser_declaration_seq_opt (parser);
7556 /* Look for the closing `}'. */
7557 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
7559 /* Otherwise, there's just one declaration. */
7562 bool saved_in_unbraced_linkage_specification_p;
7564 saved_in_unbraced_linkage_specification_p
7565 = parser->in_unbraced_linkage_specification_p;
7566 parser->in_unbraced_linkage_specification_p = true;
7567 have_extern_spec = true;
7568 cp_parser_declaration (parser);
7569 have_extern_spec = false;
7570 parser->in_unbraced_linkage_specification_p
7571 = saved_in_unbraced_linkage_specification_p;
7574 /* We're done with the linkage-specification. */
7575 pop_lang_context ();
7578 /* Special member functions [gram.special] */
7580 /* Parse a conversion-function-id.
7582 conversion-function-id:
7583 operator conversion-type-id
7585 Returns an IDENTIFIER_NODE representing the operator. */
7588 cp_parser_conversion_function_id (cp_parser* parser)
7592 tree saved_qualifying_scope;
7593 tree saved_object_scope;
7594 tree pushed_scope = NULL_TREE;
7596 /* Look for the `operator' token. */
7597 if (!cp_parser_require_keyword (parser, RID_OPERATOR, "`operator'"))
7598 return error_mark_node;
7599 /* When we parse the conversion-type-id, the current scope will be
7600 reset. However, we need that information in able to look up the
7601 conversion function later, so we save it here. */
7602 saved_scope = parser->scope;
7603 saved_qualifying_scope = parser->qualifying_scope;
7604 saved_object_scope = parser->object_scope;
7605 /* We must enter the scope of the class so that the names of
7606 entities declared within the class are available in the
7607 conversion-type-id. For example, consider:
7614 S::operator I() { ... }
7616 In order to see that `I' is a type-name in the definition, we
7617 must be in the scope of `S'. */
7619 pushed_scope = push_scope (saved_scope);
7620 /* Parse the conversion-type-id. */
7621 type = cp_parser_conversion_type_id (parser);
7622 /* Leave the scope of the class, if any. */
7624 pop_scope (pushed_scope);
7625 /* Restore the saved scope. */
7626 parser->scope = saved_scope;
7627 parser->qualifying_scope = saved_qualifying_scope;
7628 parser->object_scope = saved_object_scope;
7629 /* If the TYPE is invalid, indicate failure. */
7630 if (type == error_mark_node)
7631 return error_mark_node;
7632 return mangle_conv_op_name_for_type (type);
7635 /* Parse a conversion-type-id:
7638 type-specifier-seq conversion-declarator [opt]
7640 Returns the TYPE specified. */
7643 cp_parser_conversion_type_id (cp_parser* parser)
7646 cp_decl_specifier_seq type_specifiers;
7647 cp_declarator *declarator;
7648 tree type_specified;
7650 /* Parse the attributes. */
7651 attributes = cp_parser_attributes_opt (parser);
7652 /* Parse the type-specifiers. */
7653 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
7655 /* If that didn't work, stop. */
7656 if (type_specifiers.type == error_mark_node)
7657 return error_mark_node;
7658 /* Parse the conversion-declarator. */
7659 declarator = cp_parser_conversion_declarator_opt (parser);
7661 type_specified = grokdeclarator (declarator, &type_specifiers, TYPENAME,
7662 /*initialized=*/0, &attributes);
7664 cplus_decl_attributes (&type_specified, attributes, /*flags=*/0);
7665 return type_specified;
7668 /* Parse an (optional) conversion-declarator.
7670 conversion-declarator:
7671 ptr-operator conversion-declarator [opt]
7675 static cp_declarator *
7676 cp_parser_conversion_declarator_opt (cp_parser* parser)
7678 enum tree_code code;
7680 cp_cv_quals cv_quals;
7682 /* We don't know if there's a ptr-operator next, or not. */
7683 cp_parser_parse_tentatively (parser);
7684 /* Try the ptr-operator. */
7685 code = cp_parser_ptr_operator (parser, &class_type, &cv_quals);
7686 /* If it worked, look for more conversion-declarators. */
7687 if (cp_parser_parse_definitely (parser))
7689 cp_declarator *declarator;
7691 /* Parse another optional declarator. */
7692 declarator = cp_parser_conversion_declarator_opt (parser);
7694 /* Create the representation of the declarator. */
7696 declarator = make_ptrmem_declarator (cv_quals, class_type,
7698 else if (code == INDIRECT_REF)
7699 declarator = make_pointer_declarator (cv_quals, declarator);
7701 declarator = make_reference_declarator (cv_quals, declarator);
7709 /* Parse an (optional) ctor-initializer.
7712 : mem-initializer-list
7714 Returns TRUE iff the ctor-initializer was actually present. */
7717 cp_parser_ctor_initializer_opt (cp_parser* parser)
7719 /* If the next token is not a `:', then there is no
7720 ctor-initializer. */
7721 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
7723 /* Do default initialization of any bases and members. */
7724 if (DECL_CONSTRUCTOR_P (current_function_decl))
7725 finish_mem_initializers (NULL_TREE);
7730 /* Consume the `:' token. */
7731 cp_lexer_consume_token (parser->lexer);
7732 /* And the mem-initializer-list. */
7733 cp_parser_mem_initializer_list (parser);
7738 /* Parse a mem-initializer-list.
7740 mem-initializer-list:
7742 mem-initializer , mem-initializer-list */
7745 cp_parser_mem_initializer_list (cp_parser* parser)
7747 tree mem_initializer_list = NULL_TREE;
7749 /* Let the semantic analysis code know that we are starting the
7750 mem-initializer-list. */
7751 if (!DECL_CONSTRUCTOR_P (current_function_decl))
7752 error ("only constructors take base initializers");
7754 /* Loop through the list. */
7757 tree mem_initializer;
7759 /* Parse the mem-initializer. */
7760 mem_initializer = cp_parser_mem_initializer (parser);
7761 /* Add it to the list, unless it was erroneous. */
7762 if (mem_initializer)
7764 TREE_CHAIN (mem_initializer) = mem_initializer_list;
7765 mem_initializer_list = mem_initializer;
7767 /* If the next token is not a `,', we're done. */
7768 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
7770 /* Consume the `,' token. */
7771 cp_lexer_consume_token (parser->lexer);
7774 /* Perform semantic analysis. */
7775 if (DECL_CONSTRUCTOR_P (current_function_decl))
7776 finish_mem_initializers (mem_initializer_list);
7779 /* Parse a mem-initializer.
7782 mem-initializer-id ( expression-list [opt] )
7787 ( expression-list [opt] )
7789 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
7790 class) or FIELD_DECL (for a non-static data member) to initialize;
7791 the TREE_VALUE is the expression-list. */
7794 cp_parser_mem_initializer (cp_parser* parser)
7796 tree mem_initializer_id;
7797 tree expression_list;
7800 /* Find out what is being initialized. */
7801 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
7803 pedwarn ("anachronistic old-style base class initializer");
7804 mem_initializer_id = NULL_TREE;
7807 mem_initializer_id = cp_parser_mem_initializer_id (parser);
7808 member = expand_member_init (mem_initializer_id);
7809 if (member && !DECL_P (member))
7810 in_base_initializer = 1;
7813 = cp_parser_parenthesized_expression_list (parser, false,
7815 /*non_constant_p=*/NULL);
7816 if (!expression_list)
7817 expression_list = void_type_node;
7819 in_base_initializer = 0;
7821 return member ? build_tree_list (member, expression_list) : NULL_TREE;
7824 /* Parse a mem-initializer-id.
7827 :: [opt] nested-name-specifier [opt] class-name
7830 Returns a TYPE indicating the class to be initializer for the first
7831 production. Returns an IDENTIFIER_NODE indicating the data member
7832 to be initialized for the second production. */
7835 cp_parser_mem_initializer_id (cp_parser* parser)
7837 bool global_scope_p;
7838 bool nested_name_specifier_p;
7839 bool template_p = false;
7842 /* `typename' is not allowed in this context ([temp.res]). */
7843 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
7845 error ("keyword %<typename%> not allowed in this context (a qualified "
7846 "member initializer is implicitly a type)");
7847 cp_lexer_consume_token (parser->lexer);
7849 /* Look for the optional `::' operator. */
7851 = (cp_parser_global_scope_opt (parser,
7852 /*current_scope_valid_p=*/false)
7854 /* Look for the optional nested-name-specifier. The simplest way to
7859 The keyword `typename' is not permitted in a base-specifier or
7860 mem-initializer; in these contexts a qualified name that
7861 depends on a template-parameter is implicitly assumed to be a
7864 is to assume that we have seen the `typename' keyword at this
7866 nested_name_specifier_p
7867 = (cp_parser_nested_name_specifier_opt (parser,
7868 /*typename_keyword_p=*/true,
7869 /*check_dependency_p=*/true,
7871 /*is_declaration=*/true)
7873 if (nested_name_specifier_p)
7874 template_p = cp_parser_optional_template_keyword (parser);
7875 /* If there is a `::' operator or a nested-name-specifier, then we
7876 are definitely looking for a class-name. */
7877 if (global_scope_p || nested_name_specifier_p)
7878 return cp_parser_class_name (parser,
7879 /*typename_keyword_p=*/true,
7880 /*template_keyword_p=*/template_p,
7882 /*check_dependency_p=*/true,
7883 /*class_head_p=*/false,
7884 /*is_declaration=*/true);
7885 /* Otherwise, we could also be looking for an ordinary identifier. */
7886 cp_parser_parse_tentatively (parser);
7887 /* Try a class-name. */
7888 id = cp_parser_class_name (parser,
7889 /*typename_keyword_p=*/true,
7890 /*template_keyword_p=*/false,
7892 /*check_dependency_p=*/true,
7893 /*class_head_p=*/false,
7894 /*is_declaration=*/true);
7895 /* If we found one, we're done. */
7896 if (cp_parser_parse_definitely (parser))
7898 /* Otherwise, look for an ordinary identifier. */
7899 return cp_parser_identifier (parser);
7902 /* Overloading [gram.over] */
7904 /* Parse an operator-function-id.
7906 operator-function-id:
7909 Returns an IDENTIFIER_NODE for the operator which is a
7910 human-readable spelling of the identifier, e.g., `operator +'. */
7913 cp_parser_operator_function_id (cp_parser* parser)
7915 /* Look for the `operator' keyword. */
7916 if (!cp_parser_require_keyword (parser, RID_OPERATOR, "`operator'"))
7917 return error_mark_node;
7918 /* And then the name of the operator itself. */
7919 return cp_parser_operator (parser);
7922 /* Parse an operator.
7925 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
7926 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
7927 || ++ -- , ->* -> () []
7934 Returns an IDENTIFIER_NODE for the operator which is a
7935 human-readable spelling of the identifier, e.g., `operator +'. */
7938 cp_parser_operator (cp_parser* parser)
7940 tree id = NULL_TREE;
7943 /* Peek at the next token. */
7944 token = cp_lexer_peek_token (parser->lexer);
7945 /* Figure out which operator we have. */
7946 switch (token->type)
7952 /* The keyword should be either `new' or `delete'. */
7953 if (token->keyword == RID_NEW)
7955 else if (token->keyword == RID_DELETE)
7960 /* Consume the `new' or `delete' token. */
7961 cp_lexer_consume_token (parser->lexer);
7963 /* Peek at the next token. */
7964 token = cp_lexer_peek_token (parser->lexer);
7965 /* If it's a `[' token then this is the array variant of the
7967 if (token->type == CPP_OPEN_SQUARE)
7969 /* Consume the `[' token. */
7970 cp_lexer_consume_token (parser->lexer);
7971 /* Look for the `]' token. */
7972 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
7973 id = ansi_opname (op == NEW_EXPR
7974 ? VEC_NEW_EXPR : VEC_DELETE_EXPR);
7976 /* Otherwise, we have the non-array variant. */
7978 id = ansi_opname (op);
7984 id = ansi_opname (PLUS_EXPR);
7988 id = ansi_opname (MINUS_EXPR);
7992 id = ansi_opname (MULT_EXPR);
7996 id = ansi_opname (TRUNC_DIV_EXPR);
8000 id = ansi_opname (TRUNC_MOD_EXPR);
8004 id = ansi_opname (BIT_XOR_EXPR);
8008 id = ansi_opname (BIT_AND_EXPR);
8012 id = ansi_opname (BIT_IOR_EXPR);
8016 id = ansi_opname (BIT_NOT_EXPR);
8020 id = ansi_opname (TRUTH_NOT_EXPR);
8024 id = ansi_assopname (NOP_EXPR);
8028 id = ansi_opname (LT_EXPR);
8032 id = ansi_opname (GT_EXPR);
8036 id = ansi_assopname (PLUS_EXPR);
8040 id = ansi_assopname (MINUS_EXPR);
8044 id = ansi_assopname (MULT_EXPR);
8048 id = ansi_assopname (TRUNC_DIV_EXPR);
8052 id = ansi_assopname (TRUNC_MOD_EXPR);
8056 id = ansi_assopname (BIT_XOR_EXPR);
8060 id = ansi_assopname (BIT_AND_EXPR);
8064 id = ansi_assopname (BIT_IOR_EXPR);
8068 id = ansi_opname (LSHIFT_EXPR);
8072 id = ansi_opname (RSHIFT_EXPR);
8076 id = ansi_assopname (LSHIFT_EXPR);
8080 id = ansi_assopname (RSHIFT_EXPR);
8084 id = ansi_opname (EQ_EXPR);
8088 id = ansi_opname (NE_EXPR);
8092 id = ansi_opname (LE_EXPR);
8095 case CPP_GREATER_EQ:
8096 id = ansi_opname (GE_EXPR);
8100 id = ansi_opname (TRUTH_ANDIF_EXPR);
8104 id = ansi_opname (TRUTH_ORIF_EXPR);
8108 id = ansi_opname (POSTINCREMENT_EXPR);
8111 case CPP_MINUS_MINUS:
8112 id = ansi_opname (PREDECREMENT_EXPR);
8116 id = ansi_opname (COMPOUND_EXPR);
8119 case CPP_DEREF_STAR:
8120 id = ansi_opname (MEMBER_REF);
8124 id = ansi_opname (COMPONENT_REF);
8127 case CPP_OPEN_PAREN:
8128 /* Consume the `('. */
8129 cp_lexer_consume_token (parser->lexer);
8130 /* Look for the matching `)'. */
8131 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
8132 return ansi_opname (CALL_EXPR);
8134 case CPP_OPEN_SQUARE:
8135 /* Consume the `['. */
8136 cp_lexer_consume_token (parser->lexer);
8137 /* Look for the matching `]'. */
8138 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
8139 return ansi_opname (ARRAY_REF);
8143 id = ansi_opname (MIN_EXPR);
8144 cp_parser_warn_min_max ();
8148 id = ansi_opname (MAX_EXPR);
8149 cp_parser_warn_min_max ();
8153 id = ansi_assopname (MIN_EXPR);
8154 cp_parser_warn_min_max ();
8158 id = ansi_assopname (MAX_EXPR);
8159 cp_parser_warn_min_max ();
8163 /* Anything else is an error. */
8167 /* If we have selected an identifier, we need to consume the
8170 cp_lexer_consume_token (parser->lexer);
8171 /* Otherwise, no valid operator name was present. */
8174 cp_parser_error (parser, "expected operator");
8175 id = error_mark_node;
8181 /* Parse a template-declaration.
8183 template-declaration:
8184 export [opt] template < template-parameter-list > declaration
8186 If MEMBER_P is TRUE, this template-declaration occurs within a
8189 The grammar rule given by the standard isn't correct. What
8192 template-declaration:
8193 export [opt] template-parameter-list-seq
8194 decl-specifier-seq [opt] init-declarator [opt] ;
8195 export [opt] template-parameter-list-seq
8198 template-parameter-list-seq:
8199 template-parameter-list-seq [opt]
8200 template < template-parameter-list > */
8203 cp_parser_template_declaration (cp_parser* parser, bool member_p)
8205 /* Check for `export'. */
8206 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXPORT))
8208 /* Consume the `export' token. */
8209 cp_lexer_consume_token (parser->lexer);
8210 /* Warn that we do not support `export'. */
8211 warning (0, "keyword %<export%> not implemented, and will be ignored");
8214 cp_parser_template_declaration_after_export (parser, member_p);
8217 /* Parse a template-parameter-list.
8219 template-parameter-list:
8221 template-parameter-list , template-parameter
8223 Returns a TREE_LIST. Each node represents a template parameter.
8224 The nodes are connected via their TREE_CHAINs. */
8227 cp_parser_template_parameter_list (cp_parser* parser)
8229 tree parameter_list = NULL_TREE;
8237 /* Parse the template-parameter. */
8238 parameter = cp_parser_template_parameter (parser, &is_non_type);
8239 /* Add it to the list. */
8240 if (parameter != error_mark_node)
8241 parameter_list = process_template_parm (parameter_list,
8244 /* Peek at the next token. */
8245 token = cp_lexer_peek_token (parser->lexer);
8246 /* If it's not a `,', we're done. */
8247 if (token->type != CPP_COMMA)
8249 /* Otherwise, consume the `,' token. */
8250 cp_lexer_consume_token (parser->lexer);
8253 return parameter_list;
8256 /* Parse a template-parameter.
8260 parameter-declaration
8262 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
8263 the parameter. The TREE_PURPOSE is the default value, if any.
8264 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
8265 iff this parameter is a non-type parameter. */
8268 cp_parser_template_parameter (cp_parser* parser, bool *is_non_type)
8271 cp_parameter_declarator *parameter_declarator;
8274 /* Assume it is a type parameter or a template parameter. */
8275 *is_non_type = false;
8276 /* Peek at the next token. */
8277 token = cp_lexer_peek_token (parser->lexer);
8278 /* If it is `class' or `template', we have a type-parameter. */
8279 if (token->keyword == RID_TEMPLATE)
8280 return cp_parser_type_parameter (parser);
8281 /* If it is `class' or `typename' we do not know yet whether it is a
8282 type parameter or a non-type parameter. Consider:
8284 template <typename T, typename T::X X> ...
8288 template <class C, class D*> ...
8290 Here, the first parameter is a type parameter, and the second is
8291 a non-type parameter. We can tell by looking at the token after
8292 the identifier -- if it is a `,', `=', or `>' then we have a type
8294 if (token->keyword == RID_TYPENAME || token->keyword == RID_CLASS)
8296 /* Peek at the token after `class' or `typename'. */
8297 token = cp_lexer_peek_nth_token (parser->lexer, 2);
8298 /* If it's an identifier, skip it. */
8299 if (token->type == CPP_NAME)
8300 token = cp_lexer_peek_nth_token (parser->lexer, 3);
8301 /* Now, see if the token looks like the end of a template
8303 if (token->type == CPP_COMMA
8304 || token->type == CPP_EQ
8305 || token->type == CPP_GREATER)
8306 return cp_parser_type_parameter (parser);
8309 /* Otherwise, it is a non-type parameter.
8313 When parsing a default template-argument for a non-type
8314 template-parameter, the first non-nested `>' is taken as the end
8315 of the template parameter-list rather than a greater-than
8317 *is_non_type = true;
8318 parameter_declarator
8319 = cp_parser_parameter_declaration (parser, /*template_parm_p=*/true,
8320 /*parenthesized_p=*/NULL);
8321 parm = grokdeclarator (parameter_declarator->declarator,
8322 ¶meter_declarator->decl_specifiers,
8323 PARM, /*initialized=*/0,
8325 if (parm == error_mark_node)
8326 return error_mark_node;
8327 return build_tree_list (parameter_declarator->default_argument, parm);
8330 /* Parse a type-parameter.
8333 class identifier [opt]
8334 class identifier [opt] = type-id
8335 typename identifier [opt]
8336 typename identifier [opt] = type-id
8337 template < template-parameter-list > class identifier [opt]
8338 template < template-parameter-list > class identifier [opt]
8341 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
8342 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
8343 the declaration of the parameter. */
8346 cp_parser_type_parameter (cp_parser* parser)
8351 /* Look for a keyword to tell us what kind of parameter this is. */
8352 token = cp_parser_require (parser, CPP_KEYWORD,
8353 "`class', `typename', or `template'");
8355 return error_mark_node;
8357 switch (token->keyword)
8363 tree default_argument;
8365 /* If the next token is an identifier, then it names the
8367 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
8368 identifier = cp_parser_identifier (parser);
8370 identifier = NULL_TREE;
8372 /* Create the parameter. */
8373 parameter = finish_template_type_parm (class_type_node, identifier);
8375 /* If the next token is an `=', we have a default argument. */
8376 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
8378 /* Consume the `=' token. */
8379 cp_lexer_consume_token (parser->lexer);
8380 /* Parse the default-argument. */
8381 default_argument = cp_parser_type_id (parser);
8384 default_argument = NULL_TREE;
8386 /* Create the combined representation of the parameter and the
8387 default argument. */
8388 parameter = build_tree_list (default_argument, parameter);
8394 tree parameter_list;
8396 tree default_argument;
8398 /* Look for the `<'. */
8399 cp_parser_require (parser, CPP_LESS, "`<'");
8400 /* Parse the template-parameter-list. */
8401 begin_template_parm_list ();
8403 = cp_parser_template_parameter_list (parser);
8404 parameter_list = end_template_parm_list (parameter_list);
8405 /* Look for the `>'. */
8406 cp_parser_require (parser, CPP_GREATER, "`>'");
8407 /* Look for the `class' keyword. */
8408 cp_parser_require_keyword (parser, RID_CLASS, "`class'");
8409 /* If the next token is an `=', then there is a
8410 default-argument. If the next token is a `>', we are at
8411 the end of the parameter-list. If the next token is a `,',
8412 then we are at the end of this parameter. */
8413 if (cp_lexer_next_token_is_not (parser->lexer, CPP_EQ)
8414 && cp_lexer_next_token_is_not (parser->lexer, CPP_GREATER)
8415 && cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
8417 identifier = cp_parser_identifier (parser);
8418 /* Treat invalid names as if the parameter were nameless. */
8419 if (identifier == error_mark_node)
8420 identifier = NULL_TREE;
8423 identifier = NULL_TREE;
8425 /* Create the template parameter. */
8426 parameter = finish_template_template_parm (class_type_node,
8429 /* If the next token is an `=', then there is a
8430 default-argument. */
8431 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
8435 /* Consume the `='. */
8436 cp_lexer_consume_token (parser->lexer);
8437 /* Parse the id-expression. */
8439 = cp_parser_id_expression (parser,
8440 /*template_keyword_p=*/false,
8441 /*check_dependency_p=*/true,
8442 /*template_p=*/&is_template,
8443 /*declarator_p=*/false);
8444 if (TREE_CODE (default_argument) == TYPE_DECL)
8445 /* If the id-expression was a template-id that refers to
8446 a template-class, we already have the declaration here,
8447 so no further lookup is needed. */
8450 /* Look up the name. */
8452 = cp_parser_lookup_name (parser, default_argument,
8454 /*is_template=*/is_template,
8455 /*is_namespace=*/false,
8456 /*check_dependency=*/true,
8457 /*ambiguous_p=*/NULL);
8458 /* See if the default argument is valid. */
8460 = check_template_template_default_arg (default_argument);
8463 default_argument = NULL_TREE;
8465 /* Create the combined representation of the parameter and the
8466 default argument. */
8467 parameter = build_tree_list (default_argument, parameter);
8479 /* Parse a template-id.
8482 template-name < template-argument-list [opt] >
8484 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
8485 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
8486 returned. Otherwise, if the template-name names a function, or set
8487 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
8488 names a class, returns a TYPE_DECL for the specialization.
8490 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
8491 uninstantiated templates. */
8494 cp_parser_template_id (cp_parser *parser,
8495 bool template_keyword_p,
8496 bool check_dependency_p,
8497 bool is_declaration)
8502 cp_token_position start_of_id = 0;
8503 tree access_check = NULL_TREE;
8504 cp_token *next_token, *next_token_2;
8507 /* If the next token corresponds to a template-id, there is no need
8509 next_token = cp_lexer_peek_token (parser->lexer);
8510 if (next_token->type == CPP_TEMPLATE_ID)
8515 /* Get the stored value. */
8516 value = cp_lexer_consume_token (parser->lexer)->value;
8517 /* Perform any access checks that were deferred. */
8518 for (check = TREE_PURPOSE (value); check; check = TREE_CHAIN (check))
8519 perform_or_defer_access_check (TREE_PURPOSE (check),
8520 TREE_VALUE (check));
8521 /* Return the stored value. */
8522 return TREE_VALUE (value);
8525 /* Avoid performing name lookup if there is no possibility of
8526 finding a template-id. */
8527 if ((next_token->type != CPP_NAME && next_token->keyword != RID_OPERATOR)
8528 || (next_token->type == CPP_NAME
8529 && !cp_parser_nth_token_starts_template_argument_list_p
8532 cp_parser_error (parser, "expected template-id");
8533 return error_mark_node;
8536 /* Remember where the template-id starts. */
8537 if (cp_parser_uncommitted_to_tentative_parse_p (parser))
8538 start_of_id = cp_lexer_token_position (parser->lexer, false);
8540 push_deferring_access_checks (dk_deferred);
8542 /* Parse the template-name. */
8543 is_identifier = false;
8544 template = cp_parser_template_name (parser, template_keyword_p,
8548 if (template == error_mark_node || is_identifier)
8550 pop_deferring_access_checks ();
8554 /* If we find the sequence `[:' after a template-name, it's probably
8555 a digraph-typo for `< ::'. Substitute the tokens and check if we can
8556 parse correctly the argument list. */
8557 next_token = cp_lexer_peek_token (parser->lexer);
8558 next_token_2 = cp_lexer_peek_nth_token (parser->lexer, 2);
8559 if (next_token->type == CPP_OPEN_SQUARE
8560 && next_token->flags & DIGRAPH
8561 && next_token_2->type == CPP_COLON
8562 && !(next_token_2->flags & PREV_WHITE))
8564 cp_parser_parse_tentatively (parser);
8565 /* Change `:' into `::'. */
8566 next_token_2->type = CPP_SCOPE;
8567 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
8569 cp_lexer_consume_token (parser->lexer);
8570 /* Parse the arguments. */
8571 arguments = cp_parser_enclosed_template_argument_list (parser);
8572 if (!cp_parser_parse_definitely (parser))
8574 /* If we couldn't parse an argument list, then we revert our changes
8575 and return simply an error. Maybe this is not a template-id
8577 next_token_2->type = CPP_COLON;
8578 cp_parser_error (parser, "expected %<<%>");
8579 pop_deferring_access_checks ();
8580 return error_mark_node;
8582 /* Otherwise, emit an error about the invalid digraph, but continue
8583 parsing because we got our argument list. */
8584 pedwarn ("%<<::%> cannot begin a template-argument list");
8585 inform ("%<<:%> is an alternate spelling for %<[%>. Insert whitespace "
8586 "between %<<%> and %<::%>");
8587 if (!flag_permissive)
8592 inform ("(if you use -fpermissive G++ will accept your code)");
8599 /* Look for the `<' that starts the template-argument-list. */
8600 if (!cp_parser_require (parser, CPP_LESS, "`<'"))
8602 pop_deferring_access_checks ();
8603 return error_mark_node;
8605 /* Parse the arguments. */
8606 arguments = cp_parser_enclosed_template_argument_list (parser);
8609 /* Build a representation of the specialization. */
8610 if (TREE_CODE (template) == IDENTIFIER_NODE)
8611 template_id = build_min_nt (TEMPLATE_ID_EXPR, template, arguments);
8612 else if (DECL_CLASS_TEMPLATE_P (template)
8613 || DECL_TEMPLATE_TEMPLATE_PARM_P (template))
8615 = finish_template_type (template, arguments,
8616 cp_lexer_next_token_is (parser->lexer,
8620 /* If it's not a class-template or a template-template, it should be
8621 a function-template. */
8622 gcc_assert ((DECL_FUNCTION_TEMPLATE_P (template)
8623 || TREE_CODE (template) == OVERLOAD
8624 || BASELINK_P (template)));
8626 template_id = lookup_template_function (template, arguments);
8629 /* Retrieve any deferred checks. Do not pop this access checks yet
8630 so the memory will not be reclaimed during token replacing below. */
8631 access_check = get_deferred_access_checks ();
8633 /* If parsing tentatively, replace the sequence of tokens that makes
8634 up the template-id with a CPP_TEMPLATE_ID token. That way,
8635 should we re-parse the token stream, we will not have to repeat
8636 the effort required to do the parse, nor will we issue duplicate
8637 error messages about problems during instantiation of the
8641 cp_token *token = cp_lexer_token_at (parser->lexer, start_of_id);
8643 /* Reset the contents of the START_OF_ID token. */
8644 token->type = CPP_TEMPLATE_ID;
8645 token->value = build_tree_list (access_check, template_id);
8646 token->keyword = RID_MAX;
8648 /* Purge all subsequent tokens. */
8649 cp_lexer_purge_tokens_after (parser->lexer, start_of_id);
8651 /* ??? Can we actually assume that, if template_id ==
8652 error_mark_node, we will have issued a diagnostic to the
8653 user, as opposed to simply marking the tentative parse as
8655 if (cp_parser_error_occurred (parser) && template_id != error_mark_node)
8656 error ("parse error in template argument list");
8659 pop_deferring_access_checks ();
8663 /* Parse a template-name.
8668 The standard should actually say:
8672 operator-function-id
8674 A defect report has been filed about this issue.
8676 A conversion-function-id cannot be a template name because they cannot
8677 be part of a template-id. In fact, looking at this code:
8681 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
8682 It is impossible to call a templated conversion-function-id with an
8683 explicit argument list, since the only allowed template parameter is
8684 the type to which it is converting.
8686 If TEMPLATE_KEYWORD_P is true, then we have just seen the
8687 `template' keyword, in a construction like:
8691 In that case `f' is taken to be a template-name, even though there
8692 is no way of knowing for sure.
8694 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
8695 name refers to a set of overloaded functions, at least one of which
8696 is a template, or an IDENTIFIER_NODE with the name of the template,
8697 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
8698 names are looked up inside uninstantiated templates. */
8701 cp_parser_template_name (cp_parser* parser,
8702 bool template_keyword_p,
8703 bool check_dependency_p,
8704 bool is_declaration,
8705 bool *is_identifier)
8711 /* If the next token is `operator', then we have either an
8712 operator-function-id or a conversion-function-id. */
8713 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_OPERATOR))
8715 /* We don't know whether we're looking at an
8716 operator-function-id or a conversion-function-id. */
8717 cp_parser_parse_tentatively (parser);
8718 /* Try an operator-function-id. */
8719 identifier = cp_parser_operator_function_id (parser);
8720 /* If that didn't work, try a conversion-function-id. */
8721 if (!cp_parser_parse_definitely (parser))
8723 cp_parser_error (parser, "expected template-name");
8724 return error_mark_node;
8727 /* Look for the identifier. */
8729 identifier = cp_parser_identifier (parser);
8731 /* If we didn't find an identifier, we don't have a template-id. */
8732 if (identifier == error_mark_node)
8733 return error_mark_node;
8735 /* If the name immediately followed the `template' keyword, then it
8736 is a template-name. However, if the next token is not `<', then
8737 we do not treat it as a template-name, since it is not being used
8738 as part of a template-id. This enables us to handle constructs
8741 template <typename T> struct S { S(); };
8742 template <typename T> S<T>::S();
8744 correctly. We would treat `S' as a template -- if it were `S<T>'
8745 -- but we do not if there is no `<'. */
8747 if (processing_template_decl
8748 && cp_parser_nth_token_starts_template_argument_list_p (parser, 1))
8750 /* In a declaration, in a dependent context, we pretend that the
8751 "template" keyword was present in order to improve error
8752 recovery. For example, given:
8754 template <typename T> void f(T::X<int>);
8756 we want to treat "X<int>" as a template-id. */
8758 && !template_keyword_p
8759 && parser->scope && TYPE_P (parser->scope)
8760 && check_dependency_p
8761 && dependent_type_p (parser->scope)
8762 /* Do not do this for dtors (or ctors), since they never
8763 need the template keyword before their name. */
8764 && !constructor_name_p (identifier, parser->scope))
8766 cp_token_position start = 0;
8768 /* Explain what went wrong. */
8769 error ("non-template %qD used as template", identifier);
8770 inform ("use %<%T::template %D%> to indicate that it is a template",
8771 parser->scope, identifier);
8772 /* If parsing tentatively, find the location of the "<" token. */
8773 if (cp_parser_simulate_error (parser))
8774 start = cp_lexer_token_position (parser->lexer, true);
8775 /* Parse the template arguments so that we can issue error
8776 messages about them. */
8777 cp_lexer_consume_token (parser->lexer);
8778 cp_parser_enclosed_template_argument_list (parser);
8779 /* Skip tokens until we find a good place from which to
8780 continue parsing. */
8781 cp_parser_skip_to_closing_parenthesis (parser,
8782 /*recovering=*/true,
8784 /*consume_paren=*/false);
8785 /* If parsing tentatively, permanently remove the
8786 template argument list. That will prevent duplicate
8787 error messages from being issued about the missing
8788 "template" keyword. */
8790 cp_lexer_purge_tokens_after (parser->lexer, start);
8792 *is_identifier = true;
8796 /* If the "template" keyword is present, then there is generally
8797 no point in doing name-lookup, so we just return IDENTIFIER.
8798 But, if the qualifying scope is non-dependent then we can
8799 (and must) do name-lookup normally. */
8800 if (template_keyword_p
8802 || (TYPE_P (parser->scope)
8803 && dependent_type_p (parser->scope))))
8807 /* Look up the name. */
8808 decl = cp_parser_lookup_name (parser, identifier,
8810 /*is_template=*/false,
8811 /*is_namespace=*/false,
8813 /*ambiguous_p=*/NULL);
8814 decl = maybe_get_template_decl_from_type_decl (decl);
8816 /* If DECL is a template, then the name was a template-name. */
8817 if (TREE_CODE (decl) == TEMPLATE_DECL)
8821 tree fn = NULL_TREE;
8823 /* The standard does not explicitly indicate whether a name that
8824 names a set of overloaded declarations, some of which are
8825 templates, is a template-name. However, such a name should
8826 be a template-name; otherwise, there is no way to form a
8827 template-id for the overloaded templates. */
8828 fns = BASELINK_P (decl) ? BASELINK_FUNCTIONS (decl) : decl;
8829 if (TREE_CODE (fns) == OVERLOAD)
8830 for (fn = fns; fn; fn = OVL_NEXT (fn))
8831 if (TREE_CODE (OVL_CURRENT (fn)) == TEMPLATE_DECL)
8836 /* The name does not name a template. */
8837 cp_parser_error (parser, "expected template-name");
8838 return error_mark_node;
8842 /* If DECL is dependent, and refers to a function, then just return
8843 its name; we will look it up again during template instantiation. */
8844 if (DECL_FUNCTION_TEMPLATE_P (decl) || !DECL_P (decl))
8846 tree scope = CP_DECL_CONTEXT (get_first_fn (decl));
8847 if (TYPE_P (scope) && dependent_type_p (scope))
8854 /* Parse a template-argument-list.
8856 template-argument-list:
8858 template-argument-list , template-argument
8860 Returns a TREE_VEC containing the arguments. */
8863 cp_parser_template_argument_list (cp_parser* parser)
8865 tree fixed_args[10];
8866 unsigned n_args = 0;
8867 unsigned alloced = 10;
8868 tree *arg_ary = fixed_args;
8870 bool saved_in_template_argument_list_p;
8872 saved_in_template_argument_list_p = parser->in_template_argument_list_p;
8873 parser->in_template_argument_list_p = true;
8879 /* Consume the comma. */
8880 cp_lexer_consume_token (parser->lexer);
8882 /* Parse the template-argument. */
8883 argument = cp_parser_template_argument (parser);
8884 if (n_args == alloced)
8888 if (arg_ary == fixed_args)
8890 arg_ary = xmalloc (sizeof (tree) * alloced);
8891 memcpy (arg_ary, fixed_args, sizeof (tree) * n_args);
8894 arg_ary = xrealloc (arg_ary, sizeof (tree) * alloced);
8896 arg_ary[n_args++] = argument;
8898 while (cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
8900 vec = make_tree_vec (n_args);
8903 TREE_VEC_ELT (vec, n_args) = arg_ary[n_args];
8905 if (arg_ary != fixed_args)
8907 parser->in_template_argument_list_p = saved_in_template_argument_list_p;
8911 /* Parse a template-argument.
8914 assignment-expression
8918 The representation is that of an assignment-expression, type-id, or
8919 id-expression -- except that the qualified id-expression is
8920 evaluated, so that the value returned is either a DECL or an
8923 Although the standard says "assignment-expression", it forbids
8924 throw-expressions or assignments in the template argument.
8925 Therefore, we use "conditional-expression" instead. */
8928 cp_parser_template_argument (cp_parser* parser)
8933 bool maybe_type_id = false;
8936 tree qualifying_class;
8938 /* There's really no way to know what we're looking at, so we just
8939 try each alternative in order.
8943 In a template-argument, an ambiguity between a type-id and an
8944 expression is resolved to a type-id, regardless of the form of
8945 the corresponding template-parameter.
8947 Therefore, we try a type-id first. */
8948 cp_parser_parse_tentatively (parser);
8949 argument = cp_parser_type_id (parser);
8950 /* If there was no error parsing the type-id but the next token is a '>>',
8951 we probably found a typo for '> >'. But there are type-id which are
8952 also valid expressions. For instance:
8954 struct X { int operator >> (int); };
8955 template <int V> struct Foo {};
8958 Here 'X()' is a valid type-id of a function type, but the user just
8959 wanted to write the expression "X() >> 5". Thus, we remember that we
8960 found a valid type-id, but we still try to parse the argument as an
8961 expression to see what happens. */
8962 if (!cp_parser_error_occurred (parser)
8963 && cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
8965 maybe_type_id = true;
8966 cp_parser_abort_tentative_parse (parser);
8970 /* If the next token isn't a `,' or a `>', then this argument wasn't
8971 really finished. This means that the argument is not a valid
8973 if (!cp_parser_next_token_ends_template_argument_p (parser))
8974 cp_parser_error (parser, "expected template-argument");
8975 /* If that worked, we're done. */
8976 if (cp_parser_parse_definitely (parser))
8979 /* We're still not sure what the argument will be. */
8980 cp_parser_parse_tentatively (parser);
8981 /* Try a template. */
8982 argument = cp_parser_id_expression (parser,
8983 /*template_keyword_p=*/false,
8984 /*check_dependency_p=*/true,
8986 /*declarator_p=*/false);
8987 /* If the next token isn't a `,' or a `>', then this argument wasn't
8989 if (!cp_parser_next_token_ends_template_argument_p (parser))
8990 cp_parser_error (parser, "expected template-argument");
8991 if (!cp_parser_error_occurred (parser))
8993 /* Figure out what is being referred to. If the id-expression
8994 was for a class template specialization, then we will have a
8995 TYPE_DECL at this point. There is no need to do name lookup
8996 at this point in that case. */
8997 if (TREE_CODE (argument) != TYPE_DECL)
8998 argument = cp_parser_lookup_name (parser, argument,
9000 /*is_template=*/template_p,
9001 /*is_namespace=*/false,
9002 /*check_dependency=*/true,
9003 /*ambiguous_p=*/NULL);
9004 if (TREE_CODE (argument) != TEMPLATE_DECL
9005 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
9006 cp_parser_error (parser, "expected template-name");
9008 if (cp_parser_parse_definitely (parser))
9010 /* It must be a non-type argument. There permitted cases are given
9011 in [temp.arg.nontype]:
9013 -- an integral constant-expression of integral or enumeration
9016 -- the name of a non-type template-parameter; or
9018 -- the name of an object or function with external linkage...
9020 -- the address of an object or function with external linkage...
9022 -- a pointer to member... */
9023 /* Look for a non-type template parameter. */
9024 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
9026 cp_parser_parse_tentatively (parser);
9027 argument = cp_parser_primary_expression (parser,
9031 if (TREE_CODE (argument) != TEMPLATE_PARM_INDEX
9032 || !cp_parser_next_token_ends_template_argument_p (parser))
9033 cp_parser_simulate_error (parser);
9034 if (cp_parser_parse_definitely (parser))
9038 /* If the next token is "&", the argument must be the address of an
9039 object or function with external linkage. */
9040 address_p = cp_lexer_next_token_is (parser->lexer, CPP_AND);
9042 cp_lexer_consume_token (parser->lexer);
9043 /* See if we might have an id-expression. */
9044 token = cp_lexer_peek_token (parser->lexer);
9045 if (token->type == CPP_NAME
9046 || token->keyword == RID_OPERATOR
9047 || token->type == CPP_SCOPE
9048 || token->type == CPP_TEMPLATE_ID
9049 || token->type == CPP_NESTED_NAME_SPECIFIER)
9051 cp_parser_parse_tentatively (parser);
9052 argument = cp_parser_primary_expression (parser,
9056 if (cp_parser_error_occurred (parser)
9057 || !cp_parser_next_token_ends_template_argument_p (parser))
9058 cp_parser_abort_tentative_parse (parser);
9061 if (TREE_CODE (argument) == INDIRECT_REF)
9063 gcc_assert (REFERENCE_REF_P (argument));
9064 argument = TREE_OPERAND (argument, 0);
9067 if (qualifying_class)
9068 argument = finish_qualified_id_expr (qualifying_class,
9072 if (TREE_CODE (argument) == VAR_DECL)
9074 /* A variable without external linkage might still be a
9075 valid constant-expression, so no error is issued here
9076 if the external-linkage check fails. */
9077 if (!DECL_EXTERNAL_LINKAGE_P (argument))
9078 cp_parser_simulate_error (parser);
9080 else if (is_overloaded_fn (argument))
9081 /* All overloaded functions are allowed; if the external
9082 linkage test does not pass, an error will be issued
9086 && (TREE_CODE (argument) == OFFSET_REF
9087 || TREE_CODE (argument) == SCOPE_REF))
9088 /* A pointer-to-member. */
9090 else if (TREE_CODE (argument) == TEMPLATE_PARM_INDEX)
9093 cp_parser_simulate_error (parser);
9095 if (cp_parser_parse_definitely (parser))
9098 argument = build_x_unary_op (ADDR_EXPR, argument);
9103 /* If the argument started with "&", there are no other valid
9104 alternatives at this point. */
9107 cp_parser_error (parser, "invalid non-type template argument");
9108 return error_mark_node;
9111 /* If the argument wasn't successfully parsed as a type-id followed
9112 by '>>', the argument can only be a constant expression now.
9113 Otherwise, we try parsing the constant-expression tentatively,
9114 because the argument could really be a type-id. */
9116 cp_parser_parse_tentatively (parser);
9117 argument = cp_parser_constant_expression (parser,
9118 /*allow_non_constant_p=*/false,
9119 /*non_constant_p=*/NULL);
9120 argument = fold_non_dependent_expr (argument);
9123 if (!cp_parser_next_token_ends_template_argument_p (parser))
9124 cp_parser_error (parser, "expected template-argument");
9125 if (cp_parser_parse_definitely (parser))
9127 /* We did our best to parse the argument as a non type-id, but that
9128 was the only alternative that matched (albeit with a '>' after
9129 it). We can assume it's just a typo from the user, and a
9130 diagnostic will then be issued. */
9131 return cp_parser_type_id (parser);
9134 /* Parse an explicit-instantiation.
9136 explicit-instantiation:
9137 template declaration
9139 Although the standard says `declaration', what it really means is:
9141 explicit-instantiation:
9142 template decl-specifier-seq [opt] declarator [opt] ;
9144 Things like `template int S<int>::i = 5, int S<double>::j;' are not
9145 supposed to be allowed. A defect report has been filed about this
9150 explicit-instantiation:
9151 storage-class-specifier template
9152 decl-specifier-seq [opt] declarator [opt] ;
9153 function-specifier template
9154 decl-specifier-seq [opt] declarator [opt] ; */
9157 cp_parser_explicit_instantiation (cp_parser* parser)
9159 int declares_class_or_enum;
9160 cp_decl_specifier_seq decl_specifiers;
9161 tree extension_specifier = NULL_TREE;
9163 /* Look for an (optional) storage-class-specifier or
9164 function-specifier. */
9165 if (cp_parser_allow_gnu_extensions_p (parser))
9168 = cp_parser_storage_class_specifier_opt (parser);
9169 if (!extension_specifier)
9171 = cp_parser_function_specifier_opt (parser,
9172 /*decl_specs=*/NULL);
9175 /* Look for the `template' keyword. */
9176 cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'");
9177 /* Let the front end know that we are processing an explicit
9179 begin_explicit_instantiation ();
9180 /* [temp.explicit] says that we are supposed to ignore access
9181 control while processing explicit instantiation directives. */
9182 push_deferring_access_checks (dk_no_check);
9183 /* Parse a decl-specifier-seq. */
9184 cp_parser_decl_specifier_seq (parser,
9185 CP_PARSER_FLAGS_OPTIONAL,
9187 &declares_class_or_enum);
9188 /* If there was exactly one decl-specifier, and it declared a class,
9189 and there's no declarator, then we have an explicit type
9191 if (declares_class_or_enum && cp_parser_declares_only_class_p (parser))
9195 type = check_tag_decl (&decl_specifiers);
9196 /* Turn access control back on for names used during
9197 template instantiation. */
9198 pop_deferring_access_checks ();
9200 do_type_instantiation (type, extension_specifier, /*complain=*/1);
9204 cp_declarator *declarator;
9207 /* Parse the declarator. */
9209 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
9210 /*ctor_dtor_or_conv_p=*/NULL,
9211 /*parenthesized_p=*/NULL,
9212 /*member_p=*/false);
9213 if (declares_class_or_enum & 2)
9214 cp_parser_check_for_definition_in_return_type (declarator,
9215 decl_specifiers.type);
9216 if (declarator != cp_error_declarator)
9218 decl = grokdeclarator (declarator, &decl_specifiers,
9220 /* Turn access control back on for names used during
9221 template instantiation. */
9222 pop_deferring_access_checks ();
9223 /* Do the explicit instantiation. */
9224 do_decl_instantiation (decl, extension_specifier);
9228 pop_deferring_access_checks ();
9229 /* Skip the body of the explicit instantiation. */
9230 cp_parser_skip_to_end_of_statement (parser);
9233 /* We're done with the instantiation. */
9234 end_explicit_instantiation ();
9236 cp_parser_consume_semicolon_at_end_of_statement (parser);
9239 /* Parse an explicit-specialization.
9241 explicit-specialization:
9242 template < > declaration
9244 Although the standard says `declaration', what it really means is:
9246 explicit-specialization:
9247 template <> decl-specifier [opt] init-declarator [opt] ;
9248 template <> function-definition
9249 template <> explicit-specialization
9250 template <> template-declaration */
9253 cp_parser_explicit_specialization (cp_parser* parser)
9255 /* Look for the `template' keyword. */
9256 cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'");
9257 /* Look for the `<'. */
9258 cp_parser_require (parser, CPP_LESS, "`<'");
9259 /* Look for the `>'. */
9260 cp_parser_require (parser, CPP_GREATER, "`>'");
9261 /* We have processed another parameter list. */
9262 ++parser->num_template_parameter_lists;
9263 /* Let the front end know that we are beginning a specialization. */
9264 begin_specialization ();
9266 /* If the next keyword is `template', we need to figure out whether
9267 or not we're looking a template-declaration. */
9268 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
9270 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_LESS
9271 && cp_lexer_peek_nth_token (parser->lexer, 3)->type != CPP_GREATER)
9272 cp_parser_template_declaration_after_export (parser,
9273 /*member_p=*/false);
9275 cp_parser_explicit_specialization (parser);
9278 /* Parse the dependent declaration. */
9279 cp_parser_single_declaration (parser,
9283 /* We're done with the specialization. */
9284 end_specialization ();
9285 /* We're done with this parameter list. */
9286 --parser->num_template_parameter_lists;
9289 /* Parse a type-specifier.
9292 simple-type-specifier
9295 elaborated-type-specifier
9303 Returns a representation of the type-specifier. For a
9304 class-specifier, enum-specifier, or elaborated-type-specifier, a
9305 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
9307 The parser flags FLAGS is used to control type-specifier parsing.
9309 If IS_DECLARATION is TRUE, then this type-specifier is appearing
9310 in a decl-specifier-seq.
9312 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
9313 class-specifier, enum-specifier, or elaborated-type-specifier, then
9314 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
9315 if a type is declared; 2 if it is defined. Otherwise, it is set to
9318 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
9319 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
9323 cp_parser_type_specifier (cp_parser* parser,
9324 cp_parser_flags flags,
9325 cp_decl_specifier_seq *decl_specs,
9326 bool is_declaration,
9327 int* declares_class_or_enum,
9328 bool* is_cv_qualifier)
9330 tree type_spec = NULL_TREE;
9333 cp_decl_spec ds = ds_last;
9335 /* Assume this type-specifier does not declare a new type. */
9336 if (declares_class_or_enum)
9337 *declares_class_or_enum = 0;
9338 /* And that it does not specify a cv-qualifier. */
9339 if (is_cv_qualifier)
9340 *is_cv_qualifier = false;
9341 /* Peek at the next token. */
9342 token = cp_lexer_peek_token (parser->lexer);
9344 /* If we're looking at a keyword, we can use that to guide the
9345 production we choose. */
9346 keyword = token->keyword;
9350 /* 'enum' [identifier] '{' introduces an enum-specifier;
9351 'enum' <anything else> introduces an elaborated-type-specifier. */
9352 if (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_OPEN_BRACE
9353 || (cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_NAME
9354 && cp_lexer_peek_nth_token (parser->lexer, 3)->type
9357 if (parser->num_template_parameter_lists)
9359 error ("template declaration of %qs", "enum");
9360 cp_parser_skip_to_end_of_block_or_statement (parser);
9361 type_spec = error_mark_node;
9364 type_spec = cp_parser_enum_specifier (parser);
9366 if (declares_class_or_enum)
9367 *declares_class_or_enum = 2;
9369 cp_parser_set_decl_spec_type (decl_specs,
9371 /*user_defined_p=*/true);
9375 goto elaborated_type_specifier;
9377 /* Any of these indicate either a class-specifier, or an
9378 elaborated-type-specifier. */
9382 /* Parse tentatively so that we can back up if we don't find a
9384 cp_parser_parse_tentatively (parser);
9385 /* Look for the class-specifier. */
9386 type_spec = cp_parser_class_specifier (parser);
9387 /* If that worked, we're done. */
9388 if (cp_parser_parse_definitely (parser))
9390 if (declares_class_or_enum)
9391 *declares_class_or_enum = 2;
9393 cp_parser_set_decl_spec_type (decl_specs,
9395 /*user_defined_p=*/true);
9400 elaborated_type_specifier:
9401 /* We're declaring (not defining) a class or enum. */
9402 if (declares_class_or_enum)
9403 *declares_class_or_enum = 1;
9407 /* Look for an elaborated-type-specifier. */
9409 = (cp_parser_elaborated_type_specifier
9411 decl_specs && decl_specs->specs[(int) ds_friend],
9414 cp_parser_set_decl_spec_type (decl_specs,
9416 /*user_defined_p=*/true);
9421 if (is_cv_qualifier)
9422 *is_cv_qualifier = true;
9427 if (is_cv_qualifier)
9428 *is_cv_qualifier = true;
9433 if (is_cv_qualifier)
9434 *is_cv_qualifier = true;
9438 /* The `__complex__' keyword is a GNU extension. */
9446 /* Handle simple keywords. */
9451 ++decl_specs->specs[(int)ds];
9452 decl_specs->any_specifiers_p = true;
9454 return cp_lexer_consume_token (parser->lexer)->value;
9457 /* If we do not already have a type-specifier, assume we are looking
9458 at a simple-type-specifier. */
9459 type_spec = cp_parser_simple_type_specifier (parser,
9463 /* If we didn't find a type-specifier, and a type-specifier was not
9464 optional in this context, issue an error message. */
9465 if (!type_spec && !(flags & CP_PARSER_FLAGS_OPTIONAL))
9467 cp_parser_error (parser, "expected type specifier");
9468 return error_mark_node;
9474 /* Parse a simple-type-specifier.
9476 simple-type-specifier:
9477 :: [opt] nested-name-specifier [opt] type-name
9478 :: [opt] nested-name-specifier template template-id
9493 simple-type-specifier:
9494 __typeof__ unary-expression
9495 __typeof__ ( type-id )
9497 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
9498 appropriately updated. */
9501 cp_parser_simple_type_specifier (cp_parser* parser,
9502 cp_decl_specifier_seq *decl_specs,
9503 cp_parser_flags flags)
9505 tree type = NULL_TREE;
9508 /* Peek at the next token. */
9509 token = cp_lexer_peek_token (parser->lexer);
9511 /* If we're looking at a keyword, things are easy. */
9512 switch (token->keyword)
9516 decl_specs->explicit_char_p = true;
9517 type = char_type_node;
9520 type = wchar_type_node;
9523 type = boolean_type_node;
9527 ++decl_specs->specs[(int) ds_short];
9528 type = short_integer_type_node;
9532 decl_specs->explicit_int_p = true;
9533 type = integer_type_node;
9537 ++decl_specs->specs[(int) ds_long];
9538 type = long_integer_type_node;
9542 ++decl_specs->specs[(int) ds_signed];
9543 type = integer_type_node;
9547 ++decl_specs->specs[(int) ds_unsigned];
9548 type = unsigned_type_node;
9551 type = float_type_node;
9554 type = double_type_node;
9557 type = void_type_node;
9561 /* Consume the `typeof' token. */
9562 cp_lexer_consume_token (parser->lexer);
9563 /* Parse the operand to `typeof'. */
9564 type = cp_parser_sizeof_operand (parser, RID_TYPEOF);
9565 /* If it is not already a TYPE, take its type. */
9567 type = finish_typeof (type);
9570 cp_parser_set_decl_spec_type (decl_specs, type,
9571 /*user_defined_p=*/true);
9579 /* If the type-specifier was for a built-in type, we're done. */
9584 /* Record the type. */
9586 && (token->keyword != RID_SIGNED
9587 && token->keyword != RID_UNSIGNED
9588 && token->keyword != RID_SHORT
9589 && token->keyword != RID_LONG))
9590 cp_parser_set_decl_spec_type (decl_specs,
9592 /*user_defined=*/false);
9594 decl_specs->any_specifiers_p = true;
9596 /* Consume the token. */
9597 id = cp_lexer_consume_token (parser->lexer)->value;
9599 /* There is no valid C++ program where a non-template type is
9600 followed by a "<". That usually indicates that the user thought
9601 that the type was a template. */
9602 cp_parser_check_for_invalid_template_id (parser, type);
9604 return TYPE_NAME (type);
9607 /* The type-specifier must be a user-defined type. */
9608 if (!(flags & CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES))
9613 /* Don't gobble tokens or issue error messages if this is an
9614 optional type-specifier. */
9615 if (flags & CP_PARSER_FLAGS_OPTIONAL)
9616 cp_parser_parse_tentatively (parser);
9618 /* Look for the optional `::' operator. */
9620 = (cp_parser_global_scope_opt (parser,
9621 /*current_scope_valid_p=*/false)
9623 /* Look for the nested-name specifier. */
9625 = (cp_parser_nested_name_specifier_opt (parser,
9626 /*typename_keyword_p=*/false,
9627 /*check_dependency_p=*/true,
9629 /*is_declaration=*/false)
9631 /* If we have seen a nested-name-specifier, and the next token
9632 is `template', then we are using the template-id production. */
9634 && cp_parser_optional_template_keyword (parser))
9636 /* Look for the template-id. */
9637 type = cp_parser_template_id (parser,
9638 /*template_keyword_p=*/true,
9639 /*check_dependency_p=*/true,
9640 /*is_declaration=*/false);
9641 /* If the template-id did not name a type, we are out of
9643 if (TREE_CODE (type) != TYPE_DECL)
9645 cp_parser_error (parser, "expected template-id for type");
9649 /* Otherwise, look for a type-name. */
9651 type = cp_parser_type_name (parser);
9652 /* Keep track of all name-lookups performed in class scopes. */
9656 && TREE_CODE (type) == TYPE_DECL
9657 && TREE_CODE (DECL_NAME (type)) == IDENTIFIER_NODE)
9658 maybe_note_name_used_in_class (DECL_NAME (type), type);
9659 /* If it didn't work out, we don't have a TYPE. */
9660 if ((flags & CP_PARSER_FLAGS_OPTIONAL)
9661 && !cp_parser_parse_definitely (parser))
9663 if (type && decl_specs)
9664 cp_parser_set_decl_spec_type (decl_specs, type,
9665 /*user_defined=*/true);
9668 /* If we didn't get a type-name, issue an error message. */
9669 if (!type && !(flags & CP_PARSER_FLAGS_OPTIONAL))
9671 cp_parser_error (parser, "expected type-name");
9672 return error_mark_node;
9675 /* There is no valid C++ program where a non-template type is
9676 followed by a "<". That usually indicates that the user thought
9677 that the type was a template. */
9678 if (type && type != error_mark_node)
9680 /* As a last-ditch effort, see if TYPE is an Objective-C type.
9681 If it is, then the '<'...'>' enclose protocol names rather than
9682 template arguments, and so everything is fine. */
9683 if (c_dialect_objc ()
9684 && (objc_is_id (type) || objc_is_class_name (type)))
9686 tree protos = cp_parser_objc_protocol_refs_opt (parser);
9687 tree qual_type = objc_get_protocol_qualified_type (type, protos);
9689 /* Clobber the "unqualified" type previously entered into
9690 DECL_SPECS with the new, improved protocol-qualifed version. */
9692 decl_specs->type = qual_type;
9697 cp_parser_check_for_invalid_template_id (parser, TREE_TYPE (type));
9703 /* Parse a type-name.
9716 Returns a TYPE_DECL for the type. */
9719 cp_parser_type_name (cp_parser* parser)
9724 /* We can't know yet whether it is a class-name or not. */
9725 cp_parser_parse_tentatively (parser);
9726 /* Try a class-name. */
9727 type_decl = cp_parser_class_name (parser,
9728 /*typename_keyword_p=*/false,
9729 /*template_keyword_p=*/false,
9731 /*check_dependency_p=*/true,
9732 /*class_head_p=*/false,
9733 /*is_declaration=*/false);
9734 /* If it's not a class-name, keep looking. */
9735 if (!cp_parser_parse_definitely (parser))
9737 /* It must be a typedef-name or an enum-name. */
9738 identifier = cp_parser_identifier (parser);
9739 if (identifier == error_mark_node)
9740 return error_mark_node;
9742 /* Look up the type-name. */
9743 type_decl = cp_parser_lookup_name_simple (parser, identifier);
9745 if (TREE_CODE (type_decl) != TYPE_DECL
9746 && (objc_is_id (identifier) || objc_is_class_name (identifier)))
9748 /* See if this is an Objective-C type. */
9749 tree protos = cp_parser_objc_protocol_refs_opt (parser);
9750 tree type = objc_get_protocol_qualified_type (identifier, protos);
9752 type_decl = TYPE_NAME (type);
9755 /* Issue an error if we did not find a type-name. */
9756 if (TREE_CODE (type_decl) != TYPE_DECL)
9758 if (!cp_parser_simulate_error (parser))
9759 cp_parser_name_lookup_error (parser, identifier, type_decl,
9761 type_decl = error_mark_node;
9763 /* Remember that the name was used in the definition of the
9764 current class so that we can check later to see if the
9765 meaning would have been different after the class was
9766 entirely defined. */
9767 else if (type_decl != error_mark_node
9769 maybe_note_name_used_in_class (identifier, type_decl);
9776 /* Parse an elaborated-type-specifier. Note that the grammar given
9777 here incorporates the resolution to DR68.
9779 elaborated-type-specifier:
9780 class-key :: [opt] nested-name-specifier [opt] identifier
9781 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
9782 enum :: [opt] nested-name-specifier [opt] identifier
9783 typename :: [opt] nested-name-specifier identifier
9784 typename :: [opt] nested-name-specifier template [opt]
9789 elaborated-type-specifier:
9790 class-key attributes :: [opt] nested-name-specifier [opt] identifier
9791 class-key attributes :: [opt] nested-name-specifier [opt]
9792 template [opt] template-id
9793 enum attributes :: [opt] nested-name-specifier [opt] identifier
9795 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
9796 declared `friend'. If IS_DECLARATION is TRUE, then this
9797 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
9798 something is being declared.
9800 Returns the TYPE specified. */
9803 cp_parser_elaborated_type_specifier (cp_parser* parser,
9805 bool is_declaration)
9807 enum tag_types tag_type;
9809 tree type = NULL_TREE;
9810 tree attributes = NULL_TREE;
9812 /* See if we're looking at the `enum' keyword. */
9813 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ENUM))
9815 /* Consume the `enum' token. */
9816 cp_lexer_consume_token (parser->lexer);
9817 /* Remember that it's an enumeration type. */
9818 tag_type = enum_type;
9819 /* Parse the attributes. */
9820 attributes = cp_parser_attributes_opt (parser);
9822 /* Or, it might be `typename'. */
9823 else if (cp_lexer_next_token_is_keyword (parser->lexer,
9826 /* Consume the `typename' token. */
9827 cp_lexer_consume_token (parser->lexer);
9828 /* Remember that it's a `typename' type. */
9829 tag_type = typename_type;
9830 /* The `typename' keyword is only allowed in templates. */
9831 if (!processing_template_decl)
9832 pedwarn ("using %<typename%> outside of template");
9834 /* Otherwise it must be a class-key. */
9837 tag_type = cp_parser_class_key (parser);
9838 if (tag_type == none_type)
9839 return error_mark_node;
9840 /* Parse the attributes. */
9841 attributes = cp_parser_attributes_opt (parser);
9844 /* Look for the `::' operator. */
9845 cp_parser_global_scope_opt (parser,
9846 /*current_scope_valid_p=*/false);
9847 /* Look for the nested-name-specifier. */
9848 if (tag_type == typename_type)
9850 if (cp_parser_nested_name_specifier (parser,
9851 /*typename_keyword_p=*/true,
9852 /*check_dependency_p=*/true,
9856 return error_mark_node;
9859 /* Even though `typename' is not present, the proposed resolution
9860 to Core Issue 180 says that in `class A<T>::B', `B' should be
9861 considered a type-name, even if `A<T>' is dependent. */
9862 cp_parser_nested_name_specifier_opt (parser,
9863 /*typename_keyword_p=*/true,
9864 /*check_dependency_p=*/true,
9867 /* For everything but enumeration types, consider a template-id. */
9868 if (tag_type != enum_type)
9870 bool template_p = false;
9873 /* Allow the `template' keyword. */
9874 template_p = cp_parser_optional_template_keyword (parser);
9875 /* If we didn't see `template', we don't know if there's a
9876 template-id or not. */
9878 cp_parser_parse_tentatively (parser);
9879 /* Parse the template-id. */
9880 decl = cp_parser_template_id (parser, template_p,
9881 /*check_dependency_p=*/true,
9883 /* If we didn't find a template-id, look for an ordinary
9885 if (!template_p && !cp_parser_parse_definitely (parser))
9887 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
9888 in effect, then we must assume that, upon instantiation, the
9889 template will correspond to a class. */
9890 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
9891 && tag_type == typename_type)
9892 type = make_typename_type (parser->scope, decl,
9896 type = TREE_TYPE (decl);
9899 /* For an enumeration type, consider only a plain identifier. */
9902 identifier = cp_parser_identifier (parser);
9904 if (identifier == error_mark_node)
9906 parser->scope = NULL_TREE;
9907 return error_mark_node;
9910 /* For a `typename', we needn't call xref_tag. */
9911 if (tag_type == typename_type
9912 && TREE_CODE (parser->scope) != NAMESPACE_DECL)
9913 return cp_parser_make_typename_type (parser, parser->scope,
9915 /* Look up a qualified name in the usual way. */
9920 decl = cp_parser_lookup_name (parser, identifier,
9922 /*is_template=*/false,
9923 /*is_namespace=*/false,
9924 /*check_dependency=*/true,
9925 /*ambiguous_p=*/NULL);
9927 /* If we are parsing friend declaration, DECL may be a
9928 TEMPLATE_DECL tree node here. However, we need to check
9929 whether this TEMPLATE_DECL results in valid code. Consider
9930 the following example:
9933 template <class T> class C {};
9936 template <class T> friend class N::C; // #1, valid code
9938 template <class T> class Y {
9939 friend class N::C; // #2, invalid code
9942 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
9943 name lookup of `N::C'. We see that friend declaration must
9944 be template for the code to be valid. Note that
9945 processing_template_decl does not work here since it is
9946 always 1 for the above two cases. */
9948 decl = (cp_parser_maybe_treat_template_as_class
9949 (decl, /*tag_name_p=*/is_friend
9950 && parser->num_template_parameter_lists));
9952 if (TREE_CODE (decl) != TYPE_DECL)
9954 cp_parser_diagnose_invalid_type_name (parser,
9957 return error_mark_node;
9960 if (TREE_CODE (TREE_TYPE (decl)) != TYPENAME_TYPE)
9961 check_elaborated_type_specifier
9963 (parser->num_template_parameter_lists
9964 || DECL_SELF_REFERENCE_P (decl)));
9966 type = TREE_TYPE (decl);
9970 /* An elaborated-type-specifier sometimes introduces a new type and
9971 sometimes names an existing type. Normally, the rule is that it
9972 introduces a new type only if there is not an existing type of
9973 the same name already in scope. For example, given:
9976 void f() { struct S s; }
9978 the `struct S' in the body of `f' is the same `struct S' as in
9979 the global scope; the existing definition is used. However, if
9980 there were no global declaration, this would introduce a new
9981 local class named `S'.
9983 An exception to this rule applies to the following code:
9985 namespace N { struct S; }
9987 Here, the elaborated-type-specifier names a new type
9988 unconditionally; even if there is already an `S' in the
9989 containing scope this declaration names a new type.
9990 This exception only applies if the elaborated-type-specifier
9991 forms the complete declaration:
9995 A declaration consisting solely of `class-key identifier ;' is
9996 either a redeclaration of the name in the current scope or a
9997 forward declaration of the identifier as a class name. It
9998 introduces the name into the current scope.
10000 We are in this situation precisely when the next token is a `;'.
10002 An exception to the exception is that a `friend' declaration does
10003 *not* name a new type; i.e., given:
10005 struct S { friend struct T; };
10007 `T' is not a new type in the scope of `S'.
10009 Also, `new struct S' or `sizeof (struct S)' never results in the
10010 definition of a new type; a new type can only be declared in a
10011 declaration context. */
10015 /* Friends have special name lookup rules. */
10016 ts = ts_within_enclosing_non_class;
10017 else if (is_declaration
10018 && cp_lexer_next_token_is (parser->lexer,
10020 /* This is a `class-key identifier ;' */
10025 /* Warn about attributes. They are ignored. */
10027 warning (0, "type attributes are honored only at type definition");
10029 type = xref_tag (tag_type, identifier, ts,
10030 parser->num_template_parameter_lists);
10033 if (tag_type != enum_type)
10034 cp_parser_check_class_key (tag_type, type);
10036 /* A "<" cannot follow an elaborated type specifier. If that
10037 happens, the user was probably trying to form a template-id. */
10038 cp_parser_check_for_invalid_template_id (parser, type);
10043 /* Parse an enum-specifier.
10046 enum identifier [opt] { enumerator-list [opt] }
10049 enum identifier [opt] { enumerator-list [opt] } attributes
10051 Returns an ENUM_TYPE representing the enumeration. */
10054 cp_parser_enum_specifier (cp_parser* parser)
10059 /* Caller guarantees that the current token is 'enum', an identifier
10060 possibly follows, and the token after that is an opening brace.
10061 If we don't have an identifier, fabricate an anonymous name for
10062 the enumeration being defined. */
10063 cp_lexer_consume_token (parser->lexer);
10065 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
10066 identifier = cp_parser_identifier (parser);
10068 identifier = make_anon_name ();
10070 /* Issue an error message if type-definitions are forbidden here. */
10071 cp_parser_check_type_definition (parser);
10073 /* Create the new type. We do this before consuming the opening brace
10074 so the enum will be recorded as being on the line of its tag (or the
10075 'enum' keyword, if there is no tag). */
10076 type = start_enum (identifier);
10078 /* Consume the opening brace. */
10079 cp_lexer_consume_token (parser->lexer);
10081 /* If the next token is not '}', then there are some enumerators. */
10082 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
10083 cp_parser_enumerator_list (parser, type);
10085 /* Consume the final '}'. */
10086 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
10088 /* Look for trailing attributes to apply to this enumeration, and
10089 apply them if appropriate. */
10090 if (cp_parser_allow_gnu_extensions_p (parser))
10092 tree trailing_attr = cp_parser_attributes_opt (parser);
10093 cplus_decl_attributes (&type,
10095 (int) ATTR_FLAG_TYPE_IN_PLACE);
10098 /* Finish up the enumeration. */
10099 finish_enum (type);
10104 /* Parse an enumerator-list. The enumerators all have the indicated
10108 enumerator-definition
10109 enumerator-list , enumerator-definition */
10112 cp_parser_enumerator_list (cp_parser* parser, tree type)
10116 /* Parse an enumerator-definition. */
10117 cp_parser_enumerator_definition (parser, type);
10119 /* If the next token is not a ',', we've reached the end of
10121 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
10123 /* Otherwise, consume the `,' and keep going. */
10124 cp_lexer_consume_token (parser->lexer);
10125 /* If the next token is a `}', there is a trailing comma. */
10126 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
10128 if (pedantic && !in_system_header)
10129 pedwarn ("comma at end of enumerator list");
10135 /* Parse an enumerator-definition. The enumerator has the indicated
10138 enumerator-definition:
10140 enumerator = constant-expression
10146 cp_parser_enumerator_definition (cp_parser* parser, tree type)
10151 /* Look for the identifier. */
10152 identifier = cp_parser_identifier (parser);
10153 if (identifier == error_mark_node)
10156 /* If the next token is an '=', then there is an explicit value. */
10157 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
10159 /* Consume the `=' token. */
10160 cp_lexer_consume_token (parser->lexer);
10161 /* Parse the value. */
10162 value = cp_parser_constant_expression (parser,
10163 /*allow_non_constant_p=*/false,
10169 /* Create the enumerator. */
10170 build_enumerator (identifier, value, type);
10173 /* Parse a namespace-name.
10176 original-namespace-name
10179 Returns the NAMESPACE_DECL for the namespace. */
10182 cp_parser_namespace_name (cp_parser* parser)
10185 tree namespace_decl;
10187 /* Get the name of the namespace. */
10188 identifier = cp_parser_identifier (parser);
10189 if (identifier == error_mark_node)
10190 return error_mark_node;
10192 /* Look up the identifier in the currently active scope. Look only
10193 for namespaces, due to:
10195 [basic.lookup.udir]
10197 When looking up a namespace-name in a using-directive or alias
10198 definition, only namespace names are considered.
10202 [basic.lookup.qual]
10204 During the lookup of a name preceding the :: scope resolution
10205 operator, object, function, and enumerator names are ignored.
10207 (Note that cp_parser_class_or_namespace_name only calls this
10208 function if the token after the name is the scope resolution
10210 namespace_decl = cp_parser_lookup_name (parser, identifier,
10212 /*is_template=*/false,
10213 /*is_namespace=*/true,
10214 /*check_dependency=*/true,
10215 /*ambiguous_p=*/NULL);
10216 /* If it's not a namespace, issue an error. */
10217 if (namespace_decl == error_mark_node
10218 || TREE_CODE (namespace_decl) != NAMESPACE_DECL)
10220 cp_parser_error (parser, "expected namespace-name");
10221 namespace_decl = error_mark_node;
10224 return namespace_decl;
10227 /* Parse a namespace-definition.
10229 namespace-definition:
10230 named-namespace-definition
10231 unnamed-namespace-definition
10233 named-namespace-definition:
10234 original-namespace-definition
10235 extension-namespace-definition
10237 original-namespace-definition:
10238 namespace identifier { namespace-body }
10240 extension-namespace-definition:
10241 namespace original-namespace-name { namespace-body }
10243 unnamed-namespace-definition:
10244 namespace { namespace-body } */
10247 cp_parser_namespace_definition (cp_parser* parser)
10251 /* Look for the `namespace' keyword. */
10252 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10254 /* Get the name of the namespace. We do not attempt to distinguish
10255 between an original-namespace-definition and an
10256 extension-namespace-definition at this point. The semantic
10257 analysis routines are responsible for that. */
10258 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
10259 identifier = cp_parser_identifier (parser);
10261 identifier = NULL_TREE;
10263 /* Look for the `{' to start the namespace. */
10264 cp_parser_require (parser, CPP_OPEN_BRACE, "`{'");
10265 /* Start the namespace. */
10266 push_namespace (identifier);
10267 /* Parse the body of the namespace. */
10268 cp_parser_namespace_body (parser);
10269 /* Finish the namespace. */
10271 /* Look for the final `}'. */
10272 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
10275 /* Parse a namespace-body.
10278 declaration-seq [opt] */
10281 cp_parser_namespace_body (cp_parser* parser)
10283 cp_parser_declaration_seq_opt (parser);
10286 /* Parse a namespace-alias-definition.
10288 namespace-alias-definition:
10289 namespace identifier = qualified-namespace-specifier ; */
10292 cp_parser_namespace_alias_definition (cp_parser* parser)
10295 tree namespace_specifier;
10297 /* Look for the `namespace' keyword. */
10298 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10299 /* Look for the identifier. */
10300 identifier = cp_parser_identifier (parser);
10301 if (identifier == error_mark_node)
10303 /* Look for the `=' token. */
10304 cp_parser_require (parser, CPP_EQ, "`='");
10305 /* Look for the qualified-namespace-specifier. */
10306 namespace_specifier
10307 = cp_parser_qualified_namespace_specifier (parser);
10308 /* Look for the `;' token. */
10309 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10311 /* Register the alias in the symbol table. */
10312 do_namespace_alias (identifier, namespace_specifier);
10315 /* Parse a qualified-namespace-specifier.
10317 qualified-namespace-specifier:
10318 :: [opt] nested-name-specifier [opt] namespace-name
10320 Returns a NAMESPACE_DECL corresponding to the specified
10324 cp_parser_qualified_namespace_specifier (cp_parser* parser)
10326 /* Look for the optional `::'. */
10327 cp_parser_global_scope_opt (parser,
10328 /*current_scope_valid_p=*/false);
10330 /* Look for the optional nested-name-specifier. */
10331 cp_parser_nested_name_specifier_opt (parser,
10332 /*typename_keyword_p=*/false,
10333 /*check_dependency_p=*/true,
10335 /*is_declaration=*/true);
10337 return cp_parser_namespace_name (parser);
10340 /* Parse a using-declaration.
10343 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
10344 using :: unqualified-id ; */
10347 cp_parser_using_declaration (cp_parser* parser)
10350 bool typename_p = false;
10351 bool global_scope_p;
10356 /* Look for the `using' keyword. */
10357 cp_parser_require_keyword (parser, RID_USING, "`using'");
10359 /* Peek at the next token. */
10360 token = cp_lexer_peek_token (parser->lexer);
10361 /* See if it's `typename'. */
10362 if (token->keyword == RID_TYPENAME)
10364 /* Remember that we've seen it. */
10366 /* Consume the `typename' token. */
10367 cp_lexer_consume_token (parser->lexer);
10370 /* Look for the optional global scope qualification. */
10372 = (cp_parser_global_scope_opt (parser,
10373 /*current_scope_valid_p=*/false)
10376 /* If we saw `typename', or didn't see `::', then there must be a
10377 nested-name-specifier present. */
10378 if (typename_p || !global_scope_p)
10379 qscope = cp_parser_nested_name_specifier (parser, typename_p,
10380 /*check_dependency_p=*/true,
10382 /*is_declaration=*/true);
10383 /* Otherwise, we could be in either of the two productions. In that
10384 case, treat the nested-name-specifier as optional. */
10386 qscope = cp_parser_nested_name_specifier_opt (parser,
10387 /*typename_keyword_p=*/false,
10388 /*check_dependency_p=*/true,
10390 /*is_declaration=*/true);
10392 qscope = global_namespace;
10394 /* Parse the unqualified-id. */
10395 identifier = cp_parser_unqualified_id (parser,
10396 /*template_keyword_p=*/false,
10397 /*check_dependency_p=*/true,
10398 /*declarator_p=*/true);
10400 /* The function we call to handle a using-declaration is different
10401 depending on what scope we are in. */
10402 if (identifier == error_mark_node)
10404 else if (TREE_CODE (identifier) != IDENTIFIER_NODE
10405 && TREE_CODE (identifier) != BIT_NOT_EXPR)
10406 /* [namespace.udecl]
10408 A using declaration shall not name a template-id. */
10409 error ("a template-id may not appear in a using-declaration");
10412 if (at_class_scope_p ())
10414 /* Create the USING_DECL. */
10415 decl = do_class_using_decl (parser->scope, identifier);
10416 /* Add it to the list of members in this class. */
10417 finish_member_declaration (decl);
10421 decl = cp_parser_lookup_name_simple (parser, identifier);
10422 if (decl == error_mark_node)
10423 cp_parser_name_lookup_error (parser, identifier, decl, NULL);
10424 else if (!at_namespace_scope_p ())
10425 do_local_using_decl (decl, qscope, identifier);
10427 do_toplevel_using_decl (decl, qscope, identifier);
10431 /* Look for the final `;'. */
10432 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10435 /* Parse a using-directive.
10438 using namespace :: [opt] nested-name-specifier [opt]
10439 namespace-name ; */
10442 cp_parser_using_directive (cp_parser* parser)
10444 tree namespace_decl;
10447 /* Look for the `using' keyword. */
10448 cp_parser_require_keyword (parser, RID_USING, "`using'");
10449 /* And the `namespace' keyword. */
10450 cp_parser_require_keyword (parser, RID_NAMESPACE, "`namespace'");
10451 /* Look for the optional `::' operator. */
10452 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
10453 /* And the optional nested-name-specifier. */
10454 cp_parser_nested_name_specifier_opt (parser,
10455 /*typename_keyword_p=*/false,
10456 /*check_dependency_p=*/true,
10458 /*is_declaration=*/true);
10459 /* Get the namespace being used. */
10460 namespace_decl = cp_parser_namespace_name (parser);
10461 /* And any specified attributes. */
10462 attribs = cp_parser_attributes_opt (parser);
10463 /* Update the symbol table. */
10464 parse_using_directive (namespace_decl, attribs);
10465 /* Look for the final `;'. */
10466 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10469 /* Parse an asm-definition.
10472 asm ( string-literal ) ;
10477 asm volatile [opt] ( string-literal ) ;
10478 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
10479 asm volatile [opt] ( string-literal : asm-operand-list [opt]
10480 : asm-operand-list [opt] ) ;
10481 asm volatile [opt] ( string-literal : asm-operand-list [opt]
10482 : asm-operand-list [opt]
10483 : asm-operand-list [opt] ) ; */
10486 cp_parser_asm_definition (cp_parser* parser)
10489 tree outputs = NULL_TREE;
10490 tree inputs = NULL_TREE;
10491 tree clobbers = NULL_TREE;
10493 bool volatile_p = false;
10494 bool extended_p = false;
10496 /* Look for the `asm' keyword. */
10497 cp_parser_require_keyword (parser, RID_ASM, "`asm'");
10498 /* See if the next token is `volatile'. */
10499 if (cp_parser_allow_gnu_extensions_p (parser)
10500 && cp_lexer_next_token_is_keyword (parser->lexer, RID_VOLATILE))
10502 /* Remember that we saw the `volatile' keyword. */
10504 /* Consume the token. */
10505 cp_lexer_consume_token (parser->lexer);
10507 /* Look for the opening `('. */
10508 if (!cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
10510 /* Look for the string. */
10511 string = cp_parser_string_literal (parser, false, false);
10512 if (string == error_mark_node)
10514 cp_parser_skip_to_closing_parenthesis (parser, true, false,
10515 /*consume_paren=*/true);
10519 /* If we're allowing GNU extensions, check for the extended assembly
10520 syntax. Unfortunately, the `:' tokens need not be separated by
10521 a space in C, and so, for compatibility, we tolerate that here
10522 too. Doing that means that we have to treat the `::' operator as
10524 if (cp_parser_allow_gnu_extensions_p (parser)
10525 && at_function_scope_p ()
10526 && (cp_lexer_next_token_is (parser->lexer, CPP_COLON)
10527 || cp_lexer_next_token_is (parser->lexer, CPP_SCOPE)))
10529 bool inputs_p = false;
10530 bool clobbers_p = false;
10532 /* The extended syntax was used. */
10535 /* Look for outputs. */
10536 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
10538 /* Consume the `:'. */
10539 cp_lexer_consume_token (parser->lexer);
10540 /* Parse the output-operands. */
10541 if (cp_lexer_next_token_is_not (parser->lexer,
10543 && cp_lexer_next_token_is_not (parser->lexer,
10545 && cp_lexer_next_token_is_not (parser->lexer,
10547 outputs = cp_parser_asm_operand_list (parser);
10549 /* If the next token is `::', there are no outputs, and the
10550 next token is the beginning of the inputs. */
10551 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
10552 /* The inputs are coming next. */
10555 /* Look for inputs. */
10557 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
10559 /* Consume the `:' or `::'. */
10560 cp_lexer_consume_token (parser->lexer);
10561 /* Parse the output-operands. */
10562 if (cp_lexer_next_token_is_not (parser->lexer,
10564 && cp_lexer_next_token_is_not (parser->lexer,
10566 inputs = cp_parser_asm_operand_list (parser);
10568 else if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
10569 /* The clobbers are coming next. */
10572 /* Look for clobbers. */
10574 || cp_lexer_next_token_is (parser->lexer, CPP_COLON))
10576 /* Consume the `:' or `::'. */
10577 cp_lexer_consume_token (parser->lexer);
10578 /* Parse the clobbers. */
10579 if (cp_lexer_next_token_is_not (parser->lexer,
10581 clobbers = cp_parser_asm_clobber_list (parser);
10584 /* Look for the closing `)'. */
10585 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
10586 cp_parser_skip_to_closing_parenthesis (parser, true, false,
10587 /*consume_paren=*/true);
10588 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
10590 /* Create the ASM_EXPR. */
10591 if (at_function_scope_p ())
10593 asm_stmt = finish_asm_stmt (volatile_p, string, outputs,
10595 /* If the extended syntax was not used, mark the ASM_EXPR. */
10598 tree temp = asm_stmt;
10599 if (TREE_CODE (temp) == CLEANUP_POINT_EXPR)
10600 temp = TREE_OPERAND (temp, 0);
10602 ASM_INPUT_P (temp) = 1;
10606 assemble_asm (string);
10609 /* Declarators [gram.dcl.decl] */
10611 /* Parse an init-declarator.
10614 declarator initializer [opt]
10619 declarator asm-specification [opt] attributes [opt] initializer [opt]
10621 function-definition:
10622 decl-specifier-seq [opt] declarator ctor-initializer [opt]
10624 decl-specifier-seq [opt] declarator function-try-block
10628 function-definition:
10629 __extension__ function-definition
10631 The DECL_SPECIFIERS and PREFIX_ATTRIBUTES apply to this declarator.
10632 Returns a representation of the entity declared. If MEMBER_P is TRUE,
10633 then this declarator appears in a class scope. The new DECL created
10634 by this declarator is returned.
10636 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
10637 for a function-definition here as well. If the declarator is a
10638 declarator for a function-definition, *FUNCTION_DEFINITION_P will
10639 be TRUE upon return. By that point, the function-definition will
10640 have been completely parsed.
10642 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
10646 cp_parser_init_declarator (cp_parser* parser,
10647 cp_decl_specifier_seq *decl_specifiers,
10648 bool function_definition_allowed_p,
10650 int declares_class_or_enum,
10651 bool* function_definition_p)
10654 cp_declarator *declarator;
10655 tree prefix_attributes;
10657 tree asm_specification;
10659 tree decl = NULL_TREE;
10661 bool is_initialized;
10662 bool is_parenthesized_init;
10663 bool is_non_constant_init;
10664 int ctor_dtor_or_conv_p;
10666 tree pushed_scope = NULL;
10668 /* Gather the attributes that were provided with the
10669 decl-specifiers. */
10670 prefix_attributes = decl_specifiers->attributes;
10672 /* Assume that this is not the declarator for a function
10674 if (function_definition_p)
10675 *function_definition_p = false;
10677 /* Defer access checks while parsing the declarator; we cannot know
10678 what names are accessible until we know what is being
10680 resume_deferring_access_checks ();
10682 /* Parse the declarator. */
10684 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
10685 &ctor_dtor_or_conv_p,
10686 /*parenthesized_p=*/NULL,
10687 /*member_p=*/false);
10688 /* Gather up the deferred checks. */
10689 stop_deferring_access_checks ();
10691 /* If the DECLARATOR was erroneous, there's no need to go
10693 if (declarator == cp_error_declarator)
10694 return error_mark_node;
10696 if (declares_class_or_enum & 2)
10697 cp_parser_check_for_definition_in_return_type (declarator,
10698 decl_specifiers->type);
10700 /* Figure out what scope the entity declared by the DECLARATOR is
10701 located in. `grokdeclarator' sometimes changes the scope, so
10702 we compute it now. */
10703 scope = get_scope_of_declarator (declarator);
10705 /* If we're allowing GNU extensions, look for an asm-specification
10707 if (cp_parser_allow_gnu_extensions_p (parser))
10709 /* Look for an asm-specification. */
10710 asm_specification = cp_parser_asm_specification_opt (parser);
10711 /* And attributes. */
10712 attributes = cp_parser_attributes_opt (parser);
10716 asm_specification = NULL_TREE;
10717 attributes = NULL_TREE;
10720 /* Peek at the next token. */
10721 token = cp_lexer_peek_token (parser->lexer);
10722 /* Check to see if the token indicates the start of a
10723 function-definition. */
10724 if (cp_parser_token_starts_function_definition_p (token))
10726 if (!function_definition_allowed_p)
10728 /* If a function-definition should not appear here, issue an
10730 cp_parser_error (parser,
10731 "a function-definition is not allowed here");
10732 return error_mark_node;
10736 /* Neither attributes nor an asm-specification are allowed
10737 on a function-definition. */
10738 if (asm_specification)
10739 error ("an asm-specification is not allowed on a function-definition");
10741 error ("attributes are not allowed on a function-definition");
10742 /* This is a function-definition. */
10743 *function_definition_p = true;
10745 /* Parse the function definition. */
10747 decl = cp_parser_save_member_function_body (parser,
10750 prefix_attributes);
10753 = (cp_parser_function_definition_from_specifiers_and_declarator
10754 (parser, decl_specifiers, prefix_attributes, declarator));
10762 Only in function declarations for constructors, destructors, and
10763 type conversions can the decl-specifier-seq be omitted.
10765 We explicitly postpone this check past the point where we handle
10766 function-definitions because we tolerate function-definitions
10767 that are missing their return types in some modes. */
10768 if (!decl_specifiers->any_specifiers_p && ctor_dtor_or_conv_p <= 0)
10770 cp_parser_error (parser,
10771 "expected constructor, destructor, or type conversion");
10772 return error_mark_node;
10775 /* An `=' or an `(' indicates an initializer. */
10776 is_initialized = (token->type == CPP_EQ
10777 || token->type == CPP_OPEN_PAREN);
10778 /* If the init-declarator isn't initialized and isn't followed by a
10779 `,' or `;', it's not a valid init-declarator. */
10780 if (!is_initialized
10781 && token->type != CPP_COMMA
10782 && token->type != CPP_SEMICOLON)
10784 cp_parser_error (parser, "expected initializer");
10785 return error_mark_node;
10788 /* Because start_decl has side-effects, we should only call it if we
10789 know we're going ahead. By this point, we know that we cannot
10790 possibly be looking at any other construct. */
10791 cp_parser_commit_to_tentative_parse (parser);
10793 /* If the decl specifiers were bad, issue an error now that we're
10794 sure this was intended to be a declarator. Then continue
10795 declaring the variable(s), as int, to try to cut down on further
10797 if (decl_specifiers->any_specifiers_p
10798 && decl_specifiers->type == error_mark_node)
10800 cp_parser_error (parser, "invalid type in declaration");
10801 decl_specifiers->type = integer_type_node;
10804 /* Check to see whether or not this declaration is a friend. */
10805 friend_p = cp_parser_friend_p (decl_specifiers);
10807 /* Check that the number of template-parameter-lists is OK. */
10808 if (!cp_parser_check_declarator_template_parameters (parser, declarator))
10809 return error_mark_node;
10811 /* Enter the newly declared entry in the symbol table. If we're
10812 processing a declaration in a class-specifier, we wait until
10813 after processing the initializer. */
10816 if (parser->in_unbraced_linkage_specification_p)
10818 decl_specifiers->storage_class = sc_extern;
10819 have_extern_spec = false;
10821 decl = start_decl (declarator, decl_specifiers,
10822 is_initialized, attributes, prefix_attributes,
10826 /* Enter the SCOPE. That way unqualified names appearing in the
10827 initializer will be looked up in SCOPE. */
10828 pushed_scope = push_scope (scope);
10830 /* Perform deferred access control checks, now that we know in which
10831 SCOPE the declared entity resides. */
10832 if (!member_p && decl)
10834 tree saved_current_function_decl = NULL_TREE;
10836 /* If the entity being declared is a function, pretend that we
10837 are in its scope. If it is a `friend', it may have access to
10838 things that would not otherwise be accessible. */
10839 if (TREE_CODE (decl) == FUNCTION_DECL)
10841 saved_current_function_decl = current_function_decl;
10842 current_function_decl = decl;
10845 /* Perform the access control checks for the declarator and the
10846 the decl-specifiers. */
10847 perform_deferred_access_checks ();
10849 /* Restore the saved value. */
10850 if (TREE_CODE (decl) == FUNCTION_DECL)
10851 current_function_decl = saved_current_function_decl;
10854 /* Parse the initializer. */
10855 if (is_initialized)
10856 initializer = cp_parser_initializer (parser,
10857 &is_parenthesized_init,
10858 &is_non_constant_init);
10861 initializer = NULL_TREE;
10862 is_parenthesized_init = false;
10863 is_non_constant_init = true;
10866 /* The old parser allows attributes to appear after a parenthesized
10867 initializer. Mark Mitchell proposed removing this functionality
10868 on the GCC mailing lists on 2002-08-13. This parser accepts the
10869 attributes -- but ignores them. */
10870 if (cp_parser_allow_gnu_extensions_p (parser) && is_parenthesized_init)
10871 if (cp_parser_attributes_opt (parser))
10872 warning (0, "attributes after parenthesized initializer ignored");
10874 /* For an in-class declaration, use `grokfield' to create the
10880 pop_scope (pushed_scope);
10881 pushed_scope = false;
10883 decl = grokfield (declarator, decl_specifiers,
10884 initializer, /*asmspec=*/NULL_TREE,
10885 /*attributes=*/NULL_TREE);
10886 if (decl && TREE_CODE (decl) == FUNCTION_DECL)
10887 cp_parser_save_default_args (parser, decl);
10890 /* Finish processing the declaration. But, skip friend
10892 if (!friend_p && decl && decl != error_mark_node)
10894 cp_finish_decl (decl,
10897 /* If the initializer is in parentheses, then this is
10898 a direct-initialization, which means that an
10899 `explicit' constructor is OK. Otherwise, an
10900 `explicit' constructor cannot be used. */
10901 ((is_parenthesized_init || !is_initialized)
10902 ? 0 : LOOKUP_ONLYCONVERTING));
10904 if (!friend_p && pushed_scope)
10905 pop_scope (pushed_scope);
10907 /* Remember whether or not variables were initialized by
10908 constant-expressions. */
10909 if (decl && TREE_CODE (decl) == VAR_DECL
10910 && is_initialized && !is_non_constant_init)
10911 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
10916 /* Parse a declarator.
10920 ptr-operator declarator
10922 abstract-declarator:
10923 ptr-operator abstract-declarator [opt]
10924 direct-abstract-declarator
10929 attributes [opt] direct-declarator
10930 attributes [opt] ptr-operator declarator
10932 abstract-declarator:
10933 attributes [opt] ptr-operator abstract-declarator [opt]
10934 attributes [opt] direct-abstract-declarator
10936 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
10937 detect constructor, destructor or conversion operators. It is set
10938 to -1 if the declarator is a name, and +1 if it is a
10939 function. Otherwise it is set to zero. Usually you just want to
10940 test for >0, but internally the negative value is used.
10942 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
10943 a decl-specifier-seq unless it declares a constructor, destructor,
10944 or conversion. It might seem that we could check this condition in
10945 semantic analysis, rather than parsing, but that makes it difficult
10946 to handle something like `f()'. We want to notice that there are
10947 no decl-specifiers, and therefore realize that this is an
10948 expression, not a declaration.)
10950 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
10951 the declarator is a direct-declarator of the form "(...)".
10953 MEMBER_P is true iff this declarator is a member-declarator. */
10955 static cp_declarator *
10956 cp_parser_declarator (cp_parser* parser,
10957 cp_parser_declarator_kind dcl_kind,
10958 int* ctor_dtor_or_conv_p,
10959 bool* parenthesized_p,
10963 cp_declarator *declarator;
10964 enum tree_code code;
10965 cp_cv_quals cv_quals;
10967 tree attributes = NULL_TREE;
10969 /* Assume this is not a constructor, destructor, or type-conversion
10971 if (ctor_dtor_or_conv_p)
10972 *ctor_dtor_or_conv_p = 0;
10974 if (cp_parser_allow_gnu_extensions_p (parser))
10975 attributes = cp_parser_attributes_opt (parser);
10977 /* Peek at the next token. */
10978 token = cp_lexer_peek_token (parser->lexer);
10980 /* Check for the ptr-operator production. */
10981 cp_parser_parse_tentatively (parser);
10982 /* Parse the ptr-operator. */
10983 code = cp_parser_ptr_operator (parser,
10986 /* If that worked, then we have a ptr-operator. */
10987 if (cp_parser_parse_definitely (parser))
10989 /* If a ptr-operator was found, then this declarator was not
10991 if (parenthesized_p)
10992 *parenthesized_p = true;
10993 /* The dependent declarator is optional if we are parsing an
10994 abstract-declarator. */
10995 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED)
10996 cp_parser_parse_tentatively (parser);
10998 /* Parse the dependent declarator. */
10999 declarator = cp_parser_declarator (parser, dcl_kind,
11000 /*ctor_dtor_or_conv_p=*/NULL,
11001 /*parenthesized_p=*/NULL,
11002 /*member_p=*/false);
11004 /* If we are parsing an abstract-declarator, we must handle the
11005 case where the dependent declarator is absent. */
11006 if (dcl_kind != CP_PARSER_DECLARATOR_NAMED
11007 && !cp_parser_parse_definitely (parser))
11010 /* Build the representation of the ptr-operator. */
11012 declarator = make_ptrmem_declarator (cv_quals,
11015 else if (code == INDIRECT_REF)
11016 declarator = make_pointer_declarator (cv_quals, declarator);
11018 declarator = make_reference_declarator (cv_quals, declarator);
11020 /* Everything else is a direct-declarator. */
11023 if (parenthesized_p)
11024 *parenthesized_p = cp_lexer_next_token_is (parser->lexer,
11026 declarator = cp_parser_direct_declarator (parser, dcl_kind,
11027 ctor_dtor_or_conv_p,
11031 if (attributes && declarator != cp_error_declarator)
11032 declarator->attributes = attributes;
11037 /* Parse a direct-declarator or direct-abstract-declarator.
11041 direct-declarator ( parameter-declaration-clause )
11042 cv-qualifier-seq [opt]
11043 exception-specification [opt]
11044 direct-declarator [ constant-expression [opt] ]
11047 direct-abstract-declarator:
11048 direct-abstract-declarator [opt]
11049 ( parameter-declaration-clause )
11050 cv-qualifier-seq [opt]
11051 exception-specification [opt]
11052 direct-abstract-declarator [opt] [ constant-expression [opt] ]
11053 ( abstract-declarator )
11055 Returns a representation of the declarator. DCL_KIND is
11056 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
11057 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
11058 we are parsing a direct-declarator. It is
11059 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
11060 of ambiguity we prefer an abstract declarator, as per
11061 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
11062 cp_parser_declarator. */
11064 static cp_declarator *
11065 cp_parser_direct_declarator (cp_parser* parser,
11066 cp_parser_declarator_kind dcl_kind,
11067 int* ctor_dtor_or_conv_p,
11071 cp_declarator *declarator = NULL;
11072 tree scope = NULL_TREE;
11073 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
11074 bool saved_in_declarator_p = parser->in_declarator_p;
11076 tree pushed_scope = NULL_TREE;
11080 /* Peek at the next token. */
11081 token = cp_lexer_peek_token (parser->lexer);
11082 if (token->type == CPP_OPEN_PAREN)
11084 /* This is either a parameter-declaration-clause, or a
11085 parenthesized declarator. When we know we are parsing a
11086 named declarator, it must be a parenthesized declarator
11087 if FIRST is true. For instance, `(int)' is a
11088 parameter-declaration-clause, with an omitted
11089 direct-abstract-declarator. But `((*))', is a
11090 parenthesized abstract declarator. Finally, when T is a
11091 template parameter `(T)' is a
11092 parameter-declaration-clause, and not a parenthesized
11095 We first try and parse a parameter-declaration-clause,
11096 and then try a nested declarator (if FIRST is true).
11098 It is not an error for it not to be a
11099 parameter-declaration-clause, even when FIRST is
11105 The first is the declaration of a function while the
11106 second is a the definition of a variable, including its
11109 Having seen only the parenthesis, we cannot know which of
11110 these two alternatives should be selected. Even more
11111 complex are examples like:
11116 The former is a function-declaration; the latter is a
11117 variable initialization.
11119 Thus again, we try a parameter-declaration-clause, and if
11120 that fails, we back out and return. */
11122 if (!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
11124 cp_parameter_declarator *params;
11125 unsigned saved_num_template_parameter_lists;
11127 /* In a member-declarator, the only valid interpretation
11128 of a parenthesis is the start of a
11129 parameter-declaration-clause. (It is invalid to
11130 initialize a static data member with a parenthesized
11131 initializer; only the "=" form of initialization is
11134 cp_parser_parse_tentatively (parser);
11136 /* Consume the `('. */
11137 cp_lexer_consume_token (parser->lexer);
11140 /* If this is going to be an abstract declarator, we're
11141 in a declarator and we can't have default args. */
11142 parser->default_arg_ok_p = false;
11143 parser->in_declarator_p = true;
11146 /* Inside the function parameter list, surrounding
11147 template-parameter-lists do not apply. */
11148 saved_num_template_parameter_lists
11149 = parser->num_template_parameter_lists;
11150 parser->num_template_parameter_lists = 0;
11152 /* Parse the parameter-declaration-clause. */
11153 params = cp_parser_parameter_declaration_clause (parser);
11155 parser->num_template_parameter_lists
11156 = saved_num_template_parameter_lists;
11158 /* If all went well, parse the cv-qualifier-seq and the
11159 exception-specification. */
11160 if (member_p || cp_parser_parse_definitely (parser))
11162 cp_cv_quals cv_quals;
11163 tree exception_specification;
11165 if (ctor_dtor_or_conv_p)
11166 *ctor_dtor_or_conv_p = *ctor_dtor_or_conv_p < 0;
11168 /* Consume the `)'. */
11169 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
11171 /* Parse the cv-qualifier-seq. */
11172 cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
11173 /* And the exception-specification. */
11174 exception_specification
11175 = cp_parser_exception_specification_opt (parser);
11177 /* Create the function-declarator. */
11178 declarator = make_call_declarator (declarator,
11181 exception_specification);
11182 /* Any subsequent parameter lists are to do with
11183 return type, so are not those of the declared
11185 parser->default_arg_ok_p = false;
11187 /* Repeat the main loop. */
11192 /* If this is the first, we can try a parenthesized
11196 bool saved_in_type_id_in_expr_p;
11198 parser->default_arg_ok_p = saved_default_arg_ok_p;
11199 parser->in_declarator_p = saved_in_declarator_p;
11201 /* Consume the `('. */
11202 cp_lexer_consume_token (parser->lexer);
11203 /* Parse the nested declarator. */
11204 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
11205 parser->in_type_id_in_expr_p = true;
11207 = cp_parser_declarator (parser, dcl_kind, ctor_dtor_or_conv_p,
11208 /*parenthesized_p=*/NULL,
11210 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
11212 /* Expect a `)'. */
11213 if (!cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'"))
11214 declarator = cp_error_declarator;
11215 if (declarator == cp_error_declarator)
11218 goto handle_declarator;
11220 /* Otherwise, we must be done. */
11224 else if ((!first || dcl_kind != CP_PARSER_DECLARATOR_NAMED)
11225 && token->type == CPP_OPEN_SQUARE)
11227 /* Parse an array-declarator. */
11230 if (ctor_dtor_or_conv_p)
11231 *ctor_dtor_or_conv_p = 0;
11234 parser->default_arg_ok_p = false;
11235 parser->in_declarator_p = true;
11236 /* Consume the `['. */
11237 cp_lexer_consume_token (parser->lexer);
11238 /* Peek at the next token. */
11239 token = cp_lexer_peek_token (parser->lexer);
11240 /* If the next token is `]', then there is no
11241 constant-expression. */
11242 if (token->type != CPP_CLOSE_SQUARE)
11244 bool non_constant_p;
11247 = cp_parser_constant_expression (parser,
11248 /*allow_non_constant=*/true,
11250 if (!non_constant_p)
11251 bounds = fold_non_dependent_expr (bounds);
11252 /* Normally, the array bound must be an integral constant
11253 expression. However, as an extension, we allow VLAs
11254 in function scopes. */
11255 else if (!at_function_scope_p ())
11257 error ("array bound is not an integer constant");
11258 bounds = error_mark_node;
11262 bounds = NULL_TREE;
11263 /* Look for the closing `]'. */
11264 if (!cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'"))
11266 declarator = cp_error_declarator;
11270 declarator = make_array_declarator (declarator, bounds);
11272 else if (first && dcl_kind != CP_PARSER_DECLARATOR_ABSTRACT)
11274 tree qualifying_scope;
11275 tree unqualified_name;
11277 /* Parse a declarator-id */
11278 if (dcl_kind == CP_PARSER_DECLARATOR_EITHER)
11279 cp_parser_parse_tentatively (parser);
11280 unqualified_name = cp_parser_declarator_id (parser);
11281 qualifying_scope = parser->scope;
11282 if (dcl_kind == CP_PARSER_DECLARATOR_EITHER)
11284 if (!cp_parser_parse_definitely (parser))
11285 unqualified_name = error_mark_node;
11286 else if (qualifying_scope
11287 || (TREE_CODE (unqualified_name)
11288 != IDENTIFIER_NODE))
11290 cp_parser_error (parser, "expected unqualified-id");
11291 unqualified_name = error_mark_node;
11295 if (unqualified_name == error_mark_node)
11297 declarator = cp_error_declarator;
11301 if (qualifying_scope && at_namespace_scope_p ()
11302 && TREE_CODE (qualifying_scope) == TYPENAME_TYPE)
11304 /* In the declaration of a member of a template class
11305 outside of the class itself, the SCOPE will sometimes
11306 be a TYPENAME_TYPE. For example, given:
11308 template <typename T>
11309 int S<T>::R::i = 3;
11311 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
11312 this context, we must resolve S<T>::R to an ordinary
11313 type, rather than a typename type.
11315 The reason we normally avoid resolving TYPENAME_TYPEs
11316 is that a specialization of `S' might render
11317 `S<T>::R' not a type. However, if `S' is
11318 specialized, then this `i' will not be used, so there
11319 is no harm in resolving the types here. */
11322 /* Resolve the TYPENAME_TYPE. */
11323 type = resolve_typename_type (qualifying_scope,
11324 /*only_current_p=*/false);
11325 /* If that failed, the declarator is invalid. */
11326 if (type == error_mark_node)
11327 error ("%<%T::%D%> is not a type",
11328 TYPE_CONTEXT (qualifying_scope),
11329 TYPE_IDENTIFIER (qualifying_scope));
11330 qualifying_scope = type;
11333 declarator = make_id_declarator (qualifying_scope,
11335 declarator->id_loc = token->location;
11336 if (unqualified_name)
11340 if (qualifying_scope
11341 && CLASS_TYPE_P (qualifying_scope))
11342 class_type = qualifying_scope;
11344 class_type = current_class_type;
11348 if (TREE_CODE (unqualified_name) == BIT_NOT_EXPR)
11349 declarator->u.id.sfk = sfk_destructor;
11350 else if (IDENTIFIER_TYPENAME_P (unqualified_name))
11351 declarator->u.id.sfk = sfk_conversion;
11352 else if (/* There's no way to declare a constructor
11353 for an anonymous type, even if the type
11354 got a name for linkage purposes. */
11355 !TYPE_WAS_ANONYMOUS (class_type)
11356 && (constructor_name_p (unqualified_name,
11358 || (TREE_CODE (unqualified_name) == TYPE_DECL
11360 (TREE_TYPE (unqualified_name),
11362 declarator->u.id.sfk = sfk_constructor;
11364 if (ctor_dtor_or_conv_p && declarator->u.id.sfk != sfk_none)
11365 *ctor_dtor_or_conv_p = -1;
11366 if (qualifying_scope
11367 && TREE_CODE (unqualified_name) == TYPE_DECL
11368 && CLASSTYPE_USE_TEMPLATE (TREE_TYPE (unqualified_name)))
11370 error ("invalid use of constructor as a template");
11371 inform ("use %<%T::%D%> instead of %<%T::%T%> to name "
11372 "the constructor in a qualified name",
11374 DECL_NAME (TYPE_TI_TEMPLATE (class_type)),
11375 class_type, class_type);
11380 handle_declarator:;
11381 scope = get_scope_of_declarator (declarator);
11383 /* Any names that appear after the declarator-id for a
11384 member are looked up in the containing scope. */
11385 pushed_scope = push_scope (scope);
11386 parser->in_declarator_p = true;
11387 if ((ctor_dtor_or_conv_p && *ctor_dtor_or_conv_p)
11388 || (declarator && declarator->kind == cdk_id))
11389 /* Default args are only allowed on function
11391 parser->default_arg_ok_p = saved_default_arg_ok_p;
11393 parser->default_arg_ok_p = false;
11402 /* For an abstract declarator, we might wind up with nothing at this
11403 point. That's an error; the declarator is not optional. */
11405 cp_parser_error (parser, "expected declarator");
11407 /* If we entered a scope, we must exit it now. */
11409 pop_scope (pushed_scope);
11411 parser->default_arg_ok_p = saved_default_arg_ok_p;
11412 parser->in_declarator_p = saved_in_declarator_p;
11417 /* Parse a ptr-operator.
11420 * cv-qualifier-seq [opt]
11422 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
11427 & cv-qualifier-seq [opt]
11429 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
11430 Returns ADDR_EXPR if a reference was used. In the case of a
11431 pointer-to-member, *TYPE is filled in with the TYPE containing the
11432 member. *CV_QUALS is filled in with the cv-qualifier-seq, or
11433 TYPE_UNQUALIFIED, if there are no cv-qualifiers. Returns
11434 ERROR_MARK if an error occurred. */
11436 static enum tree_code
11437 cp_parser_ptr_operator (cp_parser* parser,
11439 cp_cv_quals *cv_quals)
11441 enum tree_code code = ERROR_MARK;
11444 /* Assume that it's not a pointer-to-member. */
11446 /* And that there are no cv-qualifiers. */
11447 *cv_quals = TYPE_UNQUALIFIED;
11449 /* Peek at the next token. */
11450 token = cp_lexer_peek_token (parser->lexer);
11451 /* If it's a `*' or `&' we have a pointer or reference. */
11452 if (token->type == CPP_MULT || token->type == CPP_AND)
11454 /* Remember which ptr-operator we were processing. */
11455 code = (token->type == CPP_AND ? ADDR_EXPR : INDIRECT_REF);
11457 /* Consume the `*' or `&'. */
11458 cp_lexer_consume_token (parser->lexer);
11460 /* A `*' can be followed by a cv-qualifier-seq, and so can a
11461 `&', if we are allowing GNU extensions. (The only qualifier
11462 that can legally appear after `&' is `restrict', but that is
11463 enforced during semantic analysis. */
11464 if (code == INDIRECT_REF
11465 || cp_parser_allow_gnu_extensions_p (parser))
11466 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
11470 /* Try the pointer-to-member case. */
11471 cp_parser_parse_tentatively (parser);
11472 /* Look for the optional `::' operator. */
11473 cp_parser_global_scope_opt (parser,
11474 /*current_scope_valid_p=*/false);
11475 /* Look for the nested-name specifier. */
11476 cp_parser_nested_name_specifier (parser,
11477 /*typename_keyword_p=*/false,
11478 /*check_dependency_p=*/true,
11480 /*is_declaration=*/false);
11481 /* If we found it, and the next token is a `*', then we are
11482 indeed looking at a pointer-to-member operator. */
11483 if (!cp_parser_error_occurred (parser)
11484 && cp_parser_require (parser, CPP_MULT, "`*'"))
11486 /* The type of which the member is a member is given by the
11488 *type = parser->scope;
11489 /* The next name will not be qualified. */
11490 parser->scope = NULL_TREE;
11491 parser->qualifying_scope = NULL_TREE;
11492 parser->object_scope = NULL_TREE;
11493 /* Indicate that the `*' operator was used. */
11494 code = INDIRECT_REF;
11495 /* Look for the optional cv-qualifier-seq. */
11496 *cv_quals = cp_parser_cv_qualifier_seq_opt (parser);
11498 /* If that didn't work we don't have a ptr-operator. */
11499 if (!cp_parser_parse_definitely (parser))
11500 cp_parser_error (parser, "expected ptr-operator");
11506 /* Parse an (optional) cv-qualifier-seq.
11509 cv-qualifier cv-qualifier-seq [opt]
11520 Returns a bitmask representing the cv-qualifiers. */
11523 cp_parser_cv_qualifier_seq_opt (cp_parser* parser)
11525 cp_cv_quals cv_quals = TYPE_UNQUALIFIED;
11530 cp_cv_quals cv_qualifier;
11532 /* Peek at the next token. */
11533 token = cp_lexer_peek_token (parser->lexer);
11534 /* See if it's a cv-qualifier. */
11535 switch (token->keyword)
11538 cv_qualifier = TYPE_QUAL_CONST;
11542 cv_qualifier = TYPE_QUAL_VOLATILE;
11546 cv_qualifier = TYPE_QUAL_RESTRICT;
11550 cv_qualifier = TYPE_UNQUALIFIED;
11557 if (cv_quals & cv_qualifier)
11559 error ("duplicate cv-qualifier");
11560 cp_lexer_purge_token (parser->lexer);
11564 cp_lexer_consume_token (parser->lexer);
11565 cv_quals |= cv_qualifier;
11572 /* Parse a declarator-id.
11576 :: [opt] nested-name-specifier [opt] type-name
11578 In the `id-expression' case, the value returned is as for
11579 cp_parser_id_expression if the id-expression was an unqualified-id.
11580 If the id-expression was a qualified-id, then a SCOPE_REF is
11581 returned. The first operand is the scope (either a NAMESPACE_DECL
11582 or TREE_TYPE), but the second is still just a representation of an
11586 cp_parser_declarator_id (cp_parser* parser)
11588 /* The expression must be an id-expression. Assume that qualified
11589 names are the names of types so that:
11592 int S<T>::R::i = 3;
11594 will work; we must treat `S<T>::R' as the name of a type.
11595 Similarly, assume that qualified names are templates, where
11599 int S<T>::R<T>::i = 3;
11602 return cp_parser_id_expression (parser,
11603 /*template_keyword_p=*/false,
11604 /*check_dependency_p=*/false,
11605 /*template_p=*/NULL,
11606 /*declarator_p=*/true);
11609 /* Parse a type-id.
11612 type-specifier-seq abstract-declarator [opt]
11614 Returns the TYPE specified. */
11617 cp_parser_type_id (cp_parser* parser)
11619 cp_decl_specifier_seq type_specifier_seq;
11620 cp_declarator *abstract_declarator;
11622 /* Parse the type-specifier-seq. */
11623 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
11624 &type_specifier_seq);
11625 if (type_specifier_seq.type == error_mark_node)
11626 return error_mark_node;
11628 /* There might or might not be an abstract declarator. */
11629 cp_parser_parse_tentatively (parser);
11630 /* Look for the declarator. */
11631 abstract_declarator
11632 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_ABSTRACT, NULL,
11633 /*parenthesized_p=*/NULL,
11634 /*member_p=*/false);
11635 /* Check to see if there really was a declarator. */
11636 if (!cp_parser_parse_definitely (parser))
11637 abstract_declarator = NULL;
11639 return groktypename (&type_specifier_seq, abstract_declarator);
11642 /* Parse a type-specifier-seq.
11644 type-specifier-seq:
11645 type-specifier type-specifier-seq [opt]
11649 type-specifier-seq:
11650 attributes type-specifier-seq [opt]
11652 If IS_CONDITION is true, we are at the start of a "condition",
11653 e.g., we've just seen "if (".
11655 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
11658 cp_parser_type_specifier_seq (cp_parser* parser,
11660 cp_decl_specifier_seq *type_specifier_seq)
11662 bool seen_type_specifier = false;
11663 cp_parser_flags flags = CP_PARSER_FLAGS_OPTIONAL;
11665 /* Clear the TYPE_SPECIFIER_SEQ. */
11666 clear_decl_specs (type_specifier_seq);
11668 /* Parse the type-specifiers and attributes. */
11671 tree type_specifier;
11672 bool is_cv_qualifier;
11674 /* Check for attributes first. */
11675 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE))
11677 type_specifier_seq->attributes =
11678 chainon (type_specifier_seq->attributes,
11679 cp_parser_attributes_opt (parser));
11683 /* Look for the type-specifier. */
11684 type_specifier = cp_parser_type_specifier (parser,
11686 type_specifier_seq,
11687 /*is_declaration=*/false,
11690 if (!type_specifier)
11692 /* If the first type-specifier could not be found, this is not a
11693 type-specifier-seq at all. */
11694 if (!seen_type_specifier)
11696 cp_parser_error (parser, "expected type-specifier");
11697 type_specifier_seq->type = error_mark_node;
11700 /* If subsequent type-specifiers could not be found, the
11701 type-specifier-seq is complete. */
11705 seen_type_specifier = true;
11706 /* The standard says that a condition can be:
11708 type-specifier-seq declarator = assignment-expression
11715 we should treat the "S" as a declarator, not as a
11716 type-specifier. The standard doesn't say that explicitly for
11717 type-specifier-seq, but it does say that for
11718 decl-specifier-seq in an ordinary declaration. Perhaps it
11719 would be clearer just to allow a decl-specifier-seq here, and
11720 then add a semantic restriction that if any decl-specifiers
11721 that are not type-specifiers appear, the program is invalid. */
11722 if (is_condition && !is_cv_qualifier)
11723 flags |= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES;
11729 /* Parse a parameter-declaration-clause.
11731 parameter-declaration-clause:
11732 parameter-declaration-list [opt] ... [opt]
11733 parameter-declaration-list , ...
11735 Returns a representation for the parameter declarations. A return
11736 value of NULL indicates a parameter-declaration-clause consisting
11737 only of an ellipsis. */
11739 static cp_parameter_declarator *
11740 cp_parser_parameter_declaration_clause (cp_parser* parser)
11742 cp_parameter_declarator *parameters;
11747 /* Peek at the next token. */
11748 token = cp_lexer_peek_token (parser->lexer);
11749 /* Check for trivial parameter-declaration-clauses. */
11750 if (token->type == CPP_ELLIPSIS)
11752 /* Consume the `...' token. */
11753 cp_lexer_consume_token (parser->lexer);
11756 else if (token->type == CPP_CLOSE_PAREN)
11757 /* There are no parameters. */
11759 #ifndef NO_IMPLICIT_EXTERN_C
11760 if (in_system_header && current_class_type == NULL
11761 && current_lang_name == lang_name_c)
11765 return no_parameters;
11767 /* Check for `(void)', too, which is a special case. */
11768 else if (token->keyword == RID_VOID
11769 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
11770 == CPP_CLOSE_PAREN))
11772 /* Consume the `void' token. */
11773 cp_lexer_consume_token (parser->lexer);
11774 /* There are no parameters. */
11775 return no_parameters;
11778 /* Parse the parameter-declaration-list. */
11779 parameters = cp_parser_parameter_declaration_list (parser, &is_error);
11780 /* If a parse error occurred while parsing the
11781 parameter-declaration-list, then the entire
11782 parameter-declaration-clause is erroneous. */
11786 /* Peek at the next token. */
11787 token = cp_lexer_peek_token (parser->lexer);
11788 /* If it's a `,', the clause should terminate with an ellipsis. */
11789 if (token->type == CPP_COMMA)
11791 /* Consume the `,'. */
11792 cp_lexer_consume_token (parser->lexer);
11793 /* Expect an ellipsis. */
11795 = (cp_parser_require (parser, CPP_ELLIPSIS, "`...'") != NULL);
11797 /* It might also be `...' if the optional trailing `,' was
11799 else if (token->type == CPP_ELLIPSIS)
11801 /* Consume the `...' token. */
11802 cp_lexer_consume_token (parser->lexer);
11803 /* And remember that we saw it. */
11807 ellipsis_p = false;
11809 /* Finish the parameter list. */
11810 if (parameters && ellipsis_p)
11811 parameters->ellipsis_p = true;
11816 /* Parse a parameter-declaration-list.
11818 parameter-declaration-list:
11819 parameter-declaration
11820 parameter-declaration-list , parameter-declaration
11822 Returns a representation of the parameter-declaration-list, as for
11823 cp_parser_parameter_declaration_clause. However, the
11824 `void_list_node' is never appended to the list. Upon return,
11825 *IS_ERROR will be true iff an error occurred. */
11827 static cp_parameter_declarator *
11828 cp_parser_parameter_declaration_list (cp_parser* parser, bool *is_error)
11830 cp_parameter_declarator *parameters = NULL;
11831 cp_parameter_declarator **tail = ¶meters;
11833 /* Assume all will go well. */
11836 /* Look for more parameters. */
11839 cp_parameter_declarator *parameter;
11840 bool parenthesized_p;
11841 /* Parse the parameter. */
11843 = cp_parser_parameter_declaration (parser,
11844 /*template_parm_p=*/false,
11847 /* If a parse error occurred parsing the parameter declaration,
11848 then the entire parameter-declaration-list is erroneous. */
11855 /* Add the new parameter to the list. */
11857 tail = ¶meter->next;
11859 /* Peek at the next token. */
11860 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN)
11861 || cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS)
11862 /* These are for Objective-C++ */
11863 || cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
11864 || cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
11865 /* The parameter-declaration-list is complete. */
11867 else if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
11871 /* Peek at the next token. */
11872 token = cp_lexer_peek_nth_token (parser->lexer, 2);
11873 /* If it's an ellipsis, then the list is complete. */
11874 if (token->type == CPP_ELLIPSIS)
11876 /* Otherwise, there must be more parameters. Consume the
11878 cp_lexer_consume_token (parser->lexer);
11879 /* When parsing something like:
11881 int i(float f, double d)
11883 we can tell after seeing the declaration for "f" that we
11884 are not looking at an initialization of a variable "i",
11885 but rather at the declaration of a function "i".
11887 Due to the fact that the parsing of template arguments
11888 (as specified to a template-id) requires backtracking we
11889 cannot use this technique when inside a template argument
11891 if (!parser->in_template_argument_list_p
11892 && !parser->in_type_id_in_expr_p
11893 && cp_parser_uncommitted_to_tentative_parse_p (parser)
11894 /* However, a parameter-declaration of the form
11895 "foat(f)" (which is a valid declaration of a
11896 parameter "f") can also be interpreted as an
11897 expression (the conversion of "f" to "float"). */
11898 && !parenthesized_p)
11899 cp_parser_commit_to_tentative_parse (parser);
11903 cp_parser_error (parser, "expected %<,%> or %<...%>");
11904 if (!cp_parser_uncommitted_to_tentative_parse_p (parser))
11905 cp_parser_skip_to_closing_parenthesis (parser,
11906 /*recovering=*/true,
11907 /*or_comma=*/false,
11908 /*consume_paren=*/false);
11916 /* Parse a parameter declaration.
11918 parameter-declaration:
11919 decl-specifier-seq declarator
11920 decl-specifier-seq declarator = assignment-expression
11921 decl-specifier-seq abstract-declarator [opt]
11922 decl-specifier-seq abstract-declarator [opt] = assignment-expression
11924 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
11925 declares a template parameter. (In that case, a non-nested `>'
11926 token encountered during the parsing of the assignment-expression
11927 is not interpreted as a greater-than operator.)
11929 Returns a representation of the parameter, or NULL if an error
11930 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
11931 true iff the declarator is of the form "(p)". */
11933 static cp_parameter_declarator *
11934 cp_parser_parameter_declaration (cp_parser *parser,
11935 bool template_parm_p,
11936 bool *parenthesized_p)
11938 int declares_class_or_enum;
11939 bool greater_than_is_operator_p;
11940 cp_decl_specifier_seq decl_specifiers;
11941 cp_declarator *declarator;
11942 tree default_argument;
11944 const char *saved_message;
11946 /* In a template parameter, `>' is not an operator.
11950 When parsing a default template-argument for a non-type
11951 template-parameter, the first non-nested `>' is taken as the end
11952 of the template parameter-list rather than a greater-than
11954 greater_than_is_operator_p = !template_parm_p;
11956 /* Type definitions may not appear in parameter types. */
11957 saved_message = parser->type_definition_forbidden_message;
11958 parser->type_definition_forbidden_message
11959 = "types may not be defined in parameter types";
11961 /* Parse the declaration-specifiers. */
11962 cp_parser_decl_specifier_seq (parser,
11963 CP_PARSER_FLAGS_NONE,
11965 &declares_class_or_enum);
11966 /* If an error occurred, there's no reason to attempt to parse the
11967 rest of the declaration. */
11968 if (cp_parser_error_occurred (parser))
11970 parser->type_definition_forbidden_message = saved_message;
11974 /* Peek at the next token. */
11975 token = cp_lexer_peek_token (parser->lexer);
11976 /* If the next token is a `)', `,', `=', `>', or `...', then there
11977 is no declarator. */
11978 if (token->type == CPP_CLOSE_PAREN
11979 || token->type == CPP_COMMA
11980 || token->type == CPP_EQ
11981 || token->type == CPP_ELLIPSIS
11982 || token->type == CPP_GREATER)
11985 if (parenthesized_p)
11986 *parenthesized_p = false;
11988 /* Otherwise, there should be a declarator. */
11991 bool saved_default_arg_ok_p = parser->default_arg_ok_p;
11992 parser->default_arg_ok_p = false;
11994 /* After seeing a decl-specifier-seq, if the next token is not a
11995 "(", there is no possibility that the code is a valid
11996 expression. Therefore, if parsing tentatively, we commit at
11998 if (!parser->in_template_argument_list_p
11999 /* In an expression context, having seen:
12003 we cannot be sure whether we are looking at a
12004 function-type (taking a "char" as a parameter) or a cast
12005 of some object of type "char" to "int". */
12006 && !parser->in_type_id_in_expr_p
12007 && cp_parser_uncommitted_to_tentative_parse_p (parser)
12008 && cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_PAREN))
12009 cp_parser_commit_to_tentative_parse (parser);
12010 /* Parse the declarator. */
12011 declarator = cp_parser_declarator (parser,
12012 CP_PARSER_DECLARATOR_EITHER,
12013 /*ctor_dtor_or_conv_p=*/NULL,
12015 /*member_p=*/false);
12016 parser->default_arg_ok_p = saved_default_arg_ok_p;
12017 /* After the declarator, allow more attributes. */
12018 decl_specifiers.attributes
12019 = chainon (decl_specifiers.attributes,
12020 cp_parser_attributes_opt (parser));
12023 /* The restriction on defining new types applies only to the type
12024 of the parameter, not to the default argument. */
12025 parser->type_definition_forbidden_message = saved_message;
12027 /* If the next token is `=', then process a default argument. */
12028 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
12030 bool saved_greater_than_is_operator_p;
12031 /* Consume the `='. */
12032 cp_lexer_consume_token (parser->lexer);
12034 /* If we are defining a class, then the tokens that make up the
12035 default argument must be saved and processed later. */
12036 if (!template_parm_p && at_class_scope_p ()
12037 && TYPE_BEING_DEFINED (current_class_type))
12039 unsigned depth = 0;
12040 cp_token *first_token;
12043 /* Add tokens until we have processed the entire default
12044 argument. We add the range [first_token, token). */
12045 first_token = cp_lexer_peek_token (parser->lexer);
12050 /* Peek at the next token. */
12051 token = cp_lexer_peek_token (parser->lexer);
12052 /* What we do depends on what token we have. */
12053 switch (token->type)
12055 /* In valid code, a default argument must be
12056 immediately followed by a `,' `)', or `...'. */
12058 case CPP_CLOSE_PAREN:
12060 /* If we run into a non-nested `;', `}', or `]',
12061 then the code is invalid -- but the default
12062 argument is certainly over. */
12063 case CPP_SEMICOLON:
12064 case CPP_CLOSE_BRACE:
12065 case CPP_CLOSE_SQUARE:
12068 /* Update DEPTH, if necessary. */
12069 else if (token->type == CPP_CLOSE_PAREN
12070 || token->type == CPP_CLOSE_BRACE
12071 || token->type == CPP_CLOSE_SQUARE)
12075 case CPP_OPEN_PAREN:
12076 case CPP_OPEN_SQUARE:
12077 case CPP_OPEN_BRACE:
12082 /* If we see a non-nested `>', and `>' is not an
12083 operator, then it marks the end of the default
12085 if (!depth && !greater_than_is_operator_p)
12089 /* If we run out of tokens, issue an error message. */
12091 error ("file ends in default argument");
12097 /* In these cases, we should look for template-ids.
12098 For example, if the default argument is
12099 `X<int, double>()', we need to do name lookup to
12100 figure out whether or not `X' is a template; if
12101 so, the `,' does not end the default argument.
12103 That is not yet done. */
12110 /* If we've reached the end, stop. */
12114 /* Add the token to the token block. */
12115 token = cp_lexer_consume_token (parser->lexer);
12118 /* Create a DEFAULT_ARG to represented the unparsed default
12120 default_argument = make_node (DEFAULT_ARG);
12121 DEFARG_TOKENS (default_argument)
12122 = cp_token_cache_new (first_token, token);
12124 /* Outside of a class definition, we can just parse the
12125 assignment-expression. */
12128 bool saved_local_variables_forbidden_p;
12130 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
12132 saved_greater_than_is_operator_p
12133 = parser->greater_than_is_operator_p;
12134 parser->greater_than_is_operator_p = greater_than_is_operator_p;
12135 /* Local variable names (and the `this' keyword) may not
12136 appear in a default argument. */
12137 saved_local_variables_forbidden_p
12138 = parser->local_variables_forbidden_p;
12139 parser->local_variables_forbidden_p = true;
12140 /* Parse the assignment-expression. */
12142 = cp_parser_assignment_expression (parser, /*cast_p=*/false);
12143 /* Restore saved state. */
12144 parser->greater_than_is_operator_p
12145 = saved_greater_than_is_operator_p;
12146 parser->local_variables_forbidden_p
12147 = saved_local_variables_forbidden_p;
12149 if (!parser->default_arg_ok_p)
12151 if (!flag_pedantic_errors)
12152 warning (0, "deprecated use of default argument for parameter of non-function");
12155 error ("default arguments are only permitted for function parameters");
12156 default_argument = NULL_TREE;
12161 default_argument = NULL_TREE;
12163 return make_parameter_declarator (&decl_specifiers,
12168 /* Parse a function-body.
12171 compound_statement */
12174 cp_parser_function_body (cp_parser *parser)
12176 cp_parser_compound_statement (parser, NULL, false);
12179 /* Parse a ctor-initializer-opt followed by a function-body. Return
12180 true if a ctor-initializer was present. */
12183 cp_parser_ctor_initializer_opt_and_function_body (cp_parser *parser)
12186 bool ctor_initializer_p;
12188 /* Begin the function body. */
12189 body = begin_function_body ();
12190 /* Parse the optional ctor-initializer. */
12191 ctor_initializer_p = cp_parser_ctor_initializer_opt (parser);
12192 /* Parse the function-body. */
12193 cp_parser_function_body (parser);
12194 /* Finish the function body. */
12195 finish_function_body (body);
12197 return ctor_initializer_p;
12200 /* Parse an initializer.
12203 = initializer-clause
12204 ( expression-list )
12206 Returns a expression representing the initializer. If no
12207 initializer is present, NULL_TREE is returned.
12209 *IS_PARENTHESIZED_INIT is set to TRUE if the `( expression-list )'
12210 production is used, and zero otherwise. *IS_PARENTHESIZED_INIT is
12211 set to FALSE if there is no initializer present. If there is an
12212 initializer, and it is not a constant-expression, *NON_CONSTANT_P
12213 is set to true; otherwise it is set to false. */
12216 cp_parser_initializer (cp_parser* parser, bool* is_parenthesized_init,
12217 bool* non_constant_p)
12222 /* Peek at the next token. */
12223 token = cp_lexer_peek_token (parser->lexer);
12225 /* Let our caller know whether or not this initializer was
12227 *is_parenthesized_init = (token->type == CPP_OPEN_PAREN);
12228 /* Assume that the initializer is constant. */
12229 *non_constant_p = false;
12231 if (token->type == CPP_EQ)
12233 /* Consume the `='. */
12234 cp_lexer_consume_token (parser->lexer);
12235 /* Parse the initializer-clause. */
12236 init = cp_parser_initializer_clause (parser, non_constant_p);
12238 else if (token->type == CPP_OPEN_PAREN)
12239 init = cp_parser_parenthesized_expression_list (parser, false,
12244 /* Anything else is an error. */
12245 cp_parser_error (parser, "expected initializer");
12246 init = error_mark_node;
12252 /* Parse an initializer-clause.
12254 initializer-clause:
12255 assignment-expression
12256 { initializer-list , [opt] }
12259 Returns an expression representing the initializer.
12261 If the `assignment-expression' production is used the value
12262 returned is simply a representation for the expression.
12264 Otherwise, a CONSTRUCTOR is returned. The CONSTRUCTOR_ELTS will be
12265 the elements of the initializer-list (or NULL_TREE, if the last
12266 production is used). The TREE_TYPE for the CONSTRUCTOR will be
12267 NULL_TREE. There is no way to detect whether or not the optional
12268 trailing `,' was provided. NON_CONSTANT_P is as for
12269 cp_parser_initializer. */
12272 cp_parser_initializer_clause (cp_parser* parser, bool* non_constant_p)
12276 /* Assume the expression is constant. */
12277 *non_constant_p = false;
12279 /* If it is not a `{', then we are looking at an
12280 assignment-expression. */
12281 if (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE))
12284 = cp_parser_constant_expression (parser,
12285 /*allow_non_constant_p=*/true,
12287 if (!*non_constant_p)
12288 initializer = fold_non_dependent_expr (initializer);
12292 /* Consume the `{' token. */
12293 cp_lexer_consume_token (parser->lexer);
12294 /* Create a CONSTRUCTOR to represent the braced-initializer. */
12295 initializer = make_node (CONSTRUCTOR);
12296 /* If it's not a `}', then there is a non-trivial initializer. */
12297 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_BRACE))
12299 /* Parse the initializer list. */
12300 CONSTRUCTOR_ELTS (initializer)
12301 = cp_parser_initializer_list (parser, non_constant_p);
12302 /* A trailing `,' token is allowed. */
12303 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
12304 cp_lexer_consume_token (parser->lexer);
12306 /* Now, there should be a trailing `}'. */
12307 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
12310 return initializer;
12313 /* Parse an initializer-list.
12317 initializer-list , initializer-clause
12322 identifier : initializer-clause
12323 initializer-list, identifier : initializer-clause
12325 Returns a TREE_LIST. The TREE_VALUE of each node is an expression
12326 for the initializer. If the TREE_PURPOSE is non-NULL, it is the
12327 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
12328 as for cp_parser_initializer. */
12331 cp_parser_initializer_list (cp_parser* parser, bool* non_constant_p)
12333 tree initializers = NULL_TREE;
12335 /* Assume all of the expressions are constant. */
12336 *non_constant_p = false;
12338 /* Parse the rest of the list. */
12344 bool clause_non_constant_p;
12346 /* If the next token is an identifier and the following one is a
12347 colon, we are looking at the GNU designated-initializer
12349 if (cp_parser_allow_gnu_extensions_p (parser)
12350 && cp_lexer_next_token_is (parser->lexer, CPP_NAME)
12351 && cp_lexer_peek_nth_token (parser->lexer, 2)->type == CPP_COLON)
12353 /* Consume the identifier. */
12354 identifier = cp_lexer_consume_token (parser->lexer)->value;
12355 /* Consume the `:'. */
12356 cp_lexer_consume_token (parser->lexer);
12359 identifier = NULL_TREE;
12361 /* Parse the initializer. */
12362 initializer = cp_parser_initializer_clause (parser,
12363 &clause_non_constant_p);
12364 /* If any clause is non-constant, so is the entire initializer. */
12365 if (clause_non_constant_p)
12366 *non_constant_p = true;
12367 /* Add it to the list. */
12368 initializers = tree_cons (identifier, initializer, initializers);
12370 /* If the next token is not a comma, we have reached the end of
12372 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
12375 /* Peek at the next token. */
12376 token = cp_lexer_peek_nth_token (parser->lexer, 2);
12377 /* If the next token is a `}', then we're still done. An
12378 initializer-clause can have a trailing `,' after the
12379 initializer-list and before the closing `}'. */
12380 if (token->type == CPP_CLOSE_BRACE)
12383 /* Consume the `,' token. */
12384 cp_lexer_consume_token (parser->lexer);
12387 /* The initializers were built up in reverse order, so we need to
12388 reverse them now. */
12389 return nreverse (initializers);
12392 /* Classes [gram.class] */
12394 /* Parse a class-name.
12400 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
12401 to indicate that names looked up in dependent types should be
12402 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
12403 keyword has been used to indicate that the name that appears next
12404 is a template. TAG_TYPE indicates the explicit tag given before
12405 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
12406 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
12407 is the class being defined in a class-head.
12409 Returns the TYPE_DECL representing the class. */
12412 cp_parser_class_name (cp_parser *parser,
12413 bool typename_keyword_p,
12414 bool template_keyword_p,
12415 enum tag_types tag_type,
12416 bool check_dependency_p,
12418 bool is_declaration)
12425 /* All class-names start with an identifier. */
12426 token = cp_lexer_peek_token (parser->lexer);
12427 if (token->type != CPP_NAME && token->type != CPP_TEMPLATE_ID)
12429 cp_parser_error (parser, "expected class-name");
12430 return error_mark_node;
12433 /* PARSER->SCOPE can be cleared when parsing the template-arguments
12434 to a template-id, so we save it here. */
12435 scope = parser->scope;
12436 if (scope == error_mark_node)
12437 return error_mark_node;
12439 /* Any name names a type if we're following the `typename' keyword
12440 in a qualified name where the enclosing scope is type-dependent. */
12441 typename_p = (typename_keyword_p && scope && TYPE_P (scope)
12442 && dependent_type_p (scope));
12443 /* Handle the common case (an identifier, but not a template-id)
12445 if (token->type == CPP_NAME
12446 && !cp_parser_nth_token_starts_template_argument_list_p (parser, 2))
12450 /* Look for the identifier. */
12451 identifier = cp_parser_identifier (parser);
12452 /* If the next token isn't an identifier, we are certainly not
12453 looking at a class-name. */
12454 if (identifier == error_mark_node)
12455 decl = error_mark_node;
12456 /* If we know this is a type-name, there's no need to look it
12458 else if (typename_p)
12462 /* If the next token is a `::', then the name must be a type
12465 [basic.lookup.qual]
12467 During the lookup for a name preceding the :: scope
12468 resolution operator, object, function, and enumerator
12469 names are ignored. */
12470 if (cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
12471 tag_type = typename_type;
12472 /* Look up the name. */
12473 decl = cp_parser_lookup_name (parser, identifier,
12475 /*is_template=*/false,
12476 /*is_namespace=*/false,
12477 check_dependency_p,
12478 /*ambiguous_p=*/NULL);
12483 /* Try a template-id. */
12484 decl = cp_parser_template_id (parser, template_keyword_p,
12485 check_dependency_p,
12487 if (decl == error_mark_node)
12488 return error_mark_node;
12491 decl = cp_parser_maybe_treat_template_as_class (decl, class_head_p);
12493 /* If this is a typename, create a TYPENAME_TYPE. */
12494 if (typename_p && decl != error_mark_node)
12496 decl = make_typename_type (scope, decl, typename_type, /*complain=*/1);
12497 if (decl != error_mark_node)
12498 decl = TYPE_NAME (decl);
12501 /* Check to see that it is really the name of a class. */
12502 if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
12503 && TREE_CODE (TREE_OPERAND (decl, 0)) == IDENTIFIER_NODE
12504 && cp_lexer_next_token_is (parser->lexer, CPP_SCOPE))
12505 /* Situations like this:
12507 template <typename T> struct A {
12508 typename T::template X<int>::I i;
12511 are problematic. Is `T::template X<int>' a class-name? The
12512 standard does not seem to be definitive, but there is no other
12513 valid interpretation of the following `::'. Therefore, those
12514 names are considered class-names. */
12515 decl = TYPE_NAME (make_typename_type (scope, decl, tag_type, tf_error));
12516 else if (decl == error_mark_node
12517 || TREE_CODE (decl) != TYPE_DECL
12518 || TREE_TYPE (decl) == error_mark_node
12519 || !IS_AGGR_TYPE (TREE_TYPE (decl)))
12521 cp_parser_error (parser, "expected class-name");
12522 return error_mark_node;
12528 /* Parse a class-specifier.
12531 class-head { member-specification [opt] }
12533 Returns the TREE_TYPE representing the class. */
12536 cp_parser_class_specifier (cp_parser* parser)
12540 tree attributes = NULL_TREE;
12541 int has_trailing_semicolon;
12542 bool nested_name_specifier_p;
12543 unsigned saved_num_template_parameter_lists;
12544 tree old_scope = NULL_TREE;
12545 tree scope = NULL_TREE;
12547 push_deferring_access_checks (dk_no_deferred);
12549 /* Parse the class-head. */
12550 type = cp_parser_class_head (parser,
12551 &nested_name_specifier_p,
12553 /* If the class-head was a semantic disaster, skip the entire body
12557 cp_parser_skip_to_end_of_block_or_statement (parser);
12558 pop_deferring_access_checks ();
12559 return error_mark_node;
12562 /* Look for the `{'. */
12563 if (!cp_parser_require (parser, CPP_OPEN_BRACE, "`{'"))
12565 pop_deferring_access_checks ();
12566 return error_mark_node;
12569 /* Issue an error message if type-definitions are forbidden here. */
12570 cp_parser_check_type_definition (parser);
12571 /* Remember that we are defining one more class. */
12572 ++parser->num_classes_being_defined;
12573 /* Inside the class, surrounding template-parameter-lists do not
12575 saved_num_template_parameter_lists
12576 = parser->num_template_parameter_lists;
12577 parser->num_template_parameter_lists = 0;
12579 /* Start the class. */
12580 if (nested_name_specifier_p)
12582 scope = CP_DECL_CONTEXT (TYPE_MAIN_DECL (type));
12583 old_scope = push_inner_scope (scope);
12585 type = begin_class_definition (type);
12587 if (type == error_mark_node)
12588 /* If the type is erroneous, skip the entire body of the class. */
12589 cp_parser_skip_to_closing_brace (parser);
12591 /* Parse the member-specification. */
12592 cp_parser_member_specification_opt (parser);
12594 /* Look for the trailing `}'. */
12595 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
12596 /* We get better error messages by noticing a common problem: a
12597 missing trailing `;'. */
12598 token = cp_lexer_peek_token (parser->lexer);
12599 has_trailing_semicolon = (token->type == CPP_SEMICOLON);
12600 /* Look for trailing attributes to apply to this class. */
12601 if (cp_parser_allow_gnu_extensions_p (parser))
12603 tree sub_attr = cp_parser_attributes_opt (parser);
12604 attributes = chainon (attributes, sub_attr);
12606 if (type != error_mark_node)
12607 type = finish_struct (type, attributes);
12608 if (nested_name_specifier_p)
12609 pop_inner_scope (old_scope, scope);
12610 /* If this class is not itself within the scope of another class,
12611 then we need to parse the bodies of all of the queued function
12612 definitions. Note that the queued functions defined in a class
12613 are not always processed immediately following the
12614 class-specifier for that class. Consider:
12617 struct B { void f() { sizeof (A); } };
12620 If `f' were processed before the processing of `A' were
12621 completed, there would be no way to compute the size of `A'.
12622 Note that the nesting we are interested in here is lexical --
12623 not the semantic nesting given by TYPE_CONTEXT. In particular,
12626 struct A { struct B; };
12627 struct A::B { void f() { } };
12629 there is no need to delay the parsing of `A::B::f'. */
12630 if (--parser->num_classes_being_defined == 0)
12634 tree class_type = NULL_TREE;
12635 tree pushed_scope = NULL_TREE;
12637 /* In a first pass, parse default arguments to the functions.
12638 Then, in a second pass, parse the bodies of the functions.
12639 This two-phased approach handles cases like:
12647 for (TREE_PURPOSE (parser->unparsed_functions_queues)
12648 = nreverse (TREE_PURPOSE (parser->unparsed_functions_queues));
12649 (queue_entry = TREE_PURPOSE (parser->unparsed_functions_queues));
12650 TREE_PURPOSE (parser->unparsed_functions_queues)
12651 = TREE_CHAIN (TREE_PURPOSE (parser->unparsed_functions_queues)))
12653 fn = TREE_VALUE (queue_entry);
12654 /* If there are default arguments that have not yet been processed,
12655 take care of them now. */
12656 if (class_type != TREE_PURPOSE (queue_entry))
12659 pop_scope (pushed_scope);
12660 class_type = TREE_PURPOSE (queue_entry);
12661 pushed_scope = push_scope (class_type);
12663 /* Make sure that any template parameters are in scope. */
12664 maybe_begin_member_template_processing (fn);
12665 /* Parse the default argument expressions. */
12666 cp_parser_late_parsing_default_args (parser, fn);
12667 /* Remove any template parameters from the symbol table. */
12668 maybe_end_member_template_processing ();
12671 pop_scope (pushed_scope);
12672 /* Now parse the body of the functions. */
12673 for (TREE_VALUE (parser->unparsed_functions_queues)
12674 = nreverse (TREE_VALUE (parser->unparsed_functions_queues));
12675 (queue_entry = TREE_VALUE (parser->unparsed_functions_queues));
12676 TREE_VALUE (parser->unparsed_functions_queues)
12677 = TREE_CHAIN (TREE_VALUE (parser->unparsed_functions_queues)))
12679 /* Figure out which function we need to process. */
12680 fn = TREE_VALUE (queue_entry);
12682 /* A hack to prevent garbage collection. */
12685 /* Parse the function. */
12686 cp_parser_late_parsing_for_member (parser, fn);
12691 /* Put back any saved access checks. */
12692 pop_deferring_access_checks ();
12694 /* Restore the count of active template-parameter-lists. */
12695 parser->num_template_parameter_lists
12696 = saved_num_template_parameter_lists;
12701 /* Parse a class-head.
12704 class-key identifier [opt] base-clause [opt]
12705 class-key nested-name-specifier identifier base-clause [opt]
12706 class-key nested-name-specifier [opt] template-id
12710 class-key attributes identifier [opt] base-clause [opt]
12711 class-key attributes nested-name-specifier identifier base-clause [opt]
12712 class-key attributes nested-name-specifier [opt] template-id
12715 Returns the TYPE of the indicated class. Sets
12716 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
12717 involving a nested-name-specifier was used, and FALSE otherwise.
12719 Returns error_mark_node if this is not a class-head.
12721 Returns NULL_TREE if the class-head is syntactically valid, but
12722 semantically invalid in a way that means we should skip the entire
12723 body of the class. */
12726 cp_parser_class_head (cp_parser* parser,
12727 bool* nested_name_specifier_p,
12728 tree *attributes_p)
12730 tree nested_name_specifier;
12731 enum tag_types class_key;
12732 tree id = NULL_TREE;
12733 tree type = NULL_TREE;
12735 bool template_id_p = false;
12736 bool qualified_p = false;
12737 bool invalid_nested_name_p = false;
12738 bool invalid_explicit_specialization_p = false;
12739 tree pushed_scope = NULL_TREE;
12740 unsigned num_templates;
12743 /* Assume no nested-name-specifier will be present. */
12744 *nested_name_specifier_p = false;
12745 /* Assume no template parameter lists will be used in defining the
12749 /* Look for the class-key. */
12750 class_key = cp_parser_class_key (parser);
12751 if (class_key == none_type)
12752 return error_mark_node;
12754 /* Parse the attributes. */
12755 attributes = cp_parser_attributes_opt (parser);
12757 /* If the next token is `::', that is invalid -- but sometimes
12758 people do try to write:
12762 Handle this gracefully by accepting the extra qualifier, and then
12763 issuing an error about it later if this really is a
12764 class-head. If it turns out just to be an elaborated type
12765 specifier, remain silent. */
12766 if (cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false))
12767 qualified_p = true;
12769 push_deferring_access_checks (dk_no_check);
12771 /* Determine the name of the class. Begin by looking for an
12772 optional nested-name-specifier. */
12773 nested_name_specifier
12774 = cp_parser_nested_name_specifier_opt (parser,
12775 /*typename_keyword_p=*/false,
12776 /*check_dependency_p=*/false,
12778 /*is_declaration=*/false);
12779 /* If there was a nested-name-specifier, then there *must* be an
12781 if (nested_name_specifier)
12783 /* Although the grammar says `identifier', it really means
12784 `class-name' or `template-name'. You are only allowed to
12785 define a class that has already been declared with this
12788 The proposed resolution for Core Issue 180 says that whever
12789 you see `class T::X' you should treat `X' as a type-name.
12791 It is OK to define an inaccessible class; for example:
12793 class A { class B; };
12796 We do not know if we will see a class-name, or a
12797 template-name. We look for a class-name first, in case the
12798 class-name is a template-id; if we looked for the
12799 template-name first we would stop after the template-name. */
12800 cp_parser_parse_tentatively (parser);
12801 type = cp_parser_class_name (parser,
12802 /*typename_keyword_p=*/false,
12803 /*template_keyword_p=*/false,
12805 /*check_dependency_p=*/false,
12806 /*class_head_p=*/true,
12807 /*is_declaration=*/false);
12808 /* If that didn't work, ignore the nested-name-specifier. */
12809 if (!cp_parser_parse_definitely (parser))
12811 invalid_nested_name_p = true;
12812 id = cp_parser_identifier (parser);
12813 if (id == error_mark_node)
12816 /* If we could not find a corresponding TYPE, treat this
12817 declaration like an unqualified declaration. */
12818 if (type == error_mark_node)
12819 nested_name_specifier = NULL_TREE;
12820 /* Otherwise, count the number of templates used in TYPE and its
12821 containing scopes. */
12826 for (scope = TREE_TYPE (type);
12827 scope && TREE_CODE (scope) != NAMESPACE_DECL;
12828 scope = (TYPE_P (scope)
12829 ? TYPE_CONTEXT (scope)
12830 : DECL_CONTEXT (scope)))
12832 && CLASS_TYPE_P (scope)
12833 && CLASSTYPE_TEMPLATE_INFO (scope)
12834 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope))
12835 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (scope))
12839 /* Otherwise, the identifier is optional. */
12842 /* We don't know whether what comes next is a template-id,
12843 an identifier, or nothing at all. */
12844 cp_parser_parse_tentatively (parser);
12845 /* Check for a template-id. */
12846 id = cp_parser_template_id (parser,
12847 /*template_keyword_p=*/false,
12848 /*check_dependency_p=*/true,
12849 /*is_declaration=*/true);
12850 /* If that didn't work, it could still be an identifier. */
12851 if (!cp_parser_parse_definitely (parser))
12853 if (cp_lexer_next_token_is (parser->lexer, CPP_NAME))
12854 id = cp_parser_identifier (parser);
12860 template_id_p = true;
12865 pop_deferring_access_checks ();
12868 cp_parser_check_for_invalid_template_id (parser, id);
12870 /* If it's not a `:' or a `{' then we can't really be looking at a
12871 class-head, since a class-head only appears as part of a
12872 class-specifier. We have to detect this situation before calling
12873 xref_tag, since that has irreversible side-effects. */
12874 if (!cp_parser_next_token_starts_class_definition_p (parser))
12876 cp_parser_error (parser, "expected %<{%> or %<:%>");
12877 return error_mark_node;
12880 /* At this point, we're going ahead with the class-specifier, even
12881 if some other problem occurs. */
12882 cp_parser_commit_to_tentative_parse (parser);
12883 /* Issue the error about the overly-qualified name now. */
12885 cp_parser_error (parser,
12886 "global qualification of class name is invalid");
12887 else if (invalid_nested_name_p)
12888 cp_parser_error (parser,
12889 "qualified name does not name a class");
12890 else if (nested_name_specifier)
12894 /* Reject typedef-names in class heads. */
12895 if (!DECL_IMPLICIT_TYPEDEF_P (type))
12897 error ("invalid class name in declaration of %qD", type);
12902 /* Figure out in what scope the declaration is being placed. */
12903 scope = current_scope ();
12904 /* If that scope does not contain the scope in which the
12905 class was originally declared, the program is invalid. */
12906 if (scope && !is_ancestor (scope, nested_name_specifier))
12908 error ("declaration of %qD in %qD which does not enclose %qD",
12909 type, scope, nested_name_specifier);
12915 A declarator-id shall not be qualified exception of the
12916 definition of a ... nested class outside of its class
12917 ... [or] a the definition or explicit instantiation of a
12918 class member of a namespace outside of its namespace. */
12919 if (scope == nested_name_specifier)
12921 pedwarn ("extra qualification ignored");
12922 nested_name_specifier = NULL_TREE;
12926 /* An explicit-specialization must be preceded by "template <>". If
12927 it is not, try to recover gracefully. */
12928 if (at_namespace_scope_p ()
12929 && parser->num_template_parameter_lists == 0
12932 error ("an explicit specialization must be preceded by %<template <>%>");
12933 invalid_explicit_specialization_p = true;
12934 /* Take the same action that would have been taken by
12935 cp_parser_explicit_specialization. */
12936 ++parser->num_template_parameter_lists;
12937 begin_specialization ();
12939 /* There must be no "return" statements between this point and the
12940 end of this function; set "type "to the correct return value and
12941 use "goto done;" to return. */
12942 /* Make sure that the right number of template parameters were
12944 if (!cp_parser_check_template_parameters (parser, num_templates))
12946 /* If something went wrong, there is no point in even trying to
12947 process the class-definition. */
12952 /* Look up the type. */
12955 type = TREE_TYPE (id);
12956 maybe_process_partial_specialization (type);
12957 if (nested_name_specifier)
12958 pushed_scope = push_scope (nested_name_specifier);
12960 else if (nested_name_specifier)
12966 template <typename T> struct S { struct T };
12967 template <typename T> struct S<T>::T { };
12969 we will get a TYPENAME_TYPE when processing the definition of
12970 `S::T'. We need to resolve it to the actual type before we
12971 try to define it. */
12972 if (TREE_CODE (TREE_TYPE (type)) == TYPENAME_TYPE)
12974 class_type = resolve_typename_type (TREE_TYPE (type),
12975 /*only_current_p=*/false);
12976 if (class_type != error_mark_node)
12977 type = TYPE_NAME (class_type);
12980 cp_parser_error (parser, "could not resolve typename type");
12981 type = error_mark_node;
12985 maybe_process_partial_specialization (TREE_TYPE (type));
12986 class_type = current_class_type;
12987 /* Enter the scope indicated by the nested-name-specifier. */
12988 pushed_scope = push_scope (nested_name_specifier);
12989 /* Get the canonical version of this type. */
12990 type = TYPE_MAIN_DECL (TREE_TYPE (type));
12991 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
12992 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (type)))
12994 type = push_template_decl (type);
12995 if (type == error_mark_node)
13002 type = TREE_TYPE (type);
13003 *nested_name_specifier_p = true;
13005 else /* The name is not a nested name. */
13007 /* If the class was unnamed, create a dummy name. */
13009 id = make_anon_name ();
13010 type = xref_tag (class_key, id, /*tag_scope=*/ts_current,
13011 parser->num_template_parameter_lists);
13014 /* Indicate whether this class was declared as a `class' or as a
13016 if (TREE_CODE (type) == RECORD_TYPE)
13017 CLASSTYPE_DECLARED_CLASS (type) = (class_key == class_type);
13018 cp_parser_check_class_key (class_key, type);
13020 /* If this type was already complete, and we see another definition,
13021 that's an error. */
13022 if (type != error_mark_node && COMPLETE_TYPE_P (type))
13024 error ("redefinition of %q#T", type);
13025 cp_error_at ("previous definition of %q#T", type);
13030 /* We will have entered the scope containing the class; the names of
13031 base classes should be looked up in that context. For example:
13033 struct A { struct B {}; struct C; };
13034 struct A::C : B {};
13039 /* Get the list of base-classes, if there is one. */
13040 if (cp_lexer_next_token_is (parser->lexer, CPP_COLON))
13041 bases = cp_parser_base_clause (parser);
13043 /* Process the base classes. */
13044 xref_basetypes (type, bases);
13047 /* Leave the scope given by the nested-name-specifier. We will
13048 enter the class scope itself while processing the members. */
13050 pop_scope (pushed_scope);
13052 if (invalid_explicit_specialization_p)
13054 end_specialization ();
13055 --parser->num_template_parameter_lists;
13057 *attributes_p = attributes;
13061 /* Parse a class-key.
13068 Returns the kind of class-key specified, or none_type to indicate
13071 static enum tag_types
13072 cp_parser_class_key (cp_parser* parser)
13075 enum tag_types tag_type;
13077 /* Look for the class-key. */
13078 token = cp_parser_require (parser, CPP_KEYWORD, "class-key");
13082 /* Check to see if the TOKEN is a class-key. */
13083 tag_type = cp_parser_token_is_class_key (token);
13085 cp_parser_error (parser, "expected class-key");
13089 /* Parse an (optional) member-specification.
13091 member-specification:
13092 member-declaration member-specification [opt]
13093 access-specifier : member-specification [opt] */
13096 cp_parser_member_specification_opt (cp_parser* parser)
13103 /* Peek at the next token. */
13104 token = cp_lexer_peek_token (parser->lexer);
13105 /* If it's a `}', or EOF then we've seen all the members. */
13106 if (token->type == CPP_CLOSE_BRACE || token->type == CPP_EOF)
13109 /* See if this token is a keyword. */
13110 keyword = token->keyword;
13114 case RID_PROTECTED:
13116 /* Consume the access-specifier. */
13117 cp_lexer_consume_token (parser->lexer);
13118 /* Remember which access-specifier is active. */
13119 current_access_specifier = token->value;
13120 /* Look for the `:'. */
13121 cp_parser_require (parser, CPP_COLON, "`:'");
13125 /* Accept #pragmas at class scope. */
13126 if (token->type == CPP_PRAGMA)
13128 cp_lexer_handle_pragma (parser->lexer);
13132 /* Otherwise, the next construction must be a
13133 member-declaration. */
13134 cp_parser_member_declaration (parser);
13139 /* Parse a member-declaration.
13141 member-declaration:
13142 decl-specifier-seq [opt] member-declarator-list [opt] ;
13143 function-definition ; [opt]
13144 :: [opt] nested-name-specifier template [opt] unqualified-id ;
13146 template-declaration
13148 member-declarator-list:
13150 member-declarator-list , member-declarator
13153 declarator pure-specifier [opt]
13154 declarator constant-initializer [opt]
13155 identifier [opt] : constant-expression
13159 member-declaration:
13160 __extension__ member-declaration
13163 declarator attributes [opt] pure-specifier [opt]
13164 declarator attributes [opt] constant-initializer [opt]
13165 identifier [opt] attributes [opt] : constant-expression */
13168 cp_parser_member_declaration (cp_parser* parser)
13170 cp_decl_specifier_seq decl_specifiers;
13171 tree prefix_attributes;
13173 int declares_class_or_enum;
13176 int saved_pedantic;
13178 /* Check for the `__extension__' keyword. */
13179 if (cp_parser_extension_opt (parser, &saved_pedantic))
13182 cp_parser_member_declaration (parser);
13183 /* Restore the old value of the PEDANTIC flag. */
13184 pedantic = saved_pedantic;
13189 /* Check for a template-declaration. */
13190 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
13192 /* Parse the template-declaration. */
13193 cp_parser_template_declaration (parser, /*member_p=*/true);
13198 /* Check for a using-declaration. */
13199 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_USING))
13201 /* Parse the using-declaration. */
13202 cp_parser_using_declaration (parser);
13207 /* Check for @defs. */
13208 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_DEFS))
13211 tree ivar_chains = cp_parser_objc_defs_expression (parser);
13212 ivar = ivar_chains;
13216 ivar = TREE_CHAIN (member);
13217 TREE_CHAIN (member) = NULL_TREE;
13218 finish_member_declaration (member);
13223 /* Parse the decl-specifier-seq. */
13224 cp_parser_decl_specifier_seq (parser,
13225 CP_PARSER_FLAGS_OPTIONAL,
13227 &declares_class_or_enum);
13228 prefix_attributes = decl_specifiers.attributes;
13229 decl_specifiers.attributes = NULL_TREE;
13230 /* Check for an invalid type-name. */
13231 if (!decl_specifiers.type
13232 && cp_parser_parse_and_diagnose_invalid_type_name (parser))
13234 /* If there is no declarator, then the decl-specifier-seq should
13236 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
13238 /* If there was no decl-specifier-seq, and the next token is a
13239 `;', then we have something like:
13245 Each member-declaration shall declare at least one member
13246 name of the class. */
13247 if (!decl_specifiers.any_specifiers_p)
13249 cp_token *token = cp_lexer_peek_token (parser->lexer);
13250 if (pedantic && !token->in_system_header)
13251 pedwarn ("%Hextra %<;%>", &token->location);
13257 /* See if this declaration is a friend. */
13258 friend_p = cp_parser_friend_p (&decl_specifiers);
13259 /* If there were decl-specifiers, check to see if there was
13260 a class-declaration. */
13261 type = check_tag_decl (&decl_specifiers);
13262 /* Nested classes have already been added to the class, but
13263 a `friend' needs to be explicitly registered. */
13266 /* If the `friend' keyword was present, the friend must
13267 be introduced with a class-key. */
13268 if (!declares_class_or_enum)
13269 error ("a class-key must be used when declaring a friend");
13272 template <typename T> struct A {
13273 friend struct A<T>::B;
13276 A<T>::B will be represented by a TYPENAME_TYPE, and
13277 therefore not recognized by check_tag_decl. */
13279 && decl_specifiers.type
13280 && TYPE_P (decl_specifiers.type))
13281 type = decl_specifiers.type;
13282 if (!type || !TYPE_P (type))
13283 error ("friend declaration does not name a class or "
13286 make_friend_class (current_class_type, type,
13287 /*complain=*/true);
13289 /* If there is no TYPE, an error message will already have
13291 else if (!type || type == error_mark_node)
13293 /* An anonymous aggregate has to be handled specially; such
13294 a declaration really declares a data member (with a
13295 particular type), as opposed to a nested class. */
13296 else if (ANON_AGGR_TYPE_P (type))
13298 /* Remove constructors and such from TYPE, now that we
13299 know it is an anonymous aggregate. */
13300 fixup_anonymous_aggr (type);
13301 /* And make the corresponding data member. */
13302 decl = build_decl (FIELD_DECL, NULL_TREE, type);
13303 /* Add it to the class. */
13304 finish_member_declaration (decl);
13307 cp_parser_check_access_in_redeclaration (TYPE_NAME (type));
13312 /* See if these declarations will be friends. */
13313 friend_p = cp_parser_friend_p (&decl_specifiers);
13315 /* Keep going until we hit the `;' at the end of the
13317 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
13319 tree attributes = NULL_TREE;
13320 tree first_attribute;
13322 /* Peek at the next token. */
13323 token = cp_lexer_peek_token (parser->lexer);
13325 /* Check for a bitfield declaration. */
13326 if (token->type == CPP_COLON
13327 || (token->type == CPP_NAME
13328 && cp_lexer_peek_nth_token (parser->lexer, 2)->type
13334 /* Get the name of the bitfield. Note that we cannot just
13335 check TOKEN here because it may have been invalidated by
13336 the call to cp_lexer_peek_nth_token above. */
13337 if (cp_lexer_peek_token (parser->lexer)->type != CPP_COLON)
13338 identifier = cp_parser_identifier (parser);
13340 identifier = NULL_TREE;
13342 /* Consume the `:' token. */
13343 cp_lexer_consume_token (parser->lexer);
13344 /* Get the width of the bitfield. */
13346 = cp_parser_constant_expression (parser,
13347 /*allow_non_constant=*/false,
13350 /* Look for attributes that apply to the bitfield. */
13351 attributes = cp_parser_attributes_opt (parser);
13352 /* Remember which attributes are prefix attributes and
13354 first_attribute = attributes;
13355 /* Combine the attributes. */
13356 attributes = chainon (prefix_attributes, attributes);
13358 /* Create the bitfield declaration. */
13359 decl = grokbitfield (identifier
13360 ? make_id_declarator (NULL_TREE,
13365 /* Apply the attributes. */
13366 cplus_decl_attributes (&decl, attributes, /*flags=*/0);
13370 cp_declarator *declarator;
13372 tree asm_specification;
13373 int ctor_dtor_or_conv_p;
13375 /* Parse the declarator. */
13377 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
13378 &ctor_dtor_or_conv_p,
13379 /*parenthesized_p=*/NULL,
13380 /*member_p=*/true);
13382 /* If something went wrong parsing the declarator, make sure
13383 that we at least consume some tokens. */
13384 if (declarator == cp_error_declarator)
13386 /* Skip to the end of the statement. */
13387 cp_parser_skip_to_end_of_statement (parser);
13388 /* If the next token is not a semicolon, that is
13389 probably because we just skipped over the body of
13390 a function. So, we consume a semicolon if
13391 present, but do not issue an error message if it
13393 if (cp_lexer_next_token_is (parser->lexer,
13395 cp_lexer_consume_token (parser->lexer);
13399 if (declares_class_or_enum & 2)
13400 cp_parser_check_for_definition_in_return_type
13401 (declarator, decl_specifiers.type);
13403 /* Look for an asm-specification. */
13404 asm_specification = cp_parser_asm_specification_opt (parser);
13405 /* Look for attributes that apply to the declaration. */
13406 attributes = cp_parser_attributes_opt (parser);
13407 /* Remember which attributes are prefix attributes and
13409 first_attribute = attributes;
13410 /* Combine the attributes. */
13411 attributes = chainon (prefix_attributes, attributes);
13413 /* If it's an `=', then we have a constant-initializer or a
13414 pure-specifier. It is not correct to parse the
13415 initializer before registering the member declaration
13416 since the member declaration should be in scope while
13417 its initializer is processed. However, the rest of the
13418 front end does not yet provide an interface that allows
13419 us to handle this correctly. */
13420 if (cp_lexer_next_token_is (parser->lexer, CPP_EQ))
13424 A pure-specifier shall be used only in the declaration of
13425 a virtual function.
13427 A member-declarator can contain a constant-initializer
13428 only if it declares a static member of integral or
13431 Therefore, if the DECLARATOR is for a function, we look
13432 for a pure-specifier; otherwise, we look for a
13433 constant-initializer. When we call `grokfield', it will
13434 perform more stringent semantics checks. */
13435 if (declarator->kind == cdk_function)
13436 initializer = cp_parser_pure_specifier (parser);
13438 /* Parse the initializer. */
13439 initializer = cp_parser_constant_initializer (parser);
13441 /* Otherwise, there is no initializer. */
13443 initializer = NULL_TREE;
13445 /* See if we are probably looking at a function
13446 definition. We are certainly not looking at a
13447 member-declarator. Calling `grokfield' has
13448 side-effects, so we must not do it unless we are sure
13449 that we are looking at a member-declarator. */
13450 if (cp_parser_token_starts_function_definition_p
13451 (cp_lexer_peek_token (parser->lexer)))
13453 /* The grammar does not allow a pure-specifier to be
13454 used when a member function is defined. (It is
13455 possible that this fact is an oversight in the
13456 standard, since a pure function may be defined
13457 outside of the class-specifier. */
13459 error ("pure-specifier on function-definition");
13460 decl = cp_parser_save_member_function_body (parser,
13464 /* If the member was not a friend, declare it here. */
13466 finish_member_declaration (decl);
13467 /* Peek at the next token. */
13468 token = cp_lexer_peek_token (parser->lexer);
13469 /* If the next token is a semicolon, consume it. */
13470 if (token->type == CPP_SEMICOLON)
13471 cp_lexer_consume_token (parser->lexer);
13476 /* Create the declaration. */
13477 decl = grokfield (declarator, &decl_specifiers,
13478 initializer, asm_specification,
13480 /* Any initialization must have been from a
13481 constant-expression. */
13482 if (decl && TREE_CODE (decl) == VAR_DECL && initializer)
13483 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = 1;
13487 /* Reset PREFIX_ATTRIBUTES. */
13488 while (attributes && TREE_CHAIN (attributes) != first_attribute)
13489 attributes = TREE_CHAIN (attributes);
13491 TREE_CHAIN (attributes) = NULL_TREE;
13493 /* If there is any qualification still in effect, clear it
13494 now; we will be starting fresh with the next declarator. */
13495 parser->scope = NULL_TREE;
13496 parser->qualifying_scope = NULL_TREE;
13497 parser->object_scope = NULL_TREE;
13498 /* If it's a `,', then there are more declarators. */
13499 if (cp_lexer_next_token_is (parser->lexer, CPP_COMMA))
13500 cp_lexer_consume_token (parser->lexer);
13501 /* If the next token isn't a `;', then we have a parse error. */
13502 else if (cp_lexer_next_token_is_not (parser->lexer,
13505 cp_parser_error (parser, "expected %<;%>");
13506 /* Skip tokens until we find a `;'. */
13507 cp_parser_skip_to_end_of_statement (parser);
13514 /* Add DECL to the list of members. */
13516 finish_member_declaration (decl);
13518 if (TREE_CODE (decl) == FUNCTION_DECL)
13519 cp_parser_save_default_args (parser, decl);
13524 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
13527 /* Parse a pure-specifier.
13532 Returns INTEGER_ZERO_NODE if a pure specifier is found.
13533 Otherwise, ERROR_MARK_NODE is returned. */
13536 cp_parser_pure_specifier (cp_parser* parser)
13540 /* Look for the `=' token. */
13541 if (!cp_parser_require (parser, CPP_EQ, "`='"))
13542 return error_mark_node;
13543 /* Look for the `0' token. */
13544 token = cp_lexer_consume_token (parser->lexer);
13545 if (token->type != CPP_NUMBER || !integer_zerop (token->value))
13547 cp_parser_error (parser,
13548 "invalid pure specifier (only `= 0' is allowed)");
13549 cp_parser_skip_to_end_of_statement (parser);
13550 return error_mark_node;
13553 /* FIXME: Unfortunately, this will accept `0L' and `0x00' as well.
13554 We need to get information from the lexer about how the number
13555 was spelled in order to fix this problem. */
13556 return integer_zero_node;
13559 /* Parse a constant-initializer.
13561 constant-initializer:
13562 = constant-expression
13564 Returns a representation of the constant-expression. */
13567 cp_parser_constant_initializer (cp_parser* parser)
13569 /* Look for the `=' token. */
13570 if (!cp_parser_require (parser, CPP_EQ, "`='"))
13571 return error_mark_node;
13573 /* It is invalid to write:
13575 struct S { static const int i = { 7 }; };
13578 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_BRACE))
13580 cp_parser_error (parser,
13581 "a brace-enclosed initializer is not allowed here");
13582 /* Consume the opening brace. */
13583 cp_lexer_consume_token (parser->lexer);
13584 /* Skip the initializer. */
13585 cp_parser_skip_to_closing_brace (parser);
13586 /* Look for the trailing `}'. */
13587 cp_parser_require (parser, CPP_CLOSE_BRACE, "`}'");
13589 return error_mark_node;
13592 return cp_parser_constant_expression (parser,
13593 /*allow_non_constant=*/false,
13597 /* Derived classes [gram.class.derived] */
13599 /* Parse a base-clause.
13602 : base-specifier-list
13604 base-specifier-list:
13606 base-specifier-list , base-specifier
13608 Returns a TREE_LIST representing the base-classes, in the order in
13609 which they were declared. The representation of each node is as
13610 described by cp_parser_base_specifier.
13612 In the case that no bases are specified, this function will return
13613 NULL_TREE, not ERROR_MARK_NODE. */
13616 cp_parser_base_clause (cp_parser* parser)
13618 tree bases = NULL_TREE;
13620 /* Look for the `:' that begins the list. */
13621 cp_parser_require (parser, CPP_COLON, "`:'");
13623 /* Scan the base-specifier-list. */
13629 /* Look for the base-specifier. */
13630 base = cp_parser_base_specifier (parser);
13631 /* Add BASE to the front of the list. */
13632 if (base != error_mark_node)
13634 TREE_CHAIN (base) = bases;
13637 /* Peek at the next token. */
13638 token = cp_lexer_peek_token (parser->lexer);
13639 /* If it's not a comma, then the list is complete. */
13640 if (token->type != CPP_COMMA)
13642 /* Consume the `,'. */
13643 cp_lexer_consume_token (parser->lexer);
13646 /* PARSER->SCOPE may still be non-NULL at this point, if the last
13647 base class had a qualified name. However, the next name that
13648 appears is certainly not qualified. */
13649 parser->scope = NULL_TREE;
13650 parser->qualifying_scope = NULL_TREE;
13651 parser->object_scope = NULL_TREE;
13653 return nreverse (bases);
13656 /* Parse a base-specifier.
13659 :: [opt] nested-name-specifier [opt] class-name
13660 virtual access-specifier [opt] :: [opt] nested-name-specifier
13662 access-specifier virtual [opt] :: [opt] nested-name-specifier
13665 Returns a TREE_LIST. The TREE_PURPOSE will be one of
13666 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
13667 indicate the specifiers provided. The TREE_VALUE will be a TYPE
13668 (or the ERROR_MARK_NODE) indicating the type that was specified. */
13671 cp_parser_base_specifier (cp_parser* parser)
13675 bool virtual_p = false;
13676 bool duplicate_virtual_error_issued_p = false;
13677 bool duplicate_access_error_issued_p = false;
13678 bool class_scope_p, template_p;
13679 tree access = access_default_node;
13682 /* Process the optional `virtual' and `access-specifier'. */
13685 /* Peek at the next token. */
13686 token = cp_lexer_peek_token (parser->lexer);
13687 /* Process `virtual'. */
13688 switch (token->keyword)
13691 /* If `virtual' appears more than once, issue an error. */
13692 if (virtual_p && !duplicate_virtual_error_issued_p)
13694 cp_parser_error (parser,
13695 "%<virtual%> specified more than once in base-specified");
13696 duplicate_virtual_error_issued_p = true;
13701 /* Consume the `virtual' token. */
13702 cp_lexer_consume_token (parser->lexer);
13707 case RID_PROTECTED:
13709 /* If more than one access specifier appears, issue an
13711 if (access != access_default_node
13712 && !duplicate_access_error_issued_p)
13714 cp_parser_error (parser,
13715 "more than one access specifier in base-specified");
13716 duplicate_access_error_issued_p = true;
13719 access = ridpointers[(int) token->keyword];
13721 /* Consume the access-specifier. */
13722 cp_lexer_consume_token (parser->lexer);
13731 /* It is not uncommon to see programs mechanically, erroneously, use
13732 the 'typename' keyword to denote (dependent) qualified types
13733 as base classes. */
13734 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TYPENAME))
13736 if (!processing_template_decl)
13737 error ("keyword %<typename%> not allowed outside of templates");
13739 error ("keyword %<typename%> not allowed in this context "
13740 "(the base class is implicitly a type)");
13741 cp_lexer_consume_token (parser->lexer);
13744 /* Look for the optional `::' operator. */
13745 cp_parser_global_scope_opt (parser, /*current_scope_valid_p=*/false);
13746 /* Look for the nested-name-specifier. The simplest way to
13751 The keyword `typename' is not permitted in a base-specifier or
13752 mem-initializer; in these contexts a qualified name that
13753 depends on a template-parameter is implicitly assumed to be a
13756 is to pretend that we have seen the `typename' keyword at this
13758 cp_parser_nested_name_specifier_opt (parser,
13759 /*typename_keyword_p=*/true,
13760 /*check_dependency_p=*/true,
13762 /*is_declaration=*/true);
13763 /* If the base class is given by a qualified name, assume that names
13764 we see are type names or templates, as appropriate. */
13765 class_scope_p = (parser->scope && TYPE_P (parser->scope));
13766 template_p = class_scope_p && cp_parser_optional_template_keyword (parser);
13768 /* Finally, look for the class-name. */
13769 type = cp_parser_class_name (parser,
13773 /*check_dependency_p=*/true,
13774 /*class_head_p=*/false,
13775 /*is_declaration=*/true);
13777 if (type == error_mark_node)
13778 return error_mark_node;
13780 return finish_base_specifier (TREE_TYPE (type), access, virtual_p);
13783 /* Exception handling [gram.exception] */
13785 /* Parse an (optional) exception-specification.
13787 exception-specification:
13788 throw ( type-id-list [opt] )
13790 Returns a TREE_LIST representing the exception-specification. The
13791 TREE_VALUE of each node is a type. */
13794 cp_parser_exception_specification_opt (cp_parser* parser)
13799 /* Peek at the next token. */
13800 token = cp_lexer_peek_token (parser->lexer);
13801 /* If it's not `throw', then there's no exception-specification. */
13802 if (!cp_parser_is_keyword (token, RID_THROW))
13805 /* Consume the `throw'. */
13806 cp_lexer_consume_token (parser->lexer);
13808 /* Look for the `('. */
13809 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13811 /* Peek at the next token. */
13812 token = cp_lexer_peek_token (parser->lexer);
13813 /* If it's not a `)', then there is a type-id-list. */
13814 if (token->type != CPP_CLOSE_PAREN)
13816 const char *saved_message;
13818 /* Types may not be defined in an exception-specification. */
13819 saved_message = parser->type_definition_forbidden_message;
13820 parser->type_definition_forbidden_message
13821 = "types may not be defined in an exception-specification";
13822 /* Parse the type-id-list. */
13823 type_id_list = cp_parser_type_id_list (parser);
13824 /* Restore the saved message. */
13825 parser->type_definition_forbidden_message = saved_message;
13828 type_id_list = empty_except_spec;
13830 /* Look for the `)'. */
13831 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13833 return type_id_list;
13836 /* Parse an (optional) type-id-list.
13840 type-id-list , type-id
13842 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
13843 in the order that the types were presented. */
13846 cp_parser_type_id_list (cp_parser* parser)
13848 tree types = NULL_TREE;
13855 /* Get the next type-id. */
13856 type = cp_parser_type_id (parser);
13857 /* Add it to the list. */
13858 types = add_exception_specifier (types, type, /*complain=*/1);
13859 /* Peek at the next token. */
13860 token = cp_lexer_peek_token (parser->lexer);
13861 /* If it is not a `,', we are done. */
13862 if (token->type != CPP_COMMA)
13864 /* Consume the `,'. */
13865 cp_lexer_consume_token (parser->lexer);
13868 return nreverse (types);
13871 /* Parse a try-block.
13874 try compound-statement handler-seq */
13877 cp_parser_try_block (cp_parser* parser)
13881 cp_parser_require_keyword (parser, RID_TRY, "`try'");
13882 try_block = begin_try_block ();
13883 cp_parser_compound_statement (parser, NULL, true);
13884 finish_try_block (try_block);
13885 cp_parser_handler_seq (parser);
13886 finish_handler_sequence (try_block);
13891 /* Parse a function-try-block.
13893 function-try-block:
13894 try ctor-initializer [opt] function-body handler-seq */
13897 cp_parser_function_try_block (cp_parser* parser)
13900 bool ctor_initializer_p;
13902 /* Look for the `try' keyword. */
13903 if (!cp_parser_require_keyword (parser, RID_TRY, "`try'"))
13905 /* Let the rest of the front-end know where we are. */
13906 try_block = begin_function_try_block ();
13907 /* Parse the function-body. */
13909 = cp_parser_ctor_initializer_opt_and_function_body (parser);
13910 /* We're done with the `try' part. */
13911 finish_function_try_block (try_block);
13912 /* Parse the handlers. */
13913 cp_parser_handler_seq (parser);
13914 /* We're done with the handlers. */
13915 finish_function_handler_sequence (try_block);
13917 return ctor_initializer_p;
13920 /* Parse a handler-seq.
13923 handler handler-seq [opt] */
13926 cp_parser_handler_seq (cp_parser* parser)
13932 /* Parse the handler. */
13933 cp_parser_handler (parser);
13934 /* Peek at the next token. */
13935 token = cp_lexer_peek_token (parser->lexer);
13936 /* If it's not `catch' then there are no more handlers. */
13937 if (!cp_parser_is_keyword (token, RID_CATCH))
13942 /* Parse a handler.
13945 catch ( exception-declaration ) compound-statement */
13948 cp_parser_handler (cp_parser* parser)
13953 cp_parser_require_keyword (parser, RID_CATCH, "`catch'");
13954 handler = begin_handler ();
13955 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
13956 declaration = cp_parser_exception_declaration (parser);
13957 finish_handler_parms (declaration, handler);
13958 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
13959 cp_parser_compound_statement (parser, NULL, false);
13960 finish_handler (handler);
13963 /* Parse an exception-declaration.
13965 exception-declaration:
13966 type-specifier-seq declarator
13967 type-specifier-seq abstract-declarator
13971 Returns a VAR_DECL for the declaration, or NULL_TREE if the
13972 ellipsis variant is used. */
13975 cp_parser_exception_declaration (cp_parser* parser)
13978 cp_decl_specifier_seq type_specifiers;
13979 cp_declarator *declarator;
13980 const char *saved_message;
13982 /* If it's an ellipsis, it's easy to handle. */
13983 if (cp_lexer_next_token_is (parser->lexer, CPP_ELLIPSIS))
13985 /* Consume the `...' token. */
13986 cp_lexer_consume_token (parser->lexer);
13990 /* Types may not be defined in exception-declarations. */
13991 saved_message = parser->type_definition_forbidden_message;
13992 parser->type_definition_forbidden_message
13993 = "types may not be defined in exception-declarations";
13995 /* Parse the type-specifier-seq. */
13996 cp_parser_type_specifier_seq (parser, /*is_condition=*/false,
13998 /* If it's a `)', then there is no declarator. */
13999 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_PAREN))
14002 declarator = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_EITHER,
14003 /*ctor_dtor_or_conv_p=*/NULL,
14004 /*parenthesized_p=*/NULL,
14005 /*member_p=*/false);
14007 /* Restore the saved message. */
14008 parser->type_definition_forbidden_message = saved_message;
14010 if (type_specifiers.any_specifiers_p)
14012 decl = grokdeclarator (declarator, &type_specifiers, CATCHPARM, 1, NULL);
14013 if (decl == NULL_TREE)
14014 error ("invalid catch parameter");
14022 /* Parse a throw-expression.
14025 throw assignment-expression [opt]
14027 Returns a THROW_EXPR representing the throw-expression. */
14030 cp_parser_throw_expression (cp_parser* parser)
14035 cp_parser_require_keyword (parser, RID_THROW, "`throw'");
14036 token = cp_lexer_peek_token (parser->lexer);
14037 /* Figure out whether or not there is an assignment-expression
14038 following the "throw" keyword. */
14039 if (token->type == CPP_COMMA
14040 || token->type == CPP_SEMICOLON
14041 || token->type == CPP_CLOSE_PAREN
14042 || token->type == CPP_CLOSE_SQUARE
14043 || token->type == CPP_CLOSE_BRACE
14044 || token->type == CPP_COLON)
14045 expression = NULL_TREE;
14047 expression = cp_parser_assignment_expression (parser,
14050 return build_throw (expression);
14053 /* GNU Extensions */
14055 /* Parse an (optional) asm-specification.
14058 asm ( string-literal )
14060 If the asm-specification is present, returns a STRING_CST
14061 corresponding to the string-literal. Otherwise, returns
14065 cp_parser_asm_specification_opt (cp_parser* parser)
14068 tree asm_specification;
14070 /* Peek at the next token. */
14071 token = cp_lexer_peek_token (parser->lexer);
14072 /* If the next token isn't the `asm' keyword, then there's no
14073 asm-specification. */
14074 if (!cp_parser_is_keyword (token, RID_ASM))
14077 /* Consume the `asm' token. */
14078 cp_lexer_consume_token (parser->lexer);
14079 /* Look for the `('. */
14080 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14082 /* Look for the string-literal. */
14083 asm_specification = cp_parser_string_literal (parser, false, false);
14085 /* Look for the `)'. */
14086 cp_parser_require (parser, CPP_CLOSE_PAREN, "`('");
14088 return asm_specification;
14091 /* Parse an asm-operand-list.
14095 asm-operand-list , asm-operand
14098 string-literal ( expression )
14099 [ string-literal ] string-literal ( expression )
14101 Returns a TREE_LIST representing the operands. The TREE_VALUE of
14102 each node is the expression. The TREE_PURPOSE is itself a
14103 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
14104 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
14105 is a STRING_CST for the string literal before the parenthesis. */
14108 cp_parser_asm_operand_list (cp_parser* parser)
14110 tree asm_operands = NULL_TREE;
14114 tree string_literal;
14118 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_SQUARE))
14120 /* Consume the `[' token. */
14121 cp_lexer_consume_token (parser->lexer);
14122 /* Read the operand name. */
14123 name = cp_parser_identifier (parser);
14124 if (name != error_mark_node)
14125 name = build_string (IDENTIFIER_LENGTH (name),
14126 IDENTIFIER_POINTER (name));
14127 /* Look for the closing `]'. */
14128 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
14132 /* Look for the string-literal. */
14133 string_literal = cp_parser_string_literal (parser, false, false);
14135 /* Look for the `('. */
14136 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14137 /* Parse the expression. */
14138 expression = cp_parser_expression (parser, /*cast_p=*/false);
14139 /* Look for the `)'. */
14140 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14142 /* Add this operand to the list. */
14143 asm_operands = tree_cons (build_tree_list (name, string_literal),
14146 /* If the next token is not a `,', there are no more
14148 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
14150 /* Consume the `,'. */
14151 cp_lexer_consume_token (parser->lexer);
14154 return nreverse (asm_operands);
14157 /* Parse an asm-clobber-list.
14161 asm-clobber-list , string-literal
14163 Returns a TREE_LIST, indicating the clobbers in the order that they
14164 appeared. The TREE_VALUE of each node is a STRING_CST. */
14167 cp_parser_asm_clobber_list (cp_parser* parser)
14169 tree clobbers = NULL_TREE;
14173 tree string_literal;
14175 /* Look for the string literal. */
14176 string_literal = cp_parser_string_literal (parser, false, false);
14177 /* Add it to the list. */
14178 clobbers = tree_cons (NULL_TREE, string_literal, clobbers);
14179 /* If the next token is not a `,', then the list is
14181 if (cp_lexer_next_token_is_not (parser->lexer, CPP_COMMA))
14183 /* Consume the `,' token. */
14184 cp_lexer_consume_token (parser->lexer);
14190 /* Parse an (optional) series of attributes.
14193 attributes attribute
14196 __attribute__ (( attribute-list [opt] ))
14198 The return value is as for cp_parser_attribute_list. */
14201 cp_parser_attributes_opt (cp_parser* parser)
14203 tree attributes = NULL_TREE;
14208 tree attribute_list;
14210 /* Peek at the next token. */
14211 token = cp_lexer_peek_token (parser->lexer);
14212 /* If it's not `__attribute__', then we're done. */
14213 if (token->keyword != RID_ATTRIBUTE)
14216 /* Consume the `__attribute__' keyword. */
14217 cp_lexer_consume_token (parser->lexer);
14218 /* Look for the two `(' tokens. */
14219 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14220 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
14222 /* Peek at the next token. */
14223 token = cp_lexer_peek_token (parser->lexer);
14224 if (token->type != CPP_CLOSE_PAREN)
14225 /* Parse the attribute-list. */
14226 attribute_list = cp_parser_attribute_list (parser);
14228 /* If the next token is a `)', then there is no attribute
14230 attribute_list = NULL;
14232 /* Look for the two `)' tokens. */
14233 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14234 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
14236 /* Add these new attributes to the list. */
14237 attributes = chainon (attributes, attribute_list);
14243 /* Parse an attribute-list.
14247 attribute-list , attribute
14251 identifier ( identifier )
14252 identifier ( identifier , expression-list )
14253 identifier ( expression-list )
14255 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
14256 to an attribute. The TREE_PURPOSE of each node is the identifier
14257 indicating which attribute is in use. The TREE_VALUE represents
14258 the arguments, if any. */
14261 cp_parser_attribute_list (cp_parser* parser)
14263 tree attribute_list = NULL_TREE;
14264 bool save_translate_strings_p = parser->translate_strings_p;
14266 parser->translate_strings_p = false;
14273 /* Look for the identifier. We also allow keywords here; for
14274 example `__attribute__ ((const))' is legal. */
14275 token = cp_lexer_peek_token (parser->lexer);
14276 if (token->type == CPP_NAME
14277 || token->type == CPP_KEYWORD)
14279 /* Consume the token. */
14280 token = cp_lexer_consume_token (parser->lexer);
14282 /* Save away the identifier that indicates which attribute
14284 identifier = token->value;
14285 attribute = build_tree_list (identifier, NULL_TREE);
14287 /* Peek at the next token. */
14288 token = cp_lexer_peek_token (parser->lexer);
14289 /* If it's an `(', then parse the attribute arguments. */
14290 if (token->type == CPP_OPEN_PAREN)
14294 arguments = (cp_parser_parenthesized_expression_list
14295 (parser, true, /*cast_p=*/false,
14296 /*non_constant_p=*/NULL));
14297 /* Save the identifier and arguments away. */
14298 TREE_VALUE (attribute) = arguments;
14301 /* Add this attribute to the list. */
14302 TREE_CHAIN (attribute) = attribute_list;
14303 attribute_list = attribute;
14305 token = cp_lexer_peek_token (parser->lexer);
14307 /* Now, look for more attributes. If the next token isn't a
14308 `,', we're done. */
14309 if (token->type != CPP_COMMA)
14312 /* Consume the comma and keep going. */
14313 cp_lexer_consume_token (parser->lexer);
14315 parser->translate_strings_p = save_translate_strings_p;
14317 /* We built up the list in reverse order. */
14318 return nreverse (attribute_list);
14321 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
14322 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
14323 current value of the PEDANTIC flag, regardless of whether or not
14324 the `__extension__' keyword is present. The caller is responsible
14325 for restoring the value of the PEDANTIC flag. */
14328 cp_parser_extension_opt (cp_parser* parser, int* saved_pedantic)
14330 /* Save the old value of the PEDANTIC flag. */
14331 *saved_pedantic = pedantic;
14333 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_EXTENSION))
14335 /* Consume the `__extension__' token. */
14336 cp_lexer_consume_token (parser->lexer);
14337 /* We're not being pedantic while the `__extension__' keyword is
14347 /* Parse a label declaration.
14350 __label__ label-declarator-seq ;
14352 label-declarator-seq:
14353 identifier , label-declarator-seq
14357 cp_parser_label_declaration (cp_parser* parser)
14359 /* Look for the `__label__' keyword. */
14360 cp_parser_require_keyword (parser, RID_LABEL, "`__label__'");
14366 /* Look for an identifier. */
14367 identifier = cp_parser_identifier (parser);
14368 /* Declare it as a lobel. */
14369 finish_label_decl (identifier);
14370 /* If the next token is a `;', stop. */
14371 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
14373 /* Look for the `,' separating the label declarations. */
14374 cp_parser_require (parser, CPP_COMMA, "`,'");
14377 /* Look for the final `;'. */
14378 cp_parser_require (parser, CPP_SEMICOLON, "`;'");
14381 /* Support Functions */
14383 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
14384 NAME should have one of the representations used for an
14385 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
14386 is returned. If PARSER->SCOPE is a dependent type, then a
14387 SCOPE_REF is returned.
14389 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
14390 returned; the name was already resolved when the TEMPLATE_ID_EXPR
14391 was formed. Abstractly, such entities should not be passed to this
14392 function, because they do not need to be looked up, but it is
14393 simpler to check for this special case here, rather than at the
14396 In cases not explicitly covered above, this function returns a
14397 DECL, OVERLOAD, or baselink representing the result of the lookup.
14398 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
14401 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
14402 (e.g., "struct") that was used. In that case bindings that do not
14403 refer to types are ignored.
14405 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
14408 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
14411 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
14414 If AMBIGUOUS_P is non-NULL, it is set to true if name-lookup
14415 results in an ambiguity, and false otherwise. */
14418 cp_parser_lookup_name (cp_parser *parser, tree name,
14419 enum tag_types tag_type,
14420 bool is_template, bool is_namespace,
14421 bool check_dependency,
14425 tree object_type = parser->context->object_type;
14427 /* Assume that the lookup will be unambiguous. */
14429 *ambiguous_p = false;
14431 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
14432 no longer valid. Note that if we are parsing tentatively, and
14433 the parse fails, OBJECT_TYPE will be automatically restored. */
14434 parser->context->object_type = NULL_TREE;
14436 if (name == error_mark_node)
14437 return error_mark_node;
14439 /* A template-id has already been resolved; there is no lookup to
14441 if (TREE_CODE (name) == TEMPLATE_ID_EXPR)
14443 if (BASELINK_P (name))
14445 gcc_assert (TREE_CODE (BASELINK_FUNCTIONS (name))
14446 == TEMPLATE_ID_EXPR);
14450 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
14451 it should already have been checked to make sure that the name
14452 used matches the type being destroyed. */
14453 if (TREE_CODE (name) == BIT_NOT_EXPR)
14457 /* Figure out to which type this destructor applies. */
14459 type = parser->scope;
14460 else if (object_type)
14461 type = object_type;
14463 type = current_class_type;
14464 /* If that's not a class type, there is no destructor. */
14465 if (!type || !CLASS_TYPE_P (type))
14466 return error_mark_node;
14467 if (CLASSTYPE_LAZY_DESTRUCTOR (type))
14468 lazily_declare_fn (sfk_destructor, type);
14469 if (!CLASSTYPE_DESTRUCTORS (type))
14470 return error_mark_node;
14471 /* If it was a class type, return the destructor. */
14472 return CLASSTYPE_DESTRUCTORS (type);
14475 /* By this point, the NAME should be an ordinary identifier. If
14476 the id-expression was a qualified name, the qualifying scope is
14477 stored in PARSER->SCOPE at this point. */
14478 gcc_assert (TREE_CODE (name) == IDENTIFIER_NODE);
14480 /* Perform the lookup. */
14485 if (parser->scope == error_mark_node)
14486 return error_mark_node;
14488 /* If the SCOPE is dependent, the lookup must be deferred until
14489 the template is instantiated -- unless we are explicitly
14490 looking up names in uninstantiated templates. Even then, we
14491 cannot look up the name if the scope is not a class type; it
14492 might, for example, be a template type parameter. */
14493 dependent_p = (TYPE_P (parser->scope)
14494 && !(parser->in_declarator_p
14495 && currently_open_class (parser->scope))
14496 && dependent_type_p (parser->scope));
14497 if ((check_dependency || !CLASS_TYPE_P (parser->scope))
14504 /* The resolution to Core Issue 180 says that `struct
14505 A::B' should be considered a type-name, even if `A'
14507 type = make_typename_type (parser->scope, name, tag_type,
14509 decl = TYPE_NAME (type);
14511 else if (is_template)
14512 decl = make_unbound_class_template (parser->scope,
14516 decl = build_nt (SCOPE_REF, parser->scope, name);
14520 tree pushed_scope = NULL_TREE;
14522 /* If PARSER->SCOPE is a dependent type, then it must be a
14523 class type, and we must not be checking dependencies;
14524 otherwise, we would have processed this lookup above. So
14525 that PARSER->SCOPE is not considered a dependent base by
14526 lookup_member, we must enter the scope here. */
14528 pushed_scope = push_scope (parser->scope);
14529 /* If the PARSER->SCOPE is a template specialization, it
14530 may be instantiated during name lookup. In that case,
14531 errors may be issued. Even if we rollback the current
14532 tentative parse, those errors are valid. */
14533 decl = lookup_qualified_name (parser->scope, name,
14534 tag_type != none_type,
14535 /*complain=*/true);
14537 pop_scope (pushed_scope);
14539 parser->qualifying_scope = parser->scope;
14540 parser->object_scope = NULL_TREE;
14542 else if (object_type)
14544 tree object_decl = NULL_TREE;
14545 /* Look up the name in the scope of the OBJECT_TYPE, unless the
14546 OBJECT_TYPE is not a class. */
14547 if (CLASS_TYPE_P (object_type))
14548 /* If the OBJECT_TYPE is a template specialization, it may
14549 be instantiated during name lookup. In that case, errors
14550 may be issued. Even if we rollback the current tentative
14551 parse, those errors are valid. */
14552 object_decl = lookup_member (object_type,
14555 tag_type != none_type);
14556 /* Look it up in the enclosing context, too. */
14557 decl = lookup_name_real (name, tag_type != none_type,
14559 /*block_p=*/true, is_namespace,
14561 parser->object_scope = object_type;
14562 parser->qualifying_scope = NULL_TREE;
14564 decl = object_decl;
14568 decl = lookup_name_real (name, tag_type != none_type,
14570 /*block_p=*/true, is_namespace,
14572 parser->qualifying_scope = NULL_TREE;
14573 parser->object_scope = NULL_TREE;
14576 /* If the lookup failed, let our caller know. */
14577 if (!decl || decl == error_mark_node)
14578 return error_mark_node;
14580 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
14581 if (TREE_CODE (decl) == TREE_LIST)
14584 *ambiguous_p = true;
14585 /* The error message we have to print is too complicated for
14586 cp_parser_error, so we incorporate its actions directly. */
14587 if (!cp_parser_simulate_error (parser))
14589 error ("reference to %qD is ambiguous", name);
14590 print_candidates (decl);
14592 return error_mark_node;
14595 gcc_assert (DECL_P (decl)
14596 || TREE_CODE (decl) == OVERLOAD
14597 || TREE_CODE (decl) == SCOPE_REF
14598 || TREE_CODE (decl) == UNBOUND_CLASS_TEMPLATE
14599 || BASELINK_P (decl));
14601 /* If we have resolved the name of a member declaration, check to
14602 see if the declaration is accessible. When the name resolves to
14603 set of overloaded functions, accessibility is checked when
14604 overload resolution is done.
14606 During an explicit instantiation, access is not checked at all,
14607 as per [temp.explicit]. */
14609 check_accessibility_of_qualified_id (decl, object_type, parser->scope);
14614 /* Like cp_parser_lookup_name, but for use in the typical case where
14615 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
14616 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
14619 cp_parser_lookup_name_simple (cp_parser* parser, tree name)
14621 return cp_parser_lookup_name (parser, name,
14623 /*is_template=*/false,
14624 /*is_namespace=*/false,
14625 /*check_dependency=*/true,
14626 /*ambiguous_p=*/NULL);
14629 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
14630 the current context, return the TYPE_DECL. If TAG_NAME_P is
14631 true, the DECL indicates the class being defined in a class-head,
14632 or declared in an elaborated-type-specifier.
14634 Otherwise, return DECL. */
14637 cp_parser_maybe_treat_template_as_class (tree decl, bool tag_name_p)
14639 /* If the TEMPLATE_DECL is being declared as part of a class-head,
14640 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
14643 template <typename T> struct B;
14646 template <typename T> struct A::B {};
14648 Similarly, in a elaborated-type-specifier:
14650 namespace N { struct X{}; }
14653 template <typename T> friend struct N::X;
14656 However, if the DECL refers to a class type, and we are in
14657 the scope of the class, then the name lookup automatically
14658 finds the TYPE_DECL created by build_self_reference rather
14659 than a TEMPLATE_DECL. For example, in:
14661 template <class T> struct S {
14665 there is no need to handle such case. */
14667 if (DECL_CLASS_TEMPLATE_P (decl) && tag_name_p)
14668 return DECL_TEMPLATE_RESULT (decl);
14673 /* If too many, or too few, template-parameter lists apply to the
14674 declarator, issue an error message. Returns TRUE if all went well,
14675 and FALSE otherwise. */
14678 cp_parser_check_declarator_template_parameters (cp_parser* parser,
14679 cp_declarator *declarator)
14681 unsigned num_templates;
14683 /* We haven't seen any classes that involve template parameters yet. */
14686 switch (declarator->kind)
14689 if (declarator->u.id.qualifying_scope)
14694 scope = declarator->u.id.qualifying_scope;
14695 member = declarator->u.id.unqualified_name;
14697 while (scope && CLASS_TYPE_P (scope))
14699 /* You're supposed to have one `template <...>'
14700 for every template class, but you don't need one
14701 for a full specialization. For example:
14703 template <class T> struct S{};
14704 template <> struct S<int> { void f(); };
14705 void S<int>::f () {}
14707 is correct; there shouldn't be a `template <>' for
14708 the definition of `S<int>::f'. */
14709 if (CLASSTYPE_TEMPLATE_INFO (scope)
14710 && (CLASSTYPE_TEMPLATE_INSTANTIATION (scope)
14711 || uses_template_parms (CLASSTYPE_TI_ARGS (scope)))
14712 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope)))
14715 scope = TYPE_CONTEXT (scope);
14718 else if (TREE_CODE (declarator->u.id.unqualified_name)
14719 == TEMPLATE_ID_EXPR)
14720 /* If the DECLARATOR has the form `X<y>' then it uses one
14721 additional level of template parameters. */
14724 return cp_parser_check_template_parameters (parser,
14730 case cdk_reference:
14732 return (cp_parser_check_declarator_template_parameters
14733 (parser, declarator->declarator));
14739 gcc_unreachable ();
14744 /* NUM_TEMPLATES were used in the current declaration. If that is
14745 invalid, return FALSE and issue an error messages. Otherwise,
14749 cp_parser_check_template_parameters (cp_parser* parser,
14750 unsigned num_templates)
14752 /* If there are more template classes than parameter lists, we have
14755 template <class T> void S<T>::R<T>::f (); */
14756 if (parser->num_template_parameter_lists < num_templates)
14758 error ("too few template-parameter-lists");
14761 /* If there are the same number of template classes and parameter
14762 lists, that's OK. */
14763 if (parser->num_template_parameter_lists == num_templates)
14765 /* If there are more, but only one more, then we are referring to a
14766 member template. That's OK too. */
14767 if (parser->num_template_parameter_lists == num_templates + 1)
14769 /* Otherwise, there are too many template parameter lists. We have
14772 template <class T> template <class U> void S::f(); */
14773 error ("too many template-parameter-lists");
14777 /* Parse an optional `::' token indicating that the following name is
14778 from the global namespace. If so, PARSER->SCOPE is set to the
14779 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
14780 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
14781 Returns the new value of PARSER->SCOPE, if the `::' token is
14782 present, and NULL_TREE otherwise. */
14785 cp_parser_global_scope_opt (cp_parser* parser, bool current_scope_valid_p)
14789 /* Peek at the next token. */
14790 token = cp_lexer_peek_token (parser->lexer);
14791 /* If we're looking at a `::' token then we're starting from the
14792 global namespace, not our current location. */
14793 if (token->type == CPP_SCOPE)
14795 /* Consume the `::' token. */
14796 cp_lexer_consume_token (parser->lexer);
14797 /* Set the SCOPE so that we know where to start the lookup. */
14798 parser->scope = global_namespace;
14799 parser->qualifying_scope = global_namespace;
14800 parser->object_scope = NULL_TREE;
14802 return parser->scope;
14804 else if (!current_scope_valid_p)
14806 parser->scope = NULL_TREE;
14807 parser->qualifying_scope = NULL_TREE;
14808 parser->object_scope = NULL_TREE;
14814 /* Returns TRUE if the upcoming token sequence is the start of a
14815 constructor declarator. If FRIEND_P is true, the declarator is
14816 preceded by the `friend' specifier. */
14819 cp_parser_constructor_declarator_p (cp_parser *parser, bool friend_p)
14821 bool constructor_p;
14822 tree type_decl = NULL_TREE;
14823 bool nested_name_p;
14824 cp_token *next_token;
14826 /* The common case is that this is not a constructor declarator, so
14827 try to avoid doing lots of work if at all possible. It's not
14828 valid declare a constructor at function scope. */
14829 if (at_function_scope_p ())
14831 /* And only certain tokens can begin a constructor declarator. */
14832 next_token = cp_lexer_peek_token (parser->lexer);
14833 if (next_token->type != CPP_NAME
14834 && next_token->type != CPP_SCOPE
14835 && next_token->type != CPP_NESTED_NAME_SPECIFIER
14836 && next_token->type != CPP_TEMPLATE_ID)
14839 /* Parse tentatively; we are going to roll back all of the tokens
14841 cp_parser_parse_tentatively (parser);
14842 /* Assume that we are looking at a constructor declarator. */
14843 constructor_p = true;
14845 /* Look for the optional `::' operator. */
14846 cp_parser_global_scope_opt (parser,
14847 /*current_scope_valid_p=*/false);
14848 /* Look for the nested-name-specifier. */
14850 = (cp_parser_nested_name_specifier_opt (parser,
14851 /*typename_keyword_p=*/false,
14852 /*check_dependency_p=*/false,
14854 /*is_declaration=*/false)
14856 /* Outside of a class-specifier, there must be a
14857 nested-name-specifier. */
14858 if (!nested_name_p &&
14859 (!at_class_scope_p () || !TYPE_BEING_DEFINED (current_class_type)
14861 constructor_p = false;
14862 /* If we still think that this might be a constructor-declarator,
14863 look for a class-name. */
14868 template <typename T> struct S { S(); };
14869 template <typename T> S<T>::S ();
14871 we must recognize that the nested `S' names a class.
14874 template <typename T> S<T>::S<T> ();
14876 we must recognize that the nested `S' names a template. */
14877 type_decl = cp_parser_class_name (parser,
14878 /*typename_keyword_p=*/false,
14879 /*template_keyword_p=*/false,
14881 /*check_dependency_p=*/false,
14882 /*class_head_p=*/false,
14883 /*is_declaration=*/false);
14884 /* If there was no class-name, then this is not a constructor. */
14885 constructor_p = !cp_parser_error_occurred (parser);
14888 /* If we're still considering a constructor, we have to see a `(',
14889 to begin the parameter-declaration-clause, followed by either a
14890 `)', an `...', or a decl-specifier. We need to check for a
14891 type-specifier to avoid being fooled into thinking that:
14895 is a constructor. (It is actually a function named `f' that
14896 takes one parameter (of type `int') and returns a value of type
14899 && cp_parser_require (parser, CPP_OPEN_PAREN, "`('"))
14901 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN)
14902 && cp_lexer_next_token_is_not (parser->lexer, CPP_ELLIPSIS)
14903 /* A parameter declaration begins with a decl-specifier,
14904 which is either the "attribute" keyword, a storage class
14905 specifier, or (usually) a type-specifier. */
14906 && !cp_lexer_next_token_is_keyword (parser->lexer, RID_ATTRIBUTE)
14907 && !cp_parser_storage_class_specifier_opt (parser))
14910 tree pushed_scope = NULL_TREE;
14911 unsigned saved_num_template_parameter_lists;
14913 /* Names appearing in the type-specifier should be looked up
14914 in the scope of the class. */
14915 if (current_class_type)
14919 type = TREE_TYPE (type_decl);
14920 if (TREE_CODE (type) == TYPENAME_TYPE)
14922 type = resolve_typename_type (type,
14923 /*only_current_p=*/false);
14924 if (type == error_mark_node)
14926 cp_parser_abort_tentative_parse (parser);
14930 pushed_scope = push_scope (type);
14933 /* Inside the constructor parameter list, surrounding
14934 template-parameter-lists do not apply. */
14935 saved_num_template_parameter_lists
14936 = parser->num_template_parameter_lists;
14937 parser->num_template_parameter_lists = 0;
14939 /* Look for the type-specifier. */
14940 cp_parser_type_specifier (parser,
14941 CP_PARSER_FLAGS_NONE,
14942 /*decl_specs=*/NULL,
14943 /*is_declarator=*/true,
14944 /*declares_class_or_enum=*/NULL,
14945 /*is_cv_qualifier=*/NULL);
14947 parser->num_template_parameter_lists
14948 = saved_num_template_parameter_lists;
14950 /* Leave the scope of the class. */
14952 pop_scope (pushed_scope);
14954 constructor_p = !cp_parser_error_occurred (parser);
14958 constructor_p = false;
14959 /* We did not really want to consume any tokens. */
14960 cp_parser_abort_tentative_parse (parser);
14962 return constructor_p;
14965 /* Parse the definition of the function given by the DECL_SPECIFIERS,
14966 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
14967 they must be performed once we are in the scope of the function.
14969 Returns the function defined. */
14972 cp_parser_function_definition_from_specifiers_and_declarator
14973 (cp_parser* parser,
14974 cp_decl_specifier_seq *decl_specifiers,
14976 const cp_declarator *declarator)
14981 /* Begin the function-definition. */
14982 success_p = start_function (decl_specifiers, declarator, attributes);
14984 /* The things we're about to see are not directly qualified by any
14985 template headers we've seen thus far. */
14986 reset_specialization ();
14988 /* If there were names looked up in the decl-specifier-seq that we
14989 did not check, check them now. We must wait until we are in the
14990 scope of the function to perform the checks, since the function
14991 might be a friend. */
14992 perform_deferred_access_checks ();
14996 /* Skip the entire function. */
14997 error ("invalid function declaration");
14998 cp_parser_skip_to_end_of_block_or_statement (parser);
14999 fn = error_mark_node;
15002 fn = cp_parser_function_definition_after_declarator (parser,
15003 /*inline_p=*/false);
15008 /* Parse the part of a function-definition that follows the
15009 declarator. INLINE_P is TRUE iff this function is an inline
15010 function defined with a class-specifier.
15012 Returns the function defined. */
15015 cp_parser_function_definition_after_declarator (cp_parser* parser,
15019 bool ctor_initializer_p = false;
15020 bool saved_in_unbraced_linkage_specification_p;
15021 unsigned saved_num_template_parameter_lists;
15023 /* If the next token is `return', then the code may be trying to
15024 make use of the "named return value" extension that G++ used to
15026 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_RETURN))
15028 /* Consume the `return' keyword. */
15029 cp_lexer_consume_token (parser->lexer);
15030 /* Look for the identifier that indicates what value is to be
15032 cp_parser_identifier (parser);
15033 /* Issue an error message. */
15034 error ("named return values are no longer supported");
15035 /* Skip tokens until we reach the start of the function body. */
15036 while (cp_lexer_next_token_is_not (parser->lexer, CPP_OPEN_BRACE)
15037 && cp_lexer_next_token_is_not (parser->lexer, CPP_EOF))
15038 cp_lexer_consume_token (parser->lexer);
15040 /* The `extern' in `extern "C" void f () { ... }' does not apply to
15041 anything declared inside `f'. */
15042 saved_in_unbraced_linkage_specification_p
15043 = parser->in_unbraced_linkage_specification_p;
15044 parser->in_unbraced_linkage_specification_p = false;
15045 /* Inside the function, surrounding template-parameter-lists do not
15047 saved_num_template_parameter_lists
15048 = parser->num_template_parameter_lists;
15049 parser->num_template_parameter_lists = 0;
15050 /* If the next token is `try', then we are looking at a
15051 function-try-block. */
15052 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TRY))
15053 ctor_initializer_p = cp_parser_function_try_block (parser);
15054 /* A function-try-block includes the function-body, so we only do
15055 this next part if we're not processing a function-try-block. */
15058 = cp_parser_ctor_initializer_opt_and_function_body (parser);
15060 /* Finish the function. */
15061 fn = finish_function ((ctor_initializer_p ? 1 : 0) |
15062 (inline_p ? 2 : 0));
15063 /* Generate code for it, if necessary. */
15064 expand_or_defer_fn (fn);
15065 /* Restore the saved values. */
15066 parser->in_unbraced_linkage_specification_p
15067 = saved_in_unbraced_linkage_specification_p;
15068 parser->num_template_parameter_lists
15069 = saved_num_template_parameter_lists;
15074 /* Parse a template-declaration, assuming that the `export' (and
15075 `extern') keywords, if present, has already been scanned. MEMBER_P
15076 is as for cp_parser_template_declaration. */
15079 cp_parser_template_declaration_after_export (cp_parser* parser, bool member_p)
15081 tree decl = NULL_TREE;
15082 tree parameter_list;
15083 bool friend_p = false;
15085 /* Look for the `template' keyword. */
15086 if (!cp_parser_require_keyword (parser, RID_TEMPLATE, "`template'"))
15090 if (!cp_parser_require (parser, CPP_LESS, "`<'"))
15093 /* If the next token is `>', then we have an invalid
15094 specialization. Rather than complain about an invalid template
15095 parameter, issue an error message here. */
15096 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
15098 cp_parser_error (parser, "invalid explicit specialization");
15099 begin_specialization ();
15100 parameter_list = NULL_TREE;
15104 /* Parse the template parameters. */
15105 begin_template_parm_list ();
15106 parameter_list = cp_parser_template_parameter_list (parser);
15107 parameter_list = end_template_parm_list (parameter_list);
15110 /* Look for the `>'. */
15111 cp_parser_skip_until_found (parser, CPP_GREATER, "`>'");
15112 /* We just processed one more parameter list. */
15113 ++parser->num_template_parameter_lists;
15114 /* If the next token is `template', there are more template
15116 if (cp_lexer_next_token_is_keyword (parser->lexer,
15118 cp_parser_template_declaration_after_export (parser, member_p);
15121 /* There are no access checks when parsing a template, as we do not
15122 know if a specialization will be a friend. */
15123 push_deferring_access_checks (dk_no_check);
15125 decl = cp_parser_single_declaration (parser,
15129 pop_deferring_access_checks ();
15131 /* If this is a member template declaration, let the front
15133 if (member_p && !friend_p && decl)
15135 if (TREE_CODE (decl) == TYPE_DECL)
15136 cp_parser_check_access_in_redeclaration (decl);
15138 decl = finish_member_template_decl (decl);
15140 else if (friend_p && decl && TREE_CODE (decl) == TYPE_DECL)
15141 make_friend_class (current_class_type, TREE_TYPE (decl),
15142 /*complain=*/true);
15144 /* We are done with the current parameter list. */
15145 --parser->num_template_parameter_lists;
15148 finish_template_decl (parameter_list);
15150 /* Register member declarations. */
15151 if (member_p && !friend_p && decl && !DECL_CLASS_TEMPLATE_P (decl))
15152 finish_member_declaration (decl);
15154 /* If DECL is a function template, we must return to parse it later.
15155 (Even though there is no definition, there might be default
15156 arguments that need handling.) */
15157 if (member_p && decl
15158 && (TREE_CODE (decl) == FUNCTION_DECL
15159 || DECL_FUNCTION_TEMPLATE_P (decl)))
15160 TREE_VALUE (parser->unparsed_functions_queues)
15161 = tree_cons (NULL_TREE, decl,
15162 TREE_VALUE (parser->unparsed_functions_queues));
15165 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
15166 `function-definition' sequence. MEMBER_P is true, this declaration
15167 appears in a class scope.
15169 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
15170 *FRIEND_P is set to TRUE iff the declaration is a friend. */
15173 cp_parser_single_declaration (cp_parser* parser,
15177 int declares_class_or_enum;
15178 tree decl = NULL_TREE;
15179 cp_decl_specifier_seq decl_specifiers;
15180 bool function_definition_p = false;
15182 /* This function is only used when processing a template
15184 gcc_assert (innermost_scope_kind () == sk_template_parms
15185 || innermost_scope_kind () == sk_template_spec);
15187 /* Defer access checks until we know what is being declared. */
15188 push_deferring_access_checks (dk_deferred);
15190 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
15192 cp_parser_decl_specifier_seq (parser,
15193 CP_PARSER_FLAGS_OPTIONAL,
15195 &declares_class_or_enum);
15197 *friend_p = cp_parser_friend_p (&decl_specifiers);
15199 /* There are no template typedefs. */
15200 if (decl_specifiers.specs[(int) ds_typedef])
15202 error ("template declaration of %qs", "typedef");
15203 decl = error_mark_node;
15206 /* Gather up the access checks that occurred the
15207 decl-specifier-seq. */
15208 stop_deferring_access_checks ();
15210 /* Check for the declaration of a template class. */
15211 if (declares_class_or_enum)
15213 if (cp_parser_declares_only_class_p (parser))
15215 decl = shadow_tag (&decl_specifiers);
15220 friend template <typename T> struct A<T>::B;
15223 A<T>::B will be represented by a TYPENAME_TYPE, and
15224 therefore not recognized by shadow_tag. */
15225 if (friend_p && *friend_p
15227 && decl_specifiers.type
15228 && TYPE_P (decl_specifiers.type))
15229 decl = decl_specifiers.type;
15231 if (decl && decl != error_mark_node)
15232 decl = TYPE_NAME (decl);
15234 decl = error_mark_node;
15237 /* If it's not a template class, try for a template function. If
15238 the next token is a `;', then this declaration does not declare
15239 anything. But, if there were errors in the decl-specifiers, then
15240 the error might well have come from an attempted class-specifier.
15241 In that case, there's no need to warn about a missing declarator. */
15243 && (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON)
15244 || decl_specifiers.type != error_mark_node))
15245 decl = cp_parser_init_declarator (parser,
15247 /*function_definition_allowed_p=*/true,
15249 declares_class_or_enum,
15250 &function_definition_p);
15252 pop_deferring_access_checks ();
15254 /* Clear any current qualification; whatever comes next is the start
15255 of something new. */
15256 parser->scope = NULL_TREE;
15257 parser->qualifying_scope = NULL_TREE;
15258 parser->object_scope = NULL_TREE;
15259 /* Look for a trailing `;' after the declaration. */
15260 if (!function_definition_p
15261 && (decl == error_mark_node
15262 || !cp_parser_require (parser, CPP_SEMICOLON, "`;'")))
15263 cp_parser_skip_to_end_of_block_or_statement (parser);
15268 /* Parse a cast-expression that is not the operand of a unary "&". */
15271 cp_parser_simple_cast_expression (cp_parser *parser)
15273 return cp_parser_cast_expression (parser, /*address_p=*/false,
15277 /* Parse a functional cast to TYPE. Returns an expression
15278 representing the cast. */
15281 cp_parser_functional_cast (cp_parser* parser, tree type)
15283 tree expression_list;
15287 = cp_parser_parenthesized_expression_list (parser, false,
15289 /*non_constant_p=*/NULL);
15291 cast = build_functional_cast (type, expression_list);
15292 /* [expr.const]/1: In an integral constant expression "only type
15293 conversions to integral or enumeration type can be used". */
15294 if (cast != error_mark_node && !type_dependent_expression_p (type)
15295 && !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (type)))
15297 if (cp_parser_non_integral_constant_expression
15298 (parser, "a call to a constructor"))
15299 return error_mark_node;
15304 /* Save the tokens that make up the body of a member function defined
15305 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
15306 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
15307 specifiers applied to the declaration. Returns the FUNCTION_DECL
15308 for the member function. */
15311 cp_parser_save_member_function_body (cp_parser* parser,
15312 cp_decl_specifier_seq *decl_specifiers,
15313 cp_declarator *declarator,
15320 /* Create the function-declaration. */
15321 fn = start_method (decl_specifiers, declarator, attributes);
15322 /* If something went badly wrong, bail out now. */
15323 if (fn == error_mark_node)
15325 /* If there's a function-body, skip it. */
15326 if (cp_parser_token_starts_function_definition_p
15327 (cp_lexer_peek_token (parser->lexer)))
15328 cp_parser_skip_to_end_of_block_or_statement (parser);
15329 return error_mark_node;
15332 /* Remember it, if there default args to post process. */
15333 cp_parser_save_default_args (parser, fn);
15335 /* Save away the tokens that make up the body of the
15337 first = parser->lexer->next_token;
15338 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
15339 /* Handle function try blocks. */
15340 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_CATCH))
15341 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, /*depth=*/0);
15342 last = parser->lexer->next_token;
15344 /* Save away the inline definition; we will process it when the
15345 class is complete. */
15346 DECL_PENDING_INLINE_INFO (fn) = cp_token_cache_new (first, last);
15347 DECL_PENDING_INLINE_P (fn) = 1;
15349 /* We need to know that this was defined in the class, so that
15350 friend templates are handled correctly. */
15351 DECL_INITIALIZED_IN_CLASS_P (fn) = 1;
15353 /* We're done with the inline definition. */
15354 finish_method (fn);
15356 /* Add FN to the queue of functions to be parsed later. */
15357 TREE_VALUE (parser->unparsed_functions_queues)
15358 = tree_cons (NULL_TREE, fn,
15359 TREE_VALUE (parser->unparsed_functions_queues));
15364 /* Parse a template-argument-list, as well as the trailing ">" (but
15365 not the opening ">"). See cp_parser_template_argument_list for the
15369 cp_parser_enclosed_template_argument_list (cp_parser* parser)
15373 tree saved_qualifying_scope;
15374 tree saved_object_scope;
15375 bool saved_greater_than_is_operator_p;
15379 When parsing a template-id, the first non-nested `>' is taken as
15380 the end of the template-argument-list rather than a greater-than
15382 saved_greater_than_is_operator_p
15383 = parser->greater_than_is_operator_p;
15384 parser->greater_than_is_operator_p = false;
15385 /* Parsing the argument list may modify SCOPE, so we save it
15387 saved_scope = parser->scope;
15388 saved_qualifying_scope = parser->qualifying_scope;
15389 saved_object_scope = parser->object_scope;
15390 /* Parse the template-argument-list itself. */
15391 if (cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
15392 arguments = NULL_TREE;
15394 arguments = cp_parser_template_argument_list (parser);
15395 /* Look for the `>' that ends the template-argument-list. If we find
15396 a '>>' instead, it's probably just a typo. */
15397 if (cp_lexer_next_token_is (parser->lexer, CPP_RSHIFT))
15399 if (!saved_greater_than_is_operator_p)
15401 /* If we're in a nested template argument list, the '>>' has
15402 to be a typo for '> >'. We emit the error message, but we
15403 continue parsing and we push a '>' as next token, so that
15404 the argument list will be parsed correctly. Note that the
15405 global source location is still on the token before the
15406 '>>', so we need to say explicitly where we want it. */
15407 cp_token *token = cp_lexer_peek_token (parser->lexer);
15408 error ("%H%<>>%> should be %<> >%> "
15409 "within a nested template argument list",
15412 /* ??? Proper recovery should terminate two levels of
15413 template argument list here. */
15414 token->type = CPP_GREATER;
15418 /* If this is not a nested template argument list, the '>>'
15419 is a typo for '>'. Emit an error message and continue.
15420 Same deal about the token location, but here we can get it
15421 right by consuming the '>>' before issuing the diagnostic. */
15422 cp_lexer_consume_token (parser->lexer);
15423 error ("spurious %<>>%>, use %<>%> to terminate "
15424 "a template argument list");
15427 else if (!cp_lexer_next_token_is (parser->lexer, CPP_GREATER))
15428 error ("missing %<>%> to terminate the template argument list");
15430 /* It's what we want, a '>'; consume it. */
15431 cp_lexer_consume_token (parser->lexer);
15432 /* The `>' token might be a greater-than operator again now. */
15433 parser->greater_than_is_operator_p
15434 = saved_greater_than_is_operator_p;
15435 /* Restore the SAVED_SCOPE. */
15436 parser->scope = saved_scope;
15437 parser->qualifying_scope = saved_qualifying_scope;
15438 parser->object_scope = saved_object_scope;
15443 /* MEMBER_FUNCTION is a member function, or a friend. If default
15444 arguments, or the body of the function have not yet been parsed,
15448 cp_parser_late_parsing_for_member (cp_parser* parser, tree member_function)
15450 /* If this member is a template, get the underlying
15452 if (DECL_FUNCTION_TEMPLATE_P (member_function))
15453 member_function = DECL_TEMPLATE_RESULT (member_function);
15455 /* There should not be any class definitions in progress at this
15456 point; the bodies of members are only parsed outside of all class
15458 gcc_assert (parser->num_classes_being_defined == 0);
15459 /* While we're parsing the member functions we might encounter more
15460 classes. We want to handle them right away, but we don't want
15461 them getting mixed up with functions that are currently in the
15463 parser->unparsed_functions_queues
15464 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
15466 /* Make sure that any template parameters are in scope. */
15467 maybe_begin_member_template_processing (member_function);
15469 /* If the body of the function has not yet been parsed, parse it
15471 if (DECL_PENDING_INLINE_P (member_function))
15473 tree function_scope;
15474 cp_token_cache *tokens;
15476 /* The function is no longer pending; we are processing it. */
15477 tokens = DECL_PENDING_INLINE_INFO (member_function);
15478 DECL_PENDING_INLINE_INFO (member_function) = NULL;
15479 DECL_PENDING_INLINE_P (member_function) = 0;
15481 /* If this is a local class, enter the scope of the containing
15483 function_scope = current_function_decl;
15484 if (function_scope)
15485 push_function_context_to (function_scope);
15487 /* Push the body of the function onto the lexer stack. */
15488 cp_parser_push_lexer_for_tokens (parser, tokens);
15490 /* Let the front end know that we going to be defining this
15492 start_preparsed_function (member_function, NULL_TREE,
15493 SF_PRE_PARSED | SF_INCLASS_INLINE);
15495 /* Now, parse the body of the function. */
15496 cp_parser_function_definition_after_declarator (parser,
15497 /*inline_p=*/true);
15499 /* Leave the scope of the containing function. */
15500 if (function_scope)
15501 pop_function_context_from (function_scope);
15502 cp_parser_pop_lexer (parser);
15505 /* Remove any template parameters from the symbol table. */
15506 maybe_end_member_template_processing ();
15508 /* Restore the queue. */
15509 parser->unparsed_functions_queues
15510 = TREE_CHAIN (parser->unparsed_functions_queues);
15513 /* If DECL contains any default args, remember it on the unparsed
15514 functions queue. */
15517 cp_parser_save_default_args (cp_parser* parser, tree decl)
15521 for (probe = TYPE_ARG_TYPES (TREE_TYPE (decl));
15523 probe = TREE_CHAIN (probe))
15524 if (TREE_PURPOSE (probe))
15526 TREE_PURPOSE (parser->unparsed_functions_queues)
15527 = tree_cons (current_class_type, decl,
15528 TREE_PURPOSE (parser->unparsed_functions_queues));
15534 /* FN is a FUNCTION_DECL which may contains a parameter with an
15535 unparsed DEFAULT_ARG. Parse the default args now. This function
15536 assumes that the current scope is the scope in which the default
15537 argument should be processed. */
15540 cp_parser_late_parsing_default_args (cp_parser *parser, tree fn)
15542 bool saved_local_variables_forbidden_p;
15545 /* While we're parsing the default args, we might (due to the
15546 statement expression extension) encounter more classes. We want
15547 to handle them right away, but we don't want them getting mixed
15548 up with default args that are currently in the queue. */
15549 parser->unparsed_functions_queues
15550 = tree_cons (NULL_TREE, NULL_TREE, parser->unparsed_functions_queues);
15552 /* Local variable names (and the `this' keyword) may not appear
15553 in a default argument. */
15554 saved_local_variables_forbidden_p = parser->local_variables_forbidden_p;
15555 parser->local_variables_forbidden_p = true;
15557 for (parm = TYPE_ARG_TYPES (TREE_TYPE (fn));
15559 parm = TREE_CHAIN (parm))
15561 cp_token_cache *tokens;
15563 if (!TREE_PURPOSE (parm)
15564 || TREE_CODE (TREE_PURPOSE (parm)) != DEFAULT_ARG)
15567 /* Push the saved tokens for the default argument onto the parser's
15569 tokens = DEFARG_TOKENS (TREE_PURPOSE (parm));
15570 cp_parser_push_lexer_for_tokens (parser, tokens);
15572 /* Parse the assignment-expression. */
15573 TREE_PURPOSE (parm) = cp_parser_assignment_expression (parser,
15576 /* If the token stream has not been completely used up, then
15577 there was extra junk after the end of the default
15579 if (!cp_lexer_next_token_is (parser->lexer, CPP_EOF))
15580 cp_parser_error (parser, "expected %<,%>");
15582 /* Revert to the main lexer. */
15583 cp_parser_pop_lexer (parser);
15586 /* Restore the state of local_variables_forbidden_p. */
15587 parser->local_variables_forbidden_p = saved_local_variables_forbidden_p;
15589 /* Restore the queue. */
15590 parser->unparsed_functions_queues
15591 = TREE_CHAIN (parser->unparsed_functions_queues);
15594 /* Parse the operand of `sizeof' (or a similar operator). Returns
15595 either a TYPE or an expression, depending on the form of the
15596 input. The KEYWORD indicates which kind of expression we have
15600 cp_parser_sizeof_operand (cp_parser* parser, enum rid keyword)
15602 static const char *format;
15603 tree expr = NULL_TREE;
15604 const char *saved_message;
15605 bool saved_integral_constant_expression_p;
15606 bool saved_non_integral_constant_expression_p;
15608 /* Initialize FORMAT the first time we get here. */
15610 format = "types may not be defined in '%s' expressions";
15612 /* Types cannot be defined in a `sizeof' expression. Save away the
15614 saved_message = parser->type_definition_forbidden_message;
15615 /* And create the new one. */
15616 parser->type_definition_forbidden_message
15617 = xmalloc (strlen (format)
15618 + strlen (IDENTIFIER_POINTER (ridpointers[keyword]))
15620 sprintf ((char *) parser->type_definition_forbidden_message,
15621 format, IDENTIFIER_POINTER (ridpointers[keyword]));
15623 /* The restrictions on constant-expressions do not apply inside
15624 sizeof expressions. */
15625 saved_integral_constant_expression_p
15626 = parser->integral_constant_expression_p;
15627 saved_non_integral_constant_expression_p
15628 = parser->non_integral_constant_expression_p;
15629 parser->integral_constant_expression_p = false;
15631 /* Do not actually evaluate the expression. */
15633 /* If it's a `(', then we might be looking at the type-id
15635 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
15638 bool saved_in_type_id_in_expr_p;
15640 /* We can't be sure yet whether we're looking at a type-id or an
15642 cp_parser_parse_tentatively (parser);
15643 /* Consume the `('. */
15644 cp_lexer_consume_token (parser->lexer);
15645 /* Parse the type-id. */
15646 saved_in_type_id_in_expr_p = parser->in_type_id_in_expr_p;
15647 parser->in_type_id_in_expr_p = true;
15648 type = cp_parser_type_id (parser);
15649 parser->in_type_id_in_expr_p = saved_in_type_id_in_expr_p;
15650 /* Now, look for the trailing `)'. */
15651 cp_parser_require (parser, CPP_CLOSE_PAREN, "%<)%>");
15652 /* If all went well, then we're done. */
15653 if (cp_parser_parse_definitely (parser))
15655 cp_decl_specifier_seq decl_specs;
15657 /* Build a trivial decl-specifier-seq. */
15658 clear_decl_specs (&decl_specs);
15659 decl_specs.type = type;
15661 /* Call grokdeclarator to figure out what type this is. */
15662 expr = grokdeclarator (NULL,
15666 /*attrlist=*/NULL);
15670 /* If the type-id production did not work out, then we must be
15671 looking at the unary-expression production. */
15673 expr = cp_parser_unary_expression (parser, /*address_p=*/false,
15675 /* Go back to evaluating expressions. */
15678 /* Free the message we created. */
15679 free ((char *) parser->type_definition_forbidden_message);
15680 /* And restore the old one. */
15681 parser->type_definition_forbidden_message = saved_message;
15682 parser->integral_constant_expression_p
15683 = saved_integral_constant_expression_p;
15684 parser->non_integral_constant_expression_p
15685 = saved_non_integral_constant_expression_p;
15690 /* If the current declaration has no declarator, return true. */
15693 cp_parser_declares_only_class_p (cp_parser *parser)
15695 /* If the next token is a `;' or a `,' then there is no
15697 return (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON)
15698 || cp_lexer_next_token_is (parser->lexer, CPP_COMMA));
15701 /* Update the DECL_SPECS to reflect the STORAGE_CLASS. */
15704 cp_parser_set_storage_class (cp_decl_specifier_seq *decl_specs,
15705 cp_storage_class storage_class)
15707 if (decl_specs->storage_class != sc_none)
15708 decl_specs->multiple_storage_classes_p = true;
15710 decl_specs->storage_class = storage_class;
15713 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If USER_DEFINED_P
15714 is true, the type is a user-defined type; otherwise it is a
15715 built-in type specified by a keyword. */
15718 cp_parser_set_decl_spec_type (cp_decl_specifier_seq *decl_specs,
15720 bool user_defined_p)
15722 decl_specs->any_specifiers_p = true;
15724 /* If the user tries to redeclare bool or wchar_t (with, for
15725 example, in "typedef int wchar_t;") we remember that this is what
15726 happened. In system headers, we ignore these declarations so
15727 that G++ can work with system headers that are not C++-safe. */
15728 if (decl_specs->specs[(int) ds_typedef]
15730 && (type_spec == boolean_type_node
15731 || type_spec == wchar_type_node)
15732 && (decl_specs->type
15733 || decl_specs->specs[(int) ds_long]
15734 || decl_specs->specs[(int) ds_short]
15735 || decl_specs->specs[(int) ds_unsigned]
15736 || decl_specs->specs[(int) ds_signed]))
15738 decl_specs->redefined_builtin_type = type_spec;
15739 if (!decl_specs->type)
15741 decl_specs->type = type_spec;
15742 decl_specs->user_defined_type_p = false;
15745 else if (decl_specs->type)
15746 decl_specs->multiple_types_p = true;
15749 decl_specs->type = type_spec;
15750 decl_specs->user_defined_type_p = user_defined_p;
15751 decl_specs->redefined_builtin_type = NULL_TREE;
15755 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
15756 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
15759 cp_parser_friend_p (const cp_decl_specifier_seq *decl_specifiers)
15761 return decl_specifiers->specs[(int) ds_friend] != 0;
15764 /* If the next token is of the indicated TYPE, consume it. Otherwise,
15765 issue an error message indicating that TOKEN_DESC was expected.
15767 Returns the token consumed, if the token had the appropriate type.
15768 Otherwise, returns NULL. */
15771 cp_parser_require (cp_parser* parser,
15772 enum cpp_ttype type,
15773 const char* token_desc)
15775 if (cp_lexer_next_token_is (parser->lexer, type))
15776 return cp_lexer_consume_token (parser->lexer);
15779 /* Output the MESSAGE -- unless we're parsing tentatively. */
15780 if (!cp_parser_simulate_error (parser))
15782 char *message = concat ("expected ", token_desc, NULL);
15783 cp_parser_error (parser, message);
15790 /* Like cp_parser_require, except that tokens will be skipped until
15791 the desired token is found. An error message is still produced if
15792 the next token is not as expected. */
15795 cp_parser_skip_until_found (cp_parser* parser,
15796 enum cpp_ttype type,
15797 const char* token_desc)
15800 unsigned nesting_depth = 0;
15802 if (cp_parser_require (parser, type, token_desc))
15805 /* Skip tokens until the desired token is found. */
15808 /* Peek at the next token. */
15809 token = cp_lexer_peek_token (parser->lexer);
15810 /* If we've reached the token we want, consume it and
15812 if (token->type == type && !nesting_depth)
15814 cp_lexer_consume_token (parser->lexer);
15817 /* If we've run out of tokens, stop. */
15818 if (token->type == CPP_EOF)
15820 if (token->type == CPP_OPEN_BRACE
15821 || token->type == CPP_OPEN_PAREN
15822 || token->type == CPP_OPEN_SQUARE)
15824 else if (token->type == CPP_CLOSE_BRACE
15825 || token->type == CPP_CLOSE_PAREN
15826 || token->type == CPP_CLOSE_SQUARE)
15828 if (nesting_depth-- == 0)
15831 /* Consume this token. */
15832 cp_lexer_consume_token (parser->lexer);
15836 /* If the next token is the indicated keyword, consume it. Otherwise,
15837 issue an error message indicating that TOKEN_DESC was expected.
15839 Returns the token consumed, if the token had the appropriate type.
15840 Otherwise, returns NULL. */
15843 cp_parser_require_keyword (cp_parser* parser,
15845 const char* token_desc)
15847 cp_token *token = cp_parser_require (parser, CPP_KEYWORD, token_desc);
15849 if (token && token->keyword != keyword)
15851 dyn_string_t error_msg;
15853 /* Format the error message. */
15854 error_msg = dyn_string_new (0);
15855 dyn_string_append_cstr (error_msg, "expected ");
15856 dyn_string_append_cstr (error_msg, token_desc);
15857 cp_parser_error (parser, error_msg->s);
15858 dyn_string_delete (error_msg);
15865 /* Returns TRUE iff TOKEN is a token that can begin the body of a
15866 function-definition. */
15869 cp_parser_token_starts_function_definition_p (cp_token* token)
15871 return (/* An ordinary function-body begins with an `{'. */
15872 token->type == CPP_OPEN_BRACE
15873 /* A ctor-initializer begins with a `:'. */
15874 || token->type == CPP_COLON
15875 /* A function-try-block begins with `try'. */
15876 || token->keyword == RID_TRY
15877 /* The named return value extension begins with `return'. */
15878 || token->keyword == RID_RETURN);
15881 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
15885 cp_parser_next_token_starts_class_definition_p (cp_parser *parser)
15889 token = cp_lexer_peek_token (parser->lexer);
15890 return (token->type == CPP_OPEN_BRACE || token->type == CPP_COLON);
15893 /* Returns TRUE iff the next token is the "," or ">" ending a
15894 template-argument. */
15897 cp_parser_next_token_ends_template_argument_p (cp_parser *parser)
15901 token = cp_lexer_peek_token (parser->lexer);
15902 return (token->type == CPP_COMMA || token->type == CPP_GREATER);
15905 /* Returns TRUE iff the n-th token is a ">", or the n-th is a "[" and the
15906 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
15909 cp_parser_nth_token_starts_template_argument_list_p (cp_parser * parser,
15914 token = cp_lexer_peek_nth_token (parser->lexer, n);
15915 if (token->type == CPP_LESS)
15917 /* Check for the sequence `<::' in the original code. It would be lexed as
15918 `[:', where `[' is a digraph, and there is no whitespace before
15920 if (token->type == CPP_OPEN_SQUARE && token->flags & DIGRAPH)
15923 token2 = cp_lexer_peek_nth_token (parser->lexer, n+1);
15924 if (token2->type == CPP_COLON && !(token2->flags & PREV_WHITE))
15930 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
15931 or none_type otherwise. */
15933 static enum tag_types
15934 cp_parser_token_is_class_key (cp_token* token)
15936 switch (token->keyword)
15941 return record_type;
15950 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
15953 cp_parser_check_class_key (enum tag_types class_key, tree type)
15955 if ((TREE_CODE (type) == UNION_TYPE) != (class_key == union_type))
15956 pedwarn ("%qs tag used in naming %q#T",
15957 class_key == union_type ? "union"
15958 : class_key == record_type ? "struct" : "class",
15962 /* Issue an error message if DECL is redeclared with different
15963 access than its original declaration [class.access.spec/3].
15964 This applies to nested classes and nested class templates.
15968 cp_parser_check_access_in_redeclaration (tree decl)
15970 if (!CLASS_TYPE_P (TREE_TYPE (decl)))
15973 if ((TREE_PRIVATE (decl)
15974 != (current_access_specifier == access_private_node))
15975 || (TREE_PROTECTED (decl)
15976 != (current_access_specifier == access_protected_node)))
15977 error ("%qD redeclared with different access", decl);
15980 /* Look for the `template' keyword, as a syntactic disambiguator.
15981 Return TRUE iff it is present, in which case it will be
15985 cp_parser_optional_template_keyword (cp_parser *parser)
15987 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_TEMPLATE))
15989 /* The `template' keyword can only be used within templates;
15990 outside templates the parser can always figure out what is a
15991 template and what is not. */
15992 if (!processing_template_decl)
15994 error ("%<template%> (as a disambiguator) is only allowed "
15995 "within templates");
15996 /* If this part of the token stream is rescanned, the same
15997 error message would be generated. So, we purge the token
15998 from the stream. */
15999 cp_lexer_purge_token (parser->lexer);
16004 /* Consume the `template' keyword. */
16005 cp_lexer_consume_token (parser->lexer);
16013 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
16014 set PARSER->SCOPE, and perform other related actions. */
16017 cp_parser_pre_parsed_nested_name_specifier (cp_parser *parser)
16022 /* Get the stored value. */
16023 value = cp_lexer_consume_token (parser->lexer)->value;
16024 /* Perform any access checks that were deferred. */
16025 for (check = TREE_PURPOSE (value); check; check = TREE_CHAIN (check))
16026 perform_or_defer_access_check (TREE_PURPOSE (check), TREE_VALUE (check));
16027 /* Set the scope from the stored value. */
16028 parser->scope = TREE_VALUE (value);
16029 parser->qualifying_scope = TREE_TYPE (value);
16030 parser->object_scope = NULL_TREE;
16033 /* Consume tokens up through a non-nested END token. */
16036 cp_parser_cache_group (cp_parser *parser,
16037 enum cpp_ttype end,
16044 /* Abort a parenthesized expression if we encounter a brace. */
16045 if ((end == CPP_CLOSE_PAREN || depth == 0)
16046 && cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
16048 /* If we've reached the end of the file, stop. */
16049 if (cp_lexer_next_token_is (parser->lexer, CPP_EOF))
16051 /* Consume the next token. */
16052 token = cp_lexer_consume_token (parser->lexer);
16053 /* See if it starts a new group. */
16054 if (token->type == CPP_OPEN_BRACE)
16056 cp_parser_cache_group (parser, CPP_CLOSE_BRACE, depth + 1);
16060 else if (token->type == CPP_OPEN_PAREN)
16061 cp_parser_cache_group (parser, CPP_CLOSE_PAREN, depth + 1);
16062 else if (token->type == end)
16067 /* Begin parsing tentatively. We always save tokens while parsing
16068 tentatively so that if the tentative parsing fails we can restore the
16072 cp_parser_parse_tentatively (cp_parser* parser)
16074 /* Enter a new parsing context. */
16075 parser->context = cp_parser_context_new (parser->context);
16076 /* Begin saving tokens. */
16077 cp_lexer_save_tokens (parser->lexer);
16078 /* In order to avoid repetitive access control error messages,
16079 access checks are queued up until we are no longer parsing
16081 push_deferring_access_checks (dk_deferred);
16084 /* Commit to the currently active tentative parse. */
16087 cp_parser_commit_to_tentative_parse (cp_parser* parser)
16089 cp_parser_context *context;
16092 /* Mark all of the levels as committed. */
16093 lexer = parser->lexer;
16094 for (context = parser->context; context->next; context = context->next)
16096 if (context->status == CP_PARSER_STATUS_KIND_COMMITTED)
16098 context->status = CP_PARSER_STATUS_KIND_COMMITTED;
16099 while (!cp_lexer_saving_tokens (lexer))
16100 lexer = lexer->next;
16101 cp_lexer_commit_tokens (lexer);
16105 /* Abort the currently active tentative parse. All consumed tokens
16106 will be rolled back, and no diagnostics will be issued. */
16109 cp_parser_abort_tentative_parse (cp_parser* parser)
16111 cp_parser_simulate_error (parser);
16112 /* Now, pretend that we want to see if the construct was
16113 successfully parsed. */
16114 cp_parser_parse_definitely (parser);
16117 /* Stop parsing tentatively. If a parse error has occurred, restore the
16118 token stream. Otherwise, commit to the tokens we have consumed.
16119 Returns true if no error occurred; false otherwise. */
16122 cp_parser_parse_definitely (cp_parser* parser)
16124 bool error_occurred;
16125 cp_parser_context *context;
16127 /* Remember whether or not an error occurred, since we are about to
16128 destroy that information. */
16129 error_occurred = cp_parser_error_occurred (parser);
16130 /* Remove the topmost context from the stack. */
16131 context = parser->context;
16132 parser->context = context->next;
16133 /* If no parse errors occurred, commit to the tentative parse. */
16134 if (!error_occurred)
16136 /* Commit to the tokens read tentatively, unless that was
16138 if (context->status != CP_PARSER_STATUS_KIND_COMMITTED)
16139 cp_lexer_commit_tokens (parser->lexer);
16141 pop_to_parent_deferring_access_checks ();
16143 /* Otherwise, if errors occurred, roll back our state so that things
16144 are just as they were before we began the tentative parse. */
16147 cp_lexer_rollback_tokens (parser->lexer);
16148 pop_deferring_access_checks ();
16150 /* Add the context to the front of the free list. */
16151 context->next = cp_parser_context_free_list;
16152 cp_parser_context_free_list = context;
16154 return !error_occurred;
16157 /* Returns true if we are parsing tentatively and are not committed to
16158 this tentative parse. */
16161 cp_parser_uncommitted_to_tentative_parse_p (cp_parser* parser)
16163 return (cp_parser_parsing_tentatively (parser)
16164 && parser->context->status != CP_PARSER_STATUS_KIND_COMMITTED);
16167 /* Returns nonzero iff an error has occurred during the most recent
16168 tentative parse. */
16171 cp_parser_error_occurred (cp_parser* parser)
16173 return (cp_parser_parsing_tentatively (parser)
16174 && parser->context->status == CP_PARSER_STATUS_KIND_ERROR);
16177 /* Returns nonzero if GNU extensions are allowed. */
16180 cp_parser_allow_gnu_extensions_p (cp_parser* parser)
16182 return parser->allow_gnu_extensions_p;
16185 /* Objective-C++ Productions */
16188 /* Parse an Objective-C expression, which feeds into a primary-expression
16192 objc-message-expression
16193 objc-string-literal
16194 objc-encode-expression
16195 objc-protocol-expression
16196 objc-selector-expression
16198 Returns a tree representation of the expression. */
16201 cp_parser_objc_expression (cp_parser* parser)
16203 /* Try to figure out what kind of declaration is present. */
16204 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
16208 case CPP_OPEN_SQUARE:
16209 return cp_parser_objc_message_expression (parser);
16211 case CPP_OBJC_STRING:
16212 kwd = cp_lexer_consume_token (parser->lexer);
16213 return objc_build_string_object (kwd->value);
16216 switch (kwd->keyword)
16218 case RID_AT_ENCODE:
16219 return cp_parser_objc_encode_expression (parser);
16221 case RID_AT_PROTOCOL:
16222 return cp_parser_objc_protocol_expression (parser);
16224 case RID_AT_SELECTOR:
16225 return cp_parser_objc_selector_expression (parser);
16231 error ("misplaced `@%D' Objective-C++ construct", kwd->value);
16232 cp_parser_skip_to_end_of_block_or_statement (parser);
16235 return error_mark_node;
16238 /* Parse an Objective-C message expression.
16240 objc-message-expression:
16241 [ objc-message-receiver objc-message-args ]
16243 Returns a representation of an Objective-C message. */
16246 cp_parser_objc_message_expression (cp_parser* parser)
16248 tree receiver, messageargs;
16250 cp_lexer_consume_token (parser->lexer); /* Eat '['. */
16251 receiver = cp_parser_objc_message_receiver (parser);
16252 messageargs = cp_parser_objc_message_args (parser);
16253 cp_parser_require (parser, CPP_CLOSE_SQUARE, "`]'");
16255 return objc_build_message_expr (build_tree_list (receiver, messageargs));
16258 /* Parse an objc-message-receiver.
16260 objc-message-receiver:
16264 Returns a representation of the type or expression. */
16267 cp_parser_objc_message_receiver (cp_parser* parser)
16270 bool class_scope_p, template_p;
16272 /* An Objective-C message receiver may be either (1) a type
16273 or (2) an expression. */
16274 cp_parser_parse_tentatively (parser);
16275 rcv = cp_parser_expression (parser, false);
16277 if (cp_parser_parse_definitely (parser))
16280 /* Look for the optional `::' operator. */
16281 cp_parser_global_scope_opt (parser, false);
16282 /* Look for the nested-name-specifier. */
16283 cp_parser_nested_name_specifier_opt (parser,
16284 /*typename_keyword_p=*/true,
16285 /*check_dependency_p=*/true,
16287 /*is_declaration=*/true);
16288 class_scope_p = (parser->scope && TYPE_P (parser->scope));
16289 template_p = class_scope_p && cp_parser_optional_template_keyword (parser);
16290 /* Finally, look for the class-name. */
16291 rcv = cp_parser_class_name (parser,
16295 /*check_dependency_p=*/true,
16296 /*class_head_p=*/false,
16297 /*is_declaration=*/true);
16299 return objc_get_class_reference (rcv);
16302 /* Parse the arguments and selectors comprising an Objective-C message.
16307 objc-selector-args , objc-comma-args
16309 objc-selector-args:
16310 objc-selector [opt] : assignment-expression
16311 objc-selector-args objc-selector [opt] : assignment-expression
16314 assignment-expression
16315 objc-comma-args , assignment-expression
16317 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
16318 selector arguments and TREE_VALUE containing a list of comma
16322 cp_parser_objc_message_args (cp_parser* parser)
16324 tree sel_args = NULL_TREE, addl_args = NULL_TREE;
16325 bool maybe_unary_selector_p = true;
16326 cp_token *token = cp_lexer_peek_token (parser->lexer);
16328 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
16330 tree selector = NULL_TREE, arg;
16332 if (token->type != CPP_COLON)
16333 selector = cp_parser_objc_selector (parser);
16335 /* Detect if we have a unary selector. */
16336 if (maybe_unary_selector_p
16337 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
16338 return build_tree_list (selector, NULL_TREE);
16340 maybe_unary_selector_p = false;
16341 cp_parser_require (parser, CPP_COLON, "`:'");
16342 arg = cp_parser_assignment_expression (parser, false);
16345 = chainon (sel_args,
16346 build_tree_list (selector, arg));
16348 token = cp_lexer_peek_token (parser->lexer);
16351 /* Handle non-selector arguments, if any. */
16352 while (token->type == CPP_COMMA)
16356 cp_lexer_consume_token (parser->lexer);
16357 arg = cp_parser_assignment_expression (parser, false);
16360 = chainon (addl_args,
16361 build_tree_list (NULL_TREE, arg));
16363 token = cp_lexer_peek_token (parser->lexer);
16366 return build_tree_list (sel_args, addl_args);
16369 /* Parse an Objective-C encode expression.
16371 objc-encode-expression:
16372 @encode objc-typename
16374 Returns an encoded representation of the type argument. */
16377 cp_parser_objc_encode_expression (cp_parser* parser)
16381 cp_lexer_consume_token (parser->lexer); /* Eat '@encode'. */
16382 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
16383 type = complete_type (cp_parser_type_id (parser));
16384 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
16388 error ("`@encode' must specify a type as an argument");
16389 return error_mark_node;
16392 return objc_build_encode_expr (type);
16395 /* Parse an Objective-C @defs expression. */
16398 cp_parser_objc_defs_expression (cp_parser *parser)
16402 cp_lexer_consume_token (parser->lexer); /* Eat '@defs'. */
16403 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
16404 name = cp_parser_identifier (parser);
16405 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
16407 return objc_get_class_ivars (name);
16410 /* Parse an Objective-C protocol expression.
16412 objc-protocol-expression:
16413 @protocol ( identifier )
16415 Returns a representation of the protocol expression. */
16418 cp_parser_objc_protocol_expression (cp_parser* parser)
16422 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
16423 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
16424 proto = cp_parser_identifier (parser);
16425 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
16427 return objc_build_protocol_expr (proto);
16430 /* Parse an Objective-C selector expression.
16432 objc-selector-expression:
16433 @selector ( objc-method-signature )
16435 objc-method-signature:
16441 objc-selector-seq objc-selector :
16443 Returns a representation of the method selector. */
16446 cp_parser_objc_selector_expression (cp_parser* parser)
16448 tree sel_seq = NULL_TREE;
16449 bool maybe_unary_selector_p = true;
16452 cp_lexer_consume_token (parser->lexer); /* Eat '@selector'. */
16453 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
16454 token = cp_lexer_peek_token (parser->lexer);
16456 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
16458 tree selector = NULL_TREE;
16460 if (token->type != CPP_COLON)
16461 selector = cp_parser_objc_selector (parser);
16463 /* Detect if we have a unary selector. */
16464 if (maybe_unary_selector_p
16465 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
16467 sel_seq = selector;
16468 goto finish_selector;
16471 maybe_unary_selector_p = false;
16472 cp_parser_require (parser, CPP_COLON, "`:'");
16475 = chainon (sel_seq,
16476 build_tree_list (selector, NULL_TREE));
16478 token = cp_lexer_peek_token (parser->lexer);
16482 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
16484 return objc_build_selector_expr (sel_seq);
16487 /* Parse a list of identifiers.
16489 objc-identifier-list:
16491 objc-identifier-list , identifier
16493 Returns a TREE_LIST of identifier nodes. */
16496 cp_parser_objc_identifier_list (cp_parser* parser)
16498 tree list = build_tree_list (NULL_TREE, cp_parser_identifier (parser));
16499 cp_token *sep = cp_lexer_peek_token (parser->lexer);
16501 while (sep->type == CPP_COMMA)
16503 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
16504 list = chainon (list,
16505 build_tree_list (NULL_TREE,
16506 cp_parser_identifier (parser)));
16507 sep = cp_lexer_peek_token (parser->lexer);
16513 /* Parse an Objective-C alias declaration.
16515 objc-alias-declaration:
16516 @compatibility_alias identifier identifier ;
16518 This function registers the alias mapping with the Objective-C front-end.
16519 It returns nothing. */
16522 cp_parser_objc_alias_declaration (cp_parser* parser)
16526 cp_lexer_consume_token (parser->lexer); /* Eat '@compatibility_alias'. */
16527 alias = cp_parser_identifier (parser);
16528 orig = cp_parser_identifier (parser);
16529 objc_declare_alias (alias, orig);
16530 cp_parser_consume_semicolon_at_end_of_statement (parser);
16533 /* Parse an Objective-C class forward-declaration.
16535 objc-class-declaration:
16536 @class objc-identifier-list ;
16538 The function registers the forward declarations with the Objective-C
16539 front-end. It returns nothing. */
16542 cp_parser_objc_class_declaration (cp_parser* parser)
16544 cp_lexer_consume_token (parser->lexer); /* Eat '@class'. */
16545 objc_declare_class (cp_parser_objc_identifier_list (parser));
16546 cp_parser_consume_semicolon_at_end_of_statement (parser);
16549 /* Parse a list of Objective-C protocol references.
16551 objc-protocol-refs-opt:
16552 objc-protocol-refs [opt]
16554 objc-protocol-refs:
16555 < objc-identifier-list >
16557 Returns a TREE_LIST of identifiers, if any. */
16560 cp_parser_objc_protocol_refs_opt (cp_parser* parser)
16562 tree protorefs = NULL_TREE;
16564 if(cp_lexer_next_token_is (parser->lexer, CPP_LESS))
16566 cp_lexer_consume_token (parser->lexer); /* Eat '<'. */
16567 protorefs = cp_parser_objc_identifier_list (parser);
16568 cp_parser_require (parser, CPP_GREATER, "`>'");
16574 /* Parse a Objective-C visibility specification. */
16577 cp_parser_objc_visibility_spec (cp_parser* parser)
16579 cp_token *vis = cp_lexer_peek_token (parser->lexer);
16581 switch (vis->keyword)
16583 case RID_AT_PRIVATE:
16584 objc_set_visibility (2);
16586 case RID_AT_PROTECTED:
16587 objc_set_visibility (0);
16589 case RID_AT_PUBLIC:
16590 objc_set_visibility (1);
16596 /* Eat '@private'/'@protected'/'@public'. */
16597 cp_lexer_consume_token (parser->lexer);
16600 /* Parse an Objective-C method type. */
16603 cp_parser_objc_method_type (cp_parser* parser)
16605 objc_set_method_type
16606 (cp_lexer_consume_token (parser->lexer)->type == CPP_PLUS
16611 /* Parse an Objective-C protocol qualifier. */
16614 cp_parser_objc_protocol_qualifiers (cp_parser* parser)
16616 tree quals = NULL_TREE, node;
16617 cp_token *token = cp_lexer_peek_token (parser->lexer);
16619 node = token->value;
16621 while (node && TREE_CODE (node) == IDENTIFIER_NODE
16622 && (node == ridpointers [(int) RID_IN]
16623 || node == ridpointers [(int) RID_OUT]
16624 || node == ridpointers [(int) RID_INOUT]
16625 || node == ridpointers [(int) RID_BYCOPY]
16626 || node == ridpointers [(int) RID_BYREF]
16627 || node == ridpointers [(int) RID_ONEWAY]))
16629 quals = tree_cons (NULL_TREE, node, quals);
16630 cp_lexer_consume_token (parser->lexer);
16631 token = cp_lexer_peek_token (parser->lexer);
16632 node = token->value;
16638 /* Parse an Objective-C typename. */
16641 cp_parser_objc_typename (cp_parser* parser)
16643 tree typename = NULL_TREE;
16645 if (cp_lexer_next_token_is (parser->lexer, CPP_OPEN_PAREN))
16647 tree proto_quals, cp_type = NULL_TREE;
16649 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
16650 proto_quals = cp_parser_objc_protocol_qualifiers (parser);
16652 /* An ObjC type name may consist of just protocol qualifiers, in which
16653 case the type shall default to 'id'. */
16654 if (cp_lexer_next_token_is_not (parser->lexer, CPP_CLOSE_PAREN))
16655 cp_type = cp_parser_type_id (parser);
16657 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
16658 typename = build_tree_list (proto_quals, cp_type);
16664 /* Check to see if TYPE refers to an Objective-C selector name. */
16667 cp_parser_objc_selector_p (enum cpp_ttype type)
16669 return (type == CPP_NAME || type == CPP_KEYWORD
16670 || type == CPP_AND_AND || type == CPP_AND_EQ || type == CPP_AND
16671 || type == CPP_OR || type == CPP_COMPL || type == CPP_NOT
16672 || type == CPP_NOT_EQ || type == CPP_OR_OR || type == CPP_OR_EQ
16673 || type == CPP_XOR || type == CPP_XOR_EQ);
16676 /* Parse an Objective-C selector. */
16679 cp_parser_objc_selector (cp_parser* parser)
16681 cp_token *token = cp_lexer_consume_token (parser->lexer);
16683 if (!cp_parser_objc_selector_p (token->type))
16685 error ("invalid Objective-C++ selector name");
16686 return error_mark_node;
16689 /* C++ operator names are allowed to appear in ObjC selectors. */
16690 switch (token->type)
16692 case CPP_AND_AND: return get_identifier ("and");
16693 case CPP_AND_EQ: return get_identifier ("and_eq");
16694 case CPP_AND: return get_identifier ("bitand");
16695 case CPP_OR: return get_identifier ("bitor");
16696 case CPP_COMPL: return get_identifier ("compl");
16697 case CPP_NOT: return get_identifier ("not");
16698 case CPP_NOT_EQ: return get_identifier ("not_eq");
16699 case CPP_OR_OR: return get_identifier ("or");
16700 case CPP_OR_EQ: return get_identifier ("or_eq");
16701 case CPP_XOR: return get_identifier ("xor");
16702 case CPP_XOR_EQ: return get_identifier ("xor_eq");
16703 default: return token->value;
16707 /* Parse an Objective-C params list. */
16710 cp_parser_objc_method_keyword_params (cp_parser* parser)
16712 tree params = NULL_TREE;
16713 bool maybe_unary_selector_p = true;
16714 cp_token *token = cp_lexer_peek_token (parser->lexer);
16716 while (cp_parser_objc_selector_p (token->type) || token->type == CPP_COLON)
16718 tree selector = NULL_TREE, typename, identifier;
16720 if (token->type != CPP_COLON)
16721 selector = cp_parser_objc_selector (parser);
16723 /* Detect if we have a unary selector. */
16724 if (maybe_unary_selector_p
16725 && cp_lexer_next_token_is_not (parser->lexer, CPP_COLON))
16728 maybe_unary_selector_p = false;
16729 cp_parser_require (parser, CPP_COLON, "`:'");
16730 typename = cp_parser_objc_typename (parser);
16731 identifier = cp_parser_identifier (parser);
16735 objc_build_keyword_decl (selector,
16739 token = cp_lexer_peek_token (parser->lexer);
16745 /* Parse the non-keyword Objective-C params. */
16748 cp_parser_objc_method_tail_params_opt (cp_parser* parser, bool *ellipsisp)
16750 tree params = make_node (TREE_LIST);
16751 cp_token *token = cp_lexer_peek_token (parser->lexer);
16752 *ellipsisp = false; /* Initially, assume no ellipsis. */
16754 while (token->type == CPP_COMMA)
16756 cp_parameter_declarator *parmdecl;
16759 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
16760 token = cp_lexer_peek_token (parser->lexer);
16762 if (token->type == CPP_ELLIPSIS)
16764 cp_lexer_consume_token (parser->lexer); /* Eat '...'. */
16769 parmdecl = cp_parser_parameter_declaration (parser, false, NULL);
16770 parm = grokdeclarator (parmdecl->declarator,
16771 &parmdecl->decl_specifiers,
16772 PARM, /*initialized=*/0,
16773 /*attrlist=*/NULL);
16775 chainon (params, build_tree_list (NULL_TREE, parm));
16776 token = cp_lexer_peek_token (parser->lexer);
16782 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
16785 cp_parser_objc_interstitial_code (cp_parser* parser)
16787 cp_token *token = cp_lexer_peek_token (parser->lexer);
16789 /* If the next token is `extern' and the following token is a string
16790 literal, then we have a linkage specification. */
16791 if (token->keyword == RID_EXTERN
16792 && cp_parser_is_string_literal (cp_lexer_peek_nth_token (parser->lexer, 2)))
16793 cp_parser_linkage_specification (parser);
16794 /* Handle #pragma, if any. */
16795 else if (token->type == CPP_PRAGMA)
16796 cp_lexer_handle_pragma (parser->lexer);
16797 /* Allow stray semicolons. */
16798 else if (token->type == CPP_SEMICOLON)
16799 cp_lexer_consume_token (parser->lexer);
16800 /* Finally, try to parse a block-declaration, or a function-definition. */
16802 cp_parser_block_declaration (parser, /*statement_p=*/false);
16805 /* Parse a method signature. */
16808 cp_parser_objc_method_signature (cp_parser* parser)
16810 tree rettype, kwdparms, optparms;
16811 bool ellipsis = false;
16813 cp_parser_objc_method_type (parser);
16814 rettype = cp_parser_objc_typename (parser);
16815 kwdparms = cp_parser_objc_method_keyword_params (parser);
16816 optparms = cp_parser_objc_method_tail_params_opt (parser, &ellipsis);
16818 return objc_build_method_signature (rettype, kwdparms, optparms, ellipsis);
16821 /* Pars an Objective-C method prototype list. */
16824 cp_parser_objc_method_prototype_list (cp_parser* parser)
16826 cp_token *token = cp_lexer_peek_token (parser->lexer);
16828 while (token->keyword != RID_AT_END)
16830 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
16832 objc_add_method_declaration
16833 (cp_parser_objc_method_signature (parser));
16834 cp_parser_consume_semicolon_at_end_of_statement (parser);
16837 /* Allow for interspersed non-ObjC++ code. */
16838 cp_parser_objc_interstitial_code (parser);
16840 token = cp_lexer_peek_token (parser->lexer);
16843 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
16844 objc_finish_interface ();
16847 /* Parse an Objective-C method definition list. */
16850 cp_parser_objc_method_definition_list (cp_parser* parser)
16852 cp_token *token = cp_lexer_peek_token (parser->lexer);
16854 while (token->keyword != RID_AT_END)
16858 if (token->type == CPP_PLUS || token->type == CPP_MINUS)
16860 push_deferring_access_checks (dk_deferred);
16861 objc_start_method_definition
16862 (cp_parser_objc_method_signature (parser));
16864 /* For historical reasons, we accept an optional semicolon. */
16865 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
16866 cp_lexer_consume_token (parser->lexer);
16868 perform_deferred_access_checks ();
16869 stop_deferring_access_checks ();
16870 meth = cp_parser_function_definition_after_declarator (parser,
16872 pop_deferring_access_checks ();
16873 objc_finish_method_definition (meth);
16876 /* Allow for interspersed non-ObjC++ code. */
16877 cp_parser_objc_interstitial_code (parser);
16879 token = cp_lexer_peek_token (parser->lexer);
16882 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
16883 objc_finish_implementation ();
16886 /* Parse Objective-C ivars. */
16889 cp_parser_objc_class_ivars (cp_parser* parser)
16891 cp_token *token = cp_lexer_peek_token (parser->lexer);
16893 if (token->type != CPP_OPEN_BRACE)
16894 return; /* No ivars specified. */
16896 cp_lexer_consume_token (parser->lexer); /* Eat '{'. */
16897 token = cp_lexer_peek_token (parser->lexer);
16899 while (token->type != CPP_CLOSE_BRACE)
16901 cp_decl_specifier_seq declspecs;
16902 int decl_class_or_enum_p;
16903 tree prefix_attributes;
16905 cp_parser_objc_visibility_spec (parser);
16907 if (cp_lexer_next_token_is (parser->lexer, CPP_CLOSE_BRACE))
16910 cp_parser_decl_specifier_seq (parser,
16911 CP_PARSER_FLAGS_OPTIONAL,
16913 &decl_class_or_enum_p);
16914 prefix_attributes = declspecs.attributes;
16915 declspecs.attributes = NULL_TREE;
16917 /* Keep going until we hit the `;' at the end of the
16919 while (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
16921 tree width = NULL_TREE, attributes, first_attribute, decl;
16922 cp_declarator *declarator = NULL;
16923 int ctor_dtor_or_conv_p;
16925 /* Check for a (possibly unnamed) bitfield declaration. */
16926 token = cp_lexer_peek_token (parser->lexer);
16927 if (token->type == CPP_COLON)
16930 if (token->type == CPP_NAME
16931 && (cp_lexer_peek_nth_token (parser->lexer, 2)->type
16934 /* Get the name of the bitfield. */
16935 declarator = make_id_declarator (NULL_TREE,
16936 cp_parser_identifier (parser));
16939 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
16940 /* Get the width of the bitfield. */
16942 = cp_parser_constant_expression (parser,
16943 /*allow_non_constant=*/false,
16948 /* Parse the declarator. */
16950 = cp_parser_declarator (parser, CP_PARSER_DECLARATOR_NAMED,
16951 &ctor_dtor_or_conv_p,
16952 /*parenthesized_p=*/NULL,
16953 /*member_p=*/false);
16956 /* Look for attributes that apply to the ivar. */
16957 attributes = cp_parser_attributes_opt (parser);
16958 /* Remember which attributes are prefix attributes and
16960 first_attribute = attributes;
16961 /* Combine the attributes. */
16962 attributes = chainon (prefix_attributes, attributes);
16966 /* Create the bitfield declaration. */
16967 decl = grokbitfield (declarator, &declspecs, width);
16968 cplus_decl_attributes (&decl, attributes, /*flags=*/0);
16971 decl = grokfield (declarator, &declspecs, NULL_TREE,
16972 NULL_TREE, attributes);
16974 /* Add the instance variable. */
16975 objc_add_instance_variable (decl);
16977 /* Reset PREFIX_ATTRIBUTES. */
16978 while (attributes && TREE_CHAIN (attributes) != first_attribute)
16979 attributes = TREE_CHAIN (attributes);
16981 TREE_CHAIN (attributes) = NULL_TREE;
16983 token = cp_lexer_peek_token (parser->lexer);
16985 if (token->type == CPP_COMMA)
16987 cp_lexer_consume_token (parser->lexer); /* Eat ','. */
16993 cp_parser_consume_semicolon_at_end_of_statement (parser);
16994 token = cp_lexer_peek_token (parser->lexer);
16997 cp_lexer_consume_token (parser->lexer); /* Eat '}'. */
16998 /* For historical reasons, we accept an optional semicolon. */
16999 if (cp_lexer_next_token_is (parser->lexer, CPP_SEMICOLON))
17000 cp_lexer_consume_token (parser->lexer);
17003 /* Parse an Objective-C protocol declaration. */
17006 cp_parser_objc_protocol_declaration (cp_parser* parser)
17008 tree proto, protorefs;
17011 cp_lexer_consume_token (parser->lexer); /* Eat '@protocol'. */
17012 if (cp_lexer_next_token_is_not (parser->lexer, CPP_NAME))
17014 error ("identifier expected after `@protocol'");
17018 /* See if we have a foward declaration or a definition. */
17019 tok = cp_lexer_peek_nth_token (parser->lexer, 2);
17021 /* Try a forward declaration first. */
17022 if (tok->type == CPP_COMMA || tok->type == CPP_SEMICOLON)
17024 objc_declare_protocols (cp_parser_objc_identifier_list (parser));
17026 cp_parser_consume_semicolon_at_end_of_statement (parser);
17029 /* Ok, we got a full-fledged definition (or at least should). */
17032 proto = cp_parser_identifier (parser);
17033 protorefs = cp_parser_objc_protocol_refs_opt (parser);
17034 objc_start_protocol (proto, protorefs);
17035 cp_parser_objc_method_prototype_list (parser);
17039 /* Parse an Objective-C superclass or category. */
17042 cp_parser_objc_superclass_or_category (cp_parser *parser, tree *super,
17045 cp_token *next = cp_lexer_peek_token (parser->lexer);
17047 *super = *categ = NULL_TREE;
17048 if (next->type == CPP_COLON)
17050 cp_lexer_consume_token (parser->lexer); /* Eat ':'. */
17051 *super = cp_parser_identifier (parser);
17053 else if (next->type == CPP_OPEN_PAREN)
17055 cp_lexer_consume_token (parser->lexer); /* Eat '('. */
17056 *categ = cp_parser_identifier (parser);
17057 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17061 /* Parse an Objective-C class interface. */
17064 cp_parser_objc_class_interface (cp_parser* parser)
17066 tree name, super, categ, protos;
17068 cp_lexer_consume_token (parser->lexer); /* Eat '@interface'. */
17069 name = cp_parser_identifier (parser);
17070 cp_parser_objc_superclass_or_category (parser, &super, &categ);
17071 protos = cp_parser_objc_protocol_refs_opt (parser);
17073 /* We have either a class or a category on our hands. */
17075 objc_start_category_interface (name, categ, protos);
17078 objc_start_class_interface (name, super, protos);
17079 /* Handle instance variable declarations, if any. */
17080 cp_parser_objc_class_ivars (parser);
17081 objc_continue_interface ();
17084 cp_parser_objc_method_prototype_list (parser);
17087 /* Parse an Objective-C class implementation. */
17090 cp_parser_objc_class_implementation (cp_parser* parser)
17092 tree name, super, categ;
17094 cp_lexer_consume_token (parser->lexer); /* Eat '@implementation'. */
17095 name = cp_parser_identifier (parser);
17096 cp_parser_objc_superclass_or_category (parser, &super, &categ);
17098 /* We have either a class or a category on our hands. */
17100 objc_start_category_implementation (name, categ);
17103 objc_start_class_implementation (name, super);
17104 /* Handle instance variable declarations, if any. */
17105 cp_parser_objc_class_ivars (parser);
17106 objc_continue_implementation ();
17109 cp_parser_objc_method_definition_list (parser);
17112 /* Consume the @end token and finish off the implementation. */
17115 cp_parser_objc_end_implementation (cp_parser* parser)
17117 cp_lexer_consume_token (parser->lexer); /* Eat '@end'. */
17118 objc_finish_implementation ();
17121 /* Parse an Objective-C declaration. */
17124 cp_parser_objc_declaration (cp_parser* parser)
17126 /* Try to figure out what kind of declaration is present. */
17127 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
17129 switch (kwd->keyword)
17132 cp_parser_objc_alias_declaration (parser);
17135 cp_parser_objc_class_declaration (parser);
17137 case RID_AT_PROTOCOL:
17138 cp_parser_objc_protocol_declaration (parser);
17140 case RID_AT_INTERFACE:
17141 cp_parser_objc_class_interface (parser);
17143 case RID_AT_IMPLEMENTATION:
17144 cp_parser_objc_class_implementation (parser);
17147 cp_parser_objc_end_implementation (parser);
17150 error ("misplaced `@%D' Objective-C++ construct", kwd->value);
17151 cp_parser_skip_to_end_of_block_or_statement (parser);
17155 /* Parse an Objective-C try-catch-finally statement.
17157 objc-try-catch-finally-stmt:
17158 @try compound-statement objc-catch-clause-seq [opt]
17159 objc-finally-clause [opt]
17161 objc-catch-clause-seq:
17162 objc-catch-clause objc-catch-clause-seq [opt]
17165 @catch ( exception-declaration ) compound-statement
17167 objc-finally-clause
17168 @finally compound-statement
17170 Returns NULL_TREE. */
17173 cp_parser_objc_try_catch_finally_statement (cp_parser *parser) {
17174 location_t location;
17177 cp_parser_require_keyword (parser, RID_AT_TRY, "`@try'");
17178 location = cp_lexer_peek_token (parser->lexer)->location;
17179 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
17180 node, lest it get absorbed into the surrounding block. */
17181 stmt = push_stmt_list ();
17182 cp_parser_compound_statement (parser, NULL, false);
17183 objc_begin_try_stmt (location, pop_stmt_list (stmt));
17185 while (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_CATCH))
17187 cp_parameter_declarator *parmdecl;
17190 cp_lexer_consume_token (parser->lexer);
17191 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
17192 parmdecl = cp_parser_parameter_declaration (parser, false, NULL);
17193 parm = grokdeclarator (parmdecl->declarator,
17194 &parmdecl->decl_specifiers,
17195 PARM, /*initialized=*/0,
17196 /*attrlist=*/NULL);
17197 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17198 objc_begin_catch_clause (parm);
17199 cp_parser_compound_statement (parser, NULL, false);
17200 objc_finish_catch_clause ();
17203 if (cp_lexer_next_token_is_keyword (parser->lexer, RID_AT_FINALLY))
17205 cp_lexer_consume_token (parser->lexer);
17206 location = cp_lexer_peek_token (parser->lexer)->location;
17207 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
17208 node, lest it get absorbed into the surrounding block. */
17209 stmt = push_stmt_list ();
17210 cp_parser_compound_statement (parser, NULL, false);
17211 objc_build_finally_clause (location, pop_stmt_list (stmt));
17214 return objc_finish_try_stmt ();
17217 /* Parse an Objective-C synchronized statement.
17219 objc-synchronized-stmt:
17220 @synchronized ( expression ) compound-statement
17222 Returns NULL_TREE. */
17225 cp_parser_objc_synchronized_statement (cp_parser *parser) {
17226 location_t location;
17229 cp_parser_require_keyword (parser, RID_AT_SYNCHRONIZED, "`@synchronized'");
17231 location = cp_lexer_peek_token (parser->lexer)->location;
17232 cp_parser_require (parser, CPP_OPEN_PAREN, "`('");
17233 lock = cp_parser_expression (parser, false);
17234 cp_parser_require (parser, CPP_CLOSE_PAREN, "`)'");
17236 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
17237 node, lest it get absorbed into the surrounding block. */
17238 stmt = push_stmt_list ();
17239 cp_parser_compound_statement (parser, NULL, false);
17241 return objc_build_synchronized (location, lock, pop_stmt_list (stmt));
17244 /* Parse an Objective-C throw statement.
17247 @throw assignment-expression [opt] ;
17249 Returns a constructed '@throw' statement. */
17252 cp_parser_objc_throw_statement (cp_parser *parser) {
17253 tree expr = NULL_TREE;
17255 cp_parser_require_keyword (parser, RID_AT_THROW, "`@throw'");
17257 if (cp_lexer_next_token_is_not (parser->lexer, CPP_SEMICOLON))
17258 expr = cp_parser_assignment_expression (parser, false);
17260 cp_parser_consume_semicolon_at_end_of_statement (parser);
17262 return objc_build_throw_stmt (expr);
17265 /* Parse an Objective-C statement. */
17268 cp_parser_objc_statement (cp_parser * parser) {
17269 /* Try to figure out what kind of declaration is present. */
17270 cp_token *kwd = cp_lexer_peek_token (parser->lexer);
17272 switch (kwd->keyword)
17275 return cp_parser_objc_try_catch_finally_statement (parser);
17276 case RID_AT_SYNCHRONIZED:
17277 return cp_parser_objc_synchronized_statement (parser);
17279 return cp_parser_objc_throw_statement (parser);
17281 error ("misplaced `@%D' Objective-C++ construct", kwd->value);
17282 cp_parser_skip_to_end_of_block_or_statement (parser);
17285 return error_mark_node;
17290 static GTY (()) cp_parser *the_parser;
17292 /* External interface. */
17294 /* Parse one entire translation unit. */
17297 c_parse_file (void)
17299 bool error_occurred;
17300 static bool already_called = false;
17302 if (already_called)
17304 sorry ("inter-module optimizations not implemented for C++");
17307 already_called = true;
17309 the_parser = cp_parser_new ();
17310 push_deferring_access_checks (flag_access_control
17311 ? dk_no_deferred : dk_no_check);
17312 error_occurred = cp_parser_translation_unit (the_parser);
17316 /* This variable must be provided by every front end. */
17320 #include "gt-cp-parser.h"