2 Copyright (C) 2000, 2001, 2002, 2003, 2004,
3 2005 Free Software Foundation, Inc.
4 Written by Mark Mitchell <mark@codesourcery.com>.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it
9 under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GCC is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING. If not, write to the Free
20 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
25 #include "coretypes.h"
27 #include "dyn-string.h"
35 #include "diagnostic.h"
45 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
46 and c-lex.c) and the C++ parser. */
50 typedef struct cp_token
GTY (())
52 /* The kind of token. */
53 ENUM_BITFIELD (cpp_ttype
) type
: 8;
54 /* If this token is a keyword, this value indicates which keyword.
55 Otherwise, this value is RID_MAX. */
56 ENUM_BITFIELD (rid
) keyword
: 8;
59 /* Identifier for the pragma. */
60 ENUM_BITFIELD (pragma_kind
) pragma_kind
: 6;
61 /* True if this token is from a system header. */
62 BOOL_BITFIELD in_system_header
: 1;
63 /* True if this token is from a context where it is implicitly extern "C" */
64 BOOL_BITFIELD implicit_extern_c
: 1;
65 /* True for a CPP_NAME token that is not a keyword (i.e., for which
66 KEYWORD is RID_MAX) iff this name was looked up and found to be
67 ambiguous. An error has already been reported. */
68 BOOL_BITFIELD ambiguous_p
: 1;
69 /* The input file stack index at which this token was found. */
70 unsigned input_file_stack_index
: INPUT_FILE_STACK_BITS
;
71 /* The value associated with this token, if any. */
73 /* The location at which this token was found. */
77 /* We use a stack of token pointer for saving token sets. */
78 typedef struct cp_token
*cp_token_position
;
79 DEF_VEC_P (cp_token_position
);
80 DEF_VEC_ALLOC_P (cp_token_position
,heap
);
82 static const cp_token eof_token
=
84 CPP_EOF
, RID_MAX
, 0, PRAGMA_NONE
, 0, 0, false, 0, NULL_TREE
,
85 #if USE_MAPPED_LOCATION
92 /* The cp_lexer structure represents the C++ lexer. It is responsible
93 for managing the token stream from the preprocessor and supplying
94 it to the parser. Tokens are never added to the cp_lexer after
97 typedef struct cp_lexer
GTY (())
99 /* The memory allocated for the buffer. NULL if this lexer does not
100 own the token buffer. */
101 cp_token
* GTY ((length ("%h.buffer_length"))) buffer
;
102 /* If the lexer owns the buffer, this is the number of tokens in the
104 size_t buffer_length
;
106 /* A pointer just past the last available token. The tokens
107 in this lexer are [buffer, last_token). */
108 cp_token_position
GTY ((skip
)) last_token
;
110 /* The next available token. If NEXT_TOKEN is &eof_token, then there are
111 no more available tokens. */
112 cp_token_position
GTY ((skip
)) next_token
;
114 /* A stack indicating positions at which cp_lexer_save_tokens was
115 called. The top entry is the most recent position at which we
116 began saving tokens. If the stack is non-empty, we are saving
118 VEC(cp_token_position
,heap
) *GTY ((skip
)) saved_tokens
;
120 /* The next lexer in a linked list of lexers. */
121 struct cp_lexer
*next
;
123 /* True if we should output debugging information. */
126 /* True if we're in the context of parsing a pragma, and should not
127 increment past the end-of-line marker. */
131 /* cp_token_cache is a range of tokens. There is no need to represent
132 allocate heap memory for it, since tokens are never removed from the
133 lexer's array. There is also no need for the GC to walk through
134 a cp_token_cache, since everything in here is referenced through
137 typedef struct cp_token_cache
GTY(())
139 /* The beginning of the token range. */
140 cp_token
* GTY((skip
)) first
;
142 /* Points immediately after the last token in the range. */
143 cp_token
* GTY ((skip
)) last
;
148 static cp_lexer
*cp_lexer_new_main
150 static cp_lexer
*cp_lexer_new_from_tokens
151 (cp_token_cache
*tokens
);
152 static void cp_lexer_destroy
154 static int cp_lexer_saving_tokens
156 static cp_token_position cp_lexer_token_position
158 static cp_token
*cp_lexer_token_at
159 (cp_lexer
*, cp_token_position
);
160 static void cp_lexer_get_preprocessor_token
161 (cp_lexer
*, cp_token
*);
162 static inline cp_token
*cp_lexer_peek_token
164 static cp_token
*cp_lexer_peek_nth_token
165 (cp_lexer
*, size_t);
166 static inline bool cp_lexer_next_token_is
167 (cp_lexer
*, enum cpp_ttype
);
168 static bool cp_lexer_next_token_is_not
169 (cp_lexer
*, enum cpp_ttype
);
170 static bool cp_lexer_next_token_is_keyword
171 (cp_lexer
*, enum rid
);
172 static cp_token
*cp_lexer_consume_token
174 static void cp_lexer_purge_token
176 static void cp_lexer_purge_tokens_after
177 (cp_lexer
*, cp_token_position
);
178 static void cp_lexer_save_tokens
180 static void cp_lexer_commit_tokens
182 static void cp_lexer_rollback_tokens
184 #ifdef ENABLE_CHECKING
185 static void cp_lexer_print_token
186 (FILE *, cp_token
*);
187 static inline bool cp_lexer_debugging_p
189 static void cp_lexer_start_debugging
190 (cp_lexer
*) ATTRIBUTE_UNUSED
;
191 static void cp_lexer_stop_debugging
192 (cp_lexer
*) ATTRIBUTE_UNUSED
;
194 /* If we define cp_lexer_debug_stream to NULL it will provoke warnings
195 about passing NULL to functions that require non-NULL arguments
196 (fputs, fprintf). It will never be used, so all we need is a value
197 of the right type that's guaranteed not to be NULL. */
198 #define cp_lexer_debug_stream stdout
199 #define cp_lexer_print_token(str, tok) (void) 0
200 #define cp_lexer_debugging_p(lexer) 0
201 #endif /* ENABLE_CHECKING */
203 static cp_token_cache
*cp_token_cache_new
204 (cp_token
*, cp_token
*);
206 static void cp_parser_initial_pragma
209 /* Manifest constants. */
210 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
211 #define CP_SAVED_TOKEN_STACK 5
213 /* A token type for keywords, as opposed to ordinary identifiers. */
214 #define CPP_KEYWORD ((enum cpp_ttype) (N_TTYPES + 1))
216 /* A token type for template-ids. If a template-id is processed while
217 parsing tentatively, it is replaced with a CPP_TEMPLATE_ID token;
218 the value of the CPP_TEMPLATE_ID is whatever was returned by
219 cp_parser_template_id. */
220 #define CPP_TEMPLATE_ID ((enum cpp_ttype) (CPP_KEYWORD + 1))
222 /* A token type for nested-name-specifiers. If a
223 nested-name-specifier is processed while parsing tentatively, it is
224 replaced with a CPP_NESTED_NAME_SPECIFIER token; the value of the
225 CPP_NESTED_NAME_SPECIFIER is whatever was returned by
226 cp_parser_nested_name_specifier_opt. */
227 #define CPP_NESTED_NAME_SPECIFIER ((enum cpp_ttype) (CPP_TEMPLATE_ID + 1))
229 /* A token type for tokens that are not tokens at all; these are used
230 to represent slots in the array where there used to be a token
231 that has now been deleted. */
232 #define CPP_PURGED ((enum cpp_ttype) (CPP_NESTED_NAME_SPECIFIER + 1))
234 /* The number of token types, including C++-specific ones. */
235 #define N_CP_TTYPES ((int) (CPP_PURGED + 1))
239 #ifdef ENABLE_CHECKING
240 /* The stream to which debugging output should be written. */
241 static FILE *cp_lexer_debug_stream
;
242 #endif /* ENABLE_CHECKING */
244 /* Create a new main C++ lexer, the lexer that gets tokens from the
248 cp_lexer_new_main (void)
250 cp_token first_token
;
257 /* It's possible that parsing the first pragma will load a PCH file,
258 which is a GC collection point. So we have to do that before
259 allocating any memory. */
260 cp_parser_initial_pragma (&first_token
);
262 /* Tell c_lex_with_flags not to merge string constants. */
263 c_lex_return_raw_strings
= true;
265 c_common_no_more_pch ();
267 /* Allocate the memory. */
268 lexer
= GGC_CNEW (cp_lexer
);
270 #ifdef ENABLE_CHECKING
271 /* Initially we are not debugging. */
272 lexer
->debugging_p
= false;
273 #endif /* ENABLE_CHECKING */
274 lexer
->saved_tokens
= VEC_alloc (cp_token_position
, heap
,
275 CP_SAVED_TOKEN_STACK
);
277 /* Create the buffer. */
278 alloc
= CP_LEXER_BUFFER_SIZE
;
279 buffer
= GGC_NEWVEC (cp_token
, alloc
);
281 /* Put the first token in the buffer. */
286 /* Get the remaining tokens from the preprocessor. */
287 while (pos
->type
!= CPP_EOF
)
294 buffer
= GGC_RESIZEVEC (cp_token
, buffer
, alloc
);
295 pos
= buffer
+ space
;
297 cp_lexer_get_preprocessor_token (lexer
, pos
);
299 lexer
->buffer
= buffer
;
300 lexer
->buffer_length
= alloc
- space
;
301 lexer
->last_token
= pos
;
302 lexer
->next_token
= lexer
->buffer_length
? buffer
: (cp_token
*)&eof_token
;
304 /* Subsequent preprocessor diagnostics should use compiler
305 diagnostic functions to get the compiler source location. */
306 cpp_get_options (parse_in
)->client_diagnostic
= true;
307 cpp_get_callbacks (parse_in
)->error
= cp_cpp_error
;
309 gcc_assert (lexer
->next_token
->type
!= CPP_PURGED
);
313 /* Create a new lexer whose token stream is primed with the tokens in
314 CACHE. When these tokens are exhausted, no new tokens will be read. */
317 cp_lexer_new_from_tokens (cp_token_cache
*cache
)
319 cp_token
*first
= cache
->first
;
320 cp_token
*last
= cache
->last
;
321 cp_lexer
*lexer
= GGC_CNEW (cp_lexer
);
323 /* We do not own the buffer. */
324 lexer
->buffer
= NULL
;
325 lexer
->buffer_length
= 0;
326 lexer
->next_token
= first
== last
? (cp_token
*)&eof_token
: first
;
327 lexer
->last_token
= last
;
329 lexer
->saved_tokens
= VEC_alloc (cp_token_position
, heap
,
330 CP_SAVED_TOKEN_STACK
);
332 #ifdef ENABLE_CHECKING
333 /* Initially we are not debugging. */
334 lexer
->debugging_p
= false;
337 gcc_assert (lexer
->next_token
->type
!= CPP_PURGED
);
341 /* Frees all resources associated with LEXER. */
344 cp_lexer_destroy (cp_lexer
*lexer
)
347 ggc_free (lexer
->buffer
);
348 VEC_free (cp_token_position
, heap
, lexer
->saved_tokens
);
352 /* Returns nonzero if debugging information should be output. */
354 #ifdef ENABLE_CHECKING
357 cp_lexer_debugging_p (cp_lexer
*lexer
)
359 return lexer
->debugging_p
;
362 #endif /* ENABLE_CHECKING */
364 static inline cp_token_position
365 cp_lexer_token_position (cp_lexer
*lexer
, bool previous_p
)
367 gcc_assert (!previous_p
|| lexer
->next_token
!= &eof_token
);
369 return lexer
->next_token
- previous_p
;
372 static inline cp_token
*
373 cp_lexer_token_at (cp_lexer
*lexer ATTRIBUTE_UNUSED
, cp_token_position pos
)
378 /* nonzero if we are presently saving tokens. */
381 cp_lexer_saving_tokens (const cp_lexer
* lexer
)
383 return VEC_length (cp_token_position
, lexer
->saved_tokens
) != 0;
386 /* Store the next token from the preprocessor in *TOKEN. Return true
390 cp_lexer_get_preprocessor_token (cp_lexer
*lexer ATTRIBUTE_UNUSED
,
393 static int is_extern_c
= 0;
395 /* Get a new token from the preprocessor. */
397 = c_lex_with_flags (&token
->value
, &token
->location
, &token
->flags
);
398 token
->input_file_stack_index
= input_file_stack_tick
;
399 token
->keyword
= RID_MAX
;
400 token
->pragma_kind
= PRAGMA_NONE
;
401 token
->in_system_header
= in_system_header
;
403 /* On some systems, some header files are surrounded by an
404 implicit extern "C" block. Set a flag in the token if it
405 comes from such a header. */
406 is_extern_c
+= pending_lang_change
;
407 pending_lang_change
= 0;
408 token
->implicit_extern_c
= is_extern_c
> 0;
410 /* Check to see if this token is a keyword. */
411 if (token
->type
== CPP_NAME
)
413 if (C_IS_RESERVED_WORD (token
->value
))
415 /* Mark this token as a keyword. */
416 token
->type
= CPP_KEYWORD
;
417 /* Record which keyword. */
418 token
->keyword
= C_RID_CODE (token
->value
);
419 /* Update the value. Some keywords are mapped to particular
420 entities, rather than simply having the value of the
421 corresponding IDENTIFIER_NODE. For example, `__const' is
422 mapped to `const'. */
423 token
->value
= ridpointers
[token
->keyword
];
427 token
->ambiguous_p
= false;
428 token
->keyword
= RID_MAX
;
431 /* Handle Objective-C++ keywords. */
432 else if (token
->type
== CPP_AT_NAME
)
434 token
->type
= CPP_KEYWORD
;
435 switch (C_RID_CODE (token
->value
))
437 /* Map 'class' to '@class', 'private' to '@private', etc. */
438 case RID_CLASS
: token
->keyword
= RID_AT_CLASS
; break;
439 case RID_PRIVATE
: token
->keyword
= RID_AT_PRIVATE
; break;
440 case RID_PROTECTED
: token
->keyword
= RID_AT_PROTECTED
; break;
441 case RID_PUBLIC
: token
->keyword
= RID_AT_PUBLIC
; break;
442 case RID_THROW
: token
->keyword
= RID_AT_THROW
; break;
443 case RID_TRY
: token
->keyword
= RID_AT_TRY
; break;
444 case RID_CATCH
: token
->keyword
= RID_AT_CATCH
; break;
445 default: token
->keyword
= C_RID_CODE (token
->value
);
448 else if (token
->type
== CPP_PRAGMA
)
450 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
451 token
->pragma_kind
= TREE_INT_CST_LOW (token
->value
);
456 /* Update the globals input_location and in_system_header and the
457 input file stack from TOKEN. */
459 cp_lexer_set_source_position_from_token (cp_token
*token
)
461 if (token
->type
!= CPP_EOF
)
463 input_location
= token
->location
;
464 in_system_header
= token
->in_system_header
;
465 restore_input_file_stack (token
->input_file_stack_index
);
469 /* Return a pointer to the next token in the token stream, but do not
472 static inline cp_token
*
473 cp_lexer_peek_token (cp_lexer
*lexer
)
475 if (cp_lexer_debugging_p (lexer
))
477 fputs ("cp_lexer: peeking at token: ", cp_lexer_debug_stream
);
478 cp_lexer_print_token (cp_lexer_debug_stream
, lexer
->next_token
);
479 putc ('\n', cp_lexer_debug_stream
);
481 return lexer
->next_token
;
484 /* Return true if the next token has the indicated TYPE. */
487 cp_lexer_next_token_is (cp_lexer
* lexer
, enum cpp_ttype type
)
489 return cp_lexer_peek_token (lexer
)->type
== type
;
492 /* Return true if the next token does not have the indicated TYPE. */
495 cp_lexer_next_token_is_not (cp_lexer
* lexer
, enum cpp_ttype type
)
497 return !cp_lexer_next_token_is (lexer
, type
);
500 /* Return true if the next token is the indicated KEYWORD. */
503 cp_lexer_next_token_is_keyword (cp_lexer
* lexer
, enum rid keyword
)
505 return cp_lexer_peek_token (lexer
)->keyword
== keyword
;
508 /* Return a pointer to the Nth token in the token stream. If N is 1,
509 then this is precisely equivalent to cp_lexer_peek_token (except
510 that it is not inline). One would like to disallow that case, but
511 there is one case (cp_parser_nth_token_starts_template_id) where
512 the caller passes a variable for N and it might be 1. */
515 cp_lexer_peek_nth_token (cp_lexer
* lexer
, size_t n
)
519 /* N is 1-based, not zero-based. */
522 if (cp_lexer_debugging_p (lexer
))
523 fprintf (cp_lexer_debug_stream
,
524 "cp_lexer: peeking ahead %ld at token: ", (long)n
);
527 token
= lexer
->next_token
;
528 gcc_assert (!n
|| token
!= &eof_token
);
532 if (token
== lexer
->last_token
)
534 token
= (cp_token
*)&eof_token
;
538 if (token
->type
!= CPP_PURGED
)
542 if (cp_lexer_debugging_p (lexer
))
544 cp_lexer_print_token (cp_lexer_debug_stream
, token
);
545 putc ('\n', cp_lexer_debug_stream
);
551 /* Return the next token, and advance the lexer's next_token pointer
552 to point to the next non-purged token. */
555 cp_lexer_consume_token (cp_lexer
* lexer
)
557 cp_token
*token
= lexer
->next_token
;
559 gcc_assert (token
!= &eof_token
);
560 gcc_assert (!lexer
->in_pragma
|| token
->type
!= CPP_PRAGMA_EOL
);
565 if (lexer
->next_token
== lexer
->last_token
)
567 lexer
->next_token
= (cp_token
*)&eof_token
;
572 while (lexer
->next_token
->type
== CPP_PURGED
);
574 cp_lexer_set_source_position_from_token (token
);
576 /* Provide debugging output. */
577 if (cp_lexer_debugging_p (lexer
))
579 fputs ("cp_lexer: consuming token: ", cp_lexer_debug_stream
);
580 cp_lexer_print_token (cp_lexer_debug_stream
, token
);
581 putc ('\n', cp_lexer_debug_stream
);
587 /* Permanently remove the next token from the token stream, and
588 advance the next_token pointer to refer to the next non-purged
592 cp_lexer_purge_token (cp_lexer
*lexer
)
594 cp_token
*tok
= lexer
->next_token
;
596 gcc_assert (tok
!= &eof_token
);
597 tok
->type
= CPP_PURGED
;
598 tok
->location
= UNKNOWN_LOCATION
;
599 tok
->value
= NULL_TREE
;
600 tok
->keyword
= RID_MAX
;
605 if (tok
== lexer
->last_token
)
607 tok
= (cp_token
*)&eof_token
;
611 while (tok
->type
== CPP_PURGED
);
612 lexer
->next_token
= tok
;
615 /* Permanently remove all tokens after TOK, up to, but not
616 including, the token that will be returned next by
617 cp_lexer_peek_token. */
620 cp_lexer_purge_tokens_after (cp_lexer
*lexer
, cp_token
*tok
)
622 cp_token
*peek
= lexer
->next_token
;
624 if (peek
== &eof_token
)
625 peek
= lexer
->last_token
;
627 gcc_assert (tok
< peek
);
629 for ( tok
+= 1; tok
!= peek
; tok
+= 1)
631 tok
->type
= CPP_PURGED
;
632 tok
->location
= UNKNOWN_LOCATION
;
633 tok
->value
= NULL_TREE
;
634 tok
->keyword
= RID_MAX
;
638 /* Begin saving tokens. All tokens consumed after this point will be
642 cp_lexer_save_tokens (cp_lexer
* lexer
)
644 /* Provide debugging output. */
645 if (cp_lexer_debugging_p (lexer
))
646 fprintf (cp_lexer_debug_stream
, "cp_lexer: saving tokens\n");
648 VEC_safe_push (cp_token_position
, heap
,
649 lexer
->saved_tokens
, lexer
->next_token
);
652 /* Commit to the portion of the token stream most recently saved. */
655 cp_lexer_commit_tokens (cp_lexer
* lexer
)
657 /* Provide debugging output. */
658 if (cp_lexer_debugging_p (lexer
))
659 fprintf (cp_lexer_debug_stream
, "cp_lexer: committing tokens\n");
661 VEC_pop (cp_token_position
, lexer
->saved_tokens
);
664 /* Return all tokens saved since the last call to cp_lexer_save_tokens
665 to the token stream. Stop saving tokens. */
668 cp_lexer_rollback_tokens (cp_lexer
* lexer
)
670 /* Provide debugging output. */
671 if (cp_lexer_debugging_p (lexer
))
672 fprintf (cp_lexer_debug_stream
, "cp_lexer: restoring tokens\n");
674 lexer
->next_token
= VEC_pop (cp_token_position
, lexer
->saved_tokens
);
677 /* Print a representation of the TOKEN on the STREAM. */
679 #ifdef ENABLE_CHECKING
682 cp_lexer_print_token (FILE * stream
, cp_token
*token
)
684 /* We don't use cpp_type2name here because the parser defines
685 a few tokens of its own. */
686 static const char *const token_names
[] = {
687 /* cpplib-defined token types */
693 /* C++ parser token types - see "Manifest constants", above. */
696 "NESTED_NAME_SPECIFIER",
700 /* If we have a name for the token, print it out. Otherwise, we
701 simply give the numeric code. */
702 gcc_assert (token
->type
< ARRAY_SIZE(token_names
));
703 fputs (token_names
[token
->type
], stream
);
705 /* For some tokens, print the associated data. */
709 /* Some keywords have a value that is not an IDENTIFIER_NODE.
710 For example, `struct' is mapped to an INTEGER_CST. */
711 if (TREE_CODE (token
->value
) != IDENTIFIER_NODE
)
713 /* else fall through */
715 fputs (IDENTIFIER_POINTER (token
->value
), stream
);
720 fprintf (stream
, " \"%s\"", TREE_STRING_POINTER (token
->value
));
728 /* Start emitting debugging information. */
731 cp_lexer_start_debugging (cp_lexer
* lexer
)
733 lexer
->debugging_p
= true;
736 /* Stop emitting debugging information. */
739 cp_lexer_stop_debugging (cp_lexer
* lexer
)
741 lexer
->debugging_p
= false;
744 #endif /* ENABLE_CHECKING */
746 /* Create a new cp_token_cache, representing a range of tokens. */
748 static cp_token_cache
*
749 cp_token_cache_new (cp_token
*first
, cp_token
*last
)
751 cp_token_cache
*cache
= GGC_NEW (cp_token_cache
);
752 cache
->first
= first
;
758 /* Decl-specifiers. */
760 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
763 clear_decl_specs (cp_decl_specifier_seq
*decl_specs
)
765 memset (decl_specs
, 0, sizeof (cp_decl_specifier_seq
));
770 /* Nothing other than the parser should be creating declarators;
771 declarators are a semi-syntactic representation of C++ entities.
772 Other parts of the front end that need to create entities (like
773 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
775 static cp_declarator
*make_call_declarator
776 (cp_declarator
*, cp_parameter_declarator
*, cp_cv_quals
, tree
);
777 static cp_declarator
*make_array_declarator
778 (cp_declarator
*, tree
);
779 static cp_declarator
*make_pointer_declarator
780 (cp_cv_quals
, cp_declarator
*);
781 static cp_declarator
*make_reference_declarator
782 (cp_cv_quals
, cp_declarator
*);
783 static cp_parameter_declarator
*make_parameter_declarator
784 (cp_decl_specifier_seq
*, cp_declarator
*, tree
);
785 static cp_declarator
*make_ptrmem_declarator
786 (cp_cv_quals
, tree
, cp_declarator
*);
788 /* An erroneous declarator. */
789 static cp_declarator
*cp_error_declarator
;
791 /* The obstack on which declarators and related data structures are
793 static struct obstack declarator_obstack
;
795 /* Alloc BYTES from the declarator memory pool. */
798 alloc_declarator (size_t bytes
)
800 return obstack_alloc (&declarator_obstack
, bytes
);
803 /* Allocate a declarator of the indicated KIND. Clear fields that are
804 common to all declarators. */
806 static cp_declarator
*
807 make_declarator (cp_declarator_kind kind
)
809 cp_declarator
*declarator
;
811 declarator
= (cp_declarator
*) alloc_declarator (sizeof (cp_declarator
));
812 declarator
->kind
= kind
;
813 declarator
->attributes
= NULL_TREE
;
814 declarator
->declarator
= NULL
;
819 /* Make a declarator for a generalized identifier. If
820 QUALIFYING_SCOPE is non-NULL, the identifier is
821 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
822 UNQUALIFIED_NAME. SFK indicates the kind of special function this
825 static cp_declarator
*
826 make_id_declarator (tree qualifying_scope
, tree unqualified_name
,
827 special_function_kind sfk
)
829 cp_declarator
*declarator
;
831 /* It is valid to write:
833 class C { void f(); };
837 The standard is not clear about whether `typedef const C D' is
838 legal; as of 2002-09-15 the committee is considering that
839 question. EDG 3.0 allows that syntax. Therefore, we do as
841 if (qualifying_scope
&& TYPE_P (qualifying_scope
))
842 qualifying_scope
= TYPE_MAIN_VARIANT (qualifying_scope
);
844 gcc_assert (TREE_CODE (unqualified_name
) == IDENTIFIER_NODE
845 || TREE_CODE (unqualified_name
) == BIT_NOT_EXPR
846 || TREE_CODE (unqualified_name
) == TEMPLATE_ID_EXPR
);
848 declarator
= make_declarator (cdk_id
);
849 declarator
->u
.id
.qualifying_scope
= qualifying_scope
;
850 declarator
->u
.id
.unqualified_name
= unqualified_name
;
851 declarator
->u
.id
.sfk
= sfk
;
856 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
857 of modifiers such as const or volatile to apply to the pointer
858 type, represented as identifiers. */
861 make_pointer_declarator (cp_cv_quals cv_qualifiers
, cp_declarator
*target
)
863 cp_declarator
*declarator
;
865 declarator
= make_declarator (cdk_pointer
);
866 declarator
->declarator
= target
;
867 declarator
->u
.pointer
.qualifiers
= cv_qualifiers
;
868 declarator
->u
.pointer
.class_type
= NULL_TREE
;
873 /* Like make_pointer_declarator -- but for references. */
876 make_reference_declarator (cp_cv_quals cv_qualifiers
, cp_declarator
*target
)
878 cp_declarator
*declarator
;
880 declarator
= make_declarator (cdk_reference
);
881 declarator
->declarator
= target
;
882 declarator
->u
.pointer
.qualifiers
= cv_qualifiers
;
883 declarator
->u
.pointer
.class_type
= NULL_TREE
;
888 /* Like make_pointer_declarator -- but for a pointer to a non-static
889 member of CLASS_TYPE. */
892 make_ptrmem_declarator (cp_cv_quals cv_qualifiers
, tree class_type
,
893 cp_declarator
*pointee
)
895 cp_declarator
*declarator
;
897 declarator
= make_declarator (cdk_ptrmem
);
898 declarator
->declarator
= pointee
;
899 declarator
->u
.pointer
.qualifiers
= cv_qualifiers
;
900 declarator
->u
.pointer
.class_type
= class_type
;
905 /* Make a declarator for the function given by TARGET, with the
906 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
907 "const"-qualified member function. The EXCEPTION_SPECIFICATION
908 indicates what exceptions can be thrown. */
911 make_call_declarator (cp_declarator
*target
,
912 cp_parameter_declarator
*parms
,
913 cp_cv_quals cv_qualifiers
,
914 tree exception_specification
)
916 cp_declarator
*declarator
;
918 declarator
= make_declarator (cdk_function
);
919 declarator
->declarator
= target
;
920 declarator
->u
.function
.parameters
= parms
;
921 declarator
->u
.function
.qualifiers
= cv_qualifiers
;
922 declarator
->u
.function
.exception_specification
= exception_specification
;
927 /* Make a declarator for an array of BOUNDS elements, each of which is
928 defined by ELEMENT. */
931 make_array_declarator (cp_declarator
*element
, tree bounds
)
933 cp_declarator
*declarator
;
935 declarator
= make_declarator (cdk_array
);
936 declarator
->declarator
= element
;
937 declarator
->u
.array
.bounds
= bounds
;
942 cp_parameter_declarator
*no_parameters
;
944 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
945 DECLARATOR and DEFAULT_ARGUMENT. */
947 cp_parameter_declarator
*
948 make_parameter_declarator (cp_decl_specifier_seq
*decl_specifiers
,
949 cp_declarator
*declarator
,
950 tree default_argument
)
952 cp_parameter_declarator
*parameter
;
954 parameter
= ((cp_parameter_declarator
*)
955 alloc_declarator (sizeof (cp_parameter_declarator
)));
956 parameter
->next
= NULL
;
958 parameter
->decl_specifiers
= *decl_specifiers
;
960 clear_decl_specs (¶meter
->decl_specifiers
);
961 parameter
->declarator
= declarator
;
962 parameter
->default_argument
= default_argument
;
963 parameter
->ellipsis_p
= false;
973 A cp_parser parses the token stream as specified by the C++
974 grammar. Its job is purely parsing, not semantic analysis. For
975 example, the parser breaks the token stream into declarators,
976 expressions, statements, and other similar syntactic constructs.
977 It does not check that the types of the expressions on either side
978 of an assignment-statement are compatible, or that a function is
979 not declared with a parameter of type `void'.
981 The parser invokes routines elsewhere in the compiler to perform
982 semantic analysis and to build up the abstract syntax tree for the
985 The parser (and the template instantiation code, which is, in a
986 way, a close relative of parsing) are the only parts of the
987 compiler that should be calling push_scope and pop_scope, or
988 related functions. The parser (and template instantiation code)
989 keeps track of what scope is presently active; everything else
990 should simply honor that. (The code that generates static
991 initializers may also need to set the scope, in order to check
992 access control correctly when emitting the initializers.)
997 The parser is of the standard recursive-descent variety. Upcoming
998 tokens in the token stream are examined in order to determine which
999 production to use when parsing a non-terminal. Some C++ constructs
1000 require arbitrary look ahead to disambiguate. For example, it is
1001 impossible, in the general case, to tell whether a statement is an
1002 expression or declaration without scanning the entire statement.
1003 Therefore, the parser is capable of "parsing tentatively." When the
1004 parser is not sure what construct comes next, it enters this mode.
1005 Then, while we attempt to parse the construct, the parser queues up
1006 error messages, rather than issuing them immediately, and saves the
1007 tokens it consumes. If the construct is parsed successfully, the
1008 parser "commits", i.e., it issues any queued error messages and
1009 the tokens that were being preserved are permanently discarded.
1010 If, however, the construct is not parsed successfully, the parser
1011 rolls back its state completely so that it can resume parsing using
1012 a different alternative.
1017 The performance of the parser could probably be improved substantially.
1018 We could often eliminate the need to parse tentatively by looking ahead
1019 a little bit. In some places, this approach might not entirely eliminate
1020 the need to parse tentatively, but it might still speed up the average
1023 /* Flags that are passed to some parsing functions. These values can
1024 be bitwise-ored together. */
1026 typedef enum cp_parser_flags
1029 CP_PARSER_FLAGS_NONE
= 0x0,
1030 /* The construct is optional. If it is not present, then no error
1031 should be issued. */
1032 CP_PARSER_FLAGS_OPTIONAL
= 0x1,
1033 /* When parsing a type-specifier, do not allow user-defined types. */
1034 CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
= 0x2
1037 /* The different kinds of declarators we want to parse. */
1039 typedef enum cp_parser_declarator_kind
1041 /* We want an abstract declarator. */
1042 CP_PARSER_DECLARATOR_ABSTRACT
,
1043 /* We want a named declarator. */
1044 CP_PARSER_DECLARATOR_NAMED
,
1045 /* We don't mind, but the name must be an unqualified-id. */
1046 CP_PARSER_DECLARATOR_EITHER
1047 } cp_parser_declarator_kind
;
1049 /* The precedence values used to parse binary expressions. The minimum value
1050 of PREC must be 1, because zero is reserved to quickly discriminate
1051 binary operators from other tokens. */
1056 PREC_LOGICAL_OR_EXPRESSION
,
1057 PREC_LOGICAL_AND_EXPRESSION
,
1058 PREC_INCLUSIVE_OR_EXPRESSION
,
1059 PREC_EXCLUSIVE_OR_EXPRESSION
,
1060 PREC_AND_EXPRESSION
,
1061 PREC_EQUALITY_EXPRESSION
,
1062 PREC_RELATIONAL_EXPRESSION
,
1063 PREC_SHIFT_EXPRESSION
,
1064 PREC_ADDITIVE_EXPRESSION
,
1065 PREC_MULTIPLICATIVE_EXPRESSION
,
1067 NUM_PREC_VALUES
= PREC_PM_EXPRESSION
1070 /* A mapping from a token type to a corresponding tree node type, with a
1071 precedence value. */
1073 typedef struct cp_parser_binary_operations_map_node
1075 /* The token type. */
1076 enum cpp_ttype token_type
;
1077 /* The corresponding tree code. */
1078 enum tree_code tree_type
;
1079 /* The precedence of this operator. */
1080 enum cp_parser_prec prec
;
1081 } cp_parser_binary_operations_map_node
;
1083 /* The status of a tentative parse. */
1085 typedef enum cp_parser_status_kind
1087 /* No errors have occurred. */
1088 CP_PARSER_STATUS_KIND_NO_ERROR
,
1089 /* An error has occurred. */
1090 CP_PARSER_STATUS_KIND_ERROR
,
1091 /* We are committed to this tentative parse, whether or not an error
1093 CP_PARSER_STATUS_KIND_COMMITTED
1094 } cp_parser_status_kind
;
1096 typedef struct cp_parser_expression_stack_entry
1099 enum tree_code tree_type
;
1101 } cp_parser_expression_stack_entry
;
1103 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1104 entries because precedence levels on the stack are monotonically
1106 typedef struct cp_parser_expression_stack_entry
1107 cp_parser_expression_stack
[NUM_PREC_VALUES
];
1109 /* Context that is saved and restored when parsing tentatively. */
1110 typedef struct cp_parser_context
GTY (())
1112 /* If this is a tentative parsing context, the status of the
1114 enum cp_parser_status_kind status
;
1115 /* If non-NULL, we have just seen a `x->' or `x.' expression. Names
1116 that are looked up in this context must be looked up both in the
1117 scope given by OBJECT_TYPE (the type of `x' or `*x') and also in
1118 the context of the containing expression. */
1121 /* The next parsing context in the stack. */
1122 struct cp_parser_context
*next
;
1123 } cp_parser_context
;
1127 /* Constructors and destructors. */
1129 static cp_parser_context
*cp_parser_context_new
1130 (cp_parser_context
*);
1132 /* Class variables. */
1134 static GTY((deletable
)) cp_parser_context
* cp_parser_context_free_list
;
1136 /* The operator-precedence table used by cp_parser_binary_expression.
1137 Transformed into an associative array (binops_by_token) by
1140 static const cp_parser_binary_operations_map_node binops
[] = {
1141 { CPP_DEREF_STAR
, MEMBER_REF
, PREC_PM_EXPRESSION
},
1142 { CPP_DOT_STAR
, DOTSTAR_EXPR
, PREC_PM_EXPRESSION
},
1144 { CPP_MULT
, MULT_EXPR
, PREC_MULTIPLICATIVE_EXPRESSION
},
1145 { CPP_DIV
, TRUNC_DIV_EXPR
, PREC_MULTIPLICATIVE_EXPRESSION
},
1146 { CPP_MOD
, TRUNC_MOD_EXPR
, PREC_MULTIPLICATIVE_EXPRESSION
},
1148 { CPP_PLUS
, PLUS_EXPR
, PREC_ADDITIVE_EXPRESSION
},
1149 { CPP_MINUS
, MINUS_EXPR
, PREC_ADDITIVE_EXPRESSION
},
1151 { CPP_LSHIFT
, LSHIFT_EXPR
, PREC_SHIFT_EXPRESSION
},
1152 { CPP_RSHIFT
, RSHIFT_EXPR
, PREC_SHIFT_EXPRESSION
},
1154 { CPP_LESS
, LT_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1155 { CPP_GREATER
, GT_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1156 { CPP_LESS_EQ
, LE_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1157 { CPP_GREATER_EQ
, GE_EXPR
, PREC_RELATIONAL_EXPRESSION
},
1159 { CPP_EQ_EQ
, EQ_EXPR
, PREC_EQUALITY_EXPRESSION
},
1160 { CPP_NOT_EQ
, NE_EXPR
, PREC_EQUALITY_EXPRESSION
},
1162 { CPP_AND
, BIT_AND_EXPR
, PREC_AND_EXPRESSION
},
1164 { CPP_XOR
, BIT_XOR_EXPR
, PREC_EXCLUSIVE_OR_EXPRESSION
},
1166 { CPP_OR
, BIT_IOR_EXPR
, PREC_INCLUSIVE_OR_EXPRESSION
},
1168 { CPP_AND_AND
, TRUTH_ANDIF_EXPR
, PREC_LOGICAL_AND_EXPRESSION
},
1170 { CPP_OR_OR
, TRUTH_ORIF_EXPR
, PREC_LOGICAL_OR_EXPRESSION
}
1173 /* The same as binops, but initialized by cp_parser_new so that
1174 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1176 static cp_parser_binary_operations_map_node binops_by_token
[N_CP_TTYPES
];
1178 /* Constructors and destructors. */
1180 /* Construct a new context. The context below this one on the stack
1181 is given by NEXT. */
1183 static cp_parser_context
*
1184 cp_parser_context_new (cp_parser_context
* next
)
1186 cp_parser_context
*context
;
1188 /* Allocate the storage. */
1189 if (cp_parser_context_free_list
!= NULL
)
1191 /* Pull the first entry from the free list. */
1192 context
= cp_parser_context_free_list
;
1193 cp_parser_context_free_list
= context
->next
;
1194 memset (context
, 0, sizeof (*context
));
1197 context
= GGC_CNEW (cp_parser_context
);
1199 /* No errors have occurred yet in this context. */
1200 context
->status
= CP_PARSER_STATUS_KIND_NO_ERROR
;
1201 /* If this is not the bottomost context, copy information that we
1202 need from the previous context. */
1205 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1206 expression, then we are parsing one in this context, too. */
1207 context
->object_type
= next
->object_type
;
1208 /* Thread the stack. */
1209 context
->next
= next
;
1215 /* The cp_parser structure represents the C++ parser. */
1217 typedef struct cp_parser
GTY(())
1219 /* The lexer from which we are obtaining tokens. */
1222 /* The scope in which names should be looked up. If NULL_TREE, then
1223 we look up names in the scope that is currently open in the
1224 source program. If non-NULL, this is either a TYPE or
1225 NAMESPACE_DECL for the scope in which we should look. It can
1226 also be ERROR_MARK, when we've parsed a bogus scope.
1228 This value is not cleared automatically after a name is looked
1229 up, so we must be careful to clear it before starting a new look
1230 up sequence. (If it is not cleared, then `X::Y' followed by `Z'
1231 will look up `Z' in the scope of `X', rather than the current
1232 scope.) Unfortunately, it is difficult to tell when name lookup
1233 is complete, because we sometimes peek at a token, look it up,
1234 and then decide not to consume it. */
1237 /* OBJECT_SCOPE and QUALIFYING_SCOPE give the scopes in which the
1238 last lookup took place. OBJECT_SCOPE is used if an expression
1239 like "x->y" or "x.y" was used; it gives the type of "*x" or "x",
1240 respectively. QUALIFYING_SCOPE is used for an expression of the
1241 form "X::Y"; it refers to X. */
1243 tree qualifying_scope
;
1245 /* A stack of parsing contexts. All but the bottom entry on the
1246 stack will be tentative contexts.
1248 We parse tentatively in order to determine which construct is in
1249 use in some situations. For example, in order to determine
1250 whether a statement is an expression-statement or a
1251 declaration-statement we parse it tentatively as a
1252 declaration-statement. If that fails, we then reparse the same
1253 token stream as an expression-statement. */
1254 cp_parser_context
*context
;
1256 /* True if we are parsing GNU C++. If this flag is not set, then
1257 GNU extensions are not recognized. */
1258 bool allow_gnu_extensions_p
;
1260 /* TRUE if the `>' token should be interpreted as the greater-than
1261 operator. FALSE if it is the end of a template-id or
1262 template-parameter-list. */
1263 bool greater_than_is_operator_p
;
1265 /* TRUE if default arguments are allowed within a parameter list
1266 that starts at this point. FALSE if only a gnu extension makes
1267 them permissible. */
1268 bool default_arg_ok_p
;
1270 /* TRUE if we are parsing an integral constant-expression. See
1271 [expr.const] for a precise definition. */
1272 bool integral_constant_expression_p
;
1274 /* TRUE if we are parsing an integral constant-expression -- but a
1275 non-constant expression should be permitted as well. This flag
1276 is used when parsing an array bound so that GNU variable-length
1277 arrays are tolerated. */
1278 bool allow_non_integral_constant_expression_p
;
1280 /* TRUE if ALLOW_NON_CONSTANT_EXPRESSION_P is TRUE and something has
1281 been seen that makes the expression non-constant. */
1282 bool non_integral_constant_expression_p
;
1284 /* TRUE if local variable names and `this' are forbidden in the
1286 bool local_variables_forbidden_p
;
1288 /* TRUE if the declaration we are parsing is part of a
1289 linkage-specification of the form `extern string-literal
1291 bool in_unbraced_linkage_specification_p
;
1293 /* TRUE if we are presently parsing a declarator, after the
1294 direct-declarator. */
1295 bool in_declarator_p
;
1297 /* TRUE if we are presently parsing a template-argument-list. */
1298 bool in_template_argument_list_p
;
1300 /* Set to IN_ITERATION_STMT if parsing an iteration-statement,
1301 to IN_OMP_BLOCK if parsing OpenMP structured block and
1302 IN_OMP_FOR if parsing OpenMP loop. If parsing a switch statement,
1303 this is bitwise ORed with IN_SWITCH_STMT, unless parsing an
1304 iteration-statement, OpenMP block or loop within that switch. */
1305 #define IN_SWITCH_STMT 1
1306 #define IN_ITERATION_STMT 2
1307 #define IN_OMP_BLOCK 4
1308 #define IN_OMP_FOR 8
1309 unsigned char in_statement
;
1311 /* TRUE if we are presently parsing the body of a switch statement.
1312 Note that this doesn't quite overlap with in_statement above.
1313 The difference relates to giving the right sets of error messages:
1314 "case not in switch" vs "break statement used with OpenMP...". */
1315 bool in_switch_statement_p
;
1317 /* TRUE if we are parsing a type-id in an expression context. In
1318 such a situation, both "type (expr)" and "type (type)" are valid
1320 bool in_type_id_in_expr_p
;
1322 /* TRUE if we are currently in a header file where declarations are
1323 implicitly extern "C". */
1324 bool implicit_extern_c
;
1326 /* TRUE if strings in expressions should be translated to the execution
1328 bool translate_strings_p
;
1330 /* If non-NULL, then we are parsing a construct where new type
1331 definitions are not permitted. The string stored here will be
1332 issued as an error message if a type is defined. */
1333 const char *type_definition_forbidden_message
;
1335 /* A list of lists. The outer list is a stack, used for member
1336 functions of local classes. At each level there are two sub-list,
1337 one on TREE_VALUE and one on TREE_PURPOSE. Each of those
1338 sub-lists has a FUNCTION_DECL or TEMPLATE_DECL on their
1339 TREE_VALUE's. The functions are chained in reverse declaration
1342 The TREE_PURPOSE sublist contains those functions with default
1343 arguments that need post processing, and the TREE_VALUE sublist
1344 contains those functions with definitions that need post
1347 These lists can only be processed once the outermost class being
1348 defined is complete. */
1349 tree unparsed_functions_queues
;
1351 /* The number of classes whose definitions are currently in
1353 unsigned num_classes_being_defined
;
1355 /* The number of template parameter lists that apply directly to the
1356 current declaration. */
1357 unsigned num_template_parameter_lists
;
1362 /* Constructors and destructors. */
1364 static cp_parser
*cp_parser_new
1367 /* Routines to parse various constructs.
1369 Those that return `tree' will return the error_mark_node (rather
1370 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1371 Sometimes, they will return an ordinary node if error-recovery was
1372 attempted, even though a parse error occurred. So, to check
1373 whether or not a parse error occurred, you should always use
1374 cp_parser_error_occurred. If the construct is optional (indicated
1375 either by an `_opt' in the name of the function that does the
1376 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1377 the construct is not present. */
1379 /* Lexical conventions [gram.lex] */
1381 static tree cp_parser_identifier
1383 static tree cp_parser_string_literal
1384 (cp_parser
*, bool, bool);
1386 /* Basic concepts [gram.basic] */
1388 static bool cp_parser_translation_unit
1391 /* Expressions [gram.expr] */
1393 static tree cp_parser_primary_expression
1394 (cp_parser
*, bool, bool, bool, cp_id_kind
*);
1395 static tree cp_parser_id_expression
1396 (cp_parser
*, bool, bool, bool *, bool, bool);
1397 static tree cp_parser_unqualified_id
1398 (cp_parser
*, bool, bool, bool, bool);
1399 static tree cp_parser_nested_name_specifier_opt
1400 (cp_parser
*, bool, bool, bool, bool);
1401 static tree cp_parser_nested_name_specifier
1402 (cp_parser
*, bool, bool, bool, bool);
1403 static tree cp_parser_class_or_namespace_name
1404 (cp_parser
*, bool, bool, bool, bool, bool);
1405 static tree cp_parser_postfix_expression
1406 (cp_parser
*, bool, bool);
1407 static tree cp_parser_postfix_open_square_expression
1408 (cp_parser
*, tree
, bool);
1409 static tree cp_parser_postfix_dot_deref_expression
1410 (cp_parser
*, enum cpp_ttype
, tree
, bool, cp_id_kind
*);
1411 static tree cp_parser_parenthesized_expression_list
1412 (cp_parser
*, bool, bool, bool *);
1413 static void cp_parser_pseudo_destructor_name
1414 (cp_parser
*, tree
*, tree
*);
1415 static tree cp_parser_unary_expression
1416 (cp_parser
*, bool, bool);
1417 static enum tree_code cp_parser_unary_operator
1419 static tree cp_parser_new_expression
1421 static tree cp_parser_new_placement
1423 static tree cp_parser_new_type_id
1424 (cp_parser
*, tree
*);
1425 static cp_declarator
*cp_parser_new_declarator_opt
1427 static cp_declarator
*cp_parser_direct_new_declarator
1429 static tree cp_parser_new_initializer
1431 static tree cp_parser_delete_expression
1433 static tree cp_parser_cast_expression
1434 (cp_parser
*, bool, bool);
1435 static tree cp_parser_binary_expression
1436 (cp_parser
*, bool);
1437 static tree cp_parser_question_colon_clause
1438 (cp_parser
*, tree
);
1439 static tree cp_parser_assignment_expression
1440 (cp_parser
*, bool);
1441 static enum tree_code cp_parser_assignment_operator_opt
1443 static tree cp_parser_expression
1444 (cp_parser
*, bool);
1445 static tree cp_parser_constant_expression
1446 (cp_parser
*, bool, bool *);
1447 static tree cp_parser_builtin_offsetof
1450 /* Statements [gram.stmt.stmt] */
1452 static void cp_parser_statement
1453 (cp_parser
*, tree
, bool);
1454 static void cp_parser_label_for_labeled_statement
1456 static tree cp_parser_expression_statement
1457 (cp_parser
*, tree
);
1458 static tree cp_parser_compound_statement
1459 (cp_parser
*, tree
, bool);
1460 static void cp_parser_statement_seq_opt
1461 (cp_parser
*, tree
);
1462 static tree cp_parser_selection_statement
1464 static tree cp_parser_condition
1466 static tree cp_parser_iteration_statement
1468 static void cp_parser_for_init_statement
1470 static tree cp_parser_jump_statement
1472 static void cp_parser_declaration_statement
1475 static tree cp_parser_implicitly_scoped_statement
1477 static void cp_parser_already_scoped_statement
1480 /* Declarations [gram.dcl.dcl] */
1482 static void cp_parser_declaration_seq_opt
1484 static void cp_parser_declaration
1486 static void cp_parser_block_declaration
1487 (cp_parser
*, bool);
1488 static void cp_parser_simple_declaration
1489 (cp_parser
*, bool);
1490 static void cp_parser_decl_specifier_seq
1491 (cp_parser
*, cp_parser_flags
, cp_decl_specifier_seq
*, int *);
1492 static tree cp_parser_storage_class_specifier_opt
1494 static tree cp_parser_function_specifier_opt
1495 (cp_parser
*, cp_decl_specifier_seq
*);
1496 static tree cp_parser_type_specifier
1497 (cp_parser
*, cp_parser_flags
, cp_decl_specifier_seq
*, bool,
1499 static tree cp_parser_simple_type_specifier
1500 (cp_parser
*, cp_decl_specifier_seq
*, cp_parser_flags
);
1501 static tree cp_parser_type_name
1503 static tree cp_parser_elaborated_type_specifier
1504 (cp_parser
*, bool, bool);
1505 static tree cp_parser_enum_specifier
1507 static void cp_parser_enumerator_list
1508 (cp_parser
*, tree
);
1509 static void cp_parser_enumerator_definition
1510 (cp_parser
*, tree
);
1511 static tree cp_parser_namespace_name
1513 static void cp_parser_namespace_definition
1515 static void cp_parser_namespace_body
1517 static tree cp_parser_qualified_namespace_specifier
1519 static void cp_parser_namespace_alias_definition
1521 static bool cp_parser_using_declaration
1522 (cp_parser
*, bool);
1523 static void cp_parser_using_directive
1525 static void cp_parser_asm_definition
1527 static void cp_parser_linkage_specification
1530 /* Declarators [gram.dcl.decl] */
1532 static tree cp_parser_init_declarator
1533 (cp_parser
*, cp_decl_specifier_seq
*, tree
, bool, bool, int, bool *);
1534 static cp_declarator
*cp_parser_declarator
1535 (cp_parser
*, cp_parser_declarator_kind
, int *, bool *, bool);
1536 static cp_declarator
*cp_parser_direct_declarator
1537 (cp_parser
*, cp_parser_declarator_kind
, int *, bool);
1538 static enum tree_code cp_parser_ptr_operator
1539 (cp_parser
*, tree
*, cp_cv_quals
*);
1540 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
1542 static tree cp_parser_declarator_id
1543 (cp_parser
*, bool);
1544 static tree cp_parser_type_id
1546 static void cp_parser_type_specifier_seq
1547 (cp_parser
*, bool, cp_decl_specifier_seq
*);
1548 static cp_parameter_declarator
*cp_parser_parameter_declaration_clause
1550 static cp_parameter_declarator
*cp_parser_parameter_declaration_list
1551 (cp_parser
*, bool *);
1552 static cp_parameter_declarator
*cp_parser_parameter_declaration
1553 (cp_parser
*, bool, bool *);
1554 static void cp_parser_function_body
1556 static tree cp_parser_initializer
1557 (cp_parser
*, bool *, bool *);
1558 static tree cp_parser_initializer_clause
1559 (cp_parser
*, bool *);
1560 static VEC(constructor_elt
,gc
) *cp_parser_initializer_list
1561 (cp_parser
*, bool *);
1563 static bool cp_parser_ctor_initializer_opt_and_function_body
1566 /* Classes [gram.class] */
1568 static tree cp_parser_class_name
1569 (cp_parser
*, bool, bool, enum tag_types
, bool, bool, bool);
1570 static tree cp_parser_class_specifier
1572 static tree cp_parser_class_head
1573 (cp_parser
*, bool *, tree
*);
1574 static enum tag_types cp_parser_class_key
1576 static void cp_parser_member_specification_opt
1578 static void cp_parser_member_declaration
1580 static tree cp_parser_pure_specifier
1582 static tree cp_parser_constant_initializer
1585 /* Derived classes [gram.class.derived] */
1587 static tree cp_parser_base_clause
1589 static tree cp_parser_base_specifier
1592 /* Special member functions [gram.special] */
1594 static tree cp_parser_conversion_function_id
1596 static tree cp_parser_conversion_type_id
1598 static cp_declarator
*cp_parser_conversion_declarator_opt
1600 static bool cp_parser_ctor_initializer_opt
1602 static void cp_parser_mem_initializer_list
1604 static tree cp_parser_mem_initializer
1606 static tree cp_parser_mem_initializer_id
1609 /* Overloading [gram.over] */
1611 static tree cp_parser_operator_function_id
1613 static tree cp_parser_operator
1616 /* Templates [gram.temp] */
1618 static void cp_parser_template_declaration
1619 (cp_parser
*, bool);
1620 static tree cp_parser_template_parameter_list
1622 static tree cp_parser_template_parameter
1623 (cp_parser
*, bool *);
1624 static tree cp_parser_type_parameter
1626 static tree cp_parser_template_id
1627 (cp_parser
*, bool, bool, bool);
1628 static tree cp_parser_template_name
1629 (cp_parser
*, bool, bool, bool, bool *);
1630 static tree cp_parser_template_argument_list
1632 static tree cp_parser_template_argument
1634 static void cp_parser_explicit_instantiation
1636 static void cp_parser_explicit_specialization
1639 /* Exception handling [gram.exception] */
1641 static tree cp_parser_try_block
1643 static bool cp_parser_function_try_block
1645 static void cp_parser_handler_seq
1647 static void cp_parser_handler
1649 static tree cp_parser_exception_declaration
1651 static tree cp_parser_throw_expression
1653 static tree cp_parser_exception_specification_opt
1655 static tree cp_parser_type_id_list
1658 /* GNU Extensions */
1660 static tree cp_parser_asm_specification_opt
1662 static tree cp_parser_asm_operand_list
1664 static tree cp_parser_asm_clobber_list
1666 static tree cp_parser_attributes_opt
1668 static tree cp_parser_attribute_list
1670 static bool cp_parser_extension_opt
1671 (cp_parser
*, int *);
1672 static void cp_parser_label_declaration
1675 enum pragma_context
{ pragma_external
, pragma_stmt
, pragma_compound
};
1676 static bool cp_parser_pragma
1677 (cp_parser
*, enum pragma_context
);
1679 /* Objective-C++ Productions */
1681 static tree cp_parser_objc_message_receiver
1683 static tree cp_parser_objc_message_args
1685 static tree cp_parser_objc_message_expression
1687 static tree cp_parser_objc_encode_expression
1689 static tree cp_parser_objc_defs_expression
1691 static tree cp_parser_objc_protocol_expression
1693 static tree cp_parser_objc_selector_expression
1695 static tree cp_parser_objc_expression
1697 static bool cp_parser_objc_selector_p
1699 static tree cp_parser_objc_selector
1701 static tree cp_parser_objc_protocol_refs_opt
1703 static void cp_parser_objc_declaration
1705 static tree cp_parser_objc_statement
1708 /* Utility Routines */
1710 static tree cp_parser_lookup_name
1711 (cp_parser
*, tree
, enum tag_types
, bool, bool, bool, tree
*);
1712 static tree cp_parser_lookup_name_simple
1713 (cp_parser
*, tree
);
1714 static tree cp_parser_maybe_treat_template_as_class
1716 static bool cp_parser_check_declarator_template_parameters
1717 (cp_parser
*, cp_declarator
*);
1718 static bool cp_parser_check_template_parameters
1719 (cp_parser
*, unsigned);
1720 static tree cp_parser_simple_cast_expression
1722 static tree cp_parser_global_scope_opt
1723 (cp_parser
*, bool);
1724 static bool cp_parser_constructor_declarator_p
1725 (cp_parser
*, bool);
1726 static tree cp_parser_function_definition_from_specifiers_and_declarator
1727 (cp_parser
*, cp_decl_specifier_seq
*, tree
, const cp_declarator
*);
1728 static tree cp_parser_function_definition_after_declarator
1729 (cp_parser
*, bool);
1730 static void cp_parser_template_declaration_after_export
1731 (cp_parser
*, bool);
1732 static void cp_parser_perform_template_parameter_access_checks
1734 static tree cp_parser_single_declaration
1735 (cp_parser
*, tree
, bool, bool *);
1736 static tree cp_parser_functional_cast
1737 (cp_parser
*, tree
);
1738 static tree cp_parser_save_member_function_body
1739 (cp_parser
*, cp_decl_specifier_seq
*, cp_declarator
*, tree
);
1740 static tree cp_parser_enclosed_template_argument_list
1742 static void cp_parser_save_default_args
1743 (cp_parser
*, tree
);
1744 static void cp_parser_late_parsing_for_member
1745 (cp_parser
*, tree
);
1746 static void cp_parser_late_parsing_default_args
1747 (cp_parser
*, tree
);
1748 static tree cp_parser_sizeof_operand
1749 (cp_parser
*, enum rid
);
1750 static bool cp_parser_declares_only_class_p
1752 static void cp_parser_set_storage_class
1753 (cp_parser
*, cp_decl_specifier_seq
*, enum rid
);
1754 static void cp_parser_set_decl_spec_type
1755 (cp_decl_specifier_seq
*, tree
, bool);
1756 static bool cp_parser_friend_p
1757 (const cp_decl_specifier_seq
*);
1758 static cp_token
*cp_parser_require
1759 (cp_parser
*, enum cpp_ttype
, const char *);
1760 static cp_token
*cp_parser_require_keyword
1761 (cp_parser
*, enum rid
, const char *);
1762 static bool cp_parser_token_starts_function_definition_p
1764 static bool cp_parser_next_token_starts_class_definition_p
1766 static bool cp_parser_next_token_ends_template_argument_p
1768 static bool cp_parser_nth_token_starts_template_argument_list_p
1769 (cp_parser
*, size_t);
1770 static enum tag_types cp_parser_token_is_class_key
1772 static void cp_parser_check_class_key
1773 (enum tag_types
, tree type
);
1774 static void cp_parser_check_access_in_redeclaration
1776 static bool cp_parser_optional_template_keyword
1778 static void cp_parser_pre_parsed_nested_name_specifier
1780 static void cp_parser_cache_group
1781 (cp_parser
*, enum cpp_ttype
, unsigned);
1782 static void cp_parser_parse_tentatively
1784 static void cp_parser_commit_to_tentative_parse
1786 static void cp_parser_abort_tentative_parse
1788 static bool cp_parser_parse_definitely
1790 static inline bool cp_parser_parsing_tentatively
1792 static bool cp_parser_uncommitted_to_tentative_parse_p
1794 static void cp_parser_error
1795 (cp_parser
*, const char *);
1796 static void cp_parser_name_lookup_error
1797 (cp_parser
*, tree
, tree
, const char *);
1798 static bool cp_parser_simulate_error
1800 static void cp_parser_check_type_definition
1802 static void cp_parser_check_for_definition_in_return_type
1803 (cp_declarator
*, tree
);
1804 static void cp_parser_check_for_invalid_template_id
1805 (cp_parser
*, tree
);
1806 static bool cp_parser_non_integral_constant_expression
1807 (cp_parser
*, const char *);
1808 static void cp_parser_diagnose_invalid_type_name
1809 (cp_parser
*, tree
, tree
);
1810 static bool cp_parser_parse_and_diagnose_invalid_type_name
1812 static int cp_parser_skip_to_closing_parenthesis
1813 (cp_parser
*, bool, bool, bool);
1814 static void cp_parser_skip_to_end_of_statement
1816 static void cp_parser_consume_semicolon_at_end_of_statement
1818 static void cp_parser_skip_to_end_of_block_or_statement
1820 static void cp_parser_skip_to_closing_brace
1822 static void cp_parser_skip_to_end_of_template_parameter_list
1824 static void cp_parser_skip_to_pragma_eol
1825 (cp_parser
*, cp_token
*);
1826 static bool cp_parser_error_occurred
1828 static bool cp_parser_allow_gnu_extensions_p
1830 static bool cp_parser_is_string_literal
1832 static bool cp_parser_is_keyword
1833 (cp_token
*, enum rid
);
1834 static tree cp_parser_make_typename_type
1835 (cp_parser
*, tree
, tree
);
1837 /* Returns nonzero if we are parsing tentatively. */
1840 cp_parser_parsing_tentatively (cp_parser
* parser
)
1842 return parser
->context
->next
!= NULL
;
1845 /* Returns nonzero if TOKEN is a string literal. */
1848 cp_parser_is_string_literal (cp_token
* token
)
1850 return (token
->type
== CPP_STRING
|| token
->type
== CPP_WSTRING
);
1853 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
1856 cp_parser_is_keyword (cp_token
* token
, enum rid keyword
)
1858 return token
->keyword
== keyword
;
1861 /* If not parsing tentatively, issue a diagnostic of the form
1862 FILE:LINE: MESSAGE before TOKEN
1863 where TOKEN is the next token in the input stream. MESSAGE
1864 (specified by the caller) is usually of the form "expected
1868 cp_parser_error (cp_parser
* parser
, const char* message
)
1870 if (!cp_parser_simulate_error (parser
))
1872 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
1873 /* This diagnostic makes more sense if it is tagged to the line
1874 of the token we just peeked at. */
1875 cp_lexer_set_source_position_from_token (token
);
1877 if (token
->type
== CPP_PRAGMA
)
1879 error ("%<#pragma%> is not allowed here");
1880 cp_parser_skip_to_pragma_eol (parser
, token
);
1884 c_parse_error (message
,
1885 /* Because c_parser_error does not understand
1886 CPP_KEYWORD, keywords are treated like
1888 (token
->type
== CPP_KEYWORD
? CPP_NAME
: token
->type
),
1893 /* Issue an error about name-lookup failing. NAME is the
1894 IDENTIFIER_NODE DECL is the result of
1895 the lookup (as returned from cp_parser_lookup_name). DESIRED is
1896 the thing that we hoped to find. */
1899 cp_parser_name_lookup_error (cp_parser
* parser
,
1902 const char* desired
)
1904 /* If name lookup completely failed, tell the user that NAME was not
1906 if (decl
== error_mark_node
)
1908 if (parser
->scope
&& parser
->scope
!= global_namespace
)
1909 error ("%<%D::%D%> has not been declared",
1910 parser
->scope
, name
);
1911 else if (parser
->scope
== global_namespace
)
1912 error ("%<::%D%> has not been declared", name
);
1913 else if (parser
->object_scope
1914 && !CLASS_TYPE_P (parser
->object_scope
))
1915 error ("request for member %qD in non-class type %qT",
1916 name
, parser
->object_scope
);
1917 else if (parser
->object_scope
)
1918 error ("%<%T::%D%> has not been declared",
1919 parser
->object_scope
, name
);
1921 error ("%qD has not been declared", name
);
1923 else if (parser
->scope
&& parser
->scope
!= global_namespace
)
1924 error ("%<%D::%D%> %s", parser
->scope
, name
, desired
);
1925 else if (parser
->scope
== global_namespace
)
1926 error ("%<::%D%> %s", name
, desired
);
1928 error ("%qD %s", name
, desired
);
1931 /* If we are parsing tentatively, remember that an error has occurred
1932 during this tentative parse. Returns true if the error was
1933 simulated; false if a message should be issued by the caller. */
1936 cp_parser_simulate_error (cp_parser
* parser
)
1938 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
1940 parser
->context
->status
= CP_PARSER_STATUS_KIND_ERROR
;
1946 /* Check for repeated decl-specifiers. */
1949 cp_parser_check_decl_spec (cp_decl_specifier_seq
*decl_specs
)
1953 for (ds
= ds_first
; ds
!= ds_last
; ++ds
)
1955 unsigned count
= decl_specs
->specs
[(int)ds
];
1958 /* The "long" specifier is a special case because of "long long". */
1962 error ("%<long long long%> is too long for GCC");
1963 else if (pedantic
&& !in_system_header
&& warn_long_long
)
1964 pedwarn ("ISO C++ does not support %<long long%>");
1968 static const char *const decl_spec_names
[] = {
1984 error ("duplicate %qs", decl_spec_names
[(int)ds
]);
1989 /* This function is called when a type is defined. If type
1990 definitions are forbidden at this point, an error message is
1994 cp_parser_check_type_definition (cp_parser
* parser
)
1996 /* If types are forbidden here, issue a message. */
1997 if (parser
->type_definition_forbidden_message
)
1998 /* Use `%s' to print the string in case there are any escape
1999 characters in the message. */
2000 error ("%s", parser
->type_definition_forbidden_message
);
2003 /* This function is called when the DECLARATOR is processed. The TYPE
2004 was a type defined in the decl-specifiers. If it is invalid to
2005 define a type in the decl-specifiers for DECLARATOR, an error is
2009 cp_parser_check_for_definition_in_return_type (cp_declarator
*declarator
,
2012 /* [dcl.fct] forbids type definitions in return types.
2013 Unfortunately, it's not easy to know whether or not we are
2014 processing a return type until after the fact. */
2016 && (declarator
->kind
== cdk_pointer
2017 || declarator
->kind
== cdk_reference
2018 || declarator
->kind
== cdk_ptrmem
))
2019 declarator
= declarator
->declarator
;
2021 && declarator
->kind
== cdk_function
)
2023 error ("new types may not be defined in a return type");
2024 inform ("(perhaps a semicolon is missing after the definition of %qT)",
2029 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2030 "<" in any valid C++ program. If the next token is indeed "<",
2031 issue a message warning the user about what appears to be an
2032 invalid attempt to form a template-id. */
2035 cp_parser_check_for_invalid_template_id (cp_parser
* parser
,
2038 cp_token_position start
= 0;
2040 if (cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
2043 error ("%qT is not a template", type
);
2044 else if (TREE_CODE (type
) == IDENTIFIER_NODE
)
2045 error ("%qE is not a template", type
);
2047 error ("invalid template-id");
2048 /* Remember the location of the invalid "<". */
2049 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
2050 start
= cp_lexer_token_position (parser
->lexer
, true);
2051 /* Consume the "<". */
2052 cp_lexer_consume_token (parser
->lexer
);
2053 /* Parse the template arguments. */
2054 cp_parser_enclosed_template_argument_list (parser
);
2055 /* Permanently remove the invalid template arguments so that
2056 this error message is not issued again. */
2058 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
2062 /* If parsing an integral constant-expression, issue an error message
2063 about the fact that THING appeared and return true. Otherwise,
2064 return false. In either case, set
2065 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2068 cp_parser_non_integral_constant_expression (cp_parser
*parser
,
2071 parser
->non_integral_constant_expression_p
= true;
2072 if (parser
->integral_constant_expression_p
)
2074 if (!parser
->allow_non_integral_constant_expression_p
)
2076 error ("%s cannot appear in a constant-expression", thing
);
2083 /* Emit a diagnostic for an invalid type name. SCOPE is the
2084 qualifying scope (or NULL, if none) for ID. This function commits
2085 to the current active tentative parse, if any. (Otherwise, the
2086 problematic construct might be encountered again later, resulting
2087 in duplicate error messages.) */
2090 cp_parser_diagnose_invalid_type_name (cp_parser
*parser
, tree scope
, tree id
)
2092 tree decl
, old_scope
;
2093 /* Try to lookup the identifier. */
2094 old_scope
= parser
->scope
;
2095 parser
->scope
= scope
;
2096 decl
= cp_parser_lookup_name_simple (parser
, id
);
2097 parser
->scope
= old_scope
;
2098 /* If the lookup found a template-name, it means that the user forgot
2099 to specify an argument list. Emit a useful error message. */
2100 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2101 error ("invalid use of template-name %qE without an argument list", decl
);
2102 else if (TREE_CODE (id
) == BIT_NOT_EXPR
)
2103 error ("invalid use of destructor %qD as a type", id
);
2104 else if (TREE_CODE (decl
) == TYPE_DECL
)
2105 /* Something like 'unsigned A a;' */
2106 error ("invalid combination of multiple type-specifiers");
2107 else if (!parser
->scope
)
2109 /* Issue an error message. */
2110 error ("%qE does not name a type", id
);
2111 /* If we're in a template class, it's possible that the user was
2112 referring to a type from a base class. For example:
2114 template <typename T> struct A { typedef T X; };
2115 template <typename T> struct B : public A<T> { X x; };
2117 The user should have said "typename A<T>::X". */
2118 if (processing_template_decl
&& current_class_type
2119 && TYPE_BINFO (current_class_type
))
2123 for (b
= TREE_CHAIN (TYPE_BINFO (current_class_type
));
2127 tree base_type
= BINFO_TYPE (b
);
2128 if (CLASS_TYPE_P (base_type
)
2129 && dependent_type_p (base_type
))
2132 /* Go from a particular instantiation of the
2133 template (which will have an empty TYPE_FIELDs),
2134 to the main version. */
2135 base_type
= CLASSTYPE_PRIMARY_TEMPLATE_TYPE (base_type
);
2136 for (field
= TYPE_FIELDS (base_type
);
2138 field
= TREE_CHAIN (field
))
2139 if (TREE_CODE (field
) == TYPE_DECL
2140 && DECL_NAME (field
) == id
)
2142 inform ("(perhaps %<typename %T::%E%> was intended)",
2143 BINFO_TYPE (b
), id
);
2152 /* Here we diagnose qualified-ids where the scope is actually correct,
2153 but the identifier does not resolve to a valid type name. */
2154 else if (parser
->scope
!= error_mark_node
)
2156 if (TREE_CODE (parser
->scope
) == NAMESPACE_DECL
)
2157 error ("%qE in namespace %qE does not name a type",
2159 else if (TYPE_P (parser
->scope
))
2160 error ("%qE in class %qT does not name a type", id
, parser
->scope
);
2164 cp_parser_commit_to_tentative_parse (parser
);
2167 /* Check for a common situation where a type-name should be present,
2168 but is not, and issue a sensible error message. Returns true if an
2169 invalid type-name was detected.
2171 The situation handled by this function are variable declarations of the
2172 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2173 Usually, `ID' should name a type, but if we got here it means that it
2174 does not. We try to emit the best possible error message depending on
2175 how exactly the id-expression looks like. */
2178 cp_parser_parse_and_diagnose_invalid_type_name (cp_parser
*parser
)
2182 cp_parser_parse_tentatively (parser
);
2183 id
= cp_parser_id_expression (parser
,
2184 /*template_keyword_p=*/false,
2185 /*check_dependency_p=*/true,
2186 /*template_p=*/NULL
,
2187 /*declarator_p=*/true,
2188 /*optional_p=*/false);
2189 /* After the id-expression, there should be a plain identifier,
2190 otherwise this is not a simple variable declaration. Also, if
2191 the scope is dependent, we cannot do much. */
2192 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
)
2193 || (parser
->scope
&& TYPE_P (parser
->scope
)
2194 && dependent_type_p (parser
->scope
)))
2196 cp_parser_abort_tentative_parse (parser
);
2199 if (!cp_parser_parse_definitely (parser
) || TREE_CODE (id
) == TYPE_DECL
)
2202 /* Emit a diagnostic for the invalid type. */
2203 cp_parser_diagnose_invalid_type_name (parser
, parser
->scope
, id
);
2204 /* Skip to the end of the declaration; there's no point in
2205 trying to process it. */
2206 cp_parser_skip_to_end_of_block_or_statement (parser
);
2210 /* Consume tokens up to, and including, the next non-nested closing `)'.
2211 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2212 are doing error recovery. Returns -1 if OR_COMMA is true and we
2213 found an unnested comma. */
2216 cp_parser_skip_to_closing_parenthesis (cp_parser
*parser
,
2221 unsigned paren_depth
= 0;
2222 unsigned brace_depth
= 0;
2224 if (recovering
&& !or_comma
2225 && cp_parser_uncommitted_to_tentative_parse_p (parser
))
2230 cp_token
* token
= cp_lexer_peek_token (parser
->lexer
);
2232 switch (token
->type
)
2235 case CPP_PRAGMA_EOL
:
2236 /* If we've run out of tokens, then there is no closing `)'. */
2240 /* This matches the processing in skip_to_end_of_statement. */
2245 case CPP_OPEN_BRACE
:
2248 case CPP_CLOSE_BRACE
:
2254 if (recovering
&& or_comma
&& !brace_depth
&& !paren_depth
)
2258 case CPP_OPEN_PAREN
:
2263 case CPP_CLOSE_PAREN
:
2264 if (!brace_depth
&& !paren_depth
--)
2267 cp_lexer_consume_token (parser
->lexer
);
2276 /* Consume the token. */
2277 cp_lexer_consume_token (parser
->lexer
);
2281 /* Consume tokens until we reach the end of the current statement.
2282 Normally, that will be just before consuming a `;'. However, if a
2283 non-nested `}' comes first, then we stop before consuming that. */
2286 cp_parser_skip_to_end_of_statement (cp_parser
* parser
)
2288 unsigned nesting_depth
= 0;
2292 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
2294 switch (token
->type
)
2297 case CPP_PRAGMA_EOL
:
2298 /* If we've run out of tokens, stop. */
2302 /* If the next token is a `;', we have reached the end of the
2308 case CPP_CLOSE_BRACE
:
2309 /* If this is a non-nested '}', stop before consuming it.
2310 That way, when confronted with something like:
2314 we stop before consuming the closing '}', even though we
2315 have not yet reached a `;'. */
2316 if (nesting_depth
== 0)
2319 /* If it is the closing '}' for a block that we have
2320 scanned, stop -- but only after consuming the token.
2326 we will stop after the body of the erroneously declared
2327 function, but before consuming the following `typedef'
2329 if (--nesting_depth
== 0)
2331 cp_lexer_consume_token (parser
->lexer
);
2335 case CPP_OPEN_BRACE
:
2343 /* Consume the token. */
2344 cp_lexer_consume_token (parser
->lexer
);
2348 /* This function is called at the end of a statement or declaration.
2349 If the next token is a semicolon, it is consumed; otherwise, error
2350 recovery is attempted. */
2353 cp_parser_consume_semicolon_at_end_of_statement (cp_parser
*parser
)
2355 /* Look for the trailing `;'. */
2356 if (!cp_parser_require (parser
, CPP_SEMICOLON
, "`;'"))
2358 /* If there is additional (erroneous) input, skip to the end of
2360 cp_parser_skip_to_end_of_statement (parser
);
2361 /* If the next token is now a `;', consume it. */
2362 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
2363 cp_lexer_consume_token (parser
->lexer
);
2367 /* Skip tokens until we have consumed an entire block, or until we
2368 have consumed a non-nested `;'. */
2371 cp_parser_skip_to_end_of_block_or_statement (cp_parser
* parser
)
2373 int nesting_depth
= 0;
2375 while (nesting_depth
>= 0)
2377 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
2379 switch (token
->type
)
2382 case CPP_PRAGMA_EOL
:
2383 /* If we've run out of tokens, stop. */
2387 /* Stop if this is an unnested ';'. */
2392 case CPP_CLOSE_BRACE
:
2393 /* Stop if this is an unnested '}', or closes the outermost
2400 case CPP_OPEN_BRACE
:
2409 /* Consume the token. */
2410 cp_lexer_consume_token (parser
->lexer
);
2414 /* Skip tokens until a non-nested closing curly brace is the next
2418 cp_parser_skip_to_closing_brace (cp_parser
*parser
)
2420 unsigned nesting_depth
= 0;
2424 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
2426 switch (token
->type
)
2429 case CPP_PRAGMA_EOL
:
2430 /* If we've run out of tokens, stop. */
2433 case CPP_CLOSE_BRACE
:
2434 /* If the next token is a non-nested `}', then we have reached
2435 the end of the current block. */
2436 if (nesting_depth
-- == 0)
2440 case CPP_OPEN_BRACE
:
2441 /* If it the next token is a `{', then we are entering a new
2442 block. Consume the entire block. */
2450 /* Consume the token. */
2451 cp_lexer_consume_token (parser
->lexer
);
2455 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
2456 parameter is the PRAGMA token, allowing us to purge the entire pragma
2460 cp_parser_skip_to_pragma_eol (cp_parser
* parser
, cp_token
*pragma_tok
)
2464 parser
->lexer
->in_pragma
= false;
2467 token
= cp_lexer_consume_token (parser
->lexer
);
2468 while (token
->type
!= CPP_PRAGMA_EOL
&& token
->type
!= CPP_EOF
);
2470 /* Ensure that the pragma is not parsed again. */
2471 cp_lexer_purge_tokens_after (parser
->lexer
, pragma_tok
);
2474 /* Require pragma end of line, resyncing with it as necessary. The
2475 arguments are as for cp_parser_skip_to_pragma_eol. */
2478 cp_parser_require_pragma_eol (cp_parser
*parser
, cp_token
*pragma_tok
)
2480 parser
->lexer
->in_pragma
= false;
2481 if (!cp_parser_require (parser
, CPP_PRAGMA_EOL
, "end of line"))
2482 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
2485 /* This is a simple wrapper around make_typename_type. When the id is
2486 an unresolved identifier node, we can provide a superior diagnostic
2487 using cp_parser_diagnose_invalid_type_name. */
2490 cp_parser_make_typename_type (cp_parser
*parser
, tree scope
, tree id
)
2493 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
2495 result
= make_typename_type (scope
, id
, typename_type
,
2496 /*complain=*/tf_none
);
2497 if (result
== error_mark_node
)
2498 cp_parser_diagnose_invalid_type_name (parser
, scope
, id
);
2501 return make_typename_type (scope
, id
, typename_type
, tf_error
);
2505 /* Create a new C++ parser. */
2508 cp_parser_new (void)
2514 /* cp_lexer_new_main is called before calling ggc_alloc because
2515 cp_lexer_new_main might load a PCH file. */
2516 lexer
= cp_lexer_new_main ();
2518 /* Initialize the binops_by_token so that we can get the tree
2519 directly from the token. */
2520 for (i
= 0; i
< sizeof (binops
) / sizeof (binops
[0]); i
++)
2521 binops_by_token
[binops
[i
].token_type
] = binops
[i
];
2523 parser
= GGC_CNEW (cp_parser
);
2524 parser
->lexer
= lexer
;
2525 parser
->context
= cp_parser_context_new (NULL
);
2527 /* For now, we always accept GNU extensions. */
2528 parser
->allow_gnu_extensions_p
= 1;
2530 /* The `>' token is a greater-than operator, not the end of a
2532 parser
->greater_than_is_operator_p
= true;
2534 parser
->default_arg_ok_p
= true;
2536 /* We are not parsing a constant-expression. */
2537 parser
->integral_constant_expression_p
= false;
2538 parser
->allow_non_integral_constant_expression_p
= false;
2539 parser
->non_integral_constant_expression_p
= false;
2541 /* Local variable names are not forbidden. */
2542 parser
->local_variables_forbidden_p
= false;
2544 /* We are not processing an `extern "C"' declaration. */
2545 parser
->in_unbraced_linkage_specification_p
= false;
2547 /* We are not processing a declarator. */
2548 parser
->in_declarator_p
= false;
2550 /* We are not processing a template-argument-list. */
2551 parser
->in_template_argument_list_p
= false;
2553 /* We are not in an iteration statement. */
2554 parser
->in_statement
= 0;
2556 /* We are not in a switch statement. */
2557 parser
->in_switch_statement_p
= false;
2559 /* We are not parsing a type-id inside an expression. */
2560 parser
->in_type_id_in_expr_p
= false;
2562 /* Declarations aren't implicitly extern "C". */
2563 parser
->implicit_extern_c
= false;
2565 /* String literals should be translated to the execution character set. */
2566 parser
->translate_strings_p
= true;
2568 /* The unparsed function queue is empty. */
2569 parser
->unparsed_functions_queues
= build_tree_list (NULL_TREE
, NULL_TREE
);
2571 /* There are no classes being defined. */
2572 parser
->num_classes_being_defined
= 0;
2574 /* No template parameters apply. */
2575 parser
->num_template_parameter_lists
= 0;
2580 /* Create a cp_lexer structure which will emit the tokens in CACHE
2581 and push it onto the parser's lexer stack. This is used for delayed
2582 parsing of in-class method bodies and default arguments, and should
2583 not be confused with tentative parsing. */
2585 cp_parser_push_lexer_for_tokens (cp_parser
*parser
, cp_token_cache
*cache
)
2587 cp_lexer
*lexer
= cp_lexer_new_from_tokens (cache
);
2588 lexer
->next
= parser
->lexer
;
2589 parser
->lexer
= lexer
;
2591 /* Move the current source position to that of the first token in the
2593 cp_lexer_set_source_position_from_token (lexer
->next_token
);
2596 /* Pop the top lexer off the parser stack. This is never used for the
2597 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
2599 cp_parser_pop_lexer (cp_parser
*parser
)
2601 cp_lexer
*lexer
= parser
->lexer
;
2602 parser
->lexer
= lexer
->next
;
2603 cp_lexer_destroy (lexer
);
2605 /* Put the current source position back where it was before this
2606 lexer was pushed. */
2607 cp_lexer_set_source_position_from_token (parser
->lexer
->next_token
);
2610 /* Lexical conventions [gram.lex] */
2612 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
2616 cp_parser_identifier (cp_parser
* parser
)
2620 /* Look for the identifier. */
2621 token
= cp_parser_require (parser
, CPP_NAME
, "identifier");
2622 /* Return the value. */
2623 return token
? token
->value
: error_mark_node
;
2626 /* Parse a sequence of adjacent string constants. Returns a
2627 TREE_STRING representing the combined, nul-terminated string
2628 constant. If TRANSLATE is true, translate the string to the
2629 execution character set. If WIDE_OK is true, a wide string is
2632 C++98 [lex.string] says that if a narrow string literal token is
2633 adjacent to a wide string literal token, the behavior is undefined.
2634 However, C99 6.4.5p4 says that this results in a wide string literal.
2635 We follow C99 here, for consistency with the C front end.
2637 This code is largely lifted from lex_string() in c-lex.c.
2639 FUTURE: ObjC++ will need to handle @-strings here. */
2641 cp_parser_string_literal (cp_parser
*parser
, bool translate
, bool wide_ok
)
2646 struct obstack str_ob
;
2647 cpp_string str
, istr
, *strs
;
2650 tok
= cp_lexer_peek_token (parser
->lexer
);
2651 if (!cp_parser_is_string_literal (tok
))
2653 cp_parser_error (parser
, "expected string-literal");
2654 return error_mark_node
;
2657 /* Try to avoid the overhead of creating and destroying an obstack
2658 for the common case of just one string. */
2659 if (!cp_parser_is_string_literal
2660 (cp_lexer_peek_nth_token (parser
->lexer
, 2)))
2662 cp_lexer_consume_token (parser
->lexer
);
2664 str
.text
= (const unsigned char *)TREE_STRING_POINTER (tok
->value
);
2665 str
.len
= TREE_STRING_LENGTH (tok
->value
);
2667 if (tok
->type
== CPP_WSTRING
)
2674 gcc_obstack_init (&str_ob
);
2679 cp_lexer_consume_token (parser
->lexer
);
2681 str
.text
= (unsigned char *)TREE_STRING_POINTER (tok
->value
);
2682 str
.len
= TREE_STRING_LENGTH (tok
->value
);
2683 if (tok
->type
== CPP_WSTRING
)
2686 obstack_grow (&str_ob
, &str
, sizeof (cpp_string
));
2688 tok
= cp_lexer_peek_token (parser
->lexer
);
2690 while (cp_parser_is_string_literal (tok
));
2692 strs
= (cpp_string
*) obstack_finish (&str_ob
);
2695 if (wide
&& !wide_ok
)
2697 cp_parser_error (parser
, "a wide string is invalid in this context");
2701 if ((translate
? cpp_interpret_string
: cpp_interpret_string_notranslate
)
2702 (parse_in
, strs
, count
, &istr
, wide
))
2704 value
= build_string (istr
.len
, (char *)istr
.text
);
2705 free ((void *)istr
.text
);
2707 TREE_TYPE (value
) = wide
? wchar_array_type_node
: char_array_type_node
;
2708 value
= fix_string_type (value
);
2711 /* cpp_interpret_string has issued an error. */
2712 value
= error_mark_node
;
2715 obstack_free (&str_ob
, 0);
2721 /* Basic concepts [gram.basic] */
2723 /* Parse a translation-unit.
2726 declaration-seq [opt]
2728 Returns TRUE if all went well. */
2731 cp_parser_translation_unit (cp_parser
* parser
)
2733 /* The address of the first non-permanent object on the declarator
2735 static void *declarator_obstack_base
;
2739 /* Create the declarator obstack, if necessary. */
2740 if (!cp_error_declarator
)
2742 gcc_obstack_init (&declarator_obstack
);
2743 /* Create the error declarator. */
2744 cp_error_declarator
= make_declarator (cdk_error
);
2745 /* Create the empty parameter list. */
2746 no_parameters
= make_parameter_declarator (NULL
, NULL
, NULL_TREE
);
2747 /* Remember where the base of the declarator obstack lies. */
2748 declarator_obstack_base
= obstack_next_free (&declarator_obstack
);
2751 cp_parser_declaration_seq_opt (parser
);
2753 /* If there are no tokens left then all went well. */
2754 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
2756 /* Get rid of the token array; we don't need it any more. */
2757 cp_lexer_destroy (parser
->lexer
);
2758 parser
->lexer
= NULL
;
2760 /* This file might have been a context that's implicitly extern
2761 "C". If so, pop the lang context. (Only relevant for PCH.) */
2762 if (parser
->implicit_extern_c
)
2764 pop_lang_context ();
2765 parser
->implicit_extern_c
= false;
2769 finish_translation_unit ();
2775 cp_parser_error (parser
, "expected declaration");
2779 /* Make sure the declarator obstack was fully cleaned up. */
2780 gcc_assert (obstack_next_free (&declarator_obstack
)
2781 == declarator_obstack_base
);
2783 /* All went well. */
2787 /* Expressions [gram.expr] */
2789 /* Parse a primary-expression.
2800 ( compound-statement )
2801 __builtin_va_arg ( assignment-expression , type-id )
2802 __builtin_offsetof ( type-id , offsetof-expression )
2804 Objective-C++ Extension:
2812 ADDRESS_P is true iff this expression was immediately preceded by
2813 "&" and therefore might denote a pointer-to-member. CAST_P is true
2814 iff this expression is the target of a cast. TEMPLATE_ARG_P is
2815 true iff this expression is a template argument.
2817 Returns a representation of the expression. Upon return, *IDK
2818 indicates what kind of id-expression (if any) was present. */
2821 cp_parser_primary_expression (cp_parser
*parser
,
2824 bool template_arg_p
,
2829 /* Assume the primary expression is not an id-expression. */
2830 *idk
= CP_ID_KIND_NONE
;
2832 /* Peek at the next token. */
2833 token
= cp_lexer_peek_token (parser
->lexer
);
2834 switch (token
->type
)
2845 token
= cp_lexer_consume_token (parser
->lexer
);
2846 /* Floating-point literals are only allowed in an integral
2847 constant expression if they are cast to an integral or
2848 enumeration type. */
2849 if (TREE_CODE (token
->value
) == REAL_CST
2850 && parser
->integral_constant_expression_p
2853 /* CAST_P will be set even in invalid code like "int(2.7 +
2854 ...)". Therefore, we have to check that the next token
2855 is sure to end the cast. */
2858 cp_token
*next_token
;
2860 next_token
= cp_lexer_peek_token (parser
->lexer
);
2861 if (/* The comma at the end of an
2862 enumerator-definition. */
2863 next_token
->type
!= CPP_COMMA
2864 /* The curly brace at the end of an enum-specifier. */
2865 && next_token
->type
!= CPP_CLOSE_BRACE
2866 /* The end of a statement. */
2867 && next_token
->type
!= CPP_SEMICOLON
2868 /* The end of the cast-expression. */
2869 && next_token
->type
!= CPP_CLOSE_PAREN
2870 /* The end of an array bound. */
2871 && next_token
->type
!= CPP_CLOSE_SQUARE
2872 /* The closing ">" in a template-argument-list. */
2873 && (next_token
->type
!= CPP_GREATER
2874 || parser
->greater_than_is_operator_p
))
2878 /* If we are within a cast, then the constraint that the
2879 cast is to an integral or enumeration type will be
2880 checked at that point. If we are not within a cast, then
2881 this code is invalid. */
2883 cp_parser_non_integral_constant_expression
2884 (parser
, "floating-point literal");
2886 return token
->value
;
2890 /* ??? Should wide strings be allowed when parser->translate_strings_p
2891 is false (i.e. in attributes)? If not, we can kill the third
2892 argument to cp_parser_string_literal. */
2893 return cp_parser_string_literal (parser
,
2894 parser
->translate_strings_p
,
2897 case CPP_OPEN_PAREN
:
2900 bool saved_greater_than_is_operator_p
;
2902 /* Consume the `('. */
2903 cp_lexer_consume_token (parser
->lexer
);
2904 /* Within a parenthesized expression, a `>' token is always
2905 the greater-than operator. */
2906 saved_greater_than_is_operator_p
2907 = parser
->greater_than_is_operator_p
;
2908 parser
->greater_than_is_operator_p
= true;
2909 /* If we see `( { ' then we are looking at the beginning of
2910 a GNU statement-expression. */
2911 if (cp_parser_allow_gnu_extensions_p (parser
)
2912 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
2914 /* Statement-expressions are not allowed by the standard. */
2916 pedwarn ("ISO C++ forbids braced-groups within expressions");
2918 /* And they're not allowed outside of a function-body; you
2919 cannot, for example, write:
2921 int i = ({ int j = 3; j + 1; });
2923 at class or namespace scope. */
2924 if (!at_function_scope_p ())
2925 error ("statement-expressions are allowed only inside functions");
2926 /* Start the statement-expression. */
2927 expr
= begin_stmt_expr ();
2928 /* Parse the compound-statement. */
2929 cp_parser_compound_statement (parser
, expr
, false);
2931 expr
= finish_stmt_expr (expr
, false);
2935 /* Parse the parenthesized expression. */
2936 expr
= cp_parser_expression (parser
, cast_p
);
2937 /* Let the front end know that this expression was
2938 enclosed in parentheses. This matters in case, for
2939 example, the expression is of the form `A::B', since
2940 `&A::B' might be a pointer-to-member, but `&(A::B)' is
2942 finish_parenthesized_expr (expr
);
2944 /* The `>' token might be the end of a template-id or
2945 template-parameter-list now. */
2946 parser
->greater_than_is_operator_p
2947 = saved_greater_than_is_operator_p
;
2948 /* Consume the `)'. */
2949 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'"))
2950 cp_parser_skip_to_end_of_statement (parser
);
2956 switch (token
->keyword
)
2958 /* These two are the boolean literals. */
2960 cp_lexer_consume_token (parser
->lexer
);
2961 return boolean_true_node
;
2963 cp_lexer_consume_token (parser
->lexer
);
2964 return boolean_false_node
;
2966 /* The `__null' literal. */
2968 cp_lexer_consume_token (parser
->lexer
);
2971 /* Recognize the `this' keyword. */
2973 cp_lexer_consume_token (parser
->lexer
);
2974 if (parser
->local_variables_forbidden_p
)
2976 error ("%<this%> may not be used in this context");
2977 return error_mark_node
;
2979 /* Pointers cannot appear in constant-expressions. */
2980 if (cp_parser_non_integral_constant_expression (parser
,
2982 return error_mark_node
;
2983 return finish_this_expr ();
2985 /* The `operator' keyword can be the beginning of an
2990 case RID_FUNCTION_NAME
:
2991 case RID_PRETTY_FUNCTION_NAME
:
2992 case RID_C99_FUNCTION_NAME
:
2993 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
2994 __func__ are the names of variables -- but they are
2995 treated specially. Therefore, they are handled here,
2996 rather than relying on the generic id-expression logic
2997 below. Grammatically, these names are id-expressions.
2999 Consume the token. */
3000 token
= cp_lexer_consume_token (parser
->lexer
);
3001 /* Look up the name. */
3002 return finish_fname (token
->value
);
3009 /* The `__builtin_va_arg' construct is used to handle
3010 `va_arg'. Consume the `__builtin_va_arg' token. */
3011 cp_lexer_consume_token (parser
->lexer
);
3012 /* Look for the opening `('. */
3013 cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('");
3014 /* Now, parse the assignment-expression. */
3015 expression
= cp_parser_assignment_expression (parser
,
3017 /* Look for the `,'. */
3018 cp_parser_require (parser
, CPP_COMMA
, "`,'");
3019 /* Parse the type-id. */
3020 type
= cp_parser_type_id (parser
);
3021 /* Look for the closing `)'. */
3022 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
3023 /* Using `va_arg' in a constant-expression is not
3025 if (cp_parser_non_integral_constant_expression (parser
,
3027 return error_mark_node
;
3028 return build_x_va_arg (expression
, type
);
3032 return cp_parser_builtin_offsetof (parser
);
3034 /* Objective-C++ expressions. */
3036 case RID_AT_PROTOCOL
:
3037 case RID_AT_SELECTOR
:
3038 return cp_parser_objc_expression (parser
);
3041 cp_parser_error (parser
, "expected primary-expression");
3042 return error_mark_node
;
3045 /* An id-expression can start with either an identifier, a
3046 `::' as the beginning of a qualified-id, or the "operator"
3050 case CPP_TEMPLATE_ID
:
3051 case CPP_NESTED_NAME_SPECIFIER
:
3055 const char *error_msg
;
3060 /* Parse the id-expression. */
3062 = cp_parser_id_expression (parser
,
3063 /*template_keyword_p=*/false,
3064 /*check_dependency_p=*/true,
3066 /*declarator_p=*/false,
3067 /*optional_p=*/false);
3068 if (id_expression
== error_mark_node
)
3069 return error_mark_node
;
3070 token
= cp_lexer_peek_token (parser
->lexer
);
3071 done
= (token
->type
!= CPP_OPEN_SQUARE
3072 && token
->type
!= CPP_OPEN_PAREN
3073 && token
->type
!= CPP_DOT
3074 && token
->type
!= CPP_DEREF
3075 && token
->type
!= CPP_PLUS_PLUS
3076 && token
->type
!= CPP_MINUS_MINUS
);
3077 /* If we have a template-id, then no further lookup is
3078 required. If the template-id was for a template-class, we
3079 will sometimes have a TYPE_DECL at this point. */
3080 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
3081 || TREE_CODE (id_expression
) == TYPE_DECL
)
3082 decl
= id_expression
;
3083 /* Look up the name. */
3086 tree ambiguous_decls
;
3088 decl
= cp_parser_lookup_name (parser
, id_expression
,
3091 /*is_namespace=*/false,
3092 /*check_dependency=*/true,
3094 /* If the lookup was ambiguous, an error will already have
3096 if (ambiguous_decls
)
3097 return error_mark_node
;
3099 /* In Objective-C++, an instance variable (ivar) may be preferred
3100 to whatever cp_parser_lookup_name() found. */
3101 decl
= objc_lookup_ivar (decl
, id_expression
);
3103 /* If name lookup gives us a SCOPE_REF, then the
3104 qualifying scope was dependent. */
3105 if (TREE_CODE (decl
) == SCOPE_REF
)
3107 /* Check to see if DECL is a local variable in a context
3108 where that is forbidden. */
3109 if (parser
->local_variables_forbidden_p
3110 && local_variable_p (decl
))
3112 /* It might be that we only found DECL because we are
3113 trying to be generous with pre-ISO scoping rules.
3114 For example, consider:
3118 for (int i = 0; i < 10; ++i) {}
3119 extern void f(int j = i);
3122 Here, name look up will originally find the out
3123 of scope `i'. We need to issue a warning message,
3124 but then use the global `i'. */
3125 decl
= check_for_out_of_scope_variable (decl
);
3126 if (local_variable_p (decl
))
3128 error ("local variable %qD may not appear in this context",
3130 return error_mark_node
;
3135 decl
= (finish_id_expression
3136 (id_expression
, decl
, parser
->scope
,
3138 parser
->integral_constant_expression_p
,
3139 parser
->allow_non_integral_constant_expression_p
,
3140 &parser
->non_integral_constant_expression_p
,
3141 template_p
, done
, address_p
,
3145 cp_parser_error (parser
, error_msg
);
3149 /* Anything else is an error. */
3151 /* ...unless we have an Objective-C++ message or string literal, that is. */
3152 if (c_dialect_objc ()
3153 && (token
->type
== CPP_OPEN_SQUARE
|| token
->type
== CPP_OBJC_STRING
))
3154 return cp_parser_objc_expression (parser
);
3156 cp_parser_error (parser
, "expected primary-expression");
3157 return error_mark_node
;
3161 /* Parse an id-expression.
3168 :: [opt] nested-name-specifier template [opt] unqualified-id
3170 :: operator-function-id
3173 Return a representation of the unqualified portion of the
3174 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
3175 a `::' or nested-name-specifier.
3177 Often, if the id-expression was a qualified-id, the caller will
3178 want to make a SCOPE_REF to represent the qualified-id. This
3179 function does not do this in order to avoid wastefully creating
3180 SCOPE_REFs when they are not required.
3182 If TEMPLATE_KEYWORD_P is true, then we have just seen the
3185 If CHECK_DEPENDENCY_P is false, then names are looked up inside
3186 uninstantiated templates.
3188 If *TEMPLATE_P is non-NULL, it is set to true iff the
3189 `template' keyword is used to explicitly indicate that the entity
3190 named is a template.
3192 If DECLARATOR_P is true, the id-expression is appearing as part of
3193 a declarator, rather than as part of an expression. */
3196 cp_parser_id_expression (cp_parser
*parser
,
3197 bool template_keyword_p
,
3198 bool check_dependency_p
,
3203 bool global_scope_p
;
3204 bool nested_name_specifier_p
;
3206 /* Assume the `template' keyword was not used. */
3208 *template_p
= template_keyword_p
;
3210 /* Look for the optional `::' operator. */
3212 = (cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false)
3214 /* Look for the optional nested-name-specifier. */
3215 nested_name_specifier_p
3216 = (cp_parser_nested_name_specifier_opt (parser
,
3217 /*typename_keyword_p=*/false,
3222 /* If there is a nested-name-specifier, then we are looking at
3223 the first qualified-id production. */
3224 if (nested_name_specifier_p
)
3227 tree saved_object_scope
;
3228 tree saved_qualifying_scope
;
3229 tree unqualified_id
;
3232 /* See if the next token is the `template' keyword. */
3234 template_p
= &is_template
;
3235 *template_p
= cp_parser_optional_template_keyword (parser
);
3236 /* Name lookup we do during the processing of the
3237 unqualified-id might obliterate SCOPE. */
3238 saved_scope
= parser
->scope
;
3239 saved_object_scope
= parser
->object_scope
;
3240 saved_qualifying_scope
= parser
->qualifying_scope
;
3241 /* Process the final unqualified-id. */
3242 unqualified_id
= cp_parser_unqualified_id (parser
, *template_p
,
3245 /*optional_p=*/false);
3246 /* Restore the SAVED_SCOPE for our caller. */
3247 parser
->scope
= saved_scope
;
3248 parser
->object_scope
= saved_object_scope
;
3249 parser
->qualifying_scope
= saved_qualifying_scope
;
3251 return unqualified_id
;
3253 /* Otherwise, if we are in global scope, then we are looking at one
3254 of the other qualified-id productions. */
3255 else if (global_scope_p
)
3260 /* Peek at the next token. */
3261 token
= cp_lexer_peek_token (parser
->lexer
);
3263 /* If it's an identifier, and the next token is not a "<", then
3264 we can avoid the template-id case. This is an optimization
3265 for this common case. */
3266 if (token
->type
== CPP_NAME
3267 && !cp_parser_nth_token_starts_template_argument_list_p
3269 return cp_parser_identifier (parser
);
3271 cp_parser_parse_tentatively (parser
);
3272 /* Try a template-id. */
3273 id
= cp_parser_template_id (parser
,
3274 /*template_keyword_p=*/false,
3275 /*check_dependency_p=*/true,
3277 /* If that worked, we're done. */
3278 if (cp_parser_parse_definitely (parser
))
3281 /* Peek at the next token. (Changes in the token buffer may
3282 have invalidated the pointer obtained above.) */
3283 token
= cp_lexer_peek_token (parser
->lexer
);
3285 switch (token
->type
)
3288 return cp_parser_identifier (parser
);
3291 if (token
->keyword
== RID_OPERATOR
)
3292 return cp_parser_operator_function_id (parser
);
3296 cp_parser_error (parser
, "expected id-expression");
3297 return error_mark_node
;
3301 return cp_parser_unqualified_id (parser
, template_keyword_p
,
3302 /*check_dependency_p=*/true,
3307 /* Parse an unqualified-id.
3311 operator-function-id
3312 conversion-function-id
3316 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
3317 keyword, in a construct like `A::template ...'.
3319 Returns a representation of unqualified-id. For the `identifier'
3320 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
3321 production a BIT_NOT_EXPR is returned; the operand of the
3322 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
3323 other productions, see the documentation accompanying the
3324 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
3325 names are looked up in uninstantiated templates. If DECLARATOR_P
3326 is true, the unqualified-id is appearing as part of a declarator,
3327 rather than as part of an expression. */
3330 cp_parser_unqualified_id (cp_parser
* parser
,
3331 bool template_keyword_p
,
3332 bool check_dependency_p
,
3338 /* Peek at the next token. */
3339 token
= cp_lexer_peek_token (parser
->lexer
);
3341 switch (token
->type
)
3347 /* We don't know yet whether or not this will be a
3349 cp_parser_parse_tentatively (parser
);
3350 /* Try a template-id. */
3351 id
= cp_parser_template_id (parser
, template_keyword_p
,
3354 /* If it worked, we're done. */
3355 if (cp_parser_parse_definitely (parser
))
3357 /* Otherwise, it's an ordinary identifier. */
3358 return cp_parser_identifier (parser
);
3361 case CPP_TEMPLATE_ID
:
3362 return cp_parser_template_id (parser
, template_keyword_p
,
3369 tree qualifying_scope
;
3374 /* Consume the `~' token. */
3375 cp_lexer_consume_token (parser
->lexer
);
3376 /* Parse the class-name. The standard, as written, seems to
3379 template <typename T> struct S { ~S (); };
3380 template <typename T> S<T>::~S() {}
3382 is invalid, since `~' must be followed by a class-name, but
3383 `S<T>' is dependent, and so not known to be a class.
3384 That's not right; we need to look in uninstantiated
3385 templates. A further complication arises from:
3387 template <typename T> void f(T t) {
3391 Here, it is not possible to look up `T' in the scope of `T'
3392 itself. We must look in both the current scope, and the
3393 scope of the containing complete expression.
3395 Yet another issue is:
3404 The standard does not seem to say that the `S' in `~S'
3405 should refer to the type `S' and not the data member
3408 /* DR 244 says that we look up the name after the "~" in the
3409 same scope as we looked up the qualifying name. That idea
3410 isn't fully worked out; it's more complicated than that. */
3411 scope
= parser
->scope
;
3412 object_scope
= parser
->object_scope
;
3413 qualifying_scope
= parser
->qualifying_scope
;
3415 /* Check for invalid scopes. */
3416 if (scope
== error_mark_node
)
3418 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
3419 cp_lexer_consume_token (parser
->lexer
);
3420 return error_mark_node
;
3422 if (scope
&& TREE_CODE (scope
) == NAMESPACE_DECL
)
3424 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
3425 error ("scope %qT before %<~%> is not a class-name", scope
);
3426 cp_parser_simulate_error (parser
);
3427 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
3428 cp_lexer_consume_token (parser
->lexer
);
3429 return error_mark_node
;
3431 gcc_assert (!scope
|| TYPE_P (scope
));
3433 /* If the name is of the form "X::~X" it's OK. */
3434 token
= cp_lexer_peek_token (parser
->lexer
);
3436 && token
->type
== CPP_NAME
3437 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
3439 && constructor_name_p (token
->value
, scope
))
3441 cp_lexer_consume_token (parser
->lexer
);
3442 return build_nt (BIT_NOT_EXPR
, scope
);
3445 /* If there was an explicit qualification (S::~T), first look
3446 in the scope given by the qualification (i.e., S). */
3448 type_decl
= NULL_TREE
;
3451 cp_parser_parse_tentatively (parser
);
3452 type_decl
= cp_parser_class_name (parser
,
3453 /*typename_keyword_p=*/false,
3454 /*template_keyword_p=*/false,
3456 /*check_dependency=*/false,
3457 /*class_head_p=*/false,
3459 if (cp_parser_parse_definitely (parser
))
3462 /* In "N::S::~S", look in "N" as well. */
3463 if (!done
&& scope
&& qualifying_scope
)
3465 cp_parser_parse_tentatively (parser
);
3466 parser
->scope
= qualifying_scope
;
3467 parser
->object_scope
= NULL_TREE
;
3468 parser
->qualifying_scope
= NULL_TREE
;
3470 = cp_parser_class_name (parser
,
3471 /*typename_keyword_p=*/false,
3472 /*template_keyword_p=*/false,
3474 /*check_dependency=*/false,
3475 /*class_head_p=*/false,
3477 if (cp_parser_parse_definitely (parser
))
3480 /* In "p->S::~T", look in the scope given by "*p" as well. */
3481 else if (!done
&& object_scope
)
3483 cp_parser_parse_tentatively (parser
);
3484 parser
->scope
= object_scope
;
3485 parser
->object_scope
= NULL_TREE
;
3486 parser
->qualifying_scope
= NULL_TREE
;
3488 = cp_parser_class_name (parser
,
3489 /*typename_keyword_p=*/false,
3490 /*template_keyword_p=*/false,
3492 /*check_dependency=*/false,
3493 /*class_head_p=*/false,
3495 if (cp_parser_parse_definitely (parser
))
3498 /* Look in the surrounding context. */
3501 parser
->scope
= NULL_TREE
;
3502 parser
->object_scope
= NULL_TREE
;
3503 parser
->qualifying_scope
= NULL_TREE
;
3505 = cp_parser_class_name (parser
,
3506 /*typename_keyword_p=*/false,
3507 /*template_keyword_p=*/false,
3509 /*check_dependency=*/false,
3510 /*class_head_p=*/false,
3513 /* If an error occurred, assume that the name of the
3514 destructor is the same as the name of the qualifying
3515 class. That allows us to keep parsing after running
3516 into ill-formed destructor names. */
3517 if (type_decl
== error_mark_node
&& scope
)
3518 return build_nt (BIT_NOT_EXPR
, scope
);
3519 else if (type_decl
== error_mark_node
)
3520 return error_mark_node
;
3522 /* Check that destructor name and scope match. */
3523 if (declarator_p
&& scope
&& !check_dtor_name (scope
, type_decl
))
3525 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
3526 error ("declaration of %<~%T%> as member of %qT",
3528 cp_parser_simulate_error (parser
);
3529 return error_mark_node
;
3534 A typedef-name that names a class shall not be used as the
3535 identifier in the declarator for a destructor declaration. */
3537 && !DECL_IMPLICIT_TYPEDEF_P (type_decl
)
3538 && !DECL_SELF_REFERENCE_P (type_decl
)
3539 && !cp_parser_uncommitted_to_tentative_parse_p (parser
))
3540 error ("typedef-name %qD used as destructor declarator",
3543 return build_nt (BIT_NOT_EXPR
, TREE_TYPE (type_decl
));
3547 if (token
->keyword
== RID_OPERATOR
)
3551 /* This could be a template-id, so we try that first. */
3552 cp_parser_parse_tentatively (parser
);
3553 /* Try a template-id. */
3554 id
= cp_parser_template_id (parser
, template_keyword_p
,
3555 /*check_dependency_p=*/true,
3557 /* If that worked, we're done. */
3558 if (cp_parser_parse_definitely (parser
))
3560 /* We still don't know whether we're looking at an
3561 operator-function-id or a conversion-function-id. */
3562 cp_parser_parse_tentatively (parser
);
3563 /* Try an operator-function-id. */
3564 id
= cp_parser_operator_function_id (parser
);
3565 /* If that didn't work, try a conversion-function-id. */
3566 if (!cp_parser_parse_definitely (parser
))
3567 id
= cp_parser_conversion_function_id (parser
);
3576 cp_parser_error (parser
, "expected unqualified-id");
3577 return error_mark_node
;
3581 /* Parse an (optional) nested-name-specifier.
3583 nested-name-specifier:
3584 class-or-namespace-name :: nested-name-specifier [opt]
3585 class-or-namespace-name :: template nested-name-specifier [opt]
3587 PARSER->SCOPE should be set appropriately before this function is
3588 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
3589 effect. TYPE_P is TRUE if we non-type bindings should be ignored
3592 Sets PARSER->SCOPE to the class (TYPE) or namespace
3593 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
3594 it unchanged if there is no nested-name-specifier. Returns the new
3595 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
3597 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
3598 part of a declaration and/or decl-specifier. */
3601 cp_parser_nested_name_specifier_opt (cp_parser
*parser
,
3602 bool typename_keyword_p
,
3603 bool check_dependency_p
,
3605 bool is_declaration
)
3607 bool success
= false;
3608 cp_token_position start
= 0;
3611 /* Remember where the nested-name-specifier starts. */
3612 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
3614 start
= cp_lexer_token_position (parser
->lexer
, false);
3615 push_deferring_access_checks (dk_deferred
);
3622 tree saved_qualifying_scope
;
3623 bool template_keyword_p
;
3625 /* Spot cases that cannot be the beginning of a
3626 nested-name-specifier. */
3627 token
= cp_lexer_peek_token (parser
->lexer
);
3629 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
3630 the already parsed nested-name-specifier. */
3631 if (token
->type
== CPP_NESTED_NAME_SPECIFIER
)
3633 /* Grab the nested-name-specifier and continue the loop. */
3634 cp_parser_pre_parsed_nested_name_specifier (parser
);
3635 /* If we originally encountered this nested-name-specifier
3636 with IS_DECLARATION set to false, we will not have
3637 resolved TYPENAME_TYPEs, so we must do so here. */
3639 && TREE_CODE (parser
->scope
) == TYPENAME_TYPE
)
3641 new_scope
= resolve_typename_type (parser
->scope
,
3642 /*only_current_p=*/false);
3643 if (new_scope
!= error_mark_node
)
3644 parser
->scope
= new_scope
;
3650 /* Spot cases that cannot be the beginning of a
3651 nested-name-specifier. On the second and subsequent times
3652 through the loop, we look for the `template' keyword. */
3653 if (success
&& token
->keyword
== RID_TEMPLATE
)
3655 /* A template-id can start a nested-name-specifier. */
3656 else if (token
->type
== CPP_TEMPLATE_ID
)
3660 /* If the next token is not an identifier, then it is
3661 definitely not a class-or-namespace-name. */
3662 if (token
->type
!= CPP_NAME
)
3664 /* If the following token is neither a `<' (to begin a
3665 template-id), nor a `::', then we are not looking at a
3666 nested-name-specifier. */
3667 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
3668 if (token
->type
!= CPP_SCOPE
3669 && !cp_parser_nth_token_starts_template_argument_list_p
3674 /* The nested-name-specifier is optional, so we parse
3676 cp_parser_parse_tentatively (parser
);
3678 /* Look for the optional `template' keyword, if this isn't the
3679 first time through the loop. */
3681 template_keyword_p
= cp_parser_optional_template_keyword (parser
);
3683 template_keyword_p
= false;
3685 /* Save the old scope since the name lookup we are about to do
3686 might destroy it. */
3687 old_scope
= parser
->scope
;
3688 saved_qualifying_scope
= parser
->qualifying_scope
;
3689 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
3690 look up names in "X<T>::I" in order to determine that "Y" is
3691 a template. So, if we have a typename at this point, we make
3692 an effort to look through it. */
3694 && !typename_keyword_p
3696 && TREE_CODE (parser
->scope
) == TYPENAME_TYPE
)
3697 parser
->scope
= resolve_typename_type (parser
->scope
,
3698 /*only_current_p=*/false);
3699 /* Parse the qualifying entity. */
3701 = cp_parser_class_or_namespace_name (parser
,
3707 /* Look for the `::' token. */
3708 cp_parser_require (parser
, CPP_SCOPE
, "`::'");
3710 /* If we found what we wanted, we keep going; otherwise, we're
3712 if (!cp_parser_parse_definitely (parser
))
3714 bool error_p
= false;
3716 /* Restore the OLD_SCOPE since it was valid before the
3717 failed attempt at finding the last
3718 class-or-namespace-name. */
3719 parser
->scope
= old_scope
;
3720 parser
->qualifying_scope
= saved_qualifying_scope
;
3721 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
3723 /* If the next token is an identifier, and the one after
3724 that is a `::', then any valid interpretation would have
3725 found a class-or-namespace-name. */
3726 while (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
)
3727 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
3729 && (cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
3732 token
= cp_lexer_consume_token (parser
->lexer
);
3735 if (!token
->ambiguous_p
)
3738 tree ambiguous_decls
;
3740 decl
= cp_parser_lookup_name (parser
, token
->value
,
3742 /*is_template=*/false,
3743 /*is_namespace=*/false,
3744 /*check_dependency=*/true,
3746 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
3747 error ("%qD used without template parameters", decl
);
3748 else if (ambiguous_decls
)
3750 error ("reference to %qD is ambiguous",
3752 print_candidates (ambiguous_decls
);
3753 decl
= error_mark_node
;
3756 cp_parser_name_lookup_error
3757 (parser
, token
->value
, decl
,
3758 "is not a class or namespace");
3760 parser
->scope
= error_mark_node
;
3762 /* Treat this as a successful nested-name-specifier
3767 If the name found is not a class-name (clause
3768 _class_) or namespace-name (_namespace.def_), the
3769 program is ill-formed. */
3772 cp_lexer_consume_token (parser
->lexer
);
3776 /* We've found one valid nested-name-specifier. */
3778 /* Name lookup always gives us a DECL. */
3779 if (TREE_CODE (new_scope
) == TYPE_DECL
)
3780 new_scope
= TREE_TYPE (new_scope
);
3781 /* Uses of "template" must be followed by actual templates. */
3782 if (template_keyword_p
3783 && !(CLASS_TYPE_P (new_scope
)
3784 && ((CLASSTYPE_USE_TEMPLATE (new_scope
)
3785 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (new_scope
)))
3786 || CLASSTYPE_IS_TEMPLATE (new_scope
)))
3787 && !(TREE_CODE (new_scope
) == TYPENAME_TYPE
3788 && (TREE_CODE (TYPENAME_TYPE_FULLNAME (new_scope
))
3789 == TEMPLATE_ID_EXPR
)))
3790 pedwarn (TYPE_P (new_scope
)
3791 ? "%qT is not a template"
3792 : "%qD is not a template",
3794 /* If it is a class scope, try to complete it; we are about to
3795 be looking up names inside the class. */
3796 if (TYPE_P (new_scope
)
3797 /* Since checking types for dependency can be expensive,
3798 avoid doing it if the type is already complete. */
3799 && !COMPLETE_TYPE_P (new_scope
)
3800 /* Do not try to complete dependent types. */
3801 && !dependent_type_p (new_scope
))
3802 new_scope
= complete_type (new_scope
);
3803 /* Make sure we look in the right scope the next time through
3805 parser
->scope
= new_scope
;
3808 /* If parsing tentatively, replace the sequence of tokens that makes
3809 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
3810 token. That way, should we re-parse the token stream, we will
3811 not have to repeat the effort required to do the parse, nor will
3812 we issue duplicate error messages. */
3813 if (success
&& start
)
3818 token
= cp_lexer_token_at (parser
->lexer
, start
);
3819 /* Reset the contents of the START token. */
3820 token
->type
= CPP_NESTED_NAME_SPECIFIER
;
3821 /* Retrieve any deferred checks. Do not pop this access checks yet
3822 so the memory will not be reclaimed during token replacing below. */
3823 access_checks
= get_deferred_access_checks ();
3824 token
->value
= build_tree_list (copy_list (access_checks
),
3826 TREE_TYPE (token
->value
) = parser
->qualifying_scope
;
3827 token
->keyword
= RID_MAX
;
3829 /* Purge all subsequent tokens. */
3830 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
3834 pop_to_parent_deferring_access_checks ();
3836 return success
? parser
->scope
: NULL_TREE
;
3839 /* Parse a nested-name-specifier. See
3840 cp_parser_nested_name_specifier_opt for details. This function
3841 behaves identically, except that it will an issue an error if no
3842 nested-name-specifier is present. */
3845 cp_parser_nested_name_specifier (cp_parser
*parser
,
3846 bool typename_keyword_p
,
3847 bool check_dependency_p
,
3849 bool is_declaration
)
3853 /* Look for the nested-name-specifier. */
3854 scope
= cp_parser_nested_name_specifier_opt (parser
,
3859 /* If it was not present, issue an error message. */
3862 cp_parser_error (parser
, "expected nested-name-specifier");
3863 parser
->scope
= NULL_TREE
;
3869 /* Parse a class-or-namespace-name.
3871 class-or-namespace-name:
3875 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
3876 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
3877 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
3878 TYPE_P is TRUE iff the next name should be taken as a class-name,
3879 even the same name is declared to be another entity in the same
3882 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
3883 specified by the class-or-namespace-name. If neither is found the
3884 ERROR_MARK_NODE is returned. */
3887 cp_parser_class_or_namespace_name (cp_parser
*parser
,
3888 bool typename_keyword_p
,
3889 bool template_keyword_p
,
3890 bool check_dependency_p
,
3892 bool is_declaration
)
3895 tree saved_qualifying_scope
;
3896 tree saved_object_scope
;
3900 /* Before we try to parse the class-name, we must save away the
3901 current PARSER->SCOPE since cp_parser_class_name will destroy
3903 saved_scope
= parser
->scope
;
3904 saved_qualifying_scope
= parser
->qualifying_scope
;
3905 saved_object_scope
= parser
->object_scope
;
3906 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
3907 there is no need to look for a namespace-name. */
3908 only_class_p
= template_keyword_p
|| (saved_scope
&& TYPE_P (saved_scope
));
3910 cp_parser_parse_tentatively (parser
);
3911 scope
= cp_parser_class_name (parser
,
3914 type_p
? class_type
: none_type
,
3916 /*class_head_p=*/false,
3918 /* If that didn't work, try for a namespace-name. */
3919 if (!only_class_p
&& !cp_parser_parse_definitely (parser
))
3921 /* Restore the saved scope. */
3922 parser
->scope
= saved_scope
;
3923 parser
->qualifying_scope
= saved_qualifying_scope
;
3924 parser
->object_scope
= saved_object_scope
;
3925 /* If we are not looking at an identifier followed by the scope
3926 resolution operator, then this is not part of a
3927 nested-name-specifier. (Note that this function is only used
3928 to parse the components of a nested-name-specifier.) */
3929 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
)
3930 || cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_SCOPE
)
3931 return error_mark_node
;
3932 scope
= cp_parser_namespace_name (parser
);
3938 /* Parse a postfix-expression.
3942 postfix-expression [ expression ]
3943 postfix-expression ( expression-list [opt] )
3944 simple-type-specifier ( expression-list [opt] )
3945 typename :: [opt] nested-name-specifier identifier
3946 ( expression-list [opt] )
3947 typename :: [opt] nested-name-specifier template [opt] template-id
3948 ( expression-list [opt] )
3949 postfix-expression . template [opt] id-expression
3950 postfix-expression -> template [opt] id-expression
3951 postfix-expression . pseudo-destructor-name
3952 postfix-expression -> pseudo-destructor-name
3953 postfix-expression ++
3954 postfix-expression --
3955 dynamic_cast < type-id > ( expression )
3956 static_cast < type-id > ( expression )
3957 reinterpret_cast < type-id > ( expression )
3958 const_cast < type-id > ( expression )
3959 typeid ( expression )
3965 ( type-id ) { initializer-list , [opt] }
3967 This extension is a GNU version of the C99 compound-literal
3968 construct. (The C99 grammar uses `type-name' instead of `type-id',
3969 but they are essentially the same concept.)
3971 If ADDRESS_P is true, the postfix expression is the operand of the
3972 `&' operator. CAST_P is true if this expression is the target of a
3975 Returns a representation of the expression. */
3978 cp_parser_postfix_expression (cp_parser
*parser
, bool address_p
, bool cast_p
)
3982 cp_id_kind idk
= CP_ID_KIND_NONE
;
3983 tree postfix_expression
= NULL_TREE
;
3985 /* Peek at the next token. */
3986 token
= cp_lexer_peek_token (parser
->lexer
);
3987 /* Some of the productions are determined by keywords. */
3988 keyword
= token
->keyword
;
3998 const char *saved_message
;
4000 /* All of these can be handled in the same way from the point
4001 of view of parsing. Begin by consuming the token
4002 identifying the cast. */
4003 cp_lexer_consume_token (parser
->lexer
);
4005 /* New types cannot be defined in the cast. */
4006 saved_message
= parser
->type_definition_forbidden_message
;
4007 parser
->type_definition_forbidden_message
4008 = "types may not be defined in casts";
4010 /* Look for the opening `<'. */
4011 cp_parser_require (parser
, CPP_LESS
, "`<'");
4012 /* Parse the type to which we are casting. */
4013 type
= cp_parser_type_id (parser
);
4014 /* Look for the closing `>'. */
4015 cp_parser_require (parser
, CPP_GREATER
, "`>'");
4016 /* Restore the old message. */
4017 parser
->type_definition_forbidden_message
= saved_message
;
4019 /* And the expression which is being cast. */
4020 cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('");
4021 expression
= cp_parser_expression (parser
, /*cast_p=*/true);
4022 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
4024 /* Only type conversions to integral or enumeration types
4025 can be used in constant-expressions. */
4026 if (!cast_valid_in_integral_constant_expression_p (type
)
4027 && (cp_parser_non_integral_constant_expression
4029 "a cast to a type other than an integral or "
4030 "enumeration type")))
4031 return error_mark_node
;
4037 = build_dynamic_cast (type
, expression
);
4041 = build_static_cast (type
, expression
);
4045 = build_reinterpret_cast (type
, expression
);
4049 = build_const_cast (type
, expression
);
4060 const char *saved_message
;
4061 bool saved_in_type_id_in_expr_p
;
4063 /* Consume the `typeid' token. */
4064 cp_lexer_consume_token (parser
->lexer
);
4065 /* Look for the `(' token. */
4066 cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('");
4067 /* Types cannot be defined in a `typeid' expression. */
4068 saved_message
= parser
->type_definition_forbidden_message
;
4069 parser
->type_definition_forbidden_message
4070 = "types may not be defined in a `typeid\' expression";
4071 /* We can't be sure yet whether we're looking at a type-id or an
4073 cp_parser_parse_tentatively (parser
);
4074 /* Try a type-id first. */
4075 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
4076 parser
->in_type_id_in_expr_p
= true;
4077 type
= cp_parser_type_id (parser
);
4078 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
4079 /* Look for the `)' token. Otherwise, we can't be sure that
4080 we're not looking at an expression: consider `typeid (int
4081 (3))', for example. */
4082 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
4083 /* If all went well, simply lookup the type-id. */
4084 if (cp_parser_parse_definitely (parser
))
4085 postfix_expression
= get_typeid (type
);
4086 /* Otherwise, fall back to the expression variant. */
4091 /* Look for an expression. */
4092 expression
= cp_parser_expression (parser
, /*cast_p=*/false);
4093 /* Compute its typeid. */
4094 postfix_expression
= build_typeid (expression
);
4095 /* Look for the `)' token. */
4096 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
4098 /* Restore the saved message. */
4099 parser
->type_definition_forbidden_message
= saved_message
;
4100 /* `typeid' may not appear in an integral constant expression. */
4101 if (cp_parser_non_integral_constant_expression(parser
,
4102 "`typeid' operator"))
4103 return error_mark_node
;
4110 /* The syntax permitted here is the same permitted for an
4111 elaborated-type-specifier. */
4112 type
= cp_parser_elaborated_type_specifier (parser
,
4113 /*is_friend=*/false,
4114 /*is_declaration=*/false);
4115 postfix_expression
= cp_parser_functional_cast (parser
, type
);
4123 /* If the next thing is a simple-type-specifier, we may be
4124 looking at a functional cast. We could also be looking at
4125 an id-expression. So, we try the functional cast, and if
4126 that doesn't work we fall back to the primary-expression. */
4127 cp_parser_parse_tentatively (parser
);
4128 /* Look for the simple-type-specifier. */
4129 type
= cp_parser_simple_type_specifier (parser
,
4130 /*decl_specs=*/NULL
,
4131 CP_PARSER_FLAGS_NONE
);
4132 /* Parse the cast itself. */
4133 if (!cp_parser_error_occurred (parser
))
4135 = cp_parser_functional_cast (parser
, type
);
4136 /* If that worked, we're done. */
4137 if (cp_parser_parse_definitely (parser
))
4140 /* If the functional-cast didn't work out, try a
4141 compound-literal. */
4142 if (cp_parser_allow_gnu_extensions_p (parser
)
4143 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
4145 VEC(constructor_elt
,gc
) *initializer_list
= NULL
;
4146 bool saved_in_type_id_in_expr_p
;
4148 cp_parser_parse_tentatively (parser
);
4149 /* Consume the `('. */
4150 cp_lexer_consume_token (parser
->lexer
);
4151 /* Parse the type. */
4152 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
4153 parser
->in_type_id_in_expr_p
= true;
4154 type
= cp_parser_type_id (parser
);
4155 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
4156 /* Look for the `)'. */
4157 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
4158 /* Look for the `{'. */
4159 cp_parser_require (parser
, CPP_OPEN_BRACE
, "`{'");
4160 /* If things aren't going well, there's no need to
4162 if (!cp_parser_error_occurred (parser
))
4164 bool non_constant_p
;
4165 /* Parse the initializer-list. */
4167 = cp_parser_initializer_list (parser
, &non_constant_p
);
4168 /* Allow a trailing `,'. */
4169 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
4170 cp_lexer_consume_token (parser
->lexer
);
4171 /* Look for the final `}'. */
4172 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "`}'");
4174 /* If that worked, we're definitely looking at a
4175 compound-literal expression. */
4176 if (cp_parser_parse_definitely (parser
))
4178 /* Warn the user that a compound literal is not
4179 allowed in standard C++. */
4181 pedwarn ("ISO C++ forbids compound-literals");
4182 /* Form the representation of the compound-literal. */
4184 = finish_compound_literal (type
, initializer_list
);
4189 /* It must be a primary-expression. */
4191 = cp_parser_primary_expression (parser
, address_p
, cast_p
,
4192 /*template_arg_p=*/false,
4198 /* Keep looping until the postfix-expression is complete. */
4201 if (idk
== CP_ID_KIND_UNQUALIFIED
4202 && TREE_CODE (postfix_expression
) == IDENTIFIER_NODE
4203 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_PAREN
))
4204 /* It is not a Koenig lookup function call. */
4206 = unqualified_name_lookup_error (postfix_expression
);
4208 /* Peek at the next token. */
4209 token
= cp_lexer_peek_token (parser
->lexer
);
4211 switch (token
->type
)
4213 case CPP_OPEN_SQUARE
:
4215 = cp_parser_postfix_open_square_expression (parser
,
4218 idk
= CP_ID_KIND_NONE
;
4221 case CPP_OPEN_PAREN
:
4222 /* postfix-expression ( expression-list [opt] ) */
4225 bool is_builtin_constant_p
;
4226 bool saved_integral_constant_expression_p
= false;
4227 bool saved_non_integral_constant_expression_p
= false;
4230 is_builtin_constant_p
4231 = DECL_IS_BUILTIN_CONSTANT_P (postfix_expression
);
4232 if (is_builtin_constant_p
)
4234 /* The whole point of __builtin_constant_p is to allow
4235 non-constant expressions to appear as arguments. */
4236 saved_integral_constant_expression_p
4237 = parser
->integral_constant_expression_p
;
4238 saved_non_integral_constant_expression_p
4239 = parser
->non_integral_constant_expression_p
;
4240 parser
->integral_constant_expression_p
= false;
4242 args
= (cp_parser_parenthesized_expression_list
4243 (parser
, /*is_attribute_list=*/false,
4245 /*non_constant_p=*/NULL
));
4246 if (is_builtin_constant_p
)
4248 parser
->integral_constant_expression_p
4249 = saved_integral_constant_expression_p
;
4250 parser
->non_integral_constant_expression_p
4251 = saved_non_integral_constant_expression_p
;
4254 if (args
== error_mark_node
)
4256 postfix_expression
= error_mark_node
;
4260 /* Function calls are not permitted in
4261 constant-expressions. */
4262 if (! builtin_valid_in_constant_expr_p (postfix_expression
)
4263 && cp_parser_non_integral_constant_expression (parser
,
4266 postfix_expression
= error_mark_node
;
4271 if (idk
== CP_ID_KIND_UNQUALIFIED
)
4273 if (TREE_CODE (postfix_expression
) == IDENTIFIER_NODE
)
4279 = perform_koenig_lookup (postfix_expression
, args
);
4283 = unqualified_fn_lookup_error (postfix_expression
);
4285 /* We do not perform argument-dependent lookup if
4286 normal lookup finds a non-function, in accordance
4287 with the expected resolution of DR 218. */
4288 else if (args
&& is_overloaded_fn (postfix_expression
))
4290 tree fn
= get_first_fn (postfix_expression
);
4292 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4293 fn
= OVL_CURRENT (TREE_OPERAND (fn
, 0));
4295 /* Only do argument dependent lookup if regular
4296 lookup does not find a set of member functions.
4297 [basic.lookup.koenig]/2a */
4298 if (!DECL_FUNCTION_MEMBER_P (fn
))
4302 = perform_koenig_lookup (postfix_expression
, args
);
4307 if (TREE_CODE (postfix_expression
) == COMPONENT_REF
)
4309 tree instance
= TREE_OPERAND (postfix_expression
, 0);
4310 tree fn
= TREE_OPERAND (postfix_expression
, 1);
4312 if (processing_template_decl
4313 && (type_dependent_expression_p (instance
)
4314 || (!BASELINK_P (fn
)
4315 && TREE_CODE (fn
) != FIELD_DECL
)
4316 || type_dependent_expression_p (fn
)
4317 || any_type_dependent_arguments_p (args
)))
4320 = build_min_nt (CALL_EXPR
, postfix_expression
,
4325 if (BASELINK_P (fn
))
4327 = (build_new_method_call
4328 (instance
, fn
, args
, NULL_TREE
,
4329 (idk
== CP_ID_KIND_QUALIFIED
4330 ? LOOKUP_NONVIRTUAL
: LOOKUP_NORMAL
),
4334 = finish_call_expr (postfix_expression
, args
,
4335 /*disallow_virtual=*/false,
4336 /*koenig_p=*/false);
4338 else if (TREE_CODE (postfix_expression
) == OFFSET_REF
4339 || TREE_CODE (postfix_expression
) == MEMBER_REF
4340 || TREE_CODE (postfix_expression
) == DOTSTAR_EXPR
)
4341 postfix_expression
= (build_offset_ref_call_from_tree
4342 (postfix_expression
, args
));
4343 else if (idk
== CP_ID_KIND_QUALIFIED
)
4344 /* A call to a static class member, or a namespace-scope
4347 = finish_call_expr (postfix_expression
, args
,
4348 /*disallow_virtual=*/true,
4351 /* All other function calls. */
4353 = finish_call_expr (postfix_expression
, args
,
4354 /*disallow_virtual=*/false,
4357 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
4358 idk
= CP_ID_KIND_NONE
;
4364 /* postfix-expression . template [opt] id-expression
4365 postfix-expression . pseudo-destructor-name
4366 postfix-expression -> template [opt] id-expression
4367 postfix-expression -> pseudo-destructor-name */
4369 /* Consume the `.' or `->' operator. */
4370 cp_lexer_consume_token (parser
->lexer
);
4373 = cp_parser_postfix_dot_deref_expression (parser
, token
->type
,
4379 /* postfix-expression ++ */
4380 /* Consume the `++' token. */
4381 cp_lexer_consume_token (parser
->lexer
);
4382 /* Generate a representation for the complete expression. */
4384 = finish_increment_expr (postfix_expression
,
4385 POSTINCREMENT_EXPR
);
4386 /* Increments may not appear in constant-expressions. */
4387 if (cp_parser_non_integral_constant_expression (parser
,
4389 postfix_expression
= error_mark_node
;
4390 idk
= CP_ID_KIND_NONE
;
4393 case CPP_MINUS_MINUS
:
4394 /* postfix-expression -- */
4395 /* Consume the `--' token. */
4396 cp_lexer_consume_token (parser
->lexer
);
4397 /* Generate a representation for the complete expression. */
4399 = finish_increment_expr (postfix_expression
,
4400 POSTDECREMENT_EXPR
);
4401 /* Decrements may not appear in constant-expressions. */
4402 if (cp_parser_non_integral_constant_expression (parser
,
4404 postfix_expression
= error_mark_node
;
4405 idk
= CP_ID_KIND_NONE
;
4409 return postfix_expression
;
4413 /* We should never get here. */
4415 return error_mark_node
;
4418 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
4419 by cp_parser_builtin_offsetof. We're looking for
4421 postfix-expression [ expression ]
4423 FOR_OFFSETOF is set if we're being called in that context, which
4424 changes how we deal with integer constant expressions. */
4427 cp_parser_postfix_open_square_expression (cp_parser
*parser
,
4428 tree postfix_expression
,
4433 /* Consume the `[' token. */
4434 cp_lexer_consume_token (parser
->lexer
);
4436 /* Parse the index expression. */
4437 /* ??? For offsetof, there is a question of what to allow here. If
4438 offsetof is not being used in an integral constant expression context,
4439 then we *could* get the right answer by computing the value at runtime.
4440 If we are in an integral constant expression context, then we might
4441 could accept any constant expression; hard to say without analysis.
4442 Rather than open the barn door too wide right away, allow only integer
4443 constant expressions here. */
4445 index
= cp_parser_constant_expression (parser
, false, NULL
);
4447 index
= cp_parser_expression (parser
, /*cast_p=*/false);
4449 /* Look for the closing `]'. */
4450 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, "`]'");
4452 /* Build the ARRAY_REF. */
4453 postfix_expression
= grok_array_decl (postfix_expression
, index
);
4455 /* When not doing offsetof, array references are not permitted in
4456 constant-expressions. */
4458 && (cp_parser_non_integral_constant_expression
4459 (parser
, "an array reference")))
4460 postfix_expression
= error_mark_node
;
4462 return postfix_expression
;
4465 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
4466 by cp_parser_builtin_offsetof. We're looking for
4468 postfix-expression . template [opt] id-expression
4469 postfix-expression . pseudo-destructor-name
4470 postfix-expression -> template [opt] id-expression
4471 postfix-expression -> pseudo-destructor-name
4473 FOR_OFFSETOF is set if we're being called in that context. That sorta
4474 limits what of the above we'll actually accept, but nevermind.
4475 TOKEN_TYPE is the "." or "->" token, which will already have been
4476 removed from the stream. */
4479 cp_parser_postfix_dot_deref_expression (cp_parser
*parser
,
4480 enum cpp_ttype token_type
,
4481 tree postfix_expression
,
4482 bool for_offsetof
, cp_id_kind
*idk
)
4486 bool pseudo_destructor_p
;
4487 tree scope
= NULL_TREE
;
4489 /* If this is a `->' operator, dereference the pointer. */
4490 if (token_type
== CPP_DEREF
)
4491 postfix_expression
= build_x_arrow (postfix_expression
);
4492 /* Check to see whether or not the expression is type-dependent. */
4493 dependent_p
= type_dependent_expression_p (postfix_expression
);
4494 /* The identifier following the `->' or `.' is not qualified. */
4495 parser
->scope
= NULL_TREE
;
4496 parser
->qualifying_scope
= NULL_TREE
;
4497 parser
->object_scope
= NULL_TREE
;
4498 *idk
= CP_ID_KIND_NONE
;
4499 /* Enter the scope corresponding to the type of the object
4500 given by the POSTFIX_EXPRESSION. */
4501 if (!dependent_p
&& TREE_TYPE (postfix_expression
) != NULL_TREE
)
4503 scope
= TREE_TYPE (postfix_expression
);
4504 /* According to the standard, no expression should ever have
4505 reference type. Unfortunately, we do not currently match
4506 the standard in this respect in that our internal representation
4507 of an expression may have reference type even when the standard
4508 says it does not. Therefore, we have to manually obtain the
4509 underlying type here. */
4510 scope
= non_reference (scope
);
4511 /* The type of the POSTFIX_EXPRESSION must be complete. */
4512 if (scope
== unknown_type_node
)
4514 error ("%qE does not have class type", postfix_expression
);
4518 scope
= complete_type_or_else (scope
, NULL_TREE
);
4519 /* Let the name lookup machinery know that we are processing a
4520 class member access expression. */
4521 parser
->context
->object_type
= scope
;
4522 /* If something went wrong, we want to be able to discern that case,
4523 as opposed to the case where there was no SCOPE due to the type
4524 of expression being dependent. */
4526 scope
= error_mark_node
;
4527 /* If the SCOPE was erroneous, make the various semantic analysis
4528 functions exit quickly -- and without issuing additional error
4530 if (scope
== error_mark_node
)
4531 postfix_expression
= error_mark_node
;
4534 /* Assume this expression is not a pseudo-destructor access. */
4535 pseudo_destructor_p
= false;
4537 /* If the SCOPE is a scalar type, then, if this is a valid program,
4538 we must be looking at a pseudo-destructor-name. */
4539 if (scope
&& SCALAR_TYPE_P (scope
))
4544 cp_parser_parse_tentatively (parser
);
4545 /* Parse the pseudo-destructor-name. */
4547 cp_parser_pseudo_destructor_name (parser
, &s
, &type
);
4548 if (cp_parser_parse_definitely (parser
))
4550 pseudo_destructor_p
= true;
4552 = finish_pseudo_destructor_expr (postfix_expression
,
4553 s
, TREE_TYPE (type
));
4557 if (!pseudo_destructor_p
)
4559 /* If the SCOPE is not a scalar type, we are looking at an
4560 ordinary class member access expression, rather than a
4561 pseudo-destructor-name. */
4563 /* Parse the id-expression. */
4564 name
= (cp_parser_id_expression
4566 cp_parser_optional_template_keyword (parser
),
4567 /*check_dependency_p=*/true,
4569 /*declarator_p=*/false,
4570 /*optional_p=*/false));
4571 /* In general, build a SCOPE_REF if the member name is qualified.
4572 However, if the name was not dependent and has already been
4573 resolved; there is no need to build the SCOPE_REF. For example;
4575 struct X { void f(); };
4576 template <typename T> void f(T* t) { t->X::f(); }
4578 Even though "t" is dependent, "X::f" is not and has been resolved
4579 to a BASELINK; there is no need to include scope information. */
4581 /* But we do need to remember that there was an explicit scope for
4582 virtual function calls. */
4584 *idk
= CP_ID_KIND_QUALIFIED
;
4586 /* If the name is a template-id that names a type, we will get a
4587 TYPE_DECL here. That is invalid code. */
4588 if (TREE_CODE (name
) == TYPE_DECL
)
4590 error ("invalid use of %qD", name
);
4591 postfix_expression
= error_mark_node
;
4595 if (name
!= error_mark_node
&& !BASELINK_P (name
) && parser
->scope
)
4597 name
= build_qualified_name (/*type=*/NULL_TREE
,
4601 parser
->scope
= NULL_TREE
;
4602 parser
->qualifying_scope
= NULL_TREE
;
4603 parser
->object_scope
= NULL_TREE
;
4605 if (scope
&& name
&& BASELINK_P (name
))
4606 adjust_result_of_qualified_name_lookup
4607 (name
, BINFO_TYPE (BASELINK_ACCESS_BINFO (name
)), scope
);
4609 = finish_class_member_access_expr (postfix_expression
, name
,
4614 /* We no longer need to look up names in the scope of the object on
4615 the left-hand side of the `.' or `->' operator. */
4616 parser
->context
->object_type
= NULL_TREE
;
4618 /* Outside of offsetof, these operators may not appear in
4619 constant-expressions. */
4621 && (cp_parser_non_integral_constant_expression
4622 (parser
, token_type
== CPP_DEREF
? "'->'" : "`.'")))
4623 postfix_expression
= error_mark_node
;
4625 return postfix_expression
;
4628 /* Parse a parenthesized expression-list.
4631 assignment-expression
4632 expression-list, assignment-expression
4637 identifier, expression-list
4639 CAST_P is true if this expression is the target of a cast.
4641 Returns a TREE_LIST. The TREE_VALUE of each node is a
4642 representation of an assignment-expression. Note that a TREE_LIST
4643 is returned even if there is only a single expression in the list.
4644 error_mark_node is returned if the ( and or ) are
4645 missing. NULL_TREE is returned on no expressions. The parentheses
4646 are eaten. IS_ATTRIBUTE_LIST is true if this is really an attribute
4647 list being parsed. If NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P
4648 indicates whether or not all of the expressions in the list were
4652 cp_parser_parenthesized_expression_list (cp_parser
* parser
,
4653 bool is_attribute_list
,
4655 bool *non_constant_p
)
4657 tree expression_list
= NULL_TREE
;
4658 bool fold_expr_p
= is_attribute_list
;
4659 tree identifier
= NULL_TREE
;
4661 /* Assume all the expressions will be constant. */
4663 *non_constant_p
= false;
4665 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('"))
4666 return error_mark_node
;
4668 /* Consume expressions until there are no more. */
4669 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
4674 /* At the beginning of attribute lists, check to see if the
4675 next token is an identifier. */
4676 if (is_attribute_list
4677 && cp_lexer_peek_token (parser
->lexer
)->type
== CPP_NAME
)
4681 /* Consume the identifier. */
4682 token
= cp_lexer_consume_token (parser
->lexer
);
4683 /* Save the identifier. */
4684 identifier
= token
->value
;
4688 /* Parse the next assignment-expression. */
4691 bool expr_non_constant_p
;
4692 expr
= (cp_parser_constant_expression
4693 (parser
, /*allow_non_constant_p=*/true,
4694 &expr_non_constant_p
));
4695 if (expr_non_constant_p
)
4696 *non_constant_p
= true;
4699 expr
= cp_parser_assignment_expression (parser
, cast_p
);
4702 expr
= fold_non_dependent_expr (expr
);
4704 /* Add it to the list. We add error_mark_node
4705 expressions to the list, so that we can still tell if
4706 the correct form for a parenthesized expression-list
4707 is found. That gives better errors. */
4708 expression_list
= tree_cons (NULL_TREE
, expr
, expression_list
);
4710 if (expr
== error_mark_node
)
4714 /* After the first item, attribute lists look the same as
4715 expression lists. */
4716 is_attribute_list
= false;
4719 /* If the next token isn't a `,', then we are done. */
4720 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
4723 /* Otherwise, consume the `,' and keep going. */
4724 cp_lexer_consume_token (parser
->lexer
);
4727 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'"))
4732 /* We try and resync to an unnested comma, as that will give the
4733 user better diagnostics. */
4734 ending
= cp_parser_skip_to_closing_parenthesis (parser
,
4735 /*recovering=*/true,
4737 /*consume_paren=*/true);
4741 return error_mark_node
;
4744 /* We built up the list in reverse order so we must reverse it now. */
4745 expression_list
= nreverse (expression_list
);
4747 expression_list
= tree_cons (NULL_TREE
, identifier
, expression_list
);
4749 return expression_list
;
4752 /* Parse a pseudo-destructor-name.
4754 pseudo-destructor-name:
4755 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
4756 :: [opt] nested-name-specifier template template-id :: ~ type-name
4757 :: [opt] nested-name-specifier [opt] ~ type-name
4759 If either of the first two productions is used, sets *SCOPE to the
4760 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
4761 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
4762 or ERROR_MARK_NODE if the parse fails. */
4765 cp_parser_pseudo_destructor_name (cp_parser
* parser
,
4769 bool nested_name_specifier_p
;
4771 /* Assume that things will not work out. */
4772 *type
= error_mark_node
;
4774 /* Look for the optional `::' operator. */
4775 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/true);
4776 /* Look for the optional nested-name-specifier. */
4777 nested_name_specifier_p
4778 = (cp_parser_nested_name_specifier_opt (parser
,
4779 /*typename_keyword_p=*/false,
4780 /*check_dependency_p=*/true,
4782 /*is_declaration=*/true)
4784 /* Now, if we saw a nested-name-specifier, we might be doing the
4785 second production. */
4786 if (nested_name_specifier_p
4787 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
4789 /* Consume the `template' keyword. */
4790 cp_lexer_consume_token (parser
->lexer
);
4791 /* Parse the template-id. */
4792 cp_parser_template_id (parser
,
4793 /*template_keyword_p=*/true,
4794 /*check_dependency_p=*/false,
4795 /*is_declaration=*/true);
4796 /* Look for the `::' token. */
4797 cp_parser_require (parser
, CPP_SCOPE
, "`::'");
4799 /* If the next token is not a `~', then there might be some
4800 additional qualification. */
4801 else if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMPL
))
4803 /* Look for the type-name. */
4804 *scope
= TREE_TYPE (cp_parser_type_name (parser
));
4806 if (*scope
== error_mark_node
)
4809 /* If we don't have ::~, then something has gone wrong. Since
4810 the only caller of this function is looking for something
4811 after `.' or `->' after a scalar type, most likely the
4812 program is trying to get a member of a non-aggregate
4814 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SCOPE
)
4815 || cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
!= CPP_COMPL
)
4817 cp_parser_error (parser
, "request for member of non-aggregate type");
4821 /* Look for the `::' token. */
4822 cp_parser_require (parser
, CPP_SCOPE
, "`::'");
4827 /* Look for the `~'. */
4828 cp_parser_require (parser
, CPP_COMPL
, "`~'");
4829 /* Look for the type-name again. We are not responsible for
4830 checking that it matches the first type-name. */
4831 *type
= cp_parser_type_name (parser
);
4834 /* Parse a unary-expression.
4840 unary-operator cast-expression
4841 sizeof unary-expression
4849 __extension__ cast-expression
4850 __alignof__ unary-expression
4851 __alignof__ ( type-id )
4852 __real__ cast-expression
4853 __imag__ cast-expression
4856 ADDRESS_P is true iff the unary-expression is appearing as the
4857 operand of the `&' operator. CAST_P is true if this expression is
4858 the target of a cast.
4860 Returns a representation of the expression. */
4863 cp_parser_unary_expression (cp_parser
*parser
, bool address_p
, bool cast_p
)
4866 enum tree_code unary_operator
;
4868 /* Peek at the next token. */
4869 token
= cp_lexer_peek_token (parser
->lexer
);
4870 /* Some keywords give away the kind of expression. */
4871 if (token
->type
== CPP_KEYWORD
)
4873 enum rid keyword
= token
->keyword
;
4883 op
= keyword
== RID_ALIGNOF
? ALIGNOF_EXPR
: SIZEOF_EXPR
;
4884 /* Consume the token. */
4885 cp_lexer_consume_token (parser
->lexer
);
4886 /* Parse the operand. */
4887 operand
= cp_parser_sizeof_operand (parser
, keyword
);
4889 if (TYPE_P (operand
))
4890 return cxx_sizeof_or_alignof_type (operand
, op
, true);
4892 return cxx_sizeof_or_alignof_expr (operand
, op
);
4896 return cp_parser_new_expression (parser
);
4899 return cp_parser_delete_expression (parser
);
4903 /* The saved value of the PEDANTIC flag. */
4907 /* Save away the PEDANTIC flag. */
4908 cp_parser_extension_opt (parser
, &saved_pedantic
);
4909 /* Parse the cast-expression. */
4910 expr
= cp_parser_simple_cast_expression (parser
);
4911 /* Restore the PEDANTIC flag. */
4912 pedantic
= saved_pedantic
;
4922 /* Consume the `__real__' or `__imag__' token. */
4923 cp_lexer_consume_token (parser
->lexer
);
4924 /* Parse the cast-expression. */
4925 expression
= cp_parser_simple_cast_expression (parser
);
4926 /* Create the complete representation. */
4927 return build_x_unary_op ((keyword
== RID_REALPART
4928 ? REALPART_EXPR
: IMAGPART_EXPR
),
4938 /* Look for the `:: new' and `:: delete', which also signal the
4939 beginning of a new-expression, or delete-expression,
4940 respectively. If the next token is `::', then it might be one of
4942 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
4946 /* See if the token after the `::' is one of the keywords in
4947 which we're interested. */
4948 keyword
= cp_lexer_peek_nth_token (parser
->lexer
, 2)->keyword
;
4949 /* If it's `new', we have a new-expression. */
4950 if (keyword
== RID_NEW
)
4951 return cp_parser_new_expression (parser
);
4952 /* Similarly, for `delete'. */
4953 else if (keyword
== RID_DELETE
)
4954 return cp_parser_delete_expression (parser
);
4957 /* Look for a unary operator. */
4958 unary_operator
= cp_parser_unary_operator (token
);
4959 /* The `++' and `--' operators can be handled similarly, even though
4960 they are not technically unary-operators in the grammar. */
4961 if (unary_operator
== ERROR_MARK
)
4963 if (token
->type
== CPP_PLUS_PLUS
)
4964 unary_operator
= PREINCREMENT_EXPR
;
4965 else if (token
->type
== CPP_MINUS_MINUS
)
4966 unary_operator
= PREDECREMENT_EXPR
;
4967 /* Handle the GNU address-of-label extension. */
4968 else if (cp_parser_allow_gnu_extensions_p (parser
)
4969 && token
->type
== CPP_AND_AND
)
4973 /* Consume the '&&' token. */
4974 cp_lexer_consume_token (parser
->lexer
);
4975 /* Look for the identifier. */
4976 identifier
= cp_parser_identifier (parser
);
4977 /* Create an expression representing the address. */
4978 return finish_label_address_expr (identifier
);
4981 if (unary_operator
!= ERROR_MARK
)
4983 tree cast_expression
;
4984 tree expression
= error_mark_node
;
4985 const char *non_constant_p
= NULL
;
4987 /* Consume the operator token. */
4988 token
= cp_lexer_consume_token (parser
->lexer
);
4989 /* Parse the cast-expression. */
4991 = cp_parser_cast_expression (parser
,
4992 unary_operator
== ADDR_EXPR
,
4994 /* Now, build an appropriate representation. */
4995 switch (unary_operator
)
4998 non_constant_p
= "`*'";
4999 expression
= build_x_indirect_ref (cast_expression
, "unary *");
5003 non_constant_p
= "`&'";
5006 expression
= build_x_unary_op (unary_operator
, cast_expression
);
5009 case PREINCREMENT_EXPR
:
5010 case PREDECREMENT_EXPR
:
5011 non_constant_p
= (unary_operator
== PREINCREMENT_EXPR
5014 case UNARY_PLUS_EXPR
:
5016 case TRUTH_NOT_EXPR
:
5017 expression
= finish_unary_op_expr (unary_operator
, cast_expression
);
5025 && cp_parser_non_integral_constant_expression (parser
,
5027 expression
= error_mark_node
;
5032 return cp_parser_postfix_expression (parser
, address_p
, cast_p
);
5035 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
5036 unary-operator, the corresponding tree code is returned. */
5038 static enum tree_code
5039 cp_parser_unary_operator (cp_token
* token
)
5041 switch (token
->type
)
5044 return INDIRECT_REF
;
5050 return UNARY_PLUS_EXPR
;
5056 return TRUTH_NOT_EXPR
;
5059 return BIT_NOT_EXPR
;
5066 /* Parse a new-expression.
5069 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
5070 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
5072 Returns a representation of the expression. */
5075 cp_parser_new_expression (cp_parser
* parser
)
5077 bool global_scope_p
;
5083 /* Look for the optional `::' operator. */
5085 = (cp_parser_global_scope_opt (parser
,
5086 /*current_scope_valid_p=*/false)
5088 /* Look for the `new' operator. */
5089 cp_parser_require_keyword (parser
, RID_NEW
, "`new'");
5090 /* There's no easy way to tell a new-placement from the
5091 `( type-id )' construct. */
5092 cp_parser_parse_tentatively (parser
);
5093 /* Look for a new-placement. */
5094 placement
= cp_parser_new_placement (parser
);
5095 /* If that didn't work out, there's no new-placement. */
5096 if (!cp_parser_parse_definitely (parser
))
5097 placement
= NULL_TREE
;
5099 /* If the next token is a `(', then we have a parenthesized
5101 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
5103 /* Consume the `('. */
5104 cp_lexer_consume_token (parser
->lexer
);
5105 /* Parse the type-id. */
5106 type
= cp_parser_type_id (parser
);
5107 /* Look for the closing `)'. */
5108 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
5109 /* There should not be a direct-new-declarator in this production,
5110 but GCC used to allowed this, so we check and emit a sensible error
5111 message for this case. */
5112 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
5114 error ("array bound forbidden after parenthesized type-id");
5115 inform ("try removing the parentheses around the type-id");
5116 cp_parser_direct_new_declarator (parser
);
5120 /* Otherwise, there must be a new-type-id. */
5122 type
= cp_parser_new_type_id (parser
, &nelts
);
5124 /* If the next token is a `(', then we have a new-initializer. */
5125 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
5126 initializer
= cp_parser_new_initializer (parser
);
5128 initializer
= NULL_TREE
;
5130 /* A new-expression may not appear in an integral constant
5132 if (cp_parser_non_integral_constant_expression (parser
, "`new'"))
5133 return error_mark_node
;
5135 /* Create a representation of the new-expression. */
5136 return build_new (placement
, type
, nelts
, initializer
, global_scope_p
);
5139 /* Parse a new-placement.
5144 Returns the same representation as for an expression-list. */
5147 cp_parser_new_placement (cp_parser
* parser
)
5149 tree expression_list
;
5151 /* Parse the expression-list. */
5152 expression_list
= (cp_parser_parenthesized_expression_list
5153 (parser
, false, /*cast_p=*/false,
5154 /*non_constant_p=*/NULL
));
5156 return expression_list
;
5159 /* Parse a new-type-id.
5162 type-specifier-seq new-declarator [opt]
5164 Returns the TYPE allocated. If the new-type-id indicates an array
5165 type, *NELTS is set to the number of elements in the last array
5166 bound; the TYPE will not include the last array bound. */
5169 cp_parser_new_type_id (cp_parser
* parser
, tree
*nelts
)
5171 cp_decl_specifier_seq type_specifier_seq
;
5172 cp_declarator
*new_declarator
;
5173 cp_declarator
*declarator
;
5174 cp_declarator
*outer_declarator
;
5175 const char *saved_message
;
5178 /* The type-specifier sequence must not contain type definitions.
5179 (It cannot contain declarations of new types either, but if they
5180 are not definitions we will catch that because they are not
5182 saved_message
= parser
->type_definition_forbidden_message
;
5183 parser
->type_definition_forbidden_message
5184 = "types may not be defined in a new-type-id";
5185 /* Parse the type-specifier-seq. */
5186 cp_parser_type_specifier_seq (parser
, /*is_condition=*/false,
5187 &type_specifier_seq
);
5188 /* Restore the old message. */
5189 parser
->type_definition_forbidden_message
= saved_message
;
5190 /* Parse the new-declarator. */
5191 new_declarator
= cp_parser_new_declarator_opt (parser
);
5193 /* Determine the number of elements in the last array dimension, if
5196 /* Skip down to the last array dimension. */
5197 declarator
= new_declarator
;
5198 outer_declarator
= NULL
;
5199 while (declarator
&& (declarator
->kind
== cdk_pointer
5200 || declarator
->kind
== cdk_ptrmem
))
5202 outer_declarator
= declarator
;
5203 declarator
= declarator
->declarator
;
5206 && declarator
->kind
== cdk_array
5207 && declarator
->declarator
5208 && declarator
->declarator
->kind
== cdk_array
)
5210 outer_declarator
= declarator
;
5211 declarator
= declarator
->declarator
;
5214 if (declarator
&& declarator
->kind
== cdk_array
)
5216 *nelts
= declarator
->u
.array
.bounds
;
5217 if (*nelts
== error_mark_node
)
5218 *nelts
= integer_one_node
;
5220 if (outer_declarator
)
5221 outer_declarator
->declarator
= declarator
->declarator
;
5223 new_declarator
= NULL
;
5226 type
= groktypename (&type_specifier_seq
, new_declarator
);
5227 if (TREE_CODE (type
) == ARRAY_TYPE
&& *nelts
== NULL_TREE
)
5229 *nelts
= array_type_nelts_top (type
);
5230 type
= TREE_TYPE (type
);
5235 /* Parse an (optional) new-declarator.
5238 ptr-operator new-declarator [opt]
5239 direct-new-declarator
5241 Returns the declarator. */
5243 static cp_declarator
*
5244 cp_parser_new_declarator_opt (cp_parser
* parser
)
5246 enum tree_code code
;
5248 cp_cv_quals cv_quals
;
5250 /* We don't know if there's a ptr-operator next, or not. */
5251 cp_parser_parse_tentatively (parser
);
5252 /* Look for a ptr-operator. */
5253 code
= cp_parser_ptr_operator (parser
, &type
, &cv_quals
);
5254 /* If that worked, look for more new-declarators. */
5255 if (cp_parser_parse_definitely (parser
))
5257 cp_declarator
*declarator
;
5259 /* Parse another optional declarator. */
5260 declarator
= cp_parser_new_declarator_opt (parser
);
5262 /* Create the representation of the declarator. */
5264 declarator
= make_ptrmem_declarator (cv_quals
, type
, declarator
);
5265 else if (code
== INDIRECT_REF
)
5266 declarator
= make_pointer_declarator (cv_quals
, declarator
);
5268 declarator
= make_reference_declarator (cv_quals
, declarator
);
5273 /* If the next token is a `[', there is a direct-new-declarator. */
5274 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
5275 return cp_parser_direct_new_declarator (parser
);
5280 /* Parse a direct-new-declarator.
5282 direct-new-declarator:
5284 direct-new-declarator [constant-expression]
5288 static cp_declarator
*
5289 cp_parser_direct_new_declarator (cp_parser
* parser
)
5291 cp_declarator
*declarator
= NULL
;
5297 /* Look for the opening `['. */
5298 cp_parser_require (parser
, CPP_OPEN_SQUARE
, "`['");
5299 /* The first expression is not required to be constant. */
5302 expression
= cp_parser_expression (parser
, /*cast_p=*/false);
5303 /* The standard requires that the expression have integral
5304 type. DR 74 adds enumeration types. We believe that the
5305 real intent is that these expressions be handled like the
5306 expression in a `switch' condition, which also allows
5307 classes with a single conversion to integral or
5308 enumeration type. */
5309 if (!processing_template_decl
)
5312 = build_expr_type_conversion (WANT_INT
| WANT_ENUM
,
5317 error ("expression in new-declarator must have integral "
5318 "or enumeration type");
5319 expression
= error_mark_node
;
5323 /* But all the other expressions must be. */
5326 = cp_parser_constant_expression (parser
,
5327 /*allow_non_constant=*/false,
5329 /* Look for the closing `]'. */
5330 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, "`]'");
5332 /* Add this bound to the declarator. */
5333 declarator
= make_array_declarator (declarator
, expression
);
5335 /* If the next token is not a `[', then there are no more
5337 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_SQUARE
))
5344 /* Parse a new-initializer.
5347 ( expression-list [opt] )
5349 Returns a representation of the expression-list. If there is no
5350 expression-list, VOID_ZERO_NODE is returned. */
5353 cp_parser_new_initializer (cp_parser
* parser
)
5355 tree expression_list
;
5357 expression_list
= (cp_parser_parenthesized_expression_list
5358 (parser
, false, /*cast_p=*/false,
5359 /*non_constant_p=*/NULL
));
5360 if (!expression_list
)
5361 expression_list
= void_zero_node
;
5363 return expression_list
;
5366 /* Parse a delete-expression.
5369 :: [opt] delete cast-expression
5370 :: [opt] delete [ ] cast-expression
5372 Returns a representation of the expression. */
5375 cp_parser_delete_expression (cp_parser
* parser
)
5377 bool global_scope_p
;
5381 /* Look for the optional `::' operator. */
5383 = (cp_parser_global_scope_opt (parser
,
5384 /*current_scope_valid_p=*/false)
5386 /* Look for the `delete' keyword. */
5387 cp_parser_require_keyword (parser
, RID_DELETE
, "`delete'");
5388 /* See if the array syntax is in use. */
5389 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
5391 /* Consume the `[' token. */
5392 cp_lexer_consume_token (parser
->lexer
);
5393 /* Look for the `]' token. */
5394 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, "`]'");
5395 /* Remember that this is the `[]' construct. */
5401 /* Parse the cast-expression. */
5402 expression
= cp_parser_simple_cast_expression (parser
);
5404 /* A delete-expression may not appear in an integral constant
5406 if (cp_parser_non_integral_constant_expression (parser
, "`delete'"))
5407 return error_mark_node
;
5409 return delete_sanity (expression
, NULL_TREE
, array_p
, global_scope_p
);
5412 /* Parse a cast-expression.
5416 ( type-id ) cast-expression
5418 ADDRESS_P is true iff the unary-expression is appearing as the
5419 operand of the `&' operator. CAST_P is true if this expression is
5420 the target of a cast.
5422 Returns a representation of the expression. */
5425 cp_parser_cast_expression (cp_parser
*parser
, bool address_p
, bool cast_p
)
5427 /* If it's a `(', then we might be looking at a cast. */
5428 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
5430 tree type
= NULL_TREE
;
5431 tree expr
= NULL_TREE
;
5432 bool compound_literal_p
;
5433 const char *saved_message
;
5435 /* There's no way to know yet whether or not this is a cast.
5436 For example, `(int (3))' is a unary-expression, while `(int)
5437 3' is a cast. So, we resort to parsing tentatively. */
5438 cp_parser_parse_tentatively (parser
);
5439 /* Types may not be defined in a cast. */
5440 saved_message
= parser
->type_definition_forbidden_message
;
5441 parser
->type_definition_forbidden_message
5442 = "types may not be defined in casts";
5443 /* Consume the `('. */
5444 cp_lexer_consume_token (parser
->lexer
);
5445 /* A very tricky bit is that `(struct S) { 3 }' is a
5446 compound-literal (which we permit in C++ as an extension).
5447 But, that construct is not a cast-expression -- it is a
5448 postfix-expression. (The reason is that `(struct S) { 3 }.i'
5449 is legal; if the compound-literal were a cast-expression,
5450 you'd need an extra set of parentheses.) But, if we parse
5451 the type-id, and it happens to be a class-specifier, then we
5452 will commit to the parse at that point, because we cannot
5453 undo the action that is done when creating a new class. So,
5454 then we cannot back up and do a postfix-expression.
5456 Therefore, we scan ahead to the closing `)', and check to see
5457 if the token after the `)' is a `{'. If so, we are not
5458 looking at a cast-expression.
5460 Save tokens so that we can put them back. */
5461 cp_lexer_save_tokens (parser
->lexer
);
5462 /* Skip tokens until the next token is a closing parenthesis.
5463 If we find the closing `)', and the next token is a `{', then
5464 we are looking at a compound-literal. */
5466 = (cp_parser_skip_to_closing_parenthesis (parser
, false, false,
5467 /*consume_paren=*/true)
5468 && cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
));
5469 /* Roll back the tokens we skipped. */
5470 cp_lexer_rollback_tokens (parser
->lexer
);
5471 /* If we were looking at a compound-literal, simulate an error
5472 so that the call to cp_parser_parse_definitely below will
5474 if (compound_literal_p
)
5475 cp_parser_simulate_error (parser
);
5478 bool saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
5479 parser
->in_type_id_in_expr_p
= true;
5480 /* Look for the type-id. */
5481 type
= cp_parser_type_id (parser
);
5482 /* Look for the closing `)'. */
5483 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
5484 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
5487 /* Restore the saved message. */
5488 parser
->type_definition_forbidden_message
= saved_message
;
5490 /* If ok so far, parse the dependent expression. We cannot be
5491 sure it is a cast. Consider `(T ())'. It is a parenthesized
5492 ctor of T, but looks like a cast to function returning T
5493 without a dependent expression. */
5494 if (!cp_parser_error_occurred (parser
))
5495 expr
= cp_parser_cast_expression (parser
,
5496 /*address_p=*/false,
5499 if (cp_parser_parse_definitely (parser
))
5501 /* Warn about old-style casts, if so requested. */
5502 if (warn_old_style_cast
5503 && !in_system_header
5504 && !VOID_TYPE_P (type
)
5505 && current_lang_name
!= lang_name_c
)
5506 warning (OPT_Wold_style_cast
, "use of old-style cast");
5508 /* Only type conversions to integral or enumeration types
5509 can be used in constant-expressions. */
5510 if (!cast_valid_in_integral_constant_expression_p (type
)
5511 && (cp_parser_non_integral_constant_expression
5513 "a cast to a type other than an integral or "
5514 "enumeration type")))
5515 return error_mark_node
;
5517 /* Perform the cast. */
5518 expr
= build_c_cast (type
, expr
);
5523 /* If we get here, then it's not a cast, so it must be a
5524 unary-expression. */
5525 return cp_parser_unary_expression (parser
, address_p
, cast_p
);
5528 /* Parse a binary expression of the general form:
5532 pm-expression .* cast-expression
5533 pm-expression ->* cast-expression
5535 multiplicative-expression:
5537 multiplicative-expression * pm-expression
5538 multiplicative-expression / pm-expression
5539 multiplicative-expression % pm-expression
5541 additive-expression:
5542 multiplicative-expression
5543 additive-expression + multiplicative-expression
5544 additive-expression - multiplicative-expression
5548 shift-expression << additive-expression
5549 shift-expression >> additive-expression
5551 relational-expression:
5553 relational-expression < shift-expression
5554 relational-expression > shift-expression
5555 relational-expression <= shift-expression
5556 relational-expression >= shift-expression
5560 relational-expression:
5561 relational-expression <? shift-expression
5562 relational-expression >? shift-expression
5564 equality-expression:
5565 relational-expression
5566 equality-expression == relational-expression
5567 equality-expression != relational-expression
5571 and-expression & equality-expression
5573 exclusive-or-expression:
5575 exclusive-or-expression ^ and-expression
5577 inclusive-or-expression:
5578 exclusive-or-expression
5579 inclusive-or-expression | exclusive-or-expression
5581 logical-and-expression:
5582 inclusive-or-expression
5583 logical-and-expression && inclusive-or-expression
5585 logical-or-expression:
5586 logical-and-expression
5587 logical-or-expression || logical-and-expression
5589 All these are implemented with a single function like:
5592 simple-cast-expression
5593 binary-expression <token> binary-expression
5595 CAST_P is true if this expression is the target of a cast.
5597 The binops_by_token map is used to get the tree codes for each <token> type.
5598 binary-expressions are associated according to a precedence table. */
5600 #define TOKEN_PRECEDENCE(token) \
5601 ((token->type == CPP_GREATER && !parser->greater_than_is_operator_p) \
5602 ? PREC_NOT_OPERATOR \
5603 : binops_by_token[token->type].prec)
5606 cp_parser_binary_expression (cp_parser
* parser
, bool cast_p
)
5608 cp_parser_expression_stack stack
;
5609 cp_parser_expression_stack_entry
*sp
= &stack
[0];
5612 enum tree_code tree_type
;
5613 enum cp_parser_prec prec
= PREC_NOT_OPERATOR
, new_prec
, lookahead_prec
;
5616 /* Parse the first expression. */
5617 lhs
= cp_parser_cast_expression (parser
, /*address_p=*/false, cast_p
);
5621 /* Get an operator token. */
5622 token
= cp_lexer_peek_token (parser
->lexer
);
5624 new_prec
= TOKEN_PRECEDENCE (token
);
5626 /* Popping an entry off the stack means we completed a subexpression:
5627 - either we found a token which is not an operator (`>' where it is not
5628 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
5629 will happen repeatedly;
5630 - or, we found an operator which has lower priority. This is the case
5631 where the recursive descent *ascends*, as in `3 * 4 + 5' after
5633 if (new_prec
<= prec
)
5642 tree_type
= binops_by_token
[token
->type
].tree_type
;
5644 /* We used the operator token. */
5645 cp_lexer_consume_token (parser
->lexer
);
5647 /* Extract another operand. It may be the RHS of this expression
5648 or the LHS of a new, higher priority expression. */
5649 rhs
= cp_parser_simple_cast_expression (parser
);
5651 /* Get another operator token. Look up its precedence to avoid
5652 building a useless (immediately popped) stack entry for common
5653 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
5654 token
= cp_lexer_peek_token (parser
->lexer
);
5655 lookahead_prec
= TOKEN_PRECEDENCE (token
);
5656 if (lookahead_prec
> new_prec
)
5658 /* ... and prepare to parse the RHS of the new, higher priority
5659 expression. Since precedence levels on the stack are
5660 monotonically increasing, we do not have to care about
5663 sp
->tree_type
= tree_type
;
5668 new_prec
= lookahead_prec
;
5672 /* If the stack is not empty, we have parsed into LHS the right side
5673 (`4' in the example above) of an expression we had suspended.
5674 We can use the information on the stack to recover the LHS (`3')
5675 from the stack together with the tree code (`MULT_EXPR'), and
5676 the precedence of the higher level subexpression
5677 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
5678 which will be used to actually build the additive expression. */
5681 tree_type
= sp
->tree_type
;
5686 overloaded_p
= false;
5687 lhs
= build_x_binary_op (tree_type
, lhs
, rhs
, &overloaded_p
);
5689 /* If the binary operator required the use of an overloaded operator,
5690 then this expression cannot be an integral constant-expression.
5691 An overloaded operator can be used even if both operands are
5692 otherwise permissible in an integral constant-expression if at
5693 least one of the operands is of enumeration type. */
5696 && (cp_parser_non_integral_constant_expression
5697 (parser
, "calls to overloaded operators")))
5698 return error_mark_node
;
5705 /* Parse the `? expression : assignment-expression' part of a
5706 conditional-expression. The LOGICAL_OR_EXPR is the
5707 logical-or-expression that started the conditional-expression.
5708 Returns a representation of the entire conditional-expression.
5710 This routine is used by cp_parser_assignment_expression.
5712 ? expression : assignment-expression
5716 ? : assignment-expression */
5719 cp_parser_question_colon_clause (cp_parser
* parser
, tree logical_or_expr
)
5722 tree assignment_expr
;
5724 /* Consume the `?' token. */
5725 cp_lexer_consume_token (parser
->lexer
);
5726 if (cp_parser_allow_gnu_extensions_p (parser
)
5727 && cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
5728 /* Implicit true clause. */
5731 /* Parse the expression. */
5732 expr
= cp_parser_expression (parser
, /*cast_p=*/false);
5734 /* The next token should be a `:'. */
5735 cp_parser_require (parser
, CPP_COLON
, "`:'");
5736 /* Parse the assignment-expression. */
5737 assignment_expr
= cp_parser_assignment_expression (parser
, /*cast_p=*/false);
5739 /* Build the conditional-expression. */
5740 return build_x_conditional_expr (logical_or_expr
,
5745 /* Parse an assignment-expression.
5747 assignment-expression:
5748 conditional-expression
5749 logical-or-expression assignment-operator assignment_expression
5752 CAST_P is true if this expression is the target of a cast.
5754 Returns a representation for the expression. */
5757 cp_parser_assignment_expression (cp_parser
* parser
, bool cast_p
)
5761 /* If the next token is the `throw' keyword, then we're looking at
5762 a throw-expression. */
5763 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_THROW
))
5764 expr
= cp_parser_throw_expression (parser
);
5765 /* Otherwise, it must be that we are looking at a
5766 logical-or-expression. */
5769 /* Parse the binary expressions (logical-or-expression). */
5770 expr
= cp_parser_binary_expression (parser
, cast_p
);
5771 /* If the next token is a `?' then we're actually looking at a
5772 conditional-expression. */
5773 if (cp_lexer_next_token_is (parser
->lexer
, CPP_QUERY
))
5774 return cp_parser_question_colon_clause (parser
, expr
);
5777 enum tree_code assignment_operator
;
5779 /* If it's an assignment-operator, we're using the second
5782 = cp_parser_assignment_operator_opt (parser
);
5783 if (assignment_operator
!= ERROR_MARK
)
5787 /* Parse the right-hand side of the assignment. */
5788 rhs
= cp_parser_assignment_expression (parser
, cast_p
);
5789 /* An assignment may not appear in a
5790 constant-expression. */
5791 if (cp_parser_non_integral_constant_expression (parser
,
5793 return error_mark_node
;
5794 /* Build the assignment expression. */
5795 expr
= build_x_modify_expr (expr
,
5796 assignment_operator
,
5805 /* Parse an (optional) assignment-operator.
5807 assignment-operator: one of
5808 = *= /= %= += -= >>= <<= &= ^= |=
5812 assignment-operator: one of
5815 If the next token is an assignment operator, the corresponding tree
5816 code is returned, and the token is consumed. For example, for
5817 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
5818 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
5819 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
5820 operator, ERROR_MARK is returned. */
5822 static enum tree_code
5823 cp_parser_assignment_operator_opt (cp_parser
* parser
)
5828 /* Peek at the next toen. */
5829 token
= cp_lexer_peek_token (parser
->lexer
);
5831 switch (token
->type
)
5842 op
= TRUNC_DIV_EXPR
;
5846 op
= TRUNC_MOD_EXPR
;
5878 /* Nothing else is an assignment operator. */
5882 /* If it was an assignment operator, consume it. */
5883 if (op
!= ERROR_MARK
)
5884 cp_lexer_consume_token (parser
->lexer
);
5889 /* Parse an expression.
5892 assignment-expression
5893 expression , assignment-expression
5895 CAST_P is true if this expression is the target of a cast.
5897 Returns a representation of the expression. */
5900 cp_parser_expression (cp_parser
* parser
, bool cast_p
)
5902 tree expression
= NULL_TREE
;
5906 tree assignment_expression
;
5908 /* Parse the next assignment-expression. */
5909 assignment_expression
5910 = cp_parser_assignment_expression (parser
, cast_p
);
5911 /* If this is the first assignment-expression, we can just
5914 expression
= assignment_expression
;
5916 expression
= build_x_compound_expr (expression
,
5917 assignment_expression
);
5918 /* If the next token is not a comma, then we are done with the
5920 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
5922 /* Consume the `,'. */
5923 cp_lexer_consume_token (parser
->lexer
);
5924 /* A comma operator cannot appear in a constant-expression. */
5925 if (cp_parser_non_integral_constant_expression (parser
,
5926 "a comma operator"))
5927 expression
= error_mark_node
;
5933 /* Parse a constant-expression.
5935 constant-expression:
5936 conditional-expression
5938 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
5939 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
5940 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
5941 is false, NON_CONSTANT_P should be NULL. */
5944 cp_parser_constant_expression (cp_parser
* parser
,
5945 bool allow_non_constant_p
,
5946 bool *non_constant_p
)
5948 bool saved_integral_constant_expression_p
;
5949 bool saved_allow_non_integral_constant_expression_p
;
5950 bool saved_non_integral_constant_expression_p
;
5953 /* It might seem that we could simply parse the
5954 conditional-expression, and then check to see if it were
5955 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
5956 one that the compiler can figure out is constant, possibly after
5957 doing some simplifications or optimizations. The standard has a
5958 precise definition of constant-expression, and we must honor
5959 that, even though it is somewhat more restrictive.
5965 is not a legal declaration, because `(2, 3)' is not a
5966 constant-expression. The `,' operator is forbidden in a
5967 constant-expression. However, GCC's constant-folding machinery
5968 will fold this operation to an INTEGER_CST for `3'. */
5970 /* Save the old settings. */
5971 saved_integral_constant_expression_p
= parser
->integral_constant_expression_p
;
5972 saved_allow_non_integral_constant_expression_p
5973 = parser
->allow_non_integral_constant_expression_p
;
5974 saved_non_integral_constant_expression_p
= parser
->non_integral_constant_expression_p
;
5975 /* We are now parsing a constant-expression. */
5976 parser
->integral_constant_expression_p
= true;
5977 parser
->allow_non_integral_constant_expression_p
= allow_non_constant_p
;
5978 parser
->non_integral_constant_expression_p
= false;
5979 /* Although the grammar says "conditional-expression", we parse an
5980 "assignment-expression", which also permits "throw-expression"
5981 and the use of assignment operators. In the case that
5982 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
5983 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
5984 actually essential that we look for an assignment-expression.
5985 For example, cp_parser_initializer_clauses uses this function to
5986 determine whether a particular assignment-expression is in fact
5988 expression
= cp_parser_assignment_expression (parser
, /*cast_p=*/false);
5989 /* Restore the old settings. */
5990 parser
->integral_constant_expression_p
5991 = saved_integral_constant_expression_p
;
5992 parser
->allow_non_integral_constant_expression_p
5993 = saved_allow_non_integral_constant_expression_p
;
5994 if (allow_non_constant_p
)
5995 *non_constant_p
= parser
->non_integral_constant_expression_p
;
5996 else if (parser
->non_integral_constant_expression_p
)
5997 expression
= error_mark_node
;
5998 parser
->non_integral_constant_expression_p
5999 = saved_non_integral_constant_expression_p
;
6004 /* Parse __builtin_offsetof.
6006 offsetof-expression:
6007 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
6009 offsetof-member-designator:
6011 | offsetof-member-designator "." id-expression
6012 | offsetof-member-designator "[" expression "]" */
6015 cp_parser_builtin_offsetof (cp_parser
*parser
)
6017 int save_ice_p
, save_non_ice_p
;
6021 /* We're about to accept non-integral-constant things, but will
6022 definitely yield an integral constant expression. Save and
6023 restore these values around our local parsing. */
6024 save_ice_p
= parser
->integral_constant_expression_p
;
6025 save_non_ice_p
= parser
->non_integral_constant_expression_p
;
6027 /* Consume the "__builtin_offsetof" token. */
6028 cp_lexer_consume_token (parser
->lexer
);
6029 /* Consume the opening `('. */
6030 cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('");
6031 /* Parse the type-id. */
6032 type
= cp_parser_type_id (parser
);
6033 /* Look for the `,'. */
6034 cp_parser_require (parser
, CPP_COMMA
, "`,'");
6036 /* Build the (type *)null that begins the traditional offsetof macro. */
6037 expr
= build_static_cast (build_pointer_type (type
), null_pointer_node
);
6039 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
6040 expr
= cp_parser_postfix_dot_deref_expression (parser
, CPP_DEREF
, expr
,
6044 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
6045 switch (token
->type
)
6047 case CPP_OPEN_SQUARE
:
6048 /* offsetof-member-designator "[" expression "]" */
6049 expr
= cp_parser_postfix_open_square_expression (parser
, expr
, true);
6053 /* offsetof-member-designator "." identifier */
6054 cp_lexer_consume_token (parser
->lexer
);
6055 expr
= cp_parser_postfix_dot_deref_expression (parser
, CPP_DOT
, expr
,
6059 case CPP_CLOSE_PAREN
:
6060 /* Consume the ")" token. */
6061 cp_lexer_consume_token (parser
->lexer
);
6065 /* Error. We know the following require will fail, but
6066 that gives the proper error message. */
6067 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
6068 cp_parser_skip_to_closing_parenthesis (parser
, true, false, true);
6069 expr
= error_mark_node
;
6075 /* If we're processing a template, we can't finish the semantics yet.
6076 Otherwise we can fold the entire expression now. */
6077 if (processing_template_decl
)
6078 expr
= build1 (OFFSETOF_EXPR
, size_type_node
, expr
);
6080 expr
= finish_offsetof (expr
);
6083 parser
->integral_constant_expression_p
= save_ice_p
;
6084 parser
->non_integral_constant_expression_p
= save_non_ice_p
;
6089 /* Statements [gram.stmt.stmt] */
6091 /* Parse a statement.
6095 expression-statement
6100 declaration-statement
6103 IN_COMPOUND is true when the statement is nested inside a
6104 cp_parser_compound_statement; this matters for certain pragmas. */
6107 cp_parser_statement (cp_parser
* parser
, tree in_statement_expr
,
6112 location_t statement_location
;
6115 /* There is no statement yet. */
6116 statement
= NULL_TREE
;
6117 /* Peek at the next token. */
6118 token
= cp_lexer_peek_token (parser
->lexer
);
6119 /* Remember the location of the first token in the statement. */
6120 statement_location
= token
->location
;
6121 /* If this is a keyword, then that will often determine what kind of
6122 statement we have. */
6123 if (token
->type
== CPP_KEYWORD
)
6125 enum rid keyword
= token
->keyword
;
6131 /* Looks like a labeled-statement with a case label.
6132 Parse the label, and then use tail recursion to parse
6134 cp_parser_label_for_labeled_statement (parser
);
6139 statement
= cp_parser_selection_statement (parser
);
6145 statement
= cp_parser_iteration_statement (parser
);
6152 statement
= cp_parser_jump_statement (parser
);
6155 /* Objective-C++ exception-handling constructs. */
6158 case RID_AT_FINALLY
:
6159 case RID_AT_SYNCHRONIZED
:
6161 statement
= cp_parser_objc_statement (parser
);
6165 statement
= cp_parser_try_block (parser
);
6169 /* It might be a keyword like `int' that can start a
6170 declaration-statement. */
6174 else if (token
->type
== CPP_NAME
)
6176 /* If the next token is a `:', then we are looking at a
6177 labeled-statement. */
6178 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
6179 if (token
->type
== CPP_COLON
)
6181 /* Looks like a labeled-statement with an ordinary label.
6182 Parse the label, and then use tail recursion to parse
6184 cp_parser_label_for_labeled_statement (parser
);
6188 /* Anything that starts with a `{' must be a compound-statement. */
6189 else if (token
->type
== CPP_OPEN_BRACE
)
6190 statement
= cp_parser_compound_statement (parser
, NULL
, false);
6191 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
6192 a statement all its own. */
6193 else if (token
->type
== CPP_PRAGMA
)
6195 /* Only certain OpenMP pragmas are attached to statements, and thus
6196 are considered statements themselves. All others are not. In
6197 the context of a compound, accept the pragma as a "statement" and
6198 return so that we can check for a close brace. Otherwise we
6199 require a real statement and must go back and read one. */
6201 cp_parser_pragma (parser
, pragma_compound
);
6202 else if (!cp_parser_pragma (parser
, pragma_stmt
))
6206 else if (token
->type
== CPP_EOF
)
6208 cp_parser_error (parser
, "expected statement");
6212 /* Everything else must be a declaration-statement or an
6213 expression-statement. Try for the declaration-statement
6214 first, unless we are looking at a `;', in which case we know that
6215 we have an expression-statement. */
6218 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
6220 cp_parser_parse_tentatively (parser
);
6221 /* Try to parse the declaration-statement. */
6222 cp_parser_declaration_statement (parser
);
6223 /* If that worked, we're done. */
6224 if (cp_parser_parse_definitely (parser
))
6227 /* Look for an expression-statement instead. */
6228 statement
= cp_parser_expression_statement (parser
, in_statement_expr
);
6231 /* Set the line number for the statement. */
6232 if (statement
&& STATEMENT_CODE_P (TREE_CODE (statement
)))
6233 SET_EXPR_LOCATION (statement
, statement_location
);
6236 /* Parse the label for a labeled-statement, i.e.
6239 case constant-expression :
6243 case constant-expression ... constant-expression : statement
6245 When a label is parsed without errors, the label is added to the
6246 parse tree by the finish_* functions, so this function doesn't
6247 have to return the label. */
6250 cp_parser_label_for_labeled_statement (cp_parser
* parser
)
6254 /* The next token should be an identifier. */
6255 token
= cp_lexer_peek_token (parser
->lexer
);
6256 if (token
->type
!= CPP_NAME
6257 && token
->type
!= CPP_KEYWORD
)
6259 cp_parser_error (parser
, "expected labeled-statement");
6263 switch (token
->keyword
)
6270 /* Consume the `case' token. */
6271 cp_lexer_consume_token (parser
->lexer
);
6272 /* Parse the constant-expression. */
6273 expr
= cp_parser_constant_expression (parser
,
6274 /*allow_non_constant_p=*/false,
6277 ellipsis
= cp_lexer_peek_token (parser
->lexer
);
6278 if (ellipsis
->type
== CPP_ELLIPSIS
)
6280 /* Consume the `...' token. */
6281 cp_lexer_consume_token (parser
->lexer
);
6283 cp_parser_constant_expression (parser
,
6284 /*allow_non_constant_p=*/false,
6286 /* We don't need to emit warnings here, as the common code
6287 will do this for us. */
6290 expr_hi
= NULL_TREE
;
6292 if (parser
->in_switch_statement_p
)
6293 finish_case_label (expr
, expr_hi
);
6295 error ("case label %qE not within a switch statement", expr
);
6300 /* Consume the `default' token. */
6301 cp_lexer_consume_token (parser
->lexer
);
6303 if (parser
->in_switch_statement_p
)
6304 finish_case_label (NULL_TREE
, NULL_TREE
);
6306 error ("case label not within a switch statement");
6310 /* Anything else must be an ordinary label. */
6311 finish_label_stmt (cp_parser_identifier (parser
));
6315 /* Require the `:' token. */
6316 cp_parser_require (parser
, CPP_COLON
, "`:'");
6319 /* Parse an expression-statement.
6321 expression-statement:
6324 Returns the new EXPR_STMT -- or NULL_TREE if the expression
6325 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
6326 indicates whether this expression-statement is part of an
6327 expression statement. */
6330 cp_parser_expression_statement (cp_parser
* parser
, tree in_statement_expr
)
6332 tree statement
= NULL_TREE
;
6334 /* If the next token is a ';', then there is no expression
6336 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
6337 statement
= cp_parser_expression (parser
, /*cast_p=*/false);
6339 /* Consume the final `;'. */
6340 cp_parser_consume_semicolon_at_end_of_statement (parser
);
6342 if (in_statement_expr
6343 && cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
6344 /* This is the final expression statement of a statement
6346 statement
= finish_stmt_expr_expr (statement
, in_statement_expr
);
6348 statement
= finish_expr_stmt (statement
);
6355 /* Parse a compound-statement.
6358 { statement-seq [opt] }
6360 Returns a tree representing the statement. */
6363 cp_parser_compound_statement (cp_parser
*parser
, tree in_statement_expr
,
6368 /* Consume the `{'. */
6369 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, "`{'"))
6370 return error_mark_node
;
6371 /* Begin the compound-statement. */
6372 compound_stmt
= begin_compound_stmt (in_try
? BCS_TRY_BLOCK
: 0);
6373 /* Parse an (optional) statement-seq. */
6374 cp_parser_statement_seq_opt (parser
, in_statement_expr
);
6375 /* Finish the compound-statement. */
6376 finish_compound_stmt (compound_stmt
);
6377 /* Consume the `}'. */
6378 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "`}'");
6380 return compound_stmt
;
6383 /* Parse an (optional) statement-seq.
6387 statement-seq [opt] statement */
6390 cp_parser_statement_seq_opt (cp_parser
* parser
, tree in_statement_expr
)
6392 /* Scan statements until there aren't any more. */
6395 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
6397 /* If we're looking at a `}', then we've run out of statements. */
6398 if (token
->type
== CPP_CLOSE_BRACE
6399 || token
->type
== CPP_EOF
6400 || token
->type
== CPP_PRAGMA_EOL
)
6403 /* Parse the statement. */
6404 cp_parser_statement (parser
, in_statement_expr
, true);
6408 /* Parse a selection-statement.
6410 selection-statement:
6411 if ( condition ) statement
6412 if ( condition ) statement else statement
6413 switch ( condition ) statement
6415 Returns the new IF_STMT or SWITCH_STMT. */
6418 cp_parser_selection_statement (cp_parser
* parser
)
6423 /* Peek at the next token. */
6424 token
= cp_parser_require (parser
, CPP_KEYWORD
, "selection-statement");
6426 /* See what kind of keyword it is. */
6427 keyword
= token
->keyword
;
6436 /* Look for the `('. */
6437 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('"))
6439 cp_parser_skip_to_end_of_statement (parser
);
6440 return error_mark_node
;
6443 /* Begin the selection-statement. */
6444 if (keyword
== RID_IF
)
6445 statement
= begin_if_stmt ();
6447 statement
= begin_switch_stmt ();
6449 /* Parse the condition. */
6450 condition
= cp_parser_condition (parser
);
6451 /* Look for the `)'. */
6452 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'"))
6453 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
6454 /*consume_paren=*/true);
6456 if (keyword
== RID_IF
)
6458 /* Add the condition. */
6459 finish_if_stmt_cond (condition
, statement
);
6461 /* Parse the then-clause. */
6462 cp_parser_implicitly_scoped_statement (parser
);
6463 finish_then_clause (statement
);
6465 /* If the next token is `else', parse the else-clause. */
6466 if (cp_lexer_next_token_is_keyword (parser
->lexer
,
6469 /* Consume the `else' keyword. */
6470 cp_lexer_consume_token (parser
->lexer
);
6471 begin_else_clause (statement
);
6472 /* Parse the else-clause. */
6473 cp_parser_implicitly_scoped_statement (parser
);
6474 finish_else_clause (statement
);
6477 /* Now we're all done with the if-statement. */
6478 finish_if_stmt (statement
);
6482 bool in_switch_statement_p
;
6483 unsigned char in_statement
;
6485 /* Add the condition. */
6486 finish_switch_cond (condition
, statement
);
6488 /* Parse the body of the switch-statement. */
6489 in_switch_statement_p
= parser
->in_switch_statement_p
;
6490 in_statement
= parser
->in_statement
;
6491 parser
->in_switch_statement_p
= true;
6492 parser
->in_statement
|= IN_SWITCH_STMT
;
6493 cp_parser_implicitly_scoped_statement (parser
);
6494 parser
->in_switch_statement_p
= in_switch_statement_p
;
6495 parser
->in_statement
= in_statement
;
6497 /* Now we're all done with the switch-statement. */
6498 finish_switch_stmt (statement
);
6506 cp_parser_error (parser
, "expected selection-statement");
6507 return error_mark_node
;
6511 /* Parse a condition.
6515 type-specifier-seq declarator = assignment-expression
6520 type-specifier-seq declarator asm-specification [opt]
6521 attributes [opt] = assignment-expression
6523 Returns the expression that should be tested. */
6526 cp_parser_condition (cp_parser
* parser
)
6528 cp_decl_specifier_seq type_specifiers
;
6529 const char *saved_message
;
6531 /* Try the declaration first. */
6532 cp_parser_parse_tentatively (parser
);
6533 /* New types are not allowed in the type-specifier-seq for a
6535 saved_message
= parser
->type_definition_forbidden_message
;
6536 parser
->type_definition_forbidden_message
6537 = "types may not be defined in conditions";
6538 /* Parse the type-specifier-seq. */
6539 cp_parser_type_specifier_seq (parser
, /*is_condition==*/true,
6541 /* Restore the saved message. */
6542 parser
->type_definition_forbidden_message
= saved_message
;
6543 /* If all is well, we might be looking at a declaration. */
6544 if (!cp_parser_error_occurred (parser
))
6547 tree asm_specification
;
6549 cp_declarator
*declarator
;
6550 tree initializer
= NULL_TREE
;
6552 /* Parse the declarator. */
6553 declarator
= cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
6554 /*ctor_dtor_or_conv_p=*/NULL
,
6555 /*parenthesized_p=*/NULL
,
6556 /*member_p=*/false);
6557 /* Parse the attributes. */
6558 attributes
= cp_parser_attributes_opt (parser
);
6559 /* Parse the asm-specification. */
6560 asm_specification
= cp_parser_asm_specification_opt (parser
);
6561 /* If the next token is not an `=', then we might still be
6562 looking at an expression. For example:
6566 looks like a decl-specifier-seq and a declarator -- but then
6567 there is no `=', so this is an expression. */
6568 cp_parser_require (parser
, CPP_EQ
, "`='");
6569 /* If we did see an `=', then we are looking at a declaration
6571 if (cp_parser_parse_definitely (parser
))
6574 bool non_constant_p
;
6576 /* Create the declaration. */
6577 decl
= start_decl (declarator
, &type_specifiers
,
6578 /*initialized_p=*/true,
6579 attributes
, /*prefix_attributes=*/NULL_TREE
,
6581 /* Parse the assignment-expression. */
6583 = cp_parser_constant_expression (parser
,
6584 /*allow_non_constant_p=*/true,
6586 if (!non_constant_p
)
6587 initializer
= fold_non_dependent_expr (initializer
);
6589 /* Process the initializer. */
6590 cp_finish_decl (decl
,
6591 initializer
, !non_constant_p
,
6593 LOOKUP_ONLYCONVERTING
);
6596 pop_scope (pushed_scope
);
6598 return convert_from_reference (decl
);
6601 /* If we didn't even get past the declarator successfully, we are
6602 definitely not looking at a declaration. */
6604 cp_parser_abort_tentative_parse (parser
);
6606 /* Otherwise, we are looking at an expression. */
6607 return cp_parser_expression (parser
, /*cast_p=*/false);
6610 /* Parse an iteration-statement.
6612 iteration-statement:
6613 while ( condition ) statement
6614 do statement while ( expression ) ;
6615 for ( for-init-statement condition [opt] ; expression [opt] )
6618 Returns the new WHILE_STMT, DO_STMT, or FOR_STMT. */
6621 cp_parser_iteration_statement (cp_parser
* parser
)
6626 unsigned char in_statement
;
6628 /* Peek at the next token. */
6629 token
= cp_parser_require (parser
, CPP_KEYWORD
, "iteration-statement");
6631 return error_mark_node
;
6633 /* Remember whether or not we are already within an iteration
6635 in_statement
= parser
->in_statement
;
6637 /* See what kind of keyword it is. */
6638 keyword
= token
->keyword
;
6645 /* Begin the while-statement. */
6646 statement
= begin_while_stmt ();
6647 /* Look for the `('. */
6648 cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('");
6649 /* Parse the condition. */
6650 condition
= cp_parser_condition (parser
);
6651 finish_while_stmt_cond (condition
, statement
);
6652 /* Look for the `)'. */
6653 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
6654 /* Parse the dependent statement. */
6655 parser
->in_statement
= IN_ITERATION_STMT
;
6656 cp_parser_already_scoped_statement (parser
);
6657 parser
->in_statement
= in_statement
;
6658 /* We're done with the while-statement. */
6659 finish_while_stmt (statement
);
6667 /* Begin the do-statement. */
6668 statement
= begin_do_stmt ();
6669 /* Parse the body of the do-statement. */
6670 parser
->in_statement
= IN_ITERATION_STMT
;
6671 cp_parser_implicitly_scoped_statement (parser
);
6672 parser
->in_statement
= in_statement
;
6673 finish_do_body (statement
);
6674 /* Look for the `while' keyword. */
6675 cp_parser_require_keyword (parser
, RID_WHILE
, "`while'");
6676 /* Look for the `('. */
6677 cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('");
6678 /* Parse the expression. */
6679 expression
= cp_parser_expression (parser
, /*cast_p=*/false);
6680 /* We're done with the do-statement. */
6681 finish_do_stmt (expression
, statement
);
6682 /* Look for the `)'. */
6683 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
6684 /* Look for the `;'. */
6685 cp_parser_require (parser
, CPP_SEMICOLON
, "`;'");
6691 tree condition
= NULL_TREE
;
6692 tree expression
= NULL_TREE
;
6694 /* Begin the for-statement. */
6695 statement
= begin_for_stmt ();
6696 /* Look for the `('. */
6697 cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('");
6698 /* Parse the initialization. */
6699 cp_parser_for_init_statement (parser
);
6700 finish_for_init_stmt (statement
);
6702 /* If there's a condition, process it. */
6703 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
6704 condition
= cp_parser_condition (parser
);
6705 finish_for_cond (condition
, statement
);
6706 /* Look for the `;'. */
6707 cp_parser_require (parser
, CPP_SEMICOLON
, "`;'");
6709 /* If there's an expression, process it. */
6710 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
6711 expression
= cp_parser_expression (parser
, /*cast_p=*/false);
6712 finish_for_expr (expression
, statement
);
6713 /* Look for the `)'. */
6714 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
6716 /* Parse the body of the for-statement. */
6717 parser
->in_statement
= IN_ITERATION_STMT
;
6718 cp_parser_already_scoped_statement (parser
);
6719 parser
->in_statement
= in_statement
;
6721 /* We're done with the for-statement. */
6722 finish_for_stmt (statement
);
6727 cp_parser_error (parser
, "expected iteration-statement");
6728 statement
= error_mark_node
;
6735 /* Parse a for-init-statement.
6738 expression-statement
6739 simple-declaration */
6742 cp_parser_for_init_statement (cp_parser
* parser
)
6744 /* If the next token is a `;', then we have an empty
6745 expression-statement. Grammatically, this is also a
6746 simple-declaration, but an invalid one, because it does not
6747 declare anything. Therefore, if we did not handle this case
6748 specially, we would issue an error message about an invalid
6750 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
6752 /* We're going to speculatively look for a declaration, falling back
6753 to an expression, if necessary. */
6754 cp_parser_parse_tentatively (parser
);
6755 /* Parse the declaration. */
6756 cp_parser_simple_declaration (parser
,
6757 /*function_definition_allowed_p=*/false);
6758 /* If the tentative parse failed, then we shall need to look for an
6759 expression-statement. */
6760 if (cp_parser_parse_definitely (parser
))
6764 cp_parser_expression_statement (parser
, false);
6767 /* Parse a jump-statement.
6772 return expression [opt] ;
6780 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
6783 cp_parser_jump_statement (cp_parser
* parser
)
6785 tree statement
= error_mark_node
;
6789 /* Peek at the next token. */
6790 token
= cp_parser_require (parser
, CPP_KEYWORD
, "jump-statement");
6792 return error_mark_node
;
6794 /* See what kind of keyword it is. */
6795 keyword
= token
->keyword
;
6799 switch (parser
->in_statement
)
6802 error ("break statement not within loop or switch");
6805 gcc_assert ((parser
->in_statement
& IN_SWITCH_STMT
)
6806 || parser
->in_statement
== IN_ITERATION_STMT
);
6807 statement
= finish_break_stmt ();
6810 error ("invalid exit from OpenMP structured block");
6813 error ("break statement used with OpenMP for loop");
6816 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
6820 switch (parser
->in_statement
& ~IN_SWITCH_STMT
)
6823 error ("continue statement not within a loop");
6825 case IN_ITERATION_STMT
:
6827 statement
= finish_continue_stmt ();
6830 error ("invalid exit from OpenMP structured block");
6835 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
6842 /* If the next token is a `;', then there is no
6844 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
6845 expr
= cp_parser_expression (parser
, /*cast_p=*/false);
6848 /* Build the return-statement. */
6849 statement
= finish_return_stmt (expr
);
6850 /* Look for the final `;'. */
6851 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
6856 /* Create the goto-statement. */
6857 if (cp_lexer_next_token_is (parser
->lexer
, CPP_MULT
))
6859 /* Issue a warning about this use of a GNU extension. */
6861 pedwarn ("ISO C++ forbids computed gotos");
6862 /* Consume the '*' token. */
6863 cp_lexer_consume_token (parser
->lexer
);
6864 /* Parse the dependent expression. */
6865 finish_goto_stmt (cp_parser_expression (parser
, /*cast_p=*/false));
6868 finish_goto_stmt (cp_parser_identifier (parser
));
6869 /* Look for the final `;'. */
6870 cp_parser_require (parser
, CPP_SEMICOLON
, "%<;%>");
6874 cp_parser_error (parser
, "expected jump-statement");
6881 /* Parse a declaration-statement.
6883 declaration-statement:
6884 block-declaration */
6887 cp_parser_declaration_statement (cp_parser
* parser
)
6891 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
6892 p
= obstack_alloc (&declarator_obstack
, 0);
6894 /* Parse the block-declaration. */
6895 cp_parser_block_declaration (parser
, /*statement_p=*/true);
6897 /* Free any declarators allocated. */
6898 obstack_free (&declarator_obstack
, p
);
6900 /* Finish off the statement. */
6904 /* Some dependent statements (like `if (cond) statement'), are
6905 implicitly in their own scope. In other words, if the statement is
6906 a single statement (as opposed to a compound-statement), it is
6907 none-the-less treated as if it were enclosed in braces. Any
6908 declarations appearing in the dependent statement are out of scope
6909 after control passes that point. This function parses a statement,
6910 but ensures that is in its own scope, even if it is not a
6913 Returns the new statement. */
6916 cp_parser_implicitly_scoped_statement (cp_parser
* parser
)
6920 /* Mark if () ; with a special NOP_EXPR. */
6921 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
6923 cp_lexer_consume_token (parser
->lexer
);
6924 statement
= add_stmt (build_empty_stmt ());
6926 /* if a compound is opened, we simply parse the statement directly. */
6927 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
6928 statement
= cp_parser_compound_statement (parser
, NULL
, false);
6929 /* If the token is not a `{', then we must take special action. */
6932 /* Create a compound-statement. */
6933 statement
= begin_compound_stmt (0);
6934 /* Parse the dependent-statement. */
6935 cp_parser_statement (parser
, NULL_TREE
, false);
6936 /* Finish the dummy compound-statement. */
6937 finish_compound_stmt (statement
);
6940 /* Return the statement. */
6944 /* For some dependent statements (like `while (cond) statement'), we
6945 have already created a scope. Therefore, even if the dependent
6946 statement is a compound-statement, we do not want to create another
6950 cp_parser_already_scoped_statement (cp_parser
* parser
)
6952 /* If the token is a `{', then we must take special action. */
6953 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
))
6954 cp_parser_statement (parser
, NULL_TREE
, false);
6957 /* Avoid calling cp_parser_compound_statement, so that we
6958 don't create a new scope. Do everything else by hand. */
6959 cp_parser_require (parser
, CPP_OPEN_BRACE
, "`{'");
6960 cp_parser_statement_seq_opt (parser
, NULL_TREE
);
6961 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "`}'");
6965 /* Declarations [gram.dcl.dcl] */
6967 /* Parse an optional declaration-sequence.
6971 declaration-seq declaration */
6974 cp_parser_declaration_seq_opt (cp_parser
* parser
)
6980 token
= cp_lexer_peek_token (parser
->lexer
);
6982 if (token
->type
== CPP_CLOSE_BRACE
6983 || token
->type
== CPP_EOF
6984 || token
->type
== CPP_PRAGMA_EOL
)
6987 if (token
->type
== CPP_SEMICOLON
)
6989 /* A declaration consisting of a single semicolon is
6990 invalid. Allow it unless we're being pedantic. */
6991 cp_lexer_consume_token (parser
->lexer
);
6992 if (pedantic
&& !in_system_header
)
6993 pedwarn ("extra %<;%>");
6997 /* If we're entering or exiting a region that's implicitly
6998 extern "C", modify the lang context appropriately. */
6999 if (!parser
->implicit_extern_c
&& token
->implicit_extern_c
)
7001 push_lang_context (lang_name_c
);
7002 parser
->implicit_extern_c
= true;
7004 else if (parser
->implicit_extern_c
&& !token
->implicit_extern_c
)
7006 pop_lang_context ();
7007 parser
->implicit_extern_c
= false;
7010 if (token
->type
== CPP_PRAGMA
)
7012 /* A top-level declaration can consist solely of a #pragma.
7013 A nested declaration cannot, so this is done here and not
7014 in cp_parser_declaration. (A #pragma at block scope is
7015 handled in cp_parser_statement.) */
7016 cp_parser_pragma (parser
, pragma_external
);
7020 /* Parse the declaration itself. */
7021 cp_parser_declaration (parser
);
7025 /* Parse a declaration.
7030 template-declaration
7031 explicit-instantiation
7032 explicit-specialization
7033 linkage-specification
7034 namespace-definition
7039 __extension__ declaration */
7042 cp_parser_declaration (cp_parser
* parser
)
7049 /* Check for the `__extension__' keyword. */
7050 if (cp_parser_extension_opt (parser
, &saved_pedantic
))
7052 /* Parse the qualified declaration. */
7053 cp_parser_declaration (parser
);
7054 /* Restore the PEDANTIC flag. */
7055 pedantic
= saved_pedantic
;
7060 /* Try to figure out what kind of declaration is present. */
7061 token1
= *cp_lexer_peek_token (parser
->lexer
);
7063 if (token1
.type
!= CPP_EOF
)
7064 token2
= *cp_lexer_peek_nth_token (parser
->lexer
, 2);
7067 token2
.type
= CPP_EOF
;
7068 token2
.keyword
= RID_MAX
;
7071 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
7072 p
= obstack_alloc (&declarator_obstack
, 0);
7074 /* If the next token is `extern' and the following token is a string
7075 literal, then we have a linkage specification. */
7076 if (token1
.keyword
== RID_EXTERN
7077 && cp_parser_is_string_literal (&token2
))
7078 cp_parser_linkage_specification (parser
);
7079 /* If the next token is `template', then we have either a template
7080 declaration, an explicit instantiation, or an explicit
7082 else if (token1
.keyword
== RID_TEMPLATE
)
7084 /* `template <>' indicates a template specialization. */
7085 if (token2
.type
== CPP_LESS
7086 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_GREATER
)
7087 cp_parser_explicit_specialization (parser
);
7088 /* `template <' indicates a template declaration. */
7089 else if (token2
.type
== CPP_LESS
)
7090 cp_parser_template_declaration (parser
, /*member_p=*/false);
7091 /* Anything else must be an explicit instantiation. */
7093 cp_parser_explicit_instantiation (parser
);
7095 /* If the next token is `export', then we have a template
7097 else if (token1
.keyword
== RID_EXPORT
)
7098 cp_parser_template_declaration (parser
, /*member_p=*/false);
7099 /* If the next token is `extern', 'static' or 'inline' and the one
7100 after that is `template', we have a GNU extended explicit
7101 instantiation directive. */
7102 else if (cp_parser_allow_gnu_extensions_p (parser
)
7103 && (token1
.keyword
== RID_EXTERN
7104 || token1
.keyword
== RID_STATIC
7105 || token1
.keyword
== RID_INLINE
)
7106 && token2
.keyword
== RID_TEMPLATE
)
7107 cp_parser_explicit_instantiation (parser
);
7108 /* If the next token is `namespace', check for a named or unnamed
7109 namespace definition. */
7110 else if (token1
.keyword
== RID_NAMESPACE
7111 && (/* A named namespace definition. */
7112 (token2
.type
== CPP_NAME
7113 && (cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
7115 /* An unnamed namespace definition. */
7116 || token2
.type
== CPP_OPEN_BRACE
7117 || token2
.keyword
== RID_ATTRIBUTE
))
7118 cp_parser_namespace_definition (parser
);
7119 /* Objective-C++ declaration/definition. */
7120 else if (c_dialect_objc () && OBJC_IS_AT_KEYWORD (token1
.keyword
))
7121 cp_parser_objc_declaration (parser
);
7122 /* We must have either a block declaration or a function
7125 /* Try to parse a block-declaration, or a function-definition. */
7126 cp_parser_block_declaration (parser
, /*statement_p=*/false);
7128 /* Free any declarators allocated. */
7129 obstack_free (&declarator_obstack
, p
);
7132 /* Parse a block-declaration.
7137 namespace-alias-definition
7144 __extension__ block-declaration
7147 If STATEMENT_P is TRUE, then this block-declaration is occurring as
7148 part of a declaration-statement. */
7151 cp_parser_block_declaration (cp_parser
*parser
,
7157 /* Check for the `__extension__' keyword. */
7158 if (cp_parser_extension_opt (parser
, &saved_pedantic
))
7160 /* Parse the qualified declaration. */
7161 cp_parser_block_declaration (parser
, statement_p
);
7162 /* Restore the PEDANTIC flag. */
7163 pedantic
= saved_pedantic
;
7168 /* Peek at the next token to figure out which kind of declaration is
7170 token1
= cp_lexer_peek_token (parser
->lexer
);
7172 /* If the next keyword is `asm', we have an asm-definition. */
7173 if (token1
->keyword
== RID_ASM
)
7176 cp_parser_commit_to_tentative_parse (parser
);
7177 cp_parser_asm_definition (parser
);
7179 /* If the next keyword is `namespace', we have a
7180 namespace-alias-definition. */
7181 else if (token1
->keyword
== RID_NAMESPACE
)
7182 cp_parser_namespace_alias_definition (parser
);
7183 /* If the next keyword is `using', we have either a
7184 using-declaration or a using-directive. */
7185 else if (token1
->keyword
== RID_USING
)
7190 cp_parser_commit_to_tentative_parse (parser
);
7191 /* If the token after `using' is `namespace', then we have a
7193 token2
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
7194 if (token2
->keyword
== RID_NAMESPACE
)
7195 cp_parser_using_directive (parser
);
7196 /* Otherwise, it's a using-declaration. */
7198 cp_parser_using_declaration (parser
,
7199 /*access_declaration_p=*/false);
7201 /* If the next keyword is `__label__' we have a label declaration. */
7202 else if (token1
->keyword
== RID_LABEL
)
7205 cp_parser_commit_to_tentative_parse (parser
);
7206 cp_parser_label_declaration (parser
);
7208 /* Anything else must be a simple-declaration. */
7210 cp_parser_simple_declaration (parser
, !statement_p
);
7213 /* Parse a simple-declaration.
7216 decl-specifier-seq [opt] init-declarator-list [opt] ;
7218 init-declarator-list:
7220 init-declarator-list , init-declarator
7222 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
7223 function-definition as a simple-declaration. */
7226 cp_parser_simple_declaration (cp_parser
* parser
,
7227 bool function_definition_allowed_p
)
7229 cp_decl_specifier_seq decl_specifiers
;
7230 int declares_class_or_enum
;
7231 bool saw_declarator
;
7233 /* Defer access checks until we know what is being declared; the
7234 checks for names appearing in the decl-specifier-seq should be
7235 done as if we were in the scope of the thing being declared. */
7236 push_deferring_access_checks (dk_deferred
);
7238 /* Parse the decl-specifier-seq. We have to keep track of whether
7239 or not the decl-specifier-seq declares a named class or
7240 enumeration type, since that is the only case in which the
7241 init-declarator-list is allowed to be empty.
7245 In a simple-declaration, the optional init-declarator-list can be
7246 omitted only when declaring a class or enumeration, that is when
7247 the decl-specifier-seq contains either a class-specifier, an
7248 elaborated-type-specifier, or an enum-specifier. */
7249 cp_parser_decl_specifier_seq (parser
,
7250 CP_PARSER_FLAGS_OPTIONAL
,
7252 &declares_class_or_enum
);
7253 /* We no longer need to defer access checks. */
7254 stop_deferring_access_checks ();
7256 /* In a block scope, a valid declaration must always have a
7257 decl-specifier-seq. By not trying to parse declarators, we can
7258 resolve the declaration/expression ambiguity more quickly. */
7259 if (!function_definition_allowed_p
7260 && !decl_specifiers
.any_specifiers_p
)
7262 cp_parser_error (parser
, "expected declaration");
7266 /* If the next two tokens are both identifiers, the code is
7267 erroneous. The usual cause of this situation is code like:
7271 where "T" should name a type -- but does not. */
7272 if (!decl_specifiers
.type
7273 && cp_parser_parse_and_diagnose_invalid_type_name (parser
))
7275 /* If parsing tentatively, we should commit; we really are
7276 looking at a declaration. */
7277 cp_parser_commit_to_tentative_parse (parser
);
7282 /* If we have seen at least one decl-specifier, and the next token
7283 is not a parenthesis, then we must be looking at a declaration.
7284 (After "int (" we might be looking at a functional cast.) */
7285 if (decl_specifiers
.any_specifiers_p
7286 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_PAREN
))
7287 cp_parser_commit_to_tentative_parse (parser
);
7289 /* Keep going until we hit the `;' at the end of the simple
7291 saw_declarator
= false;
7292 while (cp_lexer_next_token_is_not (parser
->lexer
,
7296 bool function_definition_p
;
7301 /* If we are processing next declarator, coma is expected */
7302 token
= cp_lexer_peek_token (parser
->lexer
);
7303 gcc_assert (token
->type
== CPP_COMMA
);
7304 cp_lexer_consume_token (parser
->lexer
);
7307 saw_declarator
= true;
7309 /* Parse the init-declarator. */
7310 decl
= cp_parser_init_declarator (parser
, &decl_specifiers
,
7311 /*checks=*/NULL_TREE
,
7312 function_definition_allowed_p
,
7314 declares_class_or_enum
,
7315 &function_definition_p
);
7316 /* If an error occurred while parsing tentatively, exit quickly.
7317 (That usually happens when in the body of a function; each
7318 statement is treated as a declaration-statement until proven
7320 if (cp_parser_error_occurred (parser
))
7322 /* Handle function definitions specially. */
7323 if (function_definition_p
)
7325 /* If the next token is a `,', then we are probably
7326 processing something like:
7330 which is erroneous. */
7331 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
7332 error ("mixing declarations and function-definitions is forbidden");
7333 /* Otherwise, we're done with the list of declarators. */
7336 pop_deferring_access_checks ();
7340 /* The next token should be either a `,' or a `;'. */
7341 token
= cp_lexer_peek_token (parser
->lexer
);
7342 /* If it's a `,', there are more declarators to come. */
7343 if (token
->type
== CPP_COMMA
)
7344 /* will be consumed next time around */;
7345 /* If it's a `;', we are done. */
7346 else if (token
->type
== CPP_SEMICOLON
)
7348 /* Anything else is an error. */
7351 /* If we have already issued an error message we don't need
7352 to issue another one. */
7353 if (decl
!= error_mark_node
7354 || cp_parser_uncommitted_to_tentative_parse_p (parser
))
7355 cp_parser_error (parser
, "expected %<,%> or %<;%>");
7356 /* Skip tokens until we reach the end of the statement. */
7357 cp_parser_skip_to_end_of_statement (parser
);
7358 /* If the next token is now a `;', consume it. */
7359 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
7360 cp_lexer_consume_token (parser
->lexer
);
7363 /* After the first time around, a function-definition is not
7364 allowed -- even if it was OK at first. For example:
7369 function_definition_allowed_p
= false;
7372 /* Issue an error message if no declarators are present, and the
7373 decl-specifier-seq does not itself declare a class or
7375 if (!saw_declarator
)
7377 if (cp_parser_declares_only_class_p (parser
))
7378 shadow_tag (&decl_specifiers
);
7379 /* Perform any deferred access checks. */
7380 perform_deferred_access_checks ();
7383 /* Consume the `;'. */
7384 cp_parser_require (parser
, CPP_SEMICOLON
, "`;'");
7387 pop_deferring_access_checks ();
7390 /* Parse a decl-specifier-seq.
7393 decl-specifier-seq [opt] decl-specifier
7396 storage-class-specifier
7407 Set *DECL_SPECS to a representation of the decl-specifier-seq.
7409 The parser flags FLAGS is used to control type-specifier parsing.
7411 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
7414 1: one of the decl-specifiers is an elaborated-type-specifier
7415 (i.e., a type declaration)
7416 2: one of the decl-specifiers is an enum-specifier or a
7417 class-specifier (i.e., a type definition)
7422 cp_parser_decl_specifier_seq (cp_parser
* parser
,
7423 cp_parser_flags flags
,
7424 cp_decl_specifier_seq
*decl_specs
,
7425 int* declares_class_or_enum
)
7427 bool constructor_possible_p
= !parser
->in_declarator_p
;
7429 /* Clear DECL_SPECS. */
7430 clear_decl_specs (decl_specs
);
7432 /* Assume no class or enumeration type is declared. */
7433 *declares_class_or_enum
= 0;
7435 /* Keep reading specifiers until there are no more to read. */
7439 bool found_decl_spec
;
7442 /* Peek at the next token. */
7443 token
= cp_lexer_peek_token (parser
->lexer
);
7444 /* Handle attributes. */
7445 if (token
->keyword
== RID_ATTRIBUTE
)
7447 /* Parse the attributes. */
7448 decl_specs
->attributes
7449 = chainon (decl_specs
->attributes
,
7450 cp_parser_attributes_opt (parser
));
7453 /* Assume we will find a decl-specifier keyword. */
7454 found_decl_spec
= true;
7455 /* If the next token is an appropriate keyword, we can simply
7456 add it to the list. */
7457 switch (token
->keyword
)
7462 if (!at_class_scope_p ())
7464 error ("%<friend%> used outside of class");
7465 cp_lexer_purge_token (parser
->lexer
);
7469 ++decl_specs
->specs
[(int) ds_friend
];
7470 /* Consume the token. */
7471 cp_lexer_consume_token (parser
->lexer
);
7475 /* function-specifier:
7482 cp_parser_function_specifier_opt (parser
, decl_specs
);
7488 ++decl_specs
->specs
[(int) ds_typedef
];
7489 /* Consume the token. */
7490 cp_lexer_consume_token (parser
->lexer
);
7491 /* A constructor declarator cannot appear in a typedef. */
7492 constructor_possible_p
= false;
7493 /* The "typedef" keyword can only occur in a declaration; we
7494 may as well commit at this point. */
7495 cp_parser_commit_to_tentative_parse (parser
);
7497 if (decl_specs
->storage_class
!= sc_none
)
7498 decl_specs
->conflicting_specifiers_p
= true;
7501 /* storage-class-specifier:
7515 /* Consume the token. */
7516 cp_lexer_consume_token (parser
->lexer
);
7517 cp_parser_set_storage_class (parser
, decl_specs
, token
->keyword
);
7520 /* Consume the token. */
7521 cp_lexer_consume_token (parser
->lexer
);
7522 ++decl_specs
->specs
[(int) ds_thread
];
7526 /* We did not yet find a decl-specifier yet. */
7527 found_decl_spec
= false;
7531 /* Constructors are a special case. The `S' in `S()' is not a
7532 decl-specifier; it is the beginning of the declarator. */
7535 && constructor_possible_p
7536 && (cp_parser_constructor_declarator_p
7537 (parser
, decl_specs
->specs
[(int) ds_friend
] != 0)));
7539 /* If we don't have a DECL_SPEC yet, then we must be looking at
7540 a type-specifier. */
7541 if (!found_decl_spec
&& !constructor_p
)
7543 int decl_spec_declares_class_or_enum
;
7544 bool is_cv_qualifier
;
7548 = cp_parser_type_specifier (parser
, flags
,
7550 /*is_declaration=*/true,
7551 &decl_spec_declares_class_or_enum
,
7554 *declares_class_or_enum
|= decl_spec_declares_class_or_enum
;
7556 /* If this type-specifier referenced a user-defined type
7557 (a typedef, class-name, etc.), then we can't allow any
7558 more such type-specifiers henceforth.
7562 The longest sequence of decl-specifiers that could
7563 possibly be a type name is taken as the
7564 decl-specifier-seq of a declaration. The sequence shall
7565 be self-consistent as described below.
7569 As a general rule, at most one type-specifier is allowed
7570 in the complete decl-specifier-seq of a declaration. The
7571 only exceptions are the following:
7573 -- const or volatile can be combined with any other
7576 -- signed or unsigned can be combined with char, long,
7584 void g (const int Pc);
7586 Here, Pc is *not* part of the decl-specifier seq; it's
7587 the declarator. Therefore, once we see a type-specifier
7588 (other than a cv-qualifier), we forbid any additional
7589 user-defined types. We *do* still allow things like `int
7590 int' to be considered a decl-specifier-seq, and issue the
7591 error message later. */
7592 if (type_spec
&& !is_cv_qualifier
)
7593 flags
|= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
;
7594 /* A constructor declarator cannot follow a type-specifier. */
7597 constructor_possible_p
= false;
7598 found_decl_spec
= true;
7602 /* If we still do not have a DECL_SPEC, then there are no more
7604 if (!found_decl_spec
)
7607 decl_specs
->any_specifiers_p
= true;
7608 /* After we see one decl-specifier, further decl-specifiers are
7610 flags
|= CP_PARSER_FLAGS_OPTIONAL
;
7613 cp_parser_check_decl_spec (decl_specs
);
7615 /* Don't allow a friend specifier with a class definition. */
7616 if (decl_specs
->specs
[(int) ds_friend
] != 0
7617 && (*declares_class_or_enum
& 2))
7618 error ("class definition may not be declared a friend");
7621 /* Parse an (optional) storage-class-specifier.
7623 storage-class-specifier:
7632 storage-class-specifier:
7635 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
7638 cp_parser_storage_class_specifier_opt (cp_parser
* parser
)
7640 switch (cp_lexer_peek_token (parser
->lexer
)->keyword
)
7648 /* Consume the token. */
7649 return cp_lexer_consume_token (parser
->lexer
)->value
;
7656 /* Parse an (optional) function-specifier.
7663 Returns an IDENTIFIER_NODE corresponding to the keyword used.
7664 Updates DECL_SPECS, if it is non-NULL. */
7667 cp_parser_function_specifier_opt (cp_parser
* parser
,
7668 cp_decl_specifier_seq
*decl_specs
)
7670 switch (cp_lexer_peek_token (parser
->lexer
)->keyword
)
7674 ++decl_specs
->specs
[(int) ds_inline
];
7678 /* 14.5.2.3 [temp.mem]
7680 A member function template shall not be virtual. */
7681 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
7682 error ("templates may not be %<virtual%>");
7683 else if (decl_specs
)
7684 ++decl_specs
->specs
[(int) ds_virtual
];
7689 ++decl_specs
->specs
[(int) ds_explicit
];
7696 /* Consume the token. */
7697 return cp_lexer_consume_token (parser
->lexer
)->value
;
7700 /* Parse a linkage-specification.
7702 linkage-specification:
7703 extern string-literal { declaration-seq [opt] }
7704 extern string-literal declaration */
7707 cp_parser_linkage_specification (cp_parser
* parser
)
7711 /* Look for the `extern' keyword. */
7712 cp_parser_require_keyword (parser
, RID_EXTERN
, "`extern'");
7714 /* Look for the string-literal. */
7715 linkage
= cp_parser_string_literal (parser
, false, false);
7717 /* Transform the literal into an identifier. If the literal is a
7718 wide-character string, or contains embedded NULs, then we can't
7719 handle it as the user wants. */
7720 if (strlen (TREE_STRING_POINTER (linkage
))
7721 != (size_t) (TREE_STRING_LENGTH (linkage
) - 1))
7723 cp_parser_error (parser
, "invalid linkage-specification");
7724 /* Assume C++ linkage. */
7725 linkage
= lang_name_cplusplus
;
7728 linkage
= get_identifier (TREE_STRING_POINTER (linkage
));
7730 /* We're now using the new linkage. */
7731 push_lang_context (linkage
);
7733 /* If the next token is a `{', then we're using the first
7735 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
7737 /* Consume the `{' token. */
7738 cp_lexer_consume_token (parser
->lexer
);
7739 /* Parse the declarations. */
7740 cp_parser_declaration_seq_opt (parser
);
7741 /* Look for the closing `}'. */
7742 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "`}'");
7744 /* Otherwise, there's just one declaration. */
7747 bool saved_in_unbraced_linkage_specification_p
;
7749 saved_in_unbraced_linkage_specification_p
7750 = parser
->in_unbraced_linkage_specification_p
;
7751 parser
->in_unbraced_linkage_specification_p
= true;
7752 cp_parser_declaration (parser
);
7753 parser
->in_unbraced_linkage_specification_p
7754 = saved_in_unbraced_linkage_specification_p
;
7757 /* We're done with the linkage-specification. */
7758 pop_lang_context ();
7761 /* Special member functions [gram.special] */
7763 /* Parse a conversion-function-id.
7765 conversion-function-id:
7766 operator conversion-type-id
7768 Returns an IDENTIFIER_NODE representing the operator. */
7771 cp_parser_conversion_function_id (cp_parser
* parser
)
7775 tree saved_qualifying_scope
;
7776 tree saved_object_scope
;
7777 tree pushed_scope
= NULL_TREE
;
7779 /* Look for the `operator' token. */
7780 if (!cp_parser_require_keyword (parser
, RID_OPERATOR
, "`operator'"))
7781 return error_mark_node
;
7782 /* When we parse the conversion-type-id, the current scope will be
7783 reset. However, we need that information in able to look up the
7784 conversion function later, so we save it here. */
7785 saved_scope
= parser
->scope
;
7786 saved_qualifying_scope
= parser
->qualifying_scope
;
7787 saved_object_scope
= parser
->object_scope
;
7788 /* We must enter the scope of the class so that the names of
7789 entities declared within the class are available in the
7790 conversion-type-id. For example, consider:
7797 S::operator I() { ... }
7799 In order to see that `I' is a type-name in the definition, we
7800 must be in the scope of `S'. */
7802 pushed_scope
= push_scope (saved_scope
);
7803 /* Parse the conversion-type-id. */
7804 type
= cp_parser_conversion_type_id (parser
);
7805 /* Leave the scope of the class, if any. */
7807 pop_scope (pushed_scope
);
7808 /* Restore the saved scope. */
7809 parser
->scope
= saved_scope
;
7810 parser
->qualifying_scope
= saved_qualifying_scope
;
7811 parser
->object_scope
= saved_object_scope
;
7812 /* If the TYPE is invalid, indicate failure. */
7813 if (type
== error_mark_node
)
7814 return error_mark_node
;
7815 return mangle_conv_op_name_for_type (type
);
7818 /* Parse a conversion-type-id:
7821 type-specifier-seq conversion-declarator [opt]
7823 Returns the TYPE specified. */
7826 cp_parser_conversion_type_id (cp_parser
* parser
)
7829 cp_decl_specifier_seq type_specifiers
;
7830 cp_declarator
*declarator
;
7831 tree type_specified
;
7833 /* Parse the attributes. */
7834 attributes
= cp_parser_attributes_opt (parser
);
7835 /* Parse the type-specifiers. */
7836 cp_parser_type_specifier_seq (parser
, /*is_condition=*/false,
7838 /* If that didn't work, stop. */
7839 if (type_specifiers
.type
== error_mark_node
)
7840 return error_mark_node
;
7841 /* Parse the conversion-declarator. */
7842 declarator
= cp_parser_conversion_declarator_opt (parser
);
7844 type_specified
= grokdeclarator (declarator
, &type_specifiers
, TYPENAME
,
7845 /*initialized=*/0, &attributes
);
7847 cplus_decl_attributes (&type_specified
, attributes
, /*flags=*/0);
7848 return type_specified
;
7851 /* Parse an (optional) conversion-declarator.
7853 conversion-declarator:
7854 ptr-operator conversion-declarator [opt]
7858 static cp_declarator
*
7859 cp_parser_conversion_declarator_opt (cp_parser
* parser
)
7861 enum tree_code code
;
7863 cp_cv_quals cv_quals
;
7865 /* We don't know if there's a ptr-operator next, or not. */
7866 cp_parser_parse_tentatively (parser
);
7867 /* Try the ptr-operator. */
7868 code
= cp_parser_ptr_operator (parser
, &class_type
, &cv_quals
);
7869 /* If it worked, look for more conversion-declarators. */
7870 if (cp_parser_parse_definitely (parser
))
7872 cp_declarator
*declarator
;
7874 /* Parse another optional declarator. */
7875 declarator
= cp_parser_conversion_declarator_opt (parser
);
7877 /* Create the representation of the declarator. */
7879 declarator
= make_ptrmem_declarator (cv_quals
, class_type
,
7881 else if (code
== INDIRECT_REF
)
7882 declarator
= make_pointer_declarator (cv_quals
, declarator
);
7884 declarator
= make_reference_declarator (cv_quals
, declarator
);
7892 /* Parse an (optional) ctor-initializer.
7895 : mem-initializer-list
7897 Returns TRUE iff the ctor-initializer was actually present. */
7900 cp_parser_ctor_initializer_opt (cp_parser
* parser
)
7902 /* If the next token is not a `:', then there is no
7903 ctor-initializer. */
7904 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
7906 /* Do default initialization of any bases and members. */
7907 if (DECL_CONSTRUCTOR_P (current_function_decl
))
7908 finish_mem_initializers (NULL_TREE
);
7913 /* Consume the `:' token. */
7914 cp_lexer_consume_token (parser
->lexer
);
7915 /* And the mem-initializer-list. */
7916 cp_parser_mem_initializer_list (parser
);
7921 /* Parse a mem-initializer-list.
7923 mem-initializer-list:
7925 mem-initializer , mem-initializer-list */
7928 cp_parser_mem_initializer_list (cp_parser
* parser
)
7930 tree mem_initializer_list
= NULL_TREE
;
7932 /* Let the semantic analysis code know that we are starting the
7933 mem-initializer-list. */
7934 if (!DECL_CONSTRUCTOR_P (current_function_decl
))
7935 error ("only constructors take base initializers");
7937 /* Loop through the list. */
7940 tree mem_initializer
;
7942 /* Parse the mem-initializer. */
7943 mem_initializer
= cp_parser_mem_initializer (parser
);
7944 /* Add it to the list, unless it was erroneous. */
7945 if (mem_initializer
!= error_mark_node
)
7947 TREE_CHAIN (mem_initializer
) = mem_initializer_list
;
7948 mem_initializer_list
= mem_initializer
;
7950 /* If the next token is not a `,', we're done. */
7951 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
7953 /* Consume the `,' token. */
7954 cp_lexer_consume_token (parser
->lexer
);
7957 /* Perform semantic analysis. */
7958 if (DECL_CONSTRUCTOR_P (current_function_decl
))
7959 finish_mem_initializers (mem_initializer_list
);
7962 /* Parse a mem-initializer.
7965 mem-initializer-id ( expression-list [opt] )
7970 ( expression-list [opt] )
7972 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
7973 class) or FIELD_DECL (for a non-static data member) to initialize;
7974 the TREE_VALUE is the expression-list. An empty initialization
7975 list is represented by void_list_node. */
7978 cp_parser_mem_initializer (cp_parser
* parser
)
7980 tree mem_initializer_id
;
7981 tree expression_list
;
7984 /* Find out what is being initialized. */
7985 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
7987 pedwarn ("anachronistic old-style base class initializer");
7988 mem_initializer_id
= NULL_TREE
;
7991 mem_initializer_id
= cp_parser_mem_initializer_id (parser
);
7992 member
= expand_member_init (mem_initializer_id
);
7993 if (member
&& !DECL_P (member
))
7994 in_base_initializer
= 1;
7997 = cp_parser_parenthesized_expression_list (parser
, false,
7999 /*non_constant_p=*/NULL
);
8000 if (expression_list
== error_mark_node
)
8001 return error_mark_node
;
8002 if (!expression_list
)
8003 expression_list
= void_type_node
;
8005 in_base_initializer
= 0;
8007 return member
? build_tree_list (member
, expression_list
) : error_mark_node
;
8010 /* Parse a mem-initializer-id.
8013 :: [opt] nested-name-specifier [opt] class-name
8016 Returns a TYPE indicating the class to be initializer for the first
8017 production. Returns an IDENTIFIER_NODE indicating the data member
8018 to be initialized for the second production. */
8021 cp_parser_mem_initializer_id (cp_parser
* parser
)
8023 bool global_scope_p
;
8024 bool nested_name_specifier_p
;
8025 bool template_p
= false;
8028 /* `typename' is not allowed in this context ([temp.res]). */
8029 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TYPENAME
))
8031 error ("keyword %<typename%> not allowed in this context (a qualified "
8032 "member initializer is implicitly a type)");
8033 cp_lexer_consume_token (parser
->lexer
);
8035 /* Look for the optional `::' operator. */
8037 = (cp_parser_global_scope_opt (parser
,
8038 /*current_scope_valid_p=*/false)
8040 /* Look for the optional nested-name-specifier. The simplest way to
8045 The keyword `typename' is not permitted in a base-specifier or
8046 mem-initializer; in these contexts a qualified name that
8047 depends on a template-parameter is implicitly assumed to be a
8050 is to assume that we have seen the `typename' keyword at this
8052 nested_name_specifier_p
8053 = (cp_parser_nested_name_specifier_opt (parser
,
8054 /*typename_keyword_p=*/true,
8055 /*check_dependency_p=*/true,
8057 /*is_declaration=*/true)
8059 if (nested_name_specifier_p
)
8060 template_p
= cp_parser_optional_template_keyword (parser
);
8061 /* If there is a `::' operator or a nested-name-specifier, then we
8062 are definitely looking for a class-name. */
8063 if (global_scope_p
|| nested_name_specifier_p
)
8064 return cp_parser_class_name (parser
,
8065 /*typename_keyword_p=*/true,
8066 /*template_keyword_p=*/template_p
,
8068 /*check_dependency_p=*/true,
8069 /*class_head_p=*/false,
8070 /*is_declaration=*/true);
8071 /* Otherwise, we could also be looking for an ordinary identifier. */
8072 cp_parser_parse_tentatively (parser
);
8073 /* Try a class-name. */
8074 id
= cp_parser_class_name (parser
,
8075 /*typename_keyword_p=*/true,
8076 /*template_keyword_p=*/false,
8078 /*check_dependency_p=*/true,
8079 /*class_head_p=*/false,
8080 /*is_declaration=*/true);
8081 /* If we found one, we're done. */
8082 if (cp_parser_parse_definitely (parser
))
8084 /* Otherwise, look for an ordinary identifier. */
8085 return cp_parser_identifier (parser
);
8088 /* Overloading [gram.over] */
8090 /* Parse an operator-function-id.
8092 operator-function-id:
8095 Returns an IDENTIFIER_NODE for the operator which is a
8096 human-readable spelling of the identifier, e.g., `operator +'. */
8099 cp_parser_operator_function_id (cp_parser
* parser
)
8101 /* Look for the `operator' keyword. */
8102 if (!cp_parser_require_keyword (parser
, RID_OPERATOR
, "`operator'"))
8103 return error_mark_node
;
8104 /* And then the name of the operator itself. */
8105 return cp_parser_operator (parser
);
8108 /* Parse an operator.
8111 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
8112 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
8113 || ++ -- , ->* -> () []
8120 Returns an IDENTIFIER_NODE for the operator which is a
8121 human-readable spelling of the identifier, e.g., `operator +'. */
8124 cp_parser_operator (cp_parser
* parser
)
8126 tree id
= NULL_TREE
;
8129 /* Peek at the next token. */
8130 token
= cp_lexer_peek_token (parser
->lexer
);
8131 /* Figure out which operator we have. */
8132 switch (token
->type
)
8138 /* The keyword should be either `new' or `delete'. */
8139 if (token
->keyword
== RID_NEW
)
8141 else if (token
->keyword
== RID_DELETE
)
8146 /* Consume the `new' or `delete' token. */
8147 cp_lexer_consume_token (parser
->lexer
);
8149 /* Peek at the next token. */
8150 token
= cp_lexer_peek_token (parser
->lexer
);
8151 /* If it's a `[' token then this is the array variant of the
8153 if (token
->type
== CPP_OPEN_SQUARE
)
8155 /* Consume the `[' token. */
8156 cp_lexer_consume_token (parser
->lexer
);
8157 /* Look for the `]' token. */
8158 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, "`]'");
8159 id
= ansi_opname (op
== NEW_EXPR
8160 ? VEC_NEW_EXPR
: VEC_DELETE_EXPR
);
8162 /* Otherwise, we have the non-array variant. */
8164 id
= ansi_opname (op
);
8170 id
= ansi_opname (PLUS_EXPR
);
8174 id
= ansi_opname (MINUS_EXPR
);
8178 id
= ansi_opname (MULT_EXPR
);
8182 id
= ansi_opname (TRUNC_DIV_EXPR
);
8186 id
= ansi_opname (TRUNC_MOD_EXPR
);
8190 id
= ansi_opname (BIT_XOR_EXPR
);
8194 id
= ansi_opname (BIT_AND_EXPR
);
8198 id
= ansi_opname (BIT_IOR_EXPR
);
8202 id
= ansi_opname (BIT_NOT_EXPR
);
8206 id
= ansi_opname (TRUTH_NOT_EXPR
);
8210 id
= ansi_assopname (NOP_EXPR
);
8214 id
= ansi_opname (LT_EXPR
);
8218 id
= ansi_opname (GT_EXPR
);
8222 id
= ansi_assopname (PLUS_EXPR
);
8226 id
= ansi_assopname (MINUS_EXPR
);
8230 id
= ansi_assopname (MULT_EXPR
);
8234 id
= ansi_assopname (TRUNC_DIV_EXPR
);
8238 id
= ansi_assopname (TRUNC_MOD_EXPR
);
8242 id
= ansi_assopname (BIT_XOR_EXPR
);
8246 id
= ansi_assopname (BIT_AND_EXPR
);
8250 id
= ansi_assopname (BIT_IOR_EXPR
);
8254 id
= ansi_opname (LSHIFT_EXPR
);
8258 id
= ansi_opname (RSHIFT_EXPR
);
8262 id
= ansi_assopname (LSHIFT_EXPR
);
8266 id
= ansi_assopname (RSHIFT_EXPR
);
8270 id
= ansi_opname (EQ_EXPR
);
8274 id
= ansi_opname (NE_EXPR
);
8278 id
= ansi_opname (LE_EXPR
);
8281 case CPP_GREATER_EQ
:
8282 id
= ansi_opname (GE_EXPR
);
8286 id
= ansi_opname (TRUTH_ANDIF_EXPR
);
8290 id
= ansi_opname (TRUTH_ORIF_EXPR
);
8294 id
= ansi_opname (POSTINCREMENT_EXPR
);
8297 case CPP_MINUS_MINUS
:
8298 id
= ansi_opname (PREDECREMENT_EXPR
);
8302 id
= ansi_opname (COMPOUND_EXPR
);
8305 case CPP_DEREF_STAR
:
8306 id
= ansi_opname (MEMBER_REF
);
8310 id
= ansi_opname (COMPONENT_REF
);
8313 case CPP_OPEN_PAREN
:
8314 /* Consume the `('. */
8315 cp_lexer_consume_token (parser
->lexer
);
8316 /* Look for the matching `)'. */
8317 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
8318 return ansi_opname (CALL_EXPR
);
8320 case CPP_OPEN_SQUARE
:
8321 /* Consume the `['. */
8322 cp_lexer_consume_token (parser
->lexer
);
8323 /* Look for the matching `]'. */
8324 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, "`]'");
8325 return ansi_opname (ARRAY_REF
);
8328 /* Anything else is an error. */
8332 /* If we have selected an identifier, we need to consume the
8335 cp_lexer_consume_token (parser
->lexer
);
8336 /* Otherwise, no valid operator name was present. */
8339 cp_parser_error (parser
, "expected operator");
8340 id
= error_mark_node
;
8346 /* Parse a template-declaration.
8348 template-declaration:
8349 export [opt] template < template-parameter-list > declaration
8351 If MEMBER_P is TRUE, this template-declaration occurs within a
8354 The grammar rule given by the standard isn't correct. What
8357 template-declaration:
8358 export [opt] template-parameter-list-seq
8359 decl-specifier-seq [opt] init-declarator [opt] ;
8360 export [opt] template-parameter-list-seq
8363 template-parameter-list-seq:
8364 template-parameter-list-seq [opt]
8365 template < template-parameter-list > */
8368 cp_parser_template_declaration (cp_parser
* parser
, bool member_p
)
8370 /* Check for `export'. */
8371 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_EXPORT
))
8373 /* Consume the `export' token. */
8374 cp_lexer_consume_token (parser
->lexer
);
8375 /* Warn that we do not support `export'. */
8376 warning (0, "keyword %<export%> not implemented, and will be ignored");
8379 cp_parser_template_declaration_after_export (parser
, member_p
);
8382 /* Parse a template-parameter-list.
8384 template-parameter-list:
8386 template-parameter-list , template-parameter
8388 Returns a TREE_LIST. Each node represents a template parameter.
8389 The nodes are connected via their TREE_CHAINs. */
8392 cp_parser_template_parameter_list (cp_parser
* parser
)
8394 tree parameter_list
= NULL_TREE
;
8396 begin_template_parm_list ();
8403 /* Parse the template-parameter. */
8404 parameter
= cp_parser_template_parameter (parser
, &is_non_type
);
8405 /* Add it to the list. */
8406 if (parameter
!= error_mark_node
)
8407 parameter_list
= process_template_parm (parameter_list
,
8412 tree err_parm
= build_tree_list (parameter
, parameter
);
8413 TREE_VALUE (err_parm
) = error_mark_node
;
8414 parameter_list
= chainon (parameter_list
, err_parm
);
8417 /* Peek at the next token. */
8418 token
= cp_lexer_peek_token (parser
->lexer
);
8419 /* If it's not a `,', we're done. */
8420 if (token
->type
!= CPP_COMMA
)
8422 /* Otherwise, consume the `,' token. */
8423 cp_lexer_consume_token (parser
->lexer
);
8426 return end_template_parm_list (parameter_list
);
8429 /* Parse a template-parameter.
8433 parameter-declaration
8435 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
8436 the parameter. The TREE_PURPOSE is the default value, if any.
8437 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
8438 iff this parameter is a non-type parameter. */
8441 cp_parser_template_parameter (cp_parser
* parser
, bool *is_non_type
)
8444 cp_parameter_declarator
*parameter_declarator
;
8447 /* Assume it is a type parameter or a template parameter. */
8448 *is_non_type
= false;
8449 /* Peek at the next token. */
8450 token
= cp_lexer_peek_token (parser
->lexer
);
8451 /* If it is `class' or `template', we have a type-parameter. */
8452 if (token
->keyword
== RID_TEMPLATE
)
8453 return cp_parser_type_parameter (parser
);
8454 /* If it is `class' or `typename' we do not know yet whether it is a
8455 type parameter or a non-type parameter. Consider:
8457 template <typename T, typename T::X X> ...
8461 template <class C, class D*> ...
8463 Here, the first parameter is a type parameter, and the second is
8464 a non-type parameter. We can tell by looking at the token after
8465 the identifier -- if it is a `,', `=', or `>' then we have a type
8467 if (token
->keyword
== RID_TYPENAME
|| token
->keyword
== RID_CLASS
)
8469 /* Peek at the token after `class' or `typename'. */
8470 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
8471 /* If it's an identifier, skip it. */
8472 if (token
->type
== CPP_NAME
)
8473 token
= cp_lexer_peek_nth_token (parser
->lexer
, 3);
8474 /* Now, see if the token looks like the end of a template
8476 if (token
->type
== CPP_COMMA
8477 || token
->type
== CPP_EQ
8478 || token
->type
== CPP_GREATER
)
8479 return cp_parser_type_parameter (parser
);
8482 /* Otherwise, it is a non-type parameter.
8486 When parsing a default template-argument for a non-type
8487 template-parameter, the first non-nested `>' is taken as the end
8488 of the template parameter-list rather than a greater-than
8490 *is_non_type
= true;
8491 parameter_declarator
8492 = cp_parser_parameter_declaration (parser
, /*template_parm_p=*/true,
8493 /*parenthesized_p=*/NULL
);
8494 parm
= grokdeclarator (parameter_declarator
->declarator
,
8495 ¶meter_declarator
->decl_specifiers
,
8496 PARM
, /*initialized=*/0,
8498 if (parm
== error_mark_node
)
8499 return error_mark_node
;
8500 return build_tree_list (parameter_declarator
->default_argument
, parm
);
8503 /* Parse a type-parameter.
8506 class identifier [opt]
8507 class identifier [opt] = type-id
8508 typename identifier [opt]
8509 typename identifier [opt] = type-id
8510 template < template-parameter-list > class identifier [opt]
8511 template < template-parameter-list > class identifier [opt]
8514 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
8515 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
8516 the declaration of the parameter. */
8519 cp_parser_type_parameter (cp_parser
* parser
)
8524 /* Look for a keyword to tell us what kind of parameter this is. */
8525 token
= cp_parser_require (parser
, CPP_KEYWORD
,
8526 "`class', `typename', or `template'");
8528 return error_mark_node
;
8530 switch (token
->keyword
)
8536 tree default_argument
;
8538 /* If the next token is an identifier, then it names the
8540 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
8541 identifier
= cp_parser_identifier (parser
);
8543 identifier
= NULL_TREE
;
8545 /* Create the parameter. */
8546 parameter
= finish_template_type_parm (class_type_node
, identifier
);
8548 /* If the next token is an `=', we have a default argument. */
8549 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
8551 /* Consume the `=' token. */
8552 cp_lexer_consume_token (parser
->lexer
);
8553 /* Parse the default-argument. */
8554 push_deferring_access_checks (dk_no_deferred
);
8555 default_argument
= cp_parser_type_id (parser
);
8556 pop_deferring_access_checks ();
8559 default_argument
= NULL_TREE
;
8561 /* Create the combined representation of the parameter and the
8562 default argument. */
8563 parameter
= build_tree_list (default_argument
, parameter
);
8569 tree parameter_list
;
8571 tree default_argument
;
8573 /* Look for the `<'. */
8574 cp_parser_require (parser
, CPP_LESS
, "`<'");
8575 /* Parse the template-parameter-list. */
8576 parameter_list
= cp_parser_template_parameter_list (parser
);
8577 /* Look for the `>'. */
8578 cp_parser_require (parser
, CPP_GREATER
, "`>'");
8579 /* Look for the `class' keyword. */
8580 cp_parser_require_keyword (parser
, RID_CLASS
, "`class'");
8581 /* If the next token is an `=', then there is a
8582 default-argument. If the next token is a `>', we are at
8583 the end of the parameter-list. If the next token is a `,',
8584 then we are at the end of this parameter. */
8585 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_EQ
)
8586 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_GREATER
)
8587 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
8589 identifier
= cp_parser_identifier (parser
);
8590 /* Treat invalid names as if the parameter were nameless. */
8591 if (identifier
== error_mark_node
)
8592 identifier
= NULL_TREE
;
8595 identifier
= NULL_TREE
;
8597 /* Create the template parameter. */
8598 parameter
= finish_template_template_parm (class_type_node
,
8601 /* If the next token is an `=', then there is a
8602 default-argument. */
8603 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
8607 /* Consume the `='. */
8608 cp_lexer_consume_token (parser
->lexer
);
8609 /* Parse the id-expression. */
8610 push_deferring_access_checks (dk_no_deferred
);
8612 = cp_parser_id_expression (parser
,
8613 /*template_keyword_p=*/false,
8614 /*check_dependency_p=*/true,
8615 /*template_p=*/&is_template
,
8616 /*declarator_p=*/false,
8617 /*optional_p=*/false);
8618 if (TREE_CODE (default_argument
) == TYPE_DECL
)
8619 /* If the id-expression was a template-id that refers to
8620 a template-class, we already have the declaration here,
8621 so no further lookup is needed. */
8624 /* Look up the name. */
8626 = cp_parser_lookup_name (parser
, default_argument
,
8628 /*is_template=*/is_template
,
8629 /*is_namespace=*/false,
8630 /*check_dependency=*/true,
8631 /*ambiguous_decls=*/NULL
);
8632 /* See if the default argument is valid. */
8634 = check_template_template_default_arg (default_argument
);
8635 pop_deferring_access_checks ();
8638 default_argument
= NULL_TREE
;
8640 /* Create the combined representation of the parameter and the
8641 default argument. */
8642 parameter
= build_tree_list (default_argument
, parameter
);
8654 /* Parse a template-id.
8657 template-name < template-argument-list [opt] >
8659 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
8660 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
8661 returned. Otherwise, if the template-name names a function, or set
8662 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
8663 names a class, returns a TYPE_DECL for the specialization.
8665 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
8666 uninstantiated templates. */
8669 cp_parser_template_id (cp_parser
*parser
,
8670 bool template_keyword_p
,
8671 bool check_dependency_p
,
8672 bool is_declaration
)
8677 cp_token_position start_of_id
= 0;
8678 tree access_check
= NULL_TREE
;
8679 cp_token
*next_token
, *next_token_2
;
8682 /* If the next token corresponds to a template-id, there is no need
8684 next_token
= cp_lexer_peek_token (parser
->lexer
);
8685 if (next_token
->type
== CPP_TEMPLATE_ID
)
8690 /* Get the stored value. */
8691 value
= cp_lexer_consume_token (parser
->lexer
)->value
;
8692 /* Perform any access checks that were deferred. */
8693 for (check
= TREE_PURPOSE (value
); check
; check
= TREE_CHAIN (check
))
8694 perform_or_defer_access_check (TREE_PURPOSE (check
),
8695 TREE_VALUE (check
));
8696 /* Return the stored value. */
8697 return TREE_VALUE (value
);
8700 /* Avoid performing name lookup if there is no possibility of
8701 finding a template-id. */
8702 if ((next_token
->type
!= CPP_NAME
&& next_token
->keyword
!= RID_OPERATOR
)
8703 || (next_token
->type
== CPP_NAME
8704 && !cp_parser_nth_token_starts_template_argument_list_p
8707 cp_parser_error (parser
, "expected template-id");
8708 return error_mark_node
;
8711 /* Remember where the template-id starts. */
8712 if (cp_parser_uncommitted_to_tentative_parse_p (parser
))
8713 start_of_id
= cp_lexer_token_position (parser
->lexer
, false);
8715 push_deferring_access_checks (dk_deferred
);
8717 /* Parse the template-name. */
8718 is_identifier
= false;
8719 template = cp_parser_template_name (parser
, template_keyword_p
,
8723 if (template == error_mark_node
|| is_identifier
)
8725 pop_deferring_access_checks ();
8729 /* If we find the sequence `[:' after a template-name, it's probably
8730 a digraph-typo for `< ::'. Substitute the tokens and check if we can
8731 parse correctly the argument list. */
8732 next_token
= cp_lexer_peek_token (parser
->lexer
);
8733 next_token_2
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
8734 if (next_token
->type
== CPP_OPEN_SQUARE
8735 && next_token
->flags
& DIGRAPH
8736 && next_token_2
->type
== CPP_COLON
8737 && !(next_token_2
->flags
& PREV_WHITE
))
8739 cp_parser_parse_tentatively (parser
);
8740 /* Change `:' into `::'. */
8741 next_token_2
->type
= CPP_SCOPE
;
8742 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
8744 cp_lexer_consume_token (parser
->lexer
);
8745 /* Parse the arguments. */
8746 arguments
= cp_parser_enclosed_template_argument_list (parser
);
8747 if (!cp_parser_parse_definitely (parser
))
8749 /* If we couldn't parse an argument list, then we revert our changes
8750 and return simply an error. Maybe this is not a template-id
8752 next_token_2
->type
= CPP_COLON
;
8753 cp_parser_error (parser
, "expected %<<%>");
8754 pop_deferring_access_checks ();
8755 return error_mark_node
;
8757 /* Otherwise, emit an error about the invalid digraph, but continue
8758 parsing because we got our argument list. */
8759 pedwarn ("%<<::%> cannot begin a template-argument list");
8760 inform ("%<<:%> is an alternate spelling for %<[%>. Insert whitespace "
8761 "between %<<%> and %<::%>");
8762 if (!flag_permissive
)
8767 inform ("(if you use -fpermissive G++ will accept your code)");
8774 /* Look for the `<' that starts the template-argument-list. */
8775 if (!cp_parser_require (parser
, CPP_LESS
, "`<'"))
8777 pop_deferring_access_checks ();
8778 return error_mark_node
;
8780 /* Parse the arguments. */
8781 arguments
= cp_parser_enclosed_template_argument_list (parser
);
8784 /* Build a representation of the specialization. */
8785 if (TREE_CODE (template) == IDENTIFIER_NODE
)
8786 template_id
= build_min_nt (TEMPLATE_ID_EXPR
, template, arguments
);
8787 else if (DECL_CLASS_TEMPLATE_P (template)
8788 || DECL_TEMPLATE_TEMPLATE_PARM_P (template))
8790 bool entering_scope
;
8791 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
8792 template (rather than some instantiation thereof) only if
8793 is not nested within some other construct. For example, in
8794 "template <typename T> void f(T) { A<T>::", A<T> is just an
8795 instantiation of A. */
8796 entering_scope
= (template_parm_scope_p ()
8797 && cp_lexer_next_token_is (parser
->lexer
,
8800 = finish_template_type (template, arguments
, entering_scope
);
8804 /* If it's not a class-template or a template-template, it should be
8805 a function-template. */
8806 gcc_assert ((DECL_FUNCTION_TEMPLATE_P (template)
8807 || TREE_CODE (template) == OVERLOAD
8808 || BASELINK_P (template)));
8810 template_id
= lookup_template_function (template, arguments
);
8813 /* Retrieve any deferred checks. Do not pop this access checks yet
8814 so the memory will not be reclaimed during token replacing below. */
8815 access_check
= get_deferred_access_checks ();
8817 /* If parsing tentatively, replace the sequence of tokens that makes
8818 up the template-id with a CPP_TEMPLATE_ID token. That way,
8819 should we re-parse the token stream, we will not have to repeat
8820 the effort required to do the parse, nor will we issue duplicate
8821 error messages about problems during instantiation of the
8825 cp_token
*token
= cp_lexer_token_at (parser
->lexer
, start_of_id
);
8827 /* Reset the contents of the START_OF_ID token. */
8828 token
->type
= CPP_TEMPLATE_ID
;
8829 token
->value
= build_tree_list (access_check
, template_id
);
8830 token
->keyword
= RID_MAX
;
8832 /* Purge all subsequent tokens. */
8833 cp_lexer_purge_tokens_after (parser
->lexer
, start_of_id
);
8835 /* ??? Can we actually assume that, if template_id ==
8836 error_mark_node, we will have issued a diagnostic to the
8837 user, as opposed to simply marking the tentative parse as
8839 if (cp_parser_error_occurred (parser
) && template_id
!= error_mark_node
)
8840 error ("parse error in template argument list");
8843 pop_deferring_access_checks ();
8847 /* Parse a template-name.
8852 The standard should actually say:
8856 operator-function-id
8858 A defect report has been filed about this issue.
8860 A conversion-function-id cannot be a template name because they cannot
8861 be part of a template-id. In fact, looking at this code:
8865 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
8866 It is impossible to call a templated conversion-function-id with an
8867 explicit argument list, since the only allowed template parameter is
8868 the type to which it is converting.
8870 If TEMPLATE_KEYWORD_P is true, then we have just seen the
8871 `template' keyword, in a construction like:
8875 In that case `f' is taken to be a template-name, even though there
8876 is no way of knowing for sure.
8878 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
8879 name refers to a set of overloaded functions, at least one of which
8880 is a template, or an IDENTIFIER_NODE with the name of the template,
8881 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
8882 names are looked up inside uninstantiated templates. */
8885 cp_parser_template_name (cp_parser
* parser
,
8886 bool template_keyword_p
,
8887 bool check_dependency_p
,
8888 bool is_declaration
,
8889 bool *is_identifier
)
8895 /* If the next token is `operator', then we have either an
8896 operator-function-id or a conversion-function-id. */
8897 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_OPERATOR
))
8899 /* We don't know whether we're looking at an
8900 operator-function-id or a conversion-function-id. */
8901 cp_parser_parse_tentatively (parser
);
8902 /* Try an operator-function-id. */
8903 identifier
= cp_parser_operator_function_id (parser
);
8904 /* If that didn't work, try a conversion-function-id. */
8905 if (!cp_parser_parse_definitely (parser
))
8907 cp_parser_error (parser
, "expected template-name");
8908 return error_mark_node
;
8911 /* Look for the identifier. */
8913 identifier
= cp_parser_identifier (parser
);
8915 /* If we didn't find an identifier, we don't have a template-id. */
8916 if (identifier
== error_mark_node
)
8917 return error_mark_node
;
8919 /* If the name immediately followed the `template' keyword, then it
8920 is a template-name. However, if the next token is not `<', then
8921 we do not treat it as a template-name, since it is not being used
8922 as part of a template-id. This enables us to handle constructs
8925 template <typename T> struct S { S(); };
8926 template <typename T> S<T>::S();
8928 correctly. We would treat `S' as a template -- if it were `S<T>'
8929 -- but we do not if there is no `<'. */
8931 if (processing_template_decl
8932 && cp_parser_nth_token_starts_template_argument_list_p (parser
, 1))
8934 /* In a declaration, in a dependent context, we pretend that the
8935 "template" keyword was present in order to improve error
8936 recovery. For example, given:
8938 template <typename T> void f(T::X<int>);
8940 we want to treat "X<int>" as a template-id. */
8942 && !template_keyword_p
8943 && parser
->scope
&& TYPE_P (parser
->scope
)
8944 && check_dependency_p
8945 && dependent_type_p (parser
->scope
)
8946 /* Do not do this for dtors (or ctors), since they never
8947 need the template keyword before their name. */
8948 && !constructor_name_p (identifier
, parser
->scope
))
8950 cp_token_position start
= 0;
8952 /* Explain what went wrong. */
8953 error ("non-template %qD used as template", identifier
);
8954 inform ("use %<%T::template %D%> to indicate that it is a template",
8955 parser
->scope
, identifier
);
8956 /* If parsing tentatively, find the location of the "<" token. */
8957 if (cp_parser_simulate_error (parser
))
8958 start
= cp_lexer_token_position (parser
->lexer
, true);
8959 /* Parse the template arguments so that we can issue error
8960 messages about them. */
8961 cp_lexer_consume_token (parser
->lexer
);
8962 cp_parser_enclosed_template_argument_list (parser
);
8963 /* Skip tokens until we find a good place from which to
8964 continue parsing. */
8965 cp_parser_skip_to_closing_parenthesis (parser
,
8966 /*recovering=*/true,
8968 /*consume_paren=*/false);
8969 /* If parsing tentatively, permanently remove the
8970 template argument list. That will prevent duplicate
8971 error messages from being issued about the missing
8972 "template" keyword. */
8974 cp_lexer_purge_tokens_after (parser
->lexer
, start
);
8976 *is_identifier
= true;
8980 /* If the "template" keyword is present, then there is generally
8981 no point in doing name-lookup, so we just return IDENTIFIER.
8982 But, if the qualifying scope is non-dependent then we can
8983 (and must) do name-lookup normally. */
8984 if (template_keyword_p
8986 || (TYPE_P (parser
->scope
)
8987 && dependent_type_p (parser
->scope
))))
8991 /* Look up the name. */
8992 decl
= cp_parser_lookup_name (parser
, identifier
,
8994 /*is_template=*/false,
8995 /*is_namespace=*/false,
8997 /*ambiguous_decls=*/NULL
);
8998 decl
= maybe_get_template_decl_from_type_decl (decl
);
9000 /* If DECL is a template, then the name was a template-name. */
9001 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9005 tree fn
= NULL_TREE
;
9007 /* The standard does not explicitly indicate whether a name that
9008 names a set of overloaded declarations, some of which are
9009 templates, is a template-name. However, such a name should
9010 be a template-name; otherwise, there is no way to form a
9011 template-id for the overloaded templates. */
9012 fns
= BASELINK_P (decl
) ? BASELINK_FUNCTIONS (decl
) : decl
;
9013 if (TREE_CODE (fns
) == OVERLOAD
)
9014 for (fn
= fns
; fn
; fn
= OVL_NEXT (fn
))
9015 if (TREE_CODE (OVL_CURRENT (fn
)) == TEMPLATE_DECL
)
9020 /* The name does not name a template. */
9021 cp_parser_error (parser
, "expected template-name");
9022 return error_mark_node
;
9026 /* If DECL is dependent, and refers to a function, then just return
9027 its name; we will look it up again during template instantiation. */
9028 if (DECL_FUNCTION_TEMPLATE_P (decl
) || !DECL_P (decl
))
9030 tree scope
= CP_DECL_CONTEXT (get_first_fn (decl
));
9031 if (TYPE_P (scope
) && dependent_type_p (scope
))
9038 /* Parse a template-argument-list.
9040 template-argument-list:
9042 template-argument-list , template-argument
9044 Returns a TREE_VEC containing the arguments. */
9047 cp_parser_template_argument_list (cp_parser
* parser
)
9049 tree fixed_args
[10];
9050 unsigned n_args
= 0;
9051 unsigned alloced
= 10;
9052 tree
*arg_ary
= fixed_args
;
9054 bool saved_in_template_argument_list_p
;
9056 bool saved_non_ice_p
;
9058 saved_in_template_argument_list_p
= parser
->in_template_argument_list_p
;
9059 parser
->in_template_argument_list_p
= true;
9060 /* Even if the template-id appears in an integral
9061 constant-expression, the contents of the argument list do
9063 saved_ice_p
= parser
->integral_constant_expression_p
;
9064 parser
->integral_constant_expression_p
= false;
9065 saved_non_ice_p
= parser
->non_integral_constant_expression_p
;
9066 parser
->non_integral_constant_expression_p
= false;
9067 /* Parse the arguments. */
9073 /* Consume the comma. */
9074 cp_lexer_consume_token (parser
->lexer
);
9076 /* Parse the template-argument. */
9077 argument
= cp_parser_template_argument (parser
);
9078 if (n_args
== alloced
)
9082 if (arg_ary
== fixed_args
)
9084 arg_ary
= XNEWVEC (tree
, alloced
);
9085 memcpy (arg_ary
, fixed_args
, sizeof (tree
) * n_args
);
9088 arg_ary
= XRESIZEVEC (tree
, arg_ary
, alloced
);
9090 arg_ary
[n_args
++] = argument
;
9092 while (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
));
9094 vec
= make_tree_vec (n_args
);
9097 TREE_VEC_ELT (vec
, n_args
) = arg_ary
[n_args
];
9099 if (arg_ary
!= fixed_args
)
9101 parser
->non_integral_constant_expression_p
= saved_non_ice_p
;
9102 parser
->integral_constant_expression_p
= saved_ice_p
;
9103 parser
->in_template_argument_list_p
= saved_in_template_argument_list_p
;
9107 /* Parse a template-argument.
9110 assignment-expression
9114 The representation is that of an assignment-expression, type-id, or
9115 id-expression -- except that the qualified id-expression is
9116 evaluated, so that the value returned is either a DECL or an
9119 Although the standard says "assignment-expression", it forbids
9120 throw-expressions or assignments in the template argument.
9121 Therefore, we use "conditional-expression" instead. */
9124 cp_parser_template_argument (cp_parser
* parser
)
9129 bool maybe_type_id
= false;
9133 /* There's really no way to know what we're looking at, so we just
9134 try each alternative in order.
9138 In a template-argument, an ambiguity between a type-id and an
9139 expression is resolved to a type-id, regardless of the form of
9140 the corresponding template-parameter.
9142 Therefore, we try a type-id first. */
9143 cp_parser_parse_tentatively (parser
);
9144 argument
= cp_parser_type_id (parser
);
9145 /* If there was no error parsing the type-id but the next token is a '>>',
9146 we probably found a typo for '> >'. But there are type-id which are
9147 also valid expressions. For instance:
9149 struct X { int operator >> (int); };
9150 template <int V> struct Foo {};
9153 Here 'X()' is a valid type-id of a function type, but the user just
9154 wanted to write the expression "X() >> 5". Thus, we remember that we
9155 found a valid type-id, but we still try to parse the argument as an
9156 expression to see what happens. */
9157 if (!cp_parser_error_occurred (parser
)
9158 && cp_lexer_next_token_is (parser
->lexer
, CPP_RSHIFT
))
9160 maybe_type_id
= true;
9161 cp_parser_abort_tentative_parse (parser
);
9165 /* If the next token isn't a `,' or a `>', then this argument wasn't
9166 really finished. This means that the argument is not a valid
9168 if (!cp_parser_next_token_ends_template_argument_p (parser
))
9169 cp_parser_error (parser
, "expected template-argument");
9170 /* If that worked, we're done. */
9171 if (cp_parser_parse_definitely (parser
))
9174 /* We're still not sure what the argument will be. */
9175 cp_parser_parse_tentatively (parser
);
9176 /* Try a template. */
9177 argument
= cp_parser_id_expression (parser
,
9178 /*template_keyword_p=*/false,
9179 /*check_dependency_p=*/true,
9181 /*declarator_p=*/false,
9182 /*optional_p=*/false);
9183 /* If the next token isn't a `,' or a `>', then this argument wasn't
9185 if (!cp_parser_next_token_ends_template_argument_p (parser
))
9186 cp_parser_error (parser
, "expected template-argument");
9187 if (!cp_parser_error_occurred (parser
))
9189 /* Figure out what is being referred to. If the id-expression
9190 was for a class template specialization, then we will have a
9191 TYPE_DECL at this point. There is no need to do name lookup
9192 at this point in that case. */
9193 if (TREE_CODE (argument
) != TYPE_DECL
)
9194 argument
= cp_parser_lookup_name (parser
, argument
,
9196 /*is_template=*/template_p
,
9197 /*is_namespace=*/false,
9198 /*check_dependency=*/true,
9199 /*ambiguous_decls=*/NULL
);
9200 if (TREE_CODE (argument
) != TEMPLATE_DECL
9201 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
9202 cp_parser_error (parser
, "expected template-name");
9204 if (cp_parser_parse_definitely (parser
))
9206 /* It must be a non-type argument. There permitted cases are given
9207 in [temp.arg.nontype]:
9209 -- an integral constant-expression of integral or enumeration
9212 -- the name of a non-type template-parameter; or
9214 -- the name of an object or function with external linkage...
9216 -- the address of an object or function with external linkage...
9218 -- a pointer to member... */
9219 /* Look for a non-type template parameter. */
9220 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
9222 cp_parser_parse_tentatively (parser
);
9223 argument
= cp_parser_primary_expression (parser
,
9226 /*template_arg_p=*/true,
9228 if (TREE_CODE (argument
) != TEMPLATE_PARM_INDEX
9229 || !cp_parser_next_token_ends_template_argument_p (parser
))
9230 cp_parser_simulate_error (parser
);
9231 if (cp_parser_parse_definitely (parser
))
9235 /* If the next token is "&", the argument must be the address of an
9236 object or function with external linkage. */
9237 address_p
= cp_lexer_next_token_is (parser
->lexer
, CPP_AND
);
9239 cp_lexer_consume_token (parser
->lexer
);
9240 /* See if we might have an id-expression. */
9241 token
= cp_lexer_peek_token (parser
->lexer
);
9242 if (token
->type
== CPP_NAME
9243 || token
->keyword
== RID_OPERATOR
9244 || token
->type
== CPP_SCOPE
9245 || token
->type
== CPP_TEMPLATE_ID
9246 || token
->type
== CPP_NESTED_NAME_SPECIFIER
)
9248 cp_parser_parse_tentatively (parser
);
9249 argument
= cp_parser_primary_expression (parser
,
9252 /*template_arg_p=*/true,
9254 if (cp_parser_error_occurred (parser
)
9255 || !cp_parser_next_token_ends_template_argument_p (parser
))
9256 cp_parser_abort_tentative_parse (parser
);
9259 if (TREE_CODE (argument
) == INDIRECT_REF
)
9261 gcc_assert (REFERENCE_REF_P (argument
));
9262 argument
= TREE_OPERAND (argument
, 0);
9265 if (TREE_CODE (argument
) == VAR_DECL
)
9267 /* A variable without external linkage might still be a
9268 valid constant-expression, so no error is issued here
9269 if the external-linkage check fails. */
9270 if (!DECL_EXTERNAL_LINKAGE_P (argument
))
9271 cp_parser_simulate_error (parser
);
9273 else if (is_overloaded_fn (argument
))
9274 /* All overloaded functions are allowed; if the external
9275 linkage test does not pass, an error will be issued
9279 && (TREE_CODE (argument
) == OFFSET_REF
9280 || TREE_CODE (argument
) == SCOPE_REF
))
9281 /* A pointer-to-member. */
9283 else if (TREE_CODE (argument
) == TEMPLATE_PARM_INDEX
)
9286 cp_parser_simulate_error (parser
);
9288 if (cp_parser_parse_definitely (parser
))
9291 argument
= build_x_unary_op (ADDR_EXPR
, argument
);
9296 /* If the argument started with "&", there are no other valid
9297 alternatives at this point. */
9300 cp_parser_error (parser
, "invalid non-type template argument");
9301 return error_mark_node
;
9304 /* If the argument wasn't successfully parsed as a type-id followed
9305 by '>>', the argument can only be a constant expression now.
9306 Otherwise, we try parsing the constant-expression tentatively,
9307 because the argument could really be a type-id. */
9309 cp_parser_parse_tentatively (parser
);
9310 argument
= cp_parser_constant_expression (parser
,
9311 /*allow_non_constant_p=*/false,
9312 /*non_constant_p=*/NULL
);
9313 argument
= fold_non_dependent_expr (argument
);
9316 if (!cp_parser_next_token_ends_template_argument_p (parser
))
9317 cp_parser_error (parser
, "expected template-argument");
9318 if (cp_parser_parse_definitely (parser
))
9320 /* We did our best to parse the argument as a non type-id, but that
9321 was the only alternative that matched (albeit with a '>' after
9322 it). We can assume it's just a typo from the user, and a
9323 diagnostic will then be issued. */
9324 return cp_parser_type_id (parser
);
9327 /* Parse an explicit-instantiation.
9329 explicit-instantiation:
9330 template declaration
9332 Although the standard says `declaration', what it really means is:
9334 explicit-instantiation:
9335 template decl-specifier-seq [opt] declarator [opt] ;
9337 Things like `template int S<int>::i = 5, int S<double>::j;' are not
9338 supposed to be allowed. A defect report has been filed about this
9343 explicit-instantiation:
9344 storage-class-specifier template
9345 decl-specifier-seq [opt] declarator [opt] ;
9346 function-specifier template
9347 decl-specifier-seq [opt] declarator [opt] ; */
9350 cp_parser_explicit_instantiation (cp_parser
* parser
)
9352 int declares_class_or_enum
;
9353 cp_decl_specifier_seq decl_specifiers
;
9354 tree extension_specifier
= NULL_TREE
;
9356 /* Look for an (optional) storage-class-specifier or
9357 function-specifier. */
9358 if (cp_parser_allow_gnu_extensions_p (parser
))
9361 = cp_parser_storage_class_specifier_opt (parser
);
9362 if (!extension_specifier
)
9364 = cp_parser_function_specifier_opt (parser
,
9365 /*decl_specs=*/NULL
);
9368 /* Look for the `template' keyword. */
9369 cp_parser_require_keyword (parser
, RID_TEMPLATE
, "`template'");
9370 /* Let the front end know that we are processing an explicit
9372 begin_explicit_instantiation ();
9373 /* [temp.explicit] says that we are supposed to ignore access
9374 control while processing explicit instantiation directives. */
9375 push_deferring_access_checks (dk_no_check
);
9376 /* Parse a decl-specifier-seq. */
9377 cp_parser_decl_specifier_seq (parser
,
9378 CP_PARSER_FLAGS_OPTIONAL
,
9380 &declares_class_or_enum
);
9381 /* If there was exactly one decl-specifier, and it declared a class,
9382 and there's no declarator, then we have an explicit type
9384 if (declares_class_or_enum
&& cp_parser_declares_only_class_p (parser
))
9388 type
= check_tag_decl (&decl_specifiers
);
9389 /* Turn access control back on for names used during
9390 template instantiation. */
9391 pop_deferring_access_checks ();
9393 do_type_instantiation (type
, extension_specifier
,
9394 /*complain=*/tf_error
);
9398 cp_declarator
*declarator
;
9401 /* Parse the declarator. */
9403 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
9404 /*ctor_dtor_or_conv_p=*/NULL
,
9405 /*parenthesized_p=*/NULL
,
9406 /*member_p=*/false);
9407 if (declares_class_or_enum
& 2)
9408 cp_parser_check_for_definition_in_return_type (declarator
,
9409 decl_specifiers
.type
);
9410 if (declarator
!= cp_error_declarator
)
9412 decl
= grokdeclarator (declarator
, &decl_specifiers
,
9413 NORMAL
, 0, &decl_specifiers
.attributes
);
9414 /* Turn access control back on for names used during
9415 template instantiation. */
9416 pop_deferring_access_checks ();
9417 /* Do the explicit instantiation. */
9418 do_decl_instantiation (decl
, extension_specifier
);
9422 pop_deferring_access_checks ();
9423 /* Skip the body of the explicit instantiation. */
9424 cp_parser_skip_to_end_of_statement (parser
);
9427 /* We're done with the instantiation. */
9428 end_explicit_instantiation ();
9430 cp_parser_consume_semicolon_at_end_of_statement (parser
);
9433 /* Parse an explicit-specialization.
9435 explicit-specialization:
9436 template < > declaration
9438 Although the standard says `declaration', what it really means is:
9440 explicit-specialization:
9441 template <> decl-specifier [opt] init-declarator [opt] ;
9442 template <> function-definition
9443 template <> explicit-specialization
9444 template <> template-declaration */
9447 cp_parser_explicit_specialization (cp_parser
* parser
)
9450 /* Look for the `template' keyword. */
9451 cp_parser_require_keyword (parser
, RID_TEMPLATE
, "`template'");
9452 /* Look for the `<'. */
9453 cp_parser_require (parser
, CPP_LESS
, "`<'");
9454 /* Look for the `>'. */
9455 cp_parser_require (parser
, CPP_GREATER
, "`>'");
9456 /* We have processed another parameter list. */
9457 ++parser
->num_template_parameter_lists
;
9460 A template ... explicit specialization ... shall not have C
9462 if (current_lang_name
== lang_name_c
)
9464 error ("template specialization with C linkage");
9465 /* Give it C++ linkage to avoid confusing other parts of the
9467 push_lang_context (lang_name_cplusplus
);
9468 need_lang_pop
= true;
9471 need_lang_pop
= false;
9472 /* Let the front end know that we are beginning a specialization. */
9473 if (!begin_specialization ())
9475 end_specialization ();
9476 cp_parser_skip_to_end_of_block_or_statement (parser
);
9480 /* If the next keyword is `template', we need to figure out whether
9481 or not we're looking a template-declaration. */
9482 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
9484 if (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_LESS
9485 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
!= CPP_GREATER
)
9486 cp_parser_template_declaration_after_export (parser
,
9487 /*member_p=*/false);
9489 cp_parser_explicit_specialization (parser
);
9492 /* Parse the dependent declaration. */
9493 cp_parser_single_declaration (parser
,
9494 /*checks=*/NULL_TREE
,
9497 /* We're done with the specialization. */
9498 end_specialization ();
9499 /* For the erroneous case of a template with C linkage, we pushed an
9500 implicit C++ linkage scope; exit that scope now. */
9502 pop_lang_context ();
9503 /* We're done with this parameter list. */
9504 --parser
->num_template_parameter_lists
;
9507 /* Parse a type-specifier.
9510 simple-type-specifier
9513 elaborated-type-specifier
9521 Returns a representation of the type-specifier. For a
9522 class-specifier, enum-specifier, or elaborated-type-specifier, a
9523 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
9525 The parser flags FLAGS is used to control type-specifier parsing.
9527 If IS_DECLARATION is TRUE, then this type-specifier is appearing
9528 in a decl-specifier-seq.
9530 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
9531 class-specifier, enum-specifier, or elaborated-type-specifier, then
9532 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
9533 if a type is declared; 2 if it is defined. Otherwise, it is set to
9536 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
9537 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
9541 cp_parser_type_specifier (cp_parser
* parser
,
9542 cp_parser_flags flags
,
9543 cp_decl_specifier_seq
*decl_specs
,
9544 bool is_declaration
,
9545 int* declares_class_or_enum
,
9546 bool* is_cv_qualifier
)
9548 tree type_spec
= NULL_TREE
;
9551 cp_decl_spec ds
= ds_last
;
9553 /* Assume this type-specifier does not declare a new type. */
9554 if (declares_class_or_enum
)
9555 *declares_class_or_enum
= 0;
9556 /* And that it does not specify a cv-qualifier. */
9557 if (is_cv_qualifier
)
9558 *is_cv_qualifier
= false;
9559 /* Peek at the next token. */
9560 token
= cp_lexer_peek_token (parser
->lexer
);
9562 /* If we're looking at a keyword, we can use that to guide the
9563 production we choose. */
9564 keyword
= token
->keyword
;
9568 /* Look for the enum-specifier. */
9569 type_spec
= cp_parser_enum_specifier (parser
);
9570 /* If that worked, we're done. */
9573 if (declares_class_or_enum
)
9574 *declares_class_or_enum
= 2;
9576 cp_parser_set_decl_spec_type (decl_specs
,
9578 /*user_defined_p=*/true);
9582 goto elaborated_type_specifier
;
9584 /* Any of these indicate either a class-specifier, or an
9585 elaborated-type-specifier. */
9589 /* Parse tentatively so that we can back up if we don't find a
9591 cp_parser_parse_tentatively (parser
);
9592 /* Look for the class-specifier. */
9593 type_spec
= cp_parser_class_specifier (parser
);
9594 /* If that worked, we're done. */
9595 if (cp_parser_parse_definitely (parser
))
9597 if (declares_class_or_enum
)
9598 *declares_class_or_enum
= 2;
9600 cp_parser_set_decl_spec_type (decl_specs
,
9602 /*user_defined_p=*/true);
9607 elaborated_type_specifier
:
9608 /* We're declaring (not defining) a class or enum. */
9609 if (declares_class_or_enum
)
9610 *declares_class_or_enum
= 1;
9614 /* Look for an elaborated-type-specifier. */
9616 = (cp_parser_elaborated_type_specifier
9618 decl_specs
&& decl_specs
->specs
[(int) ds_friend
],
9621 cp_parser_set_decl_spec_type (decl_specs
,
9623 /*user_defined_p=*/true);
9628 if (is_cv_qualifier
)
9629 *is_cv_qualifier
= true;
9634 if (is_cv_qualifier
)
9635 *is_cv_qualifier
= true;
9640 if (is_cv_qualifier
)
9641 *is_cv_qualifier
= true;
9645 /* The `__complex__' keyword is a GNU extension. */
9653 /* Handle simple keywords. */
9658 ++decl_specs
->specs
[(int)ds
];
9659 decl_specs
->any_specifiers_p
= true;
9661 return cp_lexer_consume_token (parser
->lexer
)->value
;
9664 /* If we do not already have a type-specifier, assume we are looking
9665 at a simple-type-specifier. */
9666 type_spec
= cp_parser_simple_type_specifier (parser
,
9670 /* If we didn't find a type-specifier, and a type-specifier was not
9671 optional in this context, issue an error message. */
9672 if (!type_spec
&& !(flags
& CP_PARSER_FLAGS_OPTIONAL
))
9674 cp_parser_error (parser
, "expected type specifier");
9675 return error_mark_node
;
9681 /* Parse a simple-type-specifier.
9683 simple-type-specifier:
9684 :: [opt] nested-name-specifier [opt] type-name
9685 :: [opt] nested-name-specifier template template-id
9700 simple-type-specifier:
9701 __typeof__ unary-expression
9702 __typeof__ ( type-id )
9704 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
9705 appropriately updated. */
9708 cp_parser_simple_type_specifier (cp_parser
* parser
,
9709 cp_decl_specifier_seq
*decl_specs
,
9710 cp_parser_flags flags
)
9712 tree type
= NULL_TREE
;
9715 /* Peek at the next token. */
9716 token
= cp_lexer_peek_token (parser
->lexer
);
9718 /* If we're looking at a keyword, things are easy. */
9719 switch (token
->keyword
)
9723 decl_specs
->explicit_char_p
= true;
9724 type
= char_type_node
;
9727 type
= wchar_type_node
;
9730 type
= boolean_type_node
;
9734 ++decl_specs
->specs
[(int) ds_short
];
9735 type
= short_integer_type_node
;
9739 decl_specs
->explicit_int_p
= true;
9740 type
= integer_type_node
;
9744 ++decl_specs
->specs
[(int) ds_long
];
9745 type
= long_integer_type_node
;
9749 ++decl_specs
->specs
[(int) ds_signed
];
9750 type
= integer_type_node
;
9754 ++decl_specs
->specs
[(int) ds_unsigned
];
9755 type
= unsigned_type_node
;
9758 type
= float_type_node
;
9761 type
= double_type_node
;
9764 type
= void_type_node
;
9768 /* Consume the `typeof' token. */
9769 cp_lexer_consume_token (parser
->lexer
);
9770 /* Parse the operand to `typeof'. */
9771 type
= cp_parser_sizeof_operand (parser
, RID_TYPEOF
);
9772 /* If it is not already a TYPE, take its type. */
9774 type
= finish_typeof (type
);
9777 cp_parser_set_decl_spec_type (decl_specs
, type
,
9778 /*user_defined_p=*/true);
9786 /* If the type-specifier was for a built-in type, we're done. */
9791 /* Record the type. */
9793 && (token
->keyword
!= RID_SIGNED
9794 && token
->keyword
!= RID_UNSIGNED
9795 && token
->keyword
!= RID_SHORT
9796 && token
->keyword
!= RID_LONG
))
9797 cp_parser_set_decl_spec_type (decl_specs
,
9799 /*user_defined=*/false);
9801 decl_specs
->any_specifiers_p
= true;
9803 /* Consume the token. */
9804 id
= cp_lexer_consume_token (parser
->lexer
)->value
;
9806 /* There is no valid C++ program where a non-template type is
9807 followed by a "<". That usually indicates that the user thought
9808 that the type was a template. */
9809 cp_parser_check_for_invalid_template_id (parser
, type
);
9811 return TYPE_NAME (type
);
9814 /* The type-specifier must be a user-defined type. */
9815 if (!(flags
& CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
))
9820 /* Don't gobble tokens or issue error messages if this is an
9821 optional type-specifier. */
9822 if (flags
& CP_PARSER_FLAGS_OPTIONAL
)
9823 cp_parser_parse_tentatively (parser
);
9825 /* Look for the optional `::' operator. */
9827 = (cp_parser_global_scope_opt (parser
,
9828 /*current_scope_valid_p=*/false)
9830 /* Look for the nested-name specifier. */
9832 = (cp_parser_nested_name_specifier_opt (parser
,
9833 /*typename_keyword_p=*/false,
9834 /*check_dependency_p=*/true,
9836 /*is_declaration=*/false)
9838 /* If we have seen a nested-name-specifier, and the next token
9839 is `template', then we are using the template-id production. */
9841 && cp_parser_optional_template_keyword (parser
))
9843 /* Look for the template-id. */
9844 type
= cp_parser_template_id (parser
,
9845 /*template_keyword_p=*/true,
9846 /*check_dependency_p=*/true,
9847 /*is_declaration=*/false);
9848 /* If the template-id did not name a type, we are out of
9850 if (TREE_CODE (type
) != TYPE_DECL
)
9852 cp_parser_error (parser
, "expected template-id for type");
9856 /* Otherwise, look for a type-name. */
9858 type
= cp_parser_type_name (parser
);
9859 /* Keep track of all name-lookups performed in class scopes. */
9863 && TREE_CODE (type
) == TYPE_DECL
9864 && TREE_CODE (DECL_NAME (type
)) == IDENTIFIER_NODE
)
9865 maybe_note_name_used_in_class (DECL_NAME (type
), type
);
9866 /* If it didn't work out, we don't have a TYPE. */
9867 if ((flags
& CP_PARSER_FLAGS_OPTIONAL
)
9868 && !cp_parser_parse_definitely (parser
))
9870 if (type
&& decl_specs
)
9871 cp_parser_set_decl_spec_type (decl_specs
, type
,
9872 /*user_defined=*/true);
9875 /* If we didn't get a type-name, issue an error message. */
9876 if (!type
&& !(flags
& CP_PARSER_FLAGS_OPTIONAL
))
9878 cp_parser_error (parser
, "expected type-name");
9879 return error_mark_node
;
9882 /* There is no valid C++ program where a non-template type is
9883 followed by a "<". That usually indicates that the user thought
9884 that the type was a template. */
9885 if (type
&& type
!= error_mark_node
)
9887 /* As a last-ditch effort, see if TYPE is an Objective-C type.
9888 If it is, then the '<'...'>' enclose protocol names rather than
9889 template arguments, and so everything is fine. */
9890 if (c_dialect_objc ()
9891 && (objc_is_id (type
) || objc_is_class_name (type
)))
9893 tree protos
= cp_parser_objc_protocol_refs_opt (parser
);
9894 tree qual_type
= objc_get_protocol_qualified_type (type
, protos
);
9896 /* Clobber the "unqualified" type previously entered into
9897 DECL_SPECS with the new, improved protocol-qualified version. */
9899 decl_specs
->type
= qual_type
;
9904 cp_parser_check_for_invalid_template_id (parser
, TREE_TYPE (type
));
9910 /* Parse a type-name.
9923 Returns a TYPE_DECL for the type. */
9926 cp_parser_type_name (cp_parser
* parser
)
9931 /* We can't know yet whether it is a class-name or not. */
9932 cp_parser_parse_tentatively (parser
);
9933 /* Try a class-name. */
9934 type_decl
= cp_parser_class_name (parser
,
9935 /*typename_keyword_p=*/false,
9936 /*template_keyword_p=*/false,
9938 /*check_dependency_p=*/true,
9939 /*class_head_p=*/false,
9940 /*is_declaration=*/false);
9941 /* If it's not a class-name, keep looking. */
9942 if (!cp_parser_parse_definitely (parser
))
9944 /* It must be a typedef-name or an enum-name. */
9945 identifier
= cp_parser_identifier (parser
);
9946 if (identifier
== error_mark_node
)
9947 return error_mark_node
;
9949 /* Look up the type-name. */
9950 type_decl
= cp_parser_lookup_name_simple (parser
, identifier
);
9952 if (TREE_CODE (type_decl
) != TYPE_DECL
9953 && (objc_is_id (identifier
) || objc_is_class_name (identifier
)))
9955 /* See if this is an Objective-C type. */
9956 tree protos
= cp_parser_objc_protocol_refs_opt (parser
);
9957 tree type
= objc_get_protocol_qualified_type (identifier
, protos
);
9959 type_decl
= TYPE_NAME (type
);
9962 /* Issue an error if we did not find a type-name. */
9963 if (TREE_CODE (type_decl
) != TYPE_DECL
)
9965 if (!cp_parser_simulate_error (parser
))
9966 cp_parser_name_lookup_error (parser
, identifier
, type_decl
,
9968 type_decl
= error_mark_node
;
9970 /* Remember that the name was used in the definition of the
9971 current class so that we can check later to see if the
9972 meaning would have been different after the class was
9973 entirely defined. */
9974 else if (type_decl
!= error_mark_node
9976 maybe_note_name_used_in_class (identifier
, type_decl
);
9983 /* Parse an elaborated-type-specifier. Note that the grammar given
9984 here incorporates the resolution to DR68.
9986 elaborated-type-specifier:
9987 class-key :: [opt] nested-name-specifier [opt] identifier
9988 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
9989 enum :: [opt] nested-name-specifier [opt] identifier
9990 typename :: [opt] nested-name-specifier identifier
9991 typename :: [opt] nested-name-specifier template [opt]
9996 elaborated-type-specifier:
9997 class-key attributes :: [opt] nested-name-specifier [opt] identifier
9998 class-key attributes :: [opt] nested-name-specifier [opt]
9999 template [opt] template-id
10000 enum attributes :: [opt] nested-name-specifier [opt] identifier
10002 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
10003 declared `friend'. If IS_DECLARATION is TRUE, then this
10004 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
10005 something is being declared.
10007 Returns the TYPE specified. */
10010 cp_parser_elaborated_type_specifier (cp_parser
* parser
,
10012 bool is_declaration
)
10014 enum tag_types tag_type
;
10016 tree type
= NULL_TREE
;
10017 tree attributes
= NULL_TREE
;
10019 /* See if we're looking at the `enum' keyword. */
10020 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ENUM
))
10022 /* Consume the `enum' token. */
10023 cp_lexer_consume_token (parser
->lexer
);
10024 /* Remember that it's an enumeration type. */
10025 tag_type
= enum_type
;
10026 /* Parse the attributes. */
10027 attributes
= cp_parser_attributes_opt (parser
);
10029 /* Or, it might be `typename'. */
10030 else if (cp_lexer_next_token_is_keyword (parser
->lexer
,
10033 /* Consume the `typename' token. */
10034 cp_lexer_consume_token (parser
->lexer
);
10035 /* Remember that it's a `typename' type. */
10036 tag_type
= typename_type
;
10037 /* The `typename' keyword is only allowed in templates. */
10038 if (!processing_template_decl
)
10039 pedwarn ("using %<typename%> outside of template");
10041 /* Otherwise it must be a class-key. */
10044 tag_type
= cp_parser_class_key (parser
);
10045 if (tag_type
== none_type
)
10046 return error_mark_node
;
10047 /* Parse the attributes. */
10048 attributes
= cp_parser_attributes_opt (parser
);
10051 /* Look for the `::' operator. */
10052 cp_parser_global_scope_opt (parser
,
10053 /*current_scope_valid_p=*/false);
10054 /* Look for the nested-name-specifier. */
10055 if (tag_type
== typename_type
)
10057 if (!cp_parser_nested_name_specifier (parser
,
10058 /*typename_keyword_p=*/true,
10059 /*check_dependency_p=*/true,
10062 return error_mark_node
;
10065 /* Even though `typename' is not present, the proposed resolution
10066 to Core Issue 180 says that in `class A<T>::B', `B' should be
10067 considered a type-name, even if `A<T>' is dependent. */
10068 cp_parser_nested_name_specifier_opt (parser
,
10069 /*typename_keyword_p=*/true,
10070 /*check_dependency_p=*/true,
10073 /* For everything but enumeration types, consider a template-id. */
10074 /* For an enumeration type, consider only a plain identifier. */
10075 if (tag_type
!= enum_type
)
10077 bool template_p
= false;
10080 /* Allow the `template' keyword. */
10081 template_p
= cp_parser_optional_template_keyword (parser
);
10082 /* If we didn't see `template', we don't know if there's a
10083 template-id or not. */
10085 cp_parser_parse_tentatively (parser
);
10086 /* Parse the template-id. */
10087 decl
= cp_parser_template_id (parser
, template_p
,
10088 /*check_dependency_p=*/true,
10090 /* If we didn't find a template-id, look for an ordinary
10092 if (!template_p
&& !cp_parser_parse_definitely (parser
))
10094 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
10095 in effect, then we must assume that, upon instantiation, the
10096 template will correspond to a class. */
10097 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
10098 && tag_type
== typename_type
)
10099 type
= make_typename_type (parser
->scope
, decl
,
10101 /*complain=*/tf_error
);
10103 type
= TREE_TYPE (decl
);
10108 identifier
= cp_parser_identifier (parser
);
10110 if (identifier
== error_mark_node
)
10112 parser
->scope
= NULL_TREE
;
10113 return error_mark_node
;
10116 /* For a `typename', we needn't call xref_tag. */
10117 if (tag_type
== typename_type
10118 && TREE_CODE (parser
->scope
) != NAMESPACE_DECL
)
10119 return cp_parser_make_typename_type (parser
, parser
->scope
,
10121 /* Look up a qualified name in the usual way. */
10126 decl
= cp_parser_lookup_name (parser
, identifier
,
10128 /*is_template=*/false,
10129 /*is_namespace=*/false,
10130 /*check_dependency=*/true,
10131 /*ambiguous_decls=*/NULL
);
10133 /* If we are parsing friend declaration, DECL may be a
10134 TEMPLATE_DECL tree node here. However, we need to check
10135 whether this TEMPLATE_DECL results in valid code. Consider
10136 the following example:
10139 template <class T> class C {};
10142 template <class T> friend class N::C; // #1, valid code
10144 template <class T> class Y {
10145 friend class N::C; // #2, invalid code
10148 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
10149 name lookup of `N::C'. We see that friend declaration must
10150 be template for the code to be valid. Note that
10151 processing_template_decl does not work here since it is
10152 always 1 for the above two cases. */
10154 decl
= (cp_parser_maybe_treat_template_as_class
10155 (decl
, /*tag_name_p=*/is_friend
10156 && parser
->num_template_parameter_lists
));
10158 if (TREE_CODE (decl
) != TYPE_DECL
)
10160 cp_parser_diagnose_invalid_type_name (parser
,
10163 return error_mark_node
;
10166 if (TREE_CODE (TREE_TYPE (decl
)) != TYPENAME_TYPE
)
10167 check_elaborated_type_specifier
10169 (parser
->num_template_parameter_lists
10170 || DECL_SELF_REFERENCE_P (decl
)));
10172 type
= TREE_TYPE (decl
);
10176 /* An elaborated-type-specifier sometimes introduces a new type and
10177 sometimes names an existing type. Normally, the rule is that it
10178 introduces a new type only if there is not an existing type of
10179 the same name already in scope. For example, given:
10182 void f() { struct S s; }
10184 the `struct S' in the body of `f' is the same `struct S' as in
10185 the global scope; the existing definition is used. However, if
10186 there were no global declaration, this would introduce a new
10187 local class named `S'.
10189 An exception to this rule applies to the following code:
10191 namespace N { struct S; }
10193 Here, the elaborated-type-specifier names a new type
10194 unconditionally; even if there is already an `S' in the
10195 containing scope this declaration names a new type.
10196 This exception only applies if the elaborated-type-specifier
10197 forms the complete declaration:
10201 A declaration consisting solely of `class-key identifier ;' is
10202 either a redeclaration of the name in the current scope or a
10203 forward declaration of the identifier as a class name. It
10204 introduces the name into the current scope.
10206 We are in this situation precisely when the next token is a `;'.
10208 An exception to the exception is that a `friend' declaration does
10209 *not* name a new type; i.e., given:
10211 struct S { friend struct T; };
10213 `T' is not a new type in the scope of `S'.
10215 Also, `new struct S' or `sizeof (struct S)' never results in the
10216 definition of a new type; a new type can only be declared in a
10217 declaration context. */
10223 /* Friends have special name lookup rules. */
10224 ts
= ts_within_enclosing_non_class
;
10225 else if (is_declaration
10226 && cp_lexer_next_token_is (parser
->lexer
,
10228 /* This is a `class-key identifier ;' */
10234 (parser
->num_template_parameter_lists
10235 && (cp_parser_next_token_starts_class_definition_p (parser
)
10236 || cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)));
10237 /* An unqualified name was used to reference this type, so
10238 there were no qualifying templates. */
10239 if (!cp_parser_check_template_parameters (parser
,
10240 /*num_templates=*/0))
10241 return error_mark_node
;
10242 type
= xref_tag (tag_type
, identifier
, ts
, template_p
);
10246 if (type
== error_mark_node
)
10247 return error_mark_node
;
10249 /* Allow attributes on forward declarations of classes. */
10252 if (TREE_CODE (type
) == TYPENAME_TYPE
)
10253 warning (OPT_Wattributes
,
10254 "attributes ignored on uninstantiated type");
10255 else if (tag_type
!= enum_type
&& CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
10256 && ! processing_explicit_instantiation
)
10257 warning (OPT_Wattributes
,
10258 "attributes ignored on template instantiation");
10259 else if (is_declaration
&& cp_parser_declares_only_class_p (parser
))
10260 cplus_decl_attributes (&type
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
10262 warning (OPT_Wattributes
,
10263 "attributes ignored on elaborated-type-specifier that is not a forward declaration");
10266 if (tag_type
!= enum_type
)
10267 cp_parser_check_class_key (tag_type
, type
);
10269 /* A "<" cannot follow an elaborated type specifier. If that
10270 happens, the user was probably trying to form a template-id. */
10271 cp_parser_check_for_invalid_template_id (parser
, type
);
10276 /* Parse an enum-specifier.
10279 enum identifier [opt] { enumerator-list [opt] }
10282 enum attributes[opt] identifier [opt] { enumerator-list [opt] }
10285 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
10286 if the token stream isn't an enum-specifier after all. */
10289 cp_parser_enum_specifier (cp_parser
* parser
)
10295 /* Parse tentatively so that we can back up if we don't find a
10297 cp_parser_parse_tentatively (parser
);
10299 /* Caller guarantees that the current token is 'enum', an identifier
10300 possibly follows, and the token after that is an opening brace.
10301 If we don't have an identifier, fabricate an anonymous name for
10302 the enumeration being defined. */
10303 cp_lexer_consume_token (parser
->lexer
);
10305 attributes
= cp_parser_attributes_opt (parser
);
10307 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
10308 identifier
= cp_parser_identifier (parser
);
10310 identifier
= make_anon_name ();
10312 /* Look for the `{' but don't consume it yet. */
10313 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
10314 cp_parser_simulate_error (parser
);
10316 if (!cp_parser_parse_definitely (parser
))
10319 /* Issue an error message if type-definitions are forbidden here. */
10320 cp_parser_check_type_definition (parser
);
10322 /* Create the new type. We do this before consuming the opening brace
10323 so the enum will be recorded as being on the line of its tag (or the
10324 'enum' keyword, if there is no tag). */
10325 type
= start_enum (identifier
);
10327 /* Consume the opening brace. */
10328 cp_lexer_consume_token (parser
->lexer
);
10330 if (type
== error_mark_node
)
10332 cp_parser_skip_to_end_of_block_or_statement (parser
);
10333 return error_mark_node
;
10336 /* If the next token is not '}', then there are some enumerators. */
10337 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_BRACE
))
10338 cp_parser_enumerator_list (parser
, type
);
10340 /* Consume the final '}'. */
10341 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "`}'");
10343 /* Look for trailing attributes to apply to this enumeration, and
10344 apply them if appropriate. */
10345 if (cp_parser_allow_gnu_extensions_p (parser
))
10347 tree trailing_attr
= cp_parser_attributes_opt (parser
);
10348 cplus_decl_attributes (&type
,
10350 (int) ATTR_FLAG_TYPE_IN_PLACE
);
10353 /* Finish up the enumeration. */
10354 finish_enum (type
);
10359 /* Parse an enumerator-list. The enumerators all have the indicated
10363 enumerator-definition
10364 enumerator-list , enumerator-definition */
10367 cp_parser_enumerator_list (cp_parser
* parser
, tree type
)
10371 /* Parse an enumerator-definition. */
10372 cp_parser_enumerator_definition (parser
, type
);
10374 /* If the next token is not a ',', we've reached the end of
10376 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
10378 /* Otherwise, consume the `,' and keep going. */
10379 cp_lexer_consume_token (parser
->lexer
);
10380 /* If the next token is a `}', there is a trailing comma. */
10381 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
10383 if (pedantic
&& !in_system_header
)
10384 pedwarn ("comma at end of enumerator list");
10390 /* Parse an enumerator-definition. The enumerator has the indicated
10393 enumerator-definition:
10395 enumerator = constant-expression
10401 cp_parser_enumerator_definition (cp_parser
* parser
, tree type
)
10406 /* Look for the identifier. */
10407 identifier
= cp_parser_identifier (parser
);
10408 if (identifier
== error_mark_node
)
10411 /* If the next token is an '=', then there is an explicit value. */
10412 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
10414 /* Consume the `=' token. */
10415 cp_lexer_consume_token (parser
->lexer
);
10416 /* Parse the value. */
10417 value
= cp_parser_constant_expression (parser
,
10418 /*allow_non_constant_p=*/false,
10424 /* Create the enumerator. */
10425 build_enumerator (identifier
, value
, type
);
10428 /* Parse a namespace-name.
10431 original-namespace-name
10434 Returns the NAMESPACE_DECL for the namespace. */
10437 cp_parser_namespace_name (cp_parser
* parser
)
10440 tree namespace_decl
;
10442 /* Get the name of the namespace. */
10443 identifier
= cp_parser_identifier (parser
);
10444 if (identifier
== error_mark_node
)
10445 return error_mark_node
;
10447 /* Look up the identifier in the currently active scope. Look only
10448 for namespaces, due to:
10450 [basic.lookup.udir]
10452 When looking up a namespace-name in a using-directive or alias
10453 definition, only namespace names are considered.
10457 [basic.lookup.qual]
10459 During the lookup of a name preceding the :: scope resolution
10460 operator, object, function, and enumerator names are ignored.
10462 (Note that cp_parser_class_or_namespace_name only calls this
10463 function if the token after the name is the scope resolution
10465 namespace_decl
= cp_parser_lookup_name (parser
, identifier
,
10467 /*is_template=*/false,
10468 /*is_namespace=*/true,
10469 /*check_dependency=*/true,
10470 /*ambiguous_decls=*/NULL
);
10471 /* If it's not a namespace, issue an error. */
10472 if (namespace_decl
== error_mark_node
10473 || TREE_CODE (namespace_decl
) != NAMESPACE_DECL
)
10475 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
10476 error ("%qD is not a namespace-name", identifier
);
10477 cp_parser_error (parser
, "expected namespace-name");
10478 namespace_decl
= error_mark_node
;
10481 return namespace_decl
;
10484 /* Parse a namespace-definition.
10486 namespace-definition:
10487 named-namespace-definition
10488 unnamed-namespace-definition
10490 named-namespace-definition:
10491 original-namespace-definition
10492 extension-namespace-definition
10494 original-namespace-definition:
10495 namespace identifier { namespace-body }
10497 extension-namespace-definition:
10498 namespace original-namespace-name { namespace-body }
10500 unnamed-namespace-definition:
10501 namespace { namespace-body } */
10504 cp_parser_namespace_definition (cp_parser
* parser
)
10506 tree identifier
, attribs
;
10508 /* Look for the `namespace' keyword. */
10509 cp_parser_require_keyword (parser
, RID_NAMESPACE
, "`namespace'");
10511 /* Get the name of the namespace. We do not attempt to distinguish
10512 between an original-namespace-definition and an
10513 extension-namespace-definition at this point. The semantic
10514 analysis routines are responsible for that. */
10515 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
10516 identifier
= cp_parser_identifier (parser
);
10518 identifier
= NULL_TREE
;
10520 /* Parse any specified attributes. */
10521 attribs
= cp_parser_attributes_opt (parser
);
10523 /* Look for the `{' to start the namespace. */
10524 cp_parser_require (parser
, CPP_OPEN_BRACE
, "`{'");
10525 /* Start the namespace. */
10526 push_namespace_with_attribs (identifier
, attribs
);
10527 /* Parse the body of the namespace. */
10528 cp_parser_namespace_body (parser
);
10529 /* Finish the namespace. */
10531 /* Look for the final `}'. */
10532 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "`}'");
10535 /* Parse a namespace-body.
10538 declaration-seq [opt] */
10541 cp_parser_namespace_body (cp_parser
* parser
)
10543 cp_parser_declaration_seq_opt (parser
);
10546 /* Parse a namespace-alias-definition.
10548 namespace-alias-definition:
10549 namespace identifier = qualified-namespace-specifier ; */
10552 cp_parser_namespace_alias_definition (cp_parser
* parser
)
10555 tree namespace_specifier
;
10557 /* Look for the `namespace' keyword. */
10558 cp_parser_require_keyword (parser
, RID_NAMESPACE
, "`namespace'");
10559 /* Look for the identifier. */
10560 identifier
= cp_parser_identifier (parser
);
10561 if (identifier
== error_mark_node
)
10563 /* Look for the `=' token. */
10564 cp_parser_require (parser
, CPP_EQ
, "`='");
10565 /* Look for the qualified-namespace-specifier. */
10566 namespace_specifier
10567 = cp_parser_qualified_namespace_specifier (parser
);
10568 /* Look for the `;' token. */
10569 cp_parser_require (parser
, CPP_SEMICOLON
, "`;'");
10571 /* Register the alias in the symbol table. */
10572 do_namespace_alias (identifier
, namespace_specifier
);
10575 /* Parse a qualified-namespace-specifier.
10577 qualified-namespace-specifier:
10578 :: [opt] nested-name-specifier [opt] namespace-name
10580 Returns a NAMESPACE_DECL corresponding to the specified
10584 cp_parser_qualified_namespace_specifier (cp_parser
* parser
)
10586 /* Look for the optional `::'. */
10587 cp_parser_global_scope_opt (parser
,
10588 /*current_scope_valid_p=*/false);
10590 /* Look for the optional nested-name-specifier. */
10591 cp_parser_nested_name_specifier_opt (parser
,
10592 /*typename_keyword_p=*/false,
10593 /*check_dependency_p=*/true,
10595 /*is_declaration=*/true);
10597 return cp_parser_namespace_name (parser
);
10600 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
10601 access declaration.
10604 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
10605 using :: unqualified-id ;
10607 access-declaration:
10613 cp_parser_using_declaration (cp_parser
* parser
,
10614 bool access_declaration_p
)
10617 bool typename_p
= false;
10618 bool global_scope_p
;
10623 if (access_declaration_p
)
10624 cp_parser_parse_tentatively (parser
);
10627 /* Look for the `using' keyword. */
10628 cp_parser_require_keyword (parser
, RID_USING
, "`using'");
10630 /* Peek at the next token. */
10631 token
= cp_lexer_peek_token (parser
->lexer
);
10632 /* See if it's `typename'. */
10633 if (token
->keyword
== RID_TYPENAME
)
10635 /* Remember that we've seen it. */
10637 /* Consume the `typename' token. */
10638 cp_lexer_consume_token (parser
->lexer
);
10642 /* Look for the optional global scope qualification. */
10644 = (cp_parser_global_scope_opt (parser
,
10645 /*current_scope_valid_p=*/false)
10648 /* If we saw `typename', or didn't see `::', then there must be a
10649 nested-name-specifier present. */
10650 if (typename_p
|| !global_scope_p
)
10651 qscope
= cp_parser_nested_name_specifier (parser
, typename_p
,
10652 /*check_dependency_p=*/true,
10654 /*is_declaration=*/true);
10655 /* Otherwise, we could be in either of the two productions. In that
10656 case, treat the nested-name-specifier as optional. */
10658 qscope
= cp_parser_nested_name_specifier_opt (parser
,
10659 /*typename_keyword_p=*/false,
10660 /*check_dependency_p=*/true,
10662 /*is_declaration=*/true);
10664 qscope
= global_namespace
;
10666 /* Parse the unqualified-id. */
10667 identifier
= cp_parser_unqualified_id (parser
,
10668 /*template_keyword_p=*/false,
10669 /*check_dependency_p=*/true,
10670 /*declarator_p=*/true,
10671 /*optional_p=*/false);
10673 if (access_declaration_p
)
10675 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
10676 cp_parser_simulate_error (parser
);
10677 if (!cp_parser_parse_definitely (parser
))
10681 /* The function we call to handle a using-declaration is different
10682 depending on what scope we are in. */
10683 if (qscope
== error_mark_node
|| identifier
== error_mark_node
)
10685 else if (TREE_CODE (identifier
) != IDENTIFIER_NODE
10686 && TREE_CODE (identifier
) != BIT_NOT_EXPR
)
10687 /* [namespace.udecl]
10689 A using declaration shall not name a template-id. */
10690 error ("a template-id may not appear in a using-declaration");
10693 if (at_class_scope_p ())
10695 /* Create the USING_DECL. */
10696 decl
= do_class_using_decl (parser
->scope
, identifier
);
10697 /* Add it to the list of members in this class. */
10698 finish_member_declaration (decl
);
10702 decl
= cp_parser_lookup_name_simple (parser
, identifier
);
10703 if (decl
== error_mark_node
)
10704 cp_parser_name_lookup_error (parser
, identifier
, decl
, NULL
);
10705 else if (!at_namespace_scope_p ())
10706 do_local_using_decl (decl
, qscope
, identifier
);
10708 do_toplevel_using_decl (decl
, qscope
, identifier
);
10712 /* Look for the final `;'. */
10713 cp_parser_require (parser
, CPP_SEMICOLON
, "`;'");
10718 /* Parse a using-directive.
10721 using namespace :: [opt] nested-name-specifier [opt]
10722 namespace-name ; */
10725 cp_parser_using_directive (cp_parser
* parser
)
10727 tree namespace_decl
;
10730 /* Look for the `using' keyword. */
10731 cp_parser_require_keyword (parser
, RID_USING
, "`using'");
10732 /* And the `namespace' keyword. */
10733 cp_parser_require_keyword (parser
, RID_NAMESPACE
, "`namespace'");
10734 /* Look for the optional `::' operator. */
10735 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false);
10736 /* And the optional nested-name-specifier. */
10737 cp_parser_nested_name_specifier_opt (parser
,
10738 /*typename_keyword_p=*/false,
10739 /*check_dependency_p=*/true,
10741 /*is_declaration=*/true);
10742 /* Get the namespace being used. */
10743 namespace_decl
= cp_parser_namespace_name (parser
);
10744 /* And any specified attributes. */
10745 attribs
= cp_parser_attributes_opt (parser
);
10746 /* Update the symbol table. */
10747 parse_using_directive (namespace_decl
, attribs
);
10748 /* Look for the final `;'. */
10749 cp_parser_require (parser
, CPP_SEMICOLON
, "`;'");
10752 /* Parse an asm-definition.
10755 asm ( string-literal ) ;
10760 asm volatile [opt] ( string-literal ) ;
10761 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
10762 asm volatile [opt] ( string-literal : asm-operand-list [opt]
10763 : asm-operand-list [opt] ) ;
10764 asm volatile [opt] ( string-literal : asm-operand-list [opt]
10765 : asm-operand-list [opt]
10766 : asm-operand-list [opt] ) ; */
10769 cp_parser_asm_definition (cp_parser
* parser
)
10772 tree outputs
= NULL_TREE
;
10773 tree inputs
= NULL_TREE
;
10774 tree clobbers
= NULL_TREE
;
10776 bool volatile_p
= false;
10777 bool extended_p
= false;
10779 /* Look for the `asm' keyword. */
10780 cp_parser_require_keyword (parser
, RID_ASM
, "`asm'");
10781 /* See if the next token is `volatile'. */
10782 if (cp_parser_allow_gnu_extensions_p (parser
)
10783 && cp_lexer_next_token_is_keyword (parser
->lexer
, RID_VOLATILE
))
10785 /* Remember that we saw the `volatile' keyword. */
10787 /* Consume the token. */
10788 cp_lexer_consume_token (parser
->lexer
);
10790 /* Look for the opening `('. */
10791 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('"))
10793 /* Look for the string. */
10794 string
= cp_parser_string_literal (parser
, false, false);
10795 if (string
== error_mark_node
)
10797 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
10798 /*consume_paren=*/true);
10802 /* If we're allowing GNU extensions, check for the extended assembly
10803 syntax. Unfortunately, the `:' tokens need not be separated by
10804 a space in C, and so, for compatibility, we tolerate that here
10805 too. Doing that means that we have to treat the `::' operator as
10807 if (cp_parser_allow_gnu_extensions_p (parser
)
10808 && at_function_scope_p ()
10809 && (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
)
10810 || cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
)))
10812 bool inputs_p
= false;
10813 bool clobbers_p
= false;
10815 /* The extended syntax was used. */
10818 /* Look for outputs. */
10819 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
10821 /* Consume the `:'. */
10822 cp_lexer_consume_token (parser
->lexer
);
10823 /* Parse the output-operands. */
10824 if (cp_lexer_next_token_is_not (parser
->lexer
,
10826 && cp_lexer_next_token_is_not (parser
->lexer
,
10828 && cp_lexer_next_token_is_not (parser
->lexer
,
10830 outputs
= cp_parser_asm_operand_list (parser
);
10832 /* If the next token is `::', there are no outputs, and the
10833 next token is the beginning of the inputs. */
10834 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
10835 /* The inputs are coming next. */
10838 /* Look for inputs. */
10840 || cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
10842 /* Consume the `:' or `::'. */
10843 cp_lexer_consume_token (parser
->lexer
);
10844 /* Parse the output-operands. */
10845 if (cp_lexer_next_token_is_not (parser
->lexer
,
10847 && cp_lexer_next_token_is_not (parser
->lexer
,
10849 inputs
= cp_parser_asm_operand_list (parser
);
10851 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
10852 /* The clobbers are coming next. */
10855 /* Look for clobbers. */
10857 || cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
10859 /* Consume the `:' or `::'. */
10860 cp_lexer_consume_token (parser
->lexer
);
10861 /* Parse the clobbers. */
10862 if (cp_lexer_next_token_is_not (parser
->lexer
,
10864 clobbers
= cp_parser_asm_clobber_list (parser
);
10867 /* Look for the closing `)'. */
10868 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'"))
10869 cp_parser_skip_to_closing_parenthesis (parser
, true, false,
10870 /*consume_paren=*/true);
10871 cp_parser_require (parser
, CPP_SEMICOLON
, "`;'");
10873 /* Create the ASM_EXPR. */
10874 if (at_function_scope_p ())
10876 asm_stmt
= finish_asm_stmt (volatile_p
, string
, outputs
,
10878 /* If the extended syntax was not used, mark the ASM_EXPR. */
10881 tree temp
= asm_stmt
;
10882 if (TREE_CODE (temp
) == CLEANUP_POINT_EXPR
)
10883 temp
= TREE_OPERAND (temp
, 0);
10885 ASM_INPUT_P (temp
) = 1;
10889 cgraph_add_asm_node (string
);
10892 /* Declarators [gram.dcl.decl] */
10894 /* Parse an init-declarator.
10897 declarator initializer [opt]
10902 declarator asm-specification [opt] attributes [opt] initializer [opt]
10904 function-definition:
10905 decl-specifier-seq [opt] declarator ctor-initializer [opt]
10907 decl-specifier-seq [opt] declarator function-try-block
10911 function-definition:
10912 __extension__ function-definition
10914 The DECL_SPECIFIERS apply to this declarator. Returns a
10915 representation of the entity declared. If MEMBER_P is TRUE, then
10916 this declarator appears in a class scope. The new DECL created by
10917 this declarator is returned.
10919 The CHECKS are access checks that should be performed once we know
10920 what entity is being declared (and, therefore, what classes have
10923 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
10924 for a function-definition here as well. If the declarator is a
10925 declarator for a function-definition, *FUNCTION_DEFINITION_P will
10926 be TRUE upon return. By that point, the function-definition will
10927 have been completely parsed.
10929 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
10933 cp_parser_init_declarator (cp_parser
* parser
,
10934 cp_decl_specifier_seq
*decl_specifiers
,
10936 bool function_definition_allowed_p
,
10938 int declares_class_or_enum
,
10939 bool* function_definition_p
)
10942 cp_declarator
*declarator
;
10943 tree prefix_attributes
;
10945 tree asm_specification
;
10947 tree decl
= NULL_TREE
;
10949 bool is_initialized
;
10950 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
10951 initialized with "= ..", CPP_OPEN_PAREN if initialized with
10953 enum cpp_ttype initialization_kind
;
10954 bool is_parenthesized_init
= false;
10955 bool is_non_constant_init
;
10956 int ctor_dtor_or_conv_p
;
10958 tree pushed_scope
= NULL
;
10960 /* Gather the attributes that were provided with the
10961 decl-specifiers. */
10962 prefix_attributes
= decl_specifiers
->attributes
;
10964 /* Assume that this is not the declarator for a function
10966 if (function_definition_p
)
10967 *function_definition_p
= false;
10969 /* Defer access checks while parsing the declarator; we cannot know
10970 what names are accessible until we know what is being
10972 resume_deferring_access_checks ();
10974 /* Parse the declarator. */
10976 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
10977 &ctor_dtor_or_conv_p
,
10978 /*parenthesized_p=*/NULL
,
10979 /*member_p=*/false);
10980 /* Gather up the deferred checks. */
10981 stop_deferring_access_checks ();
10983 /* If the DECLARATOR was erroneous, there's no need to go
10985 if (declarator
== cp_error_declarator
)
10986 return error_mark_node
;
10988 if (declares_class_or_enum
& 2)
10989 cp_parser_check_for_definition_in_return_type (declarator
,
10990 decl_specifiers
->type
);
10992 /* Figure out what scope the entity declared by the DECLARATOR is
10993 located in. `grokdeclarator' sometimes changes the scope, so
10994 we compute it now. */
10995 scope
= get_scope_of_declarator (declarator
);
10997 /* If we're allowing GNU extensions, look for an asm-specification
10999 if (cp_parser_allow_gnu_extensions_p (parser
))
11001 /* Look for an asm-specification. */
11002 asm_specification
= cp_parser_asm_specification_opt (parser
);
11003 /* And attributes. */
11004 attributes
= cp_parser_attributes_opt (parser
);
11008 asm_specification
= NULL_TREE
;
11009 attributes
= NULL_TREE
;
11012 /* Peek at the next token. */
11013 token
= cp_lexer_peek_token (parser
->lexer
);
11014 /* Check to see if the token indicates the start of a
11015 function-definition. */
11016 if (cp_parser_token_starts_function_definition_p (token
))
11018 if (!function_definition_allowed_p
)
11020 /* If a function-definition should not appear here, issue an
11022 cp_parser_error (parser
,
11023 "a function-definition is not allowed here");
11024 return error_mark_node
;
11028 /* Neither attributes nor an asm-specification are allowed
11029 on a function-definition. */
11030 if (asm_specification
)
11031 error ("an asm-specification is not allowed on a function-definition");
11033 error ("attributes are not allowed on a function-definition");
11034 /* This is a function-definition. */
11035 *function_definition_p
= true;
11037 /* Parse the function definition. */
11039 decl
= cp_parser_save_member_function_body (parser
,
11042 prefix_attributes
);
11045 = (cp_parser_function_definition_from_specifiers_and_declarator
11046 (parser
, decl_specifiers
, prefix_attributes
, declarator
));
11054 Only in function declarations for constructors, destructors, and
11055 type conversions can the decl-specifier-seq be omitted.
11057 We explicitly postpone this check past the point where we handle
11058 function-definitions because we tolerate function-definitions
11059 that are missing their return types in some modes. */
11060 if (!decl_specifiers
->any_specifiers_p
&& ctor_dtor_or_conv_p
<= 0)
11062 cp_parser_error (parser
,
11063 "expected constructor, destructor, or type conversion");
11064 return error_mark_node
;
11067 /* An `=' or an `(' indicates an initializer. */
11068 if (token
->type
== CPP_EQ
11069 || token
->type
== CPP_OPEN_PAREN
)
11071 is_initialized
= true;
11072 initialization_kind
= token
->type
;
11076 /* If the init-declarator isn't initialized and isn't followed by a
11077 `,' or `;', it's not a valid init-declarator. */
11078 if (token
->type
!= CPP_COMMA
11079 && token
->type
!= CPP_SEMICOLON
)
11081 cp_parser_error (parser
, "expected initializer");
11082 return error_mark_node
;
11084 is_initialized
= false;
11085 initialization_kind
= CPP_EOF
;
11088 /* Because start_decl has side-effects, we should only call it if we
11089 know we're going ahead. By this point, we know that we cannot
11090 possibly be looking at any other construct. */
11091 cp_parser_commit_to_tentative_parse (parser
);
11093 /* If the decl specifiers were bad, issue an error now that we're
11094 sure this was intended to be a declarator. Then continue
11095 declaring the variable(s), as int, to try to cut down on further
11097 if (decl_specifiers
->any_specifiers_p
11098 && decl_specifiers
->type
== error_mark_node
)
11100 cp_parser_error (parser
, "invalid type in declaration");
11101 decl_specifiers
->type
= integer_type_node
;
11104 /* Check to see whether or not this declaration is a friend. */
11105 friend_p
= cp_parser_friend_p (decl_specifiers
);
11107 /* Check that the number of template-parameter-lists is OK. */
11108 if (!cp_parser_check_declarator_template_parameters (parser
, declarator
))
11109 return error_mark_node
;
11111 /* Enter the newly declared entry in the symbol table. If we're
11112 processing a declaration in a class-specifier, we wait until
11113 after processing the initializer. */
11116 if (parser
->in_unbraced_linkage_specification_p
)
11117 decl_specifiers
->storage_class
= sc_extern
;
11118 decl
= start_decl (declarator
, decl_specifiers
,
11119 is_initialized
, attributes
, prefix_attributes
,
11123 /* Enter the SCOPE. That way unqualified names appearing in the
11124 initializer will be looked up in SCOPE. */
11125 pushed_scope
= push_scope (scope
);
11127 /* Perform deferred access control checks, now that we know in which
11128 SCOPE the declared entity resides. */
11129 if (!member_p
&& decl
)
11131 tree saved_current_function_decl
= NULL_TREE
;
11133 /* If the entity being declared is a function, pretend that we
11134 are in its scope. If it is a `friend', it may have access to
11135 things that would not otherwise be accessible. */
11136 if (TREE_CODE (decl
) == FUNCTION_DECL
)
11138 saved_current_function_decl
= current_function_decl
;
11139 current_function_decl
= decl
;
11142 /* Perform access checks for template parameters. */
11143 cp_parser_perform_template_parameter_access_checks (checks
);
11145 /* Perform the access control checks for the declarator and the
11146 the decl-specifiers. */
11147 perform_deferred_access_checks ();
11149 /* Restore the saved value. */
11150 if (TREE_CODE (decl
) == FUNCTION_DECL
)
11151 current_function_decl
= saved_current_function_decl
;
11154 /* Parse the initializer. */
11155 initializer
= NULL_TREE
;
11156 is_parenthesized_init
= false;
11157 is_non_constant_init
= true;
11158 if (is_initialized
)
11160 if (declarator
->kind
== cdk_function
11161 && declarator
->declarator
->kind
== cdk_id
11162 && initialization_kind
== CPP_EQ
)
11163 initializer
= cp_parser_pure_specifier (parser
);
11165 initializer
= cp_parser_initializer (parser
,
11166 &is_parenthesized_init
,
11167 &is_non_constant_init
);
11170 /* The old parser allows attributes to appear after a parenthesized
11171 initializer. Mark Mitchell proposed removing this functionality
11172 on the GCC mailing lists on 2002-08-13. This parser accepts the
11173 attributes -- but ignores them. */
11174 if (cp_parser_allow_gnu_extensions_p (parser
) && is_parenthesized_init
)
11175 if (cp_parser_attributes_opt (parser
))
11176 warning (OPT_Wattributes
,
11177 "attributes after parenthesized initializer ignored");
11179 /* For an in-class declaration, use `grokfield' to create the
11185 pop_scope (pushed_scope
);
11186 pushed_scope
= false;
11188 decl
= grokfield (declarator
, decl_specifiers
,
11189 initializer
, !is_non_constant_init
,
11190 /*asmspec=*/NULL_TREE
,
11191 prefix_attributes
);
11192 if (decl
&& TREE_CODE (decl
) == FUNCTION_DECL
)
11193 cp_parser_save_default_args (parser
, decl
);
11196 /* Finish processing the declaration. But, skip friend
11198 if (!friend_p
&& decl
&& decl
!= error_mark_node
)
11200 cp_finish_decl (decl
,
11201 initializer
, !is_non_constant_init
,
11203 /* If the initializer is in parentheses, then this is
11204 a direct-initialization, which means that an
11205 `explicit' constructor is OK. Otherwise, an
11206 `explicit' constructor cannot be used. */
11207 ((is_parenthesized_init
|| !is_initialized
)
11208 ? 0 : LOOKUP_ONLYCONVERTING
));
11210 if (!friend_p
&& pushed_scope
)
11211 pop_scope (pushed_scope
);
11216 /* Parse a declarator.
11220 ptr-operator declarator
11222 abstract-declarator:
11223 ptr-operator abstract-declarator [opt]
11224 direct-abstract-declarator
11229 attributes [opt] direct-declarator
11230 attributes [opt] ptr-operator declarator
11232 abstract-declarator:
11233 attributes [opt] ptr-operator abstract-declarator [opt]
11234 attributes [opt] direct-abstract-declarator
11236 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
11237 detect constructor, destructor or conversion operators. It is set
11238 to -1 if the declarator is a name, and +1 if it is a
11239 function. Otherwise it is set to zero. Usually you just want to
11240 test for >0, but internally the negative value is used.
11242 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
11243 a decl-specifier-seq unless it declares a constructor, destructor,
11244 or conversion. It might seem that we could check this condition in
11245 semantic analysis, rather than parsing, but that makes it difficult
11246 to handle something like `f()'. We want to notice that there are
11247 no decl-specifiers, and therefore realize that this is an
11248 expression, not a declaration.)
11250 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
11251 the declarator is a direct-declarator of the form "(...)".
11253 MEMBER_P is true iff this declarator is a member-declarator. */
11255 static cp_declarator
*
11256 cp_parser_declarator (cp_parser
* parser
,
11257 cp_parser_declarator_kind dcl_kind
,
11258 int* ctor_dtor_or_conv_p
,
11259 bool* parenthesized_p
,
11263 cp_declarator
*declarator
;
11264 enum tree_code code
;
11265 cp_cv_quals cv_quals
;
11267 tree attributes
= NULL_TREE
;
11269 /* Assume this is not a constructor, destructor, or type-conversion
11271 if (ctor_dtor_or_conv_p
)
11272 *ctor_dtor_or_conv_p
= 0;
11274 if (cp_parser_allow_gnu_extensions_p (parser
))
11275 attributes
= cp_parser_attributes_opt (parser
);
11277 /* Peek at the next token. */
11278 token
= cp_lexer_peek_token (parser
->lexer
);
11280 /* Check for the ptr-operator production. */
11281 cp_parser_parse_tentatively (parser
);
11282 /* Parse the ptr-operator. */
11283 code
= cp_parser_ptr_operator (parser
,
11286 /* If that worked, then we have a ptr-operator. */
11287 if (cp_parser_parse_definitely (parser
))
11289 /* If a ptr-operator was found, then this declarator was not
11291 if (parenthesized_p
)
11292 *parenthesized_p
= true;
11293 /* The dependent declarator is optional if we are parsing an
11294 abstract-declarator. */
11295 if (dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
)
11296 cp_parser_parse_tentatively (parser
);
11298 /* Parse the dependent declarator. */
11299 declarator
= cp_parser_declarator (parser
, dcl_kind
,
11300 /*ctor_dtor_or_conv_p=*/NULL
,
11301 /*parenthesized_p=*/NULL
,
11302 /*member_p=*/false);
11304 /* If we are parsing an abstract-declarator, we must handle the
11305 case where the dependent declarator is absent. */
11306 if (dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
11307 && !cp_parser_parse_definitely (parser
))
11310 /* Build the representation of the ptr-operator. */
11312 declarator
= make_ptrmem_declarator (cv_quals
,
11315 else if (code
== INDIRECT_REF
)
11316 declarator
= make_pointer_declarator (cv_quals
, declarator
);
11318 declarator
= make_reference_declarator (cv_quals
, declarator
);
11320 /* Everything else is a direct-declarator. */
11323 if (parenthesized_p
)
11324 *parenthesized_p
= cp_lexer_next_token_is (parser
->lexer
,
11326 declarator
= cp_parser_direct_declarator (parser
, dcl_kind
,
11327 ctor_dtor_or_conv_p
,
11331 if (attributes
&& declarator
&& declarator
!= cp_error_declarator
)
11332 declarator
->attributes
= attributes
;
11337 /* Parse a direct-declarator or direct-abstract-declarator.
11341 direct-declarator ( parameter-declaration-clause )
11342 cv-qualifier-seq [opt]
11343 exception-specification [opt]
11344 direct-declarator [ constant-expression [opt] ]
11347 direct-abstract-declarator:
11348 direct-abstract-declarator [opt]
11349 ( parameter-declaration-clause )
11350 cv-qualifier-seq [opt]
11351 exception-specification [opt]
11352 direct-abstract-declarator [opt] [ constant-expression [opt] ]
11353 ( abstract-declarator )
11355 Returns a representation of the declarator. DCL_KIND is
11356 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
11357 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
11358 we are parsing a direct-declarator. It is
11359 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
11360 of ambiguity we prefer an abstract declarator, as per
11361 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
11362 cp_parser_declarator. */
11364 static cp_declarator
*
11365 cp_parser_direct_declarator (cp_parser
* parser
,
11366 cp_parser_declarator_kind dcl_kind
,
11367 int* ctor_dtor_or_conv_p
,
11371 cp_declarator
*declarator
= NULL
;
11372 tree scope
= NULL_TREE
;
11373 bool saved_default_arg_ok_p
= parser
->default_arg_ok_p
;
11374 bool saved_in_declarator_p
= parser
->in_declarator_p
;
11376 tree pushed_scope
= NULL_TREE
;
11380 /* Peek at the next token. */
11381 token
= cp_lexer_peek_token (parser
->lexer
);
11382 if (token
->type
== CPP_OPEN_PAREN
)
11384 /* This is either a parameter-declaration-clause, or a
11385 parenthesized declarator. When we know we are parsing a
11386 named declarator, it must be a parenthesized declarator
11387 if FIRST is true. For instance, `(int)' is a
11388 parameter-declaration-clause, with an omitted
11389 direct-abstract-declarator. But `((*))', is a
11390 parenthesized abstract declarator. Finally, when T is a
11391 template parameter `(T)' is a
11392 parameter-declaration-clause, and not a parenthesized
11395 We first try and parse a parameter-declaration-clause,
11396 and then try a nested declarator (if FIRST is true).
11398 It is not an error for it not to be a
11399 parameter-declaration-clause, even when FIRST is
11405 The first is the declaration of a function while the
11406 second is a the definition of a variable, including its
11409 Having seen only the parenthesis, we cannot know which of
11410 these two alternatives should be selected. Even more
11411 complex are examples like:
11416 The former is a function-declaration; the latter is a
11417 variable initialization.
11419 Thus again, we try a parameter-declaration-clause, and if
11420 that fails, we back out and return. */
11422 if (!first
|| dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
)
11424 cp_parameter_declarator
*params
;
11425 unsigned saved_num_template_parameter_lists
;
11427 /* In a member-declarator, the only valid interpretation
11428 of a parenthesis is the start of a
11429 parameter-declaration-clause. (It is invalid to
11430 initialize a static data member with a parenthesized
11431 initializer; only the "=" form of initialization is
11434 cp_parser_parse_tentatively (parser
);
11436 /* Consume the `('. */
11437 cp_lexer_consume_token (parser
->lexer
);
11440 /* If this is going to be an abstract declarator, we're
11441 in a declarator and we can't have default args. */
11442 parser
->default_arg_ok_p
= false;
11443 parser
->in_declarator_p
= true;
11446 /* Inside the function parameter list, surrounding
11447 template-parameter-lists do not apply. */
11448 saved_num_template_parameter_lists
11449 = parser
->num_template_parameter_lists
;
11450 parser
->num_template_parameter_lists
= 0;
11452 /* Parse the parameter-declaration-clause. */
11453 params
= cp_parser_parameter_declaration_clause (parser
);
11455 parser
->num_template_parameter_lists
11456 = saved_num_template_parameter_lists
;
11458 /* If all went well, parse the cv-qualifier-seq and the
11459 exception-specification. */
11460 if (member_p
|| cp_parser_parse_definitely (parser
))
11462 cp_cv_quals cv_quals
;
11463 tree exception_specification
;
11465 if (ctor_dtor_or_conv_p
)
11466 *ctor_dtor_or_conv_p
= *ctor_dtor_or_conv_p
< 0;
11468 /* Consume the `)'. */
11469 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
11471 /* Parse the cv-qualifier-seq. */
11472 cv_quals
= cp_parser_cv_qualifier_seq_opt (parser
);
11473 /* And the exception-specification. */
11474 exception_specification
11475 = cp_parser_exception_specification_opt (parser
);
11477 /* Create the function-declarator. */
11478 declarator
= make_call_declarator (declarator
,
11481 exception_specification
);
11482 /* Any subsequent parameter lists are to do with
11483 return type, so are not those of the declared
11485 parser
->default_arg_ok_p
= false;
11487 /* Repeat the main loop. */
11492 /* If this is the first, we can try a parenthesized
11496 bool saved_in_type_id_in_expr_p
;
11498 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
11499 parser
->in_declarator_p
= saved_in_declarator_p
;
11501 /* Consume the `('. */
11502 cp_lexer_consume_token (parser
->lexer
);
11503 /* Parse the nested declarator. */
11504 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
11505 parser
->in_type_id_in_expr_p
= true;
11507 = cp_parser_declarator (parser
, dcl_kind
, ctor_dtor_or_conv_p
,
11508 /*parenthesized_p=*/NULL
,
11510 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
11512 /* Expect a `)'. */
11513 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'"))
11514 declarator
= cp_error_declarator
;
11515 if (declarator
== cp_error_declarator
)
11518 goto handle_declarator
;
11520 /* Otherwise, we must be done. */
11524 else if ((!first
|| dcl_kind
!= CP_PARSER_DECLARATOR_NAMED
)
11525 && token
->type
== CPP_OPEN_SQUARE
)
11527 /* Parse an array-declarator. */
11530 if (ctor_dtor_or_conv_p
)
11531 *ctor_dtor_or_conv_p
= 0;
11534 parser
->default_arg_ok_p
= false;
11535 parser
->in_declarator_p
= true;
11536 /* Consume the `['. */
11537 cp_lexer_consume_token (parser
->lexer
);
11538 /* Peek at the next token. */
11539 token
= cp_lexer_peek_token (parser
->lexer
);
11540 /* If the next token is `]', then there is no
11541 constant-expression. */
11542 if (token
->type
!= CPP_CLOSE_SQUARE
)
11544 bool non_constant_p
;
11547 = cp_parser_constant_expression (parser
,
11548 /*allow_non_constant=*/true,
11550 if (!non_constant_p
)
11551 bounds
= fold_non_dependent_expr (bounds
);
11552 /* Normally, the array bound must be an integral constant
11553 expression. However, as an extension, we allow VLAs
11554 in function scopes. */
11555 else if (!at_function_scope_p ())
11557 error ("array bound is not an integer constant");
11558 bounds
= error_mark_node
;
11562 bounds
= NULL_TREE
;
11563 /* Look for the closing `]'. */
11564 if (!cp_parser_require (parser
, CPP_CLOSE_SQUARE
, "`]'"))
11566 declarator
= cp_error_declarator
;
11570 declarator
= make_array_declarator (declarator
, bounds
);
11572 else if (first
&& dcl_kind
!= CP_PARSER_DECLARATOR_ABSTRACT
)
11574 tree qualifying_scope
;
11575 tree unqualified_name
;
11576 special_function_kind sfk
;
11579 /* Parse a declarator-id */
11580 abstract_ok
= (dcl_kind
== CP_PARSER_DECLARATOR_EITHER
);
11582 cp_parser_parse_tentatively (parser
);
11584 = cp_parser_declarator_id (parser
, /*optional_p=*/abstract_ok
);
11585 qualifying_scope
= parser
->scope
;
11588 if (!cp_parser_parse_definitely (parser
))
11589 unqualified_name
= error_mark_node
;
11590 else if (unqualified_name
11591 && (qualifying_scope
11592 || (TREE_CODE (unqualified_name
)
11593 != IDENTIFIER_NODE
)))
11595 cp_parser_error (parser
, "expected unqualified-id");
11596 unqualified_name
= error_mark_node
;
11600 if (!unqualified_name
)
11602 if (unqualified_name
== error_mark_node
)
11604 declarator
= cp_error_declarator
;
11608 if (qualifying_scope
&& at_namespace_scope_p ()
11609 && TREE_CODE (qualifying_scope
) == TYPENAME_TYPE
)
11611 /* In the declaration of a member of a template class
11612 outside of the class itself, the SCOPE will sometimes
11613 be a TYPENAME_TYPE. For example, given:
11615 template <typename T>
11616 int S<T>::R::i = 3;
11618 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
11619 this context, we must resolve S<T>::R to an ordinary
11620 type, rather than a typename type.
11622 The reason we normally avoid resolving TYPENAME_TYPEs
11623 is that a specialization of `S' might render
11624 `S<T>::R' not a type. However, if `S' is
11625 specialized, then this `i' will not be used, so there
11626 is no harm in resolving the types here. */
11629 /* Resolve the TYPENAME_TYPE. */
11630 type
= resolve_typename_type (qualifying_scope
,
11631 /*only_current_p=*/false);
11632 /* If that failed, the declarator is invalid. */
11633 if (type
== error_mark_node
)
11634 error ("%<%T::%D%> is not a type",
11635 TYPE_CONTEXT (qualifying_scope
),
11636 TYPE_IDENTIFIER (qualifying_scope
));
11637 qualifying_scope
= type
;
11641 if (unqualified_name
)
11645 if (qualifying_scope
11646 && CLASS_TYPE_P (qualifying_scope
))
11647 class_type
= qualifying_scope
;
11649 class_type
= current_class_type
;
11651 if (TREE_CODE (unqualified_name
) == TYPE_DECL
)
11653 tree name_type
= TREE_TYPE (unqualified_name
);
11654 if (class_type
&& same_type_p (name_type
, class_type
))
11656 if (qualifying_scope
11657 && CLASSTYPE_USE_TEMPLATE (name_type
))
11659 error ("invalid use of constructor as a template");
11660 inform ("use %<%T::%D%> instead of %<%T::%D%> to "
11661 "name the constructor in a qualified name",
11663 DECL_NAME (TYPE_TI_TEMPLATE (class_type
)),
11664 class_type
, name_type
);
11665 declarator
= cp_error_declarator
;
11669 unqualified_name
= constructor_name (class_type
);
11673 /* We do not attempt to print the declarator
11674 here because we do not have enough
11675 information about its original syntactic
11677 cp_parser_error (parser
, "invalid declarator");
11678 declarator
= cp_error_declarator
;
11685 if (TREE_CODE (unqualified_name
) == BIT_NOT_EXPR
)
11686 sfk
= sfk_destructor
;
11687 else if (IDENTIFIER_TYPENAME_P (unqualified_name
))
11688 sfk
= sfk_conversion
;
11689 else if (/* There's no way to declare a constructor
11690 for an anonymous type, even if the type
11691 got a name for linkage purposes. */
11692 !TYPE_WAS_ANONYMOUS (class_type
)
11693 && constructor_name_p (unqualified_name
,
11696 unqualified_name
= constructor_name (class_type
);
11697 sfk
= sfk_constructor
;
11700 if (ctor_dtor_or_conv_p
&& sfk
!= sfk_none
)
11701 *ctor_dtor_or_conv_p
= -1;
11704 declarator
= make_id_declarator (qualifying_scope
,
11707 declarator
->id_loc
= token
->location
;
11709 handle_declarator
:;
11710 scope
= get_scope_of_declarator (declarator
);
11712 /* Any names that appear after the declarator-id for a
11713 member are looked up in the containing scope. */
11714 pushed_scope
= push_scope (scope
);
11715 parser
->in_declarator_p
= true;
11716 if ((ctor_dtor_or_conv_p
&& *ctor_dtor_or_conv_p
)
11717 || (declarator
&& declarator
->kind
== cdk_id
))
11718 /* Default args are only allowed on function
11720 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
11722 parser
->default_arg_ok_p
= false;
11731 /* For an abstract declarator, we might wind up with nothing at this
11732 point. That's an error; the declarator is not optional. */
11734 cp_parser_error (parser
, "expected declarator");
11736 /* If we entered a scope, we must exit it now. */
11738 pop_scope (pushed_scope
);
11740 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
11741 parser
->in_declarator_p
= saved_in_declarator_p
;
11746 /* Parse a ptr-operator.
11749 * cv-qualifier-seq [opt]
11751 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
11756 & cv-qualifier-seq [opt]
11758 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
11759 Returns ADDR_EXPR if a reference was used. In the case of a
11760 pointer-to-member, *TYPE is filled in with the TYPE containing the
11761 member. *CV_QUALS is filled in with the cv-qualifier-seq, or
11762 TYPE_UNQUALIFIED, if there are no cv-qualifiers. Returns
11763 ERROR_MARK if an error occurred. */
11765 static enum tree_code
11766 cp_parser_ptr_operator (cp_parser
* parser
,
11768 cp_cv_quals
*cv_quals
)
11770 enum tree_code code
= ERROR_MARK
;
11773 /* Assume that it's not a pointer-to-member. */
11775 /* And that there are no cv-qualifiers. */
11776 *cv_quals
= TYPE_UNQUALIFIED
;
11778 /* Peek at the next token. */
11779 token
= cp_lexer_peek_token (parser
->lexer
);
11780 /* If it's a `*' or `&' we have a pointer or reference. */
11781 if (token
->type
== CPP_MULT
|| token
->type
== CPP_AND
)
11783 /* Remember which ptr-operator we were processing. */
11784 code
= (token
->type
== CPP_AND
? ADDR_EXPR
: INDIRECT_REF
);
11786 /* Consume the `*' or `&'. */
11787 cp_lexer_consume_token (parser
->lexer
);
11789 /* A `*' can be followed by a cv-qualifier-seq, and so can a
11790 `&', if we are allowing GNU extensions. (The only qualifier
11791 that can legally appear after `&' is `restrict', but that is
11792 enforced during semantic analysis. */
11793 if (code
== INDIRECT_REF
11794 || cp_parser_allow_gnu_extensions_p (parser
))
11795 *cv_quals
= cp_parser_cv_qualifier_seq_opt (parser
);
11799 /* Try the pointer-to-member case. */
11800 cp_parser_parse_tentatively (parser
);
11801 /* Look for the optional `::' operator. */
11802 cp_parser_global_scope_opt (parser
,
11803 /*current_scope_valid_p=*/false);
11804 /* Look for the nested-name specifier. */
11805 cp_parser_nested_name_specifier (parser
,
11806 /*typename_keyword_p=*/false,
11807 /*check_dependency_p=*/true,
11809 /*is_declaration=*/false);
11810 /* If we found it, and the next token is a `*', then we are
11811 indeed looking at a pointer-to-member operator. */
11812 if (!cp_parser_error_occurred (parser
)
11813 && cp_parser_require (parser
, CPP_MULT
, "`*'"))
11815 /* Indicate that the `*' operator was used. */
11816 code
= INDIRECT_REF
;
11818 if (TREE_CODE (parser
->scope
) == NAMESPACE_DECL
)
11819 error ("%qD is a namespace", parser
->scope
);
11822 /* The type of which the member is a member is given by the
11824 *type
= parser
->scope
;
11825 /* The next name will not be qualified. */
11826 parser
->scope
= NULL_TREE
;
11827 parser
->qualifying_scope
= NULL_TREE
;
11828 parser
->object_scope
= NULL_TREE
;
11829 /* Look for the optional cv-qualifier-seq. */
11830 *cv_quals
= cp_parser_cv_qualifier_seq_opt (parser
);
11833 /* If that didn't work we don't have a ptr-operator. */
11834 if (!cp_parser_parse_definitely (parser
))
11835 cp_parser_error (parser
, "expected ptr-operator");
11841 /* Parse an (optional) cv-qualifier-seq.
11844 cv-qualifier cv-qualifier-seq [opt]
11855 Returns a bitmask representing the cv-qualifiers. */
11858 cp_parser_cv_qualifier_seq_opt (cp_parser
* parser
)
11860 cp_cv_quals cv_quals
= TYPE_UNQUALIFIED
;
11865 cp_cv_quals cv_qualifier
;
11867 /* Peek at the next token. */
11868 token
= cp_lexer_peek_token (parser
->lexer
);
11869 /* See if it's a cv-qualifier. */
11870 switch (token
->keyword
)
11873 cv_qualifier
= TYPE_QUAL_CONST
;
11877 cv_qualifier
= TYPE_QUAL_VOLATILE
;
11881 cv_qualifier
= TYPE_QUAL_RESTRICT
;
11885 cv_qualifier
= TYPE_UNQUALIFIED
;
11892 if (cv_quals
& cv_qualifier
)
11894 error ("duplicate cv-qualifier");
11895 cp_lexer_purge_token (parser
->lexer
);
11899 cp_lexer_consume_token (parser
->lexer
);
11900 cv_quals
|= cv_qualifier
;
11907 /* Parse a declarator-id.
11911 :: [opt] nested-name-specifier [opt] type-name
11913 In the `id-expression' case, the value returned is as for
11914 cp_parser_id_expression if the id-expression was an unqualified-id.
11915 If the id-expression was a qualified-id, then a SCOPE_REF is
11916 returned. The first operand is the scope (either a NAMESPACE_DECL
11917 or TREE_TYPE), but the second is still just a representation of an
11921 cp_parser_declarator_id (cp_parser
* parser
, bool optional_p
)
11924 /* The expression must be an id-expression. Assume that qualified
11925 names are the names of types so that:
11928 int S<T>::R::i = 3;
11930 will work; we must treat `S<T>::R' as the name of a type.
11931 Similarly, assume that qualified names are templates, where
11935 int S<T>::R<T>::i = 3;
11938 id
= cp_parser_id_expression (parser
,
11939 /*template_keyword_p=*/false,
11940 /*check_dependency_p=*/false,
11941 /*template_p=*/NULL
,
11942 /*declarator_p=*/true,
11944 if (id
&& BASELINK_P (id
))
11945 id
= BASELINK_FUNCTIONS (id
);
11949 /* Parse a type-id.
11952 type-specifier-seq abstract-declarator [opt]
11954 Returns the TYPE specified. */
11957 cp_parser_type_id (cp_parser
* parser
)
11959 cp_decl_specifier_seq type_specifier_seq
;
11960 cp_declarator
*abstract_declarator
;
11962 /* Parse the type-specifier-seq. */
11963 cp_parser_type_specifier_seq (parser
, /*is_condition=*/false,
11964 &type_specifier_seq
);
11965 if (type_specifier_seq
.type
== error_mark_node
)
11966 return error_mark_node
;
11968 /* There might or might not be an abstract declarator. */
11969 cp_parser_parse_tentatively (parser
);
11970 /* Look for the declarator. */
11971 abstract_declarator
11972 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_ABSTRACT
, NULL
,
11973 /*parenthesized_p=*/NULL
,
11974 /*member_p=*/false);
11975 /* Check to see if there really was a declarator. */
11976 if (!cp_parser_parse_definitely (parser
))
11977 abstract_declarator
= NULL
;
11979 return groktypename (&type_specifier_seq
, abstract_declarator
);
11982 /* Parse a type-specifier-seq.
11984 type-specifier-seq:
11985 type-specifier type-specifier-seq [opt]
11989 type-specifier-seq:
11990 attributes type-specifier-seq [opt]
11992 If IS_CONDITION is true, we are at the start of a "condition",
11993 e.g., we've just seen "if (".
11995 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
11998 cp_parser_type_specifier_seq (cp_parser
* parser
,
12000 cp_decl_specifier_seq
*type_specifier_seq
)
12002 bool seen_type_specifier
= false;
12003 cp_parser_flags flags
= CP_PARSER_FLAGS_OPTIONAL
;
12005 /* Clear the TYPE_SPECIFIER_SEQ. */
12006 clear_decl_specs (type_specifier_seq
);
12008 /* Parse the type-specifiers and attributes. */
12011 tree type_specifier
;
12012 bool is_cv_qualifier
;
12014 /* Check for attributes first. */
12015 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ATTRIBUTE
))
12017 type_specifier_seq
->attributes
=
12018 chainon (type_specifier_seq
->attributes
,
12019 cp_parser_attributes_opt (parser
));
12023 /* Look for the type-specifier. */
12024 type_specifier
= cp_parser_type_specifier (parser
,
12026 type_specifier_seq
,
12027 /*is_declaration=*/false,
12030 if (!type_specifier
)
12032 /* If the first type-specifier could not be found, this is not a
12033 type-specifier-seq at all. */
12034 if (!seen_type_specifier
)
12036 cp_parser_error (parser
, "expected type-specifier");
12037 type_specifier_seq
->type
= error_mark_node
;
12040 /* If subsequent type-specifiers could not be found, the
12041 type-specifier-seq is complete. */
12045 seen_type_specifier
= true;
12046 /* The standard says that a condition can be:
12048 type-specifier-seq declarator = assignment-expression
12055 we should treat the "S" as a declarator, not as a
12056 type-specifier. The standard doesn't say that explicitly for
12057 type-specifier-seq, but it does say that for
12058 decl-specifier-seq in an ordinary declaration. Perhaps it
12059 would be clearer just to allow a decl-specifier-seq here, and
12060 then add a semantic restriction that if any decl-specifiers
12061 that are not type-specifiers appear, the program is invalid. */
12062 if (is_condition
&& !is_cv_qualifier
)
12063 flags
|= CP_PARSER_FLAGS_NO_USER_DEFINED_TYPES
;
12066 cp_parser_check_decl_spec (type_specifier_seq
);
12069 /* Parse a parameter-declaration-clause.
12071 parameter-declaration-clause:
12072 parameter-declaration-list [opt] ... [opt]
12073 parameter-declaration-list , ...
12075 Returns a representation for the parameter declarations. A return
12076 value of NULL indicates a parameter-declaration-clause consisting
12077 only of an ellipsis. */
12079 static cp_parameter_declarator
*
12080 cp_parser_parameter_declaration_clause (cp_parser
* parser
)
12082 cp_parameter_declarator
*parameters
;
12087 /* Peek at the next token. */
12088 token
= cp_lexer_peek_token (parser
->lexer
);
12089 /* Check for trivial parameter-declaration-clauses. */
12090 if (token
->type
== CPP_ELLIPSIS
)
12092 /* Consume the `...' token. */
12093 cp_lexer_consume_token (parser
->lexer
);
12096 else if (token
->type
== CPP_CLOSE_PAREN
)
12097 /* There are no parameters. */
12099 #ifndef NO_IMPLICIT_EXTERN_C
12100 if (in_system_header
&& current_class_type
== NULL
12101 && current_lang_name
== lang_name_c
)
12105 return no_parameters
;
12107 /* Check for `(void)', too, which is a special case. */
12108 else if (token
->keyword
== RID_VOID
12109 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
12110 == CPP_CLOSE_PAREN
))
12112 /* Consume the `void' token. */
12113 cp_lexer_consume_token (parser
->lexer
);
12114 /* There are no parameters. */
12115 return no_parameters
;
12118 /* Parse the parameter-declaration-list. */
12119 parameters
= cp_parser_parameter_declaration_list (parser
, &is_error
);
12120 /* If a parse error occurred while parsing the
12121 parameter-declaration-list, then the entire
12122 parameter-declaration-clause is erroneous. */
12126 /* Peek at the next token. */
12127 token
= cp_lexer_peek_token (parser
->lexer
);
12128 /* If it's a `,', the clause should terminate with an ellipsis. */
12129 if (token
->type
== CPP_COMMA
)
12131 /* Consume the `,'. */
12132 cp_lexer_consume_token (parser
->lexer
);
12133 /* Expect an ellipsis. */
12135 = (cp_parser_require (parser
, CPP_ELLIPSIS
, "`...'") != NULL
);
12137 /* It might also be `...' if the optional trailing `,' was
12139 else if (token
->type
== CPP_ELLIPSIS
)
12141 /* Consume the `...' token. */
12142 cp_lexer_consume_token (parser
->lexer
);
12143 /* And remember that we saw it. */
12147 ellipsis_p
= false;
12149 /* Finish the parameter list. */
12150 if (parameters
&& ellipsis_p
)
12151 parameters
->ellipsis_p
= true;
12156 /* Parse a parameter-declaration-list.
12158 parameter-declaration-list:
12159 parameter-declaration
12160 parameter-declaration-list , parameter-declaration
12162 Returns a representation of the parameter-declaration-list, as for
12163 cp_parser_parameter_declaration_clause. However, the
12164 `void_list_node' is never appended to the list. Upon return,
12165 *IS_ERROR will be true iff an error occurred. */
12167 static cp_parameter_declarator
*
12168 cp_parser_parameter_declaration_list (cp_parser
* parser
, bool *is_error
)
12170 cp_parameter_declarator
*parameters
= NULL
;
12171 cp_parameter_declarator
**tail
= ¶meters
;
12172 bool saved_in_unbraced_linkage_specification_p
;
12174 /* Assume all will go well. */
12176 /* The special considerations that apply to a function within an
12177 unbraced linkage specifications do not apply to the parameters
12178 to the function. */
12179 saved_in_unbraced_linkage_specification_p
12180 = parser
->in_unbraced_linkage_specification_p
;
12181 parser
->in_unbraced_linkage_specification_p
= false;
12183 /* Look for more parameters. */
12186 cp_parameter_declarator
*parameter
;
12187 bool parenthesized_p
;
12188 /* Parse the parameter. */
12190 = cp_parser_parameter_declaration (parser
,
12191 /*template_parm_p=*/false,
12194 /* If a parse error occurred parsing the parameter declaration,
12195 then the entire parameter-declaration-list is erroneous. */
12202 /* Add the new parameter to the list. */
12204 tail
= ¶meter
->next
;
12206 /* Peek at the next token. */
12207 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
)
12208 || cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
)
12209 /* These are for Objective-C++ */
12210 || cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
12211 || cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
12212 /* The parameter-declaration-list is complete. */
12214 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
12218 /* Peek at the next token. */
12219 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
12220 /* If it's an ellipsis, then the list is complete. */
12221 if (token
->type
== CPP_ELLIPSIS
)
12223 /* Otherwise, there must be more parameters. Consume the
12225 cp_lexer_consume_token (parser
->lexer
);
12226 /* When parsing something like:
12228 int i(float f, double d)
12230 we can tell after seeing the declaration for "f" that we
12231 are not looking at an initialization of a variable "i",
12232 but rather at the declaration of a function "i".
12234 Due to the fact that the parsing of template arguments
12235 (as specified to a template-id) requires backtracking we
12236 cannot use this technique when inside a template argument
12238 if (!parser
->in_template_argument_list_p
12239 && !parser
->in_type_id_in_expr_p
12240 && cp_parser_uncommitted_to_tentative_parse_p (parser
)
12241 /* However, a parameter-declaration of the form
12242 "foat(f)" (which is a valid declaration of a
12243 parameter "f") can also be interpreted as an
12244 expression (the conversion of "f" to "float"). */
12245 && !parenthesized_p
)
12246 cp_parser_commit_to_tentative_parse (parser
);
12250 cp_parser_error (parser
, "expected %<,%> or %<...%>");
12251 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
12252 cp_parser_skip_to_closing_parenthesis (parser
,
12253 /*recovering=*/true,
12254 /*or_comma=*/false,
12255 /*consume_paren=*/false);
12260 parser
->in_unbraced_linkage_specification_p
12261 = saved_in_unbraced_linkage_specification_p
;
12266 /* Parse a parameter declaration.
12268 parameter-declaration:
12269 decl-specifier-seq declarator
12270 decl-specifier-seq declarator = assignment-expression
12271 decl-specifier-seq abstract-declarator [opt]
12272 decl-specifier-seq abstract-declarator [opt] = assignment-expression
12274 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
12275 declares a template parameter. (In that case, a non-nested `>'
12276 token encountered during the parsing of the assignment-expression
12277 is not interpreted as a greater-than operator.)
12279 Returns a representation of the parameter, or NULL if an error
12280 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
12281 true iff the declarator is of the form "(p)". */
12283 static cp_parameter_declarator
*
12284 cp_parser_parameter_declaration (cp_parser
*parser
,
12285 bool template_parm_p
,
12286 bool *parenthesized_p
)
12288 int declares_class_or_enum
;
12289 bool greater_than_is_operator_p
;
12290 cp_decl_specifier_seq decl_specifiers
;
12291 cp_declarator
*declarator
;
12292 tree default_argument
;
12294 const char *saved_message
;
12296 /* In a template parameter, `>' is not an operator.
12300 When parsing a default template-argument for a non-type
12301 template-parameter, the first non-nested `>' is taken as the end
12302 of the template parameter-list rather than a greater-than
12304 greater_than_is_operator_p
= !template_parm_p
;
12306 /* Type definitions may not appear in parameter types. */
12307 saved_message
= parser
->type_definition_forbidden_message
;
12308 parser
->type_definition_forbidden_message
12309 = "types may not be defined in parameter types";
12311 /* Parse the declaration-specifiers. */
12312 cp_parser_decl_specifier_seq (parser
,
12313 CP_PARSER_FLAGS_NONE
,
12315 &declares_class_or_enum
);
12316 /* If an error occurred, there's no reason to attempt to parse the
12317 rest of the declaration. */
12318 if (cp_parser_error_occurred (parser
))
12320 parser
->type_definition_forbidden_message
= saved_message
;
12324 /* Peek at the next token. */
12325 token
= cp_lexer_peek_token (parser
->lexer
);
12326 /* If the next token is a `)', `,', `=', `>', or `...', then there
12327 is no declarator. */
12328 if (token
->type
== CPP_CLOSE_PAREN
12329 || token
->type
== CPP_COMMA
12330 || token
->type
== CPP_EQ
12331 || token
->type
== CPP_ELLIPSIS
12332 || token
->type
== CPP_GREATER
)
12335 if (parenthesized_p
)
12336 *parenthesized_p
= false;
12338 /* Otherwise, there should be a declarator. */
12341 bool saved_default_arg_ok_p
= parser
->default_arg_ok_p
;
12342 parser
->default_arg_ok_p
= false;
12344 /* After seeing a decl-specifier-seq, if the next token is not a
12345 "(", there is no possibility that the code is a valid
12346 expression. Therefore, if parsing tentatively, we commit at
12348 if (!parser
->in_template_argument_list_p
12349 /* In an expression context, having seen:
12353 we cannot be sure whether we are looking at a
12354 function-type (taking a "char" as a parameter) or a cast
12355 of some object of type "char" to "int". */
12356 && !parser
->in_type_id_in_expr_p
12357 && cp_parser_uncommitted_to_tentative_parse_p (parser
)
12358 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_PAREN
))
12359 cp_parser_commit_to_tentative_parse (parser
);
12360 /* Parse the declarator. */
12361 declarator
= cp_parser_declarator (parser
,
12362 CP_PARSER_DECLARATOR_EITHER
,
12363 /*ctor_dtor_or_conv_p=*/NULL
,
12365 /*member_p=*/false);
12366 parser
->default_arg_ok_p
= saved_default_arg_ok_p
;
12367 /* After the declarator, allow more attributes. */
12368 decl_specifiers
.attributes
12369 = chainon (decl_specifiers
.attributes
,
12370 cp_parser_attributes_opt (parser
));
12373 /* The restriction on defining new types applies only to the type
12374 of the parameter, not to the default argument. */
12375 parser
->type_definition_forbidden_message
= saved_message
;
12377 /* If the next token is `=', then process a default argument. */
12378 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
12380 bool saved_greater_than_is_operator_p
;
12381 /* Consume the `='. */
12382 cp_lexer_consume_token (parser
->lexer
);
12384 /* If we are defining a class, then the tokens that make up the
12385 default argument must be saved and processed later. */
12386 if (!template_parm_p
&& at_class_scope_p ()
12387 && TYPE_BEING_DEFINED (current_class_type
))
12389 unsigned depth
= 0;
12390 cp_token
*first_token
;
12393 /* Add tokens until we have processed the entire default
12394 argument. We add the range [first_token, token). */
12395 first_token
= cp_lexer_peek_token (parser
->lexer
);
12400 /* Peek at the next token. */
12401 token
= cp_lexer_peek_token (parser
->lexer
);
12402 /* What we do depends on what token we have. */
12403 switch (token
->type
)
12405 /* In valid code, a default argument must be
12406 immediately followed by a `,' `)', or `...'. */
12408 case CPP_CLOSE_PAREN
:
12410 /* If we run into a non-nested `;', `}', or `]',
12411 then the code is invalid -- but the default
12412 argument is certainly over. */
12413 case CPP_SEMICOLON
:
12414 case CPP_CLOSE_BRACE
:
12415 case CPP_CLOSE_SQUARE
:
12418 /* Update DEPTH, if necessary. */
12419 else if (token
->type
== CPP_CLOSE_PAREN
12420 || token
->type
== CPP_CLOSE_BRACE
12421 || token
->type
== CPP_CLOSE_SQUARE
)
12425 case CPP_OPEN_PAREN
:
12426 case CPP_OPEN_SQUARE
:
12427 case CPP_OPEN_BRACE
:
12432 /* If we see a non-nested `>', and `>' is not an
12433 operator, then it marks the end of the default
12435 if (!depth
&& !greater_than_is_operator_p
)
12439 /* If we run out of tokens, issue an error message. */
12441 case CPP_PRAGMA_EOL
:
12442 error ("file ends in default argument");
12448 /* In these cases, we should look for template-ids.
12449 For example, if the default argument is
12450 `X<int, double>()', we need to do name lookup to
12451 figure out whether or not `X' is a template; if
12452 so, the `,' does not end the default argument.
12454 That is not yet done. */
12461 /* If we've reached the end, stop. */
12465 /* Add the token to the token block. */
12466 token
= cp_lexer_consume_token (parser
->lexer
);
12469 /* Create a DEFAULT_ARG to represented the unparsed default
12471 default_argument
= make_node (DEFAULT_ARG
);
12472 DEFARG_TOKENS (default_argument
)
12473 = cp_token_cache_new (first_token
, token
);
12474 DEFARG_INSTANTIATIONS (default_argument
) = NULL
;
12476 /* Outside of a class definition, we can just parse the
12477 assignment-expression. */
12480 bool saved_local_variables_forbidden_p
;
12482 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
12484 saved_greater_than_is_operator_p
12485 = parser
->greater_than_is_operator_p
;
12486 parser
->greater_than_is_operator_p
= greater_than_is_operator_p
;
12487 /* Local variable names (and the `this' keyword) may not
12488 appear in a default argument. */
12489 saved_local_variables_forbidden_p
12490 = parser
->local_variables_forbidden_p
;
12491 parser
->local_variables_forbidden_p
= true;
12492 /* The default argument expression may cause implicitly
12493 defined member functions to be synthesized, which will
12494 result in garbage collection. We must treat this
12495 situation as if we were within the body of function so as
12496 to avoid collecting live data on the stack. */
12498 /* Parse the assignment-expression. */
12499 if (template_parm_p
)
12500 push_deferring_access_checks (dk_no_deferred
);
12502 = cp_parser_assignment_expression (parser
, /*cast_p=*/false);
12503 if (template_parm_p
)
12504 pop_deferring_access_checks ();
12505 /* Restore saved state. */
12507 parser
->greater_than_is_operator_p
12508 = saved_greater_than_is_operator_p
;
12509 parser
->local_variables_forbidden_p
12510 = saved_local_variables_forbidden_p
;
12512 if (!parser
->default_arg_ok_p
)
12514 if (!flag_pedantic_errors
)
12515 warning (0, "deprecated use of default argument for parameter of non-function");
12518 error ("default arguments are only permitted for function parameters");
12519 default_argument
= NULL_TREE
;
12524 default_argument
= NULL_TREE
;
12526 return make_parameter_declarator (&decl_specifiers
,
12531 /* Parse a function-body.
12534 compound_statement */
12537 cp_parser_function_body (cp_parser
*parser
)
12539 cp_parser_compound_statement (parser
, NULL
, false);
12542 /* Parse a ctor-initializer-opt followed by a function-body. Return
12543 true if a ctor-initializer was present. */
12546 cp_parser_ctor_initializer_opt_and_function_body (cp_parser
*parser
)
12549 bool ctor_initializer_p
;
12551 /* Begin the function body. */
12552 body
= begin_function_body ();
12553 /* Parse the optional ctor-initializer. */
12554 ctor_initializer_p
= cp_parser_ctor_initializer_opt (parser
);
12555 /* Parse the function-body. */
12556 cp_parser_function_body (parser
);
12557 /* Finish the function body. */
12558 finish_function_body (body
);
12560 return ctor_initializer_p
;
12563 /* Parse an initializer.
12566 = initializer-clause
12567 ( expression-list )
12569 Returns an expression representing the initializer. If no
12570 initializer is present, NULL_TREE is returned.
12572 *IS_PARENTHESIZED_INIT is set to TRUE if the `( expression-list )'
12573 production is used, and zero otherwise. *IS_PARENTHESIZED_INIT is
12574 set to FALSE if there is no initializer present. If there is an
12575 initializer, and it is not a constant-expression, *NON_CONSTANT_P
12576 is set to true; otherwise it is set to false. */
12579 cp_parser_initializer (cp_parser
* parser
, bool* is_parenthesized_init
,
12580 bool* non_constant_p
)
12585 /* Peek at the next token. */
12586 token
= cp_lexer_peek_token (parser
->lexer
);
12588 /* Let our caller know whether or not this initializer was
12590 *is_parenthesized_init
= (token
->type
== CPP_OPEN_PAREN
);
12591 /* Assume that the initializer is constant. */
12592 *non_constant_p
= false;
12594 if (token
->type
== CPP_EQ
)
12596 /* Consume the `='. */
12597 cp_lexer_consume_token (parser
->lexer
);
12598 /* Parse the initializer-clause. */
12599 init
= cp_parser_initializer_clause (parser
, non_constant_p
);
12601 else if (token
->type
== CPP_OPEN_PAREN
)
12602 init
= cp_parser_parenthesized_expression_list (parser
, false,
12607 /* Anything else is an error. */
12608 cp_parser_error (parser
, "expected initializer");
12609 init
= error_mark_node
;
12615 /* Parse an initializer-clause.
12617 initializer-clause:
12618 assignment-expression
12619 { initializer-list , [opt] }
12622 Returns an expression representing the initializer.
12624 If the `assignment-expression' production is used the value
12625 returned is simply a representation for the expression.
12627 Otherwise, a CONSTRUCTOR is returned. The CONSTRUCTOR_ELTS will be
12628 the elements of the initializer-list (or NULL, if the last
12629 production is used). The TREE_TYPE for the CONSTRUCTOR will be
12630 NULL_TREE. There is no way to detect whether or not the optional
12631 trailing `,' was provided. NON_CONSTANT_P is as for
12632 cp_parser_initializer. */
12635 cp_parser_initializer_clause (cp_parser
* parser
, bool* non_constant_p
)
12639 /* Assume the expression is constant. */
12640 *non_constant_p
= false;
12642 /* If it is not a `{', then we are looking at an
12643 assignment-expression. */
12644 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_OPEN_BRACE
))
12647 = cp_parser_constant_expression (parser
,
12648 /*allow_non_constant_p=*/true,
12650 if (!*non_constant_p
)
12651 initializer
= fold_non_dependent_expr (initializer
);
12655 /* Consume the `{' token. */
12656 cp_lexer_consume_token (parser
->lexer
);
12657 /* Create a CONSTRUCTOR to represent the braced-initializer. */
12658 initializer
= make_node (CONSTRUCTOR
);
12659 /* If it's not a `}', then there is a non-trivial initializer. */
12660 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_BRACE
))
12662 /* Parse the initializer list. */
12663 CONSTRUCTOR_ELTS (initializer
)
12664 = cp_parser_initializer_list (parser
, non_constant_p
);
12665 /* A trailing `,' token is allowed. */
12666 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
12667 cp_lexer_consume_token (parser
->lexer
);
12669 /* Now, there should be a trailing `}'. */
12670 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "`}'");
12673 return initializer
;
12676 /* Parse an initializer-list.
12680 initializer-list , initializer-clause
12685 identifier : initializer-clause
12686 initializer-list, identifier : initializer-clause
12688 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
12689 for the initializer. If the INDEX of the elt is non-NULL, it is the
12690 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
12691 as for cp_parser_initializer. */
12693 static VEC(constructor_elt
,gc
) *
12694 cp_parser_initializer_list (cp_parser
* parser
, bool* non_constant_p
)
12696 VEC(constructor_elt
,gc
) *v
= NULL
;
12698 /* Assume all of the expressions are constant. */
12699 *non_constant_p
= false;
12701 /* Parse the rest of the list. */
12707 bool clause_non_constant_p
;
12709 /* If the next token is an identifier and the following one is a
12710 colon, we are looking at the GNU designated-initializer
12712 if (cp_parser_allow_gnu_extensions_p (parser
)
12713 && cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
)
12714 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_COLON
)
12716 /* Consume the identifier. */
12717 identifier
= cp_lexer_consume_token (parser
->lexer
)->value
;
12718 /* Consume the `:'. */
12719 cp_lexer_consume_token (parser
->lexer
);
12722 identifier
= NULL_TREE
;
12724 /* Parse the initializer. */
12725 initializer
= cp_parser_initializer_clause (parser
,
12726 &clause_non_constant_p
);
12727 /* If any clause is non-constant, so is the entire initializer. */
12728 if (clause_non_constant_p
)
12729 *non_constant_p
= true;
12731 /* Add it to the vector. */
12732 CONSTRUCTOR_APPEND_ELT(v
, identifier
, initializer
);
12734 /* If the next token is not a comma, we have reached the end of
12736 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
12739 /* Peek at the next token. */
12740 token
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
12741 /* If the next token is a `}', then we're still done. An
12742 initializer-clause can have a trailing `,' after the
12743 initializer-list and before the closing `}'. */
12744 if (token
->type
== CPP_CLOSE_BRACE
)
12747 /* Consume the `,' token. */
12748 cp_lexer_consume_token (parser
->lexer
);
12754 /* Classes [gram.class] */
12756 /* Parse a class-name.
12762 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
12763 to indicate that names looked up in dependent types should be
12764 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
12765 keyword has been used to indicate that the name that appears next
12766 is a template. TAG_TYPE indicates the explicit tag given before
12767 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
12768 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
12769 is the class being defined in a class-head.
12771 Returns the TYPE_DECL representing the class. */
12774 cp_parser_class_name (cp_parser
*parser
,
12775 bool typename_keyword_p
,
12776 bool template_keyword_p
,
12777 enum tag_types tag_type
,
12778 bool check_dependency_p
,
12780 bool is_declaration
)
12787 /* All class-names start with an identifier. */
12788 token
= cp_lexer_peek_token (parser
->lexer
);
12789 if (token
->type
!= CPP_NAME
&& token
->type
!= CPP_TEMPLATE_ID
)
12791 cp_parser_error (parser
, "expected class-name");
12792 return error_mark_node
;
12795 /* PARSER->SCOPE can be cleared when parsing the template-arguments
12796 to a template-id, so we save it here. */
12797 scope
= parser
->scope
;
12798 if (scope
== error_mark_node
)
12799 return error_mark_node
;
12801 /* Any name names a type if we're following the `typename' keyword
12802 in a qualified name where the enclosing scope is type-dependent. */
12803 typename_p
= (typename_keyword_p
&& scope
&& TYPE_P (scope
)
12804 && dependent_type_p (scope
));
12805 /* Handle the common case (an identifier, but not a template-id)
12807 if (token
->type
== CPP_NAME
12808 && !cp_parser_nth_token_starts_template_argument_list_p (parser
, 2))
12810 cp_token
*identifier_token
;
12814 /* Look for the identifier. */
12815 identifier_token
= cp_lexer_peek_token (parser
->lexer
);
12816 ambiguous_p
= identifier_token
->ambiguous_p
;
12817 identifier
= cp_parser_identifier (parser
);
12818 /* If the next token isn't an identifier, we are certainly not
12819 looking at a class-name. */
12820 if (identifier
== error_mark_node
)
12821 decl
= error_mark_node
;
12822 /* If we know this is a type-name, there's no need to look it
12824 else if (typename_p
)
12828 tree ambiguous_decls
;
12829 /* If we already know that this lookup is ambiguous, then
12830 we've already issued an error message; there's no reason
12834 cp_parser_simulate_error (parser
);
12835 return error_mark_node
;
12837 /* If the next token is a `::', then the name must be a type
12840 [basic.lookup.qual]
12842 During the lookup for a name preceding the :: scope
12843 resolution operator, object, function, and enumerator
12844 names are ignored. */
12845 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
12846 tag_type
= typename_type
;
12847 /* Look up the name. */
12848 decl
= cp_parser_lookup_name (parser
, identifier
,
12850 /*is_template=*/false,
12851 /*is_namespace=*/false,
12852 check_dependency_p
,
12854 if (ambiguous_decls
)
12856 error ("reference to %qD is ambiguous", identifier
);
12857 print_candidates (ambiguous_decls
);
12858 if (cp_parser_parsing_tentatively (parser
))
12860 identifier_token
->ambiguous_p
= true;
12861 cp_parser_simulate_error (parser
);
12863 return error_mark_node
;
12869 /* Try a template-id. */
12870 decl
= cp_parser_template_id (parser
, template_keyword_p
,
12871 check_dependency_p
,
12873 if (decl
== error_mark_node
)
12874 return error_mark_node
;
12877 decl
= cp_parser_maybe_treat_template_as_class (decl
, class_head_p
);
12879 /* If this is a typename, create a TYPENAME_TYPE. */
12880 if (typename_p
&& decl
!= error_mark_node
)
12882 decl
= make_typename_type (scope
, decl
, typename_type
,
12883 /*complain=*/tf_error
);
12884 if (decl
!= error_mark_node
)
12885 decl
= TYPE_NAME (decl
);
12888 /* Check to see that it is really the name of a class. */
12889 if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
12890 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
12891 && cp_lexer_next_token_is (parser
->lexer
, CPP_SCOPE
))
12892 /* Situations like this:
12894 template <typename T> struct A {
12895 typename T::template X<int>::I i;
12898 are problematic. Is `T::template X<int>' a class-name? The
12899 standard does not seem to be definitive, but there is no other
12900 valid interpretation of the following `::'. Therefore, those
12901 names are considered class-names. */
12903 decl
= make_typename_type (scope
, decl
, tag_type
, tf_error
);
12904 if (decl
!= error_mark_node
)
12905 decl
= TYPE_NAME (decl
);
12907 else if (TREE_CODE (decl
) != TYPE_DECL
12908 || TREE_TYPE (decl
) == error_mark_node
12909 || !IS_AGGR_TYPE (TREE_TYPE (decl
)))
12910 decl
= error_mark_node
;
12912 if (decl
== error_mark_node
)
12913 cp_parser_error (parser
, "expected class-name");
12918 /* Parse a class-specifier.
12921 class-head { member-specification [opt] }
12923 Returns the TREE_TYPE representing the class. */
12926 cp_parser_class_specifier (cp_parser
* parser
)
12930 tree attributes
= NULL_TREE
;
12931 int has_trailing_semicolon
;
12932 bool nested_name_specifier_p
;
12933 unsigned saved_num_template_parameter_lists
;
12934 tree old_scope
= NULL_TREE
;
12935 tree scope
= NULL_TREE
;
12937 push_deferring_access_checks (dk_no_deferred
);
12939 /* Parse the class-head. */
12940 type
= cp_parser_class_head (parser
,
12941 &nested_name_specifier_p
,
12943 /* If the class-head was a semantic disaster, skip the entire body
12947 cp_parser_skip_to_end_of_block_or_statement (parser
);
12948 pop_deferring_access_checks ();
12949 return error_mark_node
;
12952 /* Look for the `{'. */
12953 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, "`{'"))
12955 pop_deferring_access_checks ();
12956 return error_mark_node
;
12959 /* Issue an error message if type-definitions are forbidden here. */
12960 cp_parser_check_type_definition (parser
);
12961 /* Remember that we are defining one more class. */
12962 ++parser
->num_classes_being_defined
;
12963 /* Inside the class, surrounding template-parameter-lists do not
12965 saved_num_template_parameter_lists
12966 = parser
->num_template_parameter_lists
;
12967 parser
->num_template_parameter_lists
= 0;
12969 /* Start the class. */
12970 if (nested_name_specifier_p
)
12972 scope
= CP_DECL_CONTEXT (TYPE_MAIN_DECL (type
));
12973 old_scope
= push_inner_scope (scope
);
12975 type
= begin_class_definition (type
, attributes
);
12977 if (type
== error_mark_node
)
12978 /* If the type is erroneous, skip the entire body of the class. */
12979 cp_parser_skip_to_closing_brace (parser
);
12981 /* Parse the member-specification. */
12982 cp_parser_member_specification_opt (parser
);
12984 /* Look for the trailing `}'. */
12985 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "`}'");
12986 /* We get better error messages by noticing a common problem: a
12987 missing trailing `;'. */
12988 token
= cp_lexer_peek_token (parser
->lexer
);
12989 has_trailing_semicolon
= (token
->type
== CPP_SEMICOLON
);
12990 /* Look for trailing attributes to apply to this class. */
12991 if (cp_parser_allow_gnu_extensions_p (parser
))
12992 attributes
= cp_parser_attributes_opt (parser
);
12993 if (type
!= error_mark_node
)
12994 type
= finish_struct (type
, attributes
);
12995 if (nested_name_specifier_p
)
12996 pop_inner_scope (old_scope
, scope
);
12997 /* If this class is not itself within the scope of another class,
12998 then we need to parse the bodies of all of the queued function
12999 definitions. Note that the queued functions defined in a class
13000 are not always processed immediately following the
13001 class-specifier for that class. Consider:
13004 struct B { void f() { sizeof (A); } };
13007 If `f' were processed before the processing of `A' were
13008 completed, there would be no way to compute the size of `A'.
13009 Note that the nesting we are interested in here is lexical --
13010 not the semantic nesting given by TYPE_CONTEXT. In particular,
13013 struct A { struct B; };
13014 struct A::B { void f() { } };
13016 there is no need to delay the parsing of `A::B::f'. */
13017 if (--parser
->num_classes_being_defined
== 0)
13021 tree class_type
= NULL_TREE
;
13022 tree pushed_scope
= NULL_TREE
;
13024 /* In a first pass, parse default arguments to the functions.
13025 Then, in a second pass, parse the bodies of the functions.
13026 This two-phased approach handles cases like:
13034 for (TREE_PURPOSE (parser
->unparsed_functions_queues
)
13035 = nreverse (TREE_PURPOSE (parser
->unparsed_functions_queues
));
13036 (queue_entry
= TREE_PURPOSE (parser
->unparsed_functions_queues
));
13037 TREE_PURPOSE (parser
->unparsed_functions_queues
)
13038 = TREE_CHAIN (TREE_PURPOSE (parser
->unparsed_functions_queues
)))
13040 fn
= TREE_VALUE (queue_entry
);
13041 /* If there are default arguments that have not yet been processed,
13042 take care of them now. */
13043 if (class_type
!= TREE_PURPOSE (queue_entry
))
13046 pop_scope (pushed_scope
);
13047 class_type
= TREE_PURPOSE (queue_entry
);
13048 pushed_scope
= push_scope (class_type
);
13050 /* Make sure that any template parameters are in scope. */
13051 maybe_begin_member_template_processing (fn
);
13052 /* Parse the default argument expressions. */
13053 cp_parser_late_parsing_default_args (parser
, fn
);
13054 /* Remove any template parameters from the symbol table. */
13055 maybe_end_member_template_processing ();
13058 pop_scope (pushed_scope
);
13059 /* Now parse the body of the functions. */
13060 for (TREE_VALUE (parser
->unparsed_functions_queues
)
13061 = nreverse (TREE_VALUE (parser
->unparsed_functions_queues
));
13062 (queue_entry
= TREE_VALUE (parser
->unparsed_functions_queues
));
13063 TREE_VALUE (parser
->unparsed_functions_queues
)
13064 = TREE_CHAIN (TREE_VALUE (parser
->unparsed_functions_queues
)))
13066 /* Figure out which function we need to process. */
13067 fn
= TREE_VALUE (queue_entry
);
13068 /* Parse the function. */
13069 cp_parser_late_parsing_for_member (parser
, fn
);
13073 /* Put back any saved access checks. */
13074 pop_deferring_access_checks ();
13076 /* Restore the count of active template-parameter-lists. */
13077 parser
->num_template_parameter_lists
13078 = saved_num_template_parameter_lists
;
13083 /* Parse a class-head.
13086 class-key identifier [opt] base-clause [opt]
13087 class-key nested-name-specifier identifier base-clause [opt]
13088 class-key nested-name-specifier [opt] template-id
13092 class-key attributes identifier [opt] base-clause [opt]
13093 class-key attributes nested-name-specifier identifier base-clause [opt]
13094 class-key attributes nested-name-specifier [opt] template-id
13097 Returns the TYPE of the indicated class. Sets
13098 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
13099 involving a nested-name-specifier was used, and FALSE otherwise.
13101 Returns error_mark_node if this is not a class-head.
13103 Returns NULL_TREE if the class-head is syntactically valid, but
13104 semantically invalid in a way that means we should skip the entire
13105 body of the class. */
13108 cp_parser_class_head (cp_parser
* parser
,
13109 bool* nested_name_specifier_p
,
13110 tree
*attributes_p
)
13112 tree nested_name_specifier
;
13113 enum tag_types class_key
;
13114 tree id
= NULL_TREE
;
13115 tree type
= NULL_TREE
;
13117 bool template_id_p
= false;
13118 bool qualified_p
= false;
13119 bool invalid_nested_name_p
= false;
13120 bool invalid_explicit_specialization_p
= false;
13121 tree pushed_scope
= NULL_TREE
;
13122 unsigned num_templates
;
13125 /* Assume no nested-name-specifier will be present. */
13126 *nested_name_specifier_p
= false;
13127 /* Assume no template parameter lists will be used in defining the
13131 /* Look for the class-key. */
13132 class_key
= cp_parser_class_key (parser
);
13133 if (class_key
== none_type
)
13134 return error_mark_node
;
13136 /* Parse the attributes. */
13137 attributes
= cp_parser_attributes_opt (parser
);
13139 /* If the next token is `::', that is invalid -- but sometimes
13140 people do try to write:
13144 Handle this gracefully by accepting the extra qualifier, and then
13145 issuing an error about it later if this really is a
13146 class-head. If it turns out just to be an elaborated type
13147 specifier, remain silent. */
13148 if (cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false))
13149 qualified_p
= true;
13151 push_deferring_access_checks (dk_no_check
);
13153 /* Determine the name of the class. Begin by looking for an
13154 optional nested-name-specifier. */
13155 nested_name_specifier
13156 = cp_parser_nested_name_specifier_opt (parser
,
13157 /*typename_keyword_p=*/false,
13158 /*check_dependency_p=*/false,
13160 /*is_declaration=*/false);
13161 /* If there was a nested-name-specifier, then there *must* be an
13163 if (nested_name_specifier
)
13165 /* Although the grammar says `identifier', it really means
13166 `class-name' or `template-name'. You are only allowed to
13167 define a class that has already been declared with this
13170 The proposed resolution for Core Issue 180 says that wherever
13171 you see `class T::X' you should treat `X' as a type-name.
13173 It is OK to define an inaccessible class; for example:
13175 class A { class B; };
13178 We do not know if we will see a class-name, or a
13179 template-name. We look for a class-name first, in case the
13180 class-name is a template-id; if we looked for the
13181 template-name first we would stop after the template-name. */
13182 cp_parser_parse_tentatively (parser
);
13183 type
= cp_parser_class_name (parser
,
13184 /*typename_keyword_p=*/false,
13185 /*template_keyword_p=*/false,
13187 /*check_dependency_p=*/false,
13188 /*class_head_p=*/true,
13189 /*is_declaration=*/false);
13190 /* If that didn't work, ignore the nested-name-specifier. */
13191 if (!cp_parser_parse_definitely (parser
))
13193 invalid_nested_name_p
= true;
13194 id
= cp_parser_identifier (parser
);
13195 if (id
== error_mark_node
)
13198 /* If we could not find a corresponding TYPE, treat this
13199 declaration like an unqualified declaration. */
13200 if (type
== error_mark_node
)
13201 nested_name_specifier
= NULL_TREE
;
13202 /* Otherwise, count the number of templates used in TYPE and its
13203 containing scopes. */
13208 for (scope
= TREE_TYPE (type
);
13209 scope
&& TREE_CODE (scope
) != NAMESPACE_DECL
;
13210 scope
= (TYPE_P (scope
)
13211 ? TYPE_CONTEXT (scope
)
13212 : DECL_CONTEXT (scope
)))
13214 && CLASS_TYPE_P (scope
)
13215 && CLASSTYPE_TEMPLATE_INFO (scope
)
13216 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope
))
13217 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (scope
))
13221 /* Otherwise, the identifier is optional. */
13224 /* We don't know whether what comes next is a template-id,
13225 an identifier, or nothing at all. */
13226 cp_parser_parse_tentatively (parser
);
13227 /* Check for a template-id. */
13228 id
= cp_parser_template_id (parser
,
13229 /*template_keyword_p=*/false,
13230 /*check_dependency_p=*/true,
13231 /*is_declaration=*/true);
13232 /* If that didn't work, it could still be an identifier. */
13233 if (!cp_parser_parse_definitely (parser
))
13235 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
13236 id
= cp_parser_identifier (parser
);
13242 template_id_p
= true;
13247 pop_deferring_access_checks ();
13250 cp_parser_check_for_invalid_template_id (parser
, id
);
13252 /* If it's not a `:' or a `{' then we can't really be looking at a
13253 class-head, since a class-head only appears as part of a
13254 class-specifier. We have to detect this situation before calling
13255 xref_tag, since that has irreversible side-effects. */
13256 if (!cp_parser_next_token_starts_class_definition_p (parser
))
13258 cp_parser_error (parser
, "expected %<{%> or %<:%>");
13259 return error_mark_node
;
13262 /* At this point, we're going ahead with the class-specifier, even
13263 if some other problem occurs. */
13264 cp_parser_commit_to_tentative_parse (parser
);
13265 /* Issue the error about the overly-qualified name now. */
13267 cp_parser_error (parser
,
13268 "global qualification of class name is invalid");
13269 else if (invalid_nested_name_p
)
13270 cp_parser_error (parser
,
13271 "qualified name does not name a class");
13272 else if (nested_name_specifier
)
13276 /* Reject typedef-names in class heads. */
13277 if (!DECL_IMPLICIT_TYPEDEF_P (type
))
13279 error ("invalid class name in declaration of %qD", type
);
13284 /* Figure out in what scope the declaration is being placed. */
13285 scope
= current_scope ();
13286 /* If that scope does not contain the scope in which the
13287 class was originally declared, the program is invalid. */
13288 if (scope
&& !is_ancestor (scope
, nested_name_specifier
))
13290 error ("declaration of %qD in %qD which does not enclose %qD",
13291 type
, scope
, nested_name_specifier
);
13297 A declarator-id shall not be qualified exception of the
13298 definition of a ... nested class outside of its class
13299 ... [or] a the definition or explicit instantiation of a
13300 class member of a namespace outside of its namespace. */
13301 if (scope
== nested_name_specifier
)
13303 pedwarn ("extra qualification ignored");
13304 nested_name_specifier
= NULL_TREE
;
13308 /* An explicit-specialization must be preceded by "template <>". If
13309 it is not, try to recover gracefully. */
13310 if (at_namespace_scope_p ()
13311 && parser
->num_template_parameter_lists
== 0
13314 error ("an explicit specialization must be preceded by %<template <>%>");
13315 invalid_explicit_specialization_p
= true;
13316 /* Take the same action that would have been taken by
13317 cp_parser_explicit_specialization. */
13318 ++parser
->num_template_parameter_lists
;
13319 begin_specialization ();
13321 /* There must be no "return" statements between this point and the
13322 end of this function; set "type "to the correct return value and
13323 use "goto done;" to return. */
13324 /* Make sure that the right number of template parameters were
13326 if (!cp_parser_check_template_parameters (parser
, num_templates
))
13328 /* If something went wrong, there is no point in even trying to
13329 process the class-definition. */
13334 /* Look up the type. */
13337 type
= TREE_TYPE (id
);
13338 type
= maybe_process_partial_specialization (type
);
13339 if (nested_name_specifier
)
13340 pushed_scope
= push_scope (nested_name_specifier
);
13342 else if (nested_name_specifier
)
13348 template <typename T> struct S { struct T };
13349 template <typename T> struct S<T>::T { };
13351 we will get a TYPENAME_TYPE when processing the definition of
13352 `S::T'. We need to resolve it to the actual type before we
13353 try to define it. */
13354 if (TREE_CODE (TREE_TYPE (type
)) == TYPENAME_TYPE
)
13356 class_type
= resolve_typename_type (TREE_TYPE (type
),
13357 /*only_current_p=*/false);
13358 if (class_type
!= error_mark_node
)
13359 type
= TYPE_NAME (class_type
);
13362 cp_parser_error (parser
, "could not resolve typename type");
13363 type
= error_mark_node
;
13367 maybe_process_partial_specialization (TREE_TYPE (type
));
13368 class_type
= current_class_type
;
13369 /* Enter the scope indicated by the nested-name-specifier. */
13370 pushed_scope
= push_scope (nested_name_specifier
);
13371 /* Get the canonical version of this type. */
13372 type
= TYPE_MAIN_DECL (TREE_TYPE (type
));
13373 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
13374 && !CLASSTYPE_TEMPLATE_SPECIALIZATION (TREE_TYPE (type
)))
13376 type
= push_template_decl (type
);
13377 if (type
== error_mark_node
)
13384 type
= TREE_TYPE (type
);
13385 *nested_name_specifier_p
= true;
13387 else /* The name is not a nested name. */
13389 /* If the class was unnamed, create a dummy name. */
13391 id
= make_anon_name ();
13392 type
= xref_tag (class_key
, id
, /*tag_scope=*/ts_current
,
13393 parser
->num_template_parameter_lists
);
13396 /* Indicate whether this class was declared as a `class' or as a
13398 if (TREE_CODE (type
) == RECORD_TYPE
)
13399 CLASSTYPE_DECLARED_CLASS (type
) = (class_key
== class_type
);
13400 cp_parser_check_class_key (class_key
, type
);
13402 /* If this type was already complete, and we see another definition,
13403 that's an error. */
13404 if (type
!= error_mark_node
&& COMPLETE_TYPE_P (type
))
13406 error ("redefinition of %q#T", type
);
13407 error ("previous definition of %q+#T", type
);
13412 /* We will have entered the scope containing the class; the names of
13413 base classes should be looked up in that context. For example:
13415 struct A { struct B {}; struct C; };
13416 struct A::C : B {};
13421 /* Get the list of base-classes, if there is one. */
13422 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COLON
))
13423 bases
= cp_parser_base_clause (parser
);
13425 /* Process the base classes. */
13426 xref_basetypes (type
, bases
);
13429 /* Leave the scope given by the nested-name-specifier. We will
13430 enter the class scope itself while processing the members. */
13432 pop_scope (pushed_scope
);
13434 if (invalid_explicit_specialization_p
)
13436 end_specialization ();
13437 --parser
->num_template_parameter_lists
;
13439 *attributes_p
= attributes
;
13443 /* Parse a class-key.
13450 Returns the kind of class-key specified, or none_type to indicate
13453 static enum tag_types
13454 cp_parser_class_key (cp_parser
* parser
)
13457 enum tag_types tag_type
;
13459 /* Look for the class-key. */
13460 token
= cp_parser_require (parser
, CPP_KEYWORD
, "class-key");
13464 /* Check to see if the TOKEN is a class-key. */
13465 tag_type
= cp_parser_token_is_class_key (token
);
13467 cp_parser_error (parser
, "expected class-key");
13471 /* Parse an (optional) member-specification.
13473 member-specification:
13474 member-declaration member-specification [opt]
13475 access-specifier : member-specification [opt] */
13478 cp_parser_member_specification_opt (cp_parser
* parser
)
13485 /* Peek at the next token. */
13486 token
= cp_lexer_peek_token (parser
->lexer
);
13487 /* If it's a `}', or EOF then we've seen all the members. */
13488 if (token
->type
== CPP_CLOSE_BRACE
13489 || token
->type
== CPP_EOF
13490 || token
->type
== CPP_PRAGMA_EOL
)
13493 /* See if this token is a keyword. */
13494 keyword
= token
->keyword
;
13498 case RID_PROTECTED
:
13500 /* Consume the access-specifier. */
13501 cp_lexer_consume_token (parser
->lexer
);
13502 /* Remember which access-specifier is active. */
13503 current_access_specifier
= token
->value
;
13504 /* Look for the `:'. */
13505 cp_parser_require (parser
, CPP_COLON
, "`:'");
13509 /* Accept #pragmas at class scope. */
13510 if (token
->type
== CPP_PRAGMA
)
13512 cp_parser_pragma (parser
, pragma_external
);
13516 /* Otherwise, the next construction must be a
13517 member-declaration. */
13518 cp_parser_member_declaration (parser
);
13523 /* Parse a member-declaration.
13525 member-declaration:
13526 decl-specifier-seq [opt] member-declarator-list [opt] ;
13527 function-definition ; [opt]
13528 :: [opt] nested-name-specifier template [opt] unqualified-id ;
13530 template-declaration
13532 member-declarator-list:
13534 member-declarator-list , member-declarator
13537 declarator pure-specifier [opt]
13538 declarator constant-initializer [opt]
13539 identifier [opt] : constant-expression
13543 member-declaration:
13544 __extension__ member-declaration
13547 declarator attributes [opt] pure-specifier [opt]
13548 declarator attributes [opt] constant-initializer [opt]
13549 identifier [opt] attributes [opt] : constant-expression */
13552 cp_parser_member_declaration (cp_parser
* parser
)
13554 cp_decl_specifier_seq decl_specifiers
;
13555 tree prefix_attributes
;
13557 int declares_class_or_enum
;
13560 int saved_pedantic
;
13562 /* Check for the `__extension__' keyword. */
13563 if (cp_parser_extension_opt (parser
, &saved_pedantic
))
13566 cp_parser_member_declaration (parser
);
13567 /* Restore the old value of the PEDANTIC flag. */
13568 pedantic
= saved_pedantic
;
13573 /* Check for a template-declaration. */
13574 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
13576 /* An explicit specialization here is an error condition, and we
13577 expect the specialization handler to detect and report this. */
13578 if (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
== CPP_LESS
13579 && cp_lexer_peek_nth_token (parser
->lexer
, 3)->type
== CPP_GREATER
)
13580 cp_parser_explicit_specialization (parser
);
13582 cp_parser_template_declaration (parser
, /*member_p=*/true);
13587 /* Check for a using-declaration. */
13588 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_USING
))
13590 /* Parse the using-declaration. */
13591 cp_parser_using_declaration (parser
,
13592 /*access_declaration_p=*/false);
13596 /* Check for @defs. */
13597 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AT_DEFS
))
13600 tree ivar_chains
= cp_parser_objc_defs_expression (parser
);
13601 ivar
= ivar_chains
;
13605 ivar
= TREE_CHAIN (member
);
13606 TREE_CHAIN (member
) = NULL_TREE
;
13607 finish_member_declaration (member
);
13612 if (cp_parser_using_declaration (parser
, /*access_declaration=*/true))
13615 /* Parse the decl-specifier-seq. */
13616 cp_parser_decl_specifier_seq (parser
,
13617 CP_PARSER_FLAGS_OPTIONAL
,
13619 &declares_class_or_enum
);
13620 prefix_attributes
= decl_specifiers
.attributes
;
13621 decl_specifiers
.attributes
= NULL_TREE
;
13622 /* Check for an invalid type-name. */
13623 if (!decl_specifiers
.type
13624 && cp_parser_parse_and_diagnose_invalid_type_name (parser
))
13626 /* If there is no declarator, then the decl-specifier-seq should
13628 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
13630 /* If there was no decl-specifier-seq, and the next token is a
13631 `;', then we have something like:
13637 Each member-declaration shall declare at least one member
13638 name of the class. */
13639 if (!decl_specifiers
.any_specifiers_p
)
13641 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
13642 if (pedantic
&& !token
->in_system_header
)
13643 pedwarn ("%Hextra %<;%>", &token
->location
);
13649 /* See if this declaration is a friend. */
13650 friend_p
= cp_parser_friend_p (&decl_specifiers
);
13651 /* If there were decl-specifiers, check to see if there was
13652 a class-declaration. */
13653 type
= check_tag_decl (&decl_specifiers
);
13654 /* Nested classes have already been added to the class, but
13655 a `friend' needs to be explicitly registered. */
13658 /* If the `friend' keyword was present, the friend must
13659 be introduced with a class-key. */
13660 if (!declares_class_or_enum
)
13661 error ("a class-key must be used when declaring a friend");
13664 template <typename T> struct A {
13665 friend struct A<T>::B;
13668 A<T>::B will be represented by a TYPENAME_TYPE, and
13669 therefore not recognized by check_tag_decl. */
13671 && decl_specifiers
.type
13672 && TYPE_P (decl_specifiers
.type
))
13673 type
= decl_specifiers
.type
;
13674 if (!type
|| !TYPE_P (type
))
13675 error ("friend declaration does not name a class or "
13678 make_friend_class (current_class_type
, type
,
13679 /*complain=*/true);
13681 /* If there is no TYPE, an error message will already have
13683 else if (!type
|| type
== error_mark_node
)
13685 /* An anonymous aggregate has to be handled specially; such
13686 a declaration really declares a data member (with a
13687 particular type), as opposed to a nested class. */
13688 else if (ANON_AGGR_TYPE_P (type
))
13690 /* Remove constructors and such from TYPE, now that we
13691 know it is an anonymous aggregate. */
13692 fixup_anonymous_aggr (type
);
13693 /* And make the corresponding data member. */
13694 decl
= build_decl (FIELD_DECL
, NULL_TREE
, type
);
13695 /* Add it to the class. */
13696 finish_member_declaration (decl
);
13699 cp_parser_check_access_in_redeclaration (TYPE_NAME (type
));
13704 /* See if these declarations will be friends. */
13705 friend_p
= cp_parser_friend_p (&decl_specifiers
);
13707 /* Keep going until we hit the `;' at the end of the
13709 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
13711 tree attributes
= NULL_TREE
;
13712 tree first_attribute
;
13714 /* Peek at the next token. */
13715 token
= cp_lexer_peek_token (parser
->lexer
);
13717 /* Check for a bitfield declaration. */
13718 if (token
->type
== CPP_COLON
13719 || (token
->type
== CPP_NAME
13720 && cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
13726 /* Get the name of the bitfield. Note that we cannot just
13727 check TOKEN here because it may have been invalidated by
13728 the call to cp_lexer_peek_nth_token above. */
13729 if (cp_lexer_peek_token (parser
->lexer
)->type
!= CPP_COLON
)
13730 identifier
= cp_parser_identifier (parser
);
13732 identifier
= NULL_TREE
;
13734 /* Consume the `:' token. */
13735 cp_lexer_consume_token (parser
->lexer
);
13736 /* Get the width of the bitfield. */
13738 = cp_parser_constant_expression (parser
,
13739 /*allow_non_constant=*/false,
13742 /* Look for attributes that apply to the bitfield. */
13743 attributes
= cp_parser_attributes_opt (parser
);
13744 /* Remember which attributes are prefix attributes and
13746 first_attribute
= attributes
;
13747 /* Combine the attributes. */
13748 attributes
= chainon (prefix_attributes
, attributes
);
13750 /* Create the bitfield declaration. */
13751 decl
= grokbitfield (identifier
13752 ? make_id_declarator (NULL_TREE
,
13758 /* Apply the attributes. */
13759 cplus_decl_attributes (&decl
, attributes
, /*flags=*/0);
13763 cp_declarator
*declarator
;
13765 tree asm_specification
;
13766 int ctor_dtor_or_conv_p
;
13768 /* Parse the declarator. */
13770 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
13771 &ctor_dtor_or_conv_p
,
13772 /*parenthesized_p=*/NULL
,
13773 /*member_p=*/true);
13775 /* If something went wrong parsing the declarator, make sure
13776 that we at least consume some tokens. */
13777 if (declarator
== cp_error_declarator
)
13779 /* Skip to the end of the statement. */
13780 cp_parser_skip_to_end_of_statement (parser
);
13781 /* If the next token is not a semicolon, that is
13782 probably because we just skipped over the body of
13783 a function. So, we consume a semicolon if
13784 present, but do not issue an error message if it
13786 if (cp_lexer_next_token_is (parser
->lexer
,
13788 cp_lexer_consume_token (parser
->lexer
);
13792 if (declares_class_or_enum
& 2)
13793 cp_parser_check_for_definition_in_return_type
13794 (declarator
, decl_specifiers
.type
);
13796 /* Look for an asm-specification. */
13797 asm_specification
= cp_parser_asm_specification_opt (parser
);
13798 /* Look for attributes that apply to the declaration. */
13799 attributes
= cp_parser_attributes_opt (parser
);
13800 /* Remember which attributes are prefix attributes and
13802 first_attribute
= attributes
;
13803 /* Combine the attributes. */
13804 attributes
= chainon (prefix_attributes
, attributes
);
13806 /* If it's an `=', then we have a constant-initializer or a
13807 pure-specifier. It is not correct to parse the
13808 initializer before registering the member declaration
13809 since the member declaration should be in scope while
13810 its initializer is processed. However, the rest of the
13811 front end does not yet provide an interface that allows
13812 us to handle this correctly. */
13813 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EQ
))
13817 A pure-specifier shall be used only in the declaration of
13818 a virtual function.
13820 A member-declarator can contain a constant-initializer
13821 only if it declares a static member of integral or
13824 Therefore, if the DECLARATOR is for a function, we look
13825 for a pure-specifier; otherwise, we look for a
13826 constant-initializer. When we call `grokfield', it will
13827 perform more stringent semantics checks. */
13828 if (declarator
->kind
== cdk_function
13829 && declarator
->declarator
->kind
== cdk_id
)
13830 initializer
= cp_parser_pure_specifier (parser
);
13832 /* Parse the initializer. */
13833 initializer
= cp_parser_constant_initializer (parser
);
13835 /* Otherwise, there is no initializer. */
13837 initializer
= NULL_TREE
;
13839 /* See if we are probably looking at a function
13840 definition. We are certainly not looking at a
13841 member-declarator. Calling `grokfield' has
13842 side-effects, so we must not do it unless we are sure
13843 that we are looking at a member-declarator. */
13844 if (cp_parser_token_starts_function_definition_p
13845 (cp_lexer_peek_token (parser
->lexer
)))
13847 /* The grammar does not allow a pure-specifier to be
13848 used when a member function is defined. (It is
13849 possible that this fact is an oversight in the
13850 standard, since a pure function may be defined
13851 outside of the class-specifier. */
13853 error ("pure-specifier on function-definition");
13854 decl
= cp_parser_save_member_function_body (parser
,
13858 /* If the member was not a friend, declare it here. */
13860 finish_member_declaration (decl
);
13861 /* Peek at the next token. */
13862 token
= cp_lexer_peek_token (parser
->lexer
);
13863 /* If the next token is a semicolon, consume it. */
13864 if (token
->type
== CPP_SEMICOLON
)
13865 cp_lexer_consume_token (parser
->lexer
);
13869 /* Create the declaration. */
13870 decl
= grokfield (declarator
, &decl_specifiers
,
13871 initializer
, /*init_const_expr_p=*/true,
13876 /* Reset PREFIX_ATTRIBUTES. */
13877 while (attributes
&& TREE_CHAIN (attributes
) != first_attribute
)
13878 attributes
= TREE_CHAIN (attributes
);
13880 TREE_CHAIN (attributes
) = NULL_TREE
;
13882 /* If there is any qualification still in effect, clear it
13883 now; we will be starting fresh with the next declarator. */
13884 parser
->scope
= NULL_TREE
;
13885 parser
->qualifying_scope
= NULL_TREE
;
13886 parser
->object_scope
= NULL_TREE
;
13887 /* If it's a `,', then there are more declarators. */
13888 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
13889 cp_lexer_consume_token (parser
->lexer
);
13890 /* If the next token isn't a `;', then we have a parse error. */
13891 else if (cp_lexer_next_token_is_not (parser
->lexer
,
13894 cp_parser_error (parser
, "expected %<;%>");
13895 /* Skip tokens until we find a `;'. */
13896 cp_parser_skip_to_end_of_statement (parser
);
13903 /* Add DECL to the list of members. */
13905 finish_member_declaration (decl
);
13907 if (TREE_CODE (decl
) == FUNCTION_DECL
)
13908 cp_parser_save_default_args (parser
, decl
);
13913 cp_parser_require (parser
, CPP_SEMICOLON
, "`;'");
13916 /* Parse a pure-specifier.
13921 Returns INTEGER_ZERO_NODE if a pure specifier is found.
13922 Otherwise, ERROR_MARK_NODE is returned. */
13925 cp_parser_pure_specifier (cp_parser
* parser
)
13929 /* Look for the `=' token. */
13930 if (!cp_parser_require (parser
, CPP_EQ
, "`='"))
13931 return error_mark_node
;
13932 /* Look for the `0' token. */
13933 token
= cp_lexer_consume_token (parser
->lexer
);
13934 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
13935 if (token
->type
!= CPP_NUMBER
|| !(token
->flags
& PURE_ZERO
))
13937 cp_parser_error (parser
,
13938 "invalid pure specifier (only `= 0' is allowed)");
13939 cp_parser_skip_to_end_of_statement (parser
);
13940 return error_mark_node
;
13942 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
13944 error ("templates may not be %<virtual%>");
13945 return error_mark_node
;
13948 return integer_zero_node
;
13951 /* Parse a constant-initializer.
13953 constant-initializer:
13954 = constant-expression
13956 Returns a representation of the constant-expression. */
13959 cp_parser_constant_initializer (cp_parser
* parser
)
13961 /* Look for the `=' token. */
13962 if (!cp_parser_require (parser
, CPP_EQ
, "`='"))
13963 return error_mark_node
;
13965 /* It is invalid to write:
13967 struct S { static const int i = { 7 }; };
13970 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_BRACE
))
13972 cp_parser_error (parser
,
13973 "a brace-enclosed initializer is not allowed here");
13974 /* Consume the opening brace. */
13975 cp_lexer_consume_token (parser
->lexer
);
13976 /* Skip the initializer. */
13977 cp_parser_skip_to_closing_brace (parser
);
13978 /* Look for the trailing `}'. */
13979 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "`}'");
13981 return error_mark_node
;
13984 return cp_parser_constant_expression (parser
,
13985 /*allow_non_constant=*/false,
13989 /* Derived classes [gram.class.derived] */
13991 /* Parse a base-clause.
13994 : base-specifier-list
13996 base-specifier-list:
13998 base-specifier-list , base-specifier
14000 Returns a TREE_LIST representing the base-classes, in the order in
14001 which they were declared. The representation of each node is as
14002 described by cp_parser_base_specifier.
14004 In the case that no bases are specified, this function will return
14005 NULL_TREE, not ERROR_MARK_NODE. */
14008 cp_parser_base_clause (cp_parser
* parser
)
14010 tree bases
= NULL_TREE
;
14012 /* Look for the `:' that begins the list. */
14013 cp_parser_require (parser
, CPP_COLON
, "`:'");
14015 /* Scan the base-specifier-list. */
14021 /* Look for the base-specifier. */
14022 base
= cp_parser_base_specifier (parser
);
14023 /* Add BASE to the front of the list. */
14024 if (base
!= error_mark_node
)
14026 TREE_CHAIN (base
) = bases
;
14029 /* Peek at the next token. */
14030 token
= cp_lexer_peek_token (parser
->lexer
);
14031 /* If it's not a comma, then the list is complete. */
14032 if (token
->type
!= CPP_COMMA
)
14034 /* Consume the `,'. */
14035 cp_lexer_consume_token (parser
->lexer
);
14038 /* PARSER->SCOPE may still be non-NULL at this point, if the last
14039 base class had a qualified name. However, the next name that
14040 appears is certainly not qualified. */
14041 parser
->scope
= NULL_TREE
;
14042 parser
->qualifying_scope
= NULL_TREE
;
14043 parser
->object_scope
= NULL_TREE
;
14045 return nreverse (bases
);
14048 /* Parse a base-specifier.
14051 :: [opt] nested-name-specifier [opt] class-name
14052 virtual access-specifier [opt] :: [opt] nested-name-specifier
14054 access-specifier virtual [opt] :: [opt] nested-name-specifier
14057 Returns a TREE_LIST. The TREE_PURPOSE will be one of
14058 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
14059 indicate the specifiers provided. The TREE_VALUE will be a TYPE
14060 (or the ERROR_MARK_NODE) indicating the type that was specified. */
14063 cp_parser_base_specifier (cp_parser
* parser
)
14067 bool virtual_p
= false;
14068 bool duplicate_virtual_error_issued_p
= false;
14069 bool duplicate_access_error_issued_p
= false;
14070 bool class_scope_p
, template_p
;
14071 tree access
= access_default_node
;
14074 /* Process the optional `virtual' and `access-specifier'. */
14077 /* Peek at the next token. */
14078 token
= cp_lexer_peek_token (parser
->lexer
);
14079 /* Process `virtual'. */
14080 switch (token
->keyword
)
14083 /* If `virtual' appears more than once, issue an error. */
14084 if (virtual_p
&& !duplicate_virtual_error_issued_p
)
14086 cp_parser_error (parser
,
14087 "%<virtual%> specified more than once in base-specified");
14088 duplicate_virtual_error_issued_p
= true;
14093 /* Consume the `virtual' token. */
14094 cp_lexer_consume_token (parser
->lexer
);
14099 case RID_PROTECTED
:
14101 /* If more than one access specifier appears, issue an
14103 if (access
!= access_default_node
14104 && !duplicate_access_error_issued_p
)
14106 cp_parser_error (parser
,
14107 "more than one access specifier in base-specified");
14108 duplicate_access_error_issued_p
= true;
14111 access
= ridpointers
[(int) token
->keyword
];
14113 /* Consume the access-specifier. */
14114 cp_lexer_consume_token (parser
->lexer
);
14123 /* It is not uncommon to see programs mechanically, erroneously, use
14124 the 'typename' keyword to denote (dependent) qualified types
14125 as base classes. */
14126 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TYPENAME
))
14128 if (!processing_template_decl
)
14129 error ("keyword %<typename%> not allowed outside of templates");
14131 error ("keyword %<typename%> not allowed in this context "
14132 "(the base class is implicitly a type)");
14133 cp_lexer_consume_token (parser
->lexer
);
14136 /* Look for the optional `::' operator. */
14137 cp_parser_global_scope_opt (parser
, /*current_scope_valid_p=*/false);
14138 /* Look for the nested-name-specifier. The simplest way to
14143 The keyword `typename' is not permitted in a base-specifier or
14144 mem-initializer; in these contexts a qualified name that
14145 depends on a template-parameter is implicitly assumed to be a
14148 is to pretend that we have seen the `typename' keyword at this
14150 cp_parser_nested_name_specifier_opt (parser
,
14151 /*typename_keyword_p=*/true,
14152 /*check_dependency_p=*/true,
14154 /*is_declaration=*/true);
14155 /* If the base class is given by a qualified name, assume that names
14156 we see are type names or templates, as appropriate. */
14157 class_scope_p
= (parser
->scope
&& TYPE_P (parser
->scope
));
14158 template_p
= class_scope_p
&& cp_parser_optional_template_keyword (parser
);
14160 /* Finally, look for the class-name. */
14161 type
= cp_parser_class_name (parser
,
14165 /*check_dependency_p=*/true,
14166 /*class_head_p=*/false,
14167 /*is_declaration=*/true);
14169 if (type
== error_mark_node
)
14170 return error_mark_node
;
14172 return finish_base_specifier (TREE_TYPE (type
), access
, virtual_p
);
14175 /* Exception handling [gram.exception] */
14177 /* Parse an (optional) exception-specification.
14179 exception-specification:
14180 throw ( type-id-list [opt] )
14182 Returns a TREE_LIST representing the exception-specification. The
14183 TREE_VALUE of each node is a type. */
14186 cp_parser_exception_specification_opt (cp_parser
* parser
)
14191 /* Peek at the next token. */
14192 token
= cp_lexer_peek_token (parser
->lexer
);
14193 /* If it's not `throw', then there's no exception-specification. */
14194 if (!cp_parser_is_keyword (token
, RID_THROW
))
14197 /* Consume the `throw'. */
14198 cp_lexer_consume_token (parser
->lexer
);
14200 /* Look for the `('. */
14201 cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('");
14203 /* Peek at the next token. */
14204 token
= cp_lexer_peek_token (parser
->lexer
);
14205 /* If it's not a `)', then there is a type-id-list. */
14206 if (token
->type
!= CPP_CLOSE_PAREN
)
14208 const char *saved_message
;
14210 /* Types may not be defined in an exception-specification. */
14211 saved_message
= parser
->type_definition_forbidden_message
;
14212 parser
->type_definition_forbidden_message
14213 = "types may not be defined in an exception-specification";
14214 /* Parse the type-id-list. */
14215 type_id_list
= cp_parser_type_id_list (parser
);
14216 /* Restore the saved message. */
14217 parser
->type_definition_forbidden_message
= saved_message
;
14220 type_id_list
= empty_except_spec
;
14222 /* Look for the `)'. */
14223 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
14225 return type_id_list
;
14228 /* Parse an (optional) type-id-list.
14232 type-id-list , type-id
14234 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
14235 in the order that the types were presented. */
14238 cp_parser_type_id_list (cp_parser
* parser
)
14240 tree types
= NULL_TREE
;
14247 /* Get the next type-id. */
14248 type
= cp_parser_type_id (parser
);
14249 /* Add it to the list. */
14250 types
= add_exception_specifier (types
, type
, /*complain=*/1);
14251 /* Peek at the next token. */
14252 token
= cp_lexer_peek_token (parser
->lexer
);
14253 /* If it is not a `,', we are done. */
14254 if (token
->type
!= CPP_COMMA
)
14256 /* Consume the `,'. */
14257 cp_lexer_consume_token (parser
->lexer
);
14260 return nreverse (types
);
14263 /* Parse a try-block.
14266 try compound-statement handler-seq */
14269 cp_parser_try_block (cp_parser
* parser
)
14273 cp_parser_require_keyword (parser
, RID_TRY
, "`try'");
14274 try_block
= begin_try_block ();
14275 cp_parser_compound_statement (parser
, NULL
, true);
14276 finish_try_block (try_block
);
14277 cp_parser_handler_seq (parser
);
14278 finish_handler_sequence (try_block
);
14283 /* Parse a function-try-block.
14285 function-try-block:
14286 try ctor-initializer [opt] function-body handler-seq */
14289 cp_parser_function_try_block (cp_parser
* parser
)
14291 tree compound_stmt
;
14293 bool ctor_initializer_p
;
14295 /* Look for the `try' keyword. */
14296 if (!cp_parser_require_keyword (parser
, RID_TRY
, "`try'"))
14298 /* Let the rest of the front-end know where we are. */
14299 try_block
= begin_function_try_block (&compound_stmt
);
14300 /* Parse the function-body. */
14302 = cp_parser_ctor_initializer_opt_and_function_body (parser
);
14303 /* We're done with the `try' part. */
14304 finish_function_try_block (try_block
);
14305 /* Parse the handlers. */
14306 cp_parser_handler_seq (parser
);
14307 /* We're done with the handlers. */
14308 finish_function_handler_sequence (try_block
, compound_stmt
);
14310 return ctor_initializer_p
;
14313 /* Parse a handler-seq.
14316 handler handler-seq [opt] */
14319 cp_parser_handler_seq (cp_parser
* parser
)
14325 /* Parse the handler. */
14326 cp_parser_handler (parser
);
14327 /* Peek at the next token. */
14328 token
= cp_lexer_peek_token (parser
->lexer
);
14329 /* If it's not `catch' then there are no more handlers. */
14330 if (!cp_parser_is_keyword (token
, RID_CATCH
))
14335 /* Parse a handler.
14338 catch ( exception-declaration ) compound-statement */
14341 cp_parser_handler (cp_parser
* parser
)
14346 cp_parser_require_keyword (parser
, RID_CATCH
, "`catch'");
14347 handler
= begin_handler ();
14348 cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('");
14349 declaration
= cp_parser_exception_declaration (parser
);
14350 finish_handler_parms (declaration
, handler
);
14351 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
14352 cp_parser_compound_statement (parser
, NULL
, false);
14353 finish_handler (handler
);
14356 /* Parse an exception-declaration.
14358 exception-declaration:
14359 type-specifier-seq declarator
14360 type-specifier-seq abstract-declarator
14364 Returns a VAR_DECL for the declaration, or NULL_TREE if the
14365 ellipsis variant is used. */
14368 cp_parser_exception_declaration (cp_parser
* parser
)
14370 cp_decl_specifier_seq type_specifiers
;
14371 cp_declarator
*declarator
;
14372 const char *saved_message
;
14374 /* If it's an ellipsis, it's easy to handle. */
14375 if (cp_lexer_next_token_is (parser
->lexer
, CPP_ELLIPSIS
))
14377 /* Consume the `...' token. */
14378 cp_lexer_consume_token (parser
->lexer
);
14382 /* Types may not be defined in exception-declarations. */
14383 saved_message
= parser
->type_definition_forbidden_message
;
14384 parser
->type_definition_forbidden_message
14385 = "types may not be defined in exception-declarations";
14387 /* Parse the type-specifier-seq. */
14388 cp_parser_type_specifier_seq (parser
, /*is_condition=*/false,
14390 /* If it's a `)', then there is no declarator. */
14391 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_PAREN
))
14394 declarator
= cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_EITHER
,
14395 /*ctor_dtor_or_conv_p=*/NULL
,
14396 /*parenthesized_p=*/NULL
,
14397 /*member_p=*/false);
14399 /* Restore the saved message. */
14400 parser
->type_definition_forbidden_message
= saved_message
;
14402 if (!type_specifiers
.any_specifiers_p
)
14403 return error_mark_node
;
14405 return grokdeclarator (declarator
, &type_specifiers
, CATCHPARM
, 1, NULL
);
14408 /* Parse a throw-expression.
14411 throw assignment-expression [opt]
14413 Returns a THROW_EXPR representing the throw-expression. */
14416 cp_parser_throw_expression (cp_parser
* parser
)
14421 cp_parser_require_keyword (parser
, RID_THROW
, "`throw'");
14422 token
= cp_lexer_peek_token (parser
->lexer
);
14423 /* Figure out whether or not there is an assignment-expression
14424 following the "throw" keyword. */
14425 if (token
->type
== CPP_COMMA
14426 || token
->type
== CPP_SEMICOLON
14427 || token
->type
== CPP_CLOSE_PAREN
14428 || token
->type
== CPP_CLOSE_SQUARE
14429 || token
->type
== CPP_CLOSE_BRACE
14430 || token
->type
== CPP_COLON
)
14431 expression
= NULL_TREE
;
14433 expression
= cp_parser_assignment_expression (parser
,
14436 return build_throw (expression
);
14439 /* GNU Extensions */
14441 /* Parse an (optional) asm-specification.
14444 asm ( string-literal )
14446 If the asm-specification is present, returns a STRING_CST
14447 corresponding to the string-literal. Otherwise, returns
14451 cp_parser_asm_specification_opt (cp_parser
* parser
)
14454 tree asm_specification
;
14456 /* Peek at the next token. */
14457 token
= cp_lexer_peek_token (parser
->lexer
);
14458 /* If the next token isn't the `asm' keyword, then there's no
14459 asm-specification. */
14460 if (!cp_parser_is_keyword (token
, RID_ASM
))
14463 /* Consume the `asm' token. */
14464 cp_lexer_consume_token (parser
->lexer
);
14465 /* Look for the `('. */
14466 cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('");
14468 /* Look for the string-literal. */
14469 asm_specification
= cp_parser_string_literal (parser
, false, false);
14471 /* Look for the `)'. */
14472 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`('");
14474 return asm_specification
;
14477 /* Parse an asm-operand-list.
14481 asm-operand-list , asm-operand
14484 string-literal ( expression )
14485 [ string-literal ] string-literal ( expression )
14487 Returns a TREE_LIST representing the operands. The TREE_VALUE of
14488 each node is the expression. The TREE_PURPOSE is itself a
14489 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
14490 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
14491 is a STRING_CST for the string literal before the parenthesis. */
14494 cp_parser_asm_operand_list (cp_parser
* parser
)
14496 tree asm_operands
= NULL_TREE
;
14500 tree string_literal
;
14504 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_SQUARE
))
14506 /* Consume the `[' token. */
14507 cp_lexer_consume_token (parser
->lexer
);
14508 /* Read the operand name. */
14509 name
= cp_parser_identifier (parser
);
14510 if (name
!= error_mark_node
)
14511 name
= build_string (IDENTIFIER_LENGTH (name
),
14512 IDENTIFIER_POINTER (name
));
14513 /* Look for the closing `]'. */
14514 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, "`]'");
14518 /* Look for the string-literal. */
14519 string_literal
= cp_parser_string_literal (parser
, false, false);
14521 /* Look for the `('. */
14522 cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('");
14523 /* Parse the expression. */
14524 expression
= cp_parser_expression (parser
, /*cast_p=*/false);
14525 /* Look for the `)'. */
14526 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
14528 /* Add this operand to the list. */
14529 asm_operands
= tree_cons (build_tree_list (name
, string_literal
),
14532 /* If the next token is not a `,', there are no more
14534 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
14536 /* Consume the `,'. */
14537 cp_lexer_consume_token (parser
->lexer
);
14540 return nreverse (asm_operands
);
14543 /* Parse an asm-clobber-list.
14547 asm-clobber-list , string-literal
14549 Returns a TREE_LIST, indicating the clobbers in the order that they
14550 appeared. The TREE_VALUE of each node is a STRING_CST. */
14553 cp_parser_asm_clobber_list (cp_parser
* parser
)
14555 tree clobbers
= NULL_TREE
;
14559 tree string_literal
;
14561 /* Look for the string literal. */
14562 string_literal
= cp_parser_string_literal (parser
, false, false);
14563 /* Add it to the list. */
14564 clobbers
= tree_cons (NULL_TREE
, string_literal
, clobbers
);
14565 /* If the next token is not a `,', then the list is
14567 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
14569 /* Consume the `,' token. */
14570 cp_lexer_consume_token (parser
->lexer
);
14576 /* Parse an (optional) series of attributes.
14579 attributes attribute
14582 __attribute__ (( attribute-list [opt] ))
14584 The return value is as for cp_parser_attribute_list. */
14587 cp_parser_attributes_opt (cp_parser
* parser
)
14589 tree attributes
= NULL_TREE
;
14594 tree attribute_list
;
14596 /* Peek at the next token. */
14597 token
= cp_lexer_peek_token (parser
->lexer
);
14598 /* If it's not `__attribute__', then we're done. */
14599 if (token
->keyword
!= RID_ATTRIBUTE
)
14602 /* Consume the `__attribute__' keyword. */
14603 cp_lexer_consume_token (parser
->lexer
);
14604 /* Look for the two `(' tokens. */
14605 cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('");
14606 cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('");
14608 /* Peek at the next token. */
14609 token
= cp_lexer_peek_token (parser
->lexer
);
14610 if (token
->type
!= CPP_CLOSE_PAREN
)
14611 /* Parse the attribute-list. */
14612 attribute_list
= cp_parser_attribute_list (parser
);
14614 /* If the next token is a `)', then there is no attribute
14616 attribute_list
= NULL
;
14618 /* Look for the two `)' tokens. */
14619 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
14620 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
14622 /* Add these new attributes to the list. */
14623 attributes
= chainon (attributes
, attribute_list
);
14629 /* Parse an attribute-list.
14633 attribute-list , attribute
14637 identifier ( identifier )
14638 identifier ( identifier , expression-list )
14639 identifier ( expression-list )
14641 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
14642 to an attribute. The TREE_PURPOSE of each node is the identifier
14643 indicating which attribute is in use. The TREE_VALUE represents
14644 the arguments, if any. */
14647 cp_parser_attribute_list (cp_parser
* parser
)
14649 tree attribute_list
= NULL_TREE
;
14650 bool save_translate_strings_p
= parser
->translate_strings_p
;
14652 parser
->translate_strings_p
= false;
14659 /* Look for the identifier. We also allow keywords here; for
14660 example `__attribute__ ((const))' is legal. */
14661 token
= cp_lexer_peek_token (parser
->lexer
);
14662 if (token
->type
== CPP_NAME
14663 || token
->type
== CPP_KEYWORD
)
14665 tree arguments
= NULL_TREE
;
14667 /* Consume the token. */
14668 token
= cp_lexer_consume_token (parser
->lexer
);
14670 /* Save away the identifier that indicates which attribute
14672 identifier
= token
->value
;
14673 attribute
= build_tree_list (identifier
, NULL_TREE
);
14675 /* Peek at the next token. */
14676 token
= cp_lexer_peek_token (parser
->lexer
);
14677 /* If it's an `(', then parse the attribute arguments. */
14678 if (token
->type
== CPP_OPEN_PAREN
)
14680 arguments
= cp_parser_parenthesized_expression_list
14681 (parser
, true, /*cast_p=*/false,
14682 /*non_constant_p=*/NULL
);
14683 /* Save the arguments away. */
14684 TREE_VALUE (attribute
) = arguments
;
14687 if (arguments
!= error_mark_node
)
14689 /* Add this attribute to the list. */
14690 TREE_CHAIN (attribute
) = attribute_list
;
14691 attribute_list
= attribute
;
14694 token
= cp_lexer_peek_token (parser
->lexer
);
14696 /* Now, look for more attributes. If the next token isn't a
14697 `,', we're done. */
14698 if (token
->type
!= CPP_COMMA
)
14701 /* Consume the comma and keep going. */
14702 cp_lexer_consume_token (parser
->lexer
);
14704 parser
->translate_strings_p
= save_translate_strings_p
;
14706 /* We built up the list in reverse order. */
14707 return nreverse (attribute_list
);
14710 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
14711 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
14712 current value of the PEDANTIC flag, regardless of whether or not
14713 the `__extension__' keyword is present. The caller is responsible
14714 for restoring the value of the PEDANTIC flag. */
14717 cp_parser_extension_opt (cp_parser
* parser
, int* saved_pedantic
)
14719 /* Save the old value of the PEDANTIC flag. */
14720 *saved_pedantic
= pedantic
;
14722 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_EXTENSION
))
14724 /* Consume the `__extension__' token. */
14725 cp_lexer_consume_token (parser
->lexer
);
14726 /* We're not being pedantic while the `__extension__' keyword is
14736 /* Parse a label declaration.
14739 __label__ label-declarator-seq ;
14741 label-declarator-seq:
14742 identifier , label-declarator-seq
14746 cp_parser_label_declaration (cp_parser
* parser
)
14748 /* Look for the `__label__' keyword. */
14749 cp_parser_require_keyword (parser
, RID_LABEL
, "`__label__'");
14755 /* Look for an identifier. */
14756 identifier
= cp_parser_identifier (parser
);
14757 /* If we failed, stop. */
14758 if (identifier
== error_mark_node
)
14760 /* Declare it as a label. */
14761 finish_label_decl (identifier
);
14762 /* If the next token is a `;', stop. */
14763 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
14765 /* Look for the `,' separating the label declarations. */
14766 cp_parser_require (parser
, CPP_COMMA
, "`,'");
14769 /* Look for the final `;'. */
14770 cp_parser_require (parser
, CPP_SEMICOLON
, "`;'");
14773 /* Support Functions */
14775 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
14776 NAME should have one of the representations used for an
14777 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
14778 is returned. If PARSER->SCOPE is a dependent type, then a
14779 SCOPE_REF is returned.
14781 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
14782 returned; the name was already resolved when the TEMPLATE_ID_EXPR
14783 was formed. Abstractly, such entities should not be passed to this
14784 function, because they do not need to be looked up, but it is
14785 simpler to check for this special case here, rather than at the
14788 In cases not explicitly covered above, this function returns a
14789 DECL, OVERLOAD, or baselink representing the result of the lookup.
14790 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
14793 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
14794 (e.g., "struct") that was used. In that case bindings that do not
14795 refer to types are ignored.
14797 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
14800 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
14803 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
14806 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
14807 TREE_LIST of candidates if name-lookup results in an ambiguity, and
14808 NULL_TREE otherwise. */
14811 cp_parser_lookup_name (cp_parser
*parser
, tree name
,
14812 enum tag_types tag_type
,
14815 bool check_dependency
,
14816 tree
*ambiguous_decls
)
14820 tree object_type
= parser
->context
->object_type
;
14822 if (!cp_parser_uncommitted_to_tentative_parse_p (parser
))
14823 flags
|= LOOKUP_COMPLAIN
;
14825 /* Assume that the lookup will be unambiguous. */
14826 if (ambiguous_decls
)
14827 *ambiguous_decls
= NULL_TREE
;
14829 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
14830 no longer valid. Note that if we are parsing tentatively, and
14831 the parse fails, OBJECT_TYPE will be automatically restored. */
14832 parser
->context
->object_type
= NULL_TREE
;
14834 if (name
== error_mark_node
)
14835 return error_mark_node
;
14837 /* A template-id has already been resolved; there is no lookup to
14839 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
14841 if (BASELINK_P (name
))
14843 gcc_assert (TREE_CODE (BASELINK_FUNCTIONS (name
))
14844 == TEMPLATE_ID_EXPR
);
14848 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
14849 it should already have been checked to make sure that the name
14850 used matches the type being destroyed. */
14851 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
14855 /* Figure out to which type this destructor applies. */
14857 type
= parser
->scope
;
14858 else if (object_type
)
14859 type
= object_type
;
14861 type
= current_class_type
;
14862 /* If that's not a class type, there is no destructor. */
14863 if (!type
|| !CLASS_TYPE_P (type
))
14864 return error_mark_node
;
14865 if (CLASSTYPE_LAZY_DESTRUCTOR (type
))
14866 lazily_declare_fn (sfk_destructor
, type
);
14867 if (!CLASSTYPE_DESTRUCTORS (type
))
14868 return error_mark_node
;
14869 /* If it was a class type, return the destructor. */
14870 return CLASSTYPE_DESTRUCTORS (type
);
14873 /* By this point, the NAME should be an ordinary identifier. If
14874 the id-expression was a qualified name, the qualifying scope is
14875 stored in PARSER->SCOPE at this point. */
14876 gcc_assert (TREE_CODE (name
) == IDENTIFIER_NODE
);
14878 /* Perform the lookup. */
14883 if (parser
->scope
== error_mark_node
)
14884 return error_mark_node
;
14886 /* If the SCOPE is dependent, the lookup must be deferred until
14887 the template is instantiated -- unless we are explicitly
14888 looking up names in uninstantiated templates. Even then, we
14889 cannot look up the name if the scope is not a class type; it
14890 might, for example, be a template type parameter. */
14891 dependent_p
= (TYPE_P (parser
->scope
)
14892 && !(parser
->in_declarator_p
14893 && currently_open_class (parser
->scope
))
14894 && dependent_type_p (parser
->scope
));
14895 if ((check_dependency
|| !CLASS_TYPE_P (parser
->scope
))
14902 /* The resolution to Core Issue 180 says that `struct
14903 A::B' should be considered a type-name, even if `A'
14905 type
= make_typename_type (parser
->scope
, name
, tag_type
,
14906 /*complain=*/tf_error
);
14907 decl
= TYPE_NAME (type
);
14909 else if (is_template
14910 && (cp_parser_next_token_ends_template_argument_p (parser
)
14911 || cp_lexer_next_token_is (parser
->lexer
,
14913 decl
= make_unbound_class_template (parser
->scope
,
14915 /*complain=*/tf_error
);
14917 decl
= build_qualified_name (/*type=*/NULL_TREE
,
14918 parser
->scope
, name
,
14923 tree pushed_scope
= NULL_TREE
;
14925 /* If PARSER->SCOPE is a dependent type, then it must be a
14926 class type, and we must not be checking dependencies;
14927 otherwise, we would have processed this lookup above. So
14928 that PARSER->SCOPE is not considered a dependent base by
14929 lookup_member, we must enter the scope here. */
14931 pushed_scope
= push_scope (parser
->scope
);
14932 /* If the PARSER->SCOPE is a template specialization, it
14933 may be instantiated during name lookup. In that case,
14934 errors may be issued. Even if we rollback the current
14935 tentative parse, those errors are valid. */
14936 decl
= lookup_qualified_name (parser
->scope
, name
,
14937 tag_type
!= none_type
,
14938 /*complain=*/true);
14940 pop_scope (pushed_scope
);
14942 parser
->qualifying_scope
= parser
->scope
;
14943 parser
->object_scope
= NULL_TREE
;
14945 else if (object_type
)
14947 tree object_decl
= NULL_TREE
;
14948 /* Look up the name in the scope of the OBJECT_TYPE, unless the
14949 OBJECT_TYPE is not a class. */
14950 if (CLASS_TYPE_P (object_type
))
14951 /* If the OBJECT_TYPE is a template specialization, it may
14952 be instantiated during name lookup. In that case, errors
14953 may be issued. Even if we rollback the current tentative
14954 parse, those errors are valid. */
14955 object_decl
= lookup_member (object_type
,
14958 tag_type
!= none_type
);
14959 /* Look it up in the enclosing context, too. */
14960 decl
= lookup_name_real (name
, tag_type
!= none_type
,
14962 /*block_p=*/true, is_namespace
, flags
);
14963 parser
->object_scope
= object_type
;
14964 parser
->qualifying_scope
= NULL_TREE
;
14966 decl
= object_decl
;
14970 decl
= lookup_name_real (name
, tag_type
!= none_type
,
14972 /*block_p=*/true, is_namespace
, flags
);
14973 parser
->qualifying_scope
= NULL_TREE
;
14974 parser
->object_scope
= NULL_TREE
;
14977 /* If the lookup failed, let our caller know. */
14978 if (!decl
|| decl
== error_mark_node
)
14979 return error_mark_node
;
14981 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
14982 if (TREE_CODE (decl
) == TREE_LIST
)
14984 if (ambiguous_decls
)
14985 *ambiguous_decls
= decl
;
14986 /* The error message we have to print is too complicated for
14987 cp_parser_error, so we incorporate its actions directly. */
14988 if (!cp_parser_simulate_error (parser
))
14990 error ("reference to %qD is ambiguous", name
);
14991 print_candidates (decl
);
14993 return error_mark_node
;
14996 gcc_assert (DECL_P (decl
)
14997 || TREE_CODE (decl
) == OVERLOAD
14998 || TREE_CODE (decl
) == SCOPE_REF
14999 || TREE_CODE (decl
) == UNBOUND_CLASS_TEMPLATE
15000 || BASELINK_P (decl
));
15002 /* If we have resolved the name of a member declaration, check to
15003 see if the declaration is accessible. When the name resolves to
15004 set of overloaded functions, accessibility is checked when
15005 overload resolution is done.
15007 During an explicit instantiation, access is not checked at all,
15008 as per [temp.explicit]. */
15010 check_accessibility_of_qualified_id (decl
, object_type
, parser
->scope
);
15015 /* Like cp_parser_lookup_name, but for use in the typical case where
15016 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
15017 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
15020 cp_parser_lookup_name_simple (cp_parser
* parser
, tree name
)
15022 return cp_parser_lookup_name (parser
, name
,
15024 /*is_template=*/false,
15025 /*is_namespace=*/false,
15026 /*check_dependency=*/true,
15027 /*ambiguous_decls=*/NULL
);
15030 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
15031 the current context, return the TYPE_DECL. If TAG_NAME_P is
15032 true, the DECL indicates the class being defined in a class-head,
15033 or declared in an elaborated-type-specifier.
15035 Otherwise, return DECL. */
15038 cp_parser_maybe_treat_template_as_class (tree decl
, bool tag_name_p
)
15040 /* If the TEMPLATE_DECL is being declared as part of a class-head,
15041 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
15044 template <typename T> struct B;
15047 template <typename T> struct A::B {};
15049 Similarly, in an elaborated-type-specifier:
15051 namespace N { struct X{}; }
15054 template <typename T> friend struct N::X;
15057 However, if the DECL refers to a class type, and we are in
15058 the scope of the class, then the name lookup automatically
15059 finds the TYPE_DECL created by build_self_reference rather
15060 than a TEMPLATE_DECL. For example, in:
15062 template <class T> struct S {
15066 there is no need to handle such case. */
15068 if (DECL_CLASS_TEMPLATE_P (decl
) && tag_name_p
)
15069 return DECL_TEMPLATE_RESULT (decl
);
15074 /* If too many, or too few, template-parameter lists apply to the
15075 declarator, issue an error message. Returns TRUE if all went well,
15076 and FALSE otherwise. */
15079 cp_parser_check_declarator_template_parameters (cp_parser
* parser
,
15080 cp_declarator
*declarator
)
15082 unsigned num_templates
;
15084 /* We haven't seen any classes that involve template parameters yet. */
15087 switch (declarator
->kind
)
15090 if (declarator
->u
.id
.qualifying_scope
)
15095 scope
= declarator
->u
.id
.qualifying_scope
;
15096 member
= declarator
->u
.id
.unqualified_name
;
15098 while (scope
&& CLASS_TYPE_P (scope
))
15100 /* You're supposed to have one `template <...>'
15101 for every template class, but you don't need one
15102 for a full specialization. For example:
15104 template <class T> struct S{};
15105 template <> struct S<int> { void f(); };
15106 void S<int>::f () {}
15108 is correct; there shouldn't be a `template <>' for
15109 the definition of `S<int>::f'. */
15110 if (CLASSTYPE_TEMPLATE_INFO (scope
)
15111 && (CLASSTYPE_TEMPLATE_INSTANTIATION (scope
)
15112 || uses_template_parms (CLASSTYPE_TI_ARGS (scope
)))
15113 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (scope
)))
15116 scope
= TYPE_CONTEXT (scope
);
15119 else if (TREE_CODE (declarator
->u
.id
.unqualified_name
)
15120 == TEMPLATE_ID_EXPR
)
15121 /* If the DECLARATOR has the form `X<y>' then it uses one
15122 additional level of template parameters. */
15125 return cp_parser_check_template_parameters (parser
,
15131 case cdk_reference
:
15133 return (cp_parser_check_declarator_template_parameters
15134 (parser
, declarator
->declarator
));
15140 gcc_unreachable ();
15145 /* NUM_TEMPLATES were used in the current declaration. If that is
15146 invalid, return FALSE and issue an error messages. Otherwise,
15150 cp_parser_check_template_parameters (cp_parser
* parser
,
15151 unsigned num_templates
)
15153 /* If there are more template classes than parameter lists, we have
15156 template <class T> void S<T>::R<T>::f (); */
15157 if (parser
->num_template_parameter_lists
< num_templates
)
15159 error ("too few template-parameter-lists");
15162 /* If there are the same number of template classes and parameter
15163 lists, that's OK. */
15164 if (parser
->num_template_parameter_lists
== num_templates
)
15166 /* If there are more, but only one more, then we are referring to a
15167 member template. That's OK too. */
15168 if (parser
->num_template_parameter_lists
== num_templates
+ 1)
15170 /* Otherwise, there are too many template parameter lists. We have
15173 template <class T> template <class U> void S::f(); */
15174 error ("too many template-parameter-lists");
15178 /* Parse an optional `::' token indicating that the following name is
15179 from the global namespace. If so, PARSER->SCOPE is set to the
15180 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
15181 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
15182 Returns the new value of PARSER->SCOPE, if the `::' token is
15183 present, and NULL_TREE otherwise. */
15186 cp_parser_global_scope_opt (cp_parser
* parser
, bool current_scope_valid_p
)
15190 /* Peek at the next token. */
15191 token
= cp_lexer_peek_token (parser
->lexer
);
15192 /* If we're looking at a `::' token then we're starting from the
15193 global namespace, not our current location. */
15194 if (token
->type
== CPP_SCOPE
)
15196 /* Consume the `::' token. */
15197 cp_lexer_consume_token (parser
->lexer
);
15198 /* Set the SCOPE so that we know where to start the lookup. */
15199 parser
->scope
= global_namespace
;
15200 parser
->qualifying_scope
= global_namespace
;
15201 parser
->object_scope
= NULL_TREE
;
15203 return parser
->scope
;
15205 else if (!current_scope_valid_p
)
15207 parser
->scope
= NULL_TREE
;
15208 parser
->qualifying_scope
= NULL_TREE
;
15209 parser
->object_scope
= NULL_TREE
;
15215 /* Returns TRUE if the upcoming token sequence is the start of a
15216 constructor declarator. If FRIEND_P is true, the declarator is
15217 preceded by the `friend' specifier. */
15220 cp_parser_constructor_declarator_p (cp_parser
*parser
, bool friend_p
)
15222 bool constructor_p
;
15223 tree type_decl
= NULL_TREE
;
15224 bool nested_name_p
;
15225 cp_token
*next_token
;
15227 /* The common case is that this is not a constructor declarator, so
15228 try to avoid doing lots of work if at all possible. It's not
15229 valid declare a constructor at function scope. */
15230 if (at_function_scope_p ())
15232 /* And only certain tokens can begin a constructor declarator. */
15233 next_token
= cp_lexer_peek_token (parser
->lexer
);
15234 if (next_token
->type
!= CPP_NAME
15235 && next_token
->type
!= CPP_SCOPE
15236 && next_token
->type
!= CPP_NESTED_NAME_SPECIFIER
15237 && next_token
->type
!= CPP_TEMPLATE_ID
)
15240 /* Parse tentatively; we are going to roll back all of the tokens
15242 cp_parser_parse_tentatively (parser
);
15243 /* Assume that we are looking at a constructor declarator. */
15244 constructor_p
= true;
15246 /* Look for the optional `::' operator. */
15247 cp_parser_global_scope_opt (parser
,
15248 /*current_scope_valid_p=*/false);
15249 /* Look for the nested-name-specifier. */
15251 = (cp_parser_nested_name_specifier_opt (parser
,
15252 /*typename_keyword_p=*/false,
15253 /*check_dependency_p=*/false,
15255 /*is_declaration=*/false)
15257 /* Outside of a class-specifier, there must be a
15258 nested-name-specifier. */
15259 if (!nested_name_p
&&
15260 (!at_class_scope_p () || !TYPE_BEING_DEFINED (current_class_type
)
15262 constructor_p
= false;
15263 /* If we still think that this might be a constructor-declarator,
15264 look for a class-name. */
15269 template <typename T> struct S { S(); };
15270 template <typename T> S<T>::S ();
15272 we must recognize that the nested `S' names a class.
15275 template <typename T> S<T>::S<T> ();
15277 we must recognize that the nested `S' names a template. */
15278 type_decl
= cp_parser_class_name (parser
,
15279 /*typename_keyword_p=*/false,
15280 /*template_keyword_p=*/false,
15282 /*check_dependency_p=*/false,
15283 /*class_head_p=*/false,
15284 /*is_declaration=*/false);
15285 /* If there was no class-name, then this is not a constructor. */
15286 constructor_p
= !cp_parser_error_occurred (parser
);
15289 /* If we're still considering a constructor, we have to see a `(',
15290 to begin the parameter-declaration-clause, followed by either a
15291 `)', an `...', or a decl-specifier. We need to check for a
15292 type-specifier to avoid being fooled into thinking that:
15296 is a constructor. (It is actually a function named `f' that
15297 takes one parameter (of type `int') and returns a value of type
15300 && cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('"))
15302 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
)
15303 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_ELLIPSIS
)
15304 /* A parameter declaration begins with a decl-specifier,
15305 which is either the "attribute" keyword, a storage class
15306 specifier, or (usually) a type-specifier. */
15307 && !cp_lexer_next_token_is_keyword (parser
->lexer
, RID_ATTRIBUTE
)
15308 && !cp_parser_storage_class_specifier_opt (parser
))
15311 tree pushed_scope
= NULL_TREE
;
15312 unsigned saved_num_template_parameter_lists
;
15314 /* Names appearing in the type-specifier should be looked up
15315 in the scope of the class. */
15316 if (current_class_type
)
15320 type
= TREE_TYPE (type_decl
);
15321 if (TREE_CODE (type
) == TYPENAME_TYPE
)
15323 type
= resolve_typename_type (type
,
15324 /*only_current_p=*/false);
15325 if (type
== error_mark_node
)
15327 cp_parser_abort_tentative_parse (parser
);
15331 pushed_scope
= push_scope (type
);
15334 /* Inside the constructor parameter list, surrounding
15335 template-parameter-lists do not apply. */
15336 saved_num_template_parameter_lists
15337 = parser
->num_template_parameter_lists
;
15338 parser
->num_template_parameter_lists
= 0;
15340 /* Look for the type-specifier. */
15341 cp_parser_type_specifier (parser
,
15342 CP_PARSER_FLAGS_NONE
,
15343 /*decl_specs=*/NULL
,
15344 /*is_declarator=*/true,
15345 /*declares_class_or_enum=*/NULL
,
15346 /*is_cv_qualifier=*/NULL
);
15348 parser
->num_template_parameter_lists
15349 = saved_num_template_parameter_lists
;
15351 /* Leave the scope of the class. */
15353 pop_scope (pushed_scope
);
15355 constructor_p
= !cp_parser_error_occurred (parser
);
15359 constructor_p
= false;
15360 /* We did not really want to consume any tokens. */
15361 cp_parser_abort_tentative_parse (parser
);
15363 return constructor_p
;
15366 /* Parse the definition of the function given by the DECL_SPECIFIERS,
15367 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
15368 they must be performed once we are in the scope of the function.
15370 Returns the function defined. */
15373 cp_parser_function_definition_from_specifiers_and_declarator
15374 (cp_parser
* parser
,
15375 cp_decl_specifier_seq
*decl_specifiers
,
15377 const cp_declarator
*declarator
)
15382 /* Begin the function-definition. */
15383 success_p
= start_function (decl_specifiers
, declarator
, attributes
);
15385 /* The things we're about to see are not directly qualified by any
15386 template headers we've seen thus far. */
15387 reset_specialization ();
15389 /* If there were names looked up in the decl-specifier-seq that we
15390 did not check, check them now. We must wait until we are in the
15391 scope of the function to perform the checks, since the function
15392 might be a friend. */
15393 perform_deferred_access_checks ();
15397 /* Skip the entire function. */
15398 cp_parser_skip_to_end_of_block_or_statement (parser
);
15399 fn
= error_mark_node
;
15402 fn
= cp_parser_function_definition_after_declarator (parser
,
15403 /*inline_p=*/false);
15408 /* Parse the part of a function-definition that follows the
15409 declarator. INLINE_P is TRUE iff this function is an inline
15410 function defined with a class-specifier.
15412 Returns the function defined. */
15415 cp_parser_function_definition_after_declarator (cp_parser
* parser
,
15419 bool ctor_initializer_p
= false;
15420 bool saved_in_unbraced_linkage_specification_p
;
15421 unsigned saved_num_template_parameter_lists
;
15423 /* If the next token is `return', then the code may be trying to
15424 make use of the "named return value" extension that G++ used to
15426 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_RETURN
))
15428 /* Consume the `return' keyword. */
15429 cp_lexer_consume_token (parser
->lexer
);
15430 /* Look for the identifier that indicates what value is to be
15432 cp_parser_identifier (parser
);
15433 /* Issue an error message. */
15434 error ("named return values are no longer supported");
15435 /* Skip tokens until we reach the start of the function body. */
15438 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
15439 if (token
->type
== CPP_OPEN_BRACE
15440 || token
->type
== CPP_EOF
15441 || token
->type
== CPP_PRAGMA_EOL
)
15443 cp_lexer_consume_token (parser
->lexer
);
15446 /* The `extern' in `extern "C" void f () { ... }' does not apply to
15447 anything declared inside `f'. */
15448 saved_in_unbraced_linkage_specification_p
15449 = parser
->in_unbraced_linkage_specification_p
;
15450 parser
->in_unbraced_linkage_specification_p
= false;
15451 /* Inside the function, surrounding template-parameter-lists do not
15453 saved_num_template_parameter_lists
15454 = parser
->num_template_parameter_lists
;
15455 parser
->num_template_parameter_lists
= 0;
15456 /* If the next token is `try', then we are looking at a
15457 function-try-block. */
15458 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TRY
))
15459 ctor_initializer_p
= cp_parser_function_try_block (parser
);
15460 /* A function-try-block includes the function-body, so we only do
15461 this next part if we're not processing a function-try-block. */
15464 = cp_parser_ctor_initializer_opt_and_function_body (parser
);
15466 /* Finish the function. */
15467 fn
= finish_function ((ctor_initializer_p
? 1 : 0) |
15468 (inline_p
? 2 : 0));
15469 /* Generate code for it, if necessary. */
15470 expand_or_defer_fn (fn
);
15471 /* Restore the saved values. */
15472 parser
->in_unbraced_linkage_specification_p
15473 = saved_in_unbraced_linkage_specification_p
;
15474 parser
->num_template_parameter_lists
15475 = saved_num_template_parameter_lists
;
15480 /* Parse a template-declaration, assuming that the `export' (and
15481 `extern') keywords, if present, has already been scanned. MEMBER_P
15482 is as for cp_parser_template_declaration. */
15485 cp_parser_template_declaration_after_export (cp_parser
* parser
, bool member_p
)
15487 tree decl
= NULL_TREE
;
15489 tree parameter_list
;
15490 bool friend_p
= false;
15491 bool need_lang_pop
;
15493 /* Look for the `template' keyword. */
15494 if (!cp_parser_require_keyword (parser
, RID_TEMPLATE
, "`template'"))
15498 if (!cp_parser_require (parser
, CPP_LESS
, "`<'"))
15502 A template ... shall not have C linkage. */
15503 if (current_lang_name
== lang_name_c
)
15505 error ("template with C linkage");
15506 /* Give it C++ linkage to avoid confusing other parts of the
15508 push_lang_context (lang_name_cplusplus
);
15509 need_lang_pop
= true;
15512 need_lang_pop
= false;
15514 /* We cannot perform access checks on the template parameter
15515 declarations until we know what is being declared, just as we
15516 cannot check the decl-specifier list. */
15517 push_deferring_access_checks (dk_deferred
);
15519 /* If the next token is `>', then we have an invalid
15520 specialization. Rather than complain about an invalid template
15521 parameter, issue an error message here. */
15522 if (cp_lexer_next_token_is (parser
->lexer
, CPP_GREATER
))
15524 cp_parser_error (parser
, "invalid explicit specialization");
15525 begin_specialization ();
15526 parameter_list
= NULL_TREE
;
15529 /* Parse the template parameters. */
15530 parameter_list
= cp_parser_template_parameter_list (parser
);
15532 /* Get the deferred access checks from the parameter list. These
15533 will be checked once we know what is being declared, as for a
15534 member template the checks must be performed in the scope of the
15535 class containing the member. */
15536 checks
= get_deferred_access_checks ();
15538 /* Look for the `>'. */
15539 cp_parser_skip_to_end_of_template_parameter_list (parser
);
15540 /* We just processed one more parameter list. */
15541 ++parser
->num_template_parameter_lists
;
15542 /* If the next token is `template', there are more template
15544 if (cp_lexer_next_token_is_keyword (parser
->lexer
,
15546 cp_parser_template_declaration_after_export (parser
, member_p
);
15549 /* There are no access checks when parsing a template, as we do not
15550 know if a specialization will be a friend. */
15551 push_deferring_access_checks (dk_no_check
);
15552 decl
= cp_parser_single_declaration (parser
,
15556 pop_deferring_access_checks ();
15558 /* If this is a member template declaration, let the front
15560 if (member_p
&& !friend_p
&& decl
)
15562 if (TREE_CODE (decl
) == TYPE_DECL
)
15563 cp_parser_check_access_in_redeclaration (decl
);
15565 decl
= finish_member_template_decl (decl
);
15567 else if (friend_p
&& decl
&& TREE_CODE (decl
) == TYPE_DECL
)
15568 make_friend_class (current_class_type
, TREE_TYPE (decl
),
15569 /*complain=*/true);
15571 /* We are done with the current parameter list. */
15572 --parser
->num_template_parameter_lists
;
15574 pop_deferring_access_checks ();
15577 finish_template_decl (parameter_list
);
15579 /* Register member declarations. */
15580 if (member_p
&& !friend_p
&& decl
&& !DECL_CLASS_TEMPLATE_P (decl
))
15581 finish_member_declaration (decl
);
15582 /* For the erroneous case of a template with C linkage, we pushed an
15583 implicit C++ linkage scope; exit that scope now. */
15585 pop_lang_context ();
15586 /* If DECL is a function template, we must return to parse it later.
15587 (Even though there is no definition, there might be default
15588 arguments that need handling.) */
15589 if (member_p
&& decl
15590 && (TREE_CODE (decl
) == FUNCTION_DECL
15591 || DECL_FUNCTION_TEMPLATE_P (decl
)))
15592 TREE_VALUE (parser
->unparsed_functions_queues
)
15593 = tree_cons (NULL_TREE
, decl
,
15594 TREE_VALUE (parser
->unparsed_functions_queues
));
15597 /* Perform the deferred access checks from a template-parameter-list.
15598 CHECKS is a TREE_LIST of access checks, as returned by
15599 get_deferred_access_checks. */
15602 cp_parser_perform_template_parameter_access_checks (tree checks
)
15604 ++processing_template_parmlist
;
15605 perform_access_checks (checks
);
15606 --processing_template_parmlist
;
15609 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
15610 `function-definition' sequence. MEMBER_P is true, this declaration
15611 appears in a class scope.
15613 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
15614 *FRIEND_P is set to TRUE iff the declaration is a friend. */
15617 cp_parser_single_declaration (cp_parser
* parser
,
15622 int declares_class_or_enum
;
15623 tree decl
= NULL_TREE
;
15624 cp_decl_specifier_seq decl_specifiers
;
15625 bool function_definition_p
= false;
15627 /* This function is only used when processing a template
15629 gcc_assert (innermost_scope_kind () == sk_template_parms
15630 || innermost_scope_kind () == sk_template_spec
);
15632 /* Defer access checks until we know what is being declared. */
15633 push_deferring_access_checks (dk_deferred
);
15635 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
15637 cp_parser_decl_specifier_seq (parser
,
15638 CP_PARSER_FLAGS_OPTIONAL
,
15640 &declares_class_or_enum
);
15642 *friend_p
= cp_parser_friend_p (&decl_specifiers
);
15644 /* There are no template typedefs. */
15645 if (decl_specifiers
.specs
[(int) ds_typedef
])
15647 error ("template declaration of %qs", "typedef");
15648 decl
= error_mark_node
;
15651 /* Gather up the access checks that occurred the
15652 decl-specifier-seq. */
15653 stop_deferring_access_checks ();
15655 /* Check for the declaration of a template class. */
15656 if (declares_class_or_enum
)
15658 if (cp_parser_declares_only_class_p (parser
))
15660 decl
= shadow_tag (&decl_specifiers
);
15665 friend template <typename T> struct A<T>::B;
15668 A<T>::B will be represented by a TYPENAME_TYPE, and
15669 therefore not recognized by shadow_tag. */
15670 if (friend_p
&& *friend_p
15672 && decl_specifiers
.type
15673 && TYPE_P (decl_specifiers
.type
))
15674 decl
= decl_specifiers
.type
;
15676 if (decl
&& decl
!= error_mark_node
)
15677 decl
= TYPE_NAME (decl
);
15679 decl
= error_mark_node
;
15681 /* Perform access checks for template parameters. */
15682 cp_parser_perform_template_parameter_access_checks (checks
);
15685 /* If it's not a template class, try for a template function. If
15686 the next token is a `;', then this declaration does not declare
15687 anything. But, if there were errors in the decl-specifiers, then
15688 the error might well have come from an attempted class-specifier.
15689 In that case, there's no need to warn about a missing declarator. */
15691 && (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
)
15692 || decl_specifiers
.type
!= error_mark_node
))
15693 decl
= cp_parser_init_declarator (parser
,
15696 /*function_definition_allowed_p=*/true,
15698 declares_class_or_enum
,
15699 &function_definition_p
);
15701 pop_deferring_access_checks ();
15703 /* Clear any current qualification; whatever comes next is the start
15704 of something new. */
15705 parser
->scope
= NULL_TREE
;
15706 parser
->qualifying_scope
= NULL_TREE
;
15707 parser
->object_scope
= NULL_TREE
;
15708 /* Look for a trailing `;' after the declaration. */
15709 if (!function_definition_p
15710 && (decl
== error_mark_node
15711 || !cp_parser_require (parser
, CPP_SEMICOLON
, "`;'")))
15712 cp_parser_skip_to_end_of_block_or_statement (parser
);
15717 /* Parse a cast-expression that is not the operand of a unary "&". */
15720 cp_parser_simple_cast_expression (cp_parser
*parser
)
15722 return cp_parser_cast_expression (parser
, /*address_p=*/false,
15726 /* Parse a functional cast to TYPE. Returns an expression
15727 representing the cast. */
15730 cp_parser_functional_cast (cp_parser
* parser
, tree type
)
15732 tree expression_list
;
15736 = cp_parser_parenthesized_expression_list (parser
, false,
15738 /*non_constant_p=*/NULL
);
15740 cast
= build_functional_cast (type
, expression_list
);
15741 /* [expr.const]/1: In an integral constant expression "only type
15742 conversions to integral or enumeration type can be used". */
15743 if (TREE_CODE (type
) == TYPE_DECL
)
15744 type
= TREE_TYPE (type
);
15745 if (cast
!= error_mark_node
15746 && !cast_valid_in_integral_constant_expression_p (type
)
15747 && (cp_parser_non_integral_constant_expression
15748 (parser
, "a call to a constructor")))
15749 return error_mark_node
;
15753 /* Save the tokens that make up the body of a member function defined
15754 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
15755 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
15756 specifiers applied to the declaration. Returns the FUNCTION_DECL
15757 for the member function. */
15760 cp_parser_save_member_function_body (cp_parser
* parser
,
15761 cp_decl_specifier_seq
*decl_specifiers
,
15762 cp_declarator
*declarator
,
15769 /* Create the function-declaration. */
15770 fn
= start_method (decl_specifiers
, declarator
, attributes
);
15771 /* If something went badly wrong, bail out now. */
15772 if (fn
== error_mark_node
)
15774 /* If there's a function-body, skip it. */
15775 if (cp_parser_token_starts_function_definition_p
15776 (cp_lexer_peek_token (parser
->lexer
)))
15777 cp_parser_skip_to_end_of_block_or_statement (parser
);
15778 return error_mark_node
;
15781 /* Remember it, if there default args to post process. */
15782 cp_parser_save_default_args (parser
, fn
);
15784 /* Save away the tokens that make up the body of the
15786 first
= parser
->lexer
->next_token
;
15787 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, /*depth=*/0);
15788 /* Handle function try blocks. */
15789 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_CATCH
))
15790 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, /*depth=*/0);
15791 last
= parser
->lexer
->next_token
;
15793 /* Save away the inline definition; we will process it when the
15794 class is complete. */
15795 DECL_PENDING_INLINE_INFO (fn
) = cp_token_cache_new (first
, last
);
15796 DECL_PENDING_INLINE_P (fn
) = 1;
15798 /* We need to know that this was defined in the class, so that
15799 friend templates are handled correctly. */
15800 DECL_INITIALIZED_IN_CLASS_P (fn
) = 1;
15802 /* We're done with the inline definition. */
15803 finish_method (fn
);
15805 /* Add FN to the queue of functions to be parsed later. */
15806 TREE_VALUE (parser
->unparsed_functions_queues
)
15807 = tree_cons (NULL_TREE
, fn
,
15808 TREE_VALUE (parser
->unparsed_functions_queues
));
15813 /* Parse a template-argument-list, as well as the trailing ">" (but
15814 not the opening ">"). See cp_parser_template_argument_list for the
15818 cp_parser_enclosed_template_argument_list (cp_parser
* parser
)
15822 tree saved_qualifying_scope
;
15823 tree saved_object_scope
;
15824 bool saved_greater_than_is_operator_p
;
15825 bool saved_skip_evaluation
;
15829 When parsing a template-id, the first non-nested `>' is taken as
15830 the end of the template-argument-list rather than a greater-than
15832 saved_greater_than_is_operator_p
15833 = parser
->greater_than_is_operator_p
;
15834 parser
->greater_than_is_operator_p
= false;
15835 /* Parsing the argument list may modify SCOPE, so we save it
15837 saved_scope
= parser
->scope
;
15838 saved_qualifying_scope
= parser
->qualifying_scope
;
15839 saved_object_scope
= parser
->object_scope
;
15840 /* We need to evaluate the template arguments, even though this
15841 template-id may be nested within a "sizeof". */
15842 saved_skip_evaluation
= skip_evaluation
;
15843 skip_evaluation
= false;
15844 /* Parse the template-argument-list itself. */
15845 if (cp_lexer_next_token_is (parser
->lexer
, CPP_GREATER
))
15846 arguments
= NULL_TREE
;
15848 arguments
= cp_parser_template_argument_list (parser
);
15849 /* Look for the `>' that ends the template-argument-list. If we find
15850 a '>>' instead, it's probably just a typo. */
15851 if (cp_lexer_next_token_is (parser
->lexer
, CPP_RSHIFT
))
15853 if (!saved_greater_than_is_operator_p
)
15855 /* If we're in a nested template argument list, the '>>' has
15856 to be a typo for '> >'. We emit the error message, but we
15857 continue parsing and we push a '>' as next token, so that
15858 the argument list will be parsed correctly. Note that the
15859 global source location is still on the token before the
15860 '>>', so we need to say explicitly where we want it. */
15861 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
15862 error ("%H%<>>%> should be %<> >%> "
15863 "within a nested template argument list",
15866 /* ??? Proper recovery should terminate two levels of
15867 template argument list here. */
15868 token
->type
= CPP_GREATER
;
15872 /* If this is not a nested template argument list, the '>>'
15873 is a typo for '>'. Emit an error message and continue.
15874 Same deal about the token location, but here we can get it
15875 right by consuming the '>>' before issuing the diagnostic. */
15876 cp_lexer_consume_token (parser
->lexer
);
15877 error ("spurious %<>>%>, use %<>%> to terminate "
15878 "a template argument list");
15882 cp_parser_skip_to_end_of_template_parameter_list (parser
);
15883 /* The `>' token might be a greater-than operator again now. */
15884 parser
->greater_than_is_operator_p
15885 = saved_greater_than_is_operator_p
;
15886 /* Restore the SAVED_SCOPE. */
15887 parser
->scope
= saved_scope
;
15888 parser
->qualifying_scope
= saved_qualifying_scope
;
15889 parser
->object_scope
= saved_object_scope
;
15890 skip_evaluation
= saved_skip_evaluation
;
15895 /* MEMBER_FUNCTION is a member function, or a friend. If default
15896 arguments, or the body of the function have not yet been parsed,
15900 cp_parser_late_parsing_for_member (cp_parser
* parser
, tree member_function
)
15902 /* If this member is a template, get the underlying
15904 if (DECL_FUNCTION_TEMPLATE_P (member_function
))
15905 member_function
= DECL_TEMPLATE_RESULT (member_function
);
15907 /* There should not be any class definitions in progress at this
15908 point; the bodies of members are only parsed outside of all class
15910 gcc_assert (parser
->num_classes_being_defined
== 0);
15911 /* While we're parsing the member functions we might encounter more
15912 classes. We want to handle them right away, but we don't want
15913 them getting mixed up with functions that are currently in the
15915 parser
->unparsed_functions_queues
15916 = tree_cons (NULL_TREE
, NULL_TREE
, parser
->unparsed_functions_queues
);
15918 /* Make sure that any template parameters are in scope. */
15919 maybe_begin_member_template_processing (member_function
);
15921 /* If the body of the function has not yet been parsed, parse it
15923 if (DECL_PENDING_INLINE_P (member_function
))
15925 tree function_scope
;
15926 cp_token_cache
*tokens
;
15928 /* The function is no longer pending; we are processing it. */
15929 tokens
= DECL_PENDING_INLINE_INFO (member_function
);
15930 DECL_PENDING_INLINE_INFO (member_function
) = NULL
;
15931 DECL_PENDING_INLINE_P (member_function
) = 0;
15933 /* If this is a local class, enter the scope of the containing
15935 function_scope
= current_function_decl
;
15936 if (function_scope
)
15937 push_function_context_to (function_scope
);
15940 /* Push the body of the function onto the lexer stack. */
15941 cp_parser_push_lexer_for_tokens (parser
, tokens
);
15943 /* Let the front end know that we going to be defining this
15945 start_preparsed_function (member_function
, NULL_TREE
,
15946 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
15948 /* Don't do access checking if it is a templated function. */
15949 if (processing_template_decl
)
15950 push_deferring_access_checks (dk_no_check
);
15952 /* Now, parse the body of the function. */
15953 cp_parser_function_definition_after_declarator (parser
,
15954 /*inline_p=*/true);
15956 if (processing_template_decl
)
15957 pop_deferring_access_checks ();
15959 /* Leave the scope of the containing function. */
15960 if (function_scope
)
15961 pop_function_context_from (function_scope
);
15962 cp_parser_pop_lexer (parser
);
15965 /* Remove any template parameters from the symbol table. */
15966 maybe_end_member_template_processing ();
15968 /* Restore the queue. */
15969 parser
->unparsed_functions_queues
15970 = TREE_CHAIN (parser
->unparsed_functions_queues
);
15973 /* If DECL contains any default args, remember it on the unparsed
15974 functions queue. */
15977 cp_parser_save_default_args (cp_parser
* parser
, tree decl
)
15981 for (probe
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
15983 probe
= TREE_CHAIN (probe
))
15984 if (TREE_PURPOSE (probe
))
15986 TREE_PURPOSE (parser
->unparsed_functions_queues
)
15987 = tree_cons (current_class_type
, decl
,
15988 TREE_PURPOSE (parser
->unparsed_functions_queues
));
15993 /* FN is a FUNCTION_DECL which may contains a parameter with an
15994 unparsed DEFAULT_ARG. Parse the default args now. This function
15995 assumes that the current scope is the scope in which the default
15996 argument should be processed. */
15999 cp_parser_late_parsing_default_args (cp_parser
*parser
, tree fn
)
16001 bool saved_local_variables_forbidden_p
;
16004 /* While we're parsing the default args, we might (due to the
16005 statement expression extension) encounter more classes. We want
16006 to handle them right away, but we don't want them getting mixed
16007 up with default args that are currently in the queue. */
16008 parser
->unparsed_functions_queues
16009 = tree_cons (NULL_TREE
, NULL_TREE
, parser
->unparsed_functions_queues
);
16011 /* Local variable names (and the `this' keyword) may not appear
16012 in a default argument. */
16013 saved_local_variables_forbidden_p
= parser
->local_variables_forbidden_p
;
16014 parser
->local_variables_forbidden_p
= true;
16016 for (parm
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
16018 parm
= TREE_CHAIN (parm
))
16020 cp_token_cache
*tokens
;
16021 tree default_arg
= TREE_PURPOSE (parm
);
16023 VEC(tree
,gc
) *insts
;
16030 if (TREE_CODE (default_arg
) != DEFAULT_ARG
)
16031 /* This can happen for a friend declaration for a function
16032 already declared with default arguments. */
16035 /* Push the saved tokens for the default argument onto the parser's
16037 tokens
= DEFARG_TOKENS (default_arg
);
16038 cp_parser_push_lexer_for_tokens (parser
, tokens
);
16040 /* Parse the assignment-expression. */
16041 parsed_arg
= cp_parser_assignment_expression (parser
, /*cast_p=*/false);
16043 if (!processing_template_decl
)
16044 parsed_arg
= check_default_argument (TREE_VALUE (parm
), parsed_arg
);
16046 TREE_PURPOSE (parm
) = parsed_arg
;
16048 /* Update any instantiations we've already created. */
16049 for (insts
= DEFARG_INSTANTIATIONS (default_arg
), ix
= 0;
16050 VEC_iterate (tree
, insts
, ix
, copy
); ix
++)
16051 TREE_PURPOSE (copy
) = parsed_arg
;
16053 /* If the token stream has not been completely used up, then
16054 there was extra junk after the end of the default
16056 if (!cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
))
16057 cp_parser_error (parser
, "expected %<,%>");
16059 /* Revert to the main lexer. */
16060 cp_parser_pop_lexer (parser
);
16063 /* Make sure no default arg is missing. */
16064 check_default_args (fn
);
16066 /* Restore the state of local_variables_forbidden_p. */
16067 parser
->local_variables_forbidden_p
= saved_local_variables_forbidden_p
;
16069 /* Restore the queue. */
16070 parser
->unparsed_functions_queues
16071 = TREE_CHAIN (parser
->unparsed_functions_queues
);
16074 /* Parse the operand of `sizeof' (or a similar operator). Returns
16075 either a TYPE or an expression, depending on the form of the
16076 input. The KEYWORD indicates which kind of expression we have
16080 cp_parser_sizeof_operand (cp_parser
* parser
, enum rid keyword
)
16082 static const char *format
;
16083 tree expr
= NULL_TREE
;
16084 const char *saved_message
;
16085 bool saved_integral_constant_expression_p
;
16086 bool saved_non_integral_constant_expression_p
;
16088 /* Initialize FORMAT the first time we get here. */
16090 format
= "types may not be defined in '%s' expressions";
16092 /* Types cannot be defined in a `sizeof' expression. Save away the
16094 saved_message
= parser
->type_definition_forbidden_message
;
16095 /* And create the new one. */
16096 parser
->type_definition_forbidden_message
16097 = XNEWVEC (const char, strlen (format
)
16098 + strlen (IDENTIFIER_POINTER (ridpointers
[keyword
]))
16100 sprintf ((char *) parser
->type_definition_forbidden_message
,
16101 format
, IDENTIFIER_POINTER (ridpointers
[keyword
]));
16103 /* The restrictions on constant-expressions do not apply inside
16104 sizeof expressions. */
16105 saved_integral_constant_expression_p
16106 = parser
->integral_constant_expression_p
;
16107 saved_non_integral_constant_expression_p
16108 = parser
->non_integral_constant_expression_p
;
16109 parser
->integral_constant_expression_p
= false;
16111 /* Do not actually evaluate the expression. */
16113 /* If it's a `(', then we might be looking at the type-id
16115 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
16118 bool saved_in_type_id_in_expr_p
;
16120 /* We can't be sure yet whether we're looking at a type-id or an
16122 cp_parser_parse_tentatively (parser
);
16123 /* Consume the `('. */
16124 cp_lexer_consume_token (parser
->lexer
);
16125 /* Parse the type-id. */
16126 saved_in_type_id_in_expr_p
= parser
->in_type_id_in_expr_p
;
16127 parser
->in_type_id_in_expr_p
= true;
16128 type
= cp_parser_type_id (parser
);
16129 parser
->in_type_id_in_expr_p
= saved_in_type_id_in_expr_p
;
16130 /* Now, look for the trailing `)'. */
16131 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "%<)%>");
16132 /* If all went well, then we're done. */
16133 if (cp_parser_parse_definitely (parser
))
16135 cp_decl_specifier_seq decl_specs
;
16137 /* Build a trivial decl-specifier-seq. */
16138 clear_decl_specs (&decl_specs
);
16139 decl_specs
.type
= type
;
16141 /* Call grokdeclarator to figure out what type this is. */
16142 expr
= grokdeclarator (NULL
,
16146 /*attrlist=*/NULL
);
16150 /* If the type-id production did not work out, then we must be
16151 looking at the unary-expression production. */
16153 expr
= cp_parser_unary_expression (parser
, /*address_p=*/false,
16155 /* Go back to evaluating expressions. */
16158 /* Free the message we created. */
16159 free ((char *) parser
->type_definition_forbidden_message
);
16160 /* And restore the old one. */
16161 parser
->type_definition_forbidden_message
= saved_message
;
16162 parser
->integral_constant_expression_p
16163 = saved_integral_constant_expression_p
;
16164 parser
->non_integral_constant_expression_p
16165 = saved_non_integral_constant_expression_p
;
16170 /* If the current declaration has no declarator, return true. */
16173 cp_parser_declares_only_class_p (cp_parser
*parser
)
16175 /* If the next token is a `;' or a `,' then there is no
16177 return (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
)
16178 || cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
));
16181 /* Update the DECL_SPECS to reflect the storage class indicated by
16185 cp_parser_set_storage_class (cp_parser
*parser
,
16186 cp_decl_specifier_seq
*decl_specs
,
16189 cp_storage_class storage_class
;
16191 if (parser
->in_unbraced_linkage_specification_p
)
16193 error ("invalid use of %qD in linkage specification",
16194 ridpointers
[keyword
]);
16197 else if (decl_specs
->storage_class
!= sc_none
)
16199 decl_specs
->conflicting_specifiers_p
= true;
16203 if ((keyword
== RID_EXTERN
|| keyword
== RID_STATIC
)
16204 && decl_specs
->specs
[(int) ds_thread
])
16206 error ("%<__thread%> before %qD", ridpointers
[keyword
]);
16207 decl_specs
->specs
[(int) ds_thread
] = 0;
16213 storage_class
= sc_auto
;
16216 storage_class
= sc_register
;
16219 storage_class
= sc_static
;
16222 storage_class
= sc_extern
;
16225 storage_class
= sc_mutable
;
16228 gcc_unreachable ();
16230 decl_specs
->storage_class
= storage_class
;
16232 /* A storage class specifier cannot be applied alongside a typedef
16233 specifier. If there is a typedef specifier present then set
16234 conflicting_specifiers_p which will trigger an error later
16235 on in grokdeclarator. */
16236 if (decl_specs
->specs
[(int)ds_typedef
])
16237 decl_specs
->conflicting_specifiers_p
= true;
16240 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If USER_DEFINED_P
16241 is true, the type is a user-defined type; otherwise it is a
16242 built-in type specified by a keyword. */
16245 cp_parser_set_decl_spec_type (cp_decl_specifier_seq
*decl_specs
,
16247 bool user_defined_p
)
16249 decl_specs
->any_specifiers_p
= true;
16251 /* If the user tries to redeclare bool or wchar_t (with, for
16252 example, in "typedef int wchar_t;") we remember that this is what
16253 happened. In system headers, we ignore these declarations so
16254 that G++ can work with system headers that are not C++-safe. */
16255 if (decl_specs
->specs
[(int) ds_typedef
]
16257 && (type_spec
== boolean_type_node
16258 || type_spec
== wchar_type_node
)
16259 && (decl_specs
->type
16260 || decl_specs
->specs
[(int) ds_long
]
16261 || decl_specs
->specs
[(int) ds_short
]
16262 || decl_specs
->specs
[(int) ds_unsigned
]
16263 || decl_specs
->specs
[(int) ds_signed
]))
16265 decl_specs
->redefined_builtin_type
= type_spec
;
16266 if (!decl_specs
->type
)
16268 decl_specs
->type
= type_spec
;
16269 decl_specs
->user_defined_type_p
= false;
16272 else if (decl_specs
->type
)
16273 decl_specs
->multiple_types_p
= true;
16276 decl_specs
->type
= type_spec
;
16277 decl_specs
->user_defined_type_p
= user_defined_p
;
16278 decl_specs
->redefined_builtin_type
= NULL_TREE
;
16282 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
16283 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
16286 cp_parser_friend_p (const cp_decl_specifier_seq
*decl_specifiers
)
16288 return decl_specifiers
->specs
[(int) ds_friend
] != 0;
16291 /* If the next token is of the indicated TYPE, consume it. Otherwise,
16292 issue an error message indicating that TOKEN_DESC was expected.
16294 Returns the token consumed, if the token had the appropriate type.
16295 Otherwise, returns NULL. */
16298 cp_parser_require (cp_parser
* parser
,
16299 enum cpp_ttype type
,
16300 const char* token_desc
)
16302 if (cp_lexer_next_token_is (parser
->lexer
, type
))
16303 return cp_lexer_consume_token (parser
->lexer
);
16306 /* Output the MESSAGE -- unless we're parsing tentatively. */
16307 if (!cp_parser_simulate_error (parser
))
16309 char *message
= concat ("expected ", token_desc
, NULL
);
16310 cp_parser_error (parser
, message
);
16317 /* An error message is produced if the next token is not '>'.
16318 All further tokens are skipped until the desired token is
16319 found or '{', '}', ';' or an unbalanced ')' or ']'. */
16322 cp_parser_skip_to_end_of_template_parameter_list (cp_parser
* parser
)
16324 /* Current level of '< ... >'. */
16325 unsigned level
= 0;
16326 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
16327 unsigned nesting_depth
= 0;
16329 /* Are we ready, yet? If not, issue error message. */
16330 if (cp_parser_require (parser
, CPP_GREATER
, "%<>%>"))
16333 /* Skip tokens until the desired token is found. */
16336 /* Peek at the next token. */
16337 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
16340 if (!nesting_depth
)
16345 if (!nesting_depth
&& level
-- == 0)
16347 /* We've reached the token we want, consume it and stop. */
16348 cp_lexer_consume_token (parser
->lexer
);
16353 case CPP_OPEN_PAREN
:
16354 case CPP_OPEN_SQUARE
:
16358 case CPP_CLOSE_PAREN
:
16359 case CPP_CLOSE_SQUARE
:
16360 if (nesting_depth
-- == 0)
16365 case CPP_PRAGMA_EOL
:
16366 case CPP_SEMICOLON
:
16367 case CPP_OPEN_BRACE
:
16368 case CPP_CLOSE_BRACE
:
16369 /* The '>' was probably forgotten, don't look further. */
16376 /* Consume this token. */
16377 cp_lexer_consume_token (parser
->lexer
);
16381 /* If the next token is the indicated keyword, consume it. Otherwise,
16382 issue an error message indicating that TOKEN_DESC was expected.
16384 Returns the token consumed, if the token had the appropriate type.
16385 Otherwise, returns NULL. */
16388 cp_parser_require_keyword (cp_parser
* parser
,
16390 const char* token_desc
)
16392 cp_token
*token
= cp_parser_require (parser
, CPP_KEYWORD
, token_desc
);
16394 if (token
&& token
->keyword
!= keyword
)
16396 dyn_string_t error_msg
;
16398 /* Format the error message. */
16399 error_msg
= dyn_string_new (0);
16400 dyn_string_append_cstr (error_msg
, "expected ");
16401 dyn_string_append_cstr (error_msg
, token_desc
);
16402 cp_parser_error (parser
, error_msg
->s
);
16403 dyn_string_delete (error_msg
);
16410 /* Returns TRUE iff TOKEN is a token that can begin the body of a
16411 function-definition. */
16414 cp_parser_token_starts_function_definition_p (cp_token
* token
)
16416 return (/* An ordinary function-body begins with an `{'. */
16417 token
->type
== CPP_OPEN_BRACE
16418 /* A ctor-initializer begins with a `:'. */
16419 || token
->type
== CPP_COLON
16420 /* A function-try-block begins with `try'. */
16421 || token
->keyword
== RID_TRY
16422 /* The named return value extension begins with `return'. */
16423 || token
->keyword
== RID_RETURN
);
16426 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
16430 cp_parser_next_token_starts_class_definition_p (cp_parser
*parser
)
16434 token
= cp_lexer_peek_token (parser
->lexer
);
16435 return (token
->type
== CPP_OPEN_BRACE
|| token
->type
== CPP_COLON
);
16438 /* Returns TRUE iff the next token is the "," or ">" ending a
16439 template-argument. */
16442 cp_parser_next_token_ends_template_argument_p (cp_parser
*parser
)
16446 token
= cp_lexer_peek_token (parser
->lexer
);
16447 return (token
->type
== CPP_COMMA
|| token
->type
== CPP_GREATER
);
16450 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
16451 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
16454 cp_parser_nth_token_starts_template_argument_list_p (cp_parser
* parser
,
16459 token
= cp_lexer_peek_nth_token (parser
->lexer
, n
);
16460 if (token
->type
== CPP_LESS
)
16462 /* Check for the sequence `<::' in the original code. It would be lexed as
16463 `[:', where `[' is a digraph, and there is no whitespace before
16465 if (token
->type
== CPP_OPEN_SQUARE
&& token
->flags
& DIGRAPH
)
16468 token2
= cp_lexer_peek_nth_token (parser
->lexer
, n
+1);
16469 if (token2
->type
== CPP_COLON
&& !(token2
->flags
& PREV_WHITE
))
16475 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
16476 or none_type otherwise. */
16478 static enum tag_types
16479 cp_parser_token_is_class_key (cp_token
* token
)
16481 switch (token
->keyword
)
16486 return record_type
;
16495 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
16498 cp_parser_check_class_key (enum tag_types class_key
, tree type
)
16500 if ((TREE_CODE (type
) == UNION_TYPE
) != (class_key
== union_type
))
16501 pedwarn ("%qs tag used in naming %q#T",
16502 class_key
== union_type
? "union"
16503 : class_key
== record_type
? "struct" : "class",
16507 /* Issue an error message if DECL is redeclared with different
16508 access than its original declaration [class.access.spec/3].
16509 This applies to nested classes and nested class templates.
16513 cp_parser_check_access_in_redeclaration (tree decl
)
16515 if (!CLASS_TYPE_P (TREE_TYPE (decl
)))
16518 if ((TREE_PRIVATE (decl
)
16519 != (current_access_specifier
== access_private_node
))
16520 || (TREE_PROTECTED (decl
)
16521 != (current_access_specifier
== access_protected_node
)))
16522 error ("%qD redeclared with different access", decl
);
16525 /* Look for the `template' keyword, as a syntactic disambiguator.
16526 Return TRUE iff it is present, in which case it will be
16530 cp_parser_optional_template_keyword (cp_parser
*parser
)
16532 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_TEMPLATE
))
16534 /* The `template' keyword can only be used within templates;
16535 outside templates the parser can always figure out what is a
16536 template and what is not. */
16537 if (!processing_template_decl
)
16539 error ("%<template%> (as a disambiguator) is only allowed "
16540 "within templates");
16541 /* If this part of the token stream is rescanned, the same
16542 error message would be generated. So, we purge the token
16543 from the stream. */
16544 cp_lexer_purge_token (parser
->lexer
);
16549 /* Consume the `template' keyword. */
16550 cp_lexer_consume_token (parser
->lexer
);
16558 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
16559 set PARSER->SCOPE, and perform other related actions. */
16562 cp_parser_pre_parsed_nested_name_specifier (cp_parser
*parser
)
16567 /* Get the stored value. */
16568 value
= cp_lexer_consume_token (parser
->lexer
)->value
;
16569 /* Perform any access checks that were deferred. */
16570 for (check
= TREE_PURPOSE (value
); check
; check
= TREE_CHAIN (check
))
16571 perform_or_defer_access_check (TREE_PURPOSE (check
), TREE_VALUE (check
));
16572 /* Set the scope from the stored value. */
16573 parser
->scope
= TREE_VALUE (value
);
16574 parser
->qualifying_scope
= TREE_TYPE (value
);
16575 parser
->object_scope
= NULL_TREE
;
16578 /* Consume tokens up through a non-nested END token. */
16581 cp_parser_cache_group (cp_parser
*parser
,
16582 enum cpp_ttype end
,
16589 /* Abort a parenthesized expression if we encounter a brace. */
16590 if ((end
== CPP_CLOSE_PAREN
|| depth
== 0)
16591 && cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
16593 /* If we've reached the end of the file, stop. */
16594 if (cp_lexer_next_token_is (parser
->lexer
, CPP_EOF
)
16595 || (end
!= CPP_PRAGMA_EOL
16596 && cp_lexer_next_token_is (parser
->lexer
, CPP_PRAGMA_EOL
)))
16598 /* Consume the next token. */
16599 token
= cp_lexer_consume_token (parser
->lexer
);
16600 /* See if it starts a new group. */
16601 if (token
->type
== CPP_OPEN_BRACE
)
16603 cp_parser_cache_group (parser
, CPP_CLOSE_BRACE
, depth
+ 1);
16607 else if (token
->type
== CPP_OPEN_PAREN
)
16608 cp_parser_cache_group (parser
, CPP_CLOSE_PAREN
, depth
+ 1);
16609 else if (token
->type
== CPP_PRAGMA
)
16610 cp_parser_cache_group (parser
, CPP_PRAGMA_EOL
, depth
+ 1);
16611 else if (token
->type
== end
)
16616 /* Begin parsing tentatively. We always save tokens while parsing
16617 tentatively so that if the tentative parsing fails we can restore the
16621 cp_parser_parse_tentatively (cp_parser
* parser
)
16623 /* Enter a new parsing context. */
16624 parser
->context
= cp_parser_context_new (parser
->context
);
16625 /* Begin saving tokens. */
16626 cp_lexer_save_tokens (parser
->lexer
);
16627 /* In order to avoid repetitive access control error messages,
16628 access checks are queued up until we are no longer parsing
16630 push_deferring_access_checks (dk_deferred
);
16633 /* Commit to the currently active tentative parse. */
16636 cp_parser_commit_to_tentative_parse (cp_parser
* parser
)
16638 cp_parser_context
*context
;
16641 /* Mark all of the levels as committed. */
16642 lexer
= parser
->lexer
;
16643 for (context
= parser
->context
; context
->next
; context
= context
->next
)
16645 if (context
->status
== CP_PARSER_STATUS_KIND_COMMITTED
)
16647 context
->status
= CP_PARSER_STATUS_KIND_COMMITTED
;
16648 while (!cp_lexer_saving_tokens (lexer
))
16649 lexer
= lexer
->next
;
16650 cp_lexer_commit_tokens (lexer
);
16654 /* Abort the currently active tentative parse. All consumed tokens
16655 will be rolled back, and no diagnostics will be issued. */
16658 cp_parser_abort_tentative_parse (cp_parser
* parser
)
16660 cp_parser_simulate_error (parser
);
16661 /* Now, pretend that we want to see if the construct was
16662 successfully parsed. */
16663 cp_parser_parse_definitely (parser
);
16666 /* Stop parsing tentatively. If a parse error has occurred, restore the
16667 token stream. Otherwise, commit to the tokens we have consumed.
16668 Returns true if no error occurred; false otherwise. */
16671 cp_parser_parse_definitely (cp_parser
* parser
)
16673 bool error_occurred
;
16674 cp_parser_context
*context
;
16676 /* Remember whether or not an error occurred, since we are about to
16677 destroy that information. */
16678 error_occurred
= cp_parser_error_occurred (parser
);
16679 /* Remove the topmost context from the stack. */
16680 context
= parser
->context
;
16681 parser
->context
= context
->next
;
16682 /* If no parse errors occurred, commit to the tentative parse. */
16683 if (!error_occurred
)
16685 /* Commit to the tokens read tentatively, unless that was
16687 if (context
->status
!= CP_PARSER_STATUS_KIND_COMMITTED
)
16688 cp_lexer_commit_tokens (parser
->lexer
);
16690 pop_to_parent_deferring_access_checks ();
16692 /* Otherwise, if errors occurred, roll back our state so that things
16693 are just as they were before we began the tentative parse. */
16696 cp_lexer_rollback_tokens (parser
->lexer
);
16697 pop_deferring_access_checks ();
16699 /* Add the context to the front of the free list. */
16700 context
->next
= cp_parser_context_free_list
;
16701 cp_parser_context_free_list
= context
;
16703 return !error_occurred
;
16706 /* Returns true if we are parsing tentatively and are not committed to
16707 this tentative parse. */
16710 cp_parser_uncommitted_to_tentative_parse_p (cp_parser
* parser
)
16712 return (cp_parser_parsing_tentatively (parser
)
16713 && parser
->context
->status
!= CP_PARSER_STATUS_KIND_COMMITTED
);
16716 /* Returns nonzero iff an error has occurred during the most recent
16717 tentative parse. */
16720 cp_parser_error_occurred (cp_parser
* parser
)
16722 return (cp_parser_parsing_tentatively (parser
)
16723 && parser
->context
->status
== CP_PARSER_STATUS_KIND_ERROR
);
16726 /* Returns nonzero if GNU extensions are allowed. */
16729 cp_parser_allow_gnu_extensions_p (cp_parser
* parser
)
16731 return parser
->allow_gnu_extensions_p
;
16734 /* Objective-C++ Productions */
16737 /* Parse an Objective-C expression, which feeds into a primary-expression
16741 objc-message-expression
16742 objc-string-literal
16743 objc-encode-expression
16744 objc-protocol-expression
16745 objc-selector-expression
16747 Returns a tree representation of the expression. */
16750 cp_parser_objc_expression (cp_parser
* parser
)
16752 /* Try to figure out what kind of declaration is present. */
16753 cp_token
*kwd
= cp_lexer_peek_token (parser
->lexer
);
16757 case CPP_OPEN_SQUARE
:
16758 return cp_parser_objc_message_expression (parser
);
16760 case CPP_OBJC_STRING
:
16761 kwd
= cp_lexer_consume_token (parser
->lexer
);
16762 return objc_build_string_object (kwd
->value
);
16765 switch (kwd
->keyword
)
16767 case RID_AT_ENCODE
:
16768 return cp_parser_objc_encode_expression (parser
);
16770 case RID_AT_PROTOCOL
:
16771 return cp_parser_objc_protocol_expression (parser
);
16773 case RID_AT_SELECTOR
:
16774 return cp_parser_objc_selector_expression (parser
);
16780 error ("misplaced %<@%D%> Objective-C++ construct", kwd
->value
);
16781 cp_parser_skip_to_end_of_block_or_statement (parser
);
16784 return error_mark_node
;
16787 /* Parse an Objective-C message expression.
16789 objc-message-expression:
16790 [ objc-message-receiver objc-message-args ]
16792 Returns a representation of an Objective-C message. */
16795 cp_parser_objc_message_expression (cp_parser
* parser
)
16797 tree receiver
, messageargs
;
16799 cp_lexer_consume_token (parser
->lexer
); /* Eat '['. */
16800 receiver
= cp_parser_objc_message_receiver (parser
);
16801 messageargs
= cp_parser_objc_message_args (parser
);
16802 cp_parser_require (parser
, CPP_CLOSE_SQUARE
, "`]'");
16804 return objc_build_message_expr (build_tree_list (receiver
, messageargs
));
16807 /* Parse an objc-message-receiver.
16809 objc-message-receiver:
16811 simple-type-specifier
16813 Returns a representation of the type or expression. */
16816 cp_parser_objc_message_receiver (cp_parser
* parser
)
16820 /* An Objective-C message receiver may be either (1) a type
16821 or (2) an expression. */
16822 cp_parser_parse_tentatively (parser
);
16823 rcv
= cp_parser_expression (parser
, false);
16825 if (cp_parser_parse_definitely (parser
))
16828 rcv
= cp_parser_simple_type_specifier (parser
,
16829 /*decl_specs=*/NULL
,
16830 CP_PARSER_FLAGS_NONE
);
16832 return objc_get_class_reference (rcv
);
16835 /* Parse the arguments and selectors comprising an Objective-C message.
16840 objc-selector-args , objc-comma-args
16842 objc-selector-args:
16843 objc-selector [opt] : assignment-expression
16844 objc-selector-args objc-selector [opt] : assignment-expression
16847 assignment-expression
16848 objc-comma-args , assignment-expression
16850 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
16851 selector arguments and TREE_VALUE containing a list of comma
16855 cp_parser_objc_message_args (cp_parser
* parser
)
16857 tree sel_args
= NULL_TREE
, addl_args
= NULL_TREE
;
16858 bool maybe_unary_selector_p
= true;
16859 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
16861 while (cp_parser_objc_selector_p (token
->type
) || token
->type
== CPP_COLON
)
16863 tree selector
= NULL_TREE
, arg
;
16865 if (token
->type
!= CPP_COLON
)
16866 selector
= cp_parser_objc_selector (parser
);
16868 /* Detect if we have a unary selector. */
16869 if (maybe_unary_selector_p
16870 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
16871 return build_tree_list (selector
, NULL_TREE
);
16873 maybe_unary_selector_p
= false;
16874 cp_parser_require (parser
, CPP_COLON
, "`:'");
16875 arg
= cp_parser_assignment_expression (parser
, false);
16878 = chainon (sel_args
,
16879 build_tree_list (selector
, arg
));
16881 token
= cp_lexer_peek_token (parser
->lexer
);
16884 /* Handle non-selector arguments, if any. */
16885 while (token
->type
== CPP_COMMA
)
16889 cp_lexer_consume_token (parser
->lexer
);
16890 arg
= cp_parser_assignment_expression (parser
, false);
16893 = chainon (addl_args
,
16894 build_tree_list (NULL_TREE
, arg
));
16896 token
= cp_lexer_peek_token (parser
->lexer
);
16899 return build_tree_list (sel_args
, addl_args
);
16902 /* Parse an Objective-C encode expression.
16904 objc-encode-expression:
16905 @encode objc-typename
16907 Returns an encoded representation of the type argument. */
16910 cp_parser_objc_encode_expression (cp_parser
* parser
)
16914 cp_lexer_consume_token (parser
->lexer
); /* Eat '@encode'. */
16915 cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('");
16916 type
= complete_type (cp_parser_type_id (parser
));
16917 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
16921 error ("%<@encode%> must specify a type as an argument");
16922 return error_mark_node
;
16925 return objc_build_encode_expr (type
);
16928 /* Parse an Objective-C @defs expression. */
16931 cp_parser_objc_defs_expression (cp_parser
*parser
)
16935 cp_lexer_consume_token (parser
->lexer
); /* Eat '@defs'. */
16936 cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('");
16937 name
= cp_parser_identifier (parser
);
16938 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
16940 return objc_get_class_ivars (name
);
16943 /* Parse an Objective-C protocol expression.
16945 objc-protocol-expression:
16946 @protocol ( identifier )
16948 Returns a representation of the protocol expression. */
16951 cp_parser_objc_protocol_expression (cp_parser
* parser
)
16955 cp_lexer_consume_token (parser
->lexer
); /* Eat '@protocol'. */
16956 cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('");
16957 proto
= cp_parser_identifier (parser
);
16958 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
16960 return objc_build_protocol_expr (proto
);
16963 /* Parse an Objective-C selector expression.
16965 objc-selector-expression:
16966 @selector ( objc-method-signature )
16968 objc-method-signature:
16974 objc-selector-seq objc-selector :
16976 Returns a representation of the method selector. */
16979 cp_parser_objc_selector_expression (cp_parser
* parser
)
16981 tree sel_seq
= NULL_TREE
;
16982 bool maybe_unary_selector_p
= true;
16985 cp_lexer_consume_token (parser
->lexer
); /* Eat '@selector'. */
16986 cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('");
16987 token
= cp_lexer_peek_token (parser
->lexer
);
16989 while (cp_parser_objc_selector_p (token
->type
) || token
->type
== CPP_COLON
16990 || token
->type
== CPP_SCOPE
)
16992 tree selector
= NULL_TREE
;
16994 if (token
->type
!= CPP_COLON
16995 || token
->type
== CPP_SCOPE
)
16996 selector
= cp_parser_objc_selector (parser
);
16998 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
)
16999 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_SCOPE
))
17001 /* Detect if we have a unary selector. */
17002 if (maybe_unary_selector_p
)
17004 sel_seq
= selector
;
17005 goto finish_selector
;
17009 cp_parser_error (parser
, "expected %<:%>");
17012 maybe_unary_selector_p
= false;
17013 token
= cp_lexer_consume_token (parser
->lexer
);
17015 if (token
->type
== CPP_SCOPE
)
17018 = chainon (sel_seq
,
17019 build_tree_list (selector
, NULL_TREE
));
17021 = chainon (sel_seq
,
17022 build_tree_list (NULL_TREE
, NULL_TREE
));
17026 = chainon (sel_seq
,
17027 build_tree_list (selector
, NULL_TREE
));
17029 token
= cp_lexer_peek_token (parser
->lexer
);
17033 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
17035 return objc_build_selector_expr (sel_seq
);
17038 /* Parse a list of identifiers.
17040 objc-identifier-list:
17042 objc-identifier-list , identifier
17044 Returns a TREE_LIST of identifier nodes. */
17047 cp_parser_objc_identifier_list (cp_parser
* parser
)
17049 tree list
= build_tree_list (NULL_TREE
, cp_parser_identifier (parser
));
17050 cp_token
*sep
= cp_lexer_peek_token (parser
->lexer
);
17052 while (sep
->type
== CPP_COMMA
)
17054 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
17055 list
= chainon (list
,
17056 build_tree_list (NULL_TREE
,
17057 cp_parser_identifier (parser
)));
17058 sep
= cp_lexer_peek_token (parser
->lexer
);
17064 /* Parse an Objective-C alias declaration.
17066 objc-alias-declaration:
17067 @compatibility_alias identifier identifier ;
17069 This function registers the alias mapping with the Objective-C front-end.
17070 It returns nothing. */
17073 cp_parser_objc_alias_declaration (cp_parser
* parser
)
17077 cp_lexer_consume_token (parser
->lexer
); /* Eat '@compatibility_alias'. */
17078 alias
= cp_parser_identifier (parser
);
17079 orig
= cp_parser_identifier (parser
);
17080 objc_declare_alias (alias
, orig
);
17081 cp_parser_consume_semicolon_at_end_of_statement (parser
);
17084 /* Parse an Objective-C class forward-declaration.
17086 objc-class-declaration:
17087 @class objc-identifier-list ;
17089 The function registers the forward declarations with the Objective-C
17090 front-end. It returns nothing. */
17093 cp_parser_objc_class_declaration (cp_parser
* parser
)
17095 cp_lexer_consume_token (parser
->lexer
); /* Eat '@class'. */
17096 objc_declare_class (cp_parser_objc_identifier_list (parser
));
17097 cp_parser_consume_semicolon_at_end_of_statement (parser
);
17100 /* Parse a list of Objective-C protocol references.
17102 objc-protocol-refs-opt:
17103 objc-protocol-refs [opt]
17105 objc-protocol-refs:
17106 < objc-identifier-list >
17108 Returns a TREE_LIST of identifiers, if any. */
17111 cp_parser_objc_protocol_refs_opt (cp_parser
* parser
)
17113 tree protorefs
= NULL_TREE
;
17115 if(cp_lexer_next_token_is (parser
->lexer
, CPP_LESS
))
17117 cp_lexer_consume_token (parser
->lexer
); /* Eat '<'. */
17118 protorefs
= cp_parser_objc_identifier_list (parser
);
17119 cp_parser_require (parser
, CPP_GREATER
, "`>'");
17125 /* Parse a Objective-C visibility specification. */
17128 cp_parser_objc_visibility_spec (cp_parser
* parser
)
17130 cp_token
*vis
= cp_lexer_peek_token (parser
->lexer
);
17132 switch (vis
->keyword
)
17134 case RID_AT_PRIVATE
:
17135 objc_set_visibility (2);
17137 case RID_AT_PROTECTED
:
17138 objc_set_visibility (0);
17140 case RID_AT_PUBLIC
:
17141 objc_set_visibility (1);
17147 /* Eat '@private'/'@protected'/'@public'. */
17148 cp_lexer_consume_token (parser
->lexer
);
17151 /* Parse an Objective-C method type. */
17154 cp_parser_objc_method_type (cp_parser
* parser
)
17156 objc_set_method_type
17157 (cp_lexer_consume_token (parser
->lexer
)->type
== CPP_PLUS
17162 /* Parse an Objective-C protocol qualifier. */
17165 cp_parser_objc_protocol_qualifiers (cp_parser
* parser
)
17167 tree quals
= NULL_TREE
, node
;
17168 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
17170 node
= token
->value
;
17172 while (node
&& TREE_CODE (node
) == IDENTIFIER_NODE
17173 && (node
== ridpointers
[(int) RID_IN
]
17174 || node
== ridpointers
[(int) RID_OUT
]
17175 || node
== ridpointers
[(int) RID_INOUT
]
17176 || node
== ridpointers
[(int) RID_BYCOPY
]
17177 || node
== ridpointers
[(int) RID_BYREF
]
17178 || node
== ridpointers
[(int) RID_ONEWAY
]))
17180 quals
= tree_cons (NULL_TREE
, node
, quals
);
17181 cp_lexer_consume_token (parser
->lexer
);
17182 token
= cp_lexer_peek_token (parser
->lexer
);
17183 node
= token
->value
;
17189 /* Parse an Objective-C typename. */
17192 cp_parser_objc_typename (cp_parser
* parser
)
17194 tree typename
= NULL_TREE
;
17196 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
17198 tree proto_quals
, cp_type
= NULL_TREE
;
17200 cp_lexer_consume_token (parser
->lexer
); /* Eat '('. */
17201 proto_quals
= cp_parser_objc_protocol_qualifiers (parser
);
17203 /* An ObjC type name may consist of just protocol qualifiers, in which
17204 case the type shall default to 'id'. */
17205 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
17206 cp_type
= cp_parser_type_id (parser
);
17208 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
17209 typename
= build_tree_list (proto_quals
, cp_type
);
17215 /* Check to see if TYPE refers to an Objective-C selector name. */
17218 cp_parser_objc_selector_p (enum cpp_ttype type
)
17220 return (type
== CPP_NAME
|| type
== CPP_KEYWORD
17221 || type
== CPP_AND_AND
|| type
== CPP_AND_EQ
|| type
== CPP_AND
17222 || type
== CPP_OR
|| type
== CPP_COMPL
|| type
== CPP_NOT
17223 || type
== CPP_NOT_EQ
|| type
== CPP_OR_OR
|| type
== CPP_OR_EQ
17224 || type
== CPP_XOR
|| type
== CPP_XOR_EQ
);
17227 /* Parse an Objective-C selector. */
17230 cp_parser_objc_selector (cp_parser
* parser
)
17232 cp_token
*token
= cp_lexer_consume_token (parser
->lexer
);
17234 if (!cp_parser_objc_selector_p (token
->type
))
17236 error ("invalid Objective-C++ selector name");
17237 return error_mark_node
;
17240 /* C++ operator names are allowed to appear in ObjC selectors. */
17241 switch (token
->type
)
17243 case CPP_AND_AND
: return get_identifier ("and");
17244 case CPP_AND_EQ
: return get_identifier ("and_eq");
17245 case CPP_AND
: return get_identifier ("bitand");
17246 case CPP_OR
: return get_identifier ("bitor");
17247 case CPP_COMPL
: return get_identifier ("compl");
17248 case CPP_NOT
: return get_identifier ("not");
17249 case CPP_NOT_EQ
: return get_identifier ("not_eq");
17250 case CPP_OR_OR
: return get_identifier ("or");
17251 case CPP_OR_EQ
: return get_identifier ("or_eq");
17252 case CPP_XOR
: return get_identifier ("xor");
17253 case CPP_XOR_EQ
: return get_identifier ("xor_eq");
17254 default: return token
->value
;
17258 /* Parse an Objective-C params list. */
17261 cp_parser_objc_method_keyword_params (cp_parser
* parser
)
17263 tree params
= NULL_TREE
;
17264 bool maybe_unary_selector_p
= true;
17265 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
17267 while (cp_parser_objc_selector_p (token
->type
) || token
->type
== CPP_COLON
)
17269 tree selector
= NULL_TREE
, typename
, identifier
;
17271 if (token
->type
!= CPP_COLON
)
17272 selector
= cp_parser_objc_selector (parser
);
17274 /* Detect if we have a unary selector. */
17275 if (maybe_unary_selector_p
17276 && cp_lexer_next_token_is_not (parser
->lexer
, CPP_COLON
))
17279 maybe_unary_selector_p
= false;
17280 cp_parser_require (parser
, CPP_COLON
, "`:'");
17281 typename
= cp_parser_objc_typename (parser
);
17282 identifier
= cp_parser_identifier (parser
);
17286 objc_build_keyword_decl (selector
,
17290 token
= cp_lexer_peek_token (parser
->lexer
);
17296 /* Parse the non-keyword Objective-C params. */
17299 cp_parser_objc_method_tail_params_opt (cp_parser
* parser
, bool *ellipsisp
)
17301 tree params
= make_node (TREE_LIST
);
17302 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
17303 *ellipsisp
= false; /* Initially, assume no ellipsis. */
17305 while (token
->type
== CPP_COMMA
)
17307 cp_parameter_declarator
*parmdecl
;
17310 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
17311 token
= cp_lexer_peek_token (parser
->lexer
);
17313 if (token
->type
== CPP_ELLIPSIS
)
17315 cp_lexer_consume_token (parser
->lexer
); /* Eat '...'. */
17320 parmdecl
= cp_parser_parameter_declaration (parser
, false, NULL
);
17321 parm
= grokdeclarator (parmdecl
->declarator
,
17322 &parmdecl
->decl_specifiers
,
17323 PARM
, /*initialized=*/0,
17324 /*attrlist=*/NULL
);
17326 chainon (params
, build_tree_list (NULL_TREE
, parm
));
17327 token
= cp_lexer_peek_token (parser
->lexer
);
17333 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
17336 cp_parser_objc_interstitial_code (cp_parser
* parser
)
17338 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
17340 /* If the next token is `extern' and the following token is a string
17341 literal, then we have a linkage specification. */
17342 if (token
->keyword
== RID_EXTERN
17343 && cp_parser_is_string_literal (cp_lexer_peek_nth_token (parser
->lexer
, 2)))
17344 cp_parser_linkage_specification (parser
);
17345 /* Handle #pragma, if any. */
17346 else if (token
->type
== CPP_PRAGMA
)
17347 cp_parser_pragma (parser
, pragma_external
);
17348 /* Allow stray semicolons. */
17349 else if (token
->type
== CPP_SEMICOLON
)
17350 cp_lexer_consume_token (parser
->lexer
);
17351 /* Finally, try to parse a block-declaration, or a function-definition. */
17353 cp_parser_block_declaration (parser
, /*statement_p=*/false);
17356 /* Parse a method signature. */
17359 cp_parser_objc_method_signature (cp_parser
* parser
)
17361 tree rettype
, kwdparms
, optparms
;
17362 bool ellipsis
= false;
17364 cp_parser_objc_method_type (parser
);
17365 rettype
= cp_parser_objc_typename (parser
);
17366 kwdparms
= cp_parser_objc_method_keyword_params (parser
);
17367 optparms
= cp_parser_objc_method_tail_params_opt (parser
, &ellipsis
);
17369 return objc_build_method_signature (rettype
, kwdparms
, optparms
, ellipsis
);
17372 /* Pars an Objective-C method prototype list. */
17375 cp_parser_objc_method_prototype_list (cp_parser
* parser
)
17377 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
17379 while (token
->keyword
!= RID_AT_END
)
17381 if (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
)
17383 objc_add_method_declaration
17384 (cp_parser_objc_method_signature (parser
));
17385 cp_parser_consume_semicolon_at_end_of_statement (parser
);
17388 /* Allow for interspersed non-ObjC++ code. */
17389 cp_parser_objc_interstitial_code (parser
);
17391 token
= cp_lexer_peek_token (parser
->lexer
);
17394 cp_lexer_consume_token (parser
->lexer
); /* Eat '@end'. */
17395 objc_finish_interface ();
17398 /* Parse an Objective-C method definition list. */
17401 cp_parser_objc_method_definition_list (cp_parser
* parser
)
17403 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
17405 while (token
->keyword
!= RID_AT_END
)
17409 if (token
->type
== CPP_PLUS
|| token
->type
== CPP_MINUS
)
17411 push_deferring_access_checks (dk_deferred
);
17412 objc_start_method_definition
17413 (cp_parser_objc_method_signature (parser
));
17415 /* For historical reasons, we accept an optional semicolon. */
17416 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
17417 cp_lexer_consume_token (parser
->lexer
);
17419 perform_deferred_access_checks ();
17420 stop_deferring_access_checks ();
17421 meth
= cp_parser_function_definition_after_declarator (parser
,
17423 pop_deferring_access_checks ();
17424 objc_finish_method_definition (meth
);
17427 /* Allow for interspersed non-ObjC++ code. */
17428 cp_parser_objc_interstitial_code (parser
);
17430 token
= cp_lexer_peek_token (parser
->lexer
);
17433 cp_lexer_consume_token (parser
->lexer
); /* Eat '@end'. */
17434 objc_finish_implementation ();
17437 /* Parse Objective-C ivars. */
17440 cp_parser_objc_class_ivars (cp_parser
* parser
)
17442 cp_token
*token
= cp_lexer_peek_token (parser
->lexer
);
17444 if (token
->type
!= CPP_OPEN_BRACE
)
17445 return; /* No ivars specified. */
17447 cp_lexer_consume_token (parser
->lexer
); /* Eat '{'. */
17448 token
= cp_lexer_peek_token (parser
->lexer
);
17450 while (token
->type
!= CPP_CLOSE_BRACE
)
17452 cp_decl_specifier_seq declspecs
;
17453 int decl_class_or_enum_p
;
17454 tree prefix_attributes
;
17456 cp_parser_objc_visibility_spec (parser
);
17458 if (cp_lexer_next_token_is (parser
->lexer
, CPP_CLOSE_BRACE
))
17461 cp_parser_decl_specifier_seq (parser
,
17462 CP_PARSER_FLAGS_OPTIONAL
,
17464 &decl_class_or_enum_p
);
17465 prefix_attributes
= declspecs
.attributes
;
17466 declspecs
.attributes
= NULL_TREE
;
17468 /* Keep going until we hit the `;' at the end of the
17470 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
17472 tree width
= NULL_TREE
, attributes
, first_attribute
, decl
;
17473 cp_declarator
*declarator
= NULL
;
17474 int ctor_dtor_or_conv_p
;
17476 /* Check for a (possibly unnamed) bitfield declaration. */
17477 token
= cp_lexer_peek_token (parser
->lexer
);
17478 if (token
->type
== CPP_COLON
)
17481 if (token
->type
== CPP_NAME
17482 && (cp_lexer_peek_nth_token (parser
->lexer
, 2)->type
17485 /* Get the name of the bitfield. */
17486 declarator
= make_id_declarator (NULL_TREE
,
17487 cp_parser_identifier (parser
),
17491 cp_lexer_consume_token (parser
->lexer
); /* Eat ':'. */
17492 /* Get the width of the bitfield. */
17494 = cp_parser_constant_expression (parser
,
17495 /*allow_non_constant=*/false,
17500 /* Parse the declarator. */
17502 = cp_parser_declarator (parser
, CP_PARSER_DECLARATOR_NAMED
,
17503 &ctor_dtor_or_conv_p
,
17504 /*parenthesized_p=*/NULL
,
17505 /*member_p=*/false);
17508 /* Look for attributes that apply to the ivar. */
17509 attributes
= cp_parser_attributes_opt (parser
);
17510 /* Remember which attributes are prefix attributes and
17512 first_attribute
= attributes
;
17513 /* Combine the attributes. */
17514 attributes
= chainon (prefix_attributes
, attributes
);
17518 /* Create the bitfield declaration. */
17519 decl
= grokbitfield (declarator
, &declspecs
, width
);
17520 cplus_decl_attributes (&decl
, attributes
, /*flags=*/0);
17523 decl
= grokfield (declarator
, &declspecs
,
17524 NULL_TREE
, /*init_const_expr_p=*/false,
17525 NULL_TREE
, attributes
);
17527 /* Add the instance variable. */
17528 objc_add_instance_variable (decl
);
17530 /* Reset PREFIX_ATTRIBUTES. */
17531 while (attributes
&& TREE_CHAIN (attributes
) != first_attribute
)
17532 attributes
= TREE_CHAIN (attributes
);
17534 TREE_CHAIN (attributes
) = NULL_TREE
;
17536 token
= cp_lexer_peek_token (parser
->lexer
);
17538 if (token
->type
== CPP_COMMA
)
17540 cp_lexer_consume_token (parser
->lexer
); /* Eat ','. */
17546 cp_parser_consume_semicolon_at_end_of_statement (parser
);
17547 token
= cp_lexer_peek_token (parser
->lexer
);
17550 cp_lexer_consume_token (parser
->lexer
); /* Eat '}'. */
17551 /* For historical reasons, we accept an optional semicolon. */
17552 if (cp_lexer_next_token_is (parser
->lexer
, CPP_SEMICOLON
))
17553 cp_lexer_consume_token (parser
->lexer
);
17556 /* Parse an Objective-C protocol declaration. */
17559 cp_parser_objc_protocol_declaration (cp_parser
* parser
)
17561 tree proto
, protorefs
;
17564 cp_lexer_consume_token (parser
->lexer
); /* Eat '@protocol'. */
17565 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_NAME
))
17567 error ("identifier expected after %<@protocol%>");
17571 /* See if we have a forward declaration or a definition. */
17572 tok
= cp_lexer_peek_nth_token (parser
->lexer
, 2);
17574 /* Try a forward declaration first. */
17575 if (tok
->type
== CPP_COMMA
|| tok
->type
== CPP_SEMICOLON
)
17577 objc_declare_protocols (cp_parser_objc_identifier_list (parser
));
17579 cp_parser_consume_semicolon_at_end_of_statement (parser
);
17582 /* Ok, we got a full-fledged definition (or at least should). */
17585 proto
= cp_parser_identifier (parser
);
17586 protorefs
= cp_parser_objc_protocol_refs_opt (parser
);
17587 objc_start_protocol (proto
, protorefs
);
17588 cp_parser_objc_method_prototype_list (parser
);
17592 /* Parse an Objective-C superclass or category. */
17595 cp_parser_objc_superclass_or_category (cp_parser
*parser
, tree
*super
,
17598 cp_token
*next
= cp_lexer_peek_token (parser
->lexer
);
17600 *super
= *categ
= NULL_TREE
;
17601 if (next
->type
== CPP_COLON
)
17603 cp_lexer_consume_token (parser
->lexer
); /* Eat ':'. */
17604 *super
= cp_parser_identifier (parser
);
17606 else if (next
->type
== CPP_OPEN_PAREN
)
17608 cp_lexer_consume_token (parser
->lexer
); /* Eat '('. */
17609 *categ
= cp_parser_identifier (parser
);
17610 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
17614 /* Parse an Objective-C class interface. */
17617 cp_parser_objc_class_interface (cp_parser
* parser
)
17619 tree name
, super
, categ
, protos
;
17621 cp_lexer_consume_token (parser
->lexer
); /* Eat '@interface'. */
17622 name
= cp_parser_identifier (parser
);
17623 cp_parser_objc_superclass_or_category (parser
, &super
, &categ
);
17624 protos
= cp_parser_objc_protocol_refs_opt (parser
);
17626 /* We have either a class or a category on our hands. */
17628 objc_start_category_interface (name
, categ
, protos
);
17631 objc_start_class_interface (name
, super
, protos
);
17632 /* Handle instance variable declarations, if any. */
17633 cp_parser_objc_class_ivars (parser
);
17634 objc_continue_interface ();
17637 cp_parser_objc_method_prototype_list (parser
);
17640 /* Parse an Objective-C class implementation. */
17643 cp_parser_objc_class_implementation (cp_parser
* parser
)
17645 tree name
, super
, categ
;
17647 cp_lexer_consume_token (parser
->lexer
); /* Eat '@implementation'. */
17648 name
= cp_parser_identifier (parser
);
17649 cp_parser_objc_superclass_or_category (parser
, &super
, &categ
);
17651 /* We have either a class or a category on our hands. */
17653 objc_start_category_implementation (name
, categ
);
17656 objc_start_class_implementation (name
, super
);
17657 /* Handle instance variable declarations, if any. */
17658 cp_parser_objc_class_ivars (parser
);
17659 objc_continue_implementation ();
17662 cp_parser_objc_method_definition_list (parser
);
17665 /* Consume the @end token and finish off the implementation. */
17668 cp_parser_objc_end_implementation (cp_parser
* parser
)
17670 cp_lexer_consume_token (parser
->lexer
); /* Eat '@end'. */
17671 objc_finish_implementation ();
17674 /* Parse an Objective-C declaration. */
17677 cp_parser_objc_declaration (cp_parser
* parser
)
17679 /* Try to figure out what kind of declaration is present. */
17680 cp_token
*kwd
= cp_lexer_peek_token (parser
->lexer
);
17682 switch (kwd
->keyword
)
17685 cp_parser_objc_alias_declaration (parser
);
17688 cp_parser_objc_class_declaration (parser
);
17690 case RID_AT_PROTOCOL
:
17691 cp_parser_objc_protocol_declaration (parser
);
17693 case RID_AT_INTERFACE
:
17694 cp_parser_objc_class_interface (parser
);
17696 case RID_AT_IMPLEMENTATION
:
17697 cp_parser_objc_class_implementation (parser
);
17700 cp_parser_objc_end_implementation (parser
);
17703 error ("misplaced %<@%D%> Objective-C++ construct", kwd
->value
);
17704 cp_parser_skip_to_end_of_block_or_statement (parser
);
17708 /* Parse an Objective-C try-catch-finally statement.
17710 objc-try-catch-finally-stmt:
17711 @try compound-statement objc-catch-clause-seq [opt]
17712 objc-finally-clause [opt]
17714 objc-catch-clause-seq:
17715 objc-catch-clause objc-catch-clause-seq [opt]
17718 @catch ( exception-declaration ) compound-statement
17720 objc-finally-clause
17721 @finally compound-statement
17723 Returns NULL_TREE. */
17726 cp_parser_objc_try_catch_finally_statement (cp_parser
*parser
) {
17727 location_t location
;
17730 cp_parser_require_keyword (parser
, RID_AT_TRY
, "`@try'");
17731 location
= cp_lexer_peek_token (parser
->lexer
)->location
;
17732 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
17733 node, lest it get absorbed into the surrounding block. */
17734 stmt
= push_stmt_list ();
17735 cp_parser_compound_statement (parser
, NULL
, false);
17736 objc_begin_try_stmt (location
, pop_stmt_list (stmt
));
17738 while (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AT_CATCH
))
17740 cp_parameter_declarator
*parmdecl
;
17743 cp_lexer_consume_token (parser
->lexer
);
17744 cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('");
17745 parmdecl
= cp_parser_parameter_declaration (parser
, false, NULL
);
17746 parm
= grokdeclarator (parmdecl
->declarator
,
17747 &parmdecl
->decl_specifiers
,
17748 PARM
, /*initialized=*/0,
17749 /*attrlist=*/NULL
);
17750 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
17751 objc_begin_catch_clause (parm
);
17752 cp_parser_compound_statement (parser
, NULL
, false);
17753 objc_finish_catch_clause ();
17756 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_AT_FINALLY
))
17758 cp_lexer_consume_token (parser
->lexer
);
17759 location
= cp_lexer_peek_token (parser
->lexer
)->location
;
17760 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
17761 node, lest it get absorbed into the surrounding block. */
17762 stmt
= push_stmt_list ();
17763 cp_parser_compound_statement (parser
, NULL
, false);
17764 objc_build_finally_clause (location
, pop_stmt_list (stmt
));
17767 return objc_finish_try_stmt ();
17770 /* Parse an Objective-C synchronized statement.
17772 objc-synchronized-stmt:
17773 @synchronized ( expression ) compound-statement
17775 Returns NULL_TREE. */
17778 cp_parser_objc_synchronized_statement (cp_parser
*parser
) {
17779 location_t location
;
17782 cp_parser_require_keyword (parser
, RID_AT_SYNCHRONIZED
, "`@synchronized'");
17784 location
= cp_lexer_peek_token (parser
->lexer
)->location
;
17785 cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('");
17786 lock
= cp_parser_expression (parser
, false);
17787 cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'");
17789 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
17790 node, lest it get absorbed into the surrounding block. */
17791 stmt
= push_stmt_list ();
17792 cp_parser_compound_statement (parser
, NULL
, false);
17794 return objc_build_synchronized (location
, lock
, pop_stmt_list (stmt
));
17797 /* Parse an Objective-C throw statement.
17800 @throw assignment-expression [opt] ;
17802 Returns a constructed '@throw' statement. */
17805 cp_parser_objc_throw_statement (cp_parser
*parser
) {
17806 tree expr
= NULL_TREE
;
17808 cp_parser_require_keyword (parser
, RID_AT_THROW
, "`@throw'");
17810 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
17811 expr
= cp_parser_assignment_expression (parser
, false);
17813 cp_parser_consume_semicolon_at_end_of_statement (parser
);
17815 return objc_build_throw_stmt (expr
);
17818 /* Parse an Objective-C statement. */
17821 cp_parser_objc_statement (cp_parser
* parser
) {
17822 /* Try to figure out what kind of declaration is present. */
17823 cp_token
*kwd
= cp_lexer_peek_token (parser
->lexer
);
17825 switch (kwd
->keyword
)
17828 return cp_parser_objc_try_catch_finally_statement (parser
);
17829 case RID_AT_SYNCHRONIZED
:
17830 return cp_parser_objc_synchronized_statement (parser
);
17832 return cp_parser_objc_throw_statement (parser
);
17834 error ("misplaced %<@%D%> Objective-C++ construct", kwd
->value
);
17835 cp_parser_skip_to_end_of_block_or_statement (parser
);
17838 return error_mark_node
;
17841 /* OpenMP 2.5 parsing routines. */
17843 /* All OpenMP clauses. OpenMP 2.5. */
17844 typedef enum pragma_omp_clause
{
17845 PRAGMA_OMP_CLAUSE_NONE
= 0,
17847 PRAGMA_OMP_CLAUSE_COPYIN
,
17848 PRAGMA_OMP_CLAUSE_COPYPRIVATE
,
17849 PRAGMA_OMP_CLAUSE_DEFAULT
,
17850 PRAGMA_OMP_CLAUSE_FIRSTPRIVATE
,
17851 PRAGMA_OMP_CLAUSE_IF
,
17852 PRAGMA_OMP_CLAUSE_LASTPRIVATE
,
17853 PRAGMA_OMP_CLAUSE_NOWAIT
,
17854 PRAGMA_OMP_CLAUSE_NUM_THREADS
,
17855 PRAGMA_OMP_CLAUSE_ORDERED
,
17856 PRAGMA_OMP_CLAUSE_PRIVATE
,
17857 PRAGMA_OMP_CLAUSE_REDUCTION
,
17858 PRAGMA_OMP_CLAUSE_SCHEDULE
,
17859 PRAGMA_OMP_CLAUSE_SHARED
17860 } pragma_omp_clause
;
17862 /* Returns name of the next clause.
17863 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
17864 the token is not consumed. Otherwise appropriate pragma_omp_clause is
17865 returned and the token is consumed. */
17867 static pragma_omp_clause
17868 cp_parser_omp_clause_name (cp_parser
*parser
)
17870 pragma_omp_clause result
= PRAGMA_OMP_CLAUSE_NONE
;
17872 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_IF
))
17873 result
= PRAGMA_OMP_CLAUSE_IF
;
17874 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_DEFAULT
))
17875 result
= PRAGMA_OMP_CLAUSE_DEFAULT
;
17876 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_PRIVATE
))
17877 result
= PRAGMA_OMP_CLAUSE_PRIVATE
;
17878 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
17880 tree id
= cp_lexer_peek_token (parser
->lexer
)->value
;
17881 const char *p
= IDENTIFIER_POINTER (id
);
17886 if (!strcmp ("copyin", p
))
17887 result
= PRAGMA_OMP_CLAUSE_COPYIN
;
17888 else if (!strcmp ("copyprivate", p
))
17889 result
= PRAGMA_OMP_CLAUSE_COPYPRIVATE
;
17892 if (!strcmp ("firstprivate", p
))
17893 result
= PRAGMA_OMP_CLAUSE_FIRSTPRIVATE
;
17896 if (!strcmp ("lastprivate", p
))
17897 result
= PRAGMA_OMP_CLAUSE_LASTPRIVATE
;
17900 if (!strcmp ("nowait", p
))
17901 result
= PRAGMA_OMP_CLAUSE_NOWAIT
;
17902 else if (!strcmp ("num_threads", p
))
17903 result
= PRAGMA_OMP_CLAUSE_NUM_THREADS
;
17906 if (!strcmp ("ordered", p
))
17907 result
= PRAGMA_OMP_CLAUSE_ORDERED
;
17910 if (!strcmp ("reduction", p
))
17911 result
= PRAGMA_OMP_CLAUSE_REDUCTION
;
17914 if (!strcmp ("schedule", p
))
17915 result
= PRAGMA_OMP_CLAUSE_SCHEDULE
;
17916 else if (!strcmp ("shared", p
))
17917 result
= PRAGMA_OMP_CLAUSE_SHARED
;
17922 if (result
!= PRAGMA_OMP_CLAUSE_NONE
)
17923 cp_lexer_consume_token (parser
->lexer
);
17928 /* Validate that a clause of the given type does not already exist. */
17931 check_no_duplicate_clause (tree clauses
, enum tree_code code
, const char *name
)
17935 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
17936 if (OMP_CLAUSE_CODE (c
) == code
)
17938 error ("too many %qs clauses", name
);
17946 variable-list , identifier
17948 In addition, we match a closing parenthesis. An opening parenthesis
17949 will have been consumed by the caller.
17951 If KIND is nonzero, create the appropriate node and install the decl
17952 in OMP_CLAUSE_DECL and add the node to the head of the list.
17954 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
17955 return the list created. */
17958 cp_parser_omp_var_list_no_open (cp_parser
*parser
, enum omp_clause_code kind
,
17965 name
= cp_parser_id_expression (parser
, /*template_p=*/false,
17966 /*check_dependency_p=*/true,
17967 /*template_p=*/NULL
,
17968 /*declarator_p=*/false,
17969 /*optional_p=*/false);
17970 if (name
== error_mark_node
)
17973 decl
= cp_parser_lookup_name_simple (parser
, name
);
17974 if (decl
== error_mark_node
)
17975 cp_parser_name_lookup_error (parser
, name
, decl
, NULL
);
17976 else if (kind
!= 0)
17978 tree u
= build_omp_clause (kind
);
17979 OMP_CLAUSE_DECL (u
) = decl
;
17980 OMP_CLAUSE_CHAIN (u
) = list
;
17984 list
= tree_cons (decl
, NULL_TREE
, list
);
17987 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_COMMA
))
17989 cp_lexer_consume_token (parser
->lexer
);
17992 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'"))
17996 /* Try to resync to an unnested comma. Copied from
17997 cp_parser_parenthesized_expression_list. */
17999 ending
= cp_parser_skip_to_closing_parenthesis (parser
,
18000 /*recovering=*/true,
18002 /*consume_paren=*/true);
18010 /* Similarly, but expect leading and trailing parenthesis. This is a very
18011 common case for omp clauses. */
18014 cp_parser_omp_var_list (cp_parser
*parser
, enum omp_clause_code kind
, tree list
)
18016 if (cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('"))
18017 return cp_parser_omp_var_list_no_open (parser
, kind
, list
);
18022 default ( shared | none ) */
18025 cp_parser_omp_clause_default (cp_parser
*parser
, tree list
)
18027 enum omp_clause_default_kind kind
= OMP_CLAUSE_DEFAULT_UNSPECIFIED
;
18030 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('"))
18032 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
18034 tree id
= cp_lexer_peek_token (parser
->lexer
)->value
;
18035 const char *p
= IDENTIFIER_POINTER (id
);
18040 if (strcmp ("none", p
) != 0)
18042 kind
= OMP_CLAUSE_DEFAULT_NONE
;
18046 if (strcmp ("shared", p
) != 0)
18048 kind
= OMP_CLAUSE_DEFAULT_SHARED
;
18055 cp_lexer_consume_token (parser
->lexer
);
18060 cp_parser_error (parser
, "expected %<none%> or %<shared%>");
18063 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'"))
18064 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
18065 /*or_comma=*/false,
18066 /*consume_paren=*/true);
18068 if (kind
== OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
18071 check_no_duplicate_clause (list
, OMP_CLAUSE_DEFAULT
, "default");
18072 c
= build_omp_clause (OMP_CLAUSE_DEFAULT
);
18073 OMP_CLAUSE_CHAIN (c
) = list
;
18074 OMP_CLAUSE_DEFAULT_KIND (c
) = kind
;
18080 if ( expression ) */
18083 cp_parser_omp_clause_if (cp_parser
*parser
, tree list
)
18087 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('"))
18090 t
= cp_parser_condition (parser
);
18092 if (t
== error_mark_node
18093 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'"))
18094 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
18095 /*or_comma=*/false,
18096 /*consume_paren=*/true);
18098 check_no_duplicate_clause (list
, OMP_CLAUSE_IF
, "if");
18100 c
= build_omp_clause (OMP_CLAUSE_IF
);
18101 OMP_CLAUSE_IF_EXPR (c
) = t
;
18102 OMP_CLAUSE_CHAIN (c
) = list
;
18111 cp_parser_omp_clause_nowait (cp_parser
*parser ATTRIBUTE_UNUSED
, tree list
)
18115 check_no_duplicate_clause (list
, OMP_CLAUSE_NOWAIT
, "nowait");
18117 c
= build_omp_clause (OMP_CLAUSE_NOWAIT
);
18118 OMP_CLAUSE_CHAIN (c
) = list
;
18123 num_threads ( expression ) */
18126 cp_parser_omp_clause_num_threads (cp_parser
*parser
, tree list
)
18130 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('"))
18133 t
= cp_parser_expression (parser
, false);
18135 if (t
== error_mark_node
18136 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'"))
18137 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
18138 /*or_comma=*/false,
18139 /*consume_paren=*/true);
18141 check_no_duplicate_clause (list
, OMP_CLAUSE_NUM_THREADS
, "num_threads");
18143 c
= build_omp_clause (OMP_CLAUSE_NUM_THREADS
);
18144 OMP_CLAUSE_NUM_THREADS_EXPR (c
) = t
;
18145 OMP_CLAUSE_CHAIN (c
) = list
;
18154 cp_parser_omp_clause_ordered (cp_parser
*parser ATTRIBUTE_UNUSED
, tree list
)
18158 check_no_duplicate_clause (list
, OMP_CLAUSE_ORDERED
, "ordered");
18160 c
= build_omp_clause (OMP_CLAUSE_ORDERED
);
18161 OMP_CLAUSE_CHAIN (c
) = list
;
18166 reduction ( reduction-operator : variable-list )
18168 reduction-operator:
18169 One of: + * - & ^ | && || */
18172 cp_parser_omp_clause_reduction (cp_parser
*parser
, tree list
)
18174 enum tree_code code
;
18177 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('"))
18180 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
18192 code
= BIT_AND_EXPR
;
18195 code
= BIT_XOR_EXPR
;
18198 code
= BIT_IOR_EXPR
;
18201 code
= TRUTH_ANDIF_EXPR
;
18204 code
= TRUTH_ORIF_EXPR
;
18207 cp_parser_error (parser
, "`+', `*', `-', `&', `^', `|', `&&', or `||'");
18209 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
18210 /*or_comma=*/false,
18211 /*consume_paren=*/true);
18214 cp_lexer_consume_token (parser
->lexer
);
18216 if (!cp_parser_require (parser
, CPP_COLON
, "`:'"))
18219 nlist
= cp_parser_omp_var_list_no_open (parser
, OMP_CLAUSE_REDUCTION
, list
);
18220 for (c
= nlist
; c
!= list
; c
= OMP_CLAUSE_CHAIN (c
))
18221 OMP_CLAUSE_REDUCTION_CODE (c
) = code
;
18227 schedule ( schedule-kind )
18228 schedule ( schedule-kind , expression )
18231 static | dynamic | guided | runtime */
18234 cp_parser_omp_clause_schedule (cp_parser
*parser
, tree list
)
18238 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "expected %<(%>"))
18241 c
= build_omp_clause (OMP_CLAUSE_SCHEDULE
);
18243 if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
18245 tree id
= cp_lexer_peek_token (parser
->lexer
)->value
;
18246 const char *p
= IDENTIFIER_POINTER (id
);
18251 if (strcmp ("dynamic", p
) != 0)
18253 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_DYNAMIC
;
18257 if (strcmp ("guided", p
) != 0)
18259 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_GUIDED
;
18263 if (strcmp ("runtime", p
) != 0)
18265 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_RUNTIME
;
18272 else if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_STATIC
))
18273 OMP_CLAUSE_SCHEDULE_KIND (c
) = OMP_CLAUSE_SCHEDULE_STATIC
;
18276 cp_lexer_consume_token (parser
->lexer
);
18278 if (cp_lexer_next_token_is (parser
->lexer
, CPP_COMMA
))
18280 cp_lexer_consume_token (parser
->lexer
);
18282 t
= cp_parser_assignment_expression (parser
, false);
18284 if (t
== error_mark_node
)
18286 else if (OMP_CLAUSE_SCHEDULE_KIND (c
) == OMP_CLAUSE_SCHEDULE_RUNTIME
)
18287 error ("schedule %<runtime%> does not take "
18288 "a %<chunk_size%> parameter");
18290 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
) = t
;
18292 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'"))
18295 else if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`,' or `)'"))
18298 check_no_duplicate_clause (list
, OMP_CLAUSE_SCHEDULE
, "schedule");
18299 OMP_CLAUSE_CHAIN (c
) = list
;
18303 cp_parser_error (parser
, "invalid schedule kind");
18305 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
18306 /*or_comma=*/false,
18307 /*consume_paren=*/true);
18311 /* Parse all OpenMP clauses. The set clauses allowed by the directive
18312 is a bitmask in MASK. Return the list of clauses found; the result
18313 of clause default goes in *pdefault. */
18316 cp_parser_omp_all_clauses (cp_parser
*parser
, unsigned int mask
,
18317 const char *where
, cp_token
*pragma_tok
)
18319 tree clauses
= NULL
;
18321 while (cp_lexer_next_token_is_not (parser
->lexer
, CPP_PRAGMA_EOL
))
18323 pragma_omp_clause c_kind
= cp_parser_omp_clause_name (parser
);
18324 const char *c_name
;
18325 tree prev
= clauses
;
18329 case PRAGMA_OMP_CLAUSE_COPYIN
:
18330 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_COPYIN
, clauses
);
18333 case PRAGMA_OMP_CLAUSE_COPYPRIVATE
:
18334 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_COPYPRIVATE
,
18336 c_name
= "copyprivate";
18338 case PRAGMA_OMP_CLAUSE_DEFAULT
:
18339 clauses
= cp_parser_omp_clause_default (parser
, clauses
);
18340 c_name
= "default";
18342 case PRAGMA_OMP_CLAUSE_FIRSTPRIVATE
:
18343 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_FIRSTPRIVATE
,
18345 c_name
= "firstprivate";
18347 case PRAGMA_OMP_CLAUSE_IF
:
18348 clauses
= cp_parser_omp_clause_if (parser
, clauses
);
18351 case PRAGMA_OMP_CLAUSE_LASTPRIVATE
:
18352 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_LASTPRIVATE
,
18354 c_name
= "lastprivate";
18356 case PRAGMA_OMP_CLAUSE_NOWAIT
:
18357 clauses
= cp_parser_omp_clause_nowait (parser
, clauses
);
18360 case PRAGMA_OMP_CLAUSE_NUM_THREADS
:
18361 clauses
= cp_parser_omp_clause_num_threads (parser
, clauses
);
18362 c_name
= "num_threads";
18364 case PRAGMA_OMP_CLAUSE_ORDERED
:
18365 clauses
= cp_parser_omp_clause_ordered (parser
, clauses
);
18366 c_name
= "ordered";
18368 case PRAGMA_OMP_CLAUSE_PRIVATE
:
18369 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_PRIVATE
,
18371 c_name
= "private";
18373 case PRAGMA_OMP_CLAUSE_REDUCTION
:
18374 clauses
= cp_parser_omp_clause_reduction (parser
, clauses
);
18375 c_name
= "reduction";
18377 case PRAGMA_OMP_CLAUSE_SCHEDULE
:
18378 clauses
= cp_parser_omp_clause_schedule (parser
, clauses
);
18379 c_name
= "schedule";
18381 case PRAGMA_OMP_CLAUSE_SHARED
:
18382 clauses
= cp_parser_omp_var_list (parser
, OMP_CLAUSE_SHARED
,
18387 cp_parser_error (parser
, "expected %<#pragma omp%> clause");
18391 if (((mask
>> c_kind
) & 1) == 0)
18393 /* Remove the invalid clause(s) from the list to avoid
18394 confusing the rest of the compiler. */
18396 error ("%qs is not valid for %qs", c_name
, where
);
18400 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
18401 return finish_omp_clauses (clauses
);
18408 In practice, we're also interested in adding the statement to an
18409 outer node. So it is convenient if we work around the fact that
18410 cp_parser_statement calls add_stmt. */
18413 cp_parser_begin_omp_structured_block (cp_parser
*parser
)
18415 unsigned save
= parser
->in_statement
;
18417 /* Only move the values to IN_OMP_BLOCK if they weren't false.
18418 This preserves the "not within loop or switch" style error messages
18419 for nonsense cases like
18425 if (parser
->in_statement
)
18426 parser
->in_statement
= IN_OMP_BLOCK
;
18432 cp_parser_end_omp_structured_block (cp_parser
*parser
, unsigned save
)
18434 parser
->in_statement
= save
;
18438 cp_parser_omp_structured_block (cp_parser
*parser
)
18440 tree stmt
= begin_omp_structured_block ();
18441 unsigned int save
= cp_parser_begin_omp_structured_block (parser
);
18443 cp_parser_statement (parser
, NULL_TREE
, false);
18445 cp_parser_end_omp_structured_block (parser
, save
);
18446 return finish_omp_structured_block (stmt
);
18450 # pragma omp atomic new-line
18454 x binop= expr | x++ | ++x | x-- | --x
18456 +, *, -, /, &, ^, |, <<, >>
18458 where x is an lvalue expression with scalar type. */
18461 cp_parser_omp_atomic (cp_parser
*parser
, cp_token
*pragma_tok
)
18464 enum tree_code code
;
18466 cp_parser_require_pragma_eol (parser
, pragma_tok
);
18468 lhs
= cp_parser_unary_expression (parser
, /*address_p=*/false,
18470 switch (TREE_CODE (lhs
))
18475 case PREINCREMENT_EXPR
:
18476 case POSTINCREMENT_EXPR
:
18477 lhs
= TREE_OPERAND (lhs
, 0);
18479 rhs
= integer_one_node
;
18482 case PREDECREMENT_EXPR
:
18483 case POSTDECREMENT_EXPR
:
18484 lhs
= TREE_OPERAND (lhs
, 0);
18486 rhs
= integer_one_node
;
18490 switch (cp_lexer_peek_token (parser
->lexer
)->type
)
18496 code
= TRUNC_DIV_EXPR
;
18504 case CPP_LSHIFT_EQ
:
18505 code
= LSHIFT_EXPR
;
18507 case CPP_RSHIFT_EQ
:
18508 code
= RSHIFT_EXPR
;
18511 code
= BIT_AND_EXPR
;
18514 code
= BIT_IOR_EXPR
;
18517 code
= BIT_XOR_EXPR
;
18520 cp_parser_error (parser
,
18521 "invalid operator for %<#pragma omp atomic%>");
18524 cp_lexer_consume_token (parser
->lexer
);
18526 rhs
= cp_parser_expression (parser
, false);
18527 if (rhs
== error_mark_node
)
18531 finish_omp_atomic (code
, lhs
, rhs
);
18532 cp_parser_consume_semicolon_at_end_of_statement (parser
);
18536 cp_parser_skip_to_end_of_block_or_statement (parser
);
18541 # pragma omp barrier new-line */
18544 cp_parser_omp_barrier (cp_parser
*parser
, cp_token
*pragma_tok
)
18546 cp_parser_require_pragma_eol (parser
, pragma_tok
);
18547 finish_omp_barrier ();
18551 # pragma omp critical [(name)] new-line
18552 structured-block */
18555 cp_parser_omp_critical (cp_parser
*parser
, cp_token
*pragma_tok
)
18557 tree stmt
, name
= NULL
;
18559 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
18561 cp_lexer_consume_token (parser
->lexer
);
18563 name
= cp_parser_identifier (parser
);
18565 if (name
== error_mark_node
18566 || !cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'"))
18567 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
18568 /*or_comma=*/false,
18569 /*consume_paren=*/true);
18570 if (name
== error_mark_node
)
18573 cp_parser_require_pragma_eol (parser
, pragma_tok
);
18575 stmt
= cp_parser_omp_structured_block (parser
);
18576 return c_finish_omp_critical (stmt
, name
);
18580 # pragma omp flush flush-vars[opt] new-line
18583 ( variable-list ) */
18586 cp_parser_omp_flush (cp_parser
*parser
, cp_token
*pragma_tok
)
18588 if (cp_lexer_next_token_is (parser
->lexer
, CPP_OPEN_PAREN
))
18589 (void) cp_parser_omp_var_list (parser
, 0, NULL
);
18590 cp_parser_require_pragma_eol (parser
, pragma_tok
);
18592 finish_omp_flush ();
18595 /* Parse the restricted form of the for statment allowed by OpenMP. */
18598 cp_parser_omp_for_loop (cp_parser
*parser
)
18600 tree init
, cond
, incr
, body
, decl
, pre_body
;
18603 if (!cp_lexer_next_token_is_keyword (parser
->lexer
, RID_FOR
))
18605 cp_parser_error (parser
, "for statement expected");
18608 loc
= cp_lexer_consume_token (parser
->lexer
)->location
;
18609 if (!cp_parser_require (parser
, CPP_OPEN_PAREN
, "`('"))
18612 init
= decl
= NULL
;
18613 pre_body
= push_stmt_list ();
18614 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
18616 cp_decl_specifier_seq type_specifiers
;
18618 /* First, try to parse as an initialized declaration. See
18619 cp_parser_condition, from whence the bulk of this is copied. */
18621 cp_parser_parse_tentatively (parser
);
18622 cp_parser_type_specifier_seq (parser
, /*is_condition=*/false,
18624 if (!cp_parser_error_occurred (parser
))
18626 tree asm_specification
, attributes
;
18627 cp_declarator
*declarator
;
18629 declarator
= cp_parser_declarator (parser
,
18630 CP_PARSER_DECLARATOR_NAMED
,
18631 /*ctor_dtor_or_conv_p=*/NULL
,
18632 /*parenthesized_p=*/NULL
,
18633 /*member_p=*/false);
18634 attributes
= cp_parser_attributes_opt (parser
);
18635 asm_specification
= cp_parser_asm_specification_opt (parser
);
18637 cp_parser_require (parser
, CPP_EQ
, "`='");
18638 if (cp_parser_parse_definitely (parser
))
18642 decl
= start_decl (declarator
, &type_specifiers
,
18643 /*initialized_p=*/false, attributes
,
18644 /*prefix_attributes=*/NULL_TREE
,
18647 init
= cp_parser_assignment_expression (parser
, false);
18649 cp_finish_decl (decl
, NULL_TREE
, /*init_const_expr_p=*/false,
18650 asm_specification
, LOOKUP_ONLYCONVERTING
);
18653 pop_scope (pushed_scope
);
18657 cp_parser_abort_tentative_parse (parser
);
18659 /* If parsing as an initialized declaration failed, try again as
18660 a simple expression. */
18662 init
= cp_parser_expression (parser
, false);
18664 cp_parser_require (parser
, CPP_SEMICOLON
, "`;'");
18665 pre_body
= pop_stmt_list (pre_body
);
18668 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_SEMICOLON
))
18669 cond
= cp_parser_condition (parser
);
18670 cp_parser_require (parser
, CPP_SEMICOLON
, "`;'");
18673 if (cp_lexer_next_token_is_not (parser
->lexer
, CPP_CLOSE_PAREN
))
18674 incr
= cp_parser_expression (parser
, false);
18676 if (!cp_parser_require (parser
, CPP_CLOSE_PAREN
, "`)'"))
18677 cp_parser_skip_to_closing_parenthesis (parser
, /*recovering=*/true,
18678 /*or_comma=*/false,
18679 /*consume_paren=*/true);
18681 /* Note that we saved the original contents of this flag when we entered
18682 the structured block, and so we don't need to re-save it here. */
18683 parser
->in_statement
= IN_OMP_FOR
;
18685 /* Note that the grammar doesn't call for a structured block here,
18686 though the loop as a whole is a structured block. */
18687 body
= push_stmt_list ();
18688 cp_parser_statement (parser
, NULL_TREE
, false);
18689 body
= pop_stmt_list (body
);
18691 return finish_omp_for (loc
, decl
, init
, cond
, incr
, body
, pre_body
);
18695 #pragma omp for for-clause[optseq] new-line
18698 #define OMP_FOR_CLAUSE_MASK \
18699 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
18700 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
18701 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
18702 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
18703 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
18704 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
18705 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
18708 cp_parser_omp_for (cp_parser
*parser
, cp_token
*pragma_tok
)
18710 tree clauses
, sb
, ret
;
18713 clauses
= cp_parser_omp_all_clauses (parser
, OMP_FOR_CLAUSE_MASK
,
18714 "#pragma omp for", pragma_tok
);
18716 sb
= begin_omp_structured_block ();
18717 save
= cp_parser_begin_omp_structured_block (parser
);
18719 ret
= cp_parser_omp_for_loop (parser
);
18721 OMP_FOR_CLAUSES (ret
) = clauses
;
18723 cp_parser_end_omp_structured_block (parser
, save
);
18724 add_stmt (finish_omp_structured_block (sb
));
18730 # pragma omp master new-line
18731 structured-block */
18734 cp_parser_omp_master (cp_parser
*parser
, cp_token
*pragma_tok
)
18736 cp_parser_require_pragma_eol (parser
, pragma_tok
);
18737 return c_finish_omp_master (cp_parser_omp_structured_block (parser
));
18741 # pragma omp ordered new-line
18742 structured-block */
18745 cp_parser_omp_ordered (cp_parser
*parser
, cp_token
*pragma_tok
)
18747 cp_parser_require_pragma_eol (parser
, pragma_tok
);
18748 return c_finish_omp_ordered (cp_parser_omp_structured_block (parser
));
18754 { section-sequence }
18757 section-directive[opt] structured-block
18758 section-sequence section-directive structured-block */
18761 cp_parser_omp_sections_scope (cp_parser
*parser
)
18763 tree stmt
, substmt
;
18764 bool error_suppress
= false;
18767 if (!cp_parser_require (parser
, CPP_OPEN_BRACE
, "`{'"))
18770 stmt
= push_stmt_list ();
18772 if (cp_lexer_peek_token (parser
->lexer
)->pragma_kind
!= PRAGMA_OMP_SECTION
)
18776 substmt
= begin_omp_structured_block ();
18777 save
= cp_parser_begin_omp_structured_block (parser
);
18781 cp_parser_statement (parser
, NULL_TREE
, false);
18783 tok
= cp_lexer_peek_token (parser
->lexer
);
18784 if (tok
->pragma_kind
== PRAGMA_OMP_SECTION
)
18786 if (tok
->type
== CPP_CLOSE_BRACE
)
18788 if (tok
->type
== CPP_EOF
)
18792 cp_parser_end_omp_structured_block (parser
, save
);
18793 substmt
= finish_omp_structured_block (substmt
);
18794 substmt
= build1 (OMP_SECTION
, void_type_node
, substmt
);
18795 add_stmt (substmt
);
18800 tok
= cp_lexer_peek_token (parser
->lexer
);
18801 if (tok
->type
== CPP_CLOSE_BRACE
)
18803 if (tok
->type
== CPP_EOF
)
18806 if (tok
->pragma_kind
== PRAGMA_OMP_SECTION
)
18808 cp_lexer_consume_token (parser
->lexer
);
18809 cp_parser_require_pragma_eol (parser
, tok
);
18810 error_suppress
= false;
18812 else if (!error_suppress
)
18814 cp_parser_error (parser
, "expected %<#pragma omp section%> or %<}%>");
18815 error_suppress
= true;
18818 substmt
= cp_parser_omp_structured_block (parser
);
18819 substmt
= build1 (OMP_SECTION
, void_type_node
, substmt
);
18820 add_stmt (substmt
);
18822 cp_parser_require (parser
, CPP_CLOSE_BRACE
, "`}'");
18824 substmt
= pop_stmt_list (stmt
);
18826 stmt
= make_node (OMP_SECTIONS
);
18827 TREE_TYPE (stmt
) = void_type_node
;
18828 OMP_SECTIONS_BODY (stmt
) = substmt
;
18835 # pragma omp sections sections-clause[optseq] newline
18838 #define OMP_SECTIONS_CLAUSE_MASK \
18839 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
18840 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
18841 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
18842 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
18843 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
18846 cp_parser_omp_sections (cp_parser
*parser
, cp_token
*pragma_tok
)
18850 clauses
= cp_parser_omp_all_clauses (parser
, OMP_SECTIONS_CLAUSE_MASK
,
18851 "#pragma omp sections", pragma_tok
);
18853 ret
= cp_parser_omp_sections_scope (parser
);
18855 OMP_SECTIONS_CLAUSES (ret
) = clauses
;
18861 # pragma parallel parallel-clause new-line
18862 # pragma parallel for parallel-for-clause new-line
18863 # pragma parallel sections parallel-sections-clause new-line */
18865 #define OMP_PARALLEL_CLAUSE_MASK \
18866 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
18867 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
18868 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
18869 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
18870 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
18871 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
18872 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
18873 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
18876 cp_parser_omp_parallel (cp_parser
*parser
, cp_token
*pragma_tok
)
18878 enum pragma_kind p_kind
= PRAGMA_OMP_PARALLEL
;
18879 const char *p_name
= "#pragma omp parallel";
18880 tree stmt
, clauses
, par_clause
, ws_clause
, block
;
18881 unsigned int mask
= OMP_PARALLEL_CLAUSE_MASK
;
18884 if (cp_lexer_next_token_is_keyword (parser
->lexer
, RID_FOR
))
18886 cp_lexer_consume_token (parser
->lexer
);
18887 p_kind
= PRAGMA_OMP_PARALLEL_FOR
;
18888 p_name
= "#pragma omp parallel for";
18889 mask
|= OMP_FOR_CLAUSE_MASK
;
18890 mask
&= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT
);
18892 else if (cp_lexer_next_token_is (parser
->lexer
, CPP_NAME
))
18894 tree id
= cp_lexer_peek_token (parser
->lexer
)->value
;
18895 const char *p
= IDENTIFIER_POINTER (id
);
18896 if (strcmp (p
, "sections") == 0)
18898 cp_lexer_consume_token (parser
->lexer
);
18899 p_kind
= PRAGMA_OMP_PARALLEL_SECTIONS
;
18900 p_name
= "#pragma omp parallel sections";
18901 mask
|= OMP_SECTIONS_CLAUSE_MASK
;
18902 mask
&= ~(1u << PRAGMA_OMP_CLAUSE_NOWAIT
);
18906 clauses
= cp_parser_omp_all_clauses (parser
, mask
, p_name
, pragma_tok
);
18907 block
= begin_omp_parallel ();
18908 save
= cp_parser_begin_omp_structured_block (parser
);
18912 case PRAGMA_OMP_PARALLEL
:
18913 cp_parser_already_scoped_statement (parser
);
18914 par_clause
= clauses
;
18917 case PRAGMA_OMP_PARALLEL_FOR
:
18918 c_split_parallel_clauses (clauses
, &par_clause
, &ws_clause
);
18919 stmt
= cp_parser_omp_for_loop (parser
);
18921 OMP_FOR_CLAUSES (stmt
) = ws_clause
;
18924 case PRAGMA_OMP_PARALLEL_SECTIONS
:
18925 c_split_parallel_clauses (clauses
, &par_clause
, &ws_clause
);
18926 stmt
= cp_parser_omp_sections_scope (parser
);
18928 OMP_SECTIONS_CLAUSES (stmt
) = ws_clause
;
18932 gcc_unreachable ();
18935 cp_parser_end_omp_structured_block (parser
, save
);
18936 stmt
= finish_omp_parallel (par_clause
, block
);
18937 if (p_kind
!= PRAGMA_OMP_PARALLEL
)
18938 OMP_PARALLEL_COMBINED (stmt
) = 1;
18943 # pragma omp single single-clause[optseq] new-line
18944 structured-block */
18946 #define OMP_SINGLE_CLAUSE_MASK \
18947 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
18948 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
18949 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
18950 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
18953 cp_parser_omp_single (cp_parser
*parser
, cp_token
*pragma_tok
)
18955 tree stmt
= make_node (OMP_SINGLE
);
18956 TREE_TYPE (stmt
) = void_type_node
;
18958 OMP_SINGLE_CLAUSES (stmt
)
18959 = cp_parser_omp_all_clauses (parser
, OMP_SINGLE_CLAUSE_MASK
,
18960 "#pragma omp single", pragma_tok
);
18961 OMP_SINGLE_BODY (stmt
) = cp_parser_omp_structured_block (parser
);
18963 return add_stmt (stmt
);
18967 # pragma omp threadprivate (variable-list) */
18970 cp_parser_omp_threadprivate (cp_parser
*parser
, cp_token
*pragma_tok
)
18974 vars
= cp_parser_omp_var_list (parser
, 0, NULL
);
18975 cp_parser_require_pragma_eol (parser
, pragma_tok
);
18977 if (!targetm
.have_tls
)
18978 sorry ("threadprivate variables not supported in this target");
18980 finish_omp_threadprivate (vars
);
18983 /* Main entry point to OpenMP statement pragmas. */
18986 cp_parser_omp_construct (cp_parser
*parser
, cp_token
*pragma_tok
)
18990 switch (pragma_tok
->pragma_kind
)
18992 case PRAGMA_OMP_ATOMIC
:
18993 cp_parser_omp_atomic (parser
, pragma_tok
);
18995 case PRAGMA_OMP_CRITICAL
:
18996 stmt
= cp_parser_omp_critical (parser
, pragma_tok
);
18998 case PRAGMA_OMP_FOR
:
18999 stmt
= cp_parser_omp_for (parser
, pragma_tok
);
19001 case PRAGMA_OMP_MASTER
:
19002 stmt
= cp_parser_omp_master (parser
, pragma_tok
);
19004 case PRAGMA_OMP_ORDERED
:
19005 stmt
= cp_parser_omp_ordered (parser
, pragma_tok
);
19007 case PRAGMA_OMP_PARALLEL
:
19008 stmt
= cp_parser_omp_parallel (parser
, pragma_tok
);
19010 case PRAGMA_OMP_SECTIONS
:
19011 stmt
= cp_parser_omp_sections (parser
, pragma_tok
);
19013 case PRAGMA_OMP_SINGLE
:
19014 stmt
= cp_parser_omp_single (parser
, pragma_tok
);
19017 gcc_unreachable ();
19021 SET_EXPR_LOCATION (stmt
, pragma_tok
->location
);
19026 static GTY (()) cp_parser
*the_parser
;
19029 /* Special handling for the first token or line in the file. The first
19030 thing in the file might be #pragma GCC pch_preprocess, which loads a
19031 PCH file, which is a GC collection point. So we need to handle this
19032 first pragma without benefit of an existing lexer structure.
19034 Always returns one token to the caller in *FIRST_TOKEN. This is
19035 either the true first token of the file, or the first token after
19036 the initial pragma. */
19039 cp_parser_initial_pragma (cp_token
*first_token
)
19043 cp_lexer_get_preprocessor_token (NULL
, first_token
);
19044 if (first_token
->pragma_kind
!= PRAGMA_GCC_PCH_PREPROCESS
)
19047 cp_lexer_get_preprocessor_token (NULL
, first_token
);
19048 if (first_token
->type
== CPP_STRING
)
19050 name
= first_token
->value
;
19052 cp_lexer_get_preprocessor_token (NULL
, first_token
);
19053 if (first_token
->type
!= CPP_PRAGMA_EOL
)
19054 error ("junk at end of %<#pragma GCC pch_preprocess%>");
19057 error ("expected string literal");
19059 /* Skip to the end of the pragma. */
19060 while (first_token
->type
!= CPP_PRAGMA_EOL
&& first_token
->type
!= CPP_EOF
)
19061 cp_lexer_get_preprocessor_token (NULL
, first_token
);
19063 /* Now actually load the PCH file. */
19065 c_common_pch_pragma (parse_in
, TREE_STRING_POINTER (name
));
19067 /* Read one more token to return to our caller. We have to do this
19068 after reading the PCH file in, since its pointers have to be
19070 cp_lexer_get_preprocessor_token (NULL
, first_token
);
19073 /* Normal parsing of a pragma token. Here we can (and must) use the
19077 cp_parser_pragma (cp_parser
*parser
, enum pragma_context context
)
19079 cp_token
*pragma_tok
;
19082 pragma_tok
= cp_lexer_consume_token (parser
->lexer
);
19083 gcc_assert (pragma_tok
->type
== CPP_PRAGMA
);
19084 parser
->lexer
->in_pragma
= true;
19086 id
= pragma_tok
->pragma_kind
;
19089 case PRAGMA_GCC_PCH_PREPROCESS
:
19090 error ("%<#pragma GCC pch_preprocess%> must be first");
19093 case PRAGMA_OMP_BARRIER
:
19096 case pragma_compound
:
19097 cp_parser_omp_barrier (parser
, pragma_tok
);
19100 error ("%<#pragma omp barrier%> may only be "
19101 "used in compound statements");
19108 case PRAGMA_OMP_FLUSH
:
19111 case pragma_compound
:
19112 cp_parser_omp_flush (parser
, pragma_tok
);
19115 error ("%<#pragma omp flush%> may only be "
19116 "used in compound statements");
19123 case PRAGMA_OMP_THREADPRIVATE
:
19124 cp_parser_omp_threadprivate (parser
, pragma_tok
);
19127 case PRAGMA_OMP_ATOMIC
:
19128 case PRAGMA_OMP_CRITICAL
:
19129 case PRAGMA_OMP_FOR
:
19130 case PRAGMA_OMP_MASTER
:
19131 case PRAGMA_OMP_ORDERED
:
19132 case PRAGMA_OMP_PARALLEL
:
19133 case PRAGMA_OMP_SECTIONS
:
19134 case PRAGMA_OMP_SINGLE
:
19135 if (context
== pragma_external
)
19137 cp_parser_omp_construct (parser
, pragma_tok
);
19140 case PRAGMA_OMP_SECTION
:
19141 error ("%<#pragma omp section%> may only be used in "
19142 "%<#pragma omp sections%> construct");
19146 gcc_assert (id
>= PRAGMA_FIRST_EXTERNAL
);
19147 c_invoke_pragma_handler (id
);
19151 cp_parser_error (parser
, "expected declaration specifiers");
19155 cp_parser_skip_to_pragma_eol (parser
, pragma_tok
);
19159 /* The interface the pragma parsers have to the lexer. */
19162 pragma_lex (tree
*value
)
19165 enum cpp_ttype ret
;
19167 tok
= cp_lexer_peek_token (the_parser
->lexer
);
19170 *value
= tok
->value
;
19172 if (ret
== CPP_PRAGMA_EOL
|| ret
== CPP_EOF
)
19174 else if (ret
== CPP_STRING
)
19175 *value
= cp_parser_string_literal (the_parser
, false, false);
19178 cp_lexer_consume_token (the_parser
->lexer
);
19179 if (ret
== CPP_KEYWORD
)
19187 /* External interface. */
19189 /* Parse one entire translation unit. */
19192 c_parse_file (void)
19194 bool error_occurred
;
19195 static bool already_called
= false;
19197 if (already_called
)
19199 sorry ("inter-module optimizations not implemented for C++");
19202 already_called
= true;
19204 the_parser
= cp_parser_new ();
19205 push_deferring_access_checks (flag_access_control
19206 ? dk_no_deferred
: dk_no_check
);
19207 error_occurred
= cp_parser_translation_unit (the_parser
);
19211 /* This variable must be provided by every front end. */
19215 #include "gt-cp-parser.h"