2 Copyright (C) 2000, 2001, 2002, 2003, 2004,
3 2005, 2007, 2008, 2009, 2010 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"
30 #include "c-family/c-pragma.h"
33 #include "diagnostic-core.h"
37 #include "c-family/c-common.h"
38 #include "c-family/c-objc.h"
44 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
45 and c-lex.c) and the C++ parser. */
47 /* A token's value and its associated deferred access checks and
50 struct GTY(()) tree_check
{
51 /* The value associated with the token. */
53 /* The checks that have been associated with value. */
54 VEC (deferred_access_check
, gc
)* checks
;
55 /* The token's qualifying scope (used when it is a
56 CPP_NESTED_NAME_SPECIFIER). */
57 tree qualifying_scope
;
62 typedef struct GTY (()) cp_token
{
63 /* The kind of token. */
64 ENUM_BITFIELD (cpp_ttype
) type
: 8;
65 /* If this token is a keyword, this value indicates which keyword.
66 Otherwise, this value is RID_MAX. */
67 ENUM_BITFIELD (rid
) keyword
: 8;
70 /* Identifier for the pragma. */
71 ENUM_BITFIELD (pragma_kind
) pragma_kind
: 6;
72 /* True if this token is from a context where it is implicitly extern "C" */
73 BOOL_BITFIELD implicit_extern_c
: 1;
74 /* True for a CPP_NAME token that is not a keyword (i.e., for which
75 KEYWORD is RID_MAX) iff this name was looked up and found to be
76 ambiguous. An error has already been reported. */
77 BOOL_BITFIELD ambiguous_p
: 1;
78 /* The location at which this token was found. */
80 /* The value associated with this token, if any. */
81 union cp_token_value
{
82 /* Used for CPP_NESTED_NAME_SPECIFIER and CPP_TEMPLATE_ID. */
83 struct tree_check
* GTY((tag ("1"))) tree_check_value
;
84 /* Use for all other tokens. */
85 tree
GTY((tag ("0"))) value
;
86 } GTY((desc ("(%1.type == CPP_TEMPLATE_ID) || (%1.type == CPP_NESTED_NAME_SPECIFIER)"))) u
;
89 /* We use a stack of token pointer for saving token sets. */
90 typedef struct cp_token
*cp_token_position
;
91 DEF_VEC_P (cp_token_position
);
92 DEF_VEC_ALLOC_P (cp_token_position
,heap
);
94 static cp_token eof_token
=
96 CPP_EOF
, RID_MAX
, 0, PRAGMA_NONE
, false, 0, 0, { NULL
}
99 /* The cp_lexer structure represents the C++ lexer. It is responsible
100 for managing the token stream from the preprocessor and supplying
101 it to the parser. Tokens are never added to the cp_lexer after
104 typedef struct GTY (()) cp_lexer
{
105 /* The memory allocated for the buffer. NULL if this lexer does not
106 own the token buffer. */
107 cp_token
* GTY ((length ("%h.buffer_length"))) buffer
;
108 /* If the lexer owns the buffer, this is the number of tokens in the
110 size_t buffer_length
;
112 /* A pointer just past the last available token. The tokens
113 in this lexer are [buffer, last_token). */
114 cp_token_position
GTY ((skip
)) last_token
;
116 /* The next available token. If NEXT_TOKEN is &eof_token, then there are
117 no more available tokens. */
118 cp_token_position
GTY ((skip
)) next_token
;
120 /* A stack indicating positions at which cp_lexer_save_tokens was
121 called. The top entry is the most recent position at which we
122 began saving tokens. If the stack is non-empty, we are saving
124 VEC(cp_token_position
,heap
) *GTY ((skip
)) saved_tokens
;
126 /* The next lexer in a linked list of lexers. */
127 struct cp_lexer
*next
;
129 /* True if we should output debugging information. */
132 /* True if we're in the context of parsing a pragma, and should not
133 increment past the end-of-line marker. */
137 /* cp_token_cache is a range of tokens. There is no need to represent
138 allocate heap memory for it, since tokens are never removed from the
139 lexer's array. There is also no need for the GC to walk through
140 a cp_token_cache, since everything in here is referenced through
143 typedef struct GTY(()) cp_token_cache
{
144 /* The beginning of the token range. */
145 cp_token
* GTY((skip
)) first
;
147 /* Points immediately after the last token in the range. */
148 cp_token
* GTY ((skip
)) last
;
151 /* The various kinds of non integral constant we encounter. */
152 typedef enum non_integral_constant
{
154 /* floating-point literal */
158 /* %<__FUNCTION__%> */
160 /* %<__PRETTY_FUNCTION__%> */
168 /* %<typeid%> operator */
170 /* non-constant compound literals */
172 /* a function call */
178 /* an array reference */
184 /* the address of a label */
198 /* calls to overloaded operators */
202 /* a comma operator */
204 /* a call to a constructor */
206 } non_integral_constant
;
208 /* The various kinds of errors about name-lookup failing. */
209 typedef enum name_lookup_error
{
214 /* is not a class or namespace */
216 /* is not a class, namespace, or enumeration */
220 /* The various kinds of required token */
221 typedef enum required_token
{
223 RT_SEMICOLON
, /* ';' */
224 RT_OPEN_PAREN
, /* '(' */
225 RT_CLOSE_BRACE
, /* '}' */
226 RT_OPEN_BRACE
, /* '{' */
227 RT_CLOSE_SQUARE
, /* ']' */
228 RT_OPEN_SQUARE
, /* '[' */
232 RT_GREATER
, /* '>' */
234 RT_ELLIPSIS
, /* '...' */
238 RT_COLON_SCOPE
, /* ':' or '::' */
239 RT_CLOSE_PAREN
, /* ')' */
240 RT_COMMA_CLOSE_PAREN
, /* ',' or ')' */
241 RT_PRAGMA_EOL
, /* end of line */
242 RT_NAME
, /* identifier */
244 /* The type is CPP_KEYWORD */
246 RT_DELETE
, /* delete */
247 RT_RETURN
, /* return */
248 RT_WHILE
, /* while */
249 RT_EXTERN
, /* extern */
250 RT_STATIC_ASSERT
, /* static_assert */
251 RT_DECLTYPE
, /* decltype */
252 RT_OPERATOR
, /* operator */
253 RT_CLASS
, /* class */
254 RT_TEMPLATE
, /* template */
255 RT_NAMESPACE
, /* namespace */
256 RT_USING
, /* using */
259 RT_CATCH
, /* catch */
260 RT_THROW
, /* throw */
261 RT_LABEL
, /* __label__ */
262 RT_AT_TRY
, /* @try */
263 RT_AT_SYNCHRONIZED
, /* @synchronized */
264 RT_AT_THROW
, /* @throw */
266 RT_SELECT
, /* selection-statement */
267 RT_INTERATION
, /* iteration-statement */
268 RT_JUMP
, /* jump-statement */
269 RT_CLASS_KEY
, /* class-key */
270 RT_CLASS_TYPENAME_TEMPLATE
/* class, typename, or template */
275 static cp_lexer
*cp_lexer_new_main
277 static cp_lexer
*cp_lexer_new_from_tokens
278 (cp_token_cache
*tokens
);
279 static void cp_lexer_destroy
281 static int cp_lexer_saving_tokens
283 static cp_token_position cp_lexer_token_position
285 static cp_token
*cp_lexer_token_at
286 (cp_lexer
*, cp_token_position
);
287 static void cp_lexer_get_preprocessor_token
288 (cp_lexer
*, cp_token
*);
289 static inline cp_token
*cp_lexer_peek_token
291 static cp_token
*cp_lexer_peek_nth_token
292 (cp_lexer
*, size_t);
293 static inline bool cp_lexer_next_token_is
294 (cp_lexer
*, enum cpp_ttype
);
295 static bool cp_lexer_next_token_is_not
296 (cp_lexer
*, enum cpp_ttype
);
297 static bool cp_lexer_next_token_is_keyword
298 (cp_lexer
*, enum rid
);
299 static cp_token
*cp_lexer_consume_token
301 static void cp_lexer_purge_token
303 static void cp_lexer_purge_tokens_after
304 (cp_lexer
*, cp_token_position
);
305 static void cp_lexer_save_tokens
307 static void cp_lexer_commit_tokens
309 static void cp_lexer_rollback_tokens
311 #ifdef ENABLE_CHECKING
312 static void cp_lexer_print_token
313 (FILE *, cp_token
*);
314 static inline bool cp_lexer_debugging_p
316 static void cp_lexer_start_debugging
317 (cp_lexer
*) ATTRIBUTE_UNUSED
;
318 static void cp_lexer_stop_debugging
319 (cp_lexer
*) ATTRIBUTE_UNUSED
;
321 /* If we define cp_lexer_debug_stream to NULL it will provoke warnings
322 about passing NULL to functions that require non-NULL arguments
323 (fputs, fprintf). It will never be used, so all we need is a value
324 of the right type that's guaranteed not to be NULL. */
325 #define cp_lexer_debug_stream stdout
326 #define cp_lexer_print_token(str, tok) (void) 0
327 #define cp_lexer_debugging_p(lexer) 0
328 #endif /* ENABLE_CHECKING */
330 static cp_token_cache
*cp_token_cache_new
331 (cp_token
*, cp_token
*);
333 static void cp_parser_initial_pragma
336 /* Manifest constants. */
337 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
338 #define CP_SAVED_TOKEN_STACK 5
340 /* A token type for keywords, as opposed to ordinary identifiers. */
341 #define CPP_KEYWORD ((enum cpp_ttype) (N_TTYPES + 1))
343 /* A token type for template-ids. If a template-id is processed while
344 parsing tentatively, it is replaced with a CPP_TEMPLATE_ID token;
345 the value of the CPP_TEMPLATE_ID is whatever was returned by
346 cp_parser_template_id. */
347 #define CPP_TEMPLATE_ID ((enum cpp_ttype) (CPP_KEYWORD + 1))
349 /* A token type for nested-name-specifiers. If a
350 nested-name-specifier is processed while parsing tentatively, it is
351 replaced with a CPP_NESTED_NAME_SPECIFIER token; the value of the
352 CPP_NESTED_NAME_SPECIFIER is whatever was returned by
353 cp_parser_nested_name_specifier_opt. */
354 #define CPP_NESTED_NAME_SPECIFIER ((enum cpp_ttype) (CPP_TEMPLATE_ID + 1))
356 /* A token type for tokens that are not tokens at all; these are used
357 to represent slots in the array where there used to be a token
358 that has now been deleted. */
359 #define CPP_PURGED ((enum cpp_ttype) (CPP_NESTED_NAME_SPECIFIER + 1))
361 /* The number of token types, including C++-specific ones. */
362 #define N_CP_TTYPES ((int) (CPP_PURGED + 1))
366 #ifdef ENABLE_CHECKING
367 /* The stream to which debugging output should be written. */
368 static FILE *cp_lexer_debug_stream
;
369 #endif /* ENABLE_CHECKING */
371 /* Nonzero if we are parsing an unevaluated operand: an operand to
372 sizeof, typeof, or alignof. */
373 int cp_unevaluated_operand
;
375 /* Create a new main C++ lexer, the lexer that gets tokens from the
379 cp_lexer_new_main (void)
381 cp_token first_token
;
388 /* It's possible that parsing the first pragma will load a PCH file,
389 which is a GC collection point. So we have to do that before
390 allocating any memory. */
391 cp_parser_initial_pragma (&first_token
);
393 c_common_no_more_pch ();
395 /* Allocate the memory. */
396 lexer
= ggc_alloc_cleared_cp_lexer ();
398 #ifdef ENABLE_CHECKING
399 /* Initially we are not debugging. */
400 lexer
->debugging_p
= false;
401 #endif /* ENABLE_CHECKING */
402 lexer
->saved_tokens
= VEC_alloc (cp_token_position
, heap
,
403 CP_SAVED_TOKEN_STACK
);
405 /* Create the buffer. */
406 alloc
= CP_LEXER_BUFFER_SIZE
;
407 buffer
= ggc_alloc_vec_cp_token (alloc
);
409 /* Put the first token in the buffer. */
414 /* Get the remaining tokens from the preprocessor. */
415 while (pos
->type
!= CPP_EOF
)
422 buffer
= GGC_RESIZEVEC (cp_token
, buffer
, alloc
);
423 pos
= buffer
+ space
;
425 cp_lexer_get_preprocessor_token (lexer
, pos
);
427 lexer
->buffer
= buffer
;
428 lexer
->buffer_length
= alloc
- space
;
429 lexer
->last_token
= pos
;
430 lexer
->next_token
= lexer
->buffer_length
? buffer
: &eof_token
;
432 /* Subsequent preprocessor diagnostics should use compiler
433 diagnostic functions to get the compiler source location. */
436 gcc_assert (lexer
->next_token
->type
!= CPP_PURGED
);
440 /* Create a new lexer whose token stream is primed with the tokens in
441 CACHE. When these tokens are exhausted, no new tokens will be read. */
444 cp_lexer_new_from_tokens (cp_token_cache
*cache
)
446 cp_token
*first
= cache
->first
;
447 cp_token
*last
= cache
->last
;
448 cp_lexer
*lexer
= ggc_alloc_cleared_cp_lexer ();
450 /* We do not own the buffer. */
451 lexer
->buffer
= NULL
;
452 lexer
->buffer_length
= 0;
453 lexer
->next_token
= first
== last
? &eof_token
: first
;
454 lexer
->last_token
= last
;
456 lexer
->saved_tokens
= VEC_alloc (cp_token_position
, heap
,
457 CP_SAVED_TOKEN_STACK
);
459 #ifdef ENABLE_CHECKING
460 /* Initially we are not debugging. */
461 lexer
->debugging_p
= false;
464 gcc_assert (lexer
->next_token
->type
!= CPP_PURGED
);
468 /* Frees all resources associated with LEXER. */
471 cp_lexer_destroy (cp_lexer
*lexer
)
474 ggc_free (lexer
->buffer
);
475 VEC_free (cp_token_position
, heap
, lexer
->saved_tokens
);
479 /* Returns nonzero if debugging information should be output. */
481 #ifdef ENABLE_CHECKING
484 cp_lexer_debugging_p (cp_lexer
*lexer
)
486 return lexer
->debugging_p
;
489 #endif /* ENABLE_CHECKING */
491 static inline cp_token_position
492 cp_lexer_token_position (cp_lexer
*lexer
, bool previous_p
)
494 gcc_assert (!previous_p
|| lexer
->next_token
!= &eof_token
);
496 return lexer
->next_token
- previous_p
;
499 static inline cp_token
*
500 cp_lexer_token_at (cp_lexer
*lexer ATTRIBUTE_UNUSED
, cp_token_position pos
)
506 cp_lexer_set_token_position (cp_lexer
*lexer
, cp_token_position pos
)
508 lexer
->next_token
= cp_lexer_token_at (lexer
, pos
);
511 static inline cp_token_position
512 cp_lexer_previous_token_position (cp_lexer
*lexer
)
514 if (lexer
->next_token
== &eof_token
)
515 return lexer
->last_token
- 1;
517 return cp_lexer_token_position (lexer
, true);
520 static inline cp_token
*
521 cp_lexer_previous_token (cp_lexer
*lexer
)
523 cp_token_position tp
= cp_lexer_previous_token_position (lexer
);
525 return cp_lexer_token_at (lexer
, tp
);
528 /* nonzero if we are presently saving tokens. */
531 cp_lexer_saving_tokens (const cp_lexer
* lexer
)
533 return VEC_length (cp_token_position
, lexer
->saved_tokens
) != 0;
536 /* Store the next token from the preprocessor in *TOKEN. Return true
537 if we reach EOF. If LEXER is NULL, assume we are handling an
538 initial #pragma pch_preprocess, and thus want the lexer to return
539 processed strings. */
542 cp_lexer_get_preprocessor_token (cp_lexer
*lexer
, cp_token
*token
)
544 static int is_extern_c
= 0;
546 /* Get a new token from the preprocessor. */
548 = c_lex_with_flags (&token
->u
.value
, &token
->location
, &token
->flags
,
549 lexer
== NULL
? 0 : C_LEX_STRING_NO_JOIN
);
550 token
->keyword
= RID_MAX
;
551 token
->pragma_kind
= PRAGMA_NONE
;
553 /* On some systems, some header files are surrounded by an
554 implicit extern "C" block. Set a flag in the token if it
555 comes from such a header. */
556 is_extern_c
+= pending_lang_change
;
557 pending_lang_change
= 0;
558 token
->implicit_extern_c
= is_extern_c
> 0;
560 /* Check to see if this token is a keyword. */
561 if (token
->type
== CPP_NAME
)
563 if (C_IS_RESERVED_WORD (token
->u
.value
))
565 /* Mark this token as a keyword. */
566 token
->type
= CPP_KEYWORD
;
567 /* Record which keyword. */
568 token
->keyword
= C_RID_CODE (token
->u
.value
);
572 if (warn_cxx0x_compat
573 && C_RID_CODE (token
->u
.value
) >= RID_FIRST_CXX0X
574 && C_RID_CODE (token
->u
.value
) <= RID_LAST_CXX0X
)
576 /* Warn about the C++0x keyword (but still treat it as
578 warning (OPT_Wc__0x_compat
,
579 "identifier %qE will become a keyword in C++0x",
582 /* Clear out the C_RID_CODE so we don't warn about this
583 particular identifier-turned-keyword again. */
584 C_SET_RID_CODE (token
->u
.value
, RID_MAX
);
587 token
->ambiguous_p
= false;
588 token
->keyword
= RID_MAX
;
591 else if (token
->type
== CPP_AT_NAME
)
593 /* This only happens in Objective-C++; it must be a keyword. */
594 token
->type
= CPP_KEYWORD
;
595 switch (C_RID_CODE (token
->u
.value
))
597 /* Replace 'class' with '@class', 'private' with '@private',
598 etc. This prevents confusion with the C++ keyword
599 'class', and makes the tokens consistent with other
600 Objective-C 'AT' keywords. For example '@class' is
601 reported as RID_AT_CLASS which is consistent with
602 '@synchronized', which is reported as
605 case RID_CLASS
: token
->keyword
= RID_AT_CLASS
; break;
606 case RID_PRIVATE
: token
->keyword
= RID_AT_PRIVATE
; break;
607 case RID_PROTECTED
: token
->keyword
= RID_AT_PROTECTED
; break;
608 case RID_PUBLIC
: token
->keyword
= RID_AT_PUBLIC
; break;
609 case RID_THROW
: token
->keyword
= RID_AT_THROW
; break;
610 case RID_TRY
: token
->keyword
= RID_AT_TRY
; break;
611 case RID_CATCH
: token
->keyword
= RID_AT_CATCH
; break;
612 default: token
->keyword
= C_RID_CODE (token
->u
.value
);
615 else if (token
->type
== CPP_PRAGMA
)
617 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
618 token
->pragma_kind
= ((enum pragma_kind
)
619 TREE_INT_CST_LOW (token
->u
.value
));
620 token
->u
.value
= NULL_TREE
;
624 /* Update the globals input_location and the input file stack from TOKEN. */
626 cp_lexer_set_source_position_from_token (cp_token
*token
)
628 if (token
->type
!= CPP_EOF
)
630 input_location
= token
->location
;
634 /* Return a pointer to the next token in the token stream, but do not
637 static inline cp_token
*
638 cp_lexer_peek_token (cp_lexer
*lexer
)
640 if (cp_lexer_debugging_p (lexer
))
642 fputs ("cp_lexer: peeking at token: ", cp_lexer_debug_stream
);
643 cp_lexer_print_token (cp_lexer_debug_stream
, lexer
->next_token
);
644 putc ('\n', cp_lexer_debug_stream
);
646 return lexer
->next_token
;
649 /* Return true if the next token has the indicated TYPE. */
652 cp_lexer_next_token_is (cp_lexer
* lexer
, enum cpp_ttype type
)
654 return cp_lexer_peek_token (lexer
)->type
== type
;
657 /* Return true if the next token does not have the indicated TYPE. */
660 cp_lexer_next_token_is_not (cp_lexer
* lexer
, enum cpp_ttype type
)
662 return !cp_lexer_next_token_is (lexer
, type
);
665 /* Return true if the next token is the indicated KEYWORD. */
668 cp_lexer_next_token_is_keyword (cp_lexer
* lexer
, enum rid keyword
)
670 return cp_lexer_peek_token (lexer
)->keyword
== keyword
;
673 /* Return true if the next token is not the indicated KEYWORD. */
676 cp_lexer_next_token_is_not_keyword (cp_lexer
* lexer
, enum rid keyword
)
678 return cp_lexer_peek_token (lexer
)->keyword
!= keyword
;
681 /* Return true if the next token is a keyword for a decl-specifier. */
684 cp_lexer_next_token_is_decl_specifier_keyword (cp_lexer
*lexer
)
688 token
= cp_lexer_peek_token (lexer
);
689 switch (token
->keyword
)
691 /* auto specifier: storage-class-specifier in C++,
692 simple-type-specifier in C++0x. */
694 /* Storage classes. */
700 /* Elaborated type specifiers. */
706 /* Simple type specifiers. */
721 /* GNU extensions. */
724 /* C++0x extensions. */
733 /* Return a pointer to the Nth token in the token stream. If N is 1,
734 then this is precisely equivalent to cp_lexer_peek_token (except
735 that it is not inline). One would like to disallow that case, but
736 there is one case (cp_parser_nth_token_starts_template_id) where
737 the caller passes a variable for N and it might be 1. */
740 cp_lexer_peek_nth_token (cp_lexer
* lexer
, size_t n
)
744 /* N is 1-based, not zero-based. */
747 if (cp_lexer_debugging_p (lexer
))
748 fprintf (cp_lexer_debug_stream
,
749 "cp_lexer: peeking ahead %ld at token: ", (long)n
);
752 token
= lexer
->next_token
;
753 gcc_assert (!n
|| token
!= &eof_token
);
757 if (token
== lexer
->last_token
)
763 if (token
->type
!= CPP_PURGED
)
767 if (cp_lexer_debugging_p (lexer
))
769 cp_lexer_print_token (cp_lexer_debug_stream
, token
);
770 putc ('\n', cp_lexer_debug_stream
);
776 /* Return the next token, and advance the lexer's next_token pointer
777 to point to the next non-purged token. */
780 cp_lexer_consume_token (cp_lexer
* lexer
)
782 cp_token
*token
= lexer
->next_token
;
784 gcc_assert (token
!= &eof_token
);
785 gcc_assert (!lexer
->in_pragma
|| token
->type
!= CPP_PRAGMA_EOL
);
790 if (lexer
->next_token
== lexer
->last_token
)
792 lexer
->next_token
= &eof_token
;
797 while (lexer
->next_token
->type
== CPP_PURGED
);
799 cp_lexer_set_source_position_from_token (token
);
801 /* Provide debugging output. */
802 if (cp_lexer_debugging_p (lexer
))
804 fputs ("cp_lexer: consuming token: ", cp_lexer_debug_stream
);
805 cp_lexer_print_token (cp_lexer_debug_stream
, token
);
806 putc ('\n', cp_lexer_debug_stream
);
812 /* Permanently remove the next token from the token stream, and
813 advance the next_token pointer to refer to the next non-purged
817 cp_lexer_purge_token (cp_lexer
*lexer
)
819 cp_token
*tok
= lexer
->next_token
;
821 gcc_assert (tok
!= &eof_token
);
822 tok
->type
= CPP_PURGED
;
823 tok
->location
= UNKNOWN_LOCATION
;
824 tok
->u
.value
= NULL_TREE
;
825 tok
->keyword
= RID_MAX
;
830 if (tok
== lexer
->last_token
)
836 while (tok
->type
== CPP_PURGED
);
837 lexer
->next_token
= tok
;
840 /* Permanently remove all tokens after TOK, up to, but not
841 including, the token that will be returned next by
842 cp_lexer_peek_token. */
845 cp_lexer_purge_tokens_after (cp_lexer
*lexer
, cp_token
*tok
)
847 cp_token
*peek
= lexer
->next_token
;
849 if (peek
== &eof_token
)
850 peek
= lexer
->last_token
;
852 gcc_assert (tok
< peek
);
854 for ( tok
+= 1; tok
!= peek
; tok
+= 1)
856 tok
->type
= CPP_PURGED
;
857 tok
->location
= UNKNOWN_LOCATION
;
858 tok
->u
.value
= NULL_TREE
;
859 tok
->keyword
= RID_MAX
;
863 /* Begin saving tokens. All tokens consumed after this point will be
867 cp_lexer_save_tokens (cp_lexer
* lexer
)
869 /* Provide debugging output. */
870 if (cp_lexer_debugging_p (lexer
))
871 fprintf (cp_lexer_debug_stream
, "cp_lexer: saving tokens\n");
873 VEC_safe_push (cp_token_position
, heap
,
874 lexer
->saved_tokens
, lexer
->next_token
);
877 /* Commit to the portion of the token stream most recently saved. */
880 cp_lexer_commit_tokens (cp_lexer
* lexer
)
882 /* Provide debugging output. */
883 if (cp_lexer_debugging_p (lexer
))
884 fprintf (cp_lexer_debug_stream
, "cp_lexer: committing tokens\n");
886 VEC_pop (cp_token_position
, lexer
->saved_tokens
);
889 /* Return all tokens saved since the last call to cp_lexer_save_tokens
890 to the token stream. Stop saving tokens. */
893 cp_lexer_rollback_tokens (cp_lexer
* lexer
)
895 /* Provide debugging output. */
896 if (cp_lexer_debugging_p (lexer
))
897 fprintf (cp_lexer_debug_stream
, "cp_lexer: restoring tokens\n");
899 lexer
->next_token
= VEC_pop (cp_token_position
, lexer
->saved_tokens
);
902 /* Print a representation of the TOKEN on the STREAM. */
904 #ifdef ENABLE_CHECKING
907 cp_lexer_print_token (FILE * stream
, cp_token
*token
)
909 /* We don't use cpp_type2name here because the parser defines
910 a few tokens of its own. */
911 static const char *const token_names
[] = {
912 /* cpplib-defined token types */
918 /* C++ parser token types - see "Manifest constants", above. */
921 "NESTED_NAME_SPECIFIER",
925 /* If we have a name for the token, print it out. Otherwise, we
926 simply give the numeric code. */
927 gcc_assert (token
->type
< ARRAY_SIZE(token_names
));
928 fputs (token_names
[token
->type
], stream
);
930 /* For some tokens, print the associated data. */
934 /* Some keywords have a value that is not an IDENTIFIER_NODE.
935 For example, `struct' is mapped to an INTEGER_CST. */
936 if (TREE_CODE (token
->u
.value
) != IDENTIFIER_NODE
)
938 /* else fall through */
940 fputs (IDENTIFIER_POINTER (token
->u
.value
), stream
);
948 fprintf (stream
, " \"%s\"", TREE_STRING_POINTER (token
->u
.value
));
956 /* Start emitting debugging information. */
959 cp_lexer_start_debugging (cp_lexer
* lexer
)
961 lexer
->debugging_p
= true;
964 /* Stop emitting debugging information. */
967 cp_lexer_stop_debugging (cp_lexer
* lexer
)
969 lexer
->debugging_p
= false;
972 #endif /* ENABLE_CHECKING */
974 /* Create a new cp_token_cache, representing a range of tokens. */
976 static cp_token_cache
*
977 cp_token_cache_new (cp_token
*first
, cp_token
*last
)
979 cp_token_cache
*cache
= ggc_alloc_cp_token_cache ();
980 cache
->first
= first
;
986 /* Decl-specifiers. */
988 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
991 clear_decl_specs (cp_decl_specifier_seq
*decl_specs
)
993 memset (decl_specs
, 0, sizeof (cp_decl_specifier_seq
));
998 /* Nothing other than the parser should be creating declarators;
999 declarators are a semi-syntactic representation of C++ entities.
1000 Other parts of the front end that need to create entities (like
1001 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1003 static cp_declarator
*make_call_declarator
1004 (cp_declarator
*, tree
, cp_cv_quals
, tree
, tree
);
1005 static cp_declarator
*make_array_declarator
1006 (cp_declarator
*, tree
);
1007 static cp_declarator
*make_pointer_declarator
1008 (cp_cv_quals
, cp_declarator
*);
1009 static cp_declarator
*make_reference_declarator
1010 (cp_cv_quals
, cp_declarator
*, bool);
1011 static cp_parameter_declarator
*make_parameter_declarator
1012 (cp_decl_specifier_seq
*, cp_declarator
*, tree
);
1013 static cp_declarator
*make_ptrmem_declarator
1014 (cp_cv_quals
, tree
, cp_declarator
*);
1016 /* An erroneous declarator. */
1017 static cp_declarator
*cp_error_declarator
;
1019 /* The obstack on which declarators and related data structures are
1021 static struct obstack declarator_obstack
;
1023 /* Alloc BYTES from the declarator memory pool. */
1025 static inline void *
1026 alloc_declarator (size_t bytes
)
1028 return obstack_alloc (&declarator_obstack
, bytes
);
1031 /* Allocate a declarator of the indicated KIND. Clear fields that are
1032 common to all declarators. */
1034 static cp_declarator
*
1035 make_declarator (cp_declarator_kind kind
)
1037 cp_declarator
*declarator
;
1039 declarator
= (cp_declarator
*) alloc_declarator (sizeof (cp_declarator
));
1040 declarator
->kind
= kind
;
1041 declarator
->attributes
= NULL_TREE
;
1042 declarator
->declarator
= NULL
;
1043 declarator
->parameter_pack_p
= false;
1044 declarator
->id_loc
= UNKNOWN_LOCATION
;
1049 /* Make a declarator for a generalized identifier. If
1050 QUALIFYING_SCOPE is non-NULL, the identifier is
1051 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1052 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1055 static cp_declarator
*
1056 make_id_declarator (tree qualifying_scope
, tree unqualified_name
,
1057 special_function_kind sfk
)
1059 cp_declarator
*declarator
;
1061 /* It is valid to write:
1063 class C { void f(); };
1067 The standard is not clear about whether `typedef const C D' is
1068 legal; as of 2002-09-15 the committee is considering that
1069 question. EDG 3.0 allows that syntax. Therefore, we do as
1071 if (qualifying_scope
&& TYPE_P (qualifying_scope
))
1072 qualifying_scope
= TYPE_MAIN_VARIANT (qualifying_scope
);
1074 gcc_assert (TREE_CODE (unqualified_name
) == IDENTIFIER_NODE
1075 || TREE_CODE (unqualified_name
) == BIT_NOT_EXPR
1076 || TREE_CODE (unqualified_name
) == TEMPLATE_ID_EXPR
);
1078 declarator
= make_declarator (cdk_id
);
1079 declarator
->u
.id
.qualifying_scope
= qualifying_scope
;
1080 declarator
->u
.id
.unqualified_name
= unqualified_name
;
1081 declarator
->u
.id
.sfk
= sfk
;
1086 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1087 of modifiers such as const or volatile to apply to the pointer
1088 type, represented as identifiers. */
1091 make_pointer_declarator (cp_cv_quals cv_qualifiers
, cp_declarator
*target
)
1093 cp_declarator
*declarator
;
1095 declarator
= make_declarator (cdk_pointer
);
1096 declarator
->declarator
= target
;
1097 declarator
->u
.pointer
.qualifiers
= cv_qualifiers
;
1098 declarator
->u
.pointer
.class_type
= NULL_TREE
;
1101 declarator
->id_loc
= target
->id_loc
;
1102 declarator
->parameter_pack_p
= target
->parameter_pack_p
;
1103 target
->parameter_pack_p
= false;
1106 declarator
->parameter_pack_p
= false;
1111 /* Like make_pointer_declarator -- but for references. */
1114 make_reference_declarator (cp_cv_quals cv_qualifiers
, cp_declarator
*target
,
1117 cp_declarator
*declarator
;
1119 declarator
= make_declarator (cdk_reference
);
1120 declarator
->declarator
= target
;
1121 declarator
->u
.reference
.qualifiers
= cv_qualifiers
;
1122 declarator
->u
.reference
.rvalue_ref
= rvalue_ref
;
1125 declarator
->id_loc
= target
->id_loc
;
1126 declarator
->parameter_pack_p
= target
->parameter_pack_p
;
1127 target
->parameter_pack_p
= false;
1130 declarator
->parameter_pack_p
= false;
1135 /* Like make_pointer_declarator -- but for a pointer to a non-static
1136 member of CLASS_TYPE. */
1139 make_ptrmem_declarator (cp_cv_quals cv_qualifiers
, tree class_type
,
1140 cp_declarator
*pointee
)
1142 cp_declarator
*declarator
;
1144 declarator
= make_declarator (cdk_ptrmem
);
1145 declarator
->declarator
= pointee
;
1146 declarator
->u
.pointer
.qualifiers
= cv_qualifiers
;
1147 declarator
->u
.pointer
.class_type
= class_type
;
1151 declarator
->parameter_pack_p
= pointee
->parameter_pack_p
;
1152 pointee
->parameter_pack_p
= false;
1155 declarator
->parameter_pack_p
= false;
1160 /* Make a declarator for the function given by TARGET, with the
1161 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1162 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1163 indicates what exceptions can be thrown. */
1166 make_call_declarator (cp_declarator
*target
,
1168 cp_cv_quals cv_qualifiers
,
1169 tree exception_specification
,
1170 tree late_return_type
)
1172 cp_declarator
*declarator
;
1174 declarator
= make_declarator (cdk_function
);
1175 declarator
->declarator
= target
;
1176 declarator
->u
.function
.parameters
= parms
;
1177 declarator
->u
.function
.qualifiers
= cv_qualifiers
;
1178 declarator
->u
.function
.exception_specification
= exception_specification
;
1179 declarator
->u
.function
.late_return_type
= late_return_type
;
1182 declarator
->id_loc
= target
->id_loc
;
1183 declarator
->parameter_pack_p
= target
->parameter_pack_p
;
1184 target
->parameter_pack_p
= false;
1187 declarator
->parameter_pack_p
= false;
1192 /* Make a declarator for an array of BOUNDS elements, each of which is
1193 defined by ELEMENT. */
1196 make_array_declarator (cp_declarator
*element
, tree bounds
)
1198 cp_declarator
*declarator
;
1200 declarator
= make_declarator (cdk_array
);
1201 declarator
->declarator
= element
;
1202 declarator
->u
.array
.bounds
= bounds
;
1205 declarator
->id_loc
= element
->id_loc
;
1206 declarator
->parameter_pack_p
= element
->parameter_pack_p
;
1207 element
->parameter_pack_p
= false;
1210 declarator
->parameter_pack_p
= false;
1215 /* Determine whether the declarator we've seen so far can be a
1216 parameter pack, when followed by an ellipsis. */
1218 declarator_can_be_parameter_pack (cp_declarator
*declarator
)
1220 /* Search for a declarator name, or any other declarator that goes
1221 after the point where the ellipsis could appear in a parameter
1222 pack. If we find any of these, then this declarator can not be
1223 made into a parameter pack. */
1225 while (declarator
&& !found
)
1227 switch ((int)declarator
->kind
)
1238 declarator
= declarator
->declarator
;
1246 cp_parameter_declarator
*no_parameters
;
1248 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1249 DECLARATOR and DEFAULT_ARGUMENT. */
1251 cp_parameter_declarator
*
1252 make_parameter_declarator (cp_decl_specifier_seq
*decl_specifiers
,
1253 cp_declarator
*declarator
,
1254 tree default_argument
)
1256 cp_parameter_declarator
*parameter
;
1258 parameter
= ((cp_parameter_declarator
*)
1259 alloc_declarator (sizeof (cp_parameter_declarator
)));
1260 parameter
->next
= NULL
;
1261 if (decl_specifiers
)
1262 parameter
->decl_specifiers
= *decl_specifiers
;
1264 clear_decl_specs (¶meter
->decl_specifiers
);
1265 parameter
->declarator
= declarator
;
1266 parameter
->default_argument
= default_argument
;
1267 parameter
->ellipsis_p
= false;
1272 /* Returns true iff DECLARATOR is a declaration for a function. */
1275 function_declarator_p (const cp_declarator
*declarator
)
1279 if (declarator
->kind
== cdk_function
1280 && declarator
->declarator
->kind
== cdk_id
)
1282 if (declarator
->kind
== cdk_id
1283 || declarator
->kind
== cdk_error
)
1285 declarator
= declarator
->declarator
;
1295 A cp_parser parses the token stream as specified by the C++
1296 grammar. Its job is purely parsing, not semantic analysis. For
1297 example, the parser breaks the token stream into declarators,
1298 expressions, statements, and other similar syntactic constructs.
1299 It does not check that the types of the expressions on either side
1300 of an assignment-statement are compatible, or that a function is
1301 not declared with a parameter of type `void'.
1303 The parser invokes routines elsewhere in the compiler to perform
1304 semantic analysis and to build up the abstract syntax tree for the
1307 The parser (and the template instantiation code, which is, in a
1308 way, a close relative of parsing) are the only parts of the
1309 compiler that should be calling push_scope and pop_scope, or
1310 related functions. The parser (and template instantiation code)
1311 keeps track of what scope is presently active; everything else
1312 should simply honor that. (The code that generates static
1313 initializers may also need to set the scope, in order to check
1314 access control correctly when emitting the initializers.)
1319 The parser is of the standard recursive-descent variety. Upcoming
1320 tokens in the token stream are examined in order to determine which
1321 production to use when parsing a non-terminal. Some C++ constructs
1322 require arbitrary look ahead to disambiguate. For example, it is
1323 impossible, in the general case, to tell whether a statement is an
1324 expression or declaration without scanning the entire statement.
1325 Therefore, the parser is capable of "parsing tentatively." When the
1326 parser is not sure what construct comes next, it enters this mode.
1327 Then, while we attempt to parse the construct, the parser queues up
1328 error messages, rather than issuing them immediately, and saves the
1329 tokens it consumes. If the construct is parsed successfully, the
1330 parser "commits", i.e., it issues any queued error messages and
1331 the tokens that were being preserved are permanently discarded.
1332 If, however, the construct is not parsed successfully, the parser
1333 rolls back its state completely so that it can resume parsing using
1334 a different alternative.
1339 The performance of the parser could probably be improved substantially.
1340 We could often eliminate the need to parse tentatively by looking ahead
1341 a little bit. In some places, this approach might not entirely eliminate
1342 the need to parse tentatively, but it might still speed up the average
1345 /* Flags that are passed to some parsing functions. These values can
1346 be bitwise-ored together. */
1351 CP_PARSER_FLAGS_NONE
= 0x0,
1352 /* The construct is optional. If it is not present, then no error
1353 should be issued. */
1354 CP_PARSER_FLAGS_OPTIONAL
= 0x1,
1355 /* When parsing a type-specifier, treat user-defined type-names
1356 as non-type identifiers. */
1357 CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
= 0x2,
1358 /* When parsing a type-specifier, do not try to parse a class-specifier
1359 or enum-specifier. */
1360 CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS
= 0x4,
1361 /* When parsing a decl-specifier-seq, only allow type-specifier or
1363 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR
= 0x8
1366 /* This type is used for parameters and variables which hold
1367 combinations of the above flags. */
1368 typedef int cp_parser_flags
;
1370 /* The different kinds of declarators we want to parse. */
1372 typedef enum cp_parser_declarator_kind
1374 /* We want an abstract declarator. */
1375 CP_PARSER_DECLARATOR_ABSTRACT
,
1376 /* We want a named declarator. */
1377 CP_PARSER_DECLARATOR_NAMED
,
1378 /* We don't mind, but the name must be an unqualified-id. */
1379 CP_PARSER_DECLARATOR_EITHER
1380 } cp_parser_declarator_kind
;
1382 /* The precedence values used to parse binary expressions. The minimum value
1383 of PREC must be 1, because zero is reserved to quickly discriminate
1384 binary operators from other tokens. */
1389 PREC_LOGICAL_OR_EXPRESSION
,
1390 PREC_LOGICAL_AND_EXPRESSION
,
1391 PREC_INCLUSIVE_OR_EXPRESSION
,
1392 PREC_EXCLUSIVE_OR_EXPRESSION
,
1393 PREC_AND_EXPRESSION
,
1394 PREC_EQUALITY_EXPRESSION
,
1395 PREC_RELATIONAL_EXPRESSION
,
1396 PREC_SHIFT_EXPRESSION
,
1397 PREC_ADDITIVE_EXPRESSION
,
1398 PREC_MULTIPLICATIVE_EXPRESSION
,
1400 NUM_PREC_VALUES
= PREC_PM_EXPRESSION
1403 /* A mapping from a token type to a corresponding tree node type, with a
1404 precedence value. */
1406 typedef struct cp_parser_binary_operations_map_node
1408 /* The token type. */
1409 enum cpp_ttype token_type
;
1410 /* The corresponding tree code. */
1411 enum tree_code tree_type
;
1412 /* The precedence of this operator. */
1413 enum cp_parser_prec prec
;
1414 } cp_parser_binary_operations_map_node
;
1416 /* The status of a tentative parse. */
1418 typedef enum cp_parser_status_kind
1420 /* No errors have occurred. */
1421 CP_PARSER_STATUS_KIND_NO_ERROR
,
1422 /* An error has occurred. */
1423 CP_PARSER_STATUS_KIND_ERROR
,
1424 /* We are committed to this tentative parse, whether or not an error
1426 CP_PARSER_STATUS_KIND_COMMITTED
1427 } cp_parser_status_kind
;
1429 typedef struct cp_parser_expression_stack_entry
1431 /* Left hand side of the binary operation we are currently
1434 /* Original tree code for left hand side, if it was a binary
1435 expression itself (used for -Wparentheses). */
1436 enum tree_code lhs_type
;
1437 /* Tree code for the binary operation we are parsing. */
1438 enum tree_code tree_type
;
1439 /* Precedence of the binary operation we are parsing. */
1440 enum cp_parser_prec prec
;
1441 } cp_parser_expression_stack_entry
;
1443 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1444 entries because precedence levels on the stack are monotonically
1446 typedef struct cp_parser_expression_stack_entry
1447 cp_parser_expression_stack
[NUM_PREC_VALUES
];
1449 /* Context that is saved and restored when parsing tentatively. */
1450 typedef struct GTY (()) cp_parser_context
{
1451 /* If this is a tentative parsing context, the status of the
1453 enum cp_parser_status_kind status
;
1454 /* If non-NULL, we have just seen a `x->' or `x.' expression. Names
1455 that are looked up in this context must be looked up both in the
1456 scope given by OBJECT_TYPE (the type of `x' or `*x') and also in
1457 the context of the containing expression. */
1460 /* The next parsing context in the stack. */
1461 struct cp_parser_context
*next
;
1462 } cp_parser_context
;
1466 /* Constructors and destructors. */
1468 static cp_parser_context
*cp_parser_context_new
1469 (cp_parser_context
*);
1471 /* Class variables. */
1473 static GTY((deletable
)) cp_parser_context
* cp_parser_context_free_list
;
1475 /* The operator-precedence table used by cp_parser_binary_expression.
1476 Transformed into an associative array (binops_by_token) by
1479 static const cp_parser_binary_operations_map_node binops
[] = {
1480 { CPP_DEREF_STAR
, MEMBER_REF
, PREC_PM_EXPRESSION
},
1481 { CPP_DOT_STAR
, DOTSTAR_EXPR
, PREC_PM_EXPRESSION
},
1483 { CPP_MULT
, MULT_EXPR
, PREC_MULTIPLICATIVE_EXPRESSION
},
1484 { CPP_DIV
, TRUNC_DIV_EXPR
, PREC_MULTIPLICATIVE_EXPRESSION
},
1485 { CPP_MOD
, TRUNC_MOD_EXPR
, PREC_MULTIPLICATIVE_EXPRESSION
},
1487 { CPP_PLUS
, PLUS_EXPR
, PREC_ADDITIVE_EXPRESSION
},
1488 { CPP_MINUS
, MINUS_EXPR
, PREC_ADDITIVE_EXPRESSION
},
1490 { CPP_LSHIFT
, LSHIFT_EXPR
, PREC_SHIFT_EXPRESSION
},
1491 { CPP_RSHIFT
, RSHIFT_EXPR
, PREC_SHIFT_EXPRESSION
},
1493 { CPP_LESS
, LT_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1494 { CPP_GREATER
, GT_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1495 { CPP_LESS_EQ
, LE_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1496 { CPP_GREATER_EQ
, GE_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1498 { CPP_EQ_EQ
, EQ_EXPR
, PREC_EQUALITY_EXPRESSION
},
1499 { CPP_NOT_EQ
, NE_EXPR
, PREC_EQUALITY_EXPRESSION
},
1501 { CPP_AND
, BIT_AND_EXPR
, PREC_AND_EXPRESSION
},
1503 { CPP_XOR
, BIT_XOR_EXPR
, PREC_EXCLUSIVE_OR_EXPRESSION
},
1505 { CPP_OR
, BIT_IOR_EXPR
, PREC_INCLUSIVE_OR_EXPRESSION
},
1507 { CPP_AND_AND
, TRUTH_ANDIF_EXPR
, PREC_LOGICAL_AND_EXPRESSION
},
1509 { CPP_OR_OR
, TRUTH_ORIF_EXPR
, PREC_LOGICAL_OR_EXPRESSION
}
1512 /* The same as binops, but initialized by cp_parser_new so that
1513 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1515 static cp_parser_binary_operations_map_node binops_by_token
[N_CP_TTYPES
];
1517 /* Constructors and destructors. */
1519 /* Construct a new context. The context below this one on the stack
1520 is given by NEXT. */
1522 static cp_parser_context
*
1523 cp_parser_context_new (cp_parser_context
* next
)
1525 cp_parser_context
*context
;
1527 /* Allocate the storage. */
1528 if (cp_parser_context_free_list
!= NULL
)
1530 /* Pull the first entry from the free list. */
1531 context
= cp_parser_context_free_list
;
1532 cp_parser_context_free_list
= context
->next
;
1533 memset (context
, 0, sizeof (*context
));
1536 context
= ggc_alloc_cleared_cp_parser_context ();
1538 /* No errors have occurred yet in this context. */
1539 context
->status
= CP_PARSER_STATUS_KIND_NO_ERROR
;
1540 /* If this is not the bottommost context, copy information that we
1541 need from the previous context. */
1544 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1545 expression, then we are parsing one in this context, too. */
1546 context
->object_type
= next
->object_type
;
1547 /* Thread the stack. */
1548 context
->next
= next
;
1554 /* An entry in a queue of function arguments that require post-processing. */
1556 typedef struct GTY(()) cp_default_arg_entry_d
{
1557 /* The current_class_type when we parsed this arg. */
1560 /* The function decl itself. */
1562 } cp_default_arg_entry
;
1564 DEF_VEC_O(cp_default_arg_entry
);
1565 DEF_VEC_ALLOC_O(cp_default_arg_entry
,gc
);
1567 /* An entry in a stack for member functions of local classes. */
1569 typedef struct GTY(()) cp_unparsed_functions_entry_d
{
1570 /* Functions with default arguments that require post-processing.
1571 Functions appear in this list in declaration order. */
1572 VEC(cp_default_arg_entry
,gc
) *funs_with_default_args
;
1574 /* Functions with defintions that require post-processing. Functions
1575 appear in this list in declaration order. */
1576 VEC(tree
,gc
) *funs_with_definitions
;
1577 } cp_unparsed_functions_entry
;
1579 DEF_VEC_O(cp_unparsed_functions_entry
);
1580 DEF_VEC_ALLOC_O(cp_unparsed_functions_entry
,gc
);
1582 /* The cp_parser structure represents the C++ parser. */
1584 typedef struct GTY(()) cp_parser
{
1585 /* The lexer from which we are obtaining tokens. */
1588 /* The scope in which names should be looked up. If NULL_TREE, then
1589 we look up names in the scope that is currently open in the
1590 source program. If non-NULL, this is either a TYPE or
1591 NAMESPACE_DECL for the scope in which we should look. It can
1592 also be ERROR_MARK, when we've parsed a bogus scope.
1594 This value is not cleared automatically after a name is looked
1595 up, so we must be careful to clear it before starting a new look
1596 up sequence. (If it is not cleared, then `X::Y' followed by `Z'
1597 will look up `Z' in the scope of `X', rather than the current
1598 scope.) Unfortunately, it is difficult to tell when name lookup
1599 is complete, because we sometimes peek at a token, look it up,
1600 and then decide not to consume it. */
1603 /* OBJECT_SCOPE and QUALIFYING_SCOPE give the scopes in which the
1604 last lookup took place. OBJECT_SCOPE is used if an expression
1605 like "x->y" or "x.y" was used; it gives the type of "*x" or "x",
1606 respectively. QUALIFYING_SCOPE is used for an expression of the
1607 form "X::Y"; it refers to X. */
1609 tree qualifying_scope
;
1611 /* A stack of parsing contexts. All but the bottom entry on the
1612 stack will be tentative contexts.
1614 We parse tentatively in order to determine which construct is in
1615 use in some situations. For example, in order to determine
1616 whether a statement is an expression-statement or a
1617 declaration-statement we parse it tentatively as a
1618 declaration-statement. If that fails, we then reparse the same
1619 token stream as an expression-statement. */
1620 cp_parser_context
*context
;
1622 /* True if we are parsing GNU C++. If this flag is not set, then
1623 GNU extensions are not recognized. */
1624 bool allow_gnu_extensions_p
;
1626 /* TRUE if the `>' token should be interpreted as the greater-than
1627 operator. FALSE if it is the end of a template-id or
1628 template-parameter-list. In C++0x mode, this flag also applies to
1629 `>>' tokens, which are viewed as two consecutive `>' tokens when
1630 this flag is FALSE. */
1631 bool greater_than_is_operator_p
;
1633 /* TRUE if default arguments are allowed within a parameter list
1634 that starts at this point. FALSE if only a gnu extension makes
1635 them permissible. */
1636 bool default_arg_ok_p
;
1638 /* TRUE if we are parsing an integral constant-expression. See
1639 [expr.const] for a precise definition. */
1640 bool integral_constant_expression_p
;
1642 /* TRUE if we are parsing an integral constant-expression -- but a
1643 non-constant expression should be permitted as well. This flag
1644 is used when parsing an array bound so that GNU variable-length
1645 arrays are tolerated. */
1646 bool allow_non_integral_constant_expression_p
;
1648 /* TRUE if ALLOW_NON_CONSTANT_EXPRESSION_P is TRUE and something has
1649 been seen that makes the expression non-constant. */
1650 bool non_integral_constant_expression_p
;
1652 /* TRUE if local variable names and `this' are forbidden in the
1654 bool local_variables_forbidden_p
;
1656 /* TRUE if the declaration we are parsing is part of a
1657 linkage-specification of the form `extern string-literal
1659 bool in_unbraced_linkage_specification_p
;
1661 /* TRUE if we are presently parsing a declarator, after the
1662 direct-declarator. */
1663 bool in_declarator_p
;
1665 /* TRUE if we are presently parsing a template-argument-list. */
1666 bool in_template_argument_list_p
;
1668 /* Set to IN_ITERATION_STMT if parsing an iteration-statement,
1669 to IN_OMP_BLOCK if parsing OpenMP structured block and
1670 IN_OMP_FOR if parsing OpenMP loop. If parsing a switch statement,
1671 this is bitwise ORed with IN_SWITCH_STMT, unless parsing an
1672 iteration-statement, OpenMP block or loop within that switch. */
1673 #define IN_SWITCH_STMT 1
1674 #define IN_ITERATION_STMT 2
1675 #define IN_OMP_BLOCK 4
1676 #define IN_OMP_FOR 8
1677 #define IN_IF_STMT 16
1678 unsigned char in_statement
;
1680 /* TRUE if we are presently parsing the body of a switch statement.
1681 Note that this doesn't quite overlap with in_statement above.
1682 The difference relates to giving the right sets of error messages:
1683 "case not in switch" vs "break statement used with OpenMP...". */
1684 bool in_switch_statement_p
;
1686 /* TRUE if we are parsing a type-id in an expression context. In
1687 such a situation, both "type (expr)" and "type (type)" are valid
1689 bool in_type_id_in_expr_p
;
1691 /* TRUE if we are currently in a header file where declarations are
1692 implicitly extern "C". */
1693 bool implicit_extern_c
;
1695 /* TRUE if strings in expressions should be translated to the execution
1697 bool translate_strings_p
;
1699 /* TRUE if we are presently parsing the body of a function, but not
1701 bool in_function_body
;
1703 /* TRUE if we can auto-correct a colon to a scope operator. */
1704 bool colon_corrects_to_scope_p
;
1706 /* If non-NULL, then we are parsing a construct where new type
1707 definitions are not permitted. The string stored here will be
1708 issued as an error message if a type is defined. */
1709 const char *type_definition_forbidden_message
;
1711 /* A stack used for member functions of local classes. The lists
1712 contained in an individual entry can only be processed once the
1713 outermost class being defined is complete. */
1714 VEC(cp_unparsed_functions_entry
,gc
) *unparsed_queues
;
1716 /* The number of classes whose definitions are currently in
1718 unsigned num_classes_being_defined
;
1720 /* The number of template parameter lists that apply directly to the
1721 current declaration. */
1722 unsigned num_template_parameter_lists
;
1725 /* Managing the unparsed function queues. */
1727 #define unparsed_funs_with_default_args \
1728 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues)->funs_with_default_args
1729 #define unparsed_funs_with_definitions \
1730 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues)->funs_with_definitions
1733 push_unparsed_function_queues (cp_parser
*parser
)
1735 VEC_safe_push (cp_unparsed_functions_entry
, gc
,
1736 parser
->unparsed_queues
, NULL
);
1737 unparsed_funs_with_default_args
= NULL
;
1738 unparsed_funs_with_definitions
= make_tree_vector ();
1742 pop_unparsed_function_queues (cp_parser
*parser
)
1744 release_tree_vector (unparsed_funs_with_definitions
);
1745 VEC_pop (cp_unparsed_functions_entry
, parser
->unparsed_queues
);
1750 /* Constructors and destructors. */
1752 static cp_parser
*cp_parser_new
1755 /* Routines to parse various constructs.
1757 Those that return `tree' will return the error_mark_node (rather
1758 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1759 Sometimes, they will return an ordinary node if error-recovery was
1760 attempted, even though a parse error occurred. So, to check
1761 whether or not a parse error occurred, you should always use
1762 cp_parser_error_occurred. If the construct is optional (indicated
1763 either by an `_opt' in the name of the function that does the
1764 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1765 the construct is not present. */
1767 /* Lexical conventions [gram.lex] */
1769 static tree cp_parser_identifier
1771 static tree cp_parser_string_literal
1772 (cp_parser
*, bool, bool);
1774 /* Basic concepts [gram.basic] */
1776 static bool cp_parser_translation_unit
1779 /* Expressions [gram.expr] */
1781 static tree cp_parser_primary_expression
1782 (cp_parser
*, bool, bool, bool, cp_id_kind
*);
1783 static tree cp_parser_id_expression
1784 (cp_parser
*, bool, bool, bool *, bool, bool);
1785 static tree cp_parser_unqualified_id
1786 (cp_parser
*, bool, bool, bool, bool);
1787 static tree cp_parser_nested_name_specifier_opt
1788 (cp_parser
*, bool, bool, bool, bool);
1789 static tree cp_parser_nested_name_specifier
1790 (cp_parser
*, bool, bool, bool, bool);
1791 static tree cp_parser_qualifying_entity
1792 (cp_parser
*, bool, bool, bool, bool, bool);
1793 static tree cp_parser_postfix_expression
1794 (cp_parser
*, bool, bool, bool, cp_id_kind
*);
1795 static tree cp_parser_postfix_open_square_expression
1796 (cp_parser
*, tree
, bool);
1797 static tree cp_parser_postfix_dot_deref_expression
1798 (cp_parser
*, enum cpp_ttype
, tree
, bool, cp_id_kind
*, location_t
);
1799 static VEC(tree
,gc
) *cp_parser_parenthesized_expression_list
1800 (cp_parser
*, int, bool, bool, bool *);
1801 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1802 enum { non_attr
= 0, normal_attr
= 1, id_attr
= 2 };
1803 static void cp_parser_pseudo_destructor_name
1804 (cp_parser
*, tree
*, tree
*);
1805 static tree cp_parser_unary_expression
1806 (cp_parser
*, bool, bool, cp_id_kind
*);
1807 static enum tree_code cp_parser_unary_operator
1809 static tree cp_parser_new_expression
1811 static VEC(tree
,gc
) *cp_parser_new_placement
1813 static tree cp_parser_new_type_id
1814 (cp_parser
*, tree
*);
1815 static cp_declarator
*cp_parser_new_declarator_opt
1817 static cp_declarator
*cp_parser_direct_new_declarator
1819 static VEC(tree
,gc
) *cp_parser_new_initializer
1821 static tree cp_parser_delete_expression
1823 static tree cp_parser_cast_expression
1824 (cp_parser
*, bool, bool, cp_id_kind
*);
1825 static tree cp_parser_binary_expression
1826 (cp_parser
*, bool, bool, enum cp_parser_prec
, cp_id_kind
*);
1827 static tree cp_parser_question_colon_clause
1828 (cp_parser
*, tree
);
1829 static tree cp_parser_assignment_expression
1830 (cp_parser
*, bool, cp_id_kind
*);
1831 static enum tree_code cp_parser_assignment_operator_opt
1833 static tree cp_parser_expression
1834 (cp_parser
*, bool, cp_id_kind
*);
1835 static tree cp_parser_constant_expression
1836 (cp_parser
*, bool, bool *);
1837 static tree cp_parser_builtin_offsetof
1839 static tree cp_parser_lambda_expression
1841 static void cp_parser_lambda_introducer
1842 (cp_parser
*, tree
);
1843 static void cp_parser_lambda_declarator_opt
1844 (cp_parser
*, tree
);
1845 static void cp_parser_lambda_body
1846 (cp_parser
*, tree
);
1848 /* Statements [gram.stmt.stmt] */
1850 static void cp_parser_statement
1851 (cp_parser
*, tree
, bool, bool *);
1852 static void cp_parser_label_for_labeled_statement
1854 static tree cp_parser_expression_statement
1855 (cp_parser
*, tree
);
1856 static tree cp_parser_compound_statement
1857 (cp_parser
*, tree
, bool);
1858 static void cp_parser_statement_seq_opt
1859 (cp_parser
*, tree
);
1860 static tree cp_parser_selection_statement
1861 (cp_parser
*, bool *);
1862 static tree cp_parser_condition
1864 static tree cp_parser_iteration_statement
1866 static bool cp_parser_for_init_statement
1867 (cp_parser
*, tree
*decl
);
1868 static tree cp_parser_for
1870 static tree cp_parser_c_for
1871 (cp_parser
*, tree
, tree
);
1872 static tree cp_parser_range_for
1873 (cp_parser
*, tree
, tree
, tree
);
1874 static tree cp_parser_jump_statement
1876 static void cp_parser_declaration_statement
1879 static tree cp_parser_implicitly_scoped_statement
1880 (cp_parser
*, bool *);
1881 static void cp_parser_already_scoped_statement
1884 /* Declarations [gram.dcl.dcl] */
1886 static void cp_parser_declaration_seq_opt
1888 static void cp_parser_declaration
1890 static void cp_parser_block_declaration
1891 (cp_parser
*, bool);
1892 static void cp_parser_simple_declaration
1893 (cp_parser
*, bool, tree
*);
1894 static void cp_parser_decl_specifier_seq
1895 (cp_parser
*, cp_parser_flags
, cp_decl_specifier_seq
*, int *);
1896 static tree cp_parser_storage_class_specifier_opt
1898 static tree cp_parser_function_specifier_opt
1899 (cp_parser
*, cp_decl_specifier_seq
*);
1900 static tree cp_parser_type_specifier
1901 (cp_parser
*, cp_parser_flags
, cp_decl_specifier_seq
*, bool,
1903 static tree cp_parser_simple_type_specifier
1904 (cp_parser
*, cp_decl_specifier_seq
*, cp_parser_flags
);
1905 static tree cp_parser_type_name
1907 static tree cp_parser_nonclass_name
1908 (cp_parser
* parser
);
1909 static tree cp_parser_elaborated_type_specifier
1910 (cp_parser
*, bool, bool);
1911 static tree cp_parser_enum_specifier
1913 static void cp_parser_enumerator_list
1914 (cp_parser
*, tree
);
1915 static void cp_parser_enumerator_definition
1916 (cp_parser
*, tree
);
1917 static tree cp_parser_namespace_name
1919 static void cp_parser_namespace_definition
1921 static void cp_parser_namespace_body
1923 static tree cp_parser_qualified_namespace_specifier
1925 static void cp_parser_namespace_alias_definition
1927 static bool cp_parser_using_declaration
1928 (cp_parser
*, bool);
1929 static void cp_parser_using_directive
1931 static void cp_parser_asm_definition
1933 static void cp_parser_linkage_specification
1935 static void cp_parser_static_assert
1936 (cp_parser
*, bool);
1937 static tree cp_parser_decltype
1940 /* Declarators [gram.dcl.decl] */
1942 static tree cp_parser_init_declarator
1943 (cp_parser
*, cp_decl_specifier_seq
*, VEC (deferred_access_check
,gc
)*, bool, bool, int, bool *, tree
*);
1944 static cp_declarator
*cp_parser_declarator
1945 (cp_parser
*, cp_parser_declarator_kind
, int *, bool *, bool);
1946 static cp_declarator
*cp_parser_direct_declarator
1947 (cp_parser
*, cp_parser_declarator_kind
, int *, bool);
1948 static enum tree_code cp_parser_ptr_operator
1949 (cp_parser
*, tree
*, cp_cv_quals
*);
1950 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
1952 static tree cp_parser_late_return_type_opt
1954 static tree cp_parser_declarator_id
1955 (cp_parser
*, bool);
1956 static tree cp_parser_type_id
1958 static tree cp_parser_template_type_arg
1960 static tree
cp_parser_trailing_type_id (cp_parser
*);
1961 static tree cp_parser_type_id_1
1962 (cp_parser
*, bool, bool);
1963 static void cp_parser_type_specifier_seq
1964 (cp_parser
*, bool, bool, cp_decl_specifier_seq
*);
1965 static tree cp_parser_parameter_declaration_clause
1967 static tree cp_parser_parameter_declaration_list
1968 (cp_parser
*, bool *);
1969 static cp_parameter_declarator
*cp_parser_parameter_declaration
1970 (cp_parser
*, bool, bool *);
1971 static tree cp_parser_default_argument
1972 (cp_parser
*, bool);
1973 static void cp_parser_function_body
1975 static tree cp_parser_initializer
1976 (cp_parser
*, bool *, bool *);
1977 static tree cp_parser_initializer_clause
1978 (cp_parser
*, bool *);
1979 static tree cp_parser_braced_list
1980 (cp_parser
*, bool*);
1981 static VEC(constructor_elt
,gc
) *cp_parser_initializer_list
1982 (cp_parser
*, bool *);
1984 static bool cp_parser_ctor_initializer_opt_and_function_body
1987 /* Classes [gram.class] */
1989 static tree cp_parser_class_name
1990 (cp_parser
*, bool, bool, enum tag_types
, bool, bool, bool);
1991 static tree cp_parser_class_specifier
1993 static tree cp_parser_class_head
1994 (cp_parser
*, bool *, tree
*, tree
*);
1995 static enum tag_types cp_parser_class_key
1997 static void cp_parser_member_specification_opt
1999 static void cp_parser_member_declaration
2001 static tree cp_parser_pure_specifier
2003 static tree cp_parser_constant_initializer
2006 /* Derived classes [gram.class.derived] */
2008 static tree cp_parser_base_clause
2010 static tree cp_parser_base_specifier
2013 /* Special member functions [gram.special] */
2015 static tree cp_parser_conversion_function_id
2017 static tree cp_parser_conversion_type_id
2019 static cp_declarator
*cp_parser_conversion_declarator_opt
2021 static bool cp_parser_ctor_initializer_opt
2023 static void cp_parser_mem_initializer_list
2025 static tree cp_parser_mem_initializer
2027 static tree cp_parser_mem_initializer_id
2030 /* Overloading [gram.over] */
2032 static tree cp_parser_operator_function_id
2034 static tree cp_parser_operator
2037 /* Templates [gram.temp] */
2039 static void cp_parser_template_declaration
2040 (cp_parser
*, bool);
2041 static tree cp_parser_template_parameter_list
2043 static tree cp_parser_template_parameter
2044 (cp_parser
*, bool *, bool *);
2045 static tree cp_parser_type_parameter
2046 (cp_parser
*, bool *);
2047 static tree cp_parser_template_id
2048 (cp_parser
*, bool, bool, bool);
2049 static tree cp_parser_template_name
2050 (cp_parser
*, bool, bool, bool, bool *);
2051 static tree cp_parser_template_argument_list
2053 static tree cp_parser_template_argument
2055 static void cp_parser_explicit_instantiation
2057 static void cp_parser_explicit_specialization
2060 /* Exception handling [gram.exception] */
2062 static tree cp_parser_try_block
2064 static bool cp_parser_function_try_block
2066 static void cp_parser_handler_seq
2068 static void cp_parser_handler
2070 static tree cp_parser_exception_declaration
2072 static tree cp_parser_throw_expression
2074 static tree cp_parser_exception_specification_opt
2076 static tree cp_parser_type_id_list
2079 /* GNU Extensions */
2081 static tree cp_parser_asm_specification_opt
2083 static tree cp_parser_asm_operand_list
2085 static tree cp_parser_asm_clobber_list
2087 static tree cp_parser_asm_label_list
2089 static tree cp_parser_attributes_opt
2091 static tree cp_parser_attribute_list
2093 static bool cp_parser_extension_opt
2094 (cp_parser
*, int *);
2095 static void cp_parser_label_declaration
2098 enum pragma_context
{ pragma_external
, pragma_stmt
, pragma_compound
};
2099 static bool cp_parser_pragma
2100 (cp_parser
*, enum pragma_context
);
2102 /* Objective-C++ Productions */
2104 static tree cp_parser_objc_message_receiver
2106 static tree cp_parser_objc_message_args
2108 static tree cp_parser_objc_message_expression
2110 static tree cp_parser_objc_encode_expression
2112 static tree cp_parser_objc_defs_expression
2114 static tree cp_parser_objc_protocol_expression
2116 static tree cp_parser_objc_selector_expression
2118 static tree cp_parser_objc_expression
2120 static bool cp_parser_objc_selector_p
2122 static tree cp_parser_objc_selector
2124 static tree cp_parser_objc_protocol_refs_opt
2126 static void cp_parser_objc_declaration
2127 (cp_parser
*, tree
);
2128 static tree cp_parser_objc_statement
2130 static bool cp_parser_objc_valid_prefix_attributes
2131 (cp_parser
*, tree
*);
2132 static void cp_parser_objc_at_property_declaration
2134 static void cp_parser_objc_at_synthesize_declaration
2136 static void cp_parser_objc_at_dynamic_declaration
2138 static tree cp_parser_objc_struct_declaration
2141 /* Utility Routines */
2143 static tree cp_parser_lookup_name
2144 (cp_parser
*, tree
, enum tag_types
, bool, bool, bool, tree
*, location_t
);
2145 static tree cp_parser_lookup_name_simple
2146 (cp_parser
*, tree
, location_t
);
2147 static tree cp_parser_maybe_treat_template_as_class
2149 static bool cp_parser_check_declarator_template_parameters
2150 (cp_parser
*, cp_declarator
*, location_t
);
2151 static bool cp_parser_check_template_parameters
2152 (cp_parser
*, unsigned, location_t
, cp_declarator
*);
2153 static tree cp_parser_simple_cast_expression
2155 static tree cp_parser_global_scope_opt
2156 (cp_parser
*, bool);
2157 static bool cp_parser_constructor_declarator_p
2158 (cp_parser
*, bool);
2159 static tree cp_parser_function_definition_from_specifiers_and_declarator
2160 (cp_parser
*, cp_decl_specifier_seq
*, tree
, const cp_declarator
*);
2161 static tree cp_parser_function_definition_after_declarator
2162 (cp_parser
*, bool);
2163 static void cp_parser_template_declaration_after_export
2164 (cp_parser
*, bool);
2165 static void cp_parser_perform_template_parameter_access_checks
2166 (VEC (deferred_access_check
,gc
)*);
2167 static tree cp_parser_single_declaration
2168 (cp_parser
*, VEC (deferred_access_check
,gc
)*, bool, bool, bool *);
2169 static tree cp_parser_functional_cast
2170 (cp_parser
*, tree
);
2171 static tree cp_parser_save_member_function_body
2172 (cp_parser
*, cp_decl_specifier_seq
*, cp_declarator
*, tree
);
2173 static tree cp_parser_enclosed_template_argument_list
2175 static void cp_parser_save_default_args
2176 (cp_parser
*, tree
);
2177 static void cp_parser_late_parsing_for_member
2178 (cp_parser
*, tree
);
2179 static void cp_parser_late_parsing_default_args
2180 (cp_parser
*, tree
);
2181 static tree cp_parser_sizeof_operand
2182 (cp_parser
*, enum rid
);
2183 static tree cp_parser_trait_expr
2184 (cp_parser
*, enum rid
);
2185 static bool cp_parser_declares_only_class_p
2187 static void cp_parser_set_storage_class
2188 (cp_parser
*, cp_decl_specifier_seq
*, enum rid
, location_t
);
2189 static void cp_parser_set_decl_spec_type
2190 (cp_decl_specifier_seq
*, tree
, location_t
, bool);
2191 static bool cp_parser_friend_p
2192 (const cp_decl_specifier_seq
*);
2193 static void cp_parser_required_error
2194 (cp_parser
*, required_token
, bool);
2195 static cp_token
*cp_parser_require
2196 (cp_parser
*, enum cpp_ttype
, required_token
);
2197 static cp_token
*cp_parser_require_keyword
2198 (cp_parser
*, enum rid
, required_token
);
2199 static bool cp_parser_token_starts_function_definition_p
2201 static bool cp_parser_next_token_starts_class_definition_p
2203 static bool cp_parser_next_token_ends_template_argument_p
2205 static bool cp_parser_nth_token_starts_template_argument_list_p
2206 (cp_parser
*, size_t);
2207 static enum tag_types cp_parser_token_is_class_key
2209 static void cp_parser_check_class_key
2210 (enum tag_types
, tree type
);
2211 static void cp_parser_check_access_in_redeclaration
2212 (tree type
, location_t location
);
2213 static bool cp_parser_optional_template_keyword
2215 static void cp_parser_pre_parsed_nested_name_specifier
2217 static bool cp_parser_cache_group
2218 (cp_parser
*, enum cpp_ttype
, unsigned);
2219 static void cp_parser_parse_tentatively
2221 static void cp_parser_commit_to_tentative_parse
2223 static void cp_parser_abort_tentative_parse
2225 static bool cp_parser_parse_definitely
2227 static inline bool cp_parser_parsing_tentatively
2229 static bool cp_parser_uncommitted_to_tentative_parse_p
2231 static void cp_parser_error
2232 (cp_parser
*, const char *);
2233 static void cp_parser_name_lookup_error
2234 (cp_parser
*, tree
, tree
, name_lookup_error
, location_t
);
2235 static bool cp_parser_simulate_error
2237 static bool cp_parser_check_type_definition
2239 static void cp_parser_check_for_definition_in_return_type
2240 (cp_declarator
*, tree
, location_t type_location
);
2241 static void cp_parser_check_for_invalid_template_id
2242 (cp_parser
*, tree
, location_t location
);
2243 static bool cp_parser_non_integral_constant_expression
2244 (cp_parser
*, non_integral_constant
);
2245 static void cp_parser_diagnose_invalid_type_name
2246 (cp_parser
*, tree
, tree
, location_t
);
2247 static bool cp_parser_parse_and_diagnose_invalid_type_name
2249 static int cp_parser_skip_to_closing_parenthesis
2250 (cp_parser
*, bool, bool, bool);
2251 static void cp_parser_skip_to_end_of_statement
2253 static void cp_parser_consume_semicolon_at_end_of_statement
2255 static void cp_parser_skip_to_end_of_block_or_statement
2257 static bool cp_parser_skip_to_closing_brace
2259 static void cp_parser_skip_to_end_of_template_parameter_list
2261 static void cp_parser_skip_to_pragma_eol
2262 (cp_parser
*, cp_token
*);
2263 static bool cp_parser_error_occurred
2265 static bool cp_parser_allow_gnu_extensions_p
2267 static bool cp_parser_is_string_literal
2269 static bool cp_parser_is_keyword
2270 (cp_token
*, enum rid
);
2271 static tree cp_parser_make_typename_type
2272 (cp_parser
*, tree
, tree
, location_t location
);
2273 static cp_declarator
* cp_parser_make_indirect_declarator
2274 (enum tree_code
, tree
, cp_cv_quals
, cp_declarator
*);
2276 /* Returns nonzero if we are parsing tentatively. */
2279 cp_parser_parsing_tentatively (cp_parser
* parser
)
2281 return parser
->context
->next
!= NULL
;
2284 /* Returns nonzero if TOKEN is a string literal. */
2287 cp_parser_is_string_literal (cp_token
* token
)
2289 return (token
->type
== CPP_STRING
||
2290 token
->type
== CPP_STRING16
||
2291 token
->type
== CPP_STRING32
||
2292 token
->type
== CPP_WSTRING
||
2293 token
->type
== CPP_UTF8STRING
);
2296 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2299 cp_parser_is_keyword (cp_token
* token
, enum rid keyword
)
2301 return token
->keyword
== keyword
;
2304 /* If not parsing tentatively, issue a diagnostic of the form
2305 FILE:LINE: MESSAGE before TOKEN
2306 where TOKEN is the next token in the input stream. MESSAGE
2307 (specified by the caller) is usually of the form "expected
2311 cp_parser_error (cp_parser
* parser
, const char* gmsgid
)
2313 if (!cp_parser_simulate_error (parser
))
2315 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
2316 /* This diagnostic makes more sense if it is tagged to the line
2317 of the token we just peeked at. */
2318 cp_lexer_set_source_position_from_token (token
);
2320 if (token
->type
== CPP_PRAGMA
)
2322 error_at (token
->location
,
2323 "%<#pragma%> is not allowed here");
2324 cp_parser_skip_to_pragma_eol (parser
, token
);
2328 c_parse_error (gmsgid
,
2329 /* Because c_parser_error does not understand
2330 CPP_KEYWORD, keywords are treated like
2332 (token
->type
== CPP_KEYWORD
? CPP_NAME
: token
->type
),
2333 token
->u
.value
, token
->flags
);
2337 /* Issue an error about name-lookup failing. NAME is the
2338 IDENTIFIER_NODE DECL is the result of
2339 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2340 the thing that we hoped to find. */
2343 cp_parser_name_lookup_error (cp_parser
* parser
,
2346 name_lookup_error desired
,
2347 location_t location
)
2349 /* If name lookup completely failed, tell the user that NAME was not
2351 if (decl
== error_mark_node
)
2353 if (parser
->scope
&& parser
->scope
!= global_namespace
)
2354 error_at (location
, "%<%E::%E%> has not been declared",
2355 parser
->scope
, name
);
2356 else if (parser
->scope
== global_namespace
)
2357 error_at (location
, "%<::%E%> has not been declared", name
);
2358 else if (parser
->object_scope
2359 && !CLASS_TYPE_P (parser
->object_scope
))
2360 error_at (location
, "request for member %qE in non-class type %qT",
2361 name
, parser
->object_scope
);
2362 else if (parser
->object_scope
)
2363 error_at (location
, "%<%T::%E%> has not been declared",
2364 parser
->object_scope
, name
);
2366 error_at (location
, "%qE has not been declared", name
);
2368 else if (parser
->scope
&& parser
->scope
!= global_namespace
)
2373 error_at (location
, "%<%E::%E%> is not a type",
2374 parser
->scope
, name
);
2377 error_at (location
, "%<%E::%E%> is not a class or namespace",
2378 parser
->scope
, name
);
2382 "%<%E::%E%> is not a class, namespace, or enumeration",
2383 parser
->scope
, name
);
2390 else if (parser
->scope
== global_namespace
)
2395 error_at (location
, "%<::%E%> is not a type", name
);
2398 error_at (location
, "%<::%E%> is not a class or namespace", name
);
2402 "%<::%E%> is not a class, namespace, or enumeration",
2414 error_at (location
, "%qE is not a type", name
);
2417 error_at (location
, "%qE is not a class or namespace", name
);
2421 "%qE is not a class, namespace, or enumeration", name
);
2429 /* If we are parsing tentatively, remember that an error has occurred
2430 during this tentative parse. Returns true if the error was
2431 simulated; false if a message should be issued by the caller. */
2434 cp_parser_simulate_error (cp_parser
* parser
)
2436 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
2438 parser
->context
->status
= CP_PARSER_STATUS_KIND_ERROR
;
2444 /* Check for repeated decl-specifiers. */
2447 cp_parser_check_decl_spec (cp_decl_specifier_seq
*decl_specs
,
2448 location_t location
)
2452 for (ds
= ds_first
; ds
!= ds_last
; ++ds
)
2454 unsigned count
= decl_specs
->specs
[ds
];
2457 /* The "long" specifier is a special case because of "long long". */
2461 error_at (location
, "%<long long long%> is too long for GCC");
2463 pedwarn_cxx98 (location
, OPT_Wlong_long
,
2464 "ISO C++ 1998 does not support %<long long%>");
2468 static const char *const decl_spec_names
[] = {
2485 error_at (location
, "duplicate %qs", decl_spec_names
[ds
]);
2490 /* This function is called when a type is defined. If type
2491 definitions are forbidden at this point, an error message is
2495 cp_parser_check_type_definition (cp_parser
* parser
)
2497 /* If types are forbidden here, issue a message. */
2498 if (parser
->type_definition_forbidden_message
)
2500 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2501 in the message need to be interpreted. */
2502 error (parser
->type_definition_forbidden_message
);
2508 /* This function is called when the DECLARATOR is processed. The TYPE
2509 was a type defined in the decl-specifiers. If it is invalid to
2510 define a type in the decl-specifiers for DECLARATOR, an error is
2511 issued. TYPE_LOCATION is the location of TYPE and is used
2512 for error reporting. */
2515 cp_parser_check_for_definition_in_return_type (cp_declarator
*declarator
,
2516 tree type
, location_t type_location
)
2518 /* [dcl.fct] forbids type definitions in return types.
2519 Unfortunately, it's not easy to know whether or not we are
2520 processing a return type until after the fact. */
2522 && (declarator
->kind
== cdk_pointer
2523 || declarator
->kind
== cdk_reference
2524 || declarator
->kind
== cdk_ptrmem
))
2525 declarator
= declarator
->declarator
;
2527 && declarator
->kind
== cdk_function
)
2529 error_at (type_location
,
2530 "new types may not be defined in a return type");
2531 inform (type_location
,
2532 "(perhaps a semicolon is missing after the definition of %qT)",
2537 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2538 "<" in any valid C++ program. If the next token is indeed "<",
2539 issue a message warning the user about what appears to be an
2540 invalid attempt to form a template-id. LOCATION is the location
2541 of the type-specifier (TYPE) */
2544 cp_parser_check_for_invalid_template_id (cp_parser
* parser
,
2545 tree type
, location_t location
)
2547 cp_token_position start
= 0;
2549 if (cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
2552 error_at (location
, "%qT is not a template", type
);
2553 else if (TREE_CODE (type
) == IDENTIFIER_NODE
)
2554 error_at (location
, "%qE is not a template", type
);
2556 error_at (location
, "invalid template-id");
2557 /* Remember the location of the invalid "<". */
2558 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
2559 start
= cp_lexer_token_position (parser
->lexer
, true);
2560 /* Consume the "<". */
2561 cp_lexer_consume_token (parser
->lexer
);
2562 /* Parse the template arguments. */
2563 cp_parser_enclosed_template_argument_list (parser
);
2564 /* Permanently remove the invalid template arguments so that
2565 this error message is not issued again. */
2567 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
2571 /* If parsing an integral constant-expression, issue an error message
2572 about the fact that THING appeared and return true. Otherwise,
2573 return false. In either case, set
2574 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2577 cp_parser_non_integral_constant_expression (cp_parser
*parser
,
2578 non_integral_constant thing
)
2580 parser
->non_integral_constant_expression_p
= true;
2581 if (parser
->integral_constant_expression_p
)
2583 if (!parser
->allow_non_integral_constant_expression_p
)
2585 const char *msg
= NULL
;
2589 error ("floating-point literal "
2590 "cannot appear in a constant-expression");
2593 error ("a cast to a type other than an integral or "
2594 "enumeration type cannot appear in a "
2595 "constant-expression");
2598 error ("%<typeid%> operator "
2599 "cannot appear in a constant-expression");
2602 error ("non-constant compound literals "
2603 "cannot appear in a constant-expression");
2606 error ("a function call "
2607 "cannot appear in a constant-expression");
2610 error ("an increment "
2611 "cannot appear in a constant-expression");
2614 error ("an decrement "
2615 "cannot appear in a constant-expression");
2618 error ("an array reference "
2619 "cannot appear in a constant-expression");
2621 case NIC_ADDR_LABEL
:
2622 error ("the address of a label "
2623 "cannot appear in a constant-expression");
2625 case NIC_OVERLOADED
:
2626 error ("calls to overloaded operators "
2627 "cannot appear in a constant-expression");
2629 case NIC_ASSIGNMENT
:
2630 error ("an assignment cannot appear in a constant-expression");
2633 error ("a comma operator "
2634 "cannot appear in a constant-expression");
2636 case NIC_CONSTRUCTOR
:
2637 error ("a call to a constructor "
2638 "cannot appear in a constant-expression");
2644 msg
= "__FUNCTION__";
2646 case NIC_PRETTY_FUNC
:
2647 msg
= "__PRETTY_FUNCTION__";
2667 case NIC_PREINCREMENT
:
2670 case NIC_PREDECREMENT
:
2683 error ("%qs cannot appear in a constant-expression", msg
);
2690 /* Emit a diagnostic for an invalid type name. SCOPE is the
2691 qualifying scope (or NULL, if none) for ID. This function commits
2692 to the current active tentative parse, if any. (Otherwise, the
2693 problematic construct might be encountered again later, resulting
2694 in duplicate error messages.) LOCATION is the location of ID. */
2697 cp_parser_diagnose_invalid_type_name (cp_parser
*parser
,
2698 tree scope
, tree id
,
2699 location_t location
)
2701 tree decl
, old_scope
;
2702 /* Try to lookup the identifier. */
2703 old_scope
= parser
->scope
;
2704 parser
->scope
= scope
;
2705 decl
= cp_parser_lookup_name_simple (parser
, id
, location
);
2706 parser
->scope
= old_scope
;
2707 /* If the lookup found a template-name, it means that the user forgot
2708 to specify an argument list. Emit a useful error message. */
2709 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2711 "invalid use of template-name %qE without an argument list",
2713 else if (TREE_CODE (id
) == BIT_NOT_EXPR
)
2714 error_at (location
, "invalid use of destructor %qD as a type", id
);
2715 else if (TREE_CODE (decl
) == TYPE_DECL
)
2716 /* Something like 'unsigned A a;' */
2717 error_at (location
, "invalid combination of multiple type-specifiers");
2718 else if (!parser
->scope
)
2720 /* Issue an error message. */
2721 error_at (location
, "%qE does not name a type", id
);
2722 /* If we're in a template class, it's possible that the user was
2723 referring to a type from a base class. For example:
2725 template <typename T> struct A { typedef T X; };
2726 template <typename T> struct B : public A<T> { X x; };
2728 The user should have said "typename A<T>::X". */
2729 if (cxx_dialect
< cxx0x
&& id
== ridpointers
[(int)RID_CONSTEXPR
])
2730 inform (location
, "C++0x %<constexpr%> only available with "
2731 "-std=c++0x or -std=gnu++0x");
2732 else if (processing_template_decl
&& current_class_type
2733 && TYPE_BINFO (current_class_type
))
2737 for (b
= TREE_CHAIN (TYPE_BINFO (current_class_type
));
2741 tree base_type
= BINFO_TYPE (b
);
2742 if (CLASS_TYPE_P (base_type
)
2743 && dependent_type_p (base_type
))
2746 /* Go from a particular instantiation of the
2747 template (which will have an empty TYPE_FIELDs),
2748 to the main version. */
2749 base_type
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (base_type
);
2750 for (field
= TYPE_FIELDS (base_type
);
2752 field
= DECL_CHAIN (field
))
2753 if (TREE_CODE (field
) == TYPE_DECL
2754 && DECL_NAME (field
) == id
)
2757 "(perhaps %<typename %T::%E%> was intended)",
2758 BINFO_TYPE (b
), id
);
2767 /* Here we diagnose qualified-ids where the scope is actually correct,
2768 but the identifier does not resolve to a valid type name. */
2769 else if (parser
->scope
!= error_mark_node
)
2771 if (TREE_CODE (parser
->scope
) == NAMESPACE_DECL
)
2772 error_at (location
, "%qE in namespace %qE does not name a type",
2774 else if (CLASS_TYPE_P (parser
->scope
)
2775 && constructor_name_p (id
, parser
->scope
))
2778 error_at (location
, "%<%T::%E%> names the constructor, not"
2779 " the type", parser
->scope
, id
);
2780 if (cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
2781 error_at (location
, "and %qT has no template constructors",
2784 else if (TYPE_P (parser
->scope
)
2785 && dependent_scope_p (parser
->scope
))
2786 error_at (location
, "need %<typename%> before %<%T::%E%> because "
2787 "%qT is a dependent scope",
2788 parser
->scope
, id
, parser
->scope
);
2789 else if (TYPE_P (parser
->scope
))
2790 error_at (location
, "%qE in class %qT does not name a type",
2795 cp_parser_commit_to_tentative_parse (parser
);
2798 /* Check for a common situation where a type-name should be present,
2799 but is not, and issue a sensible error message. Returns true if an
2800 invalid type-name was detected.
2802 The situation handled by this function are variable declarations of the
2803 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2804 Usually, `ID' should name a type, but if we got here it means that it
2805 does not. We try to emit the best possible error message depending on
2806 how exactly the id-expression looks like. */
2809 cp_parser_parse_and_diagnose_invalid_type_name (cp_parser
*parser
)
2812 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
2814 /* Avoid duplicate error about ambiguous lookup. */
2815 if (token
->type
== CPP_NESTED_NAME_SPECIFIER
)
2817 cp_token
*next
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
2818 if (next
->type
== CPP_NAME
&& next
->ambiguous_p
)
2822 cp_parser_parse_tentatively (parser
);
2823 id
= cp_parser_id_expression (parser
,
2824 /*template_keyword_p=*/false,
2825 /*check_dependency_p=*/true,
2826 /*template_p=*/NULL
,
2827 /*declarator_p=*/true,
2828 /*optional_p=*/false);
2829 /* If the next token is a (, this is a function with no explicit return
2830 type, i.e. constructor, destructor or conversion op. */
2831 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
)
2832 || TREE_CODE (id
) == TYPE_DECL
)
2834 cp_parser_abort_tentative_parse (parser
);
2837 if (!cp_parser_parse_definitely (parser
))
2840 /* Emit a diagnostic for the invalid type. */
2841 cp_parser_diagnose_invalid_type_name (parser
, parser
->scope
,
2842 id
, token
->location
);
2844 /* If we aren't in the middle of a declarator (i.e. in a
2845 parameter-declaration-clause), skip to the end of the declaration;
2846 there's no point in trying to process it. */
2847 if (!parser
->in_declarator_p
)
2848 cp_parser_skip_to_end_of_block_or_statement (parser
);
2852 /* Consume tokens up to, and including, the next non-nested closing `)'.
2853 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2854 are doing error recovery. Returns -1 if OR_COMMA is true and we
2855 found an unnested comma. */
2858 cp_parser_skip_to_closing_parenthesis (cp_parser
*parser
,
2863 unsigned paren_depth
= 0;
2864 unsigned brace_depth
= 0;
2865 unsigned square_depth
= 0;
2867 if (recovering
&& !or_comma
2868 && cp_parser_uncommitted_to_tentative_parse_p (parser
))
2873 cp_token
* token
= cp_lexer_peek_token (parser
->lexer
);
2875 switch (token
->type
)
2878 case CPP_PRAGMA_EOL
:
2879 /* If we've run out of tokens, then there is no closing `)'. */
2882 /* This is good for lambda expression capture-lists. */
2883 case CPP_OPEN_SQUARE
:
2886 case CPP_CLOSE_SQUARE
:
2887 if (!square_depth
--)
2892 /* This matches the processing in skip_to_end_of_statement. */
2897 case CPP_OPEN_BRACE
:
2900 case CPP_CLOSE_BRACE
:
2906 if (recovering
&& or_comma
&& !brace_depth
&& !paren_depth
2911 case CPP_OPEN_PAREN
:
2916 case CPP_CLOSE_PAREN
:
2917 if (!brace_depth
&& !paren_depth
--)
2920 cp_lexer_consume_token (parser
->lexer
);
2929 /* Consume the token. */
2930 cp_lexer_consume_token (parser
->lexer
);
2934 /* Consume tokens until we reach the end of the current statement.
2935 Normally, that will be just before consuming a `;'. However, if a
2936 non-nested `}' comes first, then we stop before consuming that. */
2939 cp_parser_skip_to_end_of_statement (cp_parser
* parser
)
2941 unsigned nesting_depth
= 0;
2945 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
2947 switch (token
->type
)
2950 case CPP_PRAGMA_EOL
:
2951 /* If we've run out of tokens, stop. */
2955 /* If the next token is a `;', we have reached the end of the
2961 case CPP_CLOSE_BRACE
:
2962 /* If this is a non-nested '}', stop before consuming it.
2963 That way, when confronted with something like:
2967 we stop before consuming the closing '}', even though we
2968 have not yet reached a `;'. */
2969 if (nesting_depth
== 0)
2972 /* If it is the closing '}' for a block that we have
2973 scanned, stop -- but only after consuming the token.
2979 we will stop after the body of the erroneously declared
2980 function, but before consuming the following `typedef'
2982 if (--nesting_depth
== 0)
2984 cp_lexer_consume_token (parser
->lexer
);
2988 case CPP_OPEN_BRACE
:
2996 /* Consume the token. */
2997 cp_lexer_consume_token (parser
->lexer
);
3001 /* This function is called at the end of a statement or declaration.
3002 If the next token is a semicolon, it is consumed; otherwise, error
3003 recovery is attempted. */
3006 cp_parser_consume_semicolon_at_end_of_statement (cp_parser
*parser
)
3008 /* Look for the trailing `;'. */
3009 if (!cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
))
3011 /* If there is additional (erroneous) input, skip to the end of
3013 cp_parser_skip_to_end_of_statement (parser
);
3014 /* If the next token is now a `;', consume it. */
3015 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
3016 cp_lexer_consume_token (parser
->lexer
);
3020 /* Skip tokens until we have consumed an entire block, or until we
3021 have consumed a non-nested `;'. */
3024 cp_parser_skip_to_end_of_block_or_statement (cp_parser
* parser
)
3026 int nesting_depth
= 0;
3028 while (nesting_depth
>= 0)
3030 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
3032 switch (token
->type
)
3035 case CPP_PRAGMA_EOL
:
3036 /* If we've run out of tokens, stop. */
3040 /* Stop if this is an unnested ';'. */
3045 case CPP_CLOSE_BRACE
:
3046 /* Stop if this is an unnested '}', or closes the outermost
3049 if (nesting_depth
< 0)
3055 case CPP_OPEN_BRACE
:
3064 /* Consume the token. */
3065 cp_lexer_consume_token (parser
->lexer
);
3069 /* Skip tokens until a non-nested closing curly brace is the next
3070 token, or there are no more tokens. Return true in the first case,
3074 cp_parser_skip_to_closing_brace (cp_parser
*parser
)
3076 unsigned nesting_depth
= 0;
3080 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
3082 switch (token
->type
)
3085 case CPP_PRAGMA_EOL
:
3086 /* If we've run out of tokens, stop. */
3089 case CPP_CLOSE_BRACE
:
3090 /* If the next token is a non-nested `}', then we have reached
3091 the end of the current block. */
3092 if (nesting_depth
-- == 0)
3096 case CPP_OPEN_BRACE
:
3097 /* If it the next token is a `{', then we are entering a new
3098 block. Consume the entire block. */
3106 /* Consume the token. */
3107 cp_lexer_consume_token (parser
->lexer
);
3111 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3112 parameter is the PRAGMA token, allowing us to purge the entire pragma
3116 cp_parser_skip_to_pragma_eol (cp_parser
* parser
, cp_token
*pragma_tok
)
3120 parser
->lexer
->in_pragma
= false;
3123 token
= cp_lexer_consume_token (parser
->lexer
);
3124 while (token
->type
!= CPP_PRAGMA_EOL
&& token
->type
!= CPP_EOF
);
3126 /* Ensure that the pragma is not parsed again. */
3127 cp_lexer_purge_tokens_after (parser
->lexer
, pragma_tok
);
3130 /* Require pragma end of line, resyncing with it as necessary. The
3131 arguments are as for cp_parser_skip_to_pragma_eol. */
3134 cp_parser_require_pragma_eol (cp_parser
*parser
, cp_token
*pragma_tok
)
3136 parser
->lexer
->in_pragma
= false;
3137 if (!cp_parser_require (parser
, CPP_PRAGMA_EOL
, RT_PRAGMA_EOL
))
3138 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
3141 /* This is a simple wrapper around make_typename_type. When the id is
3142 an unresolved identifier node, we can provide a superior diagnostic
3143 using cp_parser_diagnose_invalid_type_name. */
3146 cp_parser_make_typename_type (cp_parser
*parser
, tree scope
,
3147 tree id
, location_t id_location
)
3150 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
3152 result
= make_typename_type (scope
, id
, typename_type
,
3153 /*complain=*/tf_none
);
3154 if (result
== error_mark_node
)
3155 cp_parser_diagnose_invalid_type_name (parser
, scope
, id
, id_location
);
3158 return make_typename_type (scope
, id
, typename_type
, tf_error
);
3161 /* This is a wrapper around the
3162 make_{pointer,ptrmem,reference}_declarator functions that decides
3163 which one to call based on the CODE and CLASS_TYPE arguments. The
3164 CODE argument should be one of the values returned by
3165 cp_parser_ptr_operator. */
3166 static cp_declarator
*
3167 cp_parser_make_indirect_declarator (enum tree_code code
, tree class_type
,
3168 cp_cv_quals cv_qualifiers
,
3169 cp_declarator
*target
)
3171 if (code
== ERROR_MARK
)
3172 return cp_error_declarator
;
3174 if (code
== INDIRECT_REF
)
3175 if (class_type
== NULL_TREE
)
3176 return make_pointer_declarator (cv_qualifiers
, target
);
3178 return make_ptrmem_declarator (cv_qualifiers
, class_type
, target
);
3179 else if (code
== ADDR_EXPR
&& class_type
== NULL_TREE
)
3180 return make_reference_declarator (cv_qualifiers
, target
, false);
3181 else if (code
== NON_LVALUE_EXPR
&& class_type
== NULL_TREE
)
3182 return make_reference_declarator (cv_qualifiers
, target
, true);
3186 /* Create a new C++ parser. */
3189 cp_parser_new (void)
3195 /* cp_lexer_new_main is called before doing GC allocation because
3196 cp_lexer_new_main might load a PCH file. */
3197 lexer
= cp_lexer_new_main ();
3199 /* Initialize the binops_by_token so that we can get the tree
3200 directly from the token. */
3201 for (i
= 0; i
< sizeof (binops
) / sizeof (binops
[0]); i
++)
3202 binops_by_token
[binops
[i
].token_type
] = binops
[i
];
3204 parser
= ggc_alloc_cleared_cp_parser ();
3205 parser
->lexer
= lexer
;
3206 parser
->context
= cp_parser_context_new (NULL
);
3208 /* For now, we always accept GNU extensions. */
3209 parser
->allow_gnu_extensions_p
= 1;
3211 /* The `>' token is a greater-than operator, not the end of a
3213 parser
->greater_than_is_operator_p
= true;
3215 parser
->default_arg_ok_p
= true;
3217 /* We are not parsing a constant-expression. */
3218 parser
->integral_constant_expression_p
= false;
3219 parser
->allow_non_integral_constant_expression_p
= false;
3220 parser
->non_integral_constant_expression_p
= false;
3222 /* Local variable names are not forbidden. */
3223 parser
->local_variables_forbidden_p
= false;
3225 /* We are not processing an `extern "C"' declaration. */
3226 parser
->in_unbraced_linkage_specification_p
= false;
3228 /* We are not processing a declarator. */
3229 parser
->in_declarator_p
= false;
3231 /* We are not processing a template-argument-list. */
3232 parser
->in_template_argument_list_p
= false;
3234 /* We are not in an iteration statement. */
3235 parser
->in_statement
= 0;
3237 /* We are not in a switch statement. */
3238 parser
->in_switch_statement_p
= false;
3240 /* We are not parsing a type-id inside an expression. */
3241 parser
->in_type_id_in_expr_p
= false;
3243 /* Declarations aren't implicitly extern "C". */
3244 parser
->implicit_extern_c
= false;
3246 /* String literals should be translated to the execution character set. */
3247 parser
->translate_strings_p
= true;
3249 /* We are not parsing a function body. */
3250 parser
->in_function_body
= false;
3252 /* We can correct until told otherwise. */
3253 parser
->colon_corrects_to_scope_p
= true;
3255 /* The unparsed function queue is empty. */
3256 push_unparsed_function_queues (parser
);
3258 /* There are no classes being defined. */
3259 parser
->num_classes_being_defined
= 0;
3261 /* No template parameters apply. */
3262 parser
->num_template_parameter_lists
= 0;
3267 /* Create a cp_lexer structure which will emit the tokens in CACHE
3268 and push it onto the parser's lexer stack. This is used for delayed
3269 parsing of in-class method bodies and default arguments, and should
3270 not be confused with tentative parsing. */
3272 cp_parser_push_lexer_for_tokens (cp_parser
*parser
, cp_token_cache
*cache
)
3274 cp_lexer
*lexer
= cp_lexer_new_from_tokens (cache
);
3275 lexer
->next
= parser
->lexer
;
3276 parser
->lexer
= lexer
;
3278 /* Move the current source position to that of the first token in the
3280 cp_lexer_set_source_position_from_token (lexer
->next_token
);
3283 /* Pop the top lexer off the parser stack. This is never used for the
3284 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3286 cp_parser_pop_lexer (cp_parser
*parser
)
3288 cp_lexer
*lexer
= parser
->lexer
;
3289 parser
->lexer
= lexer
->next
;
3290 cp_lexer_destroy (lexer
);
3292 /* Put the current source position back where it was before this
3293 lexer was pushed. */
3294 cp_lexer_set_source_position_from_token (parser
->lexer
->next_token
);
3297 /* Lexical conventions [gram.lex] */
3299 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3303 cp_parser_identifier (cp_parser
* parser
)
3307 /* Look for the identifier. */
3308 token
= cp_parser_require (parser
, CPP_NAME
, RT_NAME
);
3309 /* Return the value. */
3310 return token
? token
->u
.value
: error_mark_node
;
3313 /* Parse a sequence of adjacent string constants. Returns a
3314 TREE_STRING representing the combined, nul-terminated string
3315 constant. If TRANSLATE is true, translate the string to the
3316 execution character set. If WIDE_OK is true, a wide string is
3319 C++98 [lex.string] says that if a narrow string literal token is
3320 adjacent to a wide string literal token, the behavior is undefined.
3321 However, C99 6.4.5p4 says that this results in a wide string literal.
3322 We follow C99 here, for consistency with the C front end.
3324 This code is largely lifted from lex_string() in c-lex.c.
3326 FUTURE: ObjC++ will need to handle @-strings here. */
3328 cp_parser_string_literal (cp_parser
*parser
, bool translate
, bool wide_ok
)
3332 struct obstack str_ob
;
3333 cpp_string str
, istr
, *strs
;
3335 enum cpp_ttype type
;
3337 tok
= cp_lexer_peek_token (parser
->lexer
);
3338 if (!cp_parser_is_string_literal (tok
))
3340 cp_parser_error (parser
, "expected string-literal");
3341 return error_mark_node
;
3346 /* Try to avoid the overhead of creating and destroying an obstack
3347 for the common case of just one string. */
3348 if (!cp_parser_is_string_literal
3349 (cp_lexer_peek_nth_token (parser
->lexer
, 2)))
3351 cp_lexer_consume_token (parser
->lexer
);
3353 str
.text
= (const unsigned char *)TREE_STRING_POINTER (tok
->u
.value
);
3354 str
.len
= TREE_STRING_LENGTH (tok
->u
.value
);
3361 gcc_obstack_init (&str_ob
);
3366 cp_lexer_consume_token (parser
->lexer
);
3368 str
.text
= (const unsigned char *)TREE_STRING_POINTER (tok
->u
.value
);
3369 str
.len
= TREE_STRING_LENGTH (tok
->u
.value
);
3371 if (type
!= tok
->type
)
3373 if (type
== CPP_STRING
)
3375 else if (tok
->type
!= CPP_STRING
)
3376 error_at (tok
->location
,
3377 "unsupported non-standard concatenation "
3378 "of string literals");
3381 obstack_grow (&str_ob
, &str
, sizeof (cpp_string
));
3383 tok
= cp_lexer_peek_token (parser
->lexer
);
3385 while (cp_parser_is_string_literal (tok
));
3387 strs
= (cpp_string
*) obstack_finish (&str_ob
);
3390 if (type
!= CPP_STRING
&& !wide_ok
)
3392 cp_parser_error (parser
, "a wide string is invalid in this context");
3396 if ((translate
? cpp_interpret_string
: cpp_interpret_string_notranslate
)
3397 (parse_in
, strs
, count
, &istr
, type
))
3399 value
= build_string (istr
.len
, (const char *)istr
.text
);
3400 free (CONST_CAST (unsigned char *, istr
.text
));
3406 case CPP_UTF8STRING
:
3407 TREE_TYPE (value
) = char_array_type_node
;
3410 TREE_TYPE (value
) = char16_array_type_node
;
3413 TREE_TYPE (value
) = char32_array_type_node
;
3416 TREE_TYPE (value
) = wchar_array_type_node
;
3420 value
= fix_string_type (value
);
3423 /* cpp_interpret_string has issued an error. */
3424 value
= error_mark_node
;
3427 obstack_free (&str_ob
, 0);
3433 /* Basic concepts [gram.basic] */
3435 /* Parse a translation-unit.
3438 declaration-seq [opt]
3440 Returns TRUE if all went well. */
3443 cp_parser_translation_unit (cp_parser
* parser
)
3445 /* The address of the first non-permanent object on the declarator
3447 static void *declarator_obstack_base
;
3451 /* Create the declarator obstack, if necessary. */
3452 if (!cp_error_declarator
)
3454 gcc_obstack_init (&declarator_obstack
);
3455 /* Create the error declarator. */
3456 cp_error_declarator
= make_declarator (cdk_error
);
3457 /* Create the empty parameter list. */
3458 no_parameters
= make_parameter_declarator (NULL
, NULL
, NULL_TREE
);
3459 /* Remember where the base of the declarator obstack lies. */
3460 declarator_obstack_base
= obstack_next_free (&declarator_obstack
);
3463 cp_parser_declaration_seq_opt (parser
);
3465 /* If there are no tokens left then all went well. */
3466 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
3468 /* Get rid of the token array; we don't need it any more. */
3469 cp_lexer_destroy (parser
->lexer
);
3470 parser
->lexer
= NULL
;
3472 /* This file might have been a context that's implicitly extern
3473 "C". If so, pop the lang context. (Only relevant for PCH.) */
3474 if (parser
->implicit_extern_c
)
3476 pop_lang_context ();
3477 parser
->implicit_extern_c
= false;
3481 finish_translation_unit ();
3487 cp_parser_error (parser
, "expected declaration");
3491 /* Make sure the declarator obstack was fully cleaned up. */
3492 gcc_assert (obstack_next_free (&declarator_obstack
)
3493 == declarator_obstack_base
);
3495 /* All went well. */
3499 /* Expressions [gram.expr] */
3501 /* Parse a primary-expression.
3512 ( compound-statement )
3513 __builtin_va_arg ( assignment-expression , type-id )
3514 __builtin_offsetof ( type-id , offsetof-expression )
3517 __has_nothrow_assign ( type-id )
3518 __has_nothrow_constructor ( type-id )
3519 __has_nothrow_copy ( type-id )
3520 __has_trivial_assign ( type-id )
3521 __has_trivial_constructor ( type-id )
3522 __has_trivial_copy ( type-id )
3523 __has_trivial_destructor ( type-id )
3524 __has_virtual_destructor ( type-id )
3525 __is_abstract ( type-id )
3526 __is_base_of ( type-id , type-id )
3527 __is_class ( type-id )
3528 __is_convertible_to ( type-id , type-id )
3529 __is_empty ( type-id )
3530 __is_enum ( type-id )
3531 __is_pod ( type-id )
3532 __is_polymorphic ( type-id )
3533 __is_union ( type-id )
3535 Objective-C++ Extension:
3543 ADDRESS_P is true iff this expression was immediately preceded by
3544 "&" and therefore might denote a pointer-to-member. CAST_P is true
3545 iff this expression is the target of a cast. TEMPLATE_ARG_P is
3546 true iff this expression is a template argument.
3548 Returns a representation of the expression. Upon return, *IDK
3549 indicates what kind of id-expression (if any) was present. */
3552 cp_parser_primary_expression (cp_parser
*parser
,
3555 bool template_arg_p
,
3558 cp_token
*token
= NULL
;
3560 /* Assume the primary expression is not an id-expression. */
3561 *idk
= CP_ID_KIND_NONE
;
3563 /* Peek at the next token. */
3564 token
= cp_lexer_peek_token (parser
->lexer
);
3565 switch (token
->type
)
3578 token
= cp_lexer_consume_token (parser
->lexer
);
3579 if (TREE_CODE (token
->u
.value
) == FIXED_CST
)
3581 error_at (token
->location
,
3582 "fixed-point types not supported in C++");
3583 return error_mark_node
;
3585 /* Floating-point literals are only allowed in an integral
3586 constant expression if they are cast to an integral or
3587 enumeration type. */
3588 if (TREE_CODE (token
->u
.value
) == REAL_CST
3589 && parser
->integral_constant_expression_p
3592 /* CAST_P will be set even in invalid code like "int(2.7 +
3593 ...)". Therefore, we have to check that the next token
3594 is sure to end the cast. */
3597 cp_token
*next_token
;
3599 next_token
= cp_lexer_peek_token (parser
->lexer
);
3600 if (/* The comma at the end of an
3601 enumerator-definition. */
3602 next_token
->type
!= CPP_COMMA
3603 /* The curly brace at the end of an enum-specifier. */
3604 && next_token
->type
!= CPP_CLOSE_BRACE
3605 /* The end of a statement. */
3606 && next_token
->type
!= CPP_SEMICOLON
3607 /* The end of the cast-expression. */
3608 && next_token
->type
!= CPP_CLOSE_PAREN
3609 /* The end of an array bound. */
3610 && next_token
->type
!= CPP_CLOSE_SQUARE
3611 /* The closing ">" in a template-argument-list. */
3612 && (next_token
->type
!= CPP_GREATER
3613 || parser
->greater_than_is_operator_p
)
3614 /* C++0x only: A ">>" treated like two ">" tokens,
3615 in a template-argument-list. */
3616 && (next_token
->type
!= CPP_RSHIFT
3617 || (cxx_dialect
== cxx98
)
3618 || parser
->greater_than_is_operator_p
))
3622 /* If we are within a cast, then the constraint that the
3623 cast is to an integral or enumeration type will be
3624 checked at that point. If we are not within a cast, then
3625 this code is invalid. */
3627 cp_parser_non_integral_constant_expression (parser
, NIC_FLOAT
);
3629 return token
->u
.value
;
3635 case CPP_UTF8STRING
:
3636 /* ??? Should wide strings be allowed when parser->translate_strings_p
3637 is false (i.e. in attributes)? If not, we can kill the third
3638 argument to cp_parser_string_literal. */
3639 return cp_parser_string_literal (parser
,
3640 parser
->translate_strings_p
,
3643 case CPP_OPEN_PAREN
:
3646 bool saved_greater_than_is_operator_p
;
3648 /* Consume the `('. */
3649 cp_lexer_consume_token (parser
->lexer
);
3650 /* Within a parenthesized expression, a `>' token is always
3651 the greater-than operator. */
3652 saved_greater_than_is_operator_p
3653 = parser
->greater_than_is_operator_p
;
3654 parser
->greater_than_is_operator_p
= true;
3655 /* If we see `( { ' then we are looking at the beginning of
3656 a GNU statement-expression. */
3657 if (cp_parser_allow_gnu_extensions_p (parser
)
3658 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
3660 /* Statement-expressions are not allowed by the standard. */
3661 pedwarn (token
->location
, OPT_pedantic
,
3662 "ISO C++ forbids braced-groups within expressions");
3664 /* And they're not allowed outside of a function-body; you
3665 cannot, for example, write:
3667 int i = ({ int j = 3; j + 1; });
3669 at class or namespace scope. */
3670 if (!parser
->in_function_body
3671 || parser
->in_template_argument_list_p
)
3673 error_at (token
->location
,
3674 "statement-expressions are not allowed outside "
3675 "functions nor in template-argument lists");
3676 cp_parser_skip_to_end_of_block_or_statement (parser
);
3677 expr
= error_mark_node
;
3681 /* Start the statement-expression. */
3682 expr
= begin_stmt_expr ();
3683 /* Parse the compound-statement. */
3684 cp_parser_compound_statement (parser
, expr
, false);
3686 expr
= finish_stmt_expr (expr
, false);
3691 /* Parse the parenthesized expression. */
3692 expr
= cp_parser_expression (parser
, cast_p
, idk
);
3693 /* Let the front end know that this expression was
3694 enclosed in parentheses. This matters in case, for
3695 example, the expression is of the form `A::B', since
3696 `&A::B' might be a pointer-to-member, but `&(A::B)' is
3698 finish_parenthesized_expr (expr
);
3700 /* The `>' token might be the end of a template-id or
3701 template-parameter-list now. */
3702 parser
->greater_than_is_operator_p
3703 = saved_greater_than_is_operator_p
;
3704 /* Consume the `)'. */
3705 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
3706 cp_parser_skip_to_end_of_statement (parser
);
3711 case CPP_OPEN_SQUARE
:
3712 if (c_dialect_objc ())
3713 /* We have an Objective-C++ message. */
3714 return cp_parser_objc_expression (parser
);
3715 maybe_warn_cpp0x (CPP0X_LAMBDA_EXPR
);
3716 return cp_parser_lambda_expression (parser
);
3718 case CPP_OBJC_STRING
:
3719 if (c_dialect_objc ())
3720 /* We have an Objective-C++ string literal. */
3721 return cp_parser_objc_expression (parser
);
3722 cp_parser_error (parser
, "expected primary-expression");
3723 return error_mark_node
;
3726 switch (token
->keyword
)
3728 /* These two are the boolean literals. */
3730 cp_lexer_consume_token (parser
->lexer
);
3731 return boolean_true_node
;
3733 cp_lexer_consume_token (parser
->lexer
);
3734 return boolean_false_node
;
3736 /* The `__null' literal. */
3738 cp_lexer_consume_token (parser
->lexer
);
3741 /* The `nullptr' literal. */
3743 cp_lexer_consume_token (parser
->lexer
);
3744 return nullptr_node
;
3746 /* Recognize the `this' keyword. */
3748 cp_lexer_consume_token (parser
->lexer
);
3749 if (parser
->local_variables_forbidden_p
)
3751 error_at (token
->location
,
3752 "%<this%> may not be used in this context");
3753 return error_mark_node
;
3755 /* Pointers cannot appear in constant-expressions. */
3756 if (cp_parser_non_integral_constant_expression (parser
, NIC_THIS
))
3757 return error_mark_node
;
3758 return finish_this_expr ();
3760 /* The `operator' keyword can be the beginning of an
3765 case RID_FUNCTION_NAME
:
3766 case RID_PRETTY_FUNCTION_NAME
:
3767 case RID_C99_FUNCTION_NAME
:
3769 non_integral_constant name
;
3771 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
3772 __func__ are the names of variables -- but they are
3773 treated specially. Therefore, they are handled here,
3774 rather than relying on the generic id-expression logic
3775 below. Grammatically, these names are id-expressions.
3777 Consume the token. */
3778 token
= cp_lexer_consume_token (parser
->lexer
);
3780 switch (token
->keyword
)
3782 case RID_FUNCTION_NAME
:
3783 name
= NIC_FUNC_NAME
;
3785 case RID_PRETTY_FUNCTION_NAME
:
3786 name
= NIC_PRETTY_FUNC
;
3788 case RID_C99_FUNCTION_NAME
:
3789 name
= NIC_C99_FUNC
;
3795 if (cp_parser_non_integral_constant_expression (parser
, name
))
3796 return error_mark_node
;
3798 /* Look up the name. */
3799 return finish_fname (token
->u
.value
);
3807 /* The `__builtin_va_arg' construct is used to handle
3808 `va_arg'. Consume the `__builtin_va_arg' token. */
3809 cp_lexer_consume_token (parser
->lexer
);
3810 /* Look for the opening `('. */
3811 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
3812 /* Now, parse the assignment-expression. */
3813 expression
= cp_parser_assignment_expression (parser
,
3814 /*cast_p=*/false, NULL
);
3815 /* Look for the `,'. */
3816 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
3817 /* Parse the type-id. */
3818 type
= cp_parser_type_id (parser
);
3819 /* Look for the closing `)'. */
3820 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
3821 /* Using `va_arg' in a constant-expression is not
3823 if (cp_parser_non_integral_constant_expression (parser
,
3825 return error_mark_node
;
3826 return build_x_va_arg (expression
, type
);
3830 return cp_parser_builtin_offsetof (parser
);
3832 case RID_HAS_NOTHROW_ASSIGN
:
3833 case RID_HAS_NOTHROW_CONSTRUCTOR
:
3834 case RID_HAS_NOTHROW_COPY
:
3835 case RID_HAS_TRIVIAL_ASSIGN
:
3836 case RID_HAS_TRIVIAL_CONSTRUCTOR
:
3837 case RID_HAS_TRIVIAL_COPY
:
3838 case RID_HAS_TRIVIAL_DESTRUCTOR
:
3839 case RID_HAS_VIRTUAL_DESTRUCTOR
:
3840 case RID_IS_ABSTRACT
:
3841 case RID_IS_BASE_OF
:
3843 case RID_IS_CONVERTIBLE_TO
:
3847 case RID_IS_POLYMORPHIC
:
3848 case RID_IS_STD_LAYOUT
:
3849 case RID_IS_TRIVIAL
:
3851 case RID_IS_LITERAL_TYPE
:
3852 return cp_parser_trait_expr (parser
, token
->keyword
);
3854 /* Objective-C++ expressions. */
3856 case RID_AT_PROTOCOL
:
3857 case RID_AT_SELECTOR
:
3858 return cp_parser_objc_expression (parser
);
3861 if (parser
->in_function_body
3862 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
3865 error_at (token
->location
,
3866 "a template declaration cannot appear at block scope");
3867 cp_parser_skip_to_end_of_block_or_statement (parser
);
3868 return error_mark_node
;
3871 cp_parser_error (parser
, "expected primary-expression");
3872 return error_mark_node
;
3875 /* An id-expression can start with either an identifier, a
3876 `::' as the beginning of a qualified-id, or the "operator"
3880 case CPP_TEMPLATE_ID
:
3881 case CPP_NESTED_NAME_SPECIFIER
:
3885 const char *error_msg
;
3888 cp_token
*id_expr_token
;
3891 /* Parse the id-expression. */
3893 = cp_parser_id_expression (parser
,
3894 /*template_keyword_p=*/false,
3895 /*check_dependency_p=*/true,
3897 /*declarator_p=*/false,
3898 /*optional_p=*/false);
3899 if (id_expression
== error_mark_node
)
3900 return error_mark_node
;
3901 id_expr_token
= token
;
3902 token
= cp_lexer_peek_token (parser
->lexer
);
3903 done
= (token
->type
!= CPP_OPEN_SQUARE
3904 && token
->type
!= CPP_OPEN_PAREN
3905 && token
->type
!= CPP_DOT
3906 && token
->type
!= CPP_DEREF
3907 && token
->type
!= CPP_PLUS_PLUS
3908 && token
->type
!= CPP_MINUS_MINUS
);
3909 /* If we have a template-id, then no further lookup is
3910 required. If the template-id was for a template-class, we
3911 will sometimes have a TYPE_DECL at this point. */
3912 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
3913 || TREE_CODE (id_expression
) == TYPE_DECL
)
3914 decl
= id_expression
;
3915 /* Look up the name. */
3918 tree ambiguous_decls
;
3920 /* If we already know that this lookup is ambiguous, then
3921 we've already issued an error message; there's no reason
3923 if (id_expr_token
->type
== CPP_NAME
3924 && id_expr_token
->ambiguous_p
)
3926 cp_parser_simulate_error (parser
);
3927 return error_mark_node
;
3930 decl
= cp_parser_lookup_name (parser
, id_expression
,
3933 /*is_namespace=*/false,
3934 /*check_dependency=*/true,
3936 id_expr_token
->location
);
3937 /* If the lookup was ambiguous, an error will already have
3939 if (ambiguous_decls
)
3940 return error_mark_node
;
3942 /* In Objective-C++, we may have an Objective-C 2.0
3943 dot-syntax for classes here. */
3944 if (c_dialect_objc ()
3945 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_DOT
3946 && TREE_CODE (decl
) == TYPE_DECL
3947 && objc_is_class_name (decl
))
3950 cp_lexer_consume_token (parser
->lexer
);
3951 component
= cp_parser_identifier (parser
);
3952 if (component
== error_mark_node
)
3953 return error_mark_node
;
3955 return objc_build_class_component_ref (id_expression
, component
);
3958 /* In Objective-C++, an instance variable (ivar) may be preferred
3959 to whatever cp_parser_lookup_name() found. */
3960 decl
= objc_lookup_ivar (decl
, id_expression
);
3962 /* If name lookup gives us a SCOPE_REF, then the
3963 qualifying scope was dependent. */
3964 if (TREE_CODE (decl
) == SCOPE_REF
)
3966 /* At this point, we do not know if DECL is a valid
3967 integral constant expression. We assume that it is
3968 in fact such an expression, so that code like:
3970 template <int N> struct A {
3974 is accepted. At template-instantiation time, we
3975 will check that B<N>::i is actually a constant. */
3978 /* Check to see if DECL is a local variable in a context
3979 where that is forbidden. */
3980 if (parser
->local_variables_forbidden_p
3981 && local_variable_p (decl
))
3983 /* It might be that we only found DECL because we are
3984 trying to be generous with pre-ISO scoping rules.
3985 For example, consider:
3989 for (int i = 0; i < 10; ++i) {}
3990 extern void f(int j = i);
3993 Here, name look up will originally find the out
3994 of scope `i'. We need to issue a warning message,
3995 but then use the global `i'. */
3996 decl
= check_for_out_of_scope_variable (decl
);
3997 if (local_variable_p (decl
))
3999 error_at (id_expr_token
->location
,
4000 "local variable %qD may not appear in this context",
4002 return error_mark_node
;
4007 decl
= (finish_id_expression
4008 (id_expression
, decl
, parser
->scope
,
4010 parser
->integral_constant_expression_p
,
4011 parser
->allow_non_integral_constant_expression_p
,
4012 &parser
->non_integral_constant_expression_p
,
4013 template_p
, done
, address_p
,
4016 id_expr_token
->location
));
4018 cp_parser_error (parser
, error_msg
);
4022 /* Anything else is an error. */
4024 cp_parser_error (parser
, "expected primary-expression");
4025 return error_mark_node
;
4029 /* Parse an id-expression.
4036 :: [opt] nested-name-specifier template [opt] unqualified-id
4038 :: operator-function-id
4041 Return a representation of the unqualified portion of the
4042 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4043 a `::' or nested-name-specifier.
4045 Often, if the id-expression was a qualified-id, the caller will
4046 want to make a SCOPE_REF to represent the qualified-id. This
4047 function does not do this in order to avoid wastefully creating
4048 SCOPE_REFs when they are not required.
4050 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4053 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4054 uninstantiated templates.
4056 If *TEMPLATE_P is non-NULL, it is set to true iff the
4057 `template' keyword is used to explicitly indicate that the entity
4058 named is a template.
4060 If DECLARATOR_P is true, the id-expression is appearing as part of
4061 a declarator, rather than as part of an expression. */
4064 cp_parser_id_expression (cp_parser
*parser
,
4065 bool template_keyword_p
,
4066 bool check_dependency_p
,
4071 bool global_scope_p
;
4072 bool nested_name_specifier_p
;
4074 /* Assume the `template' keyword was not used. */
4076 *template_p
= template_keyword_p
;
4078 /* Look for the optional `::' operator. */
4080 = (cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false)
4082 /* Look for the optional nested-name-specifier. */
4083 nested_name_specifier_p
4084 = (cp_parser_nested_name_specifier_opt (parser
,
4085 /*typename_keyword_p=*/false,
4090 /* If there is a nested-name-specifier, then we are looking at
4091 the first qualified-id production. */
4092 if (nested_name_specifier_p
)
4095 tree saved_object_scope
;
4096 tree saved_qualifying_scope
;
4097 tree unqualified_id
;
4100 /* See if the next token is the `template' keyword. */
4102 template_p
= &is_template
;
4103 *template_p
= cp_parser_optional_template_keyword (parser
);
4104 /* Name lookup we do during the processing of the
4105 unqualified-id might obliterate SCOPE. */
4106 saved_scope
= parser
->scope
;
4107 saved_object_scope
= parser
->object_scope
;
4108 saved_qualifying_scope
= parser
->qualifying_scope
;
4109 /* Process the final unqualified-id. */
4110 unqualified_id
= cp_parser_unqualified_id (parser
, *template_p
,
4113 /*optional_p=*/false);
4114 /* Restore the SAVED_SCOPE for our caller. */
4115 parser
->scope
= saved_scope
;
4116 parser
->object_scope
= saved_object_scope
;
4117 parser
->qualifying_scope
= saved_qualifying_scope
;
4119 return unqualified_id
;
4121 /* Otherwise, if we are in global scope, then we are looking at one
4122 of the other qualified-id productions. */
4123 else if (global_scope_p
)
4128 /* Peek at the next token. */
4129 token
= cp_lexer_peek_token (parser
->lexer
);
4131 /* If it's an identifier, and the next token is not a "<", then
4132 we can avoid the template-id case. This is an optimization
4133 for this common case. */
4134 if (token
->type
== CPP_NAME
4135 && !cp_parser_nth_token_starts_template_argument_list_p
4137 return cp_parser_identifier (parser
);
4139 cp_parser_parse_tentatively (parser
);
4140 /* Try a template-id. */
4141 id
= cp_parser_template_id (parser
,
4142 /*template_keyword_p=*/false,
4143 /*check_dependency_p=*/true,
4145 /* If that worked, we're done. */
4146 if (cp_parser_parse_definitely (parser
))
4149 /* Peek at the next token. (Changes in the token buffer may
4150 have invalidated the pointer obtained above.) */
4151 token
= cp_lexer_peek_token (parser
->lexer
);
4153 switch (token
->type
)
4156 return cp_parser_identifier (parser
);
4159 if (token
->keyword
== RID_OPERATOR
)
4160 return cp_parser_operator_function_id (parser
);
4164 cp_parser_error (parser
, "expected id-expression");
4165 return error_mark_node
;
4169 return cp_parser_unqualified_id (parser
, template_keyword_p
,
4170 /*check_dependency_p=*/true,
4175 /* Parse an unqualified-id.
4179 operator-function-id
4180 conversion-function-id
4184 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4185 keyword, in a construct like `A::template ...'.
4187 Returns a representation of unqualified-id. For the `identifier'
4188 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4189 production a BIT_NOT_EXPR is returned; the operand of the
4190 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4191 other productions, see the documentation accompanying the
4192 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4193 names are looked up in uninstantiated templates. If DECLARATOR_P
4194 is true, the unqualified-id is appearing as part of a declarator,
4195 rather than as part of an expression. */
4198 cp_parser_unqualified_id (cp_parser
* parser
,
4199 bool template_keyword_p
,
4200 bool check_dependency_p
,
4206 /* Peek at the next token. */
4207 token
= cp_lexer_peek_token (parser
->lexer
);
4209 switch (token
->type
)
4215 /* We don't know yet whether or not this will be a
4217 cp_parser_parse_tentatively (parser
);
4218 /* Try a template-id. */
4219 id
= cp_parser_template_id (parser
, template_keyword_p
,
4222 /* If it worked, we're done. */
4223 if (cp_parser_parse_definitely (parser
))
4225 /* Otherwise, it's an ordinary identifier. */
4226 return cp_parser_identifier (parser
);
4229 case CPP_TEMPLATE_ID
:
4230 return cp_parser_template_id (parser
, template_keyword_p
,
4237 tree qualifying_scope
;
4242 /* Consume the `~' token. */
4243 cp_lexer_consume_token (parser
->lexer
);
4244 /* Parse the class-name. The standard, as written, seems to
4247 template <typename T> struct S { ~S (); };
4248 template <typename T> S<T>::~S() {}
4250 is invalid, since `~' must be followed by a class-name, but
4251 `S<T>' is dependent, and so not known to be a class.
4252 That's not right; we need to look in uninstantiated
4253 templates. A further complication arises from:
4255 template <typename T> void f(T t) {
4259 Here, it is not possible to look up `T' in the scope of `T'
4260 itself. We must look in both the current scope, and the
4261 scope of the containing complete expression.
4263 Yet another issue is:
4272 The standard does not seem to say that the `S' in `~S'
4273 should refer to the type `S' and not the data member
4276 /* DR 244 says that we look up the name after the "~" in the
4277 same scope as we looked up the qualifying name. That idea
4278 isn't fully worked out; it's more complicated than that. */
4279 scope
= parser
->scope
;
4280 object_scope
= parser
->object_scope
;
4281 qualifying_scope
= parser
->qualifying_scope
;
4283 /* Check for invalid scopes. */
4284 if (scope
== error_mark_node
)
4286 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
4287 cp_lexer_consume_token (parser
->lexer
);
4288 return error_mark_node
;
4290 if (scope
&& TREE_CODE (scope
) == NAMESPACE_DECL
)
4292 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
4293 error_at (token
->location
,
4294 "scope %qT before %<~%> is not a class-name",
4296 cp_parser_simulate_error (parser
);
4297 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
4298 cp_lexer_consume_token (parser
->lexer
);
4299 return error_mark_node
;
4301 gcc_assert (!scope
|| TYPE_P (scope
));
4303 /* If the name is of the form "X::~X" it's OK even if X is a
4305 token
= cp_lexer_peek_token (parser
->lexer
);
4307 && token
->type
== CPP_NAME
4308 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
4310 && (token
->u
.value
== TYPE_IDENTIFIER (scope
)
4311 || constructor_name_p (token
->u
.value
, scope
)))
4313 cp_lexer_consume_token (parser
->lexer
);
4314 return build_nt (BIT_NOT_EXPR
, scope
);
4317 /* If there was an explicit qualification (S::~T), first look
4318 in the scope given by the qualification (i.e., S).
4320 Note: in the calls to cp_parser_class_name below we pass
4321 typename_type so that lookup finds the injected-class-name
4322 rather than the constructor. */
4324 type_decl
= NULL_TREE
;
4327 cp_parser_parse_tentatively (parser
);
4328 type_decl
= cp_parser_class_name (parser
,
4329 /*typename_keyword_p=*/false,
4330 /*template_keyword_p=*/false,
4332 /*check_dependency=*/false,
4333 /*class_head_p=*/false,
4335 if (cp_parser_parse_definitely (parser
))
4338 /* In "N::S::~S", look in "N" as well. */
4339 if (!done
&& scope
&& qualifying_scope
)
4341 cp_parser_parse_tentatively (parser
);
4342 parser
->scope
= qualifying_scope
;
4343 parser
->object_scope
= NULL_TREE
;
4344 parser
->qualifying_scope
= NULL_TREE
;
4346 = cp_parser_class_name (parser
,
4347 /*typename_keyword_p=*/false,
4348 /*template_keyword_p=*/false,
4350 /*check_dependency=*/false,
4351 /*class_head_p=*/false,
4353 if (cp_parser_parse_definitely (parser
))
4356 /* In "p->S::~T", look in the scope given by "*p" as well. */
4357 else if (!done
&& object_scope
)
4359 cp_parser_parse_tentatively (parser
);
4360 parser
->scope
= object_scope
;
4361 parser
->object_scope
= NULL_TREE
;
4362 parser
->qualifying_scope
= NULL_TREE
;
4364 = cp_parser_class_name (parser
,
4365 /*typename_keyword_p=*/false,
4366 /*template_keyword_p=*/false,
4368 /*check_dependency=*/false,
4369 /*class_head_p=*/false,
4371 if (cp_parser_parse_definitely (parser
))
4374 /* Look in the surrounding context. */
4377 parser
->scope
= NULL_TREE
;
4378 parser
->object_scope
= NULL_TREE
;
4379 parser
->qualifying_scope
= NULL_TREE
;
4380 if (processing_template_decl
)
4381 cp_parser_parse_tentatively (parser
);
4383 = cp_parser_class_name (parser
,
4384 /*typename_keyword_p=*/false,
4385 /*template_keyword_p=*/false,
4387 /*check_dependency=*/false,
4388 /*class_head_p=*/false,
4390 if (processing_template_decl
4391 && ! cp_parser_parse_definitely (parser
))
4393 /* We couldn't find a type with this name, so just accept
4394 it and check for a match at instantiation time. */
4395 type_decl
= cp_parser_identifier (parser
);
4396 if (type_decl
!= error_mark_node
)
4397 type_decl
= build_nt (BIT_NOT_EXPR
, type_decl
);
4401 /* If an error occurred, assume that the name of the
4402 destructor is the same as the name of the qualifying
4403 class. That allows us to keep parsing after running
4404 into ill-formed destructor names. */
4405 if (type_decl
== error_mark_node
&& scope
)
4406 return build_nt (BIT_NOT_EXPR
, scope
);
4407 else if (type_decl
== error_mark_node
)
4408 return error_mark_node
;
4410 /* Check that destructor name and scope match. */
4411 if (declarator_p
&& scope
&& !check_dtor_name (scope
, type_decl
))
4413 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
4414 error_at (token
->location
,
4415 "declaration of %<~%T%> as member of %qT",
4417 cp_parser_simulate_error (parser
);
4418 return error_mark_node
;
4423 A typedef-name that names a class shall not be used as the
4424 identifier in the declarator for a destructor declaration. */
4426 && !DECL_IMPLICIT_TYPEDEF_P (type_decl
)
4427 && !DECL_SELF_REFERENCE_P (type_decl
)
4428 && !cp_parser_uncommitted_to_tentative_parse_p (parser
))
4429 error_at (token
->location
,
4430 "typedef-name %qD used as destructor declarator",
4433 return build_nt (BIT_NOT_EXPR
, TREE_TYPE (type_decl
));
4437 if (token
->keyword
== RID_OPERATOR
)
4441 /* This could be a template-id, so we try that first. */
4442 cp_parser_parse_tentatively (parser
);
4443 /* Try a template-id. */
4444 id
= cp_parser_template_id (parser
, template_keyword_p
,
4445 /*check_dependency_p=*/true,
4447 /* If that worked, we're done. */
4448 if (cp_parser_parse_definitely (parser
))
4450 /* We still don't know whether we're looking at an
4451 operator-function-id or a conversion-function-id. */
4452 cp_parser_parse_tentatively (parser
);
4453 /* Try an operator-function-id. */
4454 id
= cp_parser_operator_function_id (parser
);
4455 /* If that didn't work, try a conversion-function-id. */
4456 if (!cp_parser_parse_definitely (parser
))
4457 id
= cp_parser_conversion_function_id (parser
);
4466 cp_parser_error (parser
, "expected unqualified-id");
4467 return error_mark_node
;
4471 /* Parse an (optional) nested-name-specifier.
4473 nested-name-specifier: [C++98]
4474 class-or-namespace-name :: nested-name-specifier [opt]
4475 class-or-namespace-name :: template nested-name-specifier [opt]
4477 nested-name-specifier: [C++0x]
4480 nested-name-specifier identifier ::
4481 nested-name-specifier template [opt] simple-template-id ::
4483 PARSER->SCOPE should be set appropriately before this function is
4484 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
4485 effect. TYPE_P is TRUE if we non-type bindings should be ignored
4488 Sets PARSER->SCOPE to the class (TYPE) or namespace
4489 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
4490 it unchanged if there is no nested-name-specifier. Returns the new
4491 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
4493 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
4494 part of a declaration and/or decl-specifier. */
4497 cp_parser_nested_name_specifier_opt (cp_parser
*parser
,
4498 bool typename_keyword_p
,
4499 bool check_dependency_p
,
4501 bool is_declaration
)
4503 bool success
= false;
4504 cp_token_position start
= 0;
4507 /* Remember where the nested-name-specifier starts. */
4508 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
4510 start
= cp_lexer_token_position (parser
->lexer
, false);
4511 push_deferring_access_checks (dk_deferred
);
4518 tree saved_qualifying_scope
;
4519 bool template_keyword_p
;
4521 /* Spot cases that cannot be the beginning of a
4522 nested-name-specifier. */
4523 token
= cp_lexer_peek_token (parser
->lexer
);
4525 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
4526 the already parsed nested-name-specifier. */
4527 if (token
->type
== CPP_NESTED_NAME_SPECIFIER
)
4529 /* Grab the nested-name-specifier and continue the loop. */
4530 cp_parser_pre_parsed_nested_name_specifier (parser
);
4531 /* If we originally encountered this nested-name-specifier
4532 with IS_DECLARATION set to false, we will not have
4533 resolved TYPENAME_TYPEs, so we must do so here. */
4535 && TREE_CODE (parser
->scope
) == TYPENAME_TYPE
)
4537 new_scope
= resolve_typename_type (parser
->scope
,
4538 /*only_current_p=*/false);
4539 if (TREE_CODE (new_scope
) != TYPENAME_TYPE
)
4540 parser
->scope
= new_scope
;
4546 /* Spot cases that cannot be the beginning of a
4547 nested-name-specifier. On the second and subsequent times
4548 through the loop, we look for the `template' keyword. */
4549 if (success
&& token
->keyword
== RID_TEMPLATE
)
4551 /* A template-id can start a nested-name-specifier. */
4552 else if (token
->type
== CPP_TEMPLATE_ID
)
4556 /* If the next token is not an identifier, then it is
4557 definitely not a type-name or namespace-name. */
4558 if (token
->type
!= CPP_NAME
)
4560 /* If the following token is neither a `<' (to begin a
4561 template-id), nor a `::', then we are not looking at a
4562 nested-name-specifier. */
4563 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
4565 if (token
->type
== CPP_COLON
4566 && parser
->colon_corrects_to_scope_p
4567 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_NAME
)
4569 error_at (token
->location
,
4570 "found %<:%> in nested-name-specifier, expected %<::%>");
4571 token
->type
= CPP_SCOPE
;
4574 if (token
->type
!= CPP_SCOPE
4575 && !cp_parser_nth_token_starts_template_argument_list_p
4580 /* The nested-name-specifier is optional, so we parse
4582 cp_parser_parse_tentatively (parser
);
4584 /* Look for the optional `template' keyword, if this isn't the
4585 first time through the loop. */
4587 template_keyword_p
= cp_parser_optional_template_keyword (parser
);
4589 template_keyword_p
= false;
4591 /* Save the old scope since the name lookup we are about to do
4592 might destroy it. */
4593 old_scope
= parser
->scope
;
4594 saved_qualifying_scope
= parser
->qualifying_scope
;
4595 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
4596 look up names in "X<T>::I" in order to determine that "Y" is
4597 a template. So, if we have a typename at this point, we make
4598 an effort to look through it. */
4600 && !typename_keyword_p
4602 && TREE_CODE (parser
->scope
) == TYPENAME_TYPE
)
4603 parser
->scope
= resolve_typename_type (parser
->scope
,
4604 /*only_current_p=*/false);
4605 /* Parse the qualifying entity. */
4607 = cp_parser_qualifying_entity (parser
,
4613 /* Look for the `::' token. */
4614 cp_parser_require (parser
, CPP_SCOPE
, RT_SCOPE
);
4616 /* If we found what we wanted, we keep going; otherwise, we're
4618 if (!cp_parser_parse_definitely (parser
))
4620 bool error_p
= false;
4622 /* Restore the OLD_SCOPE since it was valid before the
4623 failed attempt at finding the last
4624 class-or-namespace-name. */
4625 parser
->scope
= old_scope
;
4626 parser
->qualifying_scope
= saved_qualifying_scope
;
4627 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
4629 /* If the next token is an identifier, and the one after
4630 that is a `::', then any valid interpretation would have
4631 found a class-or-namespace-name. */
4632 while (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
)
4633 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
4635 && (cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
4638 token
= cp_lexer_consume_token (parser
->lexer
);
4641 if (!token
->ambiguous_p
)
4644 tree ambiguous_decls
;
4646 decl
= cp_parser_lookup_name (parser
, token
->u
.value
,
4648 /*is_template=*/false,
4649 /*is_namespace=*/false,
4650 /*check_dependency=*/true,
4653 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
4654 error_at (token
->location
,
4655 "%qD used without template parameters",
4657 else if (ambiguous_decls
)
4659 error_at (token
->location
,
4660 "reference to %qD is ambiguous",
4662 print_candidates (ambiguous_decls
);
4663 decl
= error_mark_node
;
4667 if (cxx_dialect
!= cxx98
)
4668 cp_parser_name_lookup_error
4669 (parser
, token
->u
.value
, decl
, NLE_NOT_CXX98
,
4672 cp_parser_name_lookup_error
4673 (parser
, token
->u
.value
, decl
, NLE_CXX98
,
4677 parser
->scope
= error_mark_node
;
4679 /* Treat this as a successful nested-name-specifier
4684 If the name found is not a class-name (clause
4685 _class_) or namespace-name (_namespace.def_), the
4686 program is ill-formed. */
4689 cp_lexer_consume_token (parser
->lexer
);
4693 /* We've found one valid nested-name-specifier. */
4695 /* Name lookup always gives us a DECL. */
4696 if (TREE_CODE (new_scope
) == TYPE_DECL
)
4697 new_scope
= TREE_TYPE (new_scope
);
4698 /* Uses of "template" must be followed by actual templates. */
4699 if (template_keyword_p
4700 && !(CLASS_TYPE_P (new_scope
)
4701 && ((CLASSTYPE_USE_TEMPLATE (new_scope
)
4702 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (new_scope
)))
4703 || CLASSTYPE_IS_TEMPLATE (new_scope
)))
4704 && !(TREE_CODE (new_scope
) == TYPENAME_TYPE
4705 && (TREE_CODE (TYPENAME_TYPE_FULLNAME (new_scope
))
4706 == TEMPLATE_ID_EXPR
)))
4707 permerror (input_location
, TYPE_P (new_scope
)
4708 ? "%qT is not a template"
4709 : "%qD is not a template",
4711 /* If it is a class scope, try to complete it; we are about to
4712 be looking up names inside the class. */
4713 if (TYPE_P (new_scope
)
4714 /* Since checking types for dependency can be expensive,
4715 avoid doing it if the type is already complete. */
4716 && !COMPLETE_TYPE_P (new_scope
)
4717 /* Do not try to complete dependent types. */
4718 && !dependent_type_p (new_scope
))
4720 new_scope
= complete_type (new_scope
);
4721 /* If it is a typedef to current class, use the current
4722 class instead, as the typedef won't have any names inside
4724 if (!COMPLETE_TYPE_P (new_scope
)
4725 && currently_open_class (new_scope
))
4726 new_scope
= TYPE_MAIN_VARIANT (new_scope
);
4728 /* Make sure we look in the right scope the next time through
4730 parser
->scope
= new_scope
;
4733 /* If parsing tentatively, replace the sequence of tokens that makes
4734 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
4735 token. That way, should we re-parse the token stream, we will
4736 not have to repeat the effort required to do the parse, nor will
4737 we issue duplicate error messages. */
4738 if (success
&& start
)
4742 token
= cp_lexer_token_at (parser
->lexer
, start
);
4743 /* Reset the contents of the START token. */
4744 token
->type
= CPP_NESTED_NAME_SPECIFIER
;
4745 /* Retrieve any deferred checks. Do not pop this access checks yet
4746 so the memory will not be reclaimed during token replacing below. */
4747 token
->u
.tree_check_value
= ggc_alloc_cleared_tree_check ();
4748 token
->u
.tree_check_value
->value
= parser
->scope
;
4749 token
->u
.tree_check_value
->checks
= get_deferred_access_checks ();
4750 token
->u
.tree_check_value
->qualifying_scope
=
4751 parser
->qualifying_scope
;
4752 token
->keyword
= RID_MAX
;
4754 /* Purge all subsequent tokens. */
4755 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
4759 pop_to_parent_deferring_access_checks ();
4761 return success
? parser
->scope
: NULL_TREE
;
4764 /* Parse a nested-name-specifier. See
4765 cp_parser_nested_name_specifier_opt for details. This function
4766 behaves identically, except that it will an issue an error if no
4767 nested-name-specifier is present. */
4770 cp_parser_nested_name_specifier (cp_parser
*parser
,
4771 bool typename_keyword_p
,
4772 bool check_dependency_p
,
4774 bool is_declaration
)
4778 /* Look for the nested-name-specifier. */
4779 scope
= cp_parser_nested_name_specifier_opt (parser
,
4784 /* If it was not present, issue an error message. */
4787 cp_parser_error (parser
, "expected nested-name-specifier");
4788 parser
->scope
= NULL_TREE
;
4794 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
4795 this is either a class-name or a namespace-name (which corresponds
4796 to the class-or-namespace-name production in the grammar). For
4797 C++0x, it can also be a type-name that refers to an enumeration
4800 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
4801 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
4802 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
4803 TYPE_P is TRUE iff the next name should be taken as a class-name,
4804 even the same name is declared to be another entity in the same
4807 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
4808 specified by the class-or-namespace-name. If neither is found the
4809 ERROR_MARK_NODE is returned. */
4812 cp_parser_qualifying_entity (cp_parser
*parser
,
4813 bool typename_keyword_p
,
4814 bool template_keyword_p
,
4815 bool check_dependency_p
,
4817 bool is_declaration
)
4820 tree saved_qualifying_scope
;
4821 tree saved_object_scope
;
4824 bool successful_parse_p
;
4826 /* Before we try to parse the class-name, we must save away the
4827 current PARSER->SCOPE since cp_parser_class_name will destroy
4829 saved_scope
= parser
->scope
;
4830 saved_qualifying_scope
= parser
->qualifying_scope
;
4831 saved_object_scope
= parser
->object_scope
;
4832 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
4833 there is no need to look for a namespace-name. */
4834 only_class_p
= template_keyword_p
4835 || (saved_scope
&& TYPE_P (saved_scope
) && cxx_dialect
== cxx98
);
4837 cp_parser_parse_tentatively (parser
);
4838 scope
= cp_parser_class_name (parser
,
4841 type_p
? class_type
: none_type
,
4843 /*class_head_p=*/false,
4845 successful_parse_p
= only_class_p
|| cp_parser_parse_definitely (parser
);
4846 /* If that didn't work and we're in C++0x mode, try for a type-name. */
4848 && cxx_dialect
!= cxx98
4849 && !successful_parse_p
)
4851 /* Restore the saved scope. */
4852 parser
->scope
= saved_scope
;
4853 parser
->qualifying_scope
= saved_qualifying_scope
;
4854 parser
->object_scope
= saved_object_scope
;
4856 /* Parse tentatively. */
4857 cp_parser_parse_tentatively (parser
);
4859 /* Parse a typedef-name or enum-name. */
4860 scope
= cp_parser_nonclass_name (parser
);
4862 /* "If the name found does not designate a namespace or a class,
4863 enumeration, or dependent type, the program is ill-formed."
4865 We cover classes and dependent types above and namespaces below,
4866 so this code is only looking for enums. */
4867 if (!scope
|| TREE_CODE (scope
) != TYPE_DECL
4868 || TREE_CODE (TREE_TYPE (scope
)) != ENUMERAL_TYPE
)
4869 cp_parser_simulate_error (parser
);
4871 successful_parse_p
= cp_parser_parse_definitely (parser
);
4873 /* If that didn't work, try for a namespace-name. */
4874 if (!only_class_p
&& !successful_parse_p
)
4876 /* Restore the saved scope. */
4877 parser
->scope
= saved_scope
;
4878 parser
->qualifying_scope
= saved_qualifying_scope
;
4879 parser
->object_scope
= saved_object_scope
;
4880 /* If we are not looking at an identifier followed by the scope
4881 resolution operator, then this is not part of a
4882 nested-name-specifier. (Note that this function is only used
4883 to parse the components of a nested-name-specifier.) */
4884 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
)
4885 || cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_SCOPE
)
4886 return error_mark_node
;
4887 scope
= cp_parser_namespace_name (parser
);
4893 /* Parse a postfix-expression.
4897 postfix-expression [ expression ]
4898 postfix-expression ( expression-list [opt] )
4899 simple-type-specifier ( expression-list [opt] )
4900 typename :: [opt] nested-name-specifier identifier
4901 ( expression-list [opt] )
4902 typename :: [opt] nested-name-specifier template [opt] template-id
4903 ( expression-list [opt] )
4904 postfix-expression . template [opt] id-expression
4905 postfix-expression -> template [opt] id-expression
4906 postfix-expression . pseudo-destructor-name
4907 postfix-expression -> pseudo-destructor-name
4908 postfix-expression ++
4909 postfix-expression --
4910 dynamic_cast < type-id > ( expression )
4911 static_cast < type-id > ( expression )
4912 reinterpret_cast < type-id > ( expression )
4913 const_cast < type-id > ( expression )
4914 typeid ( expression )
4920 ( type-id ) { initializer-list , [opt] }
4922 This extension is a GNU version of the C99 compound-literal
4923 construct. (The C99 grammar uses `type-name' instead of `type-id',
4924 but they are essentially the same concept.)
4926 If ADDRESS_P is true, the postfix expression is the operand of the
4927 `&' operator. CAST_P is true if this expression is the target of a
4930 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
4931 class member access expressions [expr.ref].
4933 Returns a representation of the expression. */
4936 cp_parser_postfix_expression (cp_parser
*parser
, bool address_p
, bool cast_p
,
4937 bool member_access_only_p
,
4938 cp_id_kind
* pidk_return
)
4942 cp_id_kind idk
= CP_ID_KIND_NONE
;
4943 tree postfix_expression
= NULL_TREE
;
4944 bool is_member_access
= false;
4946 /* Peek at the next token. */
4947 token
= cp_lexer_peek_token (parser
->lexer
);
4948 /* Some of the productions are determined by keywords. */
4949 keyword
= token
->keyword
;
4959 const char *saved_message
;
4961 /* All of these can be handled in the same way from the point
4962 of view of parsing. Begin by consuming the token
4963 identifying the cast. */
4964 cp_lexer_consume_token (parser
->lexer
);
4966 /* New types cannot be defined in the cast. */
4967 saved_message
= parser
->type_definition_forbidden_message
;
4968 parser
->type_definition_forbidden_message
4969 = G_("types may not be defined in casts");
4971 /* Look for the opening `<'. */
4972 cp_parser_require (parser
, CPP_LESS
, RT_LESS
);
4973 /* Parse the type to which we are casting. */
4974 type
= cp_parser_type_id (parser
);
4975 /* Look for the closing `>'. */
4976 cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
);
4977 /* Restore the old message. */
4978 parser
->type_definition_forbidden_message
= saved_message
;
4980 /* And the expression which is being cast. */
4981 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
4982 expression
= cp_parser_expression (parser
, /*cast_p=*/true, & idk
);
4983 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
4985 /* Only type conversions to integral or enumeration types
4986 can be used in constant-expressions. */
4987 if (!cast_valid_in_integral_constant_expression_p (type
)
4988 && cp_parser_non_integral_constant_expression (parser
, NIC_CAST
))
4989 return error_mark_node
;
4995 = build_dynamic_cast (type
, expression
, tf_warning_or_error
);
4999 = build_static_cast (type
, expression
, tf_warning_or_error
);
5003 = build_reinterpret_cast (type
, expression
,
5004 tf_warning_or_error
);
5008 = build_const_cast (type
, expression
, tf_warning_or_error
);
5019 const char *saved_message
;
5020 bool saved_in_type_id_in_expr_p
;
5022 /* Consume the `typeid' token. */
5023 cp_lexer_consume_token (parser
->lexer
);
5024 /* Look for the `(' token. */
5025 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
5026 /* Types cannot be defined in a `typeid' expression. */
5027 saved_message
= parser
->type_definition_forbidden_message
;
5028 parser
->type_definition_forbidden_message
5029 = G_("types may not be defined in a %<typeid%> expression");
5030 /* We can't be sure yet whether we're looking at a type-id or an
5032 cp_parser_parse_tentatively (parser
);
5033 /* Try a type-id first. */
5034 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
5035 parser
->in_type_id_in_expr_p
= true;
5036 type
= cp_parser_type_id (parser
);
5037 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
5038 /* Look for the `)' token. Otherwise, we can't be sure that
5039 we're not looking at an expression: consider `typeid (int
5040 (3))', for example. */
5041 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
5042 /* If all went well, simply lookup the type-id. */
5043 if (cp_parser_parse_definitely (parser
))
5044 postfix_expression
= get_typeid (type
);
5045 /* Otherwise, fall back to the expression variant. */
5050 /* Look for an expression. */
5051 expression
= cp_parser_expression (parser
, /*cast_p=*/false, & idk
);
5052 /* Compute its typeid. */
5053 postfix_expression
= build_typeid (expression
);
5054 /* Look for the `)' token. */
5055 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
5057 /* Restore the saved message. */
5058 parser
->type_definition_forbidden_message
= saved_message
;
5059 /* `typeid' may not appear in an integral constant expression. */
5060 if (cp_parser_non_integral_constant_expression(parser
, NIC_TYPEID
))
5061 return error_mark_node
;
5068 /* The syntax permitted here is the same permitted for an
5069 elaborated-type-specifier. */
5070 type
= cp_parser_elaborated_type_specifier (parser
,
5071 /*is_friend=*/false,
5072 /*is_declaration=*/false);
5073 postfix_expression
= cp_parser_functional_cast (parser
, type
);
5081 /* If the next thing is a simple-type-specifier, we may be
5082 looking at a functional cast. We could also be looking at
5083 an id-expression. So, we try the functional cast, and if
5084 that doesn't work we fall back to the primary-expression. */
5085 cp_parser_parse_tentatively (parser
);
5086 /* Look for the simple-type-specifier. */
5087 type
= cp_parser_simple_type_specifier (parser
,
5088 /*decl_specs=*/NULL
,
5089 CP_PARSER_FLAGS_NONE
);
5090 /* Parse the cast itself. */
5091 if (!cp_parser_error_occurred (parser
))
5093 = cp_parser_functional_cast (parser
, type
);
5094 /* If that worked, we're done. */
5095 if (cp_parser_parse_definitely (parser
))
5098 /* If the functional-cast didn't work out, try a
5099 compound-literal. */
5100 if (cp_parser_allow_gnu_extensions_p (parser
)
5101 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
5103 VEC(constructor_elt
,gc
) *initializer_list
= NULL
;
5104 bool saved_in_type_id_in_expr_p
;
5106 cp_parser_parse_tentatively (parser
);
5107 /* Consume the `('. */
5108 cp_lexer_consume_token (parser
->lexer
);
5109 /* Parse the type. */
5110 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
5111 parser
->in_type_id_in_expr_p
= true;
5112 type
= cp_parser_type_id (parser
);
5113 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
5114 /* Look for the `)'. */
5115 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
5116 /* Look for the `{'. */
5117 cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
);
5118 /* If things aren't going well, there's no need to
5120 if (!cp_parser_error_occurred (parser
))
5122 bool non_constant_p
;
5123 /* Parse the initializer-list. */
5125 = cp_parser_initializer_list (parser
, &non_constant_p
);
5126 /* Allow a trailing `,'. */
5127 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
5128 cp_lexer_consume_token (parser
->lexer
);
5129 /* Look for the final `}'. */
5130 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
5132 /* If that worked, we're definitely looking at a
5133 compound-literal expression. */
5134 if (cp_parser_parse_definitely (parser
))
5136 /* Warn the user that a compound literal is not
5137 allowed in standard C++. */
5138 pedwarn (input_location
, OPT_pedantic
, "ISO C++ forbids compound-literals");
5139 /* For simplicity, we disallow compound literals in
5140 constant-expressions. We could
5141 allow compound literals of integer type, whose
5142 initializer was a constant, in constant
5143 expressions. Permitting that usage, as a further
5144 extension, would not change the meaning of any
5145 currently accepted programs. (Of course, as
5146 compound literals are not part of ISO C++, the
5147 standard has nothing to say.) */
5148 if (cp_parser_non_integral_constant_expression (parser
,
5151 postfix_expression
= error_mark_node
;
5154 /* Form the representation of the compound-literal. */
5156 = (finish_compound_literal
5157 (type
, build_constructor (init_list_type_node
,
5158 initializer_list
)));
5163 /* It must be a primary-expression. */
5165 = cp_parser_primary_expression (parser
, address_p
, cast_p
,
5166 /*template_arg_p=*/false,
5172 /* Keep looping until the postfix-expression is complete. */
5175 if (idk
== CP_ID_KIND_UNQUALIFIED
5176 && TREE_CODE (postfix_expression
) == IDENTIFIER_NODE
5177 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_PAREN
))
5178 /* It is not a Koenig lookup function call. */
5180 = unqualified_name_lookup_error (postfix_expression
);
5182 /* Peek at the next token. */
5183 token
= cp_lexer_peek_token (parser
->lexer
);
5185 switch (token
->type
)
5187 case CPP_OPEN_SQUARE
:
5189 = cp_parser_postfix_open_square_expression (parser
,
5192 idk
= CP_ID_KIND_NONE
;
5193 is_member_access
= false;
5196 case CPP_OPEN_PAREN
:
5197 /* postfix-expression ( expression-list [opt] ) */
5200 bool is_builtin_constant_p
;
5201 bool saved_integral_constant_expression_p
= false;
5202 bool saved_non_integral_constant_expression_p
= false;
5205 is_member_access
= false;
5207 is_builtin_constant_p
5208 = DECL_IS_BUILTIN_CONSTANT_P (postfix_expression
);
5209 if (is_builtin_constant_p
)
5211 /* The whole point of __builtin_constant_p is to allow
5212 non-constant expressions to appear as arguments. */
5213 saved_integral_constant_expression_p
5214 = parser
->integral_constant_expression_p
;
5215 saved_non_integral_constant_expression_p
5216 = parser
->non_integral_constant_expression_p
;
5217 parser
->integral_constant_expression_p
= false;
5219 args
= (cp_parser_parenthesized_expression_list
5221 /*cast_p=*/false, /*allow_expansion_p=*/true,
5222 /*non_constant_p=*/NULL
));
5223 if (is_builtin_constant_p
)
5225 parser
->integral_constant_expression_p
5226 = saved_integral_constant_expression_p
;
5227 parser
->non_integral_constant_expression_p
5228 = saved_non_integral_constant_expression_p
;
5233 postfix_expression
= error_mark_node
;
5237 /* Function calls are not permitted in
5238 constant-expressions. */
5239 if (! builtin_valid_in_constant_expr_p (postfix_expression
)
5240 && cp_parser_non_integral_constant_expression (parser
,
5243 postfix_expression
= error_mark_node
;
5244 release_tree_vector (args
);
5249 if (idk
== CP_ID_KIND_UNQUALIFIED
5250 || idk
== CP_ID_KIND_TEMPLATE_ID
)
5252 if (TREE_CODE (postfix_expression
) == IDENTIFIER_NODE
)
5254 if (!VEC_empty (tree
, args
))
5257 if (!any_type_dependent_arguments_p (args
))
5259 = perform_koenig_lookup (postfix_expression
, args
,
5260 /*include_std=*/false);
5264 = unqualified_fn_lookup_error (postfix_expression
);
5266 /* We do not perform argument-dependent lookup if
5267 normal lookup finds a non-function, in accordance
5268 with the expected resolution of DR 218. */
5269 else if (!VEC_empty (tree
, args
)
5270 && is_overloaded_fn (postfix_expression
))
5272 tree fn
= get_first_fn (postfix_expression
);
5273 fn
= STRIP_TEMPLATE (fn
);
5275 /* Do not do argument dependent lookup if regular
5276 lookup finds a member function or a block-scope
5277 function declaration. [basic.lookup.argdep]/3 */
5278 if (!DECL_FUNCTION_MEMBER_P (fn
)
5279 && !DECL_LOCAL_FUNCTION_P (fn
))
5282 if (!any_type_dependent_arguments_p (args
))
5284 = perform_koenig_lookup (postfix_expression
, args
,
5285 /*include_std=*/false);
5290 if (TREE_CODE (postfix_expression
) == COMPONENT_REF
)
5292 tree instance
= TREE_OPERAND (postfix_expression
, 0);
5293 tree fn
= TREE_OPERAND (postfix_expression
, 1);
5295 if (processing_template_decl
5296 && (type_dependent_expression_p (instance
)
5297 || (!BASELINK_P (fn
)
5298 && TREE_CODE (fn
) != FIELD_DECL
)
5299 || type_dependent_expression_p (fn
)
5300 || any_type_dependent_arguments_p (args
)))
5303 = build_nt_call_vec (postfix_expression
, args
);
5304 release_tree_vector (args
);
5308 if (BASELINK_P (fn
))
5311 = (build_new_method_call
5312 (instance
, fn
, &args
, NULL_TREE
,
5313 (idk
== CP_ID_KIND_QUALIFIED
5314 ? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
),
5316 tf_warning_or_error
));
5320 = finish_call_expr (postfix_expression
, &args
,
5321 /*disallow_virtual=*/false,
5323 tf_warning_or_error
);
5325 else if (TREE_CODE (postfix_expression
) == OFFSET_REF
5326 || TREE_CODE (postfix_expression
) == MEMBER_REF
5327 || TREE_CODE (postfix_expression
) == DOTSTAR_EXPR
)
5328 postfix_expression
= (build_offset_ref_call_from_tree
5329 (postfix_expression
, &args
));
5330 else if (idk
== CP_ID_KIND_QUALIFIED
)
5331 /* A call to a static class member, or a namespace-scope
5334 = finish_call_expr (postfix_expression
, &args
,
5335 /*disallow_virtual=*/true,
5337 tf_warning_or_error
);
5339 /* All other function calls. */
5341 = finish_call_expr (postfix_expression
, &args
,
5342 /*disallow_virtual=*/false,
5344 tf_warning_or_error
);
5346 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
5347 idk
= CP_ID_KIND_NONE
;
5349 release_tree_vector (args
);
5355 /* postfix-expression . template [opt] id-expression
5356 postfix-expression . pseudo-destructor-name
5357 postfix-expression -> template [opt] id-expression
5358 postfix-expression -> pseudo-destructor-name */
5360 /* Consume the `.' or `->' operator. */
5361 cp_lexer_consume_token (parser
->lexer
);
5364 = cp_parser_postfix_dot_deref_expression (parser
, token
->type
,
5369 is_member_access
= true;
5373 /* postfix-expression ++ */
5374 /* Consume the `++' token. */
5375 cp_lexer_consume_token (parser
->lexer
);
5376 /* Generate a representation for the complete expression. */
5378 = finish_increment_expr (postfix_expression
,
5379 POSTINCREMENT_EXPR
);
5380 /* Increments may not appear in constant-expressions. */
5381 if (cp_parser_non_integral_constant_expression (parser
, NIC_INC
))
5382 postfix_expression
= error_mark_node
;
5383 idk
= CP_ID_KIND_NONE
;
5384 is_member_access
= false;
5387 case CPP_MINUS_MINUS
:
5388 /* postfix-expression -- */
5389 /* Consume the `--' token. */
5390 cp_lexer_consume_token (parser
->lexer
);
5391 /* Generate a representation for the complete expression. */
5393 = finish_increment_expr (postfix_expression
,
5394 POSTDECREMENT_EXPR
);
5395 /* Decrements may not appear in constant-expressions. */
5396 if (cp_parser_non_integral_constant_expression (parser
, NIC_DEC
))
5397 postfix_expression
= error_mark_node
;
5398 idk
= CP_ID_KIND_NONE
;
5399 is_member_access
= false;
5403 if (pidk_return
!= NULL
)
5404 * pidk_return
= idk
;
5405 if (member_access_only_p
)
5406 return is_member_access
? postfix_expression
: error_mark_node
;
5408 return postfix_expression
;
5412 /* We should never get here. */
5414 return error_mark_node
;
5417 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5418 by cp_parser_builtin_offsetof. We're looking for
5420 postfix-expression [ expression ]
5422 FOR_OFFSETOF is set if we're being called in that context, which
5423 changes how we deal with integer constant expressions. */
5426 cp_parser_postfix_open_square_expression (cp_parser
*parser
,
5427 tree postfix_expression
,
5432 /* Consume the `[' token. */
5433 cp_lexer_consume_token (parser
->lexer
);
5435 /* Parse the index expression. */
5436 /* ??? For offsetof, there is a question of what to allow here. If
5437 offsetof is not being used in an integral constant expression context,
5438 then we *could* get the right answer by computing the value at runtime.
5439 If we are in an integral constant expression context, then we might
5440 could accept any constant expression; hard to say without analysis.
5441 Rather than open the barn door too wide right away, allow only integer
5442 constant expressions here. */
5444 index
= cp_parser_constant_expression (parser
, false, NULL
);
5446 index
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
5448 /* Look for the closing `]'. */
5449 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
5451 /* Build the ARRAY_REF. */
5452 postfix_expression
= grok_array_decl (postfix_expression
, index
);
5454 /* When not doing offsetof, array references are not permitted in
5455 constant-expressions. */
5457 && (cp_parser_non_integral_constant_expression (parser
, NIC_ARRAY_REF
)))
5458 postfix_expression
= error_mark_node
;
5460 return postfix_expression
;
5463 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5464 by cp_parser_builtin_offsetof. We're looking for
5466 postfix-expression . template [opt] id-expression
5467 postfix-expression . pseudo-destructor-name
5468 postfix-expression -> template [opt] id-expression
5469 postfix-expression -> pseudo-destructor-name
5471 FOR_OFFSETOF is set if we're being called in that context. That sorta
5472 limits what of the above we'll actually accept, but nevermind.
5473 TOKEN_TYPE is the "." or "->" token, which will already have been
5474 removed from the stream. */
5477 cp_parser_postfix_dot_deref_expression (cp_parser
*parser
,
5478 enum cpp_ttype token_type
,
5479 tree postfix_expression
,
5480 bool for_offsetof
, cp_id_kind
*idk
,
5481 location_t location
)
5485 bool pseudo_destructor_p
;
5486 tree scope
= NULL_TREE
;
5488 /* If this is a `->' operator, dereference the pointer. */
5489 if (token_type
== CPP_DEREF
)
5490 postfix_expression
= build_x_arrow (postfix_expression
);
5491 /* Check to see whether or not the expression is type-dependent. */
5492 dependent_p
= type_dependent_expression_p (postfix_expression
);
5493 /* The identifier following the `->' or `.' is not qualified. */
5494 parser
->scope
= NULL_TREE
;
5495 parser
->qualifying_scope
= NULL_TREE
;
5496 parser
->object_scope
= NULL_TREE
;
5497 *idk
= CP_ID_KIND_NONE
;
5499 /* Enter the scope corresponding to the type of the object
5500 given by the POSTFIX_EXPRESSION. */
5501 if (!dependent_p
&& TREE_TYPE (postfix_expression
) != NULL_TREE
)
5503 scope
= TREE_TYPE (postfix_expression
);
5504 /* According to the standard, no expression should ever have
5505 reference type. Unfortunately, we do not currently match
5506 the standard in this respect in that our internal representation
5507 of an expression may have reference type even when the standard
5508 says it does not. Therefore, we have to manually obtain the
5509 underlying type here. */
5510 scope
= non_reference (scope
);
5511 /* The type of the POSTFIX_EXPRESSION must be complete. */
5512 if (scope
== unknown_type_node
)
5514 error_at (location
, "%qE does not have class type",
5515 postfix_expression
);
5519 scope
= complete_type_or_else (scope
, NULL_TREE
);
5520 /* Let the name lookup machinery know that we are processing a
5521 class member access expression. */
5522 parser
->context
->object_type
= scope
;
5523 /* If something went wrong, we want to be able to discern that case,
5524 as opposed to the case where there was no SCOPE due to the type
5525 of expression being dependent. */
5527 scope
= error_mark_node
;
5528 /* If the SCOPE was erroneous, make the various semantic analysis
5529 functions exit quickly -- and without issuing additional error
5531 if (scope
== error_mark_node
)
5532 postfix_expression
= error_mark_node
;
5535 /* Assume this expression is not a pseudo-destructor access. */
5536 pseudo_destructor_p
= false;
5538 /* If the SCOPE is a scalar type, then, if this is a valid program,
5539 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
5540 is type dependent, it can be pseudo-destructor-name or something else.
5541 Try to parse it as pseudo-destructor-name first. */
5542 if ((scope
&& SCALAR_TYPE_P (scope
)) || dependent_p
)
5547 cp_parser_parse_tentatively (parser
);
5548 /* Parse the pseudo-destructor-name. */
5550 cp_parser_pseudo_destructor_name (parser
, &s
, &type
);
5552 && (cp_parser_error_occurred (parser
)
5553 || TREE_CODE (type
) != TYPE_DECL
5554 || !SCALAR_TYPE_P (TREE_TYPE (type
))))
5555 cp_parser_abort_tentative_parse (parser
);
5556 else if (cp_parser_parse_definitely (parser
))
5558 pseudo_destructor_p
= true;
5560 = finish_pseudo_destructor_expr (postfix_expression
,
5561 s
, TREE_TYPE (type
));
5565 if (!pseudo_destructor_p
)
5567 /* If the SCOPE is not a scalar type, we are looking at an
5568 ordinary class member access expression, rather than a
5569 pseudo-destructor-name. */
5571 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
5572 /* Parse the id-expression. */
5573 name
= (cp_parser_id_expression
5575 cp_parser_optional_template_keyword (parser
),
5576 /*check_dependency_p=*/true,
5578 /*declarator_p=*/false,
5579 /*optional_p=*/false));
5580 /* In general, build a SCOPE_REF if the member name is qualified.
5581 However, if the name was not dependent and has already been
5582 resolved; there is no need to build the SCOPE_REF. For example;
5584 struct X { void f(); };
5585 template <typename T> void f(T* t) { t->X::f(); }
5587 Even though "t" is dependent, "X::f" is not and has been resolved
5588 to a BASELINK; there is no need to include scope information. */
5590 /* But we do need to remember that there was an explicit scope for
5591 virtual function calls. */
5593 *idk
= CP_ID_KIND_QUALIFIED
;
5595 /* If the name is a template-id that names a type, we will get a
5596 TYPE_DECL here. That is invalid code. */
5597 if (TREE_CODE (name
) == TYPE_DECL
)
5599 error_at (token
->location
, "invalid use of %qD", name
);
5600 postfix_expression
= error_mark_node
;
5604 if (name
!= error_mark_node
&& !BASELINK_P (name
) && parser
->scope
)
5606 name
= build_qualified_name (/*type=*/NULL_TREE
,
5610 parser
->scope
= NULL_TREE
;
5611 parser
->qualifying_scope
= NULL_TREE
;
5612 parser
->object_scope
= NULL_TREE
;
5614 if (scope
&& name
&& BASELINK_P (name
))
5615 adjust_result_of_qualified_name_lookup
5616 (name
, BINFO_TYPE (BASELINK_ACCESS_BINFO (name
)), scope
);
5618 = finish_class_member_access_expr (postfix_expression
, name
,
5620 tf_warning_or_error
);
5624 /* We no longer need to look up names in the scope of the object on
5625 the left-hand side of the `.' or `->' operator. */
5626 parser
->context
->object_type
= NULL_TREE
;
5628 /* Outside of offsetof, these operators may not appear in
5629 constant-expressions. */
5631 && (cp_parser_non_integral_constant_expression
5632 (parser
, token_type
== CPP_DEREF
? NIC_ARROW
: NIC_POINT
)))
5633 postfix_expression
= error_mark_node
;
5635 return postfix_expression
;
5638 /* Parse a parenthesized expression-list.
5641 assignment-expression
5642 expression-list, assignment-expression
5647 identifier, expression-list
5649 CAST_P is true if this expression is the target of a cast.
5651 ALLOW_EXPANSION_P is true if this expression allows expansion of an
5654 Returns a vector of trees. Each element is a representation of an
5655 assignment-expression. NULL is returned if the ( and or ) are
5656 missing. An empty, but allocated, vector is returned on no
5657 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
5658 if we are parsing an attribute list for an attribute that wants a
5659 plain identifier argument, normal_attr for an attribute that wants
5660 an expression, or non_attr if we aren't parsing an attribute list. If
5661 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
5662 not all of the expressions in the list were constant. */
5664 static VEC(tree
,gc
) *
5665 cp_parser_parenthesized_expression_list (cp_parser
* parser
,
5666 int is_attribute_list
,
5668 bool allow_expansion_p
,
5669 bool *non_constant_p
)
5671 VEC(tree
,gc
) *expression_list
;
5672 bool fold_expr_p
= is_attribute_list
!= non_attr
;
5673 tree identifier
= NULL_TREE
;
5674 bool saved_greater_than_is_operator_p
;
5676 /* Assume all the expressions will be constant. */
5678 *non_constant_p
= false;
5680 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
5683 expression_list
= make_tree_vector ();
5685 /* Within a parenthesized expression, a `>' token is always
5686 the greater-than operator. */
5687 saved_greater_than_is_operator_p
5688 = parser
->greater_than_is_operator_p
;
5689 parser
->greater_than_is_operator_p
= true;
5691 /* Consume expressions until there are no more. */
5692 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
5697 /* At the beginning of attribute lists, check to see if the
5698 next token is an identifier. */
5699 if (is_attribute_list
== id_attr
5700 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_NAME
)
5704 /* Consume the identifier. */
5705 token
= cp_lexer_consume_token (parser
->lexer
);
5706 /* Save the identifier. */
5707 identifier
= token
->u
.value
;
5711 bool expr_non_constant_p
;
5713 /* Parse the next assignment-expression. */
5714 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
5716 /* A braced-init-list. */
5717 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
5718 expr
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
5719 if (non_constant_p
&& expr_non_constant_p
)
5720 *non_constant_p
= true;
5722 else if (non_constant_p
)
5724 expr
= (cp_parser_constant_expression
5725 (parser
, /*allow_non_constant_p=*/true,
5726 &expr_non_constant_p
));
5727 if (expr_non_constant_p
)
5728 *non_constant_p
= true;
5731 expr
= cp_parser_assignment_expression (parser
, cast_p
, NULL
);
5734 expr
= fold_non_dependent_expr (expr
);
5736 /* If we have an ellipsis, then this is an expression
5738 if (allow_expansion_p
5739 && cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
5741 /* Consume the `...'. */
5742 cp_lexer_consume_token (parser
->lexer
);
5744 /* Build the argument pack. */
5745 expr
= make_pack_expansion (expr
);
5748 /* Add it to the list. We add error_mark_node
5749 expressions to the list, so that we can still tell if
5750 the correct form for a parenthesized expression-list
5751 is found. That gives better errors. */
5752 VEC_safe_push (tree
, gc
, expression_list
, expr
);
5754 if (expr
== error_mark_node
)
5758 /* After the first item, attribute lists look the same as
5759 expression lists. */
5760 is_attribute_list
= non_attr
;
5763 /* If the next token isn't a `,', then we are done. */
5764 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
5767 /* Otherwise, consume the `,' and keep going. */
5768 cp_lexer_consume_token (parser
->lexer
);
5771 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
5776 /* We try and resync to an unnested comma, as that will give the
5777 user better diagnostics. */
5778 ending
= cp_parser_skip_to_closing_parenthesis (parser
,
5779 /*recovering=*/true,
5781 /*consume_paren=*/true);
5786 parser
->greater_than_is_operator_p
5787 = saved_greater_than_is_operator_p
;
5792 parser
->greater_than_is_operator_p
5793 = saved_greater_than_is_operator_p
;
5796 VEC_safe_insert (tree
, gc
, expression_list
, 0, identifier
);
5798 return expression_list
;
5801 /* Parse a pseudo-destructor-name.
5803 pseudo-destructor-name:
5804 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
5805 :: [opt] nested-name-specifier template template-id :: ~ type-name
5806 :: [opt] nested-name-specifier [opt] ~ type-name
5808 If either of the first two productions is used, sets *SCOPE to the
5809 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
5810 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
5811 or ERROR_MARK_NODE if the parse fails. */
5814 cp_parser_pseudo_destructor_name (cp_parser
* parser
,
5818 bool nested_name_specifier_p
;
5820 /* Assume that things will not work out. */
5821 *type
= error_mark_node
;
5823 /* Look for the optional `::' operator. */
5824 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/true);
5825 /* Look for the optional nested-name-specifier. */
5826 nested_name_specifier_p
5827 = (cp_parser_nested_name_specifier_opt (parser
,
5828 /*typename_keyword_p=*/false,
5829 /*check_dependency_p=*/true,
5831 /*is_declaration=*/false)
5833 /* Now, if we saw a nested-name-specifier, we might be doing the
5834 second production. */
5835 if (nested_name_specifier_p
5836 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
5838 /* Consume the `template' keyword. */
5839 cp_lexer_consume_token (parser
->lexer
);
5840 /* Parse the template-id. */
5841 cp_parser_template_id (parser
,
5842 /*template_keyword_p=*/true,
5843 /*check_dependency_p=*/false,
5844 /*is_declaration=*/true);
5845 /* Look for the `::' token. */
5846 cp_parser_require (parser
, CPP_SCOPE
, RT_SCOPE
);
5848 /* If the next token is not a `~', then there might be some
5849 additional qualification. */
5850 else if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMPL
))
5852 /* At this point, we're looking for "type-name :: ~". The type-name
5853 must not be a class-name, since this is a pseudo-destructor. So,
5854 it must be either an enum-name, or a typedef-name -- both of which
5855 are just identifiers. So, we peek ahead to check that the "::"
5856 and "~" tokens are present; if they are not, then we can avoid
5857 calling type_name. */
5858 if (cp_lexer_peek_token (parser
->lexer
)->type
!= CPP_NAME
5859 || cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_SCOPE
5860 || cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
!= CPP_COMPL
)
5862 cp_parser_error (parser
, "non-scalar type");
5866 /* Look for the type-name. */
5867 *scope
= TREE_TYPE (cp_parser_nonclass_name (parser
));
5868 if (*scope
== error_mark_node
)
5871 /* Look for the `::' token. */
5872 cp_parser_require (parser
, CPP_SCOPE
, RT_SCOPE
);
5877 /* Look for the `~'. */
5878 cp_parser_require (parser
, CPP_COMPL
, RT_COMPL
);
5879 /* Look for the type-name again. We are not responsible for
5880 checking that it matches the first type-name. */
5881 *type
= cp_parser_nonclass_name (parser
);
5884 /* Parse a unary-expression.
5890 unary-operator cast-expression
5891 sizeof unary-expression
5893 alignof ( type-id ) [C++0x]
5900 __extension__ cast-expression
5901 __alignof__ unary-expression
5902 __alignof__ ( type-id )
5903 alignof unary-expression [C++0x]
5904 __real__ cast-expression
5905 __imag__ cast-expression
5908 ADDRESS_P is true iff the unary-expression is appearing as the
5909 operand of the `&' operator. CAST_P is true if this expression is
5910 the target of a cast.
5912 Returns a representation of the expression. */
5915 cp_parser_unary_expression (cp_parser
*parser
, bool address_p
, bool cast_p
,
5919 enum tree_code unary_operator
;
5921 /* Peek at the next token. */
5922 token
= cp_lexer_peek_token (parser
->lexer
);
5923 /* Some keywords give away the kind of expression. */
5924 if (token
->type
== CPP_KEYWORD
)
5926 enum rid keyword
= token
->keyword
;
5936 op
= keyword
== RID_ALIGNOF
? ALIGNOF_EXPR
: SIZEOF_EXPR
;
5937 /* Consume the token. */
5938 cp_lexer_consume_token (parser
->lexer
);
5939 /* Parse the operand. */
5940 operand
= cp_parser_sizeof_operand (parser
, keyword
);
5942 if (TYPE_P (operand
))
5943 return cxx_sizeof_or_alignof_type (operand
, op
, true);
5946 /* ISO C++ defines alignof only with types, not with
5947 expressions. So pedwarn if alignof is used with a non-
5948 type expression. However, __alignof__ is ok. */
5949 if (!strcmp (IDENTIFIER_POINTER (token
->u
.value
), "alignof"))
5950 pedwarn (token
->location
, OPT_pedantic
,
5951 "ISO C++ does not allow %<alignof%> "
5954 return cxx_sizeof_or_alignof_expr (operand
, op
, true);
5959 return cp_parser_new_expression (parser
);
5962 return cp_parser_delete_expression (parser
);
5966 /* The saved value of the PEDANTIC flag. */
5970 /* Save away the PEDANTIC flag. */
5971 cp_parser_extension_opt (parser
, &saved_pedantic
);
5972 /* Parse the cast-expression. */
5973 expr
= cp_parser_simple_cast_expression (parser
);
5974 /* Restore the PEDANTIC flag. */
5975 pedantic
= saved_pedantic
;
5985 /* Consume the `__real__' or `__imag__' token. */
5986 cp_lexer_consume_token (parser
->lexer
);
5987 /* Parse the cast-expression. */
5988 expression
= cp_parser_simple_cast_expression (parser
);
5989 /* Create the complete representation. */
5990 return build_x_unary_op ((keyword
== RID_REALPART
5991 ? REALPART_EXPR
: IMAGPART_EXPR
),
5993 tf_warning_or_error
);
6000 const char *saved_message
;
6001 bool saved_integral_constant_expression_p
;
6002 bool saved_non_integral_constant_expression_p
;
6003 bool saved_greater_than_is_operator_p
;
6005 cp_lexer_consume_token (parser
->lexer
);
6006 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
6008 saved_message
= parser
->type_definition_forbidden_message
;
6009 parser
->type_definition_forbidden_message
6010 = G_("types may not be defined in %<noexcept%> expressions");
6012 saved_integral_constant_expression_p
6013 = parser
->integral_constant_expression_p
;
6014 saved_non_integral_constant_expression_p
6015 = parser
->non_integral_constant_expression_p
;
6016 parser
->integral_constant_expression_p
= false;
6018 saved_greater_than_is_operator_p
6019 = parser
->greater_than_is_operator_p
;
6020 parser
->greater_than_is_operator_p
= true;
6022 ++cp_unevaluated_operand
;
6023 ++c_inhibit_evaluation_warnings
;
6024 expr
= cp_parser_expression (parser
, false, NULL
);
6025 --c_inhibit_evaluation_warnings
;
6026 --cp_unevaluated_operand
;
6028 parser
->greater_than_is_operator_p
6029 = saved_greater_than_is_operator_p
;
6031 parser
->integral_constant_expression_p
6032 = saved_integral_constant_expression_p
;
6033 parser
->non_integral_constant_expression_p
6034 = saved_non_integral_constant_expression_p
;
6036 parser
->type_definition_forbidden_message
= saved_message
;
6038 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
6039 return finish_noexcept_expr (expr
, tf_warning_or_error
);
6047 /* Look for the `:: new' and `:: delete', which also signal the
6048 beginning of a new-expression, or delete-expression,
6049 respectively. If the next token is `::', then it might be one of
6051 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
6055 /* See if the token after the `::' is one of the keywords in
6056 which we're interested. */
6057 keyword
= cp_lexer_peek_nth_token (parser
->lexer
, 2)->keyword
;
6058 /* If it's `new', we have a new-expression. */
6059 if (keyword
== RID_NEW
)
6060 return cp_parser_new_expression (parser
);
6061 /* Similarly, for `delete'. */
6062 else if (keyword
== RID_DELETE
)
6063 return cp_parser_delete_expression (parser
);
6066 /* Look for a unary operator. */
6067 unary_operator
= cp_parser_unary_operator (token
);
6068 /* The `++' and `--' operators can be handled similarly, even though
6069 they are not technically unary-operators in the grammar. */
6070 if (unary_operator
== ERROR_MARK
)
6072 if (token
->type
== CPP_PLUS_PLUS
)
6073 unary_operator
= PREINCREMENT_EXPR
;
6074 else if (token
->type
== CPP_MINUS_MINUS
)
6075 unary_operator
= PREDECREMENT_EXPR
;
6076 /* Handle the GNU address-of-label extension. */
6077 else if (cp_parser_allow_gnu_extensions_p (parser
)
6078 && token
->type
== CPP_AND_AND
)
6082 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
6084 /* Consume the '&&' token. */
6085 cp_lexer_consume_token (parser
->lexer
);
6086 /* Look for the identifier. */
6087 identifier
= cp_parser_identifier (parser
);
6088 /* Create an expression representing the address. */
6089 expression
= finish_label_address_expr (identifier
, loc
);
6090 if (cp_parser_non_integral_constant_expression (parser
,
6092 expression
= error_mark_node
;
6096 if (unary_operator
!= ERROR_MARK
)
6098 tree cast_expression
;
6099 tree expression
= error_mark_node
;
6100 non_integral_constant non_constant_p
= NIC_NONE
;
6102 /* Consume the operator token. */
6103 token
= cp_lexer_consume_token (parser
->lexer
);
6104 /* Parse the cast-expression. */
6106 = cp_parser_cast_expression (parser
,
6107 unary_operator
== ADDR_EXPR
,
6108 /*cast_p=*/false, pidk
);
6109 /* Now, build an appropriate representation. */
6110 switch (unary_operator
)
6113 non_constant_p
= NIC_STAR
;
6114 expression
= build_x_indirect_ref (cast_expression
, RO_UNARY_STAR
,
6115 tf_warning_or_error
);
6119 non_constant_p
= NIC_ADDR
;
6122 expression
= build_x_unary_op (unary_operator
, cast_expression
,
6123 tf_warning_or_error
);
6126 case PREINCREMENT_EXPR
:
6127 case PREDECREMENT_EXPR
:
6128 non_constant_p
= unary_operator
== PREINCREMENT_EXPR
6129 ? NIC_PREINCREMENT
: NIC_PREDECREMENT
;
6131 case UNARY_PLUS_EXPR
:
6133 case TRUTH_NOT_EXPR
:
6134 expression
= finish_unary_op_expr (unary_operator
, cast_expression
);
6141 if (non_constant_p
!= NIC_NONE
6142 && cp_parser_non_integral_constant_expression (parser
,
6144 expression
= error_mark_node
;
6149 return cp_parser_postfix_expression (parser
, address_p
, cast_p
,
6150 /*member_access_only_p=*/false,
6154 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
6155 unary-operator, the corresponding tree code is returned. */
6157 static enum tree_code
6158 cp_parser_unary_operator (cp_token
* token
)
6160 switch (token
->type
)
6163 return INDIRECT_REF
;
6169 return UNARY_PLUS_EXPR
;
6175 return TRUTH_NOT_EXPR
;
6178 return BIT_NOT_EXPR
;
6185 /* Parse a new-expression.
6188 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
6189 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
6191 Returns a representation of the expression. */
6194 cp_parser_new_expression (cp_parser
* parser
)
6196 bool global_scope_p
;
6197 VEC(tree
,gc
) *placement
;
6199 VEC(tree
,gc
) *initializer
;
6203 /* Look for the optional `::' operator. */
6205 = (cp_parser_global_scope_opt (parser
,
6206 /*current_scope_valid_p=*/false)
6208 /* Look for the `new' operator. */
6209 cp_parser_require_keyword (parser
, RID_NEW
, RT_NEW
);
6210 /* There's no easy way to tell a new-placement from the
6211 `( type-id )' construct. */
6212 cp_parser_parse_tentatively (parser
);
6213 /* Look for a new-placement. */
6214 placement
= cp_parser_new_placement (parser
);
6215 /* If that didn't work out, there's no new-placement. */
6216 if (!cp_parser_parse_definitely (parser
))
6218 if (placement
!= NULL
)
6219 release_tree_vector (placement
);
6223 /* If the next token is a `(', then we have a parenthesized
6225 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
6228 /* Consume the `('. */
6229 cp_lexer_consume_token (parser
->lexer
);
6230 /* Parse the type-id. */
6231 type
= cp_parser_type_id (parser
);
6232 /* Look for the closing `)'. */
6233 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
6234 token
= cp_lexer_peek_token (parser
->lexer
);
6235 /* There should not be a direct-new-declarator in this production,
6236 but GCC used to allowed this, so we check and emit a sensible error
6237 message for this case. */
6238 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
6240 error_at (token
->location
,
6241 "array bound forbidden after parenthesized type-id");
6242 inform (token
->location
,
6243 "try removing the parentheses around the type-id");
6244 cp_parser_direct_new_declarator (parser
);
6248 /* Otherwise, there must be a new-type-id. */
6250 type
= cp_parser_new_type_id (parser
, &nelts
);
6252 /* If the next token is a `(' or '{', then we have a new-initializer. */
6253 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
)
6254 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
6255 initializer
= cp_parser_new_initializer (parser
);
6259 /* A new-expression may not appear in an integral constant
6261 if (cp_parser_non_integral_constant_expression (parser
, NIC_NEW
))
6262 ret
= error_mark_node
;
6265 /* Create a representation of the new-expression. */
6266 ret
= build_new (&placement
, type
, nelts
, &initializer
, global_scope_p
,
6267 tf_warning_or_error
);
6270 if (placement
!= NULL
)
6271 release_tree_vector (placement
);
6272 if (initializer
!= NULL
)
6273 release_tree_vector (initializer
);
6278 /* Parse a new-placement.
6283 Returns the same representation as for an expression-list. */
6285 static VEC(tree
,gc
) *
6286 cp_parser_new_placement (cp_parser
* parser
)
6288 VEC(tree
,gc
) *expression_list
;
6290 /* Parse the expression-list. */
6291 expression_list
= (cp_parser_parenthesized_expression_list
6292 (parser
, non_attr
, /*cast_p=*/false,
6293 /*allow_expansion_p=*/true,
6294 /*non_constant_p=*/NULL
));
6296 return expression_list
;
6299 /* Parse a new-type-id.
6302 type-specifier-seq new-declarator [opt]
6304 Returns the TYPE allocated. If the new-type-id indicates an array
6305 type, *NELTS is set to the number of elements in the last array
6306 bound; the TYPE will not include the last array bound. */
6309 cp_parser_new_type_id (cp_parser
* parser
, tree
*nelts
)
6311 cp_decl_specifier_seq type_specifier_seq
;
6312 cp_declarator
*new_declarator
;
6313 cp_declarator
*declarator
;
6314 cp_declarator
*outer_declarator
;
6315 const char *saved_message
;
6318 /* The type-specifier sequence must not contain type definitions.
6319 (It cannot contain declarations of new types either, but if they
6320 are not definitions we will catch that because they are not
6322 saved_message
= parser
->type_definition_forbidden_message
;
6323 parser
->type_definition_forbidden_message
6324 = G_("types may not be defined in a new-type-id");
6325 /* Parse the type-specifier-seq. */
6326 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/false,
6327 /*is_trailing_return=*/false,
6328 &type_specifier_seq
);
6329 /* Restore the old message. */
6330 parser
->type_definition_forbidden_message
= saved_message
;
6331 /* Parse the new-declarator. */
6332 new_declarator
= cp_parser_new_declarator_opt (parser
);
6334 /* Determine the number of elements in the last array dimension, if
6337 /* Skip down to the last array dimension. */
6338 declarator
= new_declarator
;
6339 outer_declarator
= NULL
;
6340 while (declarator
&& (declarator
->kind
== cdk_pointer
6341 || declarator
->kind
== cdk_ptrmem
))
6343 outer_declarator
= declarator
;
6344 declarator
= declarator
->declarator
;
6347 && declarator
->kind
== cdk_array
6348 && declarator
->declarator
6349 && declarator
->declarator
->kind
== cdk_array
)
6351 outer_declarator
= declarator
;
6352 declarator
= declarator
->declarator
;
6355 if (declarator
&& declarator
->kind
== cdk_array
)
6357 *nelts
= declarator
->u
.array
.bounds
;
6358 if (*nelts
== error_mark_node
)
6359 *nelts
= integer_one_node
;
6361 if (outer_declarator
)
6362 outer_declarator
->declarator
= declarator
->declarator
;
6364 new_declarator
= NULL
;
6367 type
= groktypename (&type_specifier_seq
, new_declarator
, false);
6371 /* Parse an (optional) new-declarator.
6374 ptr-operator new-declarator [opt]
6375 direct-new-declarator
6377 Returns the declarator. */
6379 static cp_declarator
*
6380 cp_parser_new_declarator_opt (cp_parser
* parser
)
6382 enum tree_code code
;
6384 cp_cv_quals cv_quals
;
6386 /* We don't know if there's a ptr-operator next, or not. */
6387 cp_parser_parse_tentatively (parser
);
6388 /* Look for a ptr-operator. */
6389 code
= cp_parser_ptr_operator (parser
, &type
, &cv_quals
);
6390 /* If that worked, look for more new-declarators. */
6391 if (cp_parser_parse_definitely (parser
))
6393 cp_declarator
*declarator
;
6395 /* Parse another optional declarator. */
6396 declarator
= cp_parser_new_declarator_opt (parser
);
6398 return cp_parser_make_indirect_declarator
6399 (code
, type
, cv_quals
, declarator
);
6402 /* If the next token is a `[', there is a direct-new-declarator. */
6403 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
6404 return cp_parser_direct_new_declarator (parser
);
6409 /* Parse a direct-new-declarator.
6411 direct-new-declarator:
6413 direct-new-declarator [constant-expression]
6417 static cp_declarator
*
6418 cp_parser_direct_new_declarator (cp_parser
* parser
)
6420 cp_declarator
*declarator
= NULL
;
6426 /* Look for the opening `['. */
6427 cp_parser_require (parser
, CPP_OPEN_SQUARE
, RT_OPEN_SQUARE
);
6428 /* The first expression is not required to be constant. */
6431 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
6432 expression
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
6433 /* The standard requires that the expression have integral
6434 type. DR 74 adds enumeration types. We believe that the
6435 real intent is that these expressions be handled like the
6436 expression in a `switch' condition, which also allows
6437 classes with a single conversion to integral or
6438 enumeration type. */
6439 if (!processing_template_decl
)
6442 = build_expr_type_conversion (WANT_INT
| WANT_ENUM
,
6447 error_at (token
->location
,
6448 "expression in new-declarator must have integral "
6449 "or enumeration type");
6450 expression
= error_mark_node
;
6454 /* But all the other expressions must be. */
6457 = cp_parser_constant_expression (parser
,
6458 /*allow_non_constant=*/false,
6460 /* Look for the closing `]'. */
6461 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
6463 /* Add this bound to the declarator. */
6464 declarator
= make_array_declarator (declarator
, expression
);
6466 /* If the next token is not a `[', then there are no more
6468 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_SQUARE
))
6475 /* Parse a new-initializer.
6478 ( expression-list [opt] )
6481 Returns a representation of the expression-list. */
6483 static VEC(tree
,gc
) *
6484 cp_parser_new_initializer (cp_parser
* parser
)
6486 VEC(tree
,gc
) *expression_list
;
6488 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
6491 bool expr_non_constant_p
;
6492 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
6493 t
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
6494 CONSTRUCTOR_IS_DIRECT_INIT (t
) = 1;
6495 expression_list
= make_tree_vector_single (t
);
6498 expression_list
= (cp_parser_parenthesized_expression_list
6499 (parser
, non_attr
, /*cast_p=*/false,
6500 /*allow_expansion_p=*/true,
6501 /*non_constant_p=*/NULL
));
6503 return expression_list
;
6506 /* Parse a delete-expression.
6509 :: [opt] delete cast-expression
6510 :: [opt] delete [ ] cast-expression
6512 Returns a representation of the expression. */
6515 cp_parser_delete_expression (cp_parser
* parser
)
6517 bool global_scope_p
;
6521 /* Look for the optional `::' operator. */
6523 = (cp_parser_global_scope_opt (parser
,
6524 /*current_scope_valid_p=*/false)
6526 /* Look for the `delete' keyword. */
6527 cp_parser_require_keyword (parser
, RID_DELETE
, RT_DELETE
);
6528 /* See if the array syntax is in use. */
6529 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
6531 /* Consume the `[' token. */
6532 cp_lexer_consume_token (parser
->lexer
);
6533 /* Look for the `]' token. */
6534 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
6535 /* Remember that this is the `[]' construct. */
6541 /* Parse the cast-expression. */
6542 expression
= cp_parser_simple_cast_expression (parser
);
6544 /* A delete-expression may not appear in an integral constant
6546 if (cp_parser_non_integral_constant_expression (parser
, NIC_DEL
))
6547 return error_mark_node
;
6549 return delete_sanity (expression
, NULL_TREE
, array_p
, global_scope_p
);
6552 /* Returns true if TOKEN may start a cast-expression and false
6556 cp_parser_token_starts_cast_expression (cp_token
*token
)
6558 switch (token
->type
)
6564 case CPP_CLOSE_SQUARE
:
6565 case CPP_CLOSE_PAREN
:
6566 case CPP_CLOSE_BRACE
:
6570 case CPP_DEREF_STAR
:
6578 case CPP_GREATER_EQ
:
6598 /* '[' may start a primary-expression in obj-c++. */
6599 case CPP_OPEN_SQUARE
:
6600 return c_dialect_objc ();
6607 /* Parse a cast-expression.
6611 ( type-id ) cast-expression
6613 ADDRESS_P is true iff the unary-expression is appearing as the
6614 operand of the `&' operator. CAST_P is true if this expression is
6615 the target of a cast.
6617 Returns a representation of the expression. */
6620 cp_parser_cast_expression (cp_parser
*parser
, bool address_p
, bool cast_p
,
6623 /* If it's a `(', then we might be looking at a cast. */
6624 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
6626 tree type
= NULL_TREE
;
6627 tree expr
= NULL_TREE
;
6628 bool compound_literal_p
;
6629 const char *saved_message
;
6631 /* There's no way to know yet whether or not this is a cast.
6632 For example, `(int (3))' is a unary-expression, while `(int)
6633 3' is a cast. So, we resort to parsing tentatively. */
6634 cp_parser_parse_tentatively (parser
);
6635 /* Types may not be defined in a cast. */
6636 saved_message
= parser
->type_definition_forbidden_message
;
6637 parser
->type_definition_forbidden_message
6638 = G_("types may not be defined in casts");
6639 /* Consume the `('. */
6640 cp_lexer_consume_token (parser
->lexer
);
6641 /* A very tricky bit is that `(struct S) { 3 }' is a
6642 compound-literal (which we permit in C++ as an extension).
6643 But, that construct is not a cast-expression -- it is a
6644 postfix-expression. (The reason is that `(struct S) { 3 }.i'
6645 is legal; if the compound-literal were a cast-expression,
6646 you'd need an extra set of parentheses.) But, if we parse
6647 the type-id, and it happens to be a class-specifier, then we
6648 will commit to the parse at that point, because we cannot
6649 undo the action that is done when creating a new class. So,
6650 then we cannot back up and do a postfix-expression.
6652 Therefore, we scan ahead to the closing `)', and check to see
6653 if the token after the `)' is a `{'. If so, we are not
6654 looking at a cast-expression.
6656 Save tokens so that we can put them back. */
6657 cp_lexer_save_tokens (parser
->lexer
);
6658 /* Skip tokens until the next token is a closing parenthesis.
6659 If we find the closing `)', and the next token is a `{', then
6660 we are looking at a compound-literal. */
6662 = (cp_parser_skip_to_closing_parenthesis (parser
, false, false,
6663 /*consume_paren=*/true)
6664 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
));
6665 /* Roll back the tokens we skipped. */
6666 cp_lexer_rollback_tokens (parser
->lexer
);
6667 /* If we were looking at a compound-literal, simulate an error
6668 so that the call to cp_parser_parse_definitely below will
6670 if (compound_literal_p
)
6671 cp_parser_simulate_error (parser
);
6674 bool saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
6675 parser
->in_type_id_in_expr_p
= true;
6676 /* Look for the type-id. */
6677 type
= cp_parser_type_id (parser
);
6678 /* Look for the closing `)'. */
6679 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
6680 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
6683 /* Restore the saved message. */
6684 parser
->type_definition_forbidden_message
= saved_message
;
6686 /* At this point this can only be either a cast or a
6687 parenthesized ctor such as `(T ())' that looks like a cast to
6688 function returning T. */
6689 if (!cp_parser_error_occurred (parser
)
6690 && cp_parser_token_starts_cast_expression (cp_lexer_peek_token
6693 cp_parser_parse_definitely (parser
);
6694 expr
= cp_parser_cast_expression (parser
,
6695 /*address_p=*/false,
6696 /*cast_p=*/true, pidk
);
6698 /* Warn about old-style casts, if so requested. */
6699 if (warn_old_style_cast
6700 && !in_system_header
6701 && !VOID_TYPE_P (type
)
6702 && current_lang_name
!= lang_name_c
)
6703 warning (OPT_Wold_style_cast
, "use of old-style cast");
6705 /* Only type conversions to integral or enumeration types
6706 can be used in constant-expressions. */
6707 if (!cast_valid_in_integral_constant_expression_p (type
)
6708 && cp_parser_non_integral_constant_expression (parser
,
6710 return error_mark_node
;
6712 /* Perform the cast. */
6713 expr
= build_c_cast (input_location
, type
, expr
);
6717 cp_parser_abort_tentative_parse (parser
);
6720 /* If we get here, then it's not a cast, so it must be a
6721 unary-expression. */
6722 return cp_parser_unary_expression (parser
, address_p
, cast_p
, pidk
);
6725 /* Parse a binary expression of the general form:
6729 pm-expression .* cast-expression
6730 pm-expression ->* cast-expression
6732 multiplicative-expression:
6734 multiplicative-expression * pm-expression
6735 multiplicative-expression / pm-expression
6736 multiplicative-expression % pm-expression
6738 additive-expression:
6739 multiplicative-expression
6740 additive-expression + multiplicative-expression
6741 additive-expression - multiplicative-expression
6745 shift-expression << additive-expression
6746 shift-expression >> additive-expression
6748 relational-expression:
6750 relational-expression < shift-expression
6751 relational-expression > shift-expression
6752 relational-expression <= shift-expression
6753 relational-expression >= shift-expression
6757 relational-expression:
6758 relational-expression <? shift-expression
6759 relational-expression >? shift-expression
6761 equality-expression:
6762 relational-expression
6763 equality-expression == relational-expression
6764 equality-expression != relational-expression
6768 and-expression & equality-expression
6770 exclusive-or-expression:
6772 exclusive-or-expression ^ and-expression
6774 inclusive-or-expression:
6775 exclusive-or-expression
6776 inclusive-or-expression | exclusive-or-expression
6778 logical-and-expression:
6779 inclusive-or-expression
6780 logical-and-expression && inclusive-or-expression
6782 logical-or-expression:
6783 logical-and-expression
6784 logical-or-expression || logical-and-expression
6786 All these are implemented with a single function like:
6789 simple-cast-expression
6790 binary-expression <token> binary-expression
6792 CAST_P is true if this expression is the target of a cast.
6794 The binops_by_token map is used to get the tree codes for each <token> type.
6795 binary-expressions are associated according to a precedence table. */
6797 #define TOKEN_PRECEDENCE(token) \
6798 (((token->type == CPP_GREATER \
6799 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
6800 && !parser->greater_than_is_operator_p) \
6801 ? PREC_NOT_OPERATOR \
6802 : binops_by_token[token->type].prec)
6805 cp_parser_binary_expression (cp_parser
* parser
, bool cast_p
,
6806 bool no_toplevel_fold_p
,
6807 enum cp_parser_prec prec
,
6810 cp_parser_expression_stack stack
;
6811 cp_parser_expression_stack_entry
*sp
= &stack
[0];
6814 enum tree_code tree_type
, lhs_type
, rhs_type
;
6815 enum cp_parser_prec new_prec
, lookahead_prec
;
6818 /* Parse the first expression. */
6819 lhs
= cp_parser_cast_expression (parser
, /*address_p=*/false, cast_p
, pidk
);
6820 lhs_type
= ERROR_MARK
;
6824 /* Get an operator token. */
6825 token
= cp_lexer_peek_token (parser
->lexer
);
6827 if (warn_cxx0x_compat
6828 && token
->type
== CPP_RSHIFT
6829 && !parser
->greater_than_is_operator_p
)
6831 if (warning_at (token
->location
, OPT_Wc__0x_compat
,
6832 "%<>>%> operator will be treated as"
6833 " two right angle brackets in C++0x"))
6834 inform (token
->location
,
6835 "suggest parentheses around %<>>%> expression");
6838 new_prec
= TOKEN_PRECEDENCE (token
);
6840 /* Popping an entry off the stack means we completed a subexpression:
6841 - either we found a token which is not an operator (`>' where it is not
6842 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
6843 will happen repeatedly;
6844 - or, we found an operator which has lower priority. This is the case
6845 where the recursive descent *ascends*, as in `3 * 4 + 5' after
6847 if (new_prec
<= prec
)
6856 tree_type
= binops_by_token
[token
->type
].tree_type
;
6858 /* We used the operator token. */
6859 cp_lexer_consume_token (parser
->lexer
);
6861 /* For "false && x" or "true || x", x will never be executed;
6862 disable warnings while evaluating it. */
6863 if (tree_type
== TRUTH_ANDIF_EXPR
)
6864 c_inhibit_evaluation_warnings
+= lhs
== truthvalue_false_node
;
6865 else if (tree_type
== TRUTH_ORIF_EXPR
)
6866 c_inhibit_evaluation_warnings
+= lhs
== truthvalue_true_node
;
6868 /* Extract another operand. It may be the RHS of this expression
6869 or the LHS of a new, higher priority expression. */
6870 rhs
= cp_parser_simple_cast_expression (parser
);
6871 rhs_type
= ERROR_MARK
;
6873 /* Get another operator token. Look up its precedence to avoid
6874 building a useless (immediately popped) stack entry for common
6875 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
6876 token
= cp_lexer_peek_token (parser
->lexer
);
6877 lookahead_prec
= TOKEN_PRECEDENCE (token
);
6878 if (lookahead_prec
> new_prec
)
6880 /* ... and prepare to parse the RHS of the new, higher priority
6881 expression. Since precedence levels on the stack are
6882 monotonically increasing, we do not have to care about
6885 sp
->tree_type
= tree_type
;
6887 sp
->lhs_type
= lhs_type
;
6890 lhs_type
= rhs_type
;
6892 new_prec
= lookahead_prec
;
6896 lookahead_prec
= new_prec
;
6897 /* If the stack is not empty, we have parsed into LHS the right side
6898 (`4' in the example above) of an expression we had suspended.
6899 We can use the information on the stack to recover the LHS (`3')
6900 from the stack together with the tree code (`MULT_EXPR'), and
6901 the precedence of the higher level subexpression
6902 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
6903 which will be used to actually build the additive expression. */
6906 tree_type
= sp
->tree_type
;
6908 rhs_type
= lhs_type
;
6910 lhs_type
= sp
->lhs_type
;
6913 /* Undo the disabling of warnings done above. */
6914 if (tree_type
== TRUTH_ANDIF_EXPR
)
6915 c_inhibit_evaluation_warnings
-= lhs
== truthvalue_false_node
;
6916 else if (tree_type
== TRUTH_ORIF_EXPR
)
6917 c_inhibit_evaluation_warnings
-= lhs
== truthvalue_true_node
;
6919 overloaded_p
= false;
6920 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
6921 ERROR_MARK for everything that is not a binary expression.
6922 This makes warn_about_parentheses miss some warnings that
6923 involve unary operators. For unary expressions we should
6924 pass the correct tree_code unless the unary expression was
6925 surrounded by parentheses.
6927 if (no_toplevel_fold_p
6928 && lookahead_prec
<= prec
6930 && TREE_CODE_CLASS (tree_type
) == tcc_comparison
)
6931 lhs
= build2 (tree_type
, boolean_type_node
, lhs
, rhs
);
6933 lhs
= build_x_binary_op (tree_type
, lhs
, lhs_type
, rhs
, rhs_type
,
6934 &overloaded_p
, tf_warning_or_error
);
6935 lhs_type
= tree_type
;
6937 /* If the binary operator required the use of an overloaded operator,
6938 then this expression cannot be an integral constant-expression.
6939 An overloaded operator can be used even if both operands are
6940 otherwise permissible in an integral constant-expression if at
6941 least one of the operands is of enumeration type. */
6944 && cp_parser_non_integral_constant_expression (parser
,
6946 return error_mark_node
;
6953 /* Parse the `? expression : assignment-expression' part of a
6954 conditional-expression. The LOGICAL_OR_EXPR is the
6955 logical-or-expression that started the conditional-expression.
6956 Returns a representation of the entire conditional-expression.
6958 This routine is used by cp_parser_assignment_expression.
6960 ? expression : assignment-expression
6964 ? : assignment-expression */
6967 cp_parser_question_colon_clause (cp_parser
* parser
, tree logical_or_expr
)
6970 tree assignment_expr
;
6971 struct cp_token
*token
;
6973 /* Consume the `?' token. */
6974 cp_lexer_consume_token (parser
->lexer
);
6975 token
= cp_lexer_peek_token (parser
->lexer
);
6976 if (cp_parser_allow_gnu_extensions_p (parser
)
6977 && token
->type
== CPP_COLON
)
6979 pedwarn (token
->location
, OPT_pedantic
,
6980 "ISO C++ does not allow ?: with omitted middle operand");
6981 /* Implicit true clause. */
6983 c_inhibit_evaluation_warnings
+= logical_or_expr
== truthvalue_true_node
;
6984 warn_for_omitted_condop (token
->location
, logical_or_expr
);
6988 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
6989 parser
->colon_corrects_to_scope_p
= false;
6990 /* Parse the expression. */
6991 c_inhibit_evaluation_warnings
+= logical_or_expr
== truthvalue_false_node
;
6992 expr
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
6993 c_inhibit_evaluation_warnings
+=
6994 ((logical_or_expr
== truthvalue_true_node
)
6995 - (logical_or_expr
== truthvalue_false_node
));
6996 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
6999 /* The next token should be a `:'. */
7000 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
7001 /* Parse the assignment-expression. */
7002 assignment_expr
= cp_parser_assignment_expression (parser
, /*cast_p=*/false, NULL
);
7003 c_inhibit_evaluation_warnings
-= logical_or_expr
== truthvalue_true_node
;
7005 /* Build the conditional-expression. */
7006 return build_x_conditional_expr (logical_or_expr
,
7009 tf_warning_or_error
);
7012 /* Parse an assignment-expression.
7014 assignment-expression:
7015 conditional-expression
7016 logical-or-expression assignment-operator assignment_expression
7019 CAST_P is true if this expression is the target of a cast.
7021 Returns a representation for the expression. */
7024 cp_parser_assignment_expression (cp_parser
* parser
, bool cast_p
,
7029 /* If the next token is the `throw' keyword, then we're looking at
7030 a throw-expression. */
7031 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_THROW
))
7032 expr
= cp_parser_throw_expression (parser
);
7033 /* Otherwise, it must be that we are looking at a
7034 logical-or-expression. */
7037 /* Parse the binary expressions (logical-or-expression). */
7038 expr
= cp_parser_binary_expression (parser
, cast_p
, false,
7039 PREC_NOT_OPERATOR
, pidk
);
7040 /* If the next token is a `?' then we're actually looking at a
7041 conditional-expression. */
7042 if (cp_lexer_next_token_is (parser
->lexer
, CPP_QUERY
))
7043 return cp_parser_question_colon_clause (parser
, expr
);
7046 enum tree_code assignment_operator
;
7048 /* If it's an assignment-operator, we're using the second
7051 = cp_parser_assignment_operator_opt (parser
);
7052 if (assignment_operator
!= ERROR_MARK
)
7054 bool non_constant_p
;
7056 /* Parse the right-hand side of the assignment. */
7057 tree rhs
= cp_parser_initializer_clause (parser
, &non_constant_p
);
7059 if (BRACE_ENCLOSED_INITIALIZER_P (rhs
))
7060 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
7062 /* An assignment may not appear in a
7063 constant-expression. */
7064 if (cp_parser_non_integral_constant_expression (parser
,
7066 return error_mark_node
;
7067 /* Build the assignment expression. */
7068 expr
= build_x_modify_expr (expr
,
7069 assignment_operator
,
7071 tf_warning_or_error
);
7079 /* Parse an (optional) assignment-operator.
7081 assignment-operator: one of
7082 = *= /= %= += -= >>= <<= &= ^= |=
7086 assignment-operator: one of
7089 If the next token is an assignment operator, the corresponding tree
7090 code is returned, and the token is consumed. For example, for
7091 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
7092 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
7093 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
7094 operator, ERROR_MARK is returned. */
7096 static enum tree_code
7097 cp_parser_assignment_operator_opt (cp_parser
* parser
)
7102 /* Peek at the next token. */
7103 token
= cp_lexer_peek_token (parser
->lexer
);
7105 switch (token
->type
)
7116 op
= TRUNC_DIV_EXPR
;
7120 op
= TRUNC_MOD_EXPR
;
7152 /* Nothing else is an assignment operator. */
7156 /* If it was an assignment operator, consume it. */
7157 if (op
!= ERROR_MARK
)
7158 cp_lexer_consume_token (parser
->lexer
);
7163 /* Parse an expression.
7166 assignment-expression
7167 expression , assignment-expression
7169 CAST_P is true if this expression is the target of a cast.
7171 Returns a representation of the expression. */
7174 cp_parser_expression (cp_parser
* parser
, bool cast_p
, cp_id_kind
* pidk
)
7176 tree expression
= NULL_TREE
;
7180 tree assignment_expression
;
7182 /* Parse the next assignment-expression. */
7183 assignment_expression
7184 = cp_parser_assignment_expression (parser
, cast_p
, pidk
);
7185 /* If this is the first assignment-expression, we can just
7188 expression
= assignment_expression
;
7190 expression
= build_x_compound_expr (expression
,
7191 assignment_expression
,
7192 tf_warning_or_error
);
7193 /* If the next token is not a comma, then we are done with the
7195 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
7197 /* Consume the `,'. */
7198 cp_lexer_consume_token (parser
->lexer
);
7199 /* A comma operator cannot appear in a constant-expression. */
7200 if (cp_parser_non_integral_constant_expression (parser
, NIC_COMMA
))
7201 expression
= error_mark_node
;
7207 /* Parse a constant-expression.
7209 constant-expression:
7210 conditional-expression
7212 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
7213 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
7214 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
7215 is false, NON_CONSTANT_P should be NULL. */
7218 cp_parser_constant_expression (cp_parser
* parser
,
7219 bool allow_non_constant_p
,
7220 bool *non_constant_p
)
7222 bool saved_integral_constant_expression_p
;
7223 bool saved_allow_non_integral_constant_expression_p
;
7224 bool saved_non_integral_constant_expression_p
;
7227 /* It might seem that we could simply parse the
7228 conditional-expression, and then check to see if it were
7229 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
7230 one that the compiler can figure out is constant, possibly after
7231 doing some simplifications or optimizations. The standard has a
7232 precise definition of constant-expression, and we must honor
7233 that, even though it is somewhat more restrictive.
7239 is not a legal declaration, because `(2, 3)' is not a
7240 constant-expression. The `,' operator is forbidden in a
7241 constant-expression. However, GCC's constant-folding machinery
7242 will fold this operation to an INTEGER_CST for `3'. */
7244 /* Save the old settings. */
7245 saved_integral_constant_expression_p
= parser
->integral_constant_expression_p
;
7246 saved_allow_non_integral_constant_expression_p
7247 = parser
->allow_non_integral_constant_expression_p
;
7248 saved_non_integral_constant_expression_p
= parser
->non_integral_constant_expression_p
;
7249 /* We are now parsing a constant-expression. */
7250 parser
->integral_constant_expression_p
= true;
7251 parser
->allow_non_integral_constant_expression_p
7252 = (allow_non_constant_p
|| cxx_dialect
>= cxx0x
);
7253 parser
->non_integral_constant_expression_p
= false;
7254 /* Although the grammar says "conditional-expression", we parse an
7255 "assignment-expression", which also permits "throw-expression"
7256 and the use of assignment operators. In the case that
7257 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
7258 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
7259 actually essential that we look for an assignment-expression.
7260 For example, cp_parser_initializer_clauses uses this function to
7261 determine whether a particular assignment-expression is in fact
7263 expression
= cp_parser_assignment_expression (parser
, /*cast_p=*/false, NULL
);
7264 /* Restore the old settings. */
7265 parser
->integral_constant_expression_p
7266 = saved_integral_constant_expression_p
;
7267 parser
->allow_non_integral_constant_expression_p
7268 = saved_allow_non_integral_constant_expression_p
;
7269 if (allow_non_constant_p
)
7270 *non_constant_p
= parser
->non_integral_constant_expression_p
;
7271 else if (parser
->non_integral_constant_expression_p
7272 && cxx_dialect
< cxx0x
)
7273 expression
= error_mark_node
;
7274 parser
->non_integral_constant_expression_p
7275 = saved_non_integral_constant_expression_p
;
7280 /* Parse __builtin_offsetof.
7282 offsetof-expression:
7283 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
7285 offsetof-member-designator:
7287 | offsetof-member-designator "." id-expression
7288 | offsetof-member-designator "[" expression "]"
7289 | offsetof-member-designator "->" id-expression */
7292 cp_parser_builtin_offsetof (cp_parser
*parser
)
7294 int save_ice_p
, save_non_ice_p
;
7299 /* We're about to accept non-integral-constant things, but will
7300 definitely yield an integral constant expression. Save and
7301 restore these values around our local parsing. */
7302 save_ice_p
= parser
->integral_constant_expression_p
;
7303 save_non_ice_p
= parser
->non_integral_constant_expression_p
;
7305 /* Consume the "__builtin_offsetof" token. */
7306 cp_lexer_consume_token (parser
->lexer
);
7307 /* Consume the opening `('. */
7308 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
7309 /* Parse the type-id. */
7310 type
= cp_parser_type_id (parser
);
7311 /* Look for the `,'. */
7312 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
7313 token
= cp_lexer_peek_token (parser
->lexer
);
7315 /* Build the (type *)null that begins the traditional offsetof macro. */
7316 expr
= build_static_cast (build_pointer_type (type
), null_pointer_node
,
7317 tf_warning_or_error
);
7319 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
7320 expr
= cp_parser_postfix_dot_deref_expression (parser
, CPP_DEREF
, expr
,
7321 true, &dummy
, token
->location
);
7324 token
= cp_lexer_peek_token (parser
->lexer
);
7325 switch (token
->type
)
7327 case CPP_OPEN_SQUARE
:
7328 /* offsetof-member-designator "[" expression "]" */
7329 expr
= cp_parser_postfix_open_square_expression (parser
, expr
, true);
7333 /* offsetof-member-designator "->" identifier */
7334 expr
= grok_array_decl (expr
, integer_zero_node
);
7338 /* offsetof-member-designator "." identifier */
7339 cp_lexer_consume_token (parser
->lexer
);
7340 expr
= cp_parser_postfix_dot_deref_expression (parser
, CPP_DOT
,
7345 case CPP_CLOSE_PAREN
:
7346 /* Consume the ")" token. */
7347 cp_lexer_consume_token (parser
->lexer
);
7351 /* Error. We know the following require will fail, but
7352 that gives the proper error message. */
7353 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
7354 cp_parser_skip_to_closing_parenthesis (parser
, true, false, true);
7355 expr
= error_mark_node
;
7361 /* If we're processing a template, we can't finish the semantics yet.
7362 Otherwise we can fold the entire expression now. */
7363 if (processing_template_decl
)
7364 expr
= build1 (OFFSETOF_EXPR
, size_type_node
, expr
);
7366 expr
= finish_offsetof (expr
);
7369 parser
->integral_constant_expression_p
= save_ice_p
;
7370 parser
->non_integral_constant_expression_p
= save_non_ice_p
;
7375 /* Parse a trait expression. */
7378 cp_parser_trait_expr (cp_parser
* parser
, enum rid keyword
)
7381 tree type1
, type2
= NULL_TREE
;
7382 bool binary
= false;
7383 cp_decl_specifier_seq decl_specs
;
7387 case RID_HAS_NOTHROW_ASSIGN
:
7388 kind
= CPTK_HAS_NOTHROW_ASSIGN
;
7390 case RID_HAS_NOTHROW_CONSTRUCTOR
:
7391 kind
= CPTK_HAS_NOTHROW_CONSTRUCTOR
;
7393 case RID_HAS_NOTHROW_COPY
:
7394 kind
= CPTK_HAS_NOTHROW_COPY
;
7396 case RID_HAS_TRIVIAL_ASSIGN
:
7397 kind
= CPTK_HAS_TRIVIAL_ASSIGN
;
7399 case RID_HAS_TRIVIAL_CONSTRUCTOR
:
7400 kind
= CPTK_HAS_TRIVIAL_CONSTRUCTOR
;
7402 case RID_HAS_TRIVIAL_COPY
:
7403 kind
= CPTK_HAS_TRIVIAL_COPY
;
7405 case RID_HAS_TRIVIAL_DESTRUCTOR
:
7406 kind
= CPTK_HAS_TRIVIAL_DESTRUCTOR
;
7408 case RID_HAS_VIRTUAL_DESTRUCTOR
:
7409 kind
= CPTK_HAS_VIRTUAL_DESTRUCTOR
;
7411 case RID_IS_ABSTRACT
:
7412 kind
= CPTK_IS_ABSTRACT
;
7414 case RID_IS_BASE_OF
:
7415 kind
= CPTK_IS_BASE_OF
;
7419 kind
= CPTK_IS_CLASS
;
7421 case RID_IS_CONVERTIBLE_TO
:
7422 kind
= CPTK_IS_CONVERTIBLE_TO
;
7426 kind
= CPTK_IS_EMPTY
;
7429 kind
= CPTK_IS_ENUM
;
7434 case RID_IS_POLYMORPHIC
:
7435 kind
= CPTK_IS_POLYMORPHIC
;
7437 case RID_IS_STD_LAYOUT
:
7438 kind
= CPTK_IS_STD_LAYOUT
;
7440 case RID_IS_TRIVIAL
:
7441 kind
= CPTK_IS_TRIVIAL
;
7444 kind
= CPTK_IS_UNION
;
7446 case RID_IS_LITERAL_TYPE
:
7447 kind
= CPTK_IS_LITERAL_TYPE
;
7453 /* Consume the token. */
7454 cp_lexer_consume_token (parser
->lexer
);
7456 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
7458 type1
= cp_parser_type_id (parser
);
7460 if (type1
== error_mark_node
)
7461 return error_mark_node
;
7463 /* Build a trivial decl-specifier-seq. */
7464 clear_decl_specs (&decl_specs
);
7465 decl_specs
.type
= type1
;
7467 /* Call grokdeclarator to figure out what type this is. */
7468 type1
= grokdeclarator (NULL
, &decl_specs
, TYPENAME
,
7469 /*initialized=*/0, /*attrlist=*/NULL
);
7473 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
7475 type2
= cp_parser_type_id (parser
);
7477 if (type2
== error_mark_node
)
7478 return error_mark_node
;
7480 /* Build a trivial decl-specifier-seq. */
7481 clear_decl_specs (&decl_specs
);
7482 decl_specs
.type
= type2
;
7484 /* Call grokdeclarator to figure out what type this is. */
7485 type2
= grokdeclarator (NULL
, &decl_specs
, TYPENAME
,
7486 /*initialized=*/0, /*attrlist=*/NULL
);
7489 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
7491 /* Complete the trait expression, which may mean either processing
7492 the trait expr now or saving it for template instantiation. */
7493 return finish_trait_expr (kind
, type1
, type2
);
7496 /* Lambdas that appear in variable initializer or default argument scope
7497 get that in their mangling, so we need to record it. We might as well
7498 use the count for function and namespace scopes as well. */
7499 static GTY(()) tree lambda_scope
;
7500 static GTY(()) int lambda_count
;
7501 typedef struct GTY(()) tree_int
7506 DEF_VEC_O(tree_int
);
7507 DEF_VEC_ALLOC_O(tree_int
,gc
);
7508 static GTY(()) VEC(tree_int
,gc
) *lambda_scope_stack
;
7511 start_lambda_scope (tree decl
)
7515 /* Once we're inside a function, we ignore other scopes and just push
7516 the function again so that popping works properly. */
7517 if (current_function_decl
&& TREE_CODE (decl
) != FUNCTION_DECL
)
7518 decl
= current_function_decl
;
7519 ti
.t
= lambda_scope
;
7520 ti
.i
= lambda_count
;
7521 VEC_safe_push (tree_int
, gc
, lambda_scope_stack
, &ti
);
7522 if (lambda_scope
!= decl
)
7524 /* Don't reset the count if we're still in the same function. */
7525 lambda_scope
= decl
;
7531 record_lambda_scope (tree lambda
)
7533 LAMBDA_EXPR_EXTRA_SCOPE (lambda
) = lambda_scope
;
7534 LAMBDA_EXPR_DISCRIMINATOR (lambda
) = lambda_count
++;
7538 finish_lambda_scope (void)
7540 tree_int
*p
= VEC_last (tree_int
, lambda_scope_stack
);
7541 if (lambda_scope
!= p
->t
)
7543 lambda_scope
= p
->t
;
7544 lambda_count
= p
->i
;
7546 VEC_pop (tree_int
, lambda_scope_stack
);
7549 /* Parse a lambda expression.
7552 lambda-introducer lambda-declarator [opt] compound-statement
7554 Returns a representation of the expression. */
7557 cp_parser_lambda_expression (cp_parser
* parser
)
7559 tree lambda_expr
= build_lambda_expr ();
7562 LAMBDA_EXPR_LOCATION (lambda_expr
)
7563 = cp_lexer_peek_token (parser
->lexer
)->location
;
7565 if (cp_unevaluated_operand
)
7566 error_at (LAMBDA_EXPR_LOCATION (lambda_expr
),
7567 "lambda-expression in unevaluated context");
7569 /* We may be in the middle of deferred access check. Disable
7571 push_deferring_access_checks (dk_no_deferred
);
7573 cp_parser_lambda_introducer (parser
, lambda_expr
);
7575 type
= begin_lambda_type (lambda_expr
);
7577 record_lambda_scope (lambda_expr
);
7579 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
7580 determine_visibility (TYPE_NAME (type
));
7582 /* Now that we've started the type, add the capture fields for any
7583 explicit captures. */
7584 register_capture_members (LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
));
7587 /* Inside the class, surrounding template-parameter-lists do not apply. */
7588 unsigned int saved_num_template_parameter_lists
7589 = parser
->num_template_parameter_lists
;
7591 parser
->num_template_parameter_lists
= 0;
7593 /* By virtue of defining a local class, a lambda expression has access to
7594 the private variables of enclosing classes. */
7596 cp_parser_lambda_declarator_opt (parser
, lambda_expr
);
7598 cp_parser_lambda_body (parser
, lambda_expr
);
7600 /* The capture list was built up in reverse order; fix that now. */
7602 tree newlist
= NULL_TREE
;
7605 for (elt
= LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
);
7608 tree field
= TREE_PURPOSE (elt
);
7611 next
= TREE_CHAIN (elt
);
7612 TREE_CHAIN (elt
) = newlist
;
7615 /* Also add __ to the beginning of the field name so that code
7616 outside the lambda body can't see the captured name. We could
7617 just remove the name entirely, but this is more useful for
7619 if (field
== LAMBDA_EXPR_THIS_CAPTURE (lambda_expr
))
7620 /* The 'this' capture already starts with __. */
7623 buf
= (char *) alloca (IDENTIFIER_LENGTH (DECL_NAME (field
)) + 3);
7624 buf
[1] = buf
[0] = '_';
7625 memcpy (buf
+ 2, IDENTIFIER_POINTER (DECL_NAME (field
)),
7626 IDENTIFIER_LENGTH (DECL_NAME (field
)) + 1);
7627 DECL_NAME (field
) = get_identifier (buf
);
7629 LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
) = newlist
;
7632 maybe_add_lambda_conv_op (type
);
7634 type
= finish_struct (type
, /*attributes=*/NULL_TREE
);
7636 parser
->num_template_parameter_lists
= saved_num_template_parameter_lists
;
7639 pop_deferring_access_checks ();
7641 return build_lambda_object (lambda_expr
);
7644 /* Parse the beginning of a lambda expression.
7647 [ lambda-capture [opt] ]
7649 LAMBDA_EXPR is the current representation of the lambda expression. */
7652 cp_parser_lambda_introducer (cp_parser
* parser
, tree lambda_expr
)
7654 /* Need commas after the first capture. */
7657 /* Eat the leading `['. */
7658 cp_parser_require (parser
, CPP_OPEN_SQUARE
, RT_OPEN_SQUARE
);
7660 /* Record default capture mode. "[&" "[=" "[&," "[=," */
7661 if (cp_lexer_next_token_is (parser
->lexer
, CPP_AND
)
7662 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_NAME
)
7663 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) = CPLD_REFERENCE
;
7664 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
7665 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) = CPLD_COPY
;
7667 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
) != CPLD_NONE
)
7669 cp_lexer_consume_token (parser
->lexer
);
7673 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_SQUARE
))
7675 cp_token
* capture_token
;
7677 tree capture_init_expr
;
7678 cp_id_kind idk
= CP_ID_KIND_NONE
;
7679 bool explicit_init_p
= false;
7681 enum capture_kind_type
7686 enum capture_kind_type capture_kind
= BY_COPY
;
7688 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
7690 error ("expected end of capture-list");
7697 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
7699 /* Possibly capture `this'. */
7700 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_THIS
))
7702 cp_lexer_consume_token (parser
->lexer
);
7703 add_capture (lambda_expr
,
7704 /*id=*/get_identifier ("__this"),
7705 /*initializer=*/finish_this_expr(),
7706 /*by_reference_p=*/false,
7711 /* Remember whether we want to capture as a reference or not. */
7712 if (cp_lexer_next_token_is (parser
->lexer
, CPP_AND
))
7714 capture_kind
= BY_REFERENCE
;
7715 cp_lexer_consume_token (parser
->lexer
);
7718 /* Get the identifier. */
7719 capture_token
= cp_lexer_peek_token (parser
->lexer
);
7720 capture_id
= cp_parser_identifier (parser
);
7722 if (capture_id
== error_mark_node
)
7723 /* Would be nice to have a cp_parser_skip_to_closing_x for general
7724 delimiters, but I modified this to stop on unnested ']' as well. It
7725 was already changed to stop on unnested '}', so the
7726 "closing_parenthesis" name is no more misleading with my change. */
7728 cp_parser_skip_to_closing_parenthesis (parser
,
7729 /*recovering=*/true,
7731 /*consume_paren=*/true);
7735 /* Find the initializer for this capture. */
7736 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
7738 /* An explicit expression exists. */
7739 cp_lexer_consume_token (parser
->lexer
);
7740 pedwarn (input_location
, OPT_pedantic
,
7741 "ISO C++ does not allow initializers "
7742 "in lambda expression capture lists");
7743 capture_init_expr
= cp_parser_assignment_expression (parser
,
7746 explicit_init_p
= true;
7750 const char* error_msg
;
7752 /* Turn the identifier into an id-expression. */
7754 = cp_parser_lookup_name
7758 /*is_template=*/false,
7759 /*is_namespace=*/false,
7760 /*check_dependency=*/true,
7761 /*ambiguous_decls=*/NULL
,
7762 capture_token
->location
);
7765 = finish_id_expression
7770 /*integral_constant_expression_p=*/false,
7771 /*allow_non_integral_constant_expression_p=*/false,
7772 /*non_integral_constant_expression_p=*/NULL
,
7773 /*template_p=*/false,
7775 /*address_p=*/false,
7776 /*template_arg_p=*/false,
7778 capture_token
->location
);
7781 if (TREE_CODE (capture_init_expr
) == IDENTIFIER_NODE
)
7783 = unqualified_name_lookup_error (capture_init_expr
);
7785 add_capture (lambda_expr
,
7788 /*by_reference_p=*/capture_kind
== BY_REFERENCE
,
7792 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
7795 /* Parse the (optional) middle of a lambda expression.
7798 ( parameter-declaration-clause [opt] )
7799 attribute-specifier [opt]
7801 exception-specification [opt]
7802 lambda-return-type-clause [opt]
7804 LAMBDA_EXPR is the current representation of the lambda expression. */
7807 cp_parser_lambda_declarator_opt (cp_parser
* parser
, tree lambda_expr
)
7809 /* 5.1.1.4 of the standard says:
7810 If a lambda-expression does not include a lambda-declarator, it is as if
7811 the lambda-declarator were ().
7812 This means an empty parameter list, no attributes, and no exception
7814 tree param_list
= void_list_node
;
7815 tree attributes
= NULL_TREE
;
7816 tree exception_spec
= NULL_TREE
;
7819 /* The lambda-declarator is optional, but must begin with an opening
7820 parenthesis if present. */
7821 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
7823 cp_lexer_consume_token (parser
->lexer
);
7825 begin_scope (sk_function_parms
, /*entity=*/NULL_TREE
);
7827 /* Parse parameters. */
7828 param_list
= cp_parser_parameter_declaration_clause (parser
);
7830 /* Default arguments shall not be specified in the
7831 parameter-declaration-clause of a lambda-declarator. */
7832 for (t
= param_list
; t
; t
= TREE_CHAIN (t
))
7833 if (TREE_PURPOSE (t
))
7834 pedwarn (DECL_SOURCE_LOCATION (TREE_VALUE (t
)), OPT_pedantic
,
7835 "default argument specified for lambda parameter");
7837 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
7839 attributes
= cp_parser_attributes_opt (parser
);
7841 /* Parse optional `mutable' keyword. */
7842 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_MUTABLE
))
7844 cp_lexer_consume_token (parser
->lexer
);
7845 LAMBDA_EXPR_MUTABLE_P (lambda_expr
) = 1;
7848 /* Parse optional exception specification. */
7849 exception_spec
= cp_parser_exception_specification_opt (parser
);
7851 /* Parse optional trailing return type. */
7852 if (cp_lexer_next_token_is (parser
->lexer
, CPP_DEREF
))
7854 cp_lexer_consume_token (parser
->lexer
);
7855 LAMBDA_EXPR_RETURN_TYPE (lambda_expr
) = cp_parser_type_id (parser
);
7858 /* The function parameters must be in scope all the way until after the
7859 trailing-return-type in case of decltype. */
7860 for (t
= current_binding_level
->names
; t
; t
= DECL_CHAIN (t
))
7861 pop_binding (DECL_NAME (t
), t
);
7866 /* Create the function call operator.
7868 Messing with declarators like this is no uglier than building up the
7869 FUNCTION_DECL by hand, and this is less likely to get out of sync with
7872 cp_decl_specifier_seq return_type_specs
;
7873 cp_declarator
* declarator
;
7878 clear_decl_specs (&return_type_specs
);
7879 if (LAMBDA_EXPR_RETURN_TYPE (lambda_expr
))
7880 return_type_specs
.type
= LAMBDA_EXPR_RETURN_TYPE (lambda_expr
);
7882 /* Maybe we will deduce the return type later, but we can use void
7883 as a placeholder return type anyways. */
7884 return_type_specs
.type
= void_type_node
;
7886 p
= obstack_alloc (&declarator_obstack
, 0);
7888 declarator
= make_id_declarator (NULL_TREE
, ansi_opname (CALL_EXPR
),
7891 quals
= (LAMBDA_EXPR_MUTABLE_P (lambda_expr
)
7892 ? TYPE_UNQUALIFIED
: TYPE_QUAL_CONST
);
7893 declarator
= make_call_declarator (declarator
, param_list
, quals
,
7895 /*late_return_type=*/NULL_TREE
);
7896 declarator
->id_loc
= LAMBDA_EXPR_LOCATION (lambda_expr
);
7898 fco
= grokmethod (&return_type_specs
,
7901 DECL_INITIALIZED_IN_CLASS_P (fco
) = 1;
7902 DECL_ARTIFICIAL (fco
) = 1;
7904 finish_member_declaration (fco
);
7906 obstack_free (&declarator_obstack
, p
);
7910 /* Parse the body of a lambda expression, which is simply
7914 but which requires special handling.
7915 LAMBDA_EXPR is the current representation of the lambda expression. */
7918 cp_parser_lambda_body (cp_parser
* parser
, tree lambda_expr
)
7920 bool nested
= (current_function_decl
!= NULL_TREE
);
7922 push_function_context ();
7924 /* Finish the function call operator
7926 + late_parsing_for_member
7927 + function_definition_after_declarator
7928 + ctor_initializer_opt_and_function_body */
7930 tree fco
= lambda_function (lambda_expr
);
7934 /* Let the front end know that we are going to be defining this
7936 start_preparsed_function (fco
,
7938 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
7940 start_lambda_scope (fco
);
7941 body
= begin_function_body ();
7943 /* 5.1.1.4 of the standard says:
7944 If a lambda-expression does not include a trailing-return-type, it
7945 is as if the trailing-return-type denotes the following type:
7946 * if the compound-statement is of the form
7947 { return attribute-specifier [opt] expression ; }
7948 the type of the returned expression after lvalue-to-rvalue
7949 conversion (_conv.lval_ 4.1), array-to-pointer conversion
7950 (_conv.array_ 4.2), and function-to-pointer conversion
7952 * otherwise, void. */
7954 /* In a lambda that has neither a lambda-return-type-clause
7955 nor a deducible form, errors should be reported for return statements
7956 in the body. Since we used void as the placeholder return type, parsing
7957 the body as usual will give such desired behavior. */
7958 if (!LAMBDA_EXPR_RETURN_TYPE (lambda_expr
)
7959 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
)
7960 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->keyword
== RID_RETURN
7961 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
!= CPP_SEMICOLON
)
7964 tree expr
= NULL_TREE
;
7965 cp_id_kind idk
= CP_ID_KIND_NONE
;
7967 /* Parse tentatively in case there's more after the initial return
7969 cp_parser_parse_tentatively (parser
);
7971 cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
);
7972 cp_parser_require_keyword (parser
, RID_RETURN
, RT_RETURN
);
7974 expr
= cp_parser_expression (parser
, /*cast_p=*/false, &idk
);
7976 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
7977 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
7979 if (cp_parser_parse_definitely (parser
))
7981 apply_lambda_return_type (lambda_expr
, lambda_return_type (expr
));
7983 compound_stmt
= begin_compound_stmt (0);
7984 /* Will get error here if type not deduced yet. */
7985 finish_return_stmt (expr
);
7986 finish_compound_stmt (compound_stmt
);
7994 if (!LAMBDA_EXPR_RETURN_TYPE (lambda_expr
))
7995 LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda_expr
) = true;
7996 /* TODO: does begin_compound_stmt want BCS_FN_BODY?
7997 cp_parser_compound_stmt does not pass it. */
7998 cp_parser_function_body (parser
);
7999 LAMBDA_EXPR_DEDUCE_RETURN_TYPE_P (lambda_expr
) = false;
8002 finish_function_body (body
);
8003 finish_lambda_scope ();
8005 /* Finish the function and generate code for it if necessary. */
8006 expand_or_defer_fn (finish_function (/*inline*/2));
8010 pop_function_context();
8013 /* Statements [gram.stmt.stmt] */
8015 /* Parse a statement.
8019 expression-statement
8024 declaration-statement
8027 IN_COMPOUND is true when the statement is nested inside a
8028 cp_parser_compound_statement; this matters for certain pragmas.
8030 If IF_P is not NULL, *IF_P is set to indicate whether the statement
8031 is a (possibly labeled) if statement which is not enclosed in braces
8032 and has an else clause. This is used to implement -Wparentheses. */
8035 cp_parser_statement (cp_parser
* parser
, tree in_statement_expr
,
8036 bool in_compound
, bool *if_p
)
8040 location_t statement_location
;
8045 /* There is no statement yet. */
8046 statement
= NULL_TREE
;
8047 /* Peek at the next token. */
8048 token
= cp_lexer_peek_token (parser
->lexer
);
8049 /* Remember the location of the first token in the statement. */
8050 statement_location
= token
->location
;
8051 /* If this is a keyword, then that will often determine what kind of
8052 statement we have. */
8053 if (token
->type
== CPP_KEYWORD
)
8055 enum rid keyword
= token
->keyword
;
8061 /* Looks like a labeled-statement with a case label.
8062 Parse the label, and then use tail recursion to parse
8064 cp_parser_label_for_labeled_statement (parser
);
8069 statement
= cp_parser_selection_statement (parser
, if_p
);
8075 statement
= cp_parser_iteration_statement (parser
);
8082 statement
= cp_parser_jump_statement (parser
);
8085 /* Objective-C++ exception-handling constructs. */
8088 case RID_AT_FINALLY
:
8089 case RID_AT_SYNCHRONIZED
:
8091 statement
= cp_parser_objc_statement (parser
);
8095 statement
= cp_parser_try_block (parser
);
8099 /* This must be a namespace alias definition. */
8100 cp_parser_declaration_statement (parser
);
8104 /* It might be a keyword like `int' that can start a
8105 declaration-statement. */
8109 else if (token
->type
== CPP_NAME
)
8111 /* If the next token is a `:', then we are looking at a
8112 labeled-statement. */
8113 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
8114 if (token
->type
== CPP_COLON
)
8116 /* Looks like a labeled-statement with an ordinary label.
8117 Parse the label, and then use tail recursion to parse
8119 cp_parser_label_for_labeled_statement (parser
);
8123 /* Anything that starts with a `{' must be a compound-statement. */
8124 else if (token
->type
== CPP_OPEN_BRACE
)
8125 statement
= cp_parser_compound_statement (parser
, NULL
, false);
8126 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
8127 a statement all its own. */
8128 else if (token
->type
== CPP_PRAGMA
)
8130 /* Only certain OpenMP pragmas are attached to statements, and thus
8131 are considered statements themselves. All others are not. In
8132 the context of a compound, accept the pragma as a "statement" and
8133 return so that we can check for a close brace. Otherwise we
8134 require a real statement and must go back and read one. */
8136 cp_parser_pragma (parser
, pragma_compound
);
8137 else if (!cp_parser_pragma (parser
, pragma_stmt
))
8141 else if (token
->type
== CPP_EOF
)
8143 cp_parser_error (parser
, "expected statement");
8147 /* Everything else must be a declaration-statement or an
8148 expression-statement. Try for the declaration-statement
8149 first, unless we are looking at a `;', in which case we know that
8150 we have an expression-statement. */
8153 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
8155 cp_parser_parse_tentatively (parser
);
8156 /* Try to parse the declaration-statement. */
8157 cp_parser_declaration_statement (parser
);
8158 /* If that worked, we're done. */
8159 if (cp_parser_parse_definitely (parser
))
8162 /* Look for an expression-statement instead. */
8163 statement
= cp_parser_expression_statement (parser
, in_statement_expr
);
8166 /* Set the line number for the statement. */
8167 if (statement
&& STATEMENT_CODE_P (TREE_CODE (statement
)))
8168 SET_EXPR_LOCATION (statement
, statement_location
);
8171 /* Parse the label for a labeled-statement, i.e.
8174 case constant-expression :
8178 case constant-expression ... constant-expression : statement
8180 When a label is parsed without errors, the label is added to the
8181 parse tree by the finish_* functions, so this function doesn't
8182 have to return the label. */
8185 cp_parser_label_for_labeled_statement (cp_parser
* parser
)
8188 tree label
= NULL_TREE
;
8189 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
8191 /* The next token should be an identifier. */
8192 token
= cp_lexer_peek_token (parser
->lexer
);
8193 if (token
->type
!= CPP_NAME
8194 && token
->type
!= CPP_KEYWORD
)
8196 cp_parser_error (parser
, "expected labeled-statement");
8200 parser
->colon_corrects_to_scope_p
= false;
8201 switch (token
->keyword
)
8208 /* Consume the `case' token. */
8209 cp_lexer_consume_token (parser
->lexer
);
8210 /* Parse the constant-expression. */
8211 expr
= cp_parser_constant_expression (parser
,
8212 /*allow_non_constant_p=*/false,
8215 ellipsis
= cp_lexer_peek_token (parser
->lexer
);
8216 if (ellipsis
->type
== CPP_ELLIPSIS
)
8218 /* Consume the `...' token. */
8219 cp_lexer_consume_token (parser
->lexer
);
8221 cp_parser_constant_expression (parser
,
8222 /*allow_non_constant_p=*/false,
8224 /* We don't need to emit warnings here, as the common code
8225 will do this for us. */
8228 expr_hi
= NULL_TREE
;
8230 if (parser
->in_switch_statement_p
)
8231 finish_case_label (token
->location
, expr
, expr_hi
);
8233 error_at (token
->location
,
8234 "case label %qE not within a switch statement",
8240 /* Consume the `default' token. */
8241 cp_lexer_consume_token (parser
->lexer
);
8243 if (parser
->in_switch_statement_p
)
8244 finish_case_label (token
->location
, NULL_TREE
, NULL_TREE
);
8246 error_at (token
->location
, "case label not within a switch statement");
8250 /* Anything else must be an ordinary label. */
8251 label
= finish_label_stmt (cp_parser_identifier (parser
));
8255 /* Require the `:' token. */
8256 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
8258 /* An ordinary label may optionally be followed by attributes.
8259 However, this is only permitted if the attributes are then
8260 followed by a semicolon. This is because, for backward
8261 compatibility, when parsing
8262 lab: __attribute__ ((unused)) int i;
8263 we want the attribute to attach to "i", not "lab". */
8264 if (label
!= NULL_TREE
8265 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ATTRIBUTE
))
8269 cp_parser_parse_tentatively (parser
);
8270 attrs
= cp_parser_attributes_opt (parser
);
8271 if (attrs
== NULL_TREE
8272 || cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
8273 cp_parser_abort_tentative_parse (parser
);
8274 else if (!cp_parser_parse_definitely (parser
))
8277 cplus_decl_attributes (&label
, attrs
, 0);
8280 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
8283 /* Parse an expression-statement.
8285 expression-statement:
8288 Returns the new EXPR_STMT -- or NULL_TREE if the expression
8289 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
8290 indicates whether this expression-statement is part of an
8291 expression statement. */
8294 cp_parser_expression_statement (cp_parser
* parser
, tree in_statement_expr
)
8296 tree statement
= NULL_TREE
;
8297 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
8299 /* If the next token is a ';', then there is no expression
8301 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
8302 statement
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
8304 /* Give a helpful message for "A<T>::type t;" and the like. */
8305 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
)
8306 && !cp_parser_uncommitted_to_tentative_parse_p (parser
))
8308 if (TREE_CODE (statement
) == SCOPE_REF
)
8309 error_at (token
->location
, "need %<typename%> before %qE because "
8310 "%qT is a dependent scope",
8311 statement
, TREE_OPERAND (statement
, 0));
8312 else if (is_overloaded_fn (statement
)
8313 && DECL_CONSTRUCTOR_P (get_first_fn (statement
)))
8316 tree fn
= get_first_fn (statement
);
8317 error_at (token
->location
,
8318 "%<%T::%D%> names the constructor, not the type",
8319 DECL_CONTEXT (fn
), DECL_NAME (fn
));
8323 /* Consume the final `;'. */
8324 cp_parser_consume_semicolon_at_end_of_statement (parser
);
8326 if (in_statement_expr
8327 && cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
8328 /* This is the final expression statement of a statement
8330 statement
= finish_stmt_expr_expr (statement
, in_statement_expr
);
8332 statement
= finish_expr_stmt (statement
);
8339 /* Parse a compound-statement.
8342 { statement-seq [opt] }
8347 { label-declaration-seq [opt] statement-seq [opt] }
8349 label-declaration-seq:
8351 label-declaration-seq label-declaration
8353 Returns a tree representing the statement. */
8356 cp_parser_compound_statement (cp_parser
*parser
, tree in_statement_expr
,
8361 /* Consume the `{'. */
8362 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
8363 return error_mark_node
;
8364 /* Begin the compound-statement. */
8365 compound_stmt
= begin_compound_stmt (in_try
? BCS_TRY_BLOCK
: 0);
8366 /* If the next keyword is `__label__' we have a label declaration. */
8367 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_LABEL
))
8368 cp_parser_label_declaration (parser
);
8369 /* Parse an (optional) statement-seq. */
8370 cp_parser_statement_seq_opt (parser
, in_statement_expr
);
8371 /* Finish the compound-statement. */
8372 finish_compound_stmt (compound_stmt
);
8373 /* Consume the `}'. */
8374 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
8376 return compound_stmt
;
8379 /* Parse an (optional) statement-seq.
8383 statement-seq [opt] statement */
8386 cp_parser_statement_seq_opt (cp_parser
* parser
, tree in_statement_expr
)
8388 /* Scan statements until there aren't any more. */
8391 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
8393 /* If we are looking at a `}', then we have run out of
8394 statements; the same is true if we have reached the end
8395 of file, or have stumbled upon a stray '@end'. */
8396 if (token
->type
== CPP_CLOSE_BRACE
8397 || token
->type
== CPP_EOF
8398 || token
->type
== CPP_PRAGMA_EOL
8399 || (token
->type
== CPP_KEYWORD
&& token
->keyword
== RID_AT_END
))
8402 /* If we are in a compound statement and find 'else' then
8403 something went wrong. */
8404 else if (token
->type
== CPP_KEYWORD
&& token
->keyword
== RID_ELSE
)
8406 if (parser
->in_statement
& IN_IF_STMT
)
8410 token
= cp_lexer_consume_token (parser
->lexer
);
8411 error_at (token
->location
, "%<else%> without a previous %<if%>");
8415 /* Parse the statement. */
8416 cp_parser_statement (parser
, in_statement_expr
, true, NULL
);
8420 /* Parse a selection-statement.
8422 selection-statement:
8423 if ( condition ) statement
8424 if ( condition ) statement else statement
8425 switch ( condition ) statement
8427 Returns the new IF_STMT or SWITCH_STMT.
8429 If IF_P is not NULL, *IF_P is set to indicate whether the statement
8430 is a (possibly labeled) if statement which is not enclosed in
8431 braces and has an else clause. This is used to implement
8435 cp_parser_selection_statement (cp_parser
* parser
, bool *if_p
)
8443 /* Peek at the next token. */
8444 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_SELECT
);
8446 /* See what kind of keyword it is. */
8447 keyword
= token
->keyword
;
8456 /* Look for the `('. */
8457 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
8459 cp_parser_skip_to_end_of_statement (parser
);
8460 return error_mark_node
;
8463 /* Begin the selection-statement. */
8464 if (keyword
== RID_IF
)
8465 statement
= begin_if_stmt ();
8467 statement
= begin_switch_stmt ();
8469 /* Parse the condition. */
8470 condition
= cp_parser_condition (parser
);
8471 /* Look for the `)'. */
8472 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
8473 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
8474 /*consume_paren=*/true);
8476 if (keyword
== RID_IF
)
8479 unsigned char in_statement
;
8481 /* Add the condition. */
8482 finish_if_stmt_cond (condition
, statement
);
8484 /* Parse the then-clause. */
8485 in_statement
= parser
->in_statement
;
8486 parser
->in_statement
|= IN_IF_STMT
;
8487 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
8489 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
8490 add_stmt (build_empty_stmt (loc
));
8491 cp_lexer_consume_token (parser
->lexer
);
8492 if (!cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ELSE
))
8493 warning_at (loc
, OPT_Wempty_body
, "suggest braces around "
8494 "empty body in an %<if%> statement");
8498 cp_parser_implicitly_scoped_statement (parser
, &nested_if
);
8499 parser
->in_statement
= in_statement
;
8501 finish_then_clause (statement
);
8503 /* If the next token is `else', parse the else-clause. */
8504 if (cp_lexer_next_token_is_keyword (parser
->lexer
,
8507 /* Consume the `else' keyword. */
8508 cp_lexer_consume_token (parser
->lexer
);
8509 begin_else_clause (statement
);
8510 /* Parse the else-clause. */
8511 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
8514 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
8516 OPT_Wempty_body
, "suggest braces around "
8517 "empty body in an %<else%> statement");
8518 add_stmt (build_empty_stmt (loc
));
8519 cp_lexer_consume_token (parser
->lexer
);
8522 cp_parser_implicitly_scoped_statement (parser
, NULL
);
8524 finish_else_clause (statement
);
8526 /* If we are currently parsing a then-clause, then
8527 IF_P will not be NULL. We set it to true to
8528 indicate that this if statement has an else clause.
8529 This may trigger the Wparentheses warning below
8530 when we get back up to the parent if statement. */
8536 /* This if statement does not have an else clause. If
8537 NESTED_IF is true, then the then-clause is an if
8538 statement which does have an else clause. We warn
8539 about the potential ambiguity. */
8541 warning_at (EXPR_LOCATION (statement
), OPT_Wparentheses
,
8542 "suggest explicit braces to avoid ambiguous"
8546 /* Now we're all done with the if-statement. */
8547 finish_if_stmt (statement
);
8551 bool in_switch_statement_p
;
8552 unsigned char in_statement
;
8554 /* Add the condition. */
8555 finish_switch_cond (condition
, statement
);
8557 /* Parse the body of the switch-statement. */
8558 in_switch_statement_p
= parser
->in_switch_statement_p
;
8559 in_statement
= parser
->in_statement
;
8560 parser
->in_switch_statement_p
= true;
8561 parser
->in_statement
|= IN_SWITCH_STMT
;
8562 cp_parser_implicitly_scoped_statement (parser
, NULL
);
8563 parser
->in_switch_statement_p
= in_switch_statement_p
;
8564 parser
->in_statement
= in_statement
;
8566 /* Now we're all done with the switch-statement. */
8567 finish_switch_stmt (statement
);
8575 cp_parser_error (parser
, "expected selection-statement");
8576 return error_mark_node
;
8580 /* Parse a condition.
8584 type-specifier-seq declarator = initializer-clause
8585 type-specifier-seq declarator braced-init-list
8590 type-specifier-seq declarator asm-specification [opt]
8591 attributes [opt] = assignment-expression
8593 Returns the expression that should be tested. */
8596 cp_parser_condition (cp_parser
* parser
)
8598 cp_decl_specifier_seq type_specifiers
;
8599 const char *saved_message
;
8600 int declares_class_or_enum
;
8602 /* Try the declaration first. */
8603 cp_parser_parse_tentatively (parser
);
8604 /* New types are not allowed in the type-specifier-seq for a
8606 saved_message
= parser
->type_definition_forbidden_message
;
8607 parser
->type_definition_forbidden_message
8608 = G_("types may not be defined in conditions");
8609 /* Parse the type-specifier-seq. */
8610 cp_parser_decl_specifier_seq (parser
,
8611 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR
,
8613 &declares_class_or_enum
);
8614 /* Restore the saved message. */
8615 parser
->type_definition_forbidden_message
= saved_message
;
8616 /* If all is well, we might be looking at a declaration. */
8617 if (!cp_parser_error_occurred (parser
))
8620 tree asm_specification
;
8622 cp_declarator
*declarator
;
8623 tree initializer
= NULL_TREE
;
8625 /* Parse the declarator. */
8626 declarator
= cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
8627 /*ctor_dtor_or_conv_p=*/NULL
,
8628 /*parenthesized_p=*/NULL
,
8629 /*member_p=*/false);
8630 /* Parse the attributes. */
8631 attributes
= cp_parser_attributes_opt (parser
);
8632 /* Parse the asm-specification. */
8633 asm_specification
= cp_parser_asm_specification_opt (parser
);
8634 /* If the next token is not an `=' or '{', then we might still be
8635 looking at an expression. For example:
8639 looks like a decl-specifier-seq and a declarator -- but then
8640 there is no `=', so this is an expression. */
8641 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
)
8642 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
))
8643 cp_parser_simulate_error (parser
);
8645 /* If we did see an `=' or '{', then we are looking at a declaration
8647 if (cp_parser_parse_definitely (parser
))
8650 bool non_constant_p
;
8651 bool flags
= LOOKUP_ONLYCONVERTING
;
8653 /* Create the declaration. */
8654 decl
= start_decl (declarator
, &type_specifiers
,
8655 /*initialized_p=*/true,
8656 attributes
, /*prefix_attributes=*/NULL_TREE
,
8659 /* Parse the initializer. */
8660 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
8662 initializer
= cp_parser_braced_list (parser
, &non_constant_p
);
8663 CONSTRUCTOR_IS_DIRECT_INIT (initializer
) = 1;
8668 /* Consume the `='. */
8669 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
8670 initializer
= cp_parser_initializer_clause (parser
, &non_constant_p
);
8672 if (BRACE_ENCLOSED_INITIALIZER_P (initializer
))
8673 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
8675 if (!non_constant_p
)
8676 initializer
= fold_non_dependent_expr (initializer
);
8678 /* Process the initializer. */
8679 cp_finish_decl (decl
,
8680 initializer
, !non_constant_p
,
8685 pop_scope (pushed_scope
);
8687 return convert_from_reference (decl
);
8690 /* If we didn't even get past the declarator successfully, we are
8691 definitely not looking at a declaration. */
8693 cp_parser_abort_tentative_parse (parser
);
8695 /* Otherwise, we are looking at an expression. */
8696 return cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
8699 /* Parses a for-statement or range-for-statement until the closing ')',
8703 cp_parser_for (cp_parser
*parser
)
8705 tree init
, scope
, decl
;
8708 /* Begin the for-statement. */
8709 scope
= begin_for_scope (&init
);
8711 /* Parse the initialization. */
8712 is_range_for
= cp_parser_for_init_statement (parser
, &decl
);
8715 return cp_parser_range_for (parser
, scope
, init
, decl
);
8717 return cp_parser_c_for (parser
, scope
, init
);
8721 cp_parser_c_for (cp_parser
*parser
, tree scope
, tree init
)
8723 /* Normal for loop */
8724 tree condition
= NULL_TREE
;
8725 tree expression
= NULL_TREE
;
8728 stmt
= begin_for_stmt (scope
, init
);
8729 /* The for-init-statement has already been parsed in
8730 cp_parser_for_init_statement, so no work is needed here. */
8731 finish_for_init_stmt (stmt
);
8733 /* If there's a condition, process it. */
8734 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
8735 condition
= cp_parser_condition (parser
);
8736 finish_for_cond (condition
, stmt
);
8737 /* Look for the `;'. */
8738 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
8740 /* If there's an expression, process it. */
8741 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
8742 expression
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
8743 finish_for_expr (expression
, stmt
);
8748 /* Tries to parse a range-based for-statement:
8751 decl-specifier-seq declarator : expression
8753 The decl-specifier-seq declarator and the `:' are already parsed by
8754 cp_parser_for_init_statement. If processing_template_decl it returns a
8755 newly created RANGE_FOR_STMT; if not, it is converted to a
8756 regular FOR_STMT. */
8759 cp_parser_range_for (cp_parser
*parser
, tree scope
, tree init
, tree range_decl
)
8761 tree stmt
, range_expr
;
8763 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
8765 bool expr_non_constant_p
;
8766 range_expr
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
8769 range_expr
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
8771 /* If in template, STMT is converted to a normal for-statement
8772 at instantiation. If not, it is done just ahead. */
8773 if (processing_template_decl
)
8775 stmt
= begin_range_for_stmt (scope
, init
);
8776 finish_range_for_decl (stmt
, range_decl
, range_expr
);
8780 stmt
= begin_for_stmt (scope
, init
);
8781 stmt
= cp_convert_range_for (stmt
, range_decl
, range_expr
);
8786 /* Converts a range-based for-statement into a normal
8787 for-statement, as per the definition.
8789 for (RANGE_DECL : RANGE_EXPR)
8792 should be equivalent to:
8795 auto &&__range = RANGE_EXPR;
8796 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
8800 RANGE_DECL = *__begin;
8805 If RANGE_EXPR is an array:
8806 BEGIN_EXPR = __range
8807 END_EXPR = __range + ARRAY_SIZE(__range)
8809 BEGIN_EXPR = begin(__range)
8810 END_EXPR = end(__range);
8812 When calling begin()/end() we must use argument dependent
8813 lookup, but always considering 'std' as an associated namespace. */
8816 cp_convert_range_for (tree statement
, tree range_decl
, tree range_expr
)
8818 tree range_type
, range_temp
;
8820 tree iter_type
, begin_expr
, end_expr
;
8821 tree condition
, expression
;
8823 if (range_decl
== error_mark_node
|| range_expr
== error_mark_node
)
8824 /* If an error happened previously do nothing or else a lot of
8825 unhelpful errors would be issued. */
8826 begin_expr
= end_expr
= iter_type
= error_mark_node
;
8829 /* Find out the type deduced by the declaration
8830 * `auto &&__range = range_expr' */
8831 range_type
= cp_build_reference_type (make_auto (), true);
8832 range_type
= do_auto_deduction (range_type
, range_expr
,
8833 type_uses_auto (range_type
));
8835 /* Create the __range variable */
8836 range_temp
= build_decl (input_location
, VAR_DECL
,
8837 get_identifier ("__for_range"), range_type
);
8838 TREE_USED (range_temp
) = 1;
8839 DECL_ARTIFICIAL (range_temp
) = 1;
8840 pushdecl (range_temp
);
8841 cp_finish_decl (range_temp
, range_expr
,
8842 /*is_constant_init*/false, NULL_TREE
,
8843 LOOKUP_ONLYCONVERTING
);
8845 range_temp
= convert_from_reference (range_temp
);
8847 if (TREE_CODE (TREE_TYPE (range_temp
)) == ARRAY_TYPE
)
8849 /* If RANGE_TEMP is an array we will use pointer arithmetic */
8850 iter_type
= build_pointer_type (TREE_TYPE (TREE_TYPE (range_temp
)));
8851 begin_expr
= range_temp
;
8853 = build_binary_op (input_location
, PLUS_EXPR
,
8855 array_type_nelts_top (TREE_TYPE (range_temp
)),
8860 /* If it is not an array, we must call begin(__range)/end__range() */
8863 begin_expr
= get_identifier ("begin");
8864 vec
= make_tree_vector ();
8865 VEC_safe_push (tree
, gc
, vec
, range_temp
);
8866 begin_expr
= perform_koenig_lookup (begin_expr
, vec
,
8867 /*include_std=*/true);
8868 begin_expr
= finish_call_expr (begin_expr
, &vec
, false, true,
8869 tf_warning_or_error
);
8870 release_tree_vector (vec
);
8872 end_expr
= get_identifier ("end");
8873 vec
= make_tree_vector ();
8874 VEC_safe_push (tree
, gc
, vec
, range_temp
);
8875 end_expr
= perform_koenig_lookup (end_expr
, vec
,
8876 /*include_std=*/true);
8877 end_expr
= finish_call_expr (end_expr
, &vec
, false, true,
8878 tf_warning_or_error
);
8879 release_tree_vector (vec
);
8881 /* The unqualified type of the __begin and __end temporaries should
8882 * be the same as required by the multiple auto declaration */
8883 iter_type
= cv_unqualified (TREE_TYPE (begin_expr
));
8884 if (!same_type_p (iter_type
, cv_unqualified (TREE_TYPE (end_expr
))))
8885 error ("inconsistent begin/end types in range-based for: %qT and %qT",
8886 TREE_TYPE (begin_expr
), TREE_TYPE (end_expr
));
8890 /* The new for initialization statement */
8891 begin
= build_decl (input_location
, VAR_DECL
,
8892 get_identifier ("__for_begin"), iter_type
);
8893 TREE_USED (begin
) = 1;
8894 DECL_ARTIFICIAL (begin
) = 1;
8896 cp_finish_decl (begin
, begin_expr
,
8897 /*is_constant_init*/false, NULL_TREE
,
8898 LOOKUP_ONLYCONVERTING
);
8900 end
= build_decl (input_location
, VAR_DECL
,
8901 get_identifier ("__for_end"), iter_type
);
8902 TREE_USED (end
) = 1;
8903 DECL_ARTIFICIAL (end
) = 1;
8905 cp_finish_decl (end
, end_expr
,
8906 /*is_constant_init*/false, NULL_TREE
,
8907 LOOKUP_ONLYCONVERTING
);
8909 finish_for_init_stmt (statement
);
8911 /* The new for condition */
8912 condition
= build_x_binary_op (NE_EXPR
,
8915 NULL
, tf_warning_or_error
);
8916 finish_for_cond (condition
, statement
);
8918 /* The new increment expression */
8919 expression
= finish_unary_op_expr (PREINCREMENT_EXPR
, begin
);
8920 finish_for_expr (expression
, statement
);
8922 /* The declaration is initialized with *__begin inside the loop body */
8923 cp_finish_decl (range_decl
,
8924 build_x_indirect_ref (begin
, RO_NULL
, tf_warning_or_error
),
8925 /*is_constant_init*/false, NULL_TREE
,
8926 LOOKUP_ONLYCONVERTING
);
8932 /* Parse an iteration-statement.
8934 iteration-statement:
8935 while ( condition ) statement
8936 do statement while ( expression ) ;
8937 for ( for-init-statement condition [opt] ; expression [opt] )
8940 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
8943 cp_parser_iteration_statement (cp_parser
* parser
)
8948 unsigned char in_statement
;
8950 /* Peek at the next token. */
8951 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_INTERATION
);
8953 return error_mark_node
;
8955 /* Remember whether or not we are already within an iteration
8957 in_statement
= parser
->in_statement
;
8959 /* See what kind of keyword it is. */
8960 keyword
= token
->keyword
;
8967 /* Begin the while-statement. */
8968 statement
= begin_while_stmt ();
8969 /* Look for the `('. */
8970 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
8971 /* Parse the condition. */
8972 condition
= cp_parser_condition (parser
);
8973 finish_while_stmt_cond (condition
, statement
);
8974 /* Look for the `)'. */
8975 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
8976 /* Parse the dependent statement. */
8977 parser
->in_statement
= IN_ITERATION_STMT
;
8978 cp_parser_already_scoped_statement (parser
);
8979 parser
->in_statement
= in_statement
;
8980 /* We're done with the while-statement. */
8981 finish_while_stmt (statement
);
8989 /* Begin the do-statement. */
8990 statement
= begin_do_stmt ();
8991 /* Parse the body of the do-statement. */
8992 parser
->in_statement
= IN_ITERATION_STMT
;
8993 cp_parser_implicitly_scoped_statement (parser
, NULL
);
8994 parser
->in_statement
= in_statement
;
8995 finish_do_body (statement
);
8996 /* Look for the `while' keyword. */
8997 cp_parser_require_keyword (parser
, RID_WHILE
, RT_WHILE
);
8998 /* Look for the `('. */
8999 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
9000 /* Parse the expression. */
9001 expression
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
9002 /* We're done with the do-statement. */
9003 finish_do_stmt (expression
, statement
);
9004 /* Look for the `)'. */
9005 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
9006 /* Look for the `;'. */
9007 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
9013 /* Look for the `('. */
9014 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
9016 statement
= cp_parser_for (parser
);
9018 /* Look for the `)'. */
9019 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
9021 /* Parse the body of the for-statement. */
9022 parser
->in_statement
= IN_ITERATION_STMT
;
9023 cp_parser_already_scoped_statement (parser
);
9024 parser
->in_statement
= in_statement
;
9026 /* We're done with the for-statement. */
9027 finish_for_stmt (statement
);
9032 cp_parser_error (parser
, "expected iteration-statement");
9033 statement
= error_mark_node
;
9040 /* Parse a for-init-statement or the declarator of a range-based-for.
9041 Returns true if a range-based-for declaration is seen.
9044 expression-statement
9045 simple-declaration */
9048 cp_parser_for_init_statement (cp_parser
* parser
, tree
*decl
)
9050 /* If the next token is a `;', then we have an empty
9051 expression-statement. Grammatically, this is also a
9052 simple-declaration, but an invalid one, because it does not
9053 declare anything. Therefore, if we did not handle this case
9054 specially, we would issue an error message about an invalid
9056 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
9058 bool is_range_for
= false;
9059 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
9061 parser
->colon_corrects_to_scope_p
= false;
9063 /* We're going to speculatively look for a declaration, falling back
9064 to an expression, if necessary. */
9065 cp_parser_parse_tentatively (parser
);
9066 /* Parse the declaration. */
9067 cp_parser_simple_declaration (parser
,
9068 /*function_definition_allowed_p=*/false,
9070 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
9071 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
9073 /* It is a range-for, consume the ':' */
9074 cp_lexer_consume_token (parser
->lexer
);
9075 is_range_for
= true;
9076 if (cxx_dialect
< cxx0x
)
9078 error_at (cp_lexer_peek_token (parser
->lexer
)->location
,
9079 "range-based-for loops are not allowed "
9081 *decl
= error_mark_node
;
9085 /* The ';' is not consumed yet because we told
9086 cp_parser_simple_declaration not to. */
9087 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
9089 if (cp_parser_parse_definitely (parser
))
9090 return is_range_for
;
9091 /* If the tentative parse failed, then we shall need to look for an
9092 expression-statement. */
9094 /* If we are here, it is an expression-statement. */
9095 cp_parser_expression_statement (parser
, NULL_TREE
);
9099 /* Parse a jump-statement.
9104 return expression [opt] ;
9105 return braced-init-list ;
9113 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
9116 cp_parser_jump_statement (cp_parser
* parser
)
9118 tree statement
= error_mark_node
;
9121 unsigned char in_statement
;
9123 /* Peek at the next token. */
9124 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_JUMP
);
9126 return error_mark_node
;
9128 /* See what kind of keyword it is. */
9129 keyword
= token
->keyword
;
9133 in_statement
= parser
->in_statement
& ~IN_IF_STMT
;
9134 switch (in_statement
)
9137 error_at (token
->location
, "break statement not within loop or switch");
9140 gcc_assert ((in_statement
& IN_SWITCH_STMT
)
9141 || in_statement
== IN_ITERATION_STMT
);
9142 statement
= finish_break_stmt ();
9145 error_at (token
->location
, "invalid exit from OpenMP structured block");
9148 error_at (token
->location
, "break statement used with OpenMP for loop");
9151 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
9155 switch (parser
->in_statement
& ~(IN_SWITCH_STMT
| IN_IF_STMT
))
9158 error_at (token
->location
, "continue statement not within a loop");
9160 case IN_ITERATION_STMT
:
9162 statement
= finish_continue_stmt ();
9165 error_at (token
->location
, "invalid exit from OpenMP structured block");
9170 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
9176 bool expr_non_constant_p
;
9178 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
9180 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
9181 expr
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
9183 else if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
9184 expr
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
9186 /* If the next token is a `;', then there is no
9189 /* Build the return-statement. */
9190 statement
= finish_return_stmt (expr
);
9191 /* Look for the final `;'. */
9192 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
9197 /* Create the goto-statement. */
9198 if (cp_lexer_next_token_is (parser
->lexer
, CPP_MULT
))
9200 /* Issue a warning about this use of a GNU extension. */
9201 pedwarn (token
->location
, OPT_pedantic
, "ISO C++ forbids computed gotos");
9202 /* Consume the '*' token. */
9203 cp_lexer_consume_token (parser
->lexer
);
9204 /* Parse the dependent expression. */
9205 finish_goto_stmt (cp_parser_expression (parser
, /*cast_p=*/false, NULL
));
9208 finish_goto_stmt (cp_parser_identifier (parser
));
9209 /* Look for the final `;'. */
9210 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
9214 cp_parser_error (parser
, "expected jump-statement");
9221 /* Parse a declaration-statement.
9223 declaration-statement:
9224 block-declaration */
9227 cp_parser_declaration_statement (cp_parser
* parser
)
9231 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
9232 p
= obstack_alloc (&declarator_obstack
, 0);
9234 /* Parse the block-declaration. */
9235 cp_parser_block_declaration (parser
, /*statement_p=*/true);
9237 /* Free any declarators allocated. */
9238 obstack_free (&declarator_obstack
, p
);
9240 /* Finish off the statement. */
9244 /* Some dependent statements (like `if (cond) statement'), are
9245 implicitly in their own scope. In other words, if the statement is
9246 a single statement (as opposed to a compound-statement), it is
9247 none-the-less treated as if it were enclosed in braces. Any
9248 declarations appearing in the dependent statement are out of scope
9249 after control passes that point. This function parses a statement,
9250 but ensures that is in its own scope, even if it is not a
9253 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9254 is a (possibly labeled) if statement which is not enclosed in
9255 braces and has an else clause. This is used to implement
9258 Returns the new statement. */
9261 cp_parser_implicitly_scoped_statement (cp_parser
* parser
, bool *if_p
)
9268 /* Mark if () ; with a special NOP_EXPR. */
9269 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
9271 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
9272 cp_lexer_consume_token (parser
->lexer
);
9273 statement
= add_stmt (build_empty_stmt (loc
));
9275 /* if a compound is opened, we simply parse the statement directly. */
9276 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
9277 statement
= cp_parser_compound_statement (parser
, NULL
, false);
9278 /* If the token is not a `{', then we must take special action. */
9281 /* Create a compound-statement. */
9282 statement
= begin_compound_stmt (0);
9283 /* Parse the dependent-statement. */
9284 cp_parser_statement (parser
, NULL_TREE
, false, if_p
);
9285 /* Finish the dummy compound-statement. */
9286 finish_compound_stmt (statement
);
9289 /* Return the statement. */
9293 /* For some dependent statements (like `while (cond) statement'), we
9294 have already created a scope. Therefore, even if the dependent
9295 statement is a compound-statement, we do not want to create another
9299 cp_parser_already_scoped_statement (cp_parser
* parser
)
9301 /* If the token is a `{', then we must take special action. */
9302 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
))
9303 cp_parser_statement (parser
, NULL_TREE
, false, NULL
);
9306 /* Avoid calling cp_parser_compound_statement, so that we
9307 don't create a new scope. Do everything else by hand. */
9308 cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
);
9309 /* If the next keyword is `__label__' we have a label declaration. */
9310 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_LABEL
))
9311 cp_parser_label_declaration (parser
);
9312 /* Parse an (optional) statement-seq. */
9313 cp_parser_statement_seq_opt (parser
, NULL_TREE
);
9314 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
9318 /* Declarations [gram.dcl.dcl] */
9320 /* Parse an optional declaration-sequence.
9324 declaration-seq declaration */
9327 cp_parser_declaration_seq_opt (cp_parser
* parser
)
9333 token
= cp_lexer_peek_token (parser
->lexer
);
9335 if (token
->type
== CPP_CLOSE_BRACE
9336 || token
->type
== CPP_EOF
9337 || token
->type
== CPP_PRAGMA_EOL
)
9340 if (token
->type
== CPP_SEMICOLON
)
9342 /* A declaration consisting of a single semicolon is
9343 invalid. Allow it unless we're being pedantic. */
9344 cp_lexer_consume_token (parser
->lexer
);
9345 if (!in_system_header
)
9346 pedwarn (input_location
, OPT_pedantic
, "extra %<;%>");
9350 /* If we're entering or exiting a region that's implicitly
9351 extern "C", modify the lang context appropriately. */
9352 if (!parser
->implicit_extern_c
&& token
->implicit_extern_c
)
9354 push_lang_context (lang_name_c
);
9355 parser
->implicit_extern_c
= true;
9357 else if (parser
->implicit_extern_c
&& !token
->implicit_extern_c
)
9359 pop_lang_context ();
9360 parser
->implicit_extern_c
= false;
9363 if (token
->type
== CPP_PRAGMA
)
9365 /* A top-level declaration can consist solely of a #pragma.
9366 A nested declaration cannot, so this is done here and not
9367 in cp_parser_declaration. (A #pragma at block scope is
9368 handled in cp_parser_statement.) */
9369 cp_parser_pragma (parser
, pragma_external
);
9373 /* Parse the declaration itself. */
9374 cp_parser_declaration (parser
);
9378 /* Parse a declaration.
9383 template-declaration
9384 explicit-instantiation
9385 explicit-specialization
9386 linkage-specification
9387 namespace-definition
9392 __extension__ declaration */
9395 cp_parser_declaration (cp_parser
* parser
)
9401 tree attributes
= NULL_TREE
;
9403 /* Check for the `__extension__' keyword. */
9404 if (cp_parser_extension_opt (parser
, &saved_pedantic
))
9406 /* Parse the qualified declaration. */
9407 cp_parser_declaration (parser
);
9408 /* Restore the PEDANTIC flag. */
9409 pedantic
= saved_pedantic
;
9414 /* Try to figure out what kind of declaration is present. */
9415 token1
= *cp_lexer_peek_token (parser
->lexer
);
9417 if (token1
.type
!= CPP_EOF
)
9418 token2
= *cp_lexer_peek_nth_token (parser
->lexer
, 2);
9421 token2
.type
= CPP_EOF
;
9422 token2
.keyword
= RID_MAX
;
9425 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
9426 p
= obstack_alloc (&declarator_obstack
, 0);
9428 /* If the next token is `extern' and the following token is a string
9429 literal, then we have a linkage specification. */
9430 if (token1
.keyword
== RID_EXTERN
9431 && cp_parser_is_string_literal (&token2
))
9432 cp_parser_linkage_specification (parser
);
9433 /* If the next token is `template', then we have either a template
9434 declaration, an explicit instantiation, or an explicit
9436 else if (token1
.keyword
== RID_TEMPLATE
)
9438 /* `template <>' indicates a template specialization. */
9439 if (token2
.type
== CPP_LESS
9440 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_GREATER
)
9441 cp_parser_explicit_specialization (parser
);
9442 /* `template <' indicates a template declaration. */
9443 else if (token2
.type
== CPP_LESS
)
9444 cp_parser_template_declaration (parser
, /*member_p=*/false);
9445 /* Anything else must be an explicit instantiation. */
9447 cp_parser_explicit_instantiation (parser
);
9449 /* If the next token is `export', then we have a template
9451 else if (token1
.keyword
== RID_EXPORT
)
9452 cp_parser_template_declaration (parser
, /*member_p=*/false);
9453 /* If the next token is `extern', 'static' or 'inline' and the one
9454 after that is `template', we have a GNU extended explicit
9455 instantiation directive. */
9456 else if (cp_parser_allow_gnu_extensions_p (parser
)
9457 && (token1
.keyword
== RID_EXTERN
9458 || token1
.keyword
== RID_STATIC
9459 || token1
.keyword
== RID_INLINE
)
9460 && token2
.keyword
== RID_TEMPLATE
)
9461 cp_parser_explicit_instantiation (parser
);
9462 /* If the next token is `namespace', check for a named or unnamed
9463 namespace definition. */
9464 else if (token1
.keyword
== RID_NAMESPACE
9465 && (/* A named namespace definition. */
9466 (token2
.type
== CPP_NAME
9467 && (cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
9469 /* An unnamed namespace definition. */
9470 || token2
.type
== CPP_OPEN_BRACE
9471 || token2
.keyword
== RID_ATTRIBUTE
))
9472 cp_parser_namespace_definition (parser
);
9473 /* An inline (associated) namespace definition. */
9474 else if (token1
.keyword
== RID_INLINE
9475 && token2
.keyword
== RID_NAMESPACE
)
9476 cp_parser_namespace_definition (parser
);
9477 /* Objective-C++ declaration/definition. */
9478 else if (c_dialect_objc () && OBJC_IS_AT_KEYWORD (token1
.keyword
))
9479 cp_parser_objc_declaration (parser
, NULL_TREE
);
9480 else if (c_dialect_objc ()
9481 && token1
.keyword
== RID_ATTRIBUTE
9482 && cp_parser_objc_valid_prefix_attributes (parser
, &attributes
))
9483 cp_parser_objc_declaration (parser
, attributes
);
9484 /* We must have either a block declaration or a function
9487 /* Try to parse a block-declaration, or a function-definition. */
9488 cp_parser_block_declaration (parser
, /*statement_p=*/false);
9490 /* Free any declarators allocated. */
9491 obstack_free (&declarator_obstack
, p
);
9494 /* Parse a block-declaration.
9499 namespace-alias-definition
9506 __extension__ block-declaration
9511 static_assert-declaration
9513 If STATEMENT_P is TRUE, then this block-declaration is occurring as
9514 part of a declaration-statement. */
9517 cp_parser_block_declaration (cp_parser
*parser
,
9523 /* Check for the `__extension__' keyword. */
9524 if (cp_parser_extension_opt (parser
, &saved_pedantic
))
9526 /* Parse the qualified declaration. */
9527 cp_parser_block_declaration (parser
, statement_p
);
9528 /* Restore the PEDANTIC flag. */
9529 pedantic
= saved_pedantic
;
9534 /* Peek at the next token to figure out which kind of declaration is
9536 token1
= cp_lexer_peek_token (parser
->lexer
);
9538 /* If the next keyword is `asm', we have an asm-definition. */
9539 if (token1
->keyword
== RID_ASM
)
9542 cp_parser_commit_to_tentative_parse (parser
);
9543 cp_parser_asm_definition (parser
);
9545 /* If the next keyword is `namespace', we have a
9546 namespace-alias-definition. */
9547 else if (token1
->keyword
== RID_NAMESPACE
)
9548 cp_parser_namespace_alias_definition (parser
);
9549 /* If the next keyword is `using', we have either a
9550 using-declaration or a using-directive. */
9551 else if (token1
->keyword
== RID_USING
)
9556 cp_parser_commit_to_tentative_parse (parser
);
9557 /* If the token after `using' is `namespace', then we have a
9559 token2
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
9560 if (token2
->keyword
== RID_NAMESPACE
)
9561 cp_parser_using_directive (parser
);
9562 /* Otherwise, it's a using-declaration. */
9564 cp_parser_using_declaration (parser
,
9565 /*access_declaration_p=*/false);
9567 /* If the next keyword is `__label__' we have a misplaced label
9569 else if (token1
->keyword
== RID_LABEL
)
9571 cp_lexer_consume_token (parser
->lexer
);
9572 error_at (token1
->location
, "%<__label__%> not at the beginning of a block");
9573 cp_parser_skip_to_end_of_statement (parser
);
9574 /* If the next token is now a `;', consume it. */
9575 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
9576 cp_lexer_consume_token (parser
->lexer
);
9578 /* If the next token is `static_assert' we have a static assertion. */
9579 else if (token1
->keyword
== RID_STATIC_ASSERT
)
9580 cp_parser_static_assert (parser
, /*member_p=*/false);
9581 /* Anything else must be a simple-declaration. */
9583 cp_parser_simple_declaration (parser
, !statement_p
,
9584 /*maybe_range_for_decl*/NULL
);
9587 /* Parse a simple-declaration.
9590 decl-specifier-seq [opt] init-declarator-list [opt] ;
9592 init-declarator-list:
9594 init-declarator-list , init-declarator
9596 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
9597 function-definition as a simple-declaration.
9599 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
9600 parsed declaration if it is an uninitialized single declarator not followed
9601 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
9602 if present, will not be consumed. */
9605 cp_parser_simple_declaration (cp_parser
* parser
,
9606 bool function_definition_allowed_p
,
9607 tree
*maybe_range_for_decl
)
9609 cp_decl_specifier_seq decl_specifiers
;
9610 int declares_class_or_enum
;
9611 bool saw_declarator
;
9613 if (maybe_range_for_decl
)
9614 *maybe_range_for_decl
= NULL_TREE
;
9616 /* Defer access checks until we know what is being declared; the
9617 checks for names appearing in the decl-specifier-seq should be
9618 done as if we were in the scope of the thing being declared. */
9619 push_deferring_access_checks (dk_deferred
);
9621 /* Parse the decl-specifier-seq. We have to keep track of whether
9622 or not the decl-specifier-seq declares a named class or
9623 enumeration type, since that is the only case in which the
9624 init-declarator-list is allowed to be empty.
9628 In a simple-declaration, the optional init-declarator-list can be
9629 omitted only when declaring a class or enumeration, that is when
9630 the decl-specifier-seq contains either a class-specifier, an
9631 elaborated-type-specifier, or an enum-specifier. */
9632 cp_parser_decl_specifier_seq (parser
,
9633 CP_PARSER_FLAGS_OPTIONAL
,
9635 &declares_class_or_enum
);
9636 /* We no longer need to defer access checks. */
9637 stop_deferring_access_checks ();
9639 /* In a block scope, a valid declaration must always have a
9640 decl-specifier-seq. By not trying to parse declarators, we can
9641 resolve the declaration/expression ambiguity more quickly. */
9642 if (!function_definition_allowed_p
9643 && !decl_specifiers
.any_specifiers_p
)
9645 cp_parser_error (parser
, "expected declaration");
9649 /* If the next two tokens are both identifiers, the code is
9650 erroneous. The usual cause of this situation is code like:
9654 where "T" should name a type -- but does not. */
9655 if (!decl_specifiers
.any_type_specifiers_p
9656 && cp_parser_parse_and_diagnose_invalid_type_name (parser
))
9658 /* If parsing tentatively, we should commit; we really are
9659 looking at a declaration. */
9660 cp_parser_commit_to_tentative_parse (parser
);
9665 /* If we have seen at least one decl-specifier, and the next token
9666 is not a parenthesis, then we must be looking at a declaration.
9667 (After "int (" we might be looking at a functional cast.) */
9668 if (decl_specifiers
.any_specifiers_p
9669 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_PAREN
)
9670 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
)
9671 && !cp_parser_error_occurred (parser
))
9672 cp_parser_commit_to_tentative_parse (parser
);
9674 /* Keep going until we hit the `;' at the end of the simple
9676 saw_declarator
= false;
9677 while (cp_lexer_next_token_is_not (parser
->lexer
,
9681 bool function_definition_p
;
9686 /* If we are processing next declarator, coma is expected */
9687 token
= cp_lexer_peek_token (parser
->lexer
);
9688 gcc_assert (token
->type
== CPP_COMMA
);
9689 cp_lexer_consume_token (parser
->lexer
);
9690 if (maybe_range_for_decl
)
9691 *maybe_range_for_decl
= error_mark_node
;
9694 saw_declarator
= true;
9696 /* Parse the init-declarator. */
9697 decl
= cp_parser_init_declarator (parser
, &decl_specifiers
,
9699 function_definition_allowed_p
,
9701 declares_class_or_enum
,
9702 &function_definition_p
,
9703 maybe_range_for_decl
);
9704 /* If an error occurred while parsing tentatively, exit quickly.
9705 (That usually happens when in the body of a function; each
9706 statement is treated as a declaration-statement until proven
9708 if (cp_parser_error_occurred (parser
))
9710 /* Handle function definitions specially. */
9711 if (function_definition_p
)
9713 /* If the next token is a `,', then we are probably
9714 processing something like:
9718 which is erroneous. */
9719 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
9721 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
9722 error_at (token
->location
,
9724 " declarations and function-definitions is forbidden");
9726 /* Otherwise, we're done with the list of declarators. */
9729 pop_deferring_access_checks ();
9733 if (maybe_range_for_decl
&& *maybe_range_for_decl
== NULL_TREE
)
9734 *maybe_range_for_decl
= decl
;
9735 /* The next token should be either a `,' or a `;'. */
9736 token
= cp_lexer_peek_token (parser
->lexer
);
9737 /* If it's a `,', there are more declarators to come. */
9738 if (token
->type
== CPP_COMMA
)
9739 /* will be consumed next time around */;
9740 /* If it's a `;', we are done. */
9741 else if (token
->type
== CPP_SEMICOLON
|| maybe_range_for_decl
)
9743 /* Anything else is an error. */
9746 /* If we have already issued an error message we don't need
9747 to issue another one. */
9748 if (decl
!= error_mark_node
9749 || cp_parser_uncommitted_to_tentative_parse_p (parser
))
9750 cp_parser_error (parser
, "expected %<,%> or %<;%>");
9751 /* Skip tokens until we reach the end of the statement. */
9752 cp_parser_skip_to_end_of_statement (parser
);
9753 /* If the next token is now a `;', consume it. */
9754 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
9755 cp_lexer_consume_token (parser
->lexer
);
9758 /* After the first time around, a function-definition is not
9759 allowed -- even if it was OK at first. For example:
9764 function_definition_allowed_p
= false;
9767 /* Issue an error message if no declarators are present, and the
9768 decl-specifier-seq does not itself declare a class or
9770 if (!saw_declarator
)
9772 if (cp_parser_declares_only_class_p (parser
))
9773 shadow_tag (&decl_specifiers
);
9774 /* Perform any deferred access checks. */
9775 perform_deferred_access_checks ();
9778 /* Consume the `;'. */
9779 if (!maybe_range_for_decl
)
9780 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
9783 pop_deferring_access_checks ();
9786 /* Parse a decl-specifier-seq.
9789 decl-specifier-seq [opt] decl-specifier
9792 storage-class-specifier
9803 Set *DECL_SPECS to a representation of the decl-specifier-seq.
9805 The parser flags FLAGS is used to control type-specifier parsing.
9807 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
9810 1: one of the decl-specifiers is an elaborated-type-specifier
9811 (i.e., a type declaration)
9812 2: one of the decl-specifiers is an enum-specifier or a
9813 class-specifier (i.e., a type definition)
9818 cp_parser_decl_specifier_seq (cp_parser
* parser
,
9819 cp_parser_flags flags
,
9820 cp_decl_specifier_seq
*decl_specs
,
9821 int* declares_class_or_enum
)
9823 bool constructor_possible_p
= !parser
->in_declarator_p
;
9824 cp_token
*start_token
= NULL
;
9826 /* Clear DECL_SPECS. */
9827 clear_decl_specs (decl_specs
);
9829 /* Assume no class or enumeration type is declared. */
9830 *declares_class_or_enum
= 0;
9832 /* Keep reading specifiers until there are no more to read. */
9836 bool found_decl_spec
;
9839 /* Peek at the next token. */
9840 token
= cp_lexer_peek_token (parser
->lexer
);
9842 /* Save the first token of the decl spec list for error
9845 start_token
= token
;
9846 /* Handle attributes. */
9847 if (token
->keyword
== RID_ATTRIBUTE
)
9849 /* Parse the attributes. */
9850 decl_specs
->attributes
9851 = chainon (decl_specs
->attributes
,
9852 cp_parser_attributes_opt (parser
));
9855 /* Assume we will find a decl-specifier keyword. */
9856 found_decl_spec
= true;
9857 /* If the next token is an appropriate keyword, we can simply
9858 add it to the list. */
9859 switch (token
->keyword
)
9865 if (!at_class_scope_p ())
9867 error_at (token
->location
, "%<friend%> used outside of class");
9868 cp_lexer_purge_token (parser
->lexer
);
9872 ++decl_specs
->specs
[(int) ds_friend
];
9873 /* Consume the token. */
9874 cp_lexer_consume_token (parser
->lexer
);
9879 ++decl_specs
->specs
[(int) ds_constexpr
];
9880 cp_lexer_consume_token (parser
->lexer
);
9883 /* function-specifier:
9890 cp_parser_function_specifier_opt (parser
, decl_specs
);
9896 ++decl_specs
->specs
[(int) ds_typedef
];
9897 /* Consume the token. */
9898 cp_lexer_consume_token (parser
->lexer
);
9899 /* A constructor declarator cannot appear in a typedef. */
9900 constructor_possible_p
= false;
9901 /* The "typedef" keyword can only occur in a declaration; we
9902 may as well commit at this point. */
9903 cp_parser_commit_to_tentative_parse (parser
);
9905 if (decl_specs
->storage_class
!= sc_none
)
9906 decl_specs
->conflicting_specifiers_p
= true;
9909 /* storage-class-specifier:
9919 if (cxx_dialect
== cxx98
)
9921 /* Consume the token. */
9922 cp_lexer_consume_token (parser
->lexer
);
9924 /* Complain about `auto' as a storage specifier, if
9925 we're complaining about C++0x compatibility. */
9926 warning_at (token
->location
, OPT_Wc__0x_compat
, "%<auto%>"
9927 " will change meaning in C++0x; please remove it");
9929 /* Set the storage class anyway. */
9930 cp_parser_set_storage_class (parser
, decl_specs
, RID_AUTO
,
9934 /* C++0x auto type-specifier. */
9935 found_decl_spec
= false;
9942 /* Consume the token. */
9943 cp_lexer_consume_token (parser
->lexer
);
9944 cp_parser_set_storage_class (parser
, decl_specs
, token
->keyword
,
9948 /* Consume the token. */
9949 cp_lexer_consume_token (parser
->lexer
);
9950 ++decl_specs
->specs
[(int) ds_thread
];
9954 /* We did not yet find a decl-specifier yet. */
9955 found_decl_spec
= false;
9960 && (flags
& CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR
)
9961 && token
->keyword
!= RID_CONSTEXPR
)
9962 error ("decl-specifier invalid in condition");
9964 /* Constructors are a special case. The `S' in `S()' is not a
9965 decl-specifier; it is the beginning of the declarator. */
9968 && constructor_possible_p
9969 && (cp_parser_constructor_declarator_p
9970 (parser
, decl_specs
->specs
[(int) ds_friend
] != 0)));
9972 /* If we don't have a DECL_SPEC yet, then we must be looking at
9973 a type-specifier. */
9974 if (!found_decl_spec
&& !constructor_p
)
9976 int decl_spec_declares_class_or_enum
;
9977 bool is_cv_qualifier
;
9981 = cp_parser_type_specifier (parser
, flags
,
9983 /*is_declaration=*/true,
9984 &decl_spec_declares_class_or_enum
,
9986 *declares_class_or_enum
|= decl_spec_declares_class_or_enum
;
9988 /* If this type-specifier referenced a user-defined type
9989 (a typedef, class-name, etc.), then we can't allow any
9990 more such type-specifiers henceforth.
9994 The longest sequence of decl-specifiers that could
9995 possibly be a type name is taken as the
9996 decl-specifier-seq of a declaration. The sequence shall
9997 be self-consistent as described below.
10001 As a general rule, at most one type-specifier is allowed
10002 in the complete decl-specifier-seq of a declaration. The
10003 only exceptions are the following:
10005 -- const or volatile can be combined with any other
10008 -- signed or unsigned can be combined with char, long,
10016 void g (const int Pc);
10018 Here, Pc is *not* part of the decl-specifier seq; it's
10019 the declarator. Therefore, once we see a type-specifier
10020 (other than a cv-qualifier), we forbid any additional
10021 user-defined types. We *do* still allow things like `int
10022 int' to be considered a decl-specifier-seq, and issue the
10023 error message later. */
10024 if (type_spec
&& !is_cv_qualifier
)
10025 flags
|= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
;
10026 /* A constructor declarator cannot follow a type-specifier. */
10029 constructor_possible_p
= false;
10030 found_decl_spec
= true;
10031 if (!is_cv_qualifier
)
10032 decl_specs
->any_type_specifiers_p
= true;
10036 /* If we still do not have a DECL_SPEC, then there are no more
10037 decl-specifiers. */
10038 if (!found_decl_spec
)
10041 decl_specs
->any_specifiers_p
= true;
10042 /* After we see one decl-specifier, further decl-specifiers are
10043 always optional. */
10044 flags
|= CP_PARSER_FLAGS_OPTIONAL
;
10047 cp_parser_check_decl_spec (decl_specs
, start_token
->location
);
10049 /* Don't allow a friend specifier with a class definition. */
10050 if (decl_specs
->specs
[(int) ds_friend
] != 0
10051 && (*declares_class_or_enum
& 2))
10052 error_at (start_token
->location
,
10053 "class definition may not be declared a friend");
10056 /* Parse an (optional) storage-class-specifier.
10058 storage-class-specifier:
10067 storage-class-specifier:
10070 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
10073 cp_parser_storage_class_specifier_opt (cp_parser
* parser
)
10075 switch (cp_lexer_peek_token (parser
->lexer
)->keyword
)
10078 if (cxx_dialect
!= cxx98
)
10080 /* Fall through for C++98. */
10087 /* Consume the token. */
10088 return cp_lexer_consume_token (parser
->lexer
)->u
.value
;
10095 /* Parse an (optional) function-specifier.
10097 function-specifier:
10102 Returns an IDENTIFIER_NODE corresponding to the keyword used.
10103 Updates DECL_SPECS, if it is non-NULL. */
10106 cp_parser_function_specifier_opt (cp_parser
* parser
,
10107 cp_decl_specifier_seq
*decl_specs
)
10109 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
10110 switch (token
->keyword
)
10114 ++decl_specs
->specs
[(int) ds_inline
];
10118 /* 14.5.2.3 [temp.mem]
10120 A member function template shall not be virtual. */
10121 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
10122 error_at (token
->location
, "templates may not be %<virtual%>");
10123 else if (decl_specs
)
10124 ++decl_specs
->specs
[(int) ds_virtual
];
10129 ++decl_specs
->specs
[(int) ds_explicit
];
10136 /* Consume the token. */
10137 return cp_lexer_consume_token (parser
->lexer
)->u
.value
;
10140 /* Parse a linkage-specification.
10142 linkage-specification:
10143 extern string-literal { declaration-seq [opt] }
10144 extern string-literal declaration */
10147 cp_parser_linkage_specification (cp_parser
* parser
)
10151 /* Look for the `extern' keyword. */
10152 cp_parser_require_keyword (parser
, RID_EXTERN
, RT_EXTERN
);
10154 /* Look for the string-literal. */
10155 linkage
= cp_parser_string_literal (parser
, false, false);
10157 /* Transform the literal into an identifier. If the literal is a
10158 wide-character string, or contains embedded NULs, then we can't
10159 handle it as the user wants. */
10160 if (strlen (TREE_STRING_POINTER (linkage
))
10161 != (size_t) (TREE_STRING_LENGTH (linkage
) - 1))
10163 cp_parser_error (parser
, "invalid linkage-specification");
10164 /* Assume C++ linkage. */
10165 linkage
= lang_name_cplusplus
;
10168 linkage
= get_identifier (TREE_STRING_POINTER (linkage
));
10170 /* We're now using the new linkage. */
10171 push_lang_context (linkage
);
10173 /* If the next token is a `{', then we're using the first
10175 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
10177 /* Consume the `{' token. */
10178 cp_lexer_consume_token (parser
->lexer
);
10179 /* Parse the declarations. */
10180 cp_parser_declaration_seq_opt (parser
);
10181 /* Look for the closing `}'. */
10182 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
10184 /* Otherwise, there's just one declaration. */
10187 bool saved_in_unbraced_linkage_specification_p
;
10189 saved_in_unbraced_linkage_specification_p
10190 = parser
->in_unbraced_linkage_specification_p
;
10191 parser
->in_unbraced_linkage_specification_p
= true;
10192 cp_parser_declaration (parser
);
10193 parser
->in_unbraced_linkage_specification_p
10194 = saved_in_unbraced_linkage_specification_p
;
10197 /* We're done with the linkage-specification. */
10198 pop_lang_context ();
10201 /* Parse a static_assert-declaration.
10203 static_assert-declaration:
10204 static_assert ( constant-expression , string-literal ) ;
10206 If MEMBER_P, this static_assert is a class member. */
10209 cp_parser_static_assert(cp_parser
*parser
, bool member_p
)
10214 location_t saved_loc
;
10216 /* Peek at the `static_assert' token so we can keep track of exactly
10217 where the static assertion started. */
10218 token
= cp_lexer_peek_token (parser
->lexer
);
10219 saved_loc
= token
->location
;
10221 /* Look for the `static_assert' keyword. */
10222 if (!cp_parser_require_keyword (parser
, RID_STATIC_ASSERT
,
10226 /* We know we are in a static assertion; commit to any tentative
10228 if (cp_parser_parsing_tentatively (parser
))
10229 cp_parser_commit_to_tentative_parse (parser
);
10231 /* Parse the `(' starting the static assertion condition. */
10232 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
10234 /* Parse the constant-expression. */
10236 cp_parser_constant_expression (parser
,
10237 /*allow_non_constant_p=*/false,
10238 /*non_constant_p=*/NULL
);
10240 /* Parse the separating `,'. */
10241 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
10243 /* Parse the string-literal message. */
10244 message
= cp_parser_string_literal (parser
,
10245 /*translate=*/false,
10248 /* A `)' completes the static assertion. */
10249 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
10250 cp_parser_skip_to_closing_parenthesis (parser
,
10251 /*recovering=*/true,
10252 /*or_comma=*/false,
10253 /*consume_paren=*/true);
10255 /* A semicolon terminates the declaration. */
10256 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
10258 /* Complete the static assertion, which may mean either processing
10259 the static assert now or saving it for template instantiation. */
10260 finish_static_assert (condition
, message
, saved_loc
, member_p
);
10263 /* Parse a `decltype' type. Returns the type.
10265 simple-type-specifier:
10266 decltype ( expression ) */
10269 cp_parser_decltype (cp_parser
*parser
)
10272 bool id_expression_or_member_access_p
= false;
10273 const char *saved_message
;
10274 bool saved_integral_constant_expression_p
;
10275 bool saved_non_integral_constant_expression_p
;
10276 cp_token
*id_expr_start_token
;
10278 /* Look for the `decltype' token. */
10279 if (!cp_parser_require_keyword (parser
, RID_DECLTYPE
, RT_DECLTYPE
))
10280 return error_mark_node
;
10282 /* Types cannot be defined in a `decltype' expression. Save away the
10284 saved_message
= parser
->type_definition_forbidden_message
;
10286 /* And create the new one. */
10287 parser
->type_definition_forbidden_message
10288 = G_("types may not be defined in %<decltype%> expressions");
10290 /* The restrictions on constant-expressions do not apply inside
10291 decltype expressions. */
10292 saved_integral_constant_expression_p
10293 = parser
->integral_constant_expression_p
;
10294 saved_non_integral_constant_expression_p
10295 = parser
->non_integral_constant_expression_p
;
10296 parser
->integral_constant_expression_p
= false;
10298 /* Do not actually evaluate the expression. */
10299 ++cp_unevaluated_operand
;
10301 /* Do not warn about problems with the expression. */
10302 ++c_inhibit_evaluation_warnings
;
10304 /* Parse the opening `('. */
10305 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
10306 return error_mark_node
;
10308 /* First, try parsing an id-expression. */
10309 id_expr_start_token
= cp_lexer_peek_token (parser
->lexer
);
10310 cp_parser_parse_tentatively (parser
);
10311 expr
= cp_parser_id_expression (parser
,
10312 /*template_keyword_p=*/false,
10313 /*check_dependency_p=*/true,
10314 /*template_p=*/NULL
,
10315 /*declarator_p=*/false,
10316 /*optional_p=*/false);
10318 if (!cp_parser_error_occurred (parser
) && expr
!= error_mark_node
)
10320 bool non_integral_constant_expression_p
= false;
10321 tree id_expression
= expr
;
10323 const char *error_msg
;
10325 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
10326 /* Lookup the name we got back from the id-expression. */
10327 expr
= cp_parser_lookup_name (parser
, expr
,
10329 /*is_template=*/false,
10330 /*is_namespace=*/false,
10331 /*check_dependency=*/true,
10332 /*ambiguous_decls=*/NULL
,
10333 id_expr_start_token
->location
);
10336 && expr
!= error_mark_node
10337 && TREE_CODE (expr
) != TEMPLATE_ID_EXPR
10338 && TREE_CODE (expr
) != TYPE_DECL
10339 && (TREE_CODE (expr
) != BIT_NOT_EXPR
10340 || !TYPE_P (TREE_OPERAND (expr
, 0)))
10341 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_CLOSE_PAREN
)
10343 /* Complete lookup of the id-expression. */
10344 expr
= (finish_id_expression
10345 (id_expression
, expr
, parser
->scope
, &idk
,
10346 /*integral_constant_expression_p=*/false,
10347 /*allow_non_integral_constant_expression_p=*/true,
10348 &non_integral_constant_expression_p
,
10349 /*template_p=*/false,
10351 /*address_p=*/false,
10352 /*template_arg_p=*/false,
10354 id_expr_start_token
->location
));
10356 if (expr
== error_mark_node
)
10357 /* We found an id-expression, but it was something that we
10358 should not have found. This is an error, not something
10359 we can recover from, so note that we found an
10360 id-expression and we'll recover as gracefully as
10362 id_expression_or_member_access_p
= true;
10366 && expr
!= error_mark_node
10367 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_CLOSE_PAREN
)
10368 /* We have an id-expression. */
10369 id_expression_or_member_access_p
= true;
10372 if (!id_expression_or_member_access_p
)
10374 /* Abort the id-expression parse. */
10375 cp_parser_abort_tentative_parse (parser
);
10377 /* Parsing tentatively, again. */
10378 cp_parser_parse_tentatively (parser
);
10380 /* Parse a class member access. */
10381 expr
= cp_parser_postfix_expression (parser
, /*address_p=*/false,
10383 /*member_access_only_p=*/true, NULL
);
10386 && expr
!= error_mark_node
10387 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_CLOSE_PAREN
)
10388 /* We have an id-expression. */
10389 id_expression_or_member_access_p
= true;
10392 if (id_expression_or_member_access_p
)
10393 /* We have parsed the complete id-expression or member access. */
10394 cp_parser_parse_definitely (parser
);
10397 bool saved_greater_than_is_operator_p
;
10399 /* Abort our attempt to parse an id-expression or member access
10401 cp_parser_abort_tentative_parse (parser
);
10403 /* Within a parenthesized expression, a `>' token is always
10404 the greater-than operator. */
10405 saved_greater_than_is_operator_p
10406 = parser
->greater_than_is_operator_p
;
10407 parser
->greater_than_is_operator_p
= true;
10409 /* Parse a full expression. */
10410 expr
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
10412 /* The `>' token might be the end of a template-id or
10413 template-parameter-list now. */
10414 parser
->greater_than_is_operator_p
10415 = saved_greater_than_is_operator_p
;
10418 /* Go back to evaluating expressions. */
10419 --cp_unevaluated_operand
;
10420 --c_inhibit_evaluation_warnings
;
10422 /* Restore the old message and the integral constant expression
10424 parser
->type_definition_forbidden_message
= saved_message
;
10425 parser
->integral_constant_expression_p
10426 = saved_integral_constant_expression_p
;
10427 parser
->non_integral_constant_expression_p
10428 = saved_non_integral_constant_expression_p
;
10430 if (expr
== error_mark_node
)
10432 /* Skip everything up to the closing `)'. */
10433 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
10434 /*consume_paren=*/true);
10435 return error_mark_node
;
10438 /* Parse to the closing `)'. */
10439 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
10441 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
10442 /*consume_paren=*/true);
10443 return error_mark_node
;
10446 return finish_decltype_type (expr
, id_expression_or_member_access_p
);
10449 /* Special member functions [gram.special] */
10451 /* Parse a conversion-function-id.
10453 conversion-function-id:
10454 operator conversion-type-id
10456 Returns an IDENTIFIER_NODE representing the operator. */
10459 cp_parser_conversion_function_id (cp_parser
* parser
)
10463 tree saved_qualifying_scope
;
10464 tree saved_object_scope
;
10465 tree pushed_scope
= NULL_TREE
;
10467 /* Look for the `operator' token. */
10468 if (!cp_parser_require_keyword (parser
, RID_OPERATOR
, RT_OPERATOR
))
10469 return error_mark_node
;
10470 /* When we parse the conversion-type-id, the current scope will be
10471 reset. However, we need that information in able to look up the
10472 conversion function later, so we save it here. */
10473 saved_scope
= parser
->scope
;
10474 saved_qualifying_scope
= parser
->qualifying_scope
;
10475 saved_object_scope
= parser
->object_scope
;
10476 /* We must enter the scope of the class so that the names of
10477 entities declared within the class are available in the
10478 conversion-type-id. For example, consider:
10485 S::operator I() { ... }
10487 In order to see that `I' is a type-name in the definition, we
10488 must be in the scope of `S'. */
10490 pushed_scope
= push_scope (saved_scope
);
10491 /* Parse the conversion-type-id. */
10492 type
= cp_parser_conversion_type_id (parser
);
10493 /* Leave the scope of the class, if any. */
10495 pop_scope (pushed_scope
);
10496 /* Restore the saved scope. */
10497 parser
->scope
= saved_scope
;
10498 parser
->qualifying_scope
= saved_qualifying_scope
;
10499 parser
->object_scope
= saved_object_scope
;
10500 /* If the TYPE is invalid, indicate failure. */
10501 if (type
== error_mark_node
)
10502 return error_mark_node
;
10503 return mangle_conv_op_name_for_type (type
);
10506 /* Parse a conversion-type-id:
10508 conversion-type-id:
10509 type-specifier-seq conversion-declarator [opt]
10511 Returns the TYPE specified. */
10514 cp_parser_conversion_type_id (cp_parser
* parser
)
10517 cp_decl_specifier_seq type_specifiers
;
10518 cp_declarator
*declarator
;
10519 tree type_specified
;
10521 /* Parse the attributes. */
10522 attributes
= cp_parser_attributes_opt (parser
);
10523 /* Parse the type-specifiers. */
10524 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/false,
10525 /*is_trailing_return=*/false,
10527 /* If that didn't work, stop. */
10528 if (type_specifiers
.type
== error_mark_node
)
10529 return error_mark_node
;
10530 /* Parse the conversion-declarator. */
10531 declarator
= cp_parser_conversion_declarator_opt (parser
);
10533 type_specified
= grokdeclarator (declarator
, &type_specifiers
, TYPENAME
,
10534 /*initialized=*/0, &attributes
);
10536 cplus_decl_attributes (&type_specified
, attributes
, /*flags=*/0);
10538 /* Don't give this error when parsing tentatively. This happens to
10539 work because we always parse this definitively once. */
10540 if (! cp_parser_uncommitted_to_tentative_parse_p (parser
)
10541 && type_uses_auto (type_specified
))
10543 error ("invalid use of %<auto%> in conversion operator");
10544 return error_mark_node
;
10547 return type_specified
;
10550 /* Parse an (optional) conversion-declarator.
10552 conversion-declarator:
10553 ptr-operator conversion-declarator [opt]
10557 static cp_declarator
*
10558 cp_parser_conversion_declarator_opt (cp_parser
* parser
)
10560 enum tree_code code
;
10562 cp_cv_quals cv_quals
;
10564 /* We don't know if there's a ptr-operator next, or not. */
10565 cp_parser_parse_tentatively (parser
);
10566 /* Try the ptr-operator. */
10567 code
= cp_parser_ptr_operator (parser
, &class_type
, &cv_quals
);
10568 /* If it worked, look for more conversion-declarators. */
10569 if (cp_parser_parse_definitely (parser
))
10571 cp_declarator
*declarator
;
10573 /* Parse another optional declarator. */
10574 declarator
= cp_parser_conversion_declarator_opt (parser
);
10576 return cp_parser_make_indirect_declarator
10577 (code
, class_type
, cv_quals
, declarator
);
10583 /* Parse an (optional) ctor-initializer.
10586 : mem-initializer-list
10588 Returns TRUE iff the ctor-initializer was actually present. */
10591 cp_parser_ctor_initializer_opt (cp_parser
* parser
)
10593 /* If the next token is not a `:', then there is no
10594 ctor-initializer. */
10595 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
10597 /* Do default initialization of any bases and members. */
10598 if (DECL_CONSTRUCTOR_P (current_function_decl
))
10599 finish_mem_initializers (NULL_TREE
);
10604 /* Consume the `:' token. */
10605 cp_lexer_consume_token (parser
->lexer
);
10606 /* And the mem-initializer-list. */
10607 cp_parser_mem_initializer_list (parser
);
10612 /* Parse a mem-initializer-list.
10614 mem-initializer-list:
10615 mem-initializer ... [opt]
10616 mem-initializer ... [opt] , mem-initializer-list */
10619 cp_parser_mem_initializer_list (cp_parser
* parser
)
10621 tree mem_initializer_list
= NULL_TREE
;
10622 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
10624 /* Let the semantic analysis code know that we are starting the
10625 mem-initializer-list. */
10626 if (!DECL_CONSTRUCTOR_P (current_function_decl
))
10627 error_at (token
->location
,
10628 "only constructors take member initializers");
10630 /* Loop through the list. */
10633 tree mem_initializer
;
10635 token
= cp_lexer_peek_token (parser
->lexer
);
10636 /* Parse the mem-initializer. */
10637 mem_initializer
= cp_parser_mem_initializer (parser
);
10638 /* If the next token is a `...', we're expanding member initializers. */
10639 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
10641 /* Consume the `...'. */
10642 cp_lexer_consume_token (parser
->lexer
);
10644 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
10645 can be expanded but members cannot. */
10646 if (mem_initializer
!= error_mark_node
10647 && !TYPE_P (TREE_PURPOSE (mem_initializer
)))
10649 error_at (token
->location
,
10650 "cannot expand initializer for member %<%D%>",
10651 TREE_PURPOSE (mem_initializer
));
10652 mem_initializer
= error_mark_node
;
10655 /* Construct the pack expansion type. */
10656 if (mem_initializer
!= error_mark_node
)
10657 mem_initializer
= make_pack_expansion (mem_initializer
);
10659 /* Add it to the list, unless it was erroneous. */
10660 if (mem_initializer
!= error_mark_node
)
10662 TREE_CHAIN (mem_initializer
) = mem_initializer_list
;
10663 mem_initializer_list
= mem_initializer
;
10665 /* If the next token is not a `,', we're done. */
10666 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
10668 /* Consume the `,' token. */
10669 cp_lexer_consume_token (parser
->lexer
);
10672 /* Perform semantic analysis. */
10673 if (DECL_CONSTRUCTOR_P (current_function_decl
))
10674 finish_mem_initializers (mem_initializer_list
);
10677 /* Parse a mem-initializer.
10680 mem-initializer-id ( expression-list [opt] )
10681 mem-initializer-id braced-init-list
10686 ( expression-list [opt] )
10688 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
10689 class) or FIELD_DECL (for a non-static data member) to initialize;
10690 the TREE_VALUE is the expression-list. An empty initialization
10691 list is represented by void_list_node. */
10694 cp_parser_mem_initializer (cp_parser
* parser
)
10696 tree mem_initializer_id
;
10697 tree expression_list
;
10699 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
10701 /* Find out what is being initialized. */
10702 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
10704 permerror (token
->location
,
10705 "anachronistic old-style base class initializer");
10706 mem_initializer_id
= NULL_TREE
;
10710 mem_initializer_id
= cp_parser_mem_initializer_id (parser
);
10711 if (mem_initializer_id
== error_mark_node
)
10712 return mem_initializer_id
;
10714 member
= expand_member_init (mem_initializer_id
);
10715 if (member
&& !DECL_P (member
))
10716 in_base_initializer
= 1;
10718 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
10720 bool expr_non_constant_p
;
10721 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
10722 expression_list
= cp_parser_braced_list (parser
, &expr_non_constant_p
);
10723 CONSTRUCTOR_IS_DIRECT_INIT (expression_list
) = 1;
10724 expression_list
= build_tree_list (NULL_TREE
, expression_list
);
10729 vec
= cp_parser_parenthesized_expression_list (parser
, non_attr
,
10731 /*allow_expansion_p=*/true,
10732 /*non_constant_p=*/NULL
);
10734 return error_mark_node
;
10735 expression_list
= build_tree_list_vec (vec
);
10736 release_tree_vector (vec
);
10739 if (expression_list
== error_mark_node
)
10740 return error_mark_node
;
10741 if (!expression_list
)
10742 expression_list
= void_type_node
;
10744 in_base_initializer
= 0;
10746 return member
? build_tree_list (member
, expression_list
) : error_mark_node
;
10749 /* Parse a mem-initializer-id.
10751 mem-initializer-id:
10752 :: [opt] nested-name-specifier [opt] class-name
10755 Returns a TYPE indicating the class to be initializer for the first
10756 production. Returns an IDENTIFIER_NODE indicating the data member
10757 to be initialized for the second production. */
10760 cp_parser_mem_initializer_id (cp_parser
* parser
)
10762 bool global_scope_p
;
10763 bool nested_name_specifier_p
;
10764 bool template_p
= false;
10767 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
10769 /* `typename' is not allowed in this context ([temp.res]). */
10770 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TYPENAME
))
10772 error_at (token
->location
,
10773 "keyword %<typename%> not allowed in this context (a qualified "
10774 "member initializer is implicitly a type)");
10775 cp_lexer_consume_token (parser
->lexer
);
10777 /* Look for the optional `::' operator. */
10779 = (cp_parser_global_scope_opt (parser
,
10780 /*current_scope_valid_p=*/false)
10782 /* Look for the optional nested-name-specifier. The simplest way to
10787 The keyword `typename' is not permitted in a base-specifier or
10788 mem-initializer; in these contexts a qualified name that
10789 depends on a template-parameter is implicitly assumed to be a
10792 is to assume that we have seen the `typename' keyword at this
10794 nested_name_specifier_p
10795 = (cp_parser_nested_name_specifier_opt (parser
,
10796 /*typename_keyword_p=*/true,
10797 /*check_dependency_p=*/true,
10799 /*is_declaration=*/true)
10801 if (nested_name_specifier_p
)
10802 template_p
= cp_parser_optional_template_keyword (parser
);
10803 /* If there is a `::' operator or a nested-name-specifier, then we
10804 are definitely looking for a class-name. */
10805 if (global_scope_p
|| nested_name_specifier_p
)
10806 return cp_parser_class_name (parser
,
10807 /*typename_keyword_p=*/true,
10808 /*template_keyword_p=*/template_p
,
10810 /*check_dependency_p=*/true,
10811 /*class_head_p=*/false,
10812 /*is_declaration=*/true);
10813 /* Otherwise, we could also be looking for an ordinary identifier. */
10814 cp_parser_parse_tentatively (parser
);
10815 /* Try a class-name. */
10816 id
= cp_parser_class_name (parser
,
10817 /*typename_keyword_p=*/true,
10818 /*template_keyword_p=*/false,
10820 /*check_dependency_p=*/true,
10821 /*class_head_p=*/false,
10822 /*is_declaration=*/true);
10823 /* If we found one, we're done. */
10824 if (cp_parser_parse_definitely (parser
))
10826 /* Otherwise, look for an ordinary identifier. */
10827 return cp_parser_identifier (parser
);
10830 /* Overloading [gram.over] */
10832 /* Parse an operator-function-id.
10834 operator-function-id:
10837 Returns an IDENTIFIER_NODE for the operator which is a
10838 human-readable spelling of the identifier, e.g., `operator +'. */
10841 cp_parser_operator_function_id (cp_parser
* parser
)
10843 /* Look for the `operator' keyword. */
10844 if (!cp_parser_require_keyword (parser
, RID_OPERATOR
, RT_OPERATOR
))
10845 return error_mark_node
;
10846 /* And then the name of the operator itself. */
10847 return cp_parser_operator (parser
);
10850 /* Parse an operator.
10853 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
10854 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
10855 || ++ -- , ->* -> () []
10862 Returns an IDENTIFIER_NODE for the operator which is a
10863 human-readable spelling of the identifier, e.g., `operator +'. */
10866 cp_parser_operator (cp_parser
* parser
)
10868 tree id
= NULL_TREE
;
10871 /* Peek at the next token. */
10872 token
= cp_lexer_peek_token (parser
->lexer
);
10873 /* Figure out which operator we have. */
10874 switch (token
->type
)
10880 /* The keyword should be either `new' or `delete'. */
10881 if (token
->keyword
== RID_NEW
)
10883 else if (token
->keyword
== RID_DELETE
)
10888 /* Consume the `new' or `delete' token. */
10889 cp_lexer_consume_token (parser
->lexer
);
10891 /* Peek at the next token. */
10892 token
= cp_lexer_peek_token (parser
->lexer
);
10893 /* If it's a `[' token then this is the array variant of the
10895 if (token
->type
== CPP_OPEN_SQUARE
)
10897 /* Consume the `[' token. */
10898 cp_lexer_consume_token (parser
->lexer
);
10899 /* Look for the `]' token. */
10900 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
10901 id
= ansi_opname (op
== NEW_EXPR
10902 ? VEC_NEW_EXPR
: VEC_DELETE_EXPR
);
10904 /* Otherwise, we have the non-array variant. */
10906 id
= ansi_opname (op
);
10912 id
= ansi_opname (PLUS_EXPR
);
10916 id
= ansi_opname (MINUS_EXPR
);
10920 id
= ansi_opname (MULT_EXPR
);
10924 id
= ansi_opname (TRUNC_DIV_EXPR
);
10928 id
= ansi_opname (TRUNC_MOD_EXPR
);
10932 id
= ansi_opname (BIT_XOR_EXPR
);
10936 id
= ansi_opname (BIT_AND_EXPR
);
10940 id
= ansi_opname (BIT_IOR_EXPR
);
10944 id
= ansi_opname (BIT_NOT_EXPR
);
10948 id
= ansi_opname (TRUTH_NOT_EXPR
);
10952 id
= ansi_assopname (NOP_EXPR
);
10956 id
= ansi_opname (LT_EXPR
);
10960 id
= ansi_opname (GT_EXPR
);
10964 id
= ansi_assopname (PLUS_EXPR
);
10968 id
= ansi_assopname (MINUS_EXPR
);
10972 id
= ansi_assopname (MULT_EXPR
);
10976 id
= ansi_assopname (TRUNC_DIV_EXPR
);
10980 id
= ansi_assopname (TRUNC_MOD_EXPR
);
10984 id
= ansi_assopname (BIT_XOR_EXPR
);
10988 id
= ansi_assopname (BIT_AND_EXPR
);
10992 id
= ansi_assopname (BIT_IOR_EXPR
);
10996 id
= ansi_opname (LSHIFT_EXPR
);
11000 id
= ansi_opname (RSHIFT_EXPR
);
11003 case CPP_LSHIFT_EQ
:
11004 id
= ansi_assopname (LSHIFT_EXPR
);
11007 case CPP_RSHIFT_EQ
:
11008 id
= ansi_assopname (RSHIFT_EXPR
);
11012 id
= ansi_opname (EQ_EXPR
);
11016 id
= ansi_opname (NE_EXPR
);
11020 id
= ansi_opname (LE_EXPR
);
11023 case CPP_GREATER_EQ
:
11024 id
= ansi_opname (GE_EXPR
);
11028 id
= ansi_opname (TRUTH_ANDIF_EXPR
);
11032 id
= ansi_opname (TRUTH_ORIF_EXPR
);
11035 case CPP_PLUS_PLUS
:
11036 id
= ansi_opname (POSTINCREMENT_EXPR
);
11039 case CPP_MINUS_MINUS
:
11040 id
= ansi_opname (PREDECREMENT_EXPR
);
11044 id
= ansi_opname (COMPOUND_EXPR
);
11047 case CPP_DEREF_STAR
:
11048 id
= ansi_opname (MEMBER_REF
);
11052 id
= ansi_opname (COMPONENT_REF
);
11055 case CPP_OPEN_PAREN
:
11056 /* Consume the `('. */
11057 cp_lexer_consume_token (parser
->lexer
);
11058 /* Look for the matching `)'. */
11059 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
11060 return ansi_opname (CALL_EXPR
);
11062 case CPP_OPEN_SQUARE
:
11063 /* Consume the `['. */
11064 cp_lexer_consume_token (parser
->lexer
);
11065 /* Look for the matching `]'. */
11066 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
11067 return ansi_opname (ARRAY_REF
);
11070 /* Anything else is an error. */
11074 /* If we have selected an identifier, we need to consume the
11077 cp_lexer_consume_token (parser
->lexer
);
11078 /* Otherwise, no valid operator name was present. */
11081 cp_parser_error (parser
, "expected operator");
11082 id
= error_mark_node
;
11088 /* Parse a template-declaration.
11090 template-declaration:
11091 export [opt] template < template-parameter-list > declaration
11093 If MEMBER_P is TRUE, this template-declaration occurs within a
11096 The grammar rule given by the standard isn't correct. What
11097 is really meant is:
11099 template-declaration:
11100 export [opt] template-parameter-list-seq
11101 decl-specifier-seq [opt] init-declarator [opt] ;
11102 export [opt] template-parameter-list-seq
11103 function-definition
11105 template-parameter-list-seq:
11106 template-parameter-list-seq [opt]
11107 template < template-parameter-list > */
11110 cp_parser_template_declaration (cp_parser
* parser
, bool member_p
)
11112 /* Check for `export'. */
11113 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_EXPORT
))
11115 /* Consume the `export' token. */
11116 cp_lexer_consume_token (parser
->lexer
);
11117 /* Warn that we do not support `export'. */
11118 warning (0, "keyword %<export%> not implemented, and will be ignored");
11121 cp_parser_template_declaration_after_export (parser
, member_p
);
11124 /* Parse a template-parameter-list.
11126 template-parameter-list:
11128 template-parameter-list , template-parameter
11130 Returns a TREE_LIST. Each node represents a template parameter.
11131 The nodes are connected via their TREE_CHAINs. */
11134 cp_parser_template_parameter_list (cp_parser
* parser
)
11136 tree parameter_list
= NULL_TREE
;
11138 begin_template_parm_list ();
11140 /* The loop below parses the template parms. We first need to know
11141 the total number of template parms to be able to compute proper
11142 canonical types of each dependent type. So after the loop, when
11143 we know the total number of template parms,
11144 end_template_parm_list computes the proper canonical types and
11145 fixes up the dependent types accordingly. */
11150 bool is_parameter_pack
;
11151 location_t parm_loc
;
11153 /* Parse the template-parameter. */
11154 parm_loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
11155 parameter
= cp_parser_template_parameter (parser
,
11157 &is_parameter_pack
);
11158 /* Add it to the list. */
11159 if (parameter
!= error_mark_node
)
11160 parameter_list
= process_template_parm (parameter_list
,
11168 tree err_parm
= build_tree_list (parameter
, parameter
);
11169 parameter_list
= chainon (parameter_list
, err_parm
);
11172 /* If the next token is not a `,', we're done. */
11173 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
11175 /* Otherwise, consume the `,' token. */
11176 cp_lexer_consume_token (parser
->lexer
);
11179 return end_template_parm_list (parameter_list
);
11182 /* Parse a template-parameter.
11184 template-parameter:
11186 parameter-declaration
11188 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
11189 the parameter. The TREE_PURPOSE is the default value, if any.
11190 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
11191 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
11192 set to true iff this parameter is a parameter pack. */
11195 cp_parser_template_parameter (cp_parser
* parser
, bool *is_non_type
,
11196 bool *is_parameter_pack
)
11199 cp_parameter_declarator
*parameter_declarator
;
11200 cp_declarator
*id_declarator
;
11203 /* Assume it is a type parameter or a template parameter. */
11204 *is_non_type
= false;
11205 /* Assume it not a parameter pack. */
11206 *is_parameter_pack
= false;
11207 /* Peek at the next token. */
11208 token
= cp_lexer_peek_token (parser
->lexer
);
11209 /* If it is `class' or `template', we have a type-parameter. */
11210 if (token
->keyword
== RID_TEMPLATE
)
11211 return cp_parser_type_parameter (parser
, is_parameter_pack
);
11212 /* If it is `class' or `typename' we do not know yet whether it is a
11213 type parameter or a non-type parameter. Consider:
11215 template <typename T, typename T::X X> ...
11219 template <class C, class D*> ...
11221 Here, the first parameter is a type parameter, and the second is
11222 a non-type parameter. We can tell by looking at the token after
11223 the identifier -- if it is a `,', `=', or `>' then we have a type
11225 if (token
->keyword
== RID_TYPENAME
|| token
->keyword
== RID_CLASS
)
11227 /* Peek at the token after `class' or `typename'. */
11228 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
11229 /* If it's an ellipsis, we have a template type parameter
11231 if (token
->type
== CPP_ELLIPSIS
)
11232 return cp_parser_type_parameter (parser
, is_parameter_pack
);
11233 /* If it's an identifier, skip it. */
11234 if (token
->type
== CPP_NAME
)
11235 token
= cp_lexer_peek_nth_token (parser
->lexer
, 3);
11236 /* Now, see if the token looks like the end of a template
11238 if (token
->type
== CPP_COMMA
11239 || token
->type
== CPP_EQ
11240 || token
->type
== CPP_GREATER
)
11241 return cp_parser_type_parameter (parser
, is_parameter_pack
);
11244 /* Otherwise, it is a non-type parameter.
11248 When parsing a default template-argument for a non-type
11249 template-parameter, the first non-nested `>' is taken as the end
11250 of the template parameter-list rather than a greater-than
11252 *is_non_type
= true;
11253 parameter_declarator
11254 = cp_parser_parameter_declaration (parser
, /*template_parm_p=*/true,
11255 /*parenthesized_p=*/NULL
);
11257 /* If the parameter declaration is marked as a parameter pack, set
11258 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
11259 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
11261 if (parameter_declarator
11262 && parameter_declarator
->declarator
11263 && parameter_declarator
->declarator
->parameter_pack_p
)
11265 *is_parameter_pack
= true;
11266 parameter_declarator
->declarator
->parameter_pack_p
= false;
11269 /* If the next token is an ellipsis, and we don't already have it
11270 marked as a parameter pack, then we have a parameter pack (that
11271 has no declarator). */
11272 if (!*is_parameter_pack
11273 && cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
)
11274 && declarator_can_be_parameter_pack (parameter_declarator
->declarator
))
11276 /* Consume the `...'. */
11277 cp_lexer_consume_token (parser
->lexer
);
11278 maybe_warn_variadic_templates ();
11280 *is_parameter_pack
= true;
11282 /* We might end up with a pack expansion as the type of the non-type
11283 template parameter, in which case this is a non-type template
11285 else if (parameter_declarator
11286 && parameter_declarator
->decl_specifiers
.type
11287 && PACK_EXPANSION_P (parameter_declarator
->decl_specifiers
.type
))
11289 *is_parameter_pack
= true;
11290 parameter_declarator
->decl_specifiers
.type
=
11291 PACK_EXPANSION_PATTERN (parameter_declarator
->decl_specifiers
.type
);
11294 if (*is_parameter_pack
&& cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
11296 /* Parameter packs cannot have default arguments. However, a
11297 user may try to do so, so we'll parse them and give an
11298 appropriate diagnostic here. */
11300 /* Consume the `='. */
11301 cp_token
*start_token
= cp_lexer_peek_token (parser
->lexer
);
11302 cp_lexer_consume_token (parser
->lexer
);
11304 /* Find the name of the parameter pack. */
11305 id_declarator
= parameter_declarator
->declarator
;
11306 while (id_declarator
&& id_declarator
->kind
!= cdk_id
)
11307 id_declarator
= id_declarator
->declarator
;
11309 if (id_declarator
&& id_declarator
->kind
== cdk_id
)
11310 error_at (start_token
->location
,
11311 "template parameter pack %qD cannot have a default argument",
11312 id_declarator
->u
.id
.unqualified_name
);
11314 error_at (start_token
->location
,
11315 "template parameter pack cannot have a default argument");
11317 /* Parse the default argument, but throw away the result. */
11318 cp_parser_default_argument (parser
, /*template_parm_p=*/true);
11321 parm
= grokdeclarator (parameter_declarator
->declarator
,
11322 ¶meter_declarator
->decl_specifiers
,
11323 TPARM
, /*initialized=*/0,
11324 /*attrlist=*/NULL
);
11325 if (parm
== error_mark_node
)
11326 return error_mark_node
;
11328 return build_tree_list (parameter_declarator
->default_argument
, parm
);
11331 /* Parse a type-parameter.
11334 class identifier [opt]
11335 class identifier [opt] = type-id
11336 typename identifier [opt]
11337 typename identifier [opt] = type-id
11338 template < template-parameter-list > class identifier [opt]
11339 template < template-parameter-list > class identifier [opt]
11342 GNU Extension (variadic templates):
11345 class ... identifier [opt]
11346 typename ... identifier [opt]
11348 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
11349 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
11350 the declaration of the parameter.
11352 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
11355 cp_parser_type_parameter (cp_parser
* parser
, bool *is_parameter_pack
)
11360 /* Look for a keyword to tell us what kind of parameter this is. */
11361 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_CLASS_TYPENAME_TEMPLATE
);
11363 return error_mark_node
;
11365 switch (token
->keyword
)
11371 tree default_argument
;
11373 /* If the next token is an ellipsis, we have a template
11375 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
11377 /* Consume the `...' token. */
11378 cp_lexer_consume_token (parser
->lexer
);
11379 maybe_warn_variadic_templates ();
11381 *is_parameter_pack
= true;
11384 /* If the next token is an identifier, then it names the
11386 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
11387 identifier
= cp_parser_identifier (parser
);
11389 identifier
= NULL_TREE
;
11391 /* Create the parameter. */
11392 parameter
= finish_template_type_parm (class_type_node
, identifier
);
11394 /* If the next token is an `=', we have a default argument. */
11395 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
11397 /* Consume the `=' token. */
11398 cp_lexer_consume_token (parser
->lexer
);
11399 /* Parse the default-argument. */
11400 push_deferring_access_checks (dk_no_deferred
);
11401 default_argument
= cp_parser_type_id (parser
);
11403 /* Template parameter packs cannot have default
11405 if (*is_parameter_pack
)
11408 error_at (token
->location
,
11409 "template parameter pack %qD cannot have a "
11410 "default argument", identifier
);
11412 error_at (token
->location
,
11413 "template parameter packs cannot have "
11414 "default arguments");
11415 default_argument
= NULL_TREE
;
11417 pop_deferring_access_checks ();
11420 default_argument
= NULL_TREE
;
11422 /* Create the combined representation of the parameter and the
11423 default argument. */
11424 parameter
= build_tree_list (default_argument
, parameter
);
11431 tree default_argument
;
11433 /* Look for the `<'. */
11434 cp_parser_require (parser
, CPP_LESS
, RT_LESS
);
11435 /* Parse the template-parameter-list. */
11436 cp_parser_template_parameter_list (parser
);
11437 /* Look for the `>'. */
11438 cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
);
11439 /* Look for the `class' keyword. */
11440 cp_parser_require_keyword (parser
, RID_CLASS
, RT_CLASS
);
11441 /* If the next token is an ellipsis, we have a template
11443 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
11445 /* Consume the `...' token. */
11446 cp_lexer_consume_token (parser
->lexer
);
11447 maybe_warn_variadic_templates ();
11449 *is_parameter_pack
= true;
11451 /* If the next token is an `=', then there is a
11452 default-argument. If the next token is a `>', we are at
11453 the end of the parameter-list. If the next token is a `,',
11454 then we are at the end of this parameter. */
11455 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
)
11456 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_GREATER
)
11457 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
11459 identifier
= cp_parser_identifier (parser
);
11460 /* Treat invalid names as if the parameter were nameless. */
11461 if (identifier
== error_mark_node
)
11462 identifier
= NULL_TREE
;
11465 identifier
= NULL_TREE
;
11467 /* Create the template parameter. */
11468 parameter
= finish_template_template_parm (class_type_node
,
11471 /* If the next token is an `=', then there is a
11472 default-argument. */
11473 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
11477 /* Consume the `='. */
11478 cp_lexer_consume_token (parser
->lexer
);
11479 /* Parse the id-expression. */
11480 push_deferring_access_checks (dk_no_deferred
);
11481 /* save token before parsing the id-expression, for error
11483 token
= cp_lexer_peek_token (parser
->lexer
);
11485 = cp_parser_id_expression (parser
,
11486 /*template_keyword_p=*/false,
11487 /*check_dependency_p=*/true,
11488 /*template_p=*/&is_template
,
11489 /*declarator_p=*/false,
11490 /*optional_p=*/false);
11491 if (TREE_CODE (default_argument
) == TYPE_DECL
)
11492 /* If the id-expression was a template-id that refers to
11493 a template-class, we already have the declaration here,
11494 so no further lookup is needed. */
11497 /* Look up the name. */
11499 = cp_parser_lookup_name (parser
, default_argument
,
11501 /*is_template=*/is_template
,
11502 /*is_namespace=*/false,
11503 /*check_dependency=*/true,
11504 /*ambiguous_decls=*/NULL
,
11506 /* See if the default argument is valid. */
11508 = check_template_template_default_arg (default_argument
);
11510 /* Template parameter packs cannot have default
11512 if (*is_parameter_pack
)
11515 error_at (token
->location
,
11516 "template parameter pack %qD cannot "
11517 "have a default argument",
11520 error_at (token
->location
, "template parameter packs cannot "
11521 "have default arguments");
11522 default_argument
= NULL_TREE
;
11524 pop_deferring_access_checks ();
11527 default_argument
= NULL_TREE
;
11529 /* Create the combined representation of the parameter and the
11530 default argument. */
11531 parameter
= build_tree_list (default_argument
, parameter
);
11536 gcc_unreachable ();
11543 /* Parse a template-id.
11546 template-name < template-argument-list [opt] >
11548 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
11549 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
11550 returned. Otherwise, if the template-name names a function, or set
11551 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
11552 names a class, returns a TYPE_DECL for the specialization.
11554 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
11555 uninstantiated templates. */
11558 cp_parser_template_id (cp_parser
*parser
,
11559 bool template_keyword_p
,
11560 bool check_dependency_p
,
11561 bool is_declaration
)
11567 cp_token_position start_of_id
= 0;
11568 deferred_access_check
*chk
;
11569 VEC (deferred_access_check
,gc
) *access_check
;
11570 cp_token
*next_token
= NULL
, *next_token_2
= NULL
;
11571 bool is_identifier
;
11573 /* If the next token corresponds to a template-id, there is no need
11575 next_token
= cp_lexer_peek_token (parser
->lexer
);
11576 if (next_token
->type
== CPP_TEMPLATE_ID
)
11578 struct tree_check
*check_value
;
11580 /* Get the stored value. */
11581 check_value
= cp_lexer_consume_token (parser
->lexer
)->u
.tree_check_value
;
11582 /* Perform any access checks that were deferred. */
11583 access_check
= check_value
->checks
;
11586 FOR_EACH_VEC_ELT (deferred_access_check
, access_check
, i
, chk
)
11587 perform_or_defer_access_check (chk
->binfo
,
11591 /* Return the stored value. */
11592 return check_value
->value
;
11595 /* Avoid performing name lookup if there is no possibility of
11596 finding a template-id. */
11597 if ((next_token
->type
!= CPP_NAME
&& next_token
->keyword
!= RID_OPERATOR
)
11598 || (next_token
->type
== CPP_NAME
11599 && !cp_parser_nth_token_starts_template_argument_list_p
11602 cp_parser_error (parser
, "expected template-id");
11603 return error_mark_node
;
11606 /* Remember where the template-id starts. */
11607 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
11608 start_of_id
= cp_lexer_token_position (parser
->lexer
, false);
11610 push_deferring_access_checks (dk_deferred
);
11612 /* Parse the template-name. */
11613 is_identifier
= false;
11614 templ
= cp_parser_template_name (parser
, template_keyword_p
,
11615 check_dependency_p
,
11618 if (templ
== error_mark_node
|| is_identifier
)
11620 pop_deferring_access_checks ();
11624 /* If we find the sequence `[:' after a template-name, it's probably
11625 a digraph-typo for `< ::'. Substitute the tokens and check if we can
11626 parse correctly the argument list. */
11627 next_token
= cp_lexer_peek_token (parser
->lexer
);
11628 next_token_2
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
11629 if (next_token
->type
== CPP_OPEN_SQUARE
11630 && next_token
->flags
& DIGRAPH
11631 && next_token_2
->type
== CPP_COLON
11632 && !(next_token_2
->flags
& PREV_WHITE
))
11634 cp_parser_parse_tentatively (parser
);
11635 /* Change `:' into `::'. */
11636 next_token_2
->type
= CPP_SCOPE
;
11637 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
11639 cp_lexer_consume_token (parser
->lexer
);
11641 /* Parse the arguments. */
11642 arguments
= cp_parser_enclosed_template_argument_list (parser
);
11643 if (!cp_parser_parse_definitely (parser
))
11645 /* If we couldn't parse an argument list, then we revert our changes
11646 and return simply an error. Maybe this is not a template-id
11648 next_token_2
->type
= CPP_COLON
;
11649 cp_parser_error (parser
, "expected %<<%>");
11650 pop_deferring_access_checks ();
11651 return error_mark_node
;
11653 /* Otherwise, emit an error about the invalid digraph, but continue
11654 parsing because we got our argument list. */
11655 if (permerror (next_token
->location
,
11656 "%<<::%> cannot begin a template-argument list"))
11658 static bool hint
= false;
11659 inform (next_token
->location
,
11660 "%<<:%> is an alternate spelling for %<[%>."
11661 " Insert whitespace between %<<%> and %<::%>");
11662 if (!hint
&& !flag_permissive
)
11664 inform (next_token
->location
, "(if you use %<-fpermissive%>"
11665 " G++ will accept your code)");
11672 /* Look for the `<' that starts the template-argument-list. */
11673 if (!cp_parser_require (parser
, CPP_LESS
, RT_LESS
))
11675 pop_deferring_access_checks ();
11676 return error_mark_node
;
11678 /* Parse the arguments. */
11679 arguments
= cp_parser_enclosed_template_argument_list (parser
);
11682 /* Build a representation of the specialization. */
11683 if (TREE_CODE (templ
) == IDENTIFIER_NODE
)
11684 template_id
= build_min_nt (TEMPLATE_ID_EXPR
, templ
, arguments
);
11685 else if (DECL_CLASS_TEMPLATE_P (templ
)
11686 || DECL_TEMPLATE_TEMPLATE_PARM_P (templ
))
11688 bool entering_scope
;
11689 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
11690 template (rather than some instantiation thereof) only if
11691 is not nested within some other construct. For example, in
11692 "template <typename T> void f(T) { A<T>::", A<T> is just an
11693 instantiation of A. */
11694 entering_scope
= (template_parm_scope_p ()
11695 && cp_lexer_next_token_is (parser
->lexer
,
11698 = finish_template_type (templ
, arguments
, entering_scope
);
11702 /* If it's not a class-template or a template-template, it should be
11703 a function-template. */
11704 gcc_assert ((DECL_FUNCTION_TEMPLATE_P (templ
)
11705 || TREE_CODE (templ
) == OVERLOAD
11706 || BASELINK_P (templ
)));
11708 template_id
= lookup_template_function (templ
, arguments
);
11711 /* If parsing tentatively, replace the sequence of tokens that makes
11712 up the template-id with a CPP_TEMPLATE_ID token. That way,
11713 should we re-parse the token stream, we will not have to repeat
11714 the effort required to do the parse, nor will we issue duplicate
11715 error messages about problems during instantiation of the
11719 cp_token
*token
= cp_lexer_token_at (parser
->lexer
, start_of_id
);
11721 /* Reset the contents of the START_OF_ID token. */
11722 token
->type
= CPP_TEMPLATE_ID
;
11723 /* Retrieve any deferred checks. Do not pop this access checks yet
11724 so the memory will not be reclaimed during token replacing below. */
11725 token
->u
.tree_check_value
= ggc_alloc_cleared_tree_check ();
11726 token
->u
.tree_check_value
->value
= template_id
;
11727 token
->u
.tree_check_value
->checks
= get_deferred_access_checks ();
11728 token
->keyword
= RID_MAX
;
11730 /* Purge all subsequent tokens. */
11731 cp_lexer_purge_tokens_after (parser
->lexer
, start_of_id
);
11733 /* ??? Can we actually assume that, if template_id ==
11734 error_mark_node, we will have issued a diagnostic to the
11735 user, as opposed to simply marking the tentative parse as
11737 if (cp_parser_error_occurred (parser
) && template_id
!= error_mark_node
)
11738 error_at (token
->location
, "parse error in template argument list");
11741 pop_deferring_access_checks ();
11742 return template_id
;
11745 /* Parse a template-name.
11750 The standard should actually say:
11754 operator-function-id
11756 A defect report has been filed about this issue.
11758 A conversion-function-id cannot be a template name because they cannot
11759 be part of a template-id. In fact, looking at this code:
11761 a.operator K<int>()
11763 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
11764 It is impossible to call a templated conversion-function-id with an
11765 explicit argument list, since the only allowed template parameter is
11766 the type to which it is converting.
11768 If TEMPLATE_KEYWORD_P is true, then we have just seen the
11769 `template' keyword, in a construction like:
11773 In that case `f' is taken to be a template-name, even though there
11774 is no way of knowing for sure.
11776 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
11777 name refers to a set of overloaded functions, at least one of which
11778 is a template, or an IDENTIFIER_NODE with the name of the template,
11779 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
11780 names are looked up inside uninstantiated templates. */
11783 cp_parser_template_name (cp_parser
* parser
,
11784 bool template_keyword_p
,
11785 bool check_dependency_p
,
11786 bool is_declaration
,
11787 bool *is_identifier
)
11792 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
11794 /* If the next token is `operator', then we have either an
11795 operator-function-id or a conversion-function-id. */
11796 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_OPERATOR
))
11798 /* We don't know whether we're looking at an
11799 operator-function-id or a conversion-function-id. */
11800 cp_parser_parse_tentatively (parser
);
11801 /* Try an operator-function-id. */
11802 identifier
= cp_parser_operator_function_id (parser
);
11803 /* If that didn't work, try a conversion-function-id. */
11804 if (!cp_parser_parse_definitely (parser
))
11806 cp_parser_error (parser
, "expected template-name");
11807 return error_mark_node
;
11810 /* Look for the identifier. */
11812 identifier
= cp_parser_identifier (parser
);
11814 /* If we didn't find an identifier, we don't have a template-id. */
11815 if (identifier
== error_mark_node
)
11816 return error_mark_node
;
11818 /* If the name immediately followed the `template' keyword, then it
11819 is a template-name. However, if the next token is not `<', then
11820 we do not treat it as a template-name, since it is not being used
11821 as part of a template-id. This enables us to handle constructs
11824 template <typename T> struct S { S(); };
11825 template <typename T> S<T>::S();
11827 correctly. We would treat `S' as a template -- if it were `S<T>'
11828 -- but we do not if there is no `<'. */
11830 if (processing_template_decl
11831 && cp_parser_nth_token_starts_template_argument_list_p (parser
, 1))
11833 /* In a declaration, in a dependent context, we pretend that the
11834 "template" keyword was present in order to improve error
11835 recovery. For example, given:
11837 template <typename T> void f(T::X<int>);
11839 we want to treat "X<int>" as a template-id. */
11841 && !template_keyword_p
11842 && parser
->scope
&& TYPE_P (parser
->scope
)
11843 && check_dependency_p
11844 && dependent_scope_p (parser
->scope
)
11845 /* Do not do this for dtors (or ctors), since they never
11846 need the template keyword before their name. */
11847 && !constructor_name_p (identifier
, parser
->scope
))
11849 cp_token_position start
= 0;
11851 /* Explain what went wrong. */
11852 error_at (token
->location
, "non-template %qD used as template",
11854 inform (token
->location
, "use %<%T::template %D%> to indicate that it is a template",
11855 parser
->scope
, identifier
);
11856 /* If parsing tentatively, find the location of the "<" token. */
11857 if (cp_parser_simulate_error (parser
))
11858 start
= cp_lexer_token_position (parser
->lexer
, true);
11859 /* Parse the template arguments so that we can issue error
11860 messages about them. */
11861 cp_lexer_consume_token (parser
->lexer
);
11862 cp_parser_enclosed_template_argument_list (parser
);
11863 /* Skip tokens until we find a good place from which to
11864 continue parsing. */
11865 cp_parser_skip_to_closing_parenthesis (parser
,
11866 /*recovering=*/true,
11868 /*consume_paren=*/false);
11869 /* If parsing tentatively, permanently remove the
11870 template argument list. That will prevent duplicate
11871 error messages from being issued about the missing
11872 "template" keyword. */
11874 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
11876 *is_identifier
= true;
11880 /* If the "template" keyword is present, then there is generally
11881 no point in doing name-lookup, so we just return IDENTIFIER.
11882 But, if the qualifying scope is non-dependent then we can
11883 (and must) do name-lookup normally. */
11884 if (template_keyword_p
11886 || (TYPE_P (parser
->scope
)
11887 && dependent_type_p (parser
->scope
))))
11891 /* Look up the name. */
11892 decl
= cp_parser_lookup_name (parser
, identifier
,
11894 /*is_template=*/true,
11895 /*is_namespace=*/false,
11896 check_dependency_p
,
11897 /*ambiguous_decls=*/NULL
,
11900 /* If DECL is a template, then the name was a template-name. */
11901 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
11905 tree fn
= NULL_TREE
;
11907 /* The standard does not explicitly indicate whether a name that
11908 names a set of overloaded declarations, some of which are
11909 templates, is a template-name. However, such a name should
11910 be a template-name; otherwise, there is no way to form a
11911 template-id for the overloaded templates. */
11912 fns
= BASELINK_P (decl
) ? BASELINK_FUNCTIONS (decl
) : decl
;
11913 if (TREE_CODE (fns
) == OVERLOAD
)
11914 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
11915 if (TREE_CODE (OVL_CURRENT (fn
)) == TEMPLATE_DECL
)
11920 /* The name does not name a template. */
11921 cp_parser_error (parser
, "expected template-name");
11922 return error_mark_node
;
11926 /* If DECL is dependent, and refers to a function, then just return
11927 its name; we will look it up again during template instantiation. */
11928 if (DECL_FUNCTION_TEMPLATE_P (decl
) || !DECL_P (decl
))
11930 tree scope
= CP_DECL_CONTEXT (get_first_fn (decl
));
11931 if (TYPE_P (scope
) && dependent_type_p (scope
))
11938 /* Parse a template-argument-list.
11940 template-argument-list:
11941 template-argument ... [opt]
11942 template-argument-list , template-argument ... [opt]
11944 Returns a TREE_VEC containing the arguments. */
11947 cp_parser_template_argument_list (cp_parser
* parser
)
11949 tree fixed_args
[10];
11950 unsigned n_args
= 0;
11951 unsigned alloced
= 10;
11952 tree
*arg_ary
= fixed_args
;
11954 bool saved_in_template_argument_list_p
;
11956 bool saved_non_ice_p
;
11958 saved_in_template_argument_list_p
= parser
->in_template_argument_list_p
;
11959 parser
->in_template_argument_list_p
= true;
11960 /* Even if the template-id appears in an integral
11961 constant-expression, the contents of the argument list do
11963 saved_ice_p
= parser
->integral_constant_expression_p
;
11964 parser
->integral_constant_expression_p
= false;
11965 saved_non_ice_p
= parser
->non_integral_constant_expression_p
;
11966 parser
->non_integral_constant_expression_p
= false;
11967 /* Parse the arguments. */
11973 /* Consume the comma. */
11974 cp_lexer_consume_token (parser
->lexer
);
11976 /* Parse the template-argument. */
11977 argument
= cp_parser_template_argument (parser
);
11979 /* If the next token is an ellipsis, we're expanding a template
11981 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
11983 if (argument
== error_mark_node
)
11985 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
11986 error_at (token
->location
,
11987 "expected parameter pack before %<...%>");
11989 /* Consume the `...' token. */
11990 cp_lexer_consume_token (parser
->lexer
);
11992 /* Make the argument into a TYPE_PACK_EXPANSION or
11993 EXPR_PACK_EXPANSION. */
11994 argument
= make_pack_expansion (argument
);
11997 if (n_args
== alloced
)
12001 if (arg_ary
== fixed_args
)
12003 arg_ary
= XNEWVEC (tree
, alloced
);
12004 memcpy (arg_ary
, fixed_args
, sizeof (tree
) * n_args
);
12007 arg_ary
= XRESIZEVEC (tree
, arg_ary
, alloced
);
12009 arg_ary
[n_args
++] = argument
;
12011 while (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
));
12013 vec
= make_tree_vec (n_args
);
12016 TREE_VEC_ELT (vec
, n_args
) = arg_ary
[n_args
];
12018 if (arg_ary
!= fixed_args
)
12020 parser
->non_integral_constant_expression_p
= saved_non_ice_p
;
12021 parser
->integral_constant_expression_p
= saved_ice_p
;
12022 parser
->in_template_argument_list_p
= saved_in_template_argument_list_p
;
12023 #ifdef ENABLE_CHECKING
12024 SET_NON_DEFAULT_TEMPLATE_ARGS_COUNT (vec
, TREE_VEC_LENGTH (vec
));
12029 /* Parse a template-argument.
12032 assignment-expression
12036 The representation is that of an assignment-expression, type-id, or
12037 id-expression -- except that the qualified id-expression is
12038 evaluated, so that the value returned is either a DECL or an
12041 Although the standard says "assignment-expression", it forbids
12042 throw-expressions or assignments in the template argument.
12043 Therefore, we use "conditional-expression" instead. */
12046 cp_parser_template_argument (cp_parser
* parser
)
12051 bool maybe_type_id
= false;
12052 cp_token
*token
= NULL
, *argument_start_token
= NULL
;
12055 /* There's really no way to know what we're looking at, so we just
12056 try each alternative in order.
12060 In a template-argument, an ambiguity between a type-id and an
12061 expression is resolved to a type-id, regardless of the form of
12062 the corresponding template-parameter.
12064 Therefore, we try a type-id first. */
12065 cp_parser_parse_tentatively (parser
);
12066 argument
= cp_parser_template_type_arg (parser
);
12067 /* If there was no error parsing the type-id but the next token is a
12068 '>>', our behavior depends on which dialect of C++ we're
12069 parsing. In C++98, we probably found a typo for '> >'. But there
12070 are type-id which are also valid expressions. For instance:
12072 struct X { int operator >> (int); };
12073 template <int V> struct Foo {};
12076 Here 'X()' is a valid type-id of a function type, but the user just
12077 wanted to write the expression "X() >> 5". Thus, we remember that we
12078 found a valid type-id, but we still try to parse the argument as an
12079 expression to see what happens.
12081 In C++0x, the '>>' will be considered two separate '>'
12083 if (!cp_parser_error_occurred (parser
)
12084 && cxx_dialect
== cxx98
12085 && cp_lexer_next_token_is (parser
->lexer
, CPP_RSHIFT
))
12087 maybe_type_id
= true;
12088 cp_parser_abort_tentative_parse (parser
);
12092 /* If the next token isn't a `,' or a `>', then this argument wasn't
12093 really finished. This means that the argument is not a valid
12095 if (!cp_parser_next_token_ends_template_argument_p (parser
))
12096 cp_parser_error (parser
, "expected template-argument");
12097 /* If that worked, we're done. */
12098 if (cp_parser_parse_definitely (parser
))
12101 /* We're still not sure what the argument will be. */
12102 cp_parser_parse_tentatively (parser
);
12103 /* Try a template. */
12104 argument_start_token
= cp_lexer_peek_token (parser
->lexer
);
12105 argument
= cp_parser_id_expression (parser
,
12106 /*template_keyword_p=*/false,
12107 /*check_dependency_p=*/true,
12109 /*declarator_p=*/false,
12110 /*optional_p=*/false);
12111 /* If the next token isn't a `,' or a `>', then this argument wasn't
12112 really finished. */
12113 if (!cp_parser_next_token_ends_template_argument_p (parser
))
12114 cp_parser_error (parser
, "expected template-argument");
12115 if (!cp_parser_error_occurred (parser
))
12117 /* Figure out what is being referred to. If the id-expression
12118 was for a class template specialization, then we will have a
12119 TYPE_DECL at this point. There is no need to do name lookup
12120 at this point in that case. */
12121 if (TREE_CODE (argument
) != TYPE_DECL
)
12122 argument
= cp_parser_lookup_name (parser
, argument
,
12124 /*is_template=*/template_p
,
12125 /*is_namespace=*/false,
12126 /*check_dependency=*/true,
12127 /*ambiguous_decls=*/NULL
,
12128 argument_start_token
->location
);
12129 if (TREE_CODE (argument
) != TEMPLATE_DECL
12130 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
12131 cp_parser_error (parser
, "expected template-name");
12133 if (cp_parser_parse_definitely (parser
))
12135 /* It must be a non-type argument. There permitted cases are given
12136 in [temp.arg.nontype]:
12138 -- an integral constant-expression of integral or enumeration
12141 -- the name of a non-type template-parameter; or
12143 -- the name of an object or function with external linkage...
12145 -- the address of an object or function with external linkage...
12147 -- a pointer to member... */
12148 /* Look for a non-type template parameter. */
12149 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
12151 cp_parser_parse_tentatively (parser
);
12152 argument
= cp_parser_primary_expression (parser
,
12153 /*address_p=*/false,
12155 /*template_arg_p=*/true,
12157 if (TREE_CODE (argument
) != TEMPLATE_PARM_INDEX
12158 || !cp_parser_next_token_ends_template_argument_p (parser
))
12159 cp_parser_simulate_error (parser
);
12160 if (cp_parser_parse_definitely (parser
))
12164 /* If the next token is "&", the argument must be the address of an
12165 object or function with external linkage. */
12166 address_p
= cp_lexer_next_token_is (parser
->lexer
, CPP_AND
);
12168 cp_lexer_consume_token (parser
->lexer
);
12169 /* See if we might have an id-expression. */
12170 token
= cp_lexer_peek_token (parser
->lexer
);
12171 if (token
->type
== CPP_NAME
12172 || token
->keyword
== RID_OPERATOR
12173 || token
->type
== CPP_SCOPE
12174 || token
->type
== CPP_TEMPLATE_ID
12175 || token
->type
== CPP_NESTED_NAME_SPECIFIER
)
12177 cp_parser_parse_tentatively (parser
);
12178 argument
= cp_parser_primary_expression (parser
,
12181 /*template_arg_p=*/true,
12183 if (cp_parser_error_occurred (parser
)
12184 || !cp_parser_next_token_ends_template_argument_p (parser
))
12185 cp_parser_abort_tentative_parse (parser
);
12190 if (TREE_CODE (argument
) == INDIRECT_REF
)
12192 gcc_assert (REFERENCE_REF_P (argument
));
12193 argument
= TREE_OPERAND (argument
, 0);
12196 /* If we're in a template, we represent a qualified-id referring
12197 to a static data member as a SCOPE_REF even if the scope isn't
12198 dependent so that we can check access control later. */
12200 if (TREE_CODE (probe
) == SCOPE_REF
)
12201 probe
= TREE_OPERAND (probe
, 1);
12202 if (TREE_CODE (probe
) == VAR_DECL
)
12204 /* A variable without external linkage might still be a
12205 valid constant-expression, so no error is issued here
12206 if the external-linkage check fails. */
12207 if (!address_p
&& !DECL_EXTERNAL_LINKAGE_P (probe
))
12208 cp_parser_simulate_error (parser
);
12210 else if (is_overloaded_fn (argument
))
12211 /* All overloaded functions are allowed; if the external
12212 linkage test does not pass, an error will be issued
12216 && (TREE_CODE (argument
) == OFFSET_REF
12217 || TREE_CODE (argument
) == SCOPE_REF
))
12218 /* A pointer-to-member. */
12220 else if (TREE_CODE (argument
) == TEMPLATE_PARM_INDEX
)
12223 cp_parser_simulate_error (parser
);
12225 if (cp_parser_parse_definitely (parser
))
12228 argument
= build_x_unary_op (ADDR_EXPR
, argument
,
12229 tf_warning_or_error
);
12234 /* If the argument started with "&", there are no other valid
12235 alternatives at this point. */
12238 cp_parser_error (parser
, "invalid non-type template argument");
12239 return error_mark_node
;
12242 /* If the argument wasn't successfully parsed as a type-id followed
12243 by '>>', the argument can only be a constant expression now.
12244 Otherwise, we try parsing the constant-expression tentatively,
12245 because the argument could really be a type-id. */
12247 cp_parser_parse_tentatively (parser
);
12248 argument
= cp_parser_constant_expression (parser
,
12249 /*allow_non_constant_p=*/false,
12250 /*non_constant_p=*/NULL
);
12251 argument
= fold_non_dependent_expr (argument
);
12252 if (!maybe_type_id
)
12254 if (!cp_parser_next_token_ends_template_argument_p (parser
))
12255 cp_parser_error (parser
, "expected template-argument");
12256 if (cp_parser_parse_definitely (parser
))
12258 /* We did our best to parse the argument as a non type-id, but that
12259 was the only alternative that matched (albeit with a '>' after
12260 it). We can assume it's just a typo from the user, and a
12261 diagnostic will then be issued. */
12262 return cp_parser_template_type_arg (parser
);
12265 /* Parse an explicit-instantiation.
12267 explicit-instantiation:
12268 template declaration
12270 Although the standard says `declaration', what it really means is:
12272 explicit-instantiation:
12273 template decl-specifier-seq [opt] declarator [opt] ;
12275 Things like `template int S<int>::i = 5, int S<double>::j;' are not
12276 supposed to be allowed. A defect report has been filed about this
12281 explicit-instantiation:
12282 storage-class-specifier template
12283 decl-specifier-seq [opt] declarator [opt] ;
12284 function-specifier template
12285 decl-specifier-seq [opt] declarator [opt] ; */
12288 cp_parser_explicit_instantiation (cp_parser
* parser
)
12290 int declares_class_or_enum
;
12291 cp_decl_specifier_seq decl_specifiers
;
12292 tree extension_specifier
= NULL_TREE
;
12294 /* Look for an (optional) storage-class-specifier or
12295 function-specifier. */
12296 if (cp_parser_allow_gnu_extensions_p (parser
))
12298 extension_specifier
12299 = cp_parser_storage_class_specifier_opt (parser
);
12300 if (!extension_specifier
)
12301 extension_specifier
12302 = cp_parser_function_specifier_opt (parser
,
12303 /*decl_specs=*/NULL
);
12306 /* Look for the `template' keyword. */
12307 cp_parser_require_keyword (parser
, RID_TEMPLATE
, RT_TEMPLATE
);
12308 /* Let the front end know that we are processing an explicit
12310 begin_explicit_instantiation ();
12311 /* [temp.explicit] says that we are supposed to ignore access
12312 control while processing explicit instantiation directives. */
12313 push_deferring_access_checks (dk_no_check
);
12314 /* Parse a decl-specifier-seq. */
12315 cp_parser_decl_specifier_seq (parser
,
12316 CP_PARSER_FLAGS_OPTIONAL
,
12318 &declares_class_or_enum
);
12319 /* If there was exactly one decl-specifier, and it declared a class,
12320 and there's no declarator, then we have an explicit type
12322 if (declares_class_or_enum
&& cp_parser_declares_only_class_p (parser
))
12326 type
= check_tag_decl (&decl_specifiers
);
12327 /* Turn access control back on for names used during
12328 template instantiation. */
12329 pop_deferring_access_checks ();
12331 do_type_instantiation (type
, extension_specifier
,
12332 /*complain=*/tf_error
);
12336 cp_declarator
*declarator
;
12339 /* Parse the declarator. */
12341 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
12342 /*ctor_dtor_or_conv_p=*/NULL
,
12343 /*parenthesized_p=*/NULL
,
12344 /*member_p=*/false);
12345 if (declares_class_or_enum
& 2)
12346 cp_parser_check_for_definition_in_return_type (declarator
,
12347 decl_specifiers
.type
,
12348 decl_specifiers
.type_location
);
12349 if (declarator
!= cp_error_declarator
)
12351 if (decl_specifiers
.specs
[(int)ds_inline
])
12352 permerror (input_location
, "explicit instantiation shall not use"
12353 " %<inline%> specifier");
12354 if (decl_specifiers
.specs
[(int)ds_constexpr
])
12355 permerror (input_location
, "explicit instantiation shall not use"
12356 " %<constexpr%> specifier");
12358 decl
= grokdeclarator (declarator
, &decl_specifiers
,
12359 NORMAL
, 0, &decl_specifiers
.attributes
);
12360 /* Turn access control back on for names used during
12361 template instantiation. */
12362 pop_deferring_access_checks ();
12363 /* Do the explicit instantiation. */
12364 do_decl_instantiation (decl
, extension_specifier
);
12368 pop_deferring_access_checks ();
12369 /* Skip the body of the explicit instantiation. */
12370 cp_parser_skip_to_end_of_statement (parser
);
12373 /* We're done with the instantiation. */
12374 end_explicit_instantiation ();
12376 cp_parser_consume_semicolon_at_end_of_statement (parser
);
12379 /* Parse an explicit-specialization.
12381 explicit-specialization:
12382 template < > declaration
12384 Although the standard says `declaration', what it really means is:
12386 explicit-specialization:
12387 template <> decl-specifier [opt] init-declarator [opt] ;
12388 template <> function-definition
12389 template <> explicit-specialization
12390 template <> template-declaration */
12393 cp_parser_explicit_specialization (cp_parser
* parser
)
12395 bool need_lang_pop
;
12396 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
12398 /* Look for the `template' keyword. */
12399 cp_parser_require_keyword (parser
, RID_TEMPLATE
, RT_TEMPLATE
);
12400 /* Look for the `<'. */
12401 cp_parser_require (parser
, CPP_LESS
, RT_LESS
);
12402 /* Look for the `>'. */
12403 cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
);
12404 /* We have processed another parameter list. */
12405 ++parser
->num_template_parameter_lists
;
12408 A template ... explicit specialization ... shall not have C
12410 if (current_lang_name
== lang_name_c
)
12412 error_at (token
->location
, "template specialization with C linkage");
12413 /* Give it C++ linkage to avoid confusing other parts of the
12415 push_lang_context (lang_name_cplusplus
);
12416 need_lang_pop
= true;
12419 need_lang_pop
= false;
12420 /* Let the front end know that we are beginning a specialization. */
12421 if (!begin_specialization ())
12423 end_specialization ();
12427 /* If the next keyword is `template', we need to figure out whether
12428 or not we're looking a template-declaration. */
12429 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
12431 if (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_LESS
12432 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
!= CPP_GREATER
)
12433 cp_parser_template_declaration_after_export (parser
,
12434 /*member_p=*/false);
12436 cp_parser_explicit_specialization (parser
);
12439 /* Parse the dependent declaration. */
12440 cp_parser_single_declaration (parser
,
12442 /*member_p=*/false,
12443 /*explicit_specialization_p=*/true,
12444 /*friend_p=*/NULL
);
12445 /* We're done with the specialization. */
12446 end_specialization ();
12447 /* For the erroneous case of a template with C linkage, we pushed an
12448 implicit C++ linkage scope; exit that scope now. */
12450 pop_lang_context ();
12451 /* We're done with this parameter list. */
12452 --parser
->num_template_parameter_lists
;
12455 /* Parse a type-specifier.
12458 simple-type-specifier
12461 elaborated-type-specifier
12469 Returns a representation of the type-specifier. For a
12470 class-specifier, enum-specifier, or elaborated-type-specifier, a
12471 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
12473 The parser flags FLAGS is used to control type-specifier parsing.
12475 If IS_DECLARATION is TRUE, then this type-specifier is appearing
12476 in a decl-specifier-seq.
12478 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
12479 class-specifier, enum-specifier, or elaborated-type-specifier, then
12480 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
12481 if a type is declared; 2 if it is defined. Otherwise, it is set to
12484 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
12485 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
12486 is set to FALSE. */
12489 cp_parser_type_specifier (cp_parser
* parser
,
12490 cp_parser_flags flags
,
12491 cp_decl_specifier_seq
*decl_specs
,
12492 bool is_declaration
,
12493 int* declares_class_or_enum
,
12494 bool* is_cv_qualifier
)
12496 tree type_spec
= NULL_TREE
;
12499 cp_decl_spec ds
= ds_last
;
12501 /* Assume this type-specifier does not declare a new type. */
12502 if (declares_class_or_enum
)
12503 *declares_class_or_enum
= 0;
12504 /* And that it does not specify a cv-qualifier. */
12505 if (is_cv_qualifier
)
12506 *is_cv_qualifier
= false;
12507 /* Peek at the next token. */
12508 token
= cp_lexer_peek_token (parser
->lexer
);
12510 /* If we're looking at a keyword, we can use that to guide the
12511 production we choose. */
12512 keyword
= token
->keyword
;
12516 if ((flags
& CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS
))
12517 goto elaborated_type_specifier
;
12519 /* Look for the enum-specifier. */
12520 type_spec
= cp_parser_enum_specifier (parser
);
12521 /* If that worked, we're done. */
12524 if (declares_class_or_enum
)
12525 *declares_class_or_enum
= 2;
12527 cp_parser_set_decl_spec_type (decl_specs
,
12530 /*user_defined_p=*/true);
12534 goto elaborated_type_specifier
;
12536 /* Any of these indicate either a class-specifier, or an
12537 elaborated-type-specifier. */
12541 if ((flags
& CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS
))
12542 goto elaborated_type_specifier
;
12544 /* Parse tentatively so that we can back up if we don't find a
12545 class-specifier. */
12546 cp_parser_parse_tentatively (parser
);
12547 /* Look for the class-specifier. */
12548 type_spec
= cp_parser_class_specifier (parser
);
12549 invoke_plugin_callbacks (PLUGIN_FINISH_TYPE
, type_spec
);
12550 /* If that worked, we're done. */
12551 if (cp_parser_parse_definitely (parser
))
12553 if (declares_class_or_enum
)
12554 *declares_class_or_enum
= 2;
12556 cp_parser_set_decl_spec_type (decl_specs
,
12559 /*user_defined_p=*/true);
12563 /* Fall through. */
12564 elaborated_type_specifier
:
12565 /* We're declaring (not defining) a class or enum. */
12566 if (declares_class_or_enum
)
12567 *declares_class_or_enum
= 1;
12569 /* Fall through. */
12571 /* Look for an elaborated-type-specifier. */
12573 = (cp_parser_elaborated_type_specifier
12575 decl_specs
&& decl_specs
->specs
[(int) ds_friend
],
12578 cp_parser_set_decl_spec_type (decl_specs
,
12581 /*user_defined_p=*/true);
12586 if (is_cv_qualifier
)
12587 *is_cv_qualifier
= true;
12592 if (is_cv_qualifier
)
12593 *is_cv_qualifier
= true;
12598 if (is_cv_qualifier
)
12599 *is_cv_qualifier
= true;
12603 /* The `__complex__' keyword is a GNU extension. */
12611 /* Handle simple keywords. */
12616 ++decl_specs
->specs
[(int)ds
];
12617 decl_specs
->any_specifiers_p
= true;
12619 return cp_lexer_consume_token (parser
->lexer
)->u
.value
;
12622 /* If we do not already have a type-specifier, assume we are looking
12623 at a simple-type-specifier. */
12624 type_spec
= cp_parser_simple_type_specifier (parser
,
12628 /* If we didn't find a type-specifier, and a type-specifier was not
12629 optional in this context, issue an error message. */
12630 if (!type_spec
&& !(flags
& CP_PARSER_FLAGS_OPTIONAL
))
12632 cp_parser_error (parser
, "expected type specifier");
12633 return error_mark_node
;
12639 /* Parse a simple-type-specifier.
12641 simple-type-specifier:
12642 :: [opt] nested-name-specifier [opt] type-name
12643 :: [opt] nested-name-specifier template template-id
12658 simple-type-specifier:
12660 decltype ( expression )
12666 simple-type-specifier:
12668 __typeof__ unary-expression
12669 __typeof__ ( type-id )
12671 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
12672 appropriately updated. */
12675 cp_parser_simple_type_specifier (cp_parser
* parser
,
12676 cp_decl_specifier_seq
*decl_specs
,
12677 cp_parser_flags flags
)
12679 tree type
= NULL_TREE
;
12682 /* Peek at the next token. */
12683 token
= cp_lexer_peek_token (parser
->lexer
);
12685 /* If we're looking at a keyword, things are easy. */
12686 switch (token
->keyword
)
12690 decl_specs
->explicit_char_p
= true;
12691 type
= char_type_node
;
12694 type
= char16_type_node
;
12697 type
= char32_type_node
;
12700 type
= wchar_type_node
;
12703 type
= boolean_type_node
;
12707 ++decl_specs
->specs
[(int) ds_short
];
12708 type
= short_integer_type_node
;
12712 decl_specs
->explicit_int_p
= true;
12713 type
= integer_type_node
;
12716 if (!int128_integer_type_node
)
12719 decl_specs
->explicit_int128_p
= true;
12720 type
= int128_integer_type_node
;
12724 ++decl_specs
->specs
[(int) ds_long
];
12725 type
= long_integer_type_node
;
12729 ++decl_specs
->specs
[(int) ds_signed
];
12730 type
= integer_type_node
;
12734 ++decl_specs
->specs
[(int) ds_unsigned
];
12735 type
= unsigned_type_node
;
12738 type
= float_type_node
;
12741 type
= double_type_node
;
12744 type
= void_type_node
;
12748 maybe_warn_cpp0x (CPP0X_AUTO
);
12749 type
= make_auto ();
12753 /* Parse the `decltype' type. */
12754 type
= cp_parser_decltype (parser
);
12757 cp_parser_set_decl_spec_type (decl_specs
, type
,
12759 /*user_defined_p=*/true);
12764 /* Consume the `typeof' token. */
12765 cp_lexer_consume_token (parser
->lexer
);
12766 /* Parse the operand to `typeof'. */
12767 type
= cp_parser_sizeof_operand (parser
, RID_TYPEOF
);
12768 /* If it is not already a TYPE, take its type. */
12769 if (!TYPE_P (type
))
12770 type
= finish_typeof (type
);
12773 cp_parser_set_decl_spec_type (decl_specs
, type
,
12775 /*user_defined_p=*/true);
12783 /* If the type-specifier was for a built-in type, we're done. */
12786 /* Record the type. */
12788 && (token
->keyword
!= RID_SIGNED
12789 && token
->keyword
!= RID_UNSIGNED
12790 && token
->keyword
!= RID_SHORT
12791 && token
->keyword
!= RID_LONG
))
12792 cp_parser_set_decl_spec_type (decl_specs
,
12795 /*user_defined=*/false);
12797 decl_specs
->any_specifiers_p
= true;
12799 /* Consume the token. */
12800 cp_lexer_consume_token (parser
->lexer
);
12802 /* There is no valid C++ program where a non-template type is
12803 followed by a "<". That usually indicates that the user thought
12804 that the type was a template. */
12805 cp_parser_check_for_invalid_template_id (parser
, type
, token
->location
);
12807 return TYPE_NAME (type
);
12810 /* The type-specifier must be a user-defined type. */
12811 if (!(flags
& CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
))
12816 /* Don't gobble tokens or issue error messages if this is an
12817 optional type-specifier. */
12818 if (flags
& CP_PARSER_FLAGS_OPTIONAL
)
12819 cp_parser_parse_tentatively (parser
);
12821 /* Look for the optional `::' operator. */
12823 = (cp_parser_global_scope_opt (parser
,
12824 /*current_scope_valid_p=*/false)
12826 /* Look for the nested-name specifier. */
12828 = (cp_parser_nested_name_specifier_opt (parser
,
12829 /*typename_keyword_p=*/false,
12830 /*check_dependency_p=*/true,
12832 /*is_declaration=*/false)
12834 token
= cp_lexer_peek_token (parser
->lexer
);
12835 /* If we have seen a nested-name-specifier, and the next token
12836 is `template', then we are using the template-id production. */
12838 && cp_parser_optional_template_keyword (parser
))
12840 /* Look for the template-id. */
12841 type
= cp_parser_template_id (parser
,
12842 /*template_keyword_p=*/true,
12843 /*check_dependency_p=*/true,
12844 /*is_declaration=*/false);
12845 /* If the template-id did not name a type, we are out of
12847 if (TREE_CODE (type
) != TYPE_DECL
)
12849 cp_parser_error (parser
, "expected template-id for type");
12853 /* Otherwise, look for a type-name. */
12855 type
= cp_parser_type_name (parser
);
12856 /* Keep track of all name-lookups performed in class scopes. */
12860 && TREE_CODE (type
) == TYPE_DECL
12861 && TREE_CODE (DECL_NAME (type
)) == IDENTIFIER_NODE
)
12862 maybe_note_name_used_in_class (DECL_NAME (type
), type
);
12863 /* If it didn't work out, we don't have a TYPE. */
12864 if ((flags
& CP_PARSER_FLAGS_OPTIONAL
)
12865 && !cp_parser_parse_definitely (parser
))
12867 if (type
&& decl_specs
)
12868 cp_parser_set_decl_spec_type (decl_specs
, type
,
12870 /*user_defined=*/true);
12873 /* If we didn't get a type-name, issue an error message. */
12874 if (!type
&& !(flags
& CP_PARSER_FLAGS_OPTIONAL
))
12876 cp_parser_error (parser
, "expected type-name");
12877 return error_mark_node
;
12880 if (type
&& type
!= error_mark_node
)
12882 /* See if TYPE is an Objective-C type, and if so, parse and
12883 accept any protocol references following it. Do this before
12884 the cp_parser_check_for_invalid_template_id() call, because
12885 Objective-C types can be followed by '<...>' which would
12886 enclose protocol names rather than template arguments, and so
12887 everything is fine. */
12888 if (c_dialect_objc () && !parser
->scope
12889 && (objc_is_id (type
) || objc_is_class_name (type
)))
12891 tree protos
= cp_parser_objc_protocol_refs_opt (parser
);
12892 tree qual_type
= objc_get_protocol_qualified_type (type
, protos
);
12894 /* Clobber the "unqualified" type previously entered into
12895 DECL_SPECS with the new, improved protocol-qualified version. */
12897 decl_specs
->type
= qual_type
;
12902 /* There is no valid C++ program where a non-template type is
12903 followed by a "<". That usually indicates that the user
12904 thought that the type was a template. */
12905 cp_parser_check_for_invalid_template_id (parser
, TREE_TYPE (type
),
12912 /* Parse a type-name.
12925 Returns a TYPE_DECL for the type. */
12928 cp_parser_type_name (cp_parser
* parser
)
12932 /* We can't know yet whether it is a class-name or not. */
12933 cp_parser_parse_tentatively (parser
);
12934 /* Try a class-name. */
12935 type_decl
= cp_parser_class_name (parser
,
12936 /*typename_keyword_p=*/false,
12937 /*template_keyword_p=*/false,
12939 /*check_dependency_p=*/true,
12940 /*class_head_p=*/false,
12941 /*is_declaration=*/false);
12942 /* If it's not a class-name, keep looking. */
12943 if (!cp_parser_parse_definitely (parser
))
12945 /* It must be a typedef-name or an enum-name. */
12946 return cp_parser_nonclass_name (parser
);
12952 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
12960 Returns a TYPE_DECL for the type. */
12963 cp_parser_nonclass_name (cp_parser
* parser
)
12968 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
12969 identifier
= cp_parser_identifier (parser
);
12970 if (identifier
== error_mark_node
)
12971 return error_mark_node
;
12973 /* Look up the type-name. */
12974 type_decl
= cp_parser_lookup_name_simple (parser
, identifier
, token
->location
);
12976 if (TREE_CODE (type_decl
) != TYPE_DECL
12977 && (objc_is_id (identifier
) || objc_is_class_name (identifier
)))
12979 /* See if this is an Objective-C type. */
12980 tree protos
= cp_parser_objc_protocol_refs_opt (parser
);
12981 tree type
= objc_get_protocol_qualified_type (identifier
, protos
);
12983 type_decl
= TYPE_NAME (type
);
12986 /* Issue an error if we did not find a type-name. */
12987 if (TREE_CODE (type_decl
) != TYPE_DECL
12988 /* In Objective-C, we have the complication that class names are
12989 normally type names and start declarations (eg, the
12990 "NSObject" in "NSObject *object;"), but can be used in an
12991 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
12992 is an expression. So, a classname followed by a dot is not a
12993 valid type-name. */
12994 || (objc_is_class_name (TREE_TYPE (type_decl
))
12995 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_DOT
))
12997 if (!cp_parser_simulate_error (parser
))
12998 cp_parser_name_lookup_error (parser
, identifier
, type_decl
,
12999 NLE_TYPE
, token
->location
);
13000 return error_mark_node
;
13002 /* Remember that the name was used in the definition of the
13003 current class so that we can check later to see if the
13004 meaning would have been different after the class was
13005 entirely defined. */
13006 else if (type_decl
!= error_mark_node
13008 maybe_note_name_used_in_class (identifier
, type_decl
);
13013 /* Parse an elaborated-type-specifier. Note that the grammar given
13014 here incorporates the resolution to DR68.
13016 elaborated-type-specifier:
13017 class-key :: [opt] nested-name-specifier [opt] identifier
13018 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
13019 enum-key :: [opt] nested-name-specifier [opt] identifier
13020 typename :: [opt] nested-name-specifier identifier
13021 typename :: [opt] nested-name-specifier template [opt]
13026 elaborated-type-specifier:
13027 class-key attributes :: [opt] nested-name-specifier [opt] identifier
13028 class-key attributes :: [opt] nested-name-specifier [opt]
13029 template [opt] template-id
13030 enum attributes :: [opt] nested-name-specifier [opt] identifier
13032 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
13033 declared `friend'. If IS_DECLARATION is TRUE, then this
13034 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
13035 something is being declared.
13037 Returns the TYPE specified. */
13040 cp_parser_elaborated_type_specifier (cp_parser
* parser
,
13042 bool is_declaration
)
13044 enum tag_types tag_type
;
13046 tree type
= NULL_TREE
;
13047 tree attributes
= NULL_TREE
;
13049 cp_token
*token
= NULL
;
13051 /* See if we're looking at the `enum' keyword. */
13052 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ENUM
))
13054 /* Consume the `enum' token. */
13055 cp_lexer_consume_token (parser
->lexer
);
13056 /* Remember that it's an enumeration type. */
13057 tag_type
= enum_type
;
13058 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
13059 enums) is used here. */
13060 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_CLASS
)
13061 || cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STRUCT
))
13063 pedwarn (input_location
, 0, "elaborated-type-specifier "
13064 "for a scoped enum must not use the %<%D%> keyword",
13065 cp_lexer_peek_token (parser
->lexer
)->u
.value
);
13066 /* Consume the `struct' or `class' and parse it anyway. */
13067 cp_lexer_consume_token (parser
->lexer
);
13069 /* Parse the attributes. */
13070 attributes
= cp_parser_attributes_opt (parser
);
13072 /* Or, it might be `typename'. */
13073 else if (cp_lexer_next_token_is_keyword (parser
->lexer
,
13076 /* Consume the `typename' token. */
13077 cp_lexer_consume_token (parser
->lexer
);
13078 /* Remember that it's a `typename' type. */
13079 tag_type
= typename_type
;
13081 /* Otherwise it must be a class-key. */
13084 tag_type
= cp_parser_class_key (parser
);
13085 if (tag_type
== none_type
)
13086 return error_mark_node
;
13087 /* Parse the attributes. */
13088 attributes
= cp_parser_attributes_opt (parser
);
13091 /* Look for the `::' operator. */
13092 globalscope
= cp_parser_global_scope_opt (parser
,
13093 /*current_scope_valid_p=*/false);
13094 /* Look for the nested-name-specifier. */
13095 if (tag_type
== typename_type
&& !globalscope
)
13097 if (!cp_parser_nested_name_specifier (parser
,
13098 /*typename_keyword_p=*/true,
13099 /*check_dependency_p=*/true,
13102 return error_mark_node
;
13105 /* Even though `typename' is not present, the proposed resolution
13106 to Core Issue 180 says that in `class A<T>::B', `B' should be
13107 considered a type-name, even if `A<T>' is dependent. */
13108 cp_parser_nested_name_specifier_opt (parser
,
13109 /*typename_keyword_p=*/true,
13110 /*check_dependency_p=*/true,
13113 /* For everything but enumeration types, consider a template-id.
13114 For an enumeration type, consider only a plain identifier. */
13115 if (tag_type
!= enum_type
)
13117 bool template_p
= false;
13120 /* Allow the `template' keyword. */
13121 template_p
= cp_parser_optional_template_keyword (parser
);
13122 /* If we didn't see `template', we don't know if there's a
13123 template-id or not. */
13125 cp_parser_parse_tentatively (parser
);
13126 /* Parse the template-id. */
13127 token
= cp_lexer_peek_token (parser
->lexer
);
13128 decl
= cp_parser_template_id (parser
, template_p
,
13129 /*check_dependency_p=*/true,
13131 /* If we didn't find a template-id, look for an ordinary
13133 if (!template_p
&& !cp_parser_parse_definitely (parser
))
13135 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
13136 in effect, then we must assume that, upon instantiation, the
13137 template will correspond to a class. */
13138 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
13139 && tag_type
== typename_type
)
13140 type
= make_typename_type (parser
->scope
, decl
,
13142 /*complain=*/tf_error
);
13143 /* If the `typename' keyword is in effect and DECL is not a type
13144 decl. Then type is non existant. */
13145 else if (tag_type
== typename_type
&& TREE_CODE (decl
) != TYPE_DECL
)
13148 type
= TREE_TYPE (decl
);
13153 token
= cp_lexer_peek_token (parser
->lexer
);
13154 identifier
= cp_parser_identifier (parser
);
13156 if (identifier
== error_mark_node
)
13158 parser
->scope
= NULL_TREE
;
13159 return error_mark_node
;
13162 /* For a `typename', we needn't call xref_tag. */
13163 if (tag_type
== typename_type
13164 && TREE_CODE (parser
->scope
) != NAMESPACE_DECL
)
13165 return cp_parser_make_typename_type (parser
, parser
->scope
,
13168 /* Look up a qualified name in the usual way. */
13172 tree ambiguous_decls
;
13174 decl
= cp_parser_lookup_name (parser
, identifier
,
13176 /*is_template=*/false,
13177 /*is_namespace=*/false,
13178 /*check_dependency=*/true,
13182 /* If the lookup was ambiguous, an error will already have been
13184 if (ambiguous_decls
)
13185 return error_mark_node
;
13187 /* If we are parsing friend declaration, DECL may be a
13188 TEMPLATE_DECL tree node here. However, we need to check
13189 whether this TEMPLATE_DECL results in valid code. Consider
13190 the following example:
13193 template <class T> class C {};
13196 template <class T> friend class N::C; // #1, valid code
13198 template <class T> class Y {
13199 friend class N::C; // #2, invalid code
13202 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
13203 name lookup of `N::C'. We see that friend declaration must
13204 be template for the code to be valid. Note that
13205 processing_template_decl does not work here since it is
13206 always 1 for the above two cases. */
13208 decl
= (cp_parser_maybe_treat_template_as_class
13209 (decl
, /*tag_name_p=*/is_friend
13210 && parser
->num_template_parameter_lists
));
13212 if (TREE_CODE (decl
) != TYPE_DECL
)
13214 cp_parser_diagnose_invalid_type_name (parser
,
13218 return error_mark_node
;
13221 if (TREE_CODE (TREE_TYPE (decl
)) != TYPENAME_TYPE
)
13223 bool allow_template
= (parser
->num_template_parameter_lists
13224 || DECL_SELF_REFERENCE_P (decl
));
13225 type
= check_elaborated_type_specifier (tag_type
, decl
,
13228 if (type
== error_mark_node
)
13229 return error_mark_node
;
13232 /* Forward declarations of nested types, such as
13237 are invalid unless all components preceding the final '::'
13238 are complete. If all enclosing types are complete, these
13239 declarations become merely pointless.
13241 Invalid forward declarations of nested types are errors
13242 caught elsewhere in parsing. Those that are pointless arrive
13245 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
13246 && !is_friend
&& !processing_explicit_instantiation
)
13247 warning (0, "declaration %qD does not declare anything", decl
);
13249 type
= TREE_TYPE (decl
);
13253 /* An elaborated-type-specifier sometimes introduces a new type and
13254 sometimes names an existing type. Normally, the rule is that it
13255 introduces a new type only if there is not an existing type of
13256 the same name already in scope. For example, given:
13259 void f() { struct S s; }
13261 the `struct S' in the body of `f' is the same `struct S' as in
13262 the global scope; the existing definition is used. However, if
13263 there were no global declaration, this would introduce a new
13264 local class named `S'.
13266 An exception to this rule applies to the following code:
13268 namespace N { struct S; }
13270 Here, the elaborated-type-specifier names a new type
13271 unconditionally; even if there is already an `S' in the
13272 containing scope this declaration names a new type.
13273 This exception only applies if the elaborated-type-specifier
13274 forms the complete declaration:
13278 A declaration consisting solely of `class-key identifier ;' is
13279 either a redeclaration of the name in the current scope or a
13280 forward declaration of the identifier as a class name. It
13281 introduces the name into the current scope.
13283 We are in this situation precisely when the next token is a `;'.
13285 An exception to the exception is that a `friend' declaration does
13286 *not* name a new type; i.e., given:
13288 struct S { friend struct T; };
13290 `T' is not a new type in the scope of `S'.
13292 Also, `new struct S' or `sizeof (struct S)' never results in the
13293 definition of a new type; a new type can only be declared in a
13294 declaration context. */
13300 /* Friends have special name lookup rules. */
13301 ts
= ts_within_enclosing_non_class
;
13302 else if (is_declaration
13303 && cp_lexer_next_token_is (parser
->lexer
,
13305 /* This is a `class-key identifier ;' */
13311 (parser
->num_template_parameter_lists
13312 && (cp_parser_next_token_starts_class_definition_p (parser
)
13313 || cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)));
13314 /* An unqualified name was used to reference this type, so
13315 there were no qualifying templates. */
13316 if (!cp_parser_check_template_parameters (parser
,
13317 /*num_templates=*/0,
13319 /*declarator=*/NULL
))
13320 return error_mark_node
;
13321 type
= xref_tag (tag_type
, identifier
, ts
, template_p
);
13325 if (type
== error_mark_node
)
13326 return error_mark_node
;
13328 /* Allow attributes on forward declarations of classes. */
13331 if (TREE_CODE (type
) == TYPENAME_TYPE
)
13332 warning (OPT_Wattributes
,
13333 "attributes ignored on uninstantiated type");
13334 else if (tag_type
!= enum_type
&& CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
13335 && ! processing_explicit_instantiation
)
13336 warning (OPT_Wattributes
,
13337 "attributes ignored on template instantiation");
13338 else if (is_declaration
&& cp_parser_declares_only_class_p (parser
))
13339 cplus_decl_attributes (&type
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
13341 warning (OPT_Wattributes
,
13342 "attributes ignored on elaborated-type-specifier that is not a forward declaration");
13345 if (tag_type
!= enum_type
)
13346 cp_parser_check_class_key (tag_type
, type
);
13348 /* A "<" cannot follow an elaborated type specifier. If that
13349 happens, the user was probably trying to form a template-id. */
13350 cp_parser_check_for_invalid_template_id (parser
, type
, token
->location
);
13355 /* Parse an enum-specifier.
13358 enum-head { enumerator-list [opt] }
13361 enum-key identifier [opt] enum-base [opt]
13362 enum-key nested-name-specifier identifier enum-base [opt]
13367 enum struct [C++0x]
13370 : type-specifier-seq
13372 opaque-enum-specifier:
13373 enum-key identifier enum-base [opt] ;
13376 enum-key attributes[opt] identifier [opt] enum-base [opt]
13377 { enumerator-list [opt] }attributes[opt]
13379 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
13380 if the token stream isn't an enum-specifier after all. */
13383 cp_parser_enum_specifier (cp_parser
* parser
)
13386 tree type
= NULL_TREE
;
13388 tree nested_name_specifier
= NULL_TREE
;
13390 bool scoped_enum_p
= false;
13391 bool has_underlying_type
= false;
13392 bool nested_being_defined
= false;
13393 bool new_value_list
= false;
13394 bool is_new_type
= false;
13395 bool is_anonymous
= false;
13396 tree underlying_type
= NULL_TREE
;
13397 cp_token
*type_start_token
= NULL
;
13398 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
13400 parser
->colon_corrects_to_scope_p
= false;
13402 /* Parse tentatively so that we can back up if we don't find a
13404 cp_parser_parse_tentatively (parser
);
13406 /* Caller guarantees that the current token is 'enum', an identifier
13407 possibly follows, and the token after that is an opening brace.
13408 If we don't have an identifier, fabricate an anonymous name for
13409 the enumeration being defined. */
13410 cp_lexer_consume_token (parser
->lexer
);
13412 /* Parse the "class" or "struct", which indicates a scoped
13413 enumeration type in C++0x. */
13414 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_CLASS
)
13415 || cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STRUCT
))
13417 if (cxx_dialect
< cxx0x
)
13418 maybe_warn_cpp0x (CPP0X_SCOPED_ENUMS
);
13420 /* Consume the `struct' or `class' token. */
13421 cp_lexer_consume_token (parser
->lexer
);
13423 scoped_enum_p
= true;
13426 attributes
= cp_parser_attributes_opt (parser
);
13428 /* Clear the qualification. */
13429 parser
->scope
= NULL_TREE
;
13430 parser
->qualifying_scope
= NULL_TREE
;
13431 parser
->object_scope
= NULL_TREE
;
13433 /* Figure out in what scope the declaration is being placed. */
13434 prev_scope
= current_scope ();
13436 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
13438 push_deferring_access_checks (dk_no_check
);
13439 nested_name_specifier
13440 = cp_parser_nested_name_specifier_opt (parser
,
13441 /*typename_keyword_p=*/true,
13442 /*check_dependency_p=*/false,
13444 /*is_declaration=*/false);
13446 if (nested_name_specifier
)
13450 identifier
= cp_parser_identifier (parser
);
13451 name
= cp_parser_lookup_name (parser
, identifier
,
13453 /*is_template=*/false,
13454 /*is_namespace=*/false,
13455 /*check_dependency=*/true,
13456 /*ambiguous_decls=*/NULL
,
13460 type
= TREE_TYPE (name
);
13461 if (TREE_CODE (type
) == TYPENAME_TYPE
)
13463 /* Are template enums allowed in ISO? */
13464 if (template_parm_scope_p ())
13465 pedwarn (type_start_token
->location
, OPT_pedantic
,
13466 "%qD is an enumeration template", name
);
13467 /* ignore a typename reference, for it will be solved by name
13473 error_at (type_start_token
->location
,
13474 "%qD is not an enumerator-name", identifier
);
13478 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
13479 identifier
= cp_parser_identifier (parser
);
13482 identifier
= make_anon_name ();
13483 is_anonymous
= true;
13486 pop_deferring_access_checks ();
13488 /* Check for the `:' that denotes a specified underlying type in C++0x.
13489 Note that a ':' could also indicate a bitfield width, however. */
13490 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
13492 cp_decl_specifier_seq type_specifiers
;
13494 /* Consume the `:'. */
13495 cp_lexer_consume_token (parser
->lexer
);
13497 /* Parse the type-specifier-seq. */
13498 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/false,
13499 /*is_trailing_return=*/false,
13502 /* At this point this is surely not elaborated type specifier. */
13503 if (!cp_parser_parse_definitely (parser
))
13506 if (cxx_dialect
< cxx0x
)
13507 maybe_warn_cpp0x (CPP0X_SCOPED_ENUMS
);
13509 has_underlying_type
= true;
13511 /* If that didn't work, stop. */
13512 if (type_specifiers
.type
!= error_mark_node
)
13514 underlying_type
= grokdeclarator (NULL
, &type_specifiers
, TYPENAME
,
13515 /*initialized=*/0, NULL
);
13516 if (underlying_type
== error_mark_node
)
13517 underlying_type
= NULL_TREE
;
13521 /* Look for the `{' but don't consume it yet. */
13522 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
13524 if (cxx_dialect
< cxx0x
|| (!scoped_enum_p
&& !underlying_type
))
13526 cp_parser_error (parser
, "expected %<{%>");
13527 if (has_underlying_type
)
13533 /* An opaque-enum-specifier must have a ';' here. */
13534 if ((scoped_enum_p
|| underlying_type
)
13535 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
13537 cp_parser_error (parser
, "expected %<;%> or %<{%>");
13538 if (has_underlying_type
)
13546 if (!has_underlying_type
&& !cp_parser_parse_definitely (parser
))
13549 if (nested_name_specifier
)
13551 if (CLASS_TYPE_P (nested_name_specifier
))
13553 nested_being_defined
= TYPE_BEING_DEFINED (nested_name_specifier
);
13554 TYPE_BEING_DEFINED (nested_name_specifier
) = 1;
13555 push_scope (nested_name_specifier
);
13557 else if (TREE_CODE (nested_name_specifier
) == NAMESPACE_DECL
)
13559 push_nested_namespace (nested_name_specifier
);
13563 /* Issue an error message if type-definitions are forbidden here. */
13564 if (!cp_parser_check_type_definition (parser
))
13565 type
= error_mark_node
;
13567 /* Create the new type. We do this before consuming the opening
13568 brace so the enum will be recorded as being on the line of its
13569 tag (or the 'enum' keyword, if there is no tag). */
13570 type
= start_enum (identifier
, type
, underlying_type
,
13571 scoped_enum_p
, &is_new_type
);
13573 /* If the next token is not '{' it is an opaque-enum-specifier or an
13574 elaborated-type-specifier. */
13575 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
13577 if (nested_name_specifier
)
13579 /* The following catches invalid code such as:
13580 enum class S<int>::E { A, B, C }; */
13581 if (!processing_specialization
13582 && CLASS_TYPE_P (nested_name_specifier
)
13583 && CLASSTYPE_USE_TEMPLATE (nested_name_specifier
))
13584 error_at (type_start_token
->location
, "cannot add an enumerator "
13585 "list to a template instantiation");
13587 /* If that scope does not contain the scope in which the
13588 class was originally declared, the program is invalid. */
13589 if (prev_scope
&& !is_ancestor (prev_scope
, nested_name_specifier
))
13591 if (at_namespace_scope_p ())
13592 error_at (type_start_token
->location
,
13593 "declaration of %qD in namespace %qD which does not "
13595 type
, prev_scope
, nested_name_specifier
);
13597 error_at (type_start_token
->location
,
13598 "declaration of %qD in %qD which does not enclose %qD",
13599 type
, prev_scope
, nested_name_specifier
);
13600 type
= error_mark_node
;
13605 begin_scope (sk_scoped_enum
, type
);
13607 /* Consume the opening brace. */
13608 cp_lexer_consume_token (parser
->lexer
);
13610 if (type
== error_mark_node
)
13611 ; /* Nothing to add */
13612 else if (OPAQUE_ENUM_P (type
)
13613 || (cxx_dialect
> cxx98
&& processing_specialization
))
13615 new_value_list
= true;
13616 SET_OPAQUE_ENUM_P (type
, false);
13617 DECL_SOURCE_LOCATION (TYPE_NAME (type
)) = type_start_token
->location
;
13621 error_at (type_start_token
->location
, "multiple definition of %q#T", type
);
13622 error_at (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type
)),
13623 "previous definition here");
13624 type
= error_mark_node
;
13627 if (type
== error_mark_node
)
13628 cp_parser_skip_to_end_of_block_or_statement (parser
);
13629 /* If the next token is not '}', then there are some enumerators. */
13630 else if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_BRACE
))
13631 cp_parser_enumerator_list (parser
, type
);
13633 /* Consume the final '}'. */
13634 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
13641 /* If a ';' follows, then it is an opaque-enum-specifier
13642 and additional restrictions apply. */
13643 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
13646 error_at (type_start_token
->location
,
13647 "opaque-enum-specifier without name");
13648 else if (nested_name_specifier
)
13649 error_at (type_start_token
->location
,
13650 "opaque-enum-specifier must use a simple identifier");
13654 /* Look for trailing attributes to apply to this enumeration, and
13655 apply them if appropriate. */
13656 if (cp_parser_allow_gnu_extensions_p (parser
))
13658 tree trailing_attr
= cp_parser_attributes_opt (parser
);
13659 trailing_attr
= chainon (trailing_attr
, attributes
);
13660 cplus_decl_attributes (&type
,
13662 (int) ATTR_FLAG_TYPE_IN_PLACE
);
13665 /* Finish up the enumeration. */
13666 if (type
!= error_mark_node
)
13668 if (new_value_list
)
13669 finish_enum_value_list (type
);
13671 finish_enum (type
);
13674 if (nested_name_specifier
)
13676 if (CLASS_TYPE_P (nested_name_specifier
))
13678 TYPE_BEING_DEFINED (nested_name_specifier
) = nested_being_defined
;
13679 pop_scope (nested_name_specifier
);
13681 else if (TREE_CODE (nested_name_specifier
) == NAMESPACE_DECL
)
13683 pop_nested_namespace (nested_name_specifier
);
13687 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
13691 /* Parse an enumerator-list. The enumerators all have the indicated
13695 enumerator-definition
13696 enumerator-list , enumerator-definition */
13699 cp_parser_enumerator_list (cp_parser
* parser
, tree type
)
13703 /* Parse an enumerator-definition. */
13704 cp_parser_enumerator_definition (parser
, type
);
13706 /* If the next token is not a ',', we've reached the end of
13708 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
13710 /* Otherwise, consume the `,' and keep going. */
13711 cp_lexer_consume_token (parser
->lexer
);
13712 /* If the next token is a `}', there is a trailing comma. */
13713 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
13715 if (!in_system_header
)
13716 pedwarn (input_location
, OPT_pedantic
, "comma at end of enumerator list");
13722 /* Parse an enumerator-definition. The enumerator has the indicated
13725 enumerator-definition:
13727 enumerator = constant-expression
13733 cp_parser_enumerator_definition (cp_parser
* parser
, tree type
)
13739 /* Save the input location because we are interested in the location
13740 of the identifier and not the location of the explicit value. */
13741 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
13743 /* Look for the identifier. */
13744 identifier
= cp_parser_identifier (parser
);
13745 if (identifier
== error_mark_node
)
13748 /* If the next token is an '=', then there is an explicit value. */
13749 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
13751 /* Consume the `=' token. */
13752 cp_lexer_consume_token (parser
->lexer
);
13753 /* Parse the value. */
13754 value
= cp_parser_constant_expression (parser
,
13755 /*allow_non_constant_p=*/false,
13761 /* If we are processing a template, make sure the initializer of the
13762 enumerator doesn't contain any bare template parameter pack. */
13763 if (check_for_bare_parameter_packs (value
))
13764 value
= error_mark_node
;
13766 /* integral_constant_value will pull out this expression, so make sure
13767 it's folded as appropriate. */
13768 value
= fold_non_dependent_expr (value
);
13770 /* Create the enumerator. */
13771 build_enumerator (identifier
, value
, type
, loc
);
13774 /* Parse a namespace-name.
13777 original-namespace-name
13780 Returns the NAMESPACE_DECL for the namespace. */
13783 cp_parser_namespace_name (cp_parser
* parser
)
13786 tree namespace_decl
;
13788 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
13790 /* Get the name of the namespace. */
13791 identifier
= cp_parser_identifier (parser
);
13792 if (identifier
== error_mark_node
)
13793 return error_mark_node
;
13795 /* Look up the identifier in the currently active scope. Look only
13796 for namespaces, due to:
13798 [basic.lookup.udir]
13800 When looking up a namespace-name in a using-directive or alias
13801 definition, only namespace names are considered.
13805 [basic.lookup.qual]
13807 During the lookup of a name preceding the :: scope resolution
13808 operator, object, function, and enumerator names are ignored.
13810 (Note that cp_parser_qualifying_entity only calls this
13811 function if the token after the name is the scope resolution
13813 namespace_decl
= cp_parser_lookup_name (parser
, identifier
,
13815 /*is_template=*/false,
13816 /*is_namespace=*/true,
13817 /*check_dependency=*/true,
13818 /*ambiguous_decls=*/NULL
,
13820 /* If it's not a namespace, issue an error. */
13821 if (namespace_decl
== error_mark_node
13822 || TREE_CODE (namespace_decl
) != NAMESPACE_DECL
)
13824 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
13825 error_at (token
->location
, "%qD is not a namespace-name", identifier
);
13826 cp_parser_error (parser
, "expected namespace-name");
13827 namespace_decl
= error_mark_node
;
13830 return namespace_decl
;
13833 /* Parse a namespace-definition.
13835 namespace-definition:
13836 named-namespace-definition
13837 unnamed-namespace-definition
13839 named-namespace-definition:
13840 original-namespace-definition
13841 extension-namespace-definition
13843 original-namespace-definition:
13844 namespace identifier { namespace-body }
13846 extension-namespace-definition:
13847 namespace original-namespace-name { namespace-body }
13849 unnamed-namespace-definition:
13850 namespace { namespace-body } */
13853 cp_parser_namespace_definition (cp_parser
* parser
)
13855 tree identifier
, attribs
;
13856 bool has_visibility
;
13859 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_INLINE
))
13861 maybe_warn_cpp0x (CPP0X_INLINE_NAMESPACES
);
13863 cp_lexer_consume_token (parser
->lexer
);
13868 /* Look for the `namespace' keyword. */
13869 cp_parser_require_keyword (parser
, RID_NAMESPACE
, RT_NAMESPACE
);
13871 /* Get the name of the namespace. We do not attempt to distinguish
13872 between an original-namespace-definition and an
13873 extension-namespace-definition at this point. The semantic
13874 analysis routines are responsible for that. */
13875 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
13876 identifier
= cp_parser_identifier (parser
);
13878 identifier
= NULL_TREE
;
13880 /* Parse any specified attributes. */
13881 attribs
= cp_parser_attributes_opt (parser
);
13883 /* Look for the `{' to start the namespace. */
13884 cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
);
13885 /* Start the namespace. */
13886 push_namespace (identifier
);
13888 /* "inline namespace" is equivalent to a stub namespace definition
13889 followed by a strong using directive. */
13892 tree name_space
= current_namespace
;
13893 /* Set up namespace association. */
13894 DECL_NAMESPACE_ASSOCIATIONS (name_space
)
13895 = tree_cons (CP_DECL_CONTEXT (name_space
), NULL_TREE
,
13896 DECL_NAMESPACE_ASSOCIATIONS (name_space
));
13897 /* Import the contents of the inline namespace. */
13899 do_using_directive (name_space
);
13900 push_namespace (identifier
);
13903 has_visibility
= handle_namespace_attrs (current_namespace
, attribs
);
13905 /* Parse the body of the namespace. */
13906 cp_parser_namespace_body (parser
);
13908 if (has_visibility
)
13909 pop_visibility (1);
13911 /* Finish the namespace. */
13913 /* Look for the final `}'. */
13914 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
13917 /* Parse a namespace-body.
13920 declaration-seq [opt] */
13923 cp_parser_namespace_body (cp_parser
* parser
)
13925 cp_parser_declaration_seq_opt (parser
);
13928 /* Parse a namespace-alias-definition.
13930 namespace-alias-definition:
13931 namespace identifier = qualified-namespace-specifier ; */
13934 cp_parser_namespace_alias_definition (cp_parser
* parser
)
13937 tree namespace_specifier
;
13939 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
13941 /* Look for the `namespace' keyword. */
13942 cp_parser_require_keyword (parser
, RID_NAMESPACE
, RT_NAMESPACE
);
13943 /* Look for the identifier. */
13944 identifier
= cp_parser_identifier (parser
);
13945 if (identifier
== error_mark_node
)
13947 /* Look for the `=' token. */
13948 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
)
13949 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
13951 error_at (token
->location
, "%<namespace%> definition is not allowed here");
13952 /* Skip the definition. */
13953 cp_lexer_consume_token (parser
->lexer
);
13954 if (cp_parser_skip_to_closing_brace (parser
))
13955 cp_lexer_consume_token (parser
->lexer
);
13958 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
13959 /* Look for the qualified-namespace-specifier. */
13960 namespace_specifier
13961 = cp_parser_qualified_namespace_specifier (parser
);
13962 /* Look for the `;' token. */
13963 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
13965 /* Register the alias in the symbol table. */
13966 do_namespace_alias (identifier
, namespace_specifier
);
13969 /* Parse a qualified-namespace-specifier.
13971 qualified-namespace-specifier:
13972 :: [opt] nested-name-specifier [opt] namespace-name
13974 Returns a NAMESPACE_DECL corresponding to the specified
13978 cp_parser_qualified_namespace_specifier (cp_parser
* parser
)
13980 /* Look for the optional `::'. */
13981 cp_parser_global_scope_opt (parser
,
13982 /*current_scope_valid_p=*/false);
13984 /* Look for the optional nested-name-specifier. */
13985 cp_parser_nested_name_specifier_opt (parser
,
13986 /*typename_keyword_p=*/false,
13987 /*check_dependency_p=*/true,
13989 /*is_declaration=*/true);
13991 return cp_parser_namespace_name (parser
);
13994 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
13995 access declaration.
13998 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
13999 using :: unqualified-id ;
14001 access-declaration:
14007 cp_parser_using_declaration (cp_parser
* parser
,
14008 bool access_declaration_p
)
14011 bool typename_p
= false;
14012 bool global_scope_p
;
14017 if (access_declaration_p
)
14018 cp_parser_parse_tentatively (parser
);
14021 /* Look for the `using' keyword. */
14022 cp_parser_require_keyword (parser
, RID_USING
, RT_USING
);
14024 /* Peek at the next token. */
14025 token
= cp_lexer_peek_token (parser
->lexer
);
14026 /* See if it's `typename'. */
14027 if (token
->keyword
== RID_TYPENAME
)
14029 /* Remember that we've seen it. */
14031 /* Consume the `typename' token. */
14032 cp_lexer_consume_token (parser
->lexer
);
14036 /* Look for the optional global scope qualification. */
14038 = (cp_parser_global_scope_opt (parser
,
14039 /*current_scope_valid_p=*/false)
14042 /* If we saw `typename', or didn't see `::', then there must be a
14043 nested-name-specifier present. */
14044 if (typename_p
|| !global_scope_p
)
14045 qscope
= cp_parser_nested_name_specifier (parser
, typename_p
,
14046 /*check_dependency_p=*/true,
14048 /*is_declaration=*/true);
14049 /* Otherwise, we could be in either of the two productions. In that
14050 case, treat the nested-name-specifier as optional. */
14052 qscope
= cp_parser_nested_name_specifier_opt (parser
,
14053 /*typename_keyword_p=*/false,
14054 /*check_dependency_p=*/true,
14056 /*is_declaration=*/true);
14058 qscope
= global_namespace
;
14060 if (access_declaration_p
&& cp_parser_error_occurred (parser
))
14061 /* Something has already gone wrong; there's no need to parse
14062 further. Since an error has occurred, the return value of
14063 cp_parser_parse_definitely will be false, as required. */
14064 return cp_parser_parse_definitely (parser
);
14066 token
= cp_lexer_peek_token (parser
->lexer
);
14067 /* Parse the unqualified-id. */
14068 identifier
= cp_parser_unqualified_id (parser
,
14069 /*template_keyword_p=*/false,
14070 /*check_dependency_p=*/true,
14071 /*declarator_p=*/true,
14072 /*optional_p=*/false);
14074 if (access_declaration_p
)
14076 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
14077 cp_parser_simulate_error (parser
);
14078 if (!cp_parser_parse_definitely (parser
))
14082 /* The function we call to handle a using-declaration is different
14083 depending on what scope we are in. */
14084 if (qscope
== error_mark_node
|| identifier
== error_mark_node
)
14086 else if (TREE_CODE (identifier
) != IDENTIFIER_NODE
14087 && TREE_CODE (identifier
) != BIT_NOT_EXPR
)
14088 /* [namespace.udecl]
14090 A using declaration shall not name a template-id. */
14091 error_at (token
->location
,
14092 "a template-id may not appear in a using-declaration");
14095 if (at_class_scope_p ())
14097 /* Create the USING_DECL. */
14098 decl
= do_class_using_decl (parser
->scope
, identifier
);
14100 if (check_for_bare_parameter_packs (decl
))
14103 /* Add it to the list of members in this class. */
14104 finish_member_declaration (decl
);
14108 decl
= cp_parser_lookup_name_simple (parser
,
14111 if (decl
== error_mark_node
)
14112 cp_parser_name_lookup_error (parser
, identifier
,
14115 else if (check_for_bare_parameter_packs (decl
))
14117 else if (!at_namespace_scope_p ())
14118 do_local_using_decl (decl
, qscope
, identifier
);
14120 do_toplevel_using_decl (decl
, qscope
, identifier
);
14124 /* Look for the final `;'. */
14125 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
14130 /* Parse a using-directive.
14133 using namespace :: [opt] nested-name-specifier [opt]
14134 namespace-name ; */
14137 cp_parser_using_directive (cp_parser
* parser
)
14139 tree namespace_decl
;
14142 /* Look for the `using' keyword. */
14143 cp_parser_require_keyword (parser
, RID_USING
, RT_USING
);
14144 /* And the `namespace' keyword. */
14145 cp_parser_require_keyword (parser
, RID_NAMESPACE
, RT_NAMESPACE
);
14146 /* Look for the optional `::' operator. */
14147 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false);
14148 /* And the optional nested-name-specifier. */
14149 cp_parser_nested_name_specifier_opt (parser
,
14150 /*typename_keyword_p=*/false,
14151 /*check_dependency_p=*/true,
14153 /*is_declaration=*/true);
14154 /* Get the namespace being used. */
14155 namespace_decl
= cp_parser_namespace_name (parser
);
14156 /* And any specified attributes. */
14157 attribs
= cp_parser_attributes_opt (parser
);
14158 /* Update the symbol table. */
14159 parse_using_directive (namespace_decl
, attribs
);
14160 /* Look for the final `;'. */
14161 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
14164 /* Parse an asm-definition.
14167 asm ( string-literal ) ;
14172 asm volatile [opt] ( string-literal ) ;
14173 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
14174 asm volatile [opt] ( string-literal : asm-operand-list [opt]
14175 : asm-operand-list [opt] ) ;
14176 asm volatile [opt] ( string-literal : asm-operand-list [opt]
14177 : asm-operand-list [opt]
14178 : asm-clobber-list [opt] ) ;
14179 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
14180 : asm-clobber-list [opt]
14181 : asm-goto-list ) ; */
14184 cp_parser_asm_definition (cp_parser
* parser
)
14187 tree outputs
= NULL_TREE
;
14188 tree inputs
= NULL_TREE
;
14189 tree clobbers
= NULL_TREE
;
14190 tree labels
= NULL_TREE
;
14192 bool volatile_p
= false;
14193 bool extended_p
= false;
14194 bool invalid_inputs_p
= false;
14195 bool invalid_outputs_p
= false;
14196 bool goto_p
= false;
14197 required_token missing
= RT_NONE
;
14199 /* Look for the `asm' keyword. */
14200 cp_parser_require_keyword (parser
, RID_ASM
, RT_ASM
);
14201 /* See if the next token is `volatile'. */
14202 if (cp_parser_allow_gnu_extensions_p (parser
)
14203 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_VOLATILE
))
14205 /* Remember that we saw the `volatile' keyword. */
14207 /* Consume the token. */
14208 cp_lexer_consume_token (parser
->lexer
);
14210 if (cp_parser_allow_gnu_extensions_p (parser
)
14211 && parser
->in_function_body
14212 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_GOTO
))
14214 /* Remember that we saw the `goto' keyword. */
14216 /* Consume the token. */
14217 cp_lexer_consume_token (parser
->lexer
);
14219 /* Look for the opening `('. */
14220 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
14222 /* Look for the string. */
14223 string
= cp_parser_string_literal (parser
, false, false);
14224 if (string
== error_mark_node
)
14226 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
14227 /*consume_paren=*/true);
14231 /* If we're allowing GNU extensions, check for the extended assembly
14232 syntax. Unfortunately, the `:' tokens need not be separated by
14233 a space in C, and so, for compatibility, we tolerate that here
14234 too. Doing that means that we have to treat the `::' operator as
14236 if (cp_parser_allow_gnu_extensions_p (parser
)
14237 && parser
->in_function_body
14238 && (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
)
14239 || cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
)))
14241 bool inputs_p
= false;
14242 bool clobbers_p
= false;
14243 bool labels_p
= false;
14245 /* The extended syntax was used. */
14248 /* Look for outputs. */
14249 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
14251 /* Consume the `:'. */
14252 cp_lexer_consume_token (parser
->lexer
);
14253 /* Parse the output-operands. */
14254 if (cp_lexer_next_token_is_not (parser
->lexer
,
14256 && cp_lexer_next_token_is_not (parser
->lexer
,
14258 && cp_lexer_next_token_is_not (parser
->lexer
,
14261 outputs
= cp_parser_asm_operand_list (parser
);
14263 if (outputs
== error_mark_node
)
14264 invalid_outputs_p
= true;
14266 /* If the next token is `::', there are no outputs, and the
14267 next token is the beginning of the inputs. */
14268 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
14269 /* The inputs are coming next. */
14272 /* Look for inputs. */
14274 || cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
14276 /* Consume the `:' or `::'. */
14277 cp_lexer_consume_token (parser
->lexer
);
14278 /* Parse the output-operands. */
14279 if (cp_lexer_next_token_is_not (parser
->lexer
,
14281 && cp_lexer_next_token_is_not (parser
->lexer
,
14283 && cp_lexer_next_token_is_not (parser
->lexer
,
14285 inputs
= cp_parser_asm_operand_list (parser
);
14287 if (inputs
== error_mark_node
)
14288 invalid_inputs_p
= true;
14290 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
14291 /* The clobbers are coming next. */
14294 /* Look for clobbers. */
14296 || cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
14299 /* Consume the `:' or `::'. */
14300 cp_lexer_consume_token (parser
->lexer
);
14301 /* Parse the clobbers. */
14302 if (cp_lexer_next_token_is_not (parser
->lexer
,
14304 && cp_lexer_next_token_is_not (parser
->lexer
,
14306 clobbers
= cp_parser_asm_clobber_list (parser
);
14309 && cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
14310 /* The labels are coming next. */
14313 /* Look for labels. */
14315 || (goto_p
&& cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
)))
14318 /* Consume the `:' or `::'. */
14319 cp_lexer_consume_token (parser
->lexer
);
14320 /* Parse the labels. */
14321 labels
= cp_parser_asm_label_list (parser
);
14324 if (goto_p
&& !labels_p
)
14325 missing
= clobbers_p
? RT_COLON
: RT_COLON_SCOPE
;
14328 missing
= RT_COLON_SCOPE
;
14330 /* Look for the closing `)'. */
14331 if (!cp_parser_require (parser
, missing
? CPP_COLON
: CPP_CLOSE_PAREN
,
14332 missing
? missing
: RT_CLOSE_PAREN
))
14333 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
14334 /*consume_paren=*/true);
14335 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
14337 if (!invalid_inputs_p
&& !invalid_outputs_p
)
14339 /* Create the ASM_EXPR. */
14340 if (parser
->in_function_body
)
14342 asm_stmt
= finish_asm_stmt (volatile_p
, string
, outputs
,
14343 inputs
, clobbers
, labels
);
14344 /* If the extended syntax was not used, mark the ASM_EXPR. */
14347 tree temp
= asm_stmt
;
14348 if (TREE_CODE (temp
) == CLEANUP_POINT_EXPR
)
14349 temp
= TREE_OPERAND (temp
, 0);
14351 ASM_INPUT_P (temp
) = 1;
14355 cgraph_add_asm_node (string
);
14359 /* Declarators [gram.dcl.decl] */
14361 /* Parse an init-declarator.
14364 declarator initializer [opt]
14369 declarator asm-specification [opt] attributes [opt] initializer [opt]
14371 function-definition:
14372 decl-specifier-seq [opt] declarator ctor-initializer [opt]
14374 decl-specifier-seq [opt] declarator function-try-block
14378 function-definition:
14379 __extension__ function-definition
14381 The DECL_SPECIFIERS apply to this declarator. Returns a
14382 representation of the entity declared. If MEMBER_P is TRUE, then
14383 this declarator appears in a class scope. The new DECL created by
14384 this declarator is returned.
14386 The CHECKS are access checks that should be performed once we know
14387 what entity is being declared (and, therefore, what classes have
14390 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
14391 for a function-definition here as well. If the declarator is a
14392 declarator for a function-definition, *FUNCTION_DEFINITION_P will
14393 be TRUE upon return. By that point, the function-definition will
14394 have been completely parsed.
14396 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
14399 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
14400 parsed declaration if it is an uninitialized single declarator not followed
14401 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
14402 if present, will not be consumed. If returned, this declarator will be
14403 created with SD_INITIALIZED but will not call cp_finish_decl. */
14406 cp_parser_init_declarator (cp_parser
* parser
,
14407 cp_decl_specifier_seq
*decl_specifiers
,
14408 VEC (deferred_access_check
,gc
)* checks
,
14409 bool function_definition_allowed_p
,
14411 int declares_class_or_enum
,
14412 bool* function_definition_p
,
14413 tree
* maybe_range_for_decl
)
14415 cp_token
*token
= NULL
, *asm_spec_start_token
= NULL
,
14416 *attributes_start_token
= NULL
;
14417 cp_declarator
*declarator
;
14418 tree prefix_attributes
;
14420 tree asm_specification
;
14422 tree decl
= NULL_TREE
;
14424 int is_initialized
;
14425 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
14426 initialized with "= ..", CPP_OPEN_PAREN if initialized with
14428 enum cpp_ttype initialization_kind
;
14429 bool is_direct_init
= false;
14430 bool is_non_constant_init
;
14431 int ctor_dtor_or_conv_p
;
14433 tree pushed_scope
= NULL
;
14434 bool range_for_decl_p
= false;
14436 /* Gather the attributes that were provided with the
14437 decl-specifiers. */
14438 prefix_attributes
= decl_specifiers
->attributes
;
14440 /* Assume that this is not the declarator for a function
14442 if (function_definition_p
)
14443 *function_definition_p
= false;
14445 /* Defer access checks while parsing the declarator; we cannot know
14446 what names are accessible until we know what is being
14448 resume_deferring_access_checks ();
14450 /* Parse the declarator. */
14451 token
= cp_lexer_peek_token (parser
->lexer
);
14453 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
14454 &ctor_dtor_or_conv_p
,
14455 /*parenthesized_p=*/NULL
,
14456 /*member_p=*/false);
14457 /* Gather up the deferred checks. */
14458 stop_deferring_access_checks ();
14460 /* If the DECLARATOR was erroneous, there's no need to go
14462 if (declarator
== cp_error_declarator
)
14463 return error_mark_node
;
14465 /* Check that the number of template-parameter-lists is OK. */
14466 if (!cp_parser_check_declarator_template_parameters (parser
, declarator
,
14468 return error_mark_node
;
14470 if (declares_class_or_enum
& 2)
14471 cp_parser_check_for_definition_in_return_type (declarator
,
14472 decl_specifiers
->type
,
14473 decl_specifiers
->type_location
);
14475 /* Figure out what scope the entity declared by the DECLARATOR is
14476 located in. `grokdeclarator' sometimes changes the scope, so
14477 we compute it now. */
14478 scope
= get_scope_of_declarator (declarator
);
14480 /* Perform any lookups in the declared type which were thought to be
14481 dependent, but are not in the scope of the declarator. */
14482 decl_specifiers
->type
14483 = maybe_update_decl_type (decl_specifiers
->type
, scope
);
14485 /* If we're allowing GNU extensions, look for an asm-specification
14487 if (cp_parser_allow_gnu_extensions_p (parser
))
14489 /* Look for an asm-specification. */
14490 asm_spec_start_token
= cp_lexer_peek_token (parser
->lexer
);
14491 asm_specification
= cp_parser_asm_specification_opt (parser
);
14492 /* And attributes. */
14493 attributes_start_token
= cp_lexer_peek_token (parser
->lexer
);
14494 attributes
= cp_parser_attributes_opt (parser
);
14498 asm_specification
= NULL_TREE
;
14499 attributes
= NULL_TREE
;
14502 /* Peek at the next token. */
14503 token
= cp_lexer_peek_token (parser
->lexer
);
14504 /* Check to see if the token indicates the start of a
14505 function-definition. */
14506 if (function_declarator_p (declarator
)
14507 && cp_parser_token_starts_function_definition_p (token
))
14509 if (!function_definition_allowed_p
)
14511 /* If a function-definition should not appear here, issue an
14513 cp_parser_error (parser
,
14514 "a function-definition is not allowed here");
14515 return error_mark_node
;
14519 location_t func_brace_location
14520 = cp_lexer_peek_token (parser
->lexer
)->location
;
14522 /* Neither attributes nor an asm-specification are allowed
14523 on a function-definition. */
14524 if (asm_specification
)
14525 error_at (asm_spec_start_token
->location
,
14526 "an asm-specification is not allowed "
14527 "on a function-definition");
14529 error_at (attributes_start_token
->location
,
14530 "attributes are not allowed on a function-definition");
14531 /* This is a function-definition. */
14532 *function_definition_p
= true;
14534 /* Parse the function definition. */
14536 decl
= cp_parser_save_member_function_body (parser
,
14539 prefix_attributes
);
14542 = (cp_parser_function_definition_from_specifiers_and_declarator
14543 (parser
, decl_specifiers
, prefix_attributes
, declarator
));
14545 if (decl
!= error_mark_node
&& DECL_STRUCT_FUNCTION (decl
))
14547 /* This is where the prologue starts... */
14548 DECL_STRUCT_FUNCTION (decl
)->function_start_locus
14549 = func_brace_location
;
14558 Only in function declarations for constructors, destructors, and
14559 type conversions can the decl-specifier-seq be omitted.
14561 We explicitly postpone this check past the point where we handle
14562 function-definitions because we tolerate function-definitions
14563 that are missing their return types in some modes. */
14564 if (!decl_specifiers
->any_specifiers_p
&& ctor_dtor_or_conv_p
<= 0)
14566 cp_parser_error (parser
,
14567 "expected constructor, destructor, or type conversion");
14568 return error_mark_node
;
14571 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
14572 if (token
->type
== CPP_EQ
14573 || token
->type
== CPP_OPEN_PAREN
14574 || token
->type
== CPP_OPEN_BRACE
)
14576 is_initialized
= SD_INITIALIZED
;
14577 initialization_kind
= token
->type
;
14578 if (maybe_range_for_decl
)
14579 *maybe_range_for_decl
= error_mark_node
;
14581 if (token
->type
== CPP_EQ
14582 && function_declarator_p (declarator
))
14584 cp_token
*t2
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
14585 if (t2
->keyword
== RID_DEFAULT
)
14586 is_initialized
= SD_DEFAULTED
;
14587 else if (t2
->keyword
== RID_DELETE
)
14588 is_initialized
= SD_DELETED
;
14593 /* If the init-declarator isn't initialized and isn't followed by a
14594 `,' or `;', it's not a valid init-declarator. */
14595 if (token
->type
!= CPP_COMMA
14596 && token
->type
!= CPP_SEMICOLON
)
14598 if (maybe_range_for_decl
&& *maybe_range_for_decl
!= error_mark_node
)
14599 range_for_decl_p
= true;
14602 cp_parser_error (parser
, "expected initializer");
14603 return error_mark_node
;
14606 is_initialized
= SD_UNINITIALIZED
;
14607 initialization_kind
= CPP_EOF
;
14610 /* Because start_decl has side-effects, we should only call it if we
14611 know we're going ahead. By this point, we know that we cannot
14612 possibly be looking at any other construct. */
14613 cp_parser_commit_to_tentative_parse (parser
);
14615 /* If the decl specifiers were bad, issue an error now that we're
14616 sure this was intended to be a declarator. Then continue
14617 declaring the variable(s), as int, to try to cut down on further
14619 if (decl_specifiers
->any_specifiers_p
14620 && decl_specifiers
->type
== error_mark_node
)
14622 cp_parser_error (parser
, "invalid type in declaration");
14623 decl_specifiers
->type
= integer_type_node
;
14626 /* Check to see whether or not this declaration is a friend. */
14627 friend_p
= cp_parser_friend_p (decl_specifiers
);
14629 /* Enter the newly declared entry in the symbol table. If we're
14630 processing a declaration in a class-specifier, we wait until
14631 after processing the initializer. */
14634 if (parser
->in_unbraced_linkage_specification_p
)
14635 decl_specifiers
->storage_class
= sc_extern
;
14636 decl
= start_decl (declarator
, decl_specifiers
,
14637 range_for_decl_p
? SD_INITIALIZED
: is_initialized
,
14638 attributes
, prefix_attributes
,
14640 /* Adjust location of decl if declarator->id_loc is more appropriate:
14641 set, and decl wasn't merged with another decl, in which case its
14642 location would be different from input_location, and more accurate. */
14644 && declarator
->id_loc
!= UNKNOWN_LOCATION
14645 && DECL_SOURCE_LOCATION (decl
) == input_location
)
14646 DECL_SOURCE_LOCATION (decl
) = declarator
->id_loc
;
14649 /* Enter the SCOPE. That way unqualified names appearing in the
14650 initializer will be looked up in SCOPE. */
14651 pushed_scope
= push_scope (scope
);
14653 /* Perform deferred access control checks, now that we know in which
14654 SCOPE the declared entity resides. */
14655 if (!member_p
&& decl
)
14657 tree saved_current_function_decl
= NULL_TREE
;
14659 /* If the entity being declared is a function, pretend that we
14660 are in its scope. If it is a `friend', it may have access to
14661 things that would not otherwise be accessible. */
14662 if (TREE_CODE (decl
) == FUNCTION_DECL
)
14664 saved_current_function_decl
= current_function_decl
;
14665 current_function_decl
= decl
;
14668 /* Perform access checks for template parameters. */
14669 cp_parser_perform_template_parameter_access_checks (checks
);
14671 /* Perform the access control checks for the declarator and the
14672 decl-specifiers. */
14673 perform_deferred_access_checks ();
14675 /* Restore the saved value. */
14676 if (TREE_CODE (decl
) == FUNCTION_DECL
)
14677 current_function_decl
= saved_current_function_decl
;
14680 /* Parse the initializer. */
14681 initializer
= NULL_TREE
;
14682 is_direct_init
= false;
14683 is_non_constant_init
= true;
14684 if (is_initialized
)
14686 if (function_declarator_p (declarator
))
14688 cp_token
*initializer_start_token
= cp_lexer_peek_token (parser
->lexer
);
14689 if (initialization_kind
== CPP_EQ
)
14690 initializer
= cp_parser_pure_specifier (parser
);
14693 /* If the declaration was erroneous, we don't really
14694 know what the user intended, so just silently
14695 consume the initializer. */
14696 if (decl
!= error_mark_node
)
14697 error_at (initializer_start_token
->location
,
14698 "initializer provided for function");
14699 cp_parser_skip_to_closing_parenthesis (parser
,
14700 /*recovering=*/true,
14701 /*or_comma=*/false,
14702 /*consume_paren=*/true);
14707 /* We want to record the extra mangling scope for in-class
14708 initializers of class members and initializers of static data
14709 member templates. The former is a C++0x feature which isn't
14710 implemented yet, and I expect it will involve deferring
14711 parsing of the initializer until end of class as with default
14712 arguments. So right here we only handle the latter. */
14713 if (!member_p
&& processing_template_decl
)
14714 start_lambda_scope (decl
);
14715 initializer
= cp_parser_initializer (parser
,
14717 &is_non_constant_init
);
14718 if (!member_p
&& processing_template_decl
)
14719 finish_lambda_scope ();
14723 /* The old parser allows attributes to appear after a parenthesized
14724 initializer. Mark Mitchell proposed removing this functionality
14725 on the GCC mailing lists on 2002-08-13. This parser accepts the
14726 attributes -- but ignores them. */
14727 if (cp_parser_allow_gnu_extensions_p (parser
)
14728 && initialization_kind
== CPP_OPEN_PAREN
)
14729 if (cp_parser_attributes_opt (parser
))
14730 warning (OPT_Wattributes
,
14731 "attributes after parenthesized initializer ignored");
14733 /* For an in-class declaration, use `grokfield' to create the
14739 pop_scope (pushed_scope
);
14740 pushed_scope
= false;
14742 decl
= grokfield (declarator
, decl_specifiers
,
14743 initializer
, !is_non_constant_init
,
14744 /*asmspec=*/NULL_TREE
,
14745 prefix_attributes
);
14746 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
14747 cp_parser_save_default_args (parser
, decl
);
14750 /* Finish processing the declaration. But, skip friend
14752 if (!friend_p
&& decl
&& decl
!= error_mark_node
&& !range_for_decl_p
)
14754 cp_finish_decl (decl
,
14755 initializer
, !is_non_constant_init
,
14757 /* If the initializer is in parentheses, then this is
14758 a direct-initialization, which means that an
14759 `explicit' constructor is OK. Otherwise, an
14760 `explicit' constructor cannot be used. */
14761 ((is_direct_init
|| !is_initialized
)
14762 ? LOOKUP_NORMAL
: LOOKUP_IMPLICIT
));
14764 else if ((cxx_dialect
!= cxx98
) && friend_p
14765 && decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
14766 /* Core issue #226 (C++0x only): A default template-argument
14767 shall not be specified in a friend class template
14769 check_default_tmpl_args (decl
, current_template_parms
, /*is_primary=*/1,
14770 /*is_partial=*/0, /*is_friend_decl=*/1);
14772 if (!friend_p
&& pushed_scope
)
14773 pop_scope (pushed_scope
);
14778 /* Parse a declarator.
14782 ptr-operator declarator
14784 abstract-declarator:
14785 ptr-operator abstract-declarator [opt]
14786 direct-abstract-declarator
14791 attributes [opt] direct-declarator
14792 attributes [opt] ptr-operator declarator
14794 abstract-declarator:
14795 attributes [opt] ptr-operator abstract-declarator [opt]
14796 attributes [opt] direct-abstract-declarator
14798 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
14799 detect constructor, destructor or conversion operators. It is set
14800 to -1 if the declarator is a name, and +1 if it is a
14801 function. Otherwise it is set to zero. Usually you just want to
14802 test for >0, but internally the negative value is used.
14804 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
14805 a decl-specifier-seq unless it declares a constructor, destructor,
14806 or conversion. It might seem that we could check this condition in
14807 semantic analysis, rather than parsing, but that makes it difficult
14808 to handle something like `f()'. We want to notice that there are
14809 no decl-specifiers, and therefore realize that this is an
14810 expression, not a declaration.)
14812 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
14813 the declarator is a direct-declarator of the form "(...)".
14815 MEMBER_P is true iff this declarator is a member-declarator. */
14817 static cp_declarator
*
14818 cp_parser_declarator (cp_parser
* parser
,
14819 cp_parser_declarator_kind dcl_kind
,
14820 int* ctor_dtor_or_conv_p
,
14821 bool* parenthesized_p
,
14824 cp_declarator
*declarator
;
14825 enum tree_code code
;
14826 cp_cv_quals cv_quals
;
14828 tree attributes
= NULL_TREE
;
14830 /* Assume this is not a constructor, destructor, or type-conversion
14832 if (ctor_dtor_or_conv_p
)
14833 *ctor_dtor_or_conv_p
= 0;
14835 if (cp_parser_allow_gnu_extensions_p (parser
))
14836 attributes
= cp_parser_attributes_opt (parser
);
14838 /* Check for the ptr-operator production. */
14839 cp_parser_parse_tentatively (parser
);
14840 /* Parse the ptr-operator. */
14841 code
= cp_parser_ptr_operator (parser
,
14844 /* If that worked, then we have a ptr-operator. */
14845 if (cp_parser_parse_definitely (parser
))
14847 /* If a ptr-operator was found, then this declarator was not
14849 if (parenthesized_p
)
14850 *parenthesized_p
= true;
14851 /* The dependent declarator is optional if we are parsing an
14852 abstract-declarator. */
14853 if (dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
)
14854 cp_parser_parse_tentatively (parser
);
14856 /* Parse the dependent declarator. */
14857 declarator
= cp_parser_declarator (parser
, dcl_kind
,
14858 /*ctor_dtor_or_conv_p=*/NULL
,
14859 /*parenthesized_p=*/NULL
,
14860 /*member_p=*/false);
14862 /* If we are parsing an abstract-declarator, we must handle the
14863 case where the dependent declarator is absent. */
14864 if (dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
14865 && !cp_parser_parse_definitely (parser
))
14868 declarator
= cp_parser_make_indirect_declarator
14869 (code
, class_type
, cv_quals
, declarator
);
14871 /* Everything else is a direct-declarator. */
14874 if (parenthesized_p
)
14875 *parenthesized_p
= cp_lexer_next_token_is (parser
->lexer
,
14877 declarator
= cp_parser_direct_declarator (parser
, dcl_kind
,
14878 ctor_dtor_or_conv_p
,
14882 if (attributes
&& declarator
&& declarator
!= cp_error_declarator
)
14883 declarator
->attributes
= attributes
;
14888 /* Parse a direct-declarator or direct-abstract-declarator.
14892 direct-declarator ( parameter-declaration-clause )
14893 cv-qualifier-seq [opt]
14894 exception-specification [opt]
14895 direct-declarator [ constant-expression [opt] ]
14898 direct-abstract-declarator:
14899 direct-abstract-declarator [opt]
14900 ( parameter-declaration-clause )
14901 cv-qualifier-seq [opt]
14902 exception-specification [opt]
14903 direct-abstract-declarator [opt] [ constant-expression [opt] ]
14904 ( abstract-declarator )
14906 Returns a representation of the declarator. DCL_KIND is
14907 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
14908 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
14909 we are parsing a direct-declarator. It is
14910 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
14911 of ambiguity we prefer an abstract declarator, as per
14912 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
14913 cp_parser_declarator. */
14915 static cp_declarator
*
14916 cp_parser_direct_declarator (cp_parser
* parser
,
14917 cp_parser_declarator_kind dcl_kind
,
14918 int* ctor_dtor_or_conv_p
,
14922 cp_declarator
*declarator
= NULL
;
14923 tree scope
= NULL_TREE
;
14924 bool saved_default_arg_ok_p
= parser
->default_arg_ok_p
;
14925 bool saved_in_declarator_p
= parser
->in_declarator_p
;
14927 tree pushed_scope
= NULL_TREE
;
14931 /* Peek at the next token. */
14932 token
= cp_lexer_peek_token (parser
->lexer
);
14933 if (token
->type
== CPP_OPEN_PAREN
)
14935 /* This is either a parameter-declaration-clause, or a
14936 parenthesized declarator. When we know we are parsing a
14937 named declarator, it must be a parenthesized declarator
14938 if FIRST is true. For instance, `(int)' is a
14939 parameter-declaration-clause, with an omitted
14940 direct-abstract-declarator. But `((*))', is a
14941 parenthesized abstract declarator. Finally, when T is a
14942 template parameter `(T)' is a
14943 parameter-declaration-clause, and not a parenthesized
14946 We first try and parse a parameter-declaration-clause,
14947 and then try a nested declarator (if FIRST is true).
14949 It is not an error for it not to be a
14950 parameter-declaration-clause, even when FIRST is
14956 The first is the declaration of a function while the
14957 second is the definition of a variable, including its
14960 Having seen only the parenthesis, we cannot know which of
14961 these two alternatives should be selected. Even more
14962 complex are examples like:
14967 The former is a function-declaration; the latter is a
14968 variable initialization.
14970 Thus again, we try a parameter-declaration-clause, and if
14971 that fails, we back out and return. */
14973 if (!first
|| dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
)
14976 unsigned saved_num_template_parameter_lists
;
14977 bool is_declarator
= false;
14980 /* In a member-declarator, the only valid interpretation
14981 of a parenthesis is the start of a
14982 parameter-declaration-clause. (It is invalid to
14983 initialize a static data member with a parenthesized
14984 initializer; only the "=" form of initialization is
14987 cp_parser_parse_tentatively (parser
);
14989 /* Consume the `('. */
14990 cp_lexer_consume_token (parser
->lexer
);
14993 /* If this is going to be an abstract declarator, we're
14994 in a declarator and we can't have default args. */
14995 parser
->default_arg_ok_p
= false;
14996 parser
->in_declarator_p
= true;
14999 /* Inside the function parameter list, surrounding
15000 template-parameter-lists do not apply. */
15001 saved_num_template_parameter_lists
15002 = parser
->num_template_parameter_lists
;
15003 parser
->num_template_parameter_lists
= 0;
15005 begin_scope (sk_function_parms
, NULL_TREE
);
15007 /* Parse the parameter-declaration-clause. */
15008 params
= cp_parser_parameter_declaration_clause (parser
);
15010 parser
->num_template_parameter_lists
15011 = saved_num_template_parameter_lists
;
15013 /* If all went well, parse the cv-qualifier-seq and the
15014 exception-specification. */
15015 if (member_p
|| cp_parser_parse_definitely (parser
))
15017 cp_cv_quals cv_quals
;
15018 tree exception_specification
;
15021 is_declarator
= true;
15023 if (ctor_dtor_or_conv_p
)
15024 *ctor_dtor_or_conv_p
= *ctor_dtor_or_conv_p
< 0;
15026 /* Consume the `)'. */
15027 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
15029 /* Parse the cv-qualifier-seq. */
15030 cv_quals
= cp_parser_cv_qualifier_seq_opt (parser
);
15031 /* And the exception-specification. */
15032 exception_specification
15033 = cp_parser_exception_specification_opt (parser
);
15036 = cp_parser_late_return_type_opt (parser
);
15038 /* Create the function-declarator. */
15039 declarator
= make_call_declarator (declarator
,
15042 exception_specification
,
15044 /* Any subsequent parameter lists are to do with
15045 return type, so are not those of the declared
15047 parser
->default_arg_ok_p
= false;
15050 /* Remove the function parms from scope. */
15051 for (t
= current_binding_level
->names
; t
; t
= DECL_CHAIN (t
))
15052 pop_binding (DECL_NAME (t
), t
);
15056 /* Repeat the main loop. */
15060 /* If this is the first, we can try a parenthesized
15064 bool saved_in_type_id_in_expr_p
;
15066 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
15067 parser
->in_declarator_p
= saved_in_declarator_p
;
15069 /* Consume the `('. */
15070 cp_lexer_consume_token (parser
->lexer
);
15071 /* Parse the nested declarator. */
15072 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
15073 parser
->in_type_id_in_expr_p
= true;
15075 = cp_parser_declarator (parser
, dcl_kind
, ctor_dtor_or_conv_p
,
15076 /*parenthesized_p=*/NULL
,
15078 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
15080 /* Expect a `)'. */
15081 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
15082 declarator
= cp_error_declarator
;
15083 if (declarator
== cp_error_declarator
)
15086 goto handle_declarator
;
15088 /* Otherwise, we must be done. */
15092 else if ((!first
|| dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
)
15093 && token
->type
== CPP_OPEN_SQUARE
)
15095 /* Parse an array-declarator. */
15098 if (ctor_dtor_or_conv_p
)
15099 *ctor_dtor_or_conv_p
= 0;
15102 parser
->default_arg_ok_p
= false;
15103 parser
->in_declarator_p
= true;
15104 /* Consume the `['. */
15105 cp_lexer_consume_token (parser
->lexer
);
15106 /* Peek at the next token. */
15107 token
= cp_lexer_peek_token (parser
->lexer
);
15108 /* If the next token is `]', then there is no
15109 constant-expression. */
15110 if (token
->type
!= CPP_CLOSE_SQUARE
)
15112 bool non_constant_p
;
15115 = cp_parser_constant_expression (parser
,
15116 /*allow_non_constant=*/true,
15118 if (!non_constant_p
|| cxx_dialect
>= cxx0x
)
15120 /* Normally, the array bound must be an integral constant
15121 expression. However, as an extension, we allow VLAs
15122 in function scopes as long as they aren't part of a
15123 parameter declaration. */
15124 else if (!parser
->in_function_body
15125 || current_binding_level
->kind
== sk_function_parms
)
15127 cp_parser_error (parser
,
15128 "array bound is not an integer constant");
15129 bounds
= error_mark_node
;
15131 else if (processing_template_decl
&& !error_operand_p (bounds
))
15133 /* Remember this wasn't a constant-expression. */
15134 bounds
= build_nop (TREE_TYPE (bounds
), bounds
);
15135 TREE_SIDE_EFFECTS (bounds
) = 1;
15139 bounds
= NULL_TREE
;
15140 /* Look for the closing `]'. */
15141 if (!cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
))
15143 declarator
= cp_error_declarator
;
15147 declarator
= make_array_declarator (declarator
, bounds
);
15149 else if (first
&& dcl_kind
!= CP_PARSER_DECLARATOR_ABSTRACT
)
15152 tree qualifying_scope
;
15153 tree unqualified_name
;
15154 special_function_kind sfk
;
15156 bool pack_expansion_p
= false;
15157 cp_token
*declarator_id_start_token
;
15159 /* Parse a declarator-id */
15160 abstract_ok
= (dcl_kind
== CP_PARSER_DECLARATOR_EITHER
);
15163 cp_parser_parse_tentatively (parser
);
15165 /* If we see an ellipsis, we should be looking at a
15167 if (token
->type
== CPP_ELLIPSIS
)
15169 /* Consume the `...' */
15170 cp_lexer_consume_token (parser
->lexer
);
15172 pack_expansion_p
= true;
15176 declarator_id_start_token
= cp_lexer_peek_token (parser
->lexer
);
15178 = cp_parser_declarator_id (parser
, /*optional_p=*/abstract_ok
);
15179 qualifying_scope
= parser
->scope
;
15184 if (!unqualified_name
&& pack_expansion_p
)
15186 /* Check whether an error occurred. */
15187 okay
= !cp_parser_error_occurred (parser
);
15189 /* We already consumed the ellipsis to mark a
15190 parameter pack, but we have no way to report it,
15191 so abort the tentative parse. We will be exiting
15192 immediately anyway. */
15193 cp_parser_abort_tentative_parse (parser
);
15196 okay
= cp_parser_parse_definitely (parser
);
15199 unqualified_name
= error_mark_node
;
15200 else if (unqualified_name
15201 && (qualifying_scope
15202 || (TREE_CODE (unqualified_name
)
15203 != IDENTIFIER_NODE
)))
15205 cp_parser_error (parser
, "expected unqualified-id");
15206 unqualified_name
= error_mark_node
;
15210 if (!unqualified_name
)
15212 if (unqualified_name
== error_mark_node
)
15214 declarator
= cp_error_declarator
;
15215 pack_expansion_p
= false;
15216 declarator
->parameter_pack_p
= false;
15220 if (qualifying_scope
&& at_namespace_scope_p ()
15221 && TREE_CODE (qualifying_scope
) == TYPENAME_TYPE
)
15223 /* In the declaration of a member of a template class
15224 outside of the class itself, the SCOPE will sometimes
15225 be a TYPENAME_TYPE. For example, given:
15227 template <typename T>
15228 int S<T>::R::i = 3;
15230 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
15231 this context, we must resolve S<T>::R to an ordinary
15232 type, rather than a typename type.
15234 The reason we normally avoid resolving TYPENAME_TYPEs
15235 is that a specialization of `S' might render
15236 `S<T>::R' not a type. However, if `S' is
15237 specialized, then this `i' will not be used, so there
15238 is no harm in resolving the types here. */
15241 /* Resolve the TYPENAME_TYPE. */
15242 type
= resolve_typename_type (qualifying_scope
,
15243 /*only_current_p=*/false);
15244 /* If that failed, the declarator is invalid. */
15245 if (TREE_CODE (type
) == TYPENAME_TYPE
)
15247 if (typedef_variant_p (type
))
15248 error_at (declarator_id_start_token
->location
,
15249 "cannot define member of dependent typedef "
15252 error_at (declarator_id_start_token
->location
,
15253 "%<%T::%E%> is not a type",
15254 TYPE_CONTEXT (qualifying_scope
),
15255 TYPE_IDENTIFIER (qualifying_scope
));
15257 qualifying_scope
= type
;
15262 if (unqualified_name
)
15266 if (qualifying_scope
15267 && CLASS_TYPE_P (qualifying_scope
))
15268 class_type
= qualifying_scope
;
15270 class_type
= current_class_type
;
15272 if (TREE_CODE (unqualified_name
) == TYPE_DECL
)
15274 tree name_type
= TREE_TYPE (unqualified_name
);
15275 if (class_type
&& same_type_p (name_type
, class_type
))
15277 if (qualifying_scope
15278 && CLASSTYPE_USE_TEMPLATE (name_type
))
15280 error_at (declarator_id_start_token
->location
,
15281 "invalid use of constructor as a template");
15282 inform (declarator_id_start_token
->location
,
15283 "use %<%T::%D%> instead of %<%T::%D%> to "
15284 "name the constructor in a qualified name",
15286 DECL_NAME (TYPE_TI_TEMPLATE (class_type
)),
15287 class_type
, name_type
);
15288 declarator
= cp_error_declarator
;
15292 unqualified_name
= constructor_name (class_type
);
15296 /* We do not attempt to print the declarator
15297 here because we do not have enough
15298 information about its original syntactic
15300 cp_parser_error (parser
, "invalid declarator");
15301 declarator
= cp_error_declarator
;
15308 if (TREE_CODE (unqualified_name
) == BIT_NOT_EXPR
)
15309 sfk
= sfk_destructor
;
15310 else if (IDENTIFIER_TYPENAME_P (unqualified_name
))
15311 sfk
= sfk_conversion
;
15312 else if (/* There's no way to declare a constructor
15313 for an anonymous type, even if the type
15314 got a name for linkage purposes. */
15315 !TYPE_WAS_ANONYMOUS (class_type
)
15316 && constructor_name_p (unqualified_name
,
15319 unqualified_name
= constructor_name (class_type
);
15320 sfk
= sfk_constructor
;
15322 else if (is_overloaded_fn (unqualified_name
)
15323 && DECL_CONSTRUCTOR_P (get_first_fn
15324 (unqualified_name
)))
15325 sfk
= sfk_constructor
;
15327 if (ctor_dtor_or_conv_p
&& sfk
!= sfk_none
)
15328 *ctor_dtor_or_conv_p
= -1;
15331 declarator
= make_id_declarator (qualifying_scope
,
15334 declarator
->id_loc
= token
->location
;
15335 declarator
->parameter_pack_p
= pack_expansion_p
;
15337 if (pack_expansion_p
)
15338 maybe_warn_variadic_templates ();
15341 handle_declarator
:;
15342 scope
= get_scope_of_declarator (declarator
);
15344 /* Any names that appear after the declarator-id for a
15345 member are looked up in the containing scope. */
15346 pushed_scope
= push_scope (scope
);
15347 parser
->in_declarator_p
= true;
15348 if ((ctor_dtor_or_conv_p
&& *ctor_dtor_or_conv_p
)
15349 || (declarator
&& declarator
->kind
== cdk_id
))
15350 /* Default args are only allowed on function
15352 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
15354 parser
->default_arg_ok_p
= false;
15363 /* For an abstract declarator, we might wind up with nothing at this
15364 point. That's an error; the declarator is not optional. */
15366 cp_parser_error (parser
, "expected declarator");
15368 /* If we entered a scope, we must exit it now. */
15370 pop_scope (pushed_scope
);
15372 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
15373 parser
->in_declarator_p
= saved_in_declarator_p
;
15378 /* Parse a ptr-operator.
15381 * cv-qualifier-seq [opt]
15383 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
15388 & cv-qualifier-seq [opt]
15390 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
15391 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
15392 an rvalue reference. In the case of a pointer-to-member, *TYPE is
15393 filled in with the TYPE containing the member. *CV_QUALS is
15394 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
15395 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
15396 Note that the tree codes returned by this function have nothing
15397 to do with the types of trees that will be eventually be created
15398 to represent the pointer or reference type being parsed. They are
15399 just constants with suggestive names. */
15400 static enum tree_code
15401 cp_parser_ptr_operator (cp_parser
* parser
,
15403 cp_cv_quals
*cv_quals
)
15405 enum tree_code code
= ERROR_MARK
;
15408 /* Assume that it's not a pointer-to-member. */
15410 /* And that there are no cv-qualifiers. */
15411 *cv_quals
= TYPE_UNQUALIFIED
;
15413 /* Peek at the next token. */
15414 token
= cp_lexer_peek_token (parser
->lexer
);
15416 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
15417 if (token
->type
== CPP_MULT
)
15418 code
= INDIRECT_REF
;
15419 else if (token
->type
== CPP_AND
)
15421 else if ((cxx_dialect
!= cxx98
) &&
15422 token
->type
== CPP_AND_AND
) /* C++0x only */
15423 code
= NON_LVALUE_EXPR
;
15425 if (code
!= ERROR_MARK
)
15427 /* Consume the `*', `&' or `&&'. */
15428 cp_lexer_consume_token (parser
->lexer
);
15430 /* A `*' can be followed by a cv-qualifier-seq, and so can a
15431 `&', if we are allowing GNU extensions. (The only qualifier
15432 that can legally appear after `&' is `restrict', but that is
15433 enforced during semantic analysis. */
15434 if (code
== INDIRECT_REF
15435 || cp_parser_allow_gnu_extensions_p (parser
))
15436 *cv_quals
= cp_parser_cv_qualifier_seq_opt (parser
);
15440 /* Try the pointer-to-member case. */
15441 cp_parser_parse_tentatively (parser
);
15442 /* Look for the optional `::' operator. */
15443 cp_parser_global_scope_opt (parser
,
15444 /*current_scope_valid_p=*/false);
15445 /* Look for the nested-name specifier. */
15446 token
= cp_lexer_peek_token (parser
->lexer
);
15447 cp_parser_nested_name_specifier (parser
,
15448 /*typename_keyword_p=*/false,
15449 /*check_dependency_p=*/true,
15451 /*is_declaration=*/false);
15452 /* If we found it, and the next token is a `*', then we are
15453 indeed looking at a pointer-to-member operator. */
15454 if (!cp_parser_error_occurred (parser
)
15455 && cp_parser_require (parser
, CPP_MULT
, RT_MULT
))
15457 /* Indicate that the `*' operator was used. */
15458 code
= INDIRECT_REF
;
15460 if (TREE_CODE (parser
->scope
) == NAMESPACE_DECL
)
15461 error_at (token
->location
, "%qD is a namespace", parser
->scope
);
15464 /* The type of which the member is a member is given by the
15466 *type
= parser
->scope
;
15467 /* The next name will not be qualified. */
15468 parser
->scope
= NULL_TREE
;
15469 parser
->qualifying_scope
= NULL_TREE
;
15470 parser
->object_scope
= NULL_TREE
;
15471 /* Look for the optional cv-qualifier-seq. */
15472 *cv_quals
= cp_parser_cv_qualifier_seq_opt (parser
);
15475 /* If that didn't work we don't have a ptr-operator. */
15476 if (!cp_parser_parse_definitely (parser
))
15477 cp_parser_error (parser
, "expected ptr-operator");
15483 /* Parse an (optional) cv-qualifier-seq.
15486 cv-qualifier cv-qualifier-seq [opt]
15497 Returns a bitmask representing the cv-qualifiers. */
15500 cp_parser_cv_qualifier_seq_opt (cp_parser
* parser
)
15502 cp_cv_quals cv_quals
= TYPE_UNQUALIFIED
;
15507 cp_cv_quals cv_qualifier
;
15509 /* Peek at the next token. */
15510 token
= cp_lexer_peek_token (parser
->lexer
);
15511 /* See if it's a cv-qualifier. */
15512 switch (token
->keyword
)
15515 cv_qualifier
= TYPE_QUAL_CONST
;
15519 cv_qualifier
= TYPE_QUAL_VOLATILE
;
15523 cv_qualifier
= TYPE_QUAL_RESTRICT
;
15527 cv_qualifier
= TYPE_UNQUALIFIED
;
15534 if (cv_quals
& cv_qualifier
)
15536 error_at (token
->location
, "duplicate cv-qualifier");
15537 cp_lexer_purge_token (parser
->lexer
);
15541 cp_lexer_consume_token (parser
->lexer
);
15542 cv_quals
|= cv_qualifier
;
15549 /* Parse a late-specified return type, if any. This is not a separate
15550 non-terminal, but part of a function declarator, which looks like
15552 -> trailing-type-specifier-seq abstract-declarator(opt)
15554 Returns the type indicated by the type-id. */
15557 cp_parser_late_return_type_opt (cp_parser
* parser
)
15561 /* Peek at the next token. */
15562 token
= cp_lexer_peek_token (parser
->lexer
);
15563 /* A late-specified return type is indicated by an initial '->'. */
15564 if (token
->type
!= CPP_DEREF
)
15567 /* Consume the ->. */
15568 cp_lexer_consume_token (parser
->lexer
);
15570 return cp_parser_trailing_type_id (parser
);
15573 /* Parse a declarator-id.
15577 :: [opt] nested-name-specifier [opt] type-name
15579 In the `id-expression' case, the value returned is as for
15580 cp_parser_id_expression if the id-expression was an unqualified-id.
15581 If the id-expression was a qualified-id, then a SCOPE_REF is
15582 returned. The first operand is the scope (either a NAMESPACE_DECL
15583 or TREE_TYPE), but the second is still just a representation of an
15587 cp_parser_declarator_id (cp_parser
* parser
, bool optional_p
)
15590 /* The expression must be an id-expression. Assume that qualified
15591 names are the names of types so that:
15594 int S<T>::R::i = 3;
15596 will work; we must treat `S<T>::R' as the name of a type.
15597 Similarly, assume that qualified names are templates, where
15601 int S<T>::R<T>::i = 3;
15604 id
= cp_parser_id_expression (parser
,
15605 /*template_keyword_p=*/false,
15606 /*check_dependency_p=*/false,
15607 /*template_p=*/NULL
,
15608 /*declarator_p=*/true,
15610 if (id
&& BASELINK_P (id
))
15611 id
= BASELINK_FUNCTIONS (id
);
15615 /* Parse a type-id.
15618 type-specifier-seq abstract-declarator [opt]
15620 Returns the TYPE specified. */
15623 cp_parser_type_id_1 (cp_parser
* parser
, bool is_template_arg
,
15624 bool is_trailing_return
)
15626 cp_decl_specifier_seq type_specifier_seq
;
15627 cp_declarator
*abstract_declarator
;
15629 /* Parse the type-specifier-seq. */
15630 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/false,
15631 is_trailing_return
,
15632 &type_specifier_seq
);
15633 if (type_specifier_seq
.type
== error_mark_node
)
15634 return error_mark_node
;
15636 /* There might or might not be an abstract declarator. */
15637 cp_parser_parse_tentatively (parser
);
15638 /* Look for the declarator. */
15639 abstract_declarator
15640 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_ABSTRACT
, NULL
,
15641 /*parenthesized_p=*/NULL
,
15642 /*member_p=*/false);
15643 /* Check to see if there really was a declarator. */
15644 if (!cp_parser_parse_definitely (parser
))
15645 abstract_declarator
= NULL
;
15647 if (type_specifier_seq
.type
15648 && type_uses_auto (type_specifier_seq
.type
))
15650 /* A type-id with type 'auto' is only ok if the abstract declarator
15651 is a function declarator with a late-specified return type. */
15652 if (abstract_declarator
15653 && abstract_declarator
->kind
== cdk_function
15654 && abstract_declarator
->u
.function
.late_return_type
)
15658 error ("invalid use of %<auto%>");
15659 return error_mark_node
;
15663 return groktypename (&type_specifier_seq
, abstract_declarator
,
15667 static tree
cp_parser_type_id (cp_parser
*parser
)
15669 return cp_parser_type_id_1 (parser
, false, false);
15672 static tree
cp_parser_template_type_arg (cp_parser
*parser
)
15674 return cp_parser_type_id_1 (parser
, true, false);
15677 static tree
cp_parser_trailing_type_id (cp_parser
*parser
)
15679 return cp_parser_type_id_1 (parser
, false, true);
15682 /* Parse a type-specifier-seq.
15684 type-specifier-seq:
15685 type-specifier type-specifier-seq [opt]
15689 type-specifier-seq:
15690 attributes type-specifier-seq [opt]
15692 If IS_DECLARATION is true, we are at the start of a "condition" or
15693 exception-declaration, so we might be followed by a declarator-id.
15695 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
15696 i.e. we've just seen "->".
15698 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
15701 cp_parser_type_specifier_seq (cp_parser
* parser
,
15702 bool is_declaration
,
15703 bool is_trailing_return
,
15704 cp_decl_specifier_seq
*type_specifier_seq
)
15706 bool seen_type_specifier
= false;
15707 cp_parser_flags flags
= CP_PARSER_FLAGS_OPTIONAL
;
15708 cp_token
*start_token
= NULL
;
15710 /* Clear the TYPE_SPECIFIER_SEQ. */
15711 clear_decl_specs (type_specifier_seq
);
15713 /* In the context of a trailing return type, enum E { } is an
15714 elaborated-type-specifier followed by a function-body, not an
15716 if (is_trailing_return
)
15717 flags
|= CP_PARSER_FLAGS_NO_TYPE_DEFINITIONS
;
15719 /* Parse the type-specifiers and attributes. */
15722 tree type_specifier
;
15723 bool is_cv_qualifier
;
15725 /* Check for attributes first. */
15726 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ATTRIBUTE
))
15728 type_specifier_seq
->attributes
=
15729 chainon (type_specifier_seq
->attributes
,
15730 cp_parser_attributes_opt (parser
));
15734 /* record the token of the beginning of the type specifier seq,
15735 for error reporting purposes*/
15737 start_token
= cp_lexer_peek_token (parser
->lexer
);
15739 /* Look for the type-specifier. */
15740 type_specifier
= cp_parser_type_specifier (parser
,
15742 type_specifier_seq
,
15743 /*is_declaration=*/false,
15746 if (!type_specifier
)
15748 /* If the first type-specifier could not be found, this is not a
15749 type-specifier-seq at all. */
15750 if (!seen_type_specifier
)
15752 cp_parser_error (parser
, "expected type-specifier");
15753 type_specifier_seq
->type
= error_mark_node
;
15756 /* If subsequent type-specifiers could not be found, the
15757 type-specifier-seq is complete. */
15761 seen_type_specifier
= true;
15762 /* The standard says that a condition can be:
15764 type-specifier-seq declarator = assignment-expression
15771 we should treat the "S" as a declarator, not as a
15772 type-specifier. The standard doesn't say that explicitly for
15773 type-specifier-seq, but it does say that for
15774 decl-specifier-seq in an ordinary declaration. Perhaps it
15775 would be clearer just to allow a decl-specifier-seq here, and
15776 then add a semantic restriction that if any decl-specifiers
15777 that are not type-specifiers appear, the program is invalid. */
15778 if (is_declaration
&& !is_cv_qualifier
)
15779 flags
|= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
;
15782 cp_parser_check_decl_spec (type_specifier_seq
, start_token
->location
);
15785 /* Parse a parameter-declaration-clause.
15787 parameter-declaration-clause:
15788 parameter-declaration-list [opt] ... [opt]
15789 parameter-declaration-list , ...
15791 Returns a representation for the parameter declarations. A return
15792 value of NULL indicates a parameter-declaration-clause consisting
15793 only of an ellipsis. */
15796 cp_parser_parameter_declaration_clause (cp_parser
* parser
)
15803 /* Peek at the next token. */
15804 token
= cp_lexer_peek_token (parser
->lexer
);
15805 /* Check for trivial parameter-declaration-clauses. */
15806 if (token
->type
== CPP_ELLIPSIS
)
15808 /* Consume the `...' token. */
15809 cp_lexer_consume_token (parser
->lexer
);
15812 else if (token
->type
== CPP_CLOSE_PAREN
)
15813 /* There are no parameters. */
15815 #ifndef NO_IMPLICIT_EXTERN_C
15816 if (in_system_header
&& current_class_type
== NULL
15817 && current_lang_name
== lang_name_c
)
15821 return void_list_node
;
15823 /* Check for `(void)', too, which is a special case. */
15824 else if (token
->keyword
== RID_VOID
15825 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
15826 == CPP_CLOSE_PAREN
))
15828 /* Consume the `void' token. */
15829 cp_lexer_consume_token (parser
->lexer
);
15830 /* There are no parameters. */
15831 return void_list_node
;
15834 /* Parse the parameter-declaration-list. */
15835 parameters
= cp_parser_parameter_declaration_list (parser
, &is_error
);
15836 /* If a parse error occurred while parsing the
15837 parameter-declaration-list, then the entire
15838 parameter-declaration-clause is erroneous. */
15842 /* Peek at the next token. */
15843 token
= cp_lexer_peek_token (parser
->lexer
);
15844 /* If it's a `,', the clause should terminate with an ellipsis. */
15845 if (token
->type
== CPP_COMMA
)
15847 /* Consume the `,'. */
15848 cp_lexer_consume_token (parser
->lexer
);
15849 /* Expect an ellipsis. */
15851 = (cp_parser_require (parser
, CPP_ELLIPSIS
, RT_ELLIPSIS
) != NULL
);
15853 /* It might also be `...' if the optional trailing `,' was
15855 else if (token
->type
== CPP_ELLIPSIS
)
15857 /* Consume the `...' token. */
15858 cp_lexer_consume_token (parser
->lexer
);
15859 /* And remember that we saw it. */
15863 ellipsis_p
= false;
15865 /* Finish the parameter list. */
15867 parameters
= chainon (parameters
, void_list_node
);
15872 /* Parse a parameter-declaration-list.
15874 parameter-declaration-list:
15875 parameter-declaration
15876 parameter-declaration-list , parameter-declaration
15878 Returns a representation of the parameter-declaration-list, as for
15879 cp_parser_parameter_declaration_clause. However, the
15880 `void_list_node' is never appended to the list. Upon return,
15881 *IS_ERROR will be true iff an error occurred. */
15884 cp_parser_parameter_declaration_list (cp_parser
* parser
, bool *is_error
)
15886 tree parameters
= NULL_TREE
;
15887 tree
*tail
= ¶meters
;
15888 bool saved_in_unbraced_linkage_specification_p
;
15891 /* Assume all will go well. */
15893 /* The special considerations that apply to a function within an
15894 unbraced linkage specifications do not apply to the parameters
15895 to the function. */
15896 saved_in_unbraced_linkage_specification_p
15897 = parser
->in_unbraced_linkage_specification_p
;
15898 parser
->in_unbraced_linkage_specification_p
= false;
15900 /* Look for more parameters. */
15903 cp_parameter_declarator
*parameter
;
15904 tree decl
= error_mark_node
;
15905 bool parenthesized_p
;
15906 /* Parse the parameter. */
15908 = cp_parser_parameter_declaration (parser
,
15909 /*template_parm_p=*/false,
15912 /* We don't know yet if the enclosing context is deprecated, so wait
15913 and warn in grokparms if appropriate. */
15914 deprecated_state
= DEPRECATED_SUPPRESS
;
15917 decl
= grokdeclarator (parameter
->declarator
,
15918 ¶meter
->decl_specifiers
,
15920 parameter
->default_argument
!= NULL_TREE
,
15921 ¶meter
->decl_specifiers
.attributes
);
15923 deprecated_state
= DEPRECATED_NORMAL
;
15925 /* If a parse error occurred parsing the parameter declaration,
15926 then the entire parameter-declaration-list is erroneous. */
15927 if (decl
== error_mark_node
)
15930 parameters
= error_mark_node
;
15934 if (parameter
->decl_specifiers
.attributes
)
15935 cplus_decl_attributes (&decl
,
15936 parameter
->decl_specifiers
.attributes
,
15938 if (DECL_NAME (decl
))
15939 decl
= pushdecl (decl
);
15941 if (decl
!= error_mark_node
)
15943 retrofit_lang_decl (decl
);
15944 DECL_PARM_INDEX (decl
) = ++index
;
15945 DECL_PARM_LEVEL (decl
) = function_parm_depth ();
15948 /* Add the new parameter to the list. */
15949 *tail
= build_tree_list (parameter
->default_argument
, decl
);
15950 tail
= &TREE_CHAIN (*tail
);
15952 /* Peek at the next token. */
15953 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
)
15954 || cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
)
15955 /* These are for Objective-C++ */
15956 || cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
15957 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
15958 /* The parameter-declaration-list is complete. */
15960 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
15964 /* Peek at the next token. */
15965 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
15966 /* If it's an ellipsis, then the list is complete. */
15967 if (token
->type
== CPP_ELLIPSIS
)
15969 /* Otherwise, there must be more parameters. Consume the
15971 cp_lexer_consume_token (parser
->lexer
);
15972 /* When parsing something like:
15974 int i(float f, double d)
15976 we can tell after seeing the declaration for "f" that we
15977 are not looking at an initialization of a variable "i",
15978 but rather at the declaration of a function "i".
15980 Due to the fact that the parsing of template arguments
15981 (as specified to a template-id) requires backtracking we
15982 cannot use this technique when inside a template argument
15984 if (!parser
->in_template_argument_list_p
15985 && !parser
->in_type_id_in_expr_p
15986 && cp_parser_uncommitted_to_tentative_parse_p (parser
)
15987 /* However, a parameter-declaration of the form
15988 "foat(f)" (which is a valid declaration of a
15989 parameter "f") can also be interpreted as an
15990 expression (the conversion of "f" to "float"). */
15991 && !parenthesized_p
)
15992 cp_parser_commit_to_tentative_parse (parser
);
15996 cp_parser_error (parser
, "expected %<,%> or %<...%>");
15997 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
15998 cp_parser_skip_to_closing_parenthesis (parser
,
15999 /*recovering=*/true,
16000 /*or_comma=*/false,
16001 /*consume_paren=*/false);
16006 parser
->in_unbraced_linkage_specification_p
16007 = saved_in_unbraced_linkage_specification_p
;
16012 /* Parse a parameter declaration.
16014 parameter-declaration:
16015 decl-specifier-seq ... [opt] declarator
16016 decl-specifier-seq declarator = assignment-expression
16017 decl-specifier-seq ... [opt] abstract-declarator [opt]
16018 decl-specifier-seq abstract-declarator [opt] = assignment-expression
16020 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
16021 declares a template parameter. (In that case, a non-nested `>'
16022 token encountered during the parsing of the assignment-expression
16023 is not interpreted as a greater-than operator.)
16025 Returns a representation of the parameter, or NULL if an error
16026 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
16027 true iff the declarator is of the form "(p)". */
16029 static cp_parameter_declarator
*
16030 cp_parser_parameter_declaration (cp_parser
*parser
,
16031 bool template_parm_p
,
16032 bool *parenthesized_p
)
16034 int declares_class_or_enum
;
16035 cp_decl_specifier_seq decl_specifiers
;
16036 cp_declarator
*declarator
;
16037 tree default_argument
;
16038 cp_token
*token
= NULL
, *declarator_token_start
= NULL
;
16039 const char *saved_message
;
16041 /* In a template parameter, `>' is not an operator.
16045 When parsing a default template-argument for a non-type
16046 template-parameter, the first non-nested `>' is taken as the end
16047 of the template parameter-list rather than a greater-than
16050 /* Type definitions may not appear in parameter types. */
16051 saved_message
= parser
->type_definition_forbidden_message
;
16052 parser
->type_definition_forbidden_message
16053 = G_("types may not be defined in parameter types");
16055 /* Parse the declaration-specifiers. */
16056 cp_parser_decl_specifier_seq (parser
,
16057 CP_PARSER_FLAGS_NONE
,
16059 &declares_class_or_enum
);
16061 /* Complain about missing 'typename' or other invalid type names. */
16062 if (!decl_specifiers
.any_type_specifiers_p
)
16063 cp_parser_parse_and_diagnose_invalid_type_name (parser
);
16065 /* If an error occurred, there's no reason to attempt to parse the
16066 rest of the declaration. */
16067 if (cp_parser_error_occurred (parser
))
16069 parser
->type_definition_forbidden_message
= saved_message
;
16073 /* Peek at the next token. */
16074 token
= cp_lexer_peek_token (parser
->lexer
);
16076 /* If the next token is a `)', `,', `=', `>', or `...', then there
16077 is no declarator. However, when variadic templates are enabled,
16078 there may be a declarator following `...'. */
16079 if (token
->type
== CPP_CLOSE_PAREN
16080 || token
->type
== CPP_COMMA
16081 || token
->type
== CPP_EQ
16082 || token
->type
== CPP_GREATER
)
16085 if (parenthesized_p
)
16086 *parenthesized_p
= false;
16088 /* Otherwise, there should be a declarator. */
16091 bool saved_default_arg_ok_p
= parser
->default_arg_ok_p
;
16092 parser
->default_arg_ok_p
= false;
16094 /* After seeing a decl-specifier-seq, if the next token is not a
16095 "(", there is no possibility that the code is a valid
16096 expression. Therefore, if parsing tentatively, we commit at
16098 if (!parser
->in_template_argument_list_p
16099 /* In an expression context, having seen:
16103 we cannot be sure whether we are looking at a
16104 function-type (taking a "char" as a parameter) or a cast
16105 of some object of type "char" to "int". */
16106 && !parser
->in_type_id_in_expr_p
16107 && cp_parser_uncommitted_to_tentative_parse_p (parser
)
16108 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_PAREN
))
16109 cp_parser_commit_to_tentative_parse (parser
);
16110 /* Parse the declarator. */
16111 declarator_token_start
= token
;
16112 declarator
= cp_parser_declarator (parser
,
16113 CP_PARSER_DECLARATOR_EITHER
,
16114 /*ctor_dtor_or_conv_p=*/NULL
,
16116 /*member_p=*/false);
16117 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
16118 /* After the declarator, allow more attributes. */
16119 decl_specifiers
.attributes
16120 = chainon (decl_specifiers
.attributes
,
16121 cp_parser_attributes_opt (parser
));
16124 /* If the next token is an ellipsis, and we have not seen a
16125 declarator name, and the type of the declarator contains parameter
16126 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
16127 a parameter pack expansion expression. Otherwise, leave the
16128 ellipsis for a C-style variadic function. */
16129 token
= cp_lexer_peek_token (parser
->lexer
);
16130 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
16132 tree type
= decl_specifiers
.type
;
16134 if (type
&& DECL_P (type
))
16135 type
= TREE_TYPE (type
);
16138 && TREE_CODE (type
) != TYPE_PACK_EXPANSION
16139 && declarator_can_be_parameter_pack (declarator
)
16140 && (!declarator
|| !declarator
->parameter_pack_p
)
16141 && uses_parameter_packs (type
))
16143 /* Consume the `...'. */
16144 cp_lexer_consume_token (parser
->lexer
);
16145 maybe_warn_variadic_templates ();
16147 /* Build a pack expansion type */
16149 declarator
->parameter_pack_p
= true;
16151 decl_specifiers
.type
= make_pack_expansion (type
);
16155 /* The restriction on defining new types applies only to the type
16156 of the parameter, not to the default argument. */
16157 parser
->type_definition_forbidden_message
= saved_message
;
16159 /* If the next token is `=', then process a default argument. */
16160 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
16162 /* Consume the `='. */
16163 cp_lexer_consume_token (parser
->lexer
);
16165 /* If we are defining a class, then the tokens that make up the
16166 default argument must be saved and processed later. */
16167 if (!template_parm_p
&& at_class_scope_p ()
16168 && TYPE_BEING_DEFINED (current_class_type
)
16169 && !LAMBDA_TYPE_P (current_class_type
))
16171 unsigned depth
= 0;
16172 int maybe_template_id
= 0;
16173 cp_token
*first_token
;
16176 /* Add tokens until we have processed the entire default
16177 argument. We add the range [first_token, token). */
16178 first_token
= cp_lexer_peek_token (parser
->lexer
);
16183 /* Peek at the next token. */
16184 token
= cp_lexer_peek_token (parser
->lexer
);
16185 /* What we do depends on what token we have. */
16186 switch (token
->type
)
16188 /* In valid code, a default argument must be
16189 immediately followed by a `,' `)', or `...'. */
16191 if (depth
== 0 && maybe_template_id
)
16193 /* If we've seen a '<', we might be in a
16194 template-argument-list. Until Core issue 325 is
16195 resolved, we don't know how this situation ought
16196 to be handled, so try to DTRT. We check whether
16197 what comes after the comma is a valid parameter
16198 declaration list. If it is, then the comma ends
16199 the default argument; otherwise the default
16200 argument continues. */
16201 bool error
= false;
16204 /* Set ITALP so cp_parser_parameter_declaration_list
16205 doesn't decide to commit to this parse. */
16206 bool saved_italp
= parser
->in_template_argument_list_p
;
16207 parser
->in_template_argument_list_p
= true;
16209 cp_parser_parse_tentatively (parser
);
16210 cp_lexer_consume_token (parser
->lexer
);
16211 begin_scope (sk_function_parms
, NULL_TREE
);
16212 cp_parser_parameter_declaration_list (parser
, &error
);
16213 for (t
= current_binding_level
->names
; t
; t
= DECL_CHAIN (t
))
16214 pop_binding (DECL_NAME (t
), t
);
16216 if (!cp_parser_error_occurred (parser
) && !error
)
16218 cp_parser_abort_tentative_parse (parser
);
16220 parser
->in_template_argument_list_p
= saved_italp
;
16223 case CPP_CLOSE_PAREN
:
16225 /* If we run into a non-nested `;', `}', or `]',
16226 then the code is invalid -- but the default
16227 argument is certainly over. */
16228 case CPP_SEMICOLON
:
16229 case CPP_CLOSE_BRACE
:
16230 case CPP_CLOSE_SQUARE
:
16233 /* Update DEPTH, if necessary. */
16234 else if (token
->type
== CPP_CLOSE_PAREN
16235 || token
->type
== CPP_CLOSE_BRACE
16236 || token
->type
== CPP_CLOSE_SQUARE
)
16240 case CPP_OPEN_PAREN
:
16241 case CPP_OPEN_SQUARE
:
16242 case CPP_OPEN_BRACE
:
16248 /* This might be the comparison operator, or it might
16249 start a template argument list. */
16250 ++maybe_template_id
;
16254 if (cxx_dialect
== cxx98
)
16256 /* Fall through for C++0x, which treats the `>>'
16257 operator like two `>' tokens in certain
16263 /* This might be an operator, or it might close a
16264 template argument list. But if a previous '<'
16265 started a template argument list, this will have
16266 closed it, so we can't be in one anymore. */
16267 maybe_template_id
-= 1 + (token
->type
== CPP_RSHIFT
);
16268 if (maybe_template_id
< 0)
16269 maybe_template_id
= 0;
16273 /* If we run out of tokens, issue an error message. */
16275 case CPP_PRAGMA_EOL
:
16276 error_at (token
->location
, "file ends in default argument");
16282 /* In these cases, we should look for template-ids.
16283 For example, if the default argument is
16284 `X<int, double>()', we need to do name lookup to
16285 figure out whether or not `X' is a template; if
16286 so, the `,' does not end the default argument.
16288 That is not yet done. */
16295 /* If we've reached the end, stop. */
16299 /* Add the token to the token block. */
16300 token
= cp_lexer_consume_token (parser
->lexer
);
16303 /* Create a DEFAULT_ARG to represent the unparsed default
16305 default_argument
= make_node (DEFAULT_ARG
);
16306 DEFARG_TOKENS (default_argument
)
16307 = cp_token_cache_new (first_token
, token
);
16308 DEFARG_INSTANTIATIONS (default_argument
) = NULL
;
16310 /* Outside of a class definition, we can just parse the
16311 assignment-expression. */
16314 token
= cp_lexer_peek_token (parser
->lexer
);
16316 = cp_parser_default_argument (parser
, template_parm_p
);
16319 if (!parser
->default_arg_ok_p
)
16321 if (flag_permissive
)
16322 warning (0, "deprecated use of default argument for parameter of non-function");
16325 error_at (token
->location
,
16326 "default arguments are only "
16327 "permitted for function parameters");
16328 default_argument
= NULL_TREE
;
16331 else if ((declarator
&& declarator
->parameter_pack_p
)
16332 || (decl_specifiers
.type
16333 && PACK_EXPANSION_P (decl_specifiers
.type
)))
16335 /* Find the name of the parameter pack. */
16336 cp_declarator
*id_declarator
= declarator
;
16337 while (id_declarator
&& id_declarator
->kind
!= cdk_id
)
16338 id_declarator
= id_declarator
->declarator
;
16340 if (id_declarator
&& id_declarator
->kind
== cdk_id
)
16341 error_at (declarator_token_start
->location
,
16343 ? "template parameter pack %qD"
16344 " cannot have a default argument"
16345 : "parameter pack %qD cannot have a default argument",
16346 id_declarator
->u
.id
.unqualified_name
);
16348 error_at (declarator_token_start
->location
,
16350 ? "template parameter pack cannot have a default argument"
16351 : "parameter pack cannot have a default argument");
16353 default_argument
= NULL_TREE
;
16357 default_argument
= NULL_TREE
;
16359 return make_parameter_declarator (&decl_specifiers
,
16364 /* Parse a default argument and return it.
16366 TEMPLATE_PARM_P is true if this is a default argument for a
16367 non-type template parameter. */
16369 cp_parser_default_argument (cp_parser
*parser
, bool template_parm_p
)
16371 tree default_argument
= NULL_TREE
;
16372 bool saved_greater_than_is_operator_p
;
16373 bool saved_local_variables_forbidden_p
;
16375 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
16377 saved_greater_than_is_operator_p
= parser
->greater_than_is_operator_p
;
16378 parser
->greater_than_is_operator_p
= !template_parm_p
;
16379 /* Local variable names (and the `this' keyword) may not
16380 appear in a default argument. */
16381 saved_local_variables_forbidden_p
= parser
->local_variables_forbidden_p
;
16382 parser
->local_variables_forbidden_p
= true;
16383 /* Parse the assignment-expression. */
16384 if (template_parm_p
)
16385 push_deferring_access_checks (dk_no_deferred
);
16387 = cp_parser_assignment_expression (parser
, /*cast_p=*/false, NULL
);
16388 if (template_parm_p
)
16389 pop_deferring_access_checks ();
16390 parser
->greater_than_is_operator_p
= saved_greater_than_is_operator_p
;
16391 parser
->local_variables_forbidden_p
= saved_local_variables_forbidden_p
;
16393 return default_argument
;
16396 /* Parse a function-body.
16399 compound_statement */
16402 cp_parser_function_body (cp_parser
*parser
)
16404 cp_parser_compound_statement (parser
, NULL
, false);
16407 /* Parse a ctor-initializer-opt followed by a function-body. Return
16408 true if a ctor-initializer was present. */
16411 cp_parser_ctor_initializer_opt_and_function_body (cp_parser
*parser
)
16414 bool ctor_initializer_p
;
16415 const bool check_body_p
=
16416 DECL_CONSTRUCTOR_P (current_function_decl
)
16417 && DECL_DECLARED_CONSTEXPR_P (current_function_decl
);
16420 /* Begin the function body. */
16421 body
= begin_function_body ();
16422 /* Parse the optional ctor-initializer. */
16423 ctor_initializer_p
= cp_parser_ctor_initializer_opt (parser
);
16425 /* If we're parsing a constexpr constructor definition, we need
16426 to check that the constructor body is indeed empty. However,
16427 before we get to cp_parser_function_body lot of junk has been
16428 generated, so we can't just check that we have an empty block.
16429 Rather we take a snapshot of the outermost block, and check whether
16430 cp_parser_function_body changed its state. */
16434 if (TREE_CODE (list
) == BIND_EXPR
)
16435 list
= BIND_EXPR_BODY (list
);
16436 if (TREE_CODE (list
) == STATEMENT_LIST
16437 && STATEMENT_LIST_TAIL (list
) != NULL
)
16438 last
= STATEMENT_LIST_TAIL (list
)->stmt
;
16440 /* Parse the function-body. */
16441 cp_parser_function_body (parser
);
16443 check_constexpr_ctor_body (last
, list
);
16444 /* Finish the function body. */
16445 finish_function_body (body
);
16447 return ctor_initializer_p
;
16450 /* Parse an initializer.
16453 = initializer-clause
16454 ( expression-list )
16456 Returns an expression representing the initializer. If no
16457 initializer is present, NULL_TREE is returned.
16459 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
16460 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
16461 set to TRUE if there is no initializer present. If there is an
16462 initializer, and it is not a constant-expression, *NON_CONSTANT_P
16463 is set to true; otherwise it is set to false. */
16466 cp_parser_initializer (cp_parser
* parser
, bool* is_direct_init
,
16467 bool* non_constant_p
)
16472 /* Peek at the next token. */
16473 token
= cp_lexer_peek_token (parser
->lexer
);
16475 /* Let our caller know whether or not this initializer was
16477 *is_direct_init
= (token
->type
!= CPP_EQ
);
16478 /* Assume that the initializer is constant. */
16479 *non_constant_p
= false;
16481 if (token
->type
== CPP_EQ
)
16483 /* Consume the `='. */
16484 cp_lexer_consume_token (parser
->lexer
);
16485 /* Parse the initializer-clause. */
16486 init
= cp_parser_initializer_clause (parser
, non_constant_p
);
16488 else if (token
->type
== CPP_OPEN_PAREN
)
16491 vec
= cp_parser_parenthesized_expression_list (parser
, non_attr
,
16493 /*allow_expansion_p=*/true,
16496 return error_mark_node
;
16497 init
= build_tree_list_vec (vec
);
16498 release_tree_vector (vec
);
16500 else if (token
->type
== CPP_OPEN_BRACE
)
16502 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
16503 init
= cp_parser_braced_list (parser
, non_constant_p
);
16504 CONSTRUCTOR_IS_DIRECT_INIT (init
) = 1;
16508 /* Anything else is an error. */
16509 cp_parser_error (parser
, "expected initializer");
16510 init
= error_mark_node
;
16516 /* Parse an initializer-clause.
16518 initializer-clause:
16519 assignment-expression
16522 Returns an expression representing the initializer.
16524 If the `assignment-expression' production is used the value
16525 returned is simply a representation for the expression.
16527 Otherwise, calls cp_parser_braced_list. */
16530 cp_parser_initializer_clause (cp_parser
* parser
, bool* non_constant_p
)
16534 /* Assume the expression is constant. */
16535 *non_constant_p
= false;
16537 /* If it is not a `{', then we are looking at an
16538 assignment-expression. */
16539 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
))
16542 = cp_parser_constant_expression (parser
,
16543 /*allow_non_constant_p=*/true,
16545 if (!*non_constant_p
)
16547 /* We only want to fold if this is really a constant
16548 expression. FIXME Actually, we don't want to fold here, but in
16550 tree folded
= fold_non_dependent_expr (initializer
);
16551 folded
= maybe_constant_value (folded
);
16552 if (TREE_CONSTANT (folded
))
16553 initializer
= folded
;
16557 initializer
= cp_parser_braced_list (parser
, non_constant_p
);
16559 return initializer
;
16562 /* Parse a brace-enclosed initializer list.
16565 { initializer-list , [opt] }
16568 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
16569 the elements of the initializer-list (or NULL, if the last
16570 production is used). The TREE_TYPE for the CONSTRUCTOR will be
16571 NULL_TREE. There is no way to detect whether or not the optional
16572 trailing `,' was provided. NON_CONSTANT_P is as for
16573 cp_parser_initializer. */
16576 cp_parser_braced_list (cp_parser
* parser
, bool* non_constant_p
)
16580 /* Consume the `{' token. */
16581 cp_lexer_consume_token (parser
->lexer
);
16582 /* Create a CONSTRUCTOR to represent the braced-initializer. */
16583 initializer
= make_node (CONSTRUCTOR
);
16584 /* If it's not a `}', then there is a non-trivial initializer. */
16585 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_BRACE
))
16587 /* Parse the initializer list. */
16588 CONSTRUCTOR_ELTS (initializer
)
16589 = cp_parser_initializer_list (parser
, non_constant_p
);
16590 /* A trailing `,' token is allowed. */
16591 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
16592 cp_lexer_consume_token (parser
->lexer
);
16594 /* Now, there should be a trailing `}'. */
16595 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
16596 TREE_TYPE (initializer
) = init_list_type_node
;
16597 return initializer
;
16600 /* Parse an initializer-list.
16603 initializer-clause ... [opt]
16604 initializer-list , initializer-clause ... [opt]
16609 identifier : initializer-clause
16610 initializer-list, identifier : initializer-clause
16612 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
16613 for the initializer. If the INDEX of the elt is non-NULL, it is the
16614 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
16615 as for cp_parser_initializer. */
16617 static VEC(constructor_elt
,gc
) *
16618 cp_parser_initializer_list (cp_parser
* parser
, bool* non_constant_p
)
16620 VEC(constructor_elt
,gc
) *v
= NULL
;
16622 /* Assume all of the expressions are constant. */
16623 *non_constant_p
= false;
16625 /* Parse the rest of the list. */
16631 bool clause_non_constant_p
;
16633 /* If the next token is an identifier and the following one is a
16634 colon, we are looking at the GNU designated-initializer
16636 if (cp_parser_allow_gnu_extensions_p (parser
)
16637 && cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
)
16638 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_COLON
)
16640 /* Warn the user that they are using an extension. */
16641 pedwarn (input_location
, OPT_pedantic
,
16642 "ISO C++ does not allow designated initializers");
16643 /* Consume the identifier. */
16644 identifier
= cp_lexer_consume_token (parser
->lexer
)->u
.value
;
16645 /* Consume the `:'. */
16646 cp_lexer_consume_token (parser
->lexer
);
16649 identifier
= NULL_TREE
;
16651 /* Parse the initializer. */
16652 initializer
= cp_parser_initializer_clause (parser
,
16653 &clause_non_constant_p
);
16654 /* If any clause is non-constant, so is the entire initializer. */
16655 if (clause_non_constant_p
)
16656 *non_constant_p
= true;
16658 /* If we have an ellipsis, this is an initializer pack
16660 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
16662 /* Consume the `...'. */
16663 cp_lexer_consume_token (parser
->lexer
);
16665 /* Turn the initializer into an initializer expansion. */
16666 initializer
= make_pack_expansion (initializer
);
16669 /* Add it to the vector. */
16670 CONSTRUCTOR_APPEND_ELT(v
, identifier
, initializer
);
16672 /* If the next token is not a comma, we have reached the end of
16674 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
16677 /* Peek at the next token. */
16678 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
16679 /* If the next token is a `}', then we're still done. An
16680 initializer-clause can have a trailing `,' after the
16681 initializer-list and before the closing `}'. */
16682 if (token
->type
== CPP_CLOSE_BRACE
)
16685 /* Consume the `,' token. */
16686 cp_lexer_consume_token (parser
->lexer
);
16692 /* Classes [gram.class] */
16694 /* Parse a class-name.
16700 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
16701 to indicate that names looked up in dependent types should be
16702 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
16703 keyword has been used to indicate that the name that appears next
16704 is a template. TAG_TYPE indicates the explicit tag given before
16705 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
16706 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
16707 is the class being defined in a class-head.
16709 Returns the TYPE_DECL representing the class. */
16712 cp_parser_class_name (cp_parser
*parser
,
16713 bool typename_keyword_p
,
16714 bool template_keyword_p
,
16715 enum tag_types tag_type
,
16716 bool check_dependency_p
,
16718 bool is_declaration
)
16724 tree identifier
= NULL_TREE
;
16726 /* All class-names start with an identifier. */
16727 token
= cp_lexer_peek_token (parser
->lexer
);
16728 if (token
->type
!= CPP_NAME
&& token
->type
!= CPP_TEMPLATE_ID
)
16730 cp_parser_error (parser
, "expected class-name");
16731 return error_mark_node
;
16734 /* PARSER->SCOPE can be cleared when parsing the template-arguments
16735 to a template-id, so we save it here. */
16736 scope
= parser
->scope
;
16737 if (scope
== error_mark_node
)
16738 return error_mark_node
;
16740 /* Any name names a type if we're following the `typename' keyword
16741 in a qualified name where the enclosing scope is type-dependent. */
16742 typename_p
= (typename_keyword_p
&& scope
&& TYPE_P (scope
)
16743 && dependent_type_p (scope
));
16744 /* Handle the common case (an identifier, but not a template-id)
16746 if (token
->type
== CPP_NAME
16747 && !cp_parser_nth_token_starts_template_argument_list_p (parser
, 2))
16749 cp_token
*identifier_token
;
16752 /* Look for the identifier. */
16753 identifier_token
= cp_lexer_peek_token (parser
->lexer
);
16754 ambiguous_p
= identifier_token
->ambiguous_p
;
16755 identifier
= cp_parser_identifier (parser
);
16756 /* If the next token isn't an identifier, we are certainly not
16757 looking at a class-name. */
16758 if (identifier
== error_mark_node
)
16759 decl
= error_mark_node
;
16760 /* If we know this is a type-name, there's no need to look it
16762 else if (typename_p
)
16766 tree ambiguous_decls
;
16767 /* If we already know that this lookup is ambiguous, then
16768 we've already issued an error message; there's no reason
16772 cp_parser_simulate_error (parser
);
16773 return error_mark_node
;
16775 /* If the next token is a `::', then the name must be a type
16778 [basic.lookup.qual]
16780 During the lookup for a name preceding the :: scope
16781 resolution operator, object, function, and enumerator
16782 names are ignored. */
16783 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
16784 tag_type
= typename_type
;
16785 /* Look up the name. */
16786 decl
= cp_parser_lookup_name (parser
, identifier
,
16788 /*is_template=*/false,
16789 /*is_namespace=*/false,
16790 check_dependency_p
,
16792 identifier_token
->location
);
16793 if (ambiguous_decls
)
16795 if (cp_parser_parsing_tentatively (parser
))
16796 cp_parser_simulate_error (parser
);
16797 return error_mark_node
;
16803 /* Try a template-id. */
16804 decl
= cp_parser_template_id (parser
, template_keyword_p
,
16805 check_dependency_p
,
16807 if (decl
== error_mark_node
)
16808 return error_mark_node
;
16811 decl
= cp_parser_maybe_treat_template_as_class (decl
, class_head_p
);
16813 /* If this is a typename, create a TYPENAME_TYPE. */
16814 if (typename_p
&& decl
!= error_mark_node
)
16816 decl
= make_typename_type (scope
, decl
, typename_type
,
16817 /*complain=*/tf_error
);
16818 if (decl
!= error_mark_node
)
16819 decl
= TYPE_NAME (decl
);
16822 /* Check to see that it is really the name of a class. */
16823 if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
16824 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
16825 && cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
16826 /* Situations like this:
16828 template <typename T> struct A {
16829 typename T::template X<int>::I i;
16832 are problematic. Is `T::template X<int>' a class-name? The
16833 standard does not seem to be definitive, but there is no other
16834 valid interpretation of the following `::'. Therefore, those
16835 names are considered class-names. */
16837 decl
= make_typename_type (scope
, decl
, tag_type
, tf_error
);
16838 if (decl
!= error_mark_node
)
16839 decl
= TYPE_NAME (decl
);
16841 else if (TREE_CODE (decl
) != TYPE_DECL
16842 || TREE_TYPE (decl
) == error_mark_node
16843 || !MAYBE_CLASS_TYPE_P (TREE_TYPE (decl
))
16844 /* In Objective-C 2.0, a classname followed by '.' starts a
16845 dot-syntax expression, and it's not a type-name. */
16846 || (c_dialect_objc ()
16847 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_DOT
16848 && objc_is_class_name (decl
)))
16849 decl
= error_mark_node
;
16851 if (decl
== error_mark_node
)
16852 cp_parser_error (parser
, "expected class-name");
16853 else if (identifier
&& !parser
->scope
)
16854 maybe_note_name_used_in_class (identifier
, decl
);
16859 /* Parse a class-specifier.
16862 class-head { member-specification [opt] }
16864 Returns the TREE_TYPE representing the class. */
16867 cp_parser_class_specifier (cp_parser
* parser
)
16870 tree attributes
= NULL_TREE
;
16871 bool nested_name_specifier_p
;
16872 unsigned saved_num_template_parameter_lists
;
16873 bool saved_in_function_body
;
16874 bool saved_in_unbraced_linkage_specification_p
;
16875 tree old_scope
= NULL_TREE
;
16876 tree scope
= NULL_TREE
;
16878 cp_token
*closing_brace
;
16880 push_deferring_access_checks (dk_no_deferred
);
16882 /* Parse the class-head. */
16883 type
= cp_parser_class_head (parser
,
16884 &nested_name_specifier_p
,
16887 /* If the class-head was a semantic disaster, skip the entire body
16891 cp_parser_skip_to_end_of_block_or_statement (parser
);
16892 pop_deferring_access_checks ();
16893 return error_mark_node
;
16896 /* Look for the `{'. */
16897 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
16899 pop_deferring_access_checks ();
16900 return error_mark_node
;
16903 /* Process the base classes. If they're invalid, skip the
16904 entire class body. */
16905 if (!xref_basetypes (type
, bases
))
16907 /* Consuming the closing brace yields better error messages
16909 if (cp_parser_skip_to_closing_brace (parser
))
16910 cp_lexer_consume_token (parser
->lexer
);
16911 pop_deferring_access_checks ();
16912 return error_mark_node
;
16915 /* Issue an error message if type-definitions are forbidden here. */
16916 cp_parser_check_type_definition (parser
);
16917 /* Remember that we are defining one more class. */
16918 ++parser
->num_classes_being_defined
;
16919 /* Inside the class, surrounding template-parameter-lists do not
16921 saved_num_template_parameter_lists
16922 = parser
->num_template_parameter_lists
;
16923 parser
->num_template_parameter_lists
= 0;
16924 /* We are not in a function body. */
16925 saved_in_function_body
= parser
->in_function_body
;
16926 parser
->in_function_body
= false;
16927 /* We are not immediately inside an extern "lang" block. */
16928 saved_in_unbraced_linkage_specification_p
16929 = parser
->in_unbraced_linkage_specification_p
;
16930 parser
->in_unbraced_linkage_specification_p
= false;
16932 /* Start the class. */
16933 if (nested_name_specifier_p
)
16935 scope
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (type
));
16936 old_scope
= push_inner_scope (scope
);
16938 type
= begin_class_definition (type
, attributes
);
16940 if (type
== error_mark_node
)
16941 /* If the type is erroneous, skip the entire body of the class. */
16942 cp_parser_skip_to_closing_brace (parser
);
16944 /* Parse the member-specification. */
16945 cp_parser_member_specification_opt (parser
);
16947 /* Look for the trailing `}'. */
16948 closing_brace
= cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
16949 /* Look for trailing attributes to apply to this class. */
16950 if (cp_parser_allow_gnu_extensions_p (parser
))
16951 attributes
= cp_parser_attributes_opt (parser
);
16952 if (type
!= error_mark_node
)
16953 type
= finish_struct (type
, attributes
);
16954 if (nested_name_specifier_p
)
16955 pop_inner_scope (old_scope
, scope
);
16957 /* We've finished a type definition. Check for the common syntax
16958 error of forgetting a semicolon after the definition. We need to
16959 be careful, as we can't just check for not-a-semicolon and be done
16960 with it; the user might have typed:
16962 class X { } c = ...;
16963 class X { } *p = ...;
16965 and so forth. Instead, enumerate all the possible tokens that
16966 might follow this production; if we don't see one of them, then
16967 complain and silently insert the semicolon. */
16969 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
16970 bool want_semicolon
= true;
16972 switch (token
->type
)
16975 case CPP_SEMICOLON
:
16978 case CPP_OPEN_PAREN
:
16979 case CPP_CLOSE_PAREN
:
16981 want_semicolon
= false;
16984 /* While it's legal for type qualifiers and storage class
16985 specifiers to follow type definitions in the grammar, only
16986 compiler testsuites contain code like that. Assume that if
16987 we see such code, then what we're really seeing is a case
16991 const <type> var = ...;
16996 static <type> func (...) ...
16998 i.e. the qualifier or specifier applies to the next
16999 declaration. To do so, however, we need to look ahead one
17000 more token to see if *that* token is a type specifier.
17002 This code could be improved to handle:
17005 static const <type> var = ...; */
17007 if (keyword_is_decl_specifier (token
->keyword
))
17009 cp_token
*lookahead
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
17011 /* Handling user-defined types here would be nice, but very
17014 = (lookahead
->type
== CPP_KEYWORD
17015 && keyword_begins_type_specifier (lookahead
->keyword
));
17022 /* If we don't have a type, then something is very wrong and we
17023 shouldn't try to do anything clever. Likewise for not seeing the
17025 if (closing_brace
&& TYPE_P (type
) && want_semicolon
)
17027 cp_token_position prev
17028 = cp_lexer_previous_token_position (parser
->lexer
);
17029 cp_token
*prev_token
= cp_lexer_token_at (parser
->lexer
, prev
);
17030 location_t loc
= prev_token
->location
;
17032 if (CLASSTYPE_DECLARED_CLASS (type
))
17033 error_at (loc
, "expected %<;%> after class definition");
17034 else if (TREE_CODE (type
) == RECORD_TYPE
)
17035 error_at (loc
, "expected %<;%> after struct definition");
17036 else if (TREE_CODE (type
) == UNION_TYPE
)
17037 error_at (loc
, "expected %<;%> after union definition");
17039 gcc_unreachable ();
17041 /* Unget one token and smash it to look as though we encountered
17042 a semicolon in the input stream. */
17043 cp_lexer_set_token_position (parser
->lexer
, prev
);
17044 token
= cp_lexer_peek_token (parser
->lexer
);
17045 token
->type
= CPP_SEMICOLON
;
17046 token
->keyword
= RID_MAX
;
17050 /* If this class is not itself within the scope of another class,
17051 then we need to parse the bodies of all of the queued function
17052 definitions. Note that the queued functions defined in a class
17053 are not always processed immediately following the
17054 class-specifier for that class. Consider:
17057 struct B { void f() { sizeof (A); } };
17060 If `f' were processed before the processing of `A' were
17061 completed, there would be no way to compute the size of `A'.
17062 Note that the nesting we are interested in here is lexical --
17063 not the semantic nesting given by TYPE_CONTEXT. In particular,
17066 struct A { struct B; };
17067 struct A::B { void f() { } };
17069 there is no need to delay the parsing of `A::B::f'. */
17070 if (--parser
->num_classes_being_defined
== 0)
17073 tree class_type
= NULL_TREE
;
17074 tree pushed_scope
= NULL_TREE
;
17076 cp_default_arg_entry
*e
;
17078 /* In a first pass, parse default arguments to the functions.
17079 Then, in a second pass, parse the bodies of the functions.
17080 This two-phased approach handles cases like:
17088 FOR_EACH_VEC_ELT (cp_default_arg_entry
, unparsed_funs_with_default_args
,
17092 /* If there are default arguments that have not yet been processed,
17093 take care of them now. */
17094 if (class_type
!= e
->class_type
)
17097 pop_scope (pushed_scope
);
17098 class_type
= e
->class_type
;
17099 pushed_scope
= push_scope (class_type
);
17101 /* Make sure that any template parameters are in scope. */
17102 maybe_begin_member_template_processing (fn
);
17103 /* Parse the default argument expressions. */
17104 cp_parser_late_parsing_default_args (parser
, fn
);
17105 /* Remove any template parameters from the symbol table. */
17106 maybe_end_member_template_processing ();
17109 pop_scope (pushed_scope
);
17110 VEC_truncate (cp_default_arg_entry
, unparsed_funs_with_default_args
, 0);
17111 /* Now parse the body of the functions. */
17112 FOR_EACH_VEC_ELT (tree
, unparsed_funs_with_definitions
, ix
, fn
)
17113 cp_parser_late_parsing_for_member (parser
, fn
);
17114 VEC_truncate (tree
, unparsed_funs_with_definitions
, 0);
17117 /* Put back any saved access checks. */
17118 pop_deferring_access_checks ();
17120 /* Restore saved state. */
17121 parser
->in_function_body
= saved_in_function_body
;
17122 parser
->num_template_parameter_lists
17123 = saved_num_template_parameter_lists
;
17124 parser
->in_unbraced_linkage_specification_p
17125 = saved_in_unbraced_linkage_specification_p
;
17130 /* Parse a class-head.
17133 class-key identifier [opt] base-clause [opt]
17134 class-key nested-name-specifier identifier base-clause [opt]
17135 class-key nested-name-specifier [opt] template-id
17139 class-key attributes identifier [opt] base-clause [opt]
17140 class-key attributes nested-name-specifier identifier base-clause [opt]
17141 class-key attributes nested-name-specifier [opt] template-id
17144 Upon return BASES is initialized to the list of base classes (or
17145 NULL, if there are none) in the same form returned by
17146 cp_parser_base_clause.
17148 Returns the TYPE of the indicated class. Sets
17149 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
17150 involving a nested-name-specifier was used, and FALSE otherwise.
17152 Returns error_mark_node if this is not a class-head.
17154 Returns NULL_TREE if the class-head is syntactically valid, but
17155 semantically invalid in a way that means we should skip the entire
17156 body of the class. */
17159 cp_parser_class_head (cp_parser
* parser
,
17160 bool* nested_name_specifier_p
,
17161 tree
*attributes_p
,
17164 tree nested_name_specifier
;
17165 enum tag_types class_key
;
17166 tree id
= NULL_TREE
;
17167 tree type
= NULL_TREE
;
17169 bool template_id_p
= false;
17170 bool qualified_p
= false;
17171 bool invalid_nested_name_p
= false;
17172 bool invalid_explicit_specialization_p
= false;
17173 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
17174 tree pushed_scope
= NULL_TREE
;
17175 unsigned num_templates
;
17176 cp_token
*type_start_token
= NULL
, *nested_name_specifier_token_start
= NULL
;
17177 /* Assume no nested-name-specifier will be present. */
17178 *nested_name_specifier_p
= false;
17179 /* Assume no template parameter lists will be used in defining the
17182 parser
->colon_corrects_to_scope_p
= false;
17184 *bases
= NULL_TREE
;
17186 /* Look for the class-key. */
17187 class_key
= cp_parser_class_key (parser
);
17188 if (class_key
== none_type
)
17189 return error_mark_node
;
17191 /* Parse the attributes. */
17192 attributes
= cp_parser_attributes_opt (parser
);
17194 /* If the next token is `::', that is invalid -- but sometimes
17195 people do try to write:
17199 Handle this gracefully by accepting the extra qualifier, and then
17200 issuing an error about it later if this really is a
17201 class-head. If it turns out just to be an elaborated type
17202 specifier, remain silent. */
17203 if (cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false))
17204 qualified_p
= true;
17206 push_deferring_access_checks (dk_no_check
);
17208 /* Determine the name of the class. Begin by looking for an
17209 optional nested-name-specifier. */
17210 nested_name_specifier_token_start
= cp_lexer_peek_token (parser
->lexer
);
17211 nested_name_specifier
17212 = cp_parser_nested_name_specifier_opt (parser
,
17213 /*typename_keyword_p=*/false,
17214 /*check_dependency_p=*/false,
17216 /*is_declaration=*/false);
17217 /* If there was a nested-name-specifier, then there *must* be an
17219 if (nested_name_specifier
)
17221 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
17222 /* Although the grammar says `identifier', it really means
17223 `class-name' or `template-name'. You are only allowed to
17224 define a class that has already been declared with this
17227 The proposed resolution for Core Issue 180 says that wherever
17228 you see `class T::X' you should treat `X' as a type-name.
17230 It is OK to define an inaccessible class; for example:
17232 class A { class B; };
17235 We do not know if we will see a class-name, or a
17236 template-name. We look for a class-name first, in case the
17237 class-name is a template-id; if we looked for the
17238 template-name first we would stop after the template-name. */
17239 cp_parser_parse_tentatively (parser
);
17240 type
= cp_parser_class_name (parser
,
17241 /*typename_keyword_p=*/false,
17242 /*template_keyword_p=*/false,
17244 /*check_dependency_p=*/false,
17245 /*class_head_p=*/true,
17246 /*is_declaration=*/false);
17247 /* If that didn't work, ignore the nested-name-specifier. */
17248 if (!cp_parser_parse_definitely (parser
))
17250 invalid_nested_name_p
= true;
17251 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
17252 id
= cp_parser_identifier (parser
);
17253 if (id
== error_mark_node
)
17256 /* If we could not find a corresponding TYPE, treat this
17257 declaration like an unqualified declaration. */
17258 if (type
== error_mark_node
)
17259 nested_name_specifier
= NULL_TREE
;
17260 /* Otherwise, count the number of templates used in TYPE and its
17261 containing scopes. */
17266 for (scope
= TREE_TYPE (type
);
17267 scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
;
17268 scope
= (TYPE_P (scope
)
17269 ? TYPE_CONTEXT (scope
)
17270 : DECL_CONTEXT (scope
)))
17272 && CLASS_TYPE_P (scope
)
17273 && CLASSTYPE_TEMPLATE_INFO (scope
)
17274 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope
))
17275 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (scope
))
17279 /* Otherwise, the identifier is optional. */
17282 /* We don't know whether what comes next is a template-id,
17283 an identifier, or nothing at all. */
17284 cp_parser_parse_tentatively (parser
);
17285 /* Check for a template-id. */
17286 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
17287 id
= cp_parser_template_id (parser
,
17288 /*template_keyword_p=*/false,
17289 /*check_dependency_p=*/true,
17290 /*is_declaration=*/true);
17291 /* If that didn't work, it could still be an identifier. */
17292 if (!cp_parser_parse_definitely (parser
))
17294 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
17296 type_start_token
= cp_lexer_peek_token (parser
->lexer
);
17297 id
= cp_parser_identifier (parser
);
17304 template_id_p
= true;
17309 pop_deferring_access_checks ();
17312 cp_parser_check_for_invalid_template_id (parser
, id
,
17313 type_start_token
->location
);
17315 /* If it's not a `:' or a `{' then we can't really be looking at a
17316 class-head, since a class-head only appears as part of a
17317 class-specifier. We have to detect this situation before calling
17318 xref_tag, since that has irreversible side-effects. */
17319 if (!cp_parser_next_token_starts_class_definition_p (parser
))
17321 cp_parser_error (parser
, "expected %<{%> or %<:%>");
17322 type
= error_mark_node
;
17326 /* At this point, we're going ahead with the class-specifier, even
17327 if some other problem occurs. */
17328 cp_parser_commit_to_tentative_parse (parser
);
17329 /* Issue the error about the overly-qualified name now. */
17332 cp_parser_error (parser
,
17333 "global qualification of class name is invalid");
17334 type
= error_mark_node
;
17337 else if (invalid_nested_name_p
)
17339 cp_parser_error (parser
,
17340 "qualified name does not name a class");
17341 type
= error_mark_node
;
17344 else if (nested_name_specifier
)
17348 /* Reject typedef-names in class heads. */
17349 if (!DECL_IMPLICIT_TYPEDEF_P (type
))
17351 error_at (type_start_token
->location
,
17352 "invalid class name in declaration of %qD",
17358 /* Figure out in what scope the declaration is being placed. */
17359 scope
= current_scope ();
17360 /* If that scope does not contain the scope in which the
17361 class was originally declared, the program is invalid. */
17362 if (scope
&& !is_ancestor (scope
, nested_name_specifier
))
17364 if (at_namespace_scope_p ())
17365 error_at (type_start_token
->location
,
17366 "declaration of %qD in namespace %qD which does not "
17368 type
, scope
, nested_name_specifier
);
17370 error_at (type_start_token
->location
,
17371 "declaration of %qD in %qD which does not enclose %qD",
17372 type
, scope
, nested_name_specifier
);
17378 A declarator-id shall not be qualified except for the
17379 definition of a ... nested class outside of its class
17380 ... [or] the definition or explicit instantiation of a
17381 class member of a namespace outside of its namespace. */
17382 if (scope
== nested_name_specifier
)
17384 permerror (nested_name_specifier_token_start
->location
,
17385 "extra qualification not allowed");
17386 nested_name_specifier
= NULL_TREE
;
17390 /* An explicit-specialization must be preceded by "template <>". If
17391 it is not, try to recover gracefully. */
17392 if (at_namespace_scope_p ()
17393 && parser
->num_template_parameter_lists
== 0
17396 error_at (type_start_token
->location
,
17397 "an explicit specialization must be preceded by %<template <>%>");
17398 invalid_explicit_specialization_p
= true;
17399 /* Take the same action that would have been taken by
17400 cp_parser_explicit_specialization. */
17401 ++parser
->num_template_parameter_lists
;
17402 begin_specialization ();
17404 /* There must be no "return" statements between this point and the
17405 end of this function; set "type "to the correct return value and
17406 use "goto done;" to return. */
17407 /* Make sure that the right number of template parameters were
17409 if (!cp_parser_check_template_parameters (parser
, num_templates
,
17410 type_start_token
->location
,
17411 /*declarator=*/NULL
))
17413 /* If something went wrong, there is no point in even trying to
17414 process the class-definition. */
17419 /* Look up the type. */
17422 if (TREE_CODE (id
) == TEMPLATE_ID_EXPR
17423 && (DECL_FUNCTION_TEMPLATE_P (TREE_OPERAND (id
, 0))
17424 || TREE_CODE (TREE_OPERAND (id
, 0)) == OVERLOAD
))
17426 error_at (type_start_token
->location
,
17427 "function template %qD redeclared as a class template", id
);
17428 type
= error_mark_node
;
17432 type
= TREE_TYPE (id
);
17433 type
= maybe_process_partial_specialization (type
);
17435 if (nested_name_specifier
)
17436 pushed_scope
= push_scope (nested_name_specifier
);
17438 else if (nested_name_specifier
)
17444 template <typename T> struct S { struct T };
17445 template <typename T> struct S<T>::T { };
17447 we will get a TYPENAME_TYPE when processing the definition of
17448 `S::T'. We need to resolve it to the actual type before we
17449 try to define it. */
17450 if (TREE_CODE (TREE_TYPE (type
)) == TYPENAME_TYPE
)
17452 class_type
= resolve_typename_type (TREE_TYPE (type
),
17453 /*only_current_p=*/false);
17454 if (TREE_CODE (class_type
) != TYPENAME_TYPE
)
17455 type
= TYPE_NAME (class_type
);
17458 cp_parser_error (parser
, "could not resolve typename type");
17459 type
= error_mark_node
;
17463 if (maybe_process_partial_specialization (TREE_TYPE (type
))
17464 == error_mark_node
)
17470 class_type
= current_class_type
;
17471 /* Enter the scope indicated by the nested-name-specifier. */
17472 pushed_scope
= push_scope (nested_name_specifier
);
17473 /* Get the canonical version of this type. */
17474 type
= TYPE_MAIN_DECL (TREE_TYPE (type
));
17475 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
17476 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (type
)))
17478 type
= push_template_decl (type
);
17479 if (type
== error_mark_node
)
17486 type
= TREE_TYPE (type
);
17487 *nested_name_specifier_p
= true;
17489 else /* The name is not a nested name. */
17491 /* If the class was unnamed, create a dummy name. */
17493 id
= make_anon_name ();
17494 type
= xref_tag (class_key
, id
, /*tag_scope=*/ts_current
,
17495 parser
->num_template_parameter_lists
);
17498 /* Indicate whether this class was declared as a `class' or as a
17500 if (TREE_CODE (type
) == RECORD_TYPE
)
17501 CLASSTYPE_DECLARED_CLASS (type
) = (class_key
== class_type
);
17502 cp_parser_check_class_key (class_key
, type
);
17504 /* If this type was already complete, and we see another definition,
17505 that's an error. */
17506 if (type
!= error_mark_node
&& COMPLETE_TYPE_P (type
))
17508 error_at (type_start_token
->location
, "redefinition of %q#T",
17510 error_at (type_start_token
->location
, "previous definition of %q+#T",
17515 else if (type
== error_mark_node
)
17518 /* We will have entered the scope containing the class; the names of
17519 base classes should be looked up in that context. For example:
17521 struct A { struct B {}; struct C; };
17522 struct A::C : B {};
17526 /* Get the list of base-classes, if there is one. */
17527 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
17528 *bases
= cp_parser_base_clause (parser
);
17531 /* Leave the scope given by the nested-name-specifier. We will
17532 enter the class scope itself while processing the members. */
17534 pop_scope (pushed_scope
);
17536 if (invalid_explicit_specialization_p
)
17538 end_specialization ();
17539 --parser
->num_template_parameter_lists
;
17543 DECL_SOURCE_LOCATION (TYPE_NAME (type
)) = type_start_token
->location
;
17544 *attributes_p
= attributes
;
17546 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
17550 /* Parse a class-key.
17557 Returns the kind of class-key specified, or none_type to indicate
17560 static enum tag_types
17561 cp_parser_class_key (cp_parser
* parser
)
17564 enum tag_types tag_type
;
17566 /* Look for the class-key. */
17567 token
= cp_parser_require (parser
, CPP_KEYWORD
, RT_CLASS_KEY
);
17571 /* Check to see if the TOKEN is a class-key. */
17572 tag_type
= cp_parser_token_is_class_key (token
);
17574 cp_parser_error (parser
, "expected class-key");
17578 /* Parse an (optional) member-specification.
17580 member-specification:
17581 member-declaration member-specification [opt]
17582 access-specifier : member-specification [opt] */
17585 cp_parser_member_specification_opt (cp_parser
* parser
)
17592 /* Peek at the next token. */
17593 token
= cp_lexer_peek_token (parser
->lexer
);
17594 /* If it's a `}', or EOF then we've seen all the members. */
17595 if (token
->type
== CPP_CLOSE_BRACE
17596 || token
->type
== CPP_EOF
17597 || token
->type
== CPP_PRAGMA_EOL
)
17600 /* See if this token is a keyword. */
17601 keyword
= token
->keyword
;
17605 case RID_PROTECTED
:
17607 /* Consume the access-specifier. */
17608 cp_lexer_consume_token (parser
->lexer
);
17609 /* Remember which access-specifier is active. */
17610 current_access_specifier
= token
->u
.value
;
17611 /* Look for the `:'. */
17612 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
17616 /* Accept #pragmas at class scope. */
17617 if (token
->type
== CPP_PRAGMA
)
17619 cp_parser_pragma (parser
, pragma_external
);
17623 /* Otherwise, the next construction must be a
17624 member-declaration. */
17625 cp_parser_member_declaration (parser
);
17630 /* Parse a member-declaration.
17632 member-declaration:
17633 decl-specifier-seq [opt] member-declarator-list [opt] ;
17634 function-definition ; [opt]
17635 :: [opt] nested-name-specifier template [opt] unqualified-id ;
17637 template-declaration
17639 member-declarator-list:
17641 member-declarator-list , member-declarator
17644 declarator pure-specifier [opt]
17645 declarator constant-initializer [opt]
17646 identifier [opt] : constant-expression
17650 member-declaration:
17651 __extension__ member-declaration
17654 declarator attributes [opt] pure-specifier [opt]
17655 declarator attributes [opt] constant-initializer [opt]
17656 identifier [opt] attributes [opt] : constant-expression
17660 member-declaration:
17661 static_assert-declaration */
17664 cp_parser_member_declaration (cp_parser
* parser
)
17666 cp_decl_specifier_seq decl_specifiers
;
17667 tree prefix_attributes
;
17669 int declares_class_or_enum
;
17671 cp_token
*token
= NULL
;
17672 cp_token
*decl_spec_token_start
= NULL
;
17673 cp_token
*initializer_token_start
= NULL
;
17674 int saved_pedantic
;
17675 bool saved_colon_corrects_to_scope_p
= parser
->colon_corrects_to_scope_p
;
17677 /* Check for the `__extension__' keyword. */
17678 if (cp_parser_extension_opt (parser
, &saved_pedantic
))
17681 cp_parser_member_declaration (parser
);
17682 /* Restore the old value of the PEDANTIC flag. */
17683 pedantic
= saved_pedantic
;
17688 /* Check for a template-declaration. */
17689 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
17691 /* An explicit specialization here is an error condition, and we
17692 expect the specialization handler to detect and report this. */
17693 if (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_LESS
17694 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_GREATER
)
17695 cp_parser_explicit_specialization (parser
);
17697 cp_parser_template_declaration (parser
, /*member_p=*/true);
17702 /* Check for a using-declaration. */
17703 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_USING
))
17705 /* Parse the using-declaration. */
17706 cp_parser_using_declaration (parser
,
17707 /*access_declaration_p=*/false);
17711 /* Check for @defs. */
17712 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AT_DEFS
))
17715 tree ivar_chains
= cp_parser_objc_defs_expression (parser
);
17716 ivar
= ivar_chains
;
17720 ivar
= TREE_CHAIN (member
);
17721 TREE_CHAIN (member
) = NULL_TREE
;
17722 finish_member_declaration (member
);
17727 /* If the next token is `static_assert' we have a static assertion. */
17728 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STATIC_ASSERT
))
17730 cp_parser_static_assert (parser
, /*member_p=*/true);
17734 parser
->colon_corrects_to_scope_p
= false;
17736 if (cp_parser_using_declaration (parser
, /*access_declaration=*/true))
17739 /* Parse the decl-specifier-seq. */
17740 decl_spec_token_start
= cp_lexer_peek_token (parser
->lexer
);
17741 cp_parser_decl_specifier_seq (parser
,
17742 CP_PARSER_FLAGS_OPTIONAL
,
17744 &declares_class_or_enum
);
17745 prefix_attributes
= decl_specifiers
.attributes
;
17746 decl_specifiers
.attributes
= NULL_TREE
;
17747 /* Check for an invalid type-name. */
17748 if (!decl_specifiers
.any_type_specifiers_p
17749 && cp_parser_parse_and_diagnose_invalid_type_name (parser
))
17751 /* If there is no declarator, then the decl-specifier-seq should
17753 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
17755 /* If there was no decl-specifier-seq, and the next token is a
17756 `;', then we have something like:
17762 Each member-declaration shall declare at least one member
17763 name of the class. */
17764 if (!decl_specifiers
.any_specifiers_p
)
17766 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
17767 if (!in_system_header_at (token
->location
))
17768 pedwarn (token
->location
, OPT_pedantic
, "extra %<;%>");
17774 /* See if this declaration is a friend. */
17775 friend_p
= cp_parser_friend_p (&decl_specifiers
);
17776 /* If there were decl-specifiers, check to see if there was
17777 a class-declaration. */
17778 type
= check_tag_decl (&decl_specifiers
);
17779 /* Nested classes have already been added to the class, but
17780 a `friend' needs to be explicitly registered. */
17783 /* If the `friend' keyword was present, the friend must
17784 be introduced with a class-key. */
17785 if (!declares_class_or_enum
)
17786 error_at (decl_spec_token_start
->location
,
17787 "a class-key must be used when declaring a friend");
17790 template <typename T> struct A {
17791 friend struct A<T>::B;
17794 A<T>::B will be represented by a TYPENAME_TYPE, and
17795 therefore not recognized by check_tag_decl. */
17797 && decl_specifiers
.type
17798 && TYPE_P (decl_specifiers
.type
))
17799 type
= decl_specifiers
.type
;
17800 if (!type
|| !TYPE_P (type
))
17801 error_at (decl_spec_token_start
->location
,
17802 "friend declaration does not name a class or "
17805 make_friend_class (current_class_type
, type
,
17806 /*complain=*/true);
17808 /* If there is no TYPE, an error message will already have
17810 else if (!type
|| type
== error_mark_node
)
17812 /* An anonymous aggregate has to be handled specially; such
17813 a declaration really declares a data member (with a
17814 particular type), as opposed to a nested class. */
17815 else if (ANON_AGGR_TYPE_P (type
))
17817 /* Remove constructors and such from TYPE, now that we
17818 know it is an anonymous aggregate. */
17819 fixup_anonymous_aggr (type
);
17820 /* And make the corresponding data member. */
17821 decl
= build_decl (decl_spec_token_start
->location
,
17822 FIELD_DECL
, NULL_TREE
, type
);
17823 /* Add it to the class. */
17824 finish_member_declaration (decl
);
17827 cp_parser_check_access_in_redeclaration
17829 decl_spec_token_start
->location
);
17834 bool assume_semicolon
= false;
17836 /* See if these declarations will be friends. */
17837 friend_p
= cp_parser_friend_p (&decl_specifiers
);
17839 /* Keep going until we hit the `;' at the end of the
17841 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
17843 tree attributes
= NULL_TREE
;
17844 tree first_attribute
;
17846 /* Peek at the next token. */
17847 token
= cp_lexer_peek_token (parser
->lexer
);
17849 /* Check for a bitfield declaration. */
17850 if (token
->type
== CPP_COLON
17851 || (token
->type
== CPP_NAME
17852 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
17858 /* Get the name of the bitfield. Note that we cannot just
17859 check TOKEN here because it may have been invalidated by
17860 the call to cp_lexer_peek_nth_token above. */
17861 if (cp_lexer_peek_token (parser
->lexer
)->type
!= CPP_COLON
)
17862 identifier
= cp_parser_identifier (parser
);
17864 identifier
= NULL_TREE
;
17866 /* Consume the `:' token. */
17867 cp_lexer_consume_token (parser
->lexer
);
17868 /* Get the width of the bitfield. */
17870 = cp_parser_constant_expression (parser
,
17871 /*allow_non_constant=*/false,
17874 /* Look for attributes that apply to the bitfield. */
17875 attributes
= cp_parser_attributes_opt (parser
);
17876 /* Remember which attributes are prefix attributes and
17878 first_attribute
= attributes
;
17879 /* Combine the attributes. */
17880 attributes
= chainon (prefix_attributes
, attributes
);
17882 /* Create the bitfield declaration. */
17883 decl
= grokbitfield (identifier
17884 ? make_id_declarator (NULL_TREE
,
17894 cp_declarator
*declarator
;
17896 tree asm_specification
;
17897 int ctor_dtor_or_conv_p
;
17899 /* Parse the declarator. */
17901 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
17902 &ctor_dtor_or_conv_p
,
17903 /*parenthesized_p=*/NULL
,
17904 /*member_p=*/true);
17906 /* If something went wrong parsing the declarator, make sure
17907 that we at least consume some tokens. */
17908 if (declarator
== cp_error_declarator
)
17910 /* Skip to the end of the statement. */
17911 cp_parser_skip_to_end_of_statement (parser
);
17912 /* If the next token is not a semicolon, that is
17913 probably because we just skipped over the body of
17914 a function. So, we consume a semicolon if
17915 present, but do not issue an error message if it
17917 if (cp_lexer_next_token_is (parser
->lexer
,
17919 cp_lexer_consume_token (parser
->lexer
);
17923 if (declares_class_or_enum
& 2)
17924 cp_parser_check_for_definition_in_return_type
17925 (declarator
, decl_specifiers
.type
,
17926 decl_specifiers
.type_location
);
17928 /* Look for an asm-specification. */
17929 asm_specification
= cp_parser_asm_specification_opt (parser
);
17930 /* Look for attributes that apply to the declaration. */
17931 attributes
= cp_parser_attributes_opt (parser
);
17932 /* Remember which attributes are prefix attributes and
17934 first_attribute
= attributes
;
17935 /* Combine the attributes. */
17936 attributes
= chainon (prefix_attributes
, attributes
);
17938 /* If it's an `=', then we have a constant-initializer or a
17939 pure-specifier. It is not correct to parse the
17940 initializer before registering the member declaration
17941 since the member declaration should be in scope while
17942 its initializer is processed. However, the rest of the
17943 front end does not yet provide an interface that allows
17944 us to handle this correctly. */
17945 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
17949 A pure-specifier shall be used only in the declaration of
17950 a virtual function.
17952 A member-declarator can contain a constant-initializer
17953 only if it declares a static member of integral or
17956 Therefore, if the DECLARATOR is for a function, we look
17957 for a pure-specifier; otherwise, we look for a
17958 constant-initializer. When we call `grokfield', it will
17959 perform more stringent semantics checks. */
17960 initializer_token_start
= cp_lexer_peek_token (parser
->lexer
);
17961 if (function_declarator_p (declarator
))
17962 initializer
= cp_parser_pure_specifier (parser
);
17964 /* Parse the initializer. */
17965 initializer
= cp_parser_constant_initializer (parser
);
17967 /* Otherwise, there is no initializer. */
17969 initializer
= NULL_TREE
;
17971 /* See if we are probably looking at a function
17972 definition. We are certainly not looking at a
17973 member-declarator. Calling `grokfield' has
17974 side-effects, so we must not do it unless we are sure
17975 that we are looking at a member-declarator. */
17976 if (cp_parser_token_starts_function_definition_p
17977 (cp_lexer_peek_token (parser
->lexer
)))
17979 /* The grammar does not allow a pure-specifier to be
17980 used when a member function is defined. (It is
17981 possible that this fact is an oversight in the
17982 standard, since a pure function may be defined
17983 outside of the class-specifier. */
17985 error_at (initializer_token_start
->location
,
17986 "pure-specifier on function-definition");
17987 decl
= cp_parser_save_member_function_body (parser
,
17991 /* If the member was not a friend, declare it here. */
17993 finish_member_declaration (decl
);
17994 /* Peek at the next token. */
17995 token
= cp_lexer_peek_token (parser
->lexer
);
17996 /* If the next token is a semicolon, consume it. */
17997 if (token
->type
== CPP_SEMICOLON
)
17998 cp_lexer_consume_token (parser
->lexer
);
18002 if (declarator
->kind
== cdk_function
)
18003 declarator
->id_loc
= token
->location
;
18004 /* Create the declaration. */
18005 decl
= grokfield (declarator
, &decl_specifiers
,
18006 initializer
, /*init_const_expr_p=*/true,
18011 /* Reset PREFIX_ATTRIBUTES. */
18012 while (attributes
&& TREE_CHAIN (attributes
) != first_attribute
)
18013 attributes
= TREE_CHAIN (attributes
);
18015 TREE_CHAIN (attributes
) = NULL_TREE
;
18017 /* If there is any qualification still in effect, clear it
18018 now; we will be starting fresh with the next declarator. */
18019 parser
->scope
= NULL_TREE
;
18020 parser
->qualifying_scope
= NULL_TREE
;
18021 parser
->object_scope
= NULL_TREE
;
18022 /* If it's a `,', then there are more declarators. */
18023 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
18024 cp_lexer_consume_token (parser
->lexer
);
18025 /* If the next token isn't a `;', then we have a parse error. */
18026 else if (cp_lexer_next_token_is_not (parser
->lexer
,
18029 /* The next token might be a ways away from where the
18030 actual semicolon is missing. Find the previous token
18031 and use that for our error position. */
18032 cp_token
*token
= cp_lexer_previous_token (parser
->lexer
);
18033 error_at (token
->location
,
18034 "expected %<;%> at end of member declaration");
18036 /* Assume that the user meant to provide a semicolon. If
18037 we were to cp_parser_skip_to_end_of_statement, we might
18038 skip to a semicolon inside a member function definition
18039 and issue nonsensical error messages. */
18040 assume_semicolon
= true;
18045 /* Add DECL to the list of members. */
18047 finish_member_declaration (decl
);
18049 if (TREE_CODE (decl
) == FUNCTION_DECL
)
18050 cp_parser_save_default_args (parser
, decl
);
18053 if (assume_semicolon
)
18058 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
18060 parser
->colon_corrects_to_scope_p
= saved_colon_corrects_to_scope_p
;
18063 /* Parse a pure-specifier.
18068 Returns INTEGER_ZERO_NODE if a pure specifier is found.
18069 Otherwise, ERROR_MARK_NODE is returned. */
18072 cp_parser_pure_specifier (cp_parser
* parser
)
18076 /* Look for the `=' token. */
18077 if (!cp_parser_require (parser
, CPP_EQ
, RT_EQ
))
18078 return error_mark_node
;
18079 /* Look for the `0' token. */
18080 token
= cp_lexer_peek_token (parser
->lexer
);
18082 if (token
->type
== CPP_EOF
18083 || token
->type
== CPP_PRAGMA_EOL
)
18084 return error_mark_node
;
18086 cp_lexer_consume_token (parser
->lexer
);
18088 /* Accept = default or = delete in c++0x mode. */
18089 if (token
->keyword
== RID_DEFAULT
18090 || token
->keyword
== RID_DELETE
)
18092 maybe_warn_cpp0x (CPP0X_DEFAULTED_DELETED
);
18093 return token
->u
.value
;
18096 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
18097 if (token
->type
!= CPP_NUMBER
|| !(token
->flags
& PURE_ZERO
))
18099 cp_parser_error (parser
,
18100 "invalid pure specifier (only %<= 0%> is allowed)");
18101 cp_parser_skip_to_end_of_statement (parser
);
18102 return error_mark_node
;
18104 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
18106 error_at (token
->location
, "templates may not be %<virtual%>");
18107 return error_mark_node
;
18110 return integer_zero_node
;
18113 /* Parse a constant-initializer.
18115 constant-initializer:
18116 = constant-expression
18118 Returns a representation of the constant-expression. */
18121 cp_parser_constant_initializer (cp_parser
* parser
)
18123 /* Look for the `=' token. */
18124 if (!cp_parser_require (parser
, CPP_EQ
, RT_EQ
))
18125 return error_mark_node
;
18127 /* It is invalid to write:
18129 struct S { static const int i = { 7 }; };
18132 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
18134 cp_parser_error (parser
,
18135 "a brace-enclosed initializer is not allowed here");
18136 /* Consume the opening brace. */
18137 cp_lexer_consume_token (parser
->lexer
);
18138 /* Skip the initializer. */
18139 cp_parser_skip_to_closing_brace (parser
);
18140 /* Look for the trailing `}'. */
18141 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
18143 return error_mark_node
;
18146 return cp_parser_constant_expression (parser
,
18147 /*allow_non_constant=*/false,
18151 /* Derived classes [gram.class.derived] */
18153 /* Parse a base-clause.
18156 : base-specifier-list
18158 base-specifier-list:
18159 base-specifier ... [opt]
18160 base-specifier-list , base-specifier ... [opt]
18162 Returns a TREE_LIST representing the base-classes, in the order in
18163 which they were declared. The representation of each node is as
18164 described by cp_parser_base_specifier.
18166 In the case that no bases are specified, this function will return
18167 NULL_TREE, not ERROR_MARK_NODE. */
18170 cp_parser_base_clause (cp_parser
* parser
)
18172 tree bases
= NULL_TREE
;
18174 /* Look for the `:' that begins the list. */
18175 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
18177 /* Scan the base-specifier-list. */
18182 bool pack_expansion_p
= false;
18184 /* Look for the base-specifier. */
18185 base
= cp_parser_base_specifier (parser
);
18186 /* Look for the (optional) ellipsis. */
18187 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
18189 /* Consume the `...'. */
18190 cp_lexer_consume_token (parser
->lexer
);
18192 pack_expansion_p
= true;
18195 /* Add BASE to the front of the list. */
18196 if (base
!= error_mark_node
)
18198 if (pack_expansion_p
)
18199 /* Make this a pack expansion type. */
18200 TREE_VALUE (base
) = make_pack_expansion (TREE_VALUE (base
));
18203 if (!check_for_bare_parameter_packs (TREE_VALUE (base
)))
18205 TREE_CHAIN (base
) = bases
;
18209 /* Peek at the next token. */
18210 token
= cp_lexer_peek_token (parser
->lexer
);
18211 /* If it's not a comma, then the list is complete. */
18212 if (token
->type
!= CPP_COMMA
)
18214 /* Consume the `,'. */
18215 cp_lexer_consume_token (parser
->lexer
);
18218 /* PARSER->SCOPE may still be non-NULL at this point, if the last
18219 base class had a qualified name. However, the next name that
18220 appears is certainly not qualified. */
18221 parser
->scope
= NULL_TREE
;
18222 parser
->qualifying_scope
= NULL_TREE
;
18223 parser
->object_scope
= NULL_TREE
;
18225 return nreverse (bases
);
18228 /* Parse a base-specifier.
18231 :: [opt] nested-name-specifier [opt] class-name
18232 virtual access-specifier [opt] :: [opt] nested-name-specifier
18234 access-specifier virtual [opt] :: [opt] nested-name-specifier
18237 Returns a TREE_LIST. The TREE_PURPOSE will be one of
18238 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
18239 indicate the specifiers provided. The TREE_VALUE will be a TYPE
18240 (or the ERROR_MARK_NODE) indicating the type that was specified. */
18243 cp_parser_base_specifier (cp_parser
* parser
)
18247 bool virtual_p
= false;
18248 bool duplicate_virtual_error_issued_p
= false;
18249 bool duplicate_access_error_issued_p
= false;
18250 bool class_scope_p
, template_p
;
18251 tree access
= access_default_node
;
18254 /* Process the optional `virtual' and `access-specifier'. */
18257 /* Peek at the next token. */
18258 token
= cp_lexer_peek_token (parser
->lexer
);
18259 /* Process `virtual'. */
18260 switch (token
->keyword
)
18263 /* If `virtual' appears more than once, issue an error. */
18264 if (virtual_p
&& !duplicate_virtual_error_issued_p
)
18266 cp_parser_error (parser
,
18267 "%<virtual%> specified more than once in base-specified");
18268 duplicate_virtual_error_issued_p
= true;
18273 /* Consume the `virtual' token. */
18274 cp_lexer_consume_token (parser
->lexer
);
18279 case RID_PROTECTED
:
18281 /* If more than one access specifier appears, issue an
18283 if (access
!= access_default_node
18284 && !duplicate_access_error_issued_p
)
18286 cp_parser_error (parser
,
18287 "more than one access specifier in base-specified");
18288 duplicate_access_error_issued_p
= true;
18291 access
= ridpointers
[(int) token
->keyword
];
18293 /* Consume the access-specifier. */
18294 cp_lexer_consume_token (parser
->lexer
);
18303 /* It is not uncommon to see programs mechanically, erroneously, use
18304 the 'typename' keyword to denote (dependent) qualified types
18305 as base classes. */
18306 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TYPENAME
))
18308 token
= cp_lexer_peek_token (parser
->lexer
);
18309 if (!processing_template_decl
)
18310 error_at (token
->location
,
18311 "keyword %<typename%> not allowed outside of templates");
18313 error_at (token
->location
,
18314 "keyword %<typename%> not allowed in this context "
18315 "(the base class is implicitly a type)");
18316 cp_lexer_consume_token (parser
->lexer
);
18319 /* Look for the optional `::' operator. */
18320 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false);
18321 /* Look for the nested-name-specifier. The simplest way to
18326 The keyword `typename' is not permitted in a base-specifier or
18327 mem-initializer; in these contexts a qualified name that
18328 depends on a template-parameter is implicitly assumed to be a
18331 is to pretend that we have seen the `typename' keyword at this
18333 cp_parser_nested_name_specifier_opt (parser
,
18334 /*typename_keyword_p=*/true,
18335 /*check_dependency_p=*/true,
18337 /*is_declaration=*/true);
18338 /* If the base class is given by a qualified name, assume that names
18339 we see are type names or templates, as appropriate. */
18340 class_scope_p
= (parser
->scope
&& TYPE_P (parser
->scope
));
18341 template_p
= class_scope_p
&& cp_parser_optional_template_keyword (parser
);
18343 /* Finally, look for the class-name. */
18344 type
= cp_parser_class_name (parser
,
18348 /*check_dependency_p=*/true,
18349 /*class_head_p=*/false,
18350 /*is_declaration=*/true);
18352 if (type
== error_mark_node
)
18353 return error_mark_node
;
18355 return finish_base_specifier (TREE_TYPE (type
), access
, virtual_p
);
18358 /* Exception handling [gram.exception] */
18360 /* Parse an (optional) exception-specification.
18362 exception-specification:
18363 throw ( type-id-list [opt] )
18365 Returns a TREE_LIST representing the exception-specification. The
18366 TREE_VALUE of each node is a type. */
18369 cp_parser_exception_specification_opt (cp_parser
* parser
)
18373 const char *saved_message
;
18375 /* Peek at the next token. */
18376 token
= cp_lexer_peek_token (parser
->lexer
);
18378 /* Is it a noexcept-specification? */
18379 if (cp_parser_is_keyword (token
, RID_NOEXCEPT
))
18382 cp_lexer_consume_token (parser
->lexer
);
18384 if (cp_lexer_peek_token (parser
->lexer
)->type
== CPP_OPEN_PAREN
)
18386 cp_lexer_consume_token (parser
->lexer
);
18388 /* Types may not be defined in an exception-specification. */
18389 saved_message
= parser
->type_definition_forbidden_message
;
18390 parser
->type_definition_forbidden_message
18391 = G_("types may not be defined in an exception-specification");
18393 expr
= cp_parser_constant_expression (parser
, false, NULL
);
18395 /* Restore the saved message. */
18396 parser
->type_definition_forbidden_message
= saved_message
;
18398 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
18401 expr
= boolean_true_node
;
18403 return build_noexcept_spec (expr
, tf_warning_or_error
);
18406 /* If it's not `throw', then there's no exception-specification. */
18407 if (!cp_parser_is_keyword (token
, RID_THROW
))
18411 /* Enable this once a lot of code has transitioned to noexcept? */
18412 if (cxx_dialect
== cxx0x
&& !in_system_header
)
18413 warning (OPT_Wdeprecated
, "dynamic exception specifications are "
18414 "deprecated in C++0x; use %<noexcept%> instead");
18417 /* Consume the `throw'. */
18418 cp_lexer_consume_token (parser
->lexer
);
18420 /* Look for the `('. */
18421 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
18423 /* Peek at the next token. */
18424 token
= cp_lexer_peek_token (parser
->lexer
);
18425 /* If it's not a `)', then there is a type-id-list. */
18426 if (token
->type
!= CPP_CLOSE_PAREN
)
18428 /* Types may not be defined in an exception-specification. */
18429 saved_message
= parser
->type_definition_forbidden_message
;
18430 parser
->type_definition_forbidden_message
18431 = G_("types may not be defined in an exception-specification");
18432 /* Parse the type-id-list. */
18433 type_id_list
= cp_parser_type_id_list (parser
);
18434 /* Restore the saved message. */
18435 parser
->type_definition_forbidden_message
= saved_message
;
18438 type_id_list
= empty_except_spec
;
18440 /* Look for the `)'. */
18441 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
18443 return type_id_list
;
18446 /* Parse an (optional) type-id-list.
18450 type-id-list , type-id ... [opt]
18452 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
18453 in the order that the types were presented. */
18456 cp_parser_type_id_list (cp_parser
* parser
)
18458 tree types
= NULL_TREE
;
18465 /* Get the next type-id. */
18466 type
= cp_parser_type_id (parser
);
18467 /* Parse the optional ellipsis. */
18468 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
18470 /* Consume the `...'. */
18471 cp_lexer_consume_token (parser
->lexer
);
18473 /* Turn the type into a pack expansion expression. */
18474 type
= make_pack_expansion (type
);
18476 /* Add it to the list. */
18477 types
= add_exception_specifier (types
, type
, /*complain=*/1);
18478 /* Peek at the next token. */
18479 token
= cp_lexer_peek_token (parser
->lexer
);
18480 /* If it is not a `,', we are done. */
18481 if (token
->type
!= CPP_COMMA
)
18483 /* Consume the `,'. */
18484 cp_lexer_consume_token (parser
->lexer
);
18487 return nreverse (types
);
18490 /* Parse a try-block.
18493 try compound-statement handler-seq */
18496 cp_parser_try_block (cp_parser
* parser
)
18500 cp_parser_require_keyword (parser
, RID_TRY
, RT_TRY
);
18501 try_block
= begin_try_block ();
18502 cp_parser_compound_statement (parser
, NULL
, true);
18503 finish_try_block (try_block
);
18504 cp_parser_handler_seq (parser
);
18505 finish_handler_sequence (try_block
);
18510 /* Parse a function-try-block.
18512 function-try-block:
18513 try ctor-initializer [opt] function-body handler-seq */
18516 cp_parser_function_try_block (cp_parser
* parser
)
18518 tree compound_stmt
;
18520 bool ctor_initializer_p
;
18522 /* Look for the `try' keyword. */
18523 if (!cp_parser_require_keyword (parser
, RID_TRY
, RT_TRY
))
18525 /* Let the rest of the front end know where we are. */
18526 try_block
= begin_function_try_block (&compound_stmt
);
18527 /* Parse the function-body. */
18529 = cp_parser_ctor_initializer_opt_and_function_body (parser
);
18530 /* We're done with the `try' part. */
18531 finish_function_try_block (try_block
);
18532 /* Parse the handlers. */
18533 cp_parser_handler_seq (parser
);
18534 /* We're done with the handlers. */
18535 finish_function_handler_sequence (try_block
, compound_stmt
);
18537 return ctor_initializer_p
;
18540 /* Parse a handler-seq.
18543 handler handler-seq [opt] */
18546 cp_parser_handler_seq (cp_parser
* parser
)
18552 /* Parse the handler. */
18553 cp_parser_handler (parser
);
18554 /* Peek at the next token. */
18555 token
= cp_lexer_peek_token (parser
->lexer
);
18556 /* If it's not `catch' then there are no more handlers. */
18557 if (!cp_parser_is_keyword (token
, RID_CATCH
))
18562 /* Parse a handler.
18565 catch ( exception-declaration ) compound-statement */
18568 cp_parser_handler (cp_parser
* parser
)
18573 cp_parser_require_keyword (parser
, RID_CATCH
, RT_CATCH
);
18574 handler
= begin_handler ();
18575 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
18576 declaration
= cp_parser_exception_declaration (parser
);
18577 finish_handler_parms (declaration
, handler
);
18578 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
18579 cp_parser_compound_statement (parser
, NULL
, false);
18580 finish_handler (handler
);
18583 /* Parse an exception-declaration.
18585 exception-declaration:
18586 type-specifier-seq declarator
18587 type-specifier-seq abstract-declarator
18591 Returns a VAR_DECL for the declaration, or NULL_TREE if the
18592 ellipsis variant is used. */
18595 cp_parser_exception_declaration (cp_parser
* parser
)
18597 cp_decl_specifier_seq type_specifiers
;
18598 cp_declarator
*declarator
;
18599 const char *saved_message
;
18601 /* If it's an ellipsis, it's easy to handle. */
18602 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
18604 /* Consume the `...' token. */
18605 cp_lexer_consume_token (parser
->lexer
);
18609 /* Types may not be defined in exception-declarations. */
18610 saved_message
= parser
->type_definition_forbidden_message
;
18611 parser
->type_definition_forbidden_message
18612 = G_("types may not be defined in exception-declarations");
18614 /* Parse the type-specifier-seq. */
18615 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/true,
18616 /*is_trailing_return=*/false,
18618 /* If it's a `)', then there is no declarator. */
18619 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
18622 declarator
= cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_EITHER
,
18623 /*ctor_dtor_or_conv_p=*/NULL
,
18624 /*parenthesized_p=*/NULL
,
18625 /*member_p=*/false);
18627 /* Restore the saved message. */
18628 parser
->type_definition_forbidden_message
= saved_message
;
18630 if (!type_specifiers
.any_specifiers_p
)
18631 return error_mark_node
;
18633 return grokdeclarator (declarator
, &type_specifiers
, CATCHPARM
, 1, NULL
);
18636 /* Parse a throw-expression.
18639 throw assignment-expression [opt]
18641 Returns a THROW_EXPR representing the throw-expression. */
18644 cp_parser_throw_expression (cp_parser
* parser
)
18649 cp_parser_require_keyword (parser
, RID_THROW
, RT_THROW
);
18650 token
= cp_lexer_peek_token (parser
->lexer
);
18651 /* Figure out whether or not there is an assignment-expression
18652 following the "throw" keyword. */
18653 if (token
->type
== CPP_COMMA
18654 || token
->type
== CPP_SEMICOLON
18655 || token
->type
== CPP_CLOSE_PAREN
18656 || token
->type
== CPP_CLOSE_SQUARE
18657 || token
->type
== CPP_CLOSE_BRACE
18658 || token
->type
== CPP_COLON
)
18659 expression
= NULL_TREE
;
18661 expression
= cp_parser_assignment_expression (parser
,
18662 /*cast_p=*/false, NULL
);
18664 return build_throw (expression
);
18667 /* GNU Extensions */
18669 /* Parse an (optional) asm-specification.
18672 asm ( string-literal )
18674 If the asm-specification is present, returns a STRING_CST
18675 corresponding to the string-literal. Otherwise, returns
18679 cp_parser_asm_specification_opt (cp_parser
* parser
)
18682 tree asm_specification
;
18684 /* Peek at the next token. */
18685 token
= cp_lexer_peek_token (parser
->lexer
);
18686 /* If the next token isn't the `asm' keyword, then there's no
18687 asm-specification. */
18688 if (!cp_parser_is_keyword (token
, RID_ASM
))
18691 /* Consume the `asm' token. */
18692 cp_lexer_consume_token (parser
->lexer
);
18693 /* Look for the `('. */
18694 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
18696 /* Look for the string-literal. */
18697 asm_specification
= cp_parser_string_literal (parser
, false, false);
18699 /* Look for the `)'. */
18700 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
18702 return asm_specification
;
18705 /* Parse an asm-operand-list.
18709 asm-operand-list , asm-operand
18712 string-literal ( expression )
18713 [ string-literal ] string-literal ( expression )
18715 Returns a TREE_LIST representing the operands. The TREE_VALUE of
18716 each node is the expression. The TREE_PURPOSE is itself a
18717 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
18718 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
18719 is a STRING_CST for the string literal before the parenthesis. Returns
18720 ERROR_MARK_NODE if any of the operands are invalid. */
18723 cp_parser_asm_operand_list (cp_parser
* parser
)
18725 tree asm_operands
= NULL_TREE
;
18726 bool invalid_operands
= false;
18730 tree string_literal
;
18734 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
18736 /* Consume the `[' token. */
18737 cp_lexer_consume_token (parser
->lexer
);
18738 /* Read the operand name. */
18739 name
= cp_parser_identifier (parser
);
18740 if (name
!= error_mark_node
)
18741 name
= build_string (IDENTIFIER_LENGTH (name
),
18742 IDENTIFIER_POINTER (name
));
18743 /* Look for the closing `]'. */
18744 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
18748 /* Look for the string-literal. */
18749 string_literal
= cp_parser_string_literal (parser
, false, false);
18751 /* Look for the `('. */
18752 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
18753 /* Parse the expression. */
18754 expression
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
18755 /* Look for the `)'. */
18756 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
18758 if (name
== error_mark_node
18759 || string_literal
== error_mark_node
18760 || expression
== error_mark_node
)
18761 invalid_operands
= true;
18763 /* Add this operand to the list. */
18764 asm_operands
= tree_cons (build_tree_list (name
, string_literal
),
18767 /* If the next token is not a `,', there are no more
18769 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
18771 /* Consume the `,'. */
18772 cp_lexer_consume_token (parser
->lexer
);
18775 return invalid_operands
? error_mark_node
: nreverse (asm_operands
);
18778 /* Parse an asm-clobber-list.
18782 asm-clobber-list , string-literal
18784 Returns a TREE_LIST, indicating the clobbers in the order that they
18785 appeared. The TREE_VALUE of each node is a STRING_CST. */
18788 cp_parser_asm_clobber_list (cp_parser
* parser
)
18790 tree clobbers
= NULL_TREE
;
18794 tree string_literal
;
18796 /* Look for the string literal. */
18797 string_literal
= cp_parser_string_literal (parser
, false, false);
18798 /* Add it to the list. */
18799 clobbers
= tree_cons (NULL_TREE
, string_literal
, clobbers
);
18800 /* If the next token is not a `,', then the list is
18802 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
18804 /* Consume the `,' token. */
18805 cp_lexer_consume_token (parser
->lexer
);
18811 /* Parse an asm-label-list.
18815 asm-label-list , identifier
18817 Returns a TREE_LIST, indicating the labels in the order that they
18818 appeared. The TREE_VALUE of each node is a label. */
18821 cp_parser_asm_label_list (cp_parser
* parser
)
18823 tree labels
= NULL_TREE
;
18827 tree identifier
, label
, name
;
18829 /* Look for the identifier. */
18830 identifier
= cp_parser_identifier (parser
);
18831 if (!error_operand_p (identifier
))
18833 label
= lookup_label (identifier
);
18834 if (TREE_CODE (label
) == LABEL_DECL
)
18836 TREE_USED (label
) = 1;
18837 check_goto (label
);
18838 name
= build_string (IDENTIFIER_LENGTH (identifier
),
18839 IDENTIFIER_POINTER (identifier
));
18840 labels
= tree_cons (name
, label
, labels
);
18843 /* If the next token is not a `,', then the list is
18845 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
18847 /* Consume the `,' token. */
18848 cp_lexer_consume_token (parser
->lexer
);
18851 return nreverse (labels
);
18854 /* Parse an (optional) series of attributes.
18857 attributes attribute
18860 __attribute__ (( attribute-list [opt] ))
18862 The return value is as for cp_parser_attribute_list. */
18865 cp_parser_attributes_opt (cp_parser
* parser
)
18867 tree attributes
= NULL_TREE
;
18872 tree attribute_list
;
18874 /* Peek at the next token. */
18875 token
= cp_lexer_peek_token (parser
->lexer
);
18876 /* If it's not `__attribute__', then we're done. */
18877 if (token
->keyword
!= RID_ATTRIBUTE
)
18880 /* Consume the `__attribute__' keyword. */
18881 cp_lexer_consume_token (parser
->lexer
);
18882 /* Look for the two `(' tokens. */
18883 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
18884 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
18886 /* Peek at the next token. */
18887 token
= cp_lexer_peek_token (parser
->lexer
);
18888 if (token
->type
!= CPP_CLOSE_PAREN
)
18889 /* Parse the attribute-list. */
18890 attribute_list
= cp_parser_attribute_list (parser
);
18892 /* If the next token is a `)', then there is no attribute
18894 attribute_list
= NULL
;
18896 /* Look for the two `)' tokens. */
18897 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
18898 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
18900 /* Add these new attributes to the list. */
18901 attributes
= chainon (attributes
, attribute_list
);
18907 /* Parse an attribute-list.
18911 attribute-list , attribute
18915 identifier ( identifier )
18916 identifier ( identifier , expression-list )
18917 identifier ( expression-list )
18919 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
18920 to an attribute. The TREE_PURPOSE of each node is the identifier
18921 indicating which attribute is in use. The TREE_VALUE represents
18922 the arguments, if any. */
18925 cp_parser_attribute_list (cp_parser
* parser
)
18927 tree attribute_list
= NULL_TREE
;
18928 bool save_translate_strings_p
= parser
->translate_strings_p
;
18930 parser
->translate_strings_p
= false;
18937 /* Look for the identifier. We also allow keywords here; for
18938 example `__attribute__ ((const))' is legal. */
18939 token
= cp_lexer_peek_token (parser
->lexer
);
18940 if (token
->type
== CPP_NAME
18941 || token
->type
== CPP_KEYWORD
)
18943 tree arguments
= NULL_TREE
;
18945 /* Consume the token. */
18946 token
= cp_lexer_consume_token (parser
->lexer
);
18948 /* Save away the identifier that indicates which attribute
18950 identifier
= (token
->type
== CPP_KEYWORD
)
18951 /* For keywords, use the canonical spelling, not the
18952 parsed identifier. */
18953 ? ridpointers
[(int) token
->keyword
]
18956 attribute
= build_tree_list (identifier
, NULL_TREE
);
18958 /* Peek at the next token. */
18959 token
= cp_lexer_peek_token (parser
->lexer
);
18960 /* If it's an `(', then parse the attribute arguments. */
18961 if (token
->type
== CPP_OPEN_PAREN
)
18964 int attr_flag
= (attribute_takes_identifier_p (identifier
)
18965 ? id_attr
: normal_attr
);
18966 vec
= cp_parser_parenthesized_expression_list
18967 (parser
, attr_flag
, /*cast_p=*/false,
18968 /*allow_expansion_p=*/false,
18969 /*non_constant_p=*/NULL
);
18971 arguments
= error_mark_node
;
18974 arguments
= build_tree_list_vec (vec
);
18975 release_tree_vector (vec
);
18977 /* Save the arguments away. */
18978 TREE_VALUE (attribute
) = arguments
;
18981 if (arguments
!= error_mark_node
)
18983 /* Add this attribute to the list. */
18984 TREE_CHAIN (attribute
) = attribute_list
;
18985 attribute_list
= attribute
;
18988 token
= cp_lexer_peek_token (parser
->lexer
);
18990 /* Now, look for more attributes. If the next token isn't a
18991 `,', we're done. */
18992 if (token
->type
!= CPP_COMMA
)
18995 /* Consume the comma and keep going. */
18996 cp_lexer_consume_token (parser
->lexer
);
18998 parser
->translate_strings_p
= save_translate_strings_p
;
19000 /* We built up the list in reverse order. */
19001 return nreverse (attribute_list
);
19004 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
19005 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
19006 current value of the PEDANTIC flag, regardless of whether or not
19007 the `__extension__' keyword is present. The caller is responsible
19008 for restoring the value of the PEDANTIC flag. */
19011 cp_parser_extension_opt (cp_parser
* parser
, int* saved_pedantic
)
19013 /* Save the old value of the PEDANTIC flag. */
19014 *saved_pedantic
= pedantic
;
19016 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_EXTENSION
))
19018 /* Consume the `__extension__' token. */
19019 cp_lexer_consume_token (parser
->lexer
);
19020 /* We're not being pedantic while the `__extension__' keyword is
19030 /* Parse a label declaration.
19033 __label__ label-declarator-seq ;
19035 label-declarator-seq:
19036 identifier , label-declarator-seq
19040 cp_parser_label_declaration (cp_parser
* parser
)
19042 /* Look for the `__label__' keyword. */
19043 cp_parser_require_keyword (parser
, RID_LABEL
, RT_LABEL
);
19049 /* Look for an identifier. */
19050 identifier
= cp_parser_identifier (parser
);
19051 /* If we failed, stop. */
19052 if (identifier
== error_mark_node
)
19054 /* Declare it as a label. */
19055 finish_label_decl (identifier
);
19056 /* If the next token is a `;', stop. */
19057 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
19059 /* Look for the `,' separating the label declarations. */
19060 cp_parser_require (parser
, CPP_COMMA
, RT_COMMA
);
19063 /* Look for the final `;'. */
19064 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
19067 /* Support Functions */
19069 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
19070 NAME should have one of the representations used for an
19071 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
19072 is returned. If PARSER->SCOPE is a dependent type, then a
19073 SCOPE_REF is returned.
19075 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
19076 returned; the name was already resolved when the TEMPLATE_ID_EXPR
19077 was formed. Abstractly, such entities should not be passed to this
19078 function, because they do not need to be looked up, but it is
19079 simpler to check for this special case here, rather than at the
19082 In cases not explicitly covered above, this function returns a
19083 DECL, OVERLOAD, or baselink representing the result of the lookup.
19084 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
19087 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
19088 (e.g., "struct") that was used. In that case bindings that do not
19089 refer to types are ignored.
19091 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
19094 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
19097 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
19100 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
19101 TREE_LIST of candidates if name-lookup results in an ambiguity, and
19102 NULL_TREE otherwise. */
19105 cp_parser_lookup_name (cp_parser
*parser
, tree name
,
19106 enum tag_types tag_type
,
19109 bool check_dependency
,
19110 tree
*ambiguous_decls
,
19111 location_t name_location
)
19115 tree object_type
= parser
->context
->object_type
;
19117 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
19118 flags
|= LOOKUP_COMPLAIN
;
19120 /* Assume that the lookup will be unambiguous. */
19121 if (ambiguous_decls
)
19122 *ambiguous_decls
= NULL_TREE
;
19124 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
19125 no longer valid. Note that if we are parsing tentatively, and
19126 the parse fails, OBJECT_TYPE will be automatically restored. */
19127 parser
->context
->object_type
= NULL_TREE
;
19129 if (name
== error_mark_node
)
19130 return error_mark_node
;
19132 /* A template-id has already been resolved; there is no lookup to
19134 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
19136 if (BASELINK_P (name
))
19138 gcc_assert (TREE_CODE (BASELINK_FUNCTIONS (name
))
19139 == TEMPLATE_ID_EXPR
);
19143 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
19144 it should already have been checked to make sure that the name
19145 used matches the type being destroyed. */
19146 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
19150 /* Figure out to which type this destructor applies. */
19152 type
= parser
->scope
;
19153 else if (object_type
)
19154 type
= object_type
;
19156 type
= current_class_type
;
19157 /* If that's not a class type, there is no destructor. */
19158 if (!type
|| !CLASS_TYPE_P (type
))
19159 return error_mark_node
;
19160 if (CLASSTYPE_LAZY_DESTRUCTOR (type
))
19161 lazily_declare_fn (sfk_destructor
, type
);
19162 if (!CLASSTYPE_DESTRUCTORS (type
))
19163 return error_mark_node
;
19164 /* If it was a class type, return the destructor. */
19165 return CLASSTYPE_DESTRUCTORS (type
);
19168 /* By this point, the NAME should be an ordinary identifier. If
19169 the id-expression was a qualified name, the qualifying scope is
19170 stored in PARSER->SCOPE at this point. */
19171 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
);
19173 /* Perform the lookup. */
19178 if (parser
->scope
== error_mark_node
)
19179 return error_mark_node
;
19181 /* If the SCOPE is dependent, the lookup must be deferred until
19182 the template is instantiated -- unless we are explicitly
19183 looking up names in uninstantiated templates. Even then, we
19184 cannot look up the name if the scope is not a class type; it
19185 might, for example, be a template type parameter. */
19186 dependent_p
= (TYPE_P (parser
->scope
)
19187 && dependent_scope_p (parser
->scope
));
19188 if ((check_dependency
|| !CLASS_TYPE_P (parser
->scope
))
19190 /* Defer lookup. */
19191 decl
= error_mark_node
;
19194 tree pushed_scope
= NULL_TREE
;
19196 /* If PARSER->SCOPE is a dependent type, then it must be a
19197 class type, and we must not be checking dependencies;
19198 otherwise, we would have processed this lookup above. So
19199 that PARSER->SCOPE is not considered a dependent base by
19200 lookup_member, we must enter the scope here. */
19202 pushed_scope
= push_scope (parser
->scope
);
19204 /* If the PARSER->SCOPE is a template specialization, it
19205 may be instantiated during name lookup. In that case,
19206 errors may be issued. Even if we rollback the current
19207 tentative parse, those errors are valid. */
19208 decl
= lookup_qualified_name (parser
->scope
, name
,
19209 tag_type
!= none_type
,
19210 /*complain=*/true);
19212 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
19213 lookup result and the nested-name-specifier nominates a class C:
19214 * if the name specified after the nested-name-specifier, when
19215 looked up in C, is the injected-class-name of C (Clause 9), or
19216 * if the name specified after the nested-name-specifier is the
19217 same as the identifier or the simple-template-id's template-
19218 name in the last component of the nested-name-specifier,
19219 the name is instead considered to name the constructor of
19220 class C. [ Note: for example, the constructor is not an
19221 acceptable lookup result in an elaborated-type-specifier so
19222 the constructor would not be used in place of the
19223 injected-class-name. --end note ] Such a constructor name
19224 shall be used only in the declarator-id of a declaration that
19225 names a constructor or in a using-declaration. */
19226 if (tag_type
== none_type
19227 && DECL_SELF_REFERENCE_P (decl
)
19228 && same_type_p (DECL_CONTEXT (decl
), parser
->scope
))
19229 decl
= lookup_qualified_name (parser
->scope
, ctor_identifier
,
19230 tag_type
!= none_type
,
19231 /*complain=*/true);
19233 /* If we have a single function from a using decl, pull it out. */
19234 if (TREE_CODE (decl
) == OVERLOAD
19235 && !really_overloaded_fn (decl
))
19236 decl
= OVL_FUNCTION (decl
);
19239 pop_scope (pushed_scope
);
19242 /* If the scope is a dependent type and either we deferred lookup or
19243 we did lookup but didn't find the name, rememeber the name. */
19244 if (decl
== error_mark_node
&& TYPE_P (parser
->scope
)
19245 && dependent_type_p (parser
->scope
))
19251 /* The resolution to Core Issue 180 says that `struct
19252 A::B' should be considered a type-name, even if `A'
19254 type
= make_typename_type (parser
->scope
, name
, tag_type
,
19255 /*complain=*/tf_error
);
19256 decl
= TYPE_NAME (type
);
19258 else if (is_template
19259 && (cp_parser_next_token_ends_template_argument_p (parser
)
19260 || cp_lexer_next_token_is (parser
->lexer
,
19262 decl
= make_unbound_class_template (parser
->scope
,
19264 /*complain=*/tf_error
);
19266 decl
= build_qualified_name (/*type=*/NULL_TREE
,
19267 parser
->scope
, name
,
19270 parser
->qualifying_scope
= parser
->scope
;
19271 parser
->object_scope
= NULL_TREE
;
19273 else if (object_type
)
19275 tree object_decl
= NULL_TREE
;
19276 /* Look up the name in the scope of the OBJECT_TYPE, unless the
19277 OBJECT_TYPE is not a class. */
19278 if (CLASS_TYPE_P (object_type
))
19279 /* If the OBJECT_TYPE is a template specialization, it may
19280 be instantiated during name lookup. In that case, errors
19281 may be issued. Even if we rollback the current tentative
19282 parse, those errors are valid. */
19283 object_decl
= lookup_member (object_type
,
19286 tag_type
!= none_type
);
19287 /* Look it up in the enclosing context, too. */
19288 decl
= lookup_name_real (name
, tag_type
!= none_type
,
19290 /*block_p=*/true, is_namespace
, flags
);
19291 parser
->object_scope
= object_type
;
19292 parser
->qualifying_scope
= NULL_TREE
;
19294 decl
= object_decl
;
19298 decl
= lookup_name_real (name
, tag_type
!= none_type
,
19300 /*block_p=*/true, is_namespace
, flags
);
19301 parser
->qualifying_scope
= NULL_TREE
;
19302 parser
->object_scope
= NULL_TREE
;
19305 /* If the lookup failed, let our caller know. */
19306 if (!decl
|| decl
== error_mark_node
)
19307 return error_mark_node
;
19309 /* Pull out the template from an injected-class-name (or multiple). */
19311 decl
= maybe_get_template_decl_from_type_decl (decl
);
19313 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
19314 if (TREE_CODE (decl
) == TREE_LIST
)
19316 if (ambiguous_decls
)
19317 *ambiguous_decls
= decl
;
19318 /* The error message we have to print is too complicated for
19319 cp_parser_error, so we incorporate its actions directly. */
19320 if (!cp_parser_simulate_error (parser
))
19322 error_at (name_location
, "reference to %qD is ambiguous",
19324 print_candidates (decl
);
19326 return error_mark_node
;
19329 gcc_assert (DECL_P (decl
)
19330 || TREE_CODE (decl
) == OVERLOAD
19331 || TREE_CODE (decl
) == SCOPE_REF
19332 || TREE_CODE (decl
) == UNBOUND_CLASS_TEMPLATE
19333 || BASELINK_P (decl
));
19335 /* If we have resolved the name of a member declaration, check to
19336 see if the declaration is accessible. When the name resolves to
19337 set of overloaded functions, accessibility is checked when
19338 overload resolution is done.
19340 During an explicit instantiation, access is not checked at all,
19341 as per [temp.explicit]. */
19343 check_accessibility_of_qualified_id (decl
, object_type
, parser
->scope
);
19348 /* Like cp_parser_lookup_name, but for use in the typical case where
19349 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
19350 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
19353 cp_parser_lookup_name_simple (cp_parser
* parser
, tree name
, location_t location
)
19355 return cp_parser_lookup_name (parser
, name
,
19357 /*is_template=*/false,
19358 /*is_namespace=*/false,
19359 /*check_dependency=*/true,
19360 /*ambiguous_decls=*/NULL
,
19364 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
19365 the current context, return the TYPE_DECL. If TAG_NAME_P is
19366 true, the DECL indicates the class being defined in a class-head,
19367 or declared in an elaborated-type-specifier.
19369 Otherwise, return DECL. */
19372 cp_parser_maybe_treat_template_as_class (tree decl
, bool tag_name_p
)
19374 /* If the TEMPLATE_DECL is being declared as part of a class-head,
19375 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
19378 template <typename T> struct B;
19381 template <typename T> struct A::B {};
19383 Similarly, in an elaborated-type-specifier:
19385 namespace N { struct X{}; }
19388 template <typename T> friend struct N::X;
19391 However, if the DECL refers to a class type, and we are in
19392 the scope of the class, then the name lookup automatically
19393 finds the TYPE_DECL created by build_self_reference rather
19394 than a TEMPLATE_DECL. For example, in:
19396 template <class T> struct S {
19400 there is no need to handle such case. */
19402 if (DECL_CLASS_TEMPLATE_P (decl
) && tag_name_p
)
19403 return DECL_TEMPLATE_RESULT (decl
);
19408 /* If too many, or too few, template-parameter lists apply to the
19409 declarator, issue an error message. Returns TRUE if all went well,
19410 and FALSE otherwise. */
19413 cp_parser_check_declarator_template_parameters (cp_parser
* parser
,
19414 cp_declarator
*declarator
,
19415 location_t declarator_location
)
19417 unsigned num_templates
;
19419 /* We haven't seen any classes that involve template parameters yet. */
19422 switch (declarator
->kind
)
19425 if (declarator
->u
.id
.qualifying_scope
)
19429 scope
= declarator
->u
.id
.qualifying_scope
;
19431 while (scope
&& CLASS_TYPE_P (scope
))
19433 /* You're supposed to have one `template <...>'
19434 for every template class, but you don't need one
19435 for a full specialization. For example:
19437 template <class T> struct S{};
19438 template <> struct S<int> { void f(); };
19439 void S<int>::f () {}
19441 is correct; there shouldn't be a `template <>' for
19442 the definition of `S<int>::f'. */
19443 if (!CLASSTYPE_TEMPLATE_INFO (scope
))
19444 /* If SCOPE does not have template information of any
19445 kind, then it is not a template, nor is it nested
19446 within a template. */
19448 if (explicit_class_specialization_p (scope
))
19450 if (PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope
)))
19453 scope
= TYPE_CONTEXT (scope
);
19456 else if (TREE_CODE (declarator
->u
.id
.unqualified_name
)
19457 == TEMPLATE_ID_EXPR
)
19458 /* If the DECLARATOR has the form `X<y>' then it uses one
19459 additional level of template parameters. */
19462 return cp_parser_check_template_parameters
19463 (parser
, num_templates
, declarator_location
, declarator
);
19469 case cdk_reference
:
19471 return (cp_parser_check_declarator_template_parameters
19472 (parser
, declarator
->declarator
, declarator_location
));
19478 gcc_unreachable ();
19483 /* NUM_TEMPLATES were used in the current declaration. If that is
19484 invalid, return FALSE and issue an error messages. Otherwise,
19485 return TRUE. If DECLARATOR is non-NULL, then we are checking a
19486 declarator and we can print more accurate diagnostics. */
19489 cp_parser_check_template_parameters (cp_parser
* parser
,
19490 unsigned num_templates
,
19491 location_t location
,
19492 cp_declarator
*declarator
)
19494 /* If there are the same number of template classes and parameter
19495 lists, that's OK. */
19496 if (parser
->num_template_parameter_lists
== num_templates
)
19498 /* If there are more, but only one more, then we are referring to a
19499 member template. That's OK too. */
19500 if (parser
->num_template_parameter_lists
== num_templates
+ 1)
19502 /* If there are more template classes than parameter lists, we have
19505 template <class T> void S<T>::R<T>::f (); */
19506 if (parser
->num_template_parameter_lists
< num_templates
)
19508 if (declarator
&& !current_function_decl
)
19509 error_at (location
, "specializing member %<%T::%E%> "
19510 "requires %<template<>%> syntax",
19511 declarator
->u
.id
.qualifying_scope
,
19512 declarator
->u
.id
.unqualified_name
);
19513 else if (declarator
)
19514 error_at (location
, "invalid declaration of %<%T::%E%>",
19515 declarator
->u
.id
.qualifying_scope
,
19516 declarator
->u
.id
.unqualified_name
);
19518 error_at (location
, "too few template-parameter-lists");
19521 /* Otherwise, there are too many template parameter lists. We have
19524 template <class T> template <class U> void S::f(); */
19525 error_at (location
, "too many template-parameter-lists");
19529 /* Parse an optional `::' token indicating that the following name is
19530 from the global namespace. If so, PARSER->SCOPE is set to the
19531 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
19532 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
19533 Returns the new value of PARSER->SCOPE, if the `::' token is
19534 present, and NULL_TREE otherwise. */
19537 cp_parser_global_scope_opt (cp_parser
* parser
, bool current_scope_valid_p
)
19541 /* Peek at the next token. */
19542 token
= cp_lexer_peek_token (parser
->lexer
);
19543 /* If we're looking at a `::' token then we're starting from the
19544 global namespace, not our current location. */
19545 if (token
->type
== CPP_SCOPE
)
19547 /* Consume the `::' token. */
19548 cp_lexer_consume_token (parser
->lexer
);
19549 /* Set the SCOPE so that we know where to start the lookup. */
19550 parser
->scope
= global_namespace
;
19551 parser
->qualifying_scope
= global_namespace
;
19552 parser
->object_scope
= NULL_TREE
;
19554 return parser
->scope
;
19556 else if (!current_scope_valid_p
)
19558 parser
->scope
= NULL_TREE
;
19559 parser
->qualifying_scope
= NULL_TREE
;
19560 parser
->object_scope
= NULL_TREE
;
19566 /* Returns TRUE if the upcoming token sequence is the start of a
19567 constructor declarator. If FRIEND_P is true, the declarator is
19568 preceded by the `friend' specifier. */
19571 cp_parser_constructor_declarator_p (cp_parser
*parser
, bool friend_p
)
19573 bool constructor_p
;
19574 tree nested_name_specifier
;
19575 cp_token
*next_token
;
19577 /* The common case is that this is not a constructor declarator, so
19578 try to avoid doing lots of work if at all possible. It's not
19579 valid declare a constructor at function scope. */
19580 if (parser
->in_function_body
)
19582 /* And only certain tokens can begin a constructor declarator. */
19583 next_token
= cp_lexer_peek_token (parser
->lexer
);
19584 if (next_token
->type
!= CPP_NAME
19585 && next_token
->type
!= CPP_SCOPE
19586 && next_token
->type
!= CPP_NESTED_NAME_SPECIFIER
19587 && next_token
->type
!= CPP_TEMPLATE_ID
)
19590 /* Parse tentatively; we are going to roll back all of the tokens
19592 cp_parser_parse_tentatively (parser
);
19593 /* Assume that we are looking at a constructor declarator. */
19594 constructor_p
= true;
19596 /* Look for the optional `::' operator. */
19597 cp_parser_global_scope_opt (parser
,
19598 /*current_scope_valid_p=*/false);
19599 /* Look for the nested-name-specifier. */
19600 nested_name_specifier
19601 = (cp_parser_nested_name_specifier_opt (parser
,
19602 /*typename_keyword_p=*/false,
19603 /*check_dependency_p=*/false,
19605 /*is_declaration=*/false));
19606 /* Outside of a class-specifier, there must be a
19607 nested-name-specifier. */
19608 if (!nested_name_specifier
&&
19609 (!at_class_scope_p () || !TYPE_BEING_DEFINED (current_class_type
)
19611 constructor_p
= false;
19612 else if (nested_name_specifier
== error_mark_node
)
19613 constructor_p
= false;
19615 /* If we have a class scope, this is easy; DR 147 says that S::S always
19616 names the constructor, and no other qualified name could. */
19617 if (constructor_p
&& nested_name_specifier
19618 && TYPE_P (nested_name_specifier
))
19620 tree id
= cp_parser_unqualified_id (parser
,
19621 /*template_keyword_p=*/false,
19622 /*check_dependency_p=*/false,
19623 /*declarator_p=*/true,
19624 /*optional_p=*/false);
19625 if (is_overloaded_fn (id
))
19626 id
= DECL_NAME (get_first_fn (id
));
19627 if (!constructor_name_p (id
, nested_name_specifier
))
19628 constructor_p
= false;
19630 /* If we still think that this might be a constructor-declarator,
19631 look for a class-name. */
19632 else if (constructor_p
)
19636 template <typename T> struct S {
19640 we must recognize that the nested `S' names a class. */
19642 type_decl
= cp_parser_class_name (parser
,
19643 /*typename_keyword_p=*/false,
19644 /*template_keyword_p=*/false,
19646 /*check_dependency_p=*/false,
19647 /*class_head_p=*/false,
19648 /*is_declaration=*/false);
19649 /* If there was no class-name, then this is not a constructor. */
19650 constructor_p
= !cp_parser_error_occurred (parser
);
19652 /* If we're still considering a constructor, we have to see a `(',
19653 to begin the parameter-declaration-clause, followed by either a
19654 `)', an `...', or a decl-specifier. We need to check for a
19655 type-specifier to avoid being fooled into thinking that:
19659 is a constructor. (It is actually a function named `f' that
19660 takes one parameter (of type `int') and returns a value of type
19663 && !cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
19664 constructor_p
= false;
19667 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
)
19668 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_ELLIPSIS
)
19669 /* A parameter declaration begins with a decl-specifier,
19670 which is either the "attribute" keyword, a storage class
19671 specifier, or (usually) a type-specifier. */
19672 && !cp_lexer_next_token_is_decl_specifier_keyword (parser
->lexer
))
19675 tree pushed_scope
= NULL_TREE
;
19676 unsigned saved_num_template_parameter_lists
;
19678 /* Names appearing in the type-specifier should be looked up
19679 in the scope of the class. */
19680 if (current_class_type
)
19684 type
= TREE_TYPE (type_decl
);
19685 if (TREE_CODE (type
) == TYPENAME_TYPE
)
19687 type
= resolve_typename_type (type
,
19688 /*only_current_p=*/false);
19689 if (TREE_CODE (type
) == TYPENAME_TYPE
)
19691 cp_parser_abort_tentative_parse (parser
);
19695 pushed_scope
= push_scope (type
);
19698 /* Inside the constructor parameter list, surrounding
19699 template-parameter-lists do not apply. */
19700 saved_num_template_parameter_lists
19701 = parser
->num_template_parameter_lists
;
19702 parser
->num_template_parameter_lists
= 0;
19704 /* Look for the type-specifier. */
19705 cp_parser_type_specifier (parser
,
19706 CP_PARSER_FLAGS_NONE
,
19707 /*decl_specs=*/NULL
,
19708 /*is_declarator=*/true,
19709 /*declares_class_or_enum=*/NULL
,
19710 /*is_cv_qualifier=*/NULL
);
19712 parser
->num_template_parameter_lists
19713 = saved_num_template_parameter_lists
;
19715 /* Leave the scope of the class. */
19717 pop_scope (pushed_scope
);
19719 constructor_p
= !cp_parser_error_occurred (parser
);
19723 /* We did not really want to consume any tokens. */
19724 cp_parser_abort_tentative_parse (parser
);
19726 return constructor_p
;
19729 /* Parse the definition of the function given by the DECL_SPECIFIERS,
19730 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
19731 they must be performed once we are in the scope of the function.
19733 Returns the function defined. */
19736 cp_parser_function_definition_from_specifiers_and_declarator
19737 (cp_parser
* parser
,
19738 cp_decl_specifier_seq
*decl_specifiers
,
19740 const cp_declarator
*declarator
)
19745 /* Begin the function-definition. */
19746 success_p
= start_function (decl_specifiers
, declarator
, attributes
);
19748 /* The things we're about to see are not directly qualified by any
19749 template headers we've seen thus far. */
19750 reset_specialization ();
19752 /* If there were names looked up in the decl-specifier-seq that we
19753 did not check, check them now. We must wait until we are in the
19754 scope of the function to perform the checks, since the function
19755 might be a friend. */
19756 perform_deferred_access_checks ();
19760 /* Skip the entire function. */
19761 cp_parser_skip_to_end_of_block_or_statement (parser
);
19762 fn
= error_mark_node
;
19764 else if (DECL_INITIAL (current_function_decl
) != error_mark_node
)
19766 /* Seen already, skip it. An error message has already been output. */
19767 cp_parser_skip_to_end_of_block_or_statement (parser
);
19768 fn
= current_function_decl
;
19769 current_function_decl
= NULL_TREE
;
19770 /* If this is a function from a class, pop the nested class. */
19771 if (current_class_name
)
19772 pop_nested_class ();
19775 fn
= cp_parser_function_definition_after_declarator (parser
,
19776 /*inline_p=*/false);
19781 /* Parse the part of a function-definition that follows the
19782 declarator. INLINE_P is TRUE iff this function is an inline
19783 function defined within a class-specifier.
19785 Returns the function defined. */
19788 cp_parser_function_definition_after_declarator (cp_parser
* parser
,
19792 bool ctor_initializer_p
= false;
19793 bool saved_in_unbraced_linkage_specification_p
;
19794 bool saved_in_function_body
;
19795 unsigned saved_num_template_parameter_lists
;
19798 saved_in_function_body
= parser
->in_function_body
;
19799 parser
->in_function_body
= true;
19800 /* If the next token is `return', then the code may be trying to
19801 make use of the "named return value" extension that G++ used to
19803 token
= cp_lexer_peek_token (parser
->lexer
);
19804 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_RETURN
))
19806 /* Consume the `return' keyword. */
19807 cp_lexer_consume_token (parser
->lexer
);
19808 /* Look for the identifier that indicates what value is to be
19810 cp_parser_identifier (parser
);
19811 /* Issue an error message. */
19812 error_at (token
->location
,
19813 "named return values are no longer supported");
19814 /* Skip tokens until we reach the start of the function body. */
19817 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
19818 if (token
->type
== CPP_OPEN_BRACE
19819 || token
->type
== CPP_EOF
19820 || token
->type
== CPP_PRAGMA_EOL
)
19822 cp_lexer_consume_token (parser
->lexer
);
19825 /* The `extern' in `extern "C" void f () { ... }' does not apply to
19826 anything declared inside `f'. */
19827 saved_in_unbraced_linkage_specification_p
19828 = parser
->in_unbraced_linkage_specification_p
;
19829 parser
->in_unbraced_linkage_specification_p
= false;
19830 /* Inside the function, surrounding template-parameter-lists do not
19832 saved_num_template_parameter_lists
19833 = parser
->num_template_parameter_lists
;
19834 parser
->num_template_parameter_lists
= 0;
19836 start_lambda_scope (current_function_decl
);
19838 /* If the next token is `try', then we are looking at a
19839 function-try-block. */
19840 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TRY
))
19841 ctor_initializer_p
= cp_parser_function_try_block (parser
);
19842 /* A function-try-block includes the function-body, so we only do
19843 this next part if we're not processing a function-try-block. */
19846 = cp_parser_ctor_initializer_opt_and_function_body (parser
);
19848 finish_lambda_scope ();
19850 /* Finish the function. */
19851 fn
= finish_function ((ctor_initializer_p
? 1 : 0) |
19852 (inline_p
? 2 : 0));
19853 /* Generate code for it, if necessary. */
19854 expand_or_defer_fn (fn
);
19855 /* Restore the saved values. */
19856 parser
->in_unbraced_linkage_specification_p
19857 = saved_in_unbraced_linkage_specification_p
;
19858 parser
->num_template_parameter_lists
19859 = saved_num_template_parameter_lists
;
19860 parser
->in_function_body
= saved_in_function_body
;
19865 /* Parse a template-declaration, assuming that the `export' (and
19866 `extern') keywords, if present, has already been scanned. MEMBER_P
19867 is as for cp_parser_template_declaration. */
19870 cp_parser_template_declaration_after_export (cp_parser
* parser
, bool member_p
)
19872 tree decl
= NULL_TREE
;
19873 VEC (deferred_access_check
,gc
) *checks
;
19874 tree parameter_list
;
19875 bool friend_p
= false;
19876 bool need_lang_pop
;
19879 /* Look for the `template' keyword. */
19880 token
= cp_lexer_peek_token (parser
->lexer
);
19881 if (!cp_parser_require_keyword (parser
, RID_TEMPLATE
, RT_TEMPLATE
))
19885 if (!cp_parser_require (parser
, CPP_LESS
, RT_LESS
))
19887 if (at_class_scope_p () && current_function_decl
)
19889 /* 14.5.2.2 [temp.mem]
19891 A local class shall not have member templates. */
19892 error_at (token
->location
,
19893 "invalid declaration of member template in local class");
19894 cp_parser_skip_to_end_of_block_or_statement (parser
);
19899 A template ... shall not have C linkage. */
19900 if (current_lang_name
== lang_name_c
)
19902 error_at (token
->location
, "template with C linkage");
19903 /* Give it C++ linkage to avoid confusing other parts of the
19905 push_lang_context (lang_name_cplusplus
);
19906 need_lang_pop
= true;
19909 need_lang_pop
= false;
19911 /* We cannot perform access checks on the template parameter
19912 declarations until we know what is being declared, just as we
19913 cannot check the decl-specifier list. */
19914 push_deferring_access_checks (dk_deferred
);
19916 /* If the next token is `>', then we have an invalid
19917 specialization. Rather than complain about an invalid template
19918 parameter, issue an error message here. */
19919 if (cp_lexer_next_token_is (parser
->lexer
, CPP_GREATER
))
19921 cp_parser_error (parser
, "invalid explicit specialization");
19922 begin_specialization ();
19923 parameter_list
= NULL_TREE
;
19927 /* Parse the template parameters. */
19928 parameter_list
= cp_parser_template_parameter_list (parser
);
19929 fixup_template_parms ();
19932 /* Get the deferred access checks from the parameter list. These
19933 will be checked once we know what is being declared, as for a
19934 member template the checks must be performed in the scope of the
19935 class containing the member. */
19936 checks
= get_deferred_access_checks ();
19938 /* Look for the `>'. */
19939 cp_parser_skip_to_end_of_template_parameter_list (parser
);
19940 /* We just processed one more parameter list. */
19941 ++parser
->num_template_parameter_lists
;
19942 /* If the next token is `template', there are more template
19944 if (cp_lexer_next_token_is_keyword (parser
->lexer
,
19946 cp_parser_template_declaration_after_export (parser
, member_p
);
19949 /* There are no access checks when parsing a template, as we do not
19950 know if a specialization will be a friend. */
19951 push_deferring_access_checks (dk_no_check
);
19952 token
= cp_lexer_peek_token (parser
->lexer
);
19953 decl
= cp_parser_single_declaration (parser
,
19956 /*explicit_specialization_p=*/false,
19958 pop_deferring_access_checks ();
19960 /* If this is a member template declaration, let the front
19962 if (member_p
&& !friend_p
&& decl
)
19964 if (TREE_CODE (decl
) == TYPE_DECL
)
19965 cp_parser_check_access_in_redeclaration (decl
, token
->location
);
19967 decl
= finish_member_template_decl (decl
);
19969 else if (friend_p
&& decl
&& TREE_CODE (decl
) == TYPE_DECL
)
19970 make_friend_class (current_class_type
, TREE_TYPE (decl
),
19971 /*complain=*/true);
19973 /* We are done with the current parameter list. */
19974 --parser
->num_template_parameter_lists
;
19976 pop_deferring_access_checks ();
19979 finish_template_decl (parameter_list
);
19981 /* Register member declarations. */
19982 if (member_p
&& !friend_p
&& decl
&& !DECL_CLASS_TEMPLATE_P (decl
))
19983 finish_member_declaration (decl
);
19984 /* For the erroneous case of a template with C linkage, we pushed an
19985 implicit C++ linkage scope; exit that scope now. */
19987 pop_lang_context ();
19988 /* If DECL is a function template, we must return to parse it later.
19989 (Even though there is no definition, there might be default
19990 arguments that need handling.) */
19991 if (member_p
&& decl
19992 && (TREE_CODE (decl
) == FUNCTION_DECL
19993 || DECL_FUNCTION_TEMPLATE_P (decl
)))
19994 VEC_safe_push (tree
, gc
, unparsed_funs_with_definitions
, decl
);
19997 /* Perform the deferred access checks from a template-parameter-list.
19998 CHECKS is a TREE_LIST of access checks, as returned by
19999 get_deferred_access_checks. */
20002 cp_parser_perform_template_parameter_access_checks (VEC (deferred_access_check
,gc
)* checks
)
20004 ++processing_template_parmlist
;
20005 perform_access_checks (checks
);
20006 --processing_template_parmlist
;
20009 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
20010 `function-definition' sequence. MEMBER_P is true, this declaration
20011 appears in a class scope.
20013 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
20014 *FRIEND_P is set to TRUE iff the declaration is a friend. */
20017 cp_parser_single_declaration (cp_parser
* parser
,
20018 VEC (deferred_access_check
,gc
)* checks
,
20020 bool explicit_specialization_p
,
20023 int declares_class_or_enum
;
20024 tree decl
= NULL_TREE
;
20025 cp_decl_specifier_seq decl_specifiers
;
20026 bool function_definition_p
= false;
20027 cp_token
*decl_spec_token_start
;
20029 /* This function is only used when processing a template
20031 gcc_assert (innermost_scope_kind () == sk_template_parms
20032 || innermost_scope_kind () == sk_template_spec
);
20034 /* Defer access checks until we know what is being declared. */
20035 push_deferring_access_checks (dk_deferred
);
20037 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
20039 decl_spec_token_start
= cp_lexer_peek_token (parser
->lexer
);
20040 cp_parser_decl_specifier_seq (parser
,
20041 CP_PARSER_FLAGS_OPTIONAL
,
20043 &declares_class_or_enum
);
20045 *friend_p
= cp_parser_friend_p (&decl_specifiers
);
20047 /* There are no template typedefs. */
20048 if (decl_specifiers
.specs
[(int) ds_typedef
])
20050 error_at (decl_spec_token_start
->location
,
20051 "template declaration of %<typedef%>");
20052 decl
= error_mark_node
;
20055 /* Gather up the access checks that occurred the
20056 decl-specifier-seq. */
20057 stop_deferring_access_checks ();
20059 /* Check for the declaration of a template class. */
20060 if (declares_class_or_enum
)
20062 if (cp_parser_declares_only_class_p (parser
))
20064 decl
= shadow_tag (&decl_specifiers
);
20069 friend template <typename T> struct A<T>::B;
20072 A<T>::B will be represented by a TYPENAME_TYPE, and
20073 therefore not recognized by shadow_tag. */
20074 if (friend_p
&& *friend_p
20076 && decl_specifiers
.type
20077 && TYPE_P (decl_specifiers
.type
))
20078 decl
= decl_specifiers
.type
;
20080 if (decl
&& decl
!= error_mark_node
)
20081 decl
= TYPE_NAME (decl
);
20083 decl
= error_mark_node
;
20085 /* Perform access checks for template parameters. */
20086 cp_parser_perform_template_parameter_access_checks (checks
);
20090 /* Complain about missing 'typename' or other invalid type names. */
20091 if (!decl_specifiers
.any_type_specifiers_p
)
20092 cp_parser_parse_and_diagnose_invalid_type_name (parser
);
20094 /* If it's not a template class, try for a template function. If
20095 the next token is a `;', then this declaration does not declare
20096 anything. But, if there were errors in the decl-specifiers, then
20097 the error might well have come from an attempted class-specifier.
20098 In that case, there's no need to warn about a missing declarator. */
20100 && (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
)
20101 || decl_specifiers
.type
!= error_mark_node
))
20103 decl
= cp_parser_init_declarator (parser
,
20106 /*function_definition_allowed_p=*/true,
20108 declares_class_or_enum
,
20109 &function_definition_p
,
20112 /* 7.1.1-1 [dcl.stc]
20114 A storage-class-specifier shall not be specified in an explicit
20115 specialization... */
20117 && explicit_specialization_p
20118 && decl_specifiers
.storage_class
!= sc_none
)
20120 error_at (decl_spec_token_start
->location
,
20121 "explicit template specialization cannot have a storage class");
20122 decl
= error_mark_node
;
20126 pop_deferring_access_checks ();
20128 /* Clear any current qualification; whatever comes next is the start
20129 of something new. */
20130 parser
->scope
= NULL_TREE
;
20131 parser
->qualifying_scope
= NULL_TREE
;
20132 parser
->object_scope
= NULL_TREE
;
20133 /* Look for a trailing `;' after the declaration. */
20134 if (!function_definition_p
20135 && (decl
== error_mark_node
20136 || !cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
)))
20137 cp_parser_skip_to_end_of_block_or_statement (parser
);
20142 /* Parse a cast-expression that is not the operand of a unary "&". */
20145 cp_parser_simple_cast_expression (cp_parser
*parser
)
20147 return cp_parser_cast_expression (parser
, /*address_p=*/false,
20148 /*cast_p=*/false, NULL
);
20151 /* Parse a functional cast to TYPE. Returns an expression
20152 representing the cast. */
20155 cp_parser_functional_cast (cp_parser
* parser
, tree type
)
20158 tree expression_list
;
20162 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
20164 maybe_warn_cpp0x (CPP0X_INITIALIZER_LISTS
);
20165 expression_list
= cp_parser_braced_list (parser
, &nonconst_p
);
20166 CONSTRUCTOR_IS_DIRECT_INIT (expression_list
) = 1;
20167 if (TREE_CODE (type
) == TYPE_DECL
)
20168 type
= TREE_TYPE (type
);
20169 return finish_compound_literal (type
, expression_list
);
20173 vec
= cp_parser_parenthesized_expression_list (parser
, non_attr
,
20175 /*allow_expansion_p=*/true,
20176 /*non_constant_p=*/NULL
);
20178 expression_list
= error_mark_node
;
20181 expression_list
= build_tree_list_vec (vec
);
20182 release_tree_vector (vec
);
20185 cast
= build_functional_cast (type
, expression_list
,
20186 tf_warning_or_error
);
20187 /* [expr.const]/1: In an integral constant expression "only type
20188 conversions to integral or enumeration type can be used". */
20189 if (TREE_CODE (type
) == TYPE_DECL
)
20190 type
= TREE_TYPE (type
);
20191 if (cast
!= error_mark_node
20192 && !cast_valid_in_integral_constant_expression_p (type
)
20193 && cp_parser_non_integral_constant_expression (parser
,
20195 return error_mark_node
;
20199 /* Save the tokens that make up the body of a member function defined
20200 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
20201 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
20202 specifiers applied to the declaration. Returns the FUNCTION_DECL
20203 for the member function. */
20206 cp_parser_save_member_function_body (cp_parser
* parser
,
20207 cp_decl_specifier_seq
*decl_specifiers
,
20208 cp_declarator
*declarator
,
20215 /* Create the FUNCTION_DECL. */
20216 fn
= grokmethod (decl_specifiers
, declarator
, attributes
);
20217 /* If something went badly wrong, bail out now. */
20218 if (fn
== error_mark_node
)
20220 /* If there's a function-body, skip it. */
20221 if (cp_parser_token_starts_function_definition_p
20222 (cp_lexer_peek_token (parser
->lexer
)))
20223 cp_parser_skip_to_end_of_block_or_statement (parser
);
20224 return error_mark_node
;
20227 /* Remember it, if there default args to post process. */
20228 cp_parser_save_default_args (parser
, fn
);
20230 /* Save away the tokens that make up the body of the
20232 first
= parser
->lexer
->next_token
;
20233 /* We can have braced-init-list mem-initializers before the fn body. */
20234 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
20236 cp_lexer_consume_token (parser
->lexer
);
20237 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
)
20238 && cp_lexer_next_token_is_not_keyword (parser
->lexer
, RID_TRY
))
20240 /* cache_group will stop after an un-nested { } pair, too. */
20241 if (cp_parser_cache_group (parser
, CPP_CLOSE_PAREN
, /*depth=*/0))
20244 /* variadic mem-inits have ... after the ')'. */
20245 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
20246 cp_lexer_consume_token (parser
->lexer
);
20249 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, /*depth=*/0);
20250 /* Handle function try blocks. */
20251 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_CATCH
))
20252 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, /*depth=*/0);
20253 last
= parser
->lexer
->next_token
;
20255 /* Save away the inline definition; we will process it when the
20256 class is complete. */
20257 DECL_PENDING_INLINE_INFO (fn
) = cp_token_cache_new (first
, last
);
20258 DECL_PENDING_INLINE_P (fn
) = 1;
20260 /* We need to know that this was defined in the class, so that
20261 friend templates are handled correctly. */
20262 DECL_INITIALIZED_IN_CLASS_P (fn
) = 1;
20264 /* Add FN to the queue of functions to be parsed later. */
20265 VEC_safe_push (tree
, gc
, unparsed_funs_with_definitions
, fn
);
20270 /* Parse a template-argument-list, as well as the trailing ">" (but
20271 not the opening ">"). See cp_parser_template_argument_list for the
20275 cp_parser_enclosed_template_argument_list (cp_parser
* parser
)
20279 tree saved_qualifying_scope
;
20280 tree saved_object_scope
;
20281 bool saved_greater_than_is_operator_p
;
20282 int saved_unevaluated_operand
;
20283 int saved_inhibit_evaluation_warnings
;
20287 When parsing a template-id, the first non-nested `>' is taken as
20288 the end of the template-argument-list rather than a greater-than
20290 saved_greater_than_is_operator_p
20291 = parser
->greater_than_is_operator_p
;
20292 parser
->greater_than_is_operator_p
= false;
20293 /* Parsing the argument list may modify SCOPE, so we save it
20295 saved_scope
= parser
->scope
;
20296 saved_qualifying_scope
= parser
->qualifying_scope
;
20297 saved_object_scope
= parser
->object_scope
;
20298 /* We need to evaluate the template arguments, even though this
20299 template-id may be nested within a "sizeof". */
20300 saved_unevaluated_operand
= cp_unevaluated_operand
;
20301 cp_unevaluated_operand
= 0;
20302 saved_inhibit_evaluation_warnings
= c_inhibit_evaluation_warnings
;
20303 c_inhibit_evaluation_warnings
= 0;
20304 /* Parse the template-argument-list itself. */
20305 if (cp_lexer_next_token_is (parser
->lexer
, CPP_GREATER
)
20306 || cp_lexer_next_token_is (parser
->lexer
, CPP_RSHIFT
))
20307 arguments
= NULL_TREE
;
20309 arguments
= cp_parser_template_argument_list (parser
);
20310 /* Look for the `>' that ends the template-argument-list. If we find
20311 a '>>' instead, it's probably just a typo. */
20312 if (cp_lexer_next_token_is (parser
->lexer
, CPP_RSHIFT
))
20314 if (cxx_dialect
!= cxx98
)
20316 /* In C++0x, a `>>' in a template argument list or cast
20317 expression is considered to be two separate `>'
20318 tokens. So, change the current token to a `>', but don't
20319 consume it: it will be consumed later when the outer
20320 template argument list (or cast expression) is parsed.
20321 Note that this replacement of `>' for `>>' is necessary
20322 even if we are parsing tentatively: in the tentative
20323 case, after calling
20324 cp_parser_enclosed_template_argument_list we will always
20325 throw away all of the template arguments and the first
20326 closing `>', either because the template argument list
20327 was erroneous or because we are replacing those tokens
20328 with a CPP_TEMPLATE_ID token. The second `>' (which will
20329 not have been thrown away) is needed either to close an
20330 outer template argument list or to complete a new-style
20332 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
20333 token
->type
= CPP_GREATER
;
20335 else if (!saved_greater_than_is_operator_p
)
20337 /* If we're in a nested template argument list, the '>>' has
20338 to be a typo for '> >'. We emit the error message, but we
20339 continue parsing and we push a '>' as next token, so that
20340 the argument list will be parsed correctly. Note that the
20341 global source location is still on the token before the
20342 '>>', so we need to say explicitly where we want it. */
20343 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
20344 error_at (token
->location
, "%<>>%> should be %<> >%> "
20345 "within a nested template argument list");
20347 token
->type
= CPP_GREATER
;
20351 /* If this is not a nested template argument list, the '>>'
20352 is a typo for '>'. Emit an error message and continue.
20353 Same deal about the token location, but here we can get it
20354 right by consuming the '>>' before issuing the diagnostic. */
20355 cp_token
*token
= cp_lexer_consume_token (parser
->lexer
);
20356 error_at (token
->location
,
20357 "spurious %<>>%>, use %<>%> to terminate "
20358 "a template argument list");
20362 cp_parser_skip_to_end_of_template_parameter_list (parser
);
20363 /* The `>' token might be a greater-than operator again now. */
20364 parser
->greater_than_is_operator_p
20365 = saved_greater_than_is_operator_p
;
20366 /* Restore the SAVED_SCOPE. */
20367 parser
->scope
= saved_scope
;
20368 parser
->qualifying_scope
= saved_qualifying_scope
;
20369 parser
->object_scope
= saved_object_scope
;
20370 cp_unevaluated_operand
= saved_unevaluated_operand
;
20371 c_inhibit_evaluation_warnings
= saved_inhibit_evaluation_warnings
;
20376 /* MEMBER_FUNCTION is a member function, or a friend. If default
20377 arguments, or the body of the function have not yet been parsed,
20381 cp_parser_late_parsing_for_member (cp_parser
* parser
, tree member_function
)
20383 /* If this member is a template, get the underlying
20385 if (DECL_FUNCTION_TEMPLATE_P (member_function
))
20386 member_function
= DECL_TEMPLATE_RESULT (member_function
);
20388 /* There should not be any class definitions in progress at this
20389 point; the bodies of members are only parsed outside of all class
20391 gcc_assert (parser
->num_classes_being_defined
== 0);
20392 /* While we're parsing the member functions we might encounter more
20393 classes. We want to handle them right away, but we don't want
20394 them getting mixed up with functions that are currently in the
20396 push_unparsed_function_queues (parser
);
20398 /* Make sure that any template parameters are in scope. */
20399 maybe_begin_member_template_processing (member_function
);
20401 /* If the body of the function has not yet been parsed, parse it
20403 if (DECL_PENDING_INLINE_P (member_function
))
20405 tree function_scope
;
20406 cp_token_cache
*tokens
;
20408 /* The function is no longer pending; we are processing it. */
20409 tokens
= DECL_PENDING_INLINE_INFO (member_function
);
20410 DECL_PENDING_INLINE_INFO (member_function
) = NULL
;
20411 DECL_PENDING_INLINE_P (member_function
) = 0;
20413 /* If this is a local class, enter the scope of the containing
20415 function_scope
= current_function_decl
;
20416 if (function_scope
)
20417 push_function_context ();
20419 /* Push the body of the function onto the lexer stack. */
20420 cp_parser_push_lexer_for_tokens (parser
, tokens
);
20422 /* Let the front end know that we going to be defining this
20424 start_preparsed_function (member_function
, NULL_TREE
,
20425 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
20427 /* Don't do access checking if it is a templated function. */
20428 if (processing_template_decl
)
20429 push_deferring_access_checks (dk_no_check
);
20431 /* Now, parse the body of the function. */
20432 cp_parser_function_definition_after_declarator (parser
,
20433 /*inline_p=*/true);
20435 if (processing_template_decl
)
20436 pop_deferring_access_checks ();
20438 /* Leave the scope of the containing function. */
20439 if (function_scope
)
20440 pop_function_context ();
20441 cp_parser_pop_lexer (parser
);
20444 /* Remove any template parameters from the symbol table. */
20445 maybe_end_member_template_processing ();
20447 /* Restore the queue. */
20448 pop_unparsed_function_queues (parser
);
20451 /* If DECL contains any default args, remember it on the unparsed
20452 functions queue. */
20455 cp_parser_save_default_args (cp_parser
* parser
, tree decl
)
20459 for (probe
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
20461 probe
= TREE_CHAIN (probe
))
20462 if (TREE_PURPOSE (probe
))
20464 cp_default_arg_entry
*entry
20465 = VEC_safe_push (cp_default_arg_entry
, gc
,
20466 unparsed_funs_with_default_args
, NULL
);
20467 entry
->class_type
= current_class_type
;
20468 entry
->decl
= decl
;
20473 /* FN is a FUNCTION_DECL which may contains a parameter with an
20474 unparsed DEFAULT_ARG. Parse the default args now. This function
20475 assumes that the current scope is the scope in which the default
20476 argument should be processed. */
20479 cp_parser_late_parsing_default_args (cp_parser
*parser
, tree fn
)
20481 bool saved_local_variables_forbidden_p
;
20482 tree parm
, parmdecl
;
20484 /* While we're parsing the default args, we might (due to the
20485 statement expression extension) encounter more classes. We want
20486 to handle them right away, but we don't want them getting mixed
20487 up with default args that are currently in the queue. */
20488 push_unparsed_function_queues (parser
);
20490 /* Local variable names (and the `this' keyword) may not appear
20491 in a default argument. */
20492 saved_local_variables_forbidden_p
= parser
->local_variables_forbidden_p
;
20493 parser
->local_variables_forbidden_p
= true;
20495 for (parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
)),
20496 parmdecl
= DECL_ARGUMENTS (fn
);
20497 parm
&& parm
!= void_list_node
;
20498 parm
= TREE_CHAIN (parm
),
20499 parmdecl
= DECL_CHAIN (parmdecl
))
20501 cp_token_cache
*tokens
;
20502 tree default_arg
= TREE_PURPOSE (parm
);
20504 VEC(tree
,gc
) *insts
;
20511 if (TREE_CODE (default_arg
) != DEFAULT_ARG
)
20512 /* This can happen for a friend declaration for a function
20513 already declared with default arguments. */
20516 /* Push the saved tokens for the default argument onto the parser's
20518 tokens
= DEFARG_TOKENS (default_arg
);
20519 cp_parser_push_lexer_for_tokens (parser
, tokens
);
20521 start_lambda_scope (parmdecl
);
20523 /* Parse the assignment-expression. */
20524 parsed_arg
= cp_parser_assignment_expression (parser
, /*cast_p=*/false, NULL
);
20525 if (parsed_arg
== error_mark_node
)
20527 cp_parser_pop_lexer (parser
);
20531 if (!processing_template_decl
)
20532 parsed_arg
= check_default_argument (TREE_VALUE (parm
), parsed_arg
);
20534 TREE_PURPOSE (parm
) = parsed_arg
;
20536 /* Update any instantiations we've already created. */
20537 for (insts
= DEFARG_INSTANTIATIONS (default_arg
), ix
= 0;
20538 VEC_iterate (tree
, insts
, ix
, copy
); ix
++)
20539 TREE_PURPOSE (copy
) = parsed_arg
;
20541 finish_lambda_scope ();
20543 /* If the token stream has not been completely used up, then
20544 there was extra junk after the end of the default
20546 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
20547 cp_parser_error (parser
, "expected %<,%>");
20549 /* Revert to the main lexer. */
20550 cp_parser_pop_lexer (parser
);
20553 /* Make sure no default arg is missing. */
20554 check_default_args (fn
);
20556 /* Restore the state of local_variables_forbidden_p. */
20557 parser
->local_variables_forbidden_p
= saved_local_variables_forbidden_p
;
20559 /* Restore the queue. */
20560 pop_unparsed_function_queues (parser
);
20563 /* Parse the operand of `sizeof' (or a similar operator). Returns
20564 either a TYPE or an expression, depending on the form of the
20565 input. The KEYWORD indicates which kind of expression we have
20569 cp_parser_sizeof_operand (cp_parser
* parser
, enum rid keyword
)
20571 tree expr
= NULL_TREE
;
20572 const char *saved_message
;
20574 bool saved_integral_constant_expression_p
;
20575 bool saved_non_integral_constant_expression_p
;
20576 bool pack_expansion_p
= false;
20578 /* Types cannot be defined in a `sizeof' expression. Save away the
20580 saved_message
= parser
->type_definition_forbidden_message
;
20581 /* And create the new one. */
20582 tmp
= concat ("types may not be defined in %<",
20583 IDENTIFIER_POINTER (ridpointers
[keyword
]),
20584 "%> expressions", NULL
);
20585 parser
->type_definition_forbidden_message
= tmp
;
20587 /* The restrictions on constant-expressions do not apply inside
20588 sizeof expressions. */
20589 saved_integral_constant_expression_p
20590 = parser
->integral_constant_expression_p
;
20591 saved_non_integral_constant_expression_p
20592 = parser
->non_integral_constant_expression_p
;
20593 parser
->integral_constant_expression_p
= false;
20595 /* If it's a `...', then we are computing the length of a parameter
20597 if (keyword
== RID_SIZEOF
20598 && cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
20600 /* Consume the `...'. */
20601 cp_lexer_consume_token (parser
->lexer
);
20602 maybe_warn_variadic_templates ();
20604 /* Note that this is an expansion. */
20605 pack_expansion_p
= true;
20608 /* Do not actually evaluate the expression. */
20609 ++cp_unevaluated_operand
;
20610 ++c_inhibit_evaluation_warnings
;
20611 /* If it's a `(', then we might be looking at the type-id
20613 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
20616 bool saved_in_type_id_in_expr_p
;
20618 /* We can't be sure yet whether we're looking at a type-id or an
20620 cp_parser_parse_tentatively (parser
);
20621 /* Consume the `('. */
20622 cp_lexer_consume_token (parser
->lexer
);
20623 /* Parse the type-id. */
20624 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
20625 parser
->in_type_id_in_expr_p
= true;
20626 type
= cp_parser_type_id (parser
);
20627 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
20628 /* Now, look for the trailing `)'. */
20629 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
20630 /* If all went well, then we're done. */
20631 if (cp_parser_parse_definitely (parser
))
20633 cp_decl_specifier_seq decl_specs
;
20635 /* Build a trivial decl-specifier-seq. */
20636 clear_decl_specs (&decl_specs
);
20637 decl_specs
.type
= type
;
20639 /* Call grokdeclarator to figure out what type this is. */
20640 expr
= grokdeclarator (NULL
,
20644 /*attrlist=*/NULL
);
20648 /* If the type-id production did not work out, then we must be
20649 looking at the unary-expression production. */
20651 expr
= cp_parser_unary_expression (parser
, /*address_p=*/false,
20652 /*cast_p=*/false, NULL
);
20654 if (pack_expansion_p
)
20655 /* Build a pack expansion. */
20656 expr
= make_pack_expansion (expr
);
20658 /* Go back to evaluating expressions. */
20659 --cp_unevaluated_operand
;
20660 --c_inhibit_evaluation_warnings
;
20662 /* Free the message we created. */
20664 /* And restore the old one. */
20665 parser
->type_definition_forbidden_message
= saved_message
;
20666 parser
->integral_constant_expression_p
20667 = saved_integral_constant_expression_p
;
20668 parser
->non_integral_constant_expression_p
20669 = saved_non_integral_constant_expression_p
;
20674 /* If the current declaration has no declarator, return true. */
20677 cp_parser_declares_only_class_p (cp_parser
*parser
)
20679 /* If the next token is a `;' or a `,' then there is no
20681 return (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
20682 || cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
));
20685 /* Update the DECL_SPECS to reflect the storage class indicated by
20689 cp_parser_set_storage_class (cp_parser
*parser
,
20690 cp_decl_specifier_seq
*decl_specs
,
20692 location_t location
)
20694 cp_storage_class storage_class
;
20696 if (parser
->in_unbraced_linkage_specification_p
)
20698 error_at (location
, "invalid use of %qD in linkage specification",
20699 ridpointers
[keyword
]);
20702 else if (decl_specs
->storage_class
!= sc_none
)
20704 decl_specs
->conflicting_specifiers_p
= true;
20708 if ((keyword
== RID_EXTERN
|| keyword
== RID_STATIC
)
20709 && decl_specs
->specs
[(int) ds_thread
])
20711 error_at (location
, "%<__thread%> before %qD", ridpointers
[keyword
]);
20712 decl_specs
->specs
[(int) ds_thread
] = 0;
20718 storage_class
= sc_auto
;
20721 storage_class
= sc_register
;
20724 storage_class
= sc_static
;
20727 storage_class
= sc_extern
;
20730 storage_class
= sc_mutable
;
20733 gcc_unreachable ();
20735 decl_specs
->storage_class
= storage_class
;
20737 /* A storage class specifier cannot be applied alongside a typedef
20738 specifier. If there is a typedef specifier present then set
20739 conflicting_specifiers_p which will trigger an error later
20740 on in grokdeclarator. */
20741 if (decl_specs
->specs
[(int)ds_typedef
])
20742 decl_specs
->conflicting_specifiers_p
= true;
20745 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If USER_DEFINED_P
20746 is true, the type is a user-defined type; otherwise it is a
20747 built-in type specified by a keyword. */
20750 cp_parser_set_decl_spec_type (cp_decl_specifier_seq
*decl_specs
,
20752 location_t location
,
20753 bool user_defined_p
)
20755 decl_specs
->any_specifiers_p
= true;
20757 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
20758 (with, for example, in "typedef int wchar_t;") we remember that
20759 this is what happened. In system headers, we ignore these
20760 declarations so that G++ can work with system headers that are not
20762 if (decl_specs
->specs
[(int) ds_typedef
]
20764 && (type_spec
== boolean_type_node
20765 || type_spec
== char16_type_node
20766 || type_spec
== char32_type_node
20767 || type_spec
== wchar_type_node
)
20768 && (decl_specs
->type
20769 || decl_specs
->specs
[(int) ds_long
]
20770 || decl_specs
->specs
[(int) ds_short
]
20771 || decl_specs
->specs
[(int) ds_unsigned
]
20772 || decl_specs
->specs
[(int) ds_signed
]))
20774 decl_specs
->redefined_builtin_type
= type_spec
;
20775 if (!decl_specs
->type
)
20777 decl_specs
->type
= type_spec
;
20778 decl_specs
->user_defined_type_p
= false;
20779 decl_specs
->type_location
= location
;
20782 else if (decl_specs
->type
)
20783 decl_specs
->multiple_types_p
= true;
20786 decl_specs
->type
= type_spec
;
20787 decl_specs
->user_defined_type_p
= user_defined_p
;
20788 decl_specs
->redefined_builtin_type
= NULL_TREE
;
20789 decl_specs
->type_location
= location
;
20793 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
20794 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
20797 cp_parser_friend_p (const cp_decl_specifier_seq
*decl_specifiers
)
20799 return decl_specifiers
->specs
[(int) ds_friend
] != 0;
20802 /* Issue an error message indicating that TOKEN_DESC was expected.
20803 If KEYWORD is true, it indicated this function is called by
20804 cp_parser_require_keword and the required token can only be
20805 a indicated keyword. */
20808 cp_parser_required_error (cp_parser
*parser
,
20809 required_token token_desc
,
20812 switch (token_desc
)
20815 cp_parser_error (parser
, "expected %<new%>");
20818 cp_parser_error (parser
, "expected %<delete%>");
20821 cp_parser_error (parser
, "expected %<return%>");
20824 cp_parser_error (parser
, "expected %<while%>");
20827 cp_parser_error (parser
, "expected %<extern%>");
20829 case RT_STATIC_ASSERT
:
20830 cp_parser_error (parser
, "expected %<static_assert%>");
20833 cp_parser_error (parser
, "expected %<decltype%>");
20836 cp_parser_error (parser
, "expected %<operator%>");
20839 cp_parser_error (parser
, "expected %<class%>");
20842 cp_parser_error (parser
, "expected %<template%>");
20845 cp_parser_error (parser
, "expected %<namespace%>");
20848 cp_parser_error (parser
, "expected %<using%>");
20851 cp_parser_error (parser
, "expected %<asm%>");
20854 cp_parser_error (parser
, "expected %<try%>");
20857 cp_parser_error (parser
, "expected %<catch%>");
20860 cp_parser_error (parser
, "expected %<throw%>");
20863 cp_parser_error (parser
, "expected %<__label__%>");
20866 cp_parser_error (parser
, "expected %<@try%>");
20868 case RT_AT_SYNCHRONIZED
:
20869 cp_parser_error (parser
, "expected %<@synchronized%>");
20872 cp_parser_error (parser
, "expected %<@throw%>");
20879 switch (token_desc
)
20882 cp_parser_error (parser
, "expected %<;%>");
20884 case RT_OPEN_PAREN
:
20885 cp_parser_error (parser
, "expected %<(%>");
20887 case RT_CLOSE_BRACE
:
20888 cp_parser_error (parser
, "expected %<}%>");
20890 case RT_OPEN_BRACE
:
20891 cp_parser_error (parser
, "expected %<{%>");
20893 case RT_CLOSE_SQUARE
:
20894 cp_parser_error (parser
, "expected %<]%>");
20896 case RT_OPEN_SQUARE
:
20897 cp_parser_error (parser
, "expected %<[%>");
20900 cp_parser_error (parser
, "expected %<,%>");
20903 cp_parser_error (parser
, "expected %<::%>");
20906 cp_parser_error (parser
, "expected %<<%>");
20909 cp_parser_error (parser
, "expected %<>%>");
20912 cp_parser_error (parser
, "expected %<=%>");
20915 cp_parser_error (parser
, "expected %<...%>");
20918 cp_parser_error (parser
, "expected %<*%>");
20921 cp_parser_error (parser
, "expected %<~%>");
20924 cp_parser_error (parser
, "expected %<:%>");
20926 case RT_COLON_SCOPE
:
20927 cp_parser_error (parser
, "expected %<:%> or %<::%>");
20929 case RT_CLOSE_PAREN
:
20930 cp_parser_error (parser
, "expected %<)%>");
20932 case RT_COMMA_CLOSE_PAREN
:
20933 cp_parser_error (parser
, "expected %<,%> or %<)%>");
20935 case RT_PRAGMA_EOL
:
20936 cp_parser_error (parser
, "expected end of line");
20939 cp_parser_error (parser
, "expected identifier");
20942 cp_parser_error (parser
, "expected selection-statement");
20944 case RT_INTERATION
:
20945 cp_parser_error (parser
, "expected iteration-statement");
20948 cp_parser_error (parser
, "expected jump-statement");
20951 cp_parser_error (parser
, "expected class-key");
20953 case RT_CLASS_TYPENAME_TEMPLATE
:
20954 cp_parser_error (parser
,
20955 "expected %<class%>, %<typename%>, or %<template%>");
20958 gcc_unreachable ();
20962 gcc_unreachable ();
20967 /* If the next token is of the indicated TYPE, consume it. Otherwise,
20968 issue an error message indicating that TOKEN_DESC was expected.
20970 Returns the token consumed, if the token had the appropriate type.
20971 Otherwise, returns NULL. */
20974 cp_parser_require (cp_parser
* parser
,
20975 enum cpp_ttype type
,
20976 required_token token_desc
)
20978 if (cp_lexer_next_token_is (parser
->lexer
, type
))
20979 return cp_lexer_consume_token (parser
->lexer
);
20982 /* Output the MESSAGE -- unless we're parsing tentatively. */
20983 if (!cp_parser_simulate_error (parser
))
20984 cp_parser_required_error (parser
, token_desc
, /*keyword=*/false);
20989 /* An error message is produced if the next token is not '>'.
20990 All further tokens are skipped until the desired token is
20991 found or '{', '}', ';' or an unbalanced ')' or ']'. */
20994 cp_parser_skip_to_end_of_template_parameter_list (cp_parser
* parser
)
20996 /* Current level of '< ... >'. */
20997 unsigned level
= 0;
20998 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
20999 unsigned nesting_depth
= 0;
21001 /* Are we ready, yet? If not, issue error message. */
21002 if (cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
))
21005 /* Skip tokens until the desired token is found. */
21008 /* Peek at the next token. */
21009 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
21012 if (!nesting_depth
)
21017 if (cxx_dialect
== cxx98
)
21018 /* C++0x views the `>>' operator as two `>' tokens, but
21021 else if (!nesting_depth
&& level
-- == 0)
21023 /* We've hit a `>>' where the first `>' closes the
21024 template argument list, and the second `>' is
21025 spurious. Just consume the `>>' and stop; we've
21026 already produced at least one error. */
21027 cp_lexer_consume_token (parser
->lexer
);
21030 /* Fall through for C++0x, so we handle the second `>' in
21034 if (!nesting_depth
&& level
-- == 0)
21036 /* We've reached the token we want, consume it and stop. */
21037 cp_lexer_consume_token (parser
->lexer
);
21042 case CPP_OPEN_PAREN
:
21043 case CPP_OPEN_SQUARE
:
21047 case CPP_CLOSE_PAREN
:
21048 case CPP_CLOSE_SQUARE
:
21049 if (nesting_depth
-- == 0)
21054 case CPP_PRAGMA_EOL
:
21055 case CPP_SEMICOLON
:
21056 case CPP_OPEN_BRACE
:
21057 case CPP_CLOSE_BRACE
:
21058 /* The '>' was probably forgotten, don't look further. */
21065 /* Consume this token. */
21066 cp_lexer_consume_token (parser
->lexer
);
21070 /* If the next token is the indicated keyword, consume it. Otherwise,
21071 issue an error message indicating that TOKEN_DESC was expected.
21073 Returns the token consumed, if the token had the appropriate type.
21074 Otherwise, returns NULL. */
21077 cp_parser_require_keyword (cp_parser
* parser
,
21079 required_token token_desc
)
21081 cp_token
*token
= cp_parser_require (parser
, CPP_KEYWORD
, token_desc
);
21083 if (token
&& token
->keyword
!= keyword
)
21085 cp_parser_required_error (parser
, token_desc
, /*keyword=*/true);
21092 /* Returns TRUE iff TOKEN is a token that can begin the body of a
21093 function-definition. */
21096 cp_parser_token_starts_function_definition_p (cp_token
* token
)
21098 return (/* An ordinary function-body begins with an `{'. */
21099 token
->type
== CPP_OPEN_BRACE
21100 /* A ctor-initializer begins with a `:'. */
21101 || token
->type
== CPP_COLON
21102 /* A function-try-block begins with `try'. */
21103 || token
->keyword
== RID_TRY
21104 /* The named return value extension begins with `return'. */
21105 || token
->keyword
== RID_RETURN
);
21108 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
21112 cp_parser_next_token_starts_class_definition_p (cp_parser
*parser
)
21116 token
= cp_lexer_peek_token (parser
->lexer
);
21117 return (token
->type
== CPP_OPEN_BRACE
|| token
->type
== CPP_COLON
);
21120 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
21121 C++0x) ending a template-argument. */
21124 cp_parser_next_token_ends_template_argument_p (cp_parser
*parser
)
21128 token
= cp_lexer_peek_token (parser
->lexer
);
21129 return (token
->type
== CPP_COMMA
21130 || token
->type
== CPP_GREATER
21131 || token
->type
== CPP_ELLIPSIS
21132 || ((cxx_dialect
!= cxx98
) && token
->type
== CPP_RSHIFT
));
21135 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
21136 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
21139 cp_parser_nth_token_starts_template_argument_list_p (cp_parser
* parser
,
21144 token
= cp_lexer_peek_nth_token (parser
->lexer
, n
);
21145 if (token
->type
== CPP_LESS
)
21147 /* Check for the sequence `<::' in the original code. It would be lexed as
21148 `[:', where `[' is a digraph, and there is no whitespace before
21150 if (token
->type
== CPP_OPEN_SQUARE
&& token
->flags
& DIGRAPH
)
21153 token2
= cp_lexer_peek_nth_token (parser
->lexer
, n
+1);
21154 if (token2
->type
== CPP_COLON
&& !(token2
->flags
& PREV_WHITE
))
21160 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
21161 or none_type otherwise. */
21163 static enum tag_types
21164 cp_parser_token_is_class_key (cp_token
* token
)
21166 switch (token
->keyword
)
21171 return record_type
;
21180 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
21183 cp_parser_check_class_key (enum tag_types class_key
, tree type
)
21185 if ((TREE_CODE (type
) == UNION_TYPE
) != (class_key
== union_type
))
21186 permerror (input_location
, "%qs tag used in naming %q#T",
21187 class_key
== union_type
? "union"
21188 : class_key
== record_type
? "struct" : "class",
21192 /* Issue an error message if DECL is redeclared with different
21193 access than its original declaration [class.access.spec/3].
21194 This applies to nested classes and nested class templates.
21198 cp_parser_check_access_in_redeclaration (tree decl
, location_t location
)
21200 if (!decl
|| !CLASS_TYPE_P (TREE_TYPE (decl
)))
21203 if ((TREE_PRIVATE (decl
)
21204 != (current_access_specifier
== access_private_node
))
21205 || (TREE_PROTECTED (decl
)
21206 != (current_access_specifier
== access_protected_node
)))
21207 error_at (location
, "%qD redeclared with different access", decl
);
21210 /* Look for the `template' keyword, as a syntactic disambiguator.
21211 Return TRUE iff it is present, in which case it will be
21215 cp_parser_optional_template_keyword (cp_parser
*parser
)
21217 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
21219 /* The `template' keyword can only be used within templates;
21220 outside templates the parser can always figure out what is a
21221 template and what is not. */
21222 if (!processing_template_decl
)
21224 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
21225 error_at (token
->location
,
21226 "%<template%> (as a disambiguator) is only allowed "
21227 "within templates");
21228 /* If this part of the token stream is rescanned, the same
21229 error message would be generated. So, we purge the token
21230 from the stream. */
21231 cp_lexer_purge_token (parser
->lexer
);
21236 /* Consume the `template' keyword. */
21237 cp_lexer_consume_token (parser
->lexer
);
21245 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
21246 set PARSER->SCOPE, and perform other related actions. */
21249 cp_parser_pre_parsed_nested_name_specifier (cp_parser
*parser
)
21252 struct tree_check
*check_value
;
21253 deferred_access_check
*chk
;
21254 VEC (deferred_access_check
,gc
) *checks
;
21256 /* Get the stored value. */
21257 check_value
= cp_lexer_consume_token (parser
->lexer
)->u
.tree_check_value
;
21258 /* Perform any access checks that were deferred. */
21259 checks
= check_value
->checks
;
21262 FOR_EACH_VEC_ELT (deferred_access_check
, checks
, i
, chk
)
21263 perform_or_defer_access_check (chk
->binfo
,
21267 /* Set the scope from the stored value. */
21268 parser
->scope
= check_value
->value
;
21269 parser
->qualifying_scope
= check_value
->qualifying_scope
;
21270 parser
->object_scope
= NULL_TREE
;
21273 /* Consume tokens up through a non-nested END token. Returns TRUE if we
21274 encounter the end of a block before what we were looking for. */
21277 cp_parser_cache_group (cp_parser
*parser
,
21278 enum cpp_ttype end
,
21283 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
21285 /* Abort a parenthesized expression if we encounter a semicolon. */
21286 if ((end
== CPP_CLOSE_PAREN
|| depth
== 0)
21287 && token
->type
== CPP_SEMICOLON
)
21289 /* If we've reached the end of the file, stop. */
21290 if (token
->type
== CPP_EOF
21291 || (end
!= CPP_PRAGMA_EOL
21292 && token
->type
== CPP_PRAGMA_EOL
))
21294 if (token
->type
== CPP_CLOSE_BRACE
&& depth
== 0)
21295 /* We've hit the end of an enclosing block, so there's been some
21296 kind of syntax error. */
21299 /* Consume the token. */
21300 cp_lexer_consume_token (parser
->lexer
);
21301 /* See if it starts a new group. */
21302 if (token
->type
== CPP_OPEN_BRACE
)
21304 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, depth
+ 1);
21305 /* In theory this should probably check end == '}', but
21306 cp_parser_save_member_function_body needs it to exit
21307 after either '}' or ')' when called with ')'. */
21311 else if (token
->type
== CPP_OPEN_PAREN
)
21313 cp_parser_cache_group (parser
, CPP_CLOSE_PAREN
, depth
+ 1);
21314 if (depth
== 0 && end
== CPP_CLOSE_PAREN
)
21317 else if (token
->type
== CPP_PRAGMA
)
21318 cp_parser_cache_group (parser
, CPP_PRAGMA_EOL
, depth
+ 1);
21319 else if (token
->type
== end
)
21324 /* Begin parsing tentatively. We always save tokens while parsing
21325 tentatively so that if the tentative parsing fails we can restore the
21329 cp_parser_parse_tentatively (cp_parser
* parser
)
21331 /* Enter a new parsing context. */
21332 parser
->context
= cp_parser_context_new (parser
->context
);
21333 /* Begin saving tokens. */
21334 cp_lexer_save_tokens (parser
->lexer
);
21335 /* In order to avoid repetitive access control error messages,
21336 access checks are queued up until we are no longer parsing
21338 push_deferring_access_checks (dk_deferred
);
21341 /* Commit to the currently active tentative parse. */
21344 cp_parser_commit_to_tentative_parse (cp_parser
* parser
)
21346 cp_parser_context
*context
;
21349 /* Mark all of the levels as committed. */
21350 lexer
= parser
->lexer
;
21351 for (context
= parser
->context
; context
->next
; context
= context
->next
)
21353 if (context
->status
== CP_PARSER_STATUS_KIND_COMMITTED
)
21355 context
->status
= CP_PARSER_STATUS_KIND_COMMITTED
;
21356 while (!cp_lexer_saving_tokens (lexer
))
21357 lexer
= lexer
->next
;
21358 cp_lexer_commit_tokens (lexer
);
21362 /* Abort the currently active tentative parse. All consumed tokens
21363 will be rolled back, and no diagnostics will be issued. */
21366 cp_parser_abort_tentative_parse (cp_parser
* parser
)
21368 cp_parser_simulate_error (parser
);
21369 /* Now, pretend that we want to see if the construct was
21370 successfully parsed. */
21371 cp_parser_parse_definitely (parser
);
21374 /* Stop parsing tentatively. If a parse error has occurred, restore the
21375 token stream. Otherwise, commit to the tokens we have consumed.
21376 Returns true if no error occurred; false otherwise. */
21379 cp_parser_parse_definitely (cp_parser
* parser
)
21381 bool error_occurred
;
21382 cp_parser_context
*context
;
21384 /* Remember whether or not an error occurred, since we are about to
21385 destroy that information. */
21386 error_occurred
= cp_parser_error_occurred (parser
);
21387 /* Remove the topmost context from the stack. */
21388 context
= parser
->context
;
21389 parser
->context
= context
->next
;
21390 /* If no parse errors occurred, commit to the tentative parse. */
21391 if (!error_occurred
)
21393 /* Commit to the tokens read tentatively, unless that was
21395 if (context
->status
!= CP_PARSER_STATUS_KIND_COMMITTED
)
21396 cp_lexer_commit_tokens (parser
->lexer
);
21398 pop_to_parent_deferring_access_checks ();
21400 /* Otherwise, if errors occurred, roll back our state so that things
21401 are just as they were before we began the tentative parse. */
21404 cp_lexer_rollback_tokens (parser
->lexer
);
21405 pop_deferring_access_checks ();
21407 /* Add the context to the front of the free list. */
21408 context
->next
= cp_parser_context_free_list
;
21409 cp_parser_context_free_list
= context
;
21411 return !error_occurred
;
21414 /* Returns true if we are parsing tentatively and are not committed to
21415 this tentative parse. */
21418 cp_parser_uncommitted_to_tentative_parse_p (cp_parser
* parser
)
21420 return (cp_parser_parsing_tentatively (parser
)
21421 && parser
->context
->status
!= CP_PARSER_STATUS_KIND_COMMITTED
);
21424 /* Returns nonzero iff an error has occurred during the most recent
21425 tentative parse. */
21428 cp_parser_error_occurred (cp_parser
* parser
)
21430 return (cp_parser_parsing_tentatively (parser
)
21431 && parser
->context
->status
== CP_PARSER_STATUS_KIND_ERROR
);
21434 /* Returns nonzero if GNU extensions are allowed. */
21437 cp_parser_allow_gnu_extensions_p (cp_parser
* parser
)
21439 return parser
->allow_gnu_extensions_p
;
21442 /* Objective-C++ Productions */
21445 /* Parse an Objective-C expression, which feeds into a primary-expression
21449 objc-message-expression
21450 objc-string-literal
21451 objc-encode-expression
21452 objc-protocol-expression
21453 objc-selector-expression
21455 Returns a tree representation of the expression. */
21458 cp_parser_objc_expression (cp_parser
* parser
)
21460 /* Try to figure out what kind of declaration is present. */
21461 cp_token
*kwd
= cp_lexer_peek_token (parser
->lexer
);
21465 case CPP_OPEN_SQUARE
:
21466 return cp_parser_objc_message_expression (parser
);
21468 case CPP_OBJC_STRING
:
21469 kwd
= cp_lexer_consume_token (parser
->lexer
);
21470 return objc_build_string_object (kwd
->u
.value
);
21473 switch (kwd
->keyword
)
21475 case RID_AT_ENCODE
:
21476 return cp_parser_objc_encode_expression (parser
);
21478 case RID_AT_PROTOCOL
:
21479 return cp_parser_objc_protocol_expression (parser
);
21481 case RID_AT_SELECTOR
:
21482 return cp_parser_objc_selector_expression (parser
);
21488 error_at (kwd
->location
,
21489 "misplaced %<@%D%> Objective-C++ construct",
21491 cp_parser_skip_to_end_of_block_or_statement (parser
);
21494 return error_mark_node
;
21497 /* Parse an Objective-C message expression.
21499 objc-message-expression:
21500 [ objc-message-receiver objc-message-args ]
21502 Returns a representation of an Objective-C message. */
21505 cp_parser_objc_message_expression (cp_parser
* parser
)
21507 tree receiver
, messageargs
;
21509 cp_lexer_consume_token (parser
->lexer
); /* Eat '['. */
21510 receiver
= cp_parser_objc_message_receiver (parser
);
21511 messageargs
= cp_parser_objc_message_args (parser
);
21512 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, RT_CLOSE_SQUARE
);
21514 return objc_build_message_expr (build_tree_list (receiver
, messageargs
));
21517 /* Parse an objc-message-receiver.
21519 objc-message-receiver:
21521 simple-type-specifier
21523 Returns a representation of the type or expression. */
21526 cp_parser_objc_message_receiver (cp_parser
* parser
)
21530 /* An Objective-C message receiver may be either (1) a type
21531 or (2) an expression. */
21532 cp_parser_parse_tentatively (parser
);
21533 rcv
= cp_parser_expression (parser
, false, NULL
);
21535 if (cp_parser_parse_definitely (parser
))
21538 rcv
= cp_parser_simple_type_specifier (parser
,
21539 /*decl_specs=*/NULL
,
21540 CP_PARSER_FLAGS_NONE
);
21542 return objc_get_class_reference (rcv
);
21545 /* Parse the arguments and selectors comprising an Objective-C message.
21550 objc-selector-args , objc-comma-args
21552 objc-selector-args:
21553 objc-selector [opt] : assignment-expression
21554 objc-selector-args objc-selector [opt] : assignment-expression
21557 assignment-expression
21558 objc-comma-args , assignment-expression
21560 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
21561 selector arguments and TREE_VALUE containing a list of comma
21565 cp_parser_objc_message_args (cp_parser
* parser
)
21567 tree sel_args
= NULL_TREE
, addl_args
= NULL_TREE
;
21568 bool maybe_unary_selector_p
= true;
21569 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
21571 while (cp_parser_objc_selector_p (token
->type
) || token
->type
== CPP_COLON
)
21573 tree selector
= NULL_TREE
, arg
;
21575 if (token
->type
!= CPP_COLON
)
21576 selector
= cp_parser_objc_selector (parser
);
21578 /* Detect if we have a unary selector. */
21579 if (maybe_unary_selector_p
21580 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
21581 return build_tree_list (selector
, NULL_TREE
);
21583 maybe_unary_selector_p
= false;
21584 cp_parser_require (parser
, CPP_COLON
, RT_COLON
);
21585 arg
= cp_parser_assignment_expression (parser
, false, NULL
);
21588 = chainon (sel_args
,
21589 build_tree_list (selector
, arg
));
21591 token
= cp_lexer_peek_token (parser
->lexer
);
21594 /* Handle non-selector arguments, if any. */
21595 while (token
->type
== CPP_COMMA
)
21599 cp_lexer_consume_token (parser
->lexer
);
21600 arg
= cp_parser_assignment_expression (parser
, false, NULL
);
21603 = chainon (addl_args
,
21604 build_tree_list (NULL_TREE
, arg
));
21606 token
= cp_lexer_peek_token (parser
->lexer
);
21609 if (sel_args
== NULL_TREE
&& addl_args
== NULL_TREE
)
21611 cp_parser_error (parser
, "objective-c++ message argument(s) are expected");
21612 return build_tree_list (error_mark_node
, error_mark_node
);
21615 return build_tree_list (sel_args
, addl_args
);
21618 /* Parse an Objective-C encode expression.
21620 objc-encode-expression:
21621 @encode objc-typename
21623 Returns an encoded representation of the type argument. */
21626 cp_parser_objc_encode_expression (cp_parser
* parser
)
21631 cp_lexer_consume_token (parser
->lexer
); /* Eat '@encode'. */
21632 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
21633 token
= cp_lexer_peek_token (parser
->lexer
);
21634 type
= complete_type (cp_parser_type_id (parser
));
21635 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
21639 error_at (token
->location
,
21640 "%<@encode%> must specify a type as an argument");
21641 return error_mark_node
;
21644 /* This happens if we find @encode(T) (where T is a template
21645 typename or something dependent on a template typename) when
21646 parsing a template. In that case, we can't compile it
21647 immediately, but we rather create an AT_ENCODE_EXPR which will
21648 need to be instantiated when the template is used.
21650 if (dependent_type_p (type
))
21652 tree value
= build_min (AT_ENCODE_EXPR
, size_type_node
, type
);
21653 TREE_READONLY (value
) = 1;
21657 return objc_build_encode_expr (type
);
21660 /* Parse an Objective-C @defs expression. */
21663 cp_parser_objc_defs_expression (cp_parser
*parser
)
21667 cp_lexer_consume_token (parser
->lexer
); /* Eat '@defs'. */
21668 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
21669 name
= cp_parser_identifier (parser
);
21670 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
21672 return objc_get_class_ivars (name
);
21675 /* Parse an Objective-C protocol expression.
21677 objc-protocol-expression:
21678 @protocol ( identifier )
21680 Returns a representation of the protocol expression. */
21683 cp_parser_objc_protocol_expression (cp_parser
* parser
)
21687 cp_lexer_consume_token (parser
->lexer
); /* Eat '@protocol'. */
21688 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
21689 proto
= cp_parser_identifier (parser
);
21690 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
21692 return objc_build_protocol_expr (proto
);
21695 /* Parse an Objective-C selector expression.
21697 objc-selector-expression:
21698 @selector ( objc-method-signature )
21700 objc-method-signature:
21706 objc-selector-seq objc-selector :
21708 Returns a representation of the method selector. */
21711 cp_parser_objc_selector_expression (cp_parser
* parser
)
21713 tree sel_seq
= NULL_TREE
;
21714 bool maybe_unary_selector_p
= true;
21716 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
21718 cp_lexer_consume_token (parser
->lexer
); /* Eat '@selector'. */
21719 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
21720 token
= cp_lexer_peek_token (parser
->lexer
);
21722 while (cp_parser_objc_selector_p (token
->type
) || token
->type
== CPP_COLON
21723 || token
->type
== CPP_SCOPE
)
21725 tree selector
= NULL_TREE
;
21727 if (token
->type
!= CPP_COLON
21728 || token
->type
== CPP_SCOPE
)
21729 selector
= cp_parser_objc_selector (parser
);
21731 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
)
21732 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_SCOPE
))
21734 /* Detect if we have a unary selector. */
21735 if (maybe_unary_selector_p
)
21737 sel_seq
= selector
;
21738 goto finish_selector
;
21742 cp_parser_error (parser
, "expected %<:%>");
21745 maybe_unary_selector_p
= false;
21746 token
= cp_lexer_consume_token (parser
->lexer
);
21748 if (token
->type
== CPP_SCOPE
)
21751 = chainon (sel_seq
,
21752 build_tree_list (selector
, NULL_TREE
));
21754 = chainon (sel_seq
,
21755 build_tree_list (NULL_TREE
, NULL_TREE
));
21759 = chainon (sel_seq
,
21760 build_tree_list (selector
, NULL_TREE
));
21762 token
= cp_lexer_peek_token (parser
->lexer
);
21766 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
21768 return objc_build_selector_expr (loc
, sel_seq
);
21771 /* Parse a list of identifiers.
21773 objc-identifier-list:
21775 objc-identifier-list , identifier
21777 Returns a TREE_LIST of identifier nodes. */
21780 cp_parser_objc_identifier_list (cp_parser
* parser
)
21786 identifier
= cp_parser_identifier (parser
);
21787 if (identifier
== error_mark_node
)
21788 return error_mark_node
;
21790 list
= build_tree_list (NULL_TREE
, identifier
);
21791 sep
= cp_lexer_peek_token (parser
->lexer
);
21793 while (sep
->type
== CPP_COMMA
)
21795 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
21796 identifier
= cp_parser_identifier (parser
);
21797 if (identifier
== error_mark_node
)
21800 list
= chainon (list
, build_tree_list (NULL_TREE
,
21802 sep
= cp_lexer_peek_token (parser
->lexer
);
21808 /* Parse an Objective-C alias declaration.
21810 objc-alias-declaration:
21811 @compatibility_alias identifier identifier ;
21813 This function registers the alias mapping with the Objective-C front end.
21814 It returns nothing. */
21817 cp_parser_objc_alias_declaration (cp_parser
* parser
)
21821 cp_lexer_consume_token (parser
->lexer
); /* Eat '@compatibility_alias'. */
21822 alias
= cp_parser_identifier (parser
);
21823 orig
= cp_parser_identifier (parser
);
21824 objc_declare_alias (alias
, orig
);
21825 cp_parser_consume_semicolon_at_end_of_statement (parser
);
21828 /* Parse an Objective-C class forward-declaration.
21830 objc-class-declaration:
21831 @class objc-identifier-list ;
21833 The function registers the forward declarations with the Objective-C
21834 front end. It returns nothing. */
21837 cp_parser_objc_class_declaration (cp_parser
* parser
)
21839 cp_lexer_consume_token (parser
->lexer
); /* Eat '@class'. */
21840 objc_declare_class (cp_parser_objc_identifier_list (parser
));
21841 cp_parser_consume_semicolon_at_end_of_statement (parser
);
21844 /* Parse a list of Objective-C protocol references.
21846 objc-protocol-refs-opt:
21847 objc-protocol-refs [opt]
21849 objc-protocol-refs:
21850 < objc-identifier-list >
21852 Returns a TREE_LIST of identifiers, if any. */
21855 cp_parser_objc_protocol_refs_opt (cp_parser
* parser
)
21857 tree protorefs
= NULL_TREE
;
21859 if(cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
21861 cp_lexer_consume_token (parser
->lexer
); /* Eat '<'. */
21862 protorefs
= cp_parser_objc_identifier_list (parser
);
21863 cp_parser_require (parser
, CPP_GREATER
, RT_GREATER
);
21869 /* Parse a Objective-C visibility specification. */
21872 cp_parser_objc_visibility_spec (cp_parser
* parser
)
21874 cp_token
*vis
= cp_lexer_peek_token (parser
->lexer
);
21876 switch (vis
->keyword
)
21878 case RID_AT_PRIVATE
:
21879 objc_set_visibility (OBJC_IVAR_VIS_PRIVATE
);
21881 case RID_AT_PROTECTED
:
21882 objc_set_visibility (OBJC_IVAR_VIS_PROTECTED
);
21884 case RID_AT_PUBLIC
:
21885 objc_set_visibility (OBJC_IVAR_VIS_PUBLIC
);
21887 case RID_AT_PACKAGE
:
21888 objc_set_visibility (OBJC_IVAR_VIS_PACKAGE
);
21894 /* Eat '@private'/'@protected'/'@public'. */
21895 cp_lexer_consume_token (parser
->lexer
);
21898 /* Parse an Objective-C method type. Return 'true' if it is a class
21899 (+) method, and 'false' if it is an instance (-) method. */
21902 cp_parser_objc_method_type (cp_parser
* parser
)
21904 if (cp_lexer_consume_token (parser
->lexer
)->type
== CPP_PLUS
)
21910 /* Parse an Objective-C protocol qualifier. */
21913 cp_parser_objc_protocol_qualifiers (cp_parser
* parser
)
21915 tree quals
= NULL_TREE
, node
;
21916 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
21918 node
= token
->u
.value
;
21920 while (node
&& TREE_CODE (node
) == IDENTIFIER_NODE
21921 && (node
== ridpointers
[(int) RID_IN
]
21922 || node
== ridpointers
[(int) RID_OUT
]
21923 || node
== ridpointers
[(int) RID_INOUT
]
21924 || node
== ridpointers
[(int) RID_BYCOPY
]
21925 || node
== ridpointers
[(int) RID_BYREF
]
21926 || node
== ridpointers
[(int) RID_ONEWAY
]))
21928 quals
= tree_cons (NULL_TREE
, node
, quals
);
21929 cp_lexer_consume_token (parser
->lexer
);
21930 token
= cp_lexer_peek_token (parser
->lexer
);
21931 node
= token
->u
.value
;
21937 /* Parse an Objective-C typename. */
21940 cp_parser_objc_typename (cp_parser
* parser
)
21942 tree type_name
= NULL_TREE
;
21944 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
21946 tree proto_quals
, cp_type
= NULL_TREE
;
21948 cp_lexer_consume_token (parser
->lexer
); /* Eat '('. */
21949 proto_quals
= cp_parser_objc_protocol_qualifiers (parser
);
21951 /* An ObjC type name may consist of just protocol qualifiers, in which
21952 case the type shall default to 'id'. */
21953 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
21955 cp_type
= cp_parser_type_id (parser
);
21957 /* If the type could not be parsed, an error has already
21958 been produced. For error recovery, behave as if it had
21959 not been specified, which will use the default type
21961 if (cp_type
== error_mark_node
)
21963 cp_type
= NULL_TREE
;
21964 /* We need to skip to the closing parenthesis as
21965 cp_parser_type_id() does not seem to do it for
21967 cp_parser_skip_to_closing_parenthesis (parser
,
21968 /*recovering=*/true,
21969 /*or_comma=*/false,
21970 /*consume_paren=*/false);
21974 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
21975 type_name
= build_tree_list (proto_quals
, cp_type
);
21981 /* Check to see if TYPE refers to an Objective-C selector name. */
21984 cp_parser_objc_selector_p (enum cpp_ttype type
)
21986 return (type
== CPP_NAME
|| type
== CPP_KEYWORD
21987 || type
== CPP_AND_AND
|| type
== CPP_AND_EQ
|| type
== CPP_AND
21988 || type
== CPP_OR
|| type
== CPP_COMPL
|| type
== CPP_NOT
21989 || type
== CPP_NOT_EQ
|| type
== CPP_OR_OR
|| type
== CPP_OR_EQ
21990 || type
== CPP_XOR
|| type
== CPP_XOR_EQ
);
21993 /* Parse an Objective-C selector. */
21996 cp_parser_objc_selector (cp_parser
* parser
)
21998 cp_token
*token
= cp_lexer_consume_token (parser
->lexer
);
22000 if (!cp_parser_objc_selector_p (token
->type
))
22002 error_at (token
->location
, "invalid Objective-C++ selector name");
22003 return error_mark_node
;
22006 /* C++ operator names are allowed to appear in ObjC selectors. */
22007 switch (token
->type
)
22009 case CPP_AND_AND
: return get_identifier ("and");
22010 case CPP_AND_EQ
: return get_identifier ("and_eq");
22011 case CPP_AND
: return get_identifier ("bitand");
22012 case CPP_OR
: return get_identifier ("bitor");
22013 case CPP_COMPL
: return get_identifier ("compl");
22014 case CPP_NOT
: return get_identifier ("not");
22015 case CPP_NOT_EQ
: return get_identifier ("not_eq");
22016 case CPP_OR_OR
: return get_identifier ("or");
22017 case CPP_OR_EQ
: return get_identifier ("or_eq");
22018 case CPP_XOR
: return get_identifier ("xor");
22019 case CPP_XOR_EQ
: return get_identifier ("xor_eq");
22020 default: return token
->u
.value
;
22024 /* Parse an Objective-C params list. */
22027 cp_parser_objc_method_keyword_params (cp_parser
* parser
, tree
* attributes
)
22029 tree params
= NULL_TREE
;
22030 bool maybe_unary_selector_p
= true;
22031 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
22033 while (cp_parser_objc_selector_p (token
->type
) || token
->type
== CPP_COLON
)
22035 tree selector
= NULL_TREE
, type_name
, identifier
;
22036 tree parm_attr
= NULL_TREE
;
22038 if (token
->keyword
== RID_ATTRIBUTE
)
22041 if (token
->type
!= CPP_COLON
)
22042 selector
= cp_parser_objc_selector (parser
);
22044 /* Detect if we have a unary selector. */
22045 if (maybe_unary_selector_p
22046 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
22048 params
= selector
; /* Might be followed by attributes. */
22052 maybe_unary_selector_p
= false;
22053 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
))
22055 /* Something went quite wrong. There should be a colon
22056 here, but there is not. Stop parsing parameters. */
22059 type_name
= cp_parser_objc_typename (parser
);
22060 /* New ObjC allows attributes on parameters too. */
22061 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ATTRIBUTE
))
22062 parm_attr
= cp_parser_attributes_opt (parser
);
22063 identifier
= cp_parser_identifier (parser
);
22067 objc_build_keyword_decl (selector
,
22072 token
= cp_lexer_peek_token (parser
->lexer
);
22075 if (params
== NULL_TREE
)
22077 cp_parser_error (parser
, "objective-c++ method declaration is expected");
22078 return error_mark_node
;
22081 /* We allow tail attributes for the method. */
22082 if (token
->keyword
== RID_ATTRIBUTE
)
22084 *attributes
= cp_parser_attributes_opt (parser
);
22085 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
22086 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
22088 cp_parser_error (parser
,
22089 "method attributes must be specified at the end");
22090 return error_mark_node
;
22093 if (params
== NULL_TREE
)
22095 cp_parser_error (parser
, "objective-c++ method declaration is expected");
22096 return error_mark_node
;
22101 /* Parse the non-keyword Objective-C params. */
22104 cp_parser_objc_method_tail_params_opt (cp_parser
* parser
, bool *ellipsisp
,
22107 tree params
= make_node (TREE_LIST
);
22108 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
22109 *ellipsisp
= false; /* Initially, assume no ellipsis. */
22111 while (token
->type
== CPP_COMMA
)
22113 cp_parameter_declarator
*parmdecl
;
22116 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
22117 token
= cp_lexer_peek_token (parser
->lexer
);
22119 if (token
->type
== CPP_ELLIPSIS
)
22121 cp_lexer_consume_token (parser
->lexer
); /* Eat '...'. */
22123 token
= cp_lexer_peek_token (parser
->lexer
);
22127 /* TODO: parse attributes for tail parameters. */
22128 parmdecl
= cp_parser_parameter_declaration (parser
, false, NULL
);
22129 parm
= grokdeclarator (parmdecl
->declarator
,
22130 &parmdecl
->decl_specifiers
,
22131 PARM
, /*initialized=*/0,
22132 /*attrlist=*/NULL
);
22134 chainon (params
, build_tree_list (NULL_TREE
, parm
));
22135 token
= cp_lexer_peek_token (parser
->lexer
);
22138 /* We allow tail attributes for the method. */
22139 if (token
->keyword
== RID_ATTRIBUTE
)
22141 if (*attributes
== NULL_TREE
)
22143 *attributes
= cp_parser_attributes_opt (parser
);
22144 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
22145 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
22149 /* We have an error, but parse the attributes, so that we can
22151 *attributes
= cp_parser_attributes_opt (parser
);
22153 cp_parser_error (parser
,
22154 "method attributes must be specified at the end");
22155 return error_mark_node
;
22161 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
22164 cp_parser_objc_interstitial_code (cp_parser
* parser
)
22166 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
22168 /* If the next token is `extern' and the following token is a string
22169 literal, then we have a linkage specification. */
22170 if (token
->keyword
== RID_EXTERN
22171 && cp_parser_is_string_literal (cp_lexer_peek_nth_token (parser
->lexer
, 2)))
22172 cp_parser_linkage_specification (parser
);
22173 /* Handle #pragma, if any. */
22174 else if (token
->type
== CPP_PRAGMA
)
22175 cp_parser_pragma (parser
, pragma_external
);
22176 /* Allow stray semicolons. */
22177 else if (token
->type
== CPP_SEMICOLON
)
22178 cp_lexer_consume_token (parser
->lexer
);
22179 /* Mark methods as optional or required, when building protocols. */
22180 else if (token
->keyword
== RID_AT_OPTIONAL
)
22182 cp_lexer_consume_token (parser
->lexer
);
22183 objc_set_method_opt (true);
22185 else if (token
->keyword
== RID_AT_REQUIRED
)
22187 cp_lexer_consume_token (parser
->lexer
);
22188 objc_set_method_opt (false);
22190 else if (token
->keyword
== RID_NAMESPACE
)
22191 cp_parser_namespace_definition (parser
);
22192 /* Other stray characters must generate errors. */
22193 else if (token
->type
== CPP_OPEN_BRACE
|| token
->type
== CPP_CLOSE_BRACE
)
22195 cp_lexer_consume_token (parser
->lexer
);
22196 error ("stray %qs between Objective-C++ methods",
22197 token
->type
== CPP_OPEN_BRACE
? "{" : "}");
22199 /* Finally, try to parse a block-declaration, or a function-definition. */
22201 cp_parser_block_declaration (parser
, /*statement_p=*/false);
22204 /* Parse a method signature. */
22207 cp_parser_objc_method_signature (cp_parser
* parser
, tree
* attributes
)
22209 tree rettype
, kwdparms
, optparms
;
22210 bool ellipsis
= false;
22211 bool is_class_method
;
22213 is_class_method
= cp_parser_objc_method_type (parser
);
22214 rettype
= cp_parser_objc_typename (parser
);
22215 *attributes
= NULL_TREE
;
22216 kwdparms
= cp_parser_objc_method_keyword_params (parser
, attributes
);
22217 if (kwdparms
== error_mark_node
)
22218 return error_mark_node
;
22219 optparms
= cp_parser_objc_method_tail_params_opt (parser
, &ellipsis
, attributes
);
22220 if (optparms
== error_mark_node
)
22221 return error_mark_node
;
22223 return objc_build_method_signature (is_class_method
, rettype
, kwdparms
, optparms
, ellipsis
);
22227 cp_parser_objc_method_maybe_bad_prefix_attributes (cp_parser
* parser
)
22230 cp_lexer_save_tokens (parser
->lexer
);
22231 tattr
= cp_parser_attributes_opt (parser
);
22232 gcc_assert (tattr
) ;
22234 /* If the attributes are followed by a method introducer, this is not allowed.
22235 Dump the attributes and flag the situation. */
22236 if (cp_lexer_next_token_is (parser
->lexer
, CPP_PLUS
)
22237 || cp_lexer_next_token_is (parser
->lexer
, CPP_MINUS
))
22240 /* Otherwise, the attributes introduce some interstitial code, possibly so
22241 rewind to allow that check. */
22242 cp_lexer_rollback_tokens (parser
->lexer
);
22246 /* Parse an Objective-C method prototype list. */
22249 cp_parser_objc_method_prototype_list (cp_parser
* parser
)
22251 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
22253 while (token
->keyword
!= RID_AT_END
&& token
->type
!= CPP_EOF
)
22255 if (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
)
22257 tree attributes
, sig
;
22258 bool is_class_method
;
22259 if (token
->type
== CPP_PLUS
)
22260 is_class_method
= true;
22262 is_class_method
= false;
22263 sig
= cp_parser_objc_method_signature (parser
, &attributes
);
22264 if (sig
== error_mark_node
)
22266 cp_parser_skip_to_end_of_block_or_statement (parser
);
22267 token
= cp_lexer_peek_token (parser
->lexer
);
22270 objc_add_method_declaration (is_class_method
, sig
, attributes
);
22271 cp_parser_consume_semicolon_at_end_of_statement (parser
);
22273 else if (token
->keyword
== RID_AT_PROPERTY
)
22274 cp_parser_objc_at_property_declaration (parser
);
22275 else if (token
->keyword
== RID_ATTRIBUTE
22276 && cp_parser_objc_method_maybe_bad_prefix_attributes(parser
))
22277 warning_at (cp_lexer_peek_token (parser
->lexer
)->location
,
22279 "prefix attributes are ignored for methods");
22281 /* Allow for interspersed non-ObjC++ code. */
22282 cp_parser_objc_interstitial_code (parser
);
22284 token
= cp_lexer_peek_token (parser
->lexer
);
22287 if (token
->type
!= CPP_EOF
)
22288 cp_lexer_consume_token (parser
->lexer
); /* Eat '@end'. */
22290 cp_parser_error (parser
, "expected %<@end%>");
22292 objc_finish_interface ();
22295 /* Parse an Objective-C method definition list. */
22298 cp_parser_objc_method_definition_list (cp_parser
* parser
)
22300 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
22302 while (token
->keyword
!= RID_AT_END
&& token
->type
!= CPP_EOF
)
22306 if (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
)
22309 tree sig
, attribute
;
22310 bool is_class_method
;
22311 if (token
->type
== CPP_PLUS
)
22312 is_class_method
= true;
22314 is_class_method
= false;
22315 push_deferring_access_checks (dk_deferred
);
22316 sig
= cp_parser_objc_method_signature (parser
, &attribute
);
22317 if (sig
== error_mark_node
)
22319 cp_parser_skip_to_end_of_block_or_statement (parser
);
22320 token
= cp_lexer_peek_token (parser
->lexer
);
22323 objc_start_method_definition (is_class_method
, sig
, attribute
);
22325 /* For historical reasons, we accept an optional semicolon. */
22326 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
22327 cp_lexer_consume_token (parser
->lexer
);
22329 ptk
= cp_lexer_peek_token (parser
->lexer
);
22330 if (!(ptk
->type
== CPP_PLUS
|| ptk
->type
== CPP_MINUS
22331 || ptk
->type
== CPP_EOF
|| ptk
->keyword
== RID_AT_END
))
22333 perform_deferred_access_checks ();
22334 stop_deferring_access_checks ();
22335 meth
= cp_parser_function_definition_after_declarator (parser
,
22337 pop_deferring_access_checks ();
22338 objc_finish_method_definition (meth
);
22341 /* The following case will be removed once @synthesize is
22342 completely implemented. */
22343 else if (token
->keyword
== RID_AT_PROPERTY
)
22344 cp_parser_objc_at_property_declaration (parser
);
22345 else if (token
->keyword
== RID_AT_SYNTHESIZE
)
22346 cp_parser_objc_at_synthesize_declaration (parser
);
22347 else if (token
->keyword
== RID_AT_DYNAMIC
)
22348 cp_parser_objc_at_dynamic_declaration (parser
);
22349 else if (token
->keyword
== RID_ATTRIBUTE
22350 && cp_parser_objc_method_maybe_bad_prefix_attributes(parser
))
22351 warning_at (token
->location
, OPT_Wattributes
,
22352 "prefix attributes are ignored for methods");
22354 /* Allow for interspersed non-ObjC++ code. */
22355 cp_parser_objc_interstitial_code (parser
);
22357 token
= cp_lexer_peek_token (parser
->lexer
);
22360 if (token
->type
!= CPP_EOF
)
22361 cp_lexer_consume_token (parser
->lexer
); /* Eat '@end'. */
22363 cp_parser_error (parser
, "expected %<@end%>");
22365 objc_finish_implementation ();
22368 /* Parse Objective-C ivars. */
22371 cp_parser_objc_class_ivars (cp_parser
* parser
)
22373 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
22375 if (token
->type
!= CPP_OPEN_BRACE
)
22376 return; /* No ivars specified. */
22378 cp_lexer_consume_token (parser
->lexer
); /* Eat '{'. */
22379 token
= cp_lexer_peek_token (parser
->lexer
);
22381 while (token
->type
!= CPP_CLOSE_BRACE
22382 && token
->keyword
!= RID_AT_END
&& token
->type
!= CPP_EOF
)
22384 cp_decl_specifier_seq declspecs
;
22385 int decl_class_or_enum_p
;
22386 tree prefix_attributes
;
22388 cp_parser_objc_visibility_spec (parser
);
22390 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
22393 cp_parser_decl_specifier_seq (parser
,
22394 CP_PARSER_FLAGS_OPTIONAL
,
22396 &decl_class_or_enum_p
);
22398 /* auto, register, static, extern, mutable. */
22399 if (declspecs
.storage_class
!= sc_none
)
22401 cp_parser_error (parser
, "invalid type for instance variable");
22402 declspecs
.storage_class
= sc_none
;
22406 if (declspecs
.specs
[(int) ds_thread
])
22408 cp_parser_error (parser
, "invalid type for instance variable");
22409 declspecs
.specs
[(int) ds_thread
] = 0;
22413 if (declspecs
.specs
[(int) ds_typedef
])
22415 cp_parser_error (parser
, "invalid type for instance variable");
22416 declspecs
.specs
[(int) ds_typedef
] = 0;
22419 prefix_attributes
= declspecs
.attributes
;
22420 declspecs
.attributes
= NULL_TREE
;
22422 /* Keep going until we hit the `;' at the end of the
22424 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
22426 tree width
= NULL_TREE
, attributes
, first_attribute
, decl
;
22427 cp_declarator
*declarator
= NULL
;
22428 int ctor_dtor_or_conv_p
;
22430 /* Check for a (possibly unnamed) bitfield declaration. */
22431 token
= cp_lexer_peek_token (parser
->lexer
);
22432 if (token
->type
== CPP_COLON
)
22435 if (token
->type
== CPP_NAME
22436 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
22439 /* Get the name of the bitfield. */
22440 declarator
= make_id_declarator (NULL_TREE
,
22441 cp_parser_identifier (parser
),
22445 cp_lexer_consume_token (parser
->lexer
); /* Eat ':'. */
22446 /* Get the width of the bitfield. */
22448 = cp_parser_constant_expression (parser
,
22449 /*allow_non_constant=*/false,
22454 /* Parse the declarator. */
22456 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
22457 &ctor_dtor_or_conv_p
,
22458 /*parenthesized_p=*/NULL
,
22459 /*member_p=*/false);
22462 /* Look for attributes that apply to the ivar. */
22463 attributes
= cp_parser_attributes_opt (parser
);
22464 /* Remember which attributes are prefix attributes and
22466 first_attribute
= attributes
;
22467 /* Combine the attributes. */
22468 attributes
= chainon (prefix_attributes
, attributes
);
22471 /* Create the bitfield declaration. */
22472 decl
= grokbitfield (declarator
, &declspecs
,
22476 decl
= grokfield (declarator
, &declspecs
,
22477 NULL_TREE
, /*init_const_expr_p=*/false,
22478 NULL_TREE
, attributes
);
22480 /* Add the instance variable. */
22481 objc_add_instance_variable (decl
);
22483 /* Reset PREFIX_ATTRIBUTES. */
22484 while (attributes
&& TREE_CHAIN (attributes
) != first_attribute
)
22485 attributes
= TREE_CHAIN (attributes
);
22487 TREE_CHAIN (attributes
) = NULL_TREE
;
22489 token
= cp_lexer_peek_token (parser
->lexer
);
22491 if (token
->type
== CPP_COMMA
)
22493 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
22499 cp_parser_consume_semicolon_at_end_of_statement (parser
);
22500 token
= cp_lexer_peek_token (parser
->lexer
);
22503 if (token
->keyword
== RID_AT_END
)
22504 cp_parser_error (parser
, "expected %<}%>");
22506 /* Do not consume the RID_AT_END, so it will be read again as terminating
22507 the @interface of @implementation. */
22508 if (token
->keyword
!= RID_AT_END
&& token
->type
!= CPP_EOF
)
22509 cp_lexer_consume_token (parser
->lexer
); /* Eat '}'. */
22511 /* For historical reasons, we accept an optional semicolon. */
22512 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
22513 cp_lexer_consume_token (parser
->lexer
);
22516 /* Parse an Objective-C protocol declaration. */
22519 cp_parser_objc_protocol_declaration (cp_parser
* parser
, tree attributes
)
22521 tree proto
, protorefs
;
22524 cp_lexer_consume_token (parser
->lexer
); /* Eat '@protocol'. */
22525 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
))
22527 tok
= cp_lexer_peek_token (parser
->lexer
);
22528 error_at (tok
->location
, "identifier expected after %<@protocol%>");
22532 /* See if we have a forward declaration or a definition. */
22533 tok
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
22535 /* Try a forward declaration first. */
22536 if (tok
->type
== CPP_COMMA
|| tok
->type
== CPP_SEMICOLON
)
22538 objc_declare_protocols (cp_parser_objc_identifier_list (parser
),
22541 cp_parser_consume_semicolon_at_end_of_statement (parser
);
22544 /* Ok, we got a full-fledged definition (or at least should). */
22547 proto
= cp_parser_identifier (parser
);
22548 protorefs
= cp_parser_objc_protocol_refs_opt (parser
);
22549 objc_start_protocol (proto
, protorefs
, attributes
);
22550 cp_parser_objc_method_prototype_list (parser
);
22554 /* Parse an Objective-C superclass or category. */
22557 cp_parser_objc_superclass_or_category (cp_parser
*parser
,
22560 tree
*categ
, bool *is_class_extension
)
22562 cp_token
*next
= cp_lexer_peek_token (parser
->lexer
);
22564 *super
= *categ
= NULL_TREE
;
22565 *is_class_extension
= false;
22566 if (next
->type
== CPP_COLON
)
22568 cp_lexer_consume_token (parser
->lexer
); /* Eat ':'. */
22569 *super
= cp_parser_identifier (parser
);
22571 else if (next
->type
== CPP_OPEN_PAREN
)
22573 cp_lexer_consume_token (parser
->lexer
); /* Eat '('. */
22575 /* If there is no category name, and this is an @interface, we
22576 have a class extension. */
22577 if (iface_p
&& cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
22579 *categ
= NULL_TREE
;
22580 *is_class_extension
= true;
22583 *categ
= cp_parser_identifier (parser
);
22585 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
22589 /* Parse an Objective-C class interface. */
22592 cp_parser_objc_class_interface (cp_parser
* parser
, tree attributes
)
22594 tree name
, super
, categ
, protos
;
22595 bool is_class_extension
;
22597 cp_lexer_consume_token (parser
->lexer
); /* Eat '@interface'. */
22598 name
= cp_parser_identifier (parser
);
22599 if (name
== error_mark_node
)
22601 /* It's hard to recover because even if valid @interface stuff
22602 is to follow, we can't compile it (or validate it) if we
22603 don't even know which class it refers to. Let's assume this
22604 was a stray '@interface' token in the stream and skip it.
22608 cp_parser_objc_superclass_or_category (parser
, true, &super
, &categ
,
22609 &is_class_extension
);
22610 protos
= cp_parser_objc_protocol_refs_opt (parser
);
22612 /* We have either a class or a category on our hands. */
22613 if (categ
|| is_class_extension
)
22614 objc_start_category_interface (name
, categ
, protos
, attributes
);
22617 objc_start_class_interface (name
, super
, protos
, attributes
);
22618 /* Handle instance variable declarations, if any. */
22619 cp_parser_objc_class_ivars (parser
);
22620 objc_continue_interface ();
22623 cp_parser_objc_method_prototype_list (parser
);
22626 /* Parse an Objective-C class implementation. */
22629 cp_parser_objc_class_implementation (cp_parser
* parser
)
22631 tree name
, super
, categ
;
22632 bool is_class_extension
;
22634 cp_lexer_consume_token (parser
->lexer
); /* Eat '@implementation'. */
22635 name
= cp_parser_identifier (parser
);
22636 if (name
== error_mark_node
)
22638 /* It's hard to recover because even if valid @implementation
22639 stuff is to follow, we can't compile it (or validate it) if
22640 we don't even know which class it refers to. Let's assume
22641 this was a stray '@implementation' token in the stream and
22646 cp_parser_objc_superclass_or_category (parser
, false, &super
, &categ
,
22647 &is_class_extension
);
22649 /* We have either a class or a category on our hands. */
22651 objc_start_category_implementation (name
, categ
);
22654 objc_start_class_implementation (name
, super
);
22655 /* Handle instance variable declarations, if any. */
22656 cp_parser_objc_class_ivars (parser
);
22657 objc_continue_implementation ();
22660 cp_parser_objc_method_definition_list (parser
);
22663 /* Consume the @end token and finish off the implementation. */
22666 cp_parser_objc_end_implementation (cp_parser
* parser
)
22668 cp_lexer_consume_token (parser
->lexer
); /* Eat '@end'. */
22669 objc_finish_implementation ();
22672 /* Parse an Objective-C declaration. */
22675 cp_parser_objc_declaration (cp_parser
* parser
, tree attributes
)
22677 /* Try to figure out what kind of declaration is present. */
22678 cp_token
*kwd
= cp_lexer_peek_token (parser
->lexer
);
22681 switch (kwd
->keyword
)
22686 error_at (kwd
->location
, "attributes may not be specified before"
22687 " the %<@%D%> Objective-C++ keyword",
22691 case RID_AT_IMPLEMENTATION
:
22692 warning_at (kwd
->location
, OPT_Wattributes
,
22693 "prefix attributes are ignored before %<@%D%>",
22700 switch (kwd
->keyword
)
22703 cp_parser_objc_alias_declaration (parser
);
22706 cp_parser_objc_class_declaration (parser
);
22708 case RID_AT_PROTOCOL
:
22709 cp_parser_objc_protocol_declaration (parser
, attributes
);
22711 case RID_AT_INTERFACE
:
22712 cp_parser_objc_class_interface (parser
, attributes
);
22714 case RID_AT_IMPLEMENTATION
:
22715 cp_parser_objc_class_implementation (parser
);
22718 cp_parser_objc_end_implementation (parser
);
22721 error_at (kwd
->location
, "misplaced %<@%D%> Objective-C++ construct",
22723 cp_parser_skip_to_end_of_block_or_statement (parser
);
22727 /* Parse an Objective-C try-catch-finally statement.
22729 objc-try-catch-finally-stmt:
22730 @try compound-statement objc-catch-clause-seq [opt]
22731 objc-finally-clause [opt]
22733 objc-catch-clause-seq:
22734 objc-catch-clause objc-catch-clause-seq [opt]
22737 @catch ( objc-exception-declaration ) compound-statement
22739 objc-finally-clause:
22740 @finally compound-statement
22742 objc-exception-declaration:
22743 parameter-declaration
22746 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
22750 PS: This function is identical to c_parser_objc_try_catch_finally_statement
22751 for C. Keep them in sync. */
22754 cp_parser_objc_try_catch_finally_statement (cp_parser
*parser
)
22756 location_t location
;
22759 cp_parser_require_keyword (parser
, RID_AT_TRY
, RT_AT_TRY
);
22760 location
= cp_lexer_peek_token (parser
->lexer
)->location
;
22761 objc_maybe_warn_exceptions (location
);
22762 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
22763 node, lest it get absorbed into the surrounding block. */
22764 stmt
= push_stmt_list ();
22765 cp_parser_compound_statement (parser
, NULL
, false);
22766 objc_begin_try_stmt (location
, pop_stmt_list (stmt
));
22768 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AT_CATCH
))
22770 cp_parameter_declarator
*parm
;
22771 tree parameter_declaration
= error_mark_node
;
22772 bool seen_open_paren
= false;
22774 cp_lexer_consume_token (parser
->lexer
);
22775 if (cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
22776 seen_open_paren
= true;
22777 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
22779 /* We have "@catch (...)" (where the '...' are literally
22780 what is in the code). Skip the '...'.
22781 parameter_declaration is set to NULL_TREE, and
22782 objc_being_catch_clauses() knows that that means
22784 cp_lexer_consume_token (parser
->lexer
);
22785 parameter_declaration
= NULL_TREE
;
22789 /* We have "@catch (NSException *exception)" or something
22790 like that. Parse the parameter declaration. */
22791 parm
= cp_parser_parameter_declaration (parser
, false, NULL
);
22793 parameter_declaration
= error_mark_node
;
22795 parameter_declaration
= grokdeclarator (parm
->declarator
,
22796 &parm
->decl_specifiers
,
22797 PARM
, /*initialized=*/0,
22798 /*attrlist=*/NULL
);
22800 if (seen_open_paren
)
22801 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
22804 /* If there was no open parenthesis, we are recovering from
22805 an error, and we are trying to figure out what mistake
22806 the user has made. */
22808 /* If there is an immediate closing parenthesis, the user
22809 probably forgot the opening one (ie, they typed "@catch
22810 NSException *e)". Parse the closing parenthesis and keep
22812 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
22813 cp_lexer_consume_token (parser
->lexer
);
22815 /* If these is no immediate closing parenthesis, the user
22816 probably doesn't know that parenthesis are required at
22817 all (ie, they typed "@catch NSException *e"). So, just
22818 forget about the closing parenthesis and keep going. */
22820 objc_begin_catch_clause (parameter_declaration
);
22821 cp_parser_compound_statement (parser
, NULL
, false);
22822 objc_finish_catch_clause ();
22824 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AT_FINALLY
))
22826 cp_lexer_consume_token (parser
->lexer
);
22827 location
= cp_lexer_peek_token (parser
->lexer
)->location
;
22828 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
22829 node, lest it get absorbed into the surrounding block. */
22830 stmt
= push_stmt_list ();
22831 cp_parser_compound_statement (parser
, NULL
, false);
22832 objc_build_finally_clause (location
, pop_stmt_list (stmt
));
22835 return objc_finish_try_stmt ();
22838 /* Parse an Objective-C synchronized statement.
22840 objc-synchronized-stmt:
22841 @synchronized ( expression ) compound-statement
22843 Returns NULL_TREE. */
22846 cp_parser_objc_synchronized_statement (cp_parser
*parser
)
22848 location_t location
;
22851 cp_parser_require_keyword (parser
, RID_AT_SYNCHRONIZED
, RT_AT_SYNCHRONIZED
);
22853 location
= cp_lexer_peek_token (parser
->lexer
)->location
;
22854 objc_maybe_warn_exceptions (location
);
22855 cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
);
22856 lock
= cp_parser_expression (parser
, false, NULL
);
22857 cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
);
22859 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
22860 node, lest it get absorbed into the surrounding block. */
22861 stmt
= push_stmt_list ();
22862 cp_parser_compound_statement (parser
, NULL
, false);
22864 return objc_build_synchronized (location
, lock
, pop_stmt_list (stmt
));
22867 /* Parse an Objective-C throw statement.
22870 @throw assignment-expression [opt] ;
22872 Returns a constructed '@throw' statement. */
22875 cp_parser_objc_throw_statement (cp_parser
*parser
)
22877 tree expr
= NULL_TREE
;
22878 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
22880 cp_parser_require_keyword (parser
, RID_AT_THROW
, RT_AT_THROW
);
22882 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
22883 expr
= cp_parser_expression (parser
, /*cast_p=*/false, NULL
);
22885 cp_parser_consume_semicolon_at_end_of_statement (parser
);
22887 return objc_build_throw_stmt (loc
, expr
);
22890 /* Parse an Objective-C statement. */
22893 cp_parser_objc_statement (cp_parser
* parser
)
22895 /* Try to figure out what kind of declaration is present. */
22896 cp_token
*kwd
= cp_lexer_peek_token (parser
->lexer
);
22898 switch (kwd
->keyword
)
22901 return cp_parser_objc_try_catch_finally_statement (parser
);
22902 case RID_AT_SYNCHRONIZED
:
22903 return cp_parser_objc_synchronized_statement (parser
);
22905 return cp_parser_objc_throw_statement (parser
);
22907 error_at (kwd
->location
, "misplaced %<@%D%> Objective-C++ construct",
22909 cp_parser_skip_to_end_of_block_or_statement (parser
);
22912 return error_mark_node
;
22915 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
22916 look ahead to see if an objc keyword follows the attributes. This
22917 is to detect the use of prefix attributes on ObjC @interface and
22921 cp_parser_objc_valid_prefix_attributes (cp_parser
* parser
, tree
*attrib
)
22923 cp_lexer_save_tokens (parser
->lexer
);
22924 *attrib
= cp_parser_attributes_opt (parser
);
22925 gcc_assert (*attrib
);
22926 if (OBJC_IS_AT_KEYWORD (cp_lexer_peek_token (parser
->lexer
)->keyword
))
22928 cp_lexer_commit_tokens (parser
->lexer
);
22931 cp_lexer_rollback_tokens (parser
->lexer
);
22935 /* This routine is a minimal replacement for
22936 c_parser_struct_declaration () used when parsing the list of
22937 types/names or ObjC++ properties. For example, when parsing the
22940 @property (readonly) int a, b, c;
22942 this function is responsible for parsing "int a, int b, int c" and
22943 returning the declarations as CHAIN of DECLs.
22945 TODO: Share this code with cp_parser_objc_class_ivars. It's very
22946 similar parsing. */
22948 cp_parser_objc_struct_declaration (cp_parser
*parser
)
22950 tree decls
= NULL_TREE
;
22951 cp_decl_specifier_seq declspecs
;
22952 int decl_class_or_enum_p
;
22953 tree prefix_attributes
;
22955 cp_parser_decl_specifier_seq (parser
,
22956 CP_PARSER_FLAGS_NONE
,
22958 &decl_class_or_enum_p
);
22960 if (declspecs
.type
== error_mark_node
)
22961 return error_mark_node
;
22963 /* auto, register, static, extern, mutable. */
22964 if (declspecs
.storage_class
!= sc_none
)
22966 cp_parser_error (parser
, "invalid type for property");
22967 declspecs
.storage_class
= sc_none
;
22971 if (declspecs
.specs
[(int) ds_thread
])
22973 cp_parser_error (parser
, "invalid type for property");
22974 declspecs
.specs
[(int) ds_thread
] = 0;
22978 if (declspecs
.specs
[(int) ds_typedef
])
22980 cp_parser_error (parser
, "invalid type for property");
22981 declspecs
.specs
[(int) ds_typedef
] = 0;
22984 prefix_attributes
= declspecs
.attributes
;
22985 declspecs
.attributes
= NULL_TREE
;
22987 /* Keep going until we hit the `;' at the end of the declaration. */
22988 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
22990 tree attributes
, first_attribute
, decl
;
22991 cp_declarator
*declarator
;
22994 /* Parse the declarator. */
22995 declarator
= cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
22996 NULL
, NULL
, false);
22998 /* Look for attributes that apply to the ivar. */
22999 attributes
= cp_parser_attributes_opt (parser
);
23000 /* Remember which attributes are prefix attributes and
23002 first_attribute
= attributes
;
23003 /* Combine the attributes. */
23004 attributes
= chainon (prefix_attributes
, attributes
);
23006 decl
= grokfield (declarator
, &declspecs
,
23007 NULL_TREE
, /*init_const_expr_p=*/false,
23008 NULL_TREE
, attributes
);
23010 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
23011 return error_mark_node
;
23013 /* Reset PREFIX_ATTRIBUTES. */
23014 while (attributes
&& TREE_CHAIN (attributes
) != first_attribute
)
23015 attributes
= TREE_CHAIN (attributes
);
23017 TREE_CHAIN (attributes
) = NULL_TREE
;
23019 DECL_CHAIN (decl
) = decls
;
23022 token
= cp_lexer_peek_token (parser
->lexer
);
23023 if (token
->type
== CPP_COMMA
)
23025 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
23034 /* Parse an Objective-C @property declaration. The syntax is:
23036 objc-property-declaration:
23037 '@property' objc-property-attributes[opt] struct-declaration ;
23039 objc-property-attributes:
23040 '(' objc-property-attribute-list ')'
23042 objc-property-attribute-list:
23043 objc-property-attribute
23044 objc-property-attribute-list, objc-property-attribute
23046 objc-property-attribute
23047 'getter' = identifier
23048 'setter' = identifier
23057 @property NSString *name;
23058 @property (readonly) id object;
23059 @property (retain, nonatomic, getter=getTheName) id name;
23060 @property int a, b, c;
23062 PS: This function is identical to
23063 c_parser_objc_at_property_declaration for C. Keep them in sync. */
23065 cp_parser_objc_at_property_declaration (cp_parser
*parser
)
23067 /* The following variables hold the attributes of the properties as
23068 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
23069 seen. When we see an attribute, we set them to 'true' (if they
23070 are boolean properties) or to the identifier (if they have an
23071 argument, ie, for getter and setter). Note that here we only
23072 parse the list of attributes, check the syntax and accumulate the
23073 attributes that we find. objc_add_property_declaration() will
23074 then process the information. */
23075 bool property_assign
= false;
23076 bool property_copy
= false;
23077 tree property_getter_ident
= NULL_TREE
;
23078 bool property_nonatomic
= false;
23079 bool property_readonly
= false;
23080 bool property_readwrite
= false;
23081 bool property_retain
= false;
23082 tree property_setter_ident
= NULL_TREE
;
23084 /* 'properties' is the list of properties that we read. Usually a
23085 single one, but maybe more (eg, in "@property int a, b, c;" there
23090 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
23092 cp_lexer_consume_token (parser
->lexer
); /* Eat '@property'. */
23094 /* Parse the optional attribute list... */
23095 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
23098 cp_lexer_consume_token (parser
->lexer
);
23102 bool syntax_error
= false;
23103 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
23106 if (token
->type
!= CPP_NAME
)
23108 cp_parser_error (parser
, "expected identifier");
23111 keyword
= C_RID_CODE (token
->u
.value
);
23112 cp_lexer_consume_token (parser
->lexer
);
23115 case RID_ASSIGN
: property_assign
= true; break;
23116 case RID_COPY
: property_copy
= true; break;
23117 case RID_NONATOMIC
: property_nonatomic
= true; break;
23118 case RID_READONLY
: property_readonly
= true; break;
23119 case RID_READWRITE
: property_readwrite
= true; break;
23120 case RID_RETAIN
: property_retain
= true; break;
23124 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
))
23126 if (keyword
== RID_GETTER
)
23127 cp_parser_error (parser
,
23128 "missing %<=%> (after %<getter%> attribute)");
23130 cp_parser_error (parser
,
23131 "missing %<=%> (after %<setter%> attribute)");
23132 syntax_error
= true;
23135 cp_lexer_consume_token (parser
->lexer
); /* eat the = */
23136 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
))
23138 cp_parser_error (parser
, "expected identifier");
23139 syntax_error
= true;
23142 if (keyword
== RID_SETTER
)
23144 if (property_setter_ident
!= NULL_TREE
)
23145 cp_parser_error (parser
, "the %<setter%> attribute may only be specified once");
23147 property_setter_ident
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
23148 cp_lexer_consume_token (parser
->lexer
);
23149 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
23150 cp_parser_error (parser
, "setter name must terminate with %<:%>");
23152 cp_lexer_consume_token (parser
->lexer
);
23156 if (property_getter_ident
!= NULL_TREE
)
23157 cp_parser_error (parser
, "the %<getter%> attribute may only be specified once");
23159 property_getter_ident
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
23160 cp_lexer_consume_token (parser
->lexer
);
23164 cp_parser_error (parser
, "unknown property attribute");
23165 syntax_error
= true;
23172 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
23173 cp_lexer_consume_token (parser
->lexer
);
23178 /* FIXME: "@property (setter, assign);" will generate a spurious
23179 "error: expected ‘)’ before ‘,’ token". This is because
23180 cp_parser_require, unlike the C counterpart, will produce an
23181 error even if we are in error recovery. */
23182 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
23184 cp_parser_skip_to_closing_parenthesis (parser
,
23185 /*recovering=*/true,
23186 /*or_comma=*/false,
23187 /*consume_paren=*/true);
23191 /* ... and the property declaration(s). */
23192 properties
= cp_parser_objc_struct_declaration (parser
);
23194 if (properties
== error_mark_node
)
23196 cp_parser_skip_to_end_of_statement (parser
);
23197 /* If the next token is now a `;', consume it. */
23198 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
23199 cp_lexer_consume_token (parser
->lexer
);
23203 if (properties
== NULL_TREE
)
23204 cp_parser_error (parser
, "expected identifier");
23207 /* Comma-separated properties are chained together in
23208 reverse order; add them one by one. */
23209 properties
= nreverse (properties
);
23211 for (; properties
; properties
= TREE_CHAIN (properties
))
23212 objc_add_property_declaration (loc
, copy_node (properties
),
23213 property_readonly
, property_readwrite
,
23214 property_assign
, property_retain
,
23215 property_copy
, property_nonatomic
,
23216 property_getter_ident
, property_setter_ident
);
23219 cp_parser_consume_semicolon_at_end_of_statement (parser
);
23222 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
23224 objc-synthesize-declaration:
23225 @synthesize objc-synthesize-identifier-list ;
23227 objc-synthesize-identifier-list:
23228 objc-synthesize-identifier
23229 objc-synthesize-identifier-list, objc-synthesize-identifier
23231 objc-synthesize-identifier
23233 identifier = identifier
23236 @synthesize MyProperty;
23237 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
23239 PS: This function is identical to c_parser_objc_at_synthesize_declaration
23240 for C. Keep them in sync.
23243 cp_parser_objc_at_synthesize_declaration (cp_parser
*parser
)
23245 tree list
= NULL_TREE
;
23247 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
23249 cp_lexer_consume_token (parser
->lexer
); /* Eat '@synthesize'. */
23252 tree property
, ivar
;
23253 property
= cp_parser_identifier (parser
);
23254 if (property
== error_mark_node
)
23256 cp_parser_consume_semicolon_at_end_of_statement (parser
);
23259 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
23261 cp_lexer_consume_token (parser
->lexer
);
23262 ivar
= cp_parser_identifier (parser
);
23263 if (ivar
== error_mark_node
)
23265 cp_parser_consume_semicolon_at_end_of_statement (parser
);
23271 list
= chainon (list
, build_tree_list (ivar
, property
));
23272 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
23273 cp_lexer_consume_token (parser
->lexer
);
23277 cp_parser_consume_semicolon_at_end_of_statement (parser
);
23278 objc_add_synthesize_declaration (loc
, list
);
23281 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
23283 objc-dynamic-declaration:
23284 @dynamic identifier-list ;
23287 @dynamic MyProperty;
23288 @dynamic MyProperty, AnotherProperty;
23290 PS: This function is identical to c_parser_objc_at_dynamic_declaration
23291 for C. Keep them in sync.
23294 cp_parser_objc_at_dynamic_declaration (cp_parser
*parser
)
23296 tree list
= NULL_TREE
;
23298 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
23300 cp_lexer_consume_token (parser
->lexer
); /* Eat '@dynamic'. */
23304 property
= cp_parser_identifier (parser
);
23305 if (property
== error_mark_node
)
23307 cp_parser_consume_semicolon_at_end_of_statement (parser
);
23310 list
= chainon (list
, build_tree_list (NULL
, property
));
23311 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
23312 cp_lexer_consume_token (parser
->lexer
);
23316 cp_parser_consume_semicolon_at_end_of_statement (parser
);
23317 objc_add_dynamic_declaration (loc
, list
);
23321 /* OpenMP 2.5 parsing routines. */
23323 /* Returns name of the next clause.
23324 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
23325 the token is not consumed. Otherwise appropriate pragma_omp_clause is
23326 returned and the token is consumed. */
23328 static pragma_omp_clause
23329 cp_parser_omp_clause_name (cp_parser
*parser
)
23331 pragma_omp_clause result
= PRAGMA_OMP_CLAUSE_NONE
;
23333 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_IF
))
23334 result
= PRAGMA_OMP_CLAUSE_IF
;
23335 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_DEFAULT
))
23336 result
= PRAGMA_OMP_CLAUSE_DEFAULT
;
23337 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_PRIVATE
))
23338 result
= PRAGMA_OMP_CLAUSE_PRIVATE
;
23339 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
23341 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
23342 const char *p
= IDENTIFIER_POINTER (id
);
23347 if (!strcmp ("collapse", p
))
23348 result
= PRAGMA_OMP_CLAUSE_COLLAPSE
;
23349 else if (!strcmp ("copyin", p
))
23350 result
= PRAGMA_OMP_CLAUSE_COPYIN
;
23351 else if (!strcmp ("copyprivate", p
))
23352 result
= PRAGMA_OMP_CLAUSE_COPYPRIVATE
;
23355 if (!strcmp ("firstprivate", p
))
23356 result
= PRAGMA_OMP_CLAUSE_FIRSTPRIVATE
;
23359 if (!strcmp ("lastprivate", p
))
23360 result
= PRAGMA_OMP_CLAUSE_LASTPRIVATE
;
23363 if (!strcmp ("nowait", p
))
23364 result
= PRAGMA_OMP_CLAUSE_NOWAIT
;
23365 else if (!strcmp ("num_threads", p
))
23366 result
= PRAGMA_OMP_CLAUSE_NUM_THREADS
;
23369 if (!strcmp ("ordered", p
))
23370 result
= PRAGMA_OMP_CLAUSE_ORDERED
;
23373 if (!strcmp ("reduction", p
))
23374 result
= PRAGMA_OMP_CLAUSE_REDUCTION
;
23377 if (!strcmp ("schedule", p
))
23378 result
= PRAGMA_OMP_CLAUSE_SCHEDULE
;
23379 else if (!strcmp ("shared", p
))
23380 result
= PRAGMA_OMP_CLAUSE_SHARED
;
23383 if (!strcmp ("untied", p
))
23384 result
= PRAGMA_OMP_CLAUSE_UNTIED
;
23389 if (result
!= PRAGMA_OMP_CLAUSE_NONE
)
23390 cp_lexer_consume_token (parser
->lexer
);
23395 /* Validate that a clause of the given type does not already exist. */
23398 check_no_duplicate_clause (tree clauses
, enum omp_clause_code code
,
23399 const char *name
, location_t location
)
23403 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
23404 if (OMP_CLAUSE_CODE (c
) == code
)
23406 error_at (location
, "too many %qs clauses", name
);
23414 variable-list , identifier
23416 In addition, we match a closing parenthesis. An opening parenthesis
23417 will have been consumed by the caller.
23419 If KIND is nonzero, create the appropriate node and install the decl
23420 in OMP_CLAUSE_DECL and add the node to the head of the list.
23422 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
23423 return the list created. */
23426 cp_parser_omp_var_list_no_open (cp_parser
*parser
, enum omp_clause_code kind
,
23434 token
= cp_lexer_peek_token (parser
->lexer
);
23435 name
= cp_parser_id_expression (parser
, /*template_p=*/false,
23436 /*check_dependency_p=*/true,
23437 /*template_p=*/NULL
,
23438 /*declarator_p=*/false,
23439 /*optional_p=*/false);
23440 if (name
== error_mark_node
)
23443 decl
= cp_parser_lookup_name_simple (parser
, name
, token
->location
);
23444 if (decl
== error_mark_node
)
23445 cp_parser_name_lookup_error (parser
, name
, decl
, NLE_NULL
,
23447 else if (kind
!= 0)
23449 tree u
= build_omp_clause (token
->location
, kind
);
23450 OMP_CLAUSE_DECL (u
) = decl
;
23451 OMP_CLAUSE_CHAIN (u
) = list
;
23455 list
= tree_cons (decl
, NULL_TREE
, list
);
23458 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
23460 cp_lexer_consume_token (parser
->lexer
);
23463 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
23467 /* Try to resync to an unnested comma. Copied from
23468 cp_parser_parenthesized_expression_list. */
23470 ending
= cp_parser_skip_to_closing_parenthesis (parser
,
23471 /*recovering=*/true,
23473 /*consume_paren=*/true);
23481 /* Similarly, but expect leading and trailing parenthesis. This is a very
23482 common case for omp clauses. */
23485 cp_parser_omp_var_list (cp_parser
*parser
, enum omp_clause_code kind
, tree list
)
23487 if (cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
23488 return cp_parser_omp_var_list_no_open (parser
, kind
, list
);
23493 collapse ( constant-expression ) */
23496 cp_parser_omp_clause_collapse (cp_parser
*parser
, tree list
, location_t location
)
23502 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
23503 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
23506 num
= cp_parser_constant_expression (parser
, false, NULL
);
23508 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
23509 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
23510 /*or_comma=*/false,
23511 /*consume_paren=*/true);
23513 if (num
== error_mark_node
)
23515 num
= fold_non_dependent_expr (num
);
23516 if (!INTEGRAL_TYPE_P (TREE_TYPE (num
))
23517 || !host_integerp (num
, 0)
23518 || (n
= tree_low_cst (num
, 0)) <= 0
23521 error_at (loc
, "collapse argument needs positive constant integer expression");
23525 check_no_duplicate_clause (list
, OMP_CLAUSE_COLLAPSE
, "collapse", location
);
23526 c
= build_omp_clause (loc
, OMP_CLAUSE_COLLAPSE
);
23527 OMP_CLAUSE_CHAIN (c
) = list
;
23528 OMP_CLAUSE_COLLAPSE_EXPR (c
) = num
;
23534 default ( shared | none ) */
23537 cp_parser_omp_clause_default (cp_parser
*parser
, tree list
, location_t location
)
23539 enum omp_clause_default_kind kind
= OMP_CLAUSE_DEFAULT_UNSPECIFIED
;
23542 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
23544 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
23546 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
23547 const char *p
= IDENTIFIER_POINTER (id
);
23552 if (strcmp ("none", p
) != 0)
23554 kind
= OMP_CLAUSE_DEFAULT_NONE
;
23558 if (strcmp ("shared", p
) != 0)
23560 kind
= OMP_CLAUSE_DEFAULT_SHARED
;
23567 cp_lexer_consume_token (parser
->lexer
);
23572 cp_parser_error (parser
, "expected %<none%> or %<shared%>");
23575 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
23576 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
23577 /*or_comma=*/false,
23578 /*consume_paren=*/true);
23580 if (kind
== OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
23583 check_no_duplicate_clause (list
, OMP_CLAUSE_DEFAULT
, "default", location
);
23584 c
= build_omp_clause (location
, OMP_CLAUSE_DEFAULT
);
23585 OMP_CLAUSE_CHAIN (c
) = list
;
23586 OMP_CLAUSE_DEFAULT_KIND (c
) = kind
;
23592 if ( expression ) */
23595 cp_parser_omp_clause_if (cp_parser
*parser
, tree list
, location_t location
)
23599 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
23602 t
= cp_parser_condition (parser
);
23604 if (t
== error_mark_node
23605 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
23606 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
23607 /*or_comma=*/false,
23608 /*consume_paren=*/true);
23610 check_no_duplicate_clause (list
, OMP_CLAUSE_IF
, "if", location
);
23612 c
= build_omp_clause (location
, OMP_CLAUSE_IF
);
23613 OMP_CLAUSE_IF_EXPR (c
) = t
;
23614 OMP_CLAUSE_CHAIN (c
) = list
;
23623 cp_parser_omp_clause_nowait (cp_parser
*parser ATTRIBUTE_UNUSED
,
23624 tree list
, location_t location
)
23628 check_no_duplicate_clause (list
, OMP_CLAUSE_NOWAIT
, "nowait", location
);
23630 c
= build_omp_clause (location
, OMP_CLAUSE_NOWAIT
);
23631 OMP_CLAUSE_CHAIN (c
) = list
;
23636 num_threads ( expression ) */
23639 cp_parser_omp_clause_num_threads (cp_parser
*parser
, tree list
,
23640 location_t location
)
23644 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
23647 t
= cp_parser_expression (parser
, false, NULL
);
23649 if (t
== error_mark_node
23650 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
23651 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
23652 /*or_comma=*/false,
23653 /*consume_paren=*/true);
23655 check_no_duplicate_clause (list
, OMP_CLAUSE_NUM_THREADS
,
23656 "num_threads", location
);
23658 c
= build_omp_clause (location
, OMP_CLAUSE_NUM_THREADS
);
23659 OMP_CLAUSE_NUM_THREADS_EXPR (c
) = t
;
23660 OMP_CLAUSE_CHAIN (c
) = list
;
23669 cp_parser_omp_clause_ordered (cp_parser
*parser ATTRIBUTE_UNUSED
,
23670 tree list
, location_t location
)
23674 check_no_duplicate_clause (list
, OMP_CLAUSE_ORDERED
,
23675 "ordered", location
);
23677 c
= build_omp_clause (location
, OMP_CLAUSE_ORDERED
);
23678 OMP_CLAUSE_CHAIN (c
) = list
;
23683 reduction ( reduction-operator : variable-list )
23685 reduction-operator:
23686 One of: + * - & ^ | && || */
23689 cp_parser_omp_clause_reduction (cp_parser
*parser
, tree list
)
23691 enum tree_code code
;
23694 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
23697 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
23709 code
= BIT_AND_EXPR
;
23712 code
= BIT_XOR_EXPR
;
23715 code
= BIT_IOR_EXPR
;
23718 code
= TRUTH_ANDIF_EXPR
;
23721 code
= TRUTH_ORIF_EXPR
;
23724 cp_parser_error (parser
, "expected %<+%>, %<*%>, %<-%>, %<&%>, %<^%>, "
23725 "%<|%>, %<&&%>, or %<||%>");
23727 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
23728 /*or_comma=*/false,
23729 /*consume_paren=*/true);
23732 cp_lexer_consume_token (parser
->lexer
);
23734 if (!cp_parser_require (parser
, CPP_COLON
, RT_COLON
))
23737 nlist
= cp_parser_omp_var_list_no_open (parser
, OMP_CLAUSE_REDUCTION
, list
);
23738 for (c
= nlist
; c
!= list
; c
= OMP_CLAUSE_CHAIN (c
))
23739 OMP_CLAUSE_REDUCTION_CODE (c
) = code
;
23745 schedule ( schedule-kind )
23746 schedule ( schedule-kind , expression )
23749 static | dynamic | guided | runtime | auto */
23752 cp_parser_omp_clause_schedule (cp_parser
*parser
, tree list
, location_t location
)
23756 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
23759 c
= build_omp_clause (location
, OMP_CLAUSE_SCHEDULE
);
23761 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
23763 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
23764 const char *p
= IDENTIFIER_POINTER (id
);
23769 if (strcmp ("dynamic", p
) != 0)
23771 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_DYNAMIC
;
23775 if (strcmp ("guided", p
) != 0)
23777 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_GUIDED
;
23781 if (strcmp ("runtime", p
) != 0)
23783 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_RUNTIME
;
23790 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STATIC
))
23791 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_STATIC
;
23792 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AUTO
))
23793 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_AUTO
;
23796 cp_lexer_consume_token (parser
->lexer
);
23798 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
23801 cp_lexer_consume_token (parser
->lexer
);
23803 token
= cp_lexer_peek_token (parser
->lexer
);
23804 t
= cp_parser_assignment_expression (parser
, false, NULL
);
23806 if (t
== error_mark_node
)
23808 else if (OMP_CLAUSE_SCHEDULE_KIND (c
) == OMP_CLAUSE_SCHEDULE_RUNTIME
)
23809 error_at (token
->location
, "schedule %<runtime%> does not take "
23810 "a %<chunk_size%> parameter");
23811 else if (OMP_CLAUSE_SCHEDULE_KIND (c
) == OMP_CLAUSE_SCHEDULE_AUTO
)
23812 error_at (token
->location
, "schedule %<auto%> does not take "
23813 "a %<chunk_size%> parameter");
23815 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
23817 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
23820 else if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_COMMA_CLOSE_PAREN
))
23823 check_no_duplicate_clause (list
, OMP_CLAUSE_SCHEDULE
, "schedule", location
);
23824 OMP_CLAUSE_CHAIN (c
) = list
;
23828 cp_parser_error (parser
, "invalid schedule kind");
23830 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
23831 /*or_comma=*/false,
23832 /*consume_paren=*/true);
23840 cp_parser_omp_clause_untied (cp_parser
*parser ATTRIBUTE_UNUSED
,
23841 tree list
, location_t location
)
23845 check_no_duplicate_clause (list
, OMP_CLAUSE_UNTIED
, "untied", location
);
23847 c
= build_omp_clause (location
, OMP_CLAUSE_UNTIED
);
23848 OMP_CLAUSE_CHAIN (c
) = list
;
23852 /* Parse all OpenMP clauses. The set clauses allowed by the directive
23853 is a bitmask in MASK. Return the list of clauses found; the result
23854 of clause default goes in *pdefault. */
23857 cp_parser_omp_all_clauses (cp_parser
*parser
, unsigned int mask
,
23858 const char *where
, cp_token
*pragma_tok
)
23860 tree clauses
= NULL
;
23862 cp_token
*token
= NULL
;
23864 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
))
23866 pragma_omp_clause c_kind
;
23867 const char *c_name
;
23868 tree prev
= clauses
;
23870 if (!first
&& cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
23871 cp_lexer_consume_token (parser
->lexer
);
23873 token
= cp_lexer_peek_token (parser
->lexer
);
23874 c_kind
= cp_parser_omp_clause_name (parser
);
23879 case PRAGMA_OMP_CLAUSE_COLLAPSE
:
23880 clauses
= cp_parser_omp_clause_collapse (parser
, clauses
,
23882 c_name
= "collapse";
23884 case PRAGMA_OMP_CLAUSE_COPYIN
:
23885 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_COPYIN
, clauses
);
23888 case PRAGMA_OMP_CLAUSE_COPYPRIVATE
:
23889 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_COPYPRIVATE
,
23891 c_name
= "copyprivate";
23893 case PRAGMA_OMP_CLAUSE_DEFAULT
:
23894 clauses
= cp_parser_omp_clause_default (parser
, clauses
,
23896 c_name
= "default";
23898 case PRAGMA_OMP_CLAUSE_FIRSTPRIVATE
:
23899 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_FIRSTPRIVATE
,
23901 c_name
= "firstprivate";
23903 case PRAGMA_OMP_CLAUSE_IF
:
23904 clauses
= cp_parser_omp_clause_if (parser
, clauses
, token
->location
);
23907 case PRAGMA_OMP_CLAUSE_LASTPRIVATE
:
23908 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_LASTPRIVATE
,
23910 c_name
= "lastprivate";
23912 case PRAGMA_OMP_CLAUSE_NOWAIT
:
23913 clauses
= cp_parser_omp_clause_nowait (parser
, clauses
, token
->location
);
23916 case PRAGMA_OMP_CLAUSE_NUM_THREADS
:
23917 clauses
= cp_parser_omp_clause_num_threads (parser
, clauses
,
23919 c_name
= "num_threads";
23921 case PRAGMA_OMP_CLAUSE_ORDERED
:
23922 clauses
= cp_parser_omp_clause_ordered (parser
, clauses
,
23924 c_name
= "ordered";
23926 case PRAGMA_OMP_CLAUSE_PRIVATE
:
23927 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_PRIVATE
,
23929 c_name
= "private";
23931 case PRAGMA_OMP_CLAUSE_REDUCTION
:
23932 clauses
= cp_parser_omp_clause_reduction (parser
, clauses
);
23933 c_name
= "reduction";
23935 case PRAGMA_OMP_CLAUSE_SCHEDULE
:
23936 clauses
= cp_parser_omp_clause_schedule (parser
, clauses
,
23938 c_name
= "schedule";
23940 case PRAGMA_OMP_CLAUSE_SHARED
:
23941 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_SHARED
,
23945 case PRAGMA_OMP_CLAUSE_UNTIED
:
23946 clauses
= cp_parser_omp_clause_untied (parser
, clauses
,
23951 cp_parser_error (parser
, "expected %<#pragma omp%> clause");
23955 if (((mask
>> c_kind
) & 1) == 0)
23957 /* Remove the invalid clause(s) from the list to avoid
23958 confusing the rest of the compiler. */
23960 error_at (token
->location
, "%qs is not valid for %qs", c_name
, where
);
23964 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
23965 return finish_omp_clauses (clauses
);
23972 In practice, we're also interested in adding the statement to an
23973 outer node. So it is convenient if we work around the fact that
23974 cp_parser_statement calls add_stmt. */
23977 cp_parser_begin_omp_structured_block (cp_parser
*parser
)
23979 unsigned save
= parser
->in_statement
;
23981 /* Only move the values to IN_OMP_BLOCK if they weren't false.
23982 This preserves the "not within loop or switch" style error messages
23983 for nonsense cases like
23989 if (parser
->in_statement
)
23990 parser
->in_statement
= IN_OMP_BLOCK
;
23996 cp_parser_end_omp_structured_block (cp_parser
*parser
, unsigned save
)
23998 parser
->in_statement
= save
;
24002 cp_parser_omp_structured_block (cp_parser
*parser
)
24004 tree stmt
= begin_omp_structured_block ();
24005 unsigned int save
= cp_parser_begin_omp_structured_block (parser
);
24007 cp_parser_statement (parser
, NULL_TREE
, false, NULL
);
24009 cp_parser_end_omp_structured_block (parser
, save
);
24010 return finish_omp_structured_block (stmt
);
24014 # pragma omp atomic new-line
24018 x binop= expr | x++ | ++x | x-- | --x
24020 +, *, -, /, &, ^, |, <<, >>
24022 where x is an lvalue expression with scalar type. */
24025 cp_parser_omp_atomic (cp_parser
*parser
, cp_token
*pragma_tok
)
24028 enum tree_code code
;
24030 cp_parser_require_pragma_eol (parser
, pragma_tok
);
24032 lhs
= cp_parser_unary_expression (parser
, /*address_p=*/false,
24033 /*cast_p=*/false, NULL
);
24034 switch (TREE_CODE (lhs
))
24039 case PREINCREMENT_EXPR
:
24040 case POSTINCREMENT_EXPR
:
24041 lhs
= TREE_OPERAND (lhs
, 0);
24043 rhs
= integer_one_node
;
24046 case PREDECREMENT_EXPR
:
24047 case POSTDECREMENT_EXPR
:
24048 lhs
= TREE_OPERAND (lhs
, 0);
24050 rhs
= integer_one_node
;
24053 case COMPOUND_EXPR
:
24054 if (TREE_CODE (TREE_OPERAND (lhs
, 0)) == SAVE_EXPR
24055 && TREE_CODE (TREE_OPERAND (lhs
, 1)) == COMPOUND_EXPR
24056 && TREE_CODE (TREE_OPERAND (TREE_OPERAND (lhs
, 1), 0)) == MODIFY_EXPR
24057 && TREE_OPERAND (TREE_OPERAND (lhs
, 1), 1) == TREE_OPERAND (lhs
, 0)
24058 && TREE_CODE (TREE_TYPE (TREE_OPERAND (TREE_OPERAND
24059 (TREE_OPERAND (lhs
, 1), 0), 0)))
24061 /* Undo effects of boolean_increment for post {in,de}crement. */
24062 lhs
= TREE_OPERAND (TREE_OPERAND (lhs
, 1), 0);
24065 if (TREE_CODE (lhs
) == MODIFY_EXPR
24066 && TREE_CODE (TREE_TYPE (TREE_OPERAND (lhs
, 0))) == BOOLEAN_TYPE
)
24068 /* Undo effects of boolean_increment. */
24069 if (integer_onep (TREE_OPERAND (lhs
, 1)))
24071 /* This is pre or post increment. */
24072 rhs
= TREE_OPERAND (lhs
, 1);
24073 lhs
= TREE_OPERAND (lhs
, 0);
24080 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
24086 code
= TRUNC_DIV_EXPR
;
24094 case CPP_LSHIFT_EQ
:
24095 code
= LSHIFT_EXPR
;
24097 case CPP_RSHIFT_EQ
:
24098 code
= RSHIFT_EXPR
;
24101 code
= BIT_AND_EXPR
;
24104 code
= BIT_IOR_EXPR
;
24107 code
= BIT_XOR_EXPR
;
24110 cp_parser_error (parser
,
24111 "invalid operator for %<#pragma omp atomic%>");
24114 cp_lexer_consume_token (parser
->lexer
);
24116 rhs
= cp_parser_expression (parser
, false, NULL
);
24117 if (rhs
== error_mark_node
)
24121 finish_omp_atomic (code
, lhs
, rhs
);
24122 cp_parser_consume_semicolon_at_end_of_statement (parser
);
24126 cp_parser_skip_to_end_of_block_or_statement (parser
);
24131 # pragma omp barrier new-line */
24134 cp_parser_omp_barrier (cp_parser
*parser
, cp_token
*pragma_tok
)
24136 cp_parser_require_pragma_eol (parser
, pragma_tok
);
24137 finish_omp_barrier ();
24141 # pragma omp critical [(name)] new-line
24142 structured-block */
24145 cp_parser_omp_critical (cp_parser
*parser
, cp_token
*pragma_tok
)
24147 tree stmt
, name
= NULL
;
24149 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
24151 cp_lexer_consume_token (parser
->lexer
);
24153 name
= cp_parser_identifier (parser
);
24155 if (name
== error_mark_node
24156 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
24157 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
24158 /*or_comma=*/false,
24159 /*consume_paren=*/true);
24160 if (name
== error_mark_node
)
24163 cp_parser_require_pragma_eol (parser
, pragma_tok
);
24165 stmt
= cp_parser_omp_structured_block (parser
);
24166 return c_finish_omp_critical (input_location
, stmt
, name
);
24170 # pragma omp flush flush-vars[opt] new-line
24173 ( variable-list ) */
24176 cp_parser_omp_flush (cp_parser
*parser
, cp_token
*pragma_tok
)
24178 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
24179 (void) cp_parser_omp_var_list (parser
, OMP_CLAUSE_ERROR
, NULL
);
24180 cp_parser_require_pragma_eol (parser
, pragma_tok
);
24182 finish_omp_flush ();
24185 /* Helper function, to parse omp for increment expression. */
24188 cp_parser_omp_for_cond (cp_parser
*parser
, tree decl
)
24190 tree cond
= cp_parser_binary_expression (parser
, false, true,
24191 PREC_NOT_OPERATOR
, NULL
);
24194 if (cond
== error_mark_node
24195 || cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
24197 cp_parser_skip_to_end_of_statement (parser
);
24198 return error_mark_node
;
24201 switch (TREE_CODE (cond
))
24209 return error_mark_node
;
24212 /* If decl is an iterator, preserve LHS and RHS of the relational
24213 expr until finish_omp_for. */
24215 && (type_dependent_expression_p (decl
)
24216 || CLASS_TYPE_P (TREE_TYPE (decl
))))
24219 return build_x_binary_op (TREE_CODE (cond
),
24220 TREE_OPERAND (cond
, 0), ERROR_MARK
,
24221 TREE_OPERAND (cond
, 1), ERROR_MARK
,
24222 &overloaded_p
, tf_warning_or_error
);
24225 /* Helper function, to parse omp for increment expression. */
24228 cp_parser_omp_for_incr (cp_parser
*parser
, tree decl
)
24230 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
24236 if (token
->type
== CPP_PLUS_PLUS
|| token
->type
== CPP_MINUS_MINUS
)
24238 op
= (token
->type
== CPP_PLUS_PLUS
24239 ? PREINCREMENT_EXPR
: PREDECREMENT_EXPR
);
24240 cp_lexer_consume_token (parser
->lexer
);
24241 lhs
= cp_parser_cast_expression (parser
, false, false, NULL
);
24243 return error_mark_node
;
24244 return build2 (op
, TREE_TYPE (decl
), decl
, NULL_TREE
);
24247 lhs
= cp_parser_primary_expression (parser
, false, false, false, &idk
);
24249 return error_mark_node
;
24251 token
= cp_lexer_peek_token (parser
->lexer
);
24252 if (token
->type
== CPP_PLUS_PLUS
|| token
->type
== CPP_MINUS_MINUS
)
24254 op
= (token
->type
== CPP_PLUS_PLUS
24255 ? POSTINCREMENT_EXPR
: POSTDECREMENT_EXPR
);
24256 cp_lexer_consume_token (parser
->lexer
);
24257 return build2 (op
, TREE_TYPE (decl
), decl
, NULL_TREE
);
24260 op
= cp_parser_assignment_operator_opt (parser
);
24261 if (op
== ERROR_MARK
)
24262 return error_mark_node
;
24264 if (op
!= NOP_EXPR
)
24266 rhs
= cp_parser_assignment_expression (parser
, false, NULL
);
24267 rhs
= build2 (op
, TREE_TYPE (decl
), decl
, rhs
);
24268 return build2 (MODIFY_EXPR
, TREE_TYPE (decl
), decl
, rhs
);
24271 lhs
= cp_parser_binary_expression (parser
, false, false,
24272 PREC_ADDITIVE_EXPRESSION
, NULL
);
24273 token
= cp_lexer_peek_token (parser
->lexer
);
24274 decl_first
= lhs
== decl
;
24277 if (token
->type
!= CPP_PLUS
24278 && token
->type
!= CPP_MINUS
)
24279 return error_mark_node
;
24283 op
= token
->type
== CPP_PLUS
? PLUS_EXPR
: MINUS_EXPR
;
24284 cp_lexer_consume_token (parser
->lexer
);
24285 rhs
= cp_parser_binary_expression (parser
, false, false,
24286 PREC_ADDITIVE_EXPRESSION
, NULL
);
24287 token
= cp_lexer_peek_token (parser
->lexer
);
24288 if (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
|| decl_first
)
24290 if (lhs
== NULL_TREE
)
24292 if (op
== PLUS_EXPR
)
24295 lhs
= build_x_unary_op (NEGATE_EXPR
, rhs
, tf_warning_or_error
);
24298 lhs
= build_x_binary_op (op
, lhs
, ERROR_MARK
, rhs
, ERROR_MARK
,
24299 NULL
, tf_warning_or_error
);
24302 while (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
);
24306 if (rhs
!= decl
|| op
== MINUS_EXPR
)
24307 return error_mark_node
;
24308 rhs
= build2 (op
, TREE_TYPE (decl
), lhs
, decl
);
24311 rhs
= build2 (PLUS_EXPR
, TREE_TYPE (decl
), decl
, lhs
);
24313 return build2 (MODIFY_EXPR
, TREE_TYPE (decl
), decl
, rhs
);
24316 /* Parse the restricted form of the for statement allowed by OpenMP. */
24319 cp_parser_omp_for_loop (cp_parser
*parser
, tree clauses
, tree
*par_clauses
)
24321 tree init
, cond
, incr
, body
, decl
, pre_body
= NULL_TREE
, ret
;
24322 tree real_decl
, initv
, condv
, incrv
, declv
;
24323 tree this_pre_body
, cl
;
24324 location_t loc_first
;
24325 bool collapse_err
= false;
24326 int i
, collapse
= 1, nbraces
= 0;
24327 VEC(tree
,gc
) *for_block
= make_tree_vector ();
24329 for (cl
= clauses
; cl
; cl
= OMP_CLAUSE_CHAIN (cl
))
24330 if (OMP_CLAUSE_CODE (cl
) == OMP_CLAUSE_COLLAPSE
)
24331 collapse
= tree_low_cst (OMP_CLAUSE_COLLAPSE_EXPR (cl
), 0);
24333 gcc_assert (collapse
>= 1);
24335 declv
= make_tree_vec (collapse
);
24336 initv
= make_tree_vec (collapse
);
24337 condv
= make_tree_vec (collapse
);
24338 incrv
= make_tree_vec (collapse
);
24340 loc_first
= cp_lexer_peek_token (parser
->lexer
)->location
;
24342 for (i
= 0; i
< collapse
; i
++)
24344 int bracecount
= 0;
24345 bool add_private_clause
= false;
24348 if (!cp_lexer_next_token_is_keyword (parser
->lexer
, RID_FOR
))
24350 cp_parser_error (parser
, "for statement expected");
24353 loc
= cp_lexer_consume_token (parser
->lexer
)->location
;
24355 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, RT_OPEN_PAREN
))
24358 init
= decl
= real_decl
= NULL
;
24359 this_pre_body
= push_stmt_list ();
24360 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
24362 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
24366 integer-type var = lb
24367 random-access-iterator-type var = lb
24368 pointer-type var = lb
24370 cp_decl_specifier_seq type_specifiers
;
24372 /* First, try to parse as an initialized declaration. See
24373 cp_parser_condition, from whence the bulk of this is copied. */
24375 cp_parser_parse_tentatively (parser
);
24376 cp_parser_type_specifier_seq (parser
, /*is_declaration=*/true,
24377 /*is_trailing_return=*/false,
24379 if (cp_parser_parse_definitely (parser
))
24381 /* If parsing a type specifier seq succeeded, then this
24382 MUST be a initialized declaration. */
24383 tree asm_specification
, attributes
;
24384 cp_declarator
*declarator
;
24386 declarator
= cp_parser_declarator (parser
,
24387 CP_PARSER_DECLARATOR_NAMED
,
24388 /*ctor_dtor_or_conv_p=*/NULL
,
24389 /*parenthesized_p=*/NULL
,
24390 /*member_p=*/false);
24391 attributes
= cp_parser_attributes_opt (parser
);
24392 asm_specification
= cp_parser_asm_specification_opt (parser
);
24394 if (declarator
== cp_error_declarator
)
24395 cp_parser_skip_to_end_of_statement (parser
);
24399 tree pushed_scope
, auto_node
;
24401 decl
= start_decl (declarator
, &type_specifiers
,
24402 SD_INITIALIZED
, attributes
,
24403 /*prefix_attributes=*/NULL_TREE
,
24406 auto_node
= type_uses_auto (TREE_TYPE (decl
));
24407 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
))
24409 if (cp_lexer_next_token_is (parser
->lexer
,
24411 error ("parenthesized initialization is not allowed in "
24412 "OpenMP %<for%> loop");
24414 /* Trigger an error. */
24415 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
24417 init
= error_mark_node
;
24418 cp_parser_skip_to_end_of_statement (parser
);
24420 else if (CLASS_TYPE_P (TREE_TYPE (decl
))
24421 || type_dependent_expression_p (decl
)
24424 bool is_direct_init
, is_non_constant_init
;
24426 init
= cp_parser_initializer (parser
,
24428 &is_non_constant_init
);
24430 if (auto_node
&& describable_type (init
))
24433 = do_auto_deduction (TREE_TYPE (decl
), init
,
24436 if (!CLASS_TYPE_P (TREE_TYPE (decl
))
24437 && !type_dependent_expression_p (decl
))
24441 cp_finish_decl (decl
, init
, !is_non_constant_init
,
24443 LOOKUP_ONLYCONVERTING
);
24444 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
24446 VEC_safe_push (tree
, gc
, for_block
, this_pre_body
);
24450 init
= pop_stmt_list (this_pre_body
);
24451 this_pre_body
= NULL_TREE
;
24456 cp_lexer_consume_token (parser
->lexer
);
24457 init
= cp_parser_assignment_expression (parser
, false, NULL
);
24460 if (TREE_CODE (TREE_TYPE (decl
)) == REFERENCE_TYPE
)
24461 init
= error_mark_node
;
24463 cp_finish_decl (decl
, NULL_TREE
,
24464 /*init_const_expr_p=*/false,
24466 LOOKUP_ONLYCONVERTING
);
24470 pop_scope (pushed_scope
);
24476 /* If parsing a type specifier sequence failed, then
24477 this MUST be a simple expression. */
24478 cp_parser_parse_tentatively (parser
);
24479 decl
= cp_parser_primary_expression (parser
, false, false,
24481 if (!cp_parser_error_occurred (parser
)
24484 && CLASS_TYPE_P (TREE_TYPE (decl
)))
24488 cp_parser_parse_definitely (parser
);
24489 cp_parser_require (parser
, CPP_EQ
, RT_EQ
);
24490 rhs
= cp_parser_assignment_expression (parser
, false, NULL
);
24491 finish_expr_stmt (build_x_modify_expr (decl
, NOP_EXPR
,
24493 tf_warning_or_error
));
24494 add_private_clause
= true;
24499 cp_parser_abort_tentative_parse (parser
);
24500 init
= cp_parser_expression (parser
, false, NULL
);
24503 if (TREE_CODE (init
) == MODIFY_EXPR
24504 || TREE_CODE (init
) == MODOP_EXPR
)
24505 real_decl
= TREE_OPERAND (init
, 0);
24510 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
24513 this_pre_body
= pop_stmt_list (this_pre_body
);
24517 pre_body
= push_stmt_list ();
24519 add_stmt (this_pre_body
);
24520 pre_body
= pop_stmt_list (pre_body
);
24523 pre_body
= this_pre_body
;
24528 if (par_clauses
!= NULL
&& real_decl
!= NULL_TREE
)
24531 for (c
= par_clauses
; *c
; )
24532 if (OMP_CLAUSE_CODE (*c
) == OMP_CLAUSE_FIRSTPRIVATE
24533 && OMP_CLAUSE_DECL (*c
) == real_decl
)
24535 error_at (loc
, "iteration variable %qD"
24536 " should not be firstprivate", real_decl
);
24537 *c
= OMP_CLAUSE_CHAIN (*c
);
24539 else if (OMP_CLAUSE_CODE (*c
) == OMP_CLAUSE_LASTPRIVATE
24540 && OMP_CLAUSE_DECL (*c
) == real_decl
)
24542 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
24543 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
24544 tree l
= build_omp_clause (loc
, OMP_CLAUSE_LASTPRIVATE
);
24545 OMP_CLAUSE_DECL (l
) = real_decl
;
24546 OMP_CLAUSE_CHAIN (l
) = clauses
;
24547 CP_OMP_CLAUSE_INFO (l
) = CP_OMP_CLAUSE_INFO (*c
);
24549 OMP_CLAUSE_SET_CODE (*c
, OMP_CLAUSE_SHARED
);
24550 CP_OMP_CLAUSE_INFO (*c
) = NULL
;
24551 add_private_clause
= false;
24555 if (OMP_CLAUSE_CODE (*c
) == OMP_CLAUSE_PRIVATE
24556 && OMP_CLAUSE_DECL (*c
) == real_decl
)
24557 add_private_clause
= false;
24558 c
= &OMP_CLAUSE_CHAIN (*c
);
24562 if (add_private_clause
)
24565 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
24567 if ((OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_PRIVATE
24568 || OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
)
24569 && OMP_CLAUSE_DECL (c
) == decl
)
24571 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_FIRSTPRIVATE
24572 && OMP_CLAUSE_DECL (c
) == decl
)
24573 error_at (loc
, "iteration variable %qD "
24574 "should not be firstprivate",
24576 else if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_REDUCTION
24577 && OMP_CLAUSE_DECL (c
) == decl
)
24578 error_at (loc
, "iteration variable %qD should not be reduction",
24583 c
= build_omp_clause (loc
, OMP_CLAUSE_PRIVATE
);
24584 OMP_CLAUSE_DECL (c
) = decl
;
24585 c
= finish_omp_clauses (c
);
24588 OMP_CLAUSE_CHAIN (c
) = clauses
;
24595 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
24596 cond
= cp_parser_omp_for_cond (parser
, decl
);
24597 cp_parser_require (parser
, CPP_SEMICOLON
, RT_SEMICOLON
);
24600 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
24602 /* If decl is an iterator, preserve the operator on decl
24603 until finish_omp_for. */
24605 && (type_dependent_expression_p (decl
)
24606 || CLASS_TYPE_P (TREE_TYPE (decl
))))
24607 incr
= cp_parser_omp_for_incr (parser
, decl
);
24609 incr
= cp_parser_expression (parser
, false, NULL
);
24612 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, RT_CLOSE_PAREN
))
24613 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
24614 /*or_comma=*/false,
24615 /*consume_paren=*/true);
24617 TREE_VEC_ELT (declv
, i
) = decl
;
24618 TREE_VEC_ELT (initv
, i
) = init
;
24619 TREE_VEC_ELT (condv
, i
) = cond
;
24620 TREE_VEC_ELT (incrv
, i
) = incr
;
24622 if (i
== collapse
- 1)
24625 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
24626 in between the collapsed for loops to be still considered perfectly
24627 nested. Hopefully the final version clarifies this.
24628 For now handle (multiple) {'s and empty statements. */
24629 cp_parser_parse_tentatively (parser
);
24632 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_FOR
))
24634 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
24636 cp_lexer_consume_token (parser
->lexer
);
24639 else if (bracecount
24640 && cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
24641 cp_lexer_consume_token (parser
->lexer
);
24644 loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
24645 error_at (loc
, "not enough collapsed for loops");
24646 collapse_err
= true;
24647 cp_parser_abort_tentative_parse (parser
);
24656 cp_parser_parse_definitely (parser
);
24657 nbraces
+= bracecount
;
24661 /* Note that we saved the original contents of this flag when we entered
24662 the structured block, and so we don't need to re-save it here. */
24663 parser
->in_statement
= IN_OMP_FOR
;
24665 /* Note that the grammar doesn't call for a structured block here,
24666 though the loop as a whole is a structured block. */
24667 body
= push_stmt_list ();
24668 cp_parser_statement (parser
, NULL_TREE
, false, NULL
);
24669 body
= pop_stmt_list (body
);
24671 if (declv
== NULL_TREE
)
24674 ret
= finish_omp_for (loc_first
, declv
, initv
, condv
, incrv
, body
,
24675 pre_body
, clauses
);
24679 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
24681 cp_lexer_consume_token (parser
->lexer
);
24684 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
24685 cp_lexer_consume_token (parser
->lexer
);
24690 error_at (cp_lexer_peek_token (parser
->lexer
)->location
,
24691 "collapsed loops not perfectly nested");
24693 collapse_err
= true;
24694 cp_parser_statement_seq_opt (parser
, NULL
);
24695 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
24700 while (!VEC_empty (tree
, for_block
))
24701 add_stmt (pop_stmt_list (VEC_pop (tree
, for_block
)));
24702 release_tree_vector (for_block
);
24708 #pragma omp for for-clause[optseq] new-line
24711 #define OMP_FOR_CLAUSE_MASK \
24712 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
24713 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
24714 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
24715 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
24716 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
24717 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
24718 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT) \
24719 | (1u << PRAGMA_OMP_CLAUSE_COLLAPSE))
24722 cp_parser_omp_for (cp_parser
*parser
, cp_token
*pragma_tok
)
24724 tree clauses
, sb
, ret
;
24727 clauses
= cp_parser_omp_all_clauses (parser
, OMP_FOR_CLAUSE_MASK
,
24728 "#pragma omp for", pragma_tok
);
24730 sb
= begin_omp_structured_block ();
24731 save
= cp_parser_begin_omp_structured_block (parser
);
24733 ret
= cp_parser_omp_for_loop (parser
, clauses
, NULL
);
24735 cp_parser_end_omp_structured_block (parser
, save
);
24736 add_stmt (finish_omp_structured_block (sb
));
24742 # pragma omp master new-line
24743 structured-block */
24746 cp_parser_omp_master (cp_parser
*parser
, cp_token
*pragma_tok
)
24748 cp_parser_require_pragma_eol (parser
, pragma_tok
);
24749 return c_finish_omp_master (input_location
,
24750 cp_parser_omp_structured_block (parser
));
24754 # pragma omp ordered new-line
24755 structured-block */
24758 cp_parser_omp_ordered (cp_parser
*parser
, cp_token
*pragma_tok
)
24760 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
24761 cp_parser_require_pragma_eol (parser
, pragma_tok
);
24762 return c_finish_omp_ordered (loc
, cp_parser_omp_structured_block (parser
));
24768 { section-sequence }
24771 section-directive[opt] structured-block
24772 section-sequence section-directive structured-block */
24775 cp_parser_omp_sections_scope (cp_parser
*parser
)
24777 tree stmt
, substmt
;
24778 bool error_suppress
= false;
24781 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, RT_OPEN_BRACE
))
24784 stmt
= push_stmt_list ();
24786 if (cp_lexer_peek_token (parser
->lexer
)->pragma_kind
!= PRAGMA_OMP_SECTION
)
24790 substmt
= begin_omp_structured_block ();
24791 save
= cp_parser_begin_omp_structured_block (parser
);
24795 cp_parser_statement (parser
, NULL_TREE
, false, NULL
);
24797 tok
= cp_lexer_peek_token (parser
->lexer
);
24798 if (tok
->pragma_kind
== PRAGMA_OMP_SECTION
)
24800 if (tok
->type
== CPP_CLOSE_BRACE
)
24802 if (tok
->type
== CPP_EOF
)
24806 cp_parser_end_omp_structured_block (parser
, save
);
24807 substmt
= finish_omp_structured_block (substmt
);
24808 substmt
= build1 (OMP_SECTION
, void_type_node
, substmt
);
24809 add_stmt (substmt
);
24814 tok
= cp_lexer_peek_token (parser
->lexer
);
24815 if (tok
->type
== CPP_CLOSE_BRACE
)
24817 if (tok
->type
== CPP_EOF
)
24820 if (tok
->pragma_kind
== PRAGMA_OMP_SECTION
)
24822 cp_lexer_consume_token (parser
->lexer
);
24823 cp_parser_require_pragma_eol (parser
, tok
);
24824 error_suppress
= false;
24826 else if (!error_suppress
)
24828 cp_parser_error (parser
, "expected %<#pragma omp section%> or %<}%>");
24829 error_suppress
= true;
24832 substmt
= cp_parser_omp_structured_block (parser
);
24833 substmt
= build1 (OMP_SECTION
, void_type_node
, substmt
);
24834 add_stmt (substmt
);
24836 cp_parser_require (parser
, CPP_CLOSE_BRACE
, RT_CLOSE_BRACE
);
24838 substmt
= pop_stmt_list (stmt
);
24840 stmt
= make_node (OMP_SECTIONS
);
24841 TREE_TYPE (stmt
) = void_type_node
;
24842 OMP_SECTIONS_BODY (stmt
) = substmt
;
24849 # pragma omp sections sections-clause[optseq] newline
24852 #define OMP_SECTIONS_CLAUSE_MASK \
24853 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
24854 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
24855 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
24856 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
24857 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
24860 cp_parser_omp_sections (cp_parser
*parser
, cp_token
*pragma_tok
)
24864 clauses
= cp_parser_omp_all_clauses (parser
, OMP_SECTIONS_CLAUSE_MASK
,
24865 "#pragma omp sections", pragma_tok
);
24867 ret
= cp_parser_omp_sections_scope (parser
);
24869 OMP_SECTIONS_CLAUSES (ret
) = clauses
;
24875 # pragma parallel parallel-clause new-line
24876 # pragma parallel for parallel-for-clause new-line
24877 # pragma parallel sections parallel-sections-clause new-line */
24879 #define OMP_PARALLEL_CLAUSE_MASK \
24880 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
24881 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
24882 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
24883 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
24884 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
24885 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
24886 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
24887 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
24890 cp_parser_omp_parallel (cp_parser
*parser
, cp_token
*pragma_tok
)
24892 enum pragma_kind p_kind
= PRAGMA_OMP_PARALLEL
;
24893 const char *p_name
= "#pragma omp parallel";
24894 tree stmt
, clauses
, par_clause
, ws_clause
, block
;
24895 unsigned int mask
= OMP_PARALLEL_CLAUSE_MASK
;
24897 location_t loc
= cp_lexer_peek_token (parser
->lexer
)->location
;
24899 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_FOR
))
24901 cp_lexer_consume_token (parser
->lexer
);
24902 p_kind
= PRAGMA_OMP_PARALLEL_FOR
;
24903 p_name
= "#pragma omp parallel for";
24904 mask
|= OMP_FOR_CLAUSE_MASK
;
24905 mask
&= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT
);
24907 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
24909 tree id
= cp_lexer_peek_token (parser
->lexer
)->u
.value
;
24910 const char *p
= IDENTIFIER_POINTER (id
);
24911 if (strcmp (p
, "sections") == 0)
24913 cp_lexer_consume_token (parser
->lexer
);
24914 p_kind
= PRAGMA_OMP_PARALLEL_SECTIONS
;
24915 p_name
= "#pragma omp parallel sections";
24916 mask
|= OMP_SECTIONS_CLAUSE_MASK
;
24917 mask
&= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT
);
24921 clauses
= cp_parser_omp_all_clauses (parser
, mask
, p_name
, pragma_tok
);
24922 block
= begin_omp_parallel ();
24923 save
= cp_parser_begin_omp_structured_block (parser
);
24927 case PRAGMA_OMP_PARALLEL
:
24928 cp_parser_statement (parser
, NULL_TREE
, false, NULL
);
24929 par_clause
= clauses
;
24932 case PRAGMA_OMP_PARALLEL_FOR
:
24933 c_split_parallel_clauses (loc
, clauses
, &par_clause
, &ws_clause
);
24934 cp_parser_omp_for_loop (parser
, ws_clause
, &par_clause
);
24937 case PRAGMA_OMP_PARALLEL_SECTIONS
:
24938 c_split_parallel_clauses (loc
, clauses
, &par_clause
, &ws_clause
);
24939 stmt
= cp_parser_omp_sections_scope (parser
);
24941 OMP_SECTIONS_CLAUSES (stmt
) = ws_clause
;
24945 gcc_unreachable ();
24948 cp_parser_end_omp_structured_block (parser
, save
);
24949 stmt
= finish_omp_parallel (par_clause
, block
);
24950 if (p_kind
!= PRAGMA_OMP_PARALLEL
)
24951 OMP_PARALLEL_COMBINED (stmt
) = 1;
24956 # pragma omp single single-clause[optseq] new-line
24957 structured-block */
24959 #define OMP_SINGLE_CLAUSE_MASK \
24960 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
24961 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
24962 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
24963 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
24966 cp_parser_omp_single (cp_parser
*parser
, cp_token
*pragma_tok
)
24968 tree stmt
= make_node (OMP_SINGLE
);
24969 TREE_TYPE (stmt
) = void_type_node
;
24971 OMP_SINGLE_CLAUSES (stmt
)
24972 = cp_parser_omp_all_clauses (parser
, OMP_SINGLE_CLAUSE_MASK
,
24973 "#pragma omp single", pragma_tok
);
24974 OMP_SINGLE_BODY (stmt
) = cp_parser_omp_structured_block (parser
);
24976 return add_stmt (stmt
);
24980 # pragma omp task task-clause[optseq] new-line
24981 structured-block */
24983 #define OMP_TASK_CLAUSE_MASK \
24984 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
24985 | (1u << PRAGMA_OMP_CLAUSE_UNTIED) \
24986 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
24987 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
24988 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
24989 | (1u << PRAGMA_OMP_CLAUSE_SHARED))
24992 cp_parser_omp_task (cp_parser
*parser
, cp_token
*pragma_tok
)
24994 tree clauses
, block
;
24997 clauses
= cp_parser_omp_all_clauses (parser
, OMP_TASK_CLAUSE_MASK
,
24998 "#pragma omp task", pragma_tok
);
24999 block
= begin_omp_task ();
25000 save
= cp_parser_begin_omp_structured_block (parser
);
25001 cp_parser_statement (parser
, NULL_TREE
, false, NULL
);
25002 cp_parser_end_omp_structured_block (parser
, save
);
25003 return finish_omp_task (clauses
, block
);
25007 # pragma omp taskwait new-line */
25010 cp_parser_omp_taskwait (cp_parser
*parser
, cp_token
*pragma_tok
)
25012 cp_parser_require_pragma_eol (parser
, pragma_tok
);
25013 finish_omp_taskwait ();
25017 # pragma omp threadprivate (variable-list) */
25020 cp_parser_omp_threadprivate (cp_parser
*parser
, cp_token
*pragma_tok
)
25024 vars
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_ERROR
, NULL
);
25025 cp_parser_require_pragma_eol (parser
, pragma_tok
);
25027 finish_omp_threadprivate (vars
);
25030 /* Main entry point to OpenMP statement pragmas. */
25033 cp_parser_omp_construct (cp_parser
*parser
, cp_token
*pragma_tok
)
25037 switch (pragma_tok
->pragma_kind
)
25039 case PRAGMA_OMP_ATOMIC
:
25040 cp_parser_omp_atomic (parser
, pragma_tok
);
25042 case PRAGMA_OMP_CRITICAL
:
25043 stmt
= cp_parser_omp_critical (parser
, pragma_tok
);
25045 case PRAGMA_OMP_FOR
:
25046 stmt
= cp_parser_omp_for (parser
, pragma_tok
);
25048 case PRAGMA_OMP_MASTER
:
25049 stmt
= cp_parser_omp_master (parser
, pragma_tok
);
25051 case PRAGMA_OMP_ORDERED
:
25052 stmt
= cp_parser_omp_ordered (parser
, pragma_tok
);
25054 case PRAGMA_OMP_PARALLEL
:
25055 stmt
= cp_parser_omp_parallel (parser
, pragma_tok
);
25057 case PRAGMA_OMP_SECTIONS
:
25058 stmt
= cp_parser_omp_sections (parser
, pragma_tok
);
25060 case PRAGMA_OMP_SINGLE
:
25061 stmt
= cp_parser_omp_single (parser
, pragma_tok
);
25063 case PRAGMA_OMP_TASK
:
25064 stmt
= cp_parser_omp_task (parser
, pragma_tok
);
25067 gcc_unreachable ();
25071 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
25076 static GTY (()) cp_parser
*the_parser
;
25079 /* Special handling for the first token or line in the file. The first
25080 thing in the file might be #pragma GCC pch_preprocess, which loads a
25081 PCH file, which is a GC collection point. So we need to handle this
25082 first pragma without benefit of an existing lexer structure.
25084 Always returns one token to the caller in *FIRST_TOKEN. This is
25085 either the true first token of the file, or the first token after
25086 the initial pragma. */
25089 cp_parser_initial_pragma (cp_token
*first_token
)
25093 cp_lexer_get_preprocessor_token (NULL
, first_token
);
25094 if (first_token
->pragma_kind
!= PRAGMA_GCC_PCH_PREPROCESS
)
25097 cp_lexer_get_preprocessor_token (NULL
, first_token
);
25098 if (first_token
->type
== CPP_STRING
)
25100 name
= first_token
->u
.value
;
25102 cp_lexer_get_preprocessor_token (NULL
, first_token
);
25103 if (first_token
->type
!= CPP_PRAGMA_EOL
)
25104 error_at (first_token
->location
,
25105 "junk at end of %<#pragma GCC pch_preprocess%>");
25108 error_at (first_token
->location
, "expected string literal");
25110 /* Skip to the end of the pragma. */
25111 while (first_token
->type
!= CPP_PRAGMA_EOL
&& first_token
->type
!= CPP_EOF
)
25112 cp_lexer_get_preprocessor_token (NULL
, first_token
);
25114 /* Now actually load the PCH file. */
25116 c_common_pch_pragma (parse_in
, TREE_STRING_POINTER (name
));
25118 /* Read one more token to return to our caller. We have to do this
25119 after reading the PCH file in, since its pointers have to be
25121 cp_lexer_get_preprocessor_token (NULL
, first_token
);
25124 /* Normal parsing of a pragma token. Here we can (and must) use the
25128 cp_parser_pragma (cp_parser
*parser
, enum pragma_context context
)
25130 cp_token
*pragma_tok
;
25133 pragma_tok
= cp_lexer_consume_token (parser
->lexer
);
25134 gcc_assert (pragma_tok
->type
== CPP_PRAGMA
);
25135 parser
->lexer
->in_pragma
= true;
25137 id
= pragma_tok
->pragma_kind
;
25140 case PRAGMA_GCC_PCH_PREPROCESS
:
25141 error_at (pragma_tok
->location
,
25142 "%<#pragma GCC pch_preprocess%> must be first");
25145 case PRAGMA_OMP_BARRIER
:
25148 case pragma_compound
:
25149 cp_parser_omp_barrier (parser
, pragma_tok
);
25152 error_at (pragma_tok
->location
, "%<#pragma omp barrier%> may only be "
25153 "used in compound statements");
25160 case PRAGMA_OMP_FLUSH
:
25163 case pragma_compound
:
25164 cp_parser_omp_flush (parser
, pragma_tok
);
25167 error_at (pragma_tok
->location
, "%<#pragma omp flush%> may only be "
25168 "used in compound statements");
25175 case PRAGMA_OMP_TASKWAIT
:
25178 case pragma_compound
:
25179 cp_parser_omp_taskwait (parser
, pragma_tok
);
25182 error_at (pragma_tok
->location
,
25183 "%<#pragma omp taskwait%> may only be "
25184 "used in compound statements");
25191 case PRAGMA_OMP_THREADPRIVATE
:
25192 cp_parser_omp_threadprivate (parser
, pragma_tok
);
25195 case PRAGMA_OMP_ATOMIC
:
25196 case PRAGMA_OMP_CRITICAL
:
25197 case PRAGMA_OMP_FOR
:
25198 case PRAGMA_OMP_MASTER
:
25199 case PRAGMA_OMP_ORDERED
:
25200 case PRAGMA_OMP_PARALLEL
:
25201 case PRAGMA_OMP_SECTIONS
:
25202 case PRAGMA_OMP_SINGLE
:
25203 case PRAGMA_OMP_TASK
:
25204 if (context
== pragma_external
)
25206 cp_parser_omp_construct (parser
, pragma_tok
);
25209 case PRAGMA_OMP_SECTION
:
25210 error_at (pragma_tok
->location
,
25211 "%<#pragma omp section%> may only be used in "
25212 "%<#pragma omp sections%> construct");
25216 gcc_assert (id
>= PRAGMA_FIRST_EXTERNAL
);
25217 c_invoke_pragma_handler (id
);
25221 cp_parser_error (parser
, "expected declaration specifiers");
25225 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
25229 /* The interface the pragma parsers have to the lexer. */
25232 pragma_lex (tree
*value
)
25235 enum cpp_ttype ret
;
25237 tok
= cp_lexer_peek_token (the_parser
->lexer
);
25240 *value
= tok
->u
.value
;
25242 if (ret
== CPP_PRAGMA_EOL
|| ret
== CPP_EOF
)
25244 else if (ret
== CPP_STRING
)
25245 *value
= cp_parser_string_literal (the_parser
, false, false);
25248 cp_lexer_consume_token (the_parser
->lexer
);
25249 if (ret
== CPP_KEYWORD
)
25257 /* External interface. */
25259 /* Parse one entire translation unit. */
25262 c_parse_file (void)
25264 static bool already_called
= false;
25266 if (already_called
)
25268 sorry ("inter-module optimizations not implemented for C++");
25271 already_called
= true;
25273 the_parser
= cp_parser_new ();
25274 push_deferring_access_checks (flag_access_control
25275 ? dk_no_deferred
: dk_no_check
);
25276 cp_parser_translation_unit (the_parser
);
25280 #include "gt-cp-parser.h"