2 Copyright (C) 2000, 2001, 2002, 2003, 2004,
3 2005, 2007, 2008, 2009 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 3, 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 COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
26 #include "dyn-string.h"
34 #include "diagnostic.h"
45 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
46 and c-lex.c) and the C++ parser. */
48 /* A token's value and its associated deferred access checks and
51 struct tree_check
GTY(())
53 /* The value associated with the token. */
55 /* The checks that have been associated with value. */
56 VEC (deferred_access_check
, gc
)* checks
;
57 /* The token's qualifying scope (used when it is a
58 CPP_NESTED_NAME_SPECIFIER). */
59 tree qualifying_scope
;
64 typedef struct cp_token
GTY (())
66 /* The kind of token. */
67 ENUM_BITFIELD (cpp_ttype
) type
: 8;
68 /* If this token is a keyword, this value indicates which keyword.
69 Otherwise, this value is RID_MAX. */
70 ENUM_BITFIELD (rid
) keyword
: 8;
73 /* Identifier for the pragma. */
74 ENUM_BITFIELD (pragma_kind
) pragma_kind
: 6;
75 /* True if this token is from a context where it is implicitly extern "C" */
76 BOOL_BITFIELD implicit_extern_c
: 1;
77 /* True for a CPP_NAME token that is not a keyword (i.e., for which
78 KEYWORD is RID_MAX) iff this name was looked up and found to be
79 ambiguous. An error has already been reported. */
80 BOOL_BITFIELD ambiguous_p
: 1;
81 /* The location at which this token was found. */
83 /* The value associated with this token, if any. */
84 union cp_token_value
{
85 /* Used for CPP_NESTED_NAME_SPECIFIER and CPP_TEMPLATE_ID. */
86 struct tree_check
* GTY((tag ("1"))) tree_check_value
;
87 /* Use for all other tokens. */
88 tree
GTY((tag ("0"))) value
;
89 } GTY((desc ("(%1.type == CPP_TEMPLATE_ID) || (%1.type == CPP_NESTED_NAME_SPECIFIER)"))) u
;
92 /* We use a stack of token pointer for saving token sets. */
93 typedef struct cp_token
*cp_token_position
;
94 DEF_VEC_P (cp_token_position
);
95 DEF_VEC_ALLOC_P (cp_token_position
,heap
);
97 static cp_token eof_token
=
99 CPP_EOF
, RID_MAX
, 0, PRAGMA_NONE
, false, 0, 0, { NULL
}
102 /* The cp_lexer structure represents the C++ lexer. It is responsible
103 for managing the token stream from the preprocessor and supplying
104 it to the parser. Tokens are never added to the cp_lexer after
107 typedef struct cp_lexer
GTY (())
109 /* The memory allocated for the buffer. NULL if this lexer does not
110 own the token buffer. */
111 cp_token
* GTY ((length ("%h.buffer_length"))) buffer
;
112 /* If the lexer owns the buffer, this is the number of tokens in the
114 size_t buffer_length
;
116 /* A pointer just past the last available token. The tokens
117 in this lexer are [buffer, last_token). */
118 cp_token_position
GTY ((skip
)) last_token
;
120 /* The next available token. If NEXT_TOKEN is &eof_token, then there are
121 no more available tokens. */
122 cp_token_position
GTY ((skip
)) next_token
;
124 /* A stack indicating positions at which cp_lexer_save_tokens was
125 called. The top entry is the most recent position at which we
126 began saving tokens. If the stack is non-empty, we are saving
128 VEC(cp_token_position
,heap
) *GTY ((skip
)) saved_tokens
;
130 /* The next lexer in a linked list of lexers. */
131 struct cp_lexer
*next
;
133 /* True if we should output debugging information. */
136 /* True if we're in the context of parsing a pragma, and should not
137 increment past the end-of-line marker. */
141 /* cp_token_cache is a range of tokens. There is no need to represent
142 allocate heap memory for it, since tokens are never removed from the
143 lexer's array. There is also no need for the GC to walk through
144 a cp_token_cache, since everything in here is referenced through
147 typedef struct cp_token_cache
GTY(())
149 /* The beginning of the token range. */
150 cp_token
* GTY((skip
)) first
;
152 /* Points immediately after the last token in the range. */
153 cp_token
* GTY ((skip
)) last
;
158 static cp_lexer
*cp_lexer_new_main
160 static cp_lexer
*cp_lexer_new_from_tokens
161 (cp_token_cache
*tokens
);
162 static void cp_lexer_destroy
164 static int cp_lexer_saving_tokens
166 static cp_token_position cp_lexer_token_position
168 static cp_token
*cp_lexer_token_at
169 (cp_lexer
*, cp_token_position
);
170 static void cp_lexer_get_preprocessor_token
171 (cp_lexer
*, cp_token
*);
172 static inline cp_token
*cp_lexer_peek_token
174 static cp_token
*cp_lexer_peek_nth_token
175 (cp_lexer
*, size_t);
176 static inline bool cp_lexer_next_token_is
177 (cp_lexer
*, enum cpp_ttype
);
178 static bool cp_lexer_next_token_is_not
179 (cp_lexer
*, enum cpp_ttype
);
180 static bool cp_lexer_next_token_is_keyword
181 (cp_lexer
*, enum rid
);
182 static cp_token
*cp_lexer_consume_token
184 static void cp_lexer_purge_token
186 static void cp_lexer_purge_tokens_after
187 (cp_lexer
*, cp_token_position
);
188 static void cp_lexer_save_tokens
190 static void cp_lexer_commit_tokens
192 static void cp_lexer_rollback_tokens
194 #ifdef ENABLE_CHECKING
195 static void cp_lexer_print_token
196 (FILE *, cp_token
*);
197 static inline bool cp_lexer_debugging_p
199 static void cp_lexer_start_debugging
200 (cp_lexer
*) ATTRIBUTE_UNUSED
;
201 static void cp_lexer_stop_debugging
202 (cp_lexer
*) ATTRIBUTE_UNUSED
;
204 /* If we define cp_lexer_debug_stream to NULL it will provoke warnings
205 about passing NULL to functions that require non-NULL arguments
206 (fputs, fprintf). It will never be used, so all we need is a value
207 of the right type that's guaranteed not to be NULL. */
208 #define cp_lexer_debug_stream stdout
209 #define cp_lexer_print_token(str, tok) (void) 0
210 #define cp_lexer_debugging_p(lexer) 0
211 #endif /* ENABLE_CHECKING */
213 static cp_token_cache
*cp_token_cache_new
214 (cp_token
*, cp_token
*);
216 static void cp_parser_initial_pragma
219 /* Manifest constants. */
220 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
221 #define CP_SAVED_TOKEN_STACK 5
223 /* A token type for keywords, as opposed to ordinary identifiers. */
224 #define CPP_KEYWORD ((enum cpp_ttype) (N_TTYPES + 1))
226 /* A token type for template-ids. If a template-id is processed while
227 parsing tentatively, it is replaced with a CPP_TEMPLATE_ID token;
228 the value of the CPP_TEMPLATE_ID is whatever was returned by
229 cp_parser_template_id. */
230 #define CPP_TEMPLATE_ID ((enum cpp_ttype) (CPP_KEYWORD + 1))
232 /* A token type for nested-name-specifiers. If a
233 nested-name-specifier is processed while parsing tentatively, it is
234 replaced with a CPP_NESTED_NAME_SPECIFIER token; the value of the
235 CPP_NESTED_NAME_SPECIFIER is whatever was returned by
236 cp_parser_nested_name_specifier_opt. */
237 #define CPP_NESTED_NAME_SPECIFIER ((enum cpp_ttype) (CPP_TEMPLATE_ID + 1))
239 /* A token type for tokens that are not tokens at all; these are used
240 to represent slots in the array where there used to be a token
241 that has now been deleted. */
242 #define CPP_PURGED ((enum cpp_ttype) (CPP_NESTED_NAME_SPECIFIER + 1))
244 /* The number of token types, including C++-specific ones. */
245 #define N_CP_TTYPES ((int) (CPP_PURGED + 1))
249 #ifdef ENABLE_CHECKING
250 /* The stream to which debugging output should be written. */
251 static FILE *cp_lexer_debug_stream
;
252 #endif /* ENABLE_CHECKING */
254 /* Create a new main C++ lexer, the lexer that gets tokens from the
258 cp_lexer_new_main (void)
260 cp_token first_token
;
267 /* It's possible that parsing the first pragma will load a PCH file,
268 which is a GC collection point. So we have to do that before
269 allocating any memory. */
270 cp_parser_initial_pragma (&first_token
);
272 c_common_no_more_pch ();
274 /* Allocate the memory. */
275 lexer
= GGC_CNEW (cp_lexer
);
277 #ifdef ENABLE_CHECKING
278 /* Initially we are not debugging. */
279 lexer
->debugging_p
= false;
280 #endif /* ENABLE_CHECKING */
281 lexer
->saved_tokens
= VEC_alloc (cp_token_position
, heap
,
282 CP_SAVED_TOKEN_STACK
);
284 /* Create the buffer. */
285 alloc
= CP_LEXER_BUFFER_SIZE
;
286 buffer
= GGC_NEWVEC (cp_token
, alloc
);
288 /* Put the first token in the buffer. */
293 /* Get the remaining tokens from the preprocessor. */
294 while (pos
->type
!= CPP_EOF
)
301 buffer
= GGC_RESIZEVEC (cp_token
, buffer
, alloc
);
302 pos
= buffer
+ space
;
304 cp_lexer_get_preprocessor_token (lexer
, pos
);
306 lexer
->buffer
= buffer
;
307 lexer
->buffer_length
= alloc
- space
;
308 lexer
->last_token
= pos
;
309 lexer
->next_token
= lexer
->buffer_length
? buffer
: &eof_token
;
311 /* Subsequent preprocessor diagnostics should use compiler
312 diagnostic functions to get the compiler source location. */
315 gcc_assert (lexer
->next_token
->type
!= CPP_PURGED
);
319 /* Create a new lexer whose token stream is primed with the tokens in
320 CACHE. When these tokens are exhausted, no new tokens will be read. */
323 cp_lexer_new_from_tokens (cp_token_cache
*cache
)
325 cp_token
*first
= cache
->first
;
326 cp_token
*last
= cache
->last
;
327 cp_lexer
*lexer
= GGC_CNEW (cp_lexer
);
329 /* We do not own the buffer. */
330 lexer
->buffer
= NULL
;
331 lexer
->buffer_length
= 0;
332 lexer
->next_token
= first
== last
? &eof_token
: first
;
333 lexer
->last_token
= last
;
335 lexer
->saved_tokens
= VEC_alloc (cp_token_position
, heap
,
336 CP_SAVED_TOKEN_STACK
);
338 #ifdef ENABLE_CHECKING
339 /* Initially we are not debugging. */
340 lexer
->debugging_p
= false;
343 gcc_assert (lexer
->next_token
->type
!= CPP_PURGED
);
347 /* Frees all resources associated with LEXER. */
350 cp_lexer_destroy (cp_lexer
*lexer
)
353 ggc_free (lexer
->buffer
);
354 VEC_free (cp_token_position
, heap
, lexer
->saved_tokens
);
358 /* Returns nonzero if debugging information should be output. */
360 #ifdef ENABLE_CHECKING
363 cp_lexer_debugging_p (cp_lexer
*lexer
)
365 return lexer
->debugging_p
;
368 #endif /* ENABLE_CHECKING */
370 static inline cp_token_position
371 cp_lexer_token_position (cp_lexer
*lexer
, bool previous_p
)
373 gcc_assert (!previous_p
|| lexer
->next_token
!= &eof_token
);
375 return lexer
->next_token
- previous_p
;
378 static inline cp_token
*
379 cp_lexer_token_at (cp_lexer
*lexer ATTRIBUTE_UNUSED
, cp_token_position pos
)
384 /* nonzero if we are presently saving tokens. */
387 cp_lexer_saving_tokens (const cp_lexer
* lexer
)
389 return VEC_length (cp_token_position
, lexer
->saved_tokens
) != 0;
392 /* Store the next token from the preprocessor in *TOKEN. Return true
393 if we reach EOF. If LEXER is NULL, assume we are handling an
394 initial #pragma pch_preprocess, and thus want the lexer to return
395 processed strings. */
398 cp_lexer_get_preprocessor_token (cp_lexer
*lexer
, cp_token
*token
)
400 static int is_extern_c
= 0;
402 /* Get a new token from the preprocessor. */
404 = c_lex_with_flags (&token
->u
.value
, &token
->location
, &token
->flags
,
405 lexer
== NULL
? 0 : C_LEX_RAW_STRINGS
);
406 token
->keyword
= RID_MAX
;
407 token
->pragma_kind
= PRAGMA_NONE
;
409 /* On some systems, some header files are surrounded by an
410 implicit extern "C" block. Set a flag in the token if it
411 comes from such a header. */
412 is_extern_c
+= pending_lang_change
;
413 pending_lang_change
= 0;
414 token
->implicit_extern_c
= is_extern_c
> 0;
416 /* Check to see if this token is a keyword. */
417 if (token
->type
== CPP_NAME
)
419 if (C_IS_RESERVED_WORD (token
->u
.value
))
421 /* Mark this token as a keyword. */
422 token
->type
= CPP_KEYWORD
;
423 /* Record which keyword. */
424 token
->keyword
= C_RID_CODE (token
->u
.value
);
425 /* Update the value. Some keywords are mapped to particular
426 entities, rather than simply having the value of the
427 corresponding IDENTIFIER_NODE. For example, `__const' is
428 mapped to `const'. */
429 token
->u
.value
= ridpointers
[token
->keyword
];
433 if (warn_cxx0x_compat
434 && C_RID_CODE (token
->u
.value
) >= RID_FIRST_CXX0X
435 && C_RID_CODE (token
->u
.value
) <= RID_LAST_CXX0X
)
437 /* Warn about the C++0x keyword (but still treat it as
439 warning (OPT_Wc__0x_compat
,
440 "identifier %<%s%> will become a keyword in C++0x",
441 IDENTIFIER_POINTER (token
->u
.value
));
443 /* Clear out the C_RID_CODE so we don't warn about this
444 particular identifier-turned-keyword again. */
445 C_SET_RID_CODE (token
->u
.value
, RID_MAX
);
448 token
->ambiguous_p
= false;
449 token
->keyword
= RID_MAX
;
452 /* Handle Objective-C++ keywords. */
453 else if (token
->type
== CPP_AT_NAME
)
455 token
->type
= CPP_KEYWORD
;
456 switch (C_RID_CODE (token
->u
.value
))
458 /* Map 'class' to '@class', 'private' to '@private', etc. */
459 case RID_CLASS
: token
->keyword
= RID_AT_CLASS
; break;
460 case RID_PRIVATE
: token
->keyword
= RID_AT_PRIVATE
; break;
461 case RID_PROTECTED
: token
->keyword
= RID_AT_PROTECTED
; break;
462 case RID_PUBLIC
: token
->keyword
= RID_AT_PUBLIC
; break;
463 case RID_THROW
: token
->keyword
= RID_AT_THROW
; break;
464 case RID_TRY
: token
->keyword
= RID_AT_TRY
; break;
465 case RID_CATCH
: token
->keyword
= RID_AT_CATCH
; break;
466 default: token
->keyword
= C_RID_CODE (token
->u
.value
);
469 else if (token
->type
== CPP_PRAGMA
)
471 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
472 token
->pragma_kind
= TREE_INT_CST_LOW (token
->u
.value
);
473 token
->u
.value
= NULL_TREE
;
477 /* Update the globals input_location and the input file stack from TOKEN. */
479 cp_lexer_set_source_position_from_token (cp_token
*token
)
481 if (token
->type
!= CPP_EOF
)
483 input_location
= token
->location
;
487 /* Return a pointer to the next token in the token stream, but do not
490 static inline cp_token
*
491 cp_lexer_peek_token (cp_lexer
*lexer
)
493 if (cp_lexer_debugging_p (lexer
))
495 fputs ("cp_lexer: peeking at token: ", cp_lexer_debug_stream
);
496 cp_lexer_print_token (cp_lexer_debug_stream
, lexer
->next_token
);
497 putc ('\n', cp_lexer_debug_stream
);
499 return lexer
->next_token
;
502 /* Return true if the next token has the indicated TYPE. */
505 cp_lexer_next_token_is (cp_lexer
* lexer
, enum cpp_ttype type
)
507 return cp_lexer_peek_token (lexer
)->type
== type
;
510 /* Return true if the next token does not have the indicated TYPE. */
513 cp_lexer_next_token_is_not (cp_lexer
* lexer
, enum cpp_ttype type
)
515 return !cp_lexer_next_token_is (lexer
, type
);
518 /* Return true if the next token is the indicated KEYWORD. */
521 cp_lexer_next_token_is_keyword (cp_lexer
* lexer
, enum rid keyword
)
523 return cp_lexer_peek_token (lexer
)->keyword
== keyword
;
526 /* Return true if the next token is not the indicated KEYWORD. */
529 cp_lexer_next_token_is_not_keyword (cp_lexer
* lexer
, enum rid keyword
)
531 return cp_lexer_peek_token (lexer
)->keyword
!= keyword
;
534 /* Return true if the next token is a keyword for a decl-specifier. */
537 cp_lexer_next_token_is_decl_specifier_keyword (cp_lexer
*lexer
)
541 token
= cp_lexer_peek_token (lexer
);
542 switch (token
->keyword
)
544 /* auto specifier: storage-class-specifier in C++,
545 simple-type-specifier in C++0x. */
547 /* Storage classes. */
553 /* Elaborated type specifiers. */
559 /* Simple type specifiers. */
573 /* GNU extensions. */
576 /* C++0x extensions. */
585 /* Return a pointer to the Nth token in the token stream. If N is 1,
586 then this is precisely equivalent to cp_lexer_peek_token (except
587 that it is not inline). One would like to disallow that case, but
588 there is one case (cp_parser_nth_token_starts_template_id) where
589 the caller passes a variable for N and it might be 1. */
592 cp_lexer_peek_nth_token (cp_lexer
* lexer
, size_t n
)
596 /* N is 1-based, not zero-based. */
599 if (cp_lexer_debugging_p (lexer
))
600 fprintf (cp_lexer_debug_stream
,
601 "cp_lexer: peeking ahead %ld at token: ", (long)n
);
604 token
= lexer
->next_token
;
605 gcc_assert (!n
|| token
!= &eof_token
);
609 if (token
== lexer
->last_token
)
615 if (token
->type
!= CPP_PURGED
)
619 if (cp_lexer_debugging_p (lexer
))
621 cp_lexer_print_token (cp_lexer_debug_stream
, token
);
622 putc ('\n', cp_lexer_debug_stream
);
628 /* Return the next token, and advance the lexer's next_token pointer
629 to point to the next non-purged token. */
632 cp_lexer_consume_token (cp_lexer
* lexer
)
634 cp_token
*token
= lexer
->next_token
;
636 gcc_assert (token
!= &eof_token
);
637 gcc_assert (!lexer
->in_pragma
|| token
->type
!= CPP_PRAGMA_EOL
);
642 if (lexer
->next_token
== lexer
->last_token
)
644 lexer
->next_token
= &eof_token
;
649 while (lexer
->next_token
->type
== CPP_PURGED
);
651 cp_lexer_set_source_position_from_token (token
);
653 /* Provide debugging output. */
654 if (cp_lexer_debugging_p (lexer
))
656 fputs ("cp_lexer: consuming token: ", cp_lexer_debug_stream
);
657 cp_lexer_print_token (cp_lexer_debug_stream
, token
);
658 putc ('\n', cp_lexer_debug_stream
);
664 /* Permanently remove the next token from the token stream, and
665 advance the next_token pointer to refer to the next non-purged
669 cp_lexer_purge_token (cp_lexer
*lexer
)
671 cp_token
*tok
= lexer
->next_token
;
673 gcc_assert (tok
!= &eof_token
);
674 tok
->type
= CPP_PURGED
;
675 tok
->location
= UNKNOWN_LOCATION
;
676 tok
->u
.value
= NULL_TREE
;
677 tok
->keyword
= RID_MAX
;
682 if (tok
== lexer
->last_token
)
688 while (tok
->type
== CPP_PURGED
);
689 lexer
->next_token
= tok
;
692 /* Permanently remove all tokens after TOK, up to, but not
693 including, the token that will be returned next by
694 cp_lexer_peek_token. */
697 cp_lexer_purge_tokens_after (cp_lexer
*lexer
, cp_token
*tok
)
699 cp_token
*peek
= lexer
->next_token
;
701 if (peek
== &eof_token
)
702 peek
= lexer
->last_token
;
704 gcc_assert (tok
< peek
);
706 for ( tok
+= 1; tok
!= peek
; tok
+= 1)
708 tok
->type
= CPP_PURGED
;
709 tok
->location
= UNKNOWN_LOCATION
;
710 tok
->u
.value
= NULL_TREE
;
711 tok
->keyword
= RID_MAX
;
715 /* Begin saving tokens. All tokens consumed after this point will be
719 cp_lexer_save_tokens (cp_lexer
* lexer
)
721 /* Provide debugging output. */
722 if (cp_lexer_debugging_p (lexer
))
723 fprintf (cp_lexer_debug_stream
, "cp_lexer: saving tokens\n");
725 VEC_safe_push (cp_token_position
, heap
,
726 lexer
->saved_tokens
, lexer
->next_token
);
729 /* Commit to the portion of the token stream most recently saved. */
732 cp_lexer_commit_tokens (cp_lexer
* lexer
)
734 /* Provide debugging output. */
735 if (cp_lexer_debugging_p (lexer
))
736 fprintf (cp_lexer_debug_stream
, "cp_lexer: committing tokens\n");
738 VEC_pop (cp_token_position
, lexer
->saved_tokens
);
741 /* Return all tokens saved since the last call to cp_lexer_save_tokens
742 to the token stream. Stop saving tokens. */
745 cp_lexer_rollback_tokens (cp_lexer
* lexer
)
747 /* Provide debugging output. */
748 if (cp_lexer_debugging_p (lexer
))
749 fprintf (cp_lexer_debug_stream
, "cp_lexer: restoring tokens\n");
751 lexer
->next_token
= VEC_pop (cp_token_position
, lexer
->saved_tokens
);
754 /* Print a representation of the TOKEN on the STREAM. */
756 #ifdef ENABLE_CHECKING
759 cp_lexer_print_token (FILE * stream
, cp_token
*token
)
761 /* We don't use cpp_type2name here because the parser defines
762 a few tokens of its own. */
763 static const char *const token_names
[] = {
764 /* cpplib-defined token types */
770 /* C++ parser token types - see "Manifest constants", above. */
773 "NESTED_NAME_SPECIFIER",
777 /* If we have a name for the token, print it out. Otherwise, we
778 simply give the numeric code. */
779 gcc_assert (token
->type
< ARRAY_SIZE(token_names
));
780 fputs (token_names
[token
->type
], stream
);
782 /* For some tokens, print the associated data. */
786 /* Some keywords have a value that is not an IDENTIFIER_NODE.
787 For example, `struct' is mapped to an INTEGER_CST. */
788 if (TREE_CODE (token
->u
.value
) != IDENTIFIER_NODE
)
790 /* else fall through */
792 fputs (IDENTIFIER_POINTER (token
->u
.value
), stream
);
799 fprintf (stream
, " \"%s\"", TREE_STRING_POINTER (token
->u
.value
));
807 /* Start emitting debugging information. */
810 cp_lexer_start_debugging (cp_lexer
* lexer
)
812 lexer
->debugging_p
= true;
815 /* Stop emitting debugging information. */
818 cp_lexer_stop_debugging (cp_lexer
* lexer
)
820 lexer
->debugging_p
= false;
823 #endif /* ENABLE_CHECKING */
825 /* Create a new cp_token_cache, representing a range of tokens. */
827 static cp_token_cache
*
828 cp_token_cache_new (cp_token
*first
, cp_token
*last
)
830 cp_token_cache
*cache
= GGC_NEW (cp_token_cache
);
831 cache
->first
= first
;
837 /* Decl-specifiers. */
839 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
842 clear_decl_specs (cp_decl_specifier_seq
*decl_specs
)
844 memset (decl_specs
, 0, sizeof (cp_decl_specifier_seq
));
849 /* Nothing other than the parser should be creating declarators;
850 declarators are a semi-syntactic representation of C++ entities.
851 Other parts of the front end that need to create entities (like
852 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
854 static cp_declarator
*make_call_declarator
855 (cp_declarator
*, tree
, cp_cv_quals
, tree
, tree
);
856 static cp_declarator
*make_array_declarator
857 (cp_declarator
*, tree
);
858 static cp_declarator
*make_pointer_declarator
859 (cp_cv_quals
, cp_declarator
*);
860 static cp_declarator
*make_reference_declarator
861 (cp_cv_quals
, cp_declarator
*, bool);
862 static cp_parameter_declarator
*make_parameter_declarator
863 (cp_decl_specifier_seq
*, cp_declarator
*, tree
);
864 static cp_declarator
*make_ptrmem_declarator
865 (cp_cv_quals
, tree
, cp_declarator
*);
867 /* An erroneous declarator. */
868 static cp_declarator
*cp_error_declarator
;
870 /* The obstack on which declarators and related data structures are
872 static struct obstack declarator_obstack
;
874 /* Alloc BYTES from the declarator memory pool. */
877 alloc_declarator (size_t bytes
)
879 return obstack_alloc (&declarator_obstack
, bytes
);
882 /* Allocate a declarator of the indicated KIND. Clear fields that are
883 common to all declarators. */
885 static cp_declarator
*
886 make_declarator (cp_declarator_kind kind
)
888 cp_declarator
*declarator
;
890 declarator
= (cp_declarator
*) alloc_declarator (sizeof (cp_declarator
));
891 declarator
->kind
= kind
;
892 declarator
->attributes
= NULL_TREE
;
893 declarator
->declarator
= NULL
;
894 declarator
->parameter_pack_p
= false;
899 /* Make a declarator for a generalized identifier. If
900 QUALIFYING_SCOPE is non-NULL, the identifier is
901 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
902 UNQUALIFIED_NAME. SFK indicates the kind of special function this
905 static cp_declarator
*
906 make_id_declarator (tree qualifying_scope
, tree unqualified_name
,
907 special_function_kind sfk
)
909 cp_declarator
*declarator
;
911 /* It is valid to write:
913 class C { void f(); };
917 The standard is not clear about whether `typedef const C D' is
918 legal; as of 2002-09-15 the committee is considering that
919 question. EDG 3.0 allows that syntax. Therefore, we do as
921 if (qualifying_scope
&& TYPE_P (qualifying_scope
))
922 qualifying_scope
= TYPE_MAIN_VARIANT (qualifying_scope
);
924 gcc_assert (TREE_CODE (unqualified_name
) == IDENTIFIER_NODE
925 || TREE_CODE (unqualified_name
) == BIT_NOT_EXPR
926 || TREE_CODE (unqualified_name
) == TEMPLATE_ID_EXPR
);
928 declarator
= make_declarator (cdk_id
);
929 declarator
->u
.id
.qualifying_scope
= qualifying_scope
;
930 declarator
->u
.id
.unqualified_name
= unqualified_name
;
931 declarator
->u
.id
.sfk
= sfk
;
936 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
937 of modifiers such as const or volatile to apply to the pointer
938 type, represented as identifiers. */
941 make_pointer_declarator (cp_cv_quals cv_qualifiers
, cp_declarator
*target
)
943 cp_declarator
*declarator
;
945 declarator
= make_declarator (cdk_pointer
);
946 declarator
->declarator
= target
;
947 declarator
->u
.pointer
.qualifiers
= cv_qualifiers
;
948 declarator
->u
.pointer
.class_type
= NULL_TREE
;
951 declarator
->parameter_pack_p
= target
->parameter_pack_p
;
952 target
->parameter_pack_p
= false;
955 declarator
->parameter_pack_p
= false;
960 /* Like make_pointer_declarator -- but for references. */
963 make_reference_declarator (cp_cv_quals cv_qualifiers
, cp_declarator
*target
,
966 cp_declarator
*declarator
;
968 declarator
= make_declarator (cdk_reference
);
969 declarator
->declarator
= target
;
970 declarator
->u
.reference
.qualifiers
= cv_qualifiers
;
971 declarator
->u
.reference
.rvalue_ref
= rvalue_ref
;
974 declarator
->parameter_pack_p
= target
->parameter_pack_p
;
975 target
->parameter_pack_p
= false;
978 declarator
->parameter_pack_p
= false;
983 /* Like make_pointer_declarator -- but for a pointer to a non-static
984 member of CLASS_TYPE. */
987 make_ptrmem_declarator (cp_cv_quals cv_qualifiers
, tree class_type
,
988 cp_declarator
*pointee
)
990 cp_declarator
*declarator
;
992 declarator
= make_declarator (cdk_ptrmem
);
993 declarator
->declarator
= pointee
;
994 declarator
->u
.pointer
.qualifiers
= cv_qualifiers
;
995 declarator
->u
.pointer
.class_type
= class_type
;
999 declarator
->parameter_pack_p
= pointee
->parameter_pack_p
;
1000 pointee
->parameter_pack_p
= false;
1003 declarator
->parameter_pack_p
= false;
1008 /* Make a declarator for the function given by TARGET, with the
1009 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1010 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1011 indicates what exceptions can be thrown. */
1014 make_call_declarator (cp_declarator
*target
,
1016 cp_cv_quals cv_qualifiers
,
1017 tree exception_specification
,
1018 tree late_return_type
)
1020 cp_declarator
*declarator
;
1022 declarator
= make_declarator (cdk_function
);
1023 declarator
->declarator
= target
;
1024 declarator
->u
.function
.parameters
= parms
;
1025 declarator
->u
.function
.qualifiers
= cv_qualifiers
;
1026 declarator
->u
.function
.exception_specification
= exception_specification
;
1027 declarator
->u
.function
.late_return_type
= late_return_type
;
1030 declarator
->parameter_pack_p
= target
->parameter_pack_p
;
1031 target
->parameter_pack_p
= false;
1034 declarator
->parameter_pack_p
= false;
1039 /* Make a declarator for an array of BOUNDS elements, each of which is
1040 defined by ELEMENT. */
1043 make_array_declarator (cp_declarator
*element
, tree bounds
)
1045 cp_declarator
*declarator
;
1047 declarator
= make_declarator (cdk_array
);
1048 declarator
->declarator
= element
;
1049 declarator
->u
.array
.bounds
= bounds
;
1052 declarator
->parameter_pack_p
= element
->parameter_pack_p
;
1053 element
->parameter_pack_p
= false;
1056 declarator
->parameter_pack_p
= false;
1061 /* Determine whether the declarator we've seen so far can be a
1062 parameter pack, when followed by an ellipsis. */
1064 declarator_can_be_parameter_pack (cp_declarator
*declarator
)
1066 /* Search for a declarator name, or any other declarator that goes
1067 after the point where the ellipsis could appear in a parameter
1068 pack. If we find any of these, then this declarator can not be
1069 made into a parameter pack. */
1071 while (declarator
&& !found
)
1073 switch ((int)declarator
->kind
)
1084 declarator
= declarator
->declarator
;
1092 cp_parameter_declarator
*no_parameters
;
1094 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1095 DECLARATOR and DEFAULT_ARGUMENT. */
1097 cp_parameter_declarator
*
1098 make_parameter_declarator (cp_decl_specifier_seq
*decl_specifiers
,
1099 cp_declarator
*declarator
,
1100 tree default_argument
)
1102 cp_parameter_declarator
*parameter
;
1104 parameter
= ((cp_parameter_declarator
*)
1105 alloc_declarator (sizeof (cp_parameter_declarator
)));
1106 parameter
->next
= NULL
;
1107 if (decl_specifiers
)
1108 parameter
->decl_specifiers
= *decl_specifiers
;
1110 clear_decl_specs (¶meter
->decl_specifiers
);
1111 parameter
->declarator
= declarator
;
1112 parameter
->default_argument
= default_argument
;
1113 parameter
->ellipsis_p
= false;
1118 /* Returns true iff DECLARATOR is a declaration for a function. */
1121 function_declarator_p (const cp_declarator
*declarator
)
1125 if (declarator
->kind
== cdk_function
1126 && declarator
->declarator
->kind
== cdk_id
)
1128 if (declarator
->kind
== cdk_id
1129 || declarator
->kind
== cdk_error
)
1131 declarator
= declarator
->declarator
;
1141 A cp_parser parses the token stream as specified by the C++
1142 grammar. Its job is purely parsing, not semantic analysis. For
1143 example, the parser breaks the token stream into declarators,
1144 expressions, statements, and other similar syntactic constructs.
1145 It does not check that the types of the expressions on either side
1146 of an assignment-statement are compatible, or that a function is
1147 not declared with a parameter of type `void'.
1149 The parser invokes routines elsewhere in the compiler to perform
1150 semantic analysis and to build up the abstract syntax tree for the
1153 The parser (and the template instantiation code, which is, in a
1154 way, a close relative of parsing) are the only parts of the
1155 compiler that should be calling push_scope and pop_scope, or
1156 related functions. The parser (and template instantiation code)
1157 keeps track of what scope is presently active; everything else
1158 should simply honor that. (The code that generates static
1159 initializers may also need to set the scope, in order to check
1160 access control correctly when emitting the initializers.)
1165 The parser is of the standard recursive-descent variety. Upcoming
1166 tokens in the token stream are examined in order to determine which
1167 production to use when parsing a non-terminal. Some C++ constructs
1168 require arbitrary look ahead to disambiguate. For example, it is
1169 impossible, in the general case, to tell whether a statement is an
1170 expression or declaration without scanning the entire statement.
1171 Therefore, the parser is capable of "parsing tentatively." When the
1172 parser is not sure what construct comes next, it enters this mode.
1173 Then, while we attempt to parse the construct, the parser queues up
1174 error messages, rather than issuing them immediately, and saves the
1175 tokens it consumes. If the construct is parsed successfully, the
1176 parser "commits", i.e., it issues any queued error messages and
1177 the tokens that were being preserved are permanently discarded.
1178 If, however, the construct is not parsed successfully, the parser
1179 rolls back its state completely so that it can resume parsing using
1180 a different alternative.
1185 The performance of the parser could probably be improved substantially.
1186 We could often eliminate the need to parse tentatively by looking ahead
1187 a little bit. In some places, this approach might not entirely eliminate
1188 the need to parse tentatively, but it might still speed up the average
1191 /* Flags that are passed to some parsing functions. These values can
1192 be bitwise-ored together. */
1194 typedef enum cp_parser_flags
1197 CP_PARSER_FLAGS_NONE
= 0x0,
1198 /* The construct is optional. If it is not present, then no error
1199 should be issued. */
1200 CP_PARSER_FLAGS_OPTIONAL
= 0x1,
1201 /* When parsing a type-specifier, do not allow user-defined types. */
1202 CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
= 0x2
1205 /* The different kinds of declarators we want to parse. */
1207 typedef enum cp_parser_declarator_kind
1209 /* We want an abstract declarator. */
1210 CP_PARSER_DECLARATOR_ABSTRACT
,
1211 /* We want a named declarator. */
1212 CP_PARSER_DECLARATOR_NAMED
,
1213 /* We don't mind, but the name must be an unqualified-id. */
1214 CP_PARSER_DECLARATOR_EITHER
1215 } cp_parser_declarator_kind
;
1217 /* The precedence values used to parse binary expressions. The minimum value
1218 of PREC must be 1, because zero is reserved to quickly discriminate
1219 binary operators from other tokens. */
1224 PREC_LOGICAL_OR_EXPRESSION
,
1225 PREC_LOGICAL_AND_EXPRESSION
,
1226 PREC_INCLUSIVE_OR_EXPRESSION
,
1227 PREC_EXCLUSIVE_OR_EXPRESSION
,
1228 PREC_AND_EXPRESSION
,
1229 PREC_EQUALITY_EXPRESSION
,
1230 PREC_RELATIONAL_EXPRESSION
,
1231 PREC_SHIFT_EXPRESSION
,
1232 PREC_ADDITIVE_EXPRESSION
,
1233 PREC_MULTIPLICATIVE_EXPRESSION
,
1235 NUM_PREC_VALUES
= PREC_PM_EXPRESSION
1238 /* A mapping from a token type to a corresponding tree node type, with a
1239 precedence value. */
1241 typedef struct cp_parser_binary_operations_map_node
1243 /* The token type. */
1244 enum cpp_ttype token_type
;
1245 /* The corresponding tree code. */
1246 enum tree_code tree_type
;
1247 /* The precedence of this operator. */
1248 enum cp_parser_prec prec
;
1249 } cp_parser_binary_operations_map_node
;
1251 /* The status of a tentative parse. */
1253 typedef enum cp_parser_status_kind
1255 /* No errors have occurred. */
1256 CP_PARSER_STATUS_KIND_NO_ERROR
,
1257 /* An error has occurred. */
1258 CP_PARSER_STATUS_KIND_ERROR
,
1259 /* We are committed to this tentative parse, whether or not an error
1261 CP_PARSER_STATUS_KIND_COMMITTED
1262 } cp_parser_status_kind
;
1264 typedef struct cp_parser_expression_stack_entry
1266 /* Left hand side of the binary operation we are currently
1269 /* Original tree code for left hand side, if it was a binary
1270 expression itself (used for -Wparentheses). */
1271 enum tree_code lhs_type
;
1272 /* Tree code for the binary operation we are parsing. */
1273 enum tree_code tree_type
;
1274 /* Precedence of the binary operation we are parsing. */
1276 } cp_parser_expression_stack_entry
;
1278 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1279 entries because precedence levels on the stack are monotonically
1281 typedef struct cp_parser_expression_stack_entry
1282 cp_parser_expression_stack
[NUM_PREC_VALUES
];
1284 /* Context that is saved and restored when parsing tentatively. */
1285 typedef struct cp_parser_context
GTY (())
1287 /* If this is a tentative parsing context, the status of the
1289 enum cp_parser_status_kind status
;
1290 /* If non-NULL, we have just seen a `x->' or `x.' expression. Names
1291 that are looked up in this context must be looked up both in the
1292 scope given by OBJECT_TYPE (the type of `x' or `*x') and also in
1293 the context of the containing expression. */
1296 /* The next parsing context in the stack. */
1297 struct cp_parser_context
*next
;
1298 } cp_parser_context
;
1302 /* Constructors and destructors. */
1304 static cp_parser_context
*cp_parser_context_new
1305 (cp_parser_context
*);
1307 /* Class variables. */
1309 static GTY((deletable
)) cp_parser_context
* cp_parser_context_free_list
;
1311 /* The operator-precedence table used by cp_parser_binary_expression.
1312 Transformed into an associative array (binops_by_token) by
1315 static const cp_parser_binary_operations_map_node binops
[] = {
1316 { CPP_DEREF_STAR
, MEMBER_REF
, PREC_PM_EXPRESSION
},
1317 { CPP_DOT_STAR
, DOTSTAR_EXPR
, PREC_PM_EXPRESSION
},
1319 { CPP_MULT
, MULT_EXPR
, PREC_MULTIPLICATIVE_EXPRESSION
},
1320 { CPP_DIV
, TRUNC_DIV_EXPR
, PREC_MULTIPLICATIVE_EXPRESSION
},
1321 { CPP_MOD
, TRUNC_MOD_EXPR
, PREC_MULTIPLICATIVE_EXPRESSION
},
1323 { CPP_PLUS
, PLUS_EXPR
, PREC_ADDITIVE_EXPRESSION
},
1324 { CPP_MINUS
, MINUS_EXPR
, PREC_ADDITIVE_EXPRESSION
},
1326 { CPP_LSHIFT
, LSHIFT_EXPR
, PREC_SHIFT_EXPRESSION
},
1327 { CPP_RSHIFT
, RSHIFT_EXPR
, PREC_SHIFT_EXPRESSION
},
1329 { CPP_LESS
, LT_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1330 { CPP_GREATER
, GT_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1331 { CPP_LESS_EQ
, LE_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1332 { CPP_GREATER_EQ
, GE_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1334 { CPP_EQ_EQ
, EQ_EXPR
, PREC_EQUALITY_EXPRESSION
},
1335 { CPP_NOT_EQ
, NE_EXPR
, PREC_EQUALITY_EXPRESSION
},
1337 { CPP_AND
, BIT_AND_EXPR
, PREC_AND_EXPRESSION
},
1339 { CPP_XOR
, BIT_XOR_EXPR
, PREC_EXCLUSIVE_OR_EXPRESSION
},
1341 { CPP_OR
, BIT_IOR_EXPR
, PREC_INCLUSIVE_OR_EXPRESSION
},
1343 { CPP_AND_AND
, TRUTH_ANDIF_EXPR
, PREC_LOGICAL_AND_EXPRESSION
},
1345 { CPP_OR_OR
, TRUTH_ORIF_EXPR
, PREC_LOGICAL_OR_EXPRESSION
}
1348 /* The same as binops, but initialized by cp_parser_new so that
1349 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1351 static cp_parser_binary_operations_map_node binops_by_token
[N_CP_TTYPES
];
1353 /* Constructors and destructors. */
1355 /* Construct a new context. The context below this one on the stack
1356 is given by NEXT. */
1358 static cp_parser_context
*
1359 cp_parser_context_new (cp_parser_context
* next
)
1361 cp_parser_context
*context
;
1363 /* Allocate the storage. */
1364 if (cp_parser_context_free_list
!= NULL
)
1366 /* Pull the first entry from the free list. */
1367 context
= cp_parser_context_free_list
;
1368 cp_parser_context_free_list
= context
->next
;
1369 memset (context
, 0, sizeof (*context
));
1372 context
= GGC_CNEW (cp_parser_context
);
1374 /* No errors have occurred yet in this context. */
1375 context
->status
= CP_PARSER_STATUS_KIND_NO_ERROR
;
1376 /* If this is not the bottommost context, copy information that we
1377 need from the previous context. */
1380 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1381 expression, then we are parsing one in this context, too. */
1382 context
->object_type
= next
->object_type
;
1383 /* Thread the stack. */
1384 context
->next
= next
;
1390 /* The cp_parser structure represents the C++ parser. */
1392 typedef struct cp_parser
GTY(())
1394 /* The lexer from which we are obtaining tokens. */
1397 /* The scope in which names should be looked up. If NULL_TREE, then
1398 we look up names in the scope that is currently open in the
1399 source program. If non-NULL, this is either a TYPE or
1400 NAMESPACE_DECL for the scope in which we should look. It can
1401 also be ERROR_MARK, when we've parsed a bogus scope.
1403 This value is not cleared automatically after a name is looked
1404 up, so we must be careful to clear it before starting a new look
1405 up sequence. (If it is not cleared, then `X::Y' followed by `Z'
1406 will look up `Z' in the scope of `X', rather than the current
1407 scope.) Unfortunately, it is difficult to tell when name lookup
1408 is complete, because we sometimes peek at a token, look it up,
1409 and then decide not to consume it. */
1412 /* OBJECT_SCOPE and QUALIFYING_SCOPE give the scopes in which the
1413 last lookup took place. OBJECT_SCOPE is used if an expression
1414 like "x->y" or "x.y" was used; it gives the type of "*x" or "x",
1415 respectively. QUALIFYING_SCOPE is used for an expression of the
1416 form "X::Y"; it refers to X. */
1418 tree qualifying_scope
;
1420 /* A stack of parsing contexts. All but the bottom entry on the
1421 stack will be tentative contexts.
1423 We parse tentatively in order to determine which construct is in
1424 use in some situations. For example, in order to determine
1425 whether a statement is an expression-statement or a
1426 declaration-statement we parse it tentatively as a
1427 declaration-statement. If that fails, we then reparse the same
1428 token stream as an expression-statement. */
1429 cp_parser_context
*context
;
1431 /* True if we are parsing GNU C++. If this flag is not set, then
1432 GNU extensions are not recognized. */
1433 bool allow_gnu_extensions_p
;
1435 /* TRUE if the `>' token should be interpreted as the greater-than
1436 operator. FALSE if it is the end of a template-id or
1437 template-parameter-list. In C++0x mode, this flag also applies to
1438 `>>' tokens, which are viewed as two consecutive `>' tokens when
1439 this flag is FALSE. */
1440 bool greater_than_is_operator_p
;
1442 /* TRUE if default arguments are allowed within a parameter list
1443 that starts at this point. FALSE if only a gnu extension makes
1444 them permissible. */
1445 bool default_arg_ok_p
;
1447 /* TRUE if we are parsing an integral constant-expression. See
1448 [expr.const] for a precise definition. */
1449 bool integral_constant_expression_p
;
1451 /* TRUE if we are parsing an integral constant-expression -- but a
1452 non-constant expression should be permitted as well. This flag
1453 is used when parsing an array bound so that GNU variable-length
1454 arrays are tolerated. */
1455 bool allow_non_integral_constant_expression_p
;
1457 /* TRUE if ALLOW_NON_CONSTANT_EXPRESSION_P is TRUE and something has
1458 been seen that makes the expression non-constant. */
1459 bool non_integral_constant_expression_p
;
1461 /* TRUE if local variable names and `this' are forbidden in the
1463 bool local_variables_forbidden_p
;
1465 /* TRUE if the declaration we are parsing is part of a
1466 linkage-specification of the form `extern string-literal
1468 bool in_unbraced_linkage_specification_p
;
1470 /* TRUE if we are presently parsing a declarator, after the
1471 direct-declarator. */
1472 bool in_declarator_p
;
1474 /* TRUE if we are presently parsing a template-argument-list. */
1475 bool in_template_argument_list_p
;
1477 /* Set to IN_ITERATION_STMT if parsing an iteration-statement,
1478 to IN_OMP_BLOCK if parsing OpenMP structured block and
1479 IN_OMP_FOR if parsing OpenMP loop. If parsing a switch statement,
1480 this is bitwise ORed with IN_SWITCH_STMT, unless parsing an
1481 iteration-statement, OpenMP block or loop within that switch. */
1482 #define IN_SWITCH_STMT 1
1483 #define IN_ITERATION_STMT 2
1484 #define IN_OMP_BLOCK 4
1485 #define IN_OMP_FOR 8
1486 #define IN_IF_STMT 16
1487 unsigned char in_statement
;
1489 /* TRUE if we are presently parsing the body of a switch statement.
1490 Note that this doesn't quite overlap with in_statement above.
1491 The difference relates to giving the right sets of error messages:
1492 "case not in switch" vs "break statement used with OpenMP...". */
1493 bool in_switch_statement_p
;
1495 /* TRUE if we are parsing a type-id in an expression context. In
1496 such a situation, both "type (expr)" and "type (type)" are valid
1498 bool in_type_id_in_expr_p
;
1500 /* TRUE if we are currently in a header file where declarations are
1501 implicitly extern "C". */
1502 bool implicit_extern_c
;
1504 /* TRUE if strings in expressions should be translated to the execution
1506 bool translate_strings_p
;
1508 /* TRUE if we are presently parsing the body of a function, but not
1510 bool in_function_body
;
1512 /* If non-NULL, then we are parsing a construct where new type
1513 definitions are not permitted. The string stored here will be
1514 issued as an error message if a type is defined. */
1515 const char *type_definition_forbidden_message
;
1517 /* A list of lists. The outer list is a stack, used for member
1518 functions of local classes. At each level there are two sub-list,
1519 one on TREE_VALUE and one on TREE_PURPOSE. Each of those
1520 sub-lists has a FUNCTION_DECL or TEMPLATE_DECL on their
1521 TREE_VALUE's. The functions are chained in reverse declaration
1524 The TREE_PURPOSE sublist contains those functions with default
1525 arguments that need post processing, and the TREE_VALUE sublist
1526 contains those functions with definitions that need post
1529 These lists can only be processed once the outermost class being
1530 defined is complete. */
1531 tree unparsed_functions_queues
;
1533 /* The number of classes whose definitions are currently in
1535 unsigned num_classes_being_defined
;
1537 /* The number of template parameter lists that apply directly to the
1538 current declaration. */
1539 unsigned num_template_parameter_lists
;
1544 /* Constructors and destructors. */
1546 static cp_parser
*cp_parser_new
1549 /* Routines to parse various constructs.
1551 Those that return `tree' will return the error_mark_node (rather
1552 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1553 Sometimes, they will return an ordinary node if error-recovery was
1554 attempted, even though a parse error occurred. So, to check
1555 whether or not a parse error occurred, you should always use
1556 cp_parser_error_occurred. If the construct is optional (indicated
1557 either by an `_opt' in the name of the function that does the
1558 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1559 the construct is not present. */
1561 /* Lexical conventions [gram.lex] */
1563 static tree cp_parser_identifier
1565 static tree cp_parser_string_literal
1566 (cp_parser
*, bool, bool);
1568 /* Basic concepts [gram.basic] */
1570 static bool cp_parser_translation_unit
1573 /* Expressions [gram.expr] */
1575 static tree cp_parser_primary_expression
1576 (cp_parser
*, bool, bool, bool, cp_id_kind
*);
1577 static tree cp_parser_id_expression
1578 (cp_parser
*, bool, bool, bool *, bool, bool);
1579 static tree cp_parser_unqualified_id
1580 (cp_parser
*, bool, bool, bool, bool);
1581 static tree cp_parser_nested_name_specifier_opt
1582 (cp_parser
*, bool, bool, bool, bool);
1583 static tree cp_parser_nested_name_specifier
1584 (cp_parser
*, bool, bool, bool, bool);
1585 static tree cp_parser_qualifying_entity
1586 (cp_parser
*, bool, bool, bool, bool, bool);
1587 static tree cp_parser_postfix_expression
1588 (cp_parser
*, bool, bool, bool, cp_id_kind
*);
1589 static tree cp_parser_postfix_open_square_expression
1590 (cp_parser
*, tree
, bool);
1591 static tree cp_parser_postfix_dot_deref_expression
1592 (cp_parser
*, enum cpp_ttype
, tree
, bool, cp_id_kind
*, location_t
);
1593 static tree cp_parser_parenthesized_expression_list
1594 (cp_parser
*, bool, bool, bool, bool *);
1595 static void cp_parser_pseudo_destructor_name
1596 (cp_parser
*, tree
*, tree
*);
1597 static tree cp_parser_unary_expression
1598 (cp_parser
*, bool, bool, cp_id_kind
*);
1599 static enum tree_code cp_parser_unary_operator
1601 static tree cp_parser_new_expression
1603 static tree cp_parser_new_placement
1605 static tree cp_parser_new_type_id
1606 (cp_parser
*, tree
*);
1607 static cp_declarator
*cp_parser_new_declarator_opt
1609 static cp_declarator
*cp_parser_direct_new_declarator
1611 static tree cp_parser_new_initializer
1613 static tree cp_parser_delete_expression
1615 static tree cp_parser_cast_expression
1616 (cp_parser
*, bool, bool, cp_id_kind
*);
1617 static tree cp_parser_binary_expression
1618 (cp_parser
*, bool, bool, enum cp_parser_prec
, cp_id_kind
*);
1619 static tree cp_parser_question_colon_clause
1620 (cp_parser
*, tree
);
1621 static tree cp_parser_assignment_expression
1622 (cp_parser
*, bool, cp_id_kind
*);
1623 static enum tree_code cp_parser_assignment_operator_opt
1625 static tree cp_parser_expression
1626 (cp_parser
*, bool, cp_id_kind
*);
1627 static tree cp_parser_constant_expression
1628 (cp_parser
*, bool, bool *);
1629 static tree cp_parser_builtin_offsetof
1632 /* Statements [gram.stmt.stmt] */
1634 static void cp_parser_statement
1635 (cp_parser
*, tree
, bool, bool *);
1636 static void cp_parser_label_for_labeled_statement
1638 static tree cp_parser_expression_statement
1639 (cp_parser
*, tree
);
1640 static tree cp_parser_compound_statement
1641 (cp_parser
*, tree
, bool);
1642 static void cp_parser_statement_seq_opt
1643 (cp_parser
*, tree
);
1644 static tree cp_parser_selection_statement
1645 (cp_parser
*, bool *);
1646 static tree cp_parser_condition
1648 static tree cp_parser_iteration_statement
1650 static void cp_parser_for_init_statement
1652 static tree cp_parser_jump_statement
1654 static void cp_parser_declaration_statement
1657 static tree cp_parser_implicitly_scoped_statement
1658 (cp_parser
*, bool *);
1659 static void cp_parser_already_scoped_statement
1662 /* Declarations [gram.dcl.dcl] */
1664 static void cp_parser_declaration_seq_opt
1666 static void cp_parser_declaration
1668 static void cp_parser_block_declaration
1669 (cp_parser
*, bool);
1670 static void cp_parser_simple_declaration
1671 (cp_parser
*, bool);
1672 static void cp_parser_decl_specifier_seq
1673 (cp_parser
*, cp_parser_flags
, cp_decl_specifier_seq
*, int *);
1674 static tree cp_parser_storage_class_specifier_opt
1676 static tree cp_parser_function_specifier_opt
1677 (cp_parser
*, cp_decl_specifier_seq
*);
1678 static tree cp_parser_type_specifier
1679 (cp_parser
*, cp_parser_flags
, cp_decl_specifier_seq
*, bool,
1681 static tree cp_parser_simple_type_specifier
1682 (cp_parser
*, cp_decl_specifier_seq
*, cp_parser_flags
);
1683 static tree cp_parser_type_name
1685 static tree cp_parser_nonclass_name
1686 (cp_parser
* parser
);
1687 static tree cp_parser_elaborated_type_specifier
1688 (cp_parser
*, bool, bool);
1689 static tree cp_parser_enum_specifier
1691 static void cp_parser_enumerator_list
1692 (cp_parser
*, tree
);
1693 static void cp_parser_enumerator_definition
1694 (cp_parser
*, tree
);
1695 static tree cp_parser_namespace_name
1697 static void cp_parser_namespace_definition
1699 static void cp_parser_namespace_body
1701 static tree cp_parser_qualified_namespace_specifier
1703 static void cp_parser_namespace_alias_definition
1705 static bool cp_parser_using_declaration
1706 (cp_parser
*, bool);
1707 static void cp_parser_using_directive
1709 static void cp_parser_asm_definition
1711 static void cp_parser_linkage_specification
1713 static void cp_parser_static_assert
1714 (cp_parser
*, bool);
1715 static tree cp_parser_decltype
1718 /* Declarators [gram.dcl.decl] */
1720 static tree cp_parser_init_declarator
1721 (cp_parser
*, cp_decl_specifier_seq
*, VEC (deferred_access_check
,gc
)*, bool, bool, int, bool *);
1722 static cp_declarator
*cp_parser_declarator
1723 (cp_parser
*, cp_parser_declarator_kind
, int *, bool *, bool);
1724 static cp_declarator
*cp_parser_direct_declarator
1725 (cp_parser
*, cp_parser_declarator_kind
, int *, bool);
1726 static enum tree_code cp_parser_ptr_operator
1727 (cp_parser
*, tree
*, cp_cv_quals
*);
1728 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
1730 static tree cp_parser_late_return_type_opt
1732 static tree cp_parser_declarator_id
1733 (cp_parser
*, bool);
1734 static tree cp_parser_type_id
1736 static tree cp_parser_template_type_arg
1738 static tree cp_parser_type_id_1
1739 (cp_parser
*, bool);
1740 static void cp_parser_type_specifier_seq
1741 (cp_parser
*, bool, cp_decl_specifier_seq
*);
1742 static tree cp_parser_parameter_declaration_clause
1744 static tree cp_parser_parameter_declaration_list
1745 (cp_parser
*, bool *);
1746 static cp_parameter_declarator
*cp_parser_parameter_declaration
1747 (cp_parser
*, bool, bool *);
1748 static tree cp_parser_default_argument
1749 (cp_parser
*, bool);
1750 static void cp_parser_function_body
1752 static tree cp_parser_initializer
1753 (cp_parser
*, bool *, bool *);
1754 static tree cp_parser_initializer_clause
1755 (cp_parser
*, bool *);
1756 static tree cp_parser_braced_list
1757 (cp_parser
*, bool*);
1758 static VEC(constructor_elt
,gc
) *cp_parser_initializer_list
1759 (cp_parser
*, bool *);
1761 static bool cp_parser_ctor_initializer_opt_and_function_body
1764 /* Classes [gram.class] */
1766 static tree cp_parser_class_name
1767 (cp_parser
*, bool, bool, enum tag_types
, bool, bool, bool);
1768 static tree cp_parser_class_specifier
1770 static tree cp_parser_class_head
1771 (cp_parser
*, bool *, tree
*, tree
*);
1772 static enum tag_types cp_parser_class_key
1774 static void cp_parser_member_specification_opt
1776 static void cp_parser_member_declaration
1778 static tree cp_parser_pure_specifier
1780 static tree cp_parser_constant_initializer
1783 /* Derived classes [gram.class.derived] */
1785 static tree cp_parser_base_clause
1787 static tree cp_parser_base_specifier
1790 /* Special member functions [gram.special] */
1792 static tree cp_parser_conversion_function_id
1794 static tree cp_parser_conversion_type_id
1796 static cp_declarator
*cp_parser_conversion_declarator_opt
1798 static bool cp_parser_ctor_initializer_opt
1800 static void cp_parser_mem_initializer_list
1802 static tree cp_parser_mem_initializer
1804 static tree cp_parser_mem_initializer_id
1807 /* Overloading [gram.over] */
1809 static tree cp_parser_operator_function_id
1811 static tree cp_parser_operator
1814 /* Templates [gram.temp] */
1816 static void cp_parser_template_declaration
1817 (cp_parser
*, bool);
1818 static tree cp_parser_template_parameter_list
1820 static tree cp_parser_template_parameter
1821 (cp_parser
*, bool *, bool *);
1822 static tree cp_parser_type_parameter
1823 (cp_parser
*, bool *);
1824 static tree cp_parser_template_id
1825 (cp_parser
*, bool, bool, bool);
1826 static tree cp_parser_template_name
1827 (cp_parser
*, bool, bool, bool, bool *);
1828 static tree cp_parser_template_argument_list
1830 static tree cp_parser_template_argument
1832 static void cp_parser_explicit_instantiation
1834 static void cp_parser_explicit_specialization
1837 /* Exception handling [gram.exception] */
1839 static tree cp_parser_try_block
1841 static bool cp_parser_function_try_block
1843 static void cp_parser_handler_seq
1845 static void cp_parser_handler
1847 static tree cp_parser_exception_declaration
1849 static tree cp_parser_throw_expression
1851 static tree cp_parser_exception_specification_opt
1853 static tree cp_parser_type_id_list
1856 /* GNU Extensions */
1858 static tree cp_parser_asm_specification_opt
1860 static tree cp_parser_asm_operand_list
1862 static tree cp_parser_asm_clobber_list
1864 static tree cp_parser_attributes_opt
1866 static tree cp_parser_attribute_list
1868 static bool cp_parser_extension_opt
1869 (cp_parser
*, int *);
1870 static void cp_parser_label_declaration
1873 enum pragma_context
{ pragma_external
, pragma_stmt
, pragma_compound
};
1874 static bool cp_parser_pragma
1875 (cp_parser
*, enum pragma_context
);
1877 /* Objective-C++ Productions */
1879 static tree cp_parser_objc_message_receiver
1881 static tree cp_parser_objc_message_args
1883 static tree cp_parser_objc_message_expression
1885 static tree cp_parser_objc_encode_expression
1887 static tree cp_parser_objc_defs_expression
1889 static tree cp_parser_objc_protocol_expression
1891 static tree cp_parser_objc_selector_expression
1893 static tree cp_parser_objc_expression
1895 static bool cp_parser_objc_selector_p
1897 static tree cp_parser_objc_selector
1899 static tree cp_parser_objc_protocol_refs_opt
1901 static void cp_parser_objc_declaration
1903 static tree cp_parser_objc_statement
1906 /* Utility Routines */
1908 static tree cp_parser_lookup_name
1909 (cp_parser
*, tree
, enum tag_types
, bool, bool, bool, tree
*, location_t
);
1910 static tree cp_parser_lookup_name_simple
1911 (cp_parser
*, tree
, location_t
);
1912 static tree cp_parser_maybe_treat_template_as_class
1914 static bool cp_parser_check_declarator_template_parameters
1915 (cp_parser
*, cp_declarator
*, location_t
);
1916 static bool cp_parser_check_template_parameters
1917 (cp_parser
*, unsigned, location_t
, cp_declarator
*);
1918 static tree cp_parser_simple_cast_expression
1920 static tree cp_parser_global_scope_opt
1921 (cp_parser
*, bool);
1922 static bool cp_parser_constructor_declarator_p
1923 (cp_parser
*, bool);
1924 static tree cp_parser_function_definition_from_specifiers_and_declarator
1925 (cp_parser
*, cp_decl_specifier_seq
*, tree
, const cp_declarator
*);
1926 static tree cp_parser_function_definition_after_declarator
1927 (cp_parser
*, bool);
1928 static void cp_parser_template_declaration_after_export
1929 (cp_parser
*, bool);
1930 static void cp_parser_perform_template_parameter_access_checks
1931 (VEC (deferred_access_check
,gc
)*);
1932 static tree cp_parser_single_declaration
1933 (cp_parser
*, VEC (deferred_access_check
,gc
)*, bool, bool, bool *);
1934 static tree cp_parser_functional_cast
1935 (cp_parser
*, tree
);
1936 static tree cp_parser_save_member_function_body
1937 (cp_parser
*, cp_decl_specifier_seq
*, cp_declarator
*, tree
);
1938 static tree cp_parser_enclosed_template_argument_list
1940 static void cp_parser_save_default_args
1941 (cp_parser
*, tree
);
1942 static void cp_parser_late_parsing_for_member
1943 (cp_parser
*, tree
);
1944 static void cp_parser_late_parsing_default_args
1945 (cp_parser
*, tree
);
1946 static tree cp_parser_sizeof_operand
1947 (cp_parser
*, enum rid
);
1948 static tree cp_parser_trait_expr
1949 (cp_parser
*, enum rid
);
1950 static bool cp_parser_declares_only_class_p
1952 static void cp_parser_set_storage_class
1953 (cp_parser
*, cp_decl_specifier_seq
*, enum rid
, location_t
);
1954 static void cp_parser_set_decl_spec_type
1955 (cp_decl_specifier_seq
*, tree
, location_t
, bool);
1956 static bool cp_parser_friend_p
1957 (const cp_decl_specifier_seq
*);
1958 static cp_token
*cp_parser_require
1959 (cp_parser
*, enum cpp_ttype
, const char *);
1960 static cp_token
*cp_parser_require_keyword
1961 (cp_parser
*, enum rid
, const char *);
1962 static bool cp_parser_token_starts_function_definition_p
1964 static bool cp_parser_next_token_starts_class_definition_p
1966 static bool cp_parser_next_token_ends_template_argument_p
1968 static bool cp_parser_nth_token_starts_template_argument_list_p
1969 (cp_parser
*, size_t);
1970 static enum tag_types cp_parser_token_is_class_key
1972 static void cp_parser_check_class_key
1973 (enum tag_types
, tree type
);
1974 static void cp_parser_check_access_in_redeclaration
1975 (tree type
, location_t location
);
1976 static bool cp_parser_optional_template_keyword
1978 static void cp_parser_pre_parsed_nested_name_specifier
1980 static bool cp_parser_cache_group
1981 (cp_parser
*, enum cpp_ttype
, unsigned);
1982 static void cp_parser_parse_tentatively
1984 static void cp_parser_commit_to_tentative_parse
1986 static void cp_parser_abort_tentative_parse
1988 static bool cp_parser_parse_definitely
1990 static inline bool cp_parser_parsing_tentatively
1992 static bool cp_parser_uncommitted_to_tentative_parse_p
1994 static void cp_parser_error
1995 (cp_parser
*, const char *);
1996 static void cp_parser_name_lookup_error
1997 (cp_parser
*, tree
, tree
, const char *, location_t
);
1998 static bool cp_parser_simulate_error
2000 static bool cp_parser_check_type_definition
2002 static void cp_parser_check_for_definition_in_return_type
2003 (cp_declarator
*, tree
, location_t type_location
);
2004 static void cp_parser_check_for_invalid_template_id
2005 (cp_parser
*, tree
, location_t location
);
2006 static bool cp_parser_non_integral_constant_expression
2007 (cp_parser
*, const char *);
2008 static void cp_parser_diagnose_invalid_type_name
2009 (cp_parser
*, tree
, tree
, location_t
);
2010 static bool cp_parser_parse_and_diagnose_invalid_type_name
2012 static int cp_parser_skip_to_closing_parenthesis
2013 (cp_parser
*, bool, bool, bool);
2014 static void cp_parser_skip_to_end_of_statement
2016 static void cp_parser_consume_semicolon_at_end_of_statement
2018 static void cp_parser_skip_to_end_of_block_or_statement
2020 static bool cp_parser_skip_to_closing_brace
2022 static void cp_parser_skip_to_end_of_template_parameter_list
2024 static void cp_parser_skip_to_pragma_eol
2025 (cp_parser
*, cp_token
*);
2026 static bool cp_parser_error_occurred
2028 static bool cp_parser_allow_gnu_extensions_p
2030 static bool cp_parser_is_string_literal
2032 static bool cp_parser_is_keyword
2033 (cp_token
*, enum rid
);
2034 static tree cp_parser_make_typename_type
2035 (cp_parser
*, tree
, tree
, location_t location
);
2036 static cp_declarator
* cp_parser_make_indirect_declarator
2037 (enum tree_code
, tree
, cp_cv_quals
, cp_declarator
*);
2039 /* Returns nonzero if we are parsing tentatively. */
2042 cp_parser_parsing_tentatively (cp_parser
* parser
)
2044 return parser
->context
->next
!= NULL
;
2047 /* Returns nonzero if TOKEN is a string literal. */
2050 cp_parser_is_string_literal (cp_token
* token
)
2052 return (token
->type
== CPP_STRING
||
2053 token
->type
== CPP_STRING16
||
2054 token
->type
== CPP_STRING32
||
2055 token
->type
== CPP_WSTRING
);
2058 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2061 cp_parser_is_keyword (cp_token
* token
, enum rid keyword
)
2063 return token
->keyword
== keyword
;
2066 /* If not parsing tentatively, issue a diagnostic of the form
2067 FILE:LINE: MESSAGE before TOKEN
2068 where TOKEN is the next token in the input stream. MESSAGE
2069 (specified by the caller) is usually of the form "expected
2073 cp_parser_error (cp_parser
* parser
, const char* message
)
2075 if (!cp_parser_simulate_error (parser
))
2077 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
2078 /* This diagnostic makes more sense if it is tagged to the line
2079 of the token we just peeked at. */
2080 cp_lexer_set_source_position_from_token (token
);
2082 if (token
->type
== CPP_PRAGMA
)
2084 error ("%H%<#pragma%> is not allowed here", &token
->location
);
2085 cp_parser_skip_to_pragma_eol (parser
, token
);
2089 c_parse_error (message
,
2090 /* Because c_parser_error does not understand
2091 CPP_KEYWORD, keywords are treated like
2093 (token
->type
== CPP_KEYWORD
? CPP_NAME
: token
->type
),
2098 /* Issue an error about name-lookup failing. NAME is the
2099 IDENTIFIER_NODE DECL is the result of
2100 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2101 the thing that we hoped to find. */
2104 cp_parser_name_lookup_error (cp_parser
* parser
,
2107 const char* desired
,
2108 location_t location
)
2110 /* If name lookup completely failed, tell the user that NAME was not
2112 if (decl
== error_mark_node
)
2114 if (parser
->scope
&& parser
->scope
!= global_namespace
)
2115 error ("%H%<%E::%E%> has not been declared",
2116 &location
, parser
->scope
, name
);
2117 else if (parser
->scope
== global_namespace
)
2118 error ("%H%<::%E%> has not been declared", &location
, name
);
2119 else if (parser
->object_scope
2120 && !CLASS_TYPE_P (parser
->object_scope
))
2121 error ("%Hrequest for member %qE in non-class type %qT",
2122 &location
, name
, parser
->object_scope
);
2123 else if (parser
->object_scope
)
2124 error ("%H%<%T::%E%> has not been declared",
2125 &location
, parser
->object_scope
, name
);
2127 error ("%H%qE has not been declared", &location
, name
);
2129 else if (parser
->scope
&& parser
->scope
!= global_namespace
)
2130 error ("%H%<%E::%E%> %s", &location
, parser
->scope
, name
, desired
);
2131 else if (parser
->scope
== global_namespace
)
2132 error ("%H%<::%E%> %s", &location
, name
, desired
);
2134 error ("%H%qE %s", &location
, name
, desired
);
2137 /* If we are parsing tentatively, remember that an error has occurred
2138 during this tentative parse. Returns true if the error was
2139 simulated; false if a message should be issued by the caller. */
2142 cp_parser_simulate_error (cp_parser
* parser
)
2144 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
2146 parser
->context
->status
= CP_PARSER_STATUS_KIND_ERROR
;
2152 /* Check for repeated decl-specifiers. */
2155 cp_parser_check_decl_spec (cp_decl_specifier_seq
*decl_specs
,
2156 location_t location
)
2160 for (ds
= ds_first
; ds
!= ds_last
; ++ds
)
2162 unsigned count
= decl_specs
->specs
[(int)ds
];
2165 /* The "long" specifier is a special case because of "long long". */
2169 error ("%H%<long long long%> is too long for GCC", &location
);
2170 else if (pedantic
&& !in_system_header
&& warn_long_long
2171 && cxx_dialect
== cxx98
)
2172 pedwarn (location
, OPT_Wlong_long
,
2173 "ISO C++ 1998 does not support %<long long%>");
2177 static const char *const decl_spec_names
[] = {
2193 error ("%Hduplicate %qs", &location
, decl_spec_names
[(int)ds
]);
2198 /* This function is called when a type is defined. If type
2199 definitions are forbidden at this point, an error message is
2203 cp_parser_check_type_definition (cp_parser
* parser
)
2205 /* If types are forbidden here, issue a message. */
2206 if (parser
->type_definition_forbidden_message
)
2208 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2209 in the message need to be interpreted. */
2210 error (parser
->type_definition_forbidden_message
);
2216 /* This function is called when the DECLARATOR is processed. The TYPE
2217 was a type defined in the decl-specifiers. If it is invalid to
2218 define a type in the decl-specifiers for DECLARATOR, an error is
2219 issued. TYPE_LOCATION is the location of TYPE and is used
2220 for error reporting. */
2223 cp_parser_check_for_definition_in_return_type (cp_declarator
*declarator
,
2224 tree type
, location_t type_location
)
2226 /* [dcl.fct] forbids type definitions in return types.
2227 Unfortunately, it's not easy to know whether or not we are
2228 processing a return type until after the fact. */
2230 && (declarator
->kind
== cdk_pointer
2231 || declarator
->kind
== cdk_reference
2232 || declarator
->kind
== cdk_ptrmem
))
2233 declarator
= declarator
->declarator
;
2235 && declarator
->kind
== cdk_function
)
2237 error ("%Hnew types may not be defined in a return type", &type_location
);
2238 inform (type_location
,
2239 "(perhaps a semicolon is missing after the definition of %qT)",
2244 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2245 "<" in any valid C++ program. If the next token is indeed "<",
2246 issue a message warning the user about what appears to be an
2247 invalid attempt to form a template-id. LOCATION is the location
2248 of the type-specifier (TYPE) */
2251 cp_parser_check_for_invalid_template_id (cp_parser
* parser
,
2252 tree type
, location_t location
)
2254 cp_token_position start
= 0;
2256 if (cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
2259 error ("%H%qT is not a template", &location
, type
);
2260 else if (TREE_CODE (type
) == IDENTIFIER_NODE
)
2261 error ("%H%qE is not a template", &location
, type
);
2263 error ("%Hinvalid template-id", &location
);
2264 /* Remember the location of the invalid "<". */
2265 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
2266 start
= cp_lexer_token_position (parser
->lexer
, true);
2267 /* Consume the "<". */
2268 cp_lexer_consume_token (parser
->lexer
);
2269 /* Parse the template arguments. */
2270 cp_parser_enclosed_template_argument_list (parser
);
2271 /* Permanently remove the invalid template arguments so that
2272 this error message is not issued again. */
2274 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
2278 /* If parsing an integral constant-expression, issue an error message
2279 about the fact that THING appeared and return true. Otherwise,
2280 return false. In either case, set
2281 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2284 cp_parser_non_integral_constant_expression (cp_parser
*parser
,
2287 parser
->non_integral_constant_expression_p
= true;
2288 if (parser
->integral_constant_expression_p
)
2290 if (!parser
->allow_non_integral_constant_expression_p
)
2292 /* Don't use `%s' to print THING, because quotations (`%<', `%>')
2293 in the message need to be interpreted. */
2294 char *message
= concat (thing
,
2295 " cannot appear in a constant-expression",
2305 /* Emit a diagnostic for an invalid type name. SCOPE is the
2306 qualifying scope (or NULL, if none) for ID. This function commits
2307 to the current active tentative parse, if any. (Otherwise, the
2308 problematic construct might be encountered again later, resulting
2309 in duplicate error messages.) LOCATION is the location of ID. */
2312 cp_parser_diagnose_invalid_type_name (cp_parser
*parser
,
2313 tree scope
, tree id
,
2314 location_t location
)
2316 tree decl
, old_scope
;
2317 /* Try to lookup the identifier. */
2318 old_scope
= parser
->scope
;
2319 parser
->scope
= scope
;
2320 decl
= cp_parser_lookup_name_simple (parser
, id
, location
);
2321 parser
->scope
= old_scope
;
2322 /* If the lookup found a template-name, it means that the user forgot
2323 to specify an argument list. Emit a useful error message. */
2324 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2325 error ("%Hinvalid use of template-name %qE without an argument list",
2327 else if (TREE_CODE (id
) == BIT_NOT_EXPR
)
2328 error ("%Hinvalid use of destructor %qD as a type", &location
, id
);
2329 else if (TREE_CODE (decl
) == TYPE_DECL
)
2330 /* Something like 'unsigned A a;' */
2331 error ("%Hinvalid combination of multiple type-specifiers",
2333 else if (!parser
->scope
)
2335 /* Issue an error message. */
2336 error ("%H%qE does not name a type", &location
, id
);
2337 /* If we're in a template class, it's possible that the user was
2338 referring to a type from a base class. For example:
2340 template <typename T> struct A { typedef T X; };
2341 template <typename T> struct B : public A<T> { X x; };
2343 The user should have said "typename A<T>::X". */
2344 if (processing_template_decl
&& current_class_type
2345 && TYPE_BINFO (current_class_type
))
2349 for (b
= TREE_CHAIN (TYPE_BINFO (current_class_type
));
2353 tree base_type
= BINFO_TYPE (b
);
2354 if (CLASS_TYPE_P (base_type
)
2355 && dependent_type_p (base_type
))
2358 /* Go from a particular instantiation of the
2359 template (which will have an empty TYPE_FIELDs),
2360 to the main version. */
2361 base_type
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (base_type
);
2362 for (field
= TYPE_FIELDS (base_type
);
2364 field
= TREE_CHAIN (field
))
2365 if (TREE_CODE (field
) == TYPE_DECL
2366 && DECL_NAME (field
) == id
)
2369 "(perhaps %<typename %T::%E%> was intended)",
2370 BINFO_TYPE (b
), id
);
2379 /* Here we diagnose qualified-ids where the scope is actually correct,
2380 but the identifier does not resolve to a valid type name. */
2381 else if (parser
->scope
!= error_mark_node
)
2383 if (TREE_CODE (parser
->scope
) == NAMESPACE_DECL
)
2384 error ("%H%qE in namespace %qE does not name a type",
2385 &location
, id
, parser
->scope
);
2386 else if (TYPE_P (parser
->scope
))
2387 error ("%H%qE in class %qT does not name a type",
2388 &location
, id
, parser
->scope
);
2392 cp_parser_commit_to_tentative_parse (parser
);
2395 /* Check for a common situation where a type-name should be present,
2396 but is not, and issue a sensible error message. Returns true if an
2397 invalid type-name was detected.
2399 The situation handled by this function are variable declarations of the
2400 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2401 Usually, `ID' should name a type, but if we got here it means that it
2402 does not. We try to emit the best possible error message depending on
2403 how exactly the id-expression looks like. */
2406 cp_parser_parse_and_diagnose_invalid_type_name (cp_parser
*parser
)
2409 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
2411 cp_parser_parse_tentatively (parser
);
2412 id
= cp_parser_id_expression (parser
,
2413 /*template_keyword_p=*/false,
2414 /*check_dependency_p=*/true,
2415 /*template_p=*/NULL
,
2416 /*declarator_p=*/true,
2417 /*optional_p=*/false);
2418 /* After the id-expression, there should be a plain identifier,
2419 otherwise this is not a simple variable declaration. Also, if
2420 the scope is dependent, we cannot do much. */
2421 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
)
2422 || (parser
->scope
&& TYPE_P (parser
->scope
)
2423 && dependent_type_p (parser
->scope
))
2424 || TREE_CODE (id
) == TYPE_DECL
)
2426 cp_parser_abort_tentative_parse (parser
);
2429 if (!cp_parser_parse_definitely (parser
))
2432 /* Emit a diagnostic for the invalid type. */
2433 cp_parser_diagnose_invalid_type_name (parser
, parser
->scope
,
2434 id
, token
->location
);
2435 /* Skip to the end of the declaration; there's no point in
2436 trying to process it. */
2437 cp_parser_skip_to_end_of_block_or_statement (parser
);
2441 /* Consume tokens up to, and including, the next non-nested closing `)'.
2442 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2443 are doing error recovery. Returns -1 if OR_COMMA is true and we
2444 found an unnested comma. */
2447 cp_parser_skip_to_closing_parenthesis (cp_parser
*parser
,
2452 unsigned paren_depth
= 0;
2453 unsigned brace_depth
= 0;
2455 if (recovering
&& !or_comma
2456 && cp_parser_uncommitted_to_tentative_parse_p (parser
))
2461 cp_token
* token
= cp_lexer_peek_token (parser
->lexer
);
2463 switch (token
->type
)
2466 case CPP_PRAGMA_EOL
:
2467 /* If we've run out of tokens, then there is no closing `)'. */
2471 /* This matches the processing in skip_to_end_of_statement. */
2476 case CPP_OPEN_BRACE
:
2479 case CPP_CLOSE_BRACE
:
2485 if (recovering
&& or_comma
&& !brace_depth
&& !paren_depth
)
2489 case CPP_OPEN_PAREN
:
2494 case CPP_CLOSE_PAREN
:
2495 if (!brace_depth
&& !paren_depth
--)
2498 cp_lexer_consume_token (parser
->lexer
);
2507 /* Consume the token. */
2508 cp_lexer_consume_token (parser
->lexer
);
2512 /* Consume tokens until we reach the end of the current statement.
2513 Normally, that will be just before consuming a `;'. However, if a
2514 non-nested `}' comes first, then we stop before consuming that. */
2517 cp_parser_skip_to_end_of_statement (cp_parser
* parser
)
2519 unsigned nesting_depth
= 0;
2523 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
2525 switch (token
->type
)
2528 case CPP_PRAGMA_EOL
:
2529 /* If we've run out of tokens, stop. */
2533 /* If the next token is a `;', we have reached the end of the
2539 case CPP_CLOSE_BRACE
:
2540 /* If this is a non-nested '}', stop before consuming it.
2541 That way, when confronted with something like:
2545 we stop before consuming the closing '}', even though we
2546 have not yet reached a `;'. */
2547 if (nesting_depth
== 0)
2550 /* If it is the closing '}' for a block that we have
2551 scanned, stop -- but only after consuming the token.
2557 we will stop after the body of the erroneously declared
2558 function, but before consuming the following `typedef'
2560 if (--nesting_depth
== 0)
2562 cp_lexer_consume_token (parser
->lexer
);
2566 case CPP_OPEN_BRACE
:
2574 /* Consume the token. */
2575 cp_lexer_consume_token (parser
->lexer
);
2579 /* This function is called at the end of a statement or declaration.
2580 If the next token is a semicolon, it is consumed; otherwise, error
2581 recovery is attempted. */
2584 cp_parser_consume_semicolon_at_end_of_statement (cp_parser
*parser
)
2586 /* Look for the trailing `;'. */
2587 if (!cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>"))
2589 /* If there is additional (erroneous) input, skip to the end of
2591 cp_parser_skip_to_end_of_statement (parser
);
2592 /* If the next token is now a `;', consume it. */
2593 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
2594 cp_lexer_consume_token (parser
->lexer
);
2598 /* Skip tokens until we have consumed an entire block, or until we
2599 have consumed a non-nested `;'. */
2602 cp_parser_skip_to_end_of_block_or_statement (cp_parser
* parser
)
2604 int nesting_depth
= 0;
2606 while (nesting_depth
>= 0)
2608 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
2610 switch (token
->type
)
2613 case CPP_PRAGMA_EOL
:
2614 /* If we've run out of tokens, stop. */
2618 /* Stop if this is an unnested ';'. */
2623 case CPP_CLOSE_BRACE
:
2624 /* Stop if this is an unnested '}', or closes the outermost
2627 if (nesting_depth
< 0)
2633 case CPP_OPEN_BRACE
:
2642 /* Consume the token. */
2643 cp_lexer_consume_token (parser
->lexer
);
2647 /* Skip tokens until a non-nested closing curly brace is the next
2648 token, or there are no more tokens. Return true in the first case,
2652 cp_parser_skip_to_closing_brace (cp_parser
*parser
)
2654 unsigned nesting_depth
= 0;
2658 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
2660 switch (token
->type
)
2663 case CPP_PRAGMA_EOL
:
2664 /* If we've run out of tokens, stop. */
2667 case CPP_CLOSE_BRACE
:
2668 /* If the next token is a non-nested `}', then we have reached
2669 the end of the current block. */
2670 if (nesting_depth
-- == 0)
2674 case CPP_OPEN_BRACE
:
2675 /* If it the next token is a `{', then we are entering a new
2676 block. Consume the entire block. */
2684 /* Consume the token. */
2685 cp_lexer_consume_token (parser
->lexer
);
2689 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
2690 parameter is the PRAGMA token, allowing us to purge the entire pragma
2694 cp_parser_skip_to_pragma_eol (cp_parser
* parser
, cp_token
*pragma_tok
)
2698 parser
->lexer
->in_pragma
= false;
2701 token
= cp_lexer_consume_token (parser
->lexer
);
2702 while (token
->type
!= CPP_PRAGMA_EOL
&& token
->type
!= CPP_EOF
);
2704 /* Ensure that the pragma is not parsed again. */
2705 cp_lexer_purge_tokens_after (parser
->lexer
, pragma_tok
);
2708 /* Require pragma end of line, resyncing with it as necessary. The
2709 arguments are as for cp_parser_skip_to_pragma_eol. */
2712 cp_parser_require_pragma_eol (cp_parser
*parser
, cp_token
*pragma_tok
)
2714 parser
->lexer
->in_pragma
= false;
2715 if (!cp_parser_require (parser
, CPP_PRAGMA_EOL
, "end of line"))
2716 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
2719 /* This is a simple wrapper around make_typename_type. When the id is
2720 an unresolved identifier node, we can provide a superior diagnostic
2721 using cp_parser_diagnose_invalid_type_name. */
2724 cp_parser_make_typename_type (cp_parser
*parser
, tree scope
,
2725 tree id
, location_t id_location
)
2728 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
2730 result
= make_typename_type (scope
, id
, typename_type
,
2731 /*complain=*/tf_none
);
2732 if (result
== error_mark_node
)
2733 cp_parser_diagnose_invalid_type_name (parser
, scope
, id
, id_location
);
2736 return make_typename_type (scope
, id
, typename_type
, tf_error
);
2739 /* This is a wrapper around the
2740 make_{pointer,ptrmem,reference}_declarator functions that decides
2741 which one to call based on the CODE and CLASS_TYPE arguments. The
2742 CODE argument should be one of the values returned by
2743 cp_parser_ptr_operator. */
2744 static cp_declarator
*
2745 cp_parser_make_indirect_declarator (enum tree_code code
, tree class_type
,
2746 cp_cv_quals cv_qualifiers
,
2747 cp_declarator
*target
)
2749 if (code
== ERROR_MARK
)
2750 return cp_error_declarator
;
2752 if (code
== INDIRECT_REF
)
2753 if (class_type
== NULL_TREE
)
2754 return make_pointer_declarator (cv_qualifiers
, target
);
2756 return make_ptrmem_declarator (cv_qualifiers
, class_type
, target
);
2757 else if (code
== ADDR_EXPR
&& class_type
== NULL_TREE
)
2758 return make_reference_declarator (cv_qualifiers
, target
, false);
2759 else if (code
== NON_LVALUE_EXPR
&& class_type
== NULL_TREE
)
2760 return make_reference_declarator (cv_qualifiers
, target
, true);
2764 /* Create a new C++ parser. */
2767 cp_parser_new (void)
2773 /* cp_lexer_new_main is called before calling ggc_alloc because
2774 cp_lexer_new_main might load a PCH file. */
2775 lexer
= cp_lexer_new_main ();
2777 /* Initialize the binops_by_token so that we can get the tree
2778 directly from the token. */
2779 for (i
= 0; i
< sizeof (binops
) / sizeof (binops
[0]); i
++)
2780 binops_by_token
[binops
[i
].token_type
] = binops
[i
];
2782 parser
= GGC_CNEW (cp_parser
);
2783 parser
->lexer
= lexer
;
2784 parser
->context
= cp_parser_context_new (NULL
);
2786 /* For now, we always accept GNU extensions. */
2787 parser
->allow_gnu_extensions_p
= 1;
2789 /* The `>' token is a greater-than operator, not the end of a
2791 parser
->greater_than_is_operator_p
= true;
2793 parser
->default_arg_ok_p
= true;
2795 /* We are not parsing a constant-expression. */
2796 parser
->integral_constant_expression_p
= false;
2797 parser
->allow_non_integral_constant_expression_p
= false;
2798 parser
->non_integral_constant_expression_p
= false;
2800 /* Local variable names are not forbidden. */
2801 parser
->local_variables_forbidden_p
= false;
2803 /* We are not processing an `extern "C"' declaration. */
2804 parser
->in_unbraced_linkage_specification_p
= false;
2806 /* We are not processing a declarator. */
2807 parser
->in_declarator_p
= false;
2809 /* We are not processing a template-argument-list. */
2810 parser
->in_template_argument_list_p
= false;
2812 /* We are not in an iteration statement. */
2813 parser
->in_statement
= 0;
2815 /* We are not in a switch statement. */
2816 parser
->in_switch_statement_p
= false;
2818 /* We are not parsing a type-id inside an expression. */
2819 parser
->in_type_id_in_expr_p
= false;
2821 /* Declarations aren't implicitly extern "C". */
2822 parser
->implicit_extern_c
= false;
2824 /* String literals should be translated to the execution character set. */
2825 parser
->translate_strings_p
= true;
2827 /* We are not parsing a function body. */
2828 parser
->in_function_body
= false;
2830 /* The unparsed function queue is empty. */
2831 parser
->unparsed_functions_queues
= build_tree_list (NULL_TREE
, NULL_TREE
);
2833 /* There are no classes being defined. */
2834 parser
->num_classes_being_defined
= 0;
2836 /* No template parameters apply. */
2837 parser
->num_template_parameter_lists
= 0;
2842 /* Create a cp_lexer structure which will emit the tokens in CACHE
2843 and push it onto the parser's lexer stack. This is used for delayed
2844 parsing of in-class method bodies and default arguments, and should
2845 not be confused with tentative parsing. */
2847 cp_parser_push_lexer_for_tokens (cp_parser
*parser
, cp_token_cache
*cache
)
2849 cp_lexer
*lexer
= cp_lexer_new_from_tokens (cache
);
2850 lexer
->next
= parser
->lexer
;
2851 parser
->lexer
= lexer
;
2853 /* Move the current source position to that of the first token in the
2855 cp_lexer_set_source_position_from_token (lexer
->next_token
);
2858 /* Pop the top lexer off the parser stack. This is never used for the
2859 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
2861 cp_parser_pop_lexer (cp_parser
*parser
)
2863 cp_lexer
*lexer
= parser
->lexer
;
2864 parser
->lexer
= lexer
->next
;
2865 cp_lexer_destroy (lexer
);
2867 /* Put the current source position back where it was before this
2868 lexer was pushed. */
2869 cp_lexer_set_source_position_from_token (parser
->lexer
->next_token
);
2872 /* Lexical conventions [gram.lex] */
2874 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
2878 cp_parser_identifier (cp_parser
* parser
)
2882 /* Look for the identifier. */
2883 token
= cp_parser_require (parser
, CPP_NAME
, "identifier");
2884 /* Return the value. */
2885 return token
? token
->u
.value
: error_mark_node
;
2888 /* Parse a sequence of adjacent string constants. Returns a
2889 TREE_STRING representing the combined, nul-terminated string
2890 constant. If TRANSLATE is true, translate the string to the
2891 execution character set. If WIDE_OK is true, a wide string is
2894 C++98 [lex.string] says that if a narrow string literal token is
2895 adjacent to a wide string literal token, the behavior is undefined.
2896 However, C99 6.4.5p4 says that this results in a wide string literal.
2897 We follow C99 here, for consistency with the C front end.
2899 This code is largely lifted from lex_string() in c-lex.c.
2901 FUTURE: ObjC++ will need to handle @-strings here. */
2903 cp_parser_string_literal (cp_parser
*parser
, bool translate
, bool wide_ok
)
2907 struct obstack str_ob
;
2908 cpp_string str
, istr
, *strs
;
2910 enum cpp_ttype type
;
2912 tok
= cp_lexer_peek_token (parser
->lexer
);
2913 if (!cp_parser_is_string_literal (tok
))
2915 cp_parser_error (parser
, "expected string-literal");
2916 return error_mark_node
;
2921 /* Try to avoid the overhead of creating and destroying an obstack
2922 for the common case of just one string. */
2923 if (!cp_parser_is_string_literal
2924 (cp_lexer_peek_nth_token (parser
->lexer
, 2)))
2926 cp_lexer_consume_token (parser
->lexer
);
2928 str
.text
= (const unsigned char *)TREE_STRING_POINTER (tok
->u
.value
);
2929 str
.len
= TREE_STRING_LENGTH (tok
->u
.value
);
2936 gcc_obstack_init (&str_ob
);
2941 cp_lexer_consume_token (parser
->lexer
);
2943 str
.text
= (const unsigned char *)TREE_STRING_POINTER (tok
->u
.value
);
2944 str
.len
= TREE_STRING_LENGTH (tok
->u
.value
);
2946 if (type
!= tok
->type
)
2948 if (type
== CPP_STRING
)
2950 else if (tok
->type
!= CPP_STRING
)
2951 error ("%Hunsupported non-standard concatenation "
2952 "of string literals", &tok
->location
);
2955 obstack_grow (&str_ob
, &str
, sizeof (cpp_string
));
2957 tok
= cp_lexer_peek_token (parser
->lexer
);
2959 while (cp_parser_is_string_literal (tok
));
2961 strs
= (cpp_string
*) obstack_finish (&str_ob
);
2964 if (type
!= CPP_STRING
&& !wide_ok
)
2966 cp_parser_error (parser
, "a wide string is invalid in this context");
2970 if ((translate
? cpp_interpret_string
: cpp_interpret_string_notranslate
)
2971 (parse_in
, strs
, count
, &istr
, type
))
2973 value
= build_string (istr
.len
, (const char *)istr
.text
);
2974 free (CONST_CAST (unsigned char *, istr
.text
));
2980 TREE_TYPE (value
) = char_array_type_node
;
2983 TREE_TYPE (value
) = char16_array_type_node
;
2986 TREE_TYPE (value
) = char32_array_type_node
;
2989 TREE_TYPE (value
) = wchar_array_type_node
;
2993 value
= fix_string_type (value
);
2996 /* cpp_interpret_string has issued an error. */
2997 value
= error_mark_node
;
3000 obstack_free (&str_ob
, 0);
3006 /* Basic concepts [gram.basic] */
3008 /* Parse a translation-unit.
3011 declaration-seq [opt]
3013 Returns TRUE if all went well. */
3016 cp_parser_translation_unit (cp_parser
* parser
)
3018 /* The address of the first non-permanent object on the declarator
3020 static void *declarator_obstack_base
;
3024 /* Create the declarator obstack, if necessary. */
3025 if (!cp_error_declarator
)
3027 gcc_obstack_init (&declarator_obstack
);
3028 /* Create the error declarator. */
3029 cp_error_declarator
= make_declarator (cdk_error
);
3030 /* Create the empty parameter list. */
3031 no_parameters
= make_parameter_declarator (NULL
, NULL
, NULL_TREE
);
3032 /* Remember where the base of the declarator obstack lies. */
3033 declarator_obstack_base
= obstack_next_free (&declarator_obstack
);
3036 cp_parser_declaration_seq_opt (parser
);
3038 /* If there are no tokens left then all went well. */
3039 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
3041 /* Get rid of the token array; we don't need it any more. */
3042 cp_lexer_destroy (parser
->lexer
);
3043 parser
->lexer
= NULL
;
3045 /* This file might have been a context that's implicitly extern
3046 "C". If so, pop the lang context. (Only relevant for PCH.) */
3047 if (parser
->implicit_extern_c
)
3049 pop_lang_context ();
3050 parser
->implicit_extern_c
= false;
3054 finish_translation_unit ();
3060 cp_parser_error (parser
, "expected declaration");
3064 /* Make sure the declarator obstack was fully cleaned up. */
3065 gcc_assert (obstack_next_free (&declarator_obstack
)
3066 == declarator_obstack_base
);
3068 /* All went well. */
3072 /* Expressions [gram.expr] */
3074 /* Parse a primary-expression.
3085 ( compound-statement )
3086 __builtin_va_arg ( assignment-expression , type-id )
3087 __builtin_offsetof ( type-id , offsetof-expression )
3090 __has_nothrow_assign ( type-id )
3091 __has_nothrow_constructor ( type-id )
3092 __has_nothrow_copy ( type-id )
3093 __has_trivial_assign ( type-id )
3094 __has_trivial_constructor ( type-id )
3095 __has_trivial_copy ( type-id )
3096 __has_trivial_destructor ( type-id )
3097 __has_virtual_destructor ( type-id )
3098 __is_abstract ( type-id )
3099 __is_base_of ( type-id , type-id )
3100 __is_class ( type-id )
3101 __is_convertible_to ( type-id , type-id )
3102 __is_empty ( type-id )
3103 __is_enum ( type-id )
3104 __is_pod ( type-id )
3105 __is_polymorphic ( type-id )
3106 __is_union ( type-id )
3108 Objective-C++ Extension:
3116 ADDRESS_P is true iff this expression was immediately preceded by
3117 "&" and therefore might denote a pointer-to-member. CAST_P is true
3118 iff this expression is the target of a cast. TEMPLATE_ARG_P is
3119 true iff this expression is a template argument.
3121 Returns a representation of the expression. Upon return, *IDK
3122 indicates what kind of id-expression (if any) was present. */
3125 cp_parser_primary_expression (cp_parser
*parser
,
3128 bool template_arg_p
,
3131 cp_token
*token
= NULL
;
3133 /* Assume the primary expression is not an id-expression. */
3134 *idk
= CP_ID_KIND_NONE
;
3136 /* Peek at the next token. */
3137 token
= cp_lexer_peek_token (parser
->lexer
);
3138 switch (token
->type
)
3151 token
= cp_lexer_consume_token (parser
->lexer
);
3152 if (TREE_CODE (token
->u
.value
) == FIXED_CST
)
3154 error ("%Hfixed-point types not supported in C++",
3156 return error_mark_node
;
3158 /* Floating-point literals are only allowed in an integral
3159 constant expression if they are cast to an integral or
3160 enumeration type. */
3161 if (TREE_CODE (token
->u
.value
) == REAL_CST
3162 && parser
->integral_constant_expression_p
3165 /* CAST_P will be set even in invalid code like "int(2.7 +
3166 ...)". Therefore, we have to check that the next token
3167 is sure to end the cast. */
3170 cp_token
*next_token
;
3172 next_token
= cp_lexer_peek_token (parser
->lexer
);
3173 if (/* The comma at the end of an
3174 enumerator-definition. */
3175 next_token
->type
!= CPP_COMMA
3176 /* The curly brace at the end of an enum-specifier. */
3177 && next_token
->type
!= CPP_CLOSE_BRACE
3178 /* The end of a statement. */
3179 && next_token
->type
!= CPP_SEMICOLON
3180 /* The end of the cast-expression. */
3181 && next_token
->type
!= CPP_CLOSE_PAREN
3182 /* The end of an array bound. */
3183 && next_token
->type
!= CPP_CLOSE_SQUARE
3184 /* The closing ">" in a template-argument-list. */
3185 && (next_token
->type
!= CPP_GREATER
3186 || parser
->greater_than_is_operator_p
)
3187 /* C++0x only: A ">>" treated like two ">" tokens,
3188 in a template-argument-list. */
3189 && (next_token
->type
!= CPP_RSHIFT
3190 || (cxx_dialect
== cxx98
)
3191 || parser
->greater_than_is_operator_p
))
3195 /* If we are within a cast, then the constraint that the
3196 cast is to an integral or enumeration type will be
3197 checked at that point. If we are not within a cast, then
3198 this code is invalid. */
3200 cp_parser_non_integral_constant_expression
3201 (parser
, "floating-point literal");
3203 return token
->u
.value
;
3209 /* ??? Should wide strings be allowed when parser->translate_strings_p
3210 is false (i.e. in attributes)? If not, we can kill the third
3211 argument to cp_parser_string_literal. */
3212 return cp_parser_string_literal (parser
,
3213 parser
->translate_strings_p
,
3216 case CPP_OPEN_PAREN
:
3219 bool saved_greater_than_is_operator_p
;
3221 /* Consume the `('. */
3222 cp_lexer_consume_token (parser
->lexer
);
3223 /* Within a parenthesized expression, a `>' token is always
3224 the greater-than operator. */
3225 saved_greater_than_is_operator_p
3226 = parser
->greater_than_is_operator_p
;
3227 parser
->greater_than_is_operator_p
= true;
3228 /* If we see `( { ' then we are looking at the beginning of
3229 a GNU statement-expression. */
3230 if (cp_parser_allow_gnu_extensions_p (parser
)
3231 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
3233 /* Statement-expressions are not allowed by the standard. */
3234 pedwarn (token
->location
, OPT_pedantic
,
3235 "ISO C++ forbids braced-groups within expressions");
3237 /* And they're not allowed outside of a function-body; you
3238 cannot, for example, write:
3240 int i = ({ int j = 3; j + 1; });
3242 at class or namespace scope. */
3243 if (!parser
->in_function_body
3244 || parser
->in_template_argument_list_p
)
3246 error ("%Hstatement-expressions are not allowed outside "
3247 "functions nor in template-argument lists",
3249 cp_parser_skip_to_end_of_block_or_statement (parser
);
3250 expr
= error_mark_node
;
3254 /* Start the statement-expression. */
3255 expr
= begin_stmt_expr ();
3256 /* Parse the compound-statement. */
3257 cp_parser_compound_statement (parser
, expr
, false);
3259 expr
= finish_stmt_expr (expr
, false);
3264 /* Parse the parenthesized expression. */
3265 expr
= cp_parser_expression (parser
, cast_p
, idk
);
3266 /* Let the front end know that this expression was
3267 enclosed in parentheses. This matters in case, for
3268 example, the expression is of the form `A::B', since
3269 `&A::B' might be a pointer-to-member, but `&(A::B)' is
3271 finish_parenthesized_expr (expr
);
3273 /* The `>' token might be the end of a template-id or
3274 template-parameter-list now. */
3275 parser
->greater_than_is_operator_p
3276 = saved_greater_than_is_operator_p
;
3277 /* Consume the `)'. */
3278 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>"))
3279 cp_parser_skip_to_end_of_statement (parser
);
3285 switch (token
->keyword
)
3287 /* These two are the boolean literals. */
3289 cp_lexer_consume_token (parser
->lexer
);
3290 return boolean_true_node
;
3292 cp_lexer_consume_token (parser
->lexer
);
3293 return boolean_false_node
;
3295 /* The `__null' literal. */
3297 cp_lexer_consume_token (parser
->lexer
);
3300 /* Recognize the `this' keyword. */
3302 cp_lexer_consume_token (parser
->lexer
);
3303 if (parser
->local_variables_forbidden_p
)
3305 error ("%H%<this%> may not be used in this context",
3307 return error_mark_node
;
3309 /* Pointers cannot appear in constant-expressions. */
3310 if (cp_parser_non_integral_constant_expression (parser
, "%<this%>"))
3311 return error_mark_node
;
3312 return finish_this_expr ();
3314 /* The `operator' keyword can be the beginning of an
3319 case RID_FUNCTION_NAME
:
3320 case RID_PRETTY_FUNCTION_NAME
:
3321 case RID_C99_FUNCTION_NAME
:
3325 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
3326 __func__ are the names of variables -- but they are
3327 treated specially. Therefore, they are handled here,
3328 rather than relying on the generic id-expression logic
3329 below. Grammatically, these names are id-expressions.
3331 Consume the token. */
3332 token
= cp_lexer_consume_token (parser
->lexer
);
3334 switch (token
->keyword
)
3336 case RID_FUNCTION_NAME
:
3337 name
= "%<__FUNCTION__%>";
3339 case RID_PRETTY_FUNCTION_NAME
:
3340 name
= "%<__PRETTY_FUNCTION__%>";
3342 case RID_C99_FUNCTION_NAME
:
3343 name
= "%<__func__%>";
3349 if (cp_parser_non_integral_constant_expression (parser
, name
))
3350 return error_mark_node
;
3352 /* Look up the name. */
3353 return finish_fname (token
->u
.value
);
3361 /* The `__builtin_va_arg' construct is used to handle
3362 `va_arg'. Consume the `__builtin_va_arg' token. */
3363 cp_lexer_consume_token (parser
->lexer
);
3364 /* Look for the opening `('. */
3365 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
3366 /* Now, parse the assignment-expression. */
3367 expression
= cp_parser_assignment_expression (parser
,
3368 /*cast_p=*/false, NULL
);
3369 /* Look for the `,'. */
3370 cp_parser_require (parser
, CPP_COMMA
, "%<,%>");
3371 /* Parse the type-id. */
3372 type
= cp_parser_type_id (parser
);
3373 /* Look for the closing `)'. */
3374 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
3375 /* Using `va_arg' in a constant-expression is not
3377 if (cp_parser_non_integral_constant_expression (parser
,
3379 return error_mark_node
;
3380 return build_x_va_arg (expression
, type
);
3384 return cp_parser_builtin_offsetof (parser
);
3386 case RID_HAS_NOTHROW_ASSIGN
:
3387 case RID_HAS_NOTHROW_CONSTRUCTOR
:
3388 case RID_HAS_NOTHROW_COPY
:
3389 case RID_HAS_TRIVIAL_ASSIGN
:
3390 case RID_HAS_TRIVIAL_CONSTRUCTOR
:
3391 case RID_HAS_TRIVIAL_COPY
:
3392 case RID_HAS_TRIVIAL_DESTRUCTOR
:
3393 case RID_HAS_VIRTUAL_DESTRUCTOR
:
3394 case RID_IS_ABSTRACT
:
3395 case RID_IS_BASE_OF
:
3397 case RID_IS_CONVERTIBLE_TO
:
3401 case RID_IS_POLYMORPHIC
:
3403 return cp_parser_trait_expr (parser
, token
->keyword
);
3405 /* Objective-C++ expressions. */
3407 case RID_AT_PROTOCOL
:
3408 case RID_AT_SELECTOR
:
3409 return cp_parser_objc_expression (parser
);
3412 cp_parser_error (parser
, "expected primary-expression");
3413 return error_mark_node
;
3416 /* An id-expression can start with either an identifier, a
3417 `::' as the beginning of a qualified-id, or the "operator"
3421 case CPP_TEMPLATE_ID
:
3422 case CPP_NESTED_NAME_SPECIFIER
:
3426 const char *error_msg
;
3429 cp_token
*id_expr_token
;
3432 /* Parse the id-expression. */
3434 = cp_parser_id_expression (parser
,
3435 /*template_keyword_p=*/false,
3436 /*check_dependency_p=*/true,
3438 /*declarator_p=*/false,
3439 /*optional_p=*/false);
3440 if (id_expression
== error_mark_node
)
3441 return error_mark_node
;
3442 id_expr_token
= token
;
3443 token
= cp_lexer_peek_token (parser
->lexer
);
3444 done
= (token
->type
!= CPP_OPEN_SQUARE
3445 && token
->type
!= CPP_OPEN_PAREN
3446 && token
->type
!= CPP_DOT
3447 && token
->type
!= CPP_DEREF
3448 && token
->type
!= CPP_PLUS_PLUS
3449 && token
->type
!= CPP_MINUS_MINUS
);
3450 /* If we have a template-id, then no further lookup is
3451 required. If the template-id was for a template-class, we
3452 will sometimes have a TYPE_DECL at this point. */
3453 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
3454 || TREE_CODE (id_expression
) == TYPE_DECL
)
3455 decl
= id_expression
;
3456 /* Look up the name. */
3459 tree ambiguous_decls
;
3461 decl
= cp_parser_lookup_name (parser
, id_expression
,
3464 /*is_namespace=*/false,
3465 /*check_dependency=*/true,
3467 id_expr_token
->location
);
3468 /* If the lookup was ambiguous, an error will already have
3470 if (ambiguous_decls
)
3471 return error_mark_node
;
3473 /* In Objective-C++, an instance variable (ivar) may be preferred
3474 to whatever cp_parser_lookup_name() found. */
3475 decl
= objc_lookup_ivar (decl
, id_expression
);
3477 /* If name lookup gives us a SCOPE_REF, then the
3478 qualifying scope was dependent. */
3479 if (TREE_CODE (decl
) == SCOPE_REF
)
3481 /* At this point, we do not know if DECL is a valid
3482 integral constant expression. We assume that it is
3483 in fact such an expression, so that code like:
3485 template <int N> struct A {
3489 is accepted. At template-instantiation time, we
3490 will check that B<N>::i is actually a constant. */
3493 /* Check to see if DECL is a local variable in a context
3494 where that is forbidden. */
3495 if (parser
->local_variables_forbidden_p
3496 && local_variable_p (decl
))
3498 /* It might be that we only found DECL because we are
3499 trying to be generous with pre-ISO scoping rules.
3500 For example, consider:
3504 for (int i = 0; i < 10; ++i) {}
3505 extern void f(int j = i);
3508 Here, name look up will originally find the out
3509 of scope `i'. We need to issue a warning message,
3510 but then use the global `i'. */
3511 decl
= check_for_out_of_scope_variable (decl
);
3512 if (local_variable_p (decl
))
3514 error ("%Hlocal variable %qD may not appear in this context",
3515 &id_expr_token
->location
, decl
);
3516 return error_mark_node
;
3521 decl
= (finish_id_expression
3522 (id_expression
, decl
, parser
->scope
,
3524 parser
->integral_constant_expression_p
,
3525 parser
->allow_non_integral_constant_expression_p
,
3526 &parser
->non_integral_constant_expression_p
,
3527 template_p
, done
, address_p
,
3530 id_expr_token
->location
));
3532 cp_parser_error (parser
, error_msg
);
3536 /* Anything else is an error. */
3538 /* ...unless we have an Objective-C++ message or string literal,
3540 if (c_dialect_objc ()
3541 && (token
->type
== CPP_OPEN_SQUARE
3542 || token
->type
== CPP_OBJC_STRING
))
3543 return cp_parser_objc_expression (parser
);
3545 cp_parser_error (parser
, "expected primary-expression");
3546 return error_mark_node
;
3550 /* Parse an id-expression.
3557 :: [opt] nested-name-specifier template [opt] unqualified-id
3559 :: operator-function-id
3562 Return a representation of the unqualified portion of the
3563 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
3564 a `::' or nested-name-specifier.
3566 Often, if the id-expression was a qualified-id, the caller will
3567 want to make a SCOPE_REF to represent the qualified-id. This
3568 function does not do this in order to avoid wastefully creating
3569 SCOPE_REFs when they are not required.
3571 If TEMPLATE_KEYWORD_P is true, then we have just seen the
3574 If CHECK_DEPENDENCY_P is false, then names are looked up inside
3575 uninstantiated templates.
3577 If *TEMPLATE_P is non-NULL, it is set to true iff the
3578 `template' keyword is used to explicitly indicate that the entity
3579 named is a template.
3581 If DECLARATOR_P is true, the id-expression is appearing as part of
3582 a declarator, rather than as part of an expression. */
3585 cp_parser_id_expression (cp_parser
*parser
,
3586 bool template_keyword_p
,
3587 bool check_dependency_p
,
3592 bool global_scope_p
;
3593 bool nested_name_specifier_p
;
3595 /* Assume the `template' keyword was not used. */
3597 *template_p
= template_keyword_p
;
3599 /* Look for the optional `::' operator. */
3601 = (cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false)
3603 /* Look for the optional nested-name-specifier. */
3604 nested_name_specifier_p
3605 = (cp_parser_nested_name_specifier_opt (parser
,
3606 /*typename_keyword_p=*/false,
3611 /* If there is a nested-name-specifier, then we are looking at
3612 the first qualified-id production. */
3613 if (nested_name_specifier_p
)
3616 tree saved_object_scope
;
3617 tree saved_qualifying_scope
;
3618 tree unqualified_id
;
3621 /* See if the next token is the `template' keyword. */
3623 template_p
= &is_template
;
3624 *template_p
= cp_parser_optional_template_keyword (parser
);
3625 /* Name lookup we do during the processing of the
3626 unqualified-id might obliterate SCOPE. */
3627 saved_scope
= parser
->scope
;
3628 saved_object_scope
= parser
->object_scope
;
3629 saved_qualifying_scope
= parser
->qualifying_scope
;
3630 /* Process the final unqualified-id. */
3631 unqualified_id
= cp_parser_unqualified_id (parser
, *template_p
,
3634 /*optional_p=*/false);
3635 /* Restore the SAVED_SCOPE for our caller. */
3636 parser
->scope
= saved_scope
;
3637 parser
->object_scope
= saved_object_scope
;
3638 parser
->qualifying_scope
= saved_qualifying_scope
;
3640 return unqualified_id
;
3642 /* Otherwise, if we are in global scope, then we are looking at one
3643 of the other qualified-id productions. */
3644 else if (global_scope_p
)
3649 /* Peek at the next token. */
3650 token
= cp_lexer_peek_token (parser
->lexer
);
3652 /* If it's an identifier, and the next token is not a "<", then
3653 we can avoid the template-id case. This is an optimization
3654 for this common case. */
3655 if (token
->type
== CPP_NAME
3656 && !cp_parser_nth_token_starts_template_argument_list_p
3658 return cp_parser_identifier (parser
);
3660 cp_parser_parse_tentatively (parser
);
3661 /* Try a template-id. */
3662 id
= cp_parser_template_id (parser
,
3663 /*template_keyword_p=*/false,
3664 /*check_dependency_p=*/true,
3666 /* If that worked, we're done. */
3667 if (cp_parser_parse_definitely (parser
))
3670 /* Peek at the next token. (Changes in the token buffer may
3671 have invalidated the pointer obtained above.) */
3672 token
= cp_lexer_peek_token (parser
->lexer
);
3674 switch (token
->type
)
3677 return cp_parser_identifier (parser
);
3680 if (token
->keyword
== RID_OPERATOR
)
3681 return cp_parser_operator_function_id (parser
);
3685 cp_parser_error (parser
, "expected id-expression");
3686 return error_mark_node
;
3690 return cp_parser_unqualified_id (parser
, template_keyword_p
,
3691 /*check_dependency_p=*/true,
3696 /* Parse an unqualified-id.
3700 operator-function-id
3701 conversion-function-id
3705 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
3706 keyword, in a construct like `A::template ...'.
3708 Returns a representation of unqualified-id. For the `identifier'
3709 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
3710 production a BIT_NOT_EXPR is returned; the operand of the
3711 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
3712 other productions, see the documentation accompanying the
3713 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
3714 names are looked up in uninstantiated templates. If DECLARATOR_P
3715 is true, the unqualified-id is appearing as part of a declarator,
3716 rather than as part of an expression. */
3719 cp_parser_unqualified_id (cp_parser
* parser
,
3720 bool template_keyword_p
,
3721 bool check_dependency_p
,
3727 /* Peek at the next token. */
3728 token
= cp_lexer_peek_token (parser
->lexer
);
3730 switch (token
->type
)
3736 /* We don't know yet whether or not this will be a
3738 cp_parser_parse_tentatively (parser
);
3739 /* Try a template-id. */
3740 id
= cp_parser_template_id (parser
, template_keyword_p
,
3743 /* If it worked, we're done. */
3744 if (cp_parser_parse_definitely (parser
))
3746 /* Otherwise, it's an ordinary identifier. */
3747 return cp_parser_identifier (parser
);
3750 case CPP_TEMPLATE_ID
:
3751 return cp_parser_template_id (parser
, template_keyword_p
,
3758 tree qualifying_scope
;
3763 /* Consume the `~' token. */
3764 cp_lexer_consume_token (parser
->lexer
);
3765 /* Parse the class-name. The standard, as written, seems to
3768 template <typename T> struct S { ~S (); };
3769 template <typename T> S<T>::~S() {}
3771 is invalid, since `~' must be followed by a class-name, but
3772 `S<T>' is dependent, and so not known to be a class.
3773 That's not right; we need to look in uninstantiated
3774 templates. A further complication arises from:
3776 template <typename T> void f(T t) {
3780 Here, it is not possible to look up `T' in the scope of `T'
3781 itself. We must look in both the current scope, and the
3782 scope of the containing complete expression.
3784 Yet another issue is:
3793 The standard does not seem to say that the `S' in `~S'
3794 should refer to the type `S' and not the data member
3797 /* DR 244 says that we look up the name after the "~" in the
3798 same scope as we looked up the qualifying name. That idea
3799 isn't fully worked out; it's more complicated than that. */
3800 scope
= parser
->scope
;
3801 object_scope
= parser
->object_scope
;
3802 qualifying_scope
= parser
->qualifying_scope
;
3804 /* Check for invalid scopes. */
3805 if (scope
== error_mark_node
)
3807 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
3808 cp_lexer_consume_token (parser
->lexer
);
3809 return error_mark_node
;
3811 if (scope
&& TREE_CODE (scope
) == NAMESPACE_DECL
)
3813 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
3814 error ("%Hscope %qT before %<~%> is not a class-name",
3815 &token
->location
, scope
);
3816 cp_parser_simulate_error (parser
);
3817 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
3818 cp_lexer_consume_token (parser
->lexer
);
3819 return error_mark_node
;
3821 gcc_assert (!scope
|| TYPE_P (scope
));
3823 /* If the name is of the form "X::~X" it's OK. */
3824 token
= cp_lexer_peek_token (parser
->lexer
);
3826 && token
->type
== CPP_NAME
3827 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
3829 && constructor_name_p (token
->u
.value
, scope
))
3831 cp_lexer_consume_token (parser
->lexer
);
3832 return build_nt (BIT_NOT_EXPR
, scope
);
3835 /* If there was an explicit qualification (S::~T), first look
3836 in the scope given by the qualification (i.e., S). */
3838 type_decl
= NULL_TREE
;
3841 cp_parser_parse_tentatively (parser
);
3842 type_decl
= cp_parser_class_name (parser
,
3843 /*typename_keyword_p=*/false,
3844 /*template_keyword_p=*/false,
3846 /*check_dependency=*/false,
3847 /*class_head_p=*/false,
3849 if (cp_parser_parse_definitely (parser
))
3852 /* In "N::S::~S", look in "N" as well. */
3853 if (!done
&& scope
&& qualifying_scope
)
3855 cp_parser_parse_tentatively (parser
);
3856 parser
->scope
= qualifying_scope
;
3857 parser
->object_scope
= NULL_TREE
;
3858 parser
->qualifying_scope
= NULL_TREE
;
3860 = cp_parser_class_name (parser
,
3861 /*typename_keyword_p=*/false,
3862 /*template_keyword_p=*/false,
3864 /*check_dependency=*/false,
3865 /*class_head_p=*/false,
3867 if (cp_parser_parse_definitely (parser
))
3870 /* In "p->S::~T", look in the scope given by "*p" as well. */
3871 else if (!done
&& object_scope
)
3873 cp_parser_parse_tentatively (parser
);
3874 parser
->scope
= object_scope
;
3875 parser
->object_scope
= NULL_TREE
;
3876 parser
->qualifying_scope
= NULL_TREE
;
3878 = cp_parser_class_name (parser
,
3879 /*typename_keyword_p=*/false,
3880 /*template_keyword_p=*/false,
3882 /*check_dependency=*/false,
3883 /*class_head_p=*/false,
3885 if (cp_parser_parse_definitely (parser
))
3888 /* Look in the surrounding context. */
3891 parser
->scope
= NULL_TREE
;
3892 parser
->object_scope
= NULL_TREE
;
3893 parser
->qualifying_scope
= NULL_TREE
;
3894 if (processing_template_decl
)
3895 cp_parser_parse_tentatively (parser
);
3897 = cp_parser_class_name (parser
,
3898 /*typename_keyword_p=*/false,
3899 /*template_keyword_p=*/false,
3901 /*check_dependency=*/false,
3902 /*class_head_p=*/false,
3904 if (processing_template_decl
3905 && ! cp_parser_parse_definitely (parser
))
3907 /* We couldn't find a type with this name, so just accept
3908 it and check for a match at instantiation time. */
3909 type_decl
= cp_parser_identifier (parser
);
3910 if (type_decl
!= error_mark_node
)
3911 type_decl
= build_nt (BIT_NOT_EXPR
, type_decl
);
3915 /* If an error occurred, assume that the name of the
3916 destructor is the same as the name of the qualifying
3917 class. That allows us to keep parsing after running
3918 into ill-formed destructor names. */
3919 if (type_decl
== error_mark_node
&& scope
)
3920 return build_nt (BIT_NOT_EXPR
, scope
);
3921 else if (type_decl
== error_mark_node
)
3922 return error_mark_node
;
3924 /* Check that destructor name and scope match. */
3925 if (declarator_p
&& scope
&& !check_dtor_name (scope
, type_decl
))
3927 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
3928 error ("%Hdeclaration of %<~%T%> as member of %qT",
3929 &token
->location
, type_decl
, scope
);
3930 cp_parser_simulate_error (parser
);
3931 return error_mark_node
;
3936 A typedef-name that names a class shall not be used as the
3937 identifier in the declarator for a destructor declaration. */
3939 && !DECL_IMPLICIT_TYPEDEF_P (type_decl
)
3940 && !DECL_SELF_REFERENCE_P (type_decl
)
3941 && !cp_parser_uncommitted_to_tentative_parse_p (parser
))
3942 error ("%Htypedef-name %qD used as destructor declarator",
3943 &token
->location
, type_decl
);
3945 return build_nt (BIT_NOT_EXPR
, TREE_TYPE (type_decl
));
3949 if (token
->keyword
== RID_OPERATOR
)
3953 /* This could be a template-id, so we try that first. */
3954 cp_parser_parse_tentatively (parser
);
3955 /* Try a template-id. */
3956 id
= cp_parser_template_id (parser
, template_keyword_p
,
3957 /*check_dependency_p=*/true,
3959 /* If that worked, we're done. */
3960 if (cp_parser_parse_definitely (parser
))
3962 /* We still don't know whether we're looking at an
3963 operator-function-id or a conversion-function-id. */
3964 cp_parser_parse_tentatively (parser
);
3965 /* Try an operator-function-id. */
3966 id
= cp_parser_operator_function_id (parser
);
3967 /* If that didn't work, try a conversion-function-id. */
3968 if (!cp_parser_parse_definitely (parser
))
3969 id
= cp_parser_conversion_function_id (parser
);
3978 cp_parser_error (parser
, "expected unqualified-id");
3979 return error_mark_node
;
3983 /* Parse an (optional) nested-name-specifier.
3985 nested-name-specifier: [C++98]
3986 class-or-namespace-name :: nested-name-specifier [opt]
3987 class-or-namespace-name :: template nested-name-specifier [opt]
3989 nested-name-specifier: [C++0x]
3992 nested-name-specifier identifier ::
3993 nested-name-specifier template [opt] simple-template-id ::
3995 PARSER->SCOPE should be set appropriately before this function is
3996 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
3997 effect. TYPE_P is TRUE if we non-type bindings should be ignored
4000 Sets PARSER->SCOPE to the class (TYPE) or namespace
4001 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
4002 it unchanged if there is no nested-name-specifier. Returns the new
4003 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
4005 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
4006 part of a declaration and/or decl-specifier. */
4009 cp_parser_nested_name_specifier_opt (cp_parser
*parser
,
4010 bool typename_keyword_p
,
4011 bool check_dependency_p
,
4013 bool is_declaration
)
4015 bool success
= false;
4016 cp_token_position start
= 0;
4019 /* Remember where the nested-name-specifier starts. */
4020 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
4022 start
= cp_lexer_token_position (parser
->lexer
, false);
4023 push_deferring_access_checks (dk_deferred
);
4030 tree saved_qualifying_scope
;
4031 bool template_keyword_p
;
4033 /* Spot cases that cannot be the beginning of a
4034 nested-name-specifier. */
4035 token
= cp_lexer_peek_token (parser
->lexer
);
4037 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
4038 the already parsed nested-name-specifier. */
4039 if (token
->type
== CPP_NESTED_NAME_SPECIFIER
)
4041 /* Grab the nested-name-specifier and continue the loop. */
4042 cp_parser_pre_parsed_nested_name_specifier (parser
);
4043 /* If we originally encountered this nested-name-specifier
4044 with IS_DECLARATION set to false, we will not have
4045 resolved TYPENAME_TYPEs, so we must do so here. */
4047 && TREE_CODE (parser
->scope
) == TYPENAME_TYPE
)
4049 new_scope
= resolve_typename_type (parser
->scope
,
4050 /*only_current_p=*/false);
4051 if (TREE_CODE (new_scope
) != TYPENAME_TYPE
)
4052 parser
->scope
= new_scope
;
4058 /* Spot cases that cannot be the beginning of a
4059 nested-name-specifier. On the second and subsequent times
4060 through the loop, we look for the `template' keyword. */
4061 if (success
&& token
->keyword
== RID_TEMPLATE
)
4063 /* A template-id can start a nested-name-specifier. */
4064 else if (token
->type
== CPP_TEMPLATE_ID
)
4068 /* If the next token is not an identifier, then it is
4069 definitely not a type-name or namespace-name. */
4070 if (token
->type
!= CPP_NAME
)
4072 /* If the following token is neither a `<' (to begin a
4073 template-id), nor a `::', then we are not looking at a
4074 nested-name-specifier. */
4075 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
4076 if (token
->type
!= CPP_SCOPE
4077 && !cp_parser_nth_token_starts_template_argument_list_p
4082 /* The nested-name-specifier is optional, so we parse
4084 cp_parser_parse_tentatively (parser
);
4086 /* Look for the optional `template' keyword, if this isn't the
4087 first time through the loop. */
4089 template_keyword_p
= cp_parser_optional_template_keyword (parser
);
4091 template_keyword_p
= false;
4093 /* Save the old scope since the name lookup we are about to do
4094 might destroy it. */
4095 old_scope
= parser
->scope
;
4096 saved_qualifying_scope
= parser
->qualifying_scope
;
4097 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
4098 look up names in "X<T>::I" in order to determine that "Y" is
4099 a template. So, if we have a typename at this point, we make
4100 an effort to look through it. */
4102 && !typename_keyword_p
4104 && TREE_CODE (parser
->scope
) == TYPENAME_TYPE
)
4105 parser
->scope
= resolve_typename_type (parser
->scope
,
4106 /*only_current_p=*/false);
4107 /* Parse the qualifying entity. */
4109 = cp_parser_qualifying_entity (parser
,
4115 /* Look for the `::' token. */
4116 cp_parser_require (parser
, CPP_SCOPE
, "%<::%>");
4118 /* If we found what we wanted, we keep going; otherwise, we're
4120 if (!cp_parser_parse_definitely (parser
))
4122 bool error_p
= false;
4124 /* Restore the OLD_SCOPE since it was valid before the
4125 failed attempt at finding the last
4126 class-or-namespace-name. */
4127 parser
->scope
= old_scope
;
4128 parser
->qualifying_scope
= saved_qualifying_scope
;
4129 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
4131 /* If the next token is an identifier, and the one after
4132 that is a `::', then any valid interpretation would have
4133 found a class-or-namespace-name. */
4134 while (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
)
4135 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
4137 && (cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
4140 token
= cp_lexer_consume_token (parser
->lexer
);
4143 if (!token
->ambiguous_p
)
4146 tree ambiguous_decls
;
4148 decl
= cp_parser_lookup_name (parser
, token
->u
.value
,
4150 /*is_template=*/false,
4151 /*is_namespace=*/false,
4152 /*check_dependency=*/true,
4155 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4156 error ("%H%qD used without template parameters",
4157 &token
->location
, decl
);
4158 else if (ambiguous_decls
)
4160 error ("%Hreference to %qD is ambiguous",
4161 &token
->location
, token
->u
.value
);
4162 print_candidates (ambiguous_decls
);
4163 decl
= error_mark_node
;
4167 const char* msg
= "is not a class or namespace";
4168 if (cxx_dialect
!= cxx98
)
4169 msg
= "is not a class, namespace, or enumeration";
4170 cp_parser_name_lookup_error
4171 (parser
, token
->u
.value
, decl
, msg
,
4175 parser
->scope
= error_mark_node
;
4177 /* Treat this as a successful nested-name-specifier
4182 If the name found is not a class-name (clause
4183 _class_) or namespace-name (_namespace.def_), the
4184 program is ill-formed. */
4187 cp_lexer_consume_token (parser
->lexer
);
4191 /* We've found one valid nested-name-specifier. */
4193 /* Name lookup always gives us a DECL. */
4194 if (TREE_CODE (new_scope
) == TYPE_DECL
)
4195 new_scope
= TREE_TYPE (new_scope
);
4196 /* Uses of "template" must be followed by actual templates. */
4197 if (template_keyword_p
4198 && !(CLASS_TYPE_P (new_scope
)
4199 && ((CLASSTYPE_USE_TEMPLATE (new_scope
)
4200 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (new_scope
)))
4201 || CLASSTYPE_IS_TEMPLATE (new_scope
)))
4202 && !(TREE_CODE (new_scope
) == TYPENAME_TYPE
4203 && (TREE_CODE (TYPENAME_TYPE_FULLNAME (new_scope
))
4204 == TEMPLATE_ID_EXPR
)))
4205 permerror (input_location
, TYPE_P (new_scope
)
4206 ? "%qT is not a template"
4207 : "%qD is not a template",
4209 /* If it is a class scope, try to complete it; we are about to
4210 be looking up names inside the class. */
4211 if (TYPE_P (new_scope
)
4212 /* Since checking types for dependency can be expensive,
4213 avoid doing it if the type is already complete. */
4214 && !COMPLETE_TYPE_P (new_scope
)
4215 /* Do not try to complete dependent types. */
4216 && !dependent_type_p (new_scope
))
4218 new_scope
= complete_type (new_scope
);
4219 /* If it is a typedef to current class, use the current
4220 class instead, as the typedef won't have any names inside
4222 if (!COMPLETE_TYPE_P (new_scope
)
4223 && currently_open_class (new_scope
))
4224 new_scope
= TYPE_MAIN_VARIANT (new_scope
);
4226 /* Make sure we look in the right scope the next time through
4228 parser
->scope
= new_scope
;
4231 /* If parsing tentatively, replace the sequence of tokens that makes
4232 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
4233 token. That way, should we re-parse the token stream, we will
4234 not have to repeat the effort required to do the parse, nor will
4235 we issue duplicate error messages. */
4236 if (success
&& start
)
4240 token
= cp_lexer_token_at (parser
->lexer
, start
);
4241 /* Reset the contents of the START token. */
4242 token
->type
= CPP_NESTED_NAME_SPECIFIER
;
4243 /* Retrieve any deferred checks. Do not pop this access checks yet
4244 so the memory will not be reclaimed during token replacing below. */
4245 token
->u
.tree_check_value
= GGC_CNEW (struct tree_check
);
4246 token
->u
.tree_check_value
->value
= parser
->scope
;
4247 token
->u
.tree_check_value
->checks
= get_deferred_access_checks ();
4248 token
->u
.tree_check_value
->qualifying_scope
=
4249 parser
->qualifying_scope
;
4250 token
->keyword
= RID_MAX
;
4252 /* Purge all subsequent tokens. */
4253 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
4257 pop_to_parent_deferring_access_checks ();
4259 return success
? parser
->scope
: NULL_TREE
;
4262 /* Parse a nested-name-specifier. See
4263 cp_parser_nested_name_specifier_opt for details. This function
4264 behaves identically, except that it will an issue an error if no
4265 nested-name-specifier is present. */
4268 cp_parser_nested_name_specifier (cp_parser
*parser
,
4269 bool typename_keyword_p
,
4270 bool check_dependency_p
,
4272 bool is_declaration
)
4276 /* Look for the nested-name-specifier. */
4277 scope
= cp_parser_nested_name_specifier_opt (parser
,
4282 /* If it was not present, issue an error message. */
4285 cp_parser_error (parser
, "expected nested-name-specifier");
4286 parser
->scope
= NULL_TREE
;
4292 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
4293 this is either a class-name or a namespace-name (which corresponds
4294 to the class-or-namespace-name production in the grammar). For
4295 C++0x, it can also be a type-name that refers to an enumeration
4298 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
4299 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
4300 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
4301 TYPE_P is TRUE iff the next name should be taken as a class-name,
4302 even the same name is declared to be another entity in the same
4305 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
4306 specified by the class-or-namespace-name. If neither is found the
4307 ERROR_MARK_NODE is returned. */
4310 cp_parser_qualifying_entity (cp_parser
*parser
,
4311 bool typename_keyword_p
,
4312 bool template_keyword_p
,
4313 bool check_dependency_p
,
4315 bool is_declaration
)
4318 tree saved_qualifying_scope
;
4319 tree saved_object_scope
;
4322 bool successful_parse_p
;
4324 /* Before we try to parse the class-name, we must save away the
4325 current PARSER->SCOPE since cp_parser_class_name will destroy
4327 saved_scope
= parser
->scope
;
4328 saved_qualifying_scope
= parser
->qualifying_scope
;
4329 saved_object_scope
= parser
->object_scope
;
4330 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
4331 there is no need to look for a namespace-name. */
4332 only_class_p
= template_keyword_p
4333 || (saved_scope
&& TYPE_P (saved_scope
) && cxx_dialect
== cxx98
);
4335 cp_parser_parse_tentatively (parser
);
4336 scope
= cp_parser_class_name (parser
,
4339 type_p
? class_type
: none_type
,
4341 /*class_head_p=*/false,
4343 successful_parse_p
= only_class_p
|| cp_parser_parse_definitely (parser
);
4344 /* If that didn't work and we're in C++0x mode, try for a type-name. */
4346 && cxx_dialect
!= cxx98
4347 && !successful_parse_p
)
4349 /* Restore the saved scope. */
4350 parser
->scope
= saved_scope
;
4351 parser
->qualifying_scope
= saved_qualifying_scope
;
4352 parser
->object_scope
= saved_object_scope
;
4354 /* Parse tentatively. */
4355 cp_parser_parse_tentatively (parser
);
4357 /* Parse a typedef-name or enum-name. */
4358 scope
= cp_parser_nonclass_name (parser
);
4359 successful_parse_p
= cp_parser_parse_definitely (parser
);
4361 /* If that didn't work, try for a namespace-name. */
4362 if (!only_class_p
&& !successful_parse_p
)
4364 /* Restore the saved scope. */
4365 parser
->scope
= saved_scope
;
4366 parser
->qualifying_scope
= saved_qualifying_scope
;
4367 parser
->object_scope
= saved_object_scope
;
4368 /* If we are not looking at an identifier followed by the scope
4369 resolution operator, then this is not part of a
4370 nested-name-specifier. (Note that this function is only used
4371 to parse the components of a nested-name-specifier.) */
4372 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
)
4373 || cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_SCOPE
)
4374 return error_mark_node
;
4375 scope
= cp_parser_namespace_name (parser
);
4381 /* Parse a postfix-expression.
4385 postfix-expression [ expression ]
4386 postfix-expression ( expression-list [opt] )
4387 simple-type-specifier ( expression-list [opt] )
4388 typename :: [opt] nested-name-specifier identifier
4389 ( expression-list [opt] )
4390 typename :: [opt] nested-name-specifier template [opt] template-id
4391 ( expression-list [opt] )
4392 postfix-expression . template [opt] id-expression
4393 postfix-expression -> template [opt] id-expression
4394 postfix-expression . pseudo-destructor-name
4395 postfix-expression -> pseudo-destructor-name
4396 postfix-expression ++
4397 postfix-expression --
4398 dynamic_cast < type-id > ( expression )
4399 static_cast < type-id > ( expression )
4400 reinterpret_cast < type-id > ( expression )
4401 const_cast < type-id > ( expression )
4402 typeid ( expression )
4408 ( type-id ) { initializer-list , [opt] }
4410 This extension is a GNU version of the C99 compound-literal
4411 construct. (The C99 grammar uses `type-name' instead of `type-id',
4412 but they are essentially the same concept.)
4414 If ADDRESS_P is true, the postfix expression is the operand of the
4415 `&' operator. CAST_P is true if this expression is the target of a
4418 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
4419 class member access expressions [expr.ref].
4421 Returns a representation of the expression. */
4424 cp_parser_postfix_expression (cp_parser
*parser
, bool address_p
, bool cast_p
,
4425 bool member_access_only_p
,
4426 cp_id_kind
* pidk_return
)
4430 cp_id_kind idk
= CP_ID_KIND_NONE
;
4431 tree postfix_expression
= NULL_TREE
;
4432 bool is_member_access
= false;
4434 /* Peek at the next token. */
4435 token
= cp_lexer_peek_token (parser
->lexer
);
4436 /* Some of the productions are determined by keywords. */
4437 keyword
= token
->keyword
;
4447 const char *saved_message
;
4449 /* All of these can be handled in the same way from the point
4450 of view of parsing. Begin by consuming the token
4451 identifying the cast. */
4452 cp_lexer_consume_token (parser
->lexer
);
4454 /* New types cannot be defined in the cast. */
4455 saved_message
= parser
->type_definition_forbidden_message
;
4456 parser
->type_definition_forbidden_message
4457 = "types may not be defined in casts";
4459 /* Look for the opening `<'. */
4460 cp_parser_require (parser
, CPP_LESS
, "%<<%>");
4461 /* Parse the type to which we are casting. */
4462 type
= cp_parser_type_id (parser
);
4463 /* Look for the closing `>'. */
4464 cp_parser_require (parser
, CPP_GREATER
, "%<>%>");
4465 /* Restore the old message. */
4466 parser
->type_definition_forbidden_message
= saved_message
;
4468 /* And the expression which is being cast. */
4469 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
4470 expression
= cp_parser_expression (parser
, /*cast_p=*/true, & idk
);
4471 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
4473 /* Only type conversions to integral or enumeration types
4474 can be used in constant-expressions. */
4475 if (!cast_valid_in_integral_constant_expression_p (type
)
4476 && (cp_parser_non_integral_constant_expression
4478 "a cast to a type other than an integral or "
4479 "enumeration type")))
4480 return error_mark_node
;
4486 = build_dynamic_cast (type
, expression
, tf_warning_or_error
);
4490 = build_static_cast (type
, expression
, tf_warning_or_error
);
4494 = build_reinterpret_cast (type
, expression
,
4495 tf_warning_or_error
);
4499 = build_const_cast (type
, expression
, tf_warning_or_error
);
4510 const char *saved_message
;
4511 bool saved_in_type_id_in_expr_p
;
4513 /* Consume the `typeid' token. */
4514 cp_lexer_consume_token (parser
->lexer
);
4515 /* Look for the `(' token. */
4516 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
4517 /* Types cannot be defined in a `typeid' expression. */
4518 saved_message
= parser
->type_definition_forbidden_message
;
4519 parser
->type_definition_forbidden_message
4520 = "types may not be defined in a %<typeid%> expression";
4521 /* We can't be sure yet whether we're looking at a type-id or an
4523 cp_parser_parse_tentatively (parser
);
4524 /* Try a type-id first. */
4525 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
4526 parser
->in_type_id_in_expr_p
= true;
4527 type
= cp_parser_type_id (parser
);
4528 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
4529 /* Look for the `)' token. Otherwise, we can't be sure that
4530 we're not looking at an expression: consider `typeid (int
4531 (3))', for example. */
4532 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
4533 /* If all went well, simply lookup the type-id. */
4534 if (cp_parser_parse_definitely (parser
))
4535 postfix_expression
= get_typeid (type
);
4536 /* Otherwise, fall back to the expression variant. */
4541 /* Look for an expression. */
4542 expression
= cp_parser_expression (parser
, /*cast_p=*/false, & idk
);
4543 /* Compute its typeid. */
4544 postfix_expression
= build_typeid (expression
);
4545 /* Look for the `)' token. */
4546 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
4548 /* Restore the saved message. */
4549 parser
->type_definition_forbidden_message
= saved_message
;
4550 /* `typeid' may not appear in an integral constant expression. */
4551 if (cp_parser_non_integral_constant_expression(parser
,
4552 "%<typeid%> operator"))
4553 return error_mark_node
;
4560 /* The syntax permitted here is the same permitted for an
4561 elaborated-type-specifier. */
4562 type
= cp_parser_elaborated_type_specifier (parser
,
4563 /*is_friend=*/false,
4564 /*is_declaration=*/false);
4565 postfix_expression
= cp_parser_functional_cast (parser
, type
);
4573 /* If the next thing is a simple-type-specifier, we may be
4574 looking at a functional cast. We could also be looking at
4575 an id-expression. So, we try the functional cast, and if
4576 that doesn't work we fall back to the primary-expression. */
4577 cp_parser_parse_tentatively (parser
);
4578 /* Look for the simple-type-specifier. */
4579 type
= cp_parser_simple_type_specifier (parser
,
4580 /*decl_specs=*/NULL
,
4581 CP_PARSER_FLAGS_NONE
);
4582 /* Parse the cast itself. */
4583 if (!cp_parser_error_occurred (parser
))
4585 = cp_parser_functional_cast (parser
, type
);
4586 /* If that worked, we're done. */
4587 if (cp_parser_parse_definitely (parser
))
4590 /* If the functional-cast didn't work out, try a
4591 compound-literal. */
4592 if (cp_parser_allow_gnu_extensions_p (parser
)
4593 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
4595 VEC(constructor_elt
,gc
) *initializer_list
= NULL
;
4596 bool saved_in_type_id_in_expr_p
;
4598 cp_parser_parse_tentatively (parser
);
4599 /* Consume the `('. */
4600 cp_lexer_consume_token (parser
->lexer
);
4601 /* Parse the type. */
4602 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
4603 parser
->in_type_id_in_expr_p
= true;
4604 type
= cp_parser_type_id (parser
);
4605 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
4606 /* Look for the `)'. */
4607 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
4608 /* Look for the `{'. */
4609 cp_parser_require (parser
, CPP_OPEN_BRACE
, "%<{%>");
4610 /* If things aren't going well, there's no need to
4612 if (!cp_parser_error_occurred (parser
))
4614 bool non_constant_p
;
4615 /* Parse the initializer-list. */
4617 = cp_parser_initializer_list (parser
, &non_constant_p
);
4618 /* Allow a trailing `,'. */
4619 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
4620 cp_lexer_consume_token (parser
->lexer
);
4621 /* Look for the final `}'. */
4622 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "%<}%>");
4624 /* If that worked, we're definitely looking at a
4625 compound-literal expression. */
4626 if (cp_parser_parse_definitely (parser
))
4628 /* Warn the user that a compound literal is not
4629 allowed in standard C++. */
4630 pedwarn (input_location
, OPT_pedantic
, "ISO C++ forbids compound-literals");
4631 /* For simplicity, we disallow compound literals in
4632 constant-expressions. We could
4633 allow compound literals of integer type, whose
4634 initializer was a constant, in constant
4635 expressions. Permitting that usage, as a further
4636 extension, would not change the meaning of any
4637 currently accepted programs. (Of course, as
4638 compound literals are not part of ISO C++, the
4639 standard has nothing to say.) */
4640 if (cp_parser_non_integral_constant_expression
4641 (parser
, "non-constant compound literals"))
4643 postfix_expression
= error_mark_node
;
4646 /* Form the representation of the compound-literal. */
4648 = (finish_compound_literal
4649 (type
, build_constructor (init_list_type_node
,
4650 initializer_list
)));
4655 /* It must be a primary-expression. */
4657 = cp_parser_primary_expression (parser
, address_p
, cast_p
,
4658 /*template_arg_p=*/false,
4664 /* Keep looping until the postfix-expression is complete. */
4667 if (idk
== CP_ID_KIND_UNQUALIFIED
4668 && TREE_CODE (postfix_expression
) == IDENTIFIER_NODE
4669 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_PAREN
))
4670 /* It is not a Koenig lookup function call. */
4672 = unqualified_name_lookup_error (postfix_expression
);
4674 /* Peek at the next token. */
4675 token
= cp_lexer_peek_token (parser
->lexer
);
4677 switch (token
->type
)
4679 case CPP_OPEN_SQUARE
:
4681 = cp_parser_postfix_open_square_expression (parser
,
4684 idk
= CP_ID_KIND_NONE
;
4685 is_member_access
= false;
4688 case CPP_OPEN_PAREN
:
4689 /* postfix-expression ( expression-list [opt] ) */
4692 bool is_builtin_constant_p
;
4693 bool saved_integral_constant_expression_p
= false;
4694 bool saved_non_integral_constant_expression_p
= false;
4697 is_member_access
= false;
4699 is_builtin_constant_p
4700 = DECL_IS_BUILTIN_CONSTANT_P (postfix_expression
);
4701 if (is_builtin_constant_p
)
4703 /* The whole point of __builtin_constant_p is to allow
4704 non-constant expressions to appear as arguments. */
4705 saved_integral_constant_expression_p
4706 = parser
->integral_constant_expression_p
;
4707 saved_non_integral_constant_expression_p
4708 = parser
->non_integral_constant_expression_p
;
4709 parser
->integral_constant_expression_p
= false;
4711 args
= (cp_parser_parenthesized_expression_list
4712 (parser
, /*is_attribute_list=*/false,
4713 /*cast_p=*/false, /*allow_expansion_p=*/true,
4714 /*non_constant_p=*/NULL
));
4715 if (is_builtin_constant_p
)
4717 parser
->integral_constant_expression_p
4718 = saved_integral_constant_expression_p
;
4719 parser
->non_integral_constant_expression_p
4720 = saved_non_integral_constant_expression_p
;
4723 if (args
== error_mark_node
)
4725 postfix_expression
= error_mark_node
;
4729 /* Function calls are not permitted in
4730 constant-expressions. */
4731 if (! builtin_valid_in_constant_expr_p (postfix_expression
)
4732 && cp_parser_non_integral_constant_expression (parser
,
4735 postfix_expression
= error_mark_node
;
4740 if (idk
== CP_ID_KIND_UNQUALIFIED
4741 || idk
== CP_ID_KIND_TEMPLATE_ID
)
4743 if (TREE_CODE (postfix_expression
) == IDENTIFIER_NODE
)
4748 if (!any_type_dependent_arguments_p (args
))
4750 = perform_koenig_lookup (postfix_expression
, args
);
4754 = unqualified_fn_lookup_error (postfix_expression
);
4756 /* We do not perform argument-dependent lookup if
4757 normal lookup finds a non-function, in accordance
4758 with the expected resolution of DR 218. */
4759 else if (args
&& is_overloaded_fn (postfix_expression
))
4761 tree fn
= get_first_fn (postfix_expression
);
4763 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4764 fn
= OVL_CURRENT (TREE_OPERAND (fn
, 0));
4766 /* Only do argument dependent lookup if regular
4767 lookup does not find a set of member functions.
4768 [basic.lookup.koenig]/2a */
4769 if (!DECL_FUNCTION_MEMBER_P (fn
))
4772 if (!any_type_dependent_arguments_p (args
))
4774 = perform_koenig_lookup (postfix_expression
, args
);
4779 if (TREE_CODE (postfix_expression
) == COMPONENT_REF
)
4781 tree instance
= TREE_OPERAND (postfix_expression
, 0);
4782 tree fn
= TREE_OPERAND (postfix_expression
, 1);
4784 if (processing_template_decl
4785 && (type_dependent_expression_p (instance
)
4786 || (!BASELINK_P (fn
)
4787 && TREE_CODE (fn
) != FIELD_DECL
)
4788 || type_dependent_expression_p (fn
)
4789 || any_type_dependent_arguments_p (args
)))
4792 = build_nt_call_list (postfix_expression
, args
);
4796 if (BASELINK_P (fn
))
4799 = (build_new_method_call
4800 (instance
, fn
, args
, NULL_TREE
,
4801 (idk
== CP_ID_KIND_QUALIFIED
4802 ? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
),
4804 tf_warning_or_error
));
4808 = finish_call_expr (postfix_expression
, args
,
4809 /*disallow_virtual=*/false,
4811 tf_warning_or_error
);
4813 else if (TREE_CODE (postfix_expression
) == OFFSET_REF
4814 || TREE_CODE (postfix_expression
) == MEMBER_REF
4815 || TREE_CODE (postfix_expression
) == DOTSTAR_EXPR
)
4816 postfix_expression
= (build_offset_ref_call_from_tree
4817 (postfix_expression
, args
));
4818 else if (idk
== CP_ID_KIND_QUALIFIED
)
4819 /* A call to a static class member, or a namespace-scope
4822 = finish_call_expr (postfix_expression
, args
,
4823 /*disallow_virtual=*/true,
4825 tf_warning_or_error
);
4827 /* All other function calls. */
4829 = finish_call_expr (postfix_expression
, args
,
4830 /*disallow_virtual=*/false,
4832 tf_warning_or_error
);
4834 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
4835 idk
= CP_ID_KIND_NONE
;
4841 /* postfix-expression . template [opt] id-expression
4842 postfix-expression . pseudo-destructor-name
4843 postfix-expression -> template [opt] id-expression
4844 postfix-expression -> pseudo-destructor-name */
4846 /* Consume the `.' or `->' operator. */
4847 cp_lexer_consume_token (parser
->lexer
);
4850 = cp_parser_postfix_dot_deref_expression (parser
, token
->type
,
4855 is_member_access
= true;
4859 /* postfix-expression ++ */
4860 /* Consume the `++' token. */
4861 cp_lexer_consume_token (parser
->lexer
);
4862 /* Generate a representation for the complete expression. */
4864 = finish_increment_expr (postfix_expression
,
4865 POSTINCREMENT_EXPR
);
4866 /* Increments may not appear in constant-expressions. */
4867 if (cp_parser_non_integral_constant_expression (parser
,
4869 postfix_expression
= error_mark_node
;
4870 idk
= CP_ID_KIND_NONE
;
4871 is_member_access
= false;
4874 case CPP_MINUS_MINUS
:
4875 /* postfix-expression -- */
4876 /* Consume the `--' token. */
4877 cp_lexer_consume_token (parser
->lexer
);
4878 /* Generate a representation for the complete expression. */
4880 = finish_increment_expr (postfix_expression
,
4881 POSTDECREMENT_EXPR
);
4882 /* Decrements may not appear in constant-expressions. */
4883 if (cp_parser_non_integral_constant_expression (parser
,
4885 postfix_expression
= error_mark_node
;
4886 idk
= CP_ID_KIND_NONE
;
4887 is_member_access
= false;
4891 if (pidk_return
!= NULL
)
4892 * pidk_return
= idk
;
4893 if (member_access_only_p
)
4894 return is_member_access
? postfix_expression
: error_mark_node
;
4896 return postfix_expression
;
4900 /* We should never get here. */
4902 return error_mark_node
;
4905 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
4906 by cp_parser_builtin_offsetof. We're looking for
4908 postfix-expression [ expression ]
4910 FOR_OFFSETOF is set if we're being called in that context, which
4911 changes how we deal with integer constant expressions. */
4914 cp_parser_postfix_open_square_expression (cp_parser
*parser
,
4915 tree postfix_expression
,
4920 /* Consume the `[' token. */
4921 cp_lexer_consume_token (parser
->lexer
);
4923 /* Parse the index expression. */
4924 /* ??? For offsetof, there is a question of what to allow here. If
4925 offsetof is not being used in an integral constant expression context,
4926 then we *could* get the right answer by computing the value at runtime.
4927 If we are in an integral constant expression context, then we might
4928 could accept any constant expression; hard to say without analysis.
4929 Rather than open the barn door too wide right away, allow only integer
4930 constant expressions here. */
4932 index
= cp_parser_constant_expression (parser
, false, NULL
);
4934 index
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
4936 /* Look for the closing `]'. */
4937 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, "%<]%>");
4939 /* Build the ARRAY_REF. */
4940 postfix_expression
= grok_array_decl (postfix_expression
, index
);
4942 /* When not doing offsetof, array references are not permitted in
4943 constant-expressions. */
4945 && (cp_parser_non_integral_constant_expression
4946 (parser
, "an array reference")))
4947 postfix_expression
= error_mark_node
;
4949 return postfix_expression
;
4952 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
4953 by cp_parser_builtin_offsetof. We're looking for
4955 postfix-expression . template [opt] id-expression
4956 postfix-expression . pseudo-destructor-name
4957 postfix-expression -> template [opt] id-expression
4958 postfix-expression -> pseudo-destructor-name
4960 FOR_OFFSETOF is set if we're being called in that context. That sorta
4961 limits what of the above we'll actually accept, but nevermind.
4962 TOKEN_TYPE is the "." or "->" token, which will already have been
4963 removed from the stream. */
4966 cp_parser_postfix_dot_deref_expression (cp_parser
*parser
,
4967 enum cpp_ttype token_type
,
4968 tree postfix_expression
,
4969 bool for_offsetof
, cp_id_kind
*idk
,
4970 location_t location
)
4974 bool pseudo_destructor_p
;
4975 tree scope
= NULL_TREE
;
4977 /* If this is a `->' operator, dereference the pointer. */
4978 if (token_type
== CPP_DEREF
)
4979 postfix_expression
= build_x_arrow (postfix_expression
);
4980 /* Check to see whether or not the expression is type-dependent. */
4981 dependent_p
= type_dependent_expression_p (postfix_expression
);
4982 /* The identifier following the `->' or `.' is not qualified. */
4983 parser
->scope
= NULL_TREE
;
4984 parser
->qualifying_scope
= NULL_TREE
;
4985 parser
->object_scope
= NULL_TREE
;
4986 *idk
= CP_ID_KIND_NONE
;
4988 /* Enter the scope corresponding to the type of the object
4989 given by the POSTFIX_EXPRESSION. */
4990 if (!dependent_p
&& TREE_TYPE (postfix_expression
) != NULL_TREE
)
4992 scope
= TREE_TYPE (postfix_expression
);
4993 /* According to the standard, no expression should ever have
4994 reference type. Unfortunately, we do not currently match
4995 the standard in this respect in that our internal representation
4996 of an expression may have reference type even when the standard
4997 says it does not. Therefore, we have to manually obtain the
4998 underlying type here. */
4999 scope
= non_reference (scope
);
5000 /* The type of the POSTFIX_EXPRESSION must be complete. */
5001 if (scope
== unknown_type_node
)
5003 error ("%H%qE does not have class type", &location
, postfix_expression
);
5007 scope
= complete_type_or_else (scope
, NULL_TREE
);
5008 /* Let the name lookup machinery know that we are processing a
5009 class member access expression. */
5010 parser
->context
->object_type
= scope
;
5011 /* If something went wrong, we want to be able to discern that case,
5012 as opposed to the case where there was no SCOPE due to the type
5013 of expression being dependent. */
5015 scope
= error_mark_node
;
5016 /* If the SCOPE was erroneous, make the various semantic analysis
5017 functions exit quickly -- and without issuing additional error
5019 if (scope
== error_mark_node
)
5020 postfix_expression
= error_mark_node
;
5023 /* Assume this expression is not a pseudo-destructor access. */
5024 pseudo_destructor_p
= false;
5026 /* If the SCOPE is a scalar type, then, if this is a valid program,
5027 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
5028 is type dependent, it can be pseudo-destructor-name or something else.
5029 Try to parse it as pseudo-destructor-name first. */
5030 if ((scope
&& SCALAR_TYPE_P (scope
)) || dependent_p
)
5035 cp_parser_parse_tentatively (parser
);
5036 /* Parse the pseudo-destructor-name. */
5038 cp_parser_pseudo_destructor_name (parser
, &s
, &type
);
5040 && (cp_parser_error_occurred (parser
)
5041 || TREE_CODE (type
) != TYPE_DECL
5042 || !SCALAR_TYPE_P (TREE_TYPE (type
))))
5043 cp_parser_abort_tentative_parse (parser
);
5044 else if (cp_parser_parse_definitely (parser
))
5046 pseudo_destructor_p
= true;
5048 = finish_pseudo_destructor_expr (postfix_expression
,
5049 s
, TREE_TYPE (type
));
5053 if (!pseudo_destructor_p
)
5055 /* If the SCOPE is not a scalar type, we are looking at an
5056 ordinary class member access expression, rather than a
5057 pseudo-destructor-name. */
5059 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
5060 /* Parse the id-expression. */
5061 name
= (cp_parser_id_expression
5063 cp_parser_optional_template_keyword (parser
),
5064 /*check_dependency_p=*/true,
5066 /*declarator_p=*/false,
5067 /*optional_p=*/false));
5068 /* In general, build a SCOPE_REF if the member name is qualified.
5069 However, if the name was not dependent and has already been
5070 resolved; there is no need to build the SCOPE_REF. For example;
5072 struct X { void f(); };
5073 template <typename T> void f(T* t) { t->X::f(); }
5075 Even though "t" is dependent, "X::f" is not and has been resolved
5076 to a BASELINK; there is no need to include scope information. */
5078 /* But we do need to remember that there was an explicit scope for
5079 virtual function calls. */
5081 *idk
= CP_ID_KIND_QUALIFIED
;
5083 /* If the name is a template-id that names a type, we will get a
5084 TYPE_DECL here. That is invalid code. */
5085 if (TREE_CODE (name
) == TYPE_DECL
)
5087 error ("%Hinvalid use of %qD", &token
->location
, name
);
5088 postfix_expression
= error_mark_node
;
5092 if (name
!= error_mark_node
&& !BASELINK_P (name
) && parser
->scope
)
5094 name
= build_qualified_name (/*type=*/NULL_TREE
,
5098 parser
->scope
= NULL_TREE
;
5099 parser
->qualifying_scope
= NULL_TREE
;
5100 parser
->object_scope
= NULL_TREE
;
5102 if (scope
&& name
&& BASELINK_P (name
))
5103 adjust_result_of_qualified_name_lookup
5104 (name
, BINFO_TYPE (BASELINK_ACCESS_BINFO (name
)), scope
);
5106 = finish_class_member_access_expr (postfix_expression
, name
,
5108 tf_warning_or_error
);
5112 /* We no longer need to look up names in the scope of the object on
5113 the left-hand side of the `.' or `->' operator. */
5114 parser
->context
->object_type
= NULL_TREE
;
5116 /* Outside of offsetof, these operators may not appear in
5117 constant-expressions. */
5119 && (cp_parser_non_integral_constant_expression
5120 (parser
, token_type
== CPP_DEREF
? "%<->%>" : "%<.%>")))
5121 postfix_expression
= error_mark_node
;
5123 return postfix_expression
;
5126 /* Parse a parenthesized expression-list.
5129 assignment-expression
5130 expression-list, assignment-expression
5135 identifier, expression-list
5137 CAST_P is true if this expression is the target of a cast.
5139 ALLOW_EXPANSION_P is true if this expression allows expansion of an
5142 Returns a TREE_LIST. The TREE_VALUE of each node is a
5143 representation of an assignment-expression. Note that a TREE_LIST
5144 is returned even if there is only a single expression in the list.
5145 error_mark_node is returned if the ( and or ) are
5146 missing. NULL_TREE is returned on no expressions. The parentheses
5147 are eaten. IS_ATTRIBUTE_LIST is true if this is really an attribute
5148 list being parsed. If NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P
5149 indicates whether or not all of the expressions in the list were
5153 cp_parser_parenthesized_expression_list (cp_parser
* parser
,
5154 bool is_attribute_list
,
5156 bool allow_expansion_p
,
5157 bool *non_constant_p
)
5159 tree expression_list
= NULL_TREE
;
5160 bool fold_expr_p
= is_attribute_list
;
5161 tree identifier
= NULL_TREE
;
5162 bool saved_greater_than_is_operator_p
;
5164 /* Assume all the expressions will be constant. */
5166 *non_constant_p
= false;
5168 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>"))
5169 return error_mark_node
;
5171 /* Within a parenthesized expression, a `>' token is always
5172 the greater-than operator. */
5173 saved_greater_than_is_operator_p
5174 = parser
->greater_than_is_operator_p
;
5175 parser
->greater_than_is_operator_p
= true;
5177 /* Consume expressions until there are no more. */
5178 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
5183 /* At the beginning of attribute lists, check to see if the
5184 next token is an identifier. */
5185 if (is_attribute_list
5186 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_NAME
)
5190 /* Consume the identifier. */
5191 token
= cp_lexer_consume_token (parser
->lexer
);
5192 /* Save the identifier. */
5193 identifier
= token
->u
.value
;
5197 bool expr_non_constant_p
;
5199 /* Parse the next assignment-expression. */
5200 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
5202 /* A braced-init-list. */
5203 maybe_warn_cpp0x ("extended initializer lists");
5204 expr
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
5205 if (non_constant_p
&& expr_non_constant_p
)
5206 *non_constant_p
= true;
5208 else if (non_constant_p
)
5210 expr
= (cp_parser_constant_expression
5211 (parser
, /*allow_non_constant_p=*/true,
5212 &expr_non_constant_p
));
5213 if (expr_non_constant_p
)
5214 *non_constant_p
= true;
5217 expr
= cp_parser_assignment_expression (parser
, cast_p
, NULL
);
5220 expr
= fold_non_dependent_expr (expr
);
5222 /* If we have an ellipsis, then this is an expression
5224 if (allow_expansion_p
5225 && cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
5227 /* Consume the `...'. */
5228 cp_lexer_consume_token (parser
->lexer
);
5230 /* Build the argument pack. */
5231 expr
= make_pack_expansion (expr
);
5234 /* Add it to the list. We add error_mark_node
5235 expressions to the list, so that we can still tell if
5236 the correct form for a parenthesized expression-list
5237 is found. That gives better errors. */
5238 expression_list
= tree_cons (NULL_TREE
, expr
, expression_list
);
5240 if (expr
== error_mark_node
)
5244 /* After the first item, attribute lists look the same as
5245 expression lists. */
5246 is_attribute_list
= false;
5249 /* If the next token isn't a `,', then we are done. */
5250 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
5253 /* Otherwise, consume the `,' and keep going. */
5254 cp_lexer_consume_token (parser
->lexer
);
5257 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>"))
5262 /* We try and resync to an unnested comma, as that will give the
5263 user better diagnostics. */
5264 ending
= cp_parser_skip_to_closing_parenthesis (parser
,
5265 /*recovering=*/true,
5267 /*consume_paren=*/true);
5272 parser
->greater_than_is_operator_p
5273 = saved_greater_than_is_operator_p
;
5274 return error_mark_node
;
5278 parser
->greater_than_is_operator_p
5279 = saved_greater_than_is_operator_p
;
5281 /* We built up the list in reverse order so we must reverse it now. */
5282 expression_list
= nreverse (expression_list
);
5284 expression_list
= tree_cons (NULL_TREE
, identifier
, expression_list
);
5286 return expression_list
;
5289 /* Parse a pseudo-destructor-name.
5291 pseudo-destructor-name:
5292 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
5293 :: [opt] nested-name-specifier template template-id :: ~ type-name
5294 :: [opt] nested-name-specifier [opt] ~ type-name
5296 If either of the first two productions is used, sets *SCOPE to the
5297 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
5298 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
5299 or ERROR_MARK_NODE if the parse fails. */
5302 cp_parser_pseudo_destructor_name (cp_parser
* parser
,
5306 bool nested_name_specifier_p
;
5308 /* Assume that things will not work out. */
5309 *type
= error_mark_node
;
5311 /* Look for the optional `::' operator. */
5312 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/true);
5313 /* Look for the optional nested-name-specifier. */
5314 nested_name_specifier_p
5315 = (cp_parser_nested_name_specifier_opt (parser
,
5316 /*typename_keyword_p=*/false,
5317 /*check_dependency_p=*/true,
5319 /*is_declaration=*/false)
5321 /* Now, if we saw a nested-name-specifier, we might be doing the
5322 second production. */
5323 if (nested_name_specifier_p
5324 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
5326 /* Consume the `template' keyword. */
5327 cp_lexer_consume_token (parser
->lexer
);
5328 /* Parse the template-id. */
5329 cp_parser_template_id (parser
,
5330 /*template_keyword_p=*/true,
5331 /*check_dependency_p=*/false,
5332 /*is_declaration=*/true);
5333 /* Look for the `::' token. */
5334 cp_parser_require (parser
, CPP_SCOPE
, "%<::%>");
5336 /* If the next token is not a `~', then there might be some
5337 additional qualification. */
5338 else if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMPL
))
5340 /* At this point, we're looking for "type-name :: ~". The type-name
5341 must not be a class-name, since this is a pseudo-destructor. So,
5342 it must be either an enum-name, or a typedef-name -- both of which
5343 are just identifiers. So, we peek ahead to check that the "::"
5344 and "~" tokens are present; if they are not, then we can avoid
5345 calling type_name. */
5346 if (cp_lexer_peek_token (parser
->lexer
)->type
!= CPP_NAME
5347 || cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_SCOPE
5348 || cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
!= CPP_COMPL
)
5350 cp_parser_error (parser
, "non-scalar type");
5354 /* Look for the type-name. */
5355 *scope
= TREE_TYPE (cp_parser_nonclass_name (parser
));
5356 if (*scope
== error_mark_node
)
5359 /* Look for the `::' token. */
5360 cp_parser_require (parser
, CPP_SCOPE
, "%<::%>");
5365 /* Look for the `~'. */
5366 cp_parser_require (parser
, CPP_COMPL
, "%<~%>");
5367 /* Look for the type-name again. We are not responsible for
5368 checking that it matches the first type-name. */
5369 *type
= cp_parser_nonclass_name (parser
);
5372 /* Parse a unary-expression.
5378 unary-operator cast-expression
5379 sizeof unary-expression
5387 __extension__ cast-expression
5388 __alignof__ unary-expression
5389 __alignof__ ( type-id )
5390 __real__ cast-expression
5391 __imag__ cast-expression
5394 ADDRESS_P is true iff the unary-expression is appearing as the
5395 operand of the `&' operator. CAST_P is true if this expression is
5396 the target of a cast.
5398 Returns a representation of the expression. */
5401 cp_parser_unary_expression (cp_parser
*parser
, bool address_p
, bool cast_p
,
5405 enum tree_code unary_operator
;
5407 /* Peek at the next token. */
5408 token
= cp_lexer_peek_token (parser
->lexer
);
5409 /* Some keywords give away the kind of expression. */
5410 if (token
->type
== CPP_KEYWORD
)
5412 enum rid keyword
= token
->keyword
;
5422 op
= keyword
== RID_ALIGNOF
? ALIGNOF_EXPR
: SIZEOF_EXPR
;
5423 /* Consume the token. */
5424 cp_lexer_consume_token (parser
->lexer
);
5425 /* Parse the operand. */
5426 operand
= cp_parser_sizeof_operand (parser
, keyword
);
5428 if (TYPE_P (operand
))
5429 return cxx_sizeof_or_alignof_type (operand
, op
, true);
5431 return cxx_sizeof_or_alignof_expr (operand
, op
, true);
5435 return cp_parser_new_expression (parser
);
5438 return cp_parser_delete_expression (parser
);
5442 /* The saved value of the PEDANTIC flag. */
5446 /* Save away the PEDANTIC flag. */
5447 cp_parser_extension_opt (parser
, &saved_pedantic
);
5448 /* Parse the cast-expression. */
5449 expr
= cp_parser_simple_cast_expression (parser
);
5450 /* Restore the PEDANTIC flag. */
5451 pedantic
= saved_pedantic
;
5461 /* Consume the `__real__' or `__imag__' token. */
5462 cp_lexer_consume_token (parser
->lexer
);
5463 /* Parse the cast-expression. */
5464 expression
= cp_parser_simple_cast_expression (parser
);
5465 /* Create the complete representation. */
5466 return build_x_unary_op ((keyword
== RID_REALPART
5467 ? REALPART_EXPR
: IMAGPART_EXPR
),
5469 tf_warning_or_error
);
5478 /* Look for the `:: new' and `:: delete', which also signal the
5479 beginning of a new-expression, or delete-expression,
5480 respectively. If the next token is `::', then it might be one of
5482 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
5486 /* See if the token after the `::' is one of the keywords in
5487 which we're interested. */
5488 keyword
= cp_lexer_peek_nth_token (parser
->lexer
, 2)->keyword
;
5489 /* If it's `new', we have a new-expression. */
5490 if (keyword
== RID_NEW
)
5491 return cp_parser_new_expression (parser
);
5492 /* Similarly, for `delete'. */
5493 else if (keyword
== RID_DELETE
)
5494 return cp_parser_delete_expression (parser
);
5497 /* Look for a unary operator. */
5498 unary_operator
= cp_parser_unary_operator (token
);
5499 /* The `++' and `--' operators can be handled similarly, even though
5500 they are not technically unary-operators in the grammar. */
5501 if (unary_operator
== ERROR_MARK
)
5503 if (token
->type
== CPP_PLUS_PLUS
)
5504 unary_operator
= PREINCREMENT_EXPR
;
5505 else if (token
->type
== CPP_MINUS_MINUS
)
5506 unary_operator
= PREDECREMENT_EXPR
;
5507 /* Handle the GNU address-of-label extension. */
5508 else if (cp_parser_allow_gnu_extensions_p (parser
)
5509 && token
->type
== CPP_AND_AND
)
5513 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
5515 /* Consume the '&&' token. */
5516 cp_lexer_consume_token (parser
->lexer
);
5517 /* Look for the identifier. */
5518 identifier
= cp_parser_identifier (parser
);
5519 /* Create an expression representing the address. */
5520 expression
= finish_label_address_expr (identifier
, loc
);
5521 if (cp_parser_non_integral_constant_expression (parser
,
5522 "the address of a label"))
5523 expression
= error_mark_node
;
5527 if (unary_operator
!= ERROR_MARK
)
5529 tree cast_expression
;
5530 tree expression
= error_mark_node
;
5531 const char *non_constant_p
= NULL
;
5533 /* Consume the operator token. */
5534 token
= cp_lexer_consume_token (parser
->lexer
);
5535 /* Parse the cast-expression. */
5537 = cp_parser_cast_expression (parser
,
5538 unary_operator
== ADDR_EXPR
,
5539 /*cast_p=*/false, pidk
);
5540 /* Now, build an appropriate representation. */
5541 switch (unary_operator
)
5544 non_constant_p
= "%<*%>";
5545 expression
= build_x_indirect_ref (cast_expression
, "unary *",
5546 tf_warning_or_error
);
5550 non_constant_p
= "%<&%>";
5553 expression
= build_x_unary_op (unary_operator
, cast_expression
,
5554 tf_warning_or_error
);
5557 case PREINCREMENT_EXPR
:
5558 case PREDECREMENT_EXPR
:
5559 non_constant_p
= (unary_operator
== PREINCREMENT_EXPR
5560 ? "%<++%>" : "%<--%>");
5562 case UNARY_PLUS_EXPR
:
5564 case TRUTH_NOT_EXPR
:
5565 expression
= finish_unary_op_expr (unary_operator
, cast_expression
);
5573 && cp_parser_non_integral_constant_expression (parser
,
5575 expression
= error_mark_node
;
5580 return cp_parser_postfix_expression (parser
, address_p
, cast_p
,
5581 /*member_access_only_p=*/false,
5585 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
5586 unary-operator, the corresponding tree code is returned. */
5588 static enum tree_code
5589 cp_parser_unary_operator (cp_token
* token
)
5591 switch (token
->type
)
5594 return INDIRECT_REF
;
5600 return UNARY_PLUS_EXPR
;
5606 return TRUTH_NOT_EXPR
;
5609 return BIT_NOT_EXPR
;
5616 /* Parse a new-expression.
5619 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
5620 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
5622 Returns a representation of the expression. */
5625 cp_parser_new_expression (cp_parser
* parser
)
5627 bool global_scope_p
;
5633 /* Look for the optional `::' operator. */
5635 = (cp_parser_global_scope_opt (parser
,
5636 /*current_scope_valid_p=*/false)
5638 /* Look for the `new' operator. */
5639 cp_parser_require_keyword (parser
, RID_NEW
, "%<new%>");
5640 /* There's no easy way to tell a new-placement from the
5641 `( type-id )' construct. */
5642 cp_parser_parse_tentatively (parser
);
5643 /* Look for a new-placement. */
5644 placement
= cp_parser_new_placement (parser
);
5645 /* If that didn't work out, there's no new-placement. */
5646 if (!cp_parser_parse_definitely (parser
))
5647 placement
= NULL_TREE
;
5649 /* If the next token is a `(', then we have a parenthesized
5651 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
5654 /* Consume the `('. */
5655 cp_lexer_consume_token (parser
->lexer
);
5656 /* Parse the type-id. */
5657 type
= cp_parser_type_id (parser
);
5658 /* Look for the closing `)'. */
5659 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
5660 token
= cp_lexer_peek_token (parser
->lexer
);
5661 /* There should not be a direct-new-declarator in this production,
5662 but GCC used to allowed this, so we check and emit a sensible error
5663 message for this case. */
5664 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
5666 error ("%Harray bound forbidden after parenthesized type-id",
5668 inform (token
->location
,
5669 "try removing the parentheses around the type-id");
5670 cp_parser_direct_new_declarator (parser
);
5674 /* Otherwise, there must be a new-type-id. */
5676 type
= cp_parser_new_type_id (parser
, &nelts
);
5678 /* If the next token is a `(' or '{', then we have a new-initializer. */
5679 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
)
5680 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
5681 initializer
= cp_parser_new_initializer (parser
);
5683 initializer
= NULL_TREE
;
5685 /* A new-expression may not appear in an integral constant
5687 if (cp_parser_non_integral_constant_expression (parser
, "%<new%>"))
5688 return error_mark_node
;
5690 /* Create a representation of the new-expression. */
5691 return build_new (placement
, type
, nelts
, initializer
, global_scope_p
,
5692 tf_warning_or_error
);
5695 /* Parse a new-placement.
5700 Returns the same representation as for an expression-list. */
5703 cp_parser_new_placement (cp_parser
* parser
)
5705 tree expression_list
;
5707 /* Parse the expression-list. */
5708 expression_list
= (cp_parser_parenthesized_expression_list
5709 (parser
, false, /*cast_p=*/false, /*allow_expansion_p=*/true,
5710 /*non_constant_p=*/NULL
));
5712 return expression_list
;
5715 /* Parse a new-type-id.
5718 type-specifier-seq new-declarator [opt]
5720 Returns the TYPE allocated. If the new-type-id indicates an array
5721 type, *NELTS is set to the number of elements in the last array
5722 bound; the TYPE will not include the last array bound. */
5725 cp_parser_new_type_id (cp_parser
* parser
, tree
*nelts
)
5727 cp_decl_specifier_seq type_specifier_seq
;
5728 cp_declarator
*new_declarator
;
5729 cp_declarator
*declarator
;
5730 cp_declarator
*outer_declarator
;
5731 const char *saved_message
;
5734 /* The type-specifier sequence must not contain type definitions.
5735 (It cannot contain declarations of new types either, but if they
5736 are not definitions we will catch that because they are not
5738 saved_message
= parser
->type_definition_forbidden_message
;
5739 parser
->type_definition_forbidden_message
5740 = "types may not be defined in a new-type-id";
5741 /* Parse the type-specifier-seq. */
5742 cp_parser_type_specifier_seq (parser
, /*is_condition=*/false,
5743 &type_specifier_seq
);
5744 /* Restore the old message. */
5745 parser
->type_definition_forbidden_message
= saved_message
;
5746 /* Parse the new-declarator. */
5747 new_declarator
= cp_parser_new_declarator_opt (parser
);
5749 /* Determine the number of elements in the last array dimension, if
5752 /* Skip down to the last array dimension. */
5753 declarator
= new_declarator
;
5754 outer_declarator
= NULL
;
5755 while (declarator
&& (declarator
->kind
== cdk_pointer
5756 || declarator
->kind
== cdk_ptrmem
))
5758 outer_declarator
= declarator
;
5759 declarator
= declarator
->declarator
;
5762 && declarator
->kind
== cdk_array
5763 && declarator
->declarator
5764 && declarator
->declarator
->kind
== cdk_array
)
5766 outer_declarator
= declarator
;
5767 declarator
= declarator
->declarator
;
5770 if (declarator
&& declarator
->kind
== cdk_array
)
5772 *nelts
= declarator
->u
.array
.bounds
;
5773 if (*nelts
== error_mark_node
)
5774 *nelts
= integer_one_node
;
5776 if (outer_declarator
)
5777 outer_declarator
->declarator
= declarator
->declarator
;
5779 new_declarator
= NULL
;
5782 type
= groktypename (&type_specifier_seq
, new_declarator
, false);
5786 /* Parse an (optional) new-declarator.
5789 ptr-operator new-declarator [opt]
5790 direct-new-declarator
5792 Returns the declarator. */
5794 static cp_declarator
*
5795 cp_parser_new_declarator_opt (cp_parser
* parser
)
5797 enum tree_code code
;
5799 cp_cv_quals cv_quals
;
5801 /* We don't know if there's a ptr-operator next, or not. */
5802 cp_parser_parse_tentatively (parser
);
5803 /* Look for a ptr-operator. */
5804 code
= cp_parser_ptr_operator (parser
, &type
, &cv_quals
);
5805 /* If that worked, look for more new-declarators. */
5806 if (cp_parser_parse_definitely (parser
))
5808 cp_declarator
*declarator
;
5810 /* Parse another optional declarator. */
5811 declarator
= cp_parser_new_declarator_opt (parser
);
5813 return cp_parser_make_indirect_declarator
5814 (code
, type
, cv_quals
, declarator
);
5817 /* If the next token is a `[', there is a direct-new-declarator. */
5818 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
5819 return cp_parser_direct_new_declarator (parser
);
5824 /* Parse a direct-new-declarator.
5826 direct-new-declarator:
5828 direct-new-declarator [constant-expression]
5832 static cp_declarator
*
5833 cp_parser_direct_new_declarator (cp_parser
* parser
)
5835 cp_declarator
*declarator
= NULL
;
5841 /* Look for the opening `['. */
5842 cp_parser_require (parser
, CPP_OPEN_SQUARE
, "%<[%>");
5843 /* The first expression is not required to be constant. */
5846 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
5847 expression
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
5848 /* The standard requires that the expression have integral
5849 type. DR 74 adds enumeration types. We believe that the
5850 real intent is that these expressions be handled like the
5851 expression in a `switch' condition, which also allows
5852 classes with a single conversion to integral or
5853 enumeration type. */
5854 if (!processing_template_decl
)
5857 = build_expr_type_conversion (WANT_INT
| WANT_ENUM
,
5862 error ("%Hexpression in new-declarator must have integral "
5863 "or enumeration type", &token
->location
);
5864 expression
= error_mark_node
;
5868 /* But all the other expressions must be. */
5871 = cp_parser_constant_expression (parser
,
5872 /*allow_non_constant=*/false,
5874 /* Look for the closing `]'. */
5875 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, "%<]%>");
5877 /* Add this bound to the declarator. */
5878 declarator
= make_array_declarator (declarator
, expression
);
5880 /* If the next token is not a `[', then there are no more
5882 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_SQUARE
))
5889 /* Parse a new-initializer.
5892 ( expression-list [opt] )
5895 Returns a representation of the expression-list. If there is no
5896 expression-list, VOID_ZERO_NODE is returned. */
5899 cp_parser_new_initializer (cp_parser
* parser
)
5901 tree expression_list
;
5903 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
5905 bool expr_non_constant_p
;
5906 maybe_warn_cpp0x ("extended initializer lists");
5907 expression_list
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
5908 CONSTRUCTOR_IS_DIRECT_INIT (expression_list
) = 1;
5909 expression_list
= build_tree_list (NULL_TREE
, expression_list
);
5912 expression_list
= (cp_parser_parenthesized_expression_list
5913 (parser
, false, /*cast_p=*/false, /*allow_expansion_p=*/true,
5914 /*non_constant_p=*/NULL
));
5915 if (!expression_list
)
5916 expression_list
= void_zero_node
;
5918 return expression_list
;
5921 /* Parse a delete-expression.
5924 :: [opt] delete cast-expression
5925 :: [opt] delete [ ] cast-expression
5927 Returns a representation of the expression. */
5930 cp_parser_delete_expression (cp_parser
* parser
)
5932 bool global_scope_p
;
5936 /* Look for the optional `::' operator. */
5938 = (cp_parser_global_scope_opt (parser
,
5939 /*current_scope_valid_p=*/false)
5941 /* Look for the `delete' keyword. */
5942 cp_parser_require_keyword (parser
, RID_DELETE
, "%<delete%>");
5943 /* See if the array syntax is in use. */
5944 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
5946 /* Consume the `[' token. */
5947 cp_lexer_consume_token (parser
->lexer
);
5948 /* Look for the `]' token. */
5949 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, "%<]%>");
5950 /* Remember that this is the `[]' construct. */
5956 /* Parse the cast-expression. */
5957 expression
= cp_parser_simple_cast_expression (parser
);
5959 /* A delete-expression may not appear in an integral constant
5961 if (cp_parser_non_integral_constant_expression (parser
, "%<delete%>"))
5962 return error_mark_node
;
5964 return delete_sanity (expression
, NULL_TREE
, array_p
, global_scope_p
);
5967 /* Returns true if TOKEN may start a cast-expression and false
5971 cp_parser_token_starts_cast_expression (cp_token
*token
)
5973 switch (token
->type
)
5979 case CPP_CLOSE_SQUARE
:
5980 case CPP_CLOSE_PAREN
:
5981 case CPP_CLOSE_BRACE
:
5985 case CPP_DEREF_STAR
:
5993 case CPP_GREATER_EQ
:
6013 /* '[' may start a primary-expression in obj-c++. */
6014 case CPP_OPEN_SQUARE
:
6015 return c_dialect_objc ();
6022 /* Parse a cast-expression.
6026 ( type-id ) cast-expression
6028 ADDRESS_P is true iff the unary-expression is appearing as the
6029 operand of the `&' operator. CAST_P is true if this expression is
6030 the target of a cast.
6032 Returns a representation of the expression. */
6035 cp_parser_cast_expression (cp_parser
*parser
, bool address_p
, bool cast_p
,
6038 /* If it's a `(', then we might be looking at a cast. */
6039 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
6041 tree type
= NULL_TREE
;
6042 tree expr
= NULL_TREE
;
6043 bool compound_literal_p
;
6044 const char *saved_message
;
6046 /* There's no way to know yet whether or not this is a cast.
6047 For example, `(int (3))' is a unary-expression, while `(int)
6048 3' is a cast. So, we resort to parsing tentatively. */
6049 cp_parser_parse_tentatively (parser
);
6050 /* Types may not be defined in a cast. */
6051 saved_message
= parser
->type_definition_forbidden_message
;
6052 parser
->type_definition_forbidden_message
6053 = "types may not be defined in casts";
6054 /* Consume the `('. */
6055 cp_lexer_consume_token (parser
->lexer
);
6056 /* A very tricky bit is that `(struct S) { 3 }' is a
6057 compound-literal (which we permit in C++ as an extension).
6058 But, that construct is not a cast-expression -- it is a
6059 postfix-expression. (The reason is that `(struct S) { 3 }.i'
6060 is legal; if the compound-literal were a cast-expression,
6061 you'd need an extra set of parentheses.) But, if we parse
6062 the type-id, and it happens to be a class-specifier, then we
6063 will commit to the parse at that point, because we cannot
6064 undo the action that is done when creating a new class. So,
6065 then we cannot back up and do a postfix-expression.
6067 Therefore, we scan ahead to the closing `)', and check to see
6068 if the token after the `)' is a `{'. If so, we are not
6069 looking at a cast-expression.
6071 Save tokens so that we can put them back. */
6072 cp_lexer_save_tokens (parser
->lexer
);
6073 /* Skip tokens until the next token is a closing parenthesis.
6074 If we find the closing `)', and the next token is a `{', then
6075 we are looking at a compound-literal. */
6077 = (cp_parser_skip_to_closing_parenthesis (parser
, false, false,
6078 /*consume_paren=*/true)
6079 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
));
6080 /* Roll back the tokens we skipped. */
6081 cp_lexer_rollback_tokens (parser
->lexer
);
6082 /* If we were looking at a compound-literal, simulate an error
6083 so that the call to cp_parser_parse_definitely below will
6085 if (compound_literal_p
)
6086 cp_parser_simulate_error (parser
);
6089 bool saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
6090 parser
->in_type_id_in_expr_p
= true;
6091 /* Look for the type-id. */
6092 type
= cp_parser_type_id (parser
);
6093 /* Look for the closing `)'. */
6094 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
6095 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
6098 /* Restore the saved message. */
6099 parser
->type_definition_forbidden_message
= saved_message
;
6101 /* At this point this can only be either a cast or a
6102 parenthesized ctor such as `(T ())' that looks like a cast to
6103 function returning T. */
6104 if (!cp_parser_error_occurred (parser
)
6105 && cp_parser_token_starts_cast_expression (cp_lexer_peek_token
6108 cp_parser_parse_definitely (parser
);
6109 expr
= cp_parser_cast_expression (parser
,
6110 /*address_p=*/false,
6111 /*cast_p=*/true, pidk
);
6113 /* Warn about old-style casts, if so requested. */
6114 if (warn_old_style_cast
6115 && !in_system_header
6116 && !VOID_TYPE_P (type
)
6117 && current_lang_name
!= lang_name_c
)
6118 warning (OPT_Wold_style_cast
, "use of old-style cast");
6120 /* Only type conversions to integral or enumeration types
6121 can be used in constant-expressions. */
6122 if (!cast_valid_in_integral_constant_expression_p (type
)
6123 && (cp_parser_non_integral_constant_expression
6125 "a cast to a type other than an integral or "
6126 "enumeration type")))
6127 return error_mark_node
;
6129 /* Perform the cast. */
6130 expr
= build_c_cast (type
, expr
);
6134 cp_parser_abort_tentative_parse (parser
);
6137 /* If we get here, then it's not a cast, so it must be a
6138 unary-expression. */
6139 return cp_parser_unary_expression (parser
, address_p
, cast_p
, pidk
);
6142 /* Parse a binary expression of the general form:
6146 pm-expression .* cast-expression
6147 pm-expression ->* cast-expression
6149 multiplicative-expression:
6151 multiplicative-expression * pm-expression
6152 multiplicative-expression / pm-expression
6153 multiplicative-expression % pm-expression
6155 additive-expression:
6156 multiplicative-expression
6157 additive-expression + multiplicative-expression
6158 additive-expression - multiplicative-expression
6162 shift-expression << additive-expression
6163 shift-expression >> additive-expression
6165 relational-expression:
6167 relational-expression < shift-expression
6168 relational-expression > shift-expression
6169 relational-expression <= shift-expression
6170 relational-expression >= shift-expression
6174 relational-expression:
6175 relational-expression <? shift-expression
6176 relational-expression >? shift-expression
6178 equality-expression:
6179 relational-expression
6180 equality-expression == relational-expression
6181 equality-expression != relational-expression
6185 and-expression & equality-expression
6187 exclusive-or-expression:
6189 exclusive-or-expression ^ and-expression
6191 inclusive-or-expression:
6192 exclusive-or-expression
6193 inclusive-or-expression | exclusive-or-expression
6195 logical-and-expression:
6196 inclusive-or-expression
6197 logical-and-expression && inclusive-or-expression
6199 logical-or-expression:
6200 logical-and-expression
6201 logical-or-expression || logical-and-expression
6203 All these are implemented with a single function like:
6206 simple-cast-expression
6207 binary-expression <token> binary-expression
6209 CAST_P is true if this expression is the target of a cast.
6211 The binops_by_token map is used to get the tree codes for each <token> type.
6212 binary-expressions are associated according to a precedence table. */
6214 #define TOKEN_PRECEDENCE(token) \
6215 (((token->type == CPP_GREATER \
6216 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
6217 && !parser->greater_than_is_operator_p) \
6218 ? PREC_NOT_OPERATOR \
6219 : binops_by_token[token->type].prec)
6222 cp_parser_binary_expression (cp_parser
* parser
, bool cast_p
,
6223 bool no_toplevel_fold_p
,
6224 enum cp_parser_prec prec
,
6227 cp_parser_expression_stack stack
;
6228 cp_parser_expression_stack_entry
*sp
= &stack
[0];
6231 enum tree_code tree_type
, lhs_type
, rhs_type
;
6232 enum cp_parser_prec new_prec
, lookahead_prec
;
6235 /* Parse the first expression. */
6236 lhs
= cp_parser_cast_expression (parser
, /*address_p=*/false, cast_p
, pidk
);
6237 lhs_type
= ERROR_MARK
;
6241 /* Get an operator token. */
6242 token
= cp_lexer_peek_token (parser
->lexer
);
6244 if (warn_cxx0x_compat
6245 && token
->type
== CPP_RSHIFT
6246 && !parser
->greater_than_is_operator_p
)
6248 warning (OPT_Wc__0x_compat
,
6249 "%H%<>>%> operator will be treated as two right angle brackets in C++0x",
6251 warning (OPT_Wc__0x_compat
,
6252 "suggest parentheses around %<>>%> expression");
6255 new_prec
= TOKEN_PRECEDENCE (token
);
6257 /* Popping an entry off the stack means we completed a subexpression:
6258 - either we found a token which is not an operator (`>' where it is not
6259 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
6260 will happen repeatedly;
6261 - or, we found an operator which has lower priority. This is the case
6262 where the recursive descent *ascends*, as in `3 * 4 + 5' after
6264 if (new_prec
<= prec
)
6273 tree_type
= binops_by_token
[token
->type
].tree_type
;
6275 /* We used the operator token. */
6276 cp_lexer_consume_token (parser
->lexer
);
6278 /* Extract another operand. It may be the RHS of this expression
6279 or the LHS of a new, higher priority expression. */
6280 rhs
= cp_parser_simple_cast_expression (parser
);
6281 rhs_type
= ERROR_MARK
;
6283 /* Get another operator token. Look up its precedence to avoid
6284 building a useless (immediately popped) stack entry for common
6285 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
6286 token
= cp_lexer_peek_token (parser
->lexer
);
6287 lookahead_prec
= TOKEN_PRECEDENCE (token
);
6288 if (lookahead_prec
> new_prec
)
6290 /* ... and prepare to parse the RHS of the new, higher priority
6291 expression. Since precedence levels on the stack are
6292 monotonically increasing, we do not have to care about
6295 sp
->tree_type
= tree_type
;
6297 sp
->lhs_type
= lhs_type
;
6300 lhs_type
= rhs_type
;
6302 new_prec
= lookahead_prec
;
6306 lookahead_prec
= new_prec
;
6307 /* If the stack is not empty, we have parsed into LHS the right side
6308 (`4' in the example above) of an expression we had suspended.
6309 We can use the information on the stack to recover the LHS (`3')
6310 from the stack together with the tree code (`MULT_EXPR'), and
6311 the precedence of the higher level subexpression
6312 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
6313 which will be used to actually build the additive expression. */
6316 tree_type
= sp
->tree_type
;
6318 rhs_type
= lhs_type
;
6320 lhs_type
= sp
->lhs_type
;
6323 overloaded_p
= false;
6324 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
6325 ERROR_MARK for everything that is not a binary expression.
6326 This makes warn_about_parentheses miss some warnings that
6327 involve unary operators. For unary expressions we should
6328 pass the correct tree_code unless the unary expression was
6329 surrounded by parentheses.
6331 if (no_toplevel_fold_p
6332 && lookahead_prec
<= prec
6334 && TREE_CODE_CLASS (tree_type
) == tcc_comparison
)
6335 lhs
= build2 (tree_type
, boolean_type_node
, lhs
, rhs
);
6337 lhs
= build_x_binary_op (tree_type
, lhs
, lhs_type
, rhs
, rhs_type
,
6338 &overloaded_p
, tf_warning_or_error
);
6339 lhs_type
= tree_type
;
6341 /* If the binary operator required the use of an overloaded operator,
6342 then this expression cannot be an integral constant-expression.
6343 An overloaded operator can be used even if both operands are
6344 otherwise permissible in an integral constant-expression if at
6345 least one of the operands is of enumeration type. */
6348 && (cp_parser_non_integral_constant_expression
6349 (parser
, "calls to overloaded operators")))
6350 return error_mark_node
;
6357 /* Parse the `? expression : assignment-expression' part of a
6358 conditional-expression. The LOGICAL_OR_EXPR is the
6359 logical-or-expression that started the conditional-expression.
6360 Returns a representation of the entire conditional-expression.
6362 This routine is used by cp_parser_assignment_expression.
6364 ? expression : assignment-expression
6368 ? : assignment-expression */
6371 cp_parser_question_colon_clause (cp_parser
* parser
, tree logical_or_expr
)
6374 tree assignment_expr
;
6376 /* Consume the `?' token. */
6377 cp_lexer_consume_token (parser
->lexer
);
6378 if (cp_parser_allow_gnu_extensions_p (parser
)
6379 && cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
6380 /* Implicit true clause. */
6383 /* Parse the expression. */
6384 expr
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
6386 /* The next token should be a `:'. */
6387 cp_parser_require (parser
, CPP_COLON
, "%<:%>");
6388 /* Parse the assignment-expression. */
6389 assignment_expr
= cp_parser_assignment_expression (parser
, /*cast_p=*/false, NULL
);
6391 /* Build the conditional-expression. */
6392 return build_x_conditional_expr (logical_or_expr
,
6395 tf_warning_or_error
);
6398 /* Parse an assignment-expression.
6400 assignment-expression:
6401 conditional-expression
6402 logical-or-expression assignment-operator assignment_expression
6405 CAST_P is true if this expression is the target of a cast.
6407 Returns a representation for the expression. */
6410 cp_parser_assignment_expression (cp_parser
* parser
, bool cast_p
,
6415 /* If the next token is the `throw' keyword, then we're looking at
6416 a throw-expression. */
6417 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_THROW
))
6418 expr
= cp_parser_throw_expression (parser
);
6419 /* Otherwise, it must be that we are looking at a
6420 logical-or-expression. */
6423 /* Parse the binary expressions (logical-or-expression). */
6424 expr
= cp_parser_binary_expression (parser
, cast_p
, false,
6425 PREC_NOT_OPERATOR
, pidk
);
6426 /* If the next token is a `?' then we're actually looking at a
6427 conditional-expression. */
6428 if (cp_lexer_next_token_is (parser
->lexer
, CPP_QUERY
))
6429 return cp_parser_question_colon_clause (parser
, expr
);
6432 enum tree_code assignment_operator
;
6434 /* If it's an assignment-operator, we're using the second
6437 = cp_parser_assignment_operator_opt (parser
);
6438 if (assignment_operator
!= ERROR_MARK
)
6440 bool non_constant_p
;
6442 /* Parse the right-hand side of the assignment. */
6443 tree rhs
= cp_parser_initializer_clause (parser
, &non_constant_p
);
6445 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
6446 maybe_warn_cpp0x ("extended initializer lists");
6448 /* An assignment may not appear in a
6449 constant-expression. */
6450 if (cp_parser_non_integral_constant_expression (parser
,
6452 return error_mark_node
;
6453 /* Build the assignment expression. */
6454 expr
= build_x_modify_expr (expr
,
6455 assignment_operator
,
6457 tf_warning_or_error
);
6465 /* Parse an (optional) assignment-operator.
6467 assignment-operator: one of
6468 = *= /= %= += -= >>= <<= &= ^= |=
6472 assignment-operator: one of
6475 If the next token is an assignment operator, the corresponding tree
6476 code is returned, and the token is consumed. For example, for
6477 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
6478 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
6479 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
6480 operator, ERROR_MARK is returned. */
6482 static enum tree_code
6483 cp_parser_assignment_operator_opt (cp_parser
* parser
)
6488 /* Peek at the next token. */
6489 token
= cp_lexer_peek_token (parser
->lexer
);
6491 switch (token
->type
)
6502 op
= TRUNC_DIV_EXPR
;
6506 op
= TRUNC_MOD_EXPR
;
6538 /* Nothing else is an assignment operator. */
6542 /* If it was an assignment operator, consume it. */
6543 if (op
!= ERROR_MARK
)
6544 cp_lexer_consume_token (parser
->lexer
);
6549 /* Parse an expression.
6552 assignment-expression
6553 expression , assignment-expression
6555 CAST_P is true if this expression is the target of a cast.
6557 Returns a representation of the expression. */
6560 cp_parser_expression (cp_parser
* parser
, bool cast_p
, cp_id_kind
* pidk
)
6562 tree expression
= NULL_TREE
;
6566 tree assignment_expression
;
6568 /* Parse the next assignment-expression. */
6569 assignment_expression
6570 = cp_parser_assignment_expression (parser
, cast_p
, pidk
);
6571 /* If this is the first assignment-expression, we can just
6574 expression
= assignment_expression
;
6576 expression
= build_x_compound_expr (expression
,
6577 assignment_expression
,
6578 tf_warning_or_error
);
6579 /* If the next token is not a comma, then we are done with the
6581 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
6583 /* Consume the `,'. */
6584 cp_lexer_consume_token (parser
->lexer
);
6585 /* A comma operator cannot appear in a constant-expression. */
6586 if (cp_parser_non_integral_constant_expression (parser
,
6587 "a comma operator"))
6588 expression
= error_mark_node
;
6594 /* Parse a constant-expression.
6596 constant-expression:
6597 conditional-expression
6599 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
6600 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
6601 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
6602 is false, NON_CONSTANT_P should be NULL. */
6605 cp_parser_constant_expression (cp_parser
* parser
,
6606 bool allow_non_constant_p
,
6607 bool *non_constant_p
)
6609 bool saved_integral_constant_expression_p
;
6610 bool saved_allow_non_integral_constant_expression_p
;
6611 bool saved_non_integral_constant_expression_p
;
6614 /* It might seem that we could simply parse the
6615 conditional-expression, and then check to see if it were
6616 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
6617 one that the compiler can figure out is constant, possibly after
6618 doing some simplifications or optimizations. The standard has a
6619 precise definition of constant-expression, and we must honor
6620 that, even though it is somewhat more restrictive.
6626 is not a legal declaration, because `(2, 3)' is not a
6627 constant-expression. The `,' operator is forbidden in a
6628 constant-expression. However, GCC's constant-folding machinery
6629 will fold this operation to an INTEGER_CST for `3'. */
6631 /* Save the old settings. */
6632 saved_integral_constant_expression_p
= parser
->integral_constant_expression_p
;
6633 saved_allow_non_integral_constant_expression_p
6634 = parser
->allow_non_integral_constant_expression_p
;
6635 saved_non_integral_constant_expression_p
= parser
->non_integral_constant_expression_p
;
6636 /* We are now parsing a constant-expression. */
6637 parser
->integral_constant_expression_p
= true;
6638 parser
->allow_non_integral_constant_expression_p
= allow_non_constant_p
;
6639 parser
->non_integral_constant_expression_p
= false;
6640 /* Although the grammar says "conditional-expression", we parse an
6641 "assignment-expression", which also permits "throw-expression"
6642 and the use of assignment operators. In the case that
6643 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
6644 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
6645 actually essential that we look for an assignment-expression.
6646 For example, cp_parser_initializer_clauses uses this function to
6647 determine whether a particular assignment-expression is in fact
6649 expression
= cp_parser_assignment_expression (parser
, /*cast_p=*/false, NULL
);
6650 /* Restore the old settings. */
6651 parser
->integral_constant_expression_p
6652 = saved_integral_constant_expression_p
;
6653 parser
->allow_non_integral_constant_expression_p
6654 = saved_allow_non_integral_constant_expression_p
;
6655 if (allow_non_constant_p
)
6656 *non_constant_p
= parser
->non_integral_constant_expression_p
;
6657 else if (parser
->non_integral_constant_expression_p
)
6658 expression
= error_mark_node
;
6659 parser
->non_integral_constant_expression_p
6660 = saved_non_integral_constant_expression_p
;
6665 /* Parse __builtin_offsetof.
6667 offsetof-expression:
6668 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
6670 offsetof-member-designator:
6672 | offsetof-member-designator "." id-expression
6673 | offsetof-member-designator "[" expression "]"
6674 | offsetof-member-designator "->" id-expression */
6677 cp_parser_builtin_offsetof (cp_parser
*parser
)
6679 int save_ice_p
, save_non_ice_p
;
6684 /* We're about to accept non-integral-constant things, but will
6685 definitely yield an integral constant expression. Save and
6686 restore these values around our local parsing. */
6687 save_ice_p
= parser
->integral_constant_expression_p
;
6688 save_non_ice_p
= parser
->non_integral_constant_expression_p
;
6690 /* Consume the "__builtin_offsetof" token. */
6691 cp_lexer_consume_token (parser
->lexer
);
6692 /* Consume the opening `('. */
6693 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
6694 /* Parse the type-id. */
6695 type
= cp_parser_type_id (parser
);
6696 /* Look for the `,'. */
6697 cp_parser_require (parser
, CPP_COMMA
, "%<,%>");
6698 token
= cp_lexer_peek_token (parser
->lexer
);
6700 /* Build the (type *)null that begins the traditional offsetof macro. */
6701 expr
= build_static_cast (build_pointer_type (type
), null_pointer_node
,
6702 tf_warning_or_error
);
6704 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
6705 expr
= cp_parser_postfix_dot_deref_expression (parser
, CPP_DEREF
, expr
,
6706 true, &dummy
, token
->location
);
6709 token
= cp_lexer_peek_token (parser
->lexer
);
6710 switch (token
->type
)
6712 case CPP_OPEN_SQUARE
:
6713 /* offsetof-member-designator "[" expression "]" */
6714 expr
= cp_parser_postfix_open_square_expression (parser
, expr
, true);
6718 /* offsetof-member-designator "->" identifier */
6719 expr
= grok_array_decl (expr
, integer_zero_node
);
6723 /* offsetof-member-designator "." identifier */
6724 cp_lexer_consume_token (parser
->lexer
);
6725 expr
= cp_parser_postfix_dot_deref_expression (parser
, CPP_DOT
,
6730 case CPP_CLOSE_PAREN
:
6731 /* Consume the ")" token. */
6732 cp_lexer_consume_token (parser
->lexer
);
6736 /* Error. We know the following require will fail, but
6737 that gives the proper error message. */
6738 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
6739 cp_parser_skip_to_closing_parenthesis (parser
, true, false, true);
6740 expr
= error_mark_node
;
6746 /* If we're processing a template, we can't finish the semantics yet.
6747 Otherwise we can fold the entire expression now. */
6748 if (processing_template_decl
)
6749 expr
= build1 (OFFSETOF_EXPR
, size_type_node
, expr
);
6751 expr
= finish_offsetof (expr
);
6754 parser
->integral_constant_expression_p
= save_ice_p
;
6755 parser
->non_integral_constant_expression_p
= save_non_ice_p
;
6760 /* Parse a trait expression. */
6763 cp_parser_trait_expr (cp_parser
* parser
, enum rid keyword
)
6766 tree type1
, type2
= NULL_TREE
;
6767 bool binary
= false;
6768 cp_decl_specifier_seq decl_specs
;
6772 case RID_HAS_NOTHROW_ASSIGN
:
6773 kind
= CPTK_HAS_NOTHROW_ASSIGN
;
6775 case RID_HAS_NOTHROW_CONSTRUCTOR
:
6776 kind
= CPTK_HAS_NOTHROW_CONSTRUCTOR
;
6778 case RID_HAS_NOTHROW_COPY
:
6779 kind
= CPTK_HAS_NOTHROW_COPY
;
6781 case RID_HAS_TRIVIAL_ASSIGN
:
6782 kind
= CPTK_HAS_TRIVIAL_ASSIGN
;
6784 case RID_HAS_TRIVIAL_CONSTRUCTOR
:
6785 kind
= CPTK_HAS_TRIVIAL_CONSTRUCTOR
;
6787 case RID_HAS_TRIVIAL_COPY
:
6788 kind
= CPTK_HAS_TRIVIAL_COPY
;
6790 case RID_HAS_TRIVIAL_DESTRUCTOR
:
6791 kind
= CPTK_HAS_TRIVIAL_DESTRUCTOR
;
6793 case RID_HAS_VIRTUAL_DESTRUCTOR
:
6794 kind
= CPTK_HAS_VIRTUAL_DESTRUCTOR
;
6796 case RID_IS_ABSTRACT
:
6797 kind
= CPTK_IS_ABSTRACT
;
6799 case RID_IS_BASE_OF
:
6800 kind
= CPTK_IS_BASE_OF
;
6804 kind
= CPTK_IS_CLASS
;
6806 case RID_IS_CONVERTIBLE_TO
:
6807 kind
= CPTK_IS_CONVERTIBLE_TO
;
6811 kind
= CPTK_IS_EMPTY
;
6814 kind
= CPTK_IS_ENUM
;
6819 case RID_IS_POLYMORPHIC
:
6820 kind
= CPTK_IS_POLYMORPHIC
;
6823 kind
= CPTK_IS_UNION
;
6829 /* Consume the token. */
6830 cp_lexer_consume_token (parser
->lexer
);
6832 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
6834 type1
= cp_parser_type_id (parser
);
6836 if (type1
== error_mark_node
)
6837 return error_mark_node
;
6839 /* Build a trivial decl-specifier-seq. */
6840 clear_decl_specs (&decl_specs
);
6841 decl_specs
.type
= type1
;
6843 /* Call grokdeclarator to figure out what type this is. */
6844 type1
= grokdeclarator (NULL
, &decl_specs
, TYPENAME
,
6845 /*initialized=*/0, /*attrlist=*/NULL
);
6849 cp_parser_require (parser
, CPP_COMMA
, "%<,%>");
6851 type2
= cp_parser_type_id (parser
);
6853 if (type2
== error_mark_node
)
6854 return error_mark_node
;
6856 /* Build a trivial decl-specifier-seq. */
6857 clear_decl_specs (&decl_specs
);
6858 decl_specs
.type
= type2
;
6860 /* Call grokdeclarator to figure out what type this is. */
6861 type2
= grokdeclarator (NULL
, &decl_specs
, TYPENAME
,
6862 /*initialized=*/0, /*attrlist=*/NULL
);
6865 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
6867 /* Complete the trait expression, which may mean either processing
6868 the trait expr now or saving it for template instantiation. */
6869 return finish_trait_expr (kind
, type1
, type2
);
6872 /* Statements [gram.stmt.stmt] */
6874 /* Parse a statement.
6878 expression-statement
6883 declaration-statement
6886 IN_COMPOUND is true when the statement is nested inside a
6887 cp_parser_compound_statement; this matters for certain pragmas.
6889 If IF_P is not NULL, *IF_P is set to indicate whether the statement
6890 is a (possibly labeled) if statement which is not enclosed in braces
6891 and has an else clause. This is used to implement -Wparentheses. */
6894 cp_parser_statement (cp_parser
* parser
, tree in_statement_expr
,
6895 bool in_compound
, bool *if_p
)
6899 location_t statement_location
;
6904 /* There is no statement yet. */
6905 statement
= NULL_TREE
;
6906 /* Peek at the next token. */
6907 token
= cp_lexer_peek_token (parser
->lexer
);
6908 /* Remember the location of the first token in the statement. */
6909 statement_location
= token
->location
;
6910 /* If this is a keyword, then that will often determine what kind of
6911 statement we have. */
6912 if (token
->type
== CPP_KEYWORD
)
6914 enum rid keyword
= token
->keyword
;
6920 /* Looks like a labeled-statement with a case label.
6921 Parse the label, and then use tail recursion to parse
6923 cp_parser_label_for_labeled_statement (parser
);
6928 statement
= cp_parser_selection_statement (parser
, if_p
);
6934 statement
= cp_parser_iteration_statement (parser
);
6941 statement
= cp_parser_jump_statement (parser
);
6944 /* Objective-C++ exception-handling constructs. */
6947 case RID_AT_FINALLY
:
6948 case RID_AT_SYNCHRONIZED
:
6950 statement
= cp_parser_objc_statement (parser
);
6954 statement
= cp_parser_try_block (parser
);
6958 /* This must be a namespace alias definition. */
6959 cp_parser_declaration_statement (parser
);
6963 /* It might be a keyword like `int' that can start a
6964 declaration-statement. */
6968 else if (token
->type
== CPP_NAME
)
6970 /* If the next token is a `:', then we are looking at a
6971 labeled-statement. */
6972 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
6973 if (token
->type
== CPP_COLON
)
6975 /* Looks like a labeled-statement with an ordinary label.
6976 Parse the label, and then use tail recursion to parse
6978 cp_parser_label_for_labeled_statement (parser
);
6982 /* Anything that starts with a `{' must be a compound-statement. */
6983 else if (token
->type
== CPP_OPEN_BRACE
)
6984 statement
= cp_parser_compound_statement (parser
, NULL
, false);
6985 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
6986 a statement all its own. */
6987 else if (token
->type
== CPP_PRAGMA
)
6989 /* Only certain OpenMP pragmas are attached to statements, and thus
6990 are considered statements themselves. All others are not. In
6991 the context of a compound, accept the pragma as a "statement" and
6992 return so that we can check for a close brace. Otherwise we
6993 require a real statement and must go back and read one. */
6995 cp_parser_pragma (parser
, pragma_compound
);
6996 else if (!cp_parser_pragma (parser
, pragma_stmt
))
7000 else if (token
->type
== CPP_EOF
)
7002 cp_parser_error (parser
, "expected statement");
7006 /* Everything else must be a declaration-statement or an
7007 expression-statement. Try for the declaration-statement
7008 first, unless we are looking at a `;', in which case we know that
7009 we have an expression-statement. */
7012 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
7014 cp_parser_parse_tentatively (parser
);
7015 /* Try to parse the declaration-statement. */
7016 cp_parser_declaration_statement (parser
);
7017 /* If that worked, we're done. */
7018 if (cp_parser_parse_definitely (parser
))
7021 /* Look for an expression-statement instead. */
7022 statement
= cp_parser_expression_statement (parser
, in_statement_expr
);
7025 /* Set the line number for the statement. */
7026 if (statement
&& STATEMENT_CODE_P (TREE_CODE (statement
)))
7027 SET_EXPR_LOCATION (statement
, statement_location
);
7030 /* Parse the label for a labeled-statement, i.e.
7033 case constant-expression :
7037 case constant-expression ... constant-expression : statement
7039 When a label is parsed without errors, the label is added to the
7040 parse tree by the finish_* functions, so this function doesn't
7041 have to return the label. */
7044 cp_parser_label_for_labeled_statement (cp_parser
* parser
)
7048 /* The next token should be an identifier. */
7049 token
= cp_lexer_peek_token (parser
->lexer
);
7050 if (token
->type
!= CPP_NAME
7051 && token
->type
!= CPP_KEYWORD
)
7053 cp_parser_error (parser
, "expected labeled-statement");
7057 switch (token
->keyword
)
7064 /* Consume the `case' token. */
7065 cp_lexer_consume_token (parser
->lexer
);
7066 /* Parse the constant-expression. */
7067 expr
= cp_parser_constant_expression (parser
,
7068 /*allow_non_constant_p=*/false,
7071 ellipsis
= cp_lexer_peek_token (parser
->lexer
);
7072 if (ellipsis
->type
== CPP_ELLIPSIS
)
7074 /* Consume the `...' token. */
7075 cp_lexer_consume_token (parser
->lexer
);
7077 cp_parser_constant_expression (parser
,
7078 /*allow_non_constant_p=*/false,
7080 /* We don't need to emit warnings here, as the common code
7081 will do this for us. */
7084 expr_hi
= NULL_TREE
;
7086 if (parser
->in_switch_statement_p
)
7087 finish_case_label (expr
, expr_hi
);
7089 error ("%Hcase label %qE not within a switch statement",
7090 &token
->location
, expr
);
7095 /* Consume the `default' token. */
7096 cp_lexer_consume_token (parser
->lexer
);
7098 if (parser
->in_switch_statement_p
)
7099 finish_case_label (NULL_TREE
, NULL_TREE
);
7101 error ("%Hcase label not within a switch statement", &token
->location
);
7105 /* Anything else must be an ordinary label. */
7106 finish_label_stmt (cp_parser_identifier (parser
));
7110 /* Require the `:' token. */
7111 cp_parser_require (parser
, CPP_COLON
, "%<:%>");
7114 /* Parse an expression-statement.
7116 expression-statement:
7119 Returns the new EXPR_STMT -- or NULL_TREE if the expression
7120 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
7121 indicates whether this expression-statement is part of an
7122 expression statement. */
7125 cp_parser_expression_statement (cp_parser
* parser
, tree in_statement_expr
)
7127 tree statement
= NULL_TREE
;
7129 /* If the next token is a ';', then there is no expression
7131 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
7132 statement
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
7134 /* Consume the final `;'. */
7135 cp_parser_consume_semicolon_at_end_of_statement (parser
);
7137 if (in_statement_expr
7138 && cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
7139 /* This is the final expression statement of a statement
7141 statement
= finish_stmt_expr_expr (statement
, in_statement_expr
);
7143 statement
= finish_expr_stmt (statement
);
7150 /* Parse a compound-statement.
7153 { statement-seq [opt] }
7158 { label-declaration-seq [opt] statement-seq [opt] }
7160 label-declaration-seq:
7162 label-declaration-seq label-declaration
7164 Returns a tree representing the statement. */
7167 cp_parser_compound_statement (cp_parser
*parser
, tree in_statement_expr
,
7172 /* Consume the `{'. */
7173 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, "%<{%>"))
7174 return error_mark_node
;
7175 /* Begin the compound-statement. */
7176 compound_stmt
= begin_compound_stmt (in_try
? BCS_TRY_BLOCK
: 0);
7177 /* If the next keyword is `__label__' we have a label declaration. */
7178 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_LABEL
))
7179 cp_parser_label_declaration (parser
);
7180 /* Parse an (optional) statement-seq. */
7181 cp_parser_statement_seq_opt (parser
, in_statement_expr
);
7182 /* Finish the compound-statement. */
7183 finish_compound_stmt (compound_stmt
);
7184 /* Consume the `}'. */
7185 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "%<}%>");
7187 return compound_stmt
;
7190 /* Parse an (optional) statement-seq.
7194 statement-seq [opt] statement */
7197 cp_parser_statement_seq_opt (cp_parser
* parser
, tree in_statement_expr
)
7199 /* Scan statements until there aren't any more. */
7202 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
7204 /* If we're looking at a `}', then we've run out of statements. */
7205 if (token
->type
== CPP_CLOSE_BRACE
7206 || token
->type
== CPP_EOF
7207 || token
->type
== CPP_PRAGMA_EOL
)
7210 /* If we are in a compound statement and find 'else' then
7211 something went wrong. */
7212 else if (token
->type
== CPP_KEYWORD
&& token
->keyword
== RID_ELSE
)
7214 if (parser
->in_statement
& IN_IF_STMT
)
7218 token
= cp_lexer_consume_token (parser
->lexer
);
7219 error ("%H%<else%> without a previous %<if%>", &token
->location
);
7223 /* Parse the statement. */
7224 cp_parser_statement (parser
, in_statement_expr
, true, NULL
);
7228 /* Parse a selection-statement.
7230 selection-statement:
7231 if ( condition ) statement
7232 if ( condition ) statement else statement
7233 switch ( condition ) statement
7235 Returns the new IF_STMT or SWITCH_STMT.
7237 If IF_P is not NULL, *IF_P is set to indicate whether the statement
7238 is a (possibly labeled) if statement which is not enclosed in
7239 braces and has an else clause. This is used to implement
7243 cp_parser_selection_statement (cp_parser
* parser
, bool *if_p
)
7251 /* Peek at the next token. */
7252 token
= cp_parser_require (parser
, CPP_KEYWORD
, "selection-statement");
7254 /* See what kind of keyword it is. */
7255 keyword
= token
->keyword
;
7264 /* Look for the `('. */
7265 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>"))
7267 cp_parser_skip_to_end_of_statement (parser
);
7268 return error_mark_node
;
7271 /* Begin the selection-statement. */
7272 if (keyword
== RID_IF
)
7273 statement
= begin_if_stmt ();
7275 statement
= begin_switch_stmt ();
7277 /* Parse the condition. */
7278 condition
= cp_parser_condition (parser
);
7279 /* Look for the `)'. */
7280 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>"))
7281 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
7282 /*consume_paren=*/true);
7284 if (keyword
== RID_IF
)
7287 unsigned char in_statement
;
7289 /* Add the condition. */
7290 finish_if_stmt_cond (condition
, statement
);
7292 /* Parse the then-clause. */
7293 in_statement
= parser
->in_statement
;
7294 parser
->in_statement
|= IN_IF_STMT
;
7295 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
7297 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
7298 add_stmt (build_empty_stmt ());
7299 cp_lexer_consume_token (parser
->lexer
);
7300 if (!cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ELSE
))
7301 warning_at (loc
, OPT_Wempty_body
, "suggest braces around "
7302 "empty body in an %<if%> statement");
7306 cp_parser_implicitly_scoped_statement (parser
, &nested_if
);
7307 parser
->in_statement
= in_statement
;
7309 finish_then_clause (statement
);
7311 /* If the next token is `else', parse the else-clause. */
7312 if (cp_lexer_next_token_is_keyword (parser
->lexer
,
7315 /* Consume the `else' keyword. */
7316 cp_lexer_consume_token (parser
->lexer
);
7317 begin_else_clause (statement
);
7318 /* Parse the else-clause. */
7319 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
7321 warning_at (cp_lexer_peek_token (parser
->lexer
)->location
,
7322 OPT_Wempty_body
, "suggest braces around "
7323 "empty body in an %<else%> statement");
7324 add_stmt (build_empty_stmt ());
7325 cp_lexer_consume_token (parser
->lexer
);
7328 cp_parser_implicitly_scoped_statement (parser
, NULL
);
7330 finish_else_clause (statement
);
7332 /* If we are currently parsing a then-clause, then
7333 IF_P will not be NULL. We set it to true to
7334 indicate that this if statement has an else clause.
7335 This may trigger the Wparentheses warning below
7336 when we get back up to the parent if statement. */
7342 /* This if statement does not have an else clause. If
7343 NESTED_IF is true, then the then-clause is an if
7344 statement which does have an else clause. We warn
7345 about the potential ambiguity. */
7347 warning (OPT_Wparentheses
,
7348 ("%Hsuggest explicit braces "
7349 "to avoid ambiguous %<else%>"),
7350 EXPR_LOCUS (statement
));
7353 /* Now we're all done with the if-statement. */
7354 finish_if_stmt (statement
);
7358 bool in_switch_statement_p
;
7359 unsigned char in_statement
;
7361 /* Add the condition. */
7362 finish_switch_cond (condition
, statement
);
7364 /* Parse the body of the switch-statement. */
7365 in_switch_statement_p
= parser
->in_switch_statement_p
;
7366 in_statement
= parser
->in_statement
;
7367 parser
->in_switch_statement_p
= true;
7368 parser
->in_statement
|= IN_SWITCH_STMT
;
7369 cp_parser_implicitly_scoped_statement (parser
, NULL
);
7370 parser
->in_switch_statement_p
= in_switch_statement_p
;
7371 parser
->in_statement
= in_statement
;
7373 /* Now we're all done with the switch-statement. */
7374 finish_switch_stmt (statement
);
7382 cp_parser_error (parser
, "expected selection-statement");
7383 return error_mark_node
;
7387 /* Parse a condition.
7391 type-specifier-seq declarator = initializer-clause
7392 type-specifier-seq declarator braced-init-list
7397 type-specifier-seq declarator asm-specification [opt]
7398 attributes [opt] = assignment-expression
7400 Returns the expression that should be tested. */
7403 cp_parser_condition (cp_parser
* parser
)
7405 cp_decl_specifier_seq type_specifiers
;
7406 const char *saved_message
;
7408 /* Try the declaration first. */
7409 cp_parser_parse_tentatively (parser
);
7410 /* New types are not allowed in the type-specifier-seq for a
7412 saved_message
= parser
->type_definition_forbidden_message
;
7413 parser
->type_definition_forbidden_message
7414 = "types may not be defined in conditions";
7415 /* Parse the type-specifier-seq. */
7416 cp_parser_type_specifier_seq (parser
, /*is_condition==*/true,
7418 /* Restore the saved message. */
7419 parser
->type_definition_forbidden_message
= saved_message
;
7420 /* If all is well, we might be looking at a declaration. */
7421 if (!cp_parser_error_occurred (parser
))
7424 tree asm_specification
;
7426 cp_declarator
*declarator
;
7427 tree initializer
= NULL_TREE
;
7429 /* Parse the declarator. */
7430 declarator
= cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
7431 /*ctor_dtor_or_conv_p=*/NULL
,
7432 /*parenthesized_p=*/NULL
,
7433 /*member_p=*/false);
7434 /* Parse the attributes. */
7435 attributes
= cp_parser_attributes_opt (parser
);
7436 /* Parse the asm-specification. */
7437 asm_specification
= cp_parser_asm_specification_opt (parser
);
7438 /* If the next token is not an `=' or '{', then we might still be
7439 looking at an expression. For example:
7443 looks like a decl-specifier-seq and a declarator -- but then
7444 there is no `=', so this is an expression. */
7445 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
)
7446 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
))
7447 cp_parser_simulate_error (parser
);
7449 /* If we did see an `=' or '{', then we are looking at a declaration
7451 if (cp_parser_parse_definitely (parser
))
7454 bool non_constant_p
;
7455 bool flags
= LOOKUP_ONLYCONVERTING
;
7457 /* Create the declaration. */
7458 decl
= start_decl (declarator
, &type_specifiers
,
7459 /*initialized_p=*/true,
7460 attributes
, /*prefix_attributes=*/NULL_TREE
,
7463 /* Parse the initializer. */
7464 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
7466 initializer
= cp_parser_braced_list (parser
, &non_constant_p
);
7467 CONSTRUCTOR_IS_DIRECT_INIT (initializer
) = 1;
7472 /* Consume the `='. */
7473 cp_parser_require (parser
, CPP_EQ
, "%<=%>");
7474 initializer
= cp_parser_initializer_clause (parser
, &non_constant_p
);
7476 if (BRACE_ENCLOSED_INITIALIZER_P (initializer
))
7477 maybe_warn_cpp0x ("extended initializer lists");
7479 if (!non_constant_p
)
7480 initializer
= fold_non_dependent_expr (initializer
);
7482 /* Process the initializer. */
7483 cp_finish_decl (decl
,
7484 initializer
, !non_constant_p
,
7489 pop_scope (pushed_scope
);
7491 return convert_from_reference (decl
);
7494 /* If we didn't even get past the declarator successfully, we are
7495 definitely not looking at a declaration. */
7497 cp_parser_abort_tentative_parse (parser
);
7499 /* Otherwise, we are looking at an expression. */
7500 return cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
7503 /* Parse an iteration-statement.
7505 iteration-statement:
7506 while ( condition ) statement
7507 do statement while ( expression ) ;
7508 for ( for-init-statement condition [opt] ; expression [opt] )
7511 Returns the new WHILE_STMT, DO_STMT, or FOR_STMT. */
7514 cp_parser_iteration_statement (cp_parser
* parser
)
7519 unsigned char in_statement
;
7521 /* Peek at the next token. */
7522 token
= cp_parser_require (parser
, CPP_KEYWORD
, "iteration-statement");
7524 return error_mark_node
;
7526 /* Remember whether or not we are already within an iteration
7528 in_statement
= parser
->in_statement
;
7530 /* See what kind of keyword it is. */
7531 keyword
= token
->keyword
;
7538 /* Begin the while-statement. */
7539 statement
= begin_while_stmt ();
7540 /* Look for the `('. */
7541 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
7542 /* Parse the condition. */
7543 condition
= cp_parser_condition (parser
);
7544 finish_while_stmt_cond (condition
, statement
);
7545 /* Look for the `)'. */
7546 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
7547 /* Parse the dependent statement. */
7548 parser
->in_statement
= IN_ITERATION_STMT
;
7549 cp_parser_already_scoped_statement (parser
);
7550 parser
->in_statement
= in_statement
;
7551 /* We're done with the while-statement. */
7552 finish_while_stmt (statement
);
7560 /* Begin the do-statement. */
7561 statement
= begin_do_stmt ();
7562 /* Parse the body of the do-statement. */
7563 parser
->in_statement
= IN_ITERATION_STMT
;
7564 cp_parser_implicitly_scoped_statement (parser
, NULL
);
7565 parser
->in_statement
= in_statement
;
7566 finish_do_body (statement
);
7567 /* Look for the `while' keyword. */
7568 cp_parser_require_keyword (parser
, RID_WHILE
, "%<while%>");
7569 /* Look for the `('. */
7570 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
7571 /* Parse the expression. */
7572 expression
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
7573 /* We're done with the do-statement. */
7574 finish_do_stmt (expression
, statement
);
7575 /* Look for the `)'. */
7576 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
7577 /* Look for the `;'. */
7578 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
7584 tree condition
= NULL_TREE
;
7585 tree expression
= NULL_TREE
;
7587 /* Begin the for-statement. */
7588 statement
= begin_for_stmt ();
7589 /* Look for the `('. */
7590 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
7591 /* Parse the initialization. */
7592 cp_parser_for_init_statement (parser
);
7593 finish_for_init_stmt (statement
);
7595 /* If there's a condition, process it. */
7596 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
7597 condition
= cp_parser_condition (parser
);
7598 finish_for_cond (condition
, statement
);
7599 /* Look for the `;'. */
7600 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
7602 /* If there's an expression, process it. */
7603 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
7604 expression
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
7605 finish_for_expr (expression
, statement
);
7606 /* Look for the `)'. */
7607 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
7609 /* Parse the body of the for-statement. */
7610 parser
->in_statement
= IN_ITERATION_STMT
;
7611 cp_parser_already_scoped_statement (parser
);
7612 parser
->in_statement
= in_statement
;
7614 /* We're done with the for-statement. */
7615 finish_for_stmt (statement
);
7620 cp_parser_error (parser
, "expected iteration-statement");
7621 statement
= error_mark_node
;
7628 /* Parse a for-init-statement.
7631 expression-statement
7632 simple-declaration */
7635 cp_parser_for_init_statement (cp_parser
* parser
)
7637 /* If the next token is a `;', then we have an empty
7638 expression-statement. Grammatically, this is also a
7639 simple-declaration, but an invalid one, because it does not
7640 declare anything. Therefore, if we did not handle this case
7641 specially, we would issue an error message about an invalid
7643 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
7645 /* We're going to speculatively look for a declaration, falling back
7646 to an expression, if necessary. */
7647 cp_parser_parse_tentatively (parser
);
7648 /* Parse the declaration. */
7649 cp_parser_simple_declaration (parser
,
7650 /*function_definition_allowed_p=*/false);
7651 /* If the tentative parse failed, then we shall need to look for an
7652 expression-statement. */
7653 if (cp_parser_parse_definitely (parser
))
7657 cp_parser_expression_statement (parser
, false);
7660 /* Parse a jump-statement.
7665 return expression [opt] ;
7666 return braced-init-list ;
7674 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
7677 cp_parser_jump_statement (cp_parser
* parser
)
7679 tree statement
= error_mark_node
;
7682 unsigned char in_statement
;
7684 /* Peek at the next token. */
7685 token
= cp_parser_require (parser
, CPP_KEYWORD
, "jump-statement");
7687 return error_mark_node
;
7689 /* See what kind of keyword it is. */
7690 keyword
= token
->keyword
;
7694 in_statement
= parser
->in_statement
& ~IN_IF_STMT
;
7695 switch (in_statement
)
7698 error ("%Hbreak statement not within loop or switch", &token
->location
);
7701 gcc_assert ((in_statement
& IN_SWITCH_STMT
)
7702 || in_statement
== IN_ITERATION_STMT
);
7703 statement
= finish_break_stmt ();
7706 error ("%Hinvalid exit from OpenMP structured block", &token
->location
);
7709 error ("%Hbreak statement used with OpenMP for loop", &token
->location
);
7712 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
7716 switch (parser
->in_statement
& ~(IN_SWITCH_STMT
| IN_IF_STMT
))
7719 error ("%Hcontinue statement not within a loop", &token
->location
);
7721 case IN_ITERATION_STMT
:
7723 statement
= finish_continue_stmt ();
7726 error ("%Hinvalid exit from OpenMP structured block", &token
->location
);
7731 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
7737 bool expr_non_constant_p
;
7739 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
7741 maybe_warn_cpp0x ("extended initializer lists");
7742 expr
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
7744 else if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
7745 expr
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
7747 /* If the next token is a `;', then there is no
7750 /* Build the return-statement. */
7751 statement
= finish_return_stmt (expr
);
7752 /* Look for the final `;'. */
7753 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
7758 /* Create the goto-statement. */
7759 if (cp_lexer_next_token_is (parser
->lexer
, CPP_MULT
))
7761 /* Issue a warning about this use of a GNU extension. */
7762 pedwarn (token
->location
, OPT_pedantic
, "ISO C++ forbids computed gotos");
7763 /* Consume the '*' token. */
7764 cp_lexer_consume_token (parser
->lexer
);
7765 /* Parse the dependent expression. */
7766 finish_goto_stmt (cp_parser_expression (parser
, /*cast_p=*/false, NULL
));
7769 finish_goto_stmt (cp_parser_identifier (parser
));
7770 /* Look for the final `;'. */
7771 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
7775 cp_parser_error (parser
, "expected jump-statement");
7782 /* Parse a declaration-statement.
7784 declaration-statement:
7785 block-declaration */
7788 cp_parser_declaration_statement (cp_parser
* parser
)
7792 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
7793 p
= obstack_alloc (&declarator_obstack
, 0);
7795 /* Parse the block-declaration. */
7796 cp_parser_block_declaration (parser
, /*statement_p=*/true);
7798 /* Free any declarators allocated. */
7799 obstack_free (&declarator_obstack
, p
);
7801 /* Finish off the statement. */
7805 /* Some dependent statements (like `if (cond) statement'), are
7806 implicitly in their own scope. In other words, if the statement is
7807 a single statement (as opposed to a compound-statement), it is
7808 none-the-less treated as if it were enclosed in braces. Any
7809 declarations appearing in the dependent statement are out of scope
7810 after control passes that point. This function parses a statement,
7811 but ensures that is in its own scope, even if it is not a
7814 If IF_P is not NULL, *IF_P is set to indicate whether the statement
7815 is a (possibly labeled) if statement which is not enclosed in
7816 braces and has an else clause. This is used to implement
7819 Returns the new statement. */
7822 cp_parser_implicitly_scoped_statement (cp_parser
* parser
, bool *if_p
)
7829 /* Mark if () ; with a special NOP_EXPR. */
7830 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
7832 cp_lexer_consume_token (parser
->lexer
);
7833 statement
= add_stmt (build_empty_stmt ());
7835 /* if a compound is opened, we simply parse the statement directly. */
7836 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
7837 statement
= cp_parser_compound_statement (parser
, NULL
, false);
7838 /* If the token is not a `{', then we must take special action. */
7841 /* Create a compound-statement. */
7842 statement
= begin_compound_stmt (0);
7843 /* Parse the dependent-statement. */
7844 cp_parser_statement (parser
, NULL_TREE
, false, if_p
);
7845 /* Finish the dummy compound-statement. */
7846 finish_compound_stmt (statement
);
7849 /* Return the statement. */
7853 /* For some dependent statements (like `while (cond) statement'), we
7854 have already created a scope. Therefore, even if the dependent
7855 statement is a compound-statement, we do not want to create another
7859 cp_parser_already_scoped_statement (cp_parser
* parser
)
7861 /* If the token is a `{', then we must take special action. */
7862 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
))
7863 cp_parser_statement (parser
, NULL_TREE
, false, NULL
);
7866 /* Avoid calling cp_parser_compound_statement, so that we
7867 don't create a new scope. Do everything else by hand. */
7868 cp_parser_require (parser
, CPP_OPEN_BRACE
, "%<{%>");
7869 /* If the next keyword is `__label__' we have a label declaration. */
7870 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_LABEL
))
7871 cp_parser_label_declaration (parser
);
7872 /* Parse an (optional) statement-seq. */
7873 cp_parser_statement_seq_opt (parser
, NULL_TREE
);
7874 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "%<}%>");
7878 /* Declarations [gram.dcl.dcl] */
7880 /* Parse an optional declaration-sequence.
7884 declaration-seq declaration */
7887 cp_parser_declaration_seq_opt (cp_parser
* parser
)
7893 token
= cp_lexer_peek_token (parser
->lexer
);
7895 if (token
->type
== CPP_CLOSE_BRACE
7896 || token
->type
== CPP_EOF
7897 || token
->type
== CPP_PRAGMA_EOL
)
7900 if (token
->type
== CPP_SEMICOLON
)
7902 /* A declaration consisting of a single semicolon is
7903 invalid. Allow it unless we're being pedantic. */
7904 cp_lexer_consume_token (parser
->lexer
);
7905 if (!in_system_header
)
7906 pedwarn (input_location
, OPT_pedantic
, "extra %<;%>");
7910 /* If we're entering or exiting a region that's implicitly
7911 extern "C", modify the lang context appropriately. */
7912 if (!parser
->implicit_extern_c
&& token
->implicit_extern_c
)
7914 push_lang_context (lang_name_c
);
7915 parser
->implicit_extern_c
= true;
7917 else if (parser
->implicit_extern_c
&& !token
->implicit_extern_c
)
7919 pop_lang_context ();
7920 parser
->implicit_extern_c
= false;
7923 if (token
->type
== CPP_PRAGMA
)
7925 /* A top-level declaration can consist solely of a #pragma.
7926 A nested declaration cannot, so this is done here and not
7927 in cp_parser_declaration. (A #pragma at block scope is
7928 handled in cp_parser_statement.) */
7929 cp_parser_pragma (parser
, pragma_external
);
7933 /* Parse the declaration itself. */
7934 cp_parser_declaration (parser
);
7938 /* Parse a declaration.
7943 template-declaration
7944 explicit-instantiation
7945 explicit-specialization
7946 linkage-specification
7947 namespace-definition
7952 __extension__ declaration */
7955 cp_parser_declaration (cp_parser
* parser
)
7962 /* Check for the `__extension__' keyword. */
7963 if (cp_parser_extension_opt (parser
, &saved_pedantic
))
7965 /* Parse the qualified declaration. */
7966 cp_parser_declaration (parser
);
7967 /* Restore the PEDANTIC flag. */
7968 pedantic
= saved_pedantic
;
7973 /* Try to figure out what kind of declaration is present. */
7974 token1
= *cp_lexer_peek_token (parser
->lexer
);
7976 if (token1
.type
!= CPP_EOF
)
7977 token2
= *cp_lexer_peek_nth_token (parser
->lexer
, 2);
7980 token2
.type
= CPP_EOF
;
7981 token2
.keyword
= RID_MAX
;
7984 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
7985 p
= obstack_alloc (&declarator_obstack
, 0);
7987 /* If the next token is `extern' and the following token is a string
7988 literal, then we have a linkage specification. */
7989 if (token1
.keyword
== RID_EXTERN
7990 && cp_parser_is_string_literal (&token2
))
7991 cp_parser_linkage_specification (parser
);
7992 /* If the next token is `template', then we have either a template
7993 declaration, an explicit instantiation, or an explicit
7995 else if (token1
.keyword
== RID_TEMPLATE
)
7997 /* `template <>' indicates a template specialization. */
7998 if (token2
.type
== CPP_LESS
7999 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_GREATER
)
8000 cp_parser_explicit_specialization (parser
);
8001 /* `template <' indicates a template declaration. */
8002 else if (token2
.type
== CPP_LESS
)
8003 cp_parser_template_declaration (parser
, /*member_p=*/false);
8004 /* Anything else must be an explicit instantiation. */
8006 cp_parser_explicit_instantiation (parser
);
8008 /* If the next token is `export', then we have a template
8010 else if (token1
.keyword
== RID_EXPORT
)
8011 cp_parser_template_declaration (parser
, /*member_p=*/false);
8012 /* If the next token is `extern', 'static' or 'inline' and the one
8013 after that is `template', we have a GNU extended explicit
8014 instantiation directive. */
8015 else if (cp_parser_allow_gnu_extensions_p (parser
)
8016 && (token1
.keyword
== RID_EXTERN
8017 || token1
.keyword
== RID_STATIC
8018 || token1
.keyword
== RID_INLINE
)
8019 && token2
.keyword
== RID_TEMPLATE
)
8020 cp_parser_explicit_instantiation (parser
);
8021 /* If the next token is `namespace', check for a named or unnamed
8022 namespace definition. */
8023 else if (token1
.keyword
== RID_NAMESPACE
8024 && (/* A named namespace definition. */
8025 (token2
.type
== CPP_NAME
8026 && (cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
8028 /* An unnamed namespace definition. */
8029 || token2
.type
== CPP_OPEN_BRACE
8030 || token2
.keyword
== RID_ATTRIBUTE
))
8031 cp_parser_namespace_definition (parser
);
8032 /* An inline (associated) namespace definition. */
8033 else if (token1
.keyword
== RID_INLINE
8034 && token2
.keyword
== RID_NAMESPACE
)
8035 cp_parser_namespace_definition (parser
);
8036 /* Objective-C++ declaration/definition. */
8037 else if (c_dialect_objc () && OBJC_IS_AT_KEYWORD (token1
.keyword
))
8038 cp_parser_objc_declaration (parser
);
8039 /* We must have either a block declaration or a function
8042 /* Try to parse a block-declaration, or a function-definition. */
8043 cp_parser_block_declaration (parser
, /*statement_p=*/false);
8045 /* Free any declarators allocated. */
8046 obstack_free (&declarator_obstack
, p
);
8049 /* Parse a block-declaration.
8054 namespace-alias-definition
8061 __extension__ block-declaration
8066 static_assert-declaration
8068 If STATEMENT_P is TRUE, then this block-declaration is occurring as
8069 part of a declaration-statement. */
8072 cp_parser_block_declaration (cp_parser
*parser
,
8078 /* Check for the `__extension__' keyword. */
8079 if (cp_parser_extension_opt (parser
, &saved_pedantic
))
8081 /* Parse the qualified declaration. */
8082 cp_parser_block_declaration (parser
, statement_p
);
8083 /* Restore the PEDANTIC flag. */
8084 pedantic
= saved_pedantic
;
8089 /* Peek at the next token to figure out which kind of declaration is
8091 token1
= cp_lexer_peek_token (parser
->lexer
);
8093 /* If the next keyword is `asm', we have an asm-definition. */
8094 if (token1
->keyword
== RID_ASM
)
8097 cp_parser_commit_to_tentative_parse (parser
);
8098 cp_parser_asm_definition (parser
);
8100 /* If the next keyword is `namespace', we have a
8101 namespace-alias-definition. */
8102 else if (token1
->keyword
== RID_NAMESPACE
)
8103 cp_parser_namespace_alias_definition (parser
);
8104 /* If the next keyword is `using', we have either a
8105 using-declaration or a using-directive. */
8106 else if (token1
->keyword
== RID_USING
)
8111 cp_parser_commit_to_tentative_parse (parser
);
8112 /* If the token after `using' is `namespace', then we have a
8114 token2
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
8115 if (token2
->keyword
== RID_NAMESPACE
)
8116 cp_parser_using_directive (parser
);
8117 /* Otherwise, it's a using-declaration. */
8119 cp_parser_using_declaration (parser
,
8120 /*access_declaration_p=*/false);
8122 /* If the next keyword is `__label__' we have a misplaced label
8124 else if (token1
->keyword
== RID_LABEL
)
8126 cp_lexer_consume_token (parser
->lexer
);
8127 error ("%H%<__label__%> not at the beginning of a block", &token1
->location
);
8128 cp_parser_skip_to_end_of_statement (parser
);
8129 /* If the next token is now a `;', consume it. */
8130 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
8131 cp_lexer_consume_token (parser
->lexer
);
8133 /* If the next token is `static_assert' we have a static assertion. */
8134 else if (token1
->keyword
== RID_STATIC_ASSERT
)
8135 cp_parser_static_assert (parser
, /*member_p=*/false);
8136 /* Anything else must be a simple-declaration. */
8138 cp_parser_simple_declaration (parser
, !statement_p
);
8141 /* Parse a simple-declaration.
8144 decl-specifier-seq [opt] init-declarator-list [opt] ;
8146 init-declarator-list:
8148 init-declarator-list , init-declarator
8150 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
8151 function-definition as a simple-declaration. */
8154 cp_parser_simple_declaration (cp_parser
* parser
,
8155 bool function_definition_allowed_p
)
8157 cp_decl_specifier_seq decl_specifiers
;
8158 int declares_class_or_enum
;
8159 bool saw_declarator
;
8161 /* Defer access checks until we know what is being declared; the
8162 checks for names appearing in the decl-specifier-seq should be
8163 done as if we were in the scope of the thing being declared. */
8164 push_deferring_access_checks (dk_deferred
);
8166 /* Parse the decl-specifier-seq. We have to keep track of whether
8167 or not the decl-specifier-seq declares a named class or
8168 enumeration type, since that is the only case in which the
8169 init-declarator-list is allowed to be empty.
8173 In a simple-declaration, the optional init-declarator-list can be
8174 omitted only when declaring a class or enumeration, that is when
8175 the decl-specifier-seq contains either a class-specifier, an
8176 elaborated-type-specifier, or an enum-specifier. */
8177 cp_parser_decl_specifier_seq (parser
,
8178 CP_PARSER_FLAGS_OPTIONAL
,
8180 &declares_class_or_enum
);
8181 /* We no longer need to defer access checks. */
8182 stop_deferring_access_checks ();
8184 /* In a block scope, a valid declaration must always have a
8185 decl-specifier-seq. By not trying to parse declarators, we can
8186 resolve the declaration/expression ambiguity more quickly. */
8187 if (!function_definition_allowed_p
8188 && !decl_specifiers
.any_specifiers_p
)
8190 cp_parser_error (parser
, "expected declaration");
8194 /* If the next two tokens are both identifiers, the code is
8195 erroneous. The usual cause of this situation is code like:
8199 where "T" should name a type -- but does not. */
8200 if (!decl_specifiers
.type
8201 && cp_parser_parse_and_diagnose_invalid_type_name (parser
))
8203 /* If parsing tentatively, we should commit; we really are
8204 looking at a declaration. */
8205 cp_parser_commit_to_tentative_parse (parser
);
8210 /* If we have seen at least one decl-specifier, and the next token
8211 is not a parenthesis, then we must be looking at a declaration.
8212 (After "int (" we might be looking at a functional cast.) */
8213 if (decl_specifiers
.any_specifiers_p
8214 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_PAREN
)
8215 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
)
8216 && !cp_parser_error_occurred (parser
))
8217 cp_parser_commit_to_tentative_parse (parser
);
8219 /* Keep going until we hit the `;' at the end of the simple
8221 saw_declarator
= false;
8222 while (cp_lexer_next_token_is_not (parser
->lexer
,
8226 bool function_definition_p
;
8231 /* If we are processing next declarator, coma is expected */
8232 token
= cp_lexer_peek_token (parser
->lexer
);
8233 gcc_assert (token
->type
== CPP_COMMA
);
8234 cp_lexer_consume_token (parser
->lexer
);
8237 saw_declarator
= true;
8239 /* Parse the init-declarator. */
8240 decl
= cp_parser_init_declarator (parser
, &decl_specifiers
,
8242 function_definition_allowed_p
,
8244 declares_class_or_enum
,
8245 &function_definition_p
);
8246 /* If an error occurred while parsing tentatively, exit quickly.
8247 (That usually happens when in the body of a function; each
8248 statement is treated as a declaration-statement until proven
8250 if (cp_parser_error_occurred (parser
))
8252 /* Handle function definitions specially. */
8253 if (function_definition_p
)
8255 /* If the next token is a `,', then we are probably
8256 processing something like:
8260 which is erroneous. */
8261 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
8263 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
8264 error ("%Hmixing declarations and function-definitions is forbidden",
8267 /* Otherwise, we're done with the list of declarators. */
8270 pop_deferring_access_checks ();
8274 /* The next token should be either a `,' or a `;'. */
8275 token
= cp_lexer_peek_token (parser
->lexer
);
8276 /* If it's a `,', there are more declarators to come. */
8277 if (token
->type
== CPP_COMMA
)
8278 /* will be consumed next time around */;
8279 /* If it's a `;', we are done. */
8280 else if (token
->type
== CPP_SEMICOLON
)
8282 /* Anything else is an error. */
8285 /* If we have already issued an error message we don't need
8286 to issue another one. */
8287 if (decl
!= error_mark_node
8288 || cp_parser_uncommitted_to_tentative_parse_p (parser
))
8289 cp_parser_error (parser
, "expected %<,%> or %<;%>");
8290 /* Skip tokens until we reach the end of the statement. */
8291 cp_parser_skip_to_end_of_statement (parser
);
8292 /* If the next token is now a `;', consume it. */
8293 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
8294 cp_lexer_consume_token (parser
->lexer
);
8297 /* After the first time around, a function-definition is not
8298 allowed -- even if it was OK at first. For example:
8303 function_definition_allowed_p
= false;
8306 /* Issue an error message if no declarators are present, and the
8307 decl-specifier-seq does not itself declare a class or
8309 if (!saw_declarator
)
8311 if (cp_parser_declares_only_class_p (parser
))
8312 shadow_tag (&decl_specifiers
);
8313 /* Perform any deferred access checks. */
8314 perform_deferred_access_checks ();
8317 /* Consume the `;'. */
8318 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
8321 pop_deferring_access_checks ();
8324 /* Parse a decl-specifier-seq.
8327 decl-specifier-seq [opt] decl-specifier
8330 storage-class-specifier
8341 Set *DECL_SPECS to a representation of the decl-specifier-seq.
8343 The parser flags FLAGS is used to control type-specifier parsing.
8345 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
8348 1: one of the decl-specifiers is an elaborated-type-specifier
8349 (i.e., a type declaration)
8350 2: one of the decl-specifiers is an enum-specifier or a
8351 class-specifier (i.e., a type definition)
8356 cp_parser_decl_specifier_seq (cp_parser
* parser
,
8357 cp_parser_flags flags
,
8358 cp_decl_specifier_seq
*decl_specs
,
8359 int* declares_class_or_enum
)
8361 bool constructor_possible_p
= !parser
->in_declarator_p
;
8362 cp_token
*start_token
= NULL
;
8364 /* Clear DECL_SPECS. */
8365 clear_decl_specs (decl_specs
);
8367 /* Assume no class or enumeration type is declared. */
8368 *declares_class_or_enum
= 0;
8370 /* Keep reading specifiers until there are no more to read. */
8374 bool found_decl_spec
;
8377 /* Peek at the next token. */
8378 token
= cp_lexer_peek_token (parser
->lexer
);
8380 /* Save the first token of the decl spec list for error
8383 start_token
= token
;
8384 /* Handle attributes. */
8385 if (token
->keyword
== RID_ATTRIBUTE
)
8387 /* Parse the attributes. */
8388 decl_specs
->attributes
8389 = chainon (decl_specs
->attributes
,
8390 cp_parser_attributes_opt (parser
));
8393 /* Assume we will find a decl-specifier keyword. */
8394 found_decl_spec
= true;
8395 /* If the next token is an appropriate keyword, we can simply
8396 add it to the list. */
8397 switch (token
->keyword
)
8402 if (!at_class_scope_p ())
8404 error ("%H%<friend%> used outside of class", &token
->location
);
8405 cp_lexer_purge_token (parser
->lexer
);
8409 ++decl_specs
->specs
[(int) ds_friend
];
8410 /* Consume the token. */
8411 cp_lexer_consume_token (parser
->lexer
);
8415 /* function-specifier:
8422 cp_parser_function_specifier_opt (parser
, decl_specs
);
8428 ++decl_specs
->specs
[(int) ds_typedef
];
8429 /* Consume the token. */
8430 cp_lexer_consume_token (parser
->lexer
);
8431 /* A constructor declarator cannot appear in a typedef. */
8432 constructor_possible_p
= false;
8433 /* The "typedef" keyword can only occur in a declaration; we
8434 may as well commit at this point. */
8435 cp_parser_commit_to_tentative_parse (parser
);
8437 if (decl_specs
->storage_class
!= sc_none
)
8438 decl_specs
->conflicting_specifiers_p
= true;
8441 /* storage-class-specifier:
8451 if (cxx_dialect
== cxx98
)
8453 /* Consume the token. */
8454 cp_lexer_consume_token (parser
->lexer
);
8456 /* Complain about `auto' as a storage specifier, if
8457 we're complaining about C++0x compatibility. */
8460 "%H%<auto%> will change meaning in C++0x; please remove it",
8463 /* Set the storage class anyway. */
8464 cp_parser_set_storage_class (parser
, decl_specs
, RID_AUTO
,
8468 /* C++0x auto type-specifier. */
8469 found_decl_spec
= false;
8476 /* Consume the token. */
8477 cp_lexer_consume_token (parser
->lexer
);
8478 cp_parser_set_storage_class (parser
, decl_specs
, token
->keyword
,
8482 /* Consume the token. */
8483 cp_lexer_consume_token (parser
->lexer
);
8484 ++decl_specs
->specs
[(int) ds_thread
];
8488 /* We did not yet find a decl-specifier yet. */
8489 found_decl_spec
= false;
8493 /* Constructors are a special case. The `S' in `S()' is not a
8494 decl-specifier; it is the beginning of the declarator. */
8497 && constructor_possible_p
8498 && (cp_parser_constructor_declarator_p
8499 (parser
, decl_specs
->specs
[(int) ds_friend
] != 0)));
8501 /* If we don't have a DECL_SPEC yet, then we must be looking at
8502 a type-specifier. */
8503 if (!found_decl_spec
&& !constructor_p
)
8505 int decl_spec_declares_class_or_enum
;
8506 bool is_cv_qualifier
;
8510 = cp_parser_type_specifier (parser
, flags
,
8512 /*is_declaration=*/true,
8513 &decl_spec_declares_class_or_enum
,
8515 *declares_class_or_enum
|= decl_spec_declares_class_or_enum
;
8517 /* If this type-specifier referenced a user-defined type
8518 (a typedef, class-name, etc.), then we can't allow any
8519 more such type-specifiers henceforth.
8523 The longest sequence of decl-specifiers that could
8524 possibly be a type name is taken as the
8525 decl-specifier-seq of a declaration. The sequence shall
8526 be self-consistent as described below.
8530 As a general rule, at most one type-specifier is allowed
8531 in the complete decl-specifier-seq of a declaration. The
8532 only exceptions are the following:
8534 -- const or volatile can be combined with any other
8537 -- signed or unsigned can be combined with char, long,
8545 void g (const int Pc);
8547 Here, Pc is *not* part of the decl-specifier seq; it's
8548 the declarator. Therefore, once we see a type-specifier
8549 (other than a cv-qualifier), we forbid any additional
8550 user-defined types. We *do* still allow things like `int
8551 int' to be considered a decl-specifier-seq, and issue the
8552 error message later. */
8553 if (type_spec
&& !is_cv_qualifier
)
8554 flags
|= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
;
8555 /* A constructor declarator cannot follow a type-specifier. */
8558 constructor_possible_p
= false;
8559 found_decl_spec
= true;
8563 /* If we still do not have a DECL_SPEC, then there are no more
8565 if (!found_decl_spec
)
8568 decl_specs
->any_specifiers_p
= true;
8569 /* After we see one decl-specifier, further decl-specifiers are
8571 flags
|= CP_PARSER_FLAGS_OPTIONAL
;
8574 cp_parser_check_decl_spec (decl_specs
, start_token
->location
);
8576 /* Don't allow a friend specifier with a class definition. */
8577 if (decl_specs
->specs
[(int) ds_friend
] != 0
8578 && (*declares_class_or_enum
& 2))
8579 error ("%Hclass definition may not be declared a friend",
8580 &start_token
->location
);
8583 /* Parse an (optional) storage-class-specifier.
8585 storage-class-specifier:
8594 storage-class-specifier:
8597 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
8600 cp_parser_storage_class_specifier_opt (cp_parser
* parser
)
8602 switch (cp_lexer_peek_token (parser
->lexer
)->keyword
)
8605 if (cxx_dialect
!= cxx98
)
8607 /* Fall through for C++98. */
8614 /* Consume the token. */
8615 return cp_lexer_consume_token (parser
->lexer
)->u
.value
;
8622 /* Parse an (optional) function-specifier.
8629 Returns an IDENTIFIER_NODE corresponding to the keyword used.
8630 Updates DECL_SPECS, if it is non-NULL. */
8633 cp_parser_function_specifier_opt (cp_parser
* parser
,
8634 cp_decl_specifier_seq
*decl_specs
)
8636 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
8637 switch (token
->keyword
)
8641 ++decl_specs
->specs
[(int) ds_inline
];
8645 /* 14.5.2.3 [temp.mem]
8647 A member function template shall not be virtual. */
8648 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8649 error ("%Htemplates may not be %<virtual%>", &token
->location
);
8650 else if (decl_specs
)
8651 ++decl_specs
->specs
[(int) ds_virtual
];
8656 ++decl_specs
->specs
[(int) ds_explicit
];
8663 /* Consume the token. */
8664 return cp_lexer_consume_token (parser
->lexer
)->u
.value
;
8667 /* Parse a linkage-specification.
8669 linkage-specification:
8670 extern string-literal { declaration-seq [opt] }
8671 extern string-literal declaration */
8674 cp_parser_linkage_specification (cp_parser
* parser
)
8678 /* Look for the `extern' keyword. */
8679 cp_parser_require_keyword (parser
, RID_EXTERN
, "%<extern%>");
8681 /* Look for the string-literal. */
8682 linkage
= cp_parser_string_literal (parser
, false, false);
8684 /* Transform the literal into an identifier. If the literal is a
8685 wide-character string, or contains embedded NULs, then we can't
8686 handle it as the user wants. */
8687 if (strlen (TREE_STRING_POINTER (linkage
))
8688 != (size_t) (TREE_STRING_LENGTH (linkage
) - 1))
8690 cp_parser_error (parser
, "invalid linkage-specification");
8691 /* Assume C++ linkage. */
8692 linkage
= lang_name_cplusplus
;
8695 linkage
= get_identifier (TREE_STRING_POINTER (linkage
));
8697 /* We're now using the new linkage. */
8698 push_lang_context (linkage
);
8700 /* If the next token is a `{', then we're using the first
8702 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
8704 /* Consume the `{' token. */
8705 cp_lexer_consume_token (parser
->lexer
);
8706 /* Parse the declarations. */
8707 cp_parser_declaration_seq_opt (parser
);
8708 /* Look for the closing `}'. */
8709 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "%<}%>");
8711 /* Otherwise, there's just one declaration. */
8714 bool saved_in_unbraced_linkage_specification_p
;
8716 saved_in_unbraced_linkage_specification_p
8717 = parser
->in_unbraced_linkage_specification_p
;
8718 parser
->in_unbraced_linkage_specification_p
= true;
8719 cp_parser_declaration (parser
);
8720 parser
->in_unbraced_linkage_specification_p
8721 = saved_in_unbraced_linkage_specification_p
;
8724 /* We're done with the linkage-specification. */
8725 pop_lang_context ();
8728 /* Parse a static_assert-declaration.
8730 static_assert-declaration:
8731 static_assert ( constant-expression , string-literal ) ;
8733 If MEMBER_P, this static_assert is a class member. */
8736 cp_parser_static_assert(cp_parser
*parser
, bool member_p
)
8741 location_t saved_loc
;
8743 /* Peek at the `static_assert' token so we can keep track of exactly
8744 where the static assertion started. */
8745 token
= cp_lexer_peek_token (parser
->lexer
);
8746 saved_loc
= token
->location
;
8748 /* Look for the `static_assert' keyword. */
8749 if (!cp_parser_require_keyword (parser
, RID_STATIC_ASSERT
,
8750 "%<static_assert%>"))
8753 /* We know we are in a static assertion; commit to any tentative
8755 if (cp_parser_parsing_tentatively (parser
))
8756 cp_parser_commit_to_tentative_parse (parser
);
8758 /* Parse the `(' starting the static assertion condition. */
8759 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
8761 /* Parse the constant-expression. */
8763 cp_parser_constant_expression (parser
,
8764 /*allow_non_constant_p=*/false,
8765 /*non_constant_p=*/NULL
);
8767 /* Parse the separating `,'. */
8768 cp_parser_require (parser
, CPP_COMMA
, "%<,%>");
8770 /* Parse the string-literal message. */
8771 message
= cp_parser_string_literal (parser
,
8772 /*translate=*/false,
8775 /* A `)' completes the static assertion. */
8776 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>"))
8777 cp_parser_skip_to_closing_parenthesis (parser
,
8778 /*recovering=*/true,
8780 /*consume_paren=*/true);
8782 /* A semicolon terminates the declaration. */
8783 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
8785 /* Complete the static assertion, which may mean either processing
8786 the static assert now or saving it for template instantiation. */
8787 finish_static_assert (condition
, message
, saved_loc
, member_p
);
8790 /* Parse a `decltype' type. Returns the type.
8792 simple-type-specifier:
8793 decltype ( expression ) */
8796 cp_parser_decltype (cp_parser
*parser
)
8799 bool id_expression_or_member_access_p
= false;
8800 const char *saved_message
;
8801 bool saved_integral_constant_expression_p
;
8802 bool saved_non_integral_constant_expression_p
;
8803 cp_token
*id_expr_start_token
;
8805 /* Look for the `decltype' token. */
8806 if (!cp_parser_require_keyword (parser
, RID_DECLTYPE
, "%<decltype%>"))
8807 return error_mark_node
;
8809 /* Types cannot be defined in a `decltype' expression. Save away the
8811 saved_message
= parser
->type_definition_forbidden_message
;
8813 /* And create the new one. */
8814 parser
->type_definition_forbidden_message
8815 = "types may not be defined in %<decltype%> expressions";
8817 /* The restrictions on constant-expressions do not apply inside
8818 decltype expressions. */
8819 saved_integral_constant_expression_p
8820 = parser
->integral_constant_expression_p
;
8821 saved_non_integral_constant_expression_p
8822 = parser
->non_integral_constant_expression_p
;
8823 parser
->integral_constant_expression_p
= false;
8825 /* Do not actually evaluate the expression. */
8828 /* Parse the opening `('. */
8829 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>"))
8830 return error_mark_node
;
8832 /* First, try parsing an id-expression. */
8833 id_expr_start_token
= cp_lexer_peek_token (parser
->lexer
);
8834 cp_parser_parse_tentatively (parser
);
8835 expr
= cp_parser_id_expression (parser
,
8836 /*template_keyword_p=*/false,
8837 /*check_dependency_p=*/true,
8838 /*template_p=*/NULL
,
8839 /*declarator_p=*/false,
8840 /*optional_p=*/false);
8842 if (!cp_parser_error_occurred (parser
) && expr
!= error_mark_node
)
8844 bool non_integral_constant_expression_p
= false;
8845 tree id_expression
= expr
;
8847 const char *error_msg
;
8849 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
8850 /* Lookup the name we got back from the id-expression. */
8851 expr
= cp_parser_lookup_name (parser
, expr
,
8853 /*is_template=*/false,
8854 /*is_namespace=*/false,
8855 /*check_dependency=*/true,
8856 /*ambiguous_decls=*/NULL
,
8857 id_expr_start_token
->location
);
8860 && expr
!= error_mark_node
8861 && TREE_CODE (expr
) != TEMPLATE_ID_EXPR
8862 && TREE_CODE (expr
) != TYPE_DECL
8863 && (TREE_CODE (expr
) != BIT_NOT_EXPR
8864 || !TYPE_P (TREE_OPERAND (expr
, 0)))
8865 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_CLOSE_PAREN
)
8867 /* Complete lookup of the id-expression. */
8868 expr
= (finish_id_expression
8869 (id_expression
, expr
, parser
->scope
, &idk
,
8870 /*integral_constant_expression_p=*/false,
8871 /*allow_non_integral_constant_expression_p=*/true,
8872 &non_integral_constant_expression_p
,
8873 /*template_p=*/false,
8875 /*address_p=*/false,
8876 /*template_arg_p=*/false,
8878 id_expr_start_token
->location
));
8880 if (expr
== error_mark_node
)
8881 /* We found an id-expression, but it was something that we
8882 should not have found. This is an error, not something
8883 we can recover from, so note that we found an
8884 id-expression and we'll recover as gracefully as
8886 id_expression_or_member_access_p
= true;
8890 && expr
!= error_mark_node
8891 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_CLOSE_PAREN
)
8892 /* We have an id-expression. */
8893 id_expression_or_member_access_p
= true;
8896 if (!id_expression_or_member_access_p
)
8898 /* Abort the id-expression parse. */
8899 cp_parser_abort_tentative_parse (parser
);
8901 /* Parsing tentatively, again. */
8902 cp_parser_parse_tentatively (parser
);
8904 /* Parse a class member access. */
8905 expr
= cp_parser_postfix_expression (parser
, /*address_p=*/false,
8907 /*member_access_only_p=*/true, NULL
);
8910 && expr
!= error_mark_node
8911 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_CLOSE_PAREN
)
8912 /* We have an id-expression. */
8913 id_expression_or_member_access_p
= true;
8916 if (id_expression_or_member_access_p
)
8917 /* We have parsed the complete id-expression or member access. */
8918 cp_parser_parse_definitely (parser
);
8921 /* Abort our attempt to parse an id-expression or member access
8923 cp_parser_abort_tentative_parse (parser
);
8925 /* Parse a full expression. */
8926 expr
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
8929 /* Go back to evaluating expressions. */
8932 /* Restore the old message and the integral constant expression
8934 parser
->type_definition_forbidden_message
= saved_message
;
8935 parser
->integral_constant_expression_p
8936 = saved_integral_constant_expression_p
;
8937 parser
->non_integral_constant_expression_p
8938 = saved_non_integral_constant_expression_p
;
8940 if (expr
== error_mark_node
)
8942 /* Skip everything up to the closing `)'. */
8943 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
8944 /*consume_paren=*/true);
8945 return error_mark_node
;
8948 /* Parse to the closing `)'. */
8949 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>"))
8951 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
8952 /*consume_paren=*/true);
8953 return error_mark_node
;
8956 return finish_decltype_type (expr
, id_expression_or_member_access_p
);
8959 /* Special member functions [gram.special] */
8961 /* Parse a conversion-function-id.
8963 conversion-function-id:
8964 operator conversion-type-id
8966 Returns an IDENTIFIER_NODE representing the operator. */
8969 cp_parser_conversion_function_id (cp_parser
* parser
)
8973 tree saved_qualifying_scope
;
8974 tree saved_object_scope
;
8975 tree pushed_scope
= NULL_TREE
;
8977 /* Look for the `operator' token. */
8978 if (!cp_parser_require_keyword (parser
, RID_OPERATOR
, "%<operator%>"))
8979 return error_mark_node
;
8980 /* When we parse the conversion-type-id, the current scope will be
8981 reset. However, we need that information in able to look up the
8982 conversion function later, so we save it here. */
8983 saved_scope
= parser
->scope
;
8984 saved_qualifying_scope
= parser
->qualifying_scope
;
8985 saved_object_scope
= parser
->object_scope
;
8986 /* We must enter the scope of the class so that the names of
8987 entities declared within the class are available in the
8988 conversion-type-id. For example, consider:
8995 S::operator I() { ... }
8997 In order to see that `I' is a type-name in the definition, we
8998 must be in the scope of `S'. */
9000 pushed_scope
= push_scope (saved_scope
);
9001 /* Parse the conversion-type-id. */
9002 type
= cp_parser_conversion_type_id (parser
);
9003 /* Leave the scope of the class, if any. */
9005 pop_scope (pushed_scope
);
9006 /* Restore the saved scope. */
9007 parser
->scope
= saved_scope
;
9008 parser
->qualifying_scope
= saved_qualifying_scope
;
9009 parser
->object_scope
= saved_object_scope
;
9010 /* If the TYPE is invalid, indicate failure. */
9011 if (type
== error_mark_node
)
9012 return error_mark_node
;
9013 return mangle_conv_op_name_for_type (type
);
9016 /* Parse a conversion-type-id:
9019 type-specifier-seq conversion-declarator [opt]
9021 Returns the TYPE specified. */
9024 cp_parser_conversion_type_id (cp_parser
* parser
)
9027 cp_decl_specifier_seq type_specifiers
;
9028 cp_declarator
*declarator
;
9029 tree type_specified
;
9031 /* Parse the attributes. */
9032 attributes
= cp_parser_attributes_opt (parser
);
9033 /* Parse the type-specifiers. */
9034 cp_parser_type_specifier_seq (parser
, /*is_condition=*/false,
9036 /* If that didn't work, stop. */
9037 if (type_specifiers
.type
== error_mark_node
)
9038 return error_mark_node
;
9039 /* Parse the conversion-declarator. */
9040 declarator
= cp_parser_conversion_declarator_opt (parser
);
9042 type_specified
= grokdeclarator (declarator
, &type_specifiers
, TYPENAME
,
9043 /*initialized=*/0, &attributes
);
9045 cplus_decl_attributes (&type_specified
, attributes
, /*flags=*/0);
9047 /* Don't give this error when parsing tentatively. This happens to
9048 work because we always parse this definitively once. */
9049 if (! cp_parser_uncommitted_to_tentative_parse_p (parser
)
9050 && type_uses_auto (type_specified
))
9052 error ("invalid use of %<auto%> in conversion operator");
9053 return error_mark_node
;
9056 return type_specified
;
9059 /* Parse an (optional) conversion-declarator.
9061 conversion-declarator:
9062 ptr-operator conversion-declarator [opt]
9066 static cp_declarator
*
9067 cp_parser_conversion_declarator_opt (cp_parser
* parser
)
9069 enum tree_code code
;
9071 cp_cv_quals cv_quals
;
9073 /* We don't know if there's a ptr-operator next, or not. */
9074 cp_parser_parse_tentatively (parser
);
9075 /* Try the ptr-operator. */
9076 code
= cp_parser_ptr_operator (parser
, &class_type
, &cv_quals
);
9077 /* If it worked, look for more conversion-declarators. */
9078 if (cp_parser_parse_definitely (parser
))
9080 cp_declarator
*declarator
;
9082 /* Parse another optional declarator. */
9083 declarator
= cp_parser_conversion_declarator_opt (parser
);
9085 return cp_parser_make_indirect_declarator
9086 (code
, class_type
, cv_quals
, declarator
);
9092 /* Parse an (optional) ctor-initializer.
9095 : mem-initializer-list
9097 Returns TRUE iff the ctor-initializer was actually present. */
9100 cp_parser_ctor_initializer_opt (cp_parser
* parser
)
9102 /* If the next token is not a `:', then there is no
9103 ctor-initializer. */
9104 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
9106 /* Do default initialization of any bases and members. */
9107 if (DECL_CONSTRUCTOR_P (current_function_decl
))
9108 finish_mem_initializers (NULL_TREE
);
9113 /* Consume the `:' token. */
9114 cp_lexer_consume_token (parser
->lexer
);
9115 /* And the mem-initializer-list. */
9116 cp_parser_mem_initializer_list (parser
);
9121 /* Parse a mem-initializer-list.
9123 mem-initializer-list:
9124 mem-initializer ... [opt]
9125 mem-initializer ... [opt] , mem-initializer-list */
9128 cp_parser_mem_initializer_list (cp_parser
* parser
)
9130 tree mem_initializer_list
= NULL_TREE
;
9131 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
9133 /* Let the semantic analysis code know that we are starting the
9134 mem-initializer-list. */
9135 if (!DECL_CONSTRUCTOR_P (current_function_decl
))
9136 error ("%Honly constructors take base initializers",
9139 /* Loop through the list. */
9142 tree mem_initializer
;
9144 token
= cp_lexer_peek_token (parser
->lexer
);
9145 /* Parse the mem-initializer. */
9146 mem_initializer
= cp_parser_mem_initializer (parser
);
9147 /* If the next token is a `...', we're expanding member initializers. */
9148 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
9150 /* Consume the `...'. */
9151 cp_lexer_consume_token (parser
->lexer
);
9153 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
9154 can be expanded but members cannot. */
9155 if (mem_initializer
!= error_mark_node
9156 && !TYPE_P (TREE_PURPOSE (mem_initializer
)))
9158 error ("%Hcannot expand initializer for member %<%D%>",
9159 &token
->location
, TREE_PURPOSE (mem_initializer
));
9160 mem_initializer
= error_mark_node
;
9163 /* Construct the pack expansion type. */
9164 if (mem_initializer
!= error_mark_node
)
9165 mem_initializer
= make_pack_expansion (mem_initializer
);
9167 /* Add it to the list, unless it was erroneous. */
9168 if (mem_initializer
!= error_mark_node
)
9170 TREE_CHAIN (mem_initializer
) = mem_initializer_list
;
9171 mem_initializer_list
= mem_initializer
;
9173 /* If the next token is not a `,', we're done. */
9174 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
9176 /* Consume the `,' token. */
9177 cp_lexer_consume_token (parser
->lexer
);
9180 /* Perform semantic analysis. */
9181 if (DECL_CONSTRUCTOR_P (current_function_decl
))
9182 finish_mem_initializers (mem_initializer_list
);
9185 /* Parse a mem-initializer.
9188 mem-initializer-id ( expression-list [opt] )
9189 mem-initializer-id braced-init-list
9194 ( expression-list [opt] )
9196 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
9197 class) or FIELD_DECL (for a non-static data member) to initialize;
9198 the TREE_VALUE is the expression-list. An empty initialization
9199 list is represented by void_list_node. */
9202 cp_parser_mem_initializer (cp_parser
* parser
)
9204 tree mem_initializer_id
;
9205 tree expression_list
;
9207 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
9209 /* Find out what is being initialized. */
9210 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
9212 permerror (token
->location
,
9213 "anachronistic old-style base class initializer");
9214 mem_initializer_id
= NULL_TREE
;
9218 mem_initializer_id
= cp_parser_mem_initializer_id (parser
);
9219 if (mem_initializer_id
== error_mark_node
)
9220 return mem_initializer_id
;
9222 member
= expand_member_init (mem_initializer_id
);
9223 if (member
&& !DECL_P (member
))
9224 in_base_initializer
= 1;
9226 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
9228 bool expr_non_constant_p
;
9229 maybe_warn_cpp0x ("extended initializer lists");
9230 expression_list
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
9231 CONSTRUCTOR_IS_DIRECT_INIT (expression_list
) = 1;
9232 expression_list
= build_tree_list (NULL_TREE
, expression_list
);
9236 = cp_parser_parenthesized_expression_list (parser
, false,
9238 /*allow_expansion_p=*/true,
9239 /*non_constant_p=*/NULL
);
9240 if (expression_list
== error_mark_node
)
9241 return error_mark_node
;
9242 if (!expression_list
)
9243 expression_list
= void_type_node
;
9245 in_base_initializer
= 0;
9247 return member
? build_tree_list (member
, expression_list
) : error_mark_node
;
9250 /* Parse a mem-initializer-id.
9253 :: [opt] nested-name-specifier [opt] class-name
9256 Returns a TYPE indicating the class to be initializer for the first
9257 production. Returns an IDENTIFIER_NODE indicating the data member
9258 to be initialized for the second production. */
9261 cp_parser_mem_initializer_id (cp_parser
* parser
)
9263 bool global_scope_p
;
9264 bool nested_name_specifier_p
;
9265 bool template_p
= false;
9268 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
9270 /* `typename' is not allowed in this context ([temp.res]). */
9271 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TYPENAME
))
9273 error ("%Hkeyword %<typename%> not allowed in this context (a qualified "
9274 "member initializer is implicitly a type)",
9276 cp_lexer_consume_token (parser
->lexer
);
9278 /* Look for the optional `::' operator. */
9280 = (cp_parser_global_scope_opt (parser
,
9281 /*current_scope_valid_p=*/false)
9283 /* Look for the optional nested-name-specifier. The simplest way to
9288 The keyword `typename' is not permitted in a base-specifier or
9289 mem-initializer; in these contexts a qualified name that
9290 depends on a template-parameter is implicitly assumed to be a
9293 is to assume that we have seen the `typename' keyword at this
9295 nested_name_specifier_p
9296 = (cp_parser_nested_name_specifier_opt (parser
,
9297 /*typename_keyword_p=*/true,
9298 /*check_dependency_p=*/true,
9300 /*is_declaration=*/true)
9302 if (nested_name_specifier_p
)
9303 template_p
= cp_parser_optional_template_keyword (parser
);
9304 /* If there is a `::' operator or a nested-name-specifier, then we
9305 are definitely looking for a class-name. */
9306 if (global_scope_p
|| nested_name_specifier_p
)
9307 return cp_parser_class_name (parser
,
9308 /*typename_keyword_p=*/true,
9309 /*template_keyword_p=*/template_p
,
9311 /*check_dependency_p=*/true,
9312 /*class_head_p=*/false,
9313 /*is_declaration=*/true);
9314 /* Otherwise, we could also be looking for an ordinary identifier. */
9315 cp_parser_parse_tentatively (parser
);
9316 /* Try a class-name. */
9317 id
= cp_parser_class_name (parser
,
9318 /*typename_keyword_p=*/true,
9319 /*template_keyword_p=*/false,
9321 /*check_dependency_p=*/true,
9322 /*class_head_p=*/false,
9323 /*is_declaration=*/true);
9324 /* If we found one, we're done. */
9325 if (cp_parser_parse_definitely (parser
))
9327 /* Otherwise, look for an ordinary identifier. */
9328 return cp_parser_identifier (parser
);
9331 /* Overloading [gram.over] */
9333 /* Parse an operator-function-id.
9335 operator-function-id:
9338 Returns an IDENTIFIER_NODE for the operator which is a
9339 human-readable spelling of the identifier, e.g., `operator +'. */
9342 cp_parser_operator_function_id (cp_parser
* parser
)
9344 /* Look for the `operator' keyword. */
9345 if (!cp_parser_require_keyword (parser
, RID_OPERATOR
, "%<operator%>"))
9346 return error_mark_node
;
9347 /* And then the name of the operator itself. */
9348 return cp_parser_operator (parser
);
9351 /* Parse an operator.
9354 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
9355 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
9356 || ++ -- , ->* -> () []
9363 Returns an IDENTIFIER_NODE for the operator which is a
9364 human-readable spelling of the identifier, e.g., `operator +'. */
9367 cp_parser_operator (cp_parser
* parser
)
9369 tree id
= NULL_TREE
;
9372 /* Peek at the next token. */
9373 token
= cp_lexer_peek_token (parser
->lexer
);
9374 /* Figure out which operator we have. */
9375 switch (token
->type
)
9381 /* The keyword should be either `new' or `delete'. */
9382 if (token
->keyword
== RID_NEW
)
9384 else if (token
->keyword
== RID_DELETE
)
9389 /* Consume the `new' or `delete' token. */
9390 cp_lexer_consume_token (parser
->lexer
);
9392 /* Peek at the next token. */
9393 token
= cp_lexer_peek_token (parser
->lexer
);
9394 /* If it's a `[' token then this is the array variant of the
9396 if (token
->type
== CPP_OPEN_SQUARE
)
9398 /* Consume the `[' token. */
9399 cp_lexer_consume_token (parser
->lexer
);
9400 /* Look for the `]' token. */
9401 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, "%<]%>");
9402 id
= ansi_opname (op
== NEW_EXPR
9403 ? VEC_NEW_EXPR
: VEC_DELETE_EXPR
);
9405 /* Otherwise, we have the non-array variant. */
9407 id
= ansi_opname (op
);
9413 id
= ansi_opname (PLUS_EXPR
);
9417 id
= ansi_opname (MINUS_EXPR
);
9421 id
= ansi_opname (MULT_EXPR
);
9425 id
= ansi_opname (TRUNC_DIV_EXPR
);
9429 id
= ansi_opname (TRUNC_MOD_EXPR
);
9433 id
= ansi_opname (BIT_XOR_EXPR
);
9437 id
= ansi_opname (BIT_AND_EXPR
);
9441 id
= ansi_opname (BIT_IOR_EXPR
);
9445 id
= ansi_opname (BIT_NOT_EXPR
);
9449 id
= ansi_opname (TRUTH_NOT_EXPR
);
9453 id
= ansi_assopname (NOP_EXPR
);
9457 id
= ansi_opname (LT_EXPR
);
9461 id
= ansi_opname (GT_EXPR
);
9465 id
= ansi_assopname (PLUS_EXPR
);
9469 id
= ansi_assopname (MINUS_EXPR
);
9473 id
= ansi_assopname (MULT_EXPR
);
9477 id
= ansi_assopname (TRUNC_DIV_EXPR
);
9481 id
= ansi_assopname (TRUNC_MOD_EXPR
);
9485 id
= ansi_assopname (BIT_XOR_EXPR
);
9489 id
= ansi_assopname (BIT_AND_EXPR
);
9493 id
= ansi_assopname (BIT_IOR_EXPR
);
9497 id
= ansi_opname (LSHIFT_EXPR
);
9501 id
= ansi_opname (RSHIFT_EXPR
);
9505 id
= ansi_assopname (LSHIFT_EXPR
);
9509 id
= ansi_assopname (RSHIFT_EXPR
);
9513 id
= ansi_opname (EQ_EXPR
);
9517 id
= ansi_opname (NE_EXPR
);
9521 id
= ansi_opname (LE_EXPR
);
9524 case CPP_GREATER_EQ
:
9525 id
= ansi_opname (GE_EXPR
);
9529 id
= ansi_opname (TRUTH_ANDIF_EXPR
);
9533 id
= ansi_opname (TRUTH_ORIF_EXPR
);
9537 id
= ansi_opname (POSTINCREMENT_EXPR
);
9540 case CPP_MINUS_MINUS
:
9541 id
= ansi_opname (PREDECREMENT_EXPR
);
9545 id
= ansi_opname (COMPOUND_EXPR
);
9548 case CPP_DEREF_STAR
:
9549 id
= ansi_opname (MEMBER_REF
);
9553 id
= ansi_opname (COMPONENT_REF
);
9556 case CPP_OPEN_PAREN
:
9557 /* Consume the `('. */
9558 cp_lexer_consume_token (parser
->lexer
);
9559 /* Look for the matching `)'. */
9560 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
9561 return ansi_opname (CALL_EXPR
);
9563 case CPP_OPEN_SQUARE
:
9564 /* Consume the `['. */
9565 cp_lexer_consume_token (parser
->lexer
);
9566 /* Look for the matching `]'. */
9567 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, "%<]%>");
9568 return ansi_opname (ARRAY_REF
);
9571 /* Anything else is an error. */
9575 /* If we have selected an identifier, we need to consume the
9578 cp_lexer_consume_token (parser
->lexer
);
9579 /* Otherwise, no valid operator name was present. */
9582 cp_parser_error (parser
, "expected operator");
9583 id
= error_mark_node
;
9589 /* Parse a template-declaration.
9591 template-declaration:
9592 export [opt] template < template-parameter-list > declaration
9594 If MEMBER_P is TRUE, this template-declaration occurs within a
9597 The grammar rule given by the standard isn't correct. What
9600 template-declaration:
9601 export [opt] template-parameter-list-seq
9602 decl-specifier-seq [opt] init-declarator [opt] ;
9603 export [opt] template-parameter-list-seq
9606 template-parameter-list-seq:
9607 template-parameter-list-seq [opt]
9608 template < template-parameter-list > */
9611 cp_parser_template_declaration (cp_parser
* parser
, bool member_p
)
9613 /* Check for `export'. */
9614 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_EXPORT
))
9616 /* Consume the `export' token. */
9617 cp_lexer_consume_token (parser
->lexer
);
9618 /* Warn that we do not support `export'. */
9619 warning (0, "keyword %<export%> not implemented, and will be ignored");
9622 cp_parser_template_declaration_after_export (parser
, member_p
);
9625 /* Parse a template-parameter-list.
9627 template-parameter-list:
9629 template-parameter-list , template-parameter
9631 Returns a TREE_LIST. Each node represents a template parameter.
9632 The nodes are connected via their TREE_CHAINs. */
9635 cp_parser_template_parameter_list (cp_parser
* parser
)
9637 tree parameter_list
= NULL_TREE
;
9639 begin_template_parm_list ();
9644 bool is_parameter_pack
;
9646 /* Parse the template-parameter. */
9647 parameter
= cp_parser_template_parameter (parser
,
9649 &is_parameter_pack
);
9650 /* Add it to the list. */
9651 if (parameter
!= error_mark_node
)
9652 parameter_list
= process_template_parm (parameter_list
,
9658 tree err_parm
= build_tree_list (parameter
, parameter
);
9659 TREE_VALUE (err_parm
) = error_mark_node
;
9660 parameter_list
= chainon (parameter_list
, err_parm
);
9663 /* If the next token is not a `,', we're done. */
9664 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
9666 /* Otherwise, consume the `,' token. */
9667 cp_lexer_consume_token (parser
->lexer
);
9670 return end_template_parm_list (parameter_list
);
9673 /* Parse a template-parameter.
9677 parameter-declaration
9679 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
9680 the parameter. The TREE_PURPOSE is the default value, if any.
9681 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
9682 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
9683 set to true iff this parameter is a parameter pack. */
9686 cp_parser_template_parameter (cp_parser
* parser
, bool *is_non_type
,
9687 bool *is_parameter_pack
)
9690 cp_parameter_declarator
*parameter_declarator
;
9691 cp_declarator
*id_declarator
;
9694 /* Assume it is a type parameter or a template parameter. */
9695 *is_non_type
= false;
9696 /* Assume it not a parameter pack. */
9697 *is_parameter_pack
= false;
9698 /* Peek at the next token. */
9699 token
= cp_lexer_peek_token (parser
->lexer
);
9700 /* If it is `class' or `template', we have a type-parameter. */
9701 if (token
->keyword
== RID_TEMPLATE
)
9702 return cp_parser_type_parameter (parser
, is_parameter_pack
);
9703 /* If it is `class' or `typename' we do not know yet whether it is a
9704 type parameter or a non-type parameter. Consider:
9706 template <typename T, typename T::X X> ...
9710 template <class C, class D*> ...
9712 Here, the first parameter is a type parameter, and the second is
9713 a non-type parameter. We can tell by looking at the token after
9714 the identifier -- if it is a `,', `=', or `>' then we have a type
9716 if (token
->keyword
== RID_TYPENAME
|| token
->keyword
== RID_CLASS
)
9718 /* Peek at the token after `class' or `typename'. */
9719 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
9720 /* If it's an ellipsis, we have a template type parameter
9722 if (token
->type
== CPP_ELLIPSIS
)
9723 return cp_parser_type_parameter (parser
, is_parameter_pack
);
9724 /* If it's an identifier, skip it. */
9725 if (token
->type
== CPP_NAME
)
9726 token
= cp_lexer_peek_nth_token (parser
->lexer
, 3);
9727 /* Now, see if the token looks like the end of a template
9729 if (token
->type
== CPP_COMMA
9730 || token
->type
== CPP_EQ
9731 || token
->type
== CPP_GREATER
)
9732 return cp_parser_type_parameter (parser
, is_parameter_pack
);
9735 /* Otherwise, it is a non-type parameter.
9739 When parsing a default template-argument for a non-type
9740 template-parameter, the first non-nested `>' is taken as the end
9741 of the template parameter-list rather than a greater-than
9743 *is_non_type
= true;
9744 parameter_declarator
9745 = cp_parser_parameter_declaration (parser
, /*template_parm_p=*/true,
9746 /*parenthesized_p=*/NULL
);
9748 /* If the parameter declaration is marked as a parameter pack, set
9749 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
9750 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
9752 if (parameter_declarator
9753 && parameter_declarator
->declarator
9754 && parameter_declarator
->declarator
->parameter_pack_p
)
9756 *is_parameter_pack
= true;
9757 parameter_declarator
->declarator
->parameter_pack_p
= false;
9760 /* If the next token is an ellipsis, and we don't already have it
9761 marked as a parameter pack, then we have a parameter pack (that
9762 has no declarator). */
9763 if (!*is_parameter_pack
9764 && cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
)
9765 && declarator_can_be_parameter_pack (parameter_declarator
->declarator
))
9767 /* Consume the `...'. */
9768 cp_lexer_consume_token (parser
->lexer
);
9769 maybe_warn_variadic_templates ();
9771 *is_parameter_pack
= true;
9773 /* We might end up with a pack expansion as the type of the non-type
9774 template parameter, in which case this is a non-type template
9776 else if (parameter_declarator
9777 && parameter_declarator
->decl_specifiers
.type
9778 && PACK_EXPANSION_P (parameter_declarator
->decl_specifiers
.type
))
9780 *is_parameter_pack
= true;
9781 parameter_declarator
->decl_specifiers
.type
=
9782 PACK_EXPANSION_PATTERN (parameter_declarator
->decl_specifiers
.type
);
9785 if (*is_parameter_pack
&& cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
9787 /* Parameter packs cannot have default arguments. However, a
9788 user may try to do so, so we'll parse them and give an
9789 appropriate diagnostic here. */
9791 /* Consume the `='. */
9792 cp_token
*start_token
= cp_lexer_peek_token (parser
->lexer
);
9793 cp_lexer_consume_token (parser
->lexer
);
9795 /* Find the name of the parameter pack. */
9796 id_declarator
= parameter_declarator
->declarator
;
9797 while (id_declarator
&& id_declarator
->kind
!= cdk_id
)
9798 id_declarator
= id_declarator
->declarator
;
9800 if (id_declarator
&& id_declarator
->kind
== cdk_id
)
9801 error ("%Htemplate parameter pack %qD cannot have a default argument",
9802 &start_token
->location
, id_declarator
->u
.id
.unqualified_name
);
9804 error ("%Htemplate parameter pack cannot have a default argument",
9805 &start_token
->location
);
9807 /* Parse the default argument, but throw away the result. */
9808 cp_parser_default_argument (parser
, /*template_parm_p=*/true);
9811 parm
= grokdeclarator (parameter_declarator
->declarator
,
9812 ¶meter_declarator
->decl_specifiers
,
9813 PARM
, /*initialized=*/0,
9815 if (parm
== error_mark_node
)
9816 return error_mark_node
;
9818 return build_tree_list (parameter_declarator
->default_argument
, parm
);
9821 /* Parse a type-parameter.
9824 class identifier [opt]
9825 class identifier [opt] = type-id
9826 typename identifier [opt]
9827 typename identifier [opt] = type-id
9828 template < template-parameter-list > class identifier [opt]
9829 template < template-parameter-list > class identifier [opt]
9832 GNU Extension (variadic templates):
9835 class ... identifier [opt]
9836 typename ... identifier [opt]
9838 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
9839 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
9840 the declaration of the parameter.
9842 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
9845 cp_parser_type_parameter (cp_parser
* parser
, bool *is_parameter_pack
)
9850 /* Look for a keyword to tell us what kind of parameter this is. */
9851 token
= cp_parser_require (parser
, CPP_KEYWORD
,
9852 "%<class%>, %<typename%>, or %<template%>");
9854 return error_mark_node
;
9856 switch (token
->keyword
)
9862 tree default_argument
;
9864 /* If the next token is an ellipsis, we have a template
9866 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
9868 /* Consume the `...' token. */
9869 cp_lexer_consume_token (parser
->lexer
);
9870 maybe_warn_variadic_templates ();
9872 *is_parameter_pack
= true;
9875 /* If the next token is an identifier, then it names the
9877 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
9878 identifier
= cp_parser_identifier (parser
);
9880 identifier
= NULL_TREE
;
9882 /* Create the parameter. */
9883 parameter
= finish_template_type_parm (class_type_node
, identifier
);
9885 /* If the next token is an `=', we have a default argument. */
9886 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
9888 /* Consume the `=' token. */
9889 cp_lexer_consume_token (parser
->lexer
);
9890 /* Parse the default-argument. */
9891 push_deferring_access_checks (dk_no_deferred
);
9892 default_argument
= cp_parser_type_id (parser
);
9894 /* Template parameter packs cannot have default
9896 if (*is_parameter_pack
)
9899 error ("%Htemplate parameter pack %qD cannot have a "
9900 "default argument", &token
->location
, identifier
);
9902 error ("%Htemplate parameter packs cannot have "
9903 "default arguments", &token
->location
);
9904 default_argument
= NULL_TREE
;
9906 pop_deferring_access_checks ();
9909 default_argument
= NULL_TREE
;
9911 /* Create the combined representation of the parameter and the
9912 default argument. */
9913 parameter
= build_tree_list (default_argument
, parameter
);
9919 tree parameter_list
;
9921 tree default_argument
;
9923 /* Look for the `<'. */
9924 cp_parser_require (parser
, CPP_LESS
, "%<<%>");
9925 /* Parse the template-parameter-list. */
9926 parameter_list
= cp_parser_template_parameter_list (parser
);
9927 /* Look for the `>'. */
9928 cp_parser_require (parser
, CPP_GREATER
, "%<>%>");
9929 /* Look for the `class' keyword. */
9930 cp_parser_require_keyword (parser
, RID_CLASS
, "%<class%>");
9931 /* If the next token is an ellipsis, we have a template
9933 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
9935 /* Consume the `...' token. */
9936 cp_lexer_consume_token (parser
->lexer
);
9937 maybe_warn_variadic_templates ();
9939 *is_parameter_pack
= true;
9941 /* If the next token is an `=', then there is a
9942 default-argument. If the next token is a `>', we are at
9943 the end of the parameter-list. If the next token is a `,',
9944 then we are at the end of this parameter. */
9945 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
)
9946 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_GREATER
)
9947 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
9949 identifier
= cp_parser_identifier (parser
);
9950 /* Treat invalid names as if the parameter were nameless. */
9951 if (identifier
== error_mark_node
)
9952 identifier
= NULL_TREE
;
9955 identifier
= NULL_TREE
;
9957 /* Create the template parameter. */
9958 parameter
= finish_template_template_parm (class_type_node
,
9961 /* If the next token is an `=', then there is a
9962 default-argument. */
9963 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
9967 /* Consume the `='. */
9968 cp_lexer_consume_token (parser
->lexer
);
9969 /* Parse the id-expression. */
9970 push_deferring_access_checks (dk_no_deferred
);
9971 /* save token before parsing the id-expression, for error
9973 token
= cp_lexer_peek_token (parser
->lexer
);
9975 = cp_parser_id_expression (parser
,
9976 /*template_keyword_p=*/false,
9977 /*check_dependency_p=*/true,
9978 /*template_p=*/&is_template
,
9979 /*declarator_p=*/false,
9980 /*optional_p=*/false);
9981 if (TREE_CODE (default_argument
) == TYPE_DECL
)
9982 /* If the id-expression was a template-id that refers to
9983 a template-class, we already have the declaration here,
9984 so no further lookup is needed. */
9987 /* Look up the name. */
9989 = cp_parser_lookup_name (parser
, default_argument
,
9991 /*is_template=*/is_template
,
9992 /*is_namespace=*/false,
9993 /*check_dependency=*/true,
9994 /*ambiguous_decls=*/NULL
,
9996 /* See if the default argument is valid. */
9998 = check_template_template_default_arg (default_argument
);
10000 /* Template parameter packs cannot have default
10002 if (*is_parameter_pack
)
10005 error ("%Htemplate parameter pack %qD cannot "
10006 "have a default argument",
10007 &token
->location
, identifier
);
10009 error ("%Htemplate parameter packs cannot "
10010 "have default arguments",
10012 default_argument
= NULL_TREE
;
10014 pop_deferring_access_checks ();
10017 default_argument
= NULL_TREE
;
10019 /* Create the combined representation of the parameter and the
10020 default argument. */
10021 parameter
= build_tree_list (default_argument
, parameter
);
10026 gcc_unreachable ();
10033 /* Parse a template-id.
10036 template-name < template-argument-list [opt] >
10038 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
10039 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
10040 returned. Otherwise, if the template-name names a function, or set
10041 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
10042 names a class, returns a TYPE_DECL for the specialization.
10044 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
10045 uninstantiated templates. */
10048 cp_parser_template_id (cp_parser
*parser
,
10049 bool template_keyword_p
,
10050 bool check_dependency_p
,
10051 bool is_declaration
)
10057 cp_token_position start_of_id
= 0;
10058 deferred_access_check
*chk
;
10059 VEC (deferred_access_check
,gc
) *access_check
;
10060 cp_token
*next_token
= NULL
, *next_token_2
= NULL
, *token
= NULL
;
10061 bool is_identifier
;
10063 /* If the next token corresponds to a template-id, there is no need
10065 next_token
= cp_lexer_peek_token (parser
->lexer
);
10066 if (next_token
->type
== CPP_TEMPLATE_ID
)
10068 struct tree_check
*check_value
;
10070 /* Get the stored value. */
10071 check_value
= cp_lexer_consume_token (parser
->lexer
)->u
.tree_check_value
;
10072 /* Perform any access checks that were deferred. */
10073 access_check
= check_value
->checks
;
10077 VEC_iterate (deferred_access_check
, access_check
, i
, chk
) ;
10080 perform_or_defer_access_check (chk
->binfo
,
10085 /* Return the stored value. */
10086 return check_value
->value
;
10089 /* Avoid performing name lookup if there is no possibility of
10090 finding a template-id. */
10091 if ((next_token
->type
!= CPP_NAME
&& next_token
->keyword
!= RID_OPERATOR
)
10092 || (next_token
->type
== CPP_NAME
10093 && !cp_parser_nth_token_starts_template_argument_list_p
10096 cp_parser_error (parser
, "expected template-id");
10097 return error_mark_node
;
10100 /* Remember where the template-id starts. */
10101 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
10102 start_of_id
= cp_lexer_token_position (parser
->lexer
, false);
10104 push_deferring_access_checks (dk_deferred
);
10106 /* Parse the template-name. */
10107 is_identifier
= false;
10108 token
= cp_lexer_peek_token (parser
->lexer
);
10109 templ
= cp_parser_template_name (parser
, template_keyword_p
,
10110 check_dependency_p
,
10113 if (templ
== error_mark_node
|| is_identifier
)
10115 pop_deferring_access_checks ();
10119 /* If we find the sequence `[:' after a template-name, it's probably
10120 a digraph-typo for `< ::'. Substitute the tokens and check if we can
10121 parse correctly the argument list. */
10122 next_token
= cp_lexer_peek_token (parser
->lexer
);
10123 next_token_2
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
10124 if (next_token
->type
== CPP_OPEN_SQUARE
10125 && next_token
->flags
& DIGRAPH
10126 && next_token_2
->type
== CPP_COLON
10127 && !(next_token_2
->flags
& PREV_WHITE
))
10129 cp_parser_parse_tentatively (parser
);
10130 /* Change `:' into `::'. */
10131 next_token_2
->type
= CPP_SCOPE
;
10132 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
10134 cp_lexer_consume_token (parser
->lexer
);
10136 /* Parse the arguments. */
10137 arguments
= cp_parser_enclosed_template_argument_list (parser
);
10138 if (!cp_parser_parse_definitely (parser
))
10140 /* If we couldn't parse an argument list, then we revert our changes
10141 and return simply an error. Maybe this is not a template-id
10143 next_token_2
->type
= CPP_COLON
;
10144 cp_parser_error (parser
, "expected %<<%>");
10145 pop_deferring_access_checks ();
10146 return error_mark_node
;
10148 /* Otherwise, emit an error about the invalid digraph, but continue
10149 parsing because we got our argument list. */
10150 if (permerror (next_token
->location
,
10151 "%<<::%> cannot begin a template-argument list"))
10153 static bool hint
= false;
10154 inform (next_token
->location
,
10155 "%<<:%> is an alternate spelling for %<[%>."
10156 " Insert whitespace between %<<%> and %<::%>");
10157 if (!hint
&& !flag_permissive
)
10159 inform (next_token
->location
, "(if you use %<-fpermissive%>"
10160 " G++ will accept your code)");
10167 /* Look for the `<' that starts the template-argument-list. */
10168 if (!cp_parser_require (parser
, CPP_LESS
, "%<<%>"))
10170 pop_deferring_access_checks ();
10171 return error_mark_node
;
10173 /* Parse the arguments. */
10174 arguments
= cp_parser_enclosed_template_argument_list (parser
);
10177 /* Build a representation of the specialization. */
10178 if (TREE_CODE (templ
) == IDENTIFIER_NODE
)
10179 template_id
= build_min_nt (TEMPLATE_ID_EXPR
, templ
, arguments
);
10180 else if (DECL_CLASS_TEMPLATE_P (templ
)
10181 || DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
10183 bool entering_scope
;
10184 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
10185 template (rather than some instantiation thereof) only if
10186 is not nested within some other construct. For example, in
10187 "template <typename T> void f(T) { A<T>::", A<T> is just an
10188 instantiation of A. */
10189 entering_scope
= (template_parm_scope_p ()
10190 && cp_lexer_next_token_is (parser
->lexer
,
10193 = finish_template_type (templ
, arguments
, entering_scope
);
10197 /* If it's not a class-template or a template-template, it should be
10198 a function-template. */
10199 gcc_assert ((DECL_FUNCTION_TEMPLATE_P (templ
)
10200 || TREE_CODE (templ
) == OVERLOAD
10201 || BASELINK_P (templ
)));
10203 template_id
= lookup_template_function (templ
, arguments
);
10206 /* If parsing tentatively, replace the sequence of tokens that makes
10207 up the template-id with a CPP_TEMPLATE_ID token. That way,
10208 should we re-parse the token stream, we will not have to repeat
10209 the effort required to do the parse, nor will we issue duplicate
10210 error messages about problems during instantiation of the
10214 cp_token
*token
= cp_lexer_token_at (parser
->lexer
, start_of_id
);
10216 /* Reset the contents of the START_OF_ID token. */
10217 token
->type
= CPP_TEMPLATE_ID
;
10218 /* Retrieve any deferred checks. Do not pop this access checks yet
10219 so the memory will not be reclaimed during token replacing below. */
10220 token
->u
.tree_check_value
= GGC_CNEW (struct tree_check
);
10221 token
->u
.tree_check_value
->value
= template_id
;
10222 token
->u
.tree_check_value
->checks
= get_deferred_access_checks ();
10223 token
->keyword
= RID_MAX
;
10225 /* Purge all subsequent tokens. */
10226 cp_lexer_purge_tokens_after (parser
->lexer
, start_of_id
);
10228 /* ??? Can we actually assume that, if template_id ==
10229 error_mark_node, we will have issued a diagnostic to the
10230 user, as opposed to simply marking the tentative parse as
10232 if (cp_parser_error_occurred (parser
) && template_id
!= error_mark_node
)
10233 error ("%Hparse error in template argument list",
10237 pop_deferring_access_checks ();
10238 return template_id
;
10241 /* Parse a template-name.
10246 The standard should actually say:
10250 operator-function-id
10252 A defect report has been filed about this issue.
10254 A conversion-function-id cannot be a template name because they cannot
10255 be part of a template-id. In fact, looking at this code:
10257 a.operator K<int>()
10259 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
10260 It is impossible to call a templated conversion-function-id with an
10261 explicit argument list, since the only allowed template parameter is
10262 the type to which it is converting.
10264 If TEMPLATE_KEYWORD_P is true, then we have just seen the
10265 `template' keyword, in a construction like:
10269 In that case `f' is taken to be a template-name, even though there
10270 is no way of knowing for sure.
10272 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
10273 name refers to a set of overloaded functions, at least one of which
10274 is a template, or an IDENTIFIER_NODE with the name of the template,
10275 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
10276 names are looked up inside uninstantiated templates. */
10279 cp_parser_template_name (cp_parser
* parser
,
10280 bool template_keyword_p
,
10281 bool check_dependency_p
,
10282 bool is_declaration
,
10283 bool *is_identifier
)
10288 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
10290 /* If the next token is `operator', then we have either an
10291 operator-function-id or a conversion-function-id. */
10292 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_OPERATOR
))
10294 /* We don't know whether we're looking at an
10295 operator-function-id or a conversion-function-id. */
10296 cp_parser_parse_tentatively (parser
);
10297 /* Try an operator-function-id. */
10298 identifier
= cp_parser_operator_function_id (parser
);
10299 /* If that didn't work, try a conversion-function-id. */
10300 if (!cp_parser_parse_definitely (parser
))
10302 cp_parser_error (parser
, "expected template-name");
10303 return error_mark_node
;
10306 /* Look for the identifier. */
10308 identifier
= cp_parser_identifier (parser
);
10310 /* If we didn't find an identifier, we don't have a template-id. */
10311 if (identifier
== error_mark_node
)
10312 return error_mark_node
;
10314 /* If the name immediately followed the `template' keyword, then it
10315 is a template-name. However, if the next token is not `<', then
10316 we do not treat it as a template-name, since it is not being used
10317 as part of a template-id. This enables us to handle constructs
10320 template <typename T> struct S { S(); };
10321 template <typename T> S<T>::S();
10323 correctly. We would treat `S' as a template -- if it were `S<T>'
10324 -- but we do not if there is no `<'. */
10326 if (processing_template_decl
10327 && cp_parser_nth_token_starts_template_argument_list_p (parser
, 1))
10329 /* In a declaration, in a dependent context, we pretend that the
10330 "template" keyword was present in order to improve error
10331 recovery. For example, given:
10333 template <typename T> void f(T::X<int>);
10335 we want to treat "X<int>" as a template-id. */
10337 && !template_keyword_p
10338 && parser
->scope
&& TYPE_P (parser
->scope
)
10339 && check_dependency_p
10340 && dependent_scope_p (parser
->scope
)
10341 /* Do not do this for dtors (or ctors), since they never
10342 need the template keyword before their name. */
10343 && !constructor_name_p (identifier
, parser
->scope
))
10345 cp_token_position start
= 0;
10347 /* Explain what went wrong. */
10348 error ("%Hnon-template %qD used as template",
10349 &token
->location
, identifier
);
10350 inform (input_location
, "use %<%T::template %D%> to indicate that it is a template",
10351 parser
->scope
, identifier
);
10352 /* If parsing tentatively, find the location of the "<" token. */
10353 if (cp_parser_simulate_error (parser
))
10354 start
= cp_lexer_token_position (parser
->lexer
, true);
10355 /* Parse the template arguments so that we can issue error
10356 messages about them. */
10357 cp_lexer_consume_token (parser
->lexer
);
10358 cp_parser_enclosed_template_argument_list (parser
);
10359 /* Skip tokens until we find a good place from which to
10360 continue parsing. */
10361 cp_parser_skip_to_closing_parenthesis (parser
,
10362 /*recovering=*/true,
10364 /*consume_paren=*/false);
10365 /* If parsing tentatively, permanently remove the
10366 template argument list. That will prevent duplicate
10367 error messages from being issued about the missing
10368 "template" keyword. */
10370 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
10372 *is_identifier
= true;
10376 /* If the "template" keyword is present, then there is generally
10377 no point in doing name-lookup, so we just return IDENTIFIER.
10378 But, if the qualifying scope is non-dependent then we can
10379 (and must) do name-lookup normally. */
10380 if (template_keyword_p
10382 || (TYPE_P (parser
->scope
)
10383 && dependent_type_p (parser
->scope
))))
10387 /* Look up the name. */
10388 decl
= cp_parser_lookup_name (parser
, identifier
,
10390 /*is_template=*/false,
10391 /*is_namespace=*/false,
10392 check_dependency_p
,
10393 /*ambiguous_decls=*/NULL
,
10395 decl
= maybe_get_template_decl_from_type_decl (decl
);
10397 /* If DECL is a template, then the name was a template-name. */
10398 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
10402 tree fn
= NULL_TREE
;
10404 /* The standard does not explicitly indicate whether a name that
10405 names a set of overloaded declarations, some of which are
10406 templates, is a template-name. However, such a name should
10407 be a template-name; otherwise, there is no way to form a
10408 template-id for the overloaded templates. */
10409 fns
= BASELINK_P (decl
) ? BASELINK_FUNCTIONS (decl
) : decl
;
10410 if (TREE_CODE (fns
) == OVERLOAD
)
10411 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
10412 if (TREE_CODE (OVL_CURRENT (fn
)) == TEMPLATE_DECL
)
10417 /* The name does not name a template. */
10418 cp_parser_error (parser
, "expected template-name");
10419 return error_mark_node
;
10423 /* If DECL is dependent, and refers to a function, then just return
10424 its name; we will look it up again during template instantiation. */
10425 if (DECL_FUNCTION_TEMPLATE_P (decl
) || !DECL_P (decl
))
10427 tree scope
= CP_DECL_CONTEXT (get_first_fn (decl
));
10428 if (TYPE_P (scope
) && dependent_type_p (scope
))
10435 /* Parse a template-argument-list.
10437 template-argument-list:
10438 template-argument ... [opt]
10439 template-argument-list , template-argument ... [opt]
10441 Returns a TREE_VEC containing the arguments. */
10444 cp_parser_template_argument_list (cp_parser
* parser
)
10446 tree fixed_args
[10];
10447 unsigned n_args
= 0;
10448 unsigned alloced
= 10;
10449 tree
*arg_ary
= fixed_args
;
10451 bool saved_in_template_argument_list_p
;
10453 bool saved_non_ice_p
;
10455 saved_in_template_argument_list_p
= parser
->in_template_argument_list_p
;
10456 parser
->in_template_argument_list_p
= true;
10457 /* Even if the template-id appears in an integral
10458 constant-expression, the contents of the argument list do
10460 saved_ice_p
= parser
->integral_constant_expression_p
;
10461 parser
->integral_constant_expression_p
= false;
10462 saved_non_ice_p
= parser
->non_integral_constant_expression_p
;
10463 parser
->non_integral_constant_expression_p
= false;
10464 /* Parse the arguments. */
10470 /* Consume the comma. */
10471 cp_lexer_consume_token (parser
->lexer
);
10473 /* Parse the template-argument. */
10474 argument
= cp_parser_template_argument (parser
);
10476 /* If the next token is an ellipsis, we're expanding a template
10478 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
10480 /* Consume the `...' token. */
10481 cp_lexer_consume_token (parser
->lexer
);
10483 /* Make the argument into a TYPE_PACK_EXPANSION or
10484 EXPR_PACK_EXPANSION. */
10485 argument
= make_pack_expansion (argument
);
10488 if (n_args
== alloced
)
10492 if (arg_ary
== fixed_args
)
10494 arg_ary
= XNEWVEC (tree
, alloced
);
10495 memcpy (arg_ary
, fixed_args
, sizeof (tree
) * n_args
);
10498 arg_ary
= XRESIZEVEC (tree
, arg_ary
, alloced
);
10500 arg_ary
[n_args
++] = argument
;
10502 while (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
));
10504 vec
= make_tree_vec (n_args
);
10507 TREE_VEC_ELT (vec
, n_args
) = arg_ary
[n_args
];
10509 if (arg_ary
!= fixed_args
)
10511 parser
->non_integral_constant_expression_p
= saved_non_ice_p
;
10512 parser
->integral_constant_expression_p
= saved_ice_p
;
10513 parser
->in_template_argument_list_p
= saved_in_template_argument_list_p
;
10517 /* Parse a template-argument.
10520 assignment-expression
10524 The representation is that of an assignment-expression, type-id, or
10525 id-expression -- except that the qualified id-expression is
10526 evaluated, so that the value returned is either a DECL or an
10529 Although the standard says "assignment-expression", it forbids
10530 throw-expressions or assignments in the template argument.
10531 Therefore, we use "conditional-expression" instead. */
10534 cp_parser_template_argument (cp_parser
* parser
)
10539 bool maybe_type_id
= false;
10540 cp_token
*token
= NULL
, *argument_start_token
= NULL
;
10543 /* There's really no way to know what we're looking at, so we just
10544 try each alternative in order.
10548 In a template-argument, an ambiguity between a type-id and an
10549 expression is resolved to a type-id, regardless of the form of
10550 the corresponding template-parameter.
10552 Therefore, we try a type-id first. */
10553 cp_parser_parse_tentatively (parser
);
10554 argument
= cp_parser_template_type_arg (parser
);
10555 /* If there was no error parsing the type-id but the next token is a
10556 '>>', our behavior depends on which dialect of C++ we're
10557 parsing. In C++98, we probably found a typo for '> >'. But there
10558 are type-id which are also valid expressions. For instance:
10560 struct X { int operator >> (int); };
10561 template <int V> struct Foo {};
10564 Here 'X()' is a valid type-id of a function type, but the user just
10565 wanted to write the expression "X() >> 5". Thus, we remember that we
10566 found a valid type-id, but we still try to parse the argument as an
10567 expression to see what happens.
10569 In C++0x, the '>>' will be considered two separate '>'
10571 if (!cp_parser_error_occurred (parser
)
10572 && cxx_dialect
== cxx98
10573 && cp_lexer_next_token_is (parser
->lexer
, CPP_RSHIFT
))
10575 maybe_type_id
= true;
10576 cp_parser_abort_tentative_parse (parser
);
10580 /* If the next token isn't a `,' or a `>', then this argument wasn't
10581 really finished. This means that the argument is not a valid
10583 if (!cp_parser_next_token_ends_template_argument_p (parser
))
10584 cp_parser_error (parser
, "expected template-argument");
10585 /* If that worked, we're done. */
10586 if (cp_parser_parse_definitely (parser
))
10589 /* We're still not sure what the argument will be. */
10590 cp_parser_parse_tentatively (parser
);
10591 /* Try a template. */
10592 argument_start_token
= cp_lexer_peek_token (parser
->lexer
);
10593 argument
= cp_parser_id_expression (parser
,
10594 /*template_keyword_p=*/false,
10595 /*check_dependency_p=*/true,
10597 /*declarator_p=*/false,
10598 /*optional_p=*/false);
10599 /* If the next token isn't a `,' or a `>', then this argument wasn't
10600 really finished. */
10601 if (!cp_parser_next_token_ends_template_argument_p (parser
))
10602 cp_parser_error (parser
, "expected template-argument");
10603 if (!cp_parser_error_occurred (parser
))
10605 /* Figure out what is being referred to. If the id-expression
10606 was for a class template specialization, then we will have a
10607 TYPE_DECL at this point. There is no need to do name lookup
10608 at this point in that case. */
10609 if (TREE_CODE (argument
) != TYPE_DECL
)
10610 argument
= cp_parser_lookup_name (parser
, argument
,
10612 /*is_template=*/template_p
,
10613 /*is_namespace=*/false,
10614 /*check_dependency=*/true,
10615 /*ambiguous_decls=*/NULL
,
10616 argument_start_token
->location
);
10617 if (TREE_CODE (argument
) != TEMPLATE_DECL
10618 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
10619 cp_parser_error (parser
, "expected template-name");
10621 if (cp_parser_parse_definitely (parser
))
10623 /* It must be a non-type argument. There permitted cases are given
10624 in [temp.arg.nontype]:
10626 -- an integral constant-expression of integral or enumeration
10629 -- the name of a non-type template-parameter; or
10631 -- the name of an object or function with external linkage...
10633 -- the address of an object or function with external linkage...
10635 -- a pointer to member... */
10636 /* Look for a non-type template parameter. */
10637 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
10639 cp_parser_parse_tentatively (parser
);
10640 argument
= cp_parser_primary_expression (parser
,
10641 /*address_p=*/false,
10643 /*template_arg_p=*/true,
10645 if (TREE_CODE (argument
) != TEMPLATE_PARM_INDEX
10646 || !cp_parser_next_token_ends_template_argument_p (parser
))
10647 cp_parser_simulate_error (parser
);
10648 if (cp_parser_parse_definitely (parser
))
10652 /* If the next token is "&", the argument must be the address of an
10653 object or function with external linkage. */
10654 address_p
= cp_lexer_next_token_is (parser
->lexer
, CPP_AND
);
10656 cp_lexer_consume_token (parser
->lexer
);
10657 /* See if we might have an id-expression. */
10658 token
= cp_lexer_peek_token (parser
->lexer
);
10659 if (token
->type
== CPP_NAME
10660 || token
->keyword
== RID_OPERATOR
10661 || token
->type
== CPP_SCOPE
10662 || token
->type
== CPP_TEMPLATE_ID
10663 || token
->type
== CPP_NESTED_NAME_SPECIFIER
)
10665 cp_parser_parse_tentatively (parser
);
10666 argument
= cp_parser_primary_expression (parser
,
10669 /*template_arg_p=*/true,
10671 if (cp_parser_error_occurred (parser
)
10672 || !cp_parser_next_token_ends_template_argument_p (parser
))
10673 cp_parser_abort_tentative_parse (parser
);
10676 if (TREE_CODE (argument
) == INDIRECT_REF
)
10678 gcc_assert (REFERENCE_REF_P (argument
));
10679 argument
= TREE_OPERAND (argument
, 0);
10682 if (TREE_CODE (argument
) == VAR_DECL
)
10684 /* A variable without external linkage might still be a
10685 valid constant-expression, so no error is issued here
10686 if the external-linkage check fails. */
10687 if (!address_p
&& !DECL_EXTERNAL_LINKAGE_P (argument
))
10688 cp_parser_simulate_error (parser
);
10690 else if (is_overloaded_fn (argument
))
10691 /* All overloaded functions are allowed; if the external
10692 linkage test does not pass, an error will be issued
10696 && (TREE_CODE (argument
) == OFFSET_REF
10697 || TREE_CODE (argument
) == SCOPE_REF
))
10698 /* A pointer-to-member. */
10700 else if (TREE_CODE (argument
) == TEMPLATE_PARM_INDEX
)
10703 cp_parser_simulate_error (parser
);
10705 if (cp_parser_parse_definitely (parser
))
10708 argument
= build_x_unary_op (ADDR_EXPR
, argument
,
10709 tf_warning_or_error
);
10714 /* If the argument started with "&", there are no other valid
10715 alternatives at this point. */
10718 cp_parser_error (parser
, "invalid non-type template argument");
10719 return error_mark_node
;
10722 /* If the argument wasn't successfully parsed as a type-id followed
10723 by '>>', the argument can only be a constant expression now.
10724 Otherwise, we try parsing the constant-expression tentatively,
10725 because the argument could really be a type-id. */
10727 cp_parser_parse_tentatively (parser
);
10728 argument
= cp_parser_constant_expression (parser
,
10729 /*allow_non_constant_p=*/false,
10730 /*non_constant_p=*/NULL
);
10731 argument
= fold_non_dependent_expr (argument
);
10732 if (!maybe_type_id
)
10734 if (!cp_parser_next_token_ends_template_argument_p (parser
))
10735 cp_parser_error (parser
, "expected template-argument");
10736 if (cp_parser_parse_definitely (parser
))
10738 /* We did our best to parse the argument as a non type-id, but that
10739 was the only alternative that matched (albeit with a '>' after
10740 it). We can assume it's just a typo from the user, and a
10741 diagnostic will then be issued. */
10742 return cp_parser_template_type_arg (parser
);
10745 /* Parse an explicit-instantiation.
10747 explicit-instantiation:
10748 template declaration
10750 Although the standard says `declaration', what it really means is:
10752 explicit-instantiation:
10753 template decl-specifier-seq [opt] declarator [opt] ;
10755 Things like `template int S<int>::i = 5, int S<double>::j;' are not
10756 supposed to be allowed. A defect report has been filed about this
10761 explicit-instantiation:
10762 storage-class-specifier template
10763 decl-specifier-seq [opt] declarator [opt] ;
10764 function-specifier template
10765 decl-specifier-seq [opt] declarator [opt] ; */
10768 cp_parser_explicit_instantiation (cp_parser
* parser
)
10770 int declares_class_or_enum
;
10771 cp_decl_specifier_seq decl_specifiers
;
10772 tree extension_specifier
= NULL_TREE
;
10775 /* Look for an (optional) storage-class-specifier or
10776 function-specifier. */
10777 if (cp_parser_allow_gnu_extensions_p (parser
))
10779 extension_specifier
10780 = cp_parser_storage_class_specifier_opt (parser
);
10781 if (!extension_specifier
)
10782 extension_specifier
10783 = cp_parser_function_specifier_opt (parser
,
10784 /*decl_specs=*/NULL
);
10787 /* Look for the `template' keyword. */
10788 cp_parser_require_keyword (parser
, RID_TEMPLATE
, "%<template%>");
10789 /* Let the front end know that we are processing an explicit
10791 begin_explicit_instantiation ();
10792 /* [temp.explicit] says that we are supposed to ignore access
10793 control while processing explicit instantiation directives. */
10794 push_deferring_access_checks (dk_no_check
);
10795 /* Parse a decl-specifier-seq. */
10796 token
= cp_lexer_peek_token (parser
->lexer
);
10797 cp_parser_decl_specifier_seq (parser
,
10798 CP_PARSER_FLAGS_OPTIONAL
,
10800 &declares_class_or_enum
);
10801 /* If there was exactly one decl-specifier, and it declared a class,
10802 and there's no declarator, then we have an explicit type
10804 if (declares_class_or_enum
&& cp_parser_declares_only_class_p (parser
))
10808 type
= check_tag_decl (&decl_specifiers
);
10809 /* Turn access control back on for names used during
10810 template instantiation. */
10811 pop_deferring_access_checks ();
10813 do_type_instantiation (type
, extension_specifier
,
10814 /*complain=*/tf_error
);
10818 cp_declarator
*declarator
;
10821 /* Parse the declarator. */
10823 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
10824 /*ctor_dtor_or_conv_p=*/NULL
,
10825 /*parenthesized_p=*/NULL
,
10826 /*member_p=*/false);
10827 if (declares_class_or_enum
& 2)
10828 cp_parser_check_for_definition_in_return_type (declarator
,
10829 decl_specifiers
.type
,
10830 decl_specifiers
.type_location
);
10831 if (declarator
!= cp_error_declarator
)
10833 decl
= grokdeclarator (declarator
, &decl_specifiers
,
10834 NORMAL
, 0, &decl_specifiers
.attributes
);
10835 /* Turn access control back on for names used during
10836 template instantiation. */
10837 pop_deferring_access_checks ();
10838 /* Do the explicit instantiation. */
10839 do_decl_instantiation (decl
, extension_specifier
);
10843 pop_deferring_access_checks ();
10844 /* Skip the body of the explicit instantiation. */
10845 cp_parser_skip_to_end_of_statement (parser
);
10848 /* We're done with the instantiation. */
10849 end_explicit_instantiation ();
10851 cp_parser_consume_semicolon_at_end_of_statement (parser
);
10854 /* Parse an explicit-specialization.
10856 explicit-specialization:
10857 template < > declaration
10859 Although the standard says `declaration', what it really means is:
10861 explicit-specialization:
10862 template <> decl-specifier [opt] init-declarator [opt] ;
10863 template <> function-definition
10864 template <> explicit-specialization
10865 template <> template-declaration */
10868 cp_parser_explicit_specialization (cp_parser
* parser
)
10870 bool need_lang_pop
;
10871 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
10873 /* Look for the `template' keyword. */
10874 cp_parser_require_keyword (parser
, RID_TEMPLATE
, "%<template%>");
10875 /* Look for the `<'. */
10876 cp_parser_require (parser
, CPP_LESS
, "%<<%>");
10877 /* Look for the `>'. */
10878 cp_parser_require (parser
, CPP_GREATER
, "%<>%>");
10879 /* We have processed another parameter list. */
10880 ++parser
->num_template_parameter_lists
;
10883 A template ... explicit specialization ... shall not have C
10885 if (current_lang_name
== lang_name_c
)
10887 error ("%Htemplate specialization with C linkage", &token
->location
);
10888 /* Give it C++ linkage to avoid confusing other parts of the
10890 push_lang_context (lang_name_cplusplus
);
10891 need_lang_pop
= true;
10894 need_lang_pop
= false;
10895 /* Let the front end know that we are beginning a specialization. */
10896 if (!begin_specialization ())
10898 end_specialization ();
10902 /* If the next keyword is `template', we need to figure out whether
10903 or not we're looking a template-declaration. */
10904 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
10906 if (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_LESS
10907 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
!= CPP_GREATER
)
10908 cp_parser_template_declaration_after_export (parser
,
10909 /*member_p=*/false);
10911 cp_parser_explicit_specialization (parser
);
10914 /* Parse the dependent declaration. */
10915 cp_parser_single_declaration (parser
,
10917 /*member_p=*/false,
10918 /*explicit_specialization_p=*/true,
10919 /*friend_p=*/NULL
);
10920 /* We're done with the specialization. */
10921 end_specialization ();
10922 /* For the erroneous case of a template with C linkage, we pushed an
10923 implicit C++ linkage scope; exit that scope now. */
10925 pop_lang_context ();
10926 /* We're done with this parameter list. */
10927 --parser
->num_template_parameter_lists
;
10930 /* Parse a type-specifier.
10933 simple-type-specifier
10936 elaborated-type-specifier
10944 Returns a representation of the type-specifier. For a
10945 class-specifier, enum-specifier, or elaborated-type-specifier, a
10946 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
10948 The parser flags FLAGS is used to control type-specifier parsing.
10950 If IS_DECLARATION is TRUE, then this type-specifier is appearing
10951 in a decl-specifier-seq.
10953 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
10954 class-specifier, enum-specifier, or elaborated-type-specifier, then
10955 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
10956 if a type is declared; 2 if it is defined. Otherwise, it is set to
10959 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
10960 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
10961 is set to FALSE. */
10964 cp_parser_type_specifier (cp_parser
* parser
,
10965 cp_parser_flags flags
,
10966 cp_decl_specifier_seq
*decl_specs
,
10967 bool is_declaration
,
10968 int* declares_class_or_enum
,
10969 bool* is_cv_qualifier
)
10971 tree type_spec
= NULL_TREE
;
10974 cp_decl_spec ds
= ds_last
;
10976 /* Assume this type-specifier does not declare a new type. */
10977 if (declares_class_or_enum
)
10978 *declares_class_or_enum
= 0;
10979 /* And that it does not specify a cv-qualifier. */
10980 if (is_cv_qualifier
)
10981 *is_cv_qualifier
= false;
10982 /* Peek at the next token. */
10983 token
= cp_lexer_peek_token (parser
->lexer
);
10985 /* If we're looking at a keyword, we can use that to guide the
10986 production we choose. */
10987 keyword
= token
->keyword
;
10991 /* Look for the enum-specifier. */
10992 type_spec
= cp_parser_enum_specifier (parser
);
10993 /* If that worked, we're done. */
10996 if (declares_class_or_enum
)
10997 *declares_class_or_enum
= 2;
10999 cp_parser_set_decl_spec_type (decl_specs
,
11002 /*user_defined_p=*/true);
11006 goto elaborated_type_specifier
;
11008 /* Any of these indicate either a class-specifier, or an
11009 elaborated-type-specifier. */
11013 /* Parse tentatively so that we can back up if we don't find a
11014 class-specifier. */
11015 cp_parser_parse_tentatively (parser
);
11016 /* Look for the class-specifier. */
11017 type_spec
= cp_parser_class_specifier (parser
);
11018 /* If that worked, we're done. */
11019 if (cp_parser_parse_definitely (parser
))
11021 if (declares_class_or_enum
)
11022 *declares_class_or_enum
= 2;
11024 cp_parser_set_decl_spec_type (decl_specs
,
11027 /*user_defined_p=*/true);
11031 /* Fall through. */
11032 elaborated_type_specifier
:
11033 /* We're declaring (not defining) a class or enum. */
11034 if (declares_class_or_enum
)
11035 *declares_class_or_enum
= 1;
11037 /* Fall through. */
11039 /* Look for an elaborated-type-specifier. */
11041 = (cp_parser_elaborated_type_specifier
11043 decl_specs
&& decl_specs
->specs
[(int) ds_friend
],
11046 cp_parser_set_decl_spec_type (decl_specs
,
11049 /*user_defined_p=*/true);
11054 if (is_cv_qualifier
)
11055 *is_cv_qualifier
= true;
11060 if (is_cv_qualifier
)
11061 *is_cv_qualifier
= true;
11066 if (is_cv_qualifier
)
11067 *is_cv_qualifier
= true;
11071 /* The `__complex__' keyword is a GNU extension. */
11079 /* Handle simple keywords. */
11084 ++decl_specs
->specs
[(int)ds
];
11085 decl_specs
->any_specifiers_p
= true;
11087 return cp_lexer_consume_token (parser
->lexer
)->u
.value
;
11090 /* If we do not already have a type-specifier, assume we are looking
11091 at a simple-type-specifier. */
11092 type_spec
= cp_parser_simple_type_specifier (parser
,
11096 /* If we didn't find a type-specifier, and a type-specifier was not
11097 optional in this context, issue an error message. */
11098 if (!type_spec
&& !(flags
& CP_PARSER_FLAGS_OPTIONAL
))
11100 cp_parser_error (parser
, "expected type specifier");
11101 return error_mark_node
;
11107 /* Parse a simple-type-specifier.
11109 simple-type-specifier:
11110 :: [opt] nested-name-specifier [opt] type-name
11111 :: [opt] nested-name-specifier template template-id
11126 simple-type-specifier:
11128 decltype ( expression )
11134 simple-type-specifier:
11135 __typeof__ unary-expression
11136 __typeof__ ( type-id )
11138 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
11139 appropriately updated. */
11142 cp_parser_simple_type_specifier (cp_parser
* parser
,
11143 cp_decl_specifier_seq
*decl_specs
,
11144 cp_parser_flags flags
)
11146 tree type
= NULL_TREE
;
11149 /* Peek at the next token. */
11150 token
= cp_lexer_peek_token (parser
->lexer
);
11152 /* If we're looking at a keyword, things are easy. */
11153 switch (token
->keyword
)
11157 decl_specs
->explicit_char_p
= true;
11158 type
= char_type_node
;
11161 type
= char16_type_node
;
11164 type
= char32_type_node
;
11167 type
= wchar_type_node
;
11170 type
= boolean_type_node
;
11174 ++decl_specs
->specs
[(int) ds_short
];
11175 type
= short_integer_type_node
;
11179 decl_specs
->explicit_int_p
= true;
11180 type
= integer_type_node
;
11184 ++decl_specs
->specs
[(int) ds_long
];
11185 type
= long_integer_type_node
;
11189 ++decl_specs
->specs
[(int) ds_signed
];
11190 type
= integer_type_node
;
11194 ++decl_specs
->specs
[(int) ds_unsigned
];
11195 type
= unsigned_type_node
;
11198 type
= float_type_node
;
11201 type
= double_type_node
;
11204 type
= void_type_node
;
11208 maybe_warn_cpp0x ("C++0x auto");
11209 type
= make_auto ();
11213 /* Parse the `decltype' type. */
11214 type
= cp_parser_decltype (parser
);
11217 cp_parser_set_decl_spec_type (decl_specs
, type
,
11219 /*user_defined_p=*/true);
11224 /* Consume the `typeof' token. */
11225 cp_lexer_consume_token (parser
->lexer
);
11226 /* Parse the operand to `typeof'. */
11227 type
= cp_parser_sizeof_operand (parser
, RID_TYPEOF
);
11228 /* If it is not already a TYPE, take its type. */
11229 if (!TYPE_P (type
))
11230 type
= finish_typeof (type
);
11233 cp_parser_set_decl_spec_type (decl_specs
, type
,
11235 /*user_defined_p=*/true);
11243 /* If the type-specifier was for a built-in type, we're done. */
11248 /* Record the type. */
11250 && (token
->keyword
!= RID_SIGNED
11251 && token
->keyword
!= RID_UNSIGNED
11252 && token
->keyword
!= RID_SHORT
11253 && token
->keyword
!= RID_LONG
))
11254 cp_parser_set_decl_spec_type (decl_specs
,
11257 /*user_defined=*/false);
11259 decl_specs
->any_specifiers_p
= true;
11261 /* Consume the token. */
11262 id
= cp_lexer_consume_token (parser
->lexer
)->u
.value
;
11264 /* There is no valid C++ program where a non-template type is
11265 followed by a "<". That usually indicates that the user thought
11266 that the type was a template. */
11267 cp_parser_check_for_invalid_template_id (parser
, type
, token
->location
);
11269 return TYPE_NAME (type
);
11272 /* The type-specifier must be a user-defined type. */
11273 if (!(flags
& CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
))
11278 /* Don't gobble tokens or issue error messages if this is an
11279 optional type-specifier. */
11280 if (flags
& CP_PARSER_FLAGS_OPTIONAL
)
11281 cp_parser_parse_tentatively (parser
);
11283 /* Look for the optional `::' operator. */
11285 = (cp_parser_global_scope_opt (parser
,
11286 /*current_scope_valid_p=*/false)
11288 /* Look for the nested-name specifier. */
11290 = (cp_parser_nested_name_specifier_opt (parser
,
11291 /*typename_keyword_p=*/false,
11292 /*check_dependency_p=*/true,
11294 /*is_declaration=*/false)
11296 token
= cp_lexer_peek_token (parser
->lexer
);
11297 /* If we have seen a nested-name-specifier, and the next token
11298 is `template', then we are using the template-id production. */
11300 && cp_parser_optional_template_keyword (parser
))
11302 /* Look for the template-id. */
11303 type
= cp_parser_template_id (parser
,
11304 /*template_keyword_p=*/true,
11305 /*check_dependency_p=*/true,
11306 /*is_declaration=*/false);
11307 /* If the template-id did not name a type, we are out of
11309 if (TREE_CODE (type
) != TYPE_DECL
)
11311 cp_parser_error (parser
, "expected template-id for type");
11315 /* Otherwise, look for a type-name. */
11317 type
= cp_parser_type_name (parser
);
11318 /* Keep track of all name-lookups performed in class scopes. */
11322 && TREE_CODE (type
) == TYPE_DECL
11323 && TREE_CODE (DECL_NAME (type
)) == IDENTIFIER_NODE
)
11324 maybe_note_name_used_in_class (DECL_NAME (type
), type
);
11325 /* If it didn't work out, we don't have a TYPE. */
11326 if ((flags
& CP_PARSER_FLAGS_OPTIONAL
)
11327 && !cp_parser_parse_definitely (parser
))
11329 if (type
&& decl_specs
)
11330 cp_parser_set_decl_spec_type (decl_specs
, type
,
11332 /*user_defined=*/true);
11335 /* If we didn't get a type-name, issue an error message. */
11336 if (!type
&& !(flags
& CP_PARSER_FLAGS_OPTIONAL
))
11338 cp_parser_error (parser
, "expected type-name");
11339 return error_mark_node
;
11342 /* There is no valid C++ program where a non-template type is
11343 followed by a "<". That usually indicates that the user thought
11344 that the type was a template. */
11345 if (type
&& type
!= error_mark_node
)
11347 /* As a last-ditch effort, see if TYPE is an Objective-C type.
11348 If it is, then the '<'...'>' enclose protocol names rather than
11349 template arguments, and so everything is fine. */
11350 if (c_dialect_objc ()
11351 && (objc_is_id (type
) || objc_is_class_name (type
)))
11353 tree protos
= cp_parser_objc_protocol_refs_opt (parser
);
11354 tree qual_type
= objc_get_protocol_qualified_type (type
, protos
);
11356 /* Clobber the "unqualified" type previously entered into
11357 DECL_SPECS with the new, improved protocol-qualified version. */
11359 decl_specs
->type
= qual_type
;
11364 cp_parser_check_for_invalid_template_id (parser
, TREE_TYPE (type
),
11371 /* Parse a type-name.
11384 Returns a TYPE_DECL for the type. */
11387 cp_parser_type_name (cp_parser
* parser
)
11391 /* We can't know yet whether it is a class-name or not. */
11392 cp_parser_parse_tentatively (parser
);
11393 /* Try a class-name. */
11394 type_decl
= cp_parser_class_name (parser
,
11395 /*typename_keyword_p=*/false,
11396 /*template_keyword_p=*/false,
11398 /*check_dependency_p=*/true,
11399 /*class_head_p=*/false,
11400 /*is_declaration=*/false);
11401 /* If it's not a class-name, keep looking. */
11402 if (!cp_parser_parse_definitely (parser
))
11404 /* It must be a typedef-name or an enum-name. */
11405 return cp_parser_nonclass_name (parser
);
11411 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
11419 Returns a TYPE_DECL for the type. */
11422 cp_parser_nonclass_name (cp_parser
* parser
)
11427 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
11428 identifier
= cp_parser_identifier (parser
);
11429 if (identifier
== error_mark_node
)
11430 return error_mark_node
;
11432 /* Look up the type-name. */
11433 type_decl
= cp_parser_lookup_name_simple (parser
, identifier
, token
->location
);
11435 if (TREE_CODE (type_decl
) != TYPE_DECL
11436 && (objc_is_id (identifier
) || objc_is_class_name (identifier
)))
11438 /* See if this is an Objective-C type. */
11439 tree protos
= cp_parser_objc_protocol_refs_opt (parser
);
11440 tree type
= objc_get_protocol_qualified_type (identifier
, protos
);
11442 type_decl
= TYPE_NAME (type
);
11445 /* Issue an error if we did not find a type-name. */
11446 if (TREE_CODE (type_decl
) != TYPE_DECL
)
11448 if (!cp_parser_simulate_error (parser
))
11449 cp_parser_name_lookup_error (parser
, identifier
, type_decl
,
11450 "is not a type", token
->location
);
11451 return error_mark_node
;
11453 /* Remember that the name was used in the definition of the
11454 current class so that we can check later to see if the
11455 meaning would have been different after the class was
11456 entirely defined. */
11457 else if (type_decl
!= error_mark_node
11459 maybe_note_name_used_in_class (identifier
, type_decl
);
11464 /* Parse an elaborated-type-specifier. Note that the grammar given
11465 here incorporates the resolution to DR68.
11467 elaborated-type-specifier:
11468 class-key :: [opt] nested-name-specifier [opt] identifier
11469 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
11470 enum-key :: [opt] nested-name-specifier [opt] identifier
11471 typename :: [opt] nested-name-specifier identifier
11472 typename :: [opt] nested-name-specifier template [opt]
11477 elaborated-type-specifier:
11478 class-key attributes :: [opt] nested-name-specifier [opt] identifier
11479 class-key attributes :: [opt] nested-name-specifier [opt]
11480 template [opt] template-id
11481 enum attributes :: [opt] nested-name-specifier [opt] identifier
11483 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
11484 declared `friend'. If IS_DECLARATION is TRUE, then this
11485 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
11486 something is being declared.
11488 Returns the TYPE specified. */
11491 cp_parser_elaborated_type_specifier (cp_parser
* parser
,
11493 bool is_declaration
)
11495 enum tag_types tag_type
;
11497 tree type
= NULL_TREE
;
11498 tree attributes
= NULL_TREE
;
11499 cp_token
*token
= NULL
;
11501 /* See if we're looking at the `enum' keyword. */
11502 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ENUM
))
11504 /* Consume the `enum' token. */
11505 cp_lexer_consume_token (parser
->lexer
);
11506 /* Remember that it's an enumeration type. */
11507 tag_type
= enum_type
;
11508 /* Parse the optional `struct' or `class' key (for C++0x scoped
11510 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_CLASS
)
11511 || cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STRUCT
))
11513 if (cxx_dialect
== cxx98
)
11514 maybe_warn_cpp0x ("scoped enums");
11516 /* Consume the `struct' or `class'. */
11517 cp_lexer_consume_token (parser
->lexer
);
11519 /* Parse the attributes. */
11520 attributes
= cp_parser_attributes_opt (parser
);
11522 /* Or, it might be `typename'. */
11523 else if (cp_lexer_next_token_is_keyword (parser
->lexer
,
11526 /* Consume the `typename' token. */
11527 cp_lexer_consume_token (parser
->lexer
);
11528 /* Remember that it's a `typename' type. */
11529 tag_type
= typename_type
;
11530 /* The `typename' keyword is only allowed in templates. */
11531 if (!processing_template_decl
)
11532 permerror (input_location
, "using %<typename%> outside of template");
11534 /* Otherwise it must be a class-key. */
11537 tag_type
= cp_parser_class_key (parser
);
11538 if (tag_type
== none_type
)
11539 return error_mark_node
;
11540 /* Parse the attributes. */
11541 attributes
= cp_parser_attributes_opt (parser
);
11544 /* Look for the `::' operator. */
11545 cp_parser_global_scope_opt (parser
,
11546 /*current_scope_valid_p=*/false);
11547 /* Look for the nested-name-specifier. */
11548 if (tag_type
== typename_type
)
11550 if (!cp_parser_nested_name_specifier (parser
,
11551 /*typename_keyword_p=*/true,
11552 /*check_dependency_p=*/true,
11555 return error_mark_node
;
11558 /* Even though `typename' is not present, the proposed resolution
11559 to Core Issue 180 says that in `class A<T>::B', `B' should be
11560 considered a type-name, even if `A<T>' is dependent. */
11561 cp_parser_nested_name_specifier_opt (parser
,
11562 /*typename_keyword_p=*/true,
11563 /*check_dependency_p=*/true,
11566 /* For everything but enumeration types, consider a template-id.
11567 For an enumeration type, consider only a plain identifier. */
11568 if (tag_type
!= enum_type
)
11570 bool template_p
= false;
11573 /* Allow the `template' keyword. */
11574 template_p
= cp_parser_optional_template_keyword (parser
);
11575 /* If we didn't see `template', we don't know if there's a
11576 template-id or not. */
11578 cp_parser_parse_tentatively (parser
);
11579 /* Parse the template-id. */
11580 token
= cp_lexer_peek_token (parser
->lexer
);
11581 decl
= cp_parser_template_id (parser
, template_p
,
11582 /*check_dependency_p=*/true,
11584 /* If we didn't find a template-id, look for an ordinary
11586 if (!template_p
&& !cp_parser_parse_definitely (parser
))
11588 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
11589 in effect, then we must assume that, upon instantiation, the
11590 template will correspond to a class. */
11591 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
11592 && tag_type
== typename_type
)
11593 type
= make_typename_type (parser
->scope
, decl
,
11595 /*complain=*/tf_error
);
11596 /* If the `typename' keyword is in effect and DECL is not a type
11597 decl. Then type is non existant. */
11598 else if (tag_type
== typename_type
&& TREE_CODE (decl
) != TYPE_DECL
)
11601 type
= TREE_TYPE (decl
);
11606 token
= cp_lexer_peek_token (parser
->lexer
);
11607 identifier
= cp_parser_identifier (parser
);
11609 if (identifier
== error_mark_node
)
11611 parser
->scope
= NULL_TREE
;
11612 return error_mark_node
;
11615 /* For a `typename', we needn't call xref_tag. */
11616 if (tag_type
== typename_type
11617 && TREE_CODE (parser
->scope
) != NAMESPACE_DECL
)
11618 return cp_parser_make_typename_type (parser
, parser
->scope
,
11621 /* Look up a qualified name in the usual way. */
11625 tree ambiguous_decls
;
11627 decl
= cp_parser_lookup_name (parser
, identifier
,
11629 /*is_template=*/false,
11630 /*is_namespace=*/false,
11631 /*check_dependency=*/true,
11635 /* If the lookup was ambiguous, an error will already have been
11637 if (ambiguous_decls
)
11638 return error_mark_node
;
11640 /* If we are parsing friend declaration, DECL may be a
11641 TEMPLATE_DECL tree node here. However, we need to check
11642 whether this TEMPLATE_DECL results in valid code. Consider
11643 the following example:
11646 template <class T> class C {};
11649 template <class T> friend class N::C; // #1, valid code
11651 template <class T> class Y {
11652 friend class N::C; // #2, invalid code
11655 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
11656 name lookup of `N::C'. We see that friend declaration must
11657 be template for the code to be valid. Note that
11658 processing_template_decl does not work here since it is
11659 always 1 for the above two cases. */
11661 decl
= (cp_parser_maybe_treat_template_as_class
11662 (decl
, /*tag_name_p=*/is_friend
11663 && parser
->num_template_parameter_lists
));
11665 if (TREE_CODE (decl
) != TYPE_DECL
)
11667 cp_parser_diagnose_invalid_type_name (parser
,
11671 return error_mark_node
;
11674 if (TREE_CODE (TREE_TYPE (decl
)) != TYPENAME_TYPE
)
11676 bool allow_template
= (parser
->num_template_parameter_lists
11677 || DECL_SELF_REFERENCE_P (decl
));
11678 type
= check_elaborated_type_specifier (tag_type
, decl
,
11681 if (type
== error_mark_node
)
11682 return error_mark_node
;
11685 /* Forward declarations of nested types, such as
11690 are invalid unless all components preceding the final '::'
11691 are complete. If all enclosing types are complete, these
11692 declarations become merely pointless.
11694 Invalid forward declarations of nested types are errors
11695 caught elsewhere in parsing. Those that are pointless arrive
11698 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
11699 && !is_friend
&& !processing_explicit_instantiation
)
11700 warning (0, "declaration %qD does not declare anything", decl
);
11702 type
= TREE_TYPE (decl
);
11706 /* An elaborated-type-specifier sometimes introduces a new type and
11707 sometimes names an existing type. Normally, the rule is that it
11708 introduces a new type only if there is not an existing type of
11709 the same name already in scope. For example, given:
11712 void f() { struct S s; }
11714 the `struct S' in the body of `f' is the same `struct S' as in
11715 the global scope; the existing definition is used. However, if
11716 there were no global declaration, this would introduce a new
11717 local class named `S'.
11719 An exception to this rule applies to the following code:
11721 namespace N { struct S; }
11723 Here, the elaborated-type-specifier names a new type
11724 unconditionally; even if there is already an `S' in the
11725 containing scope this declaration names a new type.
11726 This exception only applies if the elaborated-type-specifier
11727 forms the complete declaration:
11731 A declaration consisting solely of `class-key identifier ;' is
11732 either a redeclaration of the name in the current scope or a
11733 forward declaration of the identifier as a class name. It
11734 introduces the name into the current scope.
11736 We are in this situation precisely when the next token is a `;'.
11738 An exception to the exception is that a `friend' declaration does
11739 *not* name a new type; i.e., given:
11741 struct S { friend struct T; };
11743 `T' is not a new type in the scope of `S'.
11745 Also, `new struct S' or `sizeof (struct S)' never results in the
11746 definition of a new type; a new type can only be declared in a
11747 declaration context. */
11753 /* Friends have special name lookup rules. */
11754 ts
= ts_within_enclosing_non_class
;
11755 else if (is_declaration
11756 && cp_lexer_next_token_is (parser
->lexer
,
11758 /* This is a `class-key identifier ;' */
11764 (parser
->num_template_parameter_lists
11765 && (cp_parser_next_token_starts_class_definition_p (parser
)
11766 || cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)));
11767 /* An unqualified name was used to reference this type, so
11768 there were no qualifying templates. */
11769 if (!cp_parser_check_template_parameters (parser
,
11770 /*num_templates=*/0,
11772 /*declarator=*/NULL
))
11773 return error_mark_node
;
11774 type
= xref_tag (tag_type
, identifier
, ts
, template_p
);
11778 if (type
== error_mark_node
)
11779 return error_mark_node
;
11781 /* Allow attributes on forward declarations of classes. */
11784 if (TREE_CODE (type
) == TYPENAME_TYPE
)
11785 warning (OPT_Wattributes
,
11786 "attributes ignored on uninstantiated type");
11787 else if (tag_type
!= enum_type
&& CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
11788 && ! processing_explicit_instantiation
)
11789 warning (OPT_Wattributes
,
11790 "attributes ignored on template instantiation");
11791 else if (is_declaration
&& cp_parser_declares_only_class_p (parser
))
11792 cplus_decl_attributes (&type
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
11794 warning (OPT_Wattributes
,
11795 "attributes ignored on elaborated-type-specifier that is not a forward declaration");
11798 if (tag_type
!= enum_type
)
11799 cp_parser_check_class_key (tag_type
, type
);
11801 /* A "<" cannot follow an elaborated type specifier. If that
11802 happens, the user was probably trying to form a template-id. */
11803 cp_parser_check_for_invalid_template_id (parser
, type
, token
->location
);
11808 /* Parse an enum-specifier.
11811 enum-key identifier [opt] enum-base [opt] { enumerator-list [opt] }
11816 enum struct [C++0x]
11819 : type-specifier-seq
11822 enum-key attributes[opt] identifier [opt] enum-base [opt]
11823 { enumerator-list [opt] }attributes[opt]
11825 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
11826 if the token stream isn't an enum-specifier after all. */
11829 cp_parser_enum_specifier (cp_parser
* parser
)
11834 bool scoped_enum_p
= false;
11835 bool has_underlying_type
= false;
11836 tree underlying_type
= NULL_TREE
;
11838 /* Parse tentatively so that we can back up if we don't find a
11840 cp_parser_parse_tentatively (parser
);
11842 /* Caller guarantees that the current token is 'enum', an identifier
11843 possibly follows, and the token after that is an opening brace.
11844 If we don't have an identifier, fabricate an anonymous name for
11845 the enumeration being defined. */
11846 cp_lexer_consume_token (parser
->lexer
);
11848 /* Parse the "class" or "struct", which indicates a scoped
11849 enumeration type in C++0x. */
11850 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_CLASS
)
11851 || cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STRUCT
))
11853 if (cxx_dialect
== cxx98
)
11854 maybe_warn_cpp0x ("scoped enums");
11856 /* Consume the `struct' or `class' token. */
11857 cp_lexer_consume_token (parser
->lexer
);
11859 scoped_enum_p
= true;
11862 attributes
= cp_parser_attributes_opt (parser
);
11864 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
11865 identifier
= cp_parser_identifier (parser
);
11867 identifier
= make_anon_name ();
11869 /* Check for the `:' that denotes a specified underlying type in C++0x. */
11870 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
11872 cp_decl_specifier_seq type_specifiers
;
11874 /* At this point this is surely not elaborated type specifier. */
11875 if (!cp_parser_parse_definitely (parser
))
11878 if (cxx_dialect
== cxx98
)
11879 maybe_warn_cpp0x ("scoped enums");
11881 /* Consume the `:'. */
11882 cp_lexer_consume_token (parser
->lexer
);
11884 has_underlying_type
= true;
11886 /* Parse the type-specifier-seq. */
11887 cp_parser_type_specifier_seq (parser
, /*is_condition=*/false,
11890 /* If that didn't work, stop. */
11891 if (type_specifiers
.type
!= error_mark_node
)
11893 underlying_type
= grokdeclarator (NULL
, &type_specifiers
, TYPENAME
,
11894 /*initialized=*/0, NULL
);
11895 if (underlying_type
== error_mark_node
)
11896 underlying_type
= NULL_TREE
;
11900 /* Look for the `{' but don't consume it yet. */
11901 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
11903 cp_parser_error (parser
, "expected %<{%>");
11904 if (has_underlying_type
)
11908 if (!has_underlying_type
&& !cp_parser_parse_definitely (parser
))
11911 /* Issue an error message if type-definitions are forbidden here. */
11912 if (!cp_parser_check_type_definition (parser
))
11913 type
= error_mark_node
;
11915 /* Create the new type. We do this before consuming the opening
11916 brace so the enum will be recorded as being on the line of its
11917 tag (or the 'enum' keyword, if there is no tag). */
11918 type
= start_enum (identifier
, underlying_type
, scoped_enum_p
);
11920 /* Consume the opening brace. */
11921 cp_lexer_consume_token (parser
->lexer
);
11923 if (type
== error_mark_node
)
11925 cp_parser_skip_to_end_of_block_or_statement (parser
);
11926 return error_mark_node
;
11929 /* If the next token is not '}', then there are some enumerators. */
11930 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_BRACE
))
11931 cp_parser_enumerator_list (parser
, type
);
11933 /* Consume the final '}'. */
11934 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "%<}%>");
11936 /* Look for trailing attributes to apply to this enumeration, and
11937 apply them if appropriate. */
11938 if (cp_parser_allow_gnu_extensions_p (parser
))
11940 tree trailing_attr
= cp_parser_attributes_opt (parser
);
11941 trailing_attr
= chainon (trailing_attr
, attributes
);
11942 cplus_decl_attributes (&type
,
11944 (int) ATTR_FLAG_TYPE_IN_PLACE
);
11947 /* Finish up the enumeration. */
11948 finish_enum (type
);
11953 /* Parse an enumerator-list. The enumerators all have the indicated
11957 enumerator-definition
11958 enumerator-list , enumerator-definition */
11961 cp_parser_enumerator_list (cp_parser
* parser
, tree type
)
11965 /* Parse an enumerator-definition. */
11966 cp_parser_enumerator_definition (parser
, type
);
11968 /* If the next token is not a ',', we've reached the end of
11970 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
11972 /* Otherwise, consume the `,' and keep going. */
11973 cp_lexer_consume_token (parser
->lexer
);
11974 /* If the next token is a `}', there is a trailing comma. */
11975 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
11977 if (!in_system_header
)
11978 pedwarn (input_location
, OPT_pedantic
, "comma at end of enumerator list");
11984 /* Parse an enumerator-definition. The enumerator has the indicated
11987 enumerator-definition:
11989 enumerator = constant-expression
11995 cp_parser_enumerator_definition (cp_parser
* parser
, tree type
)
12000 /* Look for the identifier. */
12001 identifier
= cp_parser_identifier (parser
);
12002 if (identifier
== error_mark_node
)
12005 /* If the next token is an '=', then there is an explicit value. */
12006 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
12008 /* Consume the `=' token. */
12009 cp_lexer_consume_token (parser
->lexer
);
12010 /* Parse the value. */
12011 value
= cp_parser_constant_expression (parser
,
12012 /*allow_non_constant_p=*/false,
12018 /* If we are processing a template, make sure the initializer of the
12019 enumerator doesn't contain any bare template parameter pack. */
12020 if (check_for_bare_parameter_packs (value
))
12021 value
= error_mark_node
;
12023 /* Create the enumerator. */
12024 build_enumerator (identifier
, value
, type
);
12027 /* Parse a namespace-name.
12030 original-namespace-name
12033 Returns the NAMESPACE_DECL for the namespace. */
12036 cp_parser_namespace_name (cp_parser
* parser
)
12039 tree namespace_decl
;
12041 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
12043 /* Get the name of the namespace. */
12044 identifier
= cp_parser_identifier (parser
);
12045 if (identifier
== error_mark_node
)
12046 return error_mark_node
;
12048 /* Look up the identifier in the currently active scope. Look only
12049 for namespaces, due to:
12051 [basic.lookup.udir]
12053 When looking up a namespace-name in a using-directive or alias
12054 definition, only namespace names are considered.
12058 [basic.lookup.qual]
12060 During the lookup of a name preceding the :: scope resolution
12061 operator, object, function, and enumerator names are ignored.
12063 (Note that cp_parser_qualifying_entity only calls this
12064 function if the token after the name is the scope resolution
12066 namespace_decl
= cp_parser_lookup_name (parser
, identifier
,
12068 /*is_template=*/false,
12069 /*is_namespace=*/true,
12070 /*check_dependency=*/true,
12071 /*ambiguous_decls=*/NULL
,
12073 /* If it's not a namespace, issue an error. */
12074 if (namespace_decl
== error_mark_node
12075 || TREE_CODE (namespace_decl
) != NAMESPACE_DECL
)
12077 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
12078 error ("%H%qD is not a namespace-name", &token
->location
, identifier
);
12079 cp_parser_error (parser
, "expected namespace-name");
12080 namespace_decl
= error_mark_node
;
12083 return namespace_decl
;
12086 /* Parse a namespace-definition.
12088 namespace-definition:
12089 named-namespace-definition
12090 unnamed-namespace-definition
12092 named-namespace-definition:
12093 original-namespace-definition
12094 extension-namespace-definition
12096 original-namespace-definition:
12097 namespace identifier { namespace-body }
12099 extension-namespace-definition:
12100 namespace original-namespace-name { namespace-body }
12102 unnamed-namespace-definition:
12103 namespace { namespace-body } */
12106 cp_parser_namespace_definition (cp_parser
* parser
)
12108 tree identifier
, attribs
;
12109 bool has_visibility
;
12112 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_INLINE
))
12115 cp_lexer_consume_token (parser
->lexer
);
12120 /* Look for the `namespace' keyword. */
12121 cp_parser_require_keyword (parser
, RID_NAMESPACE
, "%<namespace%>");
12123 /* Get the name of the namespace. We do not attempt to distinguish
12124 between an original-namespace-definition and an
12125 extension-namespace-definition at this point. The semantic
12126 analysis routines are responsible for that. */
12127 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
12128 identifier
= cp_parser_identifier (parser
);
12130 identifier
= NULL_TREE
;
12132 /* Parse any specified attributes. */
12133 attribs
= cp_parser_attributes_opt (parser
);
12135 /* Look for the `{' to start the namespace. */
12136 cp_parser_require (parser
, CPP_OPEN_BRACE
, "%<{%>");
12137 /* Start the namespace. */
12138 push_namespace (identifier
);
12140 /* "inline namespace" is equivalent to a stub namespace definition
12141 followed by a strong using directive. */
12144 tree name_space
= current_namespace
;
12145 /* Set up namespace association. */
12146 DECL_NAMESPACE_ASSOCIATIONS (name_space
)
12147 = tree_cons (CP_DECL_CONTEXT (name_space
), NULL_TREE
,
12148 DECL_NAMESPACE_ASSOCIATIONS (name_space
));
12149 /* Import the contents of the inline namespace. */
12151 do_using_directive (name_space
);
12152 push_namespace (identifier
);
12155 has_visibility
= handle_namespace_attrs (current_namespace
, attribs
);
12157 /* Parse the body of the namespace. */
12158 cp_parser_namespace_body (parser
);
12160 #ifdef HANDLE_PRAGMA_VISIBILITY
12161 if (has_visibility
)
12165 /* Finish the namespace. */
12167 /* Look for the final `}'. */
12168 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "%<}%>");
12171 /* Parse a namespace-body.
12174 declaration-seq [opt] */
12177 cp_parser_namespace_body (cp_parser
* parser
)
12179 cp_parser_declaration_seq_opt (parser
);
12182 /* Parse a namespace-alias-definition.
12184 namespace-alias-definition:
12185 namespace identifier = qualified-namespace-specifier ; */
12188 cp_parser_namespace_alias_definition (cp_parser
* parser
)
12191 tree namespace_specifier
;
12193 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
12195 /* Look for the `namespace' keyword. */
12196 cp_parser_require_keyword (parser
, RID_NAMESPACE
, "%<namespace%>");
12197 /* Look for the identifier. */
12198 identifier
= cp_parser_identifier (parser
);
12199 if (identifier
== error_mark_node
)
12201 /* Look for the `=' token. */
12202 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
)
12203 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
12205 error ("%H%<namespace%> definition is not allowed here", &token
->location
);
12206 /* Skip the definition. */
12207 cp_lexer_consume_token (parser
->lexer
);
12208 if (cp_parser_skip_to_closing_brace (parser
))
12209 cp_lexer_consume_token (parser
->lexer
);
12212 cp_parser_require (parser
, CPP_EQ
, "%<=%>");
12213 /* Look for the qualified-namespace-specifier. */
12214 namespace_specifier
12215 = cp_parser_qualified_namespace_specifier (parser
);
12216 /* Look for the `;' token. */
12217 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
12219 /* Register the alias in the symbol table. */
12220 do_namespace_alias (identifier
, namespace_specifier
);
12223 /* Parse a qualified-namespace-specifier.
12225 qualified-namespace-specifier:
12226 :: [opt] nested-name-specifier [opt] namespace-name
12228 Returns a NAMESPACE_DECL corresponding to the specified
12232 cp_parser_qualified_namespace_specifier (cp_parser
* parser
)
12234 /* Look for the optional `::'. */
12235 cp_parser_global_scope_opt (parser
,
12236 /*current_scope_valid_p=*/false);
12238 /* Look for the optional nested-name-specifier. */
12239 cp_parser_nested_name_specifier_opt (parser
,
12240 /*typename_keyword_p=*/false,
12241 /*check_dependency_p=*/true,
12243 /*is_declaration=*/true);
12245 return cp_parser_namespace_name (parser
);
12248 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
12249 access declaration.
12252 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
12253 using :: unqualified-id ;
12255 access-declaration:
12261 cp_parser_using_declaration (cp_parser
* parser
,
12262 bool access_declaration_p
)
12265 bool typename_p
= false;
12266 bool global_scope_p
;
12271 if (access_declaration_p
)
12272 cp_parser_parse_tentatively (parser
);
12275 /* Look for the `using' keyword. */
12276 cp_parser_require_keyword (parser
, RID_USING
, "%<using%>");
12278 /* Peek at the next token. */
12279 token
= cp_lexer_peek_token (parser
->lexer
);
12280 /* See if it's `typename'. */
12281 if (token
->keyword
== RID_TYPENAME
)
12283 /* Remember that we've seen it. */
12285 /* Consume the `typename' token. */
12286 cp_lexer_consume_token (parser
->lexer
);
12290 /* Look for the optional global scope qualification. */
12292 = (cp_parser_global_scope_opt (parser
,
12293 /*current_scope_valid_p=*/false)
12296 /* If we saw `typename', or didn't see `::', then there must be a
12297 nested-name-specifier present. */
12298 if (typename_p
|| !global_scope_p
)
12299 qscope
= cp_parser_nested_name_specifier (parser
, typename_p
,
12300 /*check_dependency_p=*/true,
12302 /*is_declaration=*/true);
12303 /* Otherwise, we could be in either of the two productions. In that
12304 case, treat the nested-name-specifier as optional. */
12306 qscope
= cp_parser_nested_name_specifier_opt (parser
,
12307 /*typename_keyword_p=*/false,
12308 /*check_dependency_p=*/true,
12310 /*is_declaration=*/true);
12312 qscope
= global_namespace
;
12314 if (access_declaration_p
&& cp_parser_error_occurred (parser
))
12315 /* Something has already gone wrong; there's no need to parse
12316 further. Since an error has occurred, the return value of
12317 cp_parser_parse_definitely will be false, as required. */
12318 return cp_parser_parse_definitely (parser
);
12320 token
= cp_lexer_peek_token (parser
->lexer
);
12321 /* Parse the unqualified-id. */
12322 identifier
= cp_parser_unqualified_id (parser
,
12323 /*template_keyword_p=*/false,
12324 /*check_dependency_p=*/true,
12325 /*declarator_p=*/true,
12326 /*optional_p=*/false);
12328 if (access_declaration_p
)
12330 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
12331 cp_parser_simulate_error (parser
);
12332 if (!cp_parser_parse_definitely (parser
))
12336 /* The function we call to handle a using-declaration is different
12337 depending on what scope we are in. */
12338 if (qscope
== error_mark_node
|| identifier
== error_mark_node
)
12340 else if (TREE_CODE (identifier
) != IDENTIFIER_NODE
12341 && TREE_CODE (identifier
) != BIT_NOT_EXPR
)
12342 /* [namespace.udecl]
12344 A using declaration shall not name a template-id. */
12345 error ("%Ha template-id may not appear in a using-declaration",
12349 if (at_class_scope_p ())
12351 /* Create the USING_DECL. */
12352 decl
= do_class_using_decl (parser
->scope
, identifier
);
12354 if (check_for_bare_parameter_packs (decl
))
12357 /* Add it to the list of members in this class. */
12358 finish_member_declaration (decl
);
12362 decl
= cp_parser_lookup_name_simple (parser
,
12365 if (decl
== error_mark_node
)
12366 cp_parser_name_lookup_error (parser
, identifier
,
12369 else if (check_for_bare_parameter_packs (decl
))
12371 else if (!at_namespace_scope_p ())
12372 do_local_using_decl (decl
, qscope
, identifier
);
12374 do_toplevel_using_decl (decl
, qscope
, identifier
);
12378 /* Look for the final `;'. */
12379 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
12384 /* Parse a using-directive.
12387 using namespace :: [opt] nested-name-specifier [opt]
12388 namespace-name ; */
12391 cp_parser_using_directive (cp_parser
* parser
)
12393 tree namespace_decl
;
12396 /* Look for the `using' keyword. */
12397 cp_parser_require_keyword (parser
, RID_USING
, "%<using%>");
12398 /* And the `namespace' keyword. */
12399 cp_parser_require_keyword (parser
, RID_NAMESPACE
, "%<namespace%>");
12400 /* Look for the optional `::' operator. */
12401 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false);
12402 /* And the optional nested-name-specifier. */
12403 cp_parser_nested_name_specifier_opt (parser
,
12404 /*typename_keyword_p=*/false,
12405 /*check_dependency_p=*/true,
12407 /*is_declaration=*/true);
12408 /* Get the namespace being used. */
12409 namespace_decl
= cp_parser_namespace_name (parser
);
12410 /* And any specified attributes. */
12411 attribs
= cp_parser_attributes_opt (parser
);
12412 /* Update the symbol table. */
12413 parse_using_directive (namespace_decl
, attribs
);
12414 /* Look for the final `;'. */
12415 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
12418 /* Parse an asm-definition.
12421 asm ( string-literal ) ;
12426 asm volatile [opt] ( string-literal ) ;
12427 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
12428 asm volatile [opt] ( string-literal : asm-operand-list [opt]
12429 : asm-operand-list [opt] ) ;
12430 asm volatile [opt] ( string-literal : asm-operand-list [opt]
12431 : asm-operand-list [opt]
12432 : asm-operand-list [opt] ) ; */
12435 cp_parser_asm_definition (cp_parser
* parser
)
12438 tree outputs
= NULL_TREE
;
12439 tree inputs
= NULL_TREE
;
12440 tree clobbers
= NULL_TREE
;
12442 bool volatile_p
= false;
12443 bool extended_p
= false;
12444 bool invalid_inputs_p
= false;
12445 bool invalid_outputs_p
= false;
12447 /* Look for the `asm' keyword. */
12448 cp_parser_require_keyword (parser
, RID_ASM
, "%<asm%>");
12449 /* See if the next token is `volatile'. */
12450 if (cp_parser_allow_gnu_extensions_p (parser
)
12451 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_VOLATILE
))
12453 /* Remember that we saw the `volatile' keyword. */
12455 /* Consume the token. */
12456 cp_lexer_consume_token (parser
->lexer
);
12458 /* Look for the opening `('. */
12459 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>"))
12461 /* Look for the string. */
12462 string
= cp_parser_string_literal (parser
, false, false);
12463 if (string
== error_mark_node
)
12465 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
12466 /*consume_paren=*/true);
12470 /* If we're allowing GNU extensions, check for the extended assembly
12471 syntax. Unfortunately, the `:' tokens need not be separated by
12472 a space in C, and so, for compatibility, we tolerate that here
12473 too. Doing that means that we have to treat the `::' operator as
12475 if (cp_parser_allow_gnu_extensions_p (parser
)
12476 && parser
->in_function_body
12477 && (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
)
12478 || cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
)))
12480 bool inputs_p
= false;
12481 bool clobbers_p
= false;
12483 /* The extended syntax was used. */
12486 /* Look for outputs. */
12487 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
12489 /* Consume the `:'. */
12490 cp_lexer_consume_token (parser
->lexer
);
12491 /* Parse the output-operands. */
12492 if (cp_lexer_next_token_is_not (parser
->lexer
,
12494 && cp_lexer_next_token_is_not (parser
->lexer
,
12496 && cp_lexer_next_token_is_not (parser
->lexer
,
12498 outputs
= cp_parser_asm_operand_list (parser
);
12500 if (outputs
== error_mark_node
)
12501 invalid_outputs_p
= true;
12503 /* If the next token is `::', there are no outputs, and the
12504 next token is the beginning of the inputs. */
12505 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
12506 /* The inputs are coming next. */
12509 /* Look for inputs. */
12511 || cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
12513 /* Consume the `:' or `::'. */
12514 cp_lexer_consume_token (parser
->lexer
);
12515 /* Parse the output-operands. */
12516 if (cp_lexer_next_token_is_not (parser
->lexer
,
12518 && cp_lexer_next_token_is_not (parser
->lexer
,
12520 inputs
= cp_parser_asm_operand_list (parser
);
12522 if (inputs
== error_mark_node
)
12523 invalid_inputs_p
= true;
12525 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
12526 /* The clobbers are coming next. */
12529 /* Look for clobbers. */
12531 || cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
12533 /* Consume the `:' or `::'. */
12534 cp_lexer_consume_token (parser
->lexer
);
12535 /* Parse the clobbers. */
12536 if (cp_lexer_next_token_is_not (parser
->lexer
,
12538 clobbers
= cp_parser_asm_clobber_list (parser
);
12541 /* Look for the closing `)'. */
12542 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>"))
12543 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
12544 /*consume_paren=*/true);
12545 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
12547 if (!invalid_inputs_p
&& !invalid_outputs_p
)
12549 /* Create the ASM_EXPR. */
12550 if (parser
->in_function_body
)
12552 asm_stmt
= finish_asm_stmt (volatile_p
, string
, outputs
,
12554 /* If the extended syntax was not used, mark the ASM_EXPR. */
12557 tree temp
= asm_stmt
;
12558 if (TREE_CODE (temp
) == CLEANUP_POINT_EXPR
)
12559 temp
= TREE_OPERAND (temp
, 0);
12561 ASM_INPUT_P (temp
) = 1;
12565 cgraph_add_asm_node (string
);
12569 /* Declarators [gram.dcl.decl] */
12571 /* Parse an init-declarator.
12574 declarator initializer [opt]
12579 declarator asm-specification [opt] attributes [opt] initializer [opt]
12581 function-definition:
12582 decl-specifier-seq [opt] declarator ctor-initializer [opt]
12584 decl-specifier-seq [opt] declarator function-try-block
12588 function-definition:
12589 __extension__ function-definition
12591 The DECL_SPECIFIERS apply to this declarator. Returns a
12592 representation of the entity declared. If MEMBER_P is TRUE, then
12593 this declarator appears in a class scope. The new DECL created by
12594 this declarator is returned.
12596 The CHECKS are access checks that should be performed once we know
12597 what entity is being declared (and, therefore, what classes have
12600 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
12601 for a function-definition here as well. If the declarator is a
12602 declarator for a function-definition, *FUNCTION_DEFINITION_P will
12603 be TRUE upon return. By that point, the function-definition will
12604 have been completely parsed.
12606 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
12610 cp_parser_init_declarator (cp_parser
* parser
,
12611 cp_decl_specifier_seq
*decl_specifiers
,
12612 VEC (deferred_access_check
,gc
)* checks
,
12613 bool function_definition_allowed_p
,
12615 int declares_class_or_enum
,
12616 bool* function_definition_p
)
12618 cp_token
*token
= NULL
, *asm_spec_start_token
= NULL
,
12619 *attributes_start_token
= NULL
;
12620 cp_declarator
*declarator
;
12621 tree prefix_attributes
;
12623 tree asm_specification
;
12625 tree decl
= NULL_TREE
;
12627 int is_initialized
;
12628 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
12629 initialized with "= ..", CPP_OPEN_PAREN if initialized with
12631 enum cpp_ttype initialization_kind
;
12632 bool is_direct_init
= false;
12633 bool is_non_constant_init
;
12634 int ctor_dtor_or_conv_p
;
12636 tree pushed_scope
= NULL
;
12638 /* Gather the attributes that were provided with the
12639 decl-specifiers. */
12640 prefix_attributes
= decl_specifiers
->attributes
;
12642 /* Assume that this is not the declarator for a function
12644 if (function_definition_p
)
12645 *function_definition_p
= false;
12647 /* Defer access checks while parsing the declarator; we cannot know
12648 what names are accessible until we know what is being
12650 resume_deferring_access_checks ();
12652 /* Parse the declarator. */
12653 token
= cp_lexer_peek_token (parser
->lexer
);
12655 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
12656 &ctor_dtor_or_conv_p
,
12657 /*parenthesized_p=*/NULL
,
12658 /*member_p=*/false);
12659 /* Gather up the deferred checks. */
12660 stop_deferring_access_checks ();
12662 /* If the DECLARATOR was erroneous, there's no need to go
12664 if (declarator
== cp_error_declarator
)
12665 return error_mark_node
;
12667 /* Check that the number of template-parameter-lists is OK. */
12668 if (!cp_parser_check_declarator_template_parameters (parser
, declarator
,
12670 return error_mark_node
;
12672 if (declares_class_or_enum
& 2)
12673 cp_parser_check_for_definition_in_return_type (declarator
,
12674 decl_specifiers
->type
,
12675 decl_specifiers
->type_location
);
12677 /* Figure out what scope the entity declared by the DECLARATOR is
12678 located in. `grokdeclarator' sometimes changes the scope, so
12679 we compute it now. */
12680 scope
= get_scope_of_declarator (declarator
);
12682 /* If we're allowing GNU extensions, look for an asm-specification
12684 if (cp_parser_allow_gnu_extensions_p (parser
))
12686 /* Look for an asm-specification. */
12687 asm_spec_start_token
= cp_lexer_peek_token (parser
->lexer
);
12688 asm_specification
= cp_parser_asm_specification_opt (parser
);
12689 /* And attributes. */
12690 attributes_start_token
= cp_lexer_peek_token (parser
->lexer
);
12691 attributes
= cp_parser_attributes_opt (parser
);
12695 asm_specification
= NULL_TREE
;
12696 attributes
= NULL_TREE
;
12699 /* Peek at the next token. */
12700 token
= cp_lexer_peek_token (parser
->lexer
);
12701 /* Check to see if the token indicates the start of a
12702 function-definition. */
12703 if (function_declarator_p (declarator
)
12704 && cp_parser_token_starts_function_definition_p (token
))
12706 if (!function_definition_allowed_p
)
12708 /* If a function-definition should not appear here, issue an
12710 cp_parser_error (parser
,
12711 "a function-definition is not allowed here");
12712 return error_mark_node
;
12716 location_t func_brace_location
12717 = cp_lexer_peek_token (parser
->lexer
)->location
;
12719 /* Neither attributes nor an asm-specification are allowed
12720 on a function-definition. */
12721 if (asm_specification
)
12722 error ("%Han asm-specification is not allowed "
12723 "on a function-definition",
12724 &asm_spec_start_token
->location
);
12726 error ("%Hattributes are not allowed on a function-definition",
12727 &attributes_start_token
->location
);
12728 /* This is a function-definition. */
12729 *function_definition_p
= true;
12731 /* Parse the function definition. */
12733 decl
= cp_parser_save_member_function_body (parser
,
12736 prefix_attributes
);
12739 = (cp_parser_function_definition_from_specifiers_and_declarator
12740 (parser
, decl_specifiers
, prefix_attributes
, declarator
));
12742 if (decl
!= error_mark_node
&& DECL_STRUCT_FUNCTION (decl
))
12744 /* This is where the prologue starts... */
12745 DECL_STRUCT_FUNCTION (decl
)->function_start_locus
12746 = func_brace_location
;
12755 Only in function declarations for constructors, destructors, and
12756 type conversions can the decl-specifier-seq be omitted.
12758 We explicitly postpone this check past the point where we handle
12759 function-definitions because we tolerate function-definitions
12760 that are missing their return types in some modes. */
12761 if (!decl_specifiers
->any_specifiers_p
&& ctor_dtor_or_conv_p
<= 0)
12763 cp_parser_error (parser
,
12764 "expected constructor, destructor, or type conversion");
12765 return error_mark_node
;
12768 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
12769 if (token
->type
== CPP_EQ
12770 || token
->type
== CPP_OPEN_PAREN
12771 || token
->type
== CPP_OPEN_BRACE
)
12773 is_initialized
= SD_INITIALIZED
;
12774 initialization_kind
= token
->type
;
12776 if (token
->type
== CPP_EQ
12777 && function_declarator_p (declarator
))
12779 cp_token
*t2
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
12780 if (t2
->keyword
== RID_DEFAULT
)
12781 is_initialized
= SD_DEFAULTED
;
12782 else if (t2
->keyword
== RID_DELETE
)
12783 is_initialized
= SD_DELETED
;
12788 /* If the init-declarator isn't initialized and isn't followed by a
12789 `,' or `;', it's not a valid init-declarator. */
12790 if (token
->type
!= CPP_COMMA
12791 && token
->type
!= CPP_SEMICOLON
)
12793 cp_parser_error (parser
, "expected initializer");
12794 return error_mark_node
;
12796 is_initialized
= SD_UNINITIALIZED
;
12797 initialization_kind
= CPP_EOF
;
12800 /* Because start_decl has side-effects, we should only call it if we
12801 know we're going ahead. By this point, we know that we cannot
12802 possibly be looking at any other construct. */
12803 cp_parser_commit_to_tentative_parse (parser
);
12805 /* If the decl specifiers were bad, issue an error now that we're
12806 sure this was intended to be a declarator. Then continue
12807 declaring the variable(s), as int, to try to cut down on further
12809 if (decl_specifiers
->any_specifiers_p
12810 && decl_specifiers
->type
== error_mark_node
)
12812 cp_parser_error (parser
, "invalid type in declaration");
12813 decl_specifiers
->type
= integer_type_node
;
12816 /* Check to see whether or not this declaration is a friend. */
12817 friend_p
= cp_parser_friend_p (decl_specifiers
);
12819 /* Enter the newly declared entry in the symbol table. If we're
12820 processing a declaration in a class-specifier, we wait until
12821 after processing the initializer. */
12824 if (parser
->in_unbraced_linkage_specification_p
)
12825 decl_specifiers
->storage_class
= sc_extern
;
12826 decl
= start_decl (declarator
, decl_specifiers
,
12827 is_initialized
, attributes
, prefix_attributes
,
12831 /* Enter the SCOPE. That way unqualified names appearing in the
12832 initializer will be looked up in SCOPE. */
12833 pushed_scope
= push_scope (scope
);
12835 /* Perform deferred access control checks, now that we know in which
12836 SCOPE the declared entity resides. */
12837 if (!member_p
&& decl
)
12839 tree saved_current_function_decl
= NULL_TREE
;
12841 /* If the entity being declared is a function, pretend that we
12842 are in its scope. If it is a `friend', it may have access to
12843 things that would not otherwise be accessible. */
12844 if (TREE_CODE (decl
) == FUNCTION_DECL
)
12846 saved_current_function_decl
= current_function_decl
;
12847 current_function_decl
= decl
;
12850 /* Perform access checks for template parameters. */
12851 cp_parser_perform_template_parameter_access_checks (checks
);
12853 /* Perform the access control checks for the declarator and the
12854 decl-specifiers. */
12855 perform_deferred_access_checks ();
12857 /* Restore the saved value. */
12858 if (TREE_CODE (decl
) == FUNCTION_DECL
)
12859 current_function_decl
= saved_current_function_decl
;
12862 /* Parse the initializer. */
12863 initializer
= NULL_TREE
;
12864 is_direct_init
= false;
12865 is_non_constant_init
= true;
12866 if (is_initialized
)
12868 if (function_declarator_p (declarator
))
12870 cp_token
*initializer_start_token
= cp_lexer_peek_token (parser
->lexer
);
12871 if (initialization_kind
== CPP_EQ
)
12872 initializer
= cp_parser_pure_specifier (parser
);
12875 /* If the declaration was erroneous, we don't really
12876 know what the user intended, so just silently
12877 consume the initializer. */
12878 if (decl
!= error_mark_node
)
12879 error ("%Hinitializer provided for function",
12880 &initializer_start_token
->location
);
12881 cp_parser_skip_to_closing_parenthesis (parser
,
12882 /*recovering=*/true,
12883 /*or_comma=*/false,
12884 /*consume_paren=*/true);
12888 initializer
= cp_parser_initializer (parser
,
12890 &is_non_constant_init
);
12893 /* The old parser allows attributes to appear after a parenthesized
12894 initializer. Mark Mitchell proposed removing this functionality
12895 on the GCC mailing lists on 2002-08-13. This parser accepts the
12896 attributes -- but ignores them. */
12897 if (cp_parser_allow_gnu_extensions_p (parser
)
12898 && initialization_kind
== CPP_OPEN_PAREN
)
12899 if (cp_parser_attributes_opt (parser
))
12900 warning (OPT_Wattributes
,
12901 "attributes after parenthesized initializer ignored");
12903 /* For an in-class declaration, use `grokfield' to create the
12909 pop_scope (pushed_scope
);
12910 pushed_scope
= false;
12912 decl
= grokfield (declarator
, decl_specifiers
,
12913 initializer
, !is_non_constant_init
,
12914 /*asmspec=*/NULL_TREE
,
12915 prefix_attributes
);
12916 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
12917 cp_parser_save_default_args (parser
, decl
);
12920 /* Finish processing the declaration. But, skip friend
12922 if (!friend_p
&& decl
&& decl
!= error_mark_node
)
12924 cp_finish_decl (decl
,
12925 initializer
, !is_non_constant_init
,
12927 /* If the initializer is in parentheses, then this is
12928 a direct-initialization, which means that an
12929 `explicit' constructor is OK. Otherwise, an
12930 `explicit' constructor cannot be used. */
12931 ((is_direct_init
|| !is_initialized
)
12932 ? 0 : LOOKUP_ONLYCONVERTING
));
12934 else if ((cxx_dialect
!= cxx98
) && friend_p
12935 && decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
12936 /* Core issue #226 (C++0x only): A default template-argument
12937 shall not be specified in a friend class template
12939 check_default_tmpl_args (decl
, current_template_parms
, /*is_primary=*/1,
12940 /*is_partial=*/0, /*is_friend_decl=*/1);
12942 if (!friend_p
&& pushed_scope
)
12943 pop_scope (pushed_scope
);
12948 /* Parse a declarator.
12952 ptr-operator declarator
12954 abstract-declarator:
12955 ptr-operator abstract-declarator [opt]
12956 direct-abstract-declarator
12961 attributes [opt] direct-declarator
12962 attributes [opt] ptr-operator declarator
12964 abstract-declarator:
12965 attributes [opt] ptr-operator abstract-declarator [opt]
12966 attributes [opt] direct-abstract-declarator
12968 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
12969 detect constructor, destructor or conversion operators. It is set
12970 to -1 if the declarator is a name, and +1 if it is a
12971 function. Otherwise it is set to zero. Usually you just want to
12972 test for >0, but internally the negative value is used.
12974 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
12975 a decl-specifier-seq unless it declares a constructor, destructor,
12976 or conversion. It might seem that we could check this condition in
12977 semantic analysis, rather than parsing, but that makes it difficult
12978 to handle something like `f()'. We want to notice that there are
12979 no decl-specifiers, and therefore realize that this is an
12980 expression, not a declaration.)
12982 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
12983 the declarator is a direct-declarator of the form "(...)".
12985 MEMBER_P is true iff this declarator is a member-declarator. */
12987 static cp_declarator
*
12988 cp_parser_declarator (cp_parser
* parser
,
12989 cp_parser_declarator_kind dcl_kind
,
12990 int* ctor_dtor_or_conv_p
,
12991 bool* parenthesized_p
,
12995 cp_declarator
*declarator
;
12996 enum tree_code code
;
12997 cp_cv_quals cv_quals
;
12999 tree attributes
= NULL_TREE
;
13001 /* Assume this is not a constructor, destructor, or type-conversion
13003 if (ctor_dtor_or_conv_p
)
13004 *ctor_dtor_or_conv_p
= 0;
13006 if (cp_parser_allow_gnu_extensions_p (parser
))
13007 attributes
= cp_parser_attributes_opt (parser
);
13009 /* Peek at the next token. */
13010 token
= cp_lexer_peek_token (parser
->lexer
);
13012 /* Check for the ptr-operator production. */
13013 cp_parser_parse_tentatively (parser
);
13014 /* Parse the ptr-operator. */
13015 code
= cp_parser_ptr_operator (parser
,
13018 /* If that worked, then we have a ptr-operator. */
13019 if (cp_parser_parse_definitely (parser
))
13021 /* If a ptr-operator was found, then this declarator was not
13023 if (parenthesized_p
)
13024 *parenthesized_p
= true;
13025 /* The dependent declarator is optional if we are parsing an
13026 abstract-declarator. */
13027 if (dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
)
13028 cp_parser_parse_tentatively (parser
);
13030 /* Parse the dependent declarator. */
13031 declarator
= cp_parser_declarator (parser
, dcl_kind
,
13032 /*ctor_dtor_or_conv_p=*/NULL
,
13033 /*parenthesized_p=*/NULL
,
13034 /*member_p=*/false);
13036 /* If we are parsing an abstract-declarator, we must handle the
13037 case where the dependent declarator is absent. */
13038 if (dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
13039 && !cp_parser_parse_definitely (parser
))
13042 declarator
= cp_parser_make_indirect_declarator
13043 (code
, class_type
, cv_quals
, declarator
);
13045 /* Everything else is a direct-declarator. */
13048 if (parenthesized_p
)
13049 *parenthesized_p
= cp_lexer_next_token_is (parser
->lexer
,
13051 declarator
= cp_parser_direct_declarator (parser
, dcl_kind
,
13052 ctor_dtor_or_conv_p
,
13056 if (attributes
&& declarator
&& declarator
!= cp_error_declarator
)
13057 declarator
->attributes
= attributes
;
13062 /* Parse a direct-declarator or direct-abstract-declarator.
13066 direct-declarator ( parameter-declaration-clause )
13067 cv-qualifier-seq [opt]
13068 exception-specification [opt]
13069 direct-declarator [ constant-expression [opt] ]
13072 direct-abstract-declarator:
13073 direct-abstract-declarator [opt]
13074 ( parameter-declaration-clause )
13075 cv-qualifier-seq [opt]
13076 exception-specification [opt]
13077 direct-abstract-declarator [opt] [ constant-expression [opt] ]
13078 ( abstract-declarator )
13080 Returns a representation of the declarator. DCL_KIND is
13081 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
13082 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
13083 we are parsing a direct-declarator. It is
13084 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
13085 of ambiguity we prefer an abstract declarator, as per
13086 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
13087 cp_parser_declarator. */
13089 static cp_declarator
*
13090 cp_parser_direct_declarator (cp_parser
* parser
,
13091 cp_parser_declarator_kind dcl_kind
,
13092 int* ctor_dtor_or_conv_p
,
13096 cp_declarator
*declarator
= NULL
;
13097 tree scope
= NULL_TREE
;
13098 bool saved_default_arg_ok_p
= parser
->default_arg_ok_p
;
13099 bool saved_in_declarator_p
= parser
->in_declarator_p
;
13101 tree pushed_scope
= NULL_TREE
;
13105 /* Peek at the next token. */
13106 token
= cp_lexer_peek_token (parser
->lexer
);
13107 if (token
->type
== CPP_OPEN_PAREN
)
13109 /* This is either a parameter-declaration-clause, or a
13110 parenthesized declarator. When we know we are parsing a
13111 named declarator, it must be a parenthesized declarator
13112 if FIRST is true. For instance, `(int)' is a
13113 parameter-declaration-clause, with an omitted
13114 direct-abstract-declarator. But `((*))', is a
13115 parenthesized abstract declarator. Finally, when T is a
13116 template parameter `(T)' is a
13117 parameter-declaration-clause, and not a parenthesized
13120 We first try and parse a parameter-declaration-clause,
13121 and then try a nested declarator (if FIRST is true).
13123 It is not an error for it not to be a
13124 parameter-declaration-clause, even when FIRST is
13130 The first is the declaration of a function while the
13131 second is the definition of a variable, including its
13134 Having seen only the parenthesis, we cannot know which of
13135 these two alternatives should be selected. Even more
13136 complex are examples like:
13141 The former is a function-declaration; the latter is a
13142 variable initialization.
13144 Thus again, we try a parameter-declaration-clause, and if
13145 that fails, we back out and return. */
13147 if (!first
|| dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
)
13150 unsigned saved_num_template_parameter_lists
;
13151 bool is_declarator
= false;
13154 /* In a member-declarator, the only valid interpretation
13155 of a parenthesis is the start of a
13156 parameter-declaration-clause. (It is invalid to
13157 initialize a static data member with a parenthesized
13158 initializer; only the "=" form of initialization is
13161 cp_parser_parse_tentatively (parser
);
13163 /* Consume the `('. */
13164 cp_lexer_consume_token (parser
->lexer
);
13167 /* If this is going to be an abstract declarator, we're
13168 in a declarator and we can't have default args. */
13169 parser
->default_arg_ok_p
= false;
13170 parser
->in_declarator_p
= true;
13173 /* Inside the function parameter list, surrounding
13174 template-parameter-lists do not apply. */
13175 saved_num_template_parameter_lists
13176 = parser
->num_template_parameter_lists
;
13177 parser
->num_template_parameter_lists
= 0;
13179 begin_scope (sk_function_parms
, NULL_TREE
);
13181 /* Parse the parameter-declaration-clause. */
13182 params
= cp_parser_parameter_declaration_clause (parser
);
13184 parser
->num_template_parameter_lists
13185 = saved_num_template_parameter_lists
;
13187 /* If all went well, parse the cv-qualifier-seq and the
13188 exception-specification. */
13189 if (member_p
|| cp_parser_parse_definitely (parser
))
13191 cp_cv_quals cv_quals
;
13192 tree exception_specification
;
13195 is_declarator
= true;
13197 if (ctor_dtor_or_conv_p
)
13198 *ctor_dtor_or_conv_p
= *ctor_dtor_or_conv_p
< 0;
13200 /* Consume the `)'. */
13201 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
13203 /* Parse the cv-qualifier-seq. */
13204 cv_quals
= cp_parser_cv_qualifier_seq_opt (parser
);
13205 /* And the exception-specification. */
13206 exception_specification
13207 = cp_parser_exception_specification_opt (parser
);
13210 = cp_parser_late_return_type_opt (parser
);
13212 /* Create the function-declarator. */
13213 declarator
= make_call_declarator (declarator
,
13216 exception_specification
,
13218 /* Any subsequent parameter lists are to do with
13219 return type, so are not those of the declared
13221 parser
->default_arg_ok_p
= false;
13224 /* Remove the function parms from scope. */
13225 for (t
= current_binding_level
->names
; t
; t
= TREE_CHAIN (t
))
13226 pop_binding (DECL_NAME (t
), t
);
13230 /* Repeat the main loop. */
13234 /* If this is the first, we can try a parenthesized
13238 bool saved_in_type_id_in_expr_p
;
13240 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
13241 parser
->in_declarator_p
= saved_in_declarator_p
;
13243 /* Consume the `('. */
13244 cp_lexer_consume_token (parser
->lexer
);
13245 /* Parse the nested declarator. */
13246 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
13247 parser
->in_type_id_in_expr_p
= true;
13249 = cp_parser_declarator (parser
, dcl_kind
, ctor_dtor_or_conv_p
,
13250 /*parenthesized_p=*/NULL
,
13252 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
13254 /* Expect a `)'. */
13255 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>"))
13256 declarator
= cp_error_declarator
;
13257 if (declarator
== cp_error_declarator
)
13260 goto handle_declarator
;
13262 /* Otherwise, we must be done. */
13266 else if ((!first
|| dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
)
13267 && token
->type
== CPP_OPEN_SQUARE
)
13269 /* Parse an array-declarator. */
13272 if (ctor_dtor_or_conv_p
)
13273 *ctor_dtor_or_conv_p
= 0;
13276 parser
->default_arg_ok_p
= false;
13277 parser
->in_declarator_p
= true;
13278 /* Consume the `['. */
13279 cp_lexer_consume_token (parser
->lexer
);
13280 /* Peek at the next token. */
13281 token
= cp_lexer_peek_token (parser
->lexer
);
13282 /* If the next token is `]', then there is no
13283 constant-expression. */
13284 if (token
->type
!= CPP_CLOSE_SQUARE
)
13286 bool non_constant_p
;
13289 = cp_parser_constant_expression (parser
,
13290 /*allow_non_constant=*/true,
13292 if (!non_constant_p
)
13293 bounds
= fold_non_dependent_expr (bounds
);
13294 else if (processing_template_decl
)
13296 /* Remember this wasn't a constant-expression. */
13297 bounds
= build_nop (TREE_TYPE (bounds
), bounds
);
13298 TREE_SIDE_EFFECTS (bounds
) = 1;
13301 /* Normally, the array bound must be an integral constant
13302 expression. However, as an extension, we allow VLAs
13303 in function scopes. */
13304 else if (!parser
->in_function_body
)
13306 error ("%Harray bound is not an integer constant",
13308 bounds
= error_mark_node
;
13312 bounds
= NULL_TREE
;
13313 /* Look for the closing `]'. */
13314 if (!cp_parser_require (parser
, CPP_CLOSE_SQUARE
, "%<]%>"))
13316 declarator
= cp_error_declarator
;
13320 declarator
= make_array_declarator (declarator
, bounds
);
13322 else if (first
&& dcl_kind
!= CP_PARSER_DECLARATOR_ABSTRACT
)
13324 tree qualifying_scope
;
13325 tree unqualified_name
;
13326 special_function_kind sfk
;
13328 bool pack_expansion_p
= false;
13329 cp_token
*declarator_id_start_token
;
13331 /* Parse a declarator-id */
13332 abstract_ok
= (dcl_kind
== CP_PARSER_DECLARATOR_EITHER
);
13335 cp_parser_parse_tentatively (parser
);
13337 /* If we see an ellipsis, we should be looking at a
13339 if (token
->type
== CPP_ELLIPSIS
)
13341 /* Consume the `...' */
13342 cp_lexer_consume_token (parser
->lexer
);
13344 pack_expansion_p
= true;
13348 declarator_id_start_token
= cp_lexer_peek_token (parser
->lexer
);
13350 = cp_parser_declarator_id (parser
, /*optional_p=*/abstract_ok
);
13351 qualifying_scope
= parser
->scope
;
13356 if (!unqualified_name
&& pack_expansion_p
)
13358 /* Check whether an error occurred. */
13359 okay
= !cp_parser_error_occurred (parser
);
13361 /* We already consumed the ellipsis to mark a
13362 parameter pack, but we have no way to report it,
13363 so abort the tentative parse. We will be exiting
13364 immediately anyway. */
13365 cp_parser_abort_tentative_parse (parser
);
13368 okay
= cp_parser_parse_definitely (parser
);
13371 unqualified_name
= error_mark_node
;
13372 else if (unqualified_name
13373 && (qualifying_scope
13374 || (TREE_CODE (unqualified_name
)
13375 != IDENTIFIER_NODE
)))
13377 cp_parser_error (parser
, "expected unqualified-id");
13378 unqualified_name
= error_mark_node
;
13382 if (!unqualified_name
)
13384 if (unqualified_name
== error_mark_node
)
13386 declarator
= cp_error_declarator
;
13387 pack_expansion_p
= false;
13388 declarator
->parameter_pack_p
= false;
13392 if (qualifying_scope
&& at_namespace_scope_p ()
13393 && TREE_CODE (qualifying_scope
) == TYPENAME_TYPE
)
13395 /* In the declaration of a member of a template class
13396 outside of the class itself, the SCOPE will sometimes
13397 be a TYPENAME_TYPE. For example, given:
13399 template <typename T>
13400 int S<T>::R::i = 3;
13402 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
13403 this context, we must resolve S<T>::R to an ordinary
13404 type, rather than a typename type.
13406 The reason we normally avoid resolving TYPENAME_TYPEs
13407 is that a specialization of `S' might render
13408 `S<T>::R' not a type. However, if `S' is
13409 specialized, then this `i' will not be used, so there
13410 is no harm in resolving the types here. */
13413 /* Resolve the TYPENAME_TYPE. */
13414 type
= resolve_typename_type (qualifying_scope
,
13415 /*only_current_p=*/false);
13416 /* If that failed, the declarator is invalid. */
13417 if (TREE_CODE (type
) == TYPENAME_TYPE
)
13418 error ("%H%<%T::%E%> is not a type",
13419 &declarator_id_start_token
->location
,
13420 TYPE_CONTEXT (qualifying_scope
),
13421 TYPE_IDENTIFIER (qualifying_scope
));
13422 qualifying_scope
= type
;
13427 if (unqualified_name
)
13431 if (qualifying_scope
13432 && CLASS_TYPE_P (qualifying_scope
))
13433 class_type
= qualifying_scope
;
13435 class_type
= current_class_type
;
13437 if (TREE_CODE (unqualified_name
) == TYPE_DECL
)
13439 tree name_type
= TREE_TYPE (unqualified_name
);
13440 if (class_type
&& same_type_p (name_type
, class_type
))
13442 if (qualifying_scope
13443 && CLASSTYPE_USE_TEMPLATE (name_type
))
13445 error ("%Hinvalid use of constructor as a template",
13446 &declarator_id_start_token
->location
);
13447 inform (input_location
, "use %<%T::%D%> instead of %<%T::%D%> to "
13448 "name the constructor in a qualified name",
13450 DECL_NAME (TYPE_TI_TEMPLATE (class_type
)),
13451 class_type
, name_type
);
13452 declarator
= cp_error_declarator
;
13456 unqualified_name
= constructor_name (class_type
);
13460 /* We do not attempt to print the declarator
13461 here because we do not have enough
13462 information about its original syntactic
13464 cp_parser_error (parser
, "invalid declarator");
13465 declarator
= cp_error_declarator
;
13472 if (TREE_CODE (unqualified_name
) == BIT_NOT_EXPR
)
13473 sfk
= sfk_destructor
;
13474 else if (IDENTIFIER_TYPENAME_P (unqualified_name
))
13475 sfk
= sfk_conversion
;
13476 else if (/* There's no way to declare a constructor
13477 for an anonymous type, even if the type
13478 got a name for linkage purposes. */
13479 !TYPE_WAS_ANONYMOUS (class_type
)
13480 && constructor_name_p (unqualified_name
,
13483 unqualified_name
= constructor_name (class_type
);
13484 sfk
= sfk_constructor
;
13487 if (ctor_dtor_or_conv_p
&& sfk
!= sfk_none
)
13488 *ctor_dtor_or_conv_p
= -1;
13491 declarator
= make_id_declarator (qualifying_scope
,
13494 declarator
->id_loc
= token
->location
;
13495 declarator
->parameter_pack_p
= pack_expansion_p
;
13497 if (pack_expansion_p
)
13498 maybe_warn_variadic_templates ();
13500 handle_declarator
:;
13501 scope
= get_scope_of_declarator (declarator
);
13503 /* Any names that appear after the declarator-id for a
13504 member are looked up in the containing scope. */
13505 pushed_scope
= push_scope (scope
);
13506 parser
->in_declarator_p
= true;
13507 if ((ctor_dtor_or_conv_p
&& *ctor_dtor_or_conv_p
)
13508 || (declarator
&& declarator
->kind
== cdk_id
))
13509 /* Default args are only allowed on function
13511 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
13513 parser
->default_arg_ok_p
= false;
13522 /* For an abstract declarator, we might wind up with nothing at this
13523 point. That's an error; the declarator is not optional. */
13525 cp_parser_error (parser
, "expected declarator");
13527 /* If we entered a scope, we must exit it now. */
13529 pop_scope (pushed_scope
);
13531 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
13532 parser
->in_declarator_p
= saved_in_declarator_p
;
13537 /* Parse a ptr-operator.
13540 * cv-qualifier-seq [opt]
13542 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
13547 & cv-qualifier-seq [opt]
13549 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
13550 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
13551 an rvalue reference. In the case of a pointer-to-member, *TYPE is
13552 filled in with the TYPE containing the member. *CV_QUALS is
13553 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
13554 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
13555 Note that the tree codes returned by this function have nothing
13556 to do with the types of trees that will be eventually be created
13557 to represent the pointer or reference type being parsed. They are
13558 just constants with suggestive names. */
13559 static enum tree_code
13560 cp_parser_ptr_operator (cp_parser
* parser
,
13562 cp_cv_quals
*cv_quals
)
13564 enum tree_code code
= ERROR_MARK
;
13567 /* Assume that it's not a pointer-to-member. */
13569 /* And that there are no cv-qualifiers. */
13570 *cv_quals
= TYPE_UNQUALIFIED
;
13572 /* Peek at the next token. */
13573 token
= cp_lexer_peek_token (parser
->lexer
);
13575 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
13576 if (token
->type
== CPP_MULT
)
13577 code
= INDIRECT_REF
;
13578 else if (token
->type
== CPP_AND
)
13580 else if ((cxx_dialect
!= cxx98
) &&
13581 token
->type
== CPP_AND_AND
) /* C++0x only */
13582 code
= NON_LVALUE_EXPR
;
13584 if (code
!= ERROR_MARK
)
13586 /* Consume the `*', `&' or `&&'. */
13587 cp_lexer_consume_token (parser
->lexer
);
13589 /* A `*' can be followed by a cv-qualifier-seq, and so can a
13590 `&', if we are allowing GNU extensions. (The only qualifier
13591 that can legally appear after `&' is `restrict', but that is
13592 enforced during semantic analysis. */
13593 if (code
== INDIRECT_REF
13594 || cp_parser_allow_gnu_extensions_p (parser
))
13595 *cv_quals
= cp_parser_cv_qualifier_seq_opt (parser
);
13599 /* Try the pointer-to-member case. */
13600 cp_parser_parse_tentatively (parser
);
13601 /* Look for the optional `::' operator. */
13602 cp_parser_global_scope_opt (parser
,
13603 /*current_scope_valid_p=*/false);
13604 /* Look for the nested-name specifier. */
13605 token
= cp_lexer_peek_token (parser
->lexer
);
13606 cp_parser_nested_name_specifier (parser
,
13607 /*typename_keyword_p=*/false,
13608 /*check_dependency_p=*/true,
13610 /*is_declaration=*/false);
13611 /* If we found it, and the next token is a `*', then we are
13612 indeed looking at a pointer-to-member operator. */
13613 if (!cp_parser_error_occurred (parser
)
13614 && cp_parser_require (parser
, CPP_MULT
, "%<*%>"))
13616 /* Indicate that the `*' operator was used. */
13617 code
= INDIRECT_REF
;
13619 if (TREE_CODE (parser
->scope
) == NAMESPACE_DECL
)
13620 error ("%H%qD is a namespace", &token
->location
, parser
->scope
);
13623 /* The type of which the member is a member is given by the
13625 *type
= parser
->scope
;
13626 /* The next name will not be qualified. */
13627 parser
->scope
= NULL_TREE
;
13628 parser
->qualifying_scope
= NULL_TREE
;
13629 parser
->object_scope
= NULL_TREE
;
13630 /* Look for the optional cv-qualifier-seq. */
13631 *cv_quals
= cp_parser_cv_qualifier_seq_opt (parser
);
13634 /* If that didn't work we don't have a ptr-operator. */
13635 if (!cp_parser_parse_definitely (parser
))
13636 cp_parser_error (parser
, "expected ptr-operator");
13642 /* Parse an (optional) cv-qualifier-seq.
13645 cv-qualifier cv-qualifier-seq [opt]
13656 Returns a bitmask representing the cv-qualifiers. */
13659 cp_parser_cv_qualifier_seq_opt (cp_parser
* parser
)
13661 cp_cv_quals cv_quals
= TYPE_UNQUALIFIED
;
13666 cp_cv_quals cv_qualifier
;
13668 /* Peek at the next token. */
13669 token
= cp_lexer_peek_token (parser
->lexer
);
13670 /* See if it's a cv-qualifier. */
13671 switch (token
->keyword
)
13674 cv_qualifier
= TYPE_QUAL_CONST
;
13678 cv_qualifier
= TYPE_QUAL_VOLATILE
;
13682 cv_qualifier
= TYPE_QUAL_RESTRICT
;
13686 cv_qualifier
= TYPE_UNQUALIFIED
;
13693 if (cv_quals
& cv_qualifier
)
13695 error ("%Hduplicate cv-qualifier", &token
->location
);
13696 cp_lexer_purge_token (parser
->lexer
);
13700 cp_lexer_consume_token (parser
->lexer
);
13701 cv_quals
|= cv_qualifier
;
13708 /* Parse a late-specified return type, if any. This is not a separate
13709 non-terminal, but part of a function declarator, which looks like
13713 Returns the type indicated by the type-id. */
13716 cp_parser_late_return_type_opt (cp_parser
* parser
)
13720 /* Peek at the next token. */
13721 token
= cp_lexer_peek_token (parser
->lexer
);
13722 /* A late-specified return type is indicated by an initial '->'. */
13723 if (token
->type
!= CPP_DEREF
)
13726 /* Consume the ->. */
13727 cp_lexer_consume_token (parser
->lexer
);
13729 return cp_parser_type_id (parser
);
13732 /* Parse a declarator-id.
13736 :: [opt] nested-name-specifier [opt] type-name
13738 In the `id-expression' case, the value returned is as for
13739 cp_parser_id_expression if the id-expression was an unqualified-id.
13740 If the id-expression was a qualified-id, then a SCOPE_REF is
13741 returned. The first operand is the scope (either a NAMESPACE_DECL
13742 or TREE_TYPE), but the second is still just a representation of an
13746 cp_parser_declarator_id (cp_parser
* parser
, bool optional_p
)
13749 /* The expression must be an id-expression. Assume that qualified
13750 names are the names of types so that:
13753 int S<T>::R::i = 3;
13755 will work; we must treat `S<T>::R' as the name of a type.
13756 Similarly, assume that qualified names are templates, where
13760 int S<T>::R<T>::i = 3;
13763 id
= cp_parser_id_expression (parser
,
13764 /*template_keyword_p=*/false,
13765 /*check_dependency_p=*/false,
13766 /*template_p=*/NULL
,
13767 /*declarator_p=*/true,
13769 if (id
&& BASELINK_P (id
))
13770 id
= BASELINK_FUNCTIONS (id
);
13774 /* Parse a type-id.
13777 type-specifier-seq abstract-declarator [opt]
13779 Returns the TYPE specified. */
13782 cp_parser_type_id_1 (cp_parser
* parser
, bool is_template_arg
)
13784 cp_decl_specifier_seq type_specifier_seq
;
13785 cp_declarator
*abstract_declarator
;
13787 /* Parse the type-specifier-seq. */
13788 cp_parser_type_specifier_seq (parser
, /*is_condition=*/false,
13789 &type_specifier_seq
);
13790 if (type_specifier_seq
.type
== error_mark_node
)
13791 return error_mark_node
;
13793 /* There might or might not be an abstract declarator. */
13794 cp_parser_parse_tentatively (parser
);
13795 /* Look for the declarator. */
13796 abstract_declarator
13797 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_ABSTRACT
, NULL
,
13798 /*parenthesized_p=*/NULL
,
13799 /*member_p=*/false);
13800 /* Check to see if there really was a declarator. */
13801 if (!cp_parser_parse_definitely (parser
))
13802 abstract_declarator
= NULL
;
13804 if (type_specifier_seq
.type
13805 && type_uses_auto (type_specifier_seq
.type
))
13807 error ("invalid use of %<auto%>");
13808 return error_mark_node
;
13811 return groktypename (&type_specifier_seq
, abstract_declarator
,
13815 static tree
cp_parser_type_id (cp_parser
*parser
)
13817 return cp_parser_type_id_1 (parser
, false);
13820 static tree
cp_parser_template_type_arg (cp_parser
*parser
)
13822 return cp_parser_type_id_1 (parser
, true);
13825 /* Parse a type-specifier-seq.
13827 type-specifier-seq:
13828 type-specifier type-specifier-seq [opt]
13832 type-specifier-seq:
13833 attributes type-specifier-seq [opt]
13835 If IS_CONDITION is true, we are at the start of a "condition",
13836 e.g., we've just seen "if (".
13838 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
13841 cp_parser_type_specifier_seq (cp_parser
* parser
,
13843 cp_decl_specifier_seq
*type_specifier_seq
)
13845 bool seen_type_specifier
= false;
13846 cp_parser_flags flags
= CP_PARSER_FLAGS_OPTIONAL
;
13847 cp_token
*start_token
= NULL
;
13849 /* Clear the TYPE_SPECIFIER_SEQ. */
13850 clear_decl_specs (type_specifier_seq
);
13852 /* Parse the type-specifiers and attributes. */
13855 tree type_specifier
;
13856 bool is_cv_qualifier
;
13858 /* Check for attributes first. */
13859 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ATTRIBUTE
))
13861 type_specifier_seq
->attributes
=
13862 chainon (type_specifier_seq
->attributes
,
13863 cp_parser_attributes_opt (parser
));
13867 /* record the token of the beginning of the type specifier seq,
13868 for error reporting purposes*/
13870 start_token
= cp_lexer_peek_token (parser
->lexer
);
13872 /* Look for the type-specifier. */
13873 type_specifier
= cp_parser_type_specifier (parser
,
13875 type_specifier_seq
,
13876 /*is_declaration=*/false,
13879 if (!type_specifier
)
13881 /* If the first type-specifier could not be found, this is not a
13882 type-specifier-seq at all. */
13883 if (!seen_type_specifier
)
13885 cp_parser_error (parser
, "expected type-specifier");
13886 type_specifier_seq
->type
= error_mark_node
;
13889 /* If subsequent type-specifiers could not be found, the
13890 type-specifier-seq is complete. */
13894 invoke_plugin_callbacks (PLUGIN_FINISH_TYPE
, type_specifier
);
13896 seen_type_specifier
= true;
13897 /* The standard says that a condition can be:
13899 type-specifier-seq declarator = assignment-expression
13906 we should treat the "S" as a declarator, not as a
13907 type-specifier. The standard doesn't say that explicitly for
13908 type-specifier-seq, but it does say that for
13909 decl-specifier-seq in an ordinary declaration. Perhaps it
13910 would be clearer just to allow a decl-specifier-seq here, and
13911 then add a semantic restriction that if any decl-specifiers
13912 that are not type-specifiers appear, the program is invalid. */
13913 if (is_condition
&& !is_cv_qualifier
)
13914 flags
|= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
;
13917 cp_parser_check_decl_spec (type_specifier_seq
, start_token
->location
);
13920 /* Parse a parameter-declaration-clause.
13922 parameter-declaration-clause:
13923 parameter-declaration-list [opt] ... [opt]
13924 parameter-declaration-list , ...
13926 Returns a representation for the parameter declarations. A return
13927 value of NULL indicates a parameter-declaration-clause consisting
13928 only of an ellipsis. */
13931 cp_parser_parameter_declaration_clause (cp_parser
* parser
)
13938 /* Peek at the next token. */
13939 token
= cp_lexer_peek_token (parser
->lexer
);
13940 /* Check for trivial parameter-declaration-clauses. */
13941 if (token
->type
== CPP_ELLIPSIS
)
13943 /* Consume the `...' token. */
13944 cp_lexer_consume_token (parser
->lexer
);
13947 else if (token
->type
== CPP_CLOSE_PAREN
)
13948 /* There are no parameters. */
13950 #ifndef NO_IMPLICIT_EXTERN_C
13951 if (in_system_header
&& current_class_type
== NULL
13952 && current_lang_name
== lang_name_c
)
13956 return void_list_node
;
13958 /* Check for `(void)', too, which is a special case. */
13959 else if (token
->keyword
== RID_VOID
13960 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
13961 == CPP_CLOSE_PAREN
))
13963 /* Consume the `void' token. */
13964 cp_lexer_consume_token (parser
->lexer
);
13965 /* There are no parameters. */
13966 return void_list_node
;
13969 /* Parse the parameter-declaration-list. */
13970 parameters
= cp_parser_parameter_declaration_list (parser
, &is_error
);
13971 /* If a parse error occurred while parsing the
13972 parameter-declaration-list, then the entire
13973 parameter-declaration-clause is erroneous. */
13977 /* Peek at the next token. */
13978 token
= cp_lexer_peek_token (parser
->lexer
);
13979 /* If it's a `,', the clause should terminate with an ellipsis. */
13980 if (token
->type
== CPP_COMMA
)
13982 /* Consume the `,'. */
13983 cp_lexer_consume_token (parser
->lexer
);
13984 /* Expect an ellipsis. */
13986 = (cp_parser_require (parser
, CPP_ELLIPSIS
, "%<...%>") != NULL
);
13988 /* It might also be `...' if the optional trailing `,' was
13990 else if (token
->type
== CPP_ELLIPSIS
)
13992 /* Consume the `...' token. */
13993 cp_lexer_consume_token (parser
->lexer
);
13994 /* And remember that we saw it. */
13998 ellipsis_p
= false;
14000 /* Finish the parameter list. */
14002 parameters
= chainon (parameters
, void_list_node
);
14007 /* Parse a parameter-declaration-list.
14009 parameter-declaration-list:
14010 parameter-declaration
14011 parameter-declaration-list , parameter-declaration
14013 Returns a representation of the parameter-declaration-list, as for
14014 cp_parser_parameter_declaration_clause. However, the
14015 `void_list_node' is never appended to the list. Upon return,
14016 *IS_ERROR will be true iff an error occurred. */
14019 cp_parser_parameter_declaration_list (cp_parser
* parser
, bool *is_error
)
14021 tree parameters
= NULL_TREE
;
14022 tree
*tail
= ¶meters
;
14023 bool saved_in_unbraced_linkage_specification_p
;
14025 /* Assume all will go well. */
14027 /* The special considerations that apply to a function within an
14028 unbraced linkage specifications do not apply to the parameters
14029 to the function. */
14030 saved_in_unbraced_linkage_specification_p
14031 = parser
->in_unbraced_linkage_specification_p
;
14032 parser
->in_unbraced_linkage_specification_p
= false;
14034 /* Look for more parameters. */
14037 cp_parameter_declarator
*parameter
;
14038 tree decl
= error_mark_node
;
14039 bool parenthesized_p
;
14040 /* Parse the parameter. */
14042 = cp_parser_parameter_declaration (parser
,
14043 /*template_parm_p=*/false,
14046 /* We don't know yet if the enclosing context is deprecated, so wait
14047 and warn in grokparms if appropriate. */
14048 deprecated_state
= DEPRECATED_SUPPRESS
;
14051 decl
= grokdeclarator (parameter
->declarator
,
14052 ¶meter
->decl_specifiers
,
14054 parameter
->default_argument
!= NULL_TREE
,
14055 ¶meter
->decl_specifiers
.attributes
);
14057 deprecated_state
= DEPRECATED_NORMAL
;
14059 /* If a parse error occurred parsing the parameter declaration,
14060 then the entire parameter-declaration-list is erroneous. */
14061 if (decl
== error_mark_node
)
14064 parameters
= error_mark_node
;
14068 if (parameter
->decl_specifiers
.attributes
)
14069 cplus_decl_attributes (&decl
,
14070 parameter
->decl_specifiers
.attributes
,
14072 if (DECL_NAME (decl
))
14073 decl
= pushdecl (decl
);
14075 /* Add the new parameter to the list. */
14076 *tail
= build_tree_list (parameter
->default_argument
, decl
);
14077 tail
= &TREE_CHAIN (*tail
);
14079 /* Peek at the next token. */
14080 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
)
14081 || cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
)
14082 /* These are for Objective-C++ */
14083 || cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
14084 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
14085 /* The parameter-declaration-list is complete. */
14087 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
14091 /* Peek at the next token. */
14092 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
14093 /* If it's an ellipsis, then the list is complete. */
14094 if (token
->type
== CPP_ELLIPSIS
)
14096 /* Otherwise, there must be more parameters. Consume the
14098 cp_lexer_consume_token (parser
->lexer
);
14099 /* When parsing something like:
14101 int i(float f, double d)
14103 we can tell after seeing the declaration for "f" that we
14104 are not looking at an initialization of a variable "i",
14105 but rather at the declaration of a function "i".
14107 Due to the fact that the parsing of template arguments
14108 (as specified to a template-id) requires backtracking we
14109 cannot use this technique when inside a template argument
14111 if (!parser
->in_template_argument_list_p
14112 && !parser
->in_type_id_in_expr_p
14113 && cp_parser_uncommitted_to_tentative_parse_p (parser
)
14114 /* However, a parameter-declaration of the form
14115 "foat(f)" (which is a valid declaration of a
14116 parameter "f") can also be interpreted as an
14117 expression (the conversion of "f" to "float"). */
14118 && !parenthesized_p
)
14119 cp_parser_commit_to_tentative_parse (parser
);
14123 cp_parser_error (parser
, "expected %<,%> or %<...%>");
14124 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
14125 cp_parser_skip_to_closing_parenthesis (parser
,
14126 /*recovering=*/true,
14127 /*or_comma=*/false,
14128 /*consume_paren=*/false);
14133 parser
->in_unbraced_linkage_specification_p
14134 = saved_in_unbraced_linkage_specification_p
;
14139 /* Parse a parameter declaration.
14141 parameter-declaration:
14142 decl-specifier-seq ... [opt] declarator
14143 decl-specifier-seq declarator = assignment-expression
14144 decl-specifier-seq ... [opt] abstract-declarator [opt]
14145 decl-specifier-seq abstract-declarator [opt] = assignment-expression
14147 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
14148 declares a template parameter. (In that case, a non-nested `>'
14149 token encountered during the parsing of the assignment-expression
14150 is not interpreted as a greater-than operator.)
14152 Returns a representation of the parameter, or NULL if an error
14153 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
14154 true iff the declarator is of the form "(p)". */
14156 static cp_parameter_declarator
*
14157 cp_parser_parameter_declaration (cp_parser
*parser
,
14158 bool template_parm_p
,
14159 bool *parenthesized_p
)
14161 int declares_class_or_enum
;
14162 bool greater_than_is_operator_p
;
14163 cp_decl_specifier_seq decl_specifiers
;
14164 cp_declarator
*declarator
;
14165 tree default_argument
;
14166 cp_token
*token
= NULL
, *declarator_token_start
= NULL
;
14167 const char *saved_message
;
14169 /* In a template parameter, `>' is not an operator.
14173 When parsing a default template-argument for a non-type
14174 template-parameter, the first non-nested `>' is taken as the end
14175 of the template parameter-list rather than a greater-than
14177 greater_than_is_operator_p
= !template_parm_p
;
14179 /* Type definitions may not appear in parameter types. */
14180 saved_message
= parser
->type_definition_forbidden_message
;
14181 parser
->type_definition_forbidden_message
14182 = "types may not be defined in parameter types";
14184 /* Parse the declaration-specifiers. */
14185 cp_parser_decl_specifier_seq (parser
,
14186 CP_PARSER_FLAGS_NONE
,
14188 &declares_class_or_enum
);
14189 /* If an error occurred, there's no reason to attempt to parse the
14190 rest of the declaration. */
14191 if (cp_parser_error_occurred (parser
))
14193 parser
->type_definition_forbidden_message
= saved_message
;
14197 /* Peek at the next token. */
14198 token
= cp_lexer_peek_token (parser
->lexer
);
14200 /* If the next token is a `)', `,', `=', `>', or `...', then there
14201 is no declarator. However, when variadic templates are enabled,
14202 there may be a declarator following `...'. */
14203 if (token
->type
== CPP_CLOSE_PAREN
14204 || token
->type
== CPP_COMMA
14205 || token
->type
== CPP_EQ
14206 || token
->type
== CPP_GREATER
)
14209 if (parenthesized_p
)
14210 *parenthesized_p
= false;
14212 /* Otherwise, there should be a declarator. */
14215 bool saved_default_arg_ok_p
= parser
->default_arg_ok_p
;
14216 parser
->default_arg_ok_p
= false;
14218 /* After seeing a decl-specifier-seq, if the next token is not a
14219 "(", there is no possibility that the code is a valid
14220 expression. Therefore, if parsing tentatively, we commit at
14222 if (!parser
->in_template_argument_list_p
14223 /* In an expression context, having seen:
14227 we cannot be sure whether we are looking at a
14228 function-type (taking a "char" as a parameter) or a cast
14229 of some object of type "char" to "int". */
14230 && !parser
->in_type_id_in_expr_p
14231 && cp_parser_uncommitted_to_tentative_parse_p (parser
)
14232 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_PAREN
))
14233 cp_parser_commit_to_tentative_parse (parser
);
14234 /* Parse the declarator. */
14235 declarator_token_start
= token
;
14236 declarator
= cp_parser_declarator (parser
,
14237 CP_PARSER_DECLARATOR_EITHER
,
14238 /*ctor_dtor_or_conv_p=*/NULL
,
14240 /*member_p=*/false);
14241 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
14242 /* After the declarator, allow more attributes. */
14243 decl_specifiers
.attributes
14244 = chainon (decl_specifiers
.attributes
,
14245 cp_parser_attributes_opt (parser
));
14248 /* If the next token is an ellipsis, and we have not seen a
14249 declarator name, and the type of the declarator contains parameter
14250 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
14251 a parameter pack expansion expression. Otherwise, leave the
14252 ellipsis for a C-style variadic function. */
14253 token
= cp_lexer_peek_token (parser
->lexer
);
14254 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
14256 tree type
= decl_specifiers
.type
;
14258 if (type
&& DECL_P (type
))
14259 type
= TREE_TYPE (type
);
14262 && TREE_CODE (type
) != TYPE_PACK_EXPANSION
14263 && declarator_can_be_parameter_pack (declarator
)
14264 && (!declarator
|| !declarator
->parameter_pack_p
)
14265 && uses_parameter_packs (type
))
14267 /* Consume the `...'. */
14268 cp_lexer_consume_token (parser
->lexer
);
14269 maybe_warn_variadic_templates ();
14271 /* Build a pack expansion type */
14273 declarator
->parameter_pack_p
= true;
14275 decl_specifiers
.type
= make_pack_expansion (type
);
14279 /* The restriction on defining new types applies only to the type
14280 of the parameter, not to the default argument. */
14281 parser
->type_definition_forbidden_message
= saved_message
;
14283 /* If the next token is `=', then process a default argument. */
14284 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
14286 /* Consume the `='. */
14287 cp_lexer_consume_token (parser
->lexer
);
14289 /* If we are defining a class, then the tokens that make up the
14290 default argument must be saved and processed later. */
14291 if (!template_parm_p
&& at_class_scope_p ()
14292 && TYPE_BEING_DEFINED (current_class_type
))
14294 unsigned depth
= 0;
14295 int maybe_template_id
= 0;
14296 cp_token
*first_token
;
14299 /* Add tokens until we have processed the entire default
14300 argument. We add the range [first_token, token). */
14301 first_token
= cp_lexer_peek_token (parser
->lexer
);
14306 /* Peek at the next token. */
14307 token
= cp_lexer_peek_token (parser
->lexer
);
14308 /* What we do depends on what token we have. */
14309 switch (token
->type
)
14311 /* In valid code, a default argument must be
14312 immediately followed by a `,' `)', or `...'. */
14314 if (depth
== 0 && maybe_template_id
)
14316 /* If we've seen a '<', we might be in a
14317 template-argument-list. Until Core issue 325 is
14318 resolved, we don't know how this situation ought
14319 to be handled, so try to DTRT. We check whether
14320 what comes after the comma is a valid parameter
14321 declaration list. If it is, then the comma ends
14322 the default argument; otherwise the default
14323 argument continues. */
14324 bool error
= false;
14326 /* Set ITALP so cp_parser_parameter_declaration_list
14327 doesn't decide to commit to this parse. */
14328 bool saved_italp
= parser
->in_template_argument_list_p
;
14329 parser
->in_template_argument_list_p
= true;
14331 cp_parser_parse_tentatively (parser
);
14332 cp_lexer_consume_token (parser
->lexer
);
14333 cp_parser_parameter_declaration_list (parser
, &error
);
14334 if (!cp_parser_error_occurred (parser
) && !error
)
14336 cp_parser_abort_tentative_parse (parser
);
14338 parser
->in_template_argument_list_p
= saved_italp
;
14341 case CPP_CLOSE_PAREN
:
14343 /* If we run into a non-nested `;', `}', or `]',
14344 then the code is invalid -- but the default
14345 argument is certainly over. */
14346 case CPP_SEMICOLON
:
14347 case CPP_CLOSE_BRACE
:
14348 case CPP_CLOSE_SQUARE
:
14351 /* Update DEPTH, if necessary. */
14352 else if (token
->type
== CPP_CLOSE_PAREN
14353 || token
->type
== CPP_CLOSE_BRACE
14354 || token
->type
== CPP_CLOSE_SQUARE
)
14358 case CPP_OPEN_PAREN
:
14359 case CPP_OPEN_SQUARE
:
14360 case CPP_OPEN_BRACE
:
14366 /* This might be the comparison operator, or it might
14367 start a template argument list. */
14368 ++maybe_template_id
;
14372 if (cxx_dialect
== cxx98
)
14374 /* Fall through for C++0x, which treats the `>>'
14375 operator like two `>' tokens in certain
14381 /* This might be an operator, or it might close a
14382 template argument list. But if a previous '<'
14383 started a template argument list, this will have
14384 closed it, so we can't be in one anymore. */
14385 maybe_template_id
-= 1 + (token
->type
== CPP_RSHIFT
);
14386 if (maybe_template_id
< 0)
14387 maybe_template_id
= 0;
14391 /* If we run out of tokens, issue an error message. */
14393 case CPP_PRAGMA_EOL
:
14394 error ("%Hfile ends in default argument", &token
->location
);
14400 /* In these cases, we should look for template-ids.
14401 For example, if the default argument is
14402 `X<int, double>()', we need to do name lookup to
14403 figure out whether or not `X' is a template; if
14404 so, the `,' does not end the default argument.
14406 That is not yet done. */
14413 /* If we've reached the end, stop. */
14417 /* Add the token to the token block. */
14418 token
= cp_lexer_consume_token (parser
->lexer
);
14421 /* Create a DEFAULT_ARG to represent the unparsed default
14423 default_argument
= make_node (DEFAULT_ARG
);
14424 DEFARG_TOKENS (default_argument
)
14425 = cp_token_cache_new (first_token
, token
);
14426 DEFARG_INSTANTIATIONS (default_argument
) = NULL
;
14428 /* Outside of a class definition, we can just parse the
14429 assignment-expression. */
14432 token
= cp_lexer_peek_token (parser
->lexer
);
14434 = cp_parser_default_argument (parser
, template_parm_p
);
14437 if (!parser
->default_arg_ok_p
)
14439 if (flag_permissive
)
14440 warning (0, "deprecated use of default argument for parameter of non-function");
14443 error ("%Hdefault arguments are only "
14444 "permitted for function parameters",
14446 default_argument
= NULL_TREE
;
14449 else if ((declarator
&& declarator
->parameter_pack_p
)
14450 || (decl_specifiers
.type
14451 && PACK_EXPANSION_P (decl_specifiers
.type
)))
14453 const char* kind
= template_parm_p
? "template " : "";
14455 /* Find the name of the parameter pack. */
14456 cp_declarator
*id_declarator
= declarator
;
14457 while (id_declarator
&& id_declarator
->kind
!= cdk_id
)
14458 id_declarator
= id_declarator
->declarator
;
14460 if (id_declarator
&& id_declarator
->kind
== cdk_id
)
14461 error ("%H%sparameter pack %qD cannot have a default argument",
14462 &declarator_token_start
->location
,
14463 kind
, id_declarator
->u
.id
.unqualified_name
);
14465 error ("%H%sparameter pack cannot have a default argument",
14466 &declarator_token_start
->location
, kind
);
14468 default_argument
= NULL_TREE
;
14472 default_argument
= NULL_TREE
;
14474 return make_parameter_declarator (&decl_specifiers
,
14479 /* Parse a default argument and return it.
14481 TEMPLATE_PARM_P is true if this is a default argument for a
14482 non-type template parameter. */
14484 cp_parser_default_argument (cp_parser
*parser
, bool template_parm_p
)
14486 tree default_argument
= NULL_TREE
;
14487 bool saved_greater_than_is_operator_p
;
14488 bool saved_local_variables_forbidden_p
;
14490 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
14492 saved_greater_than_is_operator_p
= parser
->greater_than_is_operator_p
;
14493 parser
->greater_than_is_operator_p
= !template_parm_p
;
14494 /* Local variable names (and the `this' keyword) may not
14495 appear in a default argument. */
14496 saved_local_variables_forbidden_p
= parser
->local_variables_forbidden_p
;
14497 parser
->local_variables_forbidden_p
= true;
14498 /* The default argument expression may cause implicitly
14499 defined member functions to be synthesized, which will
14500 result in garbage collection. We must treat this
14501 situation as if we were within the body of function so as
14502 to avoid collecting live data on the stack. */
14504 /* Parse the assignment-expression. */
14505 if (template_parm_p
)
14506 push_deferring_access_checks (dk_no_deferred
);
14508 = cp_parser_assignment_expression (parser
, /*cast_p=*/false, NULL
);
14509 if (template_parm_p
)
14510 pop_deferring_access_checks ();
14511 /* Restore saved state. */
14513 parser
->greater_than_is_operator_p
= saved_greater_than_is_operator_p
;
14514 parser
->local_variables_forbidden_p
= saved_local_variables_forbidden_p
;
14516 return default_argument
;
14519 /* Parse a function-body.
14522 compound_statement */
14525 cp_parser_function_body (cp_parser
*parser
)
14527 cp_parser_compound_statement (parser
, NULL
, false);
14530 /* Parse a ctor-initializer-opt followed by a function-body. Return
14531 true if a ctor-initializer was present. */
14534 cp_parser_ctor_initializer_opt_and_function_body (cp_parser
*parser
)
14537 bool ctor_initializer_p
;
14539 /* Begin the function body. */
14540 body
= begin_function_body ();
14541 /* Parse the optional ctor-initializer. */
14542 ctor_initializer_p
= cp_parser_ctor_initializer_opt (parser
);
14543 /* Parse the function-body. */
14544 cp_parser_function_body (parser
);
14545 /* Finish the function body. */
14546 finish_function_body (body
);
14548 return ctor_initializer_p
;
14551 /* Parse an initializer.
14554 = initializer-clause
14555 ( expression-list )
14557 Returns an expression representing the initializer. If no
14558 initializer is present, NULL_TREE is returned.
14560 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
14561 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
14562 set to TRUE if there is no initializer present. If there is an
14563 initializer, and it is not a constant-expression, *NON_CONSTANT_P
14564 is set to true; otherwise it is set to false. */
14567 cp_parser_initializer (cp_parser
* parser
, bool* is_direct_init
,
14568 bool* non_constant_p
)
14573 /* Peek at the next token. */
14574 token
= cp_lexer_peek_token (parser
->lexer
);
14576 /* Let our caller know whether or not this initializer was
14578 *is_direct_init
= (token
->type
!= CPP_EQ
);
14579 /* Assume that the initializer is constant. */
14580 *non_constant_p
= false;
14582 if (token
->type
== CPP_EQ
)
14584 /* Consume the `='. */
14585 cp_lexer_consume_token (parser
->lexer
);
14586 /* Parse the initializer-clause. */
14587 init
= cp_parser_initializer_clause (parser
, non_constant_p
);
14589 else if (token
->type
== CPP_OPEN_PAREN
)
14590 init
= cp_parser_parenthesized_expression_list (parser
, false,
14592 /*allow_expansion_p=*/true,
14594 else if (token
->type
== CPP_OPEN_BRACE
)
14596 maybe_warn_cpp0x ("extended initializer lists");
14597 init
= cp_parser_braced_list (parser
, non_constant_p
);
14598 CONSTRUCTOR_IS_DIRECT_INIT (init
) = 1;
14602 /* Anything else is an error. */
14603 cp_parser_error (parser
, "expected initializer");
14604 init
= error_mark_node
;
14610 /* Parse an initializer-clause.
14612 initializer-clause:
14613 assignment-expression
14616 Returns an expression representing the initializer.
14618 If the `assignment-expression' production is used the value
14619 returned is simply a representation for the expression.
14621 Otherwise, calls cp_parser_braced_list. */
14624 cp_parser_initializer_clause (cp_parser
* parser
, bool* non_constant_p
)
14628 /* Assume the expression is constant. */
14629 *non_constant_p
= false;
14631 /* If it is not a `{', then we are looking at an
14632 assignment-expression. */
14633 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
))
14636 = cp_parser_constant_expression (parser
,
14637 /*allow_non_constant_p=*/true,
14639 if (!*non_constant_p
)
14640 initializer
= fold_non_dependent_expr (initializer
);
14643 initializer
= cp_parser_braced_list (parser
, non_constant_p
);
14645 return initializer
;
14648 /* Parse a brace-enclosed initializer list.
14651 { initializer-list , [opt] }
14654 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
14655 the elements of the initializer-list (or NULL, if the last
14656 production is used). The TREE_TYPE for the CONSTRUCTOR will be
14657 NULL_TREE. There is no way to detect whether or not the optional
14658 trailing `,' was provided. NON_CONSTANT_P is as for
14659 cp_parser_initializer. */
14662 cp_parser_braced_list (cp_parser
* parser
, bool* non_constant_p
)
14666 /* Consume the `{' token. */
14667 cp_lexer_consume_token (parser
->lexer
);
14668 /* Create a CONSTRUCTOR to represent the braced-initializer. */
14669 initializer
= make_node (CONSTRUCTOR
);
14670 /* If it's not a `}', then there is a non-trivial initializer. */
14671 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_BRACE
))
14673 /* Parse the initializer list. */
14674 CONSTRUCTOR_ELTS (initializer
)
14675 = cp_parser_initializer_list (parser
, non_constant_p
);
14676 /* A trailing `,' token is allowed. */
14677 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
14678 cp_lexer_consume_token (parser
->lexer
);
14680 /* Now, there should be a trailing `}'. */
14681 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "%<}%>");
14682 TREE_TYPE (initializer
) = init_list_type_node
;
14683 return initializer
;
14686 /* Parse an initializer-list.
14689 initializer-clause ... [opt]
14690 initializer-list , initializer-clause ... [opt]
14695 identifier : initializer-clause
14696 initializer-list, identifier : initializer-clause
14698 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
14699 for the initializer. If the INDEX of the elt is non-NULL, it is the
14700 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
14701 as for cp_parser_initializer. */
14703 static VEC(constructor_elt
,gc
) *
14704 cp_parser_initializer_list (cp_parser
* parser
, bool* non_constant_p
)
14706 VEC(constructor_elt
,gc
) *v
= NULL
;
14708 /* Assume all of the expressions are constant. */
14709 *non_constant_p
= false;
14711 /* Parse the rest of the list. */
14717 bool clause_non_constant_p
;
14719 /* If the next token is an identifier and the following one is a
14720 colon, we are looking at the GNU designated-initializer
14722 if (cp_parser_allow_gnu_extensions_p (parser
)
14723 && cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
)
14724 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_COLON
)
14726 /* Warn the user that they are using an extension. */
14727 pedwarn (input_location
, OPT_pedantic
,
14728 "ISO C++ does not allow designated initializers");
14729 /* Consume the identifier. */
14730 identifier
= cp_lexer_consume_token (parser
->lexer
)->u
.value
;
14731 /* Consume the `:'. */
14732 cp_lexer_consume_token (parser
->lexer
);
14735 identifier
= NULL_TREE
;
14737 /* Parse the initializer. */
14738 initializer
= cp_parser_initializer_clause (parser
,
14739 &clause_non_constant_p
);
14740 /* If any clause is non-constant, so is the entire initializer. */
14741 if (clause_non_constant_p
)
14742 *non_constant_p
= true;
14744 /* If we have an ellipsis, this is an initializer pack
14746 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
14748 /* Consume the `...'. */
14749 cp_lexer_consume_token (parser
->lexer
);
14751 /* Turn the initializer into an initializer expansion. */
14752 initializer
= make_pack_expansion (initializer
);
14755 /* Add it to the vector. */
14756 CONSTRUCTOR_APPEND_ELT(v
, identifier
, initializer
);
14758 /* If the next token is not a comma, we have reached the end of
14760 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
14763 /* Peek at the next token. */
14764 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
14765 /* If the next token is a `}', then we're still done. An
14766 initializer-clause can have a trailing `,' after the
14767 initializer-list and before the closing `}'. */
14768 if (token
->type
== CPP_CLOSE_BRACE
)
14771 /* Consume the `,' token. */
14772 cp_lexer_consume_token (parser
->lexer
);
14778 /* Classes [gram.class] */
14780 /* Parse a class-name.
14786 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
14787 to indicate that names looked up in dependent types should be
14788 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
14789 keyword has been used to indicate that the name that appears next
14790 is a template. TAG_TYPE indicates the explicit tag given before
14791 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
14792 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
14793 is the class being defined in a class-head.
14795 Returns the TYPE_DECL representing the class. */
14798 cp_parser_class_name (cp_parser
*parser
,
14799 bool typename_keyword_p
,
14800 bool template_keyword_p
,
14801 enum tag_types tag_type
,
14802 bool check_dependency_p
,
14804 bool is_declaration
)
14810 tree identifier
= NULL_TREE
;
14812 /* All class-names start with an identifier. */
14813 token
= cp_lexer_peek_token (parser
->lexer
);
14814 if (token
->type
!= CPP_NAME
&& token
->type
!= CPP_TEMPLATE_ID
)
14816 cp_parser_error (parser
, "expected class-name");
14817 return error_mark_node
;
14820 /* PARSER->SCOPE can be cleared when parsing the template-arguments
14821 to a template-id, so we save it here. */
14822 scope
= parser
->scope
;
14823 if (scope
== error_mark_node
)
14824 return error_mark_node
;
14826 /* Any name names a type if we're following the `typename' keyword
14827 in a qualified name where the enclosing scope is type-dependent. */
14828 typename_p
= (typename_keyword_p
&& scope
&& TYPE_P (scope
)
14829 && dependent_type_p (scope
));
14830 /* Handle the common case (an identifier, but not a template-id)
14832 if (token
->type
== CPP_NAME
14833 && !cp_parser_nth_token_starts_template_argument_list_p (parser
, 2))
14835 cp_token
*identifier_token
;
14838 /* Look for the identifier. */
14839 identifier_token
= cp_lexer_peek_token (parser
->lexer
);
14840 ambiguous_p
= identifier_token
->ambiguous_p
;
14841 identifier
= cp_parser_identifier (parser
);
14842 /* If the next token isn't an identifier, we are certainly not
14843 looking at a class-name. */
14844 if (identifier
== error_mark_node
)
14845 decl
= error_mark_node
;
14846 /* If we know this is a type-name, there's no need to look it
14848 else if (typename_p
)
14852 tree ambiguous_decls
;
14853 /* If we already know that this lookup is ambiguous, then
14854 we've already issued an error message; there's no reason
14858 cp_parser_simulate_error (parser
);
14859 return error_mark_node
;
14861 /* If the next token is a `::', then the name must be a type
14864 [basic.lookup.qual]
14866 During the lookup for a name preceding the :: scope
14867 resolution operator, object, function, and enumerator
14868 names are ignored. */
14869 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
14870 tag_type
= typename_type
;
14871 /* Look up the name. */
14872 decl
= cp_parser_lookup_name (parser
, identifier
,
14874 /*is_template=*/false,
14875 /*is_namespace=*/false,
14876 check_dependency_p
,
14878 identifier_token
->location
);
14879 if (ambiguous_decls
)
14881 error ("%Hreference to %qD is ambiguous",
14882 &identifier_token
->location
, identifier
);
14883 print_candidates (ambiguous_decls
);
14884 if (cp_parser_parsing_tentatively (parser
))
14886 identifier_token
->ambiguous_p
= true;
14887 cp_parser_simulate_error (parser
);
14889 return error_mark_node
;
14895 /* Try a template-id. */
14896 decl
= cp_parser_template_id (parser
, template_keyword_p
,
14897 check_dependency_p
,
14899 if (decl
== error_mark_node
)
14900 return error_mark_node
;
14903 decl
= cp_parser_maybe_treat_template_as_class (decl
, class_head_p
);
14905 /* If this is a typename, create a TYPENAME_TYPE. */
14906 if (typename_p
&& decl
!= error_mark_node
)
14908 decl
= make_typename_type (scope
, decl
, typename_type
,
14909 /*complain=*/tf_error
);
14910 if (decl
!= error_mark_node
)
14911 decl
= TYPE_NAME (decl
);
14914 /* Check to see that it is really the name of a class. */
14915 if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
14916 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
14917 && cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
14918 /* Situations like this:
14920 template <typename T> struct A {
14921 typename T::template X<int>::I i;
14924 are problematic. Is `T::template X<int>' a class-name? The
14925 standard does not seem to be definitive, but there is no other
14926 valid interpretation of the following `::'. Therefore, those
14927 names are considered class-names. */
14929 decl
= make_typename_type (scope
, decl
, tag_type
, tf_error
);
14930 if (decl
!= error_mark_node
)
14931 decl
= TYPE_NAME (decl
);
14933 else if (TREE_CODE (decl
) != TYPE_DECL
14934 || TREE_TYPE (decl
) == error_mark_node
14935 || !MAYBE_CLASS_TYPE_P (TREE_TYPE (decl
)))
14936 decl
= error_mark_node
;
14938 if (decl
== error_mark_node
)
14939 cp_parser_error (parser
, "expected class-name");
14940 else if (identifier
&& !parser
->scope
)
14941 maybe_note_name_used_in_class (identifier
, decl
);
14946 /* Parse a class-specifier.
14949 class-head { member-specification [opt] }
14951 Returns the TREE_TYPE representing the class. */
14954 cp_parser_class_specifier (cp_parser
* parser
)
14957 tree attributes
= NULL_TREE
;
14958 bool nested_name_specifier_p
;
14959 unsigned saved_num_template_parameter_lists
;
14960 bool saved_in_function_body
;
14961 bool saved_in_unbraced_linkage_specification_p
;
14962 tree old_scope
= NULL_TREE
;
14963 tree scope
= NULL_TREE
;
14966 push_deferring_access_checks (dk_no_deferred
);
14968 /* Parse the class-head. */
14969 type
= cp_parser_class_head (parser
,
14970 &nested_name_specifier_p
,
14973 /* If the class-head was a semantic disaster, skip the entire body
14977 cp_parser_skip_to_end_of_block_or_statement (parser
);
14978 pop_deferring_access_checks ();
14979 return error_mark_node
;
14982 /* Look for the `{'. */
14983 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, "%<{%>"))
14985 pop_deferring_access_checks ();
14986 return error_mark_node
;
14989 /* Process the base classes. If they're invalid, skip the
14990 entire class body. */
14991 if (!xref_basetypes (type
, bases
))
14993 /* Consuming the closing brace yields better error messages
14995 if (cp_parser_skip_to_closing_brace (parser
))
14996 cp_lexer_consume_token (parser
->lexer
);
14997 pop_deferring_access_checks ();
14998 return error_mark_node
;
15001 /* Issue an error message if type-definitions are forbidden here. */
15002 cp_parser_check_type_definition (parser
);
15003 /* Remember that we are defining one more class. */
15004 ++parser
->num_classes_being_defined
;
15005 /* Inside the class, surrounding template-parameter-lists do not
15007 saved_num_template_parameter_lists
15008 = parser
->num_template_parameter_lists
;
15009 parser
->num_template_parameter_lists
= 0;
15010 /* We are not in a function body. */
15011 saved_in_function_body
= parser
->in_function_body
;
15012 parser
->in_function_body
= false;
15013 /* We are not immediately inside an extern "lang" block. */
15014 saved_in_unbraced_linkage_specification_p
15015 = parser
->in_unbraced_linkage_specification_p
;
15016 parser
->in_unbraced_linkage_specification_p
= false;
15018 /* Start the class. */
15019 if (nested_name_specifier_p
)
15021 scope
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (type
));
15022 old_scope
= push_inner_scope (scope
);
15024 type
= begin_class_definition (type
, attributes
);
15026 if (type
== error_mark_node
)
15027 /* If the type is erroneous, skip the entire body of the class. */
15028 cp_parser_skip_to_closing_brace (parser
);
15030 /* Parse the member-specification. */
15031 cp_parser_member_specification_opt (parser
);
15033 /* Look for the trailing `}'. */
15034 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "%<}%>");
15035 /* Look for trailing attributes to apply to this class. */
15036 if (cp_parser_allow_gnu_extensions_p (parser
))
15037 attributes
= cp_parser_attributes_opt (parser
);
15038 if (type
!= error_mark_node
)
15039 type
= finish_struct (type
, attributes
);
15040 if (nested_name_specifier_p
)
15041 pop_inner_scope (old_scope
, scope
);
15042 /* If this class is not itself within the scope of another class,
15043 then we need to parse the bodies of all of the queued function
15044 definitions. Note that the queued functions defined in a class
15045 are not always processed immediately following the
15046 class-specifier for that class. Consider:
15049 struct B { void f() { sizeof (A); } };
15052 If `f' were processed before the processing of `A' were
15053 completed, there would be no way to compute the size of `A'.
15054 Note that the nesting we are interested in here is lexical --
15055 not the semantic nesting given by TYPE_CONTEXT. In particular,
15058 struct A { struct B; };
15059 struct A::B { void f() { } };
15061 there is no need to delay the parsing of `A::B::f'. */
15062 if (--parser
->num_classes_being_defined
== 0)
15066 tree class_type
= NULL_TREE
;
15067 tree pushed_scope
= NULL_TREE
;
15069 /* In a first pass, parse default arguments to the functions.
15070 Then, in a second pass, parse the bodies of the functions.
15071 This two-phased approach handles cases like:
15079 for (TREE_PURPOSE (parser
->unparsed_functions_queues
)
15080 = nreverse (TREE_PURPOSE (parser
->unparsed_functions_queues
));
15081 (queue_entry
= TREE_PURPOSE (parser
->unparsed_functions_queues
));
15082 TREE_PURPOSE (parser
->unparsed_functions_queues
)
15083 = TREE_CHAIN (TREE_PURPOSE (parser
->unparsed_functions_queues
)))
15085 fn
= TREE_VALUE (queue_entry
);
15086 /* If there are default arguments that have not yet been processed,
15087 take care of them now. */
15088 if (class_type
!= TREE_PURPOSE (queue_entry
))
15091 pop_scope (pushed_scope
);
15092 class_type
= TREE_PURPOSE (queue_entry
);
15093 pushed_scope
= push_scope (class_type
);
15095 /* Make sure that any template parameters are in scope. */
15096 maybe_begin_member_template_processing (fn
);
15097 /* Parse the default argument expressions. */
15098 cp_parser_late_parsing_default_args (parser
, fn
);
15099 /* Remove any template parameters from the symbol table. */
15100 maybe_end_member_template_processing ();
15103 pop_scope (pushed_scope
);
15104 /* Now parse the body of the functions. */
15105 for (TREE_VALUE (parser
->unparsed_functions_queues
)
15106 = nreverse (TREE_VALUE (parser
->unparsed_functions_queues
));
15107 (queue_entry
= TREE_VALUE (parser
->unparsed_functions_queues
));
15108 TREE_VALUE (parser
->unparsed_functions_queues
)
15109 = TREE_CHAIN (TREE_VALUE (parser
->unparsed_functions_queues
)))
15111 /* Figure out which function we need to process. */
15112 fn
= TREE_VALUE (queue_entry
);
15113 /* Parse the function. */
15114 cp_parser_late_parsing_for_member (parser
, fn
);
15118 /* Put back any saved access checks. */
15119 pop_deferring_access_checks ();
15121 /* Restore saved state. */
15122 parser
->in_function_body
= saved_in_function_body
;
15123 parser
->num_template_parameter_lists
15124 = saved_num_template_parameter_lists
;
15125 parser
->in_unbraced_linkage_specification_p
15126 = saved_in_unbraced_linkage_specification_p
;
15131 /* Parse a class-head.
15134 class-key identifier [opt] base-clause [opt]
15135 class-key nested-name-specifier identifier base-clause [opt]
15136 class-key nested-name-specifier [opt] template-id
15140 class-key attributes identifier [opt] base-clause [opt]
15141 class-key attributes nested-name-specifier identifier base-clause [opt]
15142 class-key attributes nested-name-specifier [opt] template-id
15145 Upon return BASES is initialized to the list of base classes (or
15146 NULL, if there are none) in the same form returned by
15147 cp_parser_base_clause.
15149 Returns the TYPE of the indicated class. Sets
15150 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
15151 involving a nested-name-specifier was used, and FALSE otherwise.
15153 Returns error_mark_node if this is not a class-head.
15155 Returns NULL_TREE if the class-head is syntactically valid, but
15156 semantically invalid in a way that means we should skip the entire
15157 body of the class. */
15160 cp_parser_class_head (cp_parser
* parser
,
15161 bool* nested_name_specifier_p
,
15162 tree
*attributes_p
,
15165 tree nested_name_specifier
;
15166 enum tag_types class_key
;
15167 tree id
= NULL_TREE
;
15168 tree type
= NULL_TREE
;
15170 bool template_id_p
= false;
15171 bool qualified_p
= false;
15172 bool invalid_nested_name_p
= false;
15173 bool invalid_explicit_specialization_p
= false;
15174 tree pushed_scope
= NULL_TREE
;
15175 unsigned num_templates
;
15176 cp_token
*type_start_token
= NULL
, *nested_name_specifier_token_start
= NULL
;
15177 /* Assume no nested-name-specifier will be present. */
15178 *nested_name_specifier_p
= false;
15179 /* Assume no template parameter lists will be used in defining the
15183 *bases
= NULL_TREE
;
15185 /* Look for the class-key. */
15186 class_key
= cp_parser_class_key (parser
);
15187 if (class_key
== none_type
)
15188 return error_mark_node
;
15190 /* Parse the attributes. */
15191 attributes
= cp_parser_attributes_opt (parser
);
15193 /* If the next token is `::', that is invalid -- but sometimes
15194 people do try to write:
15198 Handle this gracefully by accepting the extra qualifier, and then
15199 issuing an error about it later if this really is a
15200 class-head. If it turns out just to be an elaborated type
15201 specifier, remain silent. */
15202 if (cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false))
15203 qualified_p
= true;
15205 push_deferring_access_checks (dk_no_check
);
15207 /* Determine the name of the class. Begin by looking for an
15208 optional nested-name-specifier. */
15209 nested_name_specifier_token_start
= cp_lexer_peek_token (parser
->lexer
);
15210 nested_name_specifier
15211 = cp_parser_nested_name_specifier_opt (parser
,
15212 /*typename_keyword_p=*/false,
15213 /*check_dependency_p=*/false,
15215 /*is_declaration=*/false);
15216 /* If there was a nested-name-specifier, then there *must* be an
15218 if (nested_name_specifier
)
15220 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
15221 /* Although the grammar says `identifier', it really means
15222 `class-name' or `template-name'. You are only allowed to
15223 define a class that has already been declared with this
15226 The proposed resolution for Core Issue 180 says that wherever
15227 you see `class T::X' you should treat `X' as a type-name.
15229 It is OK to define an inaccessible class; for example:
15231 class A { class B; };
15234 We do not know if we will see a class-name, or a
15235 template-name. We look for a class-name first, in case the
15236 class-name is a template-id; if we looked for the
15237 template-name first we would stop after the template-name. */
15238 cp_parser_parse_tentatively (parser
);
15239 type
= cp_parser_class_name (parser
,
15240 /*typename_keyword_p=*/false,
15241 /*template_keyword_p=*/false,
15243 /*check_dependency_p=*/false,
15244 /*class_head_p=*/true,
15245 /*is_declaration=*/false);
15246 /* If that didn't work, ignore the nested-name-specifier. */
15247 if (!cp_parser_parse_definitely (parser
))
15249 invalid_nested_name_p
= true;
15250 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
15251 id
= cp_parser_identifier (parser
);
15252 if (id
== error_mark_node
)
15255 /* If we could not find a corresponding TYPE, treat this
15256 declaration like an unqualified declaration. */
15257 if (type
== error_mark_node
)
15258 nested_name_specifier
= NULL_TREE
;
15259 /* Otherwise, count the number of templates used in TYPE and its
15260 containing scopes. */
15265 for (scope
= TREE_TYPE (type
);
15266 scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
;
15267 scope
= (TYPE_P (scope
)
15268 ? TYPE_CONTEXT (scope
)
15269 : DECL_CONTEXT (scope
)))
15271 && CLASS_TYPE_P (scope
)
15272 && CLASSTYPE_TEMPLATE_INFO (scope
)
15273 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope
))
15274 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (scope
))
15278 /* Otherwise, the identifier is optional. */
15281 /* We don't know whether what comes next is a template-id,
15282 an identifier, or nothing at all. */
15283 cp_parser_parse_tentatively (parser
);
15284 /* Check for a template-id. */
15285 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
15286 id
= cp_parser_template_id (parser
,
15287 /*template_keyword_p=*/false,
15288 /*check_dependency_p=*/true,
15289 /*is_declaration=*/true);
15290 /* If that didn't work, it could still be an identifier. */
15291 if (!cp_parser_parse_definitely (parser
))
15293 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
15295 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
15296 id
= cp_parser_identifier (parser
);
15303 template_id_p
= true;
15308 pop_deferring_access_checks ();
15311 cp_parser_check_for_invalid_template_id (parser
, id
,
15312 type_start_token
->location
);
15314 /* If it's not a `:' or a `{' then we can't really be looking at a
15315 class-head, since a class-head only appears as part of a
15316 class-specifier. We have to detect this situation before calling
15317 xref_tag, since that has irreversible side-effects. */
15318 if (!cp_parser_next_token_starts_class_definition_p (parser
))
15320 cp_parser_error (parser
, "expected %<{%> or %<:%>");
15321 return error_mark_node
;
15324 /* At this point, we're going ahead with the class-specifier, even
15325 if some other problem occurs. */
15326 cp_parser_commit_to_tentative_parse (parser
);
15327 /* Issue the error about the overly-qualified name now. */
15330 cp_parser_error (parser
,
15331 "global qualification of class name is invalid");
15332 return error_mark_node
;
15334 else if (invalid_nested_name_p
)
15336 cp_parser_error (parser
,
15337 "qualified name does not name a class");
15338 return error_mark_node
;
15340 else if (nested_name_specifier
)
15344 /* Reject typedef-names in class heads. */
15345 if (!DECL_IMPLICIT_TYPEDEF_P (type
))
15347 error ("%Hinvalid class name in declaration of %qD",
15348 &type_start_token
->location
, type
);
15353 /* Figure out in what scope the declaration is being placed. */
15354 scope
= current_scope ();
15355 /* If that scope does not contain the scope in which the
15356 class was originally declared, the program is invalid. */
15357 if (scope
&& !is_ancestor (scope
, nested_name_specifier
))
15359 if (at_namespace_scope_p ())
15360 error ("%Hdeclaration of %qD in namespace %qD which does not "
15362 &type_start_token
->location
,
15363 type
, scope
, nested_name_specifier
);
15365 error ("%Hdeclaration of %qD in %qD which does not enclose %qD",
15366 &type_start_token
->location
,
15367 type
, scope
, nested_name_specifier
);
15373 A declarator-id shall not be qualified except for the
15374 definition of a ... nested class outside of its class
15375 ... [or] the definition or explicit instantiation of a
15376 class member of a namespace outside of its namespace. */
15377 if (scope
== nested_name_specifier
)
15379 permerror (input_location
, "%Hextra qualification not allowed",
15380 &nested_name_specifier_token_start
->location
);
15381 nested_name_specifier
= NULL_TREE
;
15385 /* An explicit-specialization must be preceded by "template <>". If
15386 it is not, try to recover gracefully. */
15387 if (at_namespace_scope_p ()
15388 && parser
->num_template_parameter_lists
== 0
15391 error ("%Han explicit specialization must be preceded by %<template <>%>",
15392 &type_start_token
->location
);
15393 invalid_explicit_specialization_p
= true;
15394 /* Take the same action that would have been taken by
15395 cp_parser_explicit_specialization. */
15396 ++parser
->num_template_parameter_lists
;
15397 begin_specialization ();
15399 /* There must be no "return" statements between this point and the
15400 end of this function; set "type "to the correct return value and
15401 use "goto done;" to return. */
15402 /* Make sure that the right number of template parameters were
15404 if (!cp_parser_check_template_parameters (parser
, num_templates
,
15405 type_start_token
->location
,
15406 /*declarator=*/NULL
))
15408 /* If something went wrong, there is no point in even trying to
15409 process the class-definition. */
15414 /* Look up the type. */
15417 if (TREE_CODE (id
) == TEMPLATE_ID_EXPR
15418 && (DECL_FUNCTION_TEMPLATE_P (TREE_OPERAND (id
, 0))
15419 || TREE_CODE (TREE_OPERAND (id
, 0)) == OVERLOAD
))
15421 error ("%Hfunction template %qD redeclared as a class template",
15422 &type_start_token
->location
, id
);
15423 type
= error_mark_node
;
15427 type
= TREE_TYPE (id
);
15428 type
= maybe_process_partial_specialization (type
);
15430 if (nested_name_specifier
)
15431 pushed_scope
= push_scope (nested_name_specifier
);
15433 else if (nested_name_specifier
)
15439 template <typename T> struct S { struct T };
15440 template <typename T> struct S<T>::T { };
15442 we will get a TYPENAME_TYPE when processing the definition of
15443 `S::T'. We need to resolve it to the actual type before we
15444 try to define it. */
15445 if (TREE_CODE (TREE_TYPE (type
)) == TYPENAME_TYPE
)
15447 class_type
= resolve_typename_type (TREE_TYPE (type
),
15448 /*only_current_p=*/false);
15449 if (TREE_CODE (class_type
) != TYPENAME_TYPE
)
15450 type
= TYPE_NAME (class_type
);
15453 cp_parser_error (parser
, "could not resolve typename type");
15454 type
= error_mark_node
;
15458 if (maybe_process_partial_specialization (TREE_TYPE (type
))
15459 == error_mark_node
)
15465 class_type
= current_class_type
;
15466 /* Enter the scope indicated by the nested-name-specifier. */
15467 pushed_scope
= push_scope (nested_name_specifier
);
15468 /* Get the canonical version of this type. */
15469 type
= TYPE_MAIN_DECL (TREE_TYPE (type
));
15470 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
15471 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (type
)))
15473 type
= push_template_decl (type
);
15474 if (type
== error_mark_node
)
15481 type
= TREE_TYPE (type
);
15482 *nested_name_specifier_p
= true;
15484 else /* The name is not a nested name. */
15486 /* If the class was unnamed, create a dummy name. */
15488 id
= make_anon_name ();
15489 type
= xref_tag (class_key
, id
, /*tag_scope=*/ts_current
,
15490 parser
->num_template_parameter_lists
);
15493 /* Indicate whether this class was declared as a `class' or as a
15495 if (TREE_CODE (type
) == RECORD_TYPE
)
15496 CLASSTYPE_DECLARED_CLASS (type
) = (class_key
== class_type
);
15497 cp_parser_check_class_key (class_key
, type
);
15499 /* If this type was already complete, and we see another definition,
15500 that's an error. */
15501 if (type
!= error_mark_node
&& COMPLETE_TYPE_P (type
))
15503 error ("%Hredefinition of %q#T",
15504 &type_start_token
->location
, type
);
15505 error ("%Hprevious definition of %q+#T",
15506 &type_start_token
->location
, type
);
15510 else if (type
== error_mark_node
)
15513 /* We will have entered the scope containing the class; the names of
15514 base classes should be looked up in that context. For example:
15516 struct A { struct B {}; struct C; };
15517 struct A::C : B {};
15521 /* Get the list of base-classes, if there is one. */
15522 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
15523 *bases
= cp_parser_base_clause (parser
);
15526 /* Leave the scope given by the nested-name-specifier. We will
15527 enter the class scope itself while processing the members. */
15529 pop_scope (pushed_scope
);
15531 if (invalid_explicit_specialization_p
)
15533 end_specialization ();
15534 --parser
->num_template_parameter_lists
;
15536 *attributes_p
= attributes
;
15540 /* Parse a class-key.
15547 Returns the kind of class-key specified, or none_type to indicate
15550 static enum tag_types
15551 cp_parser_class_key (cp_parser
* parser
)
15554 enum tag_types tag_type
;
15556 /* Look for the class-key. */
15557 token
= cp_parser_require (parser
, CPP_KEYWORD
, "class-key");
15561 /* Check to see if the TOKEN is a class-key. */
15562 tag_type
= cp_parser_token_is_class_key (token
);
15564 cp_parser_error (parser
, "expected class-key");
15568 /* Parse an (optional) member-specification.
15570 member-specification:
15571 member-declaration member-specification [opt]
15572 access-specifier : member-specification [opt] */
15575 cp_parser_member_specification_opt (cp_parser
* parser
)
15582 /* Peek at the next token. */
15583 token
= cp_lexer_peek_token (parser
->lexer
);
15584 /* If it's a `}', or EOF then we've seen all the members. */
15585 if (token
->type
== CPP_CLOSE_BRACE
15586 || token
->type
== CPP_EOF
15587 || token
->type
== CPP_PRAGMA_EOL
)
15590 /* See if this token is a keyword. */
15591 keyword
= token
->keyword
;
15595 case RID_PROTECTED
:
15597 /* Consume the access-specifier. */
15598 cp_lexer_consume_token (parser
->lexer
);
15599 /* Remember which access-specifier is active. */
15600 current_access_specifier
= token
->u
.value
;
15601 /* Look for the `:'. */
15602 cp_parser_require (parser
, CPP_COLON
, "%<:%>");
15606 /* Accept #pragmas at class scope. */
15607 if (token
->type
== CPP_PRAGMA
)
15609 cp_parser_pragma (parser
, pragma_external
);
15613 /* Otherwise, the next construction must be a
15614 member-declaration. */
15615 cp_parser_member_declaration (parser
);
15620 /* Parse a member-declaration.
15622 member-declaration:
15623 decl-specifier-seq [opt] member-declarator-list [opt] ;
15624 function-definition ; [opt]
15625 :: [opt] nested-name-specifier template [opt] unqualified-id ;
15627 template-declaration
15629 member-declarator-list:
15631 member-declarator-list , member-declarator
15634 declarator pure-specifier [opt]
15635 declarator constant-initializer [opt]
15636 identifier [opt] : constant-expression
15640 member-declaration:
15641 __extension__ member-declaration
15644 declarator attributes [opt] pure-specifier [opt]
15645 declarator attributes [opt] constant-initializer [opt]
15646 identifier [opt] attributes [opt] : constant-expression
15650 member-declaration:
15651 static_assert-declaration */
15654 cp_parser_member_declaration (cp_parser
* parser
)
15656 cp_decl_specifier_seq decl_specifiers
;
15657 tree prefix_attributes
;
15659 int declares_class_or_enum
;
15661 cp_token
*token
= NULL
;
15662 cp_token
*decl_spec_token_start
= NULL
;
15663 cp_token
*initializer_token_start
= NULL
;
15664 int saved_pedantic
;
15666 /* Check for the `__extension__' keyword. */
15667 if (cp_parser_extension_opt (parser
, &saved_pedantic
))
15670 cp_parser_member_declaration (parser
);
15671 /* Restore the old value of the PEDANTIC flag. */
15672 pedantic
= saved_pedantic
;
15677 /* Check for a template-declaration. */
15678 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
15680 /* An explicit specialization here is an error condition, and we
15681 expect the specialization handler to detect and report this. */
15682 if (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_LESS
15683 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_GREATER
)
15684 cp_parser_explicit_specialization (parser
);
15686 cp_parser_template_declaration (parser
, /*member_p=*/true);
15691 /* Check for a using-declaration. */
15692 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_USING
))
15694 /* Parse the using-declaration. */
15695 cp_parser_using_declaration (parser
,
15696 /*access_declaration_p=*/false);
15700 /* Check for @defs. */
15701 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AT_DEFS
))
15704 tree ivar_chains
= cp_parser_objc_defs_expression (parser
);
15705 ivar
= ivar_chains
;
15709 ivar
= TREE_CHAIN (member
);
15710 TREE_CHAIN (member
) = NULL_TREE
;
15711 finish_member_declaration (member
);
15716 /* If the next token is `static_assert' we have a static assertion. */
15717 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STATIC_ASSERT
))
15719 cp_parser_static_assert (parser
, /*member_p=*/true);
15723 if (cp_parser_using_declaration (parser
, /*access_declaration=*/true))
15726 /* Parse the decl-specifier-seq. */
15727 decl_spec_token_start
= cp_lexer_peek_token (parser
->lexer
);
15728 cp_parser_decl_specifier_seq (parser
,
15729 CP_PARSER_FLAGS_OPTIONAL
,
15731 &declares_class_or_enum
);
15732 prefix_attributes
= decl_specifiers
.attributes
;
15733 decl_specifiers
.attributes
= NULL_TREE
;
15734 /* Check for an invalid type-name. */
15735 if (!decl_specifiers
.type
15736 && cp_parser_parse_and_diagnose_invalid_type_name (parser
))
15738 /* If there is no declarator, then the decl-specifier-seq should
15740 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
15742 /* If there was no decl-specifier-seq, and the next token is a
15743 `;', then we have something like:
15749 Each member-declaration shall declare at least one member
15750 name of the class. */
15751 if (!decl_specifiers
.any_specifiers_p
)
15753 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
15754 if (!in_system_header_at (token
->location
))
15755 pedwarn (token
->location
, OPT_pedantic
, "extra %<;%>");
15761 /* See if this declaration is a friend. */
15762 friend_p
= cp_parser_friend_p (&decl_specifiers
);
15763 /* If there were decl-specifiers, check to see if there was
15764 a class-declaration. */
15765 type
= check_tag_decl (&decl_specifiers
);
15766 /* Nested classes have already been added to the class, but
15767 a `friend' needs to be explicitly registered. */
15770 /* If the `friend' keyword was present, the friend must
15771 be introduced with a class-key. */
15772 if (!declares_class_or_enum
)
15773 error ("%Ha class-key must be used when declaring a friend",
15774 &decl_spec_token_start
->location
);
15777 template <typename T> struct A {
15778 friend struct A<T>::B;
15781 A<T>::B will be represented by a TYPENAME_TYPE, and
15782 therefore not recognized by check_tag_decl. */
15784 && decl_specifiers
.type
15785 && TYPE_P (decl_specifiers
.type
))
15786 type
= decl_specifiers
.type
;
15787 if (!type
|| !TYPE_P (type
))
15788 error ("%Hfriend declaration does not name a class or "
15789 "function", &decl_spec_token_start
->location
);
15791 make_friend_class (current_class_type
, type
,
15792 /*complain=*/true);
15794 /* If there is no TYPE, an error message will already have
15796 else if (!type
|| type
== error_mark_node
)
15798 /* An anonymous aggregate has to be handled specially; such
15799 a declaration really declares a data member (with a
15800 particular type), as opposed to a nested class. */
15801 else if (ANON_AGGR_TYPE_P (type
))
15803 /* Remove constructors and such from TYPE, now that we
15804 know it is an anonymous aggregate. */
15805 fixup_anonymous_aggr (type
);
15806 /* And make the corresponding data member. */
15807 decl
= build_decl (FIELD_DECL
, NULL_TREE
, type
);
15808 /* Add it to the class. */
15809 finish_member_declaration (decl
);
15812 cp_parser_check_access_in_redeclaration
15814 decl_spec_token_start
->location
);
15819 /* See if these declarations will be friends. */
15820 friend_p
= cp_parser_friend_p (&decl_specifiers
);
15822 /* Keep going until we hit the `;' at the end of the
15824 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
15826 tree attributes
= NULL_TREE
;
15827 tree first_attribute
;
15829 /* Peek at the next token. */
15830 token
= cp_lexer_peek_token (parser
->lexer
);
15832 /* Check for a bitfield declaration. */
15833 if (token
->type
== CPP_COLON
15834 || (token
->type
== CPP_NAME
15835 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
15841 /* Get the name of the bitfield. Note that we cannot just
15842 check TOKEN here because it may have been invalidated by
15843 the call to cp_lexer_peek_nth_token above. */
15844 if (cp_lexer_peek_token (parser
->lexer
)->type
!= CPP_COLON
)
15845 identifier
= cp_parser_identifier (parser
);
15847 identifier
= NULL_TREE
;
15849 /* Consume the `:' token. */
15850 cp_lexer_consume_token (parser
->lexer
);
15851 /* Get the width of the bitfield. */
15853 = cp_parser_constant_expression (parser
,
15854 /*allow_non_constant=*/false,
15857 /* Look for attributes that apply to the bitfield. */
15858 attributes
= cp_parser_attributes_opt (parser
);
15859 /* Remember which attributes are prefix attributes and
15861 first_attribute
= attributes
;
15862 /* Combine the attributes. */
15863 attributes
= chainon (prefix_attributes
, attributes
);
15865 /* Create the bitfield declaration. */
15866 decl
= grokbitfield (identifier
15867 ? make_id_declarator (NULL_TREE
,
15877 cp_declarator
*declarator
;
15879 tree asm_specification
;
15880 int ctor_dtor_or_conv_p
;
15882 /* Parse the declarator. */
15884 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
15885 &ctor_dtor_or_conv_p
,
15886 /*parenthesized_p=*/NULL
,
15887 /*member_p=*/true);
15889 /* If something went wrong parsing the declarator, make sure
15890 that we at least consume some tokens. */
15891 if (declarator
== cp_error_declarator
)
15893 /* Skip to the end of the statement. */
15894 cp_parser_skip_to_end_of_statement (parser
);
15895 /* If the next token is not a semicolon, that is
15896 probably because we just skipped over the body of
15897 a function. So, we consume a semicolon if
15898 present, but do not issue an error message if it
15900 if (cp_lexer_next_token_is (parser
->lexer
,
15902 cp_lexer_consume_token (parser
->lexer
);
15906 if (declares_class_or_enum
& 2)
15907 cp_parser_check_for_definition_in_return_type
15908 (declarator
, decl_specifiers
.type
,
15909 decl_specifiers
.type_location
);
15911 /* Look for an asm-specification. */
15912 asm_specification
= cp_parser_asm_specification_opt (parser
);
15913 /* Look for attributes that apply to the declaration. */
15914 attributes
= cp_parser_attributes_opt (parser
);
15915 /* Remember which attributes are prefix attributes and
15917 first_attribute
= attributes
;
15918 /* Combine the attributes. */
15919 attributes
= chainon (prefix_attributes
, attributes
);
15921 /* If it's an `=', then we have a constant-initializer or a
15922 pure-specifier. It is not correct to parse the
15923 initializer before registering the member declaration
15924 since the member declaration should be in scope while
15925 its initializer is processed. However, the rest of the
15926 front end does not yet provide an interface that allows
15927 us to handle this correctly. */
15928 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
15932 A pure-specifier shall be used only in the declaration of
15933 a virtual function.
15935 A member-declarator can contain a constant-initializer
15936 only if it declares a static member of integral or
15939 Therefore, if the DECLARATOR is for a function, we look
15940 for a pure-specifier; otherwise, we look for a
15941 constant-initializer. When we call `grokfield', it will
15942 perform more stringent semantics checks. */
15943 initializer_token_start
= cp_lexer_peek_token (parser
->lexer
);
15944 if (function_declarator_p (declarator
))
15945 initializer
= cp_parser_pure_specifier (parser
);
15947 /* Parse the initializer. */
15948 initializer
= cp_parser_constant_initializer (parser
);
15950 /* Otherwise, there is no initializer. */
15952 initializer
= NULL_TREE
;
15954 /* See if we are probably looking at a function
15955 definition. We are certainly not looking at a
15956 member-declarator. Calling `grokfield' has
15957 side-effects, so we must not do it unless we are sure
15958 that we are looking at a member-declarator. */
15959 if (cp_parser_token_starts_function_definition_p
15960 (cp_lexer_peek_token (parser
->lexer
)))
15962 /* The grammar does not allow a pure-specifier to be
15963 used when a member function is defined. (It is
15964 possible that this fact is an oversight in the
15965 standard, since a pure function may be defined
15966 outside of the class-specifier. */
15968 error ("%Hpure-specifier on function-definition",
15969 &initializer_token_start
->location
);
15970 decl
= cp_parser_save_member_function_body (parser
,
15974 /* If the member was not a friend, declare it here. */
15976 finish_member_declaration (decl
);
15977 /* Peek at the next token. */
15978 token
= cp_lexer_peek_token (parser
->lexer
);
15979 /* If the next token is a semicolon, consume it. */
15980 if (token
->type
== CPP_SEMICOLON
)
15981 cp_lexer_consume_token (parser
->lexer
);
15985 if (declarator
->kind
== cdk_function
)
15986 declarator
->id_loc
= token
->location
;
15987 /* Create the declaration. */
15988 decl
= grokfield (declarator
, &decl_specifiers
,
15989 initializer
, /*init_const_expr_p=*/true,
15994 /* Reset PREFIX_ATTRIBUTES. */
15995 while (attributes
&& TREE_CHAIN (attributes
) != first_attribute
)
15996 attributes
= TREE_CHAIN (attributes
);
15998 TREE_CHAIN (attributes
) = NULL_TREE
;
16000 /* If there is any qualification still in effect, clear it
16001 now; we will be starting fresh with the next declarator. */
16002 parser
->scope
= NULL_TREE
;
16003 parser
->qualifying_scope
= NULL_TREE
;
16004 parser
->object_scope
= NULL_TREE
;
16005 /* If it's a `,', then there are more declarators. */
16006 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
16007 cp_lexer_consume_token (parser
->lexer
);
16008 /* If the next token isn't a `;', then we have a parse error. */
16009 else if (cp_lexer_next_token_is_not (parser
->lexer
,
16012 cp_parser_error (parser
, "expected %<;%>");
16013 /* Skip tokens until we find a `;'. */
16014 cp_parser_skip_to_end_of_statement (parser
);
16021 /* Add DECL to the list of members. */
16023 finish_member_declaration (decl
);
16025 if (TREE_CODE (decl
) == FUNCTION_DECL
)
16026 cp_parser_save_default_args (parser
, decl
);
16031 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
16034 /* Parse a pure-specifier.
16039 Returns INTEGER_ZERO_NODE if a pure specifier is found.
16040 Otherwise, ERROR_MARK_NODE is returned. */
16043 cp_parser_pure_specifier (cp_parser
* parser
)
16047 /* Look for the `=' token. */
16048 if (!cp_parser_require (parser
, CPP_EQ
, "%<=%>"))
16049 return error_mark_node
;
16050 /* Look for the `0' token. */
16051 token
= cp_lexer_peek_token (parser
->lexer
);
16053 if (token
->type
== CPP_EOF
16054 || token
->type
== CPP_PRAGMA_EOL
)
16055 return error_mark_node
;
16057 cp_lexer_consume_token (parser
->lexer
);
16059 /* Accept = default or = delete in c++0x mode. */
16060 if (token
->keyword
== RID_DEFAULT
16061 || token
->keyword
== RID_DELETE
)
16063 maybe_warn_cpp0x ("defaulted and deleted functions");
16064 return token
->u
.value
;
16067 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
16068 if (token
->type
!= CPP_NUMBER
|| !(token
->flags
& PURE_ZERO
))
16070 cp_parser_error (parser
,
16071 "invalid pure specifier (only %<= 0%> is allowed)");
16072 cp_parser_skip_to_end_of_statement (parser
);
16073 return error_mark_node
;
16075 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
16077 error ("%Htemplates may not be %<virtual%>", &token
->location
);
16078 return error_mark_node
;
16081 return integer_zero_node
;
16084 /* Parse a constant-initializer.
16086 constant-initializer:
16087 = constant-expression
16089 Returns a representation of the constant-expression. */
16092 cp_parser_constant_initializer (cp_parser
* parser
)
16094 /* Look for the `=' token. */
16095 if (!cp_parser_require (parser
, CPP_EQ
, "%<=%>"))
16096 return error_mark_node
;
16098 /* It is invalid to write:
16100 struct S { static const int i = { 7 }; };
16103 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
16105 cp_parser_error (parser
,
16106 "a brace-enclosed initializer is not allowed here");
16107 /* Consume the opening brace. */
16108 cp_lexer_consume_token (parser
->lexer
);
16109 /* Skip the initializer. */
16110 cp_parser_skip_to_closing_brace (parser
);
16111 /* Look for the trailing `}'. */
16112 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "%<}%>");
16114 return error_mark_node
;
16117 return cp_parser_constant_expression (parser
,
16118 /*allow_non_constant=*/false,
16122 /* Derived classes [gram.class.derived] */
16124 /* Parse a base-clause.
16127 : base-specifier-list
16129 base-specifier-list:
16130 base-specifier ... [opt]
16131 base-specifier-list , base-specifier ... [opt]
16133 Returns a TREE_LIST representing the base-classes, in the order in
16134 which they were declared. The representation of each node is as
16135 described by cp_parser_base_specifier.
16137 In the case that no bases are specified, this function will return
16138 NULL_TREE, not ERROR_MARK_NODE. */
16141 cp_parser_base_clause (cp_parser
* parser
)
16143 tree bases
= NULL_TREE
;
16145 /* Look for the `:' that begins the list. */
16146 cp_parser_require (parser
, CPP_COLON
, "%<:%>");
16148 /* Scan the base-specifier-list. */
16153 bool pack_expansion_p
= false;
16155 /* Look for the base-specifier. */
16156 base
= cp_parser_base_specifier (parser
);
16157 /* Look for the (optional) ellipsis. */
16158 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
16160 /* Consume the `...'. */
16161 cp_lexer_consume_token (parser
->lexer
);
16163 pack_expansion_p
= true;
16166 /* Add BASE to the front of the list. */
16167 if (base
!= error_mark_node
)
16169 if (pack_expansion_p
)
16170 /* Make this a pack expansion type. */
16171 TREE_VALUE (base
) = make_pack_expansion (TREE_VALUE (base
));
16174 if (!check_for_bare_parameter_packs (TREE_VALUE (base
)))
16176 TREE_CHAIN (base
) = bases
;
16180 /* Peek at the next token. */
16181 token
= cp_lexer_peek_token (parser
->lexer
);
16182 /* If it's not a comma, then the list is complete. */
16183 if (token
->type
!= CPP_COMMA
)
16185 /* Consume the `,'. */
16186 cp_lexer_consume_token (parser
->lexer
);
16189 /* PARSER->SCOPE may still be non-NULL at this point, if the last
16190 base class had a qualified name. However, the next name that
16191 appears is certainly not qualified. */
16192 parser
->scope
= NULL_TREE
;
16193 parser
->qualifying_scope
= NULL_TREE
;
16194 parser
->object_scope
= NULL_TREE
;
16196 return nreverse (bases
);
16199 /* Parse a base-specifier.
16202 :: [opt] nested-name-specifier [opt] class-name
16203 virtual access-specifier [opt] :: [opt] nested-name-specifier
16205 access-specifier virtual [opt] :: [opt] nested-name-specifier
16208 Returns a TREE_LIST. The TREE_PURPOSE will be one of
16209 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
16210 indicate the specifiers provided. The TREE_VALUE will be a TYPE
16211 (or the ERROR_MARK_NODE) indicating the type that was specified. */
16214 cp_parser_base_specifier (cp_parser
* parser
)
16218 bool virtual_p
= false;
16219 bool duplicate_virtual_error_issued_p
= false;
16220 bool duplicate_access_error_issued_p
= false;
16221 bool class_scope_p
, template_p
;
16222 tree access
= access_default_node
;
16225 /* Process the optional `virtual' and `access-specifier'. */
16228 /* Peek at the next token. */
16229 token
= cp_lexer_peek_token (parser
->lexer
);
16230 /* Process `virtual'. */
16231 switch (token
->keyword
)
16234 /* If `virtual' appears more than once, issue an error. */
16235 if (virtual_p
&& !duplicate_virtual_error_issued_p
)
16237 cp_parser_error (parser
,
16238 "%<virtual%> specified more than once in base-specified");
16239 duplicate_virtual_error_issued_p
= true;
16244 /* Consume the `virtual' token. */
16245 cp_lexer_consume_token (parser
->lexer
);
16250 case RID_PROTECTED
:
16252 /* If more than one access specifier appears, issue an
16254 if (access
!= access_default_node
16255 && !duplicate_access_error_issued_p
)
16257 cp_parser_error (parser
,
16258 "more than one access specifier in base-specified");
16259 duplicate_access_error_issued_p
= true;
16262 access
= ridpointers
[(int) token
->keyword
];
16264 /* Consume the access-specifier. */
16265 cp_lexer_consume_token (parser
->lexer
);
16274 /* It is not uncommon to see programs mechanically, erroneously, use
16275 the 'typename' keyword to denote (dependent) qualified types
16276 as base classes. */
16277 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TYPENAME
))
16279 token
= cp_lexer_peek_token (parser
->lexer
);
16280 if (!processing_template_decl
)
16281 error ("%Hkeyword %<typename%> not allowed outside of templates",
16284 error ("%Hkeyword %<typename%> not allowed in this context "
16285 "(the base class is implicitly a type)",
16287 cp_lexer_consume_token (parser
->lexer
);
16290 /* Look for the optional `::' operator. */
16291 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false);
16292 /* Look for the nested-name-specifier. The simplest way to
16297 The keyword `typename' is not permitted in a base-specifier or
16298 mem-initializer; in these contexts a qualified name that
16299 depends on a template-parameter is implicitly assumed to be a
16302 is to pretend that we have seen the `typename' keyword at this
16304 cp_parser_nested_name_specifier_opt (parser
,
16305 /*typename_keyword_p=*/true,
16306 /*check_dependency_p=*/true,
16308 /*is_declaration=*/true);
16309 /* If the base class is given by a qualified name, assume that names
16310 we see are type names or templates, as appropriate. */
16311 class_scope_p
= (parser
->scope
&& TYPE_P (parser
->scope
));
16312 template_p
= class_scope_p
&& cp_parser_optional_template_keyword (parser
);
16314 /* Finally, look for the class-name. */
16315 type
= cp_parser_class_name (parser
,
16319 /*check_dependency_p=*/true,
16320 /*class_head_p=*/false,
16321 /*is_declaration=*/true);
16323 if (type
== error_mark_node
)
16324 return error_mark_node
;
16326 return finish_base_specifier (TREE_TYPE (type
), access
, virtual_p
);
16329 /* Exception handling [gram.exception] */
16331 /* Parse an (optional) exception-specification.
16333 exception-specification:
16334 throw ( type-id-list [opt] )
16336 Returns a TREE_LIST representing the exception-specification. The
16337 TREE_VALUE of each node is a type. */
16340 cp_parser_exception_specification_opt (cp_parser
* parser
)
16345 /* Peek at the next token. */
16346 token
= cp_lexer_peek_token (parser
->lexer
);
16347 /* If it's not `throw', then there's no exception-specification. */
16348 if (!cp_parser_is_keyword (token
, RID_THROW
))
16351 /* Consume the `throw'. */
16352 cp_lexer_consume_token (parser
->lexer
);
16354 /* Look for the `('. */
16355 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
16357 /* Peek at the next token. */
16358 token
= cp_lexer_peek_token (parser
->lexer
);
16359 /* If it's not a `)', then there is a type-id-list. */
16360 if (token
->type
!= CPP_CLOSE_PAREN
)
16362 const char *saved_message
;
16364 /* Types may not be defined in an exception-specification. */
16365 saved_message
= parser
->type_definition_forbidden_message
;
16366 parser
->type_definition_forbidden_message
16367 = "types may not be defined in an exception-specification";
16368 /* Parse the type-id-list. */
16369 type_id_list
= cp_parser_type_id_list (parser
);
16370 /* Restore the saved message. */
16371 parser
->type_definition_forbidden_message
= saved_message
;
16374 type_id_list
= empty_except_spec
;
16376 /* Look for the `)'. */
16377 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
16379 return type_id_list
;
16382 /* Parse an (optional) type-id-list.
16386 type-id-list , type-id ... [opt]
16388 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
16389 in the order that the types were presented. */
16392 cp_parser_type_id_list (cp_parser
* parser
)
16394 tree types
= NULL_TREE
;
16401 /* Get the next type-id. */
16402 type
= cp_parser_type_id (parser
);
16403 /* Parse the optional ellipsis. */
16404 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
16406 /* Consume the `...'. */
16407 cp_lexer_consume_token (parser
->lexer
);
16409 /* Turn the type into a pack expansion expression. */
16410 type
= make_pack_expansion (type
);
16412 /* Add it to the list. */
16413 types
= add_exception_specifier (types
, type
, /*complain=*/1);
16414 /* Peek at the next token. */
16415 token
= cp_lexer_peek_token (parser
->lexer
);
16416 /* If it is not a `,', we are done. */
16417 if (token
->type
!= CPP_COMMA
)
16419 /* Consume the `,'. */
16420 cp_lexer_consume_token (parser
->lexer
);
16423 return nreverse (types
);
16426 /* Parse a try-block.
16429 try compound-statement handler-seq */
16432 cp_parser_try_block (cp_parser
* parser
)
16436 cp_parser_require_keyword (parser
, RID_TRY
, "%<try%>");
16437 try_block
= begin_try_block ();
16438 cp_parser_compound_statement (parser
, NULL
, true);
16439 finish_try_block (try_block
);
16440 cp_parser_handler_seq (parser
);
16441 finish_handler_sequence (try_block
);
16446 /* Parse a function-try-block.
16448 function-try-block:
16449 try ctor-initializer [opt] function-body handler-seq */
16452 cp_parser_function_try_block (cp_parser
* parser
)
16454 tree compound_stmt
;
16456 bool ctor_initializer_p
;
16458 /* Look for the `try' keyword. */
16459 if (!cp_parser_require_keyword (parser
, RID_TRY
, "%<try%>"))
16461 /* Let the rest of the front end know where we are. */
16462 try_block
= begin_function_try_block (&compound_stmt
);
16463 /* Parse the function-body. */
16465 = cp_parser_ctor_initializer_opt_and_function_body (parser
);
16466 /* We're done with the `try' part. */
16467 finish_function_try_block (try_block
);
16468 /* Parse the handlers. */
16469 cp_parser_handler_seq (parser
);
16470 /* We're done with the handlers. */
16471 finish_function_handler_sequence (try_block
, compound_stmt
);
16473 return ctor_initializer_p
;
16476 /* Parse a handler-seq.
16479 handler handler-seq [opt] */
16482 cp_parser_handler_seq (cp_parser
* parser
)
16488 /* Parse the handler. */
16489 cp_parser_handler (parser
);
16490 /* Peek at the next token. */
16491 token
= cp_lexer_peek_token (parser
->lexer
);
16492 /* If it's not `catch' then there are no more handlers. */
16493 if (!cp_parser_is_keyword (token
, RID_CATCH
))
16498 /* Parse a handler.
16501 catch ( exception-declaration ) compound-statement */
16504 cp_parser_handler (cp_parser
* parser
)
16509 cp_parser_require_keyword (parser
, RID_CATCH
, "%<catch%>");
16510 handler
= begin_handler ();
16511 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
16512 declaration
= cp_parser_exception_declaration (parser
);
16513 finish_handler_parms (declaration
, handler
);
16514 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
16515 cp_parser_compound_statement (parser
, NULL
, false);
16516 finish_handler (handler
);
16519 /* Parse an exception-declaration.
16521 exception-declaration:
16522 type-specifier-seq declarator
16523 type-specifier-seq abstract-declarator
16527 Returns a VAR_DECL for the declaration, or NULL_TREE if the
16528 ellipsis variant is used. */
16531 cp_parser_exception_declaration (cp_parser
* parser
)
16533 cp_decl_specifier_seq type_specifiers
;
16534 cp_declarator
*declarator
;
16535 const char *saved_message
;
16537 /* If it's an ellipsis, it's easy to handle. */
16538 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
16540 /* Consume the `...' token. */
16541 cp_lexer_consume_token (parser
->lexer
);
16545 /* Types may not be defined in exception-declarations. */
16546 saved_message
= parser
->type_definition_forbidden_message
;
16547 parser
->type_definition_forbidden_message
16548 = "types may not be defined in exception-declarations";
16550 /* Parse the type-specifier-seq. */
16551 cp_parser_type_specifier_seq (parser
, /*is_condition=*/false,
16553 /* If it's a `)', then there is no declarator. */
16554 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
16557 declarator
= cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_EITHER
,
16558 /*ctor_dtor_or_conv_p=*/NULL
,
16559 /*parenthesized_p=*/NULL
,
16560 /*member_p=*/false);
16562 /* Restore the saved message. */
16563 parser
->type_definition_forbidden_message
= saved_message
;
16565 if (!type_specifiers
.any_specifiers_p
)
16566 return error_mark_node
;
16568 return grokdeclarator (declarator
, &type_specifiers
, CATCHPARM
, 1, NULL
);
16571 /* Parse a throw-expression.
16574 throw assignment-expression [opt]
16576 Returns a THROW_EXPR representing the throw-expression. */
16579 cp_parser_throw_expression (cp_parser
* parser
)
16584 cp_parser_require_keyword (parser
, RID_THROW
, "%<throw%>");
16585 token
= cp_lexer_peek_token (parser
->lexer
);
16586 /* Figure out whether or not there is an assignment-expression
16587 following the "throw" keyword. */
16588 if (token
->type
== CPP_COMMA
16589 || token
->type
== CPP_SEMICOLON
16590 || token
->type
== CPP_CLOSE_PAREN
16591 || token
->type
== CPP_CLOSE_SQUARE
16592 || token
->type
== CPP_CLOSE_BRACE
16593 || token
->type
== CPP_COLON
)
16594 expression
= NULL_TREE
;
16596 expression
= cp_parser_assignment_expression (parser
,
16597 /*cast_p=*/false, NULL
);
16599 return build_throw (expression
);
16602 /* GNU Extensions */
16604 /* Parse an (optional) asm-specification.
16607 asm ( string-literal )
16609 If the asm-specification is present, returns a STRING_CST
16610 corresponding to the string-literal. Otherwise, returns
16614 cp_parser_asm_specification_opt (cp_parser
* parser
)
16617 tree asm_specification
;
16619 /* Peek at the next token. */
16620 token
= cp_lexer_peek_token (parser
->lexer
);
16621 /* If the next token isn't the `asm' keyword, then there's no
16622 asm-specification. */
16623 if (!cp_parser_is_keyword (token
, RID_ASM
))
16626 /* Consume the `asm' token. */
16627 cp_lexer_consume_token (parser
->lexer
);
16628 /* Look for the `('. */
16629 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
16631 /* Look for the string-literal. */
16632 asm_specification
= cp_parser_string_literal (parser
, false, false);
16634 /* Look for the `)'. */
16635 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
16637 return asm_specification
;
16640 /* Parse an asm-operand-list.
16644 asm-operand-list , asm-operand
16647 string-literal ( expression )
16648 [ string-literal ] string-literal ( expression )
16650 Returns a TREE_LIST representing the operands. The TREE_VALUE of
16651 each node is the expression. The TREE_PURPOSE is itself a
16652 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
16653 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
16654 is a STRING_CST for the string literal before the parenthesis. Returns
16655 ERROR_MARK_NODE if any of the operands are invalid. */
16658 cp_parser_asm_operand_list (cp_parser
* parser
)
16660 tree asm_operands
= NULL_TREE
;
16661 bool invalid_operands
= false;
16665 tree string_literal
;
16669 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
16671 /* Consume the `[' token. */
16672 cp_lexer_consume_token (parser
->lexer
);
16673 /* Read the operand name. */
16674 name
= cp_parser_identifier (parser
);
16675 if (name
!= error_mark_node
)
16676 name
= build_string (IDENTIFIER_LENGTH (name
),
16677 IDENTIFIER_POINTER (name
));
16678 /* Look for the closing `]'. */
16679 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, "%<]%>");
16683 /* Look for the string-literal. */
16684 string_literal
= cp_parser_string_literal (parser
, false, false);
16686 /* Look for the `('. */
16687 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
16688 /* Parse the expression. */
16689 expression
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
16690 /* Look for the `)'. */
16691 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
16693 if (name
== error_mark_node
16694 || string_literal
== error_mark_node
16695 || expression
== error_mark_node
)
16696 invalid_operands
= true;
16698 /* Add this operand to the list. */
16699 asm_operands
= tree_cons (build_tree_list (name
, string_literal
),
16702 /* If the next token is not a `,', there are no more
16704 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
16706 /* Consume the `,'. */
16707 cp_lexer_consume_token (parser
->lexer
);
16710 return invalid_operands
? error_mark_node
: nreverse (asm_operands
);
16713 /* Parse an asm-clobber-list.
16717 asm-clobber-list , string-literal
16719 Returns a TREE_LIST, indicating the clobbers in the order that they
16720 appeared. The TREE_VALUE of each node is a STRING_CST. */
16723 cp_parser_asm_clobber_list (cp_parser
* parser
)
16725 tree clobbers
= NULL_TREE
;
16729 tree string_literal
;
16731 /* Look for the string literal. */
16732 string_literal
= cp_parser_string_literal (parser
, false, false);
16733 /* Add it to the list. */
16734 clobbers
= tree_cons (NULL_TREE
, string_literal
, clobbers
);
16735 /* If the next token is not a `,', then the list is
16737 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
16739 /* Consume the `,' token. */
16740 cp_lexer_consume_token (parser
->lexer
);
16746 /* Parse an (optional) series of attributes.
16749 attributes attribute
16752 __attribute__ (( attribute-list [opt] ))
16754 The return value is as for cp_parser_attribute_list. */
16757 cp_parser_attributes_opt (cp_parser
* parser
)
16759 tree attributes
= NULL_TREE
;
16764 tree attribute_list
;
16766 /* Peek at the next token. */
16767 token
= cp_lexer_peek_token (parser
->lexer
);
16768 /* If it's not `__attribute__', then we're done. */
16769 if (token
->keyword
!= RID_ATTRIBUTE
)
16772 /* Consume the `__attribute__' keyword. */
16773 cp_lexer_consume_token (parser
->lexer
);
16774 /* Look for the two `(' tokens. */
16775 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
16776 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
16778 /* Peek at the next token. */
16779 token
= cp_lexer_peek_token (parser
->lexer
);
16780 if (token
->type
!= CPP_CLOSE_PAREN
)
16781 /* Parse the attribute-list. */
16782 attribute_list
= cp_parser_attribute_list (parser
);
16784 /* If the next token is a `)', then there is no attribute
16786 attribute_list
= NULL
;
16788 /* Look for the two `)' tokens. */
16789 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
16790 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
16792 /* Add these new attributes to the list. */
16793 attributes
= chainon (attributes
, attribute_list
);
16799 /* Parse an attribute-list.
16803 attribute-list , attribute
16807 identifier ( identifier )
16808 identifier ( identifier , expression-list )
16809 identifier ( expression-list )
16811 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
16812 to an attribute. The TREE_PURPOSE of each node is the identifier
16813 indicating which attribute is in use. The TREE_VALUE represents
16814 the arguments, if any. */
16817 cp_parser_attribute_list (cp_parser
* parser
)
16819 tree attribute_list
= NULL_TREE
;
16820 bool save_translate_strings_p
= parser
->translate_strings_p
;
16822 parser
->translate_strings_p
= false;
16829 /* Look for the identifier. We also allow keywords here; for
16830 example `__attribute__ ((const))' is legal. */
16831 token
= cp_lexer_peek_token (parser
->lexer
);
16832 if (token
->type
== CPP_NAME
16833 || token
->type
== CPP_KEYWORD
)
16835 tree arguments
= NULL_TREE
;
16837 /* Consume the token. */
16838 token
= cp_lexer_consume_token (parser
->lexer
);
16840 /* Save away the identifier that indicates which attribute
16842 identifier
= token
->u
.value
;
16843 attribute
= build_tree_list (identifier
, NULL_TREE
);
16845 /* Peek at the next token. */
16846 token
= cp_lexer_peek_token (parser
->lexer
);
16847 /* If it's an `(', then parse the attribute arguments. */
16848 if (token
->type
== CPP_OPEN_PAREN
)
16850 arguments
= cp_parser_parenthesized_expression_list
16851 (parser
, true, /*cast_p=*/false,
16852 /*allow_expansion_p=*/false,
16853 /*non_constant_p=*/NULL
);
16854 /* Save the arguments away. */
16855 TREE_VALUE (attribute
) = arguments
;
16858 if (arguments
!= error_mark_node
)
16860 /* Add this attribute to the list. */
16861 TREE_CHAIN (attribute
) = attribute_list
;
16862 attribute_list
= attribute
;
16865 token
= cp_lexer_peek_token (parser
->lexer
);
16867 /* Now, look for more attributes. If the next token isn't a
16868 `,', we're done. */
16869 if (token
->type
!= CPP_COMMA
)
16872 /* Consume the comma and keep going. */
16873 cp_lexer_consume_token (parser
->lexer
);
16875 parser
->translate_strings_p
= save_translate_strings_p
;
16877 /* We built up the list in reverse order. */
16878 return nreverse (attribute_list
);
16881 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
16882 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
16883 current value of the PEDANTIC flag, regardless of whether or not
16884 the `__extension__' keyword is present. The caller is responsible
16885 for restoring the value of the PEDANTIC flag. */
16888 cp_parser_extension_opt (cp_parser
* parser
, int* saved_pedantic
)
16890 /* Save the old value of the PEDANTIC flag. */
16891 *saved_pedantic
= pedantic
;
16893 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_EXTENSION
))
16895 /* Consume the `__extension__' token. */
16896 cp_lexer_consume_token (parser
->lexer
);
16897 /* We're not being pedantic while the `__extension__' keyword is
16907 /* Parse a label declaration.
16910 __label__ label-declarator-seq ;
16912 label-declarator-seq:
16913 identifier , label-declarator-seq
16917 cp_parser_label_declaration (cp_parser
* parser
)
16919 /* Look for the `__label__' keyword. */
16920 cp_parser_require_keyword (parser
, RID_LABEL
, "%<__label__%>");
16926 /* Look for an identifier. */
16927 identifier
= cp_parser_identifier (parser
);
16928 /* If we failed, stop. */
16929 if (identifier
== error_mark_node
)
16931 /* Declare it as a label. */
16932 finish_label_decl (identifier
);
16933 /* If the next token is a `;', stop. */
16934 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
16936 /* Look for the `,' separating the label declarations. */
16937 cp_parser_require (parser
, CPP_COMMA
, "%<,%>");
16940 /* Look for the final `;'. */
16941 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
16944 /* Support Functions */
16946 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
16947 NAME should have one of the representations used for an
16948 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
16949 is returned. If PARSER->SCOPE is a dependent type, then a
16950 SCOPE_REF is returned.
16952 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
16953 returned; the name was already resolved when the TEMPLATE_ID_EXPR
16954 was formed. Abstractly, such entities should not be passed to this
16955 function, because they do not need to be looked up, but it is
16956 simpler to check for this special case here, rather than at the
16959 In cases not explicitly covered above, this function returns a
16960 DECL, OVERLOAD, or baselink representing the result of the lookup.
16961 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
16964 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
16965 (e.g., "struct") that was used. In that case bindings that do not
16966 refer to types are ignored.
16968 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
16971 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
16974 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
16977 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
16978 TREE_LIST of candidates if name-lookup results in an ambiguity, and
16979 NULL_TREE otherwise. */
16982 cp_parser_lookup_name (cp_parser
*parser
, tree name
,
16983 enum tag_types tag_type
,
16986 bool check_dependency
,
16987 tree
*ambiguous_decls
,
16988 location_t name_location
)
16992 tree object_type
= parser
->context
->object_type
;
16994 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
16995 flags
|= LOOKUP_COMPLAIN
;
16997 /* Assume that the lookup will be unambiguous. */
16998 if (ambiguous_decls
)
16999 *ambiguous_decls
= NULL_TREE
;
17001 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
17002 no longer valid. Note that if we are parsing tentatively, and
17003 the parse fails, OBJECT_TYPE will be automatically restored. */
17004 parser
->context
->object_type
= NULL_TREE
;
17006 if (name
== error_mark_node
)
17007 return error_mark_node
;
17009 /* A template-id has already been resolved; there is no lookup to
17011 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
17013 if (BASELINK_P (name
))
17015 gcc_assert (TREE_CODE (BASELINK_FUNCTIONS (name
))
17016 == TEMPLATE_ID_EXPR
);
17020 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
17021 it should already have been checked to make sure that the name
17022 used matches the type being destroyed. */
17023 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
17027 /* Figure out to which type this destructor applies. */
17029 type
= parser
->scope
;
17030 else if (object_type
)
17031 type
= object_type
;
17033 type
= current_class_type
;
17034 /* If that's not a class type, there is no destructor. */
17035 if (!type
|| !CLASS_TYPE_P (type
))
17036 return error_mark_node
;
17037 if (CLASSTYPE_LAZY_DESTRUCTOR (type
))
17038 lazily_declare_fn (sfk_destructor
, type
);
17039 if (!CLASSTYPE_DESTRUCTORS (type
))
17040 return error_mark_node
;
17041 /* If it was a class type, return the destructor. */
17042 return CLASSTYPE_DESTRUCTORS (type
);
17045 /* By this point, the NAME should be an ordinary identifier. If
17046 the id-expression was a qualified name, the qualifying scope is
17047 stored in PARSER->SCOPE at this point. */
17048 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
);
17050 /* Perform the lookup. */
17055 if (parser
->scope
== error_mark_node
)
17056 return error_mark_node
;
17058 /* If the SCOPE is dependent, the lookup must be deferred until
17059 the template is instantiated -- unless we are explicitly
17060 looking up names in uninstantiated templates. Even then, we
17061 cannot look up the name if the scope is not a class type; it
17062 might, for example, be a template type parameter. */
17063 dependent_p
= (TYPE_P (parser
->scope
)
17064 && dependent_scope_p (parser
->scope
));
17065 if ((check_dependency
|| !CLASS_TYPE_P (parser
->scope
))
17067 /* Defer lookup. */
17068 decl
= error_mark_node
;
17071 tree pushed_scope
= NULL_TREE
;
17073 /* If PARSER->SCOPE is a dependent type, then it must be a
17074 class type, and we must not be checking dependencies;
17075 otherwise, we would have processed this lookup above. So
17076 that PARSER->SCOPE is not considered a dependent base by
17077 lookup_member, we must enter the scope here. */
17079 pushed_scope
= push_scope (parser
->scope
);
17080 /* If the PARSER->SCOPE is a template specialization, it
17081 may be instantiated during name lookup. In that case,
17082 errors may be issued. Even if we rollback the current
17083 tentative parse, those errors are valid. */
17084 decl
= lookup_qualified_name (parser
->scope
, name
,
17085 tag_type
!= none_type
,
17086 /*complain=*/true);
17088 /* If we have a single function from a using decl, pull it out. */
17089 if (TREE_CODE (decl
) == OVERLOAD
17090 && !really_overloaded_fn (decl
))
17091 decl
= OVL_FUNCTION (decl
);
17094 pop_scope (pushed_scope
);
17097 /* If the scope is a dependent type and either we deferred lookup or
17098 we did lookup but didn't find the name, rememeber the name. */
17099 if (decl
== error_mark_node
&& TYPE_P (parser
->scope
)
17100 && dependent_type_p (parser
->scope
))
17106 /* The resolution to Core Issue 180 says that `struct
17107 A::B' should be considered a type-name, even if `A'
17109 type
= make_typename_type (parser
->scope
, name
, tag_type
,
17110 /*complain=*/tf_error
);
17111 decl
= TYPE_NAME (type
);
17113 else if (is_template
17114 && (cp_parser_next_token_ends_template_argument_p (parser
)
17115 || cp_lexer_next_token_is (parser
->lexer
,
17117 decl
= make_unbound_class_template (parser
->scope
,
17119 /*complain=*/tf_error
);
17121 decl
= build_qualified_name (/*type=*/NULL_TREE
,
17122 parser
->scope
, name
,
17125 parser
->qualifying_scope
= parser
->scope
;
17126 parser
->object_scope
= NULL_TREE
;
17128 else if (object_type
)
17130 tree object_decl
= NULL_TREE
;
17131 /* Look up the name in the scope of the OBJECT_TYPE, unless the
17132 OBJECT_TYPE is not a class. */
17133 if (CLASS_TYPE_P (object_type
))
17134 /* If the OBJECT_TYPE is a template specialization, it may
17135 be instantiated during name lookup. In that case, errors
17136 may be issued. Even if we rollback the current tentative
17137 parse, those errors are valid. */
17138 object_decl
= lookup_member (object_type
,
17141 tag_type
!= none_type
);
17142 /* Look it up in the enclosing context, too. */
17143 decl
= lookup_name_real (name
, tag_type
!= none_type
,
17145 /*block_p=*/true, is_namespace
, flags
);
17146 parser
->object_scope
= object_type
;
17147 parser
->qualifying_scope
= NULL_TREE
;
17149 decl
= object_decl
;
17153 decl
= lookup_name_real (name
, tag_type
!= none_type
,
17155 /*block_p=*/true, is_namespace
, flags
);
17156 parser
->qualifying_scope
= NULL_TREE
;
17157 parser
->object_scope
= NULL_TREE
;
17160 /* If the lookup failed, let our caller know. */
17161 if (!decl
|| decl
== error_mark_node
)
17162 return error_mark_node
;
17164 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
17165 if (TREE_CODE (decl
) == TREE_LIST
)
17167 if (ambiguous_decls
)
17168 *ambiguous_decls
= decl
;
17169 /* The error message we have to print is too complicated for
17170 cp_parser_error, so we incorporate its actions directly. */
17171 if (!cp_parser_simulate_error (parser
))
17173 error ("%Hreference to %qD is ambiguous",
17174 &name_location
, name
);
17175 print_candidates (decl
);
17177 return error_mark_node
;
17180 gcc_assert (DECL_P (decl
)
17181 || TREE_CODE (decl
) == OVERLOAD
17182 || TREE_CODE (decl
) == SCOPE_REF
17183 || TREE_CODE (decl
) == UNBOUND_CLASS_TEMPLATE
17184 || BASELINK_P (decl
));
17186 /* If we have resolved the name of a member declaration, check to
17187 see if the declaration is accessible. When the name resolves to
17188 set of overloaded functions, accessibility is checked when
17189 overload resolution is done.
17191 During an explicit instantiation, access is not checked at all,
17192 as per [temp.explicit]. */
17194 check_accessibility_of_qualified_id (decl
, object_type
, parser
->scope
);
17199 /* Like cp_parser_lookup_name, but for use in the typical case where
17200 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
17201 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
17204 cp_parser_lookup_name_simple (cp_parser
* parser
, tree name
, location_t location
)
17206 return cp_parser_lookup_name (parser
, name
,
17208 /*is_template=*/false,
17209 /*is_namespace=*/false,
17210 /*check_dependency=*/true,
17211 /*ambiguous_decls=*/NULL
,
17215 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
17216 the current context, return the TYPE_DECL. If TAG_NAME_P is
17217 true, the DECL indicates the class being defined in a class-head,
17218 or declared in an elaborated-type-specifier.
17220 Otherwise, return DECL. */
17223 cp_parser_maybe_treat_template_as_class (tree decl
, bool tag_name_p
)
17225 /* If the TEMPLATE_DECL is being declared as part of a class-head,
17226 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
17229 template <typename T> struct B;
17232 template <typename T> struct A::B {};
17234 Similarly, in an elaborated-type-specifier:
17236 namespace N { struct X{}; }
17239 template <typename T> friend struct N::X;
17242 However, if the DECL refers to a class type, and we are in
17243 the scope of the class, then the name lookup automatically
17244 finds the TYPE_DECL created by build_self_reference rather
17245 than a TEMPLATE_DECL. For example, in:
17247 template <class T> struct S {
17251 there is no need to handle such case. */
17253 if (DECL_CLASS_TEMPLATE_P (decl
) && tag_name_p
)
17254 return DECL_TEMPLATE_RESULT (decl
);
17259 /* If too many, or too few, template-parameter lists apply to the
17260 declarator, issue an error message. Returns TRUE if all went well,
17261 and FALSE otherwise. */
17264 cp_parser_check_declarator_template_parameters (cp_parser
* parser
,
17265 cp_declarator
*declarator
,
17266 location_t declarator_location
)
17268 unsigned num_templates
;
17270 /* We haven't seen any classes that involve template parameters yet. */
17273 switch (declarator
->kind
)
17276 if (declarator
->u
.id
.qualifying_scope
)
17281 scope
= declarator
->u
.id
.qualifying_scope
;
17282 member
= declarator
->u
.id
.unqualified_name
;
17284 while (scope
&& CLASS_TYPE_P (scope
))
17286 /* You're supposed to have one `template <...>'
17287 for every template class, but you don't need one
17288 for a full specialization. For example:
17290 template <class T> struct S{};
17291 template <> struct S<int> { void f(); };
17292 void S<int>::f () {}
17294 is correct; there shouldn't be a `template <>' for
17295 the definition of `S<int>::f'. */
17296 if (!CLASSTYPE_TEMPLATE_INFO (scope
))
17297 /* If SCOPE does not have template information of any
17298 kind, then it is not a template, nor is it nested
17299 within a template. */
17301 if (explicit_class_specialization_p (scope
))
17303 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope
)))
17306 scope
= TYPE_CONTEXT (scope
);
17309 else if (TREE_CODE (declarator
->u
.id
.unqualified_name
)
17310 == TEMPLATE_ID_EXPR
)
17311 /* If the DECLARATOR has the form `X<y>' then it uses one
17312 additional level of template parameters. */
17315 return cp_parser_check_template_parameters
17316 (parser
, num_templates
, declarator_location
, declarator
);
17322 case cdk_reference
:
17324 return (cp_parser_check_declarator_template_parameters
17325 (parser
, declarator
->declarator
, declarator_location
));
17331 gcc_unreachable ();
17336 /* NUM_TEMPLATES were used in the current declaration. If that is
17337 invalid, return FALSE and issue an error messages. Otherwise,
17338 return TRUE. If DECLARATOR is non-NULL, then we are checking a
17339 declarator and we can print more accurate diagnostics. */
17342 cp_parser_check_template_parameters (cp_parser
* parser
,
17343 unsigned num_templates
,
17344 location_t location
,
17345 cp_declarator
*declarator
)
17347 /* If there are the same number of template classes and parameter
17348 lists, that's OK. */
17349 if (parser
->num_template_parameter_lists
== num_templates
)
17351 /* If there are more, but only one more, then we are referring to a
17352 member template. That's OK too. */
17353 if (parser
->num_template_parameter_lists
== num_templates
+ 1)
17355 /* If there are more template classes than parameter lists, we have
17358 template <class T> void S<T>::R<T>::f (); */
17359 if (parser
->num_template_parameter_lists
< num_templates
)
17362 error_at (location
, "specializing member %<%T::%E%> "
17363 "requires %<template<>%> syntax",
17364 declarator
->u
.id
.qualifying_scope
,
17365 declarator
->u
.id
.unqualified_name
);
17367 error_at (location
, "too few template-parameter-lists");
17370 /* Otherwise, there are too many template parameter lists. We have
17373 template <class T> template <class U> void S::f(); */
17374 error ("%Htoo many template-parameter-lists", &location
);
17378 /* Parse an optional `::' token indicating that the following name is
17379 from the global namespace. If so, PARSER->SCOPE is set to the
17380 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
17381 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
17382 Returns the new value of PARSER->SCOPE, if the `::' token is
17383 present, and NULL_TREE otherwise. */
17386 cp_parser_global_scope_opt (cp_parser
* parser
, bool current_scope_valid_p
)
17390 /* Peek at the next token. */
17391 token
= cp_lexer_peek_token (parser
->lexer
);
17392 /* If we're looking at a `::' token then we're starting from the
17393 global namespace, not our current location. */
17394 if (token
->type
== CPP_SCOPE
)
17396 /* Consume the `::' token. */
17397 cp_lexer_consume_token (parser
->lexer
);
17398 /* Set the SCOPE so that we know where to start the lookup. */
17399 parser
->scope
= global_namespace
;
17400 parser
->qualifying_scope
= global_namespace
;
17401 parser
->object_scope
= NULL_TREE
;
17403 return parser
->scope
;
17405 else if (!current_scope_valid_p
)
17407 parser
->scope
= NULL_TREE
;
17408 parser
->qualifying_scope
= NULL_TREE
;
17409 parser
->object_scope
= NULL_TREE
;
17415 /* Returns TRUE if the upcoming token sequence is the start of a
17416 constructor declarator. If FRIEND_P is true, the declarator is
17417 preceded by the `friend' specifier. */
17420 cp_parser_constructor_declarator_p (cp_parser
*parser
, bool friend_p
)
17422 bool constructor_p
;
17423 tree type_decl
= NULL_TREE
;
17424 bool nested_name_p
;
17425 cp_token
*next_token
;
17427 /* The common case is that this is not a constructor declarator, so
17428 try to avoid doing lots of work if at all possible. It's not
17429 valid declare a constructor at function scope. */
17430 if (parser
->in_function_body
)
17432 /* And only certain tokens can begin a constructor declarator. */
17433 next_token
= cp_lexer_peek_token (parser
->lexer
);
17434 if (next_token
->type
!= CPP_NAME
17435 && next_token
->type
!= CPP_SCOPE
17436 && next_token
->type
!= CPP_NESTED_NAME_SPECIFIER
17437 && next_token
->type
!= CPP_TEMPLATE_ID
)
17440 /* Parse tentatively; we are going to roll back all of the tokens
17442 cp_parser_parse_tentatively (parser
);
17443 /* Assume that we are looking at a constructor declarator. */
17444 constructor_p
= true;
17446 /* Look for the optional `::' operator. */
17447 cp_parser_global_scope_opt (parser
,
17448 /*current_scope_valid_p=*/false);
17449 /* Look for the nested-name-specifier. */
17451 = (cp_parser_nested_name_specifier_opt (parser
,
17452 /*typename_keyword_p=*/false,
17453 /*check_dependency_p=*/false,
17455 /*is_declaration=*/false)
17457 /* Outside of a class-specifier, there must be a
17458 nested-name-specifier. */
17459 if (!nested_name_p
&&
17460 (!at_class_scope_p () || !TYPE_BEING_DEFINED (current_class_type
)
17462 constructor_p
= false;
17463 /* If we still think that this might be a constructor-declarator,
17464 look for a class-name. */
17469 template <typename T> struct S { S(); };
17470 template <typename T> S<T>::S ();
17472 we must recognize that the nested `S' names a class.
17475 template <typename T> S<T>::S<T> ();
17477 we must recognize that the nested `S' names a template. */
17478 type_decl
= cp_parser_class_name (parser
,
17479 /*typename_keyword_p=*/false,
17480 /*template_keyword_p=*/false,
17482 /*check_dependency_p=*/false,
17483 /*class_head_p=*/false,
17484 /*is_declaration=*/false);
17485 /* If there was no class-name, then this is not a constructor. */
17486 constructor_p
= !cp_parser_error_occurred (parser
);
17489 /* If we're still considering a constructor, we have to see a `(',
17490 to begin the parameter-declaration-clause, followed by either a
17491 `)', an `...', or a decl-specifier. We need to check for a
17492 type-specifier to avoid being fooled into thinking that:
17496 is a constructor. (It is actually a function named `f' that
17497 takes one parameter (of type `int') and returns a value of type
17500 && cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>"))
17502 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
)
17503 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_ELLIPSIS
)
17504 /* A parameter declaration begins with a decl-specifier,
17505 which is either the "attribute" keyword, a storage class
17506 specifier, or (usually) a type-specifier. */
17507 && !cp_lexer_next_token_is_decl_specifier_keyword (parser
->lexer
))
17510 tree pushed_scope
= NULL_TREE
;
17511 unsigned saved_num_template_parameter_lists
;
17513 /* Names appearing in the type-specifier should be looked up
17514 in the scope of the class. */
17515 if (current_class_type
)
17519 type
= TREE_TYPE (type_decl
);
17520 if (TREE_CODE (type
) == TYPENAME_TYPE
)
17522 type
= resolve_typename_type (type
,
17523 /*only_current_p=*/false);
17524 if (TREE_CODE (type
) == TYPENAME_TYPE
)
17526 cp_parser_abort_tentative_parse (parser
);
17530 pushed_scope
= push_scope (type
);
17533 /* Inside the constructor parameter list, surrounding
17534 template-parameter-lists do not apply. */
17535 saved_num_template_parameter_lists
17536 = parser
->num_template_parameter_lists
;
17537 parser
->num_template_parameter_lists
= 0;
17539 /* Look for the type-specifier. */
17540 cp_parser_type_specifier (parser
,
17541 CP_PARSER_FLAGS_NONE
,
17542 /*decl_specs=*/NULL
,
17543 /*is_declarator=*/true,
17544 /*declares_class_or_enum=*/NULL
,
17545 /*is_cv_qualifier=*/NULL
);
17547 parser
->num_template_parameter_lists
17548 = saved_num_template_parameter_lists
;
17550 /* Leave the scope of the class. */
17552 pop_scope (pushed_scope
);
17554 constructor_p
= !cp_parser_error_occurred (parser
);
17558 constructor_p
= false;
17559 /* We did not really want to consume any tokens. */
17560 cp_parser_abort_tentative_parse (parser
);
17562 return constructor_p
;
17565 /* Parse the definition of the function given by the DECL_SPECIFIERS,
17566 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
17567 they must be performed once we are in the scope of the function.
17569 Returns the function defined. */
17572 cp_parser_function_definition_from_specifiers_and_declarator
17573 (cp_parser
* parser
,
17574 cp_decl_specifier_seq
*decl_specifiers
,
17576 const cp_declarator
*declarator
)
17581 /* Begin the function-definition. */
17582 success_p
= start_function (decl_specifiers
, declarator
, attributes
);
17584 /* The things we're about to see are not directly qualified by any
17585 template headers we've seen thus far. */
17586 reset_specialization ();
17588 /* If there were names looked up in the decl-specifier-seq that we
17589 did not check, check them now. We must wait until we are in the
17590 scope of the function to perform the checks, since the function
17591 might be a friend. */
17592 perform_deferred_access_checks ();
17596 /* Skip the entire function. */
17597 cp_parser_skip_to_end_of_block_or_statement (parser
);
17598 fn
= error_mark_node
;
17600 else if (DECL_INITIAL (current_function_decl
) != error_mark_node
)
17602 /* Seen already, skip it. An error message has already been output. */
17603 cp_parser_skip_to_end_of_block_or_statement (parser
);
17604 fn
= current_function_decl
;
17605 current_function_decl
= NULL_TREE
;
17606 /* If this is a function from a class, pop the nested class. */
17607 if (current_class_name
)
17608 pop_nested_class ();
17611 fn
= cp_parser_function_definition_after_declarator (parser
,
17612 /*inline_p=*/false);
17617 /* Parse the part of a function-definition that follows the
17618 declarator. INLINE_P is TRUE iff this function is an inline
17619 function defined with a class-specifier.
17621 Returns the function defined. */
17624 cp_parser_function_definition_after_declarator (cp_parser
* parser
,
17628 bool ctor_initializer_p
= false;
17629 bool saved_in_unbraced_linkage_specification_p
;
17630 bool saved_in_function_body
;
17631 unsigned saved_num_template_parameter_lists
;
17634 saved_in_function_body
= parser
->in_function_body
;
17635 parser
->in_function_body
= true;
17636 /* If the next token is `return', then the code may be trying to
17637 make use of the "named return value" extension that G++ used to
17639 token
= cp_lexer_peek_token (parser
->lexer
);
17640 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_RETURN
))
17642 /* Consume the `return' keyword. */
17643 cp_lexer_consume_token (parser
->lexer
);
17644 /* Look for the identifier that indicates what value is to be
17646 cp_parser_identifier (parser
);
17647 /* Issue an error message. */
17648 error ("%Hnamed return values are no longer supported",
17650 /* Skip tokens until we reach the start of the function body. */
17653 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
17654 if (token
->type
== CPP_OPEN_BRACE
17655 || token
->type
== CPP_EOF
17656 || token
->type
== CPP_PRAGMA_EOL
)
17658 cp_lexer_consume_token (parser
->lexer
);
17661 /* The `extern' in `extern "C" void f () { ... }' does not apply to
17662 anything declared inside `f'. */
17663 saved_in_unbraced_linkage_specification_p
17664 = parser
->in_unbraced_linkage_specification_p
;
17665 parser
->in_unbraced_linkage_specification_p
= false;
17666 /* Inside the function, surrounding template-parameter-lists do not
17668 saved_num_template_parameter_lists
17669 = parser
->num_template_parameter_lists
;
17670 parser
->num_template_parameter_lists
= 0;
17671 /* If the next token is `try', then we are looking at a
17672 function-try-block. */
17673 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TRY
))
17674 ctor_initializer_p
= cp_parser_function_try_block (parser
);
17675 /* A function-try-block includes the function-body, so we only do
17676 this next part if we're not processing a function-try-block. */
17679 = cp_parser_ctor_initializer_opt_and_function_body (parser
);
17681 /* Finish the function. */
17682 fn
= finish_function ((ctor_initializer_p
? 1 : 0) |
17683 (inline_p
? 2 : 0));
17684 /* Generate code for it, if necessary. */
17685 expand_or_defer_fn (fn
);
17686 /* Restore the saved values. */
17687 parser
->in_unbraced_linkage_specification_p
17688 = saved_in_unbraced_linkage_specification_p
;
17689 parser
->num_template_parameter_lists
17690 = saved_num_template_parameter_lists
;
17691 parser
->in_function_body
= saved_in_function_body
;
17696 /* Parse a template-declaration, assuming that the `export' (and
17697 `extern') keywords, if present, has already been scanned. MEMBER_P
17698 is as for cp_parser_template_declaration. */
17701 cp_parser_template_declaration_after_export (cp_parser
* parser
, bool member_p
)
17703 tree decl
= NULL_TREE
;
17704 VEC (deferred_access_check
,gc
) *checks
;
17705 tree parameter_list
;
17706 bool friend_p
= false;
17707 bool need_lang_pop
;
17710 /* Look for the `template' keyword. */
17711 token
= cp_lexer_peek_token (parser
->lexer
);
17712 if (!cp_parser_require_keyword (parser
, RID_TEMPLATE
, "%<template%>"))
17716 if (!cp_parser_require (parser
, CPP_LESS
, "%<<%>"))
17718 if (at_class_scope_p () && current_function_decl
)
17720 /* 14.5.2.2 [temp.mem]
17722 A local class shall not have member templates. */
17723 error ("%Hinvalid declaration of member template in local class",
17725 cp_parser_skip_to_end_of_block_or_statement (parser
);
17730 A template ... shall not have C linkage. */
17731 if (current_lang_name
== lang_name_c
)
17733 error ("%Htemplate with C linkage", &token
->location
);
17734 /* Give it C++ linkage to avoid confusing other parts of the
17736 push_lang_context (lang_name_cplusplus
);
17737 need_lang_pop
= true;
17740 need_lang_pop
= false;
17742 /* We cannot perform access checks on the template parameter
17743 declarations until we know what is being declared, just as we
17744 cannot check the decl-specifier list. */
17745 push_deferring_access_checks (dk_deferred
);
17747 /* If the next token is `>', then we have an invalid
17748 specialization. Rather than complain about an invalid template
17749 parameter, issue an error message here. */
17750 if (cp_lexer_next_token_is (parser
->lexer
, CPP_GREATER
))
17752 cp_parser_error (parser
, "invalid explicit specialization");
17753 begin_specialization ();
17754 parameter_list
= NULL_TREE
;
17757 /* Parse the template parameters. */
17758 parameter_list
= cp_parser_template_parameter_list (parser
);
17760 /* Get the deferred access checks from the parameter list. These
17761 will be checked once we know what is being declared, as for a
17762 member template the checks must be performed in the scope of the
17763 class containing the member. */
17764 checks
= get_deferred_access_checks ();
17766 /* Look for the `>'. */
17767 cp_parser_skip_to_end_of_template_parameter_list (parser
);
17768 /* We just processed one more parameter list. */
17769 ++parser
->num_template_parameter_lists
;
17770 /* If the next token is `template', there are more template
17772 if (cp_lexer_next_token_is_keyword (parser
->lexer
,
17774 cp_parser_template_declaration_after_export (parser
, member_p
);
17777 /* There are no access checks when parsing a template, as we do not
17778 know if a specialization will be a friend. */
17779 push_deferring_access_checks (dk_no_check
);
17780 token
= cp_lexer_peek_token (parser
->lexer
);
17781 decl
= cp_parser_single_declaration (parser
,
17784 /*explicit_specialization_p=*/false,
17786 pop_deferring_access_checks ();
17788 /* If this is a member template declaration, let the front
17790 if (member_p
&& !friend_p
&& decl
)
17792 if (TREE_CODE (decl
) == TYPE_DECL
)
17793 cp_parser_check_access_in_redeclaration (decl
, token
->location
);
17795 decl
= finish_member_template_decl (decl
);
17797 else if (friend_p
&& decl
&& TREE_CODE (decl
) == TYPE_DECL
)
17798 make_friend_class (current_class_type
, TREE_TYPE (decl
),
17799 /*complain=*/true);
17801 /* We are done with the current parameter list. */
17802 --parser
->num_template_parameter_lists
;
17804 pop_deferring_access_checks ();
17807 finish_template_decl (parameter_list
);
17809 /* Register member declarations. */
17810 if (member_p
&& !friend_p
&& decl
&& !DECL_CLASS_TEMPLATE_P (decl
))
17811 finish_member_declaration (decl
);
17812 /* For the erroneous case of a template with C linkage, we pushed an
17813 implicit C++ linkage scope; exit that scope now. */
17815 pop_lang_context ();
17816 /* If DECL is a function template, we must return to parse it later.
17817 (Even though there is no definition, there might be default
17818 arguments that need handling.) */
17819 if (member_p
&& decl
17820 && (TREE_CODE (decl
) == FUNCTION_DECL
17821 || DECL_FUNCTION_TEMPLATE_P (decl
)))
17822 TREE_VALUE (parser
->unparsed_functions_queues
)
17823 = tree_cons (NULL_TREE
, decl
,
17824 TREE_VALUE (parser
->unparsed_functions_queues
));
17827 /* Perform the deferred access checks from a template-parameter-list.
17828 CHECKS is a TREE_LIST of access checks, as returned by
17829 get_deferred_access_checks. */
17832 cp_parser_perform_template_parameter_access_checks (VEC (deferred_access_check
,gc
)* checks
)
17834 ++processing_template_parmlist
;
17835 perform_access_checks (checks
);
17836 --processing_template_parmlist
;
17839 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
17840 `function-definition' sequence. MEMBER_P is true, this declaration
17841 appears in a class scope.
17843 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
17844 *FRIEND_P is set to TRUE iff the declaration is a friend. */
17847 cp_parser_single_declaration (cp_parser
* parser
,
17848 VEC (deferred_access_check
,gc
)* checks
,
17850 bool explicit_specialization_p
,
17853 int declares_class_or_enum
;
17854 tree decl
= NULL_TREE
;
17855 cp_decl_specifier_seq decl_specifiers
;
17856 bool function_definition_p
= false;
17857 cp_token
*decl_spec_token_start
;
17859 /* This function is only used when processing a template
17861 gcc_assert (innermost_scope_kind () == sk_template_parms
17862 || innermost_scope_kind () == sk_template_spec
);
17864 /* Defer access checks until we know what is being declared. */
17865 push_deferring_access_checks (dk_deferred
);
17867 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
17869 decl_spec_token_start
= cp_lexer_peek_token (parser
->lexer
);
17870 cp_parser_decl_specifier_seq (parser
,
17871 CP_PARSER_FLAGS_OPTIONAL
,
17873 &declares_class_or_enum
);
17875 *friend_p
= cp_parser_friend_p (&decl_specifiers
);
17877 /* There are no template typedefs. */
17878 if (decl_specifiers
.specs
[(int) ds_typedef
])
17880 error ("%Htemplate declaration of %qs",
17881 &decl_spec_token_start
->location
, "typedef");
17882 decl
= error_mark_node
;
17885 /* Gather up the access checks that occurred the
17886 decl-specifier-seq. */
17887 stop_deferring_access_checks ();
17889 /* Check for the declaration of a template class. */
17890 if (declares_class_or_enum
)
17892 if (cp_parser_declares_only_class_p (parser
))
17894 decl
= shadow_tag (&decl_specifiers
);
17899 friend template <typename T> struct A<T>::B;
17902 A<T>::B will be represented by a TYPENAME_TYPE, and
17903 therefore not recognized by shadow_tag. */
17904 if (friend_p
&& *friend_p
17906 && decl_specifiers
.type
17907 && TYPE_P (decl_specifiers
.type
))
17908 decl
= decl_specifiers
.type
;
17910 if (decl
&& decl
!= error_mark_node
)
17911 decl
= TYPE_NAME (decl
);
17913 decl
= error_mark_node
;
17915 /* Perform access checks for template parameters. */
17916 cp_parser_perform_template_parameter_access_checks (checks
);
17919 /* If it's not a template class, try for a template function. If
17920 the next token is a `;', then this declaration does not declare
17921 anything. But, if there were errors in the decl-specifiers, then
17922 the error might well have come from an attempted class-specifier.
17923 In that case, there's no need to warn about a missing declarator. */
17925 && (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
)
17926 || decl_specifiers
.type
!= error_mark_node
))
17928 decl
= cp_parser_init_declarator (parser
,
17931 /*function_definition_allowed_p=*/true,
17933 declares_class_or_enum
,
17934 &function_definition_p
);
17936 /* 7.1.1-1 [dcl.stc]
17938 A storage-class-specifier shall not be specified in an explicit
17939 specialization... */
17941 && explicit_specialization_p
17942 && decl_specifiers
.storage_class
!= sc_none
)
17944 error ("%Hexplicit template specialization cannot have a storage class",
17945 &decl_spec_token_start
->location
);
17946 decl
= error_mark_node
;
17950 pop_deferring_access_checks ();
17952 /* Clear any current qualification; whatever comes next is the start
17953 of something new. */
17954 parser
->scope
= NULL_TREE
;
17955 parser
->qualifying_scope
= NULL_TREE
;
17956 parser
->object_scope
= NULL_TREE
;
17957 /* Look for a trailing `;' after the declaration. */
17958 if (!function_definition_p
17959 && (decl
== error_mark_node
17960 || !cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>")))
17961 cp_parser_skip_to_end_of_block_or_statement (parser
);
17966 /* Parse a cast-expression that is not the operand of a unary "&". */
17969 cp_parser_simple_cast_expression (cp_parser
*parser
)
17971 return cp_parser_cast_expression (parser
, /*address_p=*/false,
17972 /*cast_p=*/false, NULL
);
17975 /* Parse a functional cast to TYPE. Returns an expression
17976 representing the cast. */
17979 cp_parser_functional_cast (cp_parser
* parser
, tree type
)
17981 tree expression_list
;
17985 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
17987 maybe_warn_cpp0x ("extended initializer lists");
17988 expression_list
= cp_parser_braced_list (parser
, &nonconst_p
);
17989 CONSTRUCTOR_IS_DIRECT_INIT (expression_list
) = 1;
17990 if (TREE_CODE (type
) == TYPE_DECL
)
17991 type
= TREE_TYPE (type
);
17992 return finish_compound_literal (type
, expression_list
);
17996 = cp_parser_parenthesized_expression_list (parser
, false,
17998 /*allow_expansion_p=*/true,
17999 /*non_constant_p=*/NULL
);
18001 cast
= build_functional_cast (type
, expression_list
,
18002 tf_warning_or_error
);
18003 /* [expr.const]/1: In an integral constant expression "only type
18004 conversions to integral or enumeration type can be used". */
18005 if (TREE_CODE (type
) == TYPE_DECL
)
18006 type
= TREE_TYPE (type
);
18007 if (cast
!= error_mark_node
18008 && !cast_valid_in_integral_constant_expression_p (type
)
18009 && (cp_parser_non_integral_constant_expression
18010 (parser
, "a call to a constructor")))
18011 return error_mark_node
;
18015 /* Save the tokens that make up the body of a member function defined
18016 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
18017 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
18018 specifiers applied to the declaration. Returns the FUNCTION_DECL
18019 for the member function. */
18022 cp_parser_save_member_function_body (cp_parser
* parser
,
18023 cp_decl_specifier_seq
*decl_specifiers
,
18024 cp_declarator
*declarator
,
18031 /* Create the function-declaration. */
18032 fn
= start_method (decl_specifiers
, declarator
, attributes
);
18033 /* If something went badly wrong, bail out now. */
18034 if (fn
== error_mark_node
)
18036 /* If there's a function-body, skip it. */
18037 if (cp_parser_token_starts_function_definition_p
18038 (cp_lexer_peek_token (parser
->lexer
)))
18039 cp_parser_skip_to_end_of_block_or_statement (parser
);
18040 return error_mark_node
;
18043 /* Remember it, if there default args to post process. */
18044 cp_parser_save_default_args (parser
, fn
);
18046 /* Save away the tokens that make up the body of the
18048 first
= parser
->lexer
->next_token
;
18049 /* We can have braced-init-list mem-initializers before the fn body. */
18050 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
18052 cp_lexer_consume_token (parser
->lexer
);
18053 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
)
18054 && cp_lexer_next_token_is_not_keyword (parser
->lexer
, RID_TRY
))
18056 /* cache_group will stop after an un-nested { } pair, too. */
18057 if (cp_parser_cache_group (parser
, CPP_CLOSE_PAREN
, /*depth=*/0))
18060 /* variadic mem-inits have ... after the ')'. */
18061 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
18062 cp_lexer_consume_token (parser
->lexer
);
18065 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, /*depth=*/0);
18066 /* Handle function try blocks. */
18067 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_CATCH
))
18068 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, /*depth=*/0);
18069 last
= parser
->lexer
->next_token
;
18071 /* Save away the inline definition; we will process it when the
18072 class is complete. */
18073 DECL_PENDING_INLINE_INFO (fn
) = cp_token_cache_new (first
, last
);
18074 DECL_PENDING_INLINE_P (fn
) = 1;
18076 /* We need to know that this was defined in the class, so that
18077 friend templates are handled correctly. */
18078 DECL_INITIALIZED_IN_CLASS_P (fn
) = 1;
18080 /* We're done with the inline definition. */
18081 finish_method (fn
);
18083 /* Add FN to the queue of functions to be parsed later. */
18084 TREE_VALUE (parser
->unparsed_functions_queues
)
18085 = tree_cons (NULL_TREE
, fn
,
18086 TREE_VALUE (parser
->unparsed_functions_queues
));
18091 /* Parse a template-argument-list, as well as the trailing ">" (but
18092 not the opening ">"). See cp_parser_template_argument_list for the
18096 cp_parser_enclosed_template_argument_list (cp_parser
* parser
)
18100 tree saved_qualifying_scope
;
18101 tree saved_object_scope
;
18102 bool saved_greater_than_is_operator_p
;
18103 bool saved_skip_evaluation
;
18107 When parsing a template-id, the first non-nested `>' is taken as
18108 the end of the template-argument-list rather than a greater-than
18110 saved_greater_than_is_operator_p
18111 = parser
->greater_than_is_operator_p
;
18112 parser
->greater_than_is_operator_p
= false;
18113 /* Parsing the argument list may modify SCOPE, so we save it
18115 saved_scope
= parser
->scope
;
18116 saved_qualifying_scope
= parser
->qualifying_scope
;
18117 saved_object_scope
= parser
->object_scope
;
18118 /* We need to evaluate the template arguments, even though this
18119 template-id may be nested within a "sizeof". */
18120 saved_skip_evaluation
= skip_evaluation
;
18121 skip_evaluation
= false;
18122 /* Parse the template-argument-list itself. */
18123 if (cp_lexer_next_token_is (parser
->lexer
, CPP_GREATER
)
18124 || cp_lexer_next_token_is (parser
->lexer
, CPP_RSHIFT
))
18125 arguments
= NULL_TREE
;
18127 arguments
= cp_parser_template_argument_list (parser
);
18128 /* Look for the `>' that ends the template-argument-list. If we find
18129 a '>>' instead, it's probably just a typo. */
18130 if (cp_lexer_next_token_is (parser
->lexer
, CPP_RSHIFT
))
18132 if (cxx_dialect
!= cxx98
)
18134 /* In C++0x, a `>>' in a template argument list or cast
18135 expression is considered to be two separate `>'
18136 tokens. So, change the current token to a `>', but don't
18137 consume it: it will be consumed later when the outer
18138 template argument list (or cast expression) is parsed.
18139 Note that this replacement of `>' for `>>' is necessary
18140 even if we are parsing tentatively: in the tentative
18141 case, after calling
18142 cp_parser_enclosed_template_argument_list we will always
18143 throw away all of the template arguments and the first
18144 closing `>', either because the template argument list
18145 was erroneous or because we are replacing those tokens
18146 with a CPP_TEMPLATE_ID token. The second `>' (which will
18147 not have been thrown away) is needed either to close an
18148 outer template argument list or to complete a new-style
18150 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
18151 token
->type
= CPP_GREATER
;
18153 else if (!saved_greater_than_is_operator_p
)
18155 /* If we're in a nested template argument list, the '>>' has
18156 to be a typo for '> >'. We emit the error message, but we
18157 continue parsing and we push a '>' as next token, so that
18158 the argument list will be parsed correctly. Note that the
18159 global source location is still on the token before the
18160 '>>', so we need to say explicitly where we want it. */
18161 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
18162 error ("%H%<>>%> should be %<> >%> "
18163 "within a nested template argument list",
18166 token
->type
= CPP_GREATER
;
18170 /* If this is not a nested template argument list, the '>>'
18171 is a typo for '>'. Emit an error message and continue.
18172 Same deal about the token location, but here we can get it
18173 right by consuming the '>>' before issuing the diagnostic. */
18174 cp_token
*token
= cp_lexer_consume_token (parser
->lexer
);
18175 error ("%Hspurious %<>>%>, use %<>%> to terminate "
18176 "a template argument list", &token
->location
);
18180 cp_parser_skip_to_end_of_template_parameter_list (parser
);
18181 /* The `>' token might be a greater-than operator again now. */
18182 parser
->greater_than_is_operator_p
18183 = saved_greater_than_is_operator_p
;
18184 /* Restore the SAVED_SCOPE. */
18185 parser
->scope
= saved_scope
;
18186 parser
->qualifying_scope
= saved_qualifying_scope
;
18187 parser
->object_scope
= saved_object_scope
;
18188 skip_evaluation
= saved_skip_evaluation
;
18193 /* MEMBER_FUNCTION is a member function, or a friend. If default
18194 arguments, or the body of the function have not yet been parsed,
18198 cp_parser_late_parsing_for_member (cp_parser
* parser
, tree member_function
)
18200 /* If this member is a template, get the underlying
18202 if (DECL_FUNCTION_TEMPLATE_P (member_function
))
18203 member_function
= DECL_TEMPLATE_RESULT (member_function
);
18205 /* There should not be any class definitions in progress at this
18206 point; the bodies of members are only parsed outside of all class
18208 gcc_assert (parser
->num_classes_being_defined
== 0);
18209 /* While we're parsing the member functions we might encounter more
18210 classes. We want to handle them right away, but we don't want
18211 them getting mixed up with functions that are currently in the
18213 parser
->unparsed_functions_queues
18214 = tree_cons (NULL_TREE
, NULL_TREE
, parser
->unparsed_functions_queues
);
18216 /* Make sure that any template parameters are in scope. */
18217 maybe_begin_member_template_processing (member_function
);
18219 /* If the body of the function has not yet been parsed, parse it
18221 if (DECL_PENDING_INLINE_P (member_function
))
18223 tree function_scope
;
18224 cp_token_cache
*tokens
;
18226 /* The function is no longer pending; we are processing it. */
18227 tokens
= DECL_PENDING_INLINE_INFO (member_function
);
18228 DECL_PENDING_INLINE_INFO (member_function
) = NULL
;
18229 DECL_PENDING_INLINE_P (member_function
) = 0;
18231 /* If this is a local class, enter the scope of the containing
18233 function_scope
= current_function_decl
;
18234 if (function_scope
)
18235 push_function_context ();
18237 /* Push the body of the function onto the lexer stack. */
18238 cp_parser_push_lexer_for_tokens (parser
, tokens
);
18240 /* Let the front end know that we going to be defining this
18242 start_preparsed_function (member_function
, NULL_TREE
,
18243 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
18245 /* Don't do access checking if it is a templated function. */
18246 if (processing_template_decl
)
18247 push_deferring_access_checks (dk_no_check
);
18249 /* Now, parse the body of the function. */
18250 cp_parser_function_definition_after_declarator (parser
,
18251 /*inline_p=*/true);
18253 if (processing_template_decl
)
18254 pop_deferring_access_checks ();
18256 /* Leave the scope of the containing function. */
18257 if (function_scope
)
18258 pop_function_context ();
18259 cp_parser_pop_lexer (parser
);
18262 /* Remove any template parameters from the symbol table. */
18263 maybe_end_member_template_processing ();
18265 /* Restore the queue. */
18266 parser
->unparsed_functions_queues
18267 = TREE_CHAIN (parser
->unparsed_functions_queues
);
18270 /* If DECL contains any default args, remember it on the unparsed
18271 functions queue. */
18274 cp_parser_save_default_args (cp_parser
* parser
, tree decl
)
18278 for (probe
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
18280 probe
= TREE_CHAIN (probe
))
18281 if (TREE_PURPOSE (probe
))
18283 TREE_PURPOSE (parser
->unparsed_functions_queues
)
18284 = tree_cons (current_class_type
, decl
,
18285 TREE_PURPOSE (parser
->unparsed_functions_queues
));
18290 /* FN is a FUNCTION_DECL which may contains a parameter with an
18291 unparsed DEFAULT_ARG. Parse the default args now. This function
18292 assumes that the current scope is the scope in which the default
18293 argument should be processed. */
18296 cp_parser_late_parsing_default_args (cp_parser
*parser
, tree fn
)
18298 bool saved_local_variables_forbidden_p
;
18301 /* While we're parsing the default args, we might (due to the
18302 statement expression extension) encounter more classes. We want
18303 to handle them right away, but we don't want them getting mixed
18304 up with default args that are currently in the queue. */
18305 parser
->unparsed_functions_queues
18306 = tree_cons (NULL_TREE
, NULL_TREE
, parser
->unparsed_functions_queues
);
18308 /* Local variable names (and the `this' keyword) may not appear
18309 in a default argument. */
18310 saved_local_variables_forbidden_p
= parser
->local_variables_forbidden_p
;
18311 parser
->local_variables_forbidden_p
= true;
18313 for (parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
18315 parm
= TREE_CHAIN (parm
))
18317 cp_token_cache
*tokens
;
18318 tree default_arg
= TREE_PURPOSE (parm
);
18320 VEC(tree
,gc
) *insts
;
18327 if (TREE_CODE (default_arg
) != DEFAULT_ARG
)
18328 /* This can happen for a friend declaration for a function
18329 already declared with default arguments. */
18332 /* Push the saved tokens for the default argument onto the parser's
18334 tokens
= DEFARG_TOKENS (default_arg
);
18335 cp_parser_push_lexer_for_tokens (parser
, tokens
);
18337 /* Parse the assignment-expression. */
18338 parsed_arg
= cp_parser_assignment_expression (parser
, /*cast_p=*/false, NULL
);
18339 if (parsed_arg
== error_mark_node
)
18341 cp_parser_pop_lexer (parser
);
18345 if (!processing_template_decl
)
18346 parsed_arg
= check_default_argument (TREE_VALUE (parm
), parsed_arg
);
18348 TREE_PURPOSE (parm
) = parsed_arg
;
18350 /* Update any instantiations we've already created. */
18351 for (insts
= DEFARG_INSTANTIATIONS (default_arg
), ix
= 0;
18352 VEC_iterate (tree
, insts
, ix
, copy
); ix
++)
18353 TREE_PURPOSE (copy
) = parsed_arg
;
18355 /* If the token stream has not been completely used up, then
18356 there was extra junk after the end of the default
18358 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
18359 cp_parser_error (parser
, "expected %<,%>");
18361 /* Revert to the main lexer. */
18362 cp_parser_pop_lexer (parser
);
18365 /* Make sure no default arg is missing. */
18366 check_default_args (fn
);
18368 /* Restore the state of local_variables_forbidden_p. */
18369 parser
->local_variables_forbidden_p
= saved_local_variables_forbidden_p
;
18371 /* Restore the queue. */
18372 parser
->unparsed_functions_queues
18373 = TREE_CHAIN (parser
->unparsed_functions_queues
);
18376 /* Parse the operand of `sizeof' (or a similar operator). Returns
18377 either a TYPE or an expression, depending on the form of the
18378 input. The KEYWORD indicates which kind of expression we have
18382 cp_parser_sizeof_operand (cp_parser
* parser
, enum rid keyword
)
18384 tree expr
= NULL_TREE
;
18385 const char *saved_message
;
18387 bool saved_integral_constant_expression_p
;
18388 bool saved_non_integral_constant_expression_p
;
18389 bool pack_expansion_p
= false;
18391 /* Types cannot be defined in a `sizeof' expression. Save away the
18393 saved_message
= parser
->type_definition_forbidden_message
;
18394 /* And create the new one. */
18395 tmp
= concat ("types may not be defined in %<",
18396 IDENTIFIER_POINTER (ridpointers
[keyword
]),
18397 "%> expressions", NULL
);
18398 parser
->type_definition_forbidden_message
= tmp
;
18400 /* The restrictions on constant-expressions do not apply inside
18401 sizeof expressions. */
18402 saved_integral_constant_expression_p
18403 = parser
->integral_constant_expression_p
;
18404 saved_non_integral_constant_expression_p
18405 = parser
->non_integral_constant_expression_p
;
18406 parser
->integral_constant_expression_p
= false;
18408 /* If it's a `...', then we are computing the length of a parameter
18410 if (keyword
== RID_SIZEOF
18411 && cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
18413 /* Consume the `...'. */
18414 cp_lexer_consume_token (parser
->lexer
);
18415 maybe_warn_variadic_templates ();
18417 /* Note that this is an expansion. */
18418 pack_expansion_p
= true;
18421 /* Do not actually evaluate the expression. */
18423 /* If it's a `(', then we might be looking at the type-id
18425 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
18428 bool saved_in_type_id_in_expr_p
;
18430 /* We can't be sure yet whether we're looking at a type-id or an
18432 cp_parser_parse_tentatively (parser
);
18433 /* Consume the `('. */
18434 cp_lexer_consume_token (parser
->lexer
);
18435 /* Parse the type-id. */
18436 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
18437 parser
->in_type_id_in_expr_p
= true;
18438 type
= cp_parser_type_id (parser
);
18439 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
18440 /* Now, look for the trailing `)'. */
18441 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
18442 /* If all went well, then we're done. */
18443 if (cp_parser_parse_definitely (parser
))
18445 cp_decl_specifier_seq decl_specs
;
18447 /* Build a trivial decl-specifier-seq. */
18448 clear_decl_specs (&decl_specs
);
18449 decl_specs
.type
= type
;
18451 /* Call grokdeclarator to figure out what type this is. */
18452 expr
= grokdeclarator (NULL
,
18456 /*attrlist=*/NULL
);
18460 /* If the type-id production did not work out, then we must be
18461 looking at the unary-expression production. */
18463 expr
= cp_parser_unary_expression (parser
, /*address_p=*/false,
18464 /*cast_p=*/false, NULL
);
18466 if (pack_expansion_p
)
18467 /* Build a pack expansion. */
18468 expr
= make_pack_expansion (expr
);
18470 /* Go back to evaluating expressions. */
18473 /* Free the message we created. */
18475 /* And restore the old one. */
18476 parser
->type_definition_forbidden_message
= saved_message
;
18477 parser
->integral_constant_expression_p
18478 = saved_integral_constant_expression_p
;
18479 parser
->non_integral_constant_expression_p
18480 = saved_non_integral_constant_expression_p
;
18485 /* If the current declaration has no declarator, return true. */
18488 cp_parser_declares_only_class_p (cp_parser
*parser
)
18490 /* If the next token is a `;' or a `,' then there is no
18492 return (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
18493 || cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
));
18496 /* Update the DECL_SPECS to reflect the storage class indicated by
18500 cp_parser_set_storage_class (cp_parser
*parser
,
18501 cp_decl_specifier_seq
*decl_specs
,
18503 location_t location
)
18505 cp_storage_class storage_class
;
18507 if (parser
->in_unbraced_linkage_specification_p
)
18509 error ("%Hinvalid use of %qD in linkage specification",
18510 &location
, ridpointers
[keyword
]);
18513 else if (decl_specs
->storage_class
!= sc_none
)
18515 decl_specs
->conflicting_specifiers_p
= true;
18519 if ((keyword
== RID_EXTERN
|| keyword
== RID_STATIC
)
18520 && decl_specs
->specs
[(int) ds_thread
])
18522 error ("%H%<__thread%> before %qD", &location
, ridpointers
[keyword
]);
18523 decl_specs
->specs
[(int) ds_thread
] = 0;
18529 storage_class
= sc_auto
;
18532 storage_class
= sc_register
;
18535 storage_class
= sc_static
;
18538 storage_class
= sc_extern
;
18541 storage_class
= sc_mutable
;
18544 gcc_unreachable ();
18546 decl_specs
->storage_class
= storage_class
;
18548 /* A storage class specifier cannot be applied alongside a typedef
18549 specifier. If there is a typedef specifier present then set
18550 conflicting_specifiers_p which will trigger an error later
18551 on in grokdeclarator. */
18552 if (decl_specs
->specs
[(int)ds_typedef
])
18553 decl_specs
->conflicting_specifiers_p
= true;
18556 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If USER_DEFINED_P
18557 is true, the type is a user-defined type; otherwise it is a
18558 built-in type specified by a keyword. */
18561 cp_parser_set_decl_spec_type (cp_decl_specifier_seq
*decl_specs
,
18563 location_t location
,
18564 bool user_defined_p
)
18566 decl_specs
->any_specifiers_p
= true;
18568 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
18569 (with, for example, in "typedef int wchar_t;") we remember that
18570 this is what happened. In system headers, we ignore these
18571 declarations so that G++ can work with system headers that are not
18573 if (decl_specs
->specs
[(int) ds_typedef
]
18575 && (type_spec
== boolean_type_node
18576 || type_spec
== char16_type_node
18577 || type_spec
== char32_type_node
18578 || type_spec
== wchar_type_node
)
18579 && (decl_specs
->type
18580 || decl_specs
->specs
[(int) ds_long
]
18581 || decl_specs
->specs
[(int) ds_short
]
18582 || decl_specs
->specs
[(int) ds_unsigned
]
18583 || decl_specs
->specs
[(int) ds_signed
]))
18585 decl_specs
->redefined_builtin_type
= type_spec
;
18586 if (!decl_specs
->type
)
18588 decl_specs
->type
= type_spec
;
18589 decl_specs
->user_defined_type_p
= false;
18590 decl_specs
->type_location
= location
;
18593 else if (decl_specs
->type
)
18594 decl_specs
->multiple_types_p
= true;
18597 decl_specs
->type
= type_spec
;
18598 decl_specs
->user_defined_type_p
= user_defined_p
;
18599 decl_specs
->redefined_builtin_type
= NULL_TREE
;
18600 decl_specs
->type_location
= location
;
18604 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
18605 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
18608 cp_parser_friend_p (const cp_decl_specifier_seq
*decl_specifiers
)
18610 return decl_specifiers
->specs
[(int) ds_friend
] != 0;
18613 /* If the next token is of the indicated TYPE, consume it. Otherwise,
18614 issue an error message indicating that TOKEN_DESC was expected.
18616 Returns the token consumed, if the token had the appropriate type.
18617 Otherwise, returns NULL. */
18620 cp_parser_require (cp_parser
* parser
,
18621 enum cpp_ttype type
,
18622 const char* token_desc
)
18624 if (cp_lexer_next_token_is (parser
->lexer
, type
))
18625 return cp_lexer_consume_token (parser
->lexer
);
18628 /* Output the MESSAGE -- unless we're parsing tentatively. */
18629 if (!cp_parser_simulate_error (parser
))
18631 char *message
= concat ("expected ", token_desc
, NULL
);
18632 cp_parser_error (parser
, message
);
18639 /* An error message is produced if the next token is not '>'.
18640 All further tokens are skipped until the desired token is
18641 found or '{', '}', ';' or an unbalanced ')' or ']'. */
18644 cp_parser_skip_to_end_of_template_parameter_list (cp_parser
* parser
)
18646 /* Current level of '< ... >'. */
18647 unsigned level
= 0;
18648 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
18649 unsigned nesting_depth
= 0;
18651 /* Are we ready, yet? If not, issue error message. */
18652 if (cp_parser_require (parser
, CPP_GREATER
, "%<>%>"))
18655 /* Skip tokens until the desired token is found. */
18658 /* Peek at the next token. */
18659 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
18662 if (!nesting_depth
)
18667 if (cxx_dialect
== cxx98
)
18668 /* C++0x views the `>>' operator as two `>' tokens, but
18671 else if (!nesting_depth
&& level
-- == 0)
18673 /* We've hit a `>>' where the first `>' closes the
18674 template argument list, and the second `>' is
18675 spurious. Just consume the `>>' and stop; we've
18676 already produced at least one error. */
18677 cp_lexer_consume_token (parser
->lexer
);
18680 /* Fall through for C++0x, so we handle the second `>' in
18684 if (!nesting_depth
&& level
-- == 0)
18686 /* We've reached the token we want, consume it and stop. */
18687 cp_lexer_consume_token (parser
->lexer
);
18692 case CPP_OPEN_PAREN
:
18693 case CPP_OPEN_SQUARE
:
18697 case CPP_CLOSE_PAREN
:
18698 case CPP_CLOSE_SQUARE
:
18699 if (nesting_depth
-- == 0)
18704 case CPP_PRAGMA_EOL
:
18705 case CPP_SEMICOLON
:
18706 case CPP_OPEN_BRACE
:
18707 case CPP_CLOSE_BRACE
:
18708 /* The '>' was probably forgotten, don't look further. */
18715 /* Consume this token. */
18716 cp_lexer_consume_token (parser
->lexer
);
18720 /* If the next token is the indicated keyword, consume it. Otherwise,
18721 issue an error message indicating that TOKEN_DESC was expected.
18723 Returns the token consumed, if the token had the appropriate type.
18724 Otherwise, returns NULL. */
18727 cp_parser_require_keyword (cp_parser
* parser
,
18729 const char* token_desc
)
18731 cp_token
*token
= cp_parser_require (parser
, CPP_KEYWORD
, token_desc
);
18733 if (token
&& token
->keyword
!= keyword
)
18735 dyn_string_t error_msg
;
18737 /* Format the error message. */
18738 error_msg
= dyn_string_new (0);
18739 dyn_string_append_cstr (error_msg
, "expected ");
18740 dyn_string_append_cstr (error_msg
, token_desc
);
18741 cp_parser_error (parser
, error_msg
->s
);
18742 dyn_string_delete (error_msg
);
18749 /* Returns TRUE iff TOKEN is a token that can begin the body of a
18750 function-definition. */
18753 cp_parser_token_starts_function_definition_p (cp_token
* token
)
18755 return (/* An ordinary function-body begins with an `{'. */
18756 token
->type
== CPP_OPEN_BRACE
18757 /* A ctor-initializer begins with a `:'. */
18758 || token
->type
== CPP_COLON
18759 /* A function-try-block begins with `try'. */
18760 || token
->keyword
== RID_TRY
18761 /* The named return value extension begins with `return'. */
18762 || token
->keyword
== RID_RETURN
);
18765 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
18769 cp_parser_next_token_starts_class_definition_p (cp_parser
*parser
)
18773 token
= cp_lexer_peek_token (parser
->lexer
);
18774 return (token
->type
== CPP_OPEN_BRACE
|| token
->type
== CPP_COLON
);
18777 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
18778 C++0x) ending a template-argument. */
18781 cp_parser_next_token_ends_template_argument_p (cp_parser
*parser
)
18785 token
= cp_lexer_peek_token (parser
->lexer
);
18786 return (token
->type
== CPP_COMMA
18787 || token
->type
== CPP_GREATER
18788 || token
->type
== CPP_ELLIPSIS
18789 || ((cxx_dialect
!= cxx98
) && token
->type
== CPP_RSHIFT
));
18792 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
18793 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
18796 cp_parser_nth_token_starts_template_argument_list_p (cp_parser
* parser
,
18801 token
= cp_lexer_peek_nth_token (parser
->lexer
, n
);
18802 if (token
->type
== CPP_LESS
)
18804 /* Check for the sequence `<::' in the original code. It would be lexed as
18805 `[:', where `[' is a digraph, and there is no whitespace before
18807 if (token
->type
== CPP_OPEN_SQUARE
&& token
->flags
& DIGRAPH
)
18810 token2
= cp_lexer_peek_nth_token (parser
->lexer
, n
+1);
18811 if (token2
->type
== CPP_COLON
&& !(token2
->flags
& PREV_WHITE
))
18817 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
18818 or none_type otherwise. */
18820 static enum tag_types
18821 cp_parser_token_is_class_key (cp_token
* token
)
18823 switch (token
->keyword
)
18828 return record_type
;
18837 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
18840 cp_parser_check_class_key (enum tag_types class_key
, tree type
)
18842 if ((TREE_CODE (type
) == UNION_TYPE
) != (class_key
== union_type
))
18843 permerror (input_location
, "%qs tag used in naming %q#T",
18844 class_key
== union_type
? "union"
18845 : class_key
== record_type
? "struct" : "class",
18849 /* Issue an error message if DECL is redeclared with different
18850 access than its original declaration [class.access.spec/3].
18851 This applies to nested classes and nested class templates.
18855 cp_parser_check_access_in_redeclaration (tree decl
, location_t location
)
18857 if (!decl
|| !CLASS_TYPE_P (TREE_TYPE (decl
)))
18860 if ((TREE_PRIVATE (decl
)
18861 != (current_access_specifier
== access_private_node
))
18862 || (TREE_PROTECTED (decl
)
18863 != (current_access_specifier
== access_protected_node
)))
18864 error ("%H%qD redeclared with different access", &location
, decl
);
18867 /* Look for the `template' keyword, as a syntactic disambiguator.
18868 Return TRUE iff it is present, in which case it will be
18872 cp_parser_optional_template_keyword (cp_parser
*parser
)
18874 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
18876 /* The `template' keyword can only be used within templates;
18877 outside templates the parser can always figure out what is a
18878 template and what is not. */
18879 if (!processing_template_decl
)
18881 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
18882 error ("%H%<template%> (as a disambiguator) is only allowed "
18883 "within templates", &token
->location
);
18884 /* If this part of the token stream is rescanned, the same
18885 error message would be generated. So, we purge the token
18886 from the stream. */
18887 cp_lexer_purge_token (parser
->lexer
);
18892 /* Consume the `template' keyword. */
18893 cp_lexer_consume_token (parser
->lexer
);
18901 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
18902 set PARSER->SCOPE, and perform other related actions. */
18905 cp_parser_pre_parsed_nested_name_specifier (cp_parser
*parser
)
18908 struct tree_check
*check_value
;
18909 deferred_access_check
*chk
;
18910 VEC (deferred_access_check
,gc
) *checks
;
18912 /* Get the stored value. */
18913 check_value
= cp_lexer_consume_token (parser
->lexer
)->u
.tree_check_value
;
18914 /* Perform any access checks that were deferred. */
18915 checks
= check_value
->checks
;
18919 VEC_iterate (deferred_access_check
, checks
, i
, chk
) ;
18922 perform_or_defer_access_check (chk
->binfo
,
18927 /* Set the scope from the stored value. */
18928 parser
->scope
= check_value
->value
;
18929 parser
->qualifying_scope
= check_value
->qualifying_scope
;
18930 parser
->object_scope
= NULL_TREE
;
18933 /* Consume tokens up through a non-nested END token. Returns TRUE if we
18934 encounter the end of a block before what we were looking for. */
18937 cp_parser_cache_group (cp_parser
*parser
,
18938 enum cpp_ttype end
,
18943 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
18945 /* Abort a parenthesized expression if we encounter a semicolon. */
18946 if ((end
== CPP_CLOSE_PAREN
|| depth
== 0)
18947 && token
->type
== CPP_SEMICOLON
)
18949 /* If we've reached the end of the file, stop. */
18950 if (token
->type
== CPP_EOF
18951 || (end
!= CPP_PRAGMA_EOL
18952 && token
->type
== CPP_PRAGMA_EOL
))
18954 if (token
->type
== CPP_CLOSE_BRACE
&& depth
== 0)
18955 /* We've hit the end of an enclosing block, so there's been some
18956 kind of syntax error. */
18959 /* Consume the token. */
18960 cp_lexer_consume_token (parser
->lexer
);
18961 /* See if it starts a new group. */
18962 if (token
->type
== CPP_OPEN_BRACE
)
18964 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, depth
+ 1);
18965 /* In theory this should probably check end == '}', but
18966 cp_parser_save_member_function_body needs it to exit
18967 after either '}' or ')' when called with ')'. */
18971 else if (token
->type
== CPP_OPEN_PAREN
)
18973 cp_parser_cache_group (parser
, CPP_CLOSE_PAREN
, depth
+ 1);
18974 if (depth
== 0 && end
== CPP_CLOSE_PAREN
)
18977 else if (token
->type
== CPP_PRAGMA
)
18978 cp_parser_cache_group (parser
, CPP_PRAGMA_EOL
, depth
+ 1);
18979 else if (token
->type
== end
)
18984 /* Begin parsing tentatively. We always save tokens while parsing
18985 tentatively so that if the tentative parsing fails we can restore the
18989 cp_parser_parse_tentatively (cp_parser
* parser
)
18991 /* Enter a new parsing context. */
18992 parser
->context
= cp_parser_context_new (parser
->context
);
18993 /* Begin saving tokens. */
18994 cp_lexer_save_tokens (parser
->lexer
);
18995 /* In order to avoid repetitive access control error messages,
18996 access checks are queued up until we are no longer parsing
18998 push_deferring_access_checks (dk_deferred
);
19001 /* Commit to the currently active tentative parse. */
19004 cp_parser_commit_to_tentative_parse (cp_parser
* parser
)
19006 cp_parser_context
*context
;
19009 /* Mark all of the levels as committed. */
19010 lexer
= parser
->lexer
;
19011 for (context
= parser
->context
; context
->next
; context
= context
->next
)
19013 if (context
->status
== CP_PARSER_STATUS_KIND_COMMITTED
)
19015 context
->status
= CP_PARSER_STATUS_KIND_COMMITTED
;
19016 while (!cp_lexer_saving_tokens (lexer
))
19017 lexer
= lexer
->next
;
19018 cp_lexer_commit_tokens (lexer
);
19022 /* Abort the currently active tentative parse. All consumed tokens
19023 will be rolled back, and no diagnostics will be issued. */
19026 cp_parser_abort_tentative_parse (cp_parser
* parser
)
19028 cp_parser_simulate_error (parser
);
19029 /* Now, pretend that we want to see if the construct was
19030 successfully parsed. */
19031 cp_parser_parse_definitely (parser
);
19034 /* Stop parsing tentatively. If a parse error has occurred, restore the
19035 token stream. Otherwise, commit to the tokens we have consumed.
19036 Returns true if no error occurred; false otherwise. */
19039 cp_parser_parse_definitely (cp_parser
* parser
)
19041 bool error_occurred
;
19042 cp_parser_context
*context
;
19044 /* Remember whether or not an error occurred, since we are about to
19045 destroy that information. */
19046 error_occurred
= cp_parser_error_occurred (parser
);
19047 /* Remove the topmost context from the stack. */
19048 context
= parser
->context
;
19049 parser
->context
= context
->next
;
19050 /* If no parse errors occurred, commit to the tentative parse. */
19051 if (!error_occurred
)
19053 /* Commit to the tokens read tentatively, unless that was
19055 if (context
->status
!= CP_PARSER_STATUS_KIND_COMMITTED
)
19056 cp_lexer_commit_tokens (parser
->lexer
);
19058 pop_to_parent_deferring_access_checks ();
19060 /* Otherwise, if errors occurred, roll back our state so that things
19061 are just as they were before we began the tentative parse. */
19064 cp_lexer_rollback_tokens (parser
->lexer
);
19065 pop_deferring_access_checks ();
19067 /* Add the context to the front of the free list. */
19068 context
->next
= cp_parser_context_free_list
;
19069 cp_parser_context_free_list
= context
;
19071 return !error_occurred
;
19074 /* Returns true if we are parsing tentatively and are not committed to
19075 this tentative parse. */
19078 cp_parser_uncommitted_to_tentative_parse_p (cp_parser
* parser
)
19080 return (cp_parser_parsing_tentatively (parser
)
19081 && parser
->context
->status
!= CP_PARSER_STATUS_KIND_COMMITTED
);
19084 /* Returns nonzero iff an error has occurred during the most recent
19085 tentative parse. */
19088 cp_parser_error_occurred (cp_parser
* parser
)
19090 return (cp_parser_parsing_tentatively (parser
)
19091 && parser
->context
->status
== CP_PARSER_STATUS_KIND_ERROR
);
19094 /* Returns nonzero if GNU extensions are allowed. */
19097 cp_parser_allow_gnu_extensions_p (cp_parser
* parser
)
19099 return parser
->allow_gnu_extensions_p
;
19102 /* Objective-C++ Productions */
19105 /* Parse an Objective-C expression, which feeds into a primary-expression
19109 objc-message-expression
19110 objc-string-literal
19111 objc-encode-expression
19112 objc-protocol-expression
19113 objc-selector-expression
19115 Returns a tree representation of the expression. */
19118 cp_parser_objc_expression (cp_parser
* parser
)
19120 /* Try to figure out what kind of declaration is present. */
19121 cp_token
*kwd
= cp_lexer_peek_token (parser
->lexer
);
19125 case CPP_OPEN_SQUARE
:
19126 return cp_parser_objc_message_expression (parser
);
19128 case CPP_OBJC_STRING
:
19129 kwd
= cp_lexer_consume_token (parser
->lexer
);
19130 return objc_build_string_object (kwd
->u
.value
);
19133 switch (kwd
->keyword
)
19135 case RID_AT_ENCODE
:
19136 return cp_parser_objc_encode_expression (parser
);
19138 case RID_AT_PROTOCOL
:
19139 return cp_parser_objc_protocol_expression (parser
);
19141 case RID_AT_SELECTOR
:
19142 return cp_parser_objc_selector_expression (parser
);
19148 error ("%Hmisplaced %<@%D%> Objective-C++ construct",
19149 &kwd
->location
, kwd
->u
.value
);
19150 cp_parser_skip_to_end_of_block_or_statement (parser
);
19153 return error_mark_node
;
19156 /* Parse an Objective-C message expression.
19158 objc-message-expression:
19159 [ objc-message-receiver objc-message-args ]
19161 Returns a representation of an Objective-C message. */
19164 cp_parser_objc_message_expression (cp_parser
* parser
)
19166 tree receiver
, messageargs
;
19168 cp_lexer_consume_token (parser
->lexer
); /* Eat '['. */
19169 receiver
= cp_parser_objc_message_receiver (parser
);
19170 messageargs
= cp_parser_objc_message_args (parser
);
19171 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, "%<]%>");
19173 return objc_build_message_expr (build_tree_list (receiver
, messageargs
));
19176 /* Parse an objc-message-receiver.
19178 objc-message-receiver:
19180 simple-type-specifier
19182 Returns a representation of the type or expression. */
19185 cp_parser_objc_message_receiver (cp_parser
* parser
)
19189 /* An Objective-C message receiver may be either (1) a type
19190 or (2) an expression. */
19191 cp_parser_parse_tentatively (parser
);
19192 rcv
= cp_parser_expression (parser
, false, NULL
);
19194 if (cp_parser_parse_definitely (parser
))
19197 rcv
= cp_parser_simple_type_specifier (parser
,
19198 /*decl_specs=*/NULL
,
19199 CP_PARSER_FLAGS_NONE
);
19201 return objc_get_class_reference (rcv
);
19204 /* Parse the arguments and selectors comprising an Objective-C message.
19209 objc-selector-args , objc-comma-args
19211 objc-selector-args:
19212 objc-selector [opt] : assignment-expression
19213 objc-selector-args objc-selector [opt] : assignment-expression
19216 assignment-expression
19217 objc-comma-args , assignment-expression
19219 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
19220 selector arguments and TREE_VALUE containing a list of comma
19224 cp_parser_objc_message_args (cp_parser
* parser
)
19226 tree sel_args
= NULL_TREE
, addl_args
= NULL_TREE
;
19227 bool maybe_unary_selector_p
= true;
19228 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
19230 while (cp_parser_objc_selector_p (token
->type
) || token
->type
== CPP_COLON
)
19232 tree selector
= NULL_TREE
, arg
;
19234 if (token
->type
!= CPP_COLON
)
19235 selector
= cp_parser_objc_selector (parser
);
19237 /* Detect if we have a unary selector. */
19238 if (maybe_unary_selector_p
19239 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
19240 return build_tree_list (selector
, NULL_TREE
);
19242 maybe_unary_selector_p
= false;
19243 cp_parser_require (parser
, CPP_COLON
, "%<:%>");
19244 arg
= cp_parser_assignment_expression (parser
, false, NULL
);
19247 = chainon (sel_args
,
19248 build_tree_list (selector
, arg
));
19250 token
= cp_lexer_peek_token (parser
->lexer
);
19253 /* Handle non-selector arguments, if any. */
19254 while (token
->type
== CPP_COMMA
)
19258 cp_lexer_consume_token (parser
->lexer
);
19259 arg
= cp_parser_assignment_expression (parser
, false, NULL
);
19262 = chainon (addl_args
,
19263 build_tree_list (NULL_TREE
, arg
));
19265 token
= cp_lexer_peek_token (parser
->lexer
);
19268 return build_tree_list (sel_args
, addl_args
);
19271 /* Parse an Objective-C encode expression.
19273 objc-encode-expression:
19274 @encode objc-typename
19276 Returns an encoded representation of the type argument. */
19279 cp_parser_objc_encode_expression (cp_parser
* parser
)
19284 cp_lexer_consume_token (parser
->lexer
); /* Eat '@encode'. */
19285 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
19286 token
= cp_lexer_peek_token (parser
->lexer
);
19287 type
= complete_type (cp_parser_type_id (parser
));
19288 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
19292 error ("%H%<@encode%> must specify a type as an argument",
19294 return error_mark_node
;
19297 return objc_build_encode_expr (type
);
19300 /* Parse an Objective-C @defs expression. */
19303 cp_parser_objc_defs_expression (cp_parser
*parser
)
19307 cp_lexer_consume_token (parser
->lexer
); /* Eat '@defs'. */
19308 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
19309 name
= cp_parser_identifier (parser
);
19310 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
19312 return objc_get_class_ivars (name
);
19315 /* Parse an Objective-C protocol expression.
19317 objc-protocol-expression:
19318 @protocol ( identifier )
19320 Returns a representation of the protocol expression. */
19323 cp_parser_objc_protocol_expression (cp_parser
* parser
)
19327 cp_lexer_consume_token (parser
->lexer
); /* Eat '@protocol'. */
19328 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
19329 proto
= cp_parser_identifier (parser
);
19330 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
19332 return objc_build_protocol_expr (proto
);
19335 /* Parse an Objective-C selector expression.
19337 objc-selector-expression:
19338 @selector ( objc-method-signature )
19340 objc-method-signature:
19346 objc-selector-seq objc-selector :
19348 Returns a representation of the method selector. */
19351 cp_parser_objc_selector_expression (cp_parser
* parser
)
19353 tree sel_seq
= NULL_TREE
;
19354 bool maybe_unary_selector_p
= true;
19357 cp_lexer_consume_token (parser
->lexer
); /* Eat '@selector'. */
19358 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
19359 token
= cp_lexer_peek_token (parser
->lexer
);
19361 while (cp_parser_objc_selector_p (token
->type
) || token
->type
== CPP_COLON
19362 || token
->type
== CPP_SCOPE
)
19364 tree selector
= NULL_TREE
;
19366 if (token
->type
!= CPP_COLON
19367 || token
->type
== CPP_SCOPE
)
19368 selector
= cp_parser_objc_selector (parser
);
19370 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
)
19371 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_SCOPE
))
19373 /* Detect if we have a unary selector. */
19374 if (maybe_unary_selector_p
)
19376 sel_seq
= selector
;
19377 goto finish_selector
;
19381 cp_parser_error (parser
, "expected %<:%>");
19384 maybe_unary_selector_p
= false;
19385 token
= cp_lexer_consume_token (parser
->lexer
);
19387 if (token
->type
== CPP_SCOPE
)
19390 = chainon (sel_seq
,
19391 build_tree_list (selector
, NULL_TREE
));
19393 = chainon (sel_seq
,
19394 build_tree_list (NULL_TREE
, NULL_TREE
));
19398 = chainon (sel_seq
,
19399 build_tree_list (selector
, NULL_TREE
));
19401 token
= cp_lexer_peek_token (parser
->lexer
);
19405 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
19407 return objc_build_selector_expr (sel_seq
);
19410 /* Parse a list of identifiers.
19412 objc-identifier-list:
19414 objc-identifier-list , identifier
19416 Returns a TREE_LIST of identifier nodes. */
19419 cp_parser_objc_identifier_list (cp_parser
* parser
)
19421 tree list
= build_tree_list (NULL_TREE
, cp_parser_identifier (parser
));
19422 cp_token
*sep
= cp_lexer_peek_token (parser
->lexer
);
19424 while (sep
->type
== CPP_COMMA
)
19426 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
19427 list
= chainon (list
,
19428 build_tree_list (NULL_TREE
,
19429 cp_parser_identifier (parser
)));
19430 sep
= cp_lexer_peek_token (parser
->lexer
);
19436 /* Parse an Objective-C alias declaration.
19438 objc-alias-declaration:
19439 @compatibility_alias identifier identifier ;
19441 This function registers the alias mapping with the Objective-C front end.
19442 It returns nothing. */
19445 cp_parser_objc_alias_declaration (cp_parser
* parser
)
19449 cp_lexer_consume_token (parser
->lexer
); /* Eat '@compatibility_alias'. */
19450 alias
= cp_parser_identifier (parser
);
19451 orig
= cp_parser_identifier (parser
);
19452 objc_declare_alias (alias
, orig
);
19453 cp_parser_consume_semicolon_at_end_of_statement (parser
);
19456 /* Parse an Objective-C class forward-declaration.
19458 objc-class-declaration:
19459 @class objc-identifier-list ;
19461 The function registers the forward declarations with the Objective-C
19462 front end. It returns nothing. */
19465 cp_parser_objc_class_declaration (cp_parser
* parser
)
19467 cp_lexer_consume_token (parser
->lexer
); /* Eat '@class'. */
19468 objc_declare_class (cp_parser_objc_identifier_list (parser
));
19469 cp_parser_consume_semicolon_at_end_of_statement (parser
);
19472 /* Parse a list of Objective-C protocol references.
19474 objc-protocol-refs-opt:
19475 objc-protocol-refs [opt]
19477 objc-protocol-refs:
19478 < objc-identifier-list >
19480 Returns a TREE_LIST of identifiers, if any. */
19483 cp_parser_objc_protocol_refs_opt (cp_parser
* parser
)
19485 tree protorefs
= NULL_TREE
;
19487 if(cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
19489 cp_lexer_consume_token (parser
->lexer
); /* Eat '<'. */
19490 protorefs
= cp_parser_objc_identifier_list (parser
);
19491 cp_parser_require (parser
, CPP_GREATER
, "%<>%>");
19497 /* Parse a Objective-C visibility specification. */
19500 cp_parser_objc_visibility_spec (cp_parser
* parser
)
19502 cp_token
*vis
= cp_lexer_peek_token (parser
->lexer
);
19504 switch (vis
->keyword
)
19506 case RID_AT_PRIVATE
:
19507 objc_set_visibility (2);
19509 case RID_AT_PROTECTED
:
19510 objc_set_visibility (0);
19512 case RID_AT_PUBLIC
:
19513 objc_set_visibility (1);
19519 /* Eat '@private'/'@protected'/'@public'. */
19520 cp_lexer_consume_token (parser
->lexer
);
19523 /* Parse an Objective-C method type. */
19526 cp_parser_objc_method_type (cp_parser
* parser
)
19528 objc_set_method_type
19529 (cp_lexer_consume_token (parser
->lexer
)->type
== CPP_PLUS
19534 /* Parse an Objective-C protocol qualifier. */
19537 cp_parser_objc_protocol_qualifiers (cp_parser
* parser
)
19539 tree quals
= NULL_TREE
, node
;
19540 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
19542 node
= token
->u
.value
;
19544 while (node
&& TREE_CODE (node
) == IDENTIFIER_NODE
19545 && (node
== ridpointers
[(int) RID_IN
]
19546 || node
== ridpointers
[(int) RID_OUT
]
19547 || node
== ridpointers
[(int) RID_INOUT
]
19548 || node
== ridpointers
[(int) RID_BYCOPY
]
19549 || node
== ridpointers
[(int) RID_BYREF
]
19550 || node
== ridpointers
[(int) RID_ONEWAY
]))
19552 quals
= tree_cons (NULL_TREE
, node
, quals
);
19553 cp_lexer_consume_token (parser
->lexer
);
19554 token
= cp_lexer_peek_token (parser
->lexer
);
19555 node
= token
->u
.value
;
19561 /* Parse an Objective-C typename. */
19564 cp_parser_objc_typename (cp_parser
* parser
)
19566 tree type_name
= NULL_TREE
;
19568 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
19570 tree proto_quals
, cp_type
= NULL_TREE
;
19572 cp_lexer_consume_token (parser
->lexer
); /* Eat '('. */
19573 proto_quals
= cp_parser_objc_protocol_qualifiers (parser
);
19575 /* An ObjC type name may consist of just protocol qualifiers, in which
19576 case the type shall default to 'id'. */
19577 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
19578 cp_type
= cp_parser_type_id (parser
);
19580 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
19581 type_name
= build_tree_list (proto_quals
, cp_type
);
19587 /* Check to see if TYPE refers to an Objective-C selector name. */
19590 cp_parser_objc_selector_p (enum cpp_ttype type
)
19592 return (type
== CPP_NAME
|| type
== CPP_KEYWORD
19593 || type
== CPP_AND_AND
|| type
== CPP_AND_EQ
|| type
== CPP_AND
19594 || type
== CPP_OR
|| type
== CPP_COMPL
|| type
== CPP_NOT
19595 || type
== CPP_NOT_EQ
|| type
== CPP_OR_OR
|| type
== CPP_OR_EQ
19596 || type
== CPP_XOR
|| type
== CPP_XOR_EQ
);
19599 /* Parse an Objective-C selector. */
19602 cp_parser_objc_selector (cp_parser
* parser
)
19604 cp_token
*token
= cp_lexer_consume_token (parser
->lexer
);
19606 if (!cp_parser_objc_selector_p (token
->type
))
19608 error ("%Hinvalid Objective-C++ selector name", &token
->location
);
19609 return error_mark_node
;
19612 /* C++ operator names are allowed to appear in ObjC selectors. */
19613 switch (token
->type
)
19615 case CPP_AND_AND
: return get_identifier ("and");
19616 case CPP_AND_EQ
: return get_identifier ("and_eq");
19617 case CPP_AND
: return get_identifier ("bitand");
19618 case CPP_OR
: return get_identifier ("bitor");
19619 case CPP_COMPL
: return get_identifier ("compl");
19620 case CPP_NOT
: return get_identifier ("not");
19621 case CPP_NOT_EQ
: return get_identifier ("not_eq");
19622 case CPP_OR_OR
: return get_identifier ("or");
19623 case CPP_OR_EQ
: return get_identifier ("or_eq");
19624 case CPP_XOR
: return get_identifier ("xor");
19625 case CPP_XOR_EQ
: return get_identifier ("xor_eq");
19626 default: return token
->u
.value
;
19630 /* Parse an Objective-C params list. */
19633 cp_parser_objc_method_keyword_params (cp_parser
* parser
)
19635 tree params
= NULL_TREE
;
19636 bool maybe_unary_selector_p
= true;
19637 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
19639 while (cp_parser_objc_selector_p (token
->type
) || token
->type
== CPP_COLON
)
19641 tree selector
= NULL_TREE
, type_name
, identifier
;
19643 if (token
->type
!= CPP_COLON
)
19644 selector
= cp_parser_objc_selector (parser
);
19646 /* Detect if we have a unary selector. */
19647 if (maybe_unary_selector_p
19648 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
19651 maybe_unary_selector_p
= false;
19652 cp_parser_require (parser
, CPP_COLON
, "%<:%>");
19653 type_name
= cp_parser_objc_typename (parser
);
19654 identifier
= cp_parser_identifier (parser
);
19658 objc_build_keyword_decl (selector
,
19662 token
= cp_lexer_peek_token (parser
->lexer
);
19668 /* Parse the non-keyword Objective-C params. */
19671 cp_parser_objc_method_tail_params_opt (cp_parser
* parser
, bool *ellipsisp
)
19673 tree params
= make_node (TREE_LIST
);
19674 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
19675 *ellipsisp
= false; /* Initially, assume no ellipsis. */
19677 while (token
->type
== CPP_COMMA
)
19679 cp_parameter_declarator
*parmdecl
;
19682 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
19683 token
= cp_lexer_peek_token (parser
->lexer
);
19685 if (token
->type
== CPP_ELLIPSIS
)
19687 cp_lexer_consume_token (parser
->lexer
); /* Eat '...'. */
19692 parmdecl
= cp_parser_parameter_declaration (parser
, false, NULL
);
19693 parm
= grokdeclarator (parmdecl
->declarator
,
19694 &parmdecl
->decl_specifiers
,
19695 PARM
, /*initialized=*/0,
19696 /*attrlist=*/NULL
);
19698 chainon (params
, build_tree_list (NULL_TREE
, parm
));
19699 token
= cp_lexer_peek_token (parser
->lexer
);
19705 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
19708 cp_parser_objc_interstitial_code (cp_parser
* parser
)
19710 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
19712 /* If the next token is `extern' and the following token is a string
19713 literal, then we have a linkage specification. */
19714 if (token
->keyword
== RID_EXTERN
19715 && cp_parser_is_string_literal (cp_lexer_peek_nth_token (parser
->lexer
, 2)))
19716 cp_parser_linkage_specification (parser
);
19717 /* Handle #pragma, if any. */
19718 else if (token
->type
== CPP_PRAGMA
)
19719 cp_parser_pragma (parser
, pragma_external
);
19720 /* Allow stray semicolons. */
19721 else if (token
->type
== CPP_SEMICOLON
)
19722 cp_lexer_consume_token (parser
->lexer
);
19723 /* Finally, try to parse a block-declaration, or a function-definition. */
19725 cp_parser_block_declaration (parser
, /*statement_p=*/false);
19728 /* Parse a method signature. */
19731 cp_parser_objc_method_signature (cp_parser
* parser
)
19733 tree rettype
, kwdparms
, optparms
;
19734 bool ellipsis
= false;
19736 cp_parser_objc_method_type (parser
);
19737 rettype
= cp_parser_objc_typename (parser
);
19738 kwdparms
= cp_parser_objc_method_keyword_params (parser
);
19739 optparms
= cp_parser_objc_method_tail_params_opt (parser
, &ellipsis
);
19741 return objc_build_method_signature (rettype
, kwdparms
, optparms
, ellipsis
);
19744 /* Pars an Objective-C method prototype list. */
19747 cp_parser_objc_method_prototype_list (cp_parser
* parser
)
19749 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
19751 while (token
->keyword
!= RID_AT_END
)
19753 if (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
)
19755 objc_add_method_declaration
19756 (cp_parser_objc_method_signature (parser
));
19757 cp_parser_consume_semicolon_at_end_of_statement (parser
);
19760 /* Allow for interspersed non-ObjC++ code. */
19761 cp_parser_objc_interstitial_code (parser
);
19763 token
= cp_lexer_peek_token (parser
->lexer
);
19766 cp_lexer_consume_token (parser
->lexer
); /* Eat '@end'. */
19767 objc_finish_interface ();
19770 /* Parse an Objective-C method definition list. */
19773 cp_parser_objc_method_definition_list (cp_parser
* parser
)
19775 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
19777 while (token
->keyword
!= RID_AT_END
)
19781 if (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
)
19783 push_deferring_access_checks (dk_deferred
);
19784 objc_start_method_definition
19785 (cp_parser_objc_method_signature (parser
));
19787 /* For historical reasons, we accept an optional semicolon. */
19788 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
19789 cp_lexer_consume_token (parser
->lexer
);
19791 perform_deferred_access_checks ();
19792 stop_deferring_access_checks ();
19793 meth
= cp_parser_function_definition_after_declarator (parser
,
19795 pop_deferring_access_checks ();
19796 objc_finish_method_definition (meth
);
19799 /* Allow for interspersed non-ObjC++ code. */
19800 cp_parser_objc_interstitial_code (parser
);
19802 token
= cp_lexer_peek_token (parser
->lexer
);
19805 cp_lexer_consume_token (parser
->lexer
); /* Eat '@end'. */
19806 objc_finish_implementation ();
19809 /* Parse Objective-C ivars. */
19812 cp_parser_objc_class_ivars (cp_parser
* parser
)
19814 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
19816 if (token
->type
!= CPP_OPEN_BRACE
)
19817 return; /* No ivars specified. */
19819 cp_lexer_consume_token (parser
->lexer
); /* Eat '{'. */
19820 token
= cp_lexer_peek_token (parser
->lexer
);
19822 while (token
->type
!= CPP_CLOSE_BRACE
)
19824 cp_decl_specifier_seq declspecs
;
19825 int decl_class_or_enum_p
;
19826 tree prefix_attributes
;
19828 cp_parser_objc_visibility_spec (parser
);
19830 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
19833 cp_parser_decl_specifier_seq (parser
,
19834 CP_PARSER_FLAGS_OPTIONAL
,
19836 &decl_class_or_enum_p
);
19837 prefix_attributes
= declspecs
.attributes
;
19838 declspecs
.attributes
= NULL_TREE
;
19840 /* Keep going until we hit the `;' at the end of the
19842 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
19844 tree width
= NULL_TREE
, attributes
, first_attribute
, decl
;
19845 cp_declarator
*declarator
= NULL
;
19846 int ctor_dtor_or_conv_p
;
19848 /* Check for a (possibly unnamed) bitfield declaration. */
19849 token
= cp_lexer_peek_token (parser
->lexer
);
19850 if (token
->type
== CPP_COLON
)
19853 if (token
->type
== CPP_NAME
19854 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
19857 /* Get the name of the bitfield. */
19858 declarator
= make_id_declarator (NULL_TREE
,
19859 cp_parser_identifier (parser
),
19863 cp_lexer_consume_token (parser
->lexer
); /* Eat ':'. */
19864 /* Get the width of the bitfield. */
19866 = cp_parser_constant_expression (parser
,
19867 /*allow_non_constant=*/false,
19872 /* Parse the declarator. */
19874 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
19875 &ctor_dtor_or_conv_p
,
19876 /*parenthesized_p=*/NULL
,
19877 /*member_p=*/false);
19880 /* Look for attributes that apply to the ivar. */
19881 attributes
= cp_parser_attributes_opt (parser
);
19882 /* Remember which attributes are prefix attributes and
19884 first_attribute
= attributes
;
19885 /* Combine the attributes. */
19886 attributes
= chainon (prefix_attributes
, attributes
);
19889 /* Create the bitfield declaration. */
19890 decl
= grokbitfield (declarator
, &declspecs
,
19894 decl
= grokfield (declarator
, &declspecs
,
19895 NULL_TREE
, /*init_const_expr_p=*/false,
19896 NULL_TREE
, attributes
);
19898 /* Add the instance variable. */
19899 objc_add_instance_variable (decl
);
19901 /* Reset PREFIX_ATTRIBUTES. */
19902 while (attributes
&& TREE_CHAIN (attributes
) != first_attribute
)
19903 attributes
= TREE_CHAIN (attributes
);
19905 TREE_CHAIN (attributes
) = NULL_TREE
;
19907 token
= cp_lexer_peek_token (parser
->lexer
);
19909 if (token
->type
== CPP_COMMA
)
19911 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
19917 cp_parser_consume_semicolon_at_end_of_statement (parser
);
19918 token
= cp_lexer_peek_token (parser
->lexer
);
19921 cp_lexer_consume_token (parser
->lexer
); /* Eat '}'. */
19922 /* For historical reasons, we accept an optional semicolon. */
19923 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
19924 cp_lexer_consume_token (parser
->lexer
);
19927 /* Parse an Objective-C protocol declaration. */
19930 cp_parser_objc_protocol_declaration (cp_parser
* parser
)
19932 tree proto
, protorefs
;
19935 cp_lexer_consume_token (parser
->lexer
); /* Eat '@protocol'. */
19936 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
))
19938 tok
= cp_lexer_peek_token (parser
->lexer
);
19939 error ("%Hidentifier expected after %<@protocol%>", &tok
->location
);
19943 /* See if we have a forward declaration or a definition. */
19944 tok
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
19946 /* Try a forward declaration first. */
19947 if (tok
->type
== CPP_COMMA
|| tok
->type
== CPP_SEMICOLON
)
19949 objc_declare_protocols (cp_parser_objc_identifier_list (parser
));
19951 cp_parser_consume_semicolon_at_end_of_statement (parser
);
19954 /* Ok, we got a full-fledged definition (or at least should). */
19957 proto
= cp_parser_identifier (parser
);
19958 protorefs
= cp_parser_objc_protocol_refs_opt (parser
);
19959 objc_start_protocol (proto
, protorefs
);
19960 cp_parser_objc_method_prototype_list (parser
);
19964 /* Parse an Objective-C superclass or category. */
19967 cp_parser_objc_superclass_or_category (cp_parser
*parser
, tree
*super
,
19970 cp_token
*next
= cp_lexer_peek_token (parser
->lexer
);
19972 *super
= *categ
= NULL_TREE
;
19973 if (next
->type
== CPP_COLON
)
19975 cp_lexer_consume_token (parser
->lexer
); /* Eat ':'. */
19976 *super
= cp_parser_identifier (parser
);
19978 else if (next
->type
== CPP_OPEN_PAREN
)
19980 cp_lexer_consume_token (parser
->lexer
); /* Eat '('. */
19981 *categ
= cp_parser_identifier (parser
);
19982 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
19986 /* Parse an Objective-C class interface. */
19989 cp_parser_objc_class_interface (cp_parser
* parser
)
19991 tree name
, super
, categ
, protos
;
19993 cp_lexer_consume_token (parser
->lexer
); /* Eat '@interface'. */
19994 name
= cp_parser_identifier (parser
);
19995 cp_parser_objc_superclass_or_category (parser
, &super
, &categ
);
19996 protos
= cp_parser_objc_protocol_refs_opt (parser
);
19998 /* We have either a class or a category on our hands. */
20000 objc_start_category_interface (name
, categ
, protos
);
20003 objc_start_class_interface (name
, super
, protos
);
20004 /* Handle instance variable declarations, if any. */
20005 cp_parser_objc_class_ivars (parser
);
20006 objc_continue_interface ();
20009 cp_parser_objc_method_prototype_list (parser
);
20012 /* Parse an Objective-C class implementation. */
20015 cp_parser_objc_class_implementation (cp_parser
* parser
)
20017 tree name
, super
, categ
;
20019 cp_lexer_consume_token (parser
->lexer
); /* Eat '@implementation'. */
20020 name
= cp_parser_identifier (parser
);
20021 cp_parser_objc_superclass_or_category (parser
, &super
, &categ
);
20023 /* We have either a class or a category on our hands. */
20025 objc_start_category_implementation (name
, categ
);
20028 objc_start_class_implementation (name
, super
);
20029 /* Handle instance variable declarations, if any. */
20030 cp_parser_objc_class_ivars (parser
);
20031 objc_continue_implementation ();
20034 cp_parser_objc_method_definition_list (parser
);
20037 /* Consume the @end token and finish off the implementation. */
20040 cp_parser_objc_end_implementation (cp_parser
* parser
)
20042 cp_lexer_consume_token (parser
->lexer
); /* Eat '@end'. */
20043 objc_finish_implementation ();
20046 /* Parse an Objective-C declaration. */
20049 cp_parser_objc_declaration (cp_parser
* parser
)
20051 /* Try to figure out what kind of declaration is present. */
20052 cp_token
*kwd
= cp_lexer_peek_token (parser
->lexer
);
20054 switch (kwd
->keyword
)
20057 cp_parser_objc_alias_declaration (parser
);
20060 cp_parser_objc_class_declaration (parser
);
20062 case RID_AT_PROTOCOL
:
20063 cp_parser_objc_protocol_declaration (parser
);
20065 case RID_AT_INTERFACE
:
20066 cp_parser_objc_class_interface (parser
);
20068 case RID_AT_IMPLEMENTATION
:
20069 cp_parser_objc_class_implementation (parser
);
20072 cp_parser_objc_end_implementation (parser
);
20075 error ("%Hmisplaced %<@%D%> Objective-C++ construct",
20076 &kwd
->location
, kwd
->u
.value
);
20077 cp_parser_skip_to_end_of_block_or_statement (parser
);
20081 /* Parse an Objective-C try-catch-finally statement.
20083 objc-try-catch-finally-stmt:
20084 @try compound-statement objc-catch-clause-seq [opt]
20085 objc-finally-clause [opt]
20087 objc-catch-clause-seq:
20088 objc-catch-clause objc-catch-clause-seq [opt]
20091 @catch ( exception-declaration ) compound-statement
20093 objc-finally-clause
20094 @finally compound-statement
20096 Returns NULL_TREE. */
20099 cp_parser_objc_try_catch_finally_statement (cp_parser
*parser
) {
20100 location_t location
;
20103 cp_parser_require_keyword (parser
, RID_AT_TRY
, "%<@try%>");
20104 location
= cp_lexer_peek_token (parser
->lexer
)->location
;
20105 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
20106 node, lest it get absorbed into the surrounding block. */
20107 stmt
= push_stmt_list ();
20108 cp_parser_compound_statement (parser
, NULL
, false);
20109 objc_begin_try_stmt (location
, pop_stmt_list (stmt
));
20111 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AT_CATCH
))
20113 cp_parameter_declarator
*parmdecl
;
20116 cp_lexer_consume_token (parser
->lexer
);
20117 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
20118 parmdecl
= cp_parser_parameter_declaration (parser
, false, NULL
);
20119 parm
= grokdeclarator (parmdecl
->declarator
,
20120 &parmdecl
->decl_specifiers
,
20121 PARM
, /*initialized=*/0,
20122 /*attrlist=*/NULL
);
20123 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
20124 objc_begin_catch_clause (parm
);
20125 cp_parser_compound_statement (parser
, NULL
, false);
20126 objc_finish_catch_clause ();
20129 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AT_FINALLY
))
20131 cp_lexer_consume_token (parser
->lexer
);
20132 location
= cp_lexer_peek_token (parser
->lexer
)->location
;
20133 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
20134 node, lest it get absorbed into the surrounding block. */
20135 stmt
= push_stmt_list ();
20136 cp_parser_compound_statement (parser
, NULL
, false);
20137 objc_build_finally_clause (location
, pop_stmt_list (stmt
));
20140 return objc_finish_try_stmt ();
20143 /* Parse an Objective-C synchronized statement.
20145 objc-synchronized-stmt:
20146 @synchronized ( expression ) compound-statement
20148 Returns NULL_TREE. */
20151 cp_parser_objc_synchronized_statement (cp_parser
*parser
) {
20152 location_t location
;
20155 cp_parser_require_keyword (parser
, RID_AT_SYNCHRONIZED
, "%<@synchronized%>");
20157 location
= cp_lexer_peek_token (parser
->lexer
)->location
;
20158 cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>");
20159 lock
= cp_parser_expression (parser
, false, NULL
);
20160 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
20162 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
20163 node, lest it get absorbed into the surrounding block. */
20164 stmt
= push_stmt_list ();
20165 cp_parser_compound_statement (parser
, NULL
, false);
20167 return objc_build_synchronized (location
, lock
, pop_stmt_list (stmt
));
20170 /* Parse an Objective-C throw statement.
20173 @throw assignment-expression [opt] ;
20175 Returns a constructed '@throw' statement. */
20178 cp_parser_objc_throw_statement (cp_parser
*parser
) {
20179 tree expr
= NULL_TREE
;
20181 cp_parser_require_keyword (parser
, RID_AT_THROW
, "%<@throw%>");
20183 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
20184 expr
= cp_parser_assignment_expression (parser
, false, NULL
);
20186 cp_parser_consume_semicolon_at_end_of_statement (parser
);
20188 return objc_build_throw_stmt (expr
);
20191 /* Parse an Objective-C statement. */
20194 cp_parser_objc_statement (cp_parser
* parser
) {
20195 /* Try to figure out what kind of declaration is present. */
20196 cp_token
*kwd
= cp_lexer_peek_token (parser
->lexer
);
20198 switch (kwd
->keyword
)
20201 return cp_parser_objc_try_catch_finally_statement (parser
);
20202 case RID_AT_SYNCHRONIZED
:
20203 return cp_parser_objc_synchronized_statement (parser
);
20205 return cp_parser_objc_throw_statement (parser
);
20207 error ("%Hmisplaced %<@%D%> Objective-C++ construct",
20208 &kwd
->location
, kwd
->u
.value
);
20209 cp_parser_skip_to_end_of_block_or_statement (parser
);
20212 return error_mark_node
;
20215 /* OpenMP 2.5 parsing routines. */
20217 /* Returns name of the next clause.
20218 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
20219 the token is not consumed. Otherwise appropriate pragma_omp_clause is
20220 returned and the token is consumed. */
20222 static pragma_omp_clause
20223 cp_parser_omp_clause_name (cp_parser
*parser
)
20225 pragma_omp_clause result
= PRAGMA_OMP_CLAUSE_NONE
;
20227 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_IF
))
20228 result
= PRAGMA_OMP_CLAUSE_IF
;
20229 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_DEFAULT
))
20230 result
= PRAGMA_OMP_CLAUSE_DEFAULT
;
20231 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_PRIVATE
))
20232 result
= PRAGMA_OMP_CLAUSE_PRIVATE
;
20233 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
20235 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
20236 const char *p
= IDENTIFIER_POINTER (id
);
20241 if (!strcmp ("collapse", p
))
20242 result
= PRAGMA_OMP_CLAUSE_COLLAPSE
;
20243 else if (!strcmp ("copyin", p
))
20244 result
= PRAGMA_OMP_CLAUSE_COPYIN
;
20245 else if (!strcmp ("copyprivate", p
))
20246 result
= PRAGMA_OMP_CLAUSE_COPYPRIVATE
;
20249 if (!strcmp ("firstprivate", p
))
20250 result
= PRAGMA_OMP_CLAUSE_FIRSTPRIVATE
;
20253 if (!strcmp ("lastprivate", p
))
20254 result
= PRAGMA_OMP_CLAUSE_LASTPRIVATE
;
20257 if (!strcmp ("nowait", p
))
20258 result
= PRAGMA_OMP_CLAUSE_NOWAIT
;
20259 else if (!strcmp ("num_threads", p
))
20260 result
= PRAGMA_OMP_CLAUSE_NUM_THREADS
;
20263 if (!strcmp ("ordered", p
))
20264 result
= PRAGMA_OMP_CLAUSE_ORDERED
;
20267 if (!strcmp ("reduction", p
))
20268 result
= PRAGMA_OMP_CLAUSE_REDUCTION
;
20271 if (!strcmp ("schedule", p
))
20272 result
= PRAGMA_OMP_CLAUSE_SCHEDULE
;
20273 else if (!strcmp ("shared", p
))
20274 result
= PRAGMA_OMP_CLAUSE_SHARED
;
20277 if (!strcmp ("untied", p
))
20278 result
= PRAGMA_OMP_CLAUSE_UNTIED
;
20283 if (result
!= PRAGMA_OMP_CLAUSE_NONE
)
20284 cp_lexer_consume_token (parser
->lexer
);
20289 /* Validate that a clause of the given type does not already exist. */
20292 check_no_duplicate_clause (tree clauses
, enum omp_clause_code code
,
20293 const char *name
, location_t location
)
20297 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
20298 if (OMP_CLAUSE_CODE (c
) == code
)
20300 error ("%Htoo many %qs clauses", &location
, name
);
20308 variable-list , identifier
20310 In addition, we match a closing parenthesis. An opening parenthesis
20311 will have been consumed by the caller.
20313 If KIND is nonzero, create the appropriate node and install the decl
20314 in OMP_CLAUSE_DECL and add the node to the head of the list.
20316 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
20317 return the list created. */
20320 cp_parser_omp_var_list_no_open (cp_parser
*parser
, enum omp_clause_code kind
,
20328 token
= cp_lexer_peek_token (parser
->lexer
);
20329 name
= cp_parser_id_expression (parser
, /*template_p=*/false,
20330 /*check_dependency_p=*/true,
20331 /*template_p=*/NULL
,
20332 /*declarator_p=*/false,
20333 /*optional_p=*/false);
20334 if (name
== error_mark_node
)
20337 decl
= cp_parser_lookup_name_simple (parser
, name
, token
->location
);
20338 if (decl
== error_mark_node
)
20339 cp_parser_name_lookup_error (parser
, name
, decl
, NULL
, token
->location
);
20340 else if (kind
!= 0)
20342 tree u
= build_omp_clause (kind
);
20343 OMP_CLAUSE_DECL (u
) = decl
;
20344 OMP_CLAUSE_CHAIN (u
) = list
;
20348 list
= tree_cons (decl
, NULL_TREE
, list
);
20351 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
20353 cp_lexer_consume_token (parser
->lexer
);
20356 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>"))
20360 /* Try to resync to an unnested comma. Copied from
20361 cp_parser_parenthesized_expression_list. */
20363 ending
= cp_parser_skip_to_closing_parenthesis (parser
,
20364 /*recovering=*/true,
20366 /*consume_paren=*/true);
20374 /* Similarly, but expect leading and trailing parenthesis. This is a very
20375 common case for omp clauses. */
20378 cp_parser_omp_var_list (cp_parser
*parser
, enum omp_clause_code kind
, tree list
)
20380 if (cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>"))
20381 return cp_parser_omp_var_list_no_open (parser
, kind
, list
);
20386 collapse ( constant-expression ) */
20389 cp_parser_omp_clause_collapse (cp_parser
*parser
, tree list
, location_t location
)
20395 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
20396 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>"))
20399 num
= cp_parser_constant_expression (parser
, false, NULL
);
20401 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>"))
20402 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
20403 /*or_comma=*/false,
20404 /*consume_paren=*/true);
20406 if (num
== error_mark_node
)
20408 num
= fold_non_dependent_expr (num
);
20409 if (!INTEGRAL_TYPE_P (TREE_TYPE (num
))
20410 || !host_integerp (num
, 0)
20411 || (n
= tree_low_cst (num
, 0)) <= 0
20414 error ("%Hcollapse argument needs positive constant integer expression",
20419 check_no_duplicate_clause (list
, OMP_CLAUSE_COLLAPSE
, "collapse", location
);
20420 c
= build_omp_clause (OMP_CLAUSE_COLLAPSE
);
20421 OMP_CLAUSE_CHAIN (c
) = list
;
20422 OMP_CLAUSE_COLLAPSE_EXPR (c
) = num
;
20428 default ( shared | none ) */
20431 cp_parser_omp_clause_default (cp_parser
*parser
, tree list
, location_t location
)
20433 enum omp_clause_default_kind kind
= OMP_CLAUSE_DEFAULT_UNSPECIFIED
;
20436 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>"))
20438 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
20440 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
20441 const char *p
= IDENTIFIER_POINTER (id
);
20446 if (strcmp ("none", p
) != 0)
20448 kind
= OMP_CLAUSE_DEFAULT_NONE
;
20452 if (strcmp ("shared", p
) != 0)
20454 kind
= OMP_CLAUSE_DEFAULT_SHARED
;
20461 cp_lexer_consume_token (parser
->lexer
);
20466 cp_parser_error (parser
, "expected %<none%> or %<shared%>");
20469 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>"))
20470 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
20471 /*or_comma=*/false,
20472 /*consume_paren=*/true);
20474 if (kind
== OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
20477 check_no_duplicate_clause (list
, OMP_CLAUSE_DEFAULT
, "default", location
);
20478 c
= build_omp_clause (OMP_CLAUSE_DEFAULT
);
20479 OMP_CLAUSE_CHAIN (c
) = list
;
20480 OMP_CLAUSE_DEFAULT_KIND (c
) = kind
;
20486 if ( expression ) */
20489 cp_parser_omp_clause_if (cp_parser
*parser
, tree list
, location_t location
)
20493 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>"))
20496 t
= cp_parser_condition (parser
);
20498 if (t
== error_mark_node
20499 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>"))
20500 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
20501 /*or_comma=*/false,
20502 /*consume_paren=*/true);
20504 check_no_duplicate_clause (list
, OMP_CLAUSE_IF
, "if", location
);
20506 c
= build_omp_clause (OMP_CLAUSE_IF
);
20507 OMP_CLAUSE_IF_EXPR (c
) = t
;
20508 OMP_CLAUSE_CHAIN (c
) = list
;
20517 cp_parser_omp_clause_nowait (cp_parser
*parser ATTRIBUTE_UNUSED
,
20518 tree list
, location_t location
)
20522 check_no_duplicate_clause (list
, OMP_CLAUSE_NOWAIT
, "nowait", location
);
20524 c
= build_omp_clause (OMP_CLAUSE_NOWAIT
);
20525 OMP_CLAUSE_CHAIN (c
) = list
;
20530 num_threads ( expression ) */
20533 cp_parser_omp_clause_num_threads (cp_parser
*parser
, tree list
,
20534 location_t location
)
20538 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>"))
20541 t
= cp_parser_expression (parser
, false, NULL
);
20543 if (t
== error_mark_node
20544 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>"))
20545 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
20546 /*or_comma=*/false,
20547 /*consume_paren=*/true);
20549 check_no_duplicate_clause (list
, OMP_CLAUSE_NUM_THREADS
,
20550 "num_threads", location
);
20552 c
= build_omp_clause (OMP_CLAUSE_NUM_THREADS
);
20553 OMP_CLAUSE_NUM_THREADS_EXPR (c
) = t
;
20554 OMP_CLAUSE_CHAIN (c
) = list
;
20563 cp_parser_omp_clause_ordered (cp_parser
*parser ATTRIBUTE_UNUSED
,
20564 tree list
, location_t location
)
20568 check_no_duplicate_clause (list
, OMP_CLAUSE_ORDERED
,
20569 "ordered", location
);
20571 c
= build_omp_clause (OMP_CLAUSE_ORDERED
);
20572 OMP_CLAUSE_CHAIN (c
) = list
;
20577 reduction ( reduction-operator : variable-list )
20579 reduction-operator:
20580 One of: + * - & ^ | && || */
20583 cp_parser_omp_clause_reduction (cp_parser
*parser
, tree list
)
20585 enum tree_code code
;
20588 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>"))
20591 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
20603 code
= BIT_AND_EXPR
;
20606 code
= BIT_XOR_EXPR
;
20609 code
= BIT_IOR_EXPR
;
20612 code
= TRUTH_ANDIF_EXPR
;
20615 code
= TRUTH_ORIF_EXPR
;
20618 cp_parser_error (parser
, "expected %<+%>, %<*%>, %<-%>, %<&%>, %<^%>, "
20619 "%<|%>, %<&&%>, or %<||%>");
20621 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
20622 /*or_comma=*/false,
20623 /*consume_paren=*/true);
20626 cp_lexer_consume_token (parser
->lexer
);
20628 if (!cp_parser_require (parser
, CPP_COLON
, "%<:%>"))
20631 nlist
= cp_parser_omp_var_list_no_open (parser
, OMP_CLAUSE_REDUCTION
, list
);
20632 for (c
= nlist
; c
!= list
; c
= OMP_CLAUSE_CHAIN (c
))
20633 OMP_CLAUSE_REDUCTION_CODE (c
) = code
;
20639 schedule ( schedule-kind )
20640 schedule ( schedule-kind , expression )
20643 static | dynamic | guided | runtime | auto */
20646 cp_parser_omp_clause_schedule (cp_parser
*parser
, tree list
, location_t location
)
20650 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>"))
20653 c
= build_omp_clause (OMP_CLAUSE_SCHEDULE
);
20655 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
20657 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
20658 const char *p
= IDENTIFIER_POINTER (id
);
20663 if (strcmp ("dynamic", p
) != 0)
20665 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_DYNAMIC
;
20669 if (strcmp ("guided", p
) != 0)
20671 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_GUIDED
;
20675 if (strcmp ("runtime", p
) != 0)
20677 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_RUNTIME
;
20684 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STATIC
))
20685 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_STATIC
;
20686 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AUTO
))
20687 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_AUTO
;
20690 cp_lexer_consume_token (parser
->lexer
);
20692 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
20695 cp_lexer_consume_token (parser
->lexer
);
20697 token
= cp_lexer_peek_token (parser
->lexer
);
20698 t
= cp_parser_assignment_expression (parser
, false, NULL
);
20700 if (t
== error_mark_node
)
20702 else if (OMP_CLAUSE_SCHEDULE_KIND (c
) == OMP_CLAUSE_SCHEDULE_RUNTIME
)
20703 error ("%Hschedule %<runtime%> does not take "
20704 "a %<chunk_size%> parameter", &token
->location
);
20705 else if (OMP_CLAUSE_SCHEDULE_KIND (c
) == OMP_CLAUSE_SCHEDULE_AUTO
)
20706 error ("%Hschedule %<auto%> does not take "
20707 "a %<chunk_size%> parameter", &token
->location
);
20709 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
20711 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>"))
20714 else if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<,%> or %<)%>"))
20717 check_no_duplicate_clause (list
, OMP_CLAUSE_SCHEDULE
, "schedule", location
);
20718 OMP_CLAUSE_CHAIN (c
) = list
;
20722 cp_parser_error (parser
, "invalid schedule kind");
20724 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
20725 /*or_comma=*/false,
20726 /*consume_paren=*/true);
20734 cp_parser_omp_clause_untied (cp_parser
*parser ATTRIBUTE_UNUSED
,
20735 tree list
, location_t location
)
20739 check_no_duplicate_clause (list
, OMP_CLAUSE_UNTIED
, "untied", location
);
20741 c
= build_omp_clause (OMP_CLAUSE_UNTIED
);
20742 OMP_CLAUSE_CHAIN (c
) = list
;
20746 /* Parse all OpenMP clauses. The set clauses allowed by the directive
20747 is a bitmask in MASK. Return the list of clauses found; the result
20748 of clause default goes in *pdefault. */
20751 cp_parser_omp_all_clauses (cp_parser
*parser
, unsigned int mask
,
20752 const char *where
, cp_token
*pragma_tok
)
20754 tree clauses
= NULL
;
20756 cp_token
*token
= NULL
;
20758 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
))
20760 pragma_omp_clause c_kind
;
20761 const char *c_name
;
20762 tree prev
= clauses
;
20764 if (!first
&& cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
20765 cp_lexer_consume_token (parser
->lexer
);
20767 token
= cp_lexer_peek_token (parser
->lexer
);
20768 c_kind
= cp_parser_omp_clause_name (parser
);
20773 case PRAGMA_OMP_CLAUSE_COLLAPSE
:
20774 clauses
= cp_parser_omp_clause_collapse (parser
, clauses
,
20776 c_name
= "collapse";
20778 case PRAGMA_OMP_CLAUSE_COPYIN
:
20779 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_COPYIN
, clauses
);
20782 case PRAGMA_OMP_CLAUSE_COPYPRIVATE
:
20783 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_COPYPRIVATE
,
20785 c_name
= "copyprivate";
20787 case PRAGMA_OMP_CLAUSE_DEFAULT
:
20788 clauses
= cp_parser_omp_clause_default (parser
, clauses
,
20790 c_name
= "default";
20792 case PRAGMA_OMP_CLAUSE_FIRSTPRIVATE
:
20793 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_FIRSTPRIVATE
,
20795 c_name
= "firstprivate";
20797 case PRAGMA_OMP_CLAUSE_IF
:
20798 clauses
= cp_parser_omp_clause_if (parser
, clauses
, token
->location
);
20801 case PRAGMA_OMP_CLAUSE_LASTPRIVATE
:
20802 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_LASTPRIVATE
,
20804 c_name
= "lastprivate";
20806 case PRAGMA_OMP_CLAUSE_NOWAIT
:
20807 clauses
= cp_parser_omp_clause_nowait (parser
, clauses
, token
->location
);
20810 case PRAGMA_OMP_CLAUSE_NUM_THREADS
:
20811 clauses
= cp_parser_omp_clause_num_threads (parser
, clauses
,
20813 c_name
= "num_threads";
20815 case PRAGMA_OMP_CLAUSE_ORDERED
:
20816 clauses
= cp_parser_omp_clause_ordered (parser
, clauses
,
20818 c_name
= "ordered";
20820 case PRAGMA_OMP_CLAUSE_PRIVATE
:
20821 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_PRIVATE
,
20823 c_name
= "private";
20825 case PRAGMA_OMP_CLAUSE_REDUCTION
:
20826 clauses
= cp_parser_omp_clause_reduction (parser
, clauses
);
20827 c_name
= "reduction";
20829 case PRAGMA_OMP_CLAUSE_SCHEDULE
:
20830 clauses
= cp_parser_omp_clause_schedule (parser
, clauses
,
20832 c_name
= "schedule";
20834 case PRAGMA_OMP_CLAUSE_SHARED
:
20835 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_SHARED
,
20839 case PRAGMA_OMP_CLAUSE_UNTIED
:
20840 clauses
= cp_parser_omp_clause_untied (parser
, clauses
,
20845 cp_parser_error (parser
, "expected %<#pragma omp%> clause");
20849 if (((mask
>> c_kind
) & 1) == 0)
20851 /* Remove the invalid clause(s) from the list to avoid
20852 confusing the rest of the compiler. */
20854 error ("%H%qs is not valid for %qs", &token
->location
, c_name
, where
);
20858 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
20859 return finish_omp_clauses (clauses
);
20866 In practice, we're also interested in adding the statement to an
20867 outer node. So it is convenient if we work around the fact that
20868 cp_parser_statement calls add_stmt. */
20871 cp_parser_begin_omp_structured_block (cp_parser
*parser
)
20873 unsigned save
= parser
->in_statement
;
20875 /* Only move the values to IN_OMP_BLOCK if they weren't false.
20876 This preserves the "not within loop or switch" style error messages
20877 for nonsense cases like
20883 if (parser
->in_statement
)
20884 parser
->in_statement
= IN_OMP_BLOCK
;
20890 cp_parser_end_omp_structured_block (cp_parser
*parser
, unsigned save
)
20892 parser
->in_statement
= save
;
20896 cp_parser_omp_structured_block (cp_parser
*parser
)
20898 tree stmt
= begin_omp_structured_block ();
20899 unsigned int save
= cp_parser_begin_omp_structured_block (parser
);
20901 cp_parser_statement (parser
, NULL_TREE
, false, NULL
);
20903 cp_parser_end_omp_structured_block (parser
, save
);
20904 return finish_omp_structured_block (stmt
);
20908 # pragma omp atomic new-line
20912 x binop= expr | x++ | ++x | x-- | --x
20914 +, *, -, /, &, ^, |, <<, >>
20916 where x is an lvalue expression with scalar type. */
20919 cp_parser_omp_atomic (cp_parser
*parser
, cp_token
*pragma_tok
)
20922 enum tree_code code
;
20924 cp_parser_require_pragma_eol (parser
, pragma_tok
);
20926 lhs
= cp_parser_unary_expression (parser
, /*address_p=*/false,
20927 /*cast_p=*/false, NULL
);
20928 switch (TREE_CODE (lhs
))
20933 case PREINCREMENT_EXPR
:
20934 case POSTINCREMENT_EXPR
:
20935 lhs
= TREE_OPERAND (lhs
, 0);
20937 rhs
= integer_one_node
;
20940 case PREDECREMENT_EXPR
:
20941 case POSTDECREMENT_EXPR
:
20942 lhs
= TREE_OPERAND (lhs
, 0);
20944 rhs
= integer_one_node
;
20948 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
20954 code
= TRUNC_DIV_EXPR
;
20962 case CPP_LSHIFT_EQ
:
20963 code
= LSHIFT_EXPR
;
20965 case CPP_RSHIFT_EQ
:
20966 code
= RSHIFT_EXPR
;
20969 code
= BIT_AND_EXPR
;
20972 code
= BIT_IOR_EXPR
;
20975 code
= BIT_XOR_EXPR
;
20978 cp_parser_error (parser
,
20979 "invalid operator for %<#pragma omp atomic%>");
20982 cp_lexer_consume_token (parser
->lexer
);
20984 rhs
= cp_parser_expression (parser
, false, NULL
);
20985 if (rhs
== error_mark_node
)
20989 finish_omp_atomic (code
, lhs
, rhs
);
20990 cp_parser_consume_semicolon_at_end_of_statement (parser
);
20994 cp_parser_skip_to_end_of_block_or_statement (parser
);
20999 # pragma omp barrier new-line */
21002 cp_parser_omp_barrier (cp_parser
*parser
, cp_token
*pragma_tok
)
21004 cp_parser_require_pragma_eol (parser
, pragma_tok
);
21005 finish_omp_barrier ();
21009 # pragma omp critical [(name)] new-line
21010 structured-block */
21013 cp_parser_omp_critical (cp_parser
*parser
, cp_token
*pragma_tok
)
21015 tree stmt
, name
= NULL
;
21017 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
21019 cp_lexer_consume_token (parser
->lexer
);
21021 name
= cp_parser_identifier (parser
);
21023 if (name
== error_mark_node
21024 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>"))
21025 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
21026 /*or_comma=*/false,
21027 /*consume_paren=*/true);
21028 if (name
== error_mark_node
)
21031 cp_parser_require_pragma_eol (parser
, pragma_tok
);
21033 stmt
= cp_parser_omp_structured_block (parser
);
21034 return c_finish_omp_critical (stmt
, name
);
21038 # pragma omp flush flush-vars[opt] new-line
21041 ( variable-list ) */
21044 cp_parser_omp_flush (cp_parser
*parser
, cp_token
*pragma_tok
)
21046 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
21047 (void) cp_parser_omp_var_list (parser
, 0, NULL
);
21048 cp_parser_require_pragma_eol (parser
, pragma_tok
);
21050 finish_omp_flush ();
21053 /* Helper function, to parse omp for increment expression. */
21056 cp_parser_omp_for_cond (cp_parser
*parser
, tree decl
)
21058 tree cond
= cp_parser_binary_expression (parser
, false, true,
21059 PREC_NOT_OPERATOR
, NULL
);
21062 if (cond
== error_mark_node
21063 || cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
21065 cp_parser_skip_to_end_of_statement (parser
);
21066 return error_mark_node
;
21069 switch (TREE_CODE (cond
))
21077 return error_mark_node
;
21080 /* If decl is an iterator, preserve LHS and RHS of the relational
21081 expr until finish_omp_for. */
21083 && (type_dependent_expression_p (decl
)
21084 || CLASS_TYPE_P (TREE_TYPE (decl
))))
21087 return build_x_binary_op (TREE_CODE (cond
),
21088 TREE_OPERAND (cond
, 0), ERROR_MARK
,
21089 TREE_OPERAND (cond
, 1), ERROR_MARK
,
21090 &overloaded_p
, tf_warning_or_error
);
21093 /* Helper function, to parse omp for increment expression. */
21096 cp_parser_omp_for_incr (cp_parser
*parser
, tree decl
)
21098 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
21104 if (token
->type
== CPP_PLUS_PLUS
|| token
->type
== CPP_MINUS_MINUS
)
21106 op
= (token
->type
== CPP_PLUS_PLUS
21107 ? PREINCREMENT_EXPR
: PREDECREMENT_EXPR
);
21108 cp_lexer_consume_token (parser
->lexer
);
21109 lhs
= cp_parser_cast_expression (parser
, false, false, NULL
);
21111 return error_mark_node
;
21112 return build2 (op
, TREE_TYPE (decl
), decl
, NULL_TREE
);
21115 lhs
= cp_parser_primary_expression (parser
, false, false, false, &idk
);
21117 return error_mark_node
;
21119 token
= cp_lexer_peek_token (parser
->lexer
);
21120 if (token
->type
== CPP_PLUS_PLUS
|| token
->type
== CPP_MINUS_MINUS
)
21122 op
= (token
->type
== CPP_PLUS_PLUS
21123 ? POSTINCREMENT_EXPR
: POSTDECREMENT_EXPR
);
21124 cp_lexer_consume_token (parser
->lexer
);
21125 return build2 (op
, TREE_TYPE (decl
), decl
, NULL_TREE
);
21128 op
= cp_parser_assignment_operator_opt (parser
);
21129 if (op
== ERROR_MARK
)
21130 return error_mark_node
;
21132 if (op
!= NOP_EXPR
)
21134 rhs
= cp_parser_assignment_expression (parser
, false, NULL
);
21135 rhs
= build2 (op
, TREE_TYPE (decl
), decl
, rhs
);
21136 return build2 (MODIFY_EXPR
, TREE_TYPE (decl
), decl
, rhs
);
21139 lhs
= cp_parser_binary_expression (parser
, false, false,
21140 PREC_ADDITIVE_EXPRESSION
, NULL
);
21141 token
= cp_lexer_peek_token (parser
->lexer
);
21142 decl_first
= lhs
== decl
;
21145 if (token
->type
!= CPP_PLUS
21146 && token
->type
!= CPP_MINUS
)
21147 return error_mark_node
;
21151 op
= token
->type
== CPP_PLUS
? PLUS_EXPR
: MINUS_EXPR
;
21152 cp_lexer_consume_token (parser
->lexer
);
21153 rhs
= cp_parser_binary_expression (parser
, false, false,
21154 PREC_ADDITIVE_EXPRESSION
, NULL
);
21155 token
= cp_lexer_peek_token (parser
->lexer
);
21156 if (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
|| decl_first
)
21158 if (lhs
== NULL_TREE
)
21160 if (op
== PLUS_EXPR
)
21163 lhs
= build_x_unary_op (NEGATE_EXPR
, rhs
, tf_warning_or_error
);
21166 lhs
= build_x_binary_op (op
, lhs
, ERROR_MARK
, rhs
, ERROR_MARK
,
21167 NULL
, tf_warning_or_error
);
21170 while (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
);
21174 if (rhs
!= decl
|| op
== MINUS_EXPR
)
21175 return error_mark_node
;
21176 rhs
= build2 (op
, TREE_TYPE (decl
), lhs
, decl
);
21179 rhs
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), decl
, lhs
);
21181 return build2 (MODIFY_EXPR
, TREE_TYPE (decl
), decl
, rhs
);
21184 /* Parse the restricted form of the for statement allowed by OpenMP. */
21187 cp_parser_omp_for_loop (cp_parser
*parser
, tree clauses
, tree
*par_clauses
)
21189 tree init
, cond
, incr
, body
, decl
, pre_body
= NULL_TREE
, ret
;
21190 tree for_block
= NULL_TREE
, real_decl
, initv
, condv
, incrv
, declv
;
21191 tree this_pre_body
, cl
;
21192 location_t loc_first
;
21193 bool collapse_err
= false;
21194 int i
, collapse
= 1, nbraces
= 0;
21196 for (cl
= clauses
; cl
; cl
= OMP_CLAUSE_CHAIN (cl
))
21197 if (OMP_CLAUSE_CODE (cl
) == OMP_CLAUSE_COLLAPSE
)
21198 collapse
= tree_low_cst (OMP_CLAUSE_COLLAPSE_EXPR (cl
), 0);
21200 gcc_assert (collapse
>= 1);
21202 declv
= make_tree_vec (collapse
);
21203 initv
= make_tree_vec (collapse
);
21204 condv
= make_tree_vec (collapse
);
21205 incrv
= make_tree_vec (collapse
);
21207 loc_first
= cp_lexer_peek_token (parser
->lexer
)->location
;
21209 for (i
= 0; i
< collapse
; i
++)
21211 int bracecount
= 0;
21212 bool add_private_clause
= false;
21215 if (!cp_lexer_next_token_is_keyword (parser
->lexer
, RID_FOR
))
21217 cp_parser_error (parser
, "for statement expected");
21220 loc
= cp_lexer_consume_token (parser
->lexer
)->location
;
21222 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "%<(%>"))
21225 init
= decl
= real_decl
= NULL
;
21226 this_pre_body
= push_stmt_list ();
21227 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
21229 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
21233 integer-type var = lb
21234 random-access-iterator-type var = lb
21235 pointer-type var = lb
21237 cp_decl_specifier_seq type_specifiers
;
21239 /* First, try to parse as an initialized declaration. See
21240 cp_parser_condition, from whence the bulk of this is copied. */
21242 cp_parser_parse_tentatively (parser
);
21243 cp_parser_type_specifier_seq (parser
, /*is_condition=*/false,
21245 if (cp_parser_parse_definitely (parser
))
21247 /* If parsing a type specifier seq succeeded, then this
21248 MUST be a initialized declaration. */
21249 tree asm_specification
, attributes
;
21250 cp_declarator
*declarator
;
21252 declarator
= cp_parser_declarator (parser
,
21253 CP_PARSER_DECLARATOR_NAMED
,
21254 /*ctor_dtor_or_conv_p=*/NULL
,
21255 /*parenthesized_p=*/NULL
,
21256 /*member_p=*/false);
21257 attributes
= cp_parser_attributes_opt (parser
);
21258 asm_specification
= cp_parser_asm_specification_opt (parser
);
21260 if (declarator
== cp_error_declarator
)
21261 cp_parser_skip_to_end_of_statement (parser
);
21265 tree pushed_scope
, auto_node
;
21267 decl
= start_decl (declarator
, &type_specifiers
,
21268 SD_INITIALIZED
, attributes
,
21269 /*prefix_attributes=*/NULL_TREE
,
21272 auto_node
= type_uses_auto (TREE_TYPE (decl
));
21273 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
))
21275 if (cp_lexer_next_token_is (parser
->lexer
,
21277 error ("parenthesized initialization is not allowed in "
21278 "OpenMP %<for%> loop");
21280 /* Trigger an error. */
21281 cp_parser_require (parser
, CPP_EQ
, "%<=%>");
21283 init
= error_mark_node
;
21284 cp_parser_skip_to_end_of_statement (parser
);
21286 else if (CLASS_TYPE_P (TREE_TYPE (decl
))
21287 || type_dependent_expression_p (decl
)
21290 bool is_direct_init
, is_non_constant_init
;
21292 init
= cp_parser_initializer (parser
,
21294 &is_non_constant_init
);
21296 if (auto_node
&& describable_type (init
))
21299 = do_auto_deduction (TREE_TYPE (decl
), init
,
21302 if (!CLASS_TYPE_P (TREE_TYPE (decl
))
21303 && !type_dependent_expression_p (decl
))
21307 cp_finish_decl (decl
, init
, !is_non_constant_init
,
21309 LOOKUP_ONLYCONVERTING
);
21310 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
21313 = tree_cons (NULL
, this_pre_body
, for_block
);
21317 init
= pop_stmt_list (this_pre_body
);
21318 this_pre_body
= NULL_TREE
;
21323 cp_lexer_consume_token (parser
->lexer
);
21324 init
= cp_parser_assignment_expression (parser
, false, NULL
);
21327 if (TREE_CODE (TREE_TYPE (decl
)) == REFERENCE_TYPE
)
21328 init
= error_mark_node
;
21330 cp_finish_decl (decl
, NULL_TREE
,
21331 /*init_const_expr_p=*/false,
21333 LOOKUP_ONLYCONVERTING
);
21337 pop_scope (pushed_scope
);
21343 /* If parsing a type specifier sequence failed, then
21344 this MUST be a simple expression. */
21345 cp_parser_parse_tentatively (parser
);
21346 decl
= cp_parser_primary_expression (parser
, false, false,
21348 if (!cp_parser_error_occurred (parser
)
21351 && CLASS_TYPE_P (TREE_TYPE (decl
)))
21355 cp_parser_parse_definitely (parser
);
21356 cp_parser_require (parser
, CPP_EQ
, "%<=%>");
21357 rhs
= cp_parser_assignment_expression (parser
, false, NULL
);
21358 finish_expr_stmt (build_x_modify_expr (decl
, NOP_EXPR
,
21360 tf_warning_or_error
));
21361 add_private_clause
= true;
21366 cp_parser_abort_tentative_parse (parser
);
21367 init
= cp_parser_expression (parser
, false, NULL
);
21370 if (TREE_CODE (init
) == MODIFY_EXPR
21371 || TREE_CODE (init
) == MODOP_EXPR
)
21372 real_decl
= TREE_OPERAND (init
, 0);
21377 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
21380 this_pre_body
= pop_stmt_list (this_pre_body
);
21384 pre_body
= push_stmt_list ();
21386 add_stmt (this_pre_body
);
21387 pre_body
= pop_stmt_list (pre_body
);
21390 pre_body
= this_pre_body
;
21395 if (par_clauses
!= NULL
&& real_decl
!= NULL_TREE
)
21398 for (c
= par_clauses
; *c
; )
21399 if (OMP_CLAUSE_CODE (*c
) == OMP_CLAUSE_FIRSTPRIVATE
21400 && OMP_CLAUSE_DECL (*c
) == real_decl
)
21402 error ("%Hiteration variable %qD should not be firstprivate",
21404 *c
= OMP_CLAUSE_CHAIN (*c
);
21406 else if (OMP_CLAUSE_CODE (*c
) == OMP_CLAUSE_LASTPRIVATE
21407 && OMP_CLAUSE_DECL (*c
) == real_decl
)
21409 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
21410 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
21411 tree l
= build_omp_clause (OMP_CLAUSE_LASTPRIVATE
);
21412 OMP_CLAUSE_DECL (l
) = real_decl
;
21413 OMP_CLAUSE_CHAIN (l
) = clauses
;
21414 CP_OMP_CLAUSE_INFO (l
) = CP_OMP_CLAUSE_INFO (*c
);
21416 OMP_CLAUSE_SET_CODE (*c
, OMP_CLAUSE_SHARED
);
21417 CP_OMP_CLAUSE_INFO (*c
) = NULL
;
21418 add_private_clause
= false;
21422 if (OMP_CLAUSE_CODE (*c
) == OMP_CLAUSE_PRIVATE
21423 && OMP_CLAUSE_DECL (*c
) == real_decl
)
21424 add_private_clause
= false;
21425 c
= &OMP_CLAUSE_CHAIN (*c
);
21429 if (add_private_clause
)
21432 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
21434 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
21435 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
21436 && OMP_CLAUSE_DECL (c
) == decl
)
21438 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
21439 && OMP_CLAUSE_DECL (c
) == decl
)
21440 error ("%Hiteration variable %qD should not be firstprivate",
21442 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
21443 && OMP_CLAUSE_DECL (c
) == decl
)
21444 error ("%Hiteration variable %qD should not be reduction",
21449 c
= build_omp_clause (OMP_CLAUSE_PRIVATE
);
21450 OMP_CLAUSE_DECL (c
) = decl
;
21451 c
= finish_omp_clauses (c
);
21454 OMP_CLAUSE_CHAIN (c
) = clauses
;
21461 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
21462 cond
= cp_parser_omp_for_cond (parser
, decl
);
21463 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
21466 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
21468 /* If decl is an iterator, preserve the operator on decl
21469 until finish_omp_for. */
21471 && (type_dependent_expression_p (decl
)
21472 || CLASS_TYPE_P (TREE_TYPE (decl
))))
21473 incr
= cp_parser_omp_for_incr (parser
, decl
);
21475 incr
= cp_parser_expression (parser
, false, NULL
);
21478 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>"))
21479 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
21480 /*or_comma=*/false,
21481 /*consume_paren=*/true);
21483 TREE_VEC_ELT (declv
, i
) = decl
;
21484 TREE_VEC_ELT (initv
, i
) = init
;
21485 TREE_VEC_ELT (condv
, i
) = cond
;
21486 TREE_VEC_ELT (incrv
, i
) = incr
;
21488 if (i
== collapse
- 1)
21491 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
21492 in between the collapsed for loops to be still considered perfectly
21493 nested. Hopefully the final version clarifies this.
21494 For now handle (multiple) {'s and empty statements. */
21495 cp_parser_parse_tentatively (parser
);
21498 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_FOR
))
21500 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
21502 cp_lexer_consume_token (parser
->lexer
);
21505 else if (bracecount
21506 && cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
21507 cp_lexer_consume_token (parser
->lexer
);
21510 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
21511 error ("%Hnot enough collapsed for loops", &loc
);
21512 collapse_err
= true;
21513 cp_parser_abort_tentative_parse (parser
);
21522 cp_parser_parse_definitely (parser
);
21523 nbraces
+= bracecount
;
21527 /* Note that we saved the original contents of this flag when we entered
21528 the structured block, and so we don't need to re-save it here. */
21529 parser
->in_statement
= IN_OMP_FOR
;
21531 /* Note that the grammar doesn't call for a structured block here,
21532 though the loop as a whole is a structured block. */
21533 body
= push_stmt_list ();
21534 cp_parser_statement (parser
, NULL_TREE
, false, NULL
);
21535 body
= pop_stmt_list (body
);
21537 if (declv
== NULL_TREE
)
21540 ret
= finish_omp_for (loc_first
, declv
, initv
, condv
, incrv
, body
,
21541 pre_body
, clauses
);
21545 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
21547 cp_lexer_consume_token (parser
->lexer
);
21550 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
21551 cp_lexer_consume_token (parser
->lexer
);
21556 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
21557 error ("%Hcollapsed loops not perfectly nested", &loc
);
21559 collapse_err
= true;
21560 cp_parser_statement_seq_opt (parser
, NULL
);
21561 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "%<}%>");
21567 add_stmt (pop_stmt_list (TREE_VALUE (for_block
)));
21568 for_block
= TREE_CHAIN (for_block
);
21575 #pragma omp for for-clause[optseq] new-line
21578 #define OMP_FOR_CLAUSE_MASK \
21579 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
21580 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
21581 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
21582 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
21583 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
21584 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
21585 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT) \
21586 | (1u << PRAGMA_OMP_CLAUSE_COLLAPSE))
21589 cp_parser_omp_for (cp_parser
*parser
, cp_token
*pragma_tok
)
21591 tree clauses
, sb
, ret
;
21594 clauses
= cp_parser_omp_all_clauses (parser
, OMP_FOR_CLAUSE_MASK
,
21595 "#pragma omp for", pragma_tok
);
21597 sb
= begin_omp_structured_block ();
21598 save
= cp_parser_begin_omp_structured_block (parser
);
21600 ret
= cp_parser_omp_for_loop (parser
, clauses
, NULL
);
21602 cp_parser_end_omp_structured_block (parser
, save
);
21603 add_stmt (finish_omp_structured_block (sb
));
21609 # pragma omp master new-line
21610 structured-block */
21613 cp_parser_omp_master (cp_parser
*parser
, cp_token
*pragma_tok
)
21615 cp_parser_require_pragma_eol (parser
, pragma_tok
);
21616 return c_finish_omp_master (cp_parser_omp_structured_block (parser
));
21620 # pragma omp ordered new-line
21621 structured-block */
21624 cp_parser_omp_ordered (cp_parser
*parser
, cp_token
*pragma_tok
)
21626 cp_parser_require_pragma_eol (parser
, pragma_tok
);
21627 return c_finish_omp_ordered (cp_parser_omp_structured_block (parser
));
21633 { section-sequence }
21636 section-directive[opt] structured-block
21637 section-sequence section-directive structured-block */
21640 cp_parser_omp_sections_scope (cp_parser
*parser
)
21642 tree stmt
, substmt
;
21643 bool error_suppress
= false;
21646 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, "%<{%>"))
21649 stmt
= push_stmt_list ();
21651 if (cp_lexer_peek_token (parser
->lexer
)->pragma_kind
!= PRAGMA_OMP_SECTION
)
21655 substmt
= begin_omp_structured_block ();
21656 save
= cp_parser_begin_omp_structured_block (parser
);
21660 cp_parser_statement (parser
, NULL_TREE
, false, NULL
);
21662 tok
= cp_lexer_peek_token (parser
->lexer
);
21663 if (tok
->pragma_kind
== PRAGMA_OMP_SECTION
)
21665 if (tok
->type
== CPP_CLOSE_BRACE
)
21667 if (tok
->type
== CPP_EOF
)
21671 cp_parser_end_omp_structured_block (parser
, save
);
21672 substmt
= finish_omp_structured_block (substmt
);
21673 substmt
= build1 (OMP_SECTION
, void_type_node
, substmt
);
21674 add_stmt (substmt
);
21679 tok
= cp_lexer_peek_token (parser
->lexer
);
21680 if (tok
->type
== CPP_CLOSE_BRACE
)
21682 if (tok
->type
== CPP_EOF
)
21685 if (tok
->pragma_kind
== PRAGMA_OMP_SECTION
)
21687 cp_lexer_consume_token (parser
->lexer
);
21688 cp_parser_require_pragma_eol (parser
, tok
);
21689 error_suppress
= false;
21691 else if (!error_suppress
)
21693 cp_parser_error (parser
, "expected %<#pragma omp section%> or %<}%>");
21694 error_suppress
= true;
21697 substmt
= cp_parser_omp_structured_block (parser
);
21698 substmt
= build1 (OMP_SECTION
, void_type_node
, substmt
);
21699 add_stmt (substmt
);
21701 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "%<}%>");
21703 substmt
= pop_stmt_list (stmt
);
21705 stmt
= make_node (OMP_SECTIONS
);
21706 TREE_TYPE (stmt
) = void_type_node
;
21707 OMP_SECTIONS_BODY (stmt
) = substmt
;
21714 # pragma omp sections sections-clause[optseq] newline
21717 #define OMP_SECTIONS_CLAUSE_MASK \
21718 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
21719 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
21720 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
21721 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
21722 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
21725 cp_parser_omp_sections (cp_parser
*parser
, cp_token
*pragma_tok
)
21729 clauses
= cp_parser_omp_all_clauses (parser
, OMP_SECTIONS_CLAUSE_MASK
,
21730 "#pragma omp sections", pragma_tok
);
21732 ret
= cp_parser_omp_sections_scope (parser
);
21734 OMP_SECTIONS_CLAUSES (ret
) = clauses
;
21740 # pragma parallel parallel-clause new-line
21741 # pragma parallel for parallel-for-clause new-line
21742 # pragma parallel sections parallel-sections-clause new-line */
21744 #define OMP_PARALLEL_CLAUSE_MASK \
21745 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
21746 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
21747 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
21748 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
21749 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
21750 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
21751 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
21752 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
21755 cp_parser_omp_parallel (cp_parser
*parser
, cp_token
*pragma_tok
)
21757 enum pragma_kind p_kind
= PRAGMA_OMP_PARALLEL
;
21758 const char *p_name
= "#pragma omp parallel";
21759 tree stmt
, clauses
, par_clause
, ws_clause
, block
;
21760 unsigned int mask
= OMP_PARALLEL_CLAUSE_MASK
;
21763 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_FOR
))
21765 cp_lexer_consume_token (parser
->lexer
);
21766 p_kind
= PRAGMA_OMP_PARALLEL_FOR
;
21767 p_name
= "#pragma omp parallel for";
21768 mask
|= OMP_FOR_CLAUSE_MASK
;
21769 mask
&= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT
);
21771 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
21773 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
21774 const char *p
= IDENTIFIER_POINTER (id
);
21775 if (strcmp (p
, "sections") == 0)
21777 cp_lexer_consume_token (parser
->lexer
);
21778 p_kind
= PRAGMA_OMP_PARALLEL_SECTIONS
;
21779 p_name
= "#pragma omp parallel sections";
21780 mask
|= OMP_SECTIONS_CLAUSE_MASK
;
21781 mask
&= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT
);
21785 clauses
= cp_parser_omp_all_clauses (parser
, mask
, p_name
, pragma_tok
);
21786 block
= begin_omp_parallel ();
21787 save
= cp_parser_begin_omp_structured_block (parser
);
21791 case PRAGMA_OMP_PARALLEL
:
21792 cp_parser_statement (parser
, NULL_TREE
, false, NULL
);
21793 par_clause
= clauses
;
21796 case PRAGMA_OMP_PARALLEL_FOR
:
21797 c_split_parallel_clauses (clauses
, &par_clause
, &ws_clause
);
21798 cp_parser_omp_for_loop (parser
, ws_clause
, &par_clause
);
21801 case PRAGMA_OMP_PARALLEL_SECTIONS
:
21802 c_split_parallel_clauses (clauses
, &par_clause
, &ws_clause
);
21803 stmt
= cp_parser_omp_sections_scope (parser
);
21805 OMP_SECTIONS_CLAUSES (stmt
) = ws_clause
;
21809 gcc_unreachable ();
21812 cp_parser_end_omp_structured_block (parser
, save
);
21813 stmt
= finish_omp_parallel (par_clause
, block
);
21814 if (p_kind
!= PRAGMA_OMP_PARALLEL
)
21815 OMP_PARALLEL_COMBINED (stmt
) = 1;
21820 # pragma omp single single-clause[optseq] new-line
21821 structured-block */
21823 #define OMP_SINGLE_CLAUSE_MASK \
21824 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
21825 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
21826 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
21827 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
21830 cp_parser_omp_single (cp_parser
*parser
, cp_token
*pragma_tok
)
21832 tree stmt
= make_node (OMP_SINGLE
);
21833 TREE_TYPE (stmt
) = void_type_node
;
21835 OMP_SINGLE_CLAUSES (stmt
)
21836 = cp_parser_omp_all_clauses (parser
, OMP_SINGLE_CLAUSE_MASK
,
21837 "#pragma omp single", pragma_tok
);
21838 OMP_SINGLE_BODY (stmt
) = cp_parser_omp_structured_block (parser
);
21840 return add_stmt (stmt
);
21844 # pragma omp task task-clause[optseq] new-line
21845 structured-block */
21847 #define OMP_TASK_CLAUSE_MASK \
21848 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
21849 | (1u << PRAGMA_OMP_CLAUSE_UNTIED) \
21850 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
21851 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
21852 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
21853 | (1u << PRAGMA_OMP_CLAUSE_SHARED))
21856 cp_parser_omp_task (cp_parser
*parser
, cp_token
*pragma_tok
)
21858 tree clauses
, block
;
21861 clauses
= cp_parser_omp_all_clauses (parser
, OMP_TASK_CLAUSE_MASK
,
21862 "#pragma omp task", pragma_tok
);
21863 block
= begin_omp_task ();
21864 save
= cp_parser_begin_omp_structured_block (parser
);
21865 cp_parser_statement (parser
, NULL_TREE
, false, NULL
);
21866 cp_parser_end_omp_structured_block (parser
, save
);
21867 return finish_omp_task (clauses
, block
);
21871 # pragma omp taskwait new-line */
21874 cp_parser_omp_taskwait (cp_parser
*parser
, cp_token
*pragma_tok
)
21876 cp_parser_require_pragma_eol (parser
, pragma_tok
);
21877 finish_omp_taskwait ();
21881 # pragma omp threadprivate (variable-list) */
21884 cp_parser_omp_threadprivate (cp_parser
*parser
, cp_token
*pragma_tok
)
21888 vars
= cp_parser_omp_var_list (parser
, 0, NULL
);
21889 cp_parser_require_pragma_eol (parser
, pragma_tok
);
21891 finish_omp_threadprivate (vars
);
21894 /* Main entry point to OpenMP statement pragmas. */
21897 cp_parser_omp_construct (cp_parser
*parser
, cp_token
*pragma_tok
)
21901 switch (pragma_tok
->pragma_kind
)
21903 case PRAGMA_OMP_ATOMIC
:
21904 cp_parser_omp_atomic (parser
, pragma_tok
);
21906 case PRAGMA_OMP_CRITICAL
:
21907 stmt
= cp_parser_omp_critical (parser
, pragma_tok
);
21909 case PRAGMA_OMP_FOR
:
21910 stmt
= cp_parser_omp_for (parser
, pragma_tok
);
21912 case PRAGMA_OMP_MASTER
:
21913 stmt
= cp_parser_omp_master (parser
, pragma_tok
);
21915 case PRAGMA_OMP_ORDERED
:
21916 stmt
= cp_parser_omp_ordered (parser
, pragma_tok
);
21918 case PRAGMA_OMP_PARALLEL
:
21919 stmt
= cp_parser_omp_parallel (parser
, pragma_tok
);
21921 case PRAGMA_OMP_SECTIONS
:
21922 stmt
= cp_parser_omp_sections (parser
, pragma_tok
);
21924 case PRAGMA_OMP_SINGLE
:
21925 stmt
= cp_parser_omp_single (parser
, pragma_tok
);
21927 case PRAGMA_OMP_TASK
:
21928 stmt
= cp_parser_omp_task (parser
, pragma_tok
);
21931 gcc_unreachable ();
21935 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
21940 static GTY (()) cp_parser
*the_parser
;
21943 /* Special handling for the first token or line in the file. The first
21944 thing in the file might be #pragma GCC pch_preprocess, which loads a
21945 PCH file, which is a GC collection point. So we need to handle this
21946 first pragma without benefit of an existing lexer structure.
21948 Always returns one token to the caller in *FIRST_TOKEN. This is
21949 either the true first token of the file, or the first token after
21950 the initial pragma. */
21953 cp_parser_initial_pragma (cp_token
*first_token
)
21957 cp_lexer_get_preprocessor_token (NULL
, first_token
);
21958 if (first_token
->pragma_kind
!= PRAGMA_GCC_PCH_PREPROCESS
)
21961 cp_lexer_get_preprocessor_token (NULL
, first_token
);
21962 if (first_token
->type
== CPP_STRING
)
21964 name
= first_token
->u
.value
;
21966 cp_lexer_get_preprocessor_token (NULL
, first_token
);
21967 if (first_token
->type
!= CPP_PRAGMA_EOL
)
21968 error ("%Hjunk at end of %<#pragma GCC pch_preprocess%>",
21969 &first_token
->location
);
21972 error ("%Hexpected string literal", &first_token
->location
);
21974 /* Skip to the end of the pragma. */
21975 while (first_token
->type
!= CPP_PRAGMA_EOL
&& first_token
->type
!= CPP_EOF
)
21976 cp_lexer_get_preprocessor_token (NULL
, first_token
);
21978 /* Now actually load the PCH file. */
21980 c_common_pch_pragma (parse_in
, TREE_STRING_POINTER (name
));
21982 /* Read one more token to return to our caller. We have to do this
21983 after reading the PCH file in, since its pointers have to be
21985 cp_lexer_get_preprocessor_token (NULL
, first_token
);
21988 /* Normal parsing of a pragma token. Here we can (and must) use the
21992 cp_parser_pragma (cp_parser
*parser
, enum pragma_context context
)
21994 cp_token
*pragma_tok
;
21997 pragma_tok
= cp_lexer_consume_token (parser
->lexer
);
21998 gcc_assert (pragma_tok
->type
== CPP_PRAGMA
);
21999 parser
->lexer
->in_pragma
= true;
22001 id
= pragma_tok
->pragma_kind
;
22004 case PRAGMA_GCC_PCH_PREPROCESS
:
22005 error ("%H%<#pragma GCC pch_preprocess%> must be first",
22006 &pragma_tok
->location
);
22009 case PRAGMA_OMP_BARRIER
:
22012 case pragma_compound
:
22013 cp_parser_omp_barrier (parser
, pragma_tok
);
22016 error ("%H%<#pragma omp barrier%> may only be "
22017 "used in compound statements", &pragma_tok
->location
);
22024 case PRAGMA_OMP_FLUSH
:
22027 case pragma_compound
:
22028 cp_parser_omp_flush (parser
, pragma_tok
);
22031 error ("%H%<#pragma omp flush%> may only be "
22032 "used in compound statements", &pragma_tok
->location
);
22039 case PRAGMA_OMP_TASKWAIT
:
22042 case pragma_compound
:
22043 cp_parser_omp_taskwait (parser
, pragma_tok
);
22046 error ("%H%<#pragma omp taskwait%> may only be "
22047 "used in compound statements",
22048 &pragma_tok
->location
);
22055 case PRAGMA_OMP_THREADPRIVATE
:
22056 cp_parser_omp_threadprivate (parser
, pragma_tok
);
22059 case PRAGMA_OMP_ATOMIC
:
22060 case PRAGMA_OMP_CRITICAL
:
22061 case PRAGMA_OMP_FOR
:
22062 case PRAGMA_OMP_MASTER
:
22063 case PRAGMA_OMP_ORDERED
:
22064 case PRAGMA_OMP_PARALLEL
:
22065 case PRAGMA_OMP_SECTIONS
:
22066 case PRAGMA_OMP_SINGLE
:
22067 case PRAGMA_OMP_TASK
:
22068 if (context
== pragma_external
)
22070 cp_parser_omp_construct (parser
, pragma_tok
);
22073 case PRAGMA_OMP_SECTION
:
22074 error ("%H%<#pragma omp section%> may only be used in "
22075 "%<#pragma omp sections%> construct", &pragma_tok
->location
);
22079 gcc_assert (id
>= PRAGMA_FIRST_EXTERNAL
);
22080 c_invoke_pragma_handler (id
);
22084 cp_parser_error (parser
, "expected declaration specifiers");
22088 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
22092 /* The interface the pragma parsers have to the lexer. */
22095 pragma_lex (tree
*value
)
22098 enum cpp_ttype ret
;
22100 tok
= cp_lexer_peek_token (the_parser
->lexer
);
22103 *value
= tok
->u
.value
;
22105 if (ret
== CPP_PRAGMA_EOL
|| ret
== CPP_EOF
)
22107 else if (ret
== CPP_STRING
)
22108 *value
= cp_parser_string_literal (the_parser
, false, false);
22111 cp_lexer_consume_token (the_parser
->lexer
);
22112 if (ret
== CPP_KEYWORD
)
22120 /* External interface. */
22122 /* Parse one entire translation unit. */
22125 c_parse_file (void)
22127 bool error_occurred
;
22128 static bool already_called
= false;
22130 if (already_called
)
22132 sorry ("inter-module optimizations not implemented for C++");
22135 already_called
= true;
22137 the_parser
= cp_parser_new ();
22138 push_deferring_access_checks (flag_access_control
22139 ? dk_no_deferred
: dk_no_check
);
22140 error_occurred
= cp_parser_translation_unit (the_parser
);
22144 #include "gt-cp-parser.h"