| blob | 60ba380cf745c292063a5457138d002b2d7cbb71 |
1 /* C++ Parser.
2 Copyright (C) 2000, 2001, 2002, 2003, 2004,
3 2005, 2007, 2008, 2009, 2010, 2011, 2012 Free Software Foundation, Inc.
4 Written by Mark Mitchell <mark@codesourcery.com>.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it
9 under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
11 any later version.
13 GCC is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
43 \f
44 /* The lexer. */
46 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
47 and c-lex.c) and the C++ parser. */
50 {
52 };
54 /* The various kinds of non integral constant we encounter. */
56 NIC_NONE,
57 /* floating-point literal */
58 NIC_FLOAT,
59 /* %<this%> */
60 NIC_THIS,
61 /* %<__FUNCTION__%> */
62 NIC_FUNC_NAME,
63 /* %<__PRETTY_FUNCTION__%> */
64 NIC_PRETTY_FUNC,
65 /* %<__func__%> */
66 NIC_C99_FUNC,
67 /* "%<va_arg%> */
68 NIC_VA_ARG,
69 /* a cast */
70 NIC_CAST,
71 /* %<typeid%> operator */
72 NIC_TYPEID,
73 /* non-constant compound literals */
74 NIC_NCC,
75 /* a function call */
76 NIC_FUNC_CALL,
77 /* an increment */
78 NIC_INC,
79 /* an decrement */
80 NIC_DEC,
81 /* an array reference */
82 NIC_ARRAY_REF,
83 /* %<->%> */
84 NIC_ARROW,
85 /* %<.%> */
86 NIC_POINT,
87 /* the address of a label */
88 NIC_ADDR_LABEL,
89 /* %<*%> */
90 NIC_STAR,
91 /* %<&%> */
92 NIC_ADDR,
93 /* %<++%> */
94 NIC_PREINCREMENT,
95 /* %<--%> */
96 NIC_PREDECREMENT,
97 /* %<new%> */
98 NIC_NEW,
99 /* %<delete%> */
100 NIC_DEL,
101 /* calls to overloaded operators */
102 NIC_OVERLOADED,
103 /* an assignment */
104 NIC_ASSIGNMENT,
105 /* a comma operator */
106 NIC_COMMA,
107 /* a call to a constructor */
108 NIC_CONSTRUCTOR,
109 /* a transaction expression */
110 NIC_TRANSACTION
113 /* The various kinds of errors about name-lookup failing. */
115 /* NULL */
116 NLE_NULL,
117 /* is not a type */
118 NLE_TYPE,
119 /* is not a class or namespace */
120 NLE_CXX98,
121 /* is not a class, namespace, or enumeration */
122 NLE_NOT_CXX98
125 /* The various kinds of required token */
127 RT_NONE,
149 /* The type is CPP_KEYWORD */
178 RT_TRANSACTION_CANCEL /* __transaction_cancel */
181 /* Prototypes. */
187 static void cp_lexer_destroy
189 static int cp_lexer_saving_tokens
193 static void cp_lexer_get_preprocessor_token
201 static bool cp_lexer_next_token_is_not
203 static bool cp_lexer_next_token_is_keyword
207 static void cp_lexer_purge_token
209 static void cp_lexer_purge_tokens_after
211 static void cp_lexer_save_tokens
213 static void cp_lexer_commit_tokens
215 static void cp_lexer_rollback_tokens
217 static void cp_lexer_print_token
221 static void cp_lexer_start_debugging
223 static void cp_lexer_stop_debugging
229 static void cp_parser_initial_pragma
232 static tree cp_literal_operator_id
235 /* Manifest constants. */
236 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
237 #define CP_SAVED_TOKEN_STACK 5
239 /* Variables. */
241 /* The stream to which debugging output should be written. */
244 /* Nonzero if we are parsing an unevaluated operand: an operand to
245 sizeof, typeof, or alignof. */
248 /* Dump up to NUM tokens in BUFFER to FILE starting with token
249 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
250 first token in BUFFER. If NUM is 0, dump all the tokens. If
251 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
252 highlighted by surrounding it in [[ ]]. */
254 static void
258 {
275 {
278 }
283 {
290 nprinted++;
300 {
310 }
311 }
314 {
317 }
320 }
323 /* Dump all tokens in BUFFER to stderr. */
325 void
327 {
329 }
332 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
333 description for T. */
335 static void
337 {
339 {
342 }
343 }
346 /* Dump parser context C to FILE. */
348 static void
350 {
355 }
358 /* Print the stack of parsing contexts to FILE starting with FIRST. */
360 static void
362 {
368 {
371 }
372 }
375 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
377 static void
379 {
382 }
385 /* Print an unparsed function entry UF to FILE. */
387 static void
389 {
392 tree fn;
397 default_arg_fn);
398 i++)
399 {
405 }
410 {
413 }
419 {
422 }
424 }
427 /* Print the stack of unparsed member functions S to FILE. */
429 static void
432 {
438 {
441 }
442 }
445 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
446 the given PARSER. If FILE is NULL, the output is printed on stderr. */
448 static void
450 {
462 next_token);
463 }
466 /* Dump debugging information for the given PARSER. If FILE is NULL,
467 the output is printed on stderr. */
469 void
471 {
474 expanded_location eloc;
548 }
551 /* Allocate memory for a new lexer object and return it. */
555 {
560 /* Allocate the memory. */
563 /* Initially we are not debugging. */
567 CP_SAVED_TOKEN_STACK);
569 /* Create the buffer. */
573 }
576 /* Create a new main C++ lexer, the lexer that gets tokens from the
577 preprocessor. */
581 {
583 cp_token token;
585 /* It's possible that parsing the first pragma will load a PCH file,
586 which is a GC collection point. So we have to do that before
587 allocating any memory. */
592 /* Put the first token in the buffer. */
595 /* Get the remaining tokens from the preprocessor. */
597 {
600 }
609 /* Subsequent preprocessor diagnostics should use compiler
610 diagnostic functions to get the compiler source location. */
615 }
617 /* Create a new lexer whose token stream is primed with the tokens in
618 CACHE. When these tokens are exhausted, no new tokens will be read. */
622 {
627 /* We do not own the buffer. */
633 CP_SAVED_TOKEN_STACK);
635 /* Initially we are not debugging. */
640 }
642 /* Frees all resources associated with LEXER. */
644 static void
646 {
650 }
652 /* Returns nonzero if debugging information should be output. */
656 {
658 }
663 {
667 }
671 {
673 }
677 {
679 }
683 {
686 else
688 }
692 {
696 }
698 /* nonzero if we are presently saving tokens. */
702 {
704 }
706 /* Store the next token from the preprocessor in *TOKEN. Return true
707 if we reach EOF. If LEXER is NULL, assume we are handling an
708 initial #pragma pch_preprocess, and thus want the lexer to return
709 processed strings. */
711 static void
713 {
716 /* Get a new token from the preprocessor. */
717 token->type
724 /* On some systems, some header files are surrounded by an
725 implicit extern "C" block. Set a flag in the token if it
726 comes from such a header. */
731 /* Check to see if this token is a keyword. */
733 {
735 {
736 /* Mark this token as a keyword. */
738 /* Record which keyword. */
740 }
741 else
742 {
746 {
747 /* Warn about the C++0x keyword (but still treat it as
748 an identifier). */
753 /* Clear out the C_RID_CODE so we don't warn about this
754 particular identifier-turned-keyword again. */
756 }
760 }
761 }
763 {
764 /* This only happens in Objective-C++; it must be a keyword. */
767 {
768 /* Replace 'class' with '@class', 'private' with '@private',
769 etc. This prevents confusion with the C++ keyword
770 'class', and makes the tokens consistent with other
771 Objective-C 'AT' keywords. For example '@class' is
772 reported as RID_AT_CLASS which is consistent with
773 '@synchronized', which is reported as
774 RID_AT_SYNCHRONIZED.
775 */
784 }
785 }
787 {
788 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
792 }
793 }
795 /* Update the globals input_location and the input file stack from TOKEN. */
798 {
800 {
802 }
803 }
805 /* Return a pointer to the next token in the token stream, but do not
806 consume it. */
810 {
812 {
816 }
818 }
820 /* Return true if the next token has the indicated TYPE. */
824 {
826 }
828 /* Return true if the next token does not have the indicated TYPE. */
832 {
834 }
836 /* Return true if the next token is the indicated KEYWORD. */
840 {
842 }
844 /* Return true if the next token is not the indicated KEYWORD. */
848 {
850 }
852 /* Return true if the next token is a keyword for a decl-specifier. */
854 static bool
856 {
861 {
862 /* auto specifier: storage-class-specifier in C++,
863 simple-type-specifier in C++0x. */
865 /* Storage classes. */
871 /* Elaborated type specifiers. */
877 /* Simple type specifiers. */
892 /* GNU extensions. */
895 /* C++0x extensions. */
902 }
903 }
905 /* Returns TRUE iff the token T begins a decltype type. */
907 static bool
909 {
912 }
914 /* Returns TRUE iff the next token begins a decltype type. */
916 static bool
918 {
921 }
923 /* Return a pointer to the Nth token in the token stream. If N is 1,
924 then this is precisely equivalent to cp_lexer_peek_token (except
925 that it is not inline). One would like to disallow that case, but
926 there is one case (cp_parser_nth_token_starts_template_id) where
927 the caller passes a variable for N and it might be 1. */
931 {
934 /* N is 1-based, not zero-based. */
945 {
948 {
951 }
955 }
958 {
961 }
964 }
966 /* Return the next token, and advance the lexer's next_token pointer
967 to point to the next non-purged token. */
971 {
977 do
978 {
981 {
984 }
986 }
991 /* Provide debugging output. */
993 {
997 }
1000 }
1002 /* Permanently remove the next token from the token stream, and
1003 advance the next_token pointer to refer to the next non-purged
1004 token. */
1006 static void
1008 {
1017 do
1018 {
1019 tok++;
1021 {
1024 }
1025 }
1028 }
1030 /* Permanently remove all tokens after TOK, up to, but not
1031 including, the token that will be returned next by
1032 cp_lexer_peek_token. */
1034 static void
1036 {
1045 {
1050 }
1051 }
1053 /* Begin saving tokens. All tokens consumed after this point will be
1054 preserved. */
1056 static void
1058 {
1059 /* Provide debugging output. */
1065 }
1067 /* Commit to the portion of the token stream most recently saved. */
1069 static void
1071 {
1072 /* Provide debugging output. */
1077 }
1079 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1080 to the token stream. Stop saving tokens. */
1082 static void
1084 {
1085 /* Provide debugging output. */
1090 }
1092 /* Print a representation of the TOKEN on the STREAM. */
1094 static void
1096 {
1097 /* We don't use cpp_type2name here because the parser defines
1098 a few tokens of its own. */
1100 /* cpplib-defined token types */
1101 #define OP(e, s) #e,
1102 #define TK(e, s) #e,
1103 TTYPE_TABLE
1104 #undef OP
1105 #undef TK
1106 /* C++ parser token types - see "Manifest constants", above. */
1110 };
1112 /* For some tokens, print the associated data. */
1114 {
1116 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1117 For example, `struct' is mapped to an INTEGER_CST. */
1120 /* else fall through */
1138 /* If we have a name for the token, print it out. Otherwise, we
1139 simply give the numeric code. */
1142 else
1145 }
1146 }
1148 /* Start emitting debugging information. */
1150 static void
1152 {
1155 }
1157 /* Stop emitting debugging information. */
1159 static void
1161 {
1164 }
1166 /* Create a new cp_token_cache, representing a range of tokens. */
1170 {
1175 }
1177 \f
1178 /* Decl-specifiers. */
1180 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1182 static void
1184 {
1186 }
1188 /* Declarators. */
1190 /* Nothing other than the parser should be creating declarators;
1191 declarators are a semi-syntactic representation of C++ entities.
1192 Other parts of the front end that need to create entities (like
1193 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1208 /* An erroneous declarator. */
1211 /* The obstack on which declarators and related data structures are
1212 allocated. */
1215 /* Alloc BYTES from the declarator memory pool. */
1219 {
1221 }
1223 /* Allocate a declarator of the indicated KIND. Clear fields that are
1224 common to all declarators. */
1228 {
1239 }
1241 /* Make a declarator for a generalized identifier. If
1242 QUALIFYING_SCOPE is non-NULL, the identifier is
1243 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1244 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1245 is, if any. */
1249 special_function_kind sfk)
1250 {
1253 /* It is valid to write:
1255 class C { void f(); };
1256 typedef C D;
1257 void D::f();
1259 The standard is not clear about whether `typedef const C D' is
1260 legal; as of 2002-09-15 the committee is considering that
1261 question. EDG 3.0 allows that syntax. Therefore, we do as
1262 well. */
1276 }
1278 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1279 of modifiers such as const or volatile to apply to the pointer
1280 type, represented as identifiers. */
1282 cp_declarator *
1284 {
1292 {
1296 }
1297 else
1301 }
1303 /* Like make_pointer_declarator -- but for references. */
1305 cp_declarator *
1308 {
1316 {
1320 }
1321 else
1325 }
1327 /* Like make_pointer_declarator -- but for a pointer to a non-static
1328 member of CLASS_TYPE. */
1330 cp_declarator *
1333 {
1342 {
1345 }
1346 else
1350 }
1352 /* Make a declarator for the function given by TARGET, with the
1353 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1354 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1355 indicates what exceptions can be thrown. */
1357 cp_declarator *
1359 tree parms,
1360 cp_cv_quals cv_qualifiers,
1361 cp_virt_specifiers virt_specifiers,
1362 tree exception_specification,
1363 tree late_return_type)
1364 {
1375 {
1379 }
1380 else
1384 }
1386 /* Make a declarator for an array of BOUNDS elements, each of which is
1387 defined by ELEMENT. */
1389 cp_declarator *
1391 {
1398 {
1402 }
1403 else
1407 }
1409 /* Determine whether the declarator we've seen so far can be a
1410 parameter pack, when followed by an ellipsis. */
1411 static bool
1413 {
1414 /* Search for a declarator name, or any other declarator that goes
1415 after the point where the ellipsis could appear in a parameter
1416 pack. If we find any of these, then this declarator can not be
1417 made into a parameter pack. */
1420 {
1422 {
1434 }
1435 }
1438 }
1442 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1443 DECLARATOR and DEFAULT_ARGUMENT. */
1445 cp_parameter_declarator *
1448 tree default_argument)
1449 {
1457 else
1464 }
1466 /* Returns true iff DECLARATOR is a declaration for a function. */
1468 static bool
1470 {
1472 {
1480 }
1482 }
1484 /* The parser. */
1486 /* Overview
1487 --------
1489 A cp_parser parses the token stream as specified by the C++
1490 grammar. Its job is purely parsing, not semantic analysis. For
1491 example, the parser breaks the token stream into declarators,
1492 expressions, statements, and other similar syntactic constructs.
1493 It does not check that the types of the expressions on either side
1494 of an assignment-statement are compatible, or that a function is
1495 not declared with a parameter of type `void'.
1497 The parser invokes routines elsewhere in the compiler to perform
1498 semantic analysis and to build up the abstract syntax tree for the
1499 code processed.
1501 The parser (and the template instantiation code, which is, in a
1502 way, a close relative of parsing) are the only parts of the
1503 compiler that should be calling push_scope and pop_scope, or
1504 related functions. The parser (and template instantiation code)
1505 keeps track of what scope is presently active; everything else
1506 should simply honor that. (The code that generates static
1507 initializers may also need to set the scope, in order to check
1508 access control correctly when emitting the initializers.)
1510 Methodology
1511 -----------
1513 The parser is of the standard recursive-descent variety. Upcoming
1514 tokens in the token stream are examined in order to determine which
1515 production to use when parsing a non-terminal. Some C++ constructs
1516 require arbitrary look ahead to disambiguate. For example, it is
1517 impossible, in the general case, to tell whether a statement is an
1518 expression or declaration without scanning the entire statement.
1519 Therefore, the parser is capable of "parsing tentatively." When the
1520 parser is not sure what construct comes next, it enters this mode.
1521 Then, while we attempt to parse the construct, the parser queues up
1522 error messages, rather than issuing them immediately, and saves the
1523 tokens it consumes. If the construct is parsed successfully, the
1524 parser "commits", i.e., it issues any queued error messages and
1525 the tokens that were being preserved are permanently discarded.
1526 If, however, the construct is not parsed successfully, the parser
1527 rolls back its state completely so that it can resume parsing using
1528 a different alternative.
1530 Future Improvements
1531 -------------------
1533 The performance of the parser could probably be improved substantially.
1534 We could often eliminate the need to parse tentatively by looking ahead
1535 a little bit. In some places, this approach might not entirely eliminate
1536 the need to parse tentatively, but it might still speed up the average
1537 case. */
1539 /* Flags that are passed to some parsing functions. These values can
1540 be bitwise-ored together. */
1542 enum
1543 {
1544 /* No flags. */
1546 /* The construct is optional. If it is not present, then no error
1547 should be issued. */
1549 /* When parsing a type-specifier, treat user-defined type-names
1550 as non-type identifiers. */
1552 /* When parsing a type-specifier, do not try to parse a class-specifier
1553 or enum-specifier. */
1555 /* When parsing a decl-specifier-seq, only allow type-specifier or
1556 constexpr. */
1558 };
1560 /* This type is used for parameters and variables which hold
1561 combinations of the above flags. */
1564 /* The different kinds of declarators we want to parse. */
1567 {
1568 /* We want an abstract declarator. */
1569 CP_PARSER_DECLARATOR_ABSTRACT,
1570 /* We want a named declarator. */
1571 CP_PARSER_DECLARATOR_NAMED,
1572 /* We don't mind, but the name must be an unqualified-id. */
1573 CP_PARSER_DECLARATOR_EITHER
1576 /* The precedence values used to parse binary expressions. The minimum value
1577 of PREC must be 1, because zero is reserved to quickly discriminate
1578 binary operators from other tokens. */
1580 enum cp_parser_prec
1581 {
1582 PREC_NOT_OPERATOR,
1583 PREC_LOGICAL_OR_EXPRESSION,
1584 PREC_LOGICAL_AND_EXPRESSION,
1585 PREC_INCLUSIVE_OR_EXPRESSION,
1586 PREC_EXCLUSIVE_OR_EXPRESSION,
1587 PREC_AND_EXPRESSION,
1588 PREC_EQUALITY_EXPRESSION,
1589 PREC_RELATIONAL_EXPRESSION,
1590 PREC_SHIFT_EXPRESSION,
1591 PREC_ADDITIVE_EXPRESSION,
1592 PREC_MULTIPLICATIVE_EXPRESSION,
1593 PREC_PM_EXPRESSION,
1594 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1595 };
1597 /* A mapping from a token type to a corresponding tree node type, with a
1598 precedence value. */
1601 {
1602 /* The token type. */
1604 /* The corresponding tree code. */
1606 /* The precedence of this operator. */
1611 {
1612 /* Left hand side of the binary operation we are currently
1613 parsing. */
1614 tree lhs;
1615 /* Original tree code for left hand side, if it was a binary
1616 expression itself (used for -Wparentheses). */
1618 /* Tree code for the binary operation we are parsing. */
1620 /* Precedence of the binary operation we are parsing. */
1622 /* Location of the binary operation we are parsing. */
1623 location_t loc;
1626 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1627 entries because precedence levels on the stack are monotonically
1628 increasing. */
1632 /* Prototypes. */
1634 /* Constructors and destructors. */
1639 /* Class variables. */
1643 /* The operator-precedence table used by cp_parser_binary_expression.
1644 Transformed into an associative array (binops_by_token) by
1645 cp_parser_new. */
1678 };
1680 /* The same as binops, but initialized by cp_parser_new so that
1681 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1682 for speed. */
1685 /* Constructors and destructors. */
1687 /* Construct a new context. The context below this one on the stack
1688 is given by NEXT. */
1692 {
1695 /* Allocate the storage. */
1697 {
1698 /* Pull the first entry from the free list. */
1702 }
1703 else
1706 /* No errors have occurred yet in this context. */
1708 /* If this is not the bottommost context, copy information that we
1709 need from the previous context. */
1711 {
1712 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1713 expression, then we are parsing one in this context, too. */
1715 /* Thread the stack. */
1717 }
1720 }
1722 /* Managing the unparsed function queues. */
1724 #define unparsed_funs_with_default_args \
1725 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues).funs_with_default_args
1726 #define unparsed_funs_with_definitions \
1727 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues).funs_with_definitions
1728 #define unparsed_nsdmis \
1729 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues).nsdmis
1731 static void
1733 {
1739 }
1741 static void
1743 {
1746 }
1748 /* Prototypes. */
1750 /* Constructors and destructors. */
1755 /* Routines to parse various constructs.
1757 Those that return `tree' will return the error_mark_node (rather
1758 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1759 Sometimes, they will return an ordinary node if error-recovery was
1760 attempted, even though a parse error occurred. So, to check
1761 whether or not a parse error occurred, you should always use
1762 cp_parser_error_occurred. If the construct is optional (indicated
1763 either by an `_opt' in the name of the function that does the
1764 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1765 the construct is not present. */
1767 /* Lexical conventions [gram.lex] */
1769 static tree cp_parser_identifier
1771 static tree cp_parser_string_literal
1773 static tree cp_parser_userdef_char_literal
1775 static tree cp_parser_userdef_string_literal
1777 static tree cp_parser_userdef_numeric_literal
1780 /* Basic concepts [gram.basic] */
1782 static bool cp_parser_translation_unit
1785 /* Expressions [gram.expr] */
1787 static tree cp_parser_primary_expression
1789 static tree cp_parser_id_expression
1791 static tree cp_parser_unqualified_id
1793 static tree cp_parser_nested_name_specifier_opt
1795 static tree cp_parser_nested_name_specifier
1797 static tree cp_parser_qualifying_entity
1799 static tree cp_parser_postfix_expression
1801 static tree cp_parser_postfix_open_square_expression
1803 static tree cp_parser_postfix_dot_deref_expression
1807 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1809 static void cp_parser_pseudo_destructor_name
1811 static tree cp_parser_unary_expression
1813 static enum tree_code cp_parser_unary_operator
1815 static tree cp_parser_new_expression
1819 static tree cp_parser_new_type_id
1827 static tree cp_parser_delete_expression
1829 static tree cp_parser_cast_expression
1831 static tree cp_parser_binary_expression
1833 static tree cp_parser_question_colon_clause
1835 static tree cp_parser_assignment_expression
1837 static enum tree_code cp_parser_assignment_operator_opt
1839 static tree cp_parser_expression
1841 static tree cp_parser_constant_expression
1843 static tree cp_parser_builtin_offsetof
1845 static tree cp_parser_lambda_expression
1847 static void cp_parser_lambda_introducer
1849 static bool cp_parser_lambda_declarator_opt
1851 static void cp_parser_lambda_body
1854 /* Statements [gram.stmt.stmt] */
1856 static void cp_parser_statement
1858 static void cp_parser_label_for_labeled_statement
1860 static tree cp_parser_expression_statement
1862 static tree cp_parser_compound_statement
1864 static void cp_parser_statement_seq_opt
1866 static tree cp_parser_selection_statement
1868 static tree cp_parser_condition
1870 static tree cp_parser_iteration_statement
1872 static bool cp_parser_for_init_statement
1874 static tree cp_parser_for
1876 static tree cp_parser_c_for
1878 static tree cp_parser_range_for
1880 static void do_range_for_auto_deduction
1882 static tree cp_parser_perform_range_for_lookup
1884 static tree cp_parser_range_for_member_function
1886 static tree cp_parser_jump_statement
1888 static void cp_parser_declaration_statement
1891 static tree cp_parser_implicitly_scoped_statement
1893 static void cp_parser_already_scoped_statement
1896 /* Declarations [gram.dcl.dcl] */
1898 static void cp_parser_declaration_seq_opt
1900 static void cp_parser_declaration
1902 static void cp_parser_block_declaration
1904 static void cp_parser_simple_declaration
1906 static void cp_parser_decl_specifier_seq
1908 static tree cp_parser_storage_class_specifier_opt
1910 static tree cp_parser_function_specifier_opt
1912 static tree cp_parser_type_specifier
1915 static tree cp_parser_simple_type_specifier
1917 static tree cp_parser_type_name
1919 static tree cp_parser_nonclass_name
1921 static tree cp_parser_elaborated_type_specifier
1923 static tree cp_parser_enum_specifier
1925 static void cp_parser_enumerator_list
1927 static void cp_parser_enumerator_definition
1929 static tree cp_parser_namespace_name
1931 static void cp_parser_namespace_definition
1933 static void cp_parser_namespace_body
1935 static tree cp_parser_qualified_namespace_specifier
1937 static void cp_parser_namespace_alias_definition
1939 static bool cp_parser_using_declaration
1941 static void cp_parser_using_directive
1943 static tree cp_parser_alias_declaration
1945 static void cp_parser_asm_definition
1947 static void cp_parser_linkage_specification
1949 static void cp_parser_static_assert
1951 static tree cp_parser_decltype
1954 /* Declarators [gram.dcl.decl] */
1956 static tree cp_parser_init_declarator
1957 (cp_parser *, cp_decl_specifier_seq *, VEC (deferred_access_check,gc)*, bool, bool, int, bool *, tree *);
1962 static enum tree_code cp_parser_ptr_operator
1964 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
1966 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
1968 static tree cp_parser_late_return_type_opt
1970 static tree cp_parser_declarator_id
1972 static tree cp_parser_type_id
1974 static tree cp_parser_template_type_arg
1977 static tree cp_parser_type_id_1
1979 static void cp_parser_type_specifier_seq
1981 static tree cp_parser_parameter_declaration_clause
1983 static tree cp_parser_parameter_declaration_list
1987 static tree cp_parser_default_argument
1989 static void cp_parser_function_body
1991 static tree cp_parser_initializer
1993 static tree cp_parser_initializer_clause
1995 static tree cp_parser_braced_list
2000 static bool cp_parser_ctor_initializer_opt_and_function_body
2003 /* Classes [gram.class] */
2005 static tree cp_parser_class_name
2007 static tree cp_parser_class_specifier
2009 static tree cp_parser_class_head
2011 static enum tag_types cp_parser_class_key
2013 static void cp_parser_member_specification_opt
2015 static void cp_parser_member_declaration
2017 static tree cp_parser_pure_specifier
2019 static tree cp_parser_constant_initializer
2022 /* Derived classes [gram.class.derived] */
2024 static tree cp_parser_base_clause
2026 static tree cp_parser_base_specifier
2029 /* Special member functions [gram.special] */
2031 static tree cp_parser_conversion_function_id
2033 static tree cp_parser_conversion_type_id
2037 static bool cp_parser_ctor_initializer_opt
2039 static void cp_parser_mem_initializer_list
2041 static tree cp_parser_mem_initializer
2043 static tree cp_parser_mem_initializer_id
2046 /* Overloading [gram.over] */
2048 static tree cp_parser_operator_function_id
2050 static tree cp_parser_operator
2053 /* Templates [gram.temp] */
2055 static void cp_parser_template_declaration
2057 static tree cp_parser_template_parameter_list
2059 static tree cp_parser_template_parameter
2061 static tree cp_parser_type_parameter
2063 static tree cp_parser_template_id
2065 static tree cp_parser_template_name
2067 static tree cp_parser_template_argument_list
2069 static tree cp_parser_template_argument
2071 static void cp_parser_explicit_instantiation
2073 static void cp_parser_explicit_specialization
2076 /* Exception handling [gram.exception] */
2078 static tree cp_parser_try_block
2080 static bool cp_parser_function_try_block
2082 static void cp_parser_handler_seq
2084 static void cp_parser_handler
2086 static tree cp_parser_exception_declaration
2088 static tree cp_parser_throw_expression
2090 static tree cp_parser_exception_specification_opt
2092 static tree cp_parser_type_id_list
2095 /* GNU Extensions */
2097 static tree cp_parser_asm_specification_opt
2099 static tree cp_parser_asm_operand_list
2101 static tree cp_parser_asm_clobber_list
2103 static tree cp_parser_asm_label_list
2105 static tree cp_parser_attributes_opt
2107 static tree cp_parser_attribute_list
2109 static bool cp_parser_extension_opt
2111 static void cp_parser_label_declaration
2114 /* Transactional Memory Extensions */
2116 static tree cp_parser_transaction
2118 static tree cp_parser_transaction_expression
2120 static bool cp_parser_function_transaction
2122 static tree cp_parser_transaction_cancel
2126 static bool cp_parser_pragma
2129 /* Objective-C++ Productions */
2131 static tree cp_parser_objc_message_receiver
2133 static tree cp_parser_objc_message_args
2135 static tree cp_parser_objc_message_expression
2137 static tree cp_parser_objc_encode_expression
2139 static tree cp_parser_objc_defs_expression
2141 static tree cp_parser_objc_protocol_expression
2143 static tree cp_parser_objc_selector_expression
2145 static tree cp_parser_objc_expression
2147 static bool cp_parser_objc_selector_p
2149 static tree cp_parser_objc_selector
2151 static tree cp_parser_objc_protocol_refs_opt
2153 static void cp_parser_objc_declaration
2155 static tree cp_parser_objc_statement
2157 static bool cp_parser_objc_valid_prefix_attributes
2159 static void cp_parser_objc_at_property_declaration
2161 static void cp_parser_objc_at_synthesize_declaration
2163 static void cp_parser_objc_at_dynamic_declaration
2165 static tree cp_parser_objc_struct_declaration
2168 /* Utility Routines */
2170 static tree cp_parser_lookup_name
2172 static tree cp_parser_lookup_name_simple
2174 static tree cp_parser_maybe_treat_template_as_class
2176 static bool cp_parser_check_declarator_template_parameters
2178 static bool cp_parser_check_template_parameters
2180 static tree cp_parser_simple_cast_expression
2182 static tree cp_parser_global_scope_opt
2184 static bool cp_parser_constructor_declarator_p
2186 static tree cp_parser_function_definition_from_specifiers_and_declarator
2188 static tree cp_parser_function_definition_after_declarator
2190 static void cp_parser_template_declaration_after_export
2192 static void cp_parser_perform_template_parameter_access_checks
2194 static tree cp_parser_single_declaration
2196 static tree cp_parser_functional_cast
2198 static tree cp_parser_save_member_function_body
2200 static tree cp_parser_save_nsdmi
2202 static tree cp_parser_enclosed_template_argument_list
2204 static void cp_parser_save_default_args
2206 static void cp_parser_late_parsing_for_member
2208 static tree cp_parser_late_parse_one_default_arg
2210 static void cp_parser_late_parsing_nsdmi
2212 static void cp_parser_late_parsing_default_args
2214 static tree cp_parser_sizeof_operand
2216 static tree cp_parser_trait_expr
2218 static bool cp_parser_declares_only_class_p
2220 static void cp_parser_set_storage_class
2222 static void cp_parser_set_decl_spec_type
2224 static void set_and_check_decl_spec_loc
2227 static bool cp_parser_friend_p
2229 static void cp_parser_required_error
2235 static bool cp_parser_token_starts_function_definition_p
2237 static bool cp_parser_next_token_starts_class_definition_p
2239 static bool cp_parser_next_token_ends_template_argument_p
2241 static bool cp_parser_nth_token_starts_template_argument_list_p
2243 static enum tag_types cp_parser_token_is_class_key
2245 static void cp_parser_check_class_key
2247 static void cp_parser_check_access_in_redeclaration
2249 static bool cp_parser_optional_template_keyword
2251 static void cp_parser_pre_parsed_nested_name_specifier
2253 static bool cp_parser_cache_group
2255 static tree cp_parser_cache_defarg
2257 static void cp_parser_parse_tentatively
2259 static void cp_parser_commit_to_tentative_parse
2261 static void cp_parser_abort_tentative_parse
2263 static bool cp_parser_parse_definitely
2267 static bool cp_parser_uncommitted_to_tentative_parse_p
2269 static void cp_parser_error
2271 static void cp_parser_name_lookup_error
2273 static bool cp_parser_simulate_error
2275 static bool cp_parser_check_type_definition
2277 static void cp_parser_check_for_definition_in_return_type
2279 static void cp_parser_check_for_invalid_template_id
2281 static bool cp_parser_non_integral_constant_expression
2283 static void cp_parser_diagnose_invalid_type_name
2285 static bool cp_parser_parse_and_diagnose_invalid_type_name
2287 static int cp_parser_skip_to_closing_parenthesis
2289 static void cp_parser_skip_to_end_of_statement
2291 static void cp_parser_consume_semicolon_at_end_of_statement
2293 static void cp_parser_skip_to_end_of_block_or_statement
2295 static bool cp_parser_skip_to_closing_brace
2297 static void cp_parser_skip_to_end_of_template_parameter_list
2299 static void cp_parser_skip_to_pragma_eol
2301 static bool cp_parser_error_occurred
2303 static bool cp_parser_allow_gnu_extensions_p
2305 static bool cp_parser_is_pure_string_literal
2307 static bool cp_parser_is_string_literal
2309 static bool cp_parser_is_keyword
2311 static tree cp_parser_make_typename_type
2316 /* Returns nonzero if we are parsing tentatively. */
2320 {
2322 }
2324 /* Returns nonzero if TOKEN is a string literal. */
2326 static bool
2328 {
2334 }
2336 /* Returns nonzero if TOKEN is a string literal
2337 of a user-defined string literal. */
2339 static bool
2341 {
2348 }
2350 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2352 static bool
2354 {
2356 }
2358 /* If not parsing tentatively, issue a diagnostic of the form
2359 FILE:LINE: MESSAGE before TOKEN
2360 where TOKEN is the next token in the input stream. MESSAGE
2361 (specified by the caller) is usually of the form "expected
2362 OTHER-TOKEN". */
2364 static void
2366 {
2368 {
2370 /* This diagnostic makes more sense if it is tagged to the line
2371 of the token we just peeked at. */
2375 {
2380 }
2383 /* Because c_parser_error does not understand
2384 CPP_KEYWORD, keywords are treated like
2385 identifiers. */
2388 }
2389 }
2391 /* Issue an error about name-lookup failing. NAME is the
2392 IDENTIFIER_NODE DECL is the result of
2393 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2394 the thing that we hoped to find. */
2396 static void
2398 tree name,
2399 tree decl,
2400 name_lookup_error desired,
2401 location_t location)
2402 {
2403 /* If name lookup completely failed, tell the user that NAME was not
2404 declared. */
2406 {
2419 else
2421 }
2423 {
2425 {
2442 }
2443 }
2445 {
2447 {
2457 name);
2461 }
2462 }
2463 else
2464 {
2466 {
2479 }
2480 }
2481 }
2483 /* If we are parsing tentatively, remember that an error has occurred
2484 during this tentative parse. Returns true if the error was
2485 simulated; false if a message should be issued by the caller. */
2487 static bool
2489 {
2491 {
2494 }
2496 }
2498 /* This function is called when a type is defined. If type
2499 definitions are forbidden at this point, an error message is
2500 issued. */
2502 static bool
2504 {
2505 /* If types are forbidden here, issue a message. */
2507 {
2508 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2509 in the message need to be interpreted. */
2512 }
2514 }
2516 /* This function is called when the DECLARATOR is processed. The TYPE
2517 was a type defined in the decl-specifiers. If it is invalid to
2518 define a type in the decl-specifiers for DECLARATOR, an error is
2519 issued. TYPE_LOCATION is the location of TYPE and is used
2520 for error reporting. */
2522 static void
2525 {
2526 /* [dcl.fct] forbids type definitions in return types.
2527 Unfortunately, it's not easy to know whether or not we are
2528 processing a return type until after the fact. */
2536 {
2541 type);
2542 }
2543 }
2545 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2546 "<" in any valid C++ program. If the next token is indeed "<",
2547 issue a message warning the user about what appears to be an
2548 invalid attempt to form a template-id. LOCATION is the location
2549 of the type-specifier (TYPE) */
2551 static void
2553 tree type,
2555 location_t location)
2556 {
2560 {
2564 {
2567 else
2569 }
2570 else
2572 /* Remember the location of the invalid "<". */
2575 /* Consume the "<". */
2577 /* Parse the template arguments. */
2579 /* Permanently remove the invalid template arguments so that
2580 this error message is not issued again. */
2583 }
2584 }
2586 /* If parsing an integral constant-expression, issue an error message
2587 about the fact that THING appeared and return true. Otherwise,
2588 return false. In either case, set
2589 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2591 static bool
2593 non_integral_constant thing)
2594 {
2597 {
2599 {
2602 {
2609 "enumeration type cannot appear in a "
2700 }
2704 }
2705 }
2707 }
2709 /* Emit a diagnostic for an invalid type name. SCOPE is the
2710 qualifying scope (or NULL, if none) for ID. This function commits
2711 to the current active tentative parse, if any. (Otherwise, the
2712 problematic construct might be encountered again later, resulting
2713 in duplicate error messages.) LOCATION is the location of ID. */
2715 static void
2718 location_t location)
2719 {
2722 /* Try to lookup the identifier. */
2727 /* If the lookup found a template-name, it means that the user forgot
2728 to specify an argument list. Emit a useful error message. */
2732 decl);
2736 /* Something like 'unsigned A a;' */
2739 {
2740 /* Issue an error message. */
2742 /* If we're in a template class, it's possible that the user was
2743 referring to a type from a base class. For example:
2745 template <typename T> struct A { typedef T X; };
2746 template <typename T> struct B : public A<T> { X x; };
2748 The user should have said "typename A<T>::X". */
2754 {
2755 tree b;
2758 b;
2760 {
2764 {
2765 tree field;
2766 /* Go from a particular instantiation of the
2767 template (which will have an empty TYPE_FIELDs),
2768 to the main version. */
2771 field;
2775 {
2780 }
2783 }
2784 }
2785 }
2786 }
2787 /* Here we diagnose qualified-ids where the scope is actually correct,
2788 but the identifier does not resolve to a valid type name. */
2790 {
2796 {
2797 /* A<T>::A<T>() */
2803 }
2812 else
2814 }
2815 }
2817 /* Check for a common situation where a type-name should be present,
2818 but is not, and issue a sensible error message. Returns true if an
2819 invalid type-name was detected.
2821 The situation handled by this function are variable declarations of the
2822 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2823 Usually, `ID' should name a type, but if we got here it means that it
2824 does not. We try to emit the best possible error message depending on
2825 how exactly the id-expression looks like. */
2827 static bool
2829 {
2830 tree id;
2833 /* Avoid duplicate error about ambiguous lookup. */
2835 {
2839 }
2848 /* If the next token is a (, this is a function with no explicit return
2849 type, i.e. constructor, destructor or conversion op. */
2852 {
2855 }
2859 /* Emit a diagnostic for the invalid type. */
2862 out:
2863 /* If we aren't in the middle of a declarator (i.e. in a
2864 parameter-declaration-clause), skip to the end of the declaration;
2865 there's no point in trying to process it. */
2869 }
2871 /* Consume tokens up to, and including, the next non-nested closing `)'.
2872 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2873 are doing error recovery. Returns -1 if OR_COMMA is true and we
2874 found an unnested comma. */
2876 static int
2881 {
2891 {
2895 {
2898 /* If we've run out of tokens, then there is no closing `)'. */
2901 /* This is good for lambda expression capture-lists. */
2911 /* This matches the processing in skip_to_end_of_statement. */
2937 {
2941 }
2946 }
2948 /* Consume the token. */
2950 }
2951 }
2953 /* Consume tokens until we reach the end of the current statement.
2954 Normally, that will be just before consuming a `;'. However, if a
2955 non-nested `}' comes first, then we stop before consuming that. */
2957 static void
2959 {
2963 {
2967 {
2970 /* If we've run out of tokens, stop. */
2974 /* If the next token is a `;', we have reached the end of the
2975 statement. */
2981 /* If this is a non-nested '}', stop before consuming it.
2982 That way, when confronted with something like:
2984 { 3 + }
2986 we stop before consuming the closing '}', even though we
2987 have not yet reached a `;'. */
2991 /* If it is the closing '}' for a block that we have
2992 scanned, stop -- but only after consuming the token.
2993 That way given:
2995 void f g () { ... }
2996 typedef int I;
2998 we will stop after the body of the erroneously declared
2999 function, but before consuming the following `typedef'
3000 declaration. */
3002 {
3005 }
3013 }
3015 /* Consume the token. */
3017 }
3018 }
3020 /* This function is called at the end of a statement or declaration.
3021 If the next token is a semicolon, it is consumed; otherwise, error
3022 recovery is attempted. */
3024 static void
3026 {
3027 /* Look for the trailing `;'. */
3029 {
3030 /* If there is additional (erroneous) input, skip to the end of
3031 the statement. */
3033 /* If the next token is now a `;', consume it. */
3036 }
3037 }
3039 /* Skip tokens until we have consumed an entire block, or until we
3040 have consumed a non-nested `;'. */
3042 static void
3044 {
3048 {
3052 {
3055 /* If we've run out of tokens, stop. */
3059 /* Stop if this is an unnested ';'. */
3065 /* Stop if this is an unnested '}', or closes the outermost
3066 nesting level. */
3067 nesting_depth--;
3075 /* Nest. */
3076 nesting_depth++;
3081 }
3083 /* Consume the token. */
3085 }
3086 }
3088 /* Skip tokens until a non-nested closing curly brace is the next
3089 token, or there are no more tokens. Return true in the first case,
3090 false otherwise. */
3092 static bool
3094 {
3098 {
3102 {
3105 /* If we've run out of tokens, stop. */
3109 /* If the next token is a non-nested `}', then we have reached
3110 the end of the current block. */
3116 /* If it the next token is a `{', then we are entering a new
3117 block. Consume the entire block. */
3123 }
3125 /* Consume the token. */
3127 }
3128 }
3130 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3131 parameter is the PRAGMA token, allowing us to purge the entire pragma
3132 sequence. */
3134 static void
3136 {
3141 do
3145 /* Ensure that the pragma is not parsed again. */
3147 }
3149 /* Require pragma end of line, resyncing with it as necessary. The
3150 arguments are as for cp_parser_skip_to_pragma_eol. */
3152 static void
3154 {
3158 }
3160 /* This is a simple wrapper around make_typename_type. When the id is
3161 an unresolved identifier node, we can provide a superior diagnostic
3162 using cp_parser_diagnose_invalid_type_name. */
3164 static tree
3167 {
3168 tree result;
3170 {
3176 }
3178 }
3180 /* This is a wrapper around the
3181 make_{pointer,ptrmem,reference}_declarator functions that decides
3182 which one to call based on the CODE and CLASS_TYPE arguments. The
3183 CODE argument should be one of the values returned by
3184 cp_parser_ptr_operator. */
3187 cp_cv_quals cv_qualifiers,
3189 {
3196 else
3203 }
3205 /* Create a new C++ parser. */
3209 {
3214 /* cp_lexer_new_main is called before doing GC allocation because
3215 cp_lexer_new_main might load a PCH file. */
3218 /* Initialize the binops_by_token so that we can get the tree
3219 directly from the token. */
3227 /* For now, we always accept GNU extensions. */
3230 /* The `>' token is a greater-than operator, not the end of a
3231 template-id. */
3236 /* We are not parsing a constant-expression. */
3241 /* Local variable names are not forbidden. */
3244 /* We are not processing an `extern "C"' declaration. */
3247 /* We are not processing a declarator. */
3250 /* We are not processing a template-argument-list. */
3253 /* We are not in an iteration statement. */
3256 /* We are not in a switch statement. */
3259 /* We are not parsing a type-id inside an expression. */
3262 /* Declarations aren't implicitly extern "C". */
3265 /* String literals should be translated to the execution character set. */
3268 /* We are not parsing a function body. */
3271 /* We can correct until told otherwise. */
3274 /* The unparsed function queue is empty. */
3277 /* There are no classes being defined. */
3280 /* No template parameters apply. */
3284 }
3286 /* Create a cp_lexer structure which will emit the tokens in CACHE
3287 and push it onto the parser's lexer stack. This is used for delayed
3288 parsing of in-class method bodies and default arguments, and should
3289 not be confused with tentative parsing. */
3290 static void
3292 {
3297 /* Move the current source position to that of the first token in the
3298 new lexer. */
3300 }
3302 /* Pop the top lexer off the parser stack. This is never used for the
3303 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3304 static void
3306 {
3311 /* Put the current source position back where it was before this
3312 lexer was pushed. */
3314 }
3316 /* Lexical conventions [gram.lex] */
3318 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3319 identifier. */
3321 static tree
3323 {
3326 /* Look for the identifier. */
3328 /* Return the value. */
3330 }
3332 /* Parse a sequence of adjacent string constants. Returns a
3333 TREE_STRING representing the combined, nul-terminated string
3334 constant. If TRANSLATE is true, translate the string to the
3335 execution character set. If WIDE_OK is true, a wide string is
3336 invalid here.
3338 C++98 [lex.string] says that if a narrow string literal token is
3339 adjacent to a wide string literal token, the behavior is undefined.
3340 However, C99 6.4.5p4 says that this results in a wide string literal.
3341 We follow C99 here, for consistency with the C front end.
3343 This code is largely lifted from lex_string() in c-lex.c.
3345 FUTURE: ObjC++ will need to handle @-strings here. */
3346 static tree
3348 {
3349 tree value;
3356 tree string_tree;
3362 {
3365 }
3368 {
3372 }
3373 else
3374 {
3377 }
3380 /* Try to avoid the overhead of creating and destroying an obstack
3381 for the common case of just one string. */
3384 {
3392 {
3396 }
3397 else
3401 }
3402 else
3403 {
3407 do
3408 {
3410 count++;
3415 {
3418 {
3421 }
3424 {
3429 }
3431 }
3432 else
3436 {
3441 "unsupported non-standard concatenation "
3443 }
3449 {
3453 }
3454 else
3455 {
3459 }
3460 }
3464 }
3467 {
3470 }
3474 {
3479 {
3494 }
3499 {
3503 }
3504 }
3505 else
3506 /* cpp_interpret_string has issued an error. */
3513 }
3515 /* Look up a literal operator with the name and the exact arguments. */
3517 static tree
3519 {
3526 {
3533 {
3536 {
3546 }
3549 /* May be this should be sufficient_parms_p instead,
3550 depending on how exactly should user-defined literals
3551 work in presence of default arguments on the literal
3552 operator parameters. */
3555 }
3556 }
3559 }
3561 /* Parse a user-defined char constant. Returns a call to a user-defined
3562 literal operator taking the character as an argument. */
3564 static tree
3566 {
3574 /* Build up a call to the user-defined operator */
3575 /* Lookup the name we got back from the id-expression. */
3580 {
3585 }
3594 }
3596 /* A subroutine of cp_parser_userdef_numeric_literal to
3597 create a char... template parameter pack from a string node. */
3599 static tree
3601 {
3602 tree charvec;
3608 /* Fill in CHARVEC with all of the parameters. */
3613 /* Build the argument packs. */
3620 }
3622 /* Parse a user-defined numeric constant. returns a call to a user-defined
3623 literal operator. */
3625 static tree
3627 {
3637 /* Look for a literal operator taking the exact type of numeric argument
3638 as the literal value. */
3643 {
3646 {
3649 }
3650 }
3653 /* If the numeric argument didn't work, look for a raw literal
3654 operator taking a const char* argument consisting of the number
3655 in string format. */
3660 {
3663 {
3666 }
3667 }
3670 /* If the raw literal didn't work, look for a non-type template
3671 function with parameter pack char.... Call the function with
3672 template parameter characters representing the number. */
3676 {
3681 {
3684 }
3685 }
3690 }
3692 /* Parse a user-defined string constant. Returns a call to a user-defined
3693 literal operator taking a character pointer and the length of the string
3694 as arguments. */
3696 static tree
3698 {
3707 /* Build up a call to the user-defined operator */
3708 /* Lookup the name we got back from the id-expression. */
3714 {
3718 }
3727 }
3730 /* Basic concepts [gram.basic] */
3732 /* Parse a translation-unit.
3734 translation-unit:
3735 declaration-seq [opt]
3737 Returns TRUE if all went well. */
3739 static bool
3741 {
3742 /* The address of the first non-permanent object on the declarator
3743 obstack. */
3748 /* Create the declarator obstack, if necessary. */
3750 {
3752 /* Create the error declarator. */
3754 /* Create the empty parameter list. */
3756 /* Remember where the base of the declarator obstack lies. */
3758 }
3762 /* If there are no tokens left then all went well. */
3764 {
3765 /* Get rid of the token array; we don't need it any more. */
3769 /* This file might have been a context that's implicitly extern
3770 "C". If so, pop the lang context. (Only relevant for PCH.) */
3772 {
3775 }
3777 /* Finish up. */
3781 }
3782 else
3783 {
3786 }
3788 /* Make sure the declarator obstack was fully cleaned up. */
3792 /* All went well. */
3794 }
3796 /* Expressions [gram.expr] */
3798 /* Parse a primary-expression.
3800 primary-expression:
3801 literal
3802 this
3803 ( expression )
3804 id-expression
3806 GNU Extensions:
3808 primary-expression:
3809 ( compound-statement )
3810 __builtin_va_arg ( assignment-expression , type-id )
3811 __builtin_offsetof ( type-id , offsetof-expression )
3813 C++ Extensions:
3814 __has_nothrow_assign ( type-id )
3815 __has_nothrow_constructor ( type-id )
3816 __has_nothrow_copy ( type-id )
3817 __has_trivial_assign ( type-id )
3818 __has_trivial_constructor ( type-id )
3819 __has_trivial_copy ( type-id )
3820 __has_trivial_destructor ( type-id )
3821 __has_virtual_destructor ( type-id )
3822 __is_abstract ( type-id )
3823 __is_base_of ( type-id , type-id )
3824 __is_class ( type-id )
3825 __is_convertible_to ( type-id , type-id )
3826 __is_empty ( type-id )
3827 __is_enum ( type-id )
3828 __is_final ( type-id )
3829 __is_literal_type ( type-id )
3830 __is_pod ( type-id )
3831 __is_polymorphic ( type-id )
3832 __is_std_layout ( type-id )
3833 __is_trivial ( type-id )
3834 __is_union ( type-id )
3836 Objective-C++ Extension:
3838 primary-expression:
3839 objc-expression
3841 literal:
3842 __null
3844 ADDRESS_P is true iff this expression was immediately preceded by
3845 "&" and therefore might denote a pointer-to-member. CAST_P is true
3846 iff this expression is the target of a cast. TEMPLATE_ARG_P is
3847 true iff this expression is a template argument.
3849 Returns a representation of the expression. Upon return, *IDK
3850 indicates what kind of id-expression (if any) was present. */
3852 static tree
3858 {
3861 /* Assume the primary expression is not an id-expression. */
3864 /* Peek at the next token. */
3867 {
3868 /* literal:
3869 integer-literal
3870 character-literal
3871 floating-literal
3872 string-literal
3873 boolean-literal
3874 pointer-literal
3875 user-defined-literal */
3885 {
3889 }
3890 /* Floating-point literals are only allowed in an integral
3891 constant expression if they are cast to an integral or
3892 enumeration type. */
3896 {
3897 /* CAST_P will be set even in invalid code like "int(2.7 +
3898 ...)". Therefore, we have to check that the next token
3899 is sure to end the cast. */
3901 {
3906 enumerator-definition. */
3908 /* The curly brace at the end of an enum-specifier. */
3910 /* The end of a statement. */
3912 /* The end of the cast-expression. */
3914 /* The end of an array bound. */
3916 /* The closing ">" in a template-argument-list. */
3919 /* C++0x only: A ">>" treated like two ">" tokens,
3920 in a template-argument-list. */
3925 }
3927 /* If we are within a cast, then the constraint that the
3928 cast is to an integral or enumeration type will be
3929 checked at that point. If we are not within a cast, then
3930 this code is invalid. */
3933 }
3952 /* ??? Should wide strings be allowed when parser->translate_strings_p
3953 is false (i.e. in attributes)? If not, we can kill the third
3954 argument to cp_parser_string_literal. */
3960 {
3961 tree expr;
3964 /* Consume the `('. */
3966 /* Within a parenthesized expression, a `>' token is always
3967 the greater-than operator. */
3968 saved_greater_than_is_operator_p
3971 /* If we see `( { ' then we are looking at the beginning of
3972 a GNU statement-expression. */
3975 {
3976 /* Statement-expressions are not allowed by the standard. */
3980 /* And they're not allowed outside of a function-body; you
3981 cannot, for example, write:
3983 int i = ({ int j = 3; j + 1; });
3985 at class or namespace scope. */
3988 {
3990 "statement-expressions are not allowed outside "
3994 }
3995 else
3996 {
3997 /* Start the statement-expression. */
3999 /* Parse the compound-statement. */
4001 /* Finish up. */
4003 }
4004 }
4005 else
4006 {
4007 /* Parse the parenthesized expression. */
4009 /* Let the front end know that this expression was
4010 enclosed in parentheses. This matters in case, for
4011 example, the expression is of the form `A::B', since
4012 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4013 not. */
4015 /* DR 705: Wrapping an unqualified name in parentheses
4016 suppresses arg-dependent lookup. We want to pass back
4017 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4018 (c++/37862), but none of the others. */
4021 }
4022 /* The `>' token might be the end of a template-id or
4023 template-parameter-list now. */
4024 parser->greater_than_is_operator_p
4026 /* Consume the `)'. */
4031 }
4035 /* We have an Objective-C++ message. */
4037 {
4039 /* Don't warn about a failed tentative parse. */
4044 }
4048 /* We have an Objective-C++ string literal. */
4055 {
4056 /* These two are the boolean literals. */
4064 /* The `__null' literal. */
4069 /* The `nullptr' literal. */
4074 /* Recognize the `this' keyword. */
4078 {
4082 }
4083 /* Pointers cannot appear in constant-expressions. */
4088 /* The `operator' keyword can be the beginning of an
4089 id-expression. */
4096 {
4097 non_integral_constant name;
4099 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4100 __func__ are the names of variables -- but they are
4101 treated specially. Therefore, they are handled here,
4102 rather than relying on the generic id-expression logic
4103 below. Grammatically, these names are id-expressions.
4105 Consume the token. */
4109 {
4121 }
4126 /* Look up the name. */
4128 }
4131 {
4132 tree expression;
4133 tree type;
4134 source_location type_location;
4136 /* The `__builtin_va_arg' construct is used to handle
4137 `va_arg'. Consume the `__builtin_va_arg' token. */
4139 /* Look for the opening `('. */
4141 /* Now, parse the assignment-expression. */
4144 /* Look for the `,'. */
4147 /* Parse the type-id. */
4149 /* Look for the closing `)'. */
4151 /* Using `va_arg' in a constant-expression is not
4152 allowed. */
4154 NIC_VA_ARG))
4157 }
4185 /* Objective-C++ expressions. */
4195 {
4200 }
4204 }
4206 /* An id-expression can start with either an identifier, a
4207 `::' as the beginning of a qualified-id, or the "operator"
4208 keyword. */
4213 {
4214 tree id_expression;
4215 tree decl;
4221 id_expression:
4222 /* Parse the id-expression. */
4223 id_expression
4240 /* If we have a template-id, then no further lookup is
4241 required. If the template-id was for a template-class, we
4242 will sometimes have a TYPE_DECL at this point. */
4246 /* Look up the name. */
4247 else
4248 {
4249 tree ambiguous_decls;
4251 /* If we already know that this lookup is ambiguous, then
4252 we've already issued an error message; there's no reason
4253 to check again. */
4256 {
4259 }
4262 none_type,
4263 template_p,
4268 /* If the lookup was ambiguous, an error will already have
4269 been issued. */
4273 /* In Objective-C++, we may have an Objective-C 2.0
4274 dot-syntax for classes here. */
4279 {
4280 tree component;
4287 }
4289 /* In Objective-C++, an instance variable (ivar) may be preferred
4290 to whatever cp_parser_lookup_name() found. */
4293 /* If name lookup gives us a SCOPE_REF, then the
4294 qualifying scope was dependent. */
4296 {
4297 /* At this point, we do not know if DECL is a valid
4298 integral constant expression. We assume that it is
4299 in fact such an expression, so that code like:
4301 template <int N> struct A {
4302 int a[B<N>::i];
4303 };
4305 is accepted. At template-instantiation time, we
4306 will check that B<N>::i is actually a constant. */
4308 }
4309 /* Check to see if DECL is a local variable in a context
4310 where that is forbidden. */
4313 {
4314 /* It might be that we only found DECL because we are
4315 trying to be generous with pre-ISO scoping rules.
4316 For example, consider:
4318 int i;
4319 void g() {
4320 for (int i = 0; i < 10; ++i) {}
4321 extern void f(int j = i);
4322 }
4324 Here, name look up will originally find the out
4325 of scope `i'. We need to issue a warning message,
4326 but then use the global `i'. */
4329 {
4332 decl);
4334 }
4335 }
4336 }
4338 decl = (finish_id_expression
4340 idk,
4345 template_arg_p,
4351 }
4353 /* Anything else is an error. */
4357 }
4358 }
4360 /* Parse an id-expression.
4362 id-expression:
4363 unqualified-id
4364 qualified-id
4366 qualified-id:
4367 :: [opt] nested-name-specifier template [opt] unqualified-id
4368 :: identifier
4369 :: operator-function-id
4370 :: template-id
4372 Return a representation of the unqualified portion of the
4373 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4374 a `::' or nested-name-specifier.
4376 Often, if the id-expression was a qualified-id, the caller will
4377 want to make a SCOPE_REF to represent the qualified-id. This
4378 function does not do this in order to avoid wastefully creating
4379 SCOPE_REFs when they are not required.
4381 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4382 `template' keyword.
4384 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4385 uninstantiated templates.
4387 If *TEMPLATE_P is non-NULL, it is set to true iff the
4388 `template' keyword is used to explicitly indicate that the entity
4389 named is a template.
4391 If DECLARATOR_P is true, the id-expression is appearing as part of
4392 a declarator, rather than as part of an expression. */
4394 static tree
4401 {
4405 /* Assume the `template' keyword was not used. */
4409 /* Look for the optional `::' operator. */
4410 global_scope_p
4413 /* Look for the optional nested-name-specifier. */
4414 nested_name_specifier_p
4417 check_dependency_p,
4419 declarator_p)
4421 /* If there is a nested-name-specifier, then we are looking at
4422 the first qualified-id production. */
4424 {
4425 tree saved_scope;
4426 tree saved_object_scope;
4427 tree saved_qualifying_scope;
4428 tree unqualified_id;
4431 /* See if the next token is the `template' keyword. */
4435 /* Name lookup we do during the processing of the
4436 unqualified-id might obliterate SCOPE. */
4440 /* Process the final unqualified-id. */
4442 check_dependency_p,
4443 declarator_p,
4445 /* Restore the SAVED_SCOPE for our caller. */
4451 }
4452 /* Otherwise, if we are in global scope, then we are looking at one
4453 of the other qualified-id productions. */
4455 {
4457 tree id;
4459 /* Peek at the next token. */
4462 /* If it's an identifier, and the next token is not a "<", then
4463 we can avoid the template-id case. This is an optimization
4464 for this common case. */
4466 && !cp_parser_nth_token_starts_template_argument_list_p
4471 /* Try a template-id. */
4475 none_type,
4476 declarator_p);
4477 /* If that worked, we're done. */
4481 /* Peek at the next token. (Changes in the token buffer may
4482 have invalidated the pointer obtained above.) */
4486 {
4493 /* Fall through. */
4498 }
4499 }
4500 else
4503 declarator_p,
4504 optional_p);
4505 }
4507 /* Parse an unqualified-id.
4509 unqualified-id:
4510 identifier
4511 operator-function-id
4512 conversion-function-id
4513 ~ class-name
4514 template-id
4516 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4517 keyword, in a construct like `A::template ...'.
4519 Returns a representation of unqualified-id. For the `identifier'
4520 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4521 production a BIT_NOT_EXPR is returned; the operand of the
4522 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4523 other productions, see the documentation accompanying the
4524 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4525 names are looked up in uninstantiated templates. If DECLARATOR_P
4526 is true, the unqualified-id is appearing as part of a declarator,
4527 rather than as part of an expression. */
4529 static tree
4535 {
4538 /* Peek at the next token. */
4542 {
4544 {
4545 tree id;
4547 /* We don't know yet whether or not this will be a
4548 template-id. */
4550 /* Try a template-id. */
4552 check_dependency_p,
4553 none_type,
4554 declarator_p);
4555 /* If it worked, we're done. */
4558 /* Otherwise, it's an ordinary identifier. */
4560 }
4564 check_dependency_p,
4565 none_type,
4566 declarator_p);
4569 {
4570 tree type_decl;
4571 tree qualifying_scope;
4572 tree object_scope;
4573 tree scope;
4576 /* Consume the `~' token. */
4578 /* Parse the class-name. The standard, as written, seems to
4579 say that:
4581 template <typename T> struct S { ~S (); };
4582 template <typename T> S<T>::~S() {}
4584 is invalid, since `~' must be followed by a class-name, but
4585 `S<T>' is dependent, and so not known to be a class.
4586 That's not right; we need to look in uninstantiated
4587 templates. A further complication arises from:
4589 template <typename T> void f(T t) {
4590 t.T::~T();
4591 }
4593 Here, it is not possible to look up `T' in the scope of `T'
4594 itself. We must look in both the current scope, and the
4595 scope of the containing complete expression.
4597 Yet another issue is:
4599 struct S {
4600 int S;
4601 ~S();
4602 };
4604 S::~S() {}
4606 The standard does not seem to say that the `S' in `~S'
4607 should refer to the type `S' and not the data member
4608 `S::S'. */
4610 /* DR 244 says that we look up the name after the "~" in the
4611 same scope as we looked up the qualifying name. That idea
4612 isn't fully worked out; it's more complicated than that. */
4617 /* Check for invalid scopes. */
4619 {
4623 }
4625 {
4629 scope);
4634 }
4637 /* If the name is of the form "X::~X" it's OK even if X is a
4638 typedef. */
4647 {
4650 }
4652 /* If there was an explicit qualification (S::~T), first look
4653 in the scope given by the qualification (i.e., S).
4655 Note: in the calls to cp_parser_class_name below we pass
4656 typename_type so that lookup finds the injected-class-name
4657 rather than the constructor. */
4661 {
4666 typename_type,
4669 declarator_p);
4672 }
4673 /* In "N::S::~S", look in "N" as well. */
4675 {
4680 type_decl
4684 typename_type,
4687 declarator_p);
4690 }
4691 /* In "p->S::~T", look in the scope given by "*p" as well. */
4693 {
4698 type_decl
4702 typename_type,
4705 declarator_p);
4708 }
4709 /* Look in the surrounding context. */
4711 {
4717 type_decl
4721 typename_type,
4724 declarator_p);
4727 {
4728 /* We couldn't find a type with this name, so just accept
4729 it and check for a match at instantiation time. */
4734 }
4735 }
4736 /* If an error occurred, assume that the name of the
4737 destructor is the same as the name of the qualifying
4738 class. That allows us to keep parsing after running
4739 into ill-formed destructor names. */
4745 /* Check that destructor name and scope match. */
4747 {
4754 }
4756 /* [class.dtor]
4758 A typedef-name that names a class shall not be used as the
4759 identifier in the declarator for a destructor declaration. */
4766 type_decl);
4769 }
4773 {
4774 tree id;
4776 /* This could be a template-id, so we try that first. */
4778 /* Try a template-id. */
4781 none_type,
4782 declarator_p);
4783 /* If that worked, we're done. */
4786 /* We still don't know whether we're looking at an
4787 operator-function-id or a conversion-function-id. */
4789 /* Try an operator-function-id. */
4791 /* If that didn't work, try a conversion-function-id. */
4795 {
4796 /* 17.6.3.3.5 */
4801 }
4804 }
4805 /* Fall through. */
4812 }
4813 }
4815 /* Parse an (optional) nested-name-specifier.
4817 nested-name-specifier: [C++98]
4818 class-or-namespace-name :: nested-name-specifier [opt]
4819 class-or-namespace-name :: template nested-name-specifier [opt]
4821 nested-name-specifier: [C++0x]
4822 type-name ::
4823 namespace-name ::
4824 nested-name-specifier identifier ::
4825 nested-name-specifier template [opt] simple-template-id ::
4827 PARSER->SCOPE should be set appropriately before this function is
4828 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
4829 effect. TYPE_P is TRUE if we non-type bindings should be ignored
4830 in name lookups.
4832 Sets PARSER->SCOPE to the class (TYPE) or namespace
4833 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
4834 it unchanged if there is no nested-name-specifier. Returns the new
4835 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
4837 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
4838 part of a declaration and/or decl-specifier. */
4840 static tree
4846 {
4851 /* Remember where the nested-name-specifier starts. */
4853 {
4856 }
4859 {
4860 tree new_scope;
4861 tree old_scope;
4862 tree saved_qualifying_scope;
4865 /* Spot cases that cannot be the beginning of a
4866 nested-name-specifier. */
4869 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
4870 the already parsed nested-name-specifier. */
4872 {
4873 /* Grab the nested-name-specifier and continue the loop. */
4875 /* If we originally encountered this nested-name-specifier
4876 with IS_DECLARATION set to false, we will not have
4877 resolved TYPENAME_TYPEs, so we must do so here. */
4880 {
4885 }
4888 }
4890 /* Spot cases that cannot be the beginning of a
4891 nested-name-specifier. On the second and subsequent times
4892 through the loop, we look for the `template' keyword. */
4894 ;
4895 /* A template-id can start a nested-name-specifier. */
4897 ;
4898 /* DR 743: decltype can be used in a nested-name-specifier. */
4900 ;
4901 else
4902 {
4903 /* If the next token is not an identifier, then it is
4904 definitely not a type-name or namespace-name. */
4907 /* If the following token is neither a `<' (to begin a
4908 template-id), nor a `::', then we are not looking at a
4909 nested-name-specifier. */
4915 {
4919 }
4922 && !cp_parser_nth_token_starts_template_argument_list_p
4925 }
4927 /* The nested-name-specifier is optional, so we parse
4928 tentatively. */
4931 /* Look for the optional `template' keyword, if this isn't the
4932 first time through the loop. */
4935 else
4938 /* Save the old scope since the name lookup we are about to do
4939 might destroy it. */
4942 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
4943 look up names in "X<T>::I" in order to determine that "Y" is
4944 a template. So, if we have a typename at this point, we make
4945 an effort to look through it. */
4947 && !typename_keyword_p
4952 /* Parse the qualifying entity. */
4953 new_scope
4955 typename_keyword_p,
4956 template_keyword_p,
4957 check_dependency_p,
4958 type_p,
4959 is_declaration);
4960 /* Look for the `::' token. */
4963 /* If we found what we wanted, we keep going; otherwise, we're
4964 done. */
4966 {
4969 /* Restore the OLD_SCOPE since it was valid before the
4970 failed attempt at finding the last
4971 class-or-namespace-name. */
4975 /* If the next token is a decltype, and the one after that is a
4976 `::', then the decltype has failed to resolve to a class or
4977 enumeration type. Give this error even when parsing
4978 tentatively since it can't possibly be valid--and we're going
4979 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
4980 won't get another chance.*/
4984 {
4991 /* As below. */
4994 }
4998 /* If the next token is an identifier, and the one after
4999 that is a `::', then any valid interpretation would have
5000 found a class-or-namespace-name. */
5006 {
5009 {
5011 {
5012 tree decl;
5013 tree ambiguous_decls;
5016 none_type,
5025 decl);
5027 {
5033 }
5034 else
5035 {
5037 cp_parser_name_lookup_error
5040 else
5041 cp_parser_name_lookup_error
5044 }
5045 }
5048 /* Treat this as a successful nested-name-specifier
5049 due to:
5051 [basic.lookup.qual]
5053 If the name found is not a class-name (clause
5054 _class_) or namespace-name (_namespace.def_), the
5055 program is ill-formed. */
5057 }
5059 }
5061 }
5062 /* We've found one valid nested-name-specifier. */
5064 /* Name lookup always gives us a DECL. */
5067 /* Uses of "template" must be followed by actual templates. */
5079 new_scope);
5080 /* If it is a class scope, try to complete it; we are about to
5081 be looking up names inside the class. */
5083 /* Since checking types for dependency can be expensive,
5084 avoid doing it if the type is already complete. */
5086 /* Do not try to complete dependent types. */
5088 {
5090 /* If it is a typedef to current class, use the current
5091 class instead, as the typedef won't have any names inside
5092 it yet. */
5096 }
5097 /* Make sure we look in the right scope the next time through
5098 the loop. */
5100 }
5102 /* If parsing tentatively, replace the sequence of tokens that makes
5103 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5104 token. That way, should we re-parse the token stream, we will
5105 not have to repeat the effort required to do the parse, nor will
5106 we issue duplicate error messages. */
5108 {
5112 /* Reset the contents of the START token. */
5114 /* Retrieve any deferred checks. Do not pop this access checks yet
5115 so the memory will not be reclaimed during token replacing below. */
5123 /* Purge all subsequent tokens. */
5125 }
5131 }
5133 /* Parse a nested-name-specifier. See
5134 cp_parser_nested_name_specifier_opt for details. This function
5135 behaves identically, except that it will an issue an error if no
5136 nested-name-specifier is present. */
5138 static tree
5144 {
5145 tree scope;
5147 /* Look for the nested-name-specifier. */
5149 typename_keyword_p,
5150 check_dependency_p,
5151 type_p,
5152 is_declaration);
5153 /* If it was not present, issue an error message. */
5155 {
5158 }
5161 }
5163 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5164 this is either a class-name or a namespace-name (which corresponds
5165 to the class-or-namespace-name production in the grammar). For
5166 C++0x, it can also be a type-name that refers to an enumeration
5167 type or a simple-template-id.
5169 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5170 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5171 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5172 TYPE_P is TRUE iff the next name should be taken as a class-name,
5173 even the same name is declared to be another entity in the same
5174 scope.
5176 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5177 specified by the class-or-namespace-name. If neither is found the
5178 ERROR_MARK_NODE is returned. */
5180 static tree
5187 {
5188 tree saved_scope;
5189 tree saved_qualifying_scope;
5190 tree saved_object_scope;
5191 tree scope;
5195 /* DR 743: decltype can appear in a nested-name-specifier. */
5197 {
5201 {
5204 }
5208 }
5210 /* Before we try to parse the class-name, we must save away the
5211 current PARSER->SCOPE since cp_parser_class_name will destroy
5212 it. */
5216 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5217 there is no need to look for a namespace-name. */
5218 only_class_p = template_keyword_p
5223 typename_keyword_p,
5224 template_keyword_p,
5226 check_dependency_p,
5228 is_declaration);
5230 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5234 {
5235 /* Restore the saved scope. */
5240 /* Parse tentatively. */
5243 /* Parse a type-name */
5246 /* "If the name found does not designate a namespace or a class,
5247 enumeration, or dependent type, the program is ill-formed."
5249 We cover classes and dependent types above and namespaces below,
5250 so this code is only looking for enums. */
5256 }
5257 /* If that didn't work, try for a namespace-name. */
5259 {
5260 /* Restore the saved scope. */
5264 /* If we are not looking at an identifier followed by the scope
5265 resolution operator, then this is not part of a
5266 nested-name-specifier. (Note that this function is only used
5267 to parse the components of a nested-name-specifier.) */
5272 }
5275 }
5277 /* Parse a postfix-expression.
5279 postfix-expression:
5280 primary-expression
5281 postfix-expression [ expression ]
5282 postfix-expression ( expression-list [opt] )
5283 simple-type-specifier ( expression-list [opt] )
5284 typename :: [opt] nested-name-specifier identifier
5285 ( expression-list [opt] )
5286 typename :: [opt] nested-name-specifier template [opt] template-id
5287 ( expression-list [opt] )
5288 postfix-expression . template [opt] id-expression
5289 postfix-expression -> template [opt] id-expression
5290 postfix-expression . pseudo-destructor-name
5291 postfix-expression -> pseudo-destructor-name
5292 postfix-expression ++
5293 postfix-expression --
5294 dynamic_cast < type-id > ( expression )
5295 static_cast < type-id > ( expression )
5296 reinterpret_cast < type-id > ( expression )
5297 const_cast < type-id > ( expression )
5298 typeid ( expression )
5299 typeid ( type-id )
5301 GNU Extension:
5303 postfix-expression:
5304 ( type-id ) { initializer-list , [opt] }
5306 This extension is a GNU version of the C99 compound-literal
5307 construct. (The C99 grammar uses `type-name' instead of `type-id',
5308 but they are essentially the same concept.)
5310 If ADDRESS_P is true, the postfix expression is the operand of the
5311 `&' operator. CAST_P is true if this expression is the target of a
5312 cast.
5314 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5315 class member access expressions [expr.ref].
5317 Returns a representation of the expression. */
5319 static tree
5323 {
5330 /* Peek at the next token. */
5332 /* Some of the productions are determined by keywords. */
5335 {
5340 {
5341 tree type;
5342 tree expression;
5345 /* All of these can be handled in the same way from the point
5346 of view of parsing. Begin by consuming the token
5347 identifying the cast. */
5350 /* New types cannot be defined in the cast. */
5352 parser->type_definition_forbidden_message
5355 /* Look for the opening `<'. */
5357 /* Parse the type to which we are casting. */
5359 /* Look for the closing `>'. */
5361 /* Restore the old message. */
5364 /* And the expression which is being cast. */
5369 /* Only type conversions to integral or enumeration types
5370 can be used in constant-expressions. */
5376 {
5378 postfix_expression
5382 postfix_expression
5386 postfix_expression
5388 tf_warning_or_error);
5391 postfix_expression
5396 }
5397 }
5401 {
5402 tree type;
5406 /* Consume the `typeid' token. */
5408 /* Look for the `(' token. */
5410 /* Types cannot be defined in a `typeid' expression. */
5412 parser->type_definition_forbidden_message
5414 /* We can't be sure yet whether we're looking at a type-id or an
5415 expression. */
5417 /* Try a type-id first. */
5422 /* Look for the `)' token. Otherwise, we can't be sure that
5423 we're not looking at an expression: consider `typeid (int
5424 (3))', for example. */
5426 /* If all went well, simply lookup the type-id. */
5429 /* Otherwise, fall back to the expression variant. */
5430 else
5431 {
5432 tree expression;
5434 /* Look for an expression. */
5436 /* Compute its typeid. */
5438 /* Look for the `)' token. */
5440 }
5441 /* Restore the saved message. */
5443 /* `typeid' may not appear in an integral constant expression. */
5446 }
5450 {
5451 tree type;
5452 /* The syntax permitted here is the same permitted for an
5453 elaborated-type-specifier. */
5458 }
5462 {
5465 tree p;
5479 return
5480 c_build_vec_perm_expr
5485 return
5486 c_build_vec_perm_expr
5490 else
5491 {
5495 }
5497 }
5500 {
5501 tree type;
5503 /* If the next thing is a simple-type-specifier, we may be
5504 looking at a functional cast. We could also be looking at
5505 an id-expression. So, we try the functional cast, and if
5506 that doesn't work we fall back to the primary-expression. */
5508 /* Look for the simple-type-specifier. */
5511 CP_PARSER_FLAGS_NONE);
5512 /* Parse the cast itself. */
5514 postfix_expression
5516 /* If that worked, we're done. */
5520 /* If the functional-cast didn't work out, try a
5521 compound-literal. */
5524 {
5529 /* Consume the `('. */
5531 /* Parse the type. */
5536 /* Look for the `)'. */
5538 /* Look for the `{'. */
5540 /* If things aren't going well, there's no need to
5541 keep going. */
5543 {
5545 /* Parse the initializer-list. */
5546 initializer_list
5548 /* Allow a trailing `,'. */
5551 /* Look for the final `}'. */
5553 }
5554 /* If that worked, we're definitely looking at a
5555 compound-literal expression. */
5557 {
5558 /* Warn the user that a compound literal is not
5559 allowed in standard C++. */
5561 /* For simplicity, we disallow compound literals in
5562 constant-expressions. We could
5563 allow compound literals of integer type, whose
5564 initializer was a constant, in constant
5565 expressions. Permitting that usage, as a further
5566 extension, would not change the meaning of any
5567 currently accepted programs. (Of course, as
5568 compound literals are not part of ISO C++, the
5569 standard has nothing to say.) */
5571 NIC_NCC))
5572 {
5575 }
5576 /* Form the representation of the compound-literal. */
5577 postfix_expression
5578 = (finish_compound_literal
5580 initializer_list),
5581 tf_warning_or_error));
5583 }
5584 }
5586 /* It must be a primary-expression. */
5587 postfix_expression
5591 }
5593 }
5595 /* Keep looping until the postfix-expression is complete. */
5597 {
5601 /* It is not a Koenig lookup function call. */
5602 postfix_expression
5605 /* Peek at the next token. */
5609 {
5611 postfix_expression
5613 postfix_expression,
5620 /* postfix-expression ( expression-list [opt] ) */
5621 {
5630 is_builtin_constant_p
5633 {
5634 /* The whole point of __builtin_constant_p is to allow
5635 non-constant expressions to appear as arguments. */
5636 saved_integral_constant_expression_p
5638 saved_non_integral_constant_expression_p
5641 }
5642 args = (cp_parser_parenthesized_expression_list
5647 {
5648 parser->integral_constant_expression_p
5650 parser->non_integral_constant_expression_p
5652 }
5655 {
5658 }
5660 /* Function calls are not permitted in
5661 constant-expressions. */
5664 NIC_FUNC_CALL))
5665 {
5669 }
5674 {
5676 {
5678 {
5681 postfix_expression
5684 tf_warning_or_error);
5685 }
5686 else
5687 postfix_expression
5689 }
5690 /* We do not perform argument-dependent lookup if
5691 normal lookup finds a non-function, in accordance
5692 with the expected resolution of DR 218. */
5695 {
5699 /* Do not do argument dependent lookup if regular
5700 lookup finds a member function or a block-scope
5701 function declaration. [basic.lookup.argdep]/3 */
5704 {
5707 postfix_expression
5710 tf_warning_or_error);
5711 }
5712 }
5713 }
5716 {
5726 {
5727 postfix_expression
5731 }
5734 {
5735 postfix_expression
5736 = (build_new_method_call
5742 tf_warning_or_error));
5743 }
5744 else
5745 postfix_expression
5749 tf_warning_or_error);
5750 }
5754 postfix_expression = (build_offset_ref_call_from_tree
5757 /* A call to a static class member, or a namespace-scope
5758 function. */
5759 postfix_expression
5762 koenig_p,
5763 tf_warning_or_error);
5764 else
5765 /* All other function calls. */
5766 postfix_expression
5769 koenig_p,
5770 tf_warning_or_error);
5772 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
5776 }
5781 /* postfix-expression . template [opt] id-expression
5782 postfix-expression . pseudo-destructor-name
5783 postfix-expression -> template [opt] id-expression
5784 postfix-expression -> pseudo-destructor-name */
5786 /* Consume the `.' or `->' operator. */
5789 postfix_expression
5791 postfix_expression,
5799 /* postfix-expression ++ */
5800 /* Consume the `++' token. */
5802 /* Generate a representation for the complete expression. */
5803 postfix_expression
5805 POSTINCREMENT_EXPR);
5806 /* Increments may not appear in constant-expressions. */
5814 /* postfix-expression -- */
5815 /* Consume the `--' token. */
5817 /* Generate a representation for the complete expression. */
5818 postfix_expression
5820 POSTDECREMENT_EXPR);
5821 /* Decrements may not appear in constant-expressions. */
5833 else
5835 }
5836 }
5838 /* We should never get here. */
5841 }
5843 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5844 by cp_parser_builtin_offsetof. We're looking for
5846 postfix-expression [ expression ]
5847 postfix-expression [ braced-init-list ] (C++11)
5849 FOR_OFFSETOF is set if we're being called in that context, which
5850 changes how we deal with integer constant expressions. */
5852 static tree
5854 tree postfix_expression,
5856 {
5857 tree index;
5860 /* Consume the `[' token. */
5863 /* Parse the index expression. */
5864 /* ??? For offsetof, there is a question of what to allow here. If
5865 offsetof is not being used in an integral constant expression context,
5866 then we *could* get the right answer by computing the value at runtime.
5867 If we are in an integral constant expression context, then we might
5868 could accept any constant expression; hard to say without analysis.
5869 Rather than open the barn door too wide right away, allow only integer
5870 constant expressions here. */
5873 else
5874 {
5876 {
5880 }
5881 else
5883 }
5885 /* Look for the closing `]'. */
5888 /* Build the ARRAY_REF. */
5891 /* When not doing offsetof, array references are not permitted in
5892 constant-expressions. */
5898 }
5900 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5901 by cp_parser_builtin_offsetof. We're looking for
5903 postfix-expression . template [opt] id-expression
5904 postfix-expression . pseudo-destructor-name
5905 postfix-expression -> template [opt] id-expression
5906 postfix-expression -> pseudo-destructor-name
5908 FOR_OFFSETOF is set if we're being called in that context. That sorta
5909 limits what of the above we'll actually accept, but nevermind.
5910 TOKEN_TYPE is the "." or "->" token, which will already have been
5911 removed from the stream. */
5913 static tree
5916 tree postfix_expression,
5918 location_t location)
5919 {
5920 tree name;
5925 /* If this is a `->' operator, dereference the pointer. */
5928 tf_warning_or_error);
5929 /* Check to see whether or not the expression is type-dependent. */
5931 /* The identifier following the `->' or `.' is not qualified. */
5937 /* Enter the scope corresponding to the type of the object
5938 given by the POSTFIX_EXPRESSION. */
5940 {
5942 /* According to the standard, no expression should ever have
5943 reference type. Unfortunately, we do not currently match
5944 the standard in this respect in that our internal representation
5945 of an expression may have reference type even when the standard
5946 says it does not. Therefore, we have to manually obtain the
5947 underlying type here. */
5949 /* The type of the POSTFIX_EXPRESSION must be complete. */
5951 {
5953 postfix_expression);
5955 }
5956 /* Unlike the object expression in other contexts, *this is not
5957 required to be of complete type for purposes of class member
5958 access (5.2.5) outside the member function body. */
5962 /* Let the name lookup machinery know that we are processing a
5963 class member access expression. */
5965 /* If something went wrong, we want to be able to discern that case,
5966 as opposed to the case where there was no SCOPE due to the type
5967 of expression being dependent. */
5970 /* If the SCOPE was erroneous, make the various semantic analysis
5971 functions exit quickly -- and without issuing additional error
5972 messages. */
5975 }
5977 /* Assume this expression is not a pseudo-destructor access. */
5980 /* If the SCOPE is a scalar type, then, if this is a valid program,
5981 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
5982 is type dependent, it can be pseudo-destructor-name or something else.
5983 Try to parse it as pseudo-destructor-name first. */
5985 {
5986 tree s;
5987 tree type;
5990 /* Parse the pseudo-destructor-name. */
5999 {
6001 postfix_expression
6004 }
6005 }
6008 {
6009 /* If the SCOPE is not a scalar type, we are looking at an
6010 ordinary class member access expression, rather than a
6011 pseudo-destructor-name. */
6014 /* Parse the id-expression. */
6015 name = (cp_parser_id_expression
6022 /* In general, build a SCOPE_REF if the member name is qualified.
6023 However, if the name was not dependent and has already been
6024 resolved; there is no need to build the SCOPE_REF. For example;
6026 struct X { void f(); };
6027 template <typename T> void f(T* t) { t->X::f(); }
6029 Even though "t" is dependent, "X::f" is not and has been resolved
6030 to a BASELINK; there is no need to include scope information. */
6032 /* But we do need to remember that there was an explicit scope for
6033 virtual function calls. */
6037 /* If the name is a template-id that names a type, we will get a
6038 TYPE_DECL here. That is invalid code. */
6040 {
6043 }
6044 else
6045 {
6047 {
6049 {
6053 }
6054 else
6057 name,
6058 template_p);
6062 }
6064 adjust_result_of_qualified_name_lookup
6066 postfix_expression
6068 template_p,
6069 tf_warning_or_error);
6070 }
6071 }
6073 /* We no longer need to look up names in the scope of the object on
6074 the left-hand side of the `.' or `->' operator. */
6077 /* Outside of offsetof, these operators may not appear in
6078 constant-expressions. */
6080 && (cp_parser_non_integral_constant_expression
6085 }
6087 /* Parse a parenthesized expression-list.
6089 expression-list:
6090 assignment-expression
6091 expression-list, assignment-expression
6093 attribute-list:
6094 expression-list
6095 identifier
6096 identifier, expression-list
6098 CAST_P is true if this expression is the target of a cast.
6100 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6101 argument pack.
6103 Returns a vector of trees. Each element is a representation of an
6104 assignment-expression. NULL is returned if the ( and or ) are
6105 missing. An empty, but allocated, vector is returned on no
6106 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6107 if we are parsing an attribute list for an attribute that wants a
6108 plain identifier argument, normal_attr for an attribute that wants
6109 an expression, or non_attr if we aren't parsing an attribute list. If
6110 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6111 not all of the expressions in the list were constant. */
6119 {
6125 /* Assume all the expressions will be constant. */
6134 /* Within a parenthesized expression, a `>' token is always
6135 the greater-than operator. */
6136 saved_greater_than_is_operator_p
6140 /* Consume expressions until there are no more. */
6143 {
6144 tree expr;
6146 /* At the beginning of attribute lists, check to see if the
6147 next token is an identifier. */
6150 {
6153 /* Consume the identifier. */
6155 /* Save the identifier. */
6157 }
6158 else
6159 {
6162 /* Parse the next assignment-expression. */
6164 {
6165 /* A braced-init-list. */
6170 }
6172 {
6173 expr = (cp_parser_constant_expression
6178 }
6179 else
6185 /* If we have an ellipsis, then this is an expression
6186 expansion. */
6189 {
6190 /* Consume the `...'. */
6193 /* Build the argument pack. */
6195 }
6197 /* Add it to the list. We add error_mark_node
6198 expressions to the list, so that we can still tell if
6199 the correct form for a parenthesized expression-list
6200 is found. That gives better errors. */
6205 }
6207 /* After the first item, attribute lists look the same as
6208 expression lists. */
6211 get_comma:;
6212 /* If the next token isn't a `,', then we are done. */
6216 /* Otherwise, consume the `,' and keep going. */
6218 }
6221 {
6224 skip_comma:;
6225 /* We try and resync to an unnested comma, as that will give the
6226 user better diagnostics. */
6234 {
6235 parser->greater_than_is_operator_p
6238 }
6239 }
6241 parser->greater_than_is_operator_p
6248 }
6250 /* Parse a pseudo-destructor-name.
6252 pseudo-destructor-name:
6253 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6254 :: [opt] nested-name-specifier template template-id :: ~ type-name
6255 :: [opt] nested-name-specifier [opt] ~ type-name
6257 If either of the first two productions is used, sets *SCOPE to the
6258 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6259 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6260 or ERROR_MARK_NODE if the parse fails. */
6262 static void
6266 {
6269 /* Assume that things will not work out. */
6272 /* Look for the optional `::' operator. */
6274 /* Look for the optional nested-name-specifier. */
6275 nested_name_specifier_p
6282 /* Now, if we saw a nested-name-specifier, we might be doing the
6283 second production. */
6286 {
6287 /* Consume the `template' keyword. */
6289 /* Parse the template-id. */
6293 class_type,
6295 /* Look for the `::' token. */
6297 }
6298 /* If the next token is not a `~', then there might be some
6299 additional qualification. */
6301 {
6302 /* At this point, we're looking for "type-name :: ~". The type-name
6303 must not be a class-name, since this is a pseudo-destructor. So,
6304 it must be either an enum-name, or a typedef-name -- both of which
6305 are just identifiers. So, we peek ahead to check that the "::"
6306 and "~" tokens are present; if they are not, then we can avoid
6307 calling type_name. */
6311 {
6314 }
6316 /* Look for the type-name. */
6321 /* Look for the `::' token. */
6323 }
6324 else
6327 /* Look for the `~'. */
6330 /* Once we see the ~, this has to be a pseudo-destructor. */
6334 /* Look for the type-name again. We are not responsible for
6335 checking that it matches the first type-name. */
6337 }
6339 /* Parse a unary-expression.
6341 unary-expression:
6342 postfix-expression
6343 ++ cast-expression
6344 -- cast-expression
6345 unary-operator cast-expression
6346 sizeof unary-expression
6347 sizeof ( type-id )
6348 alignof ( type-id ) [C++0x]
6349 new-expression
6350 delete-expression
6352 GNU Extensions:
6354 unary-expression:
6355 __extension__ cast-expression
6356 __alignof__ unary-expression
6357 __alignof__ ( type-id )
6358 alignof unary-expression [C++0x]
6359 __real__ cast-expression
6360 __imag__ cast-expression
6361 && identifier
6363 ADDRESS_P is true iff the unary-expression is appearing as the
6364 operand of the `&' operator. CAST_P is true if this expression is
6365 the target of a cast.
6367 Returns a representation of the expression. */
6369 static tree
6372 {
6376 /* Peek at the next token. */
6378 /* Some keywords give away the kind of expression. */
6380 {
6384 {
6387 {
6388 tree operand;
6392 /* Consume the token. */
6394 /* Parse the operand. */
6399 else
6400 {
6401 /* ISO C++ defines alignof only with types, not with
6402 expressions. So pedwarn if alignof is used with a non-
6403 type expression. However, __alignof__ is ok. */
6406 "ISO C++ does not allow %<alignof%> "
6410 }
6411 }
6420 {
6421 /* The saved value of the PEDANTIC flag. */
6423 tree expr;
6425 /* Save away the PEDANTIC flag. */
6427 /* Parse the cast-expression. */
6429 /* Restore the PEDANTIC flag. */
6433 }
6437 {
6438 tree expression;
6440 /* Consume the `__real__' or `__imag__' token. */
6442 /* Parse the cast-expression. */
6444 /* Create the complete representation. */
6448 expression,
6449 tf_warning_or_error);
6450 }
6458 {
6459 tree expr;
6469 parser->type_definition_forbidden_message
6472 saved_integral_constant_expression_p
6474 saved_non_integral_constant_expression_p
6478 saved_greater_than_is_operator_p
6488 parser->greater_than_is_operator_p
6491 parser->integral_constant_expression_p
6493 parser->non_integral_constant_expression_p
6500 }
6504 }
6505 }
6507 /* Look for the `:: new' and `:: delete', which also signal the
6508 beginning of a new-expression, or delete-expression,
6509 respectively. If the next token is `::', then it might be one of
6510 these. */
6512 {
6515 /* See if the token after the `::' is one of the keywords in
6516 which we're interested. */
6518 /* If it's `new', we have a new-expression. */
6521 /* Similarly, for `delete'. */
6524 }
6526 /* Look for a unary operator. */
6528 /* The `++' and `--' operators can be handled similarly, even though
6529 they are not technically unary-operators in the grammar. */
6531 {
6536 /* Handle the GNU address-of-label extension. */
6539 {
6540 tree identifier;
6541 tree expression;
6544 /* Consume the '&&' token. */
6546 /* Look for the identifier. */
6548 /* Create an expression representing the address. */
6551 NIC_ADDR_LABEL))
6554 }
6555 }
6557 {
6558 tree cast_expression;
6563 /* Consume the operator token. */
6565 /* Parse the cast-expression. */
6566 cast_expression
6570 /* Now, build an appropriate representation. */
6572 {
6576 RO_UNARY_STAR,
6577 tf_warning_or_error);
6582 /* Fall through. */
6585 cast_expression,
6586 tf_warning_or_error);
6593 /* Fall through. */
6598 cast_expression);
6603 }
6607 non_constant_p))
6611 }
6615 pidk);
6616 }
6618 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
6619 unary-operator, the corresponding tree code is returned. */
6621 static enum tree_code
6623 {
6625 {
6646 }
6647 }
6649 /* Parse a new-expression.
6651 new-expression:
6652 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
6653 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
6655 Returns a representation of the expression. */
6657 static tree
6659 {
6662 tree type;
6665 tree ret;
6667 /* Look for the optional `::' operator. */
6668 global_scope_p
6672 /* Look for the `new' operator. */
6674 /* There's no easy way to tell a new-placement from the
6675 `( type-id )' construct. */
6677 /* Look for a new-placement. */
6679 /* If that didn't work out, there's no new-placement. */
6681 {
6685 }
6687 /* If the next token is a `(', then we have a parenthesized
6688 type-id. */
6690 {
6694 /* Consume the `('. */
6697 /* Parse the type-id. */
6698 parser->type_definition_forbidden_message
6703 /* Look for the closing `)'. */
6706 /* There should not be a direct-new-declarator in this production,
6707 but GCC used to allowed this, so we check and emit a sensible error
6708 message for this case. */
6710 {
6716 }
6717 }
6718 /* Otherwise, there must be a new-type-id. */
6719 else
6722 /* If the next token is a `(' or '{', then we have a new-initializer. */
6726 else
6729 /* A new-expression may not appear in an integral constant
6730 expression. */
6733 else
6734 {
6735 /* Create a representation of the new-expression. */
6737 tf_warning_or_error);
6738 }
6746 }
6748 /* Parse a new-placement.
6750 new-placement:
6751 ( expression-list )
6753 Returns the same representation as for an expression-list. */
6757 {
6760 /* Parse the expression-list. */
6761 expression_list = (cp_parser_parenthesized_expression_list
6767 }
6769 /* Parse a new-type-id.
6771 new-type-id:
6772 type-specifier-seq new-declarator [opt]
6774 Returns the TYPE allocated. If the new-type-id indicates an array
6775 type, *NELTS is set to the number of elements in the last array
6776 bound; the TYPE will not include the last array bound. */
6778 static tree
6780 {
6781 cp_decl_specifier_seq type_specifier_seq;
6787 /* The type-specifier sequence must not contain type definitions.
6788 (It cannot contain declarations of new types either, but if they
6789 are not definitions we will catch that because they are not
6790 complete.) */
6792 parser->type_definition_forbidden_message
6794 /* Parse the type-specifier-seq. */
6798 /* Restore the old message. */
6804 /* Parse the new-declarator. */
6807 /* Determine the number of elements in the last array dimension, if
6808 any. */
6810 /* Skip down to the last array dimension. */
6815 {
6818 }
6823 {
6826 }
6829 {
6836 else
6838 }
6841 }
6843 /* Parse an (optional) new-declarator.
6845 new-declarator:
6846 ptr-operator new-declarator [opt]
6847 direct-new-declarator
6849 Returns the declarator. */
6853 {
6855 tree type;
6856 cp_cv_quals cv_quals;
6858 /* We don't know if there's a ptr-operator next, or not. */
6860 /* Look for a ptr-operator. */
6862 /* If that worked, look for more new-declarators. */
6864 {
6867 /* Parse another optional declarator. */
6870 return cp_parser_make_indirect_declarator
6872 }
6874 /* If the next token is a `[', there is a direct-new-declarator. */
6879 }
6881 /* Parse a direct-new-declarator.
6883 direct-new-declarator:
6884 [ expression ]
6885 direct-new-declarator [constant-expression]
6887 */
6891 {
6895 {
6896 tree expression;
6899 /* Look for the opening `['. */
6904 /* The standard requires that the expression have integral
6905 type. DR 74 adds enumeration types. We believe that the
6906 real intent is that these expressions be handled like the
6907 expression in a `switch' condition, which also allows
6908 classes with a single conversion to integral or
6909 enumeration type. */
6911 {
6912 expression
6914 expression,
6917 {
6919 "expression in new-declarator must have integral "
6922 }
6923 }
6925 /* Look for the closing `]'. */
6928 /* Add this bound to the declarator. */
6931 /* If the next token is not a `[', then there are no more
6932 bounds. */
6935 }
6938 }
6940 /* Parse a new-initializer.
6942 new-initializer:
6943 ( expression-list [opt] )
6944 braced-init-list
6946 Returns a representation of the expression-list. */
6950 {
6954 {
6955 tree t;
6961 }
6962 else
6963 expression_list = (cp_parser_parenthesized_expression_list
6969 }
6971 /* Parse a delete-expression.
6973 delete-expression:
6974 :: [opt] delete cast-expression
6975 :: [opt] delete [ ] cast-expression
6977 Returns a representation of the expression. */
6979 static tree
6981 {
6984 tree expression;
6986 /* Look for the optional `::' operator. */
6987 global_scope_p
6991 /* Look for the `delete' keyword. */
6993 /* See if the array syntax is in use. */
6995 {
6996 /* Consume the `[' token. */
6998 /* Look for the `]' token. */
7000 /* Remember that this is the `[]' construct. */
7002 }
7003 else
7006 /* Parse the cast-expression. */
7009 /* A delete-expression may not appear in an integral constant
7010 expression. */
7015 tf_warning_or_error);
7016 }
7018 /* Returns true if TOKEN may start a cast-expression and false
7019 otherwise. */
7021 static bool
7023 {
7025 {
7064 /* '[' may start a primary-expression in obj-c++. */
7070 }
7071 }
7073 /* Parse a cast-expression.
7075 cast-expression:
7076 unary-expression
7077 ( type-id ) cast-expression
7079 ADDRESS_P is true iff the unary-expression is appearing as the
7080 operand of the `&' operator. CAST_P is true if this expression is
7081 the target of a cast.
7083 Returns a representation of the expression. */
7085 static tree
7088 {
7089 /* If it's a `(', then we might be looking at a cast. */
7091 {
7097 /* There's no way to know yet whether or not this is a cast.
7098 For example, `(int (3))' is a unary-expression, while `(int)
7099 3' is a cast. So, we resort to parsing tentatively. */
7101 /* Types may not be defined in a cast. */
7103 parser->type_definition_forbidden_message
7105 /* Consume the `('. */
7107 /* A very tricky bit is that `(struct S) { 3 }' is a
7108 compound-literal (which we permit in C++ as an extension).
7109 But, that construct is not a cast-expression -- it is a
7110 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7111 is legal; if the compound-literal were a cast-expression,
7112 you'd need an extra set of parentheses.) But, if we parse
7113 the type-id, and it happens to be a class-specifier, then we
7114 will commit to the parse at that point, because we cannot
7115 undo the action that is done when creating a new class. So,
7116 then we cannot back up and do a postfix-expression.
7118 Therefore, we scan ahead to the closing `)', and check to see
7119 if the token after the `)' is a `{'. If so, we are not
7120 looking at a cast-expression.
7122 Save tokens so that we can put them back. */
7124 /* Skip tokens until the next token is a closing parenthesis.
7125 If we find the closing `)', and the next token is a `{', then
7126 we are looking at a compound-literal. */
7127 compound_literal_p
7131 /* Roll back the tokens we skipped. */
7133 /* If we were looking at a compound-literal, simulate an error
7134 so that the call to cp_parser_parse_definitely below will
7135 fail. */
7138 else
7139 {
7142 /* Look for the type-id. */
7144 /* Look for the closing `)'. */
7147 }
7149 /* Restore the saved message. */
7152 /* At this point this can only be either a cast or a
7153 parenthesized ctor such as `(T ())' that looks like a cast to
7154 function returning T. */
7158 {
7164 /* Warn about old-style casts, if so requested. */
7166 && !in_system_header
7171 /* Only type conversions to integral or enumeration types
7172 can be used in constant-expressions. */
7175 NIC_CAST))
7178 /* Perform the cast. */
7181 }
7182 else
7184 }
7186 /* If we get here, then it's not a cast, so it must be a
7187 unary-expression. */
7189 }
7191 /* Parse a binary expression of the general form:
7193 pm-expression:
7194 cast-expression
7195 pm-expression .* cast-expression
7196 pm-expression ->* cast-expression
7198 multiplicative-expression:
7199 pm-expression
7200 multiplicative-expression * pm-expression
7201 multiplicative-expression / pm-expression
7202 multiplicative-expression % pm-expression
7204 additive-expression:
7205 multiplicative-expression
7206 additive-expression + multiplicative-expression
7207 additive-expression - multiplicative-expression
7209 shift-expression:
7210 additive-expression
7211 shift-expression << additive-expression
7212 shift-expression >> additive-expression
7214 relational-expression:
7215 shift-expression
7216 relational-expression < shift-expression
7217 relational-expression > shift-expression
7218 relational-expression <= shift-expression
7219 relational-expression >= shift-expression
7221 GNU Extension:
7223 relational-expression:
7224 relational-expression <? shift-expression
7225 relational-expression >? shift-expression
7227 equality-expression:
7228 relational-expression
7229 equality-expression == relational-expression
7230 equality-expression != relational-expression
7232 and-expression:
7233 equality-expression
7234 and-expression & equality-expression
7236 exclusive-or-expression:
7237 and-expression
7238 exclusive-or-expression ^ and-expression
7240 inclusive-or-expression:
7241 exclusive-or-expression
7242 inclusive-or-expression | exclusive-or-expression
7244 logical-and-expression:
7245 inclusive-or-expression
7246 logical-and-expression && inclusive-or-expression
7248 logical-or-expression:
7249 logical-and-expression
7250 logical-or-expression || logical-and-expression
7252 All these are implemented with a single function like:
7254 binary-expression:
7255 simple-cast-expression
7256 binary-expression <token> binary-expression
7258 CAST_P is true if this expression is the target of a cast.
7260 The binops_by_token map is used to get the tree codes for each <token> type.
7261 binary-expressions are associated according to a precedence table. */
7263 #define TOKEN_PRECEDENCE(token) \
7264 (((token->type == CPP_GREATER \
7265 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7266 && !parser->greater_than_is_operator_p) \
7267 ? PREC_NOT_OPERATOR \
7268 : binops_by_token[token->type].prec)
7270 static tree
7275 {
7276 cp_parser_expression_stack stack;
7278 cp_parser_expression_stack_entry current;
7279 tree rhs;
7283 tree overload;
7285 /* Parse the first expression. */
7295 {
7296 /* Get an operator token. */
7302 {
7304 "%<>>%> operator is treated"
7308 }
7312 /* Popping an entry off the stack means we completed a subexpression:
7313 - either we found a token which is not an operator (`>' where it is not
7314 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7315 will happen repeatedly;
7316 - or, we found an operator which has lower priority. This is the case
7317 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7318 parsing `3 * 4'. */
7320 {
7323 else
7325 }
7327 get_rhs:
7331 /* We used the operator token. */
7334 /* For "false && x" or "true || x", x will never be executed;
7335 disable warnings while evaluating it. */
7341 /* Extract another operand. It may be the RHS of this expression
7342 or the LHS of a new, higher priority expression. */
7346 /* Get another operator token. Look up its precedence to avoid
7347 building a useless (immediately popped) stack entry for common
7348 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7352 {
7353 /* ... and prepare to parse the RHS of the new, higher priority
7354 expression. Since precedence levels on the stack are
7355 monotonically increasing, we do not have to care about
7356 stack overflows. */
7365 pop:
7367 /* If the stack is not empty, we have parsed into LHS the right side
7368 (`4' in the example above) of an expression we had suspended.
7369 We can use the information on the stack to recover the LHS (`3')
7370 from the stack together with the tree code (`MULT_EXPR'), and
7371 the precedence of the higher level subexpression
7372 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7373 which will be used to actually build the additive expression. */
7378 }
7380 /* Undo the disabling of warnings done above. */
7387 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7388 ERROR_MARK for everything that is not a binary expression.
7389 This makes warn_about_parentheses miss some warnings that
7390 involve unary operators. For unary expressions we should
7391 pass the correct tree_code unless the unary expression was
7392 surrounded by parentheses.
7393 */
7400 else
7404 tf_warning_or_error);
7407 /* If the binary operator required the use of an overloaded operator,
7408 then this expression cannot be an integral constant-expression.
7409 An overloaded operator can be used even if both operands are
7410 otherwise permissible in an integral constant-expression if at
7411 least one of the operands is of enumeration type. */
7415 NIC_OVERLOADED))
7417 }
7420 }
7423 /* Parse the `? expression : assignment-expression' part of a
7424 conditional-expression. The LOGICAL_OR_EXPR is the
7425 logical-or-expression that started the conditional-expression.
7426 Returns a representation of the entire conditional-expression.
7428 This routine is used by cp_parser_assignment_expression.
7430 ? expression : assignment-expression
7432 GNU Extensions:
7434 ? : assignment-expression */
7436 static tree
7438 {
7439 tree expr;
7440 tree assignment_expr;
7444 /* Consume the `?' token. */
7449 {
7452 /* Implicit true clause. */
7456 }
7457 else
7458 {
7461 /* Parse the expression. */
7464 c_inhibit_evaluation_warnings +=
7468 }
7470 /* The next token should be a `:'. */
7472 /* Parse the assignment-expression. */
7476 /* Build the conditional-expression. */
7478 expr,
7479 assignment_expr,
7480 tf_warning_or_error);
7481 }
7483 /* Parse an assignment-expression.
7485 assignment-expression:
7486 conditional-expression
7487 logical-or-expression assignment-operator assignment_expression
7488 throw-expression
7490 CAST_P is true if this expression is the target of a cast.
7492 Returns a representation for the expression. */
7494 static tree
7497 {
7498 tree expr;
7500 /* If the next token is the `throw' keyword, then we're looking at
7501 a throw-expression. */
7504 /* Otherwise, it must be that we are looking at a
7505 logical-or-expression. */
7506 else
7507 {
7508 /* Parse the binary expressions (logical-or-expression). */
7511 /* If the next token is a `?' then we're actually looking at a
7512 conditional-expression. */
7515 else
7516 {
7519 /* If it's an assignment-operator, we're using the second
7520 production. */
7521 enum tree_code assignment_operator
7524 {
7526 location_t saved_input_location;
7528 /* Parse the right-hand side of the assignment. */
7534 /* An assignment may not appear in a
7535 constant-expression. */
7537 NIC_ASSIGNMENT))
7539 /* Build the assignment expression. Its default
7540 location is the location of the '=' token. */
7544 assignment_operator,
7545 rhs,
7546 tf_warning_or_error);
7548 }
7549 }
7550 }
7553 }
7555 /* Parse an (optional) assignment-operator.
7557 assignment-operator: one of
7558 = *= /= %= += -= >>= <<= &= ^= |=
7560 GNU Extension:
7562 assignment-operator: one of
7563 <?= >?=
7565 If the next token is an assignment operator, the corresponding tree
7566 code is returned, and the token is consumed. For example, for
7567 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
7568 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
7569 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
7570 operator, ERROR_MARK is returned. */
7572 static enum tree_code
7574 {
7578 /* Peek at the next token. */
7582 {
7628 /* Nothing else is an assignment operator. */
7630 }
7632 /* If it was an assignment operator, consume it. */
7637 }
7639 /* Parse an expression.
7641 expression:
7642 assignment-expression
7643 expression , assignment-expression
7645 CAST_P is true if this expression is the target of a cast.
7647 Returns a representation of the expression. */
7649 static tree
7651 {
7656 {
7657 tree assignment_expression;
7659 /* Parse the next assignment-expression. */
7660 assignment_expression
7662 /* If this is the first assignment-expression, we can just
7663 save it away. */
7666 else
7668 assignment_expression,
7669 tf_warning_or_error);
7670 /* If the next token is not a comma, then we are done with the
7671 expression. */
7674 /* Consume the `,'. */
7677 /* A comma operator cannot appear in a constant-expression. */
7680 }
7683 }
7685 /* Parse a constant-expression.
7687 constant-expression:
7688 conditional-expression
7690 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
7691 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
7692 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
7693 is false, NON_CONSTANT_P should be NULL. */
7695 static tree
7699 {
7703 tree expression;
7705 /* It might seem that we could simply parse the
7706 conditional-expression, and then check to see if it were
7707 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
7708 one that the compiler can figure out is constant, possibly after
7709 doing some simplifications or optimizations. The standard has a
7710 precise definition of constant-expression, and we must honor
7711 that, even though it is somewhat more restrictive.
7713 For example:
7715 int i[(2, 3)];
7717 is not a legal declaration, because `(2, 3)' is not a
7718 constant-expression. The `,' operator is forbidden in a
7719 constant-expression. However, GCC's constant-folding machinery
7720 will fold this operation to an INTEGER_CST for `3'. */
7722 /* Save the old settings. */
7724 saved_allow_non_integral_constant_expression_p
7727 /* We are now parsing a constant-expression. */
7729 parser->allow_non_integral_constant_expression_p
7732 /* Although the grammar says "conditional-expression", we parse an
7733 "assignment-expression", which also permits "throw-expression"
7734 and the use of assignment operators. In the case that
7735 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
7736 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
7737 actually essential that we look for an assignment-expression.
7738 For example, cp_parser_initializer_clauses uses this function to
7739 determine whether a particular assignment-expression is in fact
7740 constant. */
7742 /* Restore the old settings. */
7743 parser->integral_constant_expression_p
7745 parser->allow_non_integral_constant_expression_p
7748 {
7749 /* Require an rvalue constant expression here; that's what our
7750 callers expect. Reference constant expressions are handled
7751 separately in e.g. cp_parser_template_argument. */
7756 }
7759 parser->non_integral_constant_expression_p
7763 }
7765 /* Parse __builtin_offsetof.
7767 offsetof-expression:
7768 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
7770 offsetof-member-designator:
7771 id-expression
7772 | offsetof-member-designator "." id-expression
7773 | offsetof-member-designator "[" expression "]"
7774 | offsetof-member-designator "->" id-expression */
7776 static tree
7778 {
7781 cp_id_kind dummy;
7784 /* We're about to accept non-integral-constant things, but will
7785 definitely yield an integral constant expression. Save and
7786 restore these values around our local parsing. */
7790 /* Consume the "__builtin_offsetof" token. */
7792 /* Consume the opening `('. */
7794 /* Parse the type-id. */
7796 /* Look for the `,'. */
7800 /* Build the (type *)null that begins the traditional offsetof macro. */
7802 tf_warning_or_error);
7804 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
7808 {
7811 {
7813 /* offsetof-member-designator "[" expression "]" */
7818 /* offsetof-member-designator "->" identifier */
7820 /* FALLTHRU */
7823 /* offsetof-member-designator "." identifier */
7831 /* Consume the ")" token. */
7836 /* Error. We know the following require will fail, but
7837 that gives the proper error message. */
7842 }
7843 }
7845 success:
7846 /* If we're processing a template, we can't finish the semantics yet.
7847 Otherwise we can fold the entire expression now. */
7850 else
7853 failure:
7858 }
7860 /* Parse a trait expression.
7862 Returns a representation of the expression, the underlying type
7863 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
7865 static tree
7867 {
7868 cp_trait_kind kind;
7871 cp_decl_specifier_seq decl_specs;
7874 {
7951 }
7953 /* Consume the token. */
7963 /* Build a trivial decl-specifier-seq. */
7967 /* Call grokdeclarator to figure out what type this is. */
7972 {
7980 /* Build a trivial decl-specifier-seq. */
7984 /* Call grokdeclarator to figure out what type this is. */
7987 }
7991 /* Complete the trait expression, which may mean either processing
7992 the trait expr now or saving it for template instantiation. */
7994 {
8003 }
8004 }
8006 /* Lambdas that appear in variable initializer or default argument scope
8007 get that in their mangling, so we need to record it. We might as well
8008 use the count for function and namespace scopes as well. */
8012 {
8013 tree t;
8020 static void
8022 {
8023 tree_int ti;
8025 /* Once we're inside a function, we ignore other scopes and just push
8026 the function again so that popping works properly. */
8033 {
8034 /* Don't reset the count if we're still in the same function. */
8037 }
8038 }
8040 static void
8042 {
8045 }
8047 static void
8049 {
8052 {
8055 }
8057 }
8059 /* Parse a lambda expression.
8061 lambda-expression:
8062 lambda-introducer lambda-declarator [opt] compound-statement
8064 Returns a representation of the expression. */
8066 static tree
8068 {
8070 tree type;
8080 /* We may be in the middle of deferred access check. Disable
8081 it now. */
8092 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8095 /* Now that we've started the type, add the capture fields for any
8096 explicit captures. */
8099 {
8100 /* Inside the class, surrounding template-parameter-lists do not apply. */
8101 unsigned int saved_num_template_parameter_lists
8110 /* By virtue of defining a local class, a lambda expression has access to
8111 the private variables of enclosing classes. */
8120 /* The capture list was built up in reverse order; fix that now. */
8121 {
8127 {
8131 }
8133 }
8143 }
8147 /* This field is only used during parsing of the lambda. */
8150 /* This lambda shouldn't have any proxies left at this point. */
8152 /* And now that we're done, push proxies for an enclosing lambda. */
8157 else
8159 }
8161 /* Parse the beginning of a lambda expression.
8163 lambda-introducer:
8164 [ lambda-capture [opt] ]
8166 LAMBDA_EXPR is the current representation of the lambda expression. */
8168 static void
8170 {
8171 /* Need commas after the first capture. */
8174 /* Eat the leading `['. */
8177 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8185 {
8188 }
8191 {
8193 tree capture_id;
8194 tree capture_init_expr;
8198 enum capture_kind_type
8199 {
8200 BY_COPY,
8201 BY_REFERENCE
8202 };
8206 {
8209 }
8213 else
8216 /* Possibly capture `this'. */
8218 {
8228 explicit_init_p);
8230 }
8232 /* Remember whether we want to capture as a reference or not. */
8234 {
8237 }
8239 /* Get the identifier. */
8244 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8245 delimiters, but I modified this to stop on unnested ']' as well. It
8246 was already changed to stop on unnested '}', so the
8247 "closing_parenthesis" name is no more misleading with my change. */
8248 {
8254 }
8256 /* Find the initializer for this capture. */
8258 {
8259 /* An explicit expression exists. */
8262 "ISO C++ does not allow initializers "
8268 }
8269 else
8270 {
8273 /* Turn the identifier into an id-expression. */
8274 capture_init_expr
8275 = cp_parser_lookup_name
8277 capture_id,
8278 none_type,
8286 {
8289 }
8293 {
8296 capture_init_expr);
8299 }
8302 {
8305 capture_init_expr);
8308 }
8310 capture_init_expr
8311 = finish_id_expression
8313 capture_init_expr,
8325 }
8329 {
8334 capture_id);
8338 "capture of %qD redundant with by-reference capture "
8340 }
8343 capture_id,
8344 capture_init_expr,
8346 explicit_init_p);
8347 }
8350 }
8352 /* Parse the (optional) middle of a lambda expression.
8354 lambda-declarator:
8355 ( parameter-declaration-clause [opt] )
8356 attribute-specifier [opt]
8357 mutable [opt]
8358 exception-specification [opt]
8359 lambda-return-type-clause [opt]
8361 LAMBDA_EXPR is the current representation of the lambda expression. */
8363 static bool
8365 {
8366 /* 5.1.1.4 of the standard says:
8367 If a lambda-expression does not include a lambda-declarator, it is as if
8368 the lambda-declarator were ().
8369 This means an empty parameter list, no attributes, and no exception
8370 specification. */
8374 tree t;
8376 /* The lambda-declarator is optional, but must begin with an opening
8377 parenthesis if present. */
8379 {
8384 /* Parse parameters. */
8387 /* Default arguments shall not be specified in the
8388 parameter-declaration-clause of a lambda-declarator. */
8398 /* Parse optional `mutable' keyword. */
8400 {
8403 }
8405 /* Parse optional exception specification. */
8408 /* Parse optional trailing return type. */
8410 {
8413 }
8415 /* The function parameters must be in scope all the way until after the
8416 trailing-return-type in case of decltype. */
8421 }
8423 /* Create the function call operator.
8425 Messing with declarators like this is no uglier than building up the
8426 FUNCTION_DECL by hand, and this is less likely to get out of sync with
8427 other code. */
8428 {
8429 cp_decl_specifier_seq return_type_specs;
8431 tree fco;
8438 else
8439 /* Maybe we will deduce the return type later. */
8445 sfk_none);
8450 VIRT_SPEC_UNSPECIFIED,
8451 exception_spec,
8456 declarator,
8457 attributes);
8459 {
8462 /* Give the object parameter a different name. */
8464 }
8471 }
8472 }
8474 /* Parse the body of a lambda expression, which is simply
8476 compound-statement
8478 but which requires special handling.
8479 LAMBDA_EXPR is the current representation of the lambda expression. */
8481 static void
8483 {
8488 else
8489 /* Still increment function_depth so that we don't GC in the
8490 middle of an expression. */
8492 /* Clear this in case we're in the middle of a default argument. */
8495 /* Finish the function call operator
8496 - class_specifier
8497 + late_parsing_for_member
8498 + function_definition_after_declarator
8499 + ctor_initializer_opt_and_function_body */
8500 {
8502 tree body;
8504 tree compound_stmt;
8505 tree cap;
8507 /* Let the front end know that we are going to be defining this
8508 function. */
8510 NULL_TREE,
8519 /* Push the proxies for any explicit captures. */
8526 /* 5.1.1.4 of the standard says:
8527 If a lambda-expression does not include a trailing-return-type, it
8528 is as if the trailing-return-type denotes the following type:
8529 * if the compound-statement is of the form
8530 { return attribute-specifier [opt] expression ; }
8531 the type of the returned expression after lvalue-to-rvalue
8532 conversion (_conv.lval_ 4.1), array-to-pointer conversion
8533 (_conv.array_ 4.2), and function-to-pointer conversion
8534 (_conv.func_ 4.3);
8535 * otherwise, void. */
8537 /* In a lambda that has neither a lambda-return-type-clause
8538 nor a deducible form, errors should be reported for return statements
8539 in the body. Since we used void as the placeholder return type, parsing
8540 the body as usual will give such desired behavior. */
8544 {
8548 /* Parse tentatively in case there's more after the initial return
8549 statement. */
8560 {
8564 /* Will get error here if type not deduced yet. */
8568 }
8569 }
8572 {
8577 }
8581 out:
8585 /* Finish the function and generate code for it if necessary. */
8587 }
8592 else
8594 }
8596 /* Statements [gram.stmt.stmt] */
8598 /* Parse a statement.
8600 statement:
8601 labeled-statement
8602 expression-statement
8603 compound-statement
8604 selection-statement
8605 iteration-statement
8606 jump-statement
8607 declaration-statement
8608 try-block
8610 TM Extension:
8612 statement:
8613 atomic-statement
8615 IN_COMPOUND is true when the statement is nested inside a
8616 cp_parser_compound_statement; this matters for certain pragmas.
8618 If IF_P is not NULL, *IF_P is set to indicate whether the statement
8619 is a (possibly labeled) if statement which is not enclosed in braces
8620 and has an else clause. This is used to implement -Wparentheses. */
8622 static void
8625 {
8626 tree statement;
8628 location_t statement_location;
8630 restart:
8633 /* There is no statement yet. */
8635 /* Peek at the next token. */
8637 /* Remember the location of the first token in the statement. */
8639 /* If this is a keyword, then that will often determine what kind of
8640 statement we have. */
8642 {
8646 {
8649 /* Looks like a labeled-statement with a case label.
8650 Parse the label, and then use tail recursion to parse
8651 the statement. */
8673 /* Objective-C++ exception-handling constructs. */
8687 /* This must be a namespace alias definition. */
8700 /* It might be a keyword like `int' that can start a
8701 declaration-statement. */
8703 }
8704 }
8706 {
8707 /* If the next token is a `:', then we are looking at a
8708 labeled-statement. */
8711 {
8712 /* Looks like a labeled-statement with an ordinary label.
8713 Parse the label, and then use tail recursion to parse
8714 the statement. */
8717 }
8718 }
8719 /* Anything that starts with a `{' must be a compound-statement. */
8722 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
8723 a statement all its own. */
8725 {
8726 /* Only certain OpenMP pragmas are attached to statements, and thus
8727 are considered statements themselves. All others are not. In
8728 the context of a compound, accept the pragma as a "statement" and
8729 return so that we can check for a close brace. Otherwise we
8730 require a real statement and must go back and read one. */
8736 }
8738 {
8741 }
8743 /* Everything else must be a declaration-statement or an
8744 expression-statement. Try for the declaration-statement
8745 first, unless we are looking at a `;', in which case we know that
8746 we have an expression-statement. */
8748 {
8750 {
8752 /* Try to parse the declaration-statement. */
8754 /* If that worked, we're done. */
8757 }
8758 /* Look for an expression-statement instead. */
8760 }
8762 /* Set the line number for the statement. */
8765 }
8767 /* Parse the label for a labeled-statement, i.e.
8769 identifier :
8770 case constant-expression :
8771 default :
8773 GNU Extension:
8774 case constant-expression ... constant-expression : statement
8776 When a label is parsed without errors, the label is added to the
8777 parse tree by the finish_* functions, so this function doesn't
8778 have to return the label. */
8780 static void
8782 {
8787 /* The next token should be an identifier. */
8791 {
8794 }
8798 {
8800 {
8804 /* Consume the `case' token. */
8806 /* Parse the constant-expression. */
8809 NULL);
8813 {
8814 /* Consume the `...' token. */
8816 expr_hi =
8819 NULL);
8820 /* We don't need to emit warnings here, as the common code
8821 will do this for us. */
8822 }
8823 else
8828 else
8831 expr);
8832 }
8836 /* Consume the `default' token. */
8841 else
8846 /* Anything else must be an ordinary label. */
8849 }
8851 /* Require the `:' token. */
8854 /* An ordinary label may optionally be followed by attributes.
8855 However, this is only permitted if the attributes are then
8856 followed by a semicolon. This is because, for backward
8857 compatibility, when parsing
8858 lab: __attribute__ ((unused)) int i;
8859 we want the attribute to attach to "i", not "lab". */
8862 {
8863 tree attrs;
8871 ;
8872 else
8874 }
8877 }
8879 /* Parse an expression-statement.
8881 expression-statement:
8882 expression [opt] ;
8884 Returns the new EXPR_STMT -- or NULL_TREE if the expression
8885 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
8886 indicates whether this expression-statement is part of an
8887 expression statement. */
8889 static tree
8891 {
8895 /* If the next token is a ';', then there is no expression
8896 statement. */
8900 /* Give a helpful message for "A<T>::type t;" and the like. */
8903 {
8910 {
8911 /* A::A a; */
8916 }
8917 }
8919 /* Consume the final `;'. */
8924 /* This is the final expression statement of a statement
8925 expression. */
8929 else
8933 }
8935 /* Parse a compound-statement.
8937 compound-statement:
8938 { statement-seq [opt] }
8940 GNU extension:
8942 compound-statement:
8943 { label-declaration-seq [opt] statement-seq [opt] }
8945 label-declaration-seq:
8946 label-declaration
8947 label-declaration-seq label-declaration
8949 Returns a tree representing the statement. */
8951 static tree
8954 {
8955 tree compound_stmt;
8957 /* Consume the `{'. */
8964 /* Begin the compound-statement. */
8966 /* If the next keyword is `__label__' we have a label declaration. */
8969 /* Parse an (optional) statement-seq. */
8971 /* Finish the compound-statement. */
8973 /* Consume the `}'. */
8977 }
8979 /* Parse an (optional) statement-seq.
8981 statement-seq:
8982 statement
8983 statement-seq [opt] statement */
8985 static void
8987 {
8988 /* Scan statements until there aren't any more. */
8990 {
8993 /* If we are looking at a `}', then we have run out of
8994 statements; the same is true if we have reached the end
8995 of file, or have stumbled upon a stray '@end'. */
9002 /* If we are in a compound statement and find 'else' then
9003 something went wrong. */
9005 {
9008 else
9009 {
9012 }
9013 }
9015 /* Parse the statement. */
9017 }
9018 }
9020 /* Parse a selection-statement.
9022 selection-statement:
9023 if ( condition ) statement
9024 if ( condition ) statement else statement
9025 switch ( condition ) statement
9027 Returns the new IF_STMT or SWITCH_STMT.
9029 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9030 is a (possibly labeled) if statement which is not enclosed in
9031 braces and has an else clause. This is used to implement
9032 -Wparentheses. */
9034 static tree
9036 {
9043 /* Peek at the next token. */
9046 /* See what kind of keyword it is. */
9049 {
9052 {
9053 tree statement;
9054 tree condition;
9056 /* Look for the `('. */
9058 {
9061 }
9063 /* Begin the selection-statement. */
9066 else
9069 /* Parse the condition. */
9071 /* Look for the `)'. */
9077 {
9081 /* Add the condition. */
9084 /* Parse the then-clause. */
9088 {
9096 }
9097 else
9103 /* If the next token is `else', parse the else-clause. */
9105 RID_ELSE))
9106 {
9107 /* Consume the `else' keyword. */
9110 /* Parse the else-clause. */
9112 {
9113 location_t loc;
9120 }
9121 else
9126 /* If we are currently parsing a then-clause, then
9127 IF_P will not be NULL. We set it to true to
9128 indicate that this if statement has an else clause.
9129 This may trigger the Wparentheses warning below
9130 when we get back up to the parent if statement. */
9133 }
9134 else
9135 {
9136 /* This if statement does not have an else clause. If
9137 NESTED_IF is true, then the then-clause is an if
9138 statement which does have an else clause. We warn
9139 about the potential ambiguity. */
9142 "suggest explicit braces to avoid ambiguous"
9144 }
9146 /* Now we're all done with the if-statement. */
9148 }
9149 else
9150 {
9154 /* Add the condition. */
9157 /* Parse the body of the switch-statement. */
9166 /* Now we're all done with the switch-statement. */
9168 }
9171 }
9177 }
9178 }
9180 /* Parse a condition.
9182 condition:
9183 expression
9184 type-specifier-seq declarator = initializer-clause
9185 type-specifier-seq declarator braced-init-list
9187 GNU Extension:
9189 condition:
9190 type-specifier-seq declarator asm-specification [opt]
9191 attributes [opt] = assignment-expression
9193 Returns the expression that should be tested. */
9195 static tree
9197 {
9198 cp_decl_specifier_seq type_specifiers;
9202 /* Try the declaration first. */
9204 /* New types are not allowed in the type-specifier-seq for a
9205 condition. */
9207 parser->type_definition_forbidden_message
9209 /* Parse the type-specifier-seq. */
9211 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9214 /* Restore the saved message. */
9216 /* If all is well, we might be looking at a declaration. */
9218 {
9219 tree decl;
9220 tree asm_specification;
9221 tree attributes;
9225 /* Parse the declarator. */
9230 /* Parse the attributes. */
9232 /* Parse the asm-specification. */
9234 /* If the next token is not an `=' or '{', then we might still be
9235 looking at an expression. For example:
9237 if (A(a).x)
9239 looks like a decl-specifier-seq and a declarator -- but then
9240 there is no `=', so this is an expression. */
9245 /* If we did see an `=' or '{', then we are looking at a declaration
9246 for sure. */
9248 {
9249 tree pushed_scope;
9253 /* Create the declaration. */
9259 /* Parse the initializer. */
9261 {
9265 }
9266 else
9267 {
9268 /* Consume the `='. */
9271 }
9275 /* Process the initializer. */
9278 asm_specification,
9279 flags);
9285 }
9286 }
9287 /* If we didn't even get past the declarator successfully, we are
9288 definitely not looking at a declaration. */
9289 else
9292 /* Otherwise, we are looking at an expression. */
9294 }
9296 /* Parses a for-statement or range-for-statement until the closing ')',
9297 not included. */
9299 static tree
9301 {
9305 /* Begin the for-statement. */
9308 /* Parse the initialization. */
9313 else
9315 }
9317 static tree
9319 {
9320 /* Normal for loop */
9323 tree stmt;
9326 /* The for-init-statement has already been parsed in
9327 cp_parser_for_init_statement, so no work is needed here. */
9330 /* If there's a condition, process it. */
9334 /* Look for the `;'. */
9337 /* If there's an expression, process it. */
9343 }
9345 /* Tries to parse a range-based for-statement:
9347 range-based-for:
9348 decl-specifier-seq declarator : expression
9350 The decl-specifier-seq declarator and the `:' are already parsed by
9351 cp_parser_for_init_statement. If processing_template_decl it returns a
9352 newly created RANGE_FOR_STMT; if not, it is converted to a
9353 regular FOR_STMT. */
9355 static tree
9357 {
9361 {
9364 }
9365 else
9368 /* If in template, STMT is converted to a normal for-statement
9369 at instantiation. If not, it is done just ahead. */
9371 {
9377 /* do_auto_deduction doesn't mess with template init-lists. */
9380 }
9381 else
9382 {
9385 }
9387 }
9389 /* Subroutine of cp_convert_range_for: given the initializer expression,
9390 builds up the range temporary. */
9392 static tree
9394 {
9397 /* Find out the type deduced by the declaration
9398 `auto &&__range = range_expr'. */
9403 /* Create the __range variable. */
9410 }
9412 /* Used by cp_parser_range_for in template context: we aren't going to
9413 do a full conversion yet, but we still need to resolve auto in the
9414 type of the for-range-declaration if present. This is basically
9415 a shortcut version of cp_convert_range_for. */
9417 static void
9419 {
9422 {
9425 iter_type = (cp_parser_perform_range_for_lookup
9429 tf_warning_or_error);
9432 }
9433 }
9435 /* Converts a range-based for-statement into a normal
9436 for-statement, as per the definition.
9438 for (RANGE_DECL : RANGE_EXPR)
9439 BLOCK
9441 should be equivalent to:
9443 {
9444 auto &&__range = RANGE_EXPR;
9445 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
9446 __begin != __end;
9447 ++__begin)
9448 {
9449 RANGE_DECL = *__begin;
9450 BLOCK
9451 }
9452 }
9454 If RANGE_EXPR is an array:
9455 BEGIN_EXPR = __range
9456 END_EXPR = __range + ARRAY_SIZE(__range)
9457 Else if RANGE_EXPR has a member 'begin' or 'end':
9458 BEGIN_EXPR = __range.begin()
9459 END_EXPR = __range.end()
9460 Else:
9461 BEGIN_EXPR = begin(__range)
9462 END_EXPR = end(__range);
9464 If __range has a member 'begin' but not 'end', or vice versa, we must
9465 still use the second alternative (it will surely fail, however).
9466 When calling begin()/end() in the third alternative we must use
9467 argument dependent lookup, but always considering 'std' as an associated
9468 namespace. */
9470 tree
9472 {
9478 /* If an error happened previously do nothing or else a lot of
9479 unhelpful errors would be issued. */
9481 else
9482 {
9487 LOOKUP_ONLYCONVERTING);
9492 }
9494 /* The new for initialization statement. */
9502 LOOKUP_ONLYCONVERTING);
9511 LOOKUP_ONLYCONVERTING);
9515 /* The new for condition. */
9522 /* The new increment expression. */
9527 /* The declaration is initialized with *__begin inside the loop body. */
9530 tf_warning_or_error),
9532 LOOKUP_ONLYCONVERTING);
9535 }
9537 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
9538 We need to solve both at the same time because the method used
9539 depends on the existence of members begin or end.
9540 Returns the type deduced for the iterator expression. */
9542 static tree
9544 {
9546 {
9549 }
9552 {
9557 }
9559 {
9560 /* If RANGE is an array, we will use pointer arithmetic. */
9563 range,
9567 }
9568 else
9569 {
9570 /* If it is not an array, we must do a bit of magic. */
9580 tf_warning_or_error);
9583 tf_warning_or_error);
9586 {
9587 /* Use the member functions. */
9590 else
9596 else
9599 }
9600 else
9601 {
9602 /* Use global functions with ADL. */
9610 tf_warning_or_error);
9612 tf_warning_or_error);
9615 tf_warning_or_error);
9617 tf_warning_or_error);
9620 }
9622 /* Last common checks. */
9624 {
9625 /* If one of the expressions is an error do no more checks. */
9628 }
9629 else
9630 {
9632 /* The unqualified type of the __begin and __end temporaries should
9633 be the same, as required by the multiple auto declaration. */
9639 }
9640 }
9641 }
9643 /* Helper function for cp_parser_perform_range_for_lookup.
9644 Builds a tree for RANGE.IDENTIFIER(). */
9646 static tree
9648 {
9661 tf_warning_or_error);
9664 }
9666 /* Parse an iteration-statement.
9668 iteration-statement:
9669 while ( condition ) statement
9670 do statement while ( expression ) ;
9671 for ( for-init-statement condition [opt] ; expression [opt] )
9672 statement
9674 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
9676 static tree
9678 {
9681 tree statement;
9684 /* Peek at the next token. */
9689 /* Remember whether or not we are already within an iteration
9690 statement. */
9693 /* See what kind of keyword it is. */
9696 {
9698 {
9699 tree condition;
9701 /* Begin the while-statement. */
9703 /* Look for the `('. */
9705 /* Parse the condition. */
9708 /* Look for the `)'. */
9710 /* Parse the dependent statement. */
9714 /* We're done with the while-statement. */
9716 }
9720 {
9721 tree expression;
9723 /* Begin the do-statement. */
9725 /* Parse the body of the do-statement. */
9730 /* Look for the `while' keyword. */
9732 /* Look for the `('. */
9734 /* Parse the expression. */
9736 /* We're done with the do-statement. */
9738 /* Look for the `)'. */
9740 /* Look for the `;'. */
9742 }
9746 {
9747 /* Look for the `('. */
9752 /* Look for the `)'. */
9755 /* Parse the body of the for-statement. */
9760 /* We're done with the for-statement. */
9762 }
9769 }
9772 }
9774 /* Parse a for-init-statement or the declarator of a range-based-for.
9775 Returns true if a range-based-for declaration is seen.
9777 for-init-statement:
9778 expression-statement
9779 simple-declaration */
9781 static bool
9783 {
9784 /* If the next token is a `;', then we have an empty
9785 expression-statement. Grammatically, this is also a
9786 simple-declaration, but an invalid one, because it does not
9787 declare anything. Therefore, if we did not handle this case
9788 specially, we would issue an error message about an invalid
9789 declaration. */
9791 {
9797 /* We're going to speculatively look for a declaration, falling back
9798 to an expression, if necessary. */
9800 /* Parse the declaration. */
9803 decl);
9806 {
9807 /* It is a range-for, consume the ':' */
9811 {
9813 "range-based %<for%> loops are not allowed "
9816 }
9817 }
9818 else
9819 /* The ';' is not consumed yet because we told
9820 cp_parser_simple_declaration not to. */
9825 /* If the tentative parse failed, then we shall need to look for an
9826 expression-statement. */
9827 }
9828 /* If we are here, it is an expression-statement. */
9831 }
9833 /* Parse a jump-statement.
9835 jump-statement:
9836 break ;
9837 continue ;
9838 return expression [opt] ;
9839 return braced-init-list ;
9840 goto identifier ;
9842 GNU extension:
9844 jump-statement:
9845 goto * expression ;
9847 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
9849 static tree
9851 {
9857 /* Peek at the next token. */
9862 /* See what kind of keyword it is. */
9865 {
9869 {
9884 }
9890 {
9903 }
9908 {
9909 tree expr;
9913 {
9916 }
9919 else
9920 /* If the next token is a `;', then there is no
9921 expression. */
9923 /* Build the return-statement. */
9925 /* Look for the final `;'. */
9927 }
9931 /* Create the goto-statement. */
9933 {
9934 /* Issue a warning about this use of a GNU extension. */
9936 /* Consume the '*' token. */
9938 /* Parse the dependent expression. */
9940 }
9941 else
9943 /* Look for the final `;'. */
9950 }
9953 }
9955 /* Parse a declaration-statement.
9957 declaration-statement:
9958 block-declaration */
9960 static void
9962 {
9965 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
9968 /* Parse the block-declaration. */
9971 /* Free any declarators allocated. */
9974 /* Finish off the statement. */
9976 }
9978 /* Some dependent statements (like `if (cond) statement'), are
9979 implicitly in their own scope. In other words, if the statement is
9980 a single statement (as opposed to a compound-statement), it is
9981 none-the-less treated as if it were enclosed in braces. Any
9982 declarations appearing in the dependent statement are out of scope
9983 after control passes that point. This function parses a statement,
9984 but ensures that is in its own scope, even if it is not a
9985 compound-statement.
9987 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9988 is a (possibly labeled) if statement which is not enclosed in
9989 braces and has an else clause. This is used to implement
9990 -Wparentheses.
9992 Returns the new statement. */
9994 static tree
9996 {
9997 tree statement;
10002 /* Mark if () ; with a special NOP_EXPR. */
10004 {
10008 }
10009 /* if a compound is opened, we simply parse the statement directly. */
10012 /* If the token is not a `{', then we must take special action. */
10013 else
10014 {
10015 /* Create a compound-statement. */
10017 /* Parse the dependent-statement. */
10019 /* Finish the dummy compound-statement. */
10021 }
10023 /* Return the statement. */
10025 }
10027 /* For some dependent statements (like `while (cond) statement'), we
10028 have already created a scope. Therefore, even if the dependent
10029 statement is a compound-statement, we do not want to create another
10030 scope. */
10032 static void
10034 {
10035 /* If the token is a `{', then we must take special action. */
10038 else
10039 {
10040 /* Avoid calling cp_parser_compound_statement, so that we
10041 don't create a new scope. Do everything else by hand. */
10043 /* If the next keyword is `__label__' we have a label declaration. */
10046 /* Parse an (optional) statement-seq. */
10049 }
10050 }
10052 /* Declarations [gram.dcl.dcl] */
10054 /* Parse an optional declaration-sequence.
10056 declaration-seq:
10057 declaration
10058 declaration-seq declaration */
10060 static void
10062 {
10064 {
10075 {
10076 /* A declaration consisting of a single semicolon is
10077 invalid. Allow it unless we're being pedantic. */
10082 }
10084 /* If we're entering or exiting a region that's implicitly
10085 extern "C", modify the lang context appropriately. */
10087 {
10090 }
10092 {
10095 }
10098 {
10099 /* A top-level declaration can consist solely of a #pragma.
10100 A nested declaration cannot, so this is done here and not
10101 in cp_parser_declaration. (A #pragma at block scope is
10102 handled in cp_parser_statement.) */
10105 }
10107 /* Parse the declaration itself. */
10109 }
10110 }
10112 /* Parse a declaration.
10114 declaration:
10115 block-declaration
10116 function-definition
10117 template-declaration
10118 explicit-instantiation
10119 explicit-specialization
10120 linkage-specification
10121 namespace-definition
10123 GNU extension:
10125 declaration:
10126 __extension__ declaration */
10128 static void
10130 {
10131 cp_token token1;
10132 cp_token token2;
10137 /* Check for the `__extension__' keyword. */
10139 {
10140 /* Parse the qualified declaration. */
10142 /* Restore the PEDANTIC flag. */
10146 }
10148 /* Try to figure out what kind of declaration is present. */
10153 else
10154 {
10157 }
10159 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10162 /* If the next token is `extern' and the following token is a string
10163 literal, then we have a linkage specification. */
10167 /* If the next token is `template', then we have either a template
10168 declaration, an explicit instantiation, or an explicit
10169 specialization. */
10171 {
10172 /* `template <>' indicates a template specialization. */
10176 /* `template <' indicates a template declaration. */
10179 /* Anything else must be an explicit instantiation. */
10180 else
10182 }
10183 /* If the next token is `export', then we have a template
10184 declaration. */
10187 /* If the next token is `extern', 'static' or 'inline' and the one
10188 after that is `template', we have a GNU extended explicit
10189 instantiation directive. */
10196 /* If the next token is `namespace', check for a named or unnamed
10197 namespace definition. */
10203 /* An unnamed namespace definition. */
10207 /* An inline (associated) namespace definition. */
10211 /* Objective-C++ declaration/definition. */
10218 /* We must have either a block declaration or a function
10219 definition. */
10220 else
10221 /* Try to parse a block-declaration, or a function-definition. */
10224 /* Free any declarators allocated. */
10226 }
10228 /* Parse a block-declaration.
10230 block-declaration:
10231 simple-declaration
10232 asm-definition
10233 namespace-alias-definition
10234 using-declaration
10235 using-directive
10237 GNU Extension:
10239 block-declaration:
10240 __extension__ block-declaration
10242 C++0x Extension:
10244 block-declaration:
10245 static_assert-declaration
10247 If STATEMENT_P is TRUE, then this block-declaration is occurring as
10248 part of a declaration-statement. */
10250 static void
10253 {
10257 /* Check for the `__extension__' keyword. */
10259 {
10260 /* Parse the qualified declaration. */
10262 /* Restore the PEDANTIC flag. */
10266 }
10268 /* Peek at the next token to figure out which kind of declaration is
10269 present. */
10272 /* If the next keyword is `asm', we have an asm-definition. */
10274 {
10278 }
10279 /* If the next keyword is `namespace', we have a
10280 namespace-alias-definition. */
10283 /* If the next keyword is `using', we have a
10284 using-declaration, a using-directive, or an alias-declaration. */
10286 {
10291 /* If the token after `using' is `namespace', then we have a
10292 using-directive. */
10296 /* If the second token after 'using' is '=', then we have an
10297 alias-declaration. */
10304 /* Otherwise, it's a using-declaration. */
10305 else
10308 }
10309 /* If the next keyword is `__label__' we have a misplaced label
10310 declaration. */
10312 {
10316 /* If the next token is now a `;', consume it. */
10319 }
10320 /* If the next token is `static_assert' we have a static assertion. */
10323 /* Anything else must be a simple-declaration. */
10324 else
10327 }
10329 /* Parse a simple-declaration.
10331 simple-declaration:
10332 decl-specifier-seq [opt] init-declarator-list [opt] ;
10334 init-declarator-list:
10335 init-declarator
10336 init-declarator-list , init-declarator
10338 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
10339 function-definition as a simple-declaration.
10341 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
10342 parsed declaration if it is an uninitialized single declarator not followed
10343 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
10344 if present, will not be consumed. */
10346 static void
10350 {
10351 cp_decl_specifier_seq decl_specifiers;
10358 /* Defer access checks until we know what is being declared; the
10359 checks for names appearing in the decl-specifier-seq should be
10360 done as if we were in the scope of the thing being declared. */
10363 /* Parse the decl-specifier-seq. We have to keep track of whether
10364 or not the decl-specifier-seq declares a named class or
10365 enumeration type, since that is the only case in which the
10366 init-declarator-list is allowed to be empty.
10368 [dcl.dcl]
10370 In a simple-declaration, the optional init-declarator-list can be
10371 omitted only when declaring a class or enumeration, that is when
10372 the decl-specifier-seq contains either a class-specifier, an
10373 elaborated-type-specifier, or an enum-specifier. */
10375 CP_PARSER_FLAGS_OPTIONAL,
10378 /* We no longer need to defer access checks. */
10381 /* In a block scope, a valid declaration must always have a
10382 decl-specifier-seq. By not trying to parse declarators, we can
10383 resolve the declaration/expression ambiguity more quickly. */
10386 {
10389 }
10391 /* If the next two tokens are both identifiers, the code is
10392 erroneous. The usual cause of this situation is code like:
10394 T t;
10396 where "T" should name a type -- but does not. */
10399 {
10400 /* If parsing tentatively, we should commit; we really are
10401 looking at a declaration. */
10403 /* Give up. */
10405 }
10407 /* If we have seen at least one decl-specifier, and the next token
10408 is not a parenthesis, then we must be looking at a declaration.
10409 (After "int (" we might be looking at a functional cast.) */
10416 /* Keep going until we hit the `;' at the end of the simple
10417 declaration. */
10420 CPP_SEMICOLON))
10421 {
10424 tree decl;
10427 {
10428 /* If we are processing next declarator, coma is expected */
10434 }
10435 else
10438 /* Parse the init-declarator. */
10441 function_definition_allowed_p,
10443 declares_class_or_enum,
10445 maybe_range_for_decl);
10446 /* If an error occurred while parsing tentatively, exit quickly.
10447 (That usually happens when in the body of a function; each
10448 statement is treated as a declaration-statement until proven
10449 otherwise.) */
10452 /* Handle function definitions specially. */
10454 {
10455 /* If the next token is a `,', then we are probably
10456 processing something like:
10458 void f() {}, *p;
10460 which is erroneous. */
10462 {
10465 "mixing"
10467 }
10468 /* Otherwise, we're done with the list of declarators. */
10469 else
10470 {
10473 }
10474 }
10477 /* The next token should be either a `,' or a `;'. */
10479 /* If it's a `,', there are more declarators to come. */
10482 /* If it's a `;', we are done. */
10485 /* Anything else is an error. */
10486 else
10487 {
10488 /* If we have already issued an error message we don't need
10489 to issue another one. */
10493 /* Skip tokens until we reach the end of the statement. */
10495 /* If the next token is now a `;', consume it. */
10499 }
10500 /* After the first time around, a function-definition is not
10501 allowed -- even if it was OK at first. For example:
10503 int i, f() {}
10505 is not valid. */
10507 }
10509 /* Issue an error message if no declarators are present, and the
10510 decl-specifier-seq does not itself declare a class or
10511 enumeration. */
10513 {
10516 /* Perform any deferred access checks. */
10518 }
10520 /* Consume the `;'. */
10524 done:
10526 }
10528 /* Parse a decl-specifier-seq.
10530 decl-specifier-seq:
10531 decl-specifier-seq [opt] decl-specifier
10533 decl-specifier:
10534 storage-class-specifier
10535 type-specifier
10536 function-specifier
10537 friend
10538 typedef
10540 GNU Extension:
10542 decl-specifier:
10543 attributes
10545 Set *DECL_SPECS to a representation of the decl-specifier-seq.
10547 The parser flags FLAGS is used to control type-specifier parsing.
10549 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
10550 flags:
10552 1: one of the decl-specifiers is an elaborated-type-specifier
10553 (i.e., a type declaration)
10554 2: one of the decl-specifiers is an enum-specifier or a
10555 class-specifier (i.e., a type definition)
10557 */
10559 static void
10561 cp_parser_flags flags,
10564 {
10567 cp_decl_spec ds;
10569 /* Clear DECL_SPECS. */
10572 /* Assume no class or enumeration type is declared. */
10575 /* Keep reading specifiers until there are no more to read. */
10577 {
10583 /* Peek at the next token. */
10586 /* Save the first token of the decl spec list for error
10587 reporting. */
10590 /* Handle attributes. */
10592 {
10593 /* Parse the attributes. */
10594 decl_specs->attributes
10600 }
10601 /* Assume we will find a decl-specifier keyword. */
10603 /* If the next token is an appropriate keyword, we can simply
10604 add it to the list. */
10606 {
10607 /* decl-specifier:
10608 friend
10609 constexpr */
10612 {
10615 }
10616 else
10617 {
10619 /* Consume the token. */
10621 }
10629 /* function-specifier:
10630 inline
10631 virtual
10632 explicit */
10639 /* decl-specifier:
10640 typedef */
10643 /* Consume the token. */
10645 /* A constructor declarator cannot appear in a typedef. */
10647 /* The "typedef" keyword can only occur in a declaration; we
10648 may as well commit at this point. */
10655 /* storage-class-specifier:
10656 auto
10657 register
10658 static
10659 extern
10660 mutable
10662 GNU Extension:
10663 thread */
10666 {
10667 /* Consume the token. */
10670 /* Complain about `auto' as a storage specifier, if
10671 we're complaining about C++0x compatibility. */
10675 /* Set the storage class anyway. */
10678 }
10679 else
10680 /* C++0x auto type-specifier. */
10688 /* Consume the token. */
10694 /* Consume the token. */
10700 /* We did not yet find a decl-specifier yet. */
10703 }
10713 /* Constructors are a special case. The `S' in `S()' is not a
10714 decl-specifier; it is the beginning of the declarator. */
10715 constructor_p
10716 = (!found_decl_spec
10717 && constructor_possible_p
10718 && (cp_parser_constructor_declarator_p
10721 /* If we don't have a DECL_SPEC yet, then we must be looking at
10722 a type-specifier. */
10724 {
10727 tree type_spec;
10729 type_spec
10731 decl_specs,
10737 /* If this type-specifier referenced a user-defined type
10738 (a typedef, class-name, etc.), then we can't allow any
10739 more such type-specifiers henceforth.
10741 [dcl.spec]
10743 The longest sequence of decl-specifiers that could
10744 possibly be a type name is taken as the
10745 decl-specifier-seq of a declaration. The sequence shall
10746 be self-consistent as described below.
10748 [dcl.type]
10750 As a general rule, at most one type-specifier is allowed
10751 in the complete decl-specifier-seq of a declaration. The
10752 only exceptions are the following:
10754 -- const or volatile can be combined with any other
10755 type-specifier.
10757 -- signed or unsigned can be combined with char, long,
10758 short, or int.
10760 -- ..
10762 Example:
10764 typedef char* Pc;
10765 void g (const int Pc);
10767 Here, Pc is *not* part of the decl-specifier seq; it's
10768 the declarator. Therefore, once we see a type-specifier
10769 (other than a cv-qualifier), we forbid any additional
10770 user-defined types. We *do* still allow things like `int
10771 int' to be considered a decl-specifier-seq, and issue the
10772 error message later. */
10775 /* A constructor declarator cannot follow a type-specifier. */
10777 {
10782 }
10783 }
10785 /* If we still do not have a DECL_SPEC, then there are no more
10786 decl-specifiers. */
10791 /* After we see one decl-specifier, further decl-specifiers are
10792 always optional. */
10794 }
10796 /* Don't allow a friend specifier with a class definition. */
10801 }
10803 /* Parse an (optional) storage-class-specifier.
10805 storage-class-specifier:
10806 auto
10807 register
10808 static
10809 extern
10810 mutable
10812 GNU Extension:
10814 storage-class-specifier:
10815 thread
10817 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
10819 static tree
10821 {
10823 {
10827 /* Fall through for C++98. */
10834 /* Consume the token. */
10839 }
10840 }
10842 /* Parse an (optional) function-specifier.
10844 function-specifier:
10845 inline
10846 virtual
10847 explicit
10849 Returns an IDENTIFIER_NODE corresponding to the keyword used.
10850 Updates DECL_SPECS, if it is non-NULL. */
10852 static tree
10855 {
10858 {
10864 /* 14.5.2.3 [temp.mem]
10866 A member function template shall not be virtual. */
10878 }
10880 /* Consume the token. */
10882 }
10884 /* Parse a linkage-specification.
10886 linkage-specification:
10887 extern string-literal { declaration-seq [opt] }
10888 extern string-literal declaration */
10890 static void
10892 {
10893 tree linkage;
10895 /* Look for the `extern' keyword. */
10898 /* Look for the string-literal. */
10901 /* Transform the literal into an identifier. If the literal is a
10902 wide-character string, or contains embedded NULs, then we can't
10903 handle it as the user wants. */
10906 {
10908 /* Assume C++ linkage. */
10910 }
10911 else
10914 /* We're now using the new linkage. */
10917 /* If the next token is a `{', then we're using the first
10918 production. */
10920 {
10921 /* Consume the `{' token. */
10923 /* Parse the declarations. */
10925 /* Look for the closing `}'. */
10927 }
10928 /* Otherwise, there's just one declaration. */
10929 else
10930 {
10933 saved_in_unbraced_linkage_specification_p
10937 parser->in_unbraced_linkage_specification_p
10939 }
10941 /* We're done with the linkage-specification. */
10943 }
10945 /* Parse a static_assert-declaration.
10947 static_assert-declaration:
10948 static_assert ( constant-expression , string-literal ) ;
10950 If MEMBER_P, this static_assert is a class member. */
10952 static void
10954 {
10955 tree condition;
10956 tree message;
10958 location_t saved_loc;
10961 /* Peek at the `static_assert' token so we can keep track of exactly
10962 where the static assertion started. */
10966 /* Look for the `static_assert' keyword. */
10968 RT_STATIC_ASSERT))
10971 /* We know we are in a static assertion; commit to any tentative
10972 parse. */
10976 /* Parse the `(' starting the static assertion condition. */
10979 /* Parse the constant-expression. Allow a non-constant expression
10980 here in order to give better diagnostics in finish_static_assert. */
10981 condition =
10986 /* Parse the separating `,'. */
10989 /* Parse the string-literal message. */
10994 /* A `)' completes the static assertion. */
11001 /* A semicolon terminates the declaration. */
11004 /* Complete the static assertion, which may mean either processing
11005 the static assert now or saving it for template instantiation. */
11007 }
11009 /* Parse a `decltype' type. Returns the type.
11011 simple-type-specifier:
11012 decltype ( expression ) */
11014 static tree
11016 {
11017 tree expr;
11026 {
11027 /* Already parsed. */
11030 }
11032 /* Look for the `decltype' token. */
11036 /* Types cannot be defined in a `decltype' expression. Save away the
11037 old message. */
11040 /* And create the new one. */
11041 parser->type_definition_forbidden_message
11044 /* The restrictions on constant-expressions do not apply inside
11045 decltype expressions. */
11046 saved_integral_constant_expression_p
11048 saved_non_integral_constant_expression_p
11052 /* Do not actually evaluate the expression. */
11055 /* Do not warn about problems with the expression. */
11058 /* Parse the opening `('. */
11062 /* First, try parsing an id-expression. */
11073 {
11076 cp_id_kind idk;
11080 /* Lookup the name we got back from the id-expression. */
11082 none_type,
11096 {
11097 /* Complete lookup of the id-expression. */
11098 expr = (finish_id_expression
11111 /* We found an id-expression, but it was something that we
11112 should not have found. This is an error, not something
11113 we can recover from, so note that we found an
11114 id-expression and we'll recover as gracefully as
11115 possible. */
11117 }
11122 /* We have an id-expression. */
11124 }
11127 {
11128 /* Abort the id-expression parse. */
11131 /* Parsing tentatively, again. */
11134 /* Parse a class member access. */
11142 /* We have an id-expression. */
11144 }
11147 /* We have parsed the complete id-expression or member access. */
11149 else
11150 {
11153 /* Abort our attempt to parse an id-expression or member access
11154 expression. */
11157 /* Within a parenthesized expression, a `>' token is always
11158 the greater-than operator. */
11159 saved_greater_than_is_operator_p
11163 /* Parse a full expression. */
11166 /* The `>' token might be the end of a template-id or
11167 template-parameter-list now. */
11168 parser->greater_than_is_operator_p
11170 }
11172 /* Go back to evaluating expressions. */
11176 /* Restore the old message and the integral constant expression
11177 flags. */
11179 parser->integral_constant_expression_p
11181 parser->non_integral_constant_expression_p
11184 /* Parse to the closing `)'. */
11186 {
11190 }
11193 tf_warning_or_error);
11195 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
11196 it again. */
11203 }
11205 /* Special member functions [gram.special] */
11207 /* Parse a conversion-function-id.
11209 conversion-function-id:
11210 operator conversion-type-id
11212 Returns an IDENTIFIER_NODE representing the operator. */
11214 static tree
11216 {
11217 tree type;
11218 tree saved_scope;
11219 tree saved_qualifying_scope;
11220 tree saved_object_scope;
11223 /* Look for the `operator' token. */
11226 /* When we parse the conversion-type-id, the current scope will be
11227 reset. However, we need that information in able to look up the
11228 conversion function later, so we save it here. */
11232 /* We must enter the scope of the class so that the names of
11233 entities declared within the class are available in the
11234 conversion-type-id. For example, consider:
11236 struct S {
11237 typedef int I;
11238 operator I();
11239 };
11241 S::operator I() { ... }
11243 In order to see that `I' is a type-name in the definition, we
11244 must be in the scope of `S'. */
11247 /* Parse the conversion-type-id. */
11249 /* Leave the scope of the class, if any. */
11252 /* Restore the saved scope. */
11256 /* If the TYPE is invalid, indicate failure. */
11260 }
11262 /* Parse a conversion-type-id:
11264 conversion-type-id:
11265 type-specifier-seq conversion-declarator [opt]
11267 Returns the TYPE specified. */
11269 static tree
11271 {
11272 tree attributes;
11273 cp_decl_specifier_seq type_specifiers;
11275 tree type_specified;
11277 /* Parse the attributes. */
11279 /* Parse the type-specifiers. */
11283 /* If that didn't work, stop. */
11286 /* Parse the conversion-declarator. */
11294 /* Don't give this error when parsing tentatively. This happens to
11295 work because we always parse this definitively once. */
11298 {
11300 {
11303 }
11307 }
11310 }
11312 /* Parse an (optional) conversion-declarator.
11314 conversion-declarator:
11315 ptr-operator conversion-declarator [opt]
11317 */
11321 {
11323 tree class_type;
11324 cp_cv_quals cv_quals;
11326 /* We don't know if there's a ptr-operator next, or not. */
11328 /* Try the ptr-operator. */
11330 /* If it worked, look for more conversion-declarators. */
11332 {
11335 /* Parse another optional declarator. */
11338 return cp_parser_make_indirect_declarator
11340 }
11343 }
11345 /* Parse an (optional) ctor-initializer.
11347 ctor-initializer:
11348 : mem-initializer-list
11350 Returns TRUE iff the ctor-initializer was actually present. */
11352 static bool
11354 {
11355 /* If the next token is not a `:', then there is no
11356 ctor-initializer. */
11358 {
11359 /* Do default initialization of any bases and members. */
11364 }
11366 /* Consume the `:' token. */
11368 /* And the mem-initializer-list. */
11372 }
11374 /* Parse a mem-initializer-list.
11376 mem-initializer-list:
11377 mem-initializer ... [opt]
11378 mem-initializer ... [opt] , mem-initializer-list */
11380 static void
11382 {
11387 /* Let the semantic analysis code know that we are starting the
11388 mem-initializer-list. */
11393 /* Loop through the list. */
11395 {
11396 tree mem_initializer;
11399 /* Parse the mem-initializer. */
11401 /* If the next token is a `...', we're expanding member initializers. */
11403 {
11404 /* Consume the `...'. */
11407 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
11408 can be expanded but members cannot. */
11411 {
11416 }
11418 /* Construct the pack expansion type. */
11421 }
11424 {
11428 }
11429 /* Look for a target constructor. */
11433 {
11436 {
11440 }
11442 }
11443 /* Add it to the list, unless it was erroneous. */
11445 {
11448 }
11449 /* If the next token is not a `,', we're done. */
11452 /* Consume the `,' token. */
11454 }
11456 /* Perform semantic analysis. */
11459 }
11461 /* Parse a mem-initializer.
11463 mem-initializer:
11464 mem-initializer-id ( expression-list [opt] )
11465 mem-initializer-id braced-init-list
11467 GNU extension:
11469 mem-initializer:
11470 ( expression-list [opt] )
11472 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
11473 class) or FIELD_DECL (for a non-static data member) to initialize;
11474 the TREE_VALUE is the expression-list. An empty initialization
11475 list is represented by void_list_node. */
11477 static tree
11479 {
11480 tree mem_initializer_id;
11481 tree expression_list;
11482 tree member;
11485 /* Find out what is being initialized. */
11487 {
11491 }
11492 else
11493 {
11497 }
11503 {
11509 }
11510 else
11511 {
11521 }
11531 }
11533 /* Parse a mem-initializer-id.
11535 mem-initializer-id:
11536 :: [opt] nested-name-specifier [opt] class-name
11537 identifier
11539 Returns a TYPE indicating the class to be initializer for the first
11540 production. Returns an IDENTIFIER_NODE indicating the data member
11541 to be initialized for the second production. */
11543 static tree
11545 {
11549 tree id;
11553 /* `typename' is not allowed in this context ([temp.res]). */
11555 {
11557 "keyword %<typename%> not allowed in this context (a qualified "
11560 }
11561 /* Look for the optional `::' operator. */
11562 global_scope_p
11566 /* Look for the optional nested-name-specifier. The simplest way to
11567 implement:
11569 [temp.res]
11571 The keyword `typename' is not permitted in a base-specifier or
11572 mem-initializer; in these contexts a qualified name that
11573 depends on a template-parameter is implicitly assumed to be a
11574 type name.
11576 is to assume that we have seen the `typename' keyword at this
11577 point. */
11578 nested_name_specifier_p
11587 /* If there is a `::' operator or a nested-name-specifier, then we
11588 are definitely looking for a class-name. */
11593 typename_type,
11597 /* Otherwise, we could also be looking for an ordinary identifier. */
11599 /* Try a class-name. */
11603 none_type,
11607 /* If we found one, we're done. */
11610 /* Otherwise, look for an ordinary identifier. */
11612 }
11614 /* Overloading [gram.over] */
11616 /* Parse an operator-function-id.
11618 operator-function-id:
11619 operator operator
11621 Returns an IDENTIFIER_NODE for the operator which is a
11622 human-readable spelling of the identifier, e.g., `operator +'. */
11624 static tree
11626 {
11627 /* Look for the `operator' keyword. */
11630 /* And then the name of the operator itself. */
11632 }
11634 /* Return an identifier node for a user-defined literal operator.
11635 The suffix identifier is chained to the operator name identifier. */
11637 static tree
11639 {
11640 tree identifier;
11645 /*IDENTIFIER_UDLIT_OPNAME_P (identifier) = 1; If we get a flag someday. */
11648 }
11650 /* Parse an operator.
11652 operator:
11653 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
11654 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
11655 || ++ -- , ->* -> () []
11657 GNU Extensions:
11659 operator:
11660 <? >? <?= >?=
11662 Returns an IDENTIFIER_NODE for the operator which is a
11663 human-readable spelling of the identifier, e.g., `operator +'. */
11665 static tree
11667 {
11671 /* Peek at the next token. */
11673 /* Figure out which operator we have. */
11675 {
11677 {
11680 /* The keyword should be either `new' or `delete'. */
11685 else
11688 /* Consume the `new' or `delete' token. */
11691 /* Peek at the next token. */
11693 /* If it's a `[' token then this is the array variant of the
11694 operator. */
11696 {
11697 /* Consume the `[' token. */
11699 /* Look for the `]' token. */
11703 }
11704 /* Otherwise, we have the non-array variant. */
11705 else
11709 }
11856 /* Consume the `('. */
11858 /* Look for the matching `)'. */
11863 /* Consume the `['. */
11865 /* Look for the matching `]'. */
11873 {
11876 }
11877 /* Consume the string. */
11879 /* Look for the suffix identifier. */
11882 {
11885 {
11888 }
11889 }
11890 else
11891 {
11894 }
11901 /* Anything else is an error. */
11903 }
11905 /* If we have selected an identifier, we need to consume the
11906 operator token. */
11909 /* Otherwise, no valid operator name was present. */
11910 else
11911 {
11914 }
11917 }
11919 /* Parse a template-declaration.
11921 template-declaration:
11922 export [opt] template < template-parameter-list > declaration
11924 If MEMBER_P is TRUE, this template-declaration occurs within a
11925 class-specifier.
11927 The grammar rule given by the standard isn't correct. What
11928 is really meant is:
11930 template-declaration:
11931 export [opt] template-parameter-list-seq
11932 decl-specifier-seq [opt] init-declarator [opt] ;
11933 export [opt] template-parameter-list-seq
11934 function-definition
11936 template-parameter-list-seq:
11937 template-parameter-list-seq [opt]
11938 template < template-parameter-list > */
11940 static void
11942 {
11943 /* Check for `export'. */
11945 {
11946 /* Consume the `export' token. */
11948 /* Warn that we do not support `export'. */
11950 }
11953 }
11955 /* Parse a template-parameter-list.
11957 template-parameter-list:
11958 template-parameter
11959 template-parameter-list , template-parameter
11961 Returns a TREE_LIST. Each node represents a template parameter.
11962 The nodes are connected via their TREE_CHAINs. */
11964 static tree
11966 {
11971 /* The loop below parses the template parms. We first need to know
11972 the total number of template parms to be able to compute proper
11973 canonical types of each dependent type. So after the loop, when
11974 we know the total number of template parms,
11975 end_template_parm_list computes the proper canonical types and
11976 fixes up the dependent types accordingly. */
11978 {
11979 tree parameter;
11982 location_t parm_loc;
11984 /* Parse the template-parameter. */
11989 /* Add it to the list. */
11992 parm_loc,
11993 parameter,
11994 is_non_type,
11995 is_parameter_pack);
11996 else
11997 {
12000 }
12002 /* If the next token is not a `,', we're done. */
12005 /* Otherwise, consume the `,' token. */
12007 }
12010 }
12012 /* Parse a template-parameter.
12014 template-parameter:
12015 type-parameter
12016 parameter-declaration
12018 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
12019 the parameter. The TREE_PURPOSE is the default value, if any.
12020 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
12021 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
12022 set to true iff this parameter is a parameter pack. */
12024 static tree
12027 {
12031 tree parm;
12033 /* Assume it is a type parameter or a template parameter. */
12035 /* Assume it not a parameter pack. */
12037 /* Peek at the next token. */
12039 /* If it is `class' or `template', we have a type-parameter. */
12042 /* If it is `class' or `typename' we do not know yet whether it is a
12043 type parameter or a non-type parameter. Consider:
12045 template <typename T, typename T::X X> ...
12047 or:
12049 template <class C, class D*> ...
12051 Here, the first parameter is a type parameter, and the second is
12052 a non-type parameter. We can tell by looking at the token after
12053 the identifier -- if it is a `,', `=', or `>' then we have a type
12054 parameter. */
12056 {
12057 /* Peek at the token after `class' or `typename'. */
12059 /* If it's an ellipsis, we have a template type parameter
12060 pack. */
12063 /* If it's an identifier, skip it. */
12066 /* Now, see if the token looks like the end of a template
12067 parameter. */
12072 }
12074 /* Otherwise, it is a non-type parameter.
12076 [temp.param]
12078 When parsing a default template-argument for a non-type
12079 template-parameter, the first non-nested `>' is taken as the end
12080 of the template parameter-list rather than a greater-than
12081 operator. */
12083 parameter_declarator
12087 /* If the parameter declaration is marked as a parameter pack, set
12088 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
12089 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
12090 grokdeclarator. */
12094 {
12097 }
12099 /* If the next token is an ellipsis, and we don't already have it
12100 marked as a parameter pack, then we have a parameter pack (that
12101 has no declarator). */
12105 {
12106 /* Consume the `...'. */
12111 }
12112 /* We might end up with a pack expansion as the type of the non-type
12113 template parameter, in which case this is a non-type template
12114 parameter pack. */
12118 {
12122 }
12125 {
12126 /* Parameter packs cannot have default arguments. However, a
12127 user may try to do so, so we'll parse them and give an
12128 appropriate diagnostic here. */
12132 /* Find the name of the parameter pack. */
12141 else
12145 /* Parse the default argument, but throw away the result. */
12147 }
12157 }
12159 /* Parse a type-parameter.
12161 type-parameter:
12162 class identifier [opt]
12163 class identifier [opt] = type-id
12164 typename identifier [opt]
12165 typename identifier [opt] = type-id
12166 template < template-parameter-list > class identifier [opt]
12167 template < template-parameter-list > class identifier [opt]
12168 = id-expression
12170 GNU Extension (variadic templates):
12172 type-parameter:
12173 class ... identifier [opt]
12174 typename ... identifier [opt]
12176 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
12177 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
12178 the declaration of the parameter.
12180 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
12182 static tree
12184 {
12186 tree parameter;
12188 /* Look for a keyword to tell us what kind of parameter this is. */
12194 {
12197 {
12198 tree identifier;
12199 tree default_argument;
12201 /* If the next token is an ellipsis, we have a template
12202 argument pack. */
12204 {
12205 /* Consume the `...' token. */
12210 }
12212 /* If the next token is an identifier, then it names the
12213 parameter. */
12216 else
12219 /* Create the parameter. */
12222 /* If the next token is an `=', we have a default argument. */
12224 {
12225 /* Consume the `=' token. */
12227 /* Parse the default-argument. */
12231 /* Template parameter packs cannot have default
12232 arguments. */
12234 {
12237 "template parameter pack %qD cannot have a "
12239 else
12241 "template parameter packs cannot have "
12244 }
12246 }
12247 else
12250 /* Create the combined representation of the parameter and the
12251 default argument. */
12253 }
12257 {
12258 tree identifier;
12259 tree default_argument;
12261 /* Look for the `<'. */
12263 /* Parse the template-parameter-list. */
12265 /* Look for the `>'. */
12267 /* Look for the `class' keyword. */
12269 /* If the next token is an ellipsis, we have a template
12270 argument pack. */
12272 {
12273 /* Consume the `...' token. */
12278 }
12279 /* If the next token is an `=', then there is a
12280 default-argument. If the next token is a `>', we are at
12281 the end of the parameter-list. If the next token is a `,',
12282 then we are at the end of this parameter. */
12286 {
12288 /* Treat invalid names as if the parameter were nameless. */
12291 }
12292 else
12295 /* Create the template parameter. */
12297 identifier);
12299 /* If the next token is an `=', then there is a
12300 default-argument. */
12302 {
12305 /* Consume the `='. */
12307 /* Parse the id-expression. */
12309 /* save token before parsing the id-expression, for error
12310 reporting */
12312 default_argument
12320 /* If the id-expression was a template-id that refers to
12321 a template-class, we already have the declaration here,
12322 so no further lookup is needed. */
12323 ;
12324 else
12325 /* Look up the name. */
12326 default_argument
12328 none_type,
12334 /* See if the default argument is valid. */
12335 default_argument
12338 /* Template parameter packs cannot have default
12339 arguments. */
12341 {
12344 "template parameter pack %qD cannot "
12346 identifier);
12347 else
12351 }
12353 }
12354 else
12357 /* Create the combined representation of the parameter and the
12358 default argument. */
12360 }
12366 }
12369 }
12371 /* Parse a template-id.
12373 template-id:
12374 template-name < template-argument-list [opt] >
12376 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
12377 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
12378 returned. Otherwise, if the template-name names a function, or set
12379 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
12380 names a class, returns a TYPE_DECL for the specialization.
12382 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
12383 uninstantiated templates. */
12385 static tree
12391 {
12393 tree templ;
12394 tree arguments;
12395 tree template_id;
12402 /* If the next token corresponds to a template-id, there is no need
12403 to reparse it. */
12406 {
12409 /* Get the stored value. */
12411 /* Perform any access checks that were deferred. */
12414 {
12419 tf_warning_or_error);
12420 }
12421 /* Return the stored value. */
12423 }
12425 /* Avoid performing name lookup if there is no possibility of
12426 finding a template-id. */
12429 && !cp_parser_nth_token_starts_template_argument_list_p
12431 {
12434 }
12436 /* Remember where the template-id starts. */
12442 /* Parse the template-name. */
12445 check_dependency_p,
12446 is_declaration,
12447 tag_type,
12450 {
12453 }
12455 /* If we find the sequence `[:' after a template-name, it's probably
12456 a digraph-typo for `< ::'. Substitute the tokens and check if we can
12457 parse correctly the argument list. */
12464 {
12466 /* Change `:' into `::'. */
12468 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
12469 CPP_LESS. */
12472 /* Parse the arguments. */
12475 {
12476 /* If we couldn't parse an argument list, then we revert our changes
12477 and return simply an error. Maybe this is not a template-id
12478 after all. */
12483 }
12484 /* Otherwise, emit an error about the invalid digraph, but continue
12485 parsing because we got our argument list. */
12488 {
12491 "%<<:%> is an alternate spelling for %<[%>."
12494 {
12498 }
12499 }
12500 }
12501 else
12502 {
12503 /* Look for the `<' that starts the template-argument-list. */
12505 {
12508 }
12509 /* Parse the arguments. */
12511 }
12513 /* Build a representation of the specialization. */
12516 TEMPLATE_ID_EXPR,
12520 {
12522 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
12523 template (rather than some instantiation thereof) only if
12524 is not nested within some other construct. For example, in
12525 "template <typename T> void f(T) { A<T>::", A<T> is just an
12526 instantiation of A. */
12529 CPP_SCOPE));
12530 template_id
12532 }
12533 else
12534 {
12535 /* If it's not a class-template or a template-template, it should be
12536 a function-template. */
12542 }
12544 /* If parsing tentatively, replace the sequence of tokens that makes
12545 up the template-id with a CPP_TEMPLATE_ID token. That way,
12546 should we re-parse the token stream, we will not have to repeat
12547 the effort required to do the parse, nor will we issue duplicate
12548 error messages about problems during instantiation of the
12549 template. */
12551 {
12554 /* Reset the contents of the START_OF_ID token. */
12556 /* Retrieve any deferred checks. Do not pop this access checks yet
12557 so the memory will not be reclaimed during token replacing below. */
12563 /* Purge all subsequent tokens. */
12566 /* ??? Can we actually assume that, if template_id ==
12567 error_mark_node, we will have issued a diagnostic to the
12568 user, as opposed to simply marking the tentative parse as
12569 failed? */
12572 }
12576 }
12578 /* Parse a template-name.
12580 template-name:
12581 identifier
12583 The standard should actually say:
12585 template-name:
12586 identifier
12587 operator-function-id
12589 A defect report has been filed about this issue.
12591 A conversion-function-id cannot be a template name because they cannot
12592 be part of a template-id. In fact, looking at this code:
12594 a.operator K<int>()
12596 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
12597 It is impossible to call a templated conversion-function-id with an
12598 explicit argument list, since the only allowed template parameter is
12599 the type to which it is converting.
12601 If TEMPLATE_KEYWORD_P is true, then we have just seen the
12602 `template' keyword, in a construction like:
12604 T::template f<3>()
12606 In that case `f' is taken to be a template-name, even though there
12607 is no way of knowing for sure.
12609 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
12610 name refers to a set of overloaded functions, at least one of which
12611 is a template, or an IDENTIFIER_NODE with the name of the template,
12612 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
12613 names are looked up inside uninstantiated templates. */
12615 static tree
12622 {
12623 tree identifier;
12624 tree decl;
12625 tree fns;
12628 /* If the next token is `operator', then we have either an
12629 operator-function-id or a conversion-function-id. */
12631 {
12632 /* We don't know whether we're looking at an
12633 operator-function-id or a conversion-function-id. */
12635 /* Try an operator-function-id. */
12637 /* If that didn't work, try a conversion-function-id. */
12639 {
12642 }
12643 }
12644 /* Look for the identifier. */
12645 else
12648 /* If we didn't find an identifier, we don't have a template-id. */
12652 /* If the name immediately followed the `template' keyword, then it
12653 is a template-name. However, if the next token is not `<', then
12654 we do not treat it as a template-name, since it is not being used
12655 as part of a template-id. This enables us to handle constructs
12656 like:
12658 template <typename T> struct S { S(); };
12659 template <typename T> S<T>::S();
12661 correctly. We would treat `S' as a template -- if it were `S<T>'
12662 -- but we do not if there is no `<'. */
12666 {
12667 /* In a declaration, in a dependent context, we pretend that the
12668 "template" keyword was present in order to improve error
12669 recovery. For example, given:
12671 template <typename T> void f(T::X<int>);
12673 we want to treat "X<int>" as a template-id. */
12675 && !template_keyword_p
12677 && check_dependency_p
12679 /* Do not do this for dtors (or ctors), since they never
12680 need the template keyword before their name. */
12682 {
12685 /* Explain what went wrong. */
12687 identifier);
12690 /* If parsing tentatively, find the location of the "<" token. */
12693 /* Parse the template arguments so that we can issue error
12694 messages about them. */
12697 /* Skip tokens until we find a good place from which to
12698 continue parsing. */
12703 /* If parsing tentatively, permanently remove the
12704 template argument list. That will prevent duplicate
12705 error messages from being issued about the missing
12706 "template" keyword. */
12712 }
12714 /* If the "template" keyword is present, then there is generally
12715 no point in doing name-lookup, so we just return IDENTIFIER.
12716 But, if the qualifying scope is non-dependent then we can
12717 (and must) do name-lookup normally. */
12723 }
12725 /* Look up the name. */
12727 tag_type,
12730 check_dependency_p,
12734 /* If DECL is a template, then the name was a template-name. */
12736 ;
12737 else
12738 {
12741 /* The standard does not explicitly indicate whether a name that
12742 names a set of overloaded declarations, some of which are
12743 templates, is a template-name. However, such a name should
12744 be a template-name; otherwise, there is no way to form a
12745 template-id for the overloaded templates. */
12753 {
12754 /* The name does not name a template. */
12757 }
12758 }
12760 /* If DECL is dependent, and refers to a function, then just return
12761 its name; we will look it up again during template instantiation. */
12763 {
12767 }
12770 }
12772 /* Parse a template-argument-list.
12774 template-argument-list:
12775 template-argument ... [opt]
12776 template-argument-list , template-argument ... [opt]
12778 Returns a TREE_VEC containing the arguments. */
12780 static tree
12782 {
12787 tree vec;
12794 /* Even if the template-id appears in an integral
12795 constant-expression, the contents of the argument list do
12796 not. */
12802 /* Parse the arguments. */
12803 do
12804 {
12805 tree argument;
12808 /* Consume the comma. */
12811 /* Parse the template-argument. */
12814 /* If the next token is an ellipsis, we're expanding a template
12815 argument pack. */
12817 {
12819 {
12823 }
12824 /* Consume the `...' token. */
12827 /* Make the argument into a TYPE_PACK_EXPANSION or
12828 EXPR_PACK_EXPANSION. */
12830 }
12833 {
12837 {
12840 }
12841 else
12843 }
12845 }
12858 #ifdef ENABLE_CHECKING
12860 #endif
12862 }
12864 /* Parse a template-argument.
12866 template-argument:
12867 assignment-expression
12868 type-id
12869 id-expression
12871 The representation is that of an assignment-expression, type-id, or
12872 id-expression -- except that the qualified id-expression is
12873 evaluated, so that the value returned is either a DECL or an
12874 OVERLOAD.
12876 Although the standard says "assignment-expression", it forbids
12877 throw-expressions or assignments in the template argument.
12878 Therefore, we use "conditional-expression" instead. */
12880 static tree
12882 {
12883 tree argument;
12889 cp_id_kind idk;
12891 /* There's really no way to know what we're looking at, so we just
12892 try each alternative in order.
12894 [temp.arg]
12896 In a template-argument, an ambiguity between a type-id and an
12897 expression is resolved to a type-id, regardless of the form of
12898 the corresponding template-parameter.
12900 Therefore, we try a type-id first. */
12903 /* If there was no error parsing the type-id but the next token is a
12904 '>>', our behavior depends on which dialect of C++ we're
12905 parsing. In C++98, we probably found a typo for '> >'. But there
12906 are type-id which are also valid expressions. For instance:
12908 struct X { int operator >> (int); };
12909 template <int V> struct Foo {};
12910 Foo<X () >> 5> r;
12912 Here 'X()' is a valid type-id of a function type, but the user just
12913 wanted to write the expression "X() >> 5". Thus, we remember that we
12914 found a valid type-id, but we still try to parse the argument as an
12915 expression to see what happens.
12917 In C++0x, the '>>' will be considered two separate '>'
12918 tokens. */
12922 {
12925 }
12926 else
12927 {
12928 /* If the next token isn't a `,' or a `>', then this argument wasn't
12929 really finished. This means that the argument is not a valid
12930 type-id. */
12933 /* If that worked, we're done. */
12936 }
12937 /* We're still not sure what the argument will be. */
12939 /* Try a template. */
12947 /* If the next token isn't a `,' or a `>', then this argument wasn't
12948 really finished. */
12952 {
12953 /* Figure out what is being referred to. If the id-expression
12954 was for a class template specialization, then we will have a
12955 TYPE_DECL at this point. There is no need to do name lookup
12956 at this point in that case. */
12959 none_type,
12968 }
12971 /* It must be a non-type argument. There permitted cases are given
12972 in [temp.arg.nontype]:
12974 -- an integral constant-expression of integral or enumeration
12975 type; or
12977 -- the name of a non-type template-parameter; or
12979 -- the name of an object or function with external linkage...
12981 -- the address of an object or function with external linkage...
12983 -- a pointer to member... */
12984 /* Look for a non-type template parameter. */
12986 {
12998 }
13000 /* If the next token is "&", the argument must be the address of an
13001 object or function with external linkage. */
13004 {
13007 }
13008 /* See if we might have an id-expression. */
13015 {
13018 address_p,
13025 else
13026 {
13027 tree probe;
13030 {
13033 }
13035 /* If we're in a template, we represent a qualified-id referring
13036 to a static data member as a SCOPE_REF even if the scope isn't
13037 dependent so that we can check access control later. */
13042 {
13043 /* A variable without external linkage might still be a
13044 valid constant-expression, so no error is issued here
13045 if the external-linkage check fails. */
13048 }
13050 /* All overloaded functions are allowed; if the external
13051 linkage test does not pass, an error will be issued
13052 later. */
13053 ;
13057 /* A pointer-to-member. */
13058 ;
13060 ;
13061 else
13065 {
13068 tf_warning_or_error);
13070 }
13071 }
13072 }
13073 /* If the argument started with "&", there are no other valid
13074 alternatives at this point. */
13076 {
13079 }
13081 /* If the argument wasn't successfully parsed as a type-id followed
13082 by '>>', the argument can only be a constant expression now.
13083 Otherwise, we try parsing the constant-expression tentatively,
13084 because the argument could really be a type-id. */
13097 /* We did our best to parse the argument as a non type-id, but that
13098 was the only alternative that matched (albeit with a '>' after
13099 it). We can assume it's just a typo from the user, and a
13100 diagnostic will then be issued. */
13102 }
13104 /* Parse an explicit-instantiation.
13106 explicit-instantiation:
13107 template declaration
13109 Although the standard says `declaration', what it really means is:
13111 explicit-instantiation:
13112 template decl-specifier-seq [opt] declarator [opt] ;
13114 Things like `template int S<int>::i = 5, int S<double>::j;' are not
13115 supposed to be allowed. A defect report has been filed about this
13116 issue.
13118 GNU Extension:
13120 explicit-instantiation:
13121 storage-class-specifier template
13122 decl-specifier-seq [opt] declarator [opt] ;
13123 function-specifier template
13124 decl-specifier-seq [opt] declarator [opt] ; */
13126 static void
13128 {
13130 cp_decl_specifier_seq decl_specifiers;
13135 /* Look for an (optional) storage-class-specifier or
13136 function-specifier. */
13138 {
13139 extension_specifier
13142 extension_specifier
13145 }
13147 /* Look for the `template' keyword. */
13149 /* Let the front end know that we are processing an explicit
13150 instantiation. */
13152 /* [temp.explicit] says that we are supposed to ignore access
13153 control while processing explicit instantiation directives. */
13155 /* Parse a decl-specifier-seq. */
13157 CP_PARSER_FLAGS_OPTIONAL,
13160 /* If there was exactly one decl-specifier, and it declared a class,
13161 and there's no declarator, then we have an explicit type
13162 instantiation. */
13164 {
13165 tree type;
13168 /* Turn access control back on for names used during
13169 template instantiation. */
13174 }
13175 else
13176 {
13178 tree decl;
13180 /* Parse the declarator. */
13181 declarator
13191 {
13194 "explicit instantiation shall not use"
13198 "explicit instantiation shall not use"
13203 /* Turn access control back on for names used during
13204 template instantiation. */
13206 /* Do the explicit instantiation. */
13208 }
13209 else
13210 {
13212 /* Skip the body of the explicit instantiation. */
13214 }
13215 }
13216 /* We're done with the instantiation. */
13222 }
13224 /* Parse an explicit-specialization.
13226 explicit-specialization:
13227 template < > declaration
13229 Although the standard says `declaration', what it really means is:
13231 explicit-specialization:
13232 template <> decl-specifier [opt] init-declarator [opt] ;
13233 template <> function-definition
13234 template <> explicit-specialization
13235 template <> template-declaration */
13237 static void
13239 {
13243 /* Look for the `template' keyword. */
13245 /* Look for the `<'. */
13247 /* Look for the `>'. */
13249 /* We have processed another parameter list. */
13251 /* [temp]
13253 A template ... explicit specialization ... shall not have C
13254 linkage. */
13256 {
13258 /* Give it C++ linkage to avoid confusing other parts of the
13259 front end. */
13262 }
13263 else
13265 /* Let the front end know that we are beginning a specialization. */
13267 {
13270 }
13272 /* If the next keyword is `template', we need to figure out whether
13273 or not we're looking a template-declaration. */
13275 {
13280 else
13282 }
13283 else
13284 /* Parse the dependent declaration. */
13290 /* We're done with the specialization. */
13292 /* For the erroneous case of a template with C linkage, we pushed an
13293 implicit C++ linkage scope; exit that scope now. */
13296 /* We're done with this parameter list. */
13298 }
13300 /* Parse a type-specifier.
13302 type-specifier:
13303 simple-type-specifier
13304 class-specifier
13305 enum-specifier
13306 elaborated-type-specifier
13307 cv-qualifier
13309 GNU Extension:
13311 type-specifier:
13312 __complex__
13314 Returns a representation of the type-specifier. For a
13315 class-specifier, enum-specifier, or elaborated-type-specifier, a
13316 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
13318 The parser flags FLAGS is used to control type-specifier parsing.
13320 If IS_DECLARATION is TRUE, then this type-specifier is appearing
13321 in a decl-specifier-seq.
13323 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
13324 class-specifier, enum-specifier, or elaborated-type-specifier, then
13325 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
13326 if a type is declared; 2 if it is defined. Otherwise, it is set to
13327 zero.
13329 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
13330 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
13331 is set to FALSE. */
13333 static tree
13335 cp_parser_flags flags,
13340 {
13346 /* Assume this type-specifier does not declare a new type. */
13349 /* And that it does not specify a cv-qualifier. */
13352 /* Peek at the next token. */
13355 /* If we're looking at a keyword, we can use that to guide the
13356 production we choose. */
13359 {
13364 /* Look for the enum-specifier. */
13366 /* If that worked, we're done. */
13368 {
13373 type_spec,
13377 }
13378 else
13381 /* Any of these indicate either a class-specifier, or an
13382 elaborated-type-specifier. */
13389 /* Parse tentatively so that we can back up if we don't find a
13390 class-specifier. */
13392 /* Look for the class-specifier. */
13395 /* If that worked, we're done. */
13397 {
13402 type_spec,
13406 }
13408 /* Fall through. */
13409 elaborated_type_specifier:
13410 /* We're declaring (not defining) a class or enum. */
13414 /* Fall through. */
13416 /* Look for an elaborated-type-specifier. */
13417 type_spec
13418 = (cp_parser_elaborated_type_specifier
13421 is_declaration));
13424 type_spec,
13448 /* The `__complex__' keyword is a GNU extension. */
13454 }
13456 /* Handle simple keywords. */
13458 {
13460 {
13463 }
13465 }
13467 /* If we do not already have a type-specifier, assume we are looking
13468 at a simple-type-specifier. */
13470 decl_specs,
13471 flags);
13473 /* If we didn't find a type-specifier, and a type-specifier was not
13474 optional in this context, issue an error message. */
13476 {
13479 }
13482 }
13484 /* Parse a simple-type-specifier.
13486 simple-type-specifier:
13487 :: [opt] nested-name-specifier [opt] type-name
13488 :: [opt] nested-name-specifier template template-id
13489 char
13490 wchar_t
13491 bool
13492 short
13493 int
13494 long
13495 signed
13496 unsigned
13497 float
13498 double
13499 void
13501 C++0x Extension:
13503 simple-type-specifier:
13504 auto
13505 decltype ( expression )
13506 char16_t
13507 char32_t
13508 __underlying_type ( type-id )
13510 GNU Extension:
13512 simple-type-specifier:
13513 __int128
13514 __typeof__ unary-expression
13515 __typeof__ ( type-id )
13517 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
13518 appropriately updated. */
13520 static tree
13523 cp_parser_flags flags)
13524 {
13528 /* Peek at the next token. */
13531 /* If we're looking at a keyword, things are easy. */
13533 {
13596 /* Since DR 743, decltype can either be a simple-type-specifier by
13597 itself or begin a nested-name-specifier. Parsing it will replace
13598 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
13599 handling below decide what to do. */
13605 /* Consume the `typeof' token. */
13607 /* Parse the operand to `typeof'. */
13609 /* If it is not already a TYPE, take its type. */
13639 }
13641 /* If token is an already-parsed decltype not followed by ::,
13642 it's a simple-type-specifier. */
13645 {
13653 }
13655 /* If the type-specifier was for a built-in type, we're done. */
13657 {
13658 /* Record the type. */
13665 type,
13671 /* Consume the token. */
13674 /* There is no valid C++ program where a non-template type is
13675 followed by a "<". That usually indicates that the user thought
13676 that the type was a template. */
13681 }
13683 /* The type-specifier must be a user-defined type. */
13685 {
13689 /* Don't gobble tokens or issue error messages if this is an
13690 optional type-specifier. */
13694 /* Look for the optional `::' operator. */
13695 global_p
13699 /* Look for the nested-name specifier. */
13700 qualified_p
13708 /* If we have seen a nested-name-specifier, and the next token
13709 is `template', then we are using the template-id production. */
13712 {
13713 /* Look for the template-id. */
13717 none_type,
13719 /* If the template-id did not name a type, we are out of
13720 luck. */
13722 {
13725 }
13726 }
13727 /* Otherwise, look for a type-name. */
13728 else
13730 /* Keep track of all name-lookups performed in class scopes. */
13732 && !global_p
13733 && !qualified_p
13737 /* If it didn't work out, we don't have a TYPE. */
13745 }
13747 /* If we didn't get a type-name, issue an error message. */
13749 {
13752 }
13755 {
13756 /* See if TYPE is an Objective-C type, and if so, parse and
13757 accept any protocol references following it. Do this before
13758 the cp_parser_check_for_invalid_template_id() call, because
13759 Objective-C types can be followed by '<...>' which would
13760 enclose protocol names rather than template arguments, and so
13761 everything is fine. */
13764 {
13768 /* Clobber the "unqualified" type previously entered into
13769 DECL_SPECS with the new, improved protocol-qualified version. */
13774 }
13776 /* There is no valid C++ program where a non-template type is
13777 followed by a "<". That usually indicates that the user
13778 thought that the type was a template. */
13780 none_type,
13782 }
13785 }
13787 /* Parse a type-name.
13789 type-name:
13790 class-name
13791 enum-name
13792 typedef-name
13793 simple-template-id [in c++0x]
13795 enum-name:
13796 identifier
13798 typedef-name:
13799 identifier
13801 Returns a TYPE_DECL for the type. */
13803 static tree
13805 {
13806 tree type_decl;
13808 /* We can't know yet whether it is a class-name or not. */
13810 /* Try a class-name. */
13814 none_type,
13818 /* If it's not a class-name, keep looking. */
13820 {
13822 /* It must be a typedef-name or an enum-name. */
13826 /* It is either a simple-template-id representing an
13827 instantiation of an alias template... */
13831 none_type,
13833 /* Note that this must be an instantiation of an alias template
13834 because [temp.names]/6 says:
13836 A template-id that names an alias template specialization
13837 is a type-name.
13839 Whereas [temp.names]/7 says:
13841 A simple-template-id that names a class template
13842 specialization is a class-name. */
13847 else
13851 /* ... Or a typedef-name or an enum-name. */
13853 }
13856 }
13858 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
13860 enum-name:
13861 identifier
13863 typedef-name:
13864 identifier
13866 Returns a TYPE_DECL for the type. */
13868 static tree
13870 {
13871 tree type_decl;
13872 tree identifier;
13879 /* Look up the type-name. */
13883 {
13887 {
13888 /* We have found a type introduced by a using
13889 declaration at class scope that refers to a dependent
13890 type.
13892 using typename :: [opt] nested-name-specifier unqualified-id ;
13893 */
13899 }
13900 }
13904 {
13905 /* See if this is an Objective-C type. */
13910 }
13912 /* Issue an error if we did not find a type-name. */
13914 /* In Objective-C, we have the complication that class names are
13915 normally type names and start declarations (eg, the
13916 "NSObject" in "NSObject *object;"), but can be used in an
13917 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
13918 is an expression. So, a classname followed by a dot is not a
13919 valid type-name. */
13922 {
13927 }
13928 /* Remember that the name was used in the definition of the
13929 current class so that we can check later to see if the
13930 meaning would have been different after the class was
13931 entirely defined. */
13937 }
13939 /* Parse an elaborated-type-specifier. Note that the grammar given
13940 here incorporates the resolution to DR68.
13942 elaborated-type-specifier:
13943 class-key :: [opt] nested-name-specifier [opt] identifier
13944 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
13945 enum-key :: [opt] nested-name-specifier [opt] identifier
13946 typename :: [opt] nested-name-specifier identifier
13947 typename :: [opt] nested-name-specifier template [opt]
13948 template-id
13950 GNU extension:
13952 elaborated-type-specifier:
13953 class-key attributes :: [opt] nested-name-specifier [opt] identifier
13954 class-key attributes :: [opt] nested-name-specifier [opt]
13955 template [opt] template-id
13956 enum attributes :: [opt] nested-name-specifier [opt] identifier
13958 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
13959 declared `friend'. If IS_DECLARATION is TRUE, then this
13960 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
13961 something is being declared.
13963 Returns the TYPE specified. */
13965 static tree
13969 {
13971 tree identifier;
13974 tree globalscope;
13977 /* See if we're looking at the `enum' keyword. */
13979 {
13980 /* Consume the `enum' token. */
13982 /* Remember that it's an enumeration type. */
13984 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
13985 enums) is used here. */
13988 {
13992 /* Consume the `struct' or `class' and parse it anyway. */
13994 }
13995 /* Parse the attributes. */
13997 }
13998 /* Or, it might be `typename'. */
14000 RID_TYPENAME))
14001 {
14002 /* Consume the `typename' token. */
14004 /* Remember that it's a `typename' type. */
14006 }
14007 /* Otherwise it must be a class-key. */
14008 else
14009 {
14013 /* Parse the attributes. */
14015 }
14017 /* Look for the `::' operator. */
14020 /* Look for the nested-name-specifier. */
14022 {
14027 is_declaration))
14029 }
14030 else
14031 /* Even though `typename' is not present, the proposed resolution
14032 to Core Issue 180 says that in `class A<T>::B', `B' should be
14033 considered a type-name, even if `A<T>' is dependent. */
14038 is_declaration);
14039 /* For everything but enumeration types, consider a template-id.
14040 For an enumeration type, consider only a plain identifier. */
14042 {
14044 tree decl;
14046 /* Allow the `template' keyword. */
14048 /* If we didn't see `template', we don't know if there's a
14049 template-id or not. */
14052 /* Parse the template-id. */
14056 tag_type,
14057 is_declaration);
14058 /* If we didn't find a template-id, look for an ordinary
14059 identifier. */
14061 ;
14062 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
14063 in effect, then we must assume that, upon instantiation, the
14064 template will correspond to a class. */
14068 typename_type,
14070 /* If the `typename' keyword is in effect and DECL is not a type
14071 decl. Then type is non existant. */
14074 else
14077 }
14080 {
14085 {
14088 }
14090 /* For a `typename', we needn't call xref_tag. */
14094 identifier,
14096 /* Look up a qualified name in the usual way. */
14098 {
14099 tree decl;
14100 tree ambiguous_decls;
14103 tag_type,
14110 /* If the lookup was ambiguous, an error will already have been
14111 issued. */
14115 /* If we are parsing friend declaration, DECL may be a
14116 TEMPLATE_DECL tree node here. However, we need to check
14117 whether this TEMPLATE_DECL results in valid code. Consider
14118 the following example:
14120 namespace N {
14121 template <class T> class C {};
14122 }
14123 class X {
14124 template <class T> friend class N::C; // #1, valid code
14125 };
14126 template <class T> class Y {
14127 friend class N::C; // #2, invalid code
14128 };
14130 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
14131 name lookup of `N::C'. We see that friend declaration must
14132 be template for the code to be valid. Note that
14133 processing_template_decl does not work here since it is
14134 always 1 for the above two cases. */
14136 decl = (cp_parser_maybe_treat_template_as_class
14141 {
14144 identifier,
14147 }
14150 {
14154 allow_template);
14158 }
14160 /* Forward declarations of nested types, such as
14162 class C1::C2;
14163 class C1::C2::C3;
14165 are invalid unless all components preceding the final '::'
14166 are complete. If all enclosing types are complete, these
14167 declarations become merely pointless.
14169 Invalid forward declarations of nested types are errors
14170 caught elsewhere in parsing. Those that are pointless arrive
14171 here. */
14178 }
14179 else
14180 {
14181 /* An elaborated-type-specifier sometimes introduces a new type and
14182 sometimes names an existing type. Normally, the rule is that it
14183 introduces a new type only if there is not an existing type of
14184 the same name already in scope. For example, given:
14186 struct S {};
14187 void f() { struct S s; }
14189 the `struct S' in the body of `f' is the same `struct S' as in
14190 the global scope; the existing definition is used. However, if
14191 there were no global declaration, this would introduce a new
14192 local class named `S'.
14194 An exception to this rule applies to the following code:
14196 namespace N { struct S; }
14198 Here, the elaborated-type-specifier names a new type
14199 unconditionally; even if there is already an `S' in the
14200 containing scope this declaration names a new type.
14201 This exception only applies if the elaborated-type-specifier
14202 forms the complete declaration:
14204 [class.name]
14206 A declaration consisting solely of `class-key identifier ;' is
14207 either a redeclaration of the name in the current scope or a
14208 forward declaration of the identifier as a class name. It
14209 introduces the name into the current scope.
14211 We are in this situation precisely when the next token is a `;'.
14213 An exception to the exception is that a `friend' declaration does
14214 *not* name a new type; i.e., given:
14216 struct S { friend struct T; };
14218 `T' is not a new type in the scope of `S'.
14220 Also, `new struct S' or `sizeof (struct S)' never results in the
14221 definition of a new type; a new type can only be declared in a
14222 declaration context. */
14224 tag_scope ts;
14228 /* Friends have special name lookup rules. */
14232 CPP_SEMICOLON))
14233 /* This is a `class-key identifier ;' */
14235 else
14238 template_p =
14242 /* An unqualified name was used to reference this type, so
14243 there were no qualifying templates. */
14250 }
14251 }
14256 /* Allow attributes on forward declarations of classes. */
14258 {
14268 else
14271 }
14274 {
14275 /* Indicate whether this class was declared as a `class' or as a
14276 `struct'. */
14280 }
14282 /* A "<" cannot follow an elaborated type specifier. If that
14283 happens, the user was probably trying to form a template-id. */
14288 }
14290 /* Parse an enum-specifier.
14292 enum-specifier:
14293 enum-head { enumerator-list [opt] }
14294 enum-head { enumerator-list , } [C++0x]
14296 enum-head:
14297 enum-key identifier [opt] enum-base [opt]
14298 enum-key nested-name-specifier identifier enum-base [opt]
14300 enum-key:
14301 enum
14302 enum class [C++0x]
14303 enum struct [C++0x]
14305 enum-base: [C++0x]
14306 : type-specifier-seq
14308 opaque-enum-specifier:
14309 enum-key identifier enum-base [opt] ;
14311 GNU Extensions:
14312 enum-key attributes[opt] identifier [opt] enum-base [opt]
14313 { enumerator-list [opt] }attributes[opt]
14314 enum-key attributes[opt] identifier [opt] enum-base [opt]
14315 { enumerator-list, }attributes[opt] [C++0x]
14317 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
14318 if the token stream isn't an enum-specifier after all. */
14320 static tree
14322 {
14323 tree identifier;
14325 tree prev_scope;
14327 tree attributes;
14340 /* Parse tentatively so that we can back up if we don't find a
14341 enum-specifier. */
14344 /* Caller guarantees that the current token is 'enum', an identifier
14345 possibly follows, and the token after that is an opening brace.
14346 If we don't have an identifier, fabricate an anonymous name for
14347 the enumeration being defined. */
14350 /* Parse the "class" or "struct", which indicates a scoped
14351 enumeration type in C++0x. */
14354 {
14358 /* Consume the `struct' or `class' token. */
14362 }
14366 /* Clear the qualification. */
14371 /* Figure out in what scope the declaration is being placed. */
14377 nested_name_specifier
14385 {
14386 tree name;
14390 enum_type,
14395 input_location);
14397 {
14400 {
14401 /* Are template enums allowed in ISO? */
14405 /* ignore a typename reference, for it will be solved by name
14406 in start_enum. */
14408 }
14409 }
14410 else
14413 }
14414 else
14415 {
14418 else
14419 {
14422 }
14423 }
14426 /* Check for the `:' that denotes a specified underlying type in C++0x.
14427 Note that a ':' could also indicate a bitfield width, however. */
14429 {
14430 cp_decl_specifier_seq type_specifiers;
14432 /* Consume the `:'. */
14435 /* Parse the type-specifier-seq. */
14440 /* At this point this is surely not elaborated type specifier. */
14449 /* If that didn't work, stop. */
14451 {
14456 }
14457 }
14459 /* Look for the `{' but don't consume it yet. */
14461 {
14463 {
14466 {
14469 }
14470 }
14471 /* An opaque-enum-specifier must have a ';' here. */
14474 {
14477 {
14480 }
14481 }
14482 }
14488 {
14490 {
14494 }
14496 {
14498 }
14499 }
14501 /* Issue an error message if type-definitions are forbidden here. */
14504 else
14505 /* Create the new type. We do this before consuming the opening
14506 brace so the enum will be recorded as being on the line of its
14507 tag (or the 'enum' keyword, if there is no tag). */
14511 /* If the next token is not '{' it is an opaque-enum-specifier or an
14512 elaborated-type-specifier. */
14514 {
14517 {
14518 /* The following catches invalid code such as:
14519 enum class S<int>::E { A, B, C }; */
14526 /* If that scope does not contain the scope in which the
14527 class was originally declared, the program is invalid. */
14529 {
14532 "declaration of %qD in namespace %qD which does not "
14535 else
14540 }
14541 }
14546 /* Consume the opening brace. */
14553 {
14557 }
14558 else
14559 {
14564 }
14568 /* If the next token is not '}', then there are some enumerators. */
14572 /* Consume the final '}'. */
14578 }
14579 else
14580 {
14581 /* If a ';' follows, then it is an opaque-enum-specifier
14582 and additional restrictions apply. */
14584 {
14591 }
14592 }
14594 /* Look for trailing attributes to apply to this enumeration, and
14595 apply them if appropriate. */
14597 {
14601 trailing_attr,
14603 }
14605 /* Finish up the enumeration. */
14607 {
14612 }
14615 {
14617 {
14620 }
14622 {
14624 }
14625 }
14626 out:
14629 }
14631 /* Parse an enumerator-list. The enumerators all have the indicated
14632 TYPE.
14634 enumerator-list:
14635 enumerator-definition
14636 enumerator-list , enumerator-definition */
14638 static void
14640 {
14642 {
14643 /* Parse an enumerator-definition. */
14646 /* If the next token is not a ',', we've reached the end of
14647 the list. */
14650 /* Otherwise, consume the `,' and keep going. */
14652 /* If the next token is a `}', there is a trailing comma. */
14654 {
14659 }
14660 }
14661 }
14663 /* Parse an enumerator-definition. The enumerator has the indicated
14664 TYPE.
14666 enumerator-definition:
14667 enumerator
14668 enumerator = constant-expression
14670 enumerator:
14671 identifier */
14673 static void
14675 {
14676 tree identifier;
14677 tree value;
14678 location_t loc;
14680 /* Save the input location because we are interested in the location
14681 of the identifier and not the location of the explicit value. */
14684 /* Look for the identifier. */
14689 /* If the next token is an '=', then there is an explicit value. */
14691 {
14692 /* Consume the `=' token. */
14694 /* Parse the value. */
14697 NULL);
14698 }
14699 else
14702 /* If we are processing a template, make sure the initializer of the
14703 enumerator doesn't contain any bare template parameter pack. */
14707 /* integral_constant_value will pull out this expression, so make sure
14708 it's folded as appropriate. */
14711 /* Create the enumerator. */
14713 }
14715 /* Parse a namespace-name.
14717 namespace-name:
14718 original-namespace-name
14719 namespace-alias
14721 Returns the NAMESPACE_DECL for the namespace. */
14723 static tree
14725 {
14726 tree identifier;
14727 tree namespace_decl;
14731 /* Get the name of the namespace. */
14736 /* Look up the identifier in the currently active scope. Look only
14737 for namespaces, due to:
14739 [basic.lookup.udir]
14741 When looking up a namespace-name in a using-directive or alias
14742 definition, only namespace names are considered.
14744 And:
14746 [basic.lookup.qual]
14748 During the lookup of a name preceding the :: scope resolution
14749 operator, object, function, and enumerator names are ignored.
14751 (Note that cp_parser_qualifying_entity only calls this
14752 function if the token after the name is the scope resolution
14753 operator.) */
14755 none_type,
14761 /* If it's not a namespace, issue an error. */
14764 {
14769 }
14772 }
14774 /* Parse a namespace-definition.
14776 namespace-definition:
14777 named-namespace-definition
14778 unnamed-namespace-definition
14780 named-namespace-definition:
14781 original-namespace-definition
14782 extension-namespace-definition
14784 original-namespace-definition:
14785 namespace identifier { namespace-body }
14787 extension-namespace-definition:
14788 namespace original-namespace-name { namespace-body }
14790 unnamed-namespace-definition:
14791 namespace { namespace-body } */
14793 static void
14795 {
14801 {
14805 }
14806 else
14809 /* Look for the `namespace' keyword. */
14812 /* Get the name of the namespace. We do not attempt to distinguish
14813 between an original-namespace-definition and an
14814 extension-namespace-definition at this point. The semantic
14815 analysis routines are responsible for that. */
14818 else
14821 /* Parse any specified attributes. */
14824 /* Look for the `{' to start the namespace. */
14826 /* Start the namespace. */
14829 /* "inline namespace" is equivalent to a stub namespace definition
14830 followed by a strong using directive. */
14832 {
14834 /* Set up namespace association. */
14838 /* Import the contents of the inline namespace. */
14842 }
14846 /* Parse the body of the namespace. */
14852 /* Finish the namespace. */
14854 /* Look for the final `}'. */
14856 }
14858 /* Parse a namespace-body.
14860 namespace-body:
14861 declaration-seq [opt] */
14863 static void
14865 {
14867 }
14869 /* Parse a namespace-alias-definition.
14871 namespace-alias-definition:
14872 namespace identifier = qualified-namespace-specifier ; */
14874 static void
14876 {
14877 tree identifier;
14878 tree namespace_specifier;
14882 /* Look for the `namespace' keyword. */
14884 /* Look for the identifier. */
14888 /* Look for the `=' token. */
14891 {
14893 /* Skip the definition. */
14898 }
14900 /* Look for the qualified-namespace-specifier. */
14901 namespace_specifier
14903 /* Look for the `;' token. */
14906 /* Register the alias in the symbol table. */
14908 }
14910 /* Parse a qualified-namespace-specifier.
14912 qualified-namespace-specifier:
14913 :: [opt] nested-name-specifier [opt] namespace-name
14915 Returns a NAMESPACE_DECL corresponding to the specified
14916 namespace. */
14918 static tree
14920 {
14921 /* Look for the optional `::'. */
14925 /* Look for the optional nested-name-specifier. */
14933 }
14935 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
14936 access declaration.
14938 using-declaration:
14939 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
14940 using :: unqualified-id ;
14942 access-declaration:
14943 qualified-id ;
14945 */
14947 static bool
14950 {
14954 tree decl;
14955 tree identifier;
14956 tree qscope;
14961 {
14964 }
14965 else
14966 {
14967 /* Look for the `using' keyword. */
14970 /* Peek at the next token. */
14972 /* See if it's `typename'. */
14974 {
14975 /* Remember that we've seen it. */
14977 /* Consume the `typename' token. */
14979 }
14980 }
14982 /* Look for the optional global scope qualification. */
14983 global_scope_p
14988 /* If we saw `typename', or didn't see `::', then there must be a
14989 nested-name-specifier present. */
14995 /* Otherwise, we could be in either of the two productions. In that
14996 case, treat the nested-name-specifier as optional. */
14997 else
15007 /* Something has already gone wrong; there's no need to parse
15008 further. Since an error has occurred, the return value of
15009 cp_parser_parse_definitely will be false, as required. */
15013 /* Parse the unqualified-id. */
15021 {
15026 }
15028 /* The function we call to handle a using-declaration is different
15029 depending on what scope we are in. */
15031 ;
15034 /* [namespace.udecl]
15036 A using declaration shall not name a template-id. */
15039 else
15040 {
15042 {
15043 /* Create the USING_DECL. */
15051 else
15052 /* Add it to the list of members in this class. */
15054 }
15055 else
15056 {
15058 identifier,
15068 else
15070 }
15071 }
15073 /* Look for the final `;'. */
15078 "access declarations are deprecated "
15079 "in favour of using-declarations; "
15083 }
15085 /* Parse an alias-declaration.
15087 alias-declaration:
15088 using identifier attribute-specifier-seq [opt] = type-id */
15090 static tree
15092 {
15096 cp_decl_specifier_seq decl_specs;
15100 /* Look for the `using' keyword. */
15118 /* Now we are going to parse the type-id of the declaration. */
15120 /*
15121 [dcl.type]/3 says:
15123 "A type-specifier-seq shall not define a class or enumeration
15124 unless it appears in the type-id of an alias-declaration (7.1.3) that
15125 is not the declaration of a template-declaration."
15127 In other words, if we currently are in an alias template, the
15128 type-id should not define a type.
15130 So let's set parser->type_definition_forbidden_message in that
15131 case; cp_parser_check_type_definition (called by
15132 cp_parser_class_specifier) will then emit an error if a type is
15133 defined in the type-id. */
15135 {
15139 }
15143 /* Restore the error message if need be. */
15152 /* A typedef-name can also be introduced by an alias-declaration. The
15153 identifier following the using keyword becomes a typedef-name. It has
15154 the same semantics as if it were introduced by the typedef
15155 specifier. In particular, it does not define a new type and it shall
15156 not appear in the type-id. */
15161 {
15164 ds_attribute,
15165 attrs_location);
15166 }
15168 ds_typedef,
15169 using_location);
15171 ds_alias,
15172 using_location);
15181 else
15192 /* If decl is a template, return its TEMPLATE_DECL so that it gets
15193 added into the symbol table; otherwise, return the TYPE_DECL. */
15197 {
15201 }
15204 }
15206 /* Parse a using-directive.
15208 using-directive:
15209 using namespace :: [opt] nested-name-specifier [opt]
15210 namespace-name ; */
15212 static void
15214 {
15215 tree namespace_decl;
15216 tree attribs;
15218 /* Look for the `using' keyword. */
15220 /* And the `namespace' keyword. */
15222 /* Look for the optional `::' operator. */
15224 /* And the optional nested-name-specifier. */
15230 /* Get the namespace being used. */
15232 /* And any specified attributes. */
15234 /* Update the symbol table. */
15236 /* Look for the final `;'. */
15238 }
15240 /* Parse an asm-definition.
15242 asm-definition:
15243 asm ( string-literal ) ;
15245 GNU Extension:
15247 asm-definition:
15248 asm volatile [opt] ( string-literal ) ;
15249 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
15250 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15251 : asm-operand-list [opt] ) ;
15252 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15253 : asm-operand-list [opt]
15254 : asm-clobber-list [opt] ) ;
15255 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
15256 : asm-clobber-list [opt]
15257 : asm-goto-list ) ; */
15259 static void
15261 {
15262 tree string;
15267 tree asm_stmt;
15275 /* Look for the `asm' keyword. */
15277 /* See if the next token is `volatile'. */
15280 {
15281 /* Remember that we saw the `volatile' keyword. */
15283 /* Consume the token. */
15285 }
15289 {
15290 /* Remember that we saw the `goto' keyword. */
15292 /* Consume the token. */
15294 }
15295 /* Look for the opening `('. */
15298 /* Look for the string. */
15301 {
15305 }
15307 /* If we're allowing GNU extensions, check for the extended assembly
15308 syntax. Unfortunately, the `:' tokens need not be separated by
15309 a space in C, and so, for compatibility, we tolerate that here
15310 too. Doing that means that we have to treat the `::' operator as
15311 two `:' tokens. */
15316 {
15321 /* The extended syntax was used. */
15324 /* Look for outputs. */
15326 {
15327 /* Consume the `:'. */
15329 /* Parse the output-operands. */
15331 CPP_COLON)
15333 CPP_SCOPE)
15335 CPP_CLOSE_PAREN)
15341 }
15342 /* If the next token is `::', there are no outputs, and the
15343 next token is the beginning of the inputs. */
15345 /* The inputs are coming next. */
15348 /* Look for inputs. */
15351 {
15352 /* Consume the `:' or `::'. */
15354 /* Parse the output-operands. */
15356 CPP_COLON)
15358 CPP_SCOPE)
15360 CPP_CLOSE_PAREN))
15365 }
15367 /* The clobbers are coming next. */
15370 /* Look for clobbers. */
15373 {
15375 /* Consume the `:' or `::'. */
15377 /* Parse the clobbers. */
15379 CPP_COLON)
15381 CPP_CLOSE_PAREN))
15383 }
15386 /* The labels are coming next. */
15389 /* Look for labels. */
15392 {
15394 /* Consume the `:' or `::'. */
15396 /* Parse the labels. */
15398 }
15402 }
15406 /* Look for the closing `)'. */
15414 {
15415 /* Create the ASM_EXPR. */
15417 {
15420 /* If the extended syntax was not used, mark the ASM_EXPR. */
15422 {
15428 }
15429 }
15430 else
15432 }
15433 }
15435 /* Declarators [gram.dcl.decl] */
15437 /* Parse an init-declarator.
15439 init-declarator:
15440 declarator initializer [opt]
15442 GNU Extension:
15444 init-declarator:
15445 declarator asm-specification [opt] attributes [opt] initializer [opt]
15447 function-definition:
15448 decl-specifier-seq [opt] declarator ctor-initializer [opt]
15449 function-body
15450 decl-specifier-seq [opt] declarator function-try-block
15452 GNU Extension:
15454 function-definition:
15455 __extension__ function-definition
15457 TM Extension:
15459 function-definition:
15460 decl-specifier-seq [opt] declarator function-transaction-block
15462 The DECL_SPECIFIERS apply to this declarator. Returns a
15463 representation of the entity declared. If MEMBER_P is TRUE, then
15464 this declarator appears in a class scope. The new DECL created by
15465 this declarator is returned.
15467 The CHECKS are access checks that should be performed once we know
15468 what entity is being declared (and, therefore, what classes have
15469 befriended it).
15471 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
15472 for a function-definition here as well. If the declarator is a
15473 declarator for a function-definition, *FUNCTION_DEFINITION_P will
15474 be TRUE upon return. By that point, the function-definition will
15475 have been completely parsed.
15477 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
15478 is FALSE.
15480 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15481 parsed declaration if it is an uninitialized single declarator not followed
15482 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15483 if present, will not be consumed. If returned, this declarator will be
15484 created with SD_INITIALIZED but will not call cp_finish_decl. */
15486 static tree
15495 {
15499 tree prefix_attributes;
15500 tree attributes;
15501 tree asm_specification;
15502 tree initializer;
15504 tree scope;
15506 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
15507 initialized with "= ..", CPP_OPEN_PAREN if initialized with
15508 "(...)". */
15517 /* Gather the attributes that were provided with the
15518 decl-specifiers. */
15521 /* Assume that this is not the declarator for a function
15522 definition. */
15526 /* Defer access checks while parsing the declarator; we cannot know
15527 what names are accessible until we know what is being
15528 declared. */
15531 /* Parse the declarator. */
15533 declarator
15537 member_p);
15538 /* Gather up the deferred checks. */
15541 /* If the DECLARATOR was erroneous, there's no need to go
15542 further. */
15546 /* Check that the number of template-parameter-lists is OK. */
15556 /* Figure out what scope the entity declared by the DECLARATOR is
15557 located in. `grokdeclarator' sometimes changes the scope, so
15558 we compute it now. */
15561 /* Perform any lookups in the declared type which were thought to be
15562 dependent, but are not in the scope of the declarator. */
15563 decl_specifiers->type
15566 /* If we're allowing GNU extensions, look for an asm-specification
15567 and attributes. */
15569 {
15570 /* Look for an asm-specification. */
15573 /* And attributes. */
15576 }
15577 else
15578 {
15581 }
15583 /* Peek at the next token. */
15585 /* Check to see if the token indicates the start of a
15586 function-definition. */
15589 {
15591 {
15592 /* If a function-definition should not appear here, issue an
15593 error message. */
15597 }
15598 else
15599 {
15600 location_t func_brace_location
15603 /* Neither attributes nor an asm-specification are allowed
15604 on a function-definition. */
15607 "an asm-specification is not allowed "
15612 /* This is a function-definition. */
15615 /* Parse the function definition. */
15618 decl_specifiers,
15619 declarator,
15620 prefix_attributes);
15621 else
15622 decl
15623 = (cp_parser_function_definition_from_specifiers_and_declarator
15627 {
15628 /* This is where the prologue starts... */
15631 }
15634 }
15635 }
15637 /* [dcl.dcl]
15639 Only in function declarations for constructors, destructors, and
15640 type conversions can the decl-specifier-seq be omitted.
15642 We explicitly postpone this check past the point where we handle
15643 function-definitions because we tolerate function-definitions
15644 that are missing their return types in some modes. */
15646 {
15650 }
15652 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
15656 {
15664 {
15670 }
15671 }
15672 else
15673 {
15674 /* If the init-declarator isn't initialized and isn't followed by a
15675 `,' or `;', it's not a valid init-declarator. */
15678 {
15681 else
15682 {
15685 }
15686 }
15689 }
15691 /* Because start_decl has side-effects, we should only call it if we
15692 know we're going ahead. By this point, we know that we cannot
15693 possibly be looking at any other construct. */
15696 /* If the decl specifiers were bad, issue an error now that we're
15697 sure this was intended to be a declarator. Then continue
15698 declaring the variable(s), as int, to try to cut down on further
15699 errors. */
15702 {
15705 }
15707 /* Check to see whether or not this declaration is a friend. */
15710 /* Enter the newly declared entry in the symbol table. If we're
15711 processing a declaration in a class-specifier, we wait until
15712 after processing the initializer. */
15714 {
15721 /* Adjust location of decl if declarator->id_loc is more appropriate:
15722 set, and decl wasn't merged with another decl, in which case its
15723 location would be different from input_location, and more accurate. */
15728 }
15730 /* Enter the SCOPE. That way unqualified names appearing in the
15731 initializer will be looked up in SCOPE. */
15734 /* Perform deferred access control checks, now that we know in which
15735 SCOPE the declared entity resides. */
15737 {
15740 /* If the entity being declared is a function, pretend that we
15741 are in its scope. If it is a `friend', it may have access to
15742 things that would not otherwise be accessible. */
15744 {
15747 }
15749 /* Perform access checks for template parameters. */
15752 /* Perform the access control checks for the declarator and the
15753 decl-specifiers. */
15756 /* Restore the saved value. */
15759 }
15761 /* Parse the initializer. */
15766 {
15768 {
15772 else
15773 {
15774 /* If the declaration was erroneous, we don't really
15775 know what the user intended, so just silently
15776 consume the initializer. */
15784 }
15785 }
15786 else
15787 {
15788 /* We want to record the extra mangling scope for in-class
15789 initializers of class members and initializers of static data
15790 member templates. The former involves deferring
15791 parsing of the initializer until end of class as with default
15792 arguments. So right here we only handle the latter. */
15802 }
15803 }
15805 /* The old parser allows attributes to appear after a parenthesized
15806 initializer. Mark Mitchell proposed removing this functionality
15807 on the GCC mailing lists on 2002-08-13. This parser accepts the
15808 attributes -- but ignores them. */
15815 /* For an in-class declaration, use `grokfield' to create the
15816 declaration. */
15818 {
15820 {
15823 }
15827 prefix_attributes);
15830 }
15832 /* Finish processing the declaration. But, skip member
15833 declarations. */
15835 {
15838 asm_specification,
15839 /* If the initializer is in parentheses, then this is
15840 a direct-initialization, which means that an
15841 `explicit' constructor is OK. Otherwise, an
15842 `explicit' constructor cannot be used. */
15845 }
15848 /* Core issue #226 (C++0x only): A default template-argument
15849 shall not be specified in a friend class template
15850 declaration. */
15858 }
15860 /* Parse a declarator.
15862 declarator:
15863 direct-declarator
15864 ptr-operator declarator
15866 abstract-declarator:
15867 ptr-operator abstract-declarator [opt]
15868 direct-abstract-declarator
15870 GNU Extensions:
15872 declarator:
15873 attributes [opt] direct-declarator
15874 attributes [opt] ptr-operator declarator
15876 abstract-declarator:
15877 attributes [opt] ptr-operator abstract-declarator [opt]
15878 attributes [opt] direct-abstract-declarator
15880 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
15881 detect constructor, destructor or conversion operators. It is set
15882 to -1 if the declarator is a name, and +1 if it is a
15883 function. Otherwise it is set to zero. Usually you just want to
15884 test for >0, but internally the negative value is used.
15886 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
15887 a decl-specifier-seq unless it declares a constructor, destructor,
15888 or conversion. It might seem that we could check this condition in
15889 semantic analysis, rather than parsing, but that makes it difficult
15890 to handle something like `f()'. We want to notice that there are
15891 no decl-specifiers, and therefore realize that this is an
15892 expression, not a declaration.)
15894 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
15895 the declarator is a direct-declarator of the form "(...)".
15897 MEMBER_P is true iff this declarator is a member-declarator. */
15901 cp_parser_declarator_kind dcl_kind,
15905 {
15908 cp_cv_quals cv_quals;
15909 tree class_type;
15912 /* Assume this is not a constructor, destructor, or type-conversion
15913 operator. */
15920 /* Check for the ptr-operator production. */
15922 /* Parse the ptr-operator. */
15926 /* If that worked, then we have a ptr-operator. */
15928 {
15929 /* If a ptr-operator was found, then this declarator was not
15930 parenthesized. */
15933 /* The dependent declarator is optional if we are parsing an
15934 abstract-declarator. */
15938 /* Parse the dependent declarator. */
15944 /* If we are parsing an abstract-declarator, we must handle the
15945 case where the dependent declarator is absent. */
15950 declarator = cp_parser_make_indirect_declarator
15952 }
15953 /* Everything else is a direct-declarator. */
15954 else
15955 {
15958 CPP_OPEN_PAREN);
15960 ctor_dtor_or_conv_p,
15961 member_p);
15962 }
15968 }
15970 /* Parse a direct-declarator or direct-abstract-declarator.
15972 direct-declarator:
15973 declarator-id
15974 direct-declarator ( parameter-declaration-clause )
15975 cv-qualifier-seq [opt]
15976 exception-specification [opt]
15977 direct-declarator [ constant-expression [opt] ]
15978 ( declarator )
15980 direct-abstract-declarator:
15981 direct-abstract-declarator [opt]
15982 ( parameter-declaration-clause )
15983 cv-qualifier-seq [opt]
15984 exception-specification [opt]
15985 direct-abstract-declarator [opt] [ constant-expression [opt] ]
15986 ( abstract-declarator )
15988 Returns a representation of the declarator. DCL_KIND is
15989 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
15990 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
15991 we are parsing a direct-declarator. It is
15992 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
15993 of ambiguity we prefer an abstract declarator, as per
15994 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
15995 cp_parser_declarator. */
15999 cp_parser_declarator_kind dcl_kind,
16002 {
16012 {
16013 /* Peek at the next token. */
16016 {
16017 /* This is either a parameter-declaration-clause, or a
16018 parenthesized declarator. When we know we are parsing a
16019 named declarator, it must be a parenthesized declarator
16020 if FIRST is true. For instance, `(int)' is a
16021 parameter-declaration-clause, with an omitted
16022 direct-abstract-declarator. But `((*))', is a
16023 parenthesized abstract declarator. Finally, when T is a
16024 template parameter `(T)' is a
16025 parameter-declaration-clause, and not a parenthesized
16026 named declarator.
16028 We first try and parse a parameter-declaration-clause,
16029 and then try a nested declarator (if FIRST is true).
16031 It is not an error for it not to be a
16032 parameter-declaration-clause, even when FIRST is
16033 false. Consider,
16035 int i (int);
16036 int i (3);
16038 The first is the declaration of a function while the
16039 second is the definition of a variable, including its
16040 initializer.
16042 Having seen only the parenthesis, we cannot know which of
16043 these two alternatives should be selected. Even more
16044 complex are examples like:
16046 int i (int (a));
16047 int i (int (3));
16049 The former is a function-declaration; the latter is a
16050 variable initialization.
16052 Thus again, we try a parameter-declaration-clause, and if
16053 that fails, we back out and return. */
16056 {
16057 tree params;
16060 tree t;
16062 /* In a member-declarator, the only valid interpretation
16063 of a parenthesis is the start of a
16064 parameter-declaration-clause. (It is invalid to
16065 initialize a static data member with a parenthesized
16066 initializer; only the "=" form of initialization is
16067 permitted.) */
16071 /* Consume the `('. */
16074 {
16075 /* If this is going to be an abstract declarator, we're
16076 in a declarator and we can't have default args. */
16079 }
16081 /* Inside the function parameter list, surrounding
16082 template-parameter-lists do not apply. */
16083 saved_num_template_parameter_lists
16089 /* Parse the parameter-declaration-clause. */
16092 parser->num_template_parameter_lists
16095 /* Consume the `)'. */
16098 /* If all went well, parse the cv-qualifier-seq and the
16099 exception-specification. */
16101 {
16102 cp_cv_quals cv_quals;
16103 cp_virt_specifiers virt_specifiers;
16104 tree exception_specification;
16105 tree late_return;
16113 /* Parse the cv-qualifier-seq. */
16115 /* And the exception-specification. */
16116 exception_specification
16119 late_return = (cp_parser_late_return_type_opt
16122 /* Parse the virt-specifier-seq. */
16125 /* Create the function-declarator. */
16127 params,
16128 cv_quals,
16129 virt_specifiers,
16130 exception_specification,
16131 late_return);
16132 /* Any subsequent parameter lists are to do with
16133 return type, so are not those of the declared
16134 function. */
16136 }
16138 /* Remove the function parms from scope. */
16144 /* Repeat the main loop. */
16146 }
16148 /* If this is the first, we can try a parenthesized
16149 declarator. */
16151 {
16157 /* Consume the `('. */
16159 /* Parse the nested declarator. */
16162 declarator
16165 member_p);
16168 /* Expect a `)'. */
16175 }
16176 /* Otherwise, we must be done. */
16177 else
16179 }
16182 {
16183 /* Parse an array-declarator. */
16184 tree bounds;
16192 /* Consume the `['. */
16194 /* Peek at the next token. */
16196 /* If the next token is `]', then there is no
16197 constant-expression. */
16199 {
16202 bounds
16212 {
16213 /* Normally, the array bound must be an integral constant
16214 expression. However, as an extension, we allow VLAs
16215 in function scopes as long as they aren't part of a
16216 parameter declaration. */
16220 }
16222 {
16223 /* Remember this wasn't a constant-expression. */
16226 }
16227 }
16228 else
16230 /* Look for the closing `]'. */
16232 {
16235 }
16238 }
16240 {
16241 {
16242 tree qualifying_scope;
16243 tree unqualified_name;
16244 special_function_kind sfk;
16249 /* Parse a declarator-id */
16252 {
16255 /* If we see an ellipsis, we should be looking at a
16256 parameter pack. */
16258 {
16259 /* Consume the `...' */
16263 }
16264 }
16267 unqualified_name
16271 {
16275 {
16276 /* Check whether an error occurred. */
16279 /* We already consumed the ellipsis to mark a
16280 parameter pack, but we have no way to report it,
16281 so abort the tentative parse. We will be exiting
16282 immediately anyway. */
16284 }
16285 else
16291 && (qualifying_scope
16294 {
16297 }
16298 }
16303 {
16308 }
16312 {
16313 /* In the declaration of a member of a template class
16314 outside of the class itself, the SCOPE will sometimes
16315 be a TYPENAME_TYPE. For example, given:
16317 template <typename T>
16318 int S<T>::R::i = 3;
16320 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
16321 this context, we must resolve S<T>::R to an ordinary
16322 type, rather than a typename type.
16324 The reason we normally avoid resolving TYPENAME_TYPEs
16325 is that a specialization of `S' might render
16326 `S<T>::R' not a type. However, if `S' is
16327 specialized, then this `i' will not be used, so there
16328 is no harm in resolving the types here. */
16329 tree type;
16331 /* Resolve the TYPENAME_TYPE. */
16334 /* If that failed, the declarator is invalid. */
16336 {
16339 "cannot define member of dependent typedef "
16341 else
16346 }
16348 }
16353 {
16354 tree class_type;
16359 else
16363 {
16366 {
16369 {
16373 "use %<%T::%D%> instead of %<%T::%D%> to "
16375 class_type,
16380 }
16381 else
16383 }
16384 else
16385 {
16386 /* We do not attempt to print the declarator
16387 here because we do not have enough
16388 information about its original syntactic
16389 form. */
16393 }
16394 }
16397 {
16403 for an anonymous type, even if the type
16404 got a name for linkage purposes. */
16407 class_type))
16408 {
16411 }
16419 }
16420 }
16422 unqualified_name,
16423 sfk);
16429 }
16431 handle_declarator:;
16434 /* Any names that appear after the declarator-id for a
16435 member are looked up in the containing scope. */
16440 /* Default args are only allowed on function
16441 declarations. */
16443 else
16447 }
16448 /* We're done. */
16449 else
16451 }
16453 /* For an abstract declarator, we might wind up with nothing at this
16454 point. That's an error; the declarator is not optional. */
16458 /* If we entered a scope, we must exit it now. */
16466 }
16468 /* Parse a ptr-operator.
16470 ptr-operator:
16471 * cv-qualifier-seq [opt]
16472 &
16473 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
16475 GNU Extension:
16477 ptr-operator:
16478 & cv-qualifier-seq [opt]
16480 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
16481 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
16482 an rvalue reference. In the case of a pointer-to-member, *TYPE is
16483 filled in with the TYPE containing the member. *CV_QUALS is
16484 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
16485 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
16486 Note that the tree codes returned by this function have nothing
16487 to do with the types of trees that will be eventually be created
16488 to represent the pointer or reference type being parsed. They are
16489 just constants with suggestive names. */
16490 static enum tree_code
16494 {
16498 /* Assume that it's not a pointer-to-member. */
16500 /* And that there are no cv-qualifiers. */
16503 /* Peek at the next token. */
16506 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
16516 {
16517 /* Consume the `*', `&' or `&&'. */
16520 /* A `*' can be followed by a cv-qualifier-seq, and so can a
16521 `&', if we are allowing GNU extensions. (The only qualifier
16522 that can legally appear after `&' is `restrict', but that is
16523 enforced during semantic analysis. */
16527 }
16528 else
16529 {
16530 /* Try the pointer-to-member case. */
16532 /* Look for the optional `::' operator. */
16535 /* Look for the nested-name specifier. */
16542 /* If we found it, and the next token is a `*', then we are
16543 indeed looking at a pointer-to-member operator. */
16546 {
16547 /* Indicate that the `*' operator was used. */
16555 else
16556 {
16557 /* The type of which the member is a member is given by the
16558 current SCOPE. */
16560 /* The next name will not be qualified. */
16564 /* Look for the optional cv-qualifier-seq. */
16566 }
16567 }
16568 /* If that didn't work we don't have a ptr-operator. */
16571 }
16574 }
16576 /* Parse an (optional) cv-qualifier-seq.
16578 cv-qualifier-seq:
16579 cv-qualifier cv-qualifier-seq [opt]
16581 cv-qualifier:
16582 const
16583 volatile
16585 GNU Extension:
16587 cv-qualifier:
16588 __restrict__
16590 Returns a bitmask representing the cv-qualifiers. */
16592 static cp_cv_quals
16594 {
16598 {
16600 cp_cv_quals cv_qualifier;
16602 /* Peek at the next token. */
16604 /* See if it's a cv-qualifier. */
16606 {
16622 }
16628 {
16631 }
16632 else
16633 {
16636 }
16637 }
16640 }
16642 /* Parse an (optional) virt-specifier-seq.
16644 virt-specifier-seq:
16645 virt-specifier virt-specifier-seq [opt]
16647 virt-specifier:
16648 override
16649 final
16651 Returns a bitmask representing the virt-specifiers. */
16653 static cp_virt_specifiers
16655 {
16659 {
16661 cp_virt_specifiers virt_specifier;
16663 /* Peek at the next token. */
16665 /* See if it's a virt-specifier-qualifier. */
16669 {
16672 }
16674 {
16677 }
16679 {
16681 }
16682 else
16686 {
16689 }
16690 else
16691 {
16694 }
16695 }
16697 }
16699 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
16700 is in scope even though it isn't real. */
16702 static void
16704 {
16705 tree this_parm;
16708 {
16709 /* We don't clear this between NSDMIs. Is it already what we want? */
16714 }
16717 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
16719 current_class_ref
16722 }
16724 /* Parse a late-specified return type, if any. This is not a separate
16725 non-terminal, but part of a function declarator, which looks like
16727 -> trailing-type-specifier-seq abstract-declarator(opt)
16729 Returns the type indicated by the type-id.
16731 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
16732 function. */
16734 static tree
16736 {
16738 tree type;
16740 /* Peek at the next token. */
16742 /* A late-specified return type is indicated by an initial '->'. */
16746 /* Consume the ->. */
16750 {
16751 /* DR 1207: 'this' is in scope in the trailing return type. */
16754 }
16762 }
16764 /* Parse a declarator-id.
16766 declarator-id:
16767 id-expression
16768 :: [opt] nested-name-specifier [opt] type-name
16770 In the `id-expression' case, the value returned is as for
16771 cp_parser_id_expression if the id-expression was an unqualified-id.
16772 If the id-expression was a qualified-id, then a SCOPE_REF is
16773 returned. The first operand is the scope (either a NAMESPACE_DECL
16774 or TREE_TYPE), but the second is still just a representation of an
16775 unqualified-id. */
16777 static tree
16779 {
16780 tree id;
16781 /* The expression must be an id-expression. Assume that qualified
16782 names are the names of types so that:
16784 template <class T>
16785 int S<T>::R::i = 3;
16787 will work; we must treat `S<T>::R' as the name of a type.
16788 Similarly, assume that qualified names are templates, where
16789 required, so that:
16791 template <class T>
16792 int S<T>::R<T>::i = 3;
16794 will work, too. */
16800 optional_p);
16804 }
16806 /* Parse a type-id.
16808 type-id:
16809 type-specifier-seq abstract-declarator [opt]
16811 Returns the TYPE specified. */
16813 static tree
16816 {
16817 cp_decl_specifier_seq type_specifier_seq;
16820 /* Parse the type-specifier-seq. */
16822 is_trailing_return,
16827 /* There might or might not be an abstract declarator. */
16829 /* Look for the declarator. */
16830 abstract_declarator
16834 /* Check to see if there really was a declarator. */
16840 {
16841 /* A type-id with type 'auto' is only ok if the abstract declarator
16842 is a function declarator with a late-specified return type. */
16847 else
16848 {
16851 }
16852 }
16855 is_template_arg);
16856 }
16859 {
16861 }
16864 {
16865 tree r;
16867 parser->type_definition_forbidden_message
16872 }
16875 {
16877 }
16879 /* Parse a type-specifier-seq.
16881 type-specifier-seq:
16882 type-specifier type-specifier-seq [opt]
16884 GNU extension:
16886 type-specifier-seq:
16887 attributes type-specifier-seq [opt]
16889 If IS_DECLARATION is true, we are at the start of a "condition" or
16890 exception-declaration, so we might be followed by a declarator-id.
16892 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
16893 i.e. we've just seen "->".
16895 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
16897 static void
16902 {
16907 /* Clear the TYPE_SPECIFIER_SEQ. */
16910 /* In the context of a trailing return type, enum E { } is an
16911 elaborated-type-specifier followed by a function-body, not an
16912 enum-specifier. */
16916 /* Parse the type-specifiers and attributes. */
16918 {
16919 tree type_specifier;
16922 /* Check for attributes first. */
16924 {
16929 }
16931 /* record the token of the beginning of the type specifier seq,
16932 for error reporting purposes*/
16936 /* Look for the type-specifier. */
16938 flags,
16939 type_specifier_seq,
16941 NULL,
16944 {
16945 /* If the first type-specifier could not be found, this is not a
16946 type-specifier-seq at all. */
16948 {
16952 }
16953 /* If subsequent type-specifiers could not be found, the
16954 type-specifier-seq is complete. */
16956 }
16959 /* The standard says that a condition can be:
16961 type-specifier-seq declarator = assignment-expression
16963 However, given:
16965 struct S {};
16966 if (int S = ...)
16968 we should treat the "S" as a declarator, not as a
16969 type-specifier. The standard doesn't say that explicitly for
16970 type-specifier-seq, but it does say that for
16971 decl-specifier-seq in an ordinary declaration. Perhaps it
16972 would be clearer just to allow a decl-specifier-seq here, and
16973 then add a semantic restriction that if any decl-specifiers
16974 that are not type-specifiers appear, the program is invalid. */
16977 }
16978 }
16980 /* Parse a parameter-declaration-clause.
16982 parameter-declaration-clause:
16983 parameter-declaration-list [opt] ... [opt]
16984 parameter-declaration-list , ...
16986 Returns a representation for the parameter declarations. A return
16987 value of NULL indicates a parameter-declaration-clause consisting
16988 only of an ellipsis. */
16990 static tree
16992 {
16993 tree parameters;
16998 /* Peek at the next token. */
17000 /* Check for trivial parameter-declaration-clauses. */
17002 {
17003 /* Consume the `...' token. */
17006 }
17008 /* There are no parameters. */
17009 {
17010 #ifndef NO_IMPLICIT_EXTERN_C
17014 else
17015 #endif
17017 }
17018 /* Check for `(void)', too, which is a special case. */
17022 {
17023 /* Consume the `void' token. */
17025 /* There are no parameters. */
17027 }
17029 /* Parse the parameter-declaration-list. */
17031 /* If a parse error occurred while parsing the
17032 parameter-declaration-list, then the entire
17033 parameter-declaration-clause is erroneous. */
17037 /* Peek at the next token. */
17039 /* If it's a `,', the clause should terminate with an ellipsis. */
17041 {
17042 /* Consume the `,'. */
17044 /* Expect an ellipsis. */
17045 ellipsis_p
17047 }
17048 /* It might also be `...' if the optional trailing `,' was
17049 omitted. */
17051 {
17052 /* Consume the `...' token. */
17054 /* And remember that we saw it. */
17056 }
17057 else
17060 /* Finish the parameter list. */
17065 }
17067 /* Parse a parameter-declaration-list.
17069 parameter-declaration-list:
17070 parameter-declaration
17071 parameter-declaration-list , parameter-declaration
17073 Returns a representation of the parameter-declaration-list, as for
17074 cp_parser_parameter_declaration_clause. However, the
17075 `void_list_node' is never appended to the list. Upon return,
17076 *IS_ERROR will be true iff an error occurred. */
17078 static tree
17080 {
17086 /* Assume all will go well. */
17088 /* The special considerations that apply to a function within an
17089 unbraced linkage specifications do not apply to the parameters
17090 to the function. */
17091 saved_in_unbraced_linkage_specification_p
17095 /* Look for more parameters. */
17097 {
17101 /* Parse the parameter. */
17102 parameter
17107 /* We don't know yet if the enclosing context is deprecated, so wait
17108 and warn in grokparms if appropriate. */
17114 PARM,
17120 /* If a parse error occurred parsing the parameter declaration,
17121 then the entire parameter-declaration-list is erroneous. */
17123 {
17127 }
17137 {
17141 }
17143 /* Add the new parameter to the list. */
17147 /* Peek at the next token. */
17150 /* These are for Objective-C++ */
17153 /* The parameter-declaration-list is complete. */
17156 {
17159 /* Peek at the next token. */
17161 /* If it's an ellipsis, then the list is complete. */
17164 /* Otherwise, there must be more parameters. Consume the
17165 `,'. */
17167 /* When parsing something like:
17169 int i(float f, double d)
17171 we can tell after seeing the declaration for "f" that we
17172 are not looking at an initialization of a variable "i",
17173 but rather at the declaration of a function "i".
17175 Due to the fact that the parsing of template arguments
17176 (as specified to a template-id) requires backtracking we
17177 cannot use this technique when inside a template argument
17178 list. */
17182 /* However, a parameter-declaration of the form
17183 "foat(f)" (which is a valid declaration of a
17184 parameter "f") can also be interpreted as an
17185 expression (the conversion of "f" to "float"). */
17188 }
17189 else
17190 {
17198 }
17199 }
17201 parser->in_unbraced_linkage_specification_p
17205 }
17207 /* Parse a parameter declaration.
17209 parameter-declaration:
17210 decl-specifier-seq ... [opt] declarator
17211 decl-specifier-seq declarator = assignment-expression
17212 decl-specifier-seq ... [opt] abstract-declarator [opt]
17213 decl-specifier-seq abstract-declarator [opt] = assignment-expression
17215 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
17216 declares a template parameter. (In that case, a non-nested `>'
17217 token encountered during the parsing of the assignment-expression
17218 is not interpreted as a greater-than operator.)
17220 Returns a representation of the parameter, or NULL if an error
17221 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
17222 true iff the declarator is of the form "(p)". */
17228 {
17230 cp_decl_specifier_seq decl_specifiers;
17232 tree default_argument;
17236 /* In a template parameter, `>' is not an operator.
17238 [temp.param]
17240 When parsing a default template-argument for a non-type
17241 template-parameter, the first non-nested `>' is taken as the end
17242 of the template parameter-list rather than a greater-than
17243 operator. */
17245 /* Type definitions may not appear in parameter types. */
17247 parser->type_definition_forbidden_message
17250 /* Parse the declaration-specifiers. */
17252 CP_PARSER_FLAGS_NONE,
17256 /* Complain about missing 'typename' or other invalid type names. */
17260 /* If an error occurred, there's no reason to attempt to parse the
17261 rest of the declaration. */
17263 {
17266 }
17268 /* Peek at the next token. */
17271 /* If the next token is a `)', `,', `=', `>', or `...', then there
17272 is no declarator. However, when variadic templates are enabled,
17273 there may be a declarator following `...'. */
17278 {
17282 }
17283 /* Otherwise, there should be a declarator. */
17284 else
17285 {
17289 /* After seeing a decl-specifier-seq, if the next token is not a
17290 "(", there is no possibility that the code is a valid
17291 expression. Therefore, if parsing tentatively, we commit at
17292 this point. */
17294 /* In an expression context, having seen:
17296 (int((char ...
17298 we cannot be sure whether we are looking at a
17299 function-type (taking a "char" as a parameter) or a cast
17300 of some object of type "char" to "int". */
17306 /* Parse the declarator. */
17309 CP_PARSER_DECLARATOR_EITHER,
17311 parenthesized_p,
17314 /* After the declarator, allow more attributes. */
17315 decl_specifiers.attributes
17318 }
17320 /* If the next token is an ellipsis, and we have not seen a
17321 declarator name, and the type of the declarator contains parameter
17322 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
17323 a parameter pack expansion expression. Otherwise, leave the
17324 ellipsis for a C-style variadic function. */
17327 {
17338 {
17339 /* Consume the `...'. */
17343 /* Build a pack expansion type */
17346 else
17348 }
17349 }
17351 /* The restriction on defining new types applies only to the type
17352 of the parameter, not to the default argument. */
17355 /* If the next token is `=', then process a default argument. */
17357 {
17359 /* If we are defining a class, then the tokens that make up the
17360 default argument must be saved and processed later. */
17365 /* Outside of a class definition, we can just parse the
17366 assignment-expression. */
17367 else
17368 default_argument
17372 {
17375 else
17376 {
17378 "default arguments are only "
17381 }
17382 }
17386 {
17387 /* Find the name of the parameter pack. */
17394 template_parm_p
17400 else
17402 template_parm_p
17409 }
17410 }
17411 else
17415 declarator,
17416 default_argument);
17417 }
17419 /* Parse a default argument and return it.
17421 TEMPLATE_PARM_P is true if this is a default argument for a
17422 non-type template parameter. */
17423 static tree
17425 {
17431 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
17432 set correctly. */
17435 /* Local variable names (and the `this' keyword) may not
17436 appear in a default argument. */
17439 /* Parse the assignment-expression. */
17442 default_argument
17452 }
17454 /* Parse a function-body.
17456 function-body:
17457 compound_statement */
17459 static void
17461 {
17463 }
17465 /* Parse a ctor-initializer-opt followed by a function-body. Return
17466 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
17467 is true we are parsing a function-try-block. */
17469 static bool
17472 {
17480 /* Begin the function body. */
17482 /* Parse the optional ctor-initializer. */
17485 /* If we're parsing a constexpr constructor definition, we need
17486 to check that the constructor body is indeed empty. However,
17487 before we get to cp_parser_function_body lot of junk has been
17488 generated, so we can't just check that we have an empty block.
17489 Rather we take a snapshot of the outermost block, and check whether
17490 cp_parser_function_body changed its state. */
17492 {
17496 }
17497 /* Parse the function-body. */
17501 /* Finish the function body. */
17505 }
17507 /* Parse an initializer.
17509 initializer:
17510 = initializer-clause
17511 ( expression-list )
17513 Returns an expression representing the initializer. If no
17514 initializer is present, NULL_TREE is returned.
17516 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
17517 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
17518 set to TRUE if there is no initializer present. If there is an
17519 initializer, and it is not a constant-expression, *NON_CONSTANT_P
17520 is set to true; otherwise it is set to false. */
17522 static tree
17525 {
17527 tree init;
17529 /* Peek at the next token. */
17532 /* Let our caller know whether or not this initializer was
17533 parenthesized. */
17535 /* Assume that the initializer is constant. */
17539 {
17540 /* Consume the `='. */
17542 /* Parse the initializer-clause. */
17544 }
17546 {
17551 non_constant_p);
17556 }
17558 {
17562 }
17563 else
17564 {
17565 /* Anything else is an error. */
17568 }
17571 }
17573 /* Parse an initializer-clause.
17575 initializer-clause:
17576 assignment-expression
17577 braced-init-list
17579 Returns an expression representing the initializer.
17581 If the `assignment-expression' production is used the value
17582 returned is simply a representation for the expression.
17584 Otherwise, calls cp_parser_braced_list. */
17586 static tree
17588 {
17589 tree initializer;
17591 /* Assume the expression is constant. */
17594 /* If it is not a `{', then we are looking at an
17595 assignment-expression. */
17597 {
17598 initializer
17601 non_constant_p);
17602 }
17603 else
17607 }
17609 /* Parse a brace-enclosed initializer list.
17611 braced-init-list:
17612 { initializer-list , [opt] }
17613 { }
17615 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
17616 the elements of the initializer-list (or NULL, if the last
17617 production is used). The TREE_TYPE for the CONSTRUCTOR will be
17618 NULL_TREE. There is no way to detect whether or not the optional
17619 trailing `,' was provided. NON_CONSTANT_P is as for
17620 cp_parser_initializer. */
17622 static tree
17624 {
17625 tree initializer;
17627 /* Consume the `{' token. */
17629 /* Create a CONSTRUCTOR to represent the braced-initializer. */
17631 /* If it's not a `}', then there is a non-trivial initializer. */
17633 {
17634 /* Parse the initializer list. */
17637 /* A trailing `,' token is allowed. */
17640 }
17641 /* Now, there should be a trailing `}'. */
17645 }
17647 /* Parse an initializer-list.
17649 initializer-list:
17650 initializer-clause ... [opt]
17651 initializer-list , initializer-clause ... [opt]
17653 GNU Extension:
17655 initializer-list:
17656 designation initializer-clause ...[opt]
17657 initializer-list , designation initializer-clause ...[opt]
17659 designation:
17660 . identifier =
17661 identifier :
17662 [ constant-expression ] =
17664 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
17665 for the initializer. If the INDEX of the elt is non-NULL, it is the
17666 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
17667 as for cp_parser_initializer. */
17671 {
17674 /* Assume all of the expressions are constant. */
17677 /* Parse the rest of the list. */
17679 {
17681 tree designator;
17682 tree initializer;
17685 /* If the next token is an identifier and the following one is a
17686 colon, we are looking at the GNU designated-initializer
17687 syntax. */
17691 {
17692 /* Warn the user that they are using an extension. */
17695 /* Consume the identifier. */
17697 /* Consume the `:'. */
17699 }
17700 /* Also handle the C99 syntax, '. id ='. */
17705 {
17706 /* Warn the user that they are using an extension. */
17709 /* Consume the `.'. */
17711 /* Consume the identifier. */
17713 /* Consume the `='. */
17715 }
17716 /* Also handle C99 array designators, '[ const ] ='. */
17720 {
17721 /* In C++11, [ could start a lambda-introducer. */
17729 }
17730 else
17733 /* Parse the initializer. */
17736 /* If any clause is non-constant, so is the entire initializer. */
17740 /* If we have an ellipsis, this is an initializer pack
17741 expansion. */
17743 {
17744 /* Consume the `...'. */
17747 /* Turn the initializer into an initializer expansion. */
17749 }
17751 /* Add it to the vector. */
17754 /* If the next token is not a comma, we have reached the end of
17755 the list. */
17759 /* Peek at the next token. */
17761 /* If the next token is a `}', then we're still done. An
17762 initializer-clause can have a trailing `,' after the
17763 initializer-list and before the closing `}'. */
17767 /* Consume the `,' token. */
17769 }
17772 }
17774 /* Classes [gram.class] */
17776 /* Parse a class-name.
17778 class-name:
17779 identifier
17780 template-id
17782 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
17783 to indicate that names looked up in dependent types should be
17784 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
17785 keyword has been used to indicate that the name that appears next
17786 is a template. TAG_TYPE indicates the explicit tag given before
17787 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
17788 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
17789 is the class being defined in a class-head.
17791 Returns the TYPE_DECL representing the class. */
17793 static tree
17801 {
17802 tree decl;
17803 tree scope;
17808 /* All class-names start with an identifier. */
17811 {
17814 }
17816 /* PARSER->SCOPE can be cleared when parsing the template-arguments
17817 to a template-id, so we save it here. */
17822 /* Any name names a type if we're following the `typename' keyword
17823 in a qualified name where the enclosing scope is type-dependent. */
17826 /* Handle the common case (an identifier, but not a template-id)
17827 efficiently. */
17830 {
17834 /* Look for the identifier. */
17838 /* If the next token isn't an identifier, we are certainly not
17839 looking at a class-name. */
17842 /* If we know this is a type-name, there's no need to look it
17843 up. */
17846 else
17847 {
17848 tree ambiguous_decls;
17849 /* If we already know that this lookup is ambiguous, then
17850 we've already issued an error message; there's no reason
17851 to check again. */
17853 {
17856 }
17857 /* If the next token is a `::', then the name must be a type
17858 name.
17860 [basic.lookup.qual]
17862 During the lookup for a name preceding the :: scope
17863 resolution operator, object, function, and enumerator
17864 names are ignored. */
17867 /* Look up the name. */
17869 tag_type,
17872 check_dependency_p,
17876 {
17880 }
17881 }
17882 }
17883 else
17884 {
17885 /* Try a template-id. */
17887 check_dependency_p,
17888 tag_type,
17889 is_declaration);
17892 }
17896 /* If this is a typename, create a TYPENAME_TYPE. */
17898 {
17903 }
17907 /* Check to see that it is really the name of a class. */
17911 /* Situations like this:
17913 template <typename T> struct A {
17914 typename T::template X<int>::I i;
17915 };
17917 are problematic. Is `T::template X<int>' a class-name? The
17918 standard does not seem to be definitive, but there is no other
17919 valid interpretation of the following `::'. Therefore, those
17920 names are considered class-names. */
17921 {
17925 }
17929 /* In Objective-C 2.0, a classname followed by '.' starts a
17930 dot-syntax expression, and it's not a type-name. */
17942 }
17944 /* Parse a class-specifier.
17946 class-specifier:
17947 class-head { member-specification [opt] }
17949 Returns the TREE_TYPE representing the class. */
17951 static tree
17953 {
17954 tree type;
17968 /* Parse the class-head. */
17971 /* If the class-head was a semantic disaster, skip the entire body
17972 of the class. */
17974 {
17978 }
17980 /* Look for the `{'. */
17982 {
17985 }
17987 /* Issue an error message if type-definitions are forbidden here. */
17989 /* Remember that we are defining one more class. */
17991 /* Inside the class, surrounding template-parameter-lists do not
17992 apply. */
17993 saved_num_template_parameter_lists
17996 /* We are not in a function body. */
17999 /* Or in a loop. */
18002 /* Or in a switch. */
18005 /* We are not immediately inside an extern "lang" block. */
18006 saved_in_unbraced_linkage_specification_p
18010 /* Start the class. */
18012 {
18015 }
18019 /* If the type is erroneous, skip the entire body of the class. */
18021 else
18022 /* Parse the member-specification. */
18025 /* Look for the trailing `}'. */
18027 /* Look for trailing attributes to apply to this class. */
18035 /* We've finished a type definition. Check for the common syntax
18036 error of forgetting a semicolon after the definition. We need to
18037 be careful, as we can't just check for not-a-semicolon and be done
18038 with it; the user might have typed:
18040 class X { } c = ...;
18041 class X { } *p = ...;
18043 and so forth. Instead, enumerate all the possible tokens that
18044 might follow this production; if we don't see one of them, then
18045 complain and silently insert the semicolon. */
18046 {
18051 {
18062 /* While it's legal for type qualifiers and storage class
18063 specifiers to follow type definitions in the grammar, only
18064 compiler testsuites contain code like that. Assume that if
18065 we see such code, then what we're really seeing is a case
18066 like:
18068 class X { }
18069 const <type> var = ...;
18071 or
18073 class Y { }
18074 static <type> func (...) ...
18076 i.e. the qualifier or specifier applies to the next
18077 declaration. To do so, however, we need to look ahead one
18078 more token to see if *that* token is a type specifier.
18080 This code could be improved to handle:
18082 class Z { }
18083 static const <type> var = ...; */
18086 {
18089 /* Handling user-defined types here would be nice, but very
18090 tricky. */
18091 want_semicolon
18094 }
18098 }
18100 /* If we don't have a type, then something is very wrong and we
18101 shouldn't try to do anything clever. Likewise for not seeing the
18102 closing brace. */
18104 {
18105 cp_token_position prev
18116 else
18119 /* Unget one token and smash it to look as though we encountered
18120 a semicolon in the input stream. */
18125 }
18126 }
18128 /* If this class is not itself within the scope of another class,
18129 then we need to parse the bodies of all of the queued function
18130 definitions. Note that the queued functions defined in a class
18131 are not always processed immediately following the
18132 class-specifier for that class. Consider:
18134 struct A {
18135 struct B { void f() { sizeof (A); } };
18136 };
18138 If `f' were processed before the processing of `A' were
18139 completed, there would be no way to compute the size of `A'.
18140 Note that the nesting we are interested in here is lexical --
18141 not the semantic nesting given by TYPE_CONTEXT. In particular,
18142 for:
18144 struct A { struct B; };
18145 struct A::B { void f() { } };
18147 there is no need to delay the parsing of `A::B::f'. */
18149 {
18150 tree decl;
18157 /* In a first pass, parse default arguments to the functions.
18158 Then, in a second pass, parse the bodies of the functions.
18159 This two-phased approach handles cases like:
18161 struct S {
18162 void f() { g(); }
18163 void g(int i = 3);
18164 };
18166 */
18169 {
18171 /* If there are default arguments that have not yet been processed,
18172 take care of them now. */
18174 {
18179 }
18180 /* Make sure that any template parameters are in scope. */
18182 /* Parse the default argument expressions. */
18184 /* Remove any template parameters from the symbol table. */
18186 }
18188 /* Now parse any NSDMIs. */
18192 {
18194 {
18199 }
18202 }
18208 /* Now parse the body of the functions. */
18212 }
18214 /* Put back any saved access checks. */
18217 /* Restore saved state. */
18221 parser->num_template_parameter_lists
18223 parser->in_unbraced_linkage_specification_p
18227 }
18229 static tree
18231 {
18232 tree ret;
18237 }
18239 /* Parse a class-head.
18241 class-head:
18242 class-key identifier [opt] base-clause [opt]
18243 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
18244 class-key nested-name-specifier [opt] template-id
18245 base-clause [opt]
18247 class-virt-specifier:
18248 final
18250 GNU Extensions:
18251 class-key attributes identifier [opt] base-clause [opt]
18252 class-key attributes nested-name-specifier identifier base-clause [opt]
18253 class-key attributes nested-name-specifier [opt] template-id
18254 base-clause [opt]
18256 Upon return BASES is initialized to the list of base classes (or
18257 NULL, if there are none) in the same form returned by
18258 cp_parser_base_clause.
18260 Returns the TYPE of the indicated class. Sets
18261 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
18262 involving a nested-name-specifier was used, and FALSE otherwise.
18264 Returns error_mark_node if this is not a class-head.
18266 Returns NULL_TREE if the class-head is syntactically valid, but
18267 semantically invalid in a way that means we should skip the entire
18268 body of the class. */
18270 static tree
18273 {
18274 tree nested_name_specifier;
18278 tree attributes;
18279 tree bases;
18289 /* Assume no nested-name-specifier will be present. */
18291 /* Assume no template parameter lists will be used in defining the
18292 type. */
18296 /* Look for the class-key. */
18301 /* Parse the attributes. */
18304 /* If the next token is `::', that is invalid -- but sometimes
18305 people do try to write:
18307 struct ::S {};
18309 Handle this gracefully by accepting the extra qualifier, and then
18310 issuing an error about it later if this really is a
18311 class-head. If it turns out just to be an elaborated type
18312 specifier, remain silent. */
18318 /* Determine the name of the class. Begin by looking for an
18319 optional nested-name-specifier. */
18321 nested_name_specifier
18327 /* If there was a nested-name-specifier, then there *must* be an
18328 identifier. */
18330 {
18332 /* Although the grammar says `identifier', it really means
18333 `class-name' or `template-name'. You are only allowed to
18334 define a class that has already been declared with this
18335 syntax.
18337 The proposed resolution for Core Issue 180 says that wherever
18338 you see `class T::X' you should treat `X' as a type-name.
18340 It is OK to define an inaccessible class; for example:
18342 class A { class B; };
18343 class A::B {};
18345 We do not know if we will see a class-name, or a
18346 template-name. We look for a class-name first, in case the
18347 class-name is a template-id; if we looked for the
18348 template-name first we would stop after the template-name. */
18353 class_type,
18357 /* If that didn't work, ignore the nested-name-specifier. */
18359 {
18365 }
18366 /* If we could not find a corresponding TYPE, treat this
18367 declaration like an unqualified declaration. */
18370 /* Otherwise, count the number of templates used in TYPE and its
18371 containing scopes. */
18372 else
18373 {
18374 tree scope;
18387 }
18388 }
18389 /* Otherwise, the identifier is optional. */
18390 else
18391 {
18392 /* We don't know whether what comes next is a template-id,
18393 an identifier, or nothing at all. */
18395 /* Check for a template-id. */
18400 class_key,
18402 /* If that didn't work, it could still be an identifier. */
18404 {
18406 {
18409 }
18410 else
18412 }
18413 else
18414 {
18417 }
18418 }
18423 {
18425 class_key,
18427 }
18430 /* If it's not a `:' or a `{' then we can't really be looking at a
18431 class-head, since a class-head only appears as part of a
18432 class-specifier. We have to detect this situation before calling
18433 xref_tag, since that has irreversible side-effects. */
18435 {
18439 }
18441 /* At this point, we're going ahead with the class-specifier, even
18442 if some other problem occurs. */
18445 {
18450 }
18451 /* Issue the error about the overly-qualified name now. */
18453 {
18458 }
18460 {
18465 }
18467 {
18468 tree scope;
18470 /* Reject typedef-names in class heads. */
18472 {
18475 type);
18478 }
18480 /* Figure out in what scope the declaration is being placed. */
18482 /* If that scope does not contain the scope in which the
18483 class was originally declared, the program is invalid. */
18485 {
18488 "declaration of %qD in namespace %qD which does not "
18491 else
18497 }
18498 /* [dcl.meaning]
18500 A declarator-id shall not be qualified except for the
18501 definition of a ... nested class outside of its class
18502 ... [or] the definition or explicit instantiation of a
18503 class member of a namespace outside of its namespace. */
18505 {
18510 }
18511 }
18512 /* An explicit-specialization must be preceded by "template <>". If
18513 it is not, try to recover gracefully. */
18517 {
18521 /* Take the same action that would have been taken by
18522 cp_parser_explicit_specialization. */
18525 }
18526 /* There must be no "return" statements between this point and the
18527 end of this function; set "type "to the correct return value and
18528 use "goto done;" to return. */
18529 /* Make sure that the right number of template parameters were
18530 present. */
18534 {
18535 /* If something went wrong, there is no point in even trying to
18536 process the class-definition. */
18539 }
18541 /* Look up the type. */
18543 {
18547 {
18551 }
18552 else
18553 {
18556 }
18559 }
18561 {
18562 tree class_type;
18564 /* Given:
18566 template <typename T> struct S { struct T };
18567 template <typename T> struct S<T>::T { };
18569 we will get a TYPENAME_TYPE when processing the definition of
18570 `S::T'. We need to resolve it to the actual type before we
18571 try to define it. */
18573 {
18578 else
18579 {
18582 }
18583 }
18587 {
18590 }
18593 /* Enter the scope indicated by the nested-name-specifier. */
18595 /* Get the canonical version of this type. */
18599 {
18602 {
18605 }
18606 }
18610 }
18612 {
18613 /* If the class was unnamed, create a dummy name. */
18618 }
18620 /* Indicate whether this class was declared as a `class' or as a
18621 `struct'. */
18626 /* If this type was already complete, and we see another definition,
18627 that's an error. */
18629 {
18631 type);
18633 type);
18636 }
18641 {
18642 /* Apply attributes now, before any use of the class as a template
18643 argument in its base list. */
18646 }
18648 /* We will have entered the scope containing the class; the names of
18649 base classes should be looked up in that context. For example:
18651 struct A { struct B {}; struct C; };
18652 struct A::C : B {};
18654 is valid. */
18656 /* Get the list of base-classes, if there is one. */
18659 else
18662 /* If we're really defining a class, process the base classes.
18663 If they're invalid, fail. */
18668 done:
18669 /* Leave the scope given by the nested-name-specifier. We will
18670 enter the class scope itself while processing the members. */
18675 {
18678 }
18684 out:
18687 }
18689 /* Parse a class-key.
18691 class-key:
18692 class
18693 struct
18694 union
18696 Returns the kind of class-key specified, or none_type to indicate
18697 error. */
18699 static enum tag_types
18701 {
18705 /* Look for the class-key. */
18710 /* Check to see if the TOKEN is a class-key. */
18715 }
18717 /* Parse an (optional) member-specification.
18719 member-specification:
18720 member-declaration member-specification [opt]
18721 access-specifier : member-specification [opt] */
18723 static void
18725 {
18727 {
18731 /* Peek at the next token. */
18733 /* If it's a `}', or EOF then we've seen all the members. */
18739 /* See if this token is a keyword. */
18742 {
18746 /* Consume the access-specifier. */
18748 /* Remember which access-specifier is active. */
18750 /* Look for the `:'. */
18755 /* Accept #pragmas at class scope. */
18757 {
18760 }
18762 /* Otherwise, the next construction must be a
18763 member-declaration. */
18765 }
18766 }
18767 }
18769 /* Parse a member-declaration.
18771 member-declaration:
18772 decl-specifier-seq [opt] member-declarator-list [opt] ;
18773 function-definition ; [opt]
18774 :: [opt] nested-name-specifier template [opt] unqualified-id ;
18775 using-declaration
18776 template-declaration
18777 alias-declaration
18779 member-declarator-list:
18780 member-declarator
18781 member-declarator-list , member-declarator
18783 member-declarator:
18784 declarator pure-specifier [opt]
18785 declarator constant-initializer [opt]
18786 identifier [opt] : constant-expression
18788 GNU Extensions:
18790 member-declaration:
18791 __extension__ member-declaration
18793 member-declarator:
18794 declarator attributes [opt] pure-specifier [opt]
18795 declarator attributes [opt] constant-initializer [opt]
18796 identifier [opt] attributes [opt] : constant-expression
18798 C++0x Extensions:
18800 member-declaration:
18801 static_assert-declaration */
18803 static void
18805 {
18806 cp_decl_specifier_seq decl_specifiers;
18807 tree prefix_attributes;
18808 tree decl;
18817 /* Check for the `__extension__' keyword. */
18819 {
18820 /* Recurse. */
18822 /* Restore the old value of the PEDANTIC flag. */
18826 }
18828 /* Check for a template-declaration. */
18830 {
18831 /* An explicit specialization here is an error condition, and we
18832 expect the specialization handler to detect and report this. */
18836 else
18840 }
18842 /* Check for a using-declaration. */
18844 {
18846 {
18847 /* Parse the using-declaration. */
18851 }
18852 else
18853 {
18854 tree decl;
18859 else
18863 }
18864 }
18866 /* Check for @defs. */
18868 {
18873 {
18878 }
18880 }
18882 /* If the next token is `static_assert' we have a static assertion. */
18884 {
18887 }
18894 /* Parse the decl-specifier-seq. */
18897 CP_PARSER_FLAGS_OPTIONAL,
18902 /* Check for an invalid type-name. */
18906 /* If there is no declarator, then the decl-specifier-seq should
18907 specify a type. */
18909 {
18910 /* If there was no decl-specifier-seq, and the next token is a
18911 `;', then we have something like:
18913 struct S { ; };
18915 [class.mem]
18917 Each member-declaration shall declare at least one member
18918 name of the class. */
18920 {
18924 }
18925 else
18926 {
18927 tree type;
18929 /* See if this declaration is a friend. */
18931 /* If there were decl-specifiers, check to see if there was
18932 a class-declaration. */
18934 /* Nested classes have already been added to the class, but
18935 a `friend' needs to be explicitly registered. */
18937 {
18938 /* If the `friend' keyword was present, the friend must
18939 be introduced with a class-key. */
18942 "in C++03 a class-key must be used "
18944 /* In this case:
18946 template <typename T> struct A {
18947 friend struct A<T>::B;
18948 };
18950 A<T>::B will be represented by a TYPENAME_TYPE, and
18951 therefore not recognized by check_tag_decl. */
18953 {
18957 }
18960 "friend declaration does not name a class or "
18962 else
18965 }
18966 /* If there is no TYPE, an error message will already have
18967 been issued. */
18969 ;
18970 /* An anonymous aggregate has to be handled specially; such
18971 a declaration really declares a data member (with a
18972 particular type), as opposed to a nested class. */
18974 {
18975 /* C++11 9.5/6. */
18978 "a storage class on an anonymous aggregate "
18981 /* Remove constructors and such from TYPE, now that we
18982 know it is an anonymous aggregate. */
18984 /* And make the corresponding data member. */
18987 /* Add it to the class. */
18989 }
18990 else
18991 cp_parser_check_access_in_redeclaration
18994 }
18995 }
18996 else
18997 {
19000 /* See if these declarations will be friends. */
19003 /* Keep going until we hit the `;' at the end of the
19004 declaration. */
19006 {
19008 tree first_attribute;
19010 /* Peek at the next token. */
19013 /* Check for a bitfield declaration. */
19018 {
19019 tree identifier;
19020 tree width;
19022 /* Get the name of the bitfield. Note that we cannot just
19023 check TOKEN here because it may have been invalidated by
19024 the call to cp_lexer_peek_nth_token above. */
19027 else
19030 /* Consume the `:' token. */
19032 /* Get the width of the bitfield. */
19033 width
19036 NULL);
19038 /* Look for attributes that apply to the bitfield. */
19040 /* Remember which attributes are prefix attributes and
19041 which are not. */
19043 /* Combine the attributes. */
19046 /* Create the bitfield declaration. */
19049 identifier,
19050 sfk_none)
19053 width,
19054 attributes);
19055 }
19056 else
19057 {
19059 tree initializer;
19060 tree asm_specification;
19063 /* Parse the declarator. */
19064 declarator
19070 /* If something went wrong parsing the declarator, make sure
19071 that we at least consume some tokens. */
19073 {
19074 /* Skip to the end of the statement. */
19076 /* If the next token is not a semicolon, that is
19077 probably because we just skipped over the body of
19078 a function. So, we consume a semicolon if
19079 present, but do not issue an error message if it
19080 is not present. */
19082 CPP_SEMICOLON))
19085 }
19088 cp_parser_check_for_definition_in_return_type
19092 /* Look for an asm-specification. */
19094 /* Look for attributes that apply to the declaration. */
19096 /* Remember which attributes are prefix attributes and
19097 which are not. */
19099 /* Combine the attributes. */
19102 /* If it's an `=', then we have a constant-initializer or a
19103 pure-specifier. It is not correct to parse the
19104 initializer before registering the member declaration
19105 since the member declaration should be in scope while
19106 its initializer is processed. However, the rest of the
19107 front end does not yet provide an interface that allows
19108 us to handle this correctly. */
19110 {
19111 /* In [class.mem]:
19113 A pure-specifier shall be used only in the declaration of
19114 a virtual function.
19116 A member-declarator can contain a constant-initializer
19117 only if it declares a static member of integral or
19118 enumeration type.
19120 Therefore, if the DECLARATOR is for a function, we look
19121 for a pure-specifier; otherwise, we look for a
19122 constant-initializer. When we call `grokfield', it will
19123 perform more stringent semantics checks. */
19134 {
19136 /* Don't require a constant rvalue in C++11, since we
19137 might want a reference constant. We'll enforce
19138 constancy later. */
19140 /* Parse the initializer. */
19143 }
19144 else
19145 /* Parse the initializer. */
19147 }
19150 {
19154 else
19156 }
19157 /* Otherwise, there is no initializer. */
19158 else
19161 /* See if we are probably looking at a function
19162 definition. We are certainly not looking at a
19163 member-declarator. Calling `grokfield' has
19164 side-effects, so we must not do it unless we are sure
19165 that we are looking at a member-declarator. */
19168 {
19169 /* The grammar does not allow a pure-specifier to be
19170 used when a member function is defined. (It is
19171 possible that this fact is an oversight in the
19172 standard, since a pure function may be defined
19173 outside of the class-specifier. */
19179 declarator,
19180 attributes);
19181 /* If the member was not a friend, declare it here. */
19184 /* Peek at the next token. */
19186 /* If the next token is a semicolon, consume it. */
19190 }
19191 else
19194 /* Create the declaration. */
19197 asm_specification,
19198 attributes);
19199 }
19201 /* Reset PREFIX_ATTRIBUTES. */
19207 /* If there is any qualification still in effect, clear it
19208 now; we will be starting fresh with the next declarator. */
19212 /* If it's a `,', then there are more declarators. */
19215 /* If the next token isn't a `;', then we have a parse error. */
19217 CPP_SEMICOLON))
19218 {
19219 /* The next token might be a ways away from where the
19220 actual semicolon is missing. Find the previous token
19221 and use that for our error position. */
19226 /* Assume that the user meant to provide a semicolon. If
19227 we were to cp_parser_skip_to_end_of_statement, we might
19228 skip to a semicolon inside a member function definition
19229 and issue nonsensical error messages. */
19231 }
19234 {
19235 /* Add DECL to the list of members. */
19244 /* Add DECL to the queue of NSDMI to be parsed later. */
19246 }
19250 }
19251 }
19254 out:
19256 }
19258 /* Parse a pure-specifier.
19260 pure-specifier:
19261 = 0
19263 Returns INTEGER_ZERO_NODE if a pure specifier is found.
19264 Otherwise, ERROR_MARK_NODE is returned. */
19266 static tree
19268 {
19271 /* Look for the `=' token. */
19274 /* Look for the `0' token. */
19283 /* Accept = default or = delete in c++0x mode. */
19286 {
19289 }
19291 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
19293 {
19298 }
19300 {
19303 }
19306 }
19308 /* Parse a constant-initializer.
19310 constant-initializer:
19311 = constant-expression
19313 Returns a representation of the constant-expression. */
19315 static tree
19317 {
19318 /* Look for the `=' token. */
19322 /* It is invalid to write:
19324 struct S { static const int i = { 7 }; };
19326 */
19328 {
19331 /* Consume the opening brace. */
19333 /* Skip the initializer. */
19335 /* Look for the trailing `}'. */
19339 }
19343 NULL);
19344 }
19346 /* Derived classes [gram.class.derived] */
19348 /* Parse a base-clause.
19350 base-clause:
19351 : base-specifier-list
19353 base-specifier-list:
19354 base-specifier ... [opt]
19355 base-specifier-list , base-specifier ... [opt]
19357 Returns a TREE_LIST representing the base-classes, in the order in
19358 which they were declared. The representation of each node is as
19359 described by cp_parser_base_specifier.
19361 In the case that no bases are specified, this function will return
19362 NULL_TREE, not ERROR_MARK_NODE. */
19364 static tree
19366 {
19369 /* Look for the `:' that begins the list. */
19372 /* Scan the base-specifier-list. */
19374 {
19376 tree base;
19379 /* Look for the base-specifier. */
19381 /* Look for the (optional) ellipsis. */
19383 {
19384 /* Consume the `...'. */
19388 }
19390 /* Add BASE to the front of the list. */
19392 {
19394 /* Make this a pack expansion type. */
19398 {
19401 }
19402 }
19403 /* Peek at the next token. */
19405 /* If it's not a comma, then the list is complete. */
19408 /* Consume the `,'. */
19410 }
19412 /* PARSER->SCOPE may still be non-NULL at this point, if the last
19413 base class had a qualified name. However, the next name that
19414 appears is certainly not qualified. */
19420 }
19422 /* Parse a base-specifier.
19424 base-specifier:
19425 :: [opt] nested-name-specifier [opt] class-name
19426 virtual access-specifier [opt] :: [opt] nested-name-specifier
19427 [opt] class-name
19428 access-specifier virtual [opt] :: [opt] nested-name-specifier
19429 [opt] class-name
19431 Returns a TREE_LIST. The TREE_PURPOSE will be one of
19432 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
19433 indicate the specifiers provided. The TREE_VALUE will be a TYPE
19434 (or the ERROR_MARK_NODE) indicating the type that was specified. */
19436 static tree
19438 {
19446 tree type;
19448 /* Process the optional `virtual' and `access-specifier'. */
19450 {
19451 /* Peek at the next token. */
19453 /* Process `virtual'. */
19455 {
19457 /* If `virtual' appears more than once, issue an error. */
19459 {
19463 }
19467 /* Consume the `virtual' token. */
19475 /* If more than one access specifier appears, issue an
19476 error. */
19479 {
19483 }
19487 /* Consume the access-specifier. */
19495 }
19496 }
19497 /* It is not uncommon to see programs mechanically, erroneously, use
19498 the 'typename' keyword to denote (dependent) qualified types
19499 as base classes. */
19501 {
19506 else
19508 "keyword %<typename%> not allowed in this context "
19511 }
19513 /* Look for the optional `::' operator. */
19515 /* Look for the nested-name-specifier. The simplest way to
19516 implement:
19518 [temp.res]
19520 The keyword `typename' is not permitted in a base-specifier or
19521 mem-initializer; in these contexts a qualified name that
19522 depends on a template-parameter is implicitly assumed to be a
19523 type name.
19525 is to pretend that we have seen the `typename' keyword at this
19526 point. */
19530 typename_type,
19532 /* If the base class is given by a qualified name, assume that names
19533 we see are type names or templates, as appropriate. */
19539 /* DR 950 allows decltype as a base-specifier. */
19541 else
19542 {
19543 /* Otherwise, look for the class-name. */
19545 class_scope_p,
19546 template_p,
19547 typename_type,
19552 }
19558 }
19560 /* Exception handling [gram.exception] */
19562 /* Parse an (optional) noexcept-specification.
19564 noexcept-specification:
19565 noexcept ( constant-expression ) [opt]
19567 If no noexcept-specification is present, returns NULL_TREE.
19568 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
19569 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
19570 there are no parentheses. CONSUMED_EXPR will be set accordingly.
19571 Otherwise, returns a noexcept specification unless RETURN_COND is true,
19572 in which case a boolean condition is returned instead. */
19574 static tree
19579 {
19583 /* Peek at the next token. */
19586 /* Is it a noexcept-specification? */
19588 {
19589 tree expr;
19593 {
19597 {
19598 /* Types may not be defined in an exception-specification. */
19600 parser->type_definition_forbidden_message
19605 /* Restore the saved message. */
19607 }
19608 else
19609 {
19612 }
19615 }
19616 else
19617 {
19621 }
19623 /* We cannot build a noexcept-spec right away because this will check
19624 that expr is a constexpr. */
19627 else
19629 }
19630 else
19632 }
19634 /* Parse an (optional) exception-specification.
19636 exception-specification:
19637 throw ( type-id-list [opt] )
19639 Returns a TREE_LIST representing the exception-specification. The
19640 TREE_VALUE of each node is a type. */
19642 static tree
19644 {
19646 tree type_id_list;
19649 /* Peek at the next token. */
19652 /* Is it a noexcept-specification? */
19658 /* If it's not `throw', then there's no exception-specification. */
19662 #if 0
19663 /* Enable this once a lot of code has transitioned to noexcept? */
19667 #endif
19669 /* Consume the `throw'. */
19672 /* Look for the `('. */
19675 /* Peek at the next token. */
19677 /* If it's not a `)', then there is a type-id-list. */
19679 {
19680 /* Types may not be defined in an exception-specification. */
19682 parser->type_definition_forbidden_message
19684 /* Parse the type-id-list. */
19686 /* Restore the saved message. */
19688 }
19689 else
19692 /* Look for the `)'. */
19696 }
19698 /* Parse an (optional) type-id-list.
19700 type-id-list:
19701 type-id ... [opt]
19702 type-id-list , type-id ... [opt]
19704 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
19705 in the order that the types were presented. */
19707 static tree
19709 {
19713 {
19715 tree type;
19717 /* Get the next type-id. */
19719 /* Parse the optional ellipsis. */
19721 {
19722 /* Consume the `...'. */
19725 /* Turn the type into a pack expansion expression. */
19727 }
19728 /* Add it to the list. */
19730 /* Peek at the next token. */
19732 /* If it is not a `,', we are done. */
19735 /* Consume the `,'. */
19737 }
19740 }
19742 /* Parse a try-block.
19744 try-block:
19745 try compound-statement handler-seq */
19747 static tree
19749 {
19750 tree try_block;
19760 }
19762 /* Parse a function-try-block.
19764 function-try-block:
19765 try ctor-initializer [opt] function-body handler-seq */
19767 static bool
19769 {
19770 tree compound_stmt;
19771 tree try_block;
19774 /* Look for the `try' keyword. */
19777 /* Let the rest of the front end know where we are. */
19779 /* Parse the function-body. */
19780 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
19782 /* We're done with the `try' part. */
19784 /* Parse the handlers. */
19786 /* We're done with the handlers. */
19790 }
19792 /* Parse a handler-seq.
19794 handler-seq:
19795 handler handler-seq [opt] */
19797 static void
19799 {
19801 {
19804 /* Parse the handler. */
19806 /* Peek at the next token. */
19808 /* If it's not `catch' then there are no more handlers. */
19811 }
19812 }
19814 /* Parse a handler.
19816 handler:
19817 catch ( exception-declaration ) compound-statement */
19819 static void
19821 {
19822 tree handler;
19823 tree declaration;
19833 }
19835 /* Parse an exception-declaration.
19837 exception-declaration:
19838 type-specifier-seq declarator
19839 type-specifier-seq abstract-declarator
19840 type-specifier-seq
19841 ...
19843 Returns a VAR_DECL for the declaration, or NULL_TREE if the
19844 ellipsis variant is used. */
19846 static tree
19848 {
19849 cp_decl_specifier_seq type_specifiers;
19853 /* If it's an ellipsis, it's easy to handle. */
19855 {
19856 /* Consume the `...' token. */
19859 }
19861 /* Types may not be defined in exception-declarations. */
19863 parser->type_definition_forbidden_message
19866 /* Parse the type-specifier-seq. */
19870 /* If it's a `)', then there is no declarator. */
19873 else
19879 /* Restore the saved message. */
19886 }
19888 /* Parse a throw-expression.
19890 throw-expression:
19891 throw assignment-expression [opt]
19893 Returns a THROW_EXPR representing the throw-expression. */
19895 static tree
19897 {
19898 tree expression;
19903 /* Figure out whether or not there is an assignment-expression
19904 following the "throw" keyword. */
19912 else
19917 }
19919 /* GNU Extensions */
19921 /* Parse an (optional) asm-specification.
19923 asm-specification:
19924 asm ( string-literal )
19926 If the asm-specification is present, returns a STRING_CST
19927 corresponding to the string-literal. Otherwise, returns
19928 NULL_TREE. */
19930 static tree
19932 {
19934 tree asm_specification;
19936 /* Peek at the next token. */
19938 /* If the next token isn't the `asm' keyword, then there's no
19939 asm-specification. */
19943 /* Consume the `asm' token. */
19945 /* Look for the `('. */
19948 /* Look for the string-literal. */
19951 /* Look for the `)'. */
19955 }
19957 /* Parse an asm-operand-list.
19959 asm-operand-list:
19960 asm-operand
19961 asm-operand-list , asm-operand
19963 asm-operand:
19964 string-literal ( expression )
19965 [ string-literal ] string-literal ( expression )
19967 Returns a TREE_LIST representing the operands. The TREE_VALUE of
19968 each node is the expression. The TREE_PURPOSE is itself a
19969 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
19970 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
19971 is a STRING_CST for the string literal before the parenthesis. Returns
19972 ERROR_MARK_NODE if any of the operands are invalid. */
19974 static tree
19976 {
19981 {
19982 tree string_literal;
19983 tree expression;
19984 tree name;
19987 {
19988 /* Consume the `[' token. */
19990 /* Read the operand name. */
19995 /* Look for the closing `]'. */
19997 }
19998 else
20000 /* Look for the string-literal. */
20003 /* Look for the `('. */
20005 /* Parse the expression. */
20007 /* Look for the `)'. */
20015 /* Add this operand to the list. */
20017 expression,
20018 asm_operands);
20019 /* If the next token is not a `,', there are no more
20020 operands. */
20023 /* Consume the `,'. */
20025 }
20028 }
20030 /* Parse an asm-clobber-list.
20032 asm-clobber-list:
20033 string-literal
20034 asm-clobber-list , string-literal
20036 Returns a TREE_LIST, indicating the clobbers in the order that they
20037 appeared. The TREE_VALUE of each node is a STRING_CST. */
20039 static tree
20041 {
20045 {
20046 tree string_literal;
20048 /* Look for the string literal. */
20050 /* Add it to the list. */
20052 /* If the next token is not a `,', then the list is
20053 complete. */
20056 /* Consume the `,' token. */
20058 }
20061 }
20063 /* Parse an asm-label-list.
20065 asm-label-list:
20066 identifier
20067 asm-label-list , identifier
20069 Returns a TREE_LIST, indicating the labels in the order that they
20070 appeared. The TREE_VALUE of each node is a label. */
20072 static tree
20074 {
20078 {
20081 /* Look for the identifier. */
20084 {
20087 {
20093 }
20094 }
20095 /* If the next token is not a `,', then the list is
20096 complete. */
20099 /* Consume the `,' token. */
20101 }
20104 }
20106 /* Parse an (optional) series of attributes.
20108 attributes:
20109 attributes attribute
20111 attribute:
20112 __attribute__ (( attribute-list [opt] ))
20114 The return value is as for cp_parser_attribute_list. */
20116 static tree
20118 {
20122 {
20124 tree attribute_list;
20127 /* Peek at the next token. */
20129 /* If it's not `__attribute__', then we're done. */
20133 /* Consume the `__attribute__' keyword. */
20135 /* Look for the two `(' tokens. */
20139 /* Peek at the next token. */
20142 /* Parse the attribute-list. */
20144 else
20145 /* If the next token is a `)', then there is no attribute
20146 list. */
20149 /* Look for the two `)' tokens. */
20157 /* Add these new attributes to the list. */
20159 }
20162 }
20164 /* Parse an attribute-list.
20166 attribute-list:
20167 attribute
20168 attribute-list , attribute
20170 attribute:
20171 identifier
20172 identifier ( identifier )
20173 identifier ( identifier , expression-list )
20174 identifier ( expression-list )
20176 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
20177 to an attribute. The TREE_PURPOSE of each node is the identifier
20178 indicating which attribute is in use. The TREE_VALUE represents
20179 the arguments, if any. */
20181 static tree
20183 {
20189 {
20191 tree identifier;
20192 tree attribute;
20194 /* Look for the identifier. We also allow keywords here; for
20195 example `__attribute__ ((const))' is legal. */
20199 {
20202 /* Consume the token. */
20205 /* Save away the identifier that indicates which attribute
20206 this is. */
20208 /* For keywords, use the canonical spelling, not the
20209 parsed identifier. */
20215 /* Peek at the next token. */
20217 /* If it's an `(', then parse the attribute arguments. */
20219 {
20223 vec = cp_parser_parenthesized_expression_list
20229 else
20230 {
20233 }
20234 /* Save the arguments away. */
20236 }
20239 {
20240 /* Add this attribute to the list. */
20243 }
20246 }
20247 /* Now, look for more attributes. If the next token isn't a
20248 `,', we're done. */
20252 /* Consume the comma and keep going. */
20254 }
20257 /* We built up the list in reverse order. */
20259 }
20261 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
20262 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
20263 current value of the PEDANTIC flag, regardless of whether or not
20264 the `__extension__' keyword is present. The caller is responsible
20265 for restoring the value of the PEDANTIC flag. */
20267 static bool
20269 {
20270 /* Save the old value of the PEDANTIC flag. */
20274 {
20275 /* Consume the `__extension__' token. */
20277 /* We're not being pedantic while the `__extension__' keyword is
20278 in effect. */
20282 }
20285 }
20287 /* Parse a label declaration.
20289 label-declaration:
20290 __label__ label-declarator-seq ;
20292 label-declarator-seq:
20293 identifier , label-declarator-seq
20294 identifier */
20296 static void
20298 {
20299 /* Look for the `__label__' keyword. */
20303 {
20304 tree identifier;
20306 /* Look for an identifier. */
20308 /* If we failed, stop. */
20311 /* Declare it as a label. */
20313 /* If the next token is a `;', stop. */
20316 /* Look for the `,' separating the label declarations. */
20318 }
20320 /* Look for the final `;'. */
20322 }
20324 /* Support Functions */
20326 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
20327 NAME should have one of the representations used for an
20328 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
20329 is returned. If PARSER->SCOPE is a dependent type, then a
20330 SCOPE_REF is returned.
20332 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
20333 returned; the name was already resolved when the TEMPLATE_ID_EXPR
20334 was formed. Abstractly, such entities should not be passed to this
20335 function, because they do not need to be looked up, but it is
20336 simpler to check for this special case here, rather than at the
20337 call-sites.
20339 In cases not explicitly covered above, this function returns a
20340 DECL, OVERLOAD, or baselink representing the result of the lookup.
20341 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
20342 is returned.
20344 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
20345 (e.g., "struct") that was used. In that case bindings that do not
20346 refer to types are ignored.
20348 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
20349 ignored.
20351 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
20352 are ignored.
20354 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
20355 types.
20357 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
20358 TREE_LIST of candidates if name-lookup results in an ambiguity, and
20359 NULL_TREE otherwise. */
20361 static tree
20368 location_t name_location)
20369 {
20370 tree decl;
20373 /* Assume that the lookup will be unambiguous. */
20377 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
20378 no longer valid. Note that if we are parsing tentatively, and
20379 the parse fails, OBJECT_TYPE will be automatically restored. */
20385 /* A template-id has already been resolved; there is no lookup to
20386 do. */
20390 {
20394 }
20396 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
20397 it should already have been checked to make sure that the name
20398 used matches the type being destroyed. */
20400 {
20401 tree type;
20403 /* Figure out to which type this destructor applies. */
20408 else
20410 /* If that's not a class type, there is no destructor. */
20417 /* If it was a class type, return the destructor. */
20419 }
20421 /* By this point, the NAME should be an ordinary identifier. If
20422 the id-expression was a qualified name, the qualifying scope is
20423 stored in PARSER->SCOPE at this point. */
20426 /* Perform the lookup. */
20428 {
20434 /* If the SCOPE is dependent, the lookup must be deferred until
20435 the template is instantiated -- unless we are explicitly
20436 looking up names in uninstantiated templates. Even then, we
20437 cannot look up the name if the scope is not a class type; it
20438 might, for example, be a template type parameter. */
20443 /* Defer lookup. */
20445 else
20446 {
20449 /* If PARSER->SCOPE is a dependent type, then it must be a
20450 class type, and we must not be checking dependencies;
20451 otherwise, we would have processed this lookup above. So
20452 that PARSER->SCOPE is not considered a dependent base by
20453 lookup_member, we must enter the scope here. */
20457 /* If the PARSER->SCOPE is a template specialization, it
20458 may be instantiated during name lookup. In that case,
20459 errors may be issued. Even if we rollback the current
20460 tentative parse, those errors are valid. */
20465 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
20466 lookup result and the nested-name-specifier nominates a class C:
20467 * if the name specified after the nested-name-specifier, when
20468 looked up in C, is the injected-class-name of C (Clause 9), or
20469 * if the name specified after the nested-name-specifier is the
20470 same as the identifier or the simple-template-id's template-
20471 name in the last component of the nested-name-specifier,
20472 the name is instead considered to name the constructor of
20473 class C. [ Note: for example, the constructor is not an
20474 acceptable lookup result in an elaborated-type-specifier so
20475 the constructor would not be used in place of the
20476 injected-class-name. --end note ] Such a constructor name
20477 shall be used only in the declarator-id of a declaration that
20478 names a constructor or in a using-declaration. */
20486 /* If we have a single function from a using decl, pull it out. */
20493 }
20495 /* If the scope is a dependent type and either we deferred lookup or
20496 we did lookup but didn't find the name, rememeber the name. */
20499 {
20501 {
20502 tree type;
20504 /* The resolution to Core Issue 180 says that `struct
20505 A::B' should be considered a type-name, even if `A'
20506 is dependent. */
20510 }
20514 CPP_CLOSE_PAREN)))
20518 else
20521 is_template);
20522 }
20525 }
20527 {
20529 /* Look up the name in the scope of the OBJECT_TYPE, unless the
20530 OBJECT_TYPE is not a class. */
20532 /* If the OBJECT_TYPE is a template specialization, it may
20533 be instantiated during name lookup. In that case, errors
20534 may be issued. Even if we rollback the current tentative
20535 parse, those errors are valid. */
20537 name,
20540 tf_warning_or_error);
20541 /* Look it up in the enclosing context, too. */
20549 }
20550 else
20551 {
20557 }
20559 /* If the lookup failed, let our caller know. */
20563 /* Pull out the template from an injected-class-name (or multiple). */
20567 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
20569 {
20572 /* The error message we have to print is too complicated for
20573 cp_parser_error, so we incorporate its actions directly. */
20575 {
20577 name);
20579 }
20581 }
20589 /* If we have resolved the name of a member declaration, check to
20590 see if the declaration is accessible. When the name resolves to
20591 set of overloaded functions, accessibility is checked when
20592 overload resolution is done.
20594 During an explicit instantiation, access is not checked at all,
20595 as per [temp.explicit]. */
20602 }
20604 /* Like cp_parser_lookup_name, but for use in the typical case where
20605 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
20606 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
20608 static tree
20610 {
20612 none_type,
20617 location);
20618 }
20620 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
20621 the current context, return the TYPE_DECL. If TAG_NAME_P is
20622 true, the DECL indicates the class being defined in a class-head,
20623 or declared in an elaborated-type-specifier.
20625 Otherwise, return DECL. */
20627 static tree
20629 {
20630 /* If the TEMPLATE_DECL is being declared as part of a class-head,
20631 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
20633 struct A {
20634 template <typename T> struct B;
20635 };
20637 template <typename T> struct A::B {};
20639 Similarly, in an elaborated-type-specifier:
20641 namespace N { struct X{}; }
20643 struct A {
20644 template <typename T> friend struct N::X;
20645 };
20647 However, if the DECL refers to a class type, and we are in
20648 the scope of the class, then the name lookup automatically
20649 finds the TYPE_DECL created by build_self_reference rather
20650 than a TEMPLATE_DECL. For example, in:
20652 template <class T> struct S {
20653 S s;
20654 };
20656 there is no need to handle such case. */
20662 }
20664 /* If too many, or too few, template-parameter lists apply to the
20665 declarator, issue an error message. Returns TRUE if all went well,
20666 and FALSE otherwise. */
20668 static bool
20671 location_t declarator_location)
20672 {
20675 /* We haven't seen any classes that involve template parameters yet. */
20679 {
20682 {
20683 tree scope;
20688 {
20689 /* You're supposed to have one `template <...>'
20690 for every template class, but you don't need one
20691 for a full specialization. For example:
20693 template <class T> struct S{};
20694 template <> struct S<int> { void f(); };
20695 void S<int>::f () {}
20697 is correct; there shouldn't be a `template <>' for
20698 the definition of `S<int>::f'. */
20700 /* If SCOPE does not have template information of any
20701 kind, then it is not a template, nor is it nested
20702 within a template. */
20710 }
20711 }
20714 /* If the DECLARATOR has the form `X<y>' then it uses one
20715 additional level of template parameters. */
20718 return cp_parser_check_template_parameters
20735 }
20737 }
20739 /* NUM_TEMPLATES were used in the current declaration. If that is
20740 invalid, return FALSE and issue an error messages. Otherwise,
20741 return TRUE. If DECLARATOR is non-NULL, then we are checking a
20742 declarator and we can print more accurate diagnostics. */
20744 static bool
20747 location_t location,
20749 {
20750 /* If there are the same number of template classes and parameter
20751 lists, that's OK. */
20754 /* If there are more, but only one more, then we are referring to a
20755 member template. That's OK too. */
20758 /* If there are more template classes than parameter lists, we have
20759 something like:
20761 template <class T> void S<T>::R<T>::f (); */
20763 {
20773 else
20776 }
20777 /* Otherwise, there are too many template parameter lists. We have
20778 something like:
20780 template <class T> template <class U> void S::f(); */
20783 }
20785 /* Parse an optional `::' token indicating that the following name is
20786 from the global namespace. If so, PARSER->SCOPE is set to the
20787 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
20788 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
20789 Returns the new value of PARSER->SCOPE, if the `::' token is
20790 present, and NULL_TREE otherwise. */
20792 static tree
20794 {
20797 /* Peek at the next token. */
20799 /* If we're looking at a `::' token then we're starting from the
20800 global namespace, not our current location. */
20802 {
20803 /* Consume the `::' token. */
20805 /* Set the SCOPE so that we know where to start the lookup. */
20811 }
20813 {
20817 }
20820 }
20822 /* Returns TRUE if the upcoming token sequence is the start of a
20823 constructor declarator. If FRIEND_P is true, the declarator is
20824 preceded by the `friend' specifier. */
20826 static bool
20828 {
20830 tree nested_name_specifier;
20833 /* The common case is that this is not a constructor declarator, so
20834 try to avoid doing lots of work if at all possible. It's not
20835 valid declare a constructor at function scope. */
20838 /* And only certain tokens can begin a constructor declarator. */
20846 /* Parse tentatively; we are going to roll back all of the tokens
20847 consumed here. */
20849 /* Assume that we are looking at a constructor declarator. */
20852 /* Look for the optional `::' operator. */
20855 /* Look for the nested-name-specifier. */
20856 nested_name_specifier
20862 /* Outside of a class-specifier, there must be a
20863 nested-name-specifier. */
20871 /* If we have a class scope, this is easy; DR 147 says that S::S always
20872 names the constructor, and no other qualified name could. */
20875 {
20885 }
20886 /* If we still think that this might be a constructor-declarator,
20887 look for a class-name. */
20889 {
20890 /* If we have:
20892 template <typename T> struct S {
20893 S();
20894 };
20896 we must recognize that the nested `S' names a class. */
20897 tree type_decl;
20901 none_type,
20905 /* If there was no class-name, then this is not a constructor. */
20908 /* If we're still considering a constructor, we have to see a `(',
20909 to begin the parameter-declaration-clause, followed by either a
20910 `)', an `...', or a decl-specifier. We need to check for a
20911 type-specifier to avoid being fooled into thinking that:
20913 S (f) (int);
20915 is a constructor. (It is actually a function named `f' that
20916 takes one parameter (of type `int') and returns a value of type
20917 `S'. */
20925 /* A parameter declaration begins with a decl-specifier,
20926 which is either the "attribute" keyword, a storage class
20927 specifier, or (usually) a type-specifier. */
20929 {
20930 tree type;
20934 /* Names appearing in the type-specifier should be looked up
20935 in the scope of the class. */
20938 else
20939 {
20942 {
20946 {
20949 }
20950 }
20952 }
20954 /* Inside the constructor parameter list, surrounding
20955 template-parameter-lists do not apply. */
20956 saved_num_template_parameter_lists
20960 /* Look for the type-specifier. */
20962 CP_PARSER_FLAGS_NONE,
20968 parser->num_template_parameter_lists
20971 /* Leave the scope of the class. */
20976 }
20977 }
20979 /* We did not really want to consume any tokens. */
20983 }
20985 /* Parse the definition of the function given by the DECL_SPECIFIERS,
20986 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
20987 they must be performed once we are in the scope of the function.
20989 Returns the function defined. */
20991 static tree
20992 cp_parser_function_definition_from_specifiers_and_declarator
20995 tree attributes,
20997 {
20998 tree fn;
21001 /* Begin the function-definition. */
21004 /* The things we're about to see are not directly qualified by any
21005 template headers we've seen thus far. */
21008 /* If there were names looked up in the decl-specifier-seq that we
21009 did not check, check them now. We must wait until we are in the
21010 scope of the function to perform the checks, since the function
21011 might be a friend. */
21015 {
21016 /* Skip the entire function. */
21019 }
21021 {
21022 /* Seen already, skip it. An error message has already been output. */
21026 /* If this is a function from a class, pop the nested class. */
21029 }
21030 else
21031 {
21032 timevar_id_t tv;
21035 else
21041 }
21044 }
21046 /* Parse the part of a function-definition that follows the
21047 declarator. INLINE_P is TRUE iff this function is an inline
21048 function defined within a class-specifier.
21050 Returns the function defined. */
21052 static tree
21055 {
21056 tree fn;
21065 /* If the next token is `return', then the code may be trying to
21066 make use of the "named return value" extension that G++ used to
21067 support. */
21070 {
21071 /* Consume the `return' keyword. */
21073 /* Look for the identifier that indicates what value is to be
21074 returned. */
21076 /* Issue an error message. */
21079 /* Skip tokens until we reach the start of the function body. */
21081 {
21088 }
21089 }
21090 /* The `extern' in `extern "C" void f () { ... }' does not apply to
21091 anything declared inside `f'. */
21092 saved_in_unbraced_linkage_specification_p
21095 /* Inside the function, surrounding template-parameter-lists do not
21096 apply. */
21097 saved_num_template_parameter_lists
21103 /* If the next token is `try', `__transaction_atomic', or
21104 `__transaction_relaxed`, then we are looking at either function-try-block
21105 or function-transaction-block. Note that all of these include the
21106 function-body. */
21109 RID_TRANSACTION_ATOMIC);
21111 RID_TRANSACTION_RELAXED))
21113 RID_TRANSACTION_RELAXED);
21116 else
21117 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21122 /* Finish the function. */
21125 /* Generate code for it, if necessary. */
21127 /* Restore the saved values. */
21128 parser->in_unbraced_linkage_specification_p
21130 parser->num_template_parameter_lists
21135 }
21137 /* Parse a template-declaration, assuming that the `export' (and
21138 `extern') keywords, if present, has already been scanned. MEMBER_P
21139 is as for cp_parser_template_declaration. */
21141 static void
21143 {
21146 tree parameter_list;
21151 /* Look for the `template' keyword. */
21156 /* And the `<'. */
21160 {
21161 /* 14.5.2.2 [temp.mem]
21163 A local class shall not have member templates. */
21168 }
21169 /* [temp]
21171 A template ... shall not have C linkage. */
21173 {
21175 /* Give it C++ linkage to avoid confusing other parts of the
21176 front end. */
21179 }
21180 else
21183 /* We cannot perform access checks on the template parameter
21184 declarations until we know what is being declared, just as we
21185 cannot check the decl-specifier list. */
21188 /* If the next token is `>', then we have an invalid
21189 specialization. Rather than complain about an invalid template
21190 parameter, issue an error message here. */
21192 {
21196 }
21197 else
21198 {
21199 /* Parse the template parameters. */
21201 }
21203 /* Get the deferred access checks from the parameter list. These
21204 will be checked once we know what is being declared, as for a
21205 member template the checks must be performed in the scope of the
21206 class containing the member. */
21209 /* Look for the `>'. */
21211 /* We just processed one more parameter list. */
21213 /* If the next token is `template', there are more template
21214 parameters. */
21216 RID_TEMPLATE))
21221 else
21222 {
21223 /* There are no access checks when parsing a template, as we do not
21224 know if a specialization will be a friend. */
21228 checks,
21229 member_p,
21234 /* If this is a member template declaration, let the front
21235 end know. */
21237 {
21242 }
21248 }
21249 /* We are done with the current parameter list. */
21254 /* Finish up. */
21257 /* Check the template arguments for a literal operator template. */
21261 {
21265 else
21266 {
21270 else
21271 {
21277 }
21278 }
21282 decl);
21283 }
21284 /* Register member declarations. */
21287 /* For the erroneous case of a template with C linkage, we pushed an
21288 implicit C++ linkage scope; exit that scope now. */
21291 /* If DECL is a function template, we must return to parse it later.
21292 (Even though there is no definition, there might be default
21293 arguments that need handling.) */
21298 }
21300 /* Perform the deferred access checks from a template-parameter-list.
21301 CHECKS is a TREE_LIST of access checks, as returned by
21302 get_deferred_access_checks. */
21304 static void
21306 {
21310 }
21312 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
21313 `function-definition' sequence that follows a template header.
21314 If MEMBER_P is true, this declaration appears in a class scope.
21316 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
21317 *FRIEND_P is set to TRUE iff the declaration is a friend. */
21319 static tree
21325 {
21328 cp_decl_specifier_seq decl_specifiers;
21332 /* This function is only used when processing a template
21333 declaration. */
21337 /* Defer access checks until we know what is being declared. */
21340 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
21341 alternative. */
21344 CP_PARSER_FLAGS_OPTIONAL,
21350 /* There are no template typedefs. */
21352 {
21356 }
21358 /* Gather up the access checks that occurred the
21359 decl-specifier-seq. */
21362 /* Check for the declaration of a template class. */
21364 {
21366 {
21369 /* In this case:
21371 struct C {
21372 friend template <typename T> struct A<T>::B;
21373 };
21375 A<T>::B will be represented by a TYPENAME_TYPE, and
21376 therefore not recognized by shadow_tag. */
21378 && !decl
21385 else
21388 /* Perform access checks for template parameters. */
21390 }
21391 }
21393 /* Complain about missing 'typename' or other invalid type names. */
21396 {
21397 /* cp_parser_parse_and_diagnose_invalid_type_name calls
21398 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
21399 the rest of this declaration. */
21402 }
21404 /* If it's not a template class, try for a template function. If
21405 the next token is a `;', then this declaration does not declare
21406 anything. But, if there were errors in the decl-specifiers, then
21407 the error might well have come from an attempted class-specifier.
21408 In that case, there's no need to warn about a missing declarator. */
21412 {
21415 checks,
21417 member_p,
21418 declares_class_or_enum,
21420 NULL);
21422 /* 7.1.1-1 [dcl.stc]
21424 A storage-class-specifier shall not be specified in an explicit
21425 specialization... */
21427 && explicit_specialization_p
21429 {
21433 }
21437 }
21439 /* Look for a trailing `;' after the declaration. */
21445 out:
21448 /* Clear any current qualification; whatever comes next is the start
21449 of something new. */
21455 }
21457 /* Parse a cast-expression that is not the operand of a unary "&". */
21459 static tree
21461 {
21464 }
21466 /* Parse a functional cast to TYPE. Returns an expression
21467 representing the cast. */
21469 static tree
21471 {
21473 tree expression_list;
21474 tree cast;
21478 {
21485 tf_warning_or_error);
21486 }
21495 else
21496 {
21499 }
21502 tf_warning_or_error);
21503 /* [expr.const]/1: In an integral constant expression "only type
21504 conversions to integral or enumeration type can be used". */
21510 NIC_CONSTRUCTOR))
21513 }
21515 /* Save the tokens that make up the body of a member function defined
21516 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
21517 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
21518 specifiers applied to the declaration. Returns the FUNCTION_DECL
21519 for the member function. */
21521 static tree
21525 tree attributes)
21526 {
21529 tree fn;
21531 /* Create the FUNCTION_DECL. */
21533 /* If something went badly wrong, bail out now. */
21535 {
21536 /* If there's a function-body, skip it. */
21541 }
21543 /* Remember it, if there default args to post process. */
21546 /* Save away the tokens that make up the body of the
21547 function. */
21549 /* We can have braced-init-list mem-initializers before the fn body. */
21551 {
21555 {
21556 /* cache_group will stop after an un-nested { } pair, too. */
21560 /* variadic mem-inits have ... after the ')'. */
21563 }
21564 }
21566 /* Handle function try blocks. */
21571 /* Save away the inline definition; we will process it when the
21572 class is complete. */
21576 /* We need to know that this was defined in the class, so that
21577 friend templates are handled correctly. */
21580 /* Add FN to the queue of functions to be parsed later. */
21584 }
21586 /* Save the tokens that make up the in-class initializer for a non-static
21587 data member. Returns a DEFAULT_ARG. */
21589 static tree
21591 {
21593 }
21595 /* Parse a template-argument-list, as well as the trailing ">" (but
21596 not the opening "<"). See cp_parser_template_argument_list for the
21597 return value. */
21599 static tree
21601 {
21602 tree arguments;
21603 tree saved_scope;
21604 tree saved_qualifying_scope;
21605 tree saved_object_scope;
21610 /* [temp.names]
21612 When parsing a template-id, the first non-nested `>' is taken as
21613 the end of the template-argument-list rather than a greater-than
21614 operator. */
21615 saved_greater_than_is_operator_p
21618 /* Parsing the argument list may modify SCOPE, so we save it
21619 here. */
21623 /* We need to evaluate the template arguments, even though this
21624 template-id may be nested within a "sizeof". */
21629 /* Parse the template-argument-list itself. */
21633 else
21635 /* Look for the `>' that ends the template-argument-list. If we find
21636 a '>>' instead, it's probably just a typo. */
21638 {
21640 {
21641 /* In C++0x, a `>>' in a template argument list or cast
21642 expression is considered to be two separate `>'
21643 tokens. So, change the current token to a `>', but don't
21644 consume it: it will be consumed later when the outer
21645 template argument list (or cast expression) is parsed.
21646 Note that this replacement of `>' for `>>' is necessary
21647 even if we are parsing tentatively: in the tentative
21648 case, after calling
21649 cp_parser_enclosed_template_argument_list we will always
21650 throw away all of the template arguments and the first
21651 closing `>', either because the template argument list
21652 was erroneous or because we are replacing those tokens
21653 with a CPP_TEMPLATE_ID token. The second `>' (which will
21654 not have been thrown away) is needed either to close an
21655 outer template argument list or to complete a new-style
21656 cast. */
21659 }
21661 {
21662 /* If we're in a nested template argument list, the '>>' has
21663 to be a typo for '> >'. We emit the error message, but we
21664 continue parsing and we push a '>' as next token, so that
21665 the argument list will be parsed correctly. Note that the
21666 global source location is still on the token before the
21667 '>>', so we need to say explicitly where we want it. */
21673 }
21674 else
21675 {
21676 /* If this is not a nested template argument list, the '>>'
21677 is a typo for '>'. Emit an error message and continue.
21678 Same deal about the token location, but here we can get it
21679 right by consuming the '>>' before issuing the diagnostic. */
21682 "spurious %<>>%>, use %<>%> to terminate "
21684 }
21685 }
21686 else
21688 /* The `>' token might be a greater-than operator again now. */
21689 parser->greater_than_is_operator_p
21691 /* Restore the SAVED_SCOPE. */
21699 }
21701 /* MEMBER_FUNCTION is a member function, or a friend. If default
21702 arguments, or the body of the function have not yet been parsed,
21703 parse them now. */
21705 static void
21707 {
21709 /* If this member is a template, get the underlying
21710 FUNCTION_DECL. */
21714 /* There should not be any class definitions in progress at this
21715 point; the bodies of members are only parsed outside of all class
21716 definitions. */
21718 /* While we're parsing the member functions we might encounter more
21719 classes. We want to handle them right away, but we don't want
21720 them getting mixed up with functions that are currently in the
21721 queue. */
21724 /* Make sure that any template parameters are in scope. */
21727 /* If the body of the function has not yet been parsed, parse it
21728 now. */
21730 {
21731 tree function_scope;
21734 /* The function is no longer pending; we are processing it. */
21739 /* If this is a local class, enter the scope of the containing
21740 function. */
21745 /* Push the body of the function onto the lexer stack. */
21748 /* Let the front end know that we going to be defining this
21749 function. */
21753 /* Don't do access checking if it is a templated function. */
21757 /* Now, parse the body of the function. */
21764 /* Leave the scope of the containing function. */
21768 }
21770 /* Remove any template parameters from the symbol table. */
21773 /* Restore the queue. */
21776 }
21778 /* If DECL contains any default args, remember it on the unparsed
21779 functions queue. */
21781 static void
21783 {
21784 tree probe;
21787 probe;
21790 {
21791 cp_default_arg_entry *entry
21797 }
21798 }
21800 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
21801 which is either a FIELD_DECL or PARM_DECL. Parse it and return
21802 the result. For a PARM_DECL, PARMTYPE is the corresponding type
21803 from the parameter-type-list. */
21805 static tree
21808 {
21810 tree parsed_arg;
21816 /* Push the saved tokens for the default argument onto the parser's
21817 lexer stack. */
21823 /* Parse the default argument. */
21834 {
21835 /* In a non-template class, check conversions now. In a template,
21836 we'll wait and instantiate these as needed. */
21839 else
21840 {
21846 }
21847 }
21849 /* If the token stream has not been completely used up, then
21850 there was extra junk after the end of the default
21851 argument. */
21853 {
21856 else
21858 }
21860 /* Revert to the main lexer. */
21864 }
21866 /* FIELD is a non-static data member with an initializer which we saved for
21867 later; parse it now. */
21869 static void
21871 {
21872 tree def;
21877 NULL_TREE);
21881 }
21883 /* FN is a FUNCTION_DECL which may contains a parameter with an
21884 unparsed DEFAULT_ARG. Parse the default args now. This function
21885 assumes that the current scope is the scope in which the default
21886 argument should be processed. */
21888 static void
21890 {
21894 /* While we're parsing the default args, we might (due to the
21895 statement expression extension) encounter more classes. We want
21896 to handle them right away, but we don't want them getting mixed
21897 up with default args that are currently in the queue. */
21900 /* Local variable names (and the `this' keyword) may not appear
21901 in a default argument. */
21912 {
21914 tree parsed_arg;
21916 tree copy;
21923 /* This can happen for a friend declaration for a function
21924 already declared with default arguments. */
21927 parsed_arg
21929 default_arg,
21932 {
21934 }
21938 /* Update any instantiations we've already created. */
21942 }
21946 /* Make sure no default arg is missing. */
21949 /* Restore the state of local_variables_forbidden_p. */
21952 /* Restore the queue. */
21954 }
21956 /* Parse the operand of `sizeof' (or a similar operator). Returns
21957 either a TYPE or an expression, depending on the form of the
21958 input. The KEYWORD indicates which kind of expression we have
21959 encountered. */
21961 static tree
21963 {
21971 /* Types cannot be defined in a `sizeof' expression. Save away the
21972 old message. */
21974 /* And create the new one. */
21980 /* The restrictions on constant-expressions do not apply inside
21981 sizeof expressions. */
21982 saved_integral_constant_expression_p
21984 saved_non_integral_constant_expression_p
21988 /* If it's a `...', then we are computing the length of a parameter
21989 pack. */
21992 {
21993 /* Consume the `...'. */
21997 /* Note that this is an expansion. */
21999 }
22001 /* Do not actually evaluate the expression. */
22004 /* If it's a `(', then we might be looking at the type-id
22005 construction. */
22007 {
22008 tree type;
22011 /* We can't be sure yet whether we're looking at a type-id or an
22012 expression. */
22014 /* Consume the `('. */
22016 /* Parse the type-id. */
22021 /* Now, look for the trailing `)'. */
22023 /* If all went well, then we're done. */
22025 {
22026 cp_decl_specifier_seq decl_specs;
22028 /* Build a trivial decl-specifier-seq. */
22032 /* Call grokdeclarator to figure out what type this is. */
22035 TYPENAME,
22038 }
22039 }
22044 /* If the type-id production did not work out, then we must be
22045 looking at the unary-expression production. */
22051 /* Build a pack expansion. */
22054 /* Go back to evaluating expressions. */
22058 /* Free the message we created. */
22060 /* And restore the old one. */
22062 parser->integral_constant_expression_p
22064 parser->non_integral_constant_expression_p
22068 }
22070 /* If the current declaration has no declarator, return true. */
22072 static bool
22074 {
22075 /* If the next token is a `;' or a `,' then there is no
22076 declarator. */
22079 }
22081 /* Update the DECL_SPECS to reflect the storage class indicated by
22082 KEYWORD. */
22084 static void
22088 location_t location)
22089 {
22090 cp_storage_class storage_class;
22093 {
22097 }
22099 {
22102 }
22106 {
22110 }
22113 {
22131 }
22135 /* A storage class specifier cannot be applied alongside a typedef
22136 specifier. If there is a typedef specifier present then set
22137 conflicting_specifiers_p which will trigger an error later
22138 on in grokdeclarator. */
22141 }
22143 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
22144 is true, the type is a class or enum definition. */
22146 static void
22148 tree type_spec,
22149 location_t location,
22151 {
22154 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
22155 (with, for example, in "typedef int wchar_t;") we remember that
22156 this is what happened. In system headers, we ignore these
22157 declarations so that G++ can work with system headers that are not
22158 C++-safe. */
22160 && !type_definition_p
22170 {
22173 ds_redefined_builtin_type_spec,
22174 location);
22176 {
22180 }
22181 }
22184 else
22185 {
22190 }
22191 }
22193 /* Set the location for a declarator specifier and check if it is
22194 duplicated.
22196 DECL_SPECS is the sequence of declarator specifiers onto which to
22197 set the location.
22199 DS is the single declarator specifier to set which location is to
22200 be set onto the existing sequence of declarators.
22202 LOCATION is the location for the declarator specifier to
22203 consider. */
22205 static void
22208 {
22216 else
22217 {
22219 {
22223 else
22224 {
22227 OPT_Wlong_long,
22229 }
22230 }
22231 else
22232 {
22249 "__thread"
22250 };
22253 }
22254 }
22255 }
22257 /* Return true iff the declarator specifier DS is present in the
22258 sequence of declarator specifiers DECL_SPECS. */
22260 bool
22262 cp_decl_spec ds)
22263 {
22270 }
22272 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
22273 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
22275 static bool
22277 {
22279 }
22281 /* Issue an error message indicating that TOKEN_DESC was expected.
22282 If KEYWORD is true, it indicated this function is called by
22283 cp_parser_require_keword and the required token can only be
22284 a indicated keyword. */
22286 static void
22288 required_token token_desc,
22290 {
22292 {
22361 }
22363 {
22365 {
22444 }
22445 }
22446 else
22448 }
22452 /* If the next token is of the indicated TYPE, consume it. Otherwise,
22453 issue an error message indicating that TOKEN_DESC was expected.
22455 Returns the token consumed, if the token had the appropriate type.
22456 Otherwise, returns NULL. */
22461 required_token token_desc)
22462 {
22465 else
22466 {
22467 /* Output the MESSAGE -- unless we're parsing tentatively. */
22471 }
22472 }
22474 /* An error message is produced if the next token is not '>'.
22475 All further tokens are skipped until the desired token is
22476 found or '{', '}', ';' or an unbalanced ')' or ']'. */
22478 static void
22480 {
22481 /* Current level of '< ... >'. */
22483 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
22486 /* Are we ready, yet? If not, issue error message. */
22490 /* Skip tokens until the desired token is found. */
22492 {
22493 /* Peek at the next token. */
22495 {
22503 /* C++0x views the `>>' operator as two `>' tokens, but
22504 C++98 does not. */
22507 {
22508 /* We've hit a `>>' where the first `>' closes the
22509 template argument list, and the second `>' is
22510 spurious. Just consume the `>>' and stop; we've
22511 already produced at least one error. */
22514 }
22515 /* Fall through for C++0x, so we handle the second `>' in
22516 the `>>'. */
22520 {
22521 /* We've reached the token we want, consume it and stop. */
22524 }
22543 /* The '>' was probably forgotten, don't look further. */
22548 }
22550 /* Consume this token. */
22552 }
22553 }
22555 /* If the next token is the indicated keyword, consume it. Otherwise,
22556 issue an error message indicating that TOKEN_DESC was expected.
22558 Returns the token consumed, if the token had the appropriate type.
22559 Otherwise, returns NULL. */
22564 required_token token_desc)
22565 {
22569 {
22572 }
22575 }
22577 /* Returns TRUE iff TOKEN is a token that can begin the body of a
22578 function-definition. */
22580 static bool
22582 {
22585 /* A ctor-initializer begins with a `:'. */
22587 /* A function-try-block begins with `try'. */
22589 /* A function-transaction-block begins with `__transaction_atomic'
22590 or `__transaction_relaxed'. */
22593 /* The named return value extension begins with `return'. */
22595 }
22597 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
22598 definition. */
22600 static bool
22602 {
22607 }
22609 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
22610 C++0x) ending a template-argument. */
22612 static bool
22614 {
22622 }
22624 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
22625 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
22627 static bool
22630 {
22636 /* Check for the sequence `<::' in the original code. It would be lexed as
22637 `[:', where `[' is a digraph, and there is no whitespace before
22638 `:'. */
22640 {
22645 }
22647 }
22649 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
22650 or none_type otherwise. */
22652 static enum tag_types
22654 {
22656 {
22666 }
22667 }
22669 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
22671 static void
22673 {
22677 {
22681 type);
22684 }
22685 }
22687 /* Issue an error message if DECL is redeclared with different
22688 access than its original declaration [class.access.spec/3].
22689 This applies to nested classes and nested class templates.
22690 [class.mem/1]. */
22692 static void
22694 {
22703 }
22705 /* Look for the `template' keyword, as a syntactic disambiguator.
22706 Return TRUE iff it is present, in which case it will be
22707 consumed. */
22709 static bool
22711 {
22713 {
22714 /* The `template' keyword can only be used within templates;
22715 outside templates the parser can always figure out what is a
22716 template and what is not. */
22718 {
22721 "%<template%> (as a disambiguator) is only allowed "
22723 /* If this part of the token stream is rescanned, the same
22724 error message would be generated. So, we purge the token
22725 from the stream. */
22728 }
22729 else
22730 {
22731 /* Consume the `template' keyword. */
22734 }
22735 }
22738 }
22740 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
22741 set PARSER->SCOPE, and perform other related actions. */
22743 static void
22745 {
22751 /* Get the stored value. */
22753 /* Perform any access checks that were deferred. */
22756 {
22761 }
22762 /* Set the scope from the stored value. */
22766 }
22768 /* Consume tokens up through a non-nested END token. Returns TRUE if we
22769 encounter the end of a block before what we were looking for. */
22771 static bool
22775 {
22777 {
22780 /* Abort a parenthesized expression if we encounter a semicolon. */
22784 /* If we've reached the end of the file, stop. */
22790 /* We've hit the end of an enclosing block, so there's been some
22791 kind of syntax error. */
22794 /* Consume the token. */
22796 /* See if it starts a new group. */
22798 {
22800 /* In theory this should probably check end == '}', but
22801 cp_parser_save_member_function_body needs it to exit
22802 after either '}' or ')' when called with ')'. */
22805 }
22807 {
22811 }
22816 }
22817 }
22819 /* Like above, for caching a default argument or NSDMI. Both of these are
22820 terminated by a non-nested comma, but it can be unclear whether or not a
22821 comma is nested in a template argument list unless we do more parsing.
22822 In order to handle this ambiguity, when we encounter a ',' after a '<'
22823 we try to parse what follows as a parameter-declaration-list (in the
22824 case of a default argument) or a member-declarator (in the case of an
22825 NSDMI). If that succeeds, then we stop caching. */
22827 static tree
22829 {
22834 tree default_argument;
22836 /* Add tokens until we have processed the entire default
22837 argument. We add the range [first_token, token). */
22840 {
22841 /* For list-initialization, this is straightforward. */
22844 }
22846 {
22849 /* Peek at the next token. */
22851 /* What we do depends on what token we have. */
22853 {
22854 /* In valid code, a default argument must be
22855 immediately followed by a `,' `)', or `...'. */
22858 {
22859 /* If we've seen a '<', we might be in a
22860 template-argument-list. Until Core issue 325 is
22861 resolved, we don't know how this situation ought
22862 to be handled, so try to DTRT. We check whether
22863 what comes after the comma is a valid parameter
22864 declaration list. If it is, then the comma ends
22865 the default argument; otherwise the default
22866 argument continues. */
22868 tree t;
22870 /* Set ITALP so cp_parser_parameter_declaration_list
22871 doesn't decide to commit to this parse. */
22879 {
22885 }
22886 else
22887 {
22893 }
22900 }
22903 /* If we run into a non-nested `;', `}', or `]',
22904 then the code is invalid -- but the default
22905 argument is certainly over. */
22911 /* Update DEPTH, if necessary. */
22926 /* This might be the comparison operator, or it might
22927 start a template argument list. */
22934 /* Fall through for C++0x, which treats the `>>'
22935 operator like two `>' tokens in certain
22936 cases. */
22940 {
22941 /* This might be an operator, or it might close a
22942 template argument list. But if a previous '<'
22943 started a template argument list, this will have
22944 closed it, so we can't be in one anymore. */
22948 }
22951 /* If we run out of tokens, issue an error message. */
22960 /* In these cases, we should look for template-ids.
22961 For example, if the default argument is
22962 `X<int, double>()', we need to do name lookup to
22963 figure out whether or not `X' is a template; if
22964 so, the `,' does not end the default argument.
22966 That is not yet done. */
22971 }
22973 /* If we've reached the end, stop. */
22977 /* Add the token to the token block. */
22979 }
22981 /* Create a DEFAULT_ARG to represent the unparsed default
22982 argument. */
22989 }
22991 /* Begin parsing tentatively. We always save tokens while parsing
22992 tentatively so that if the tentative parsing fails we can restore the
22993 tokens. */
22995 static void
22997 {
22998 /* Enter a new parsing context. */
23000 /* Begin saving tokens. */
23002 /* In order to avoid repetitive access control error messages,
23003 access checks are queued up until we are no longer parsing
23004 tentatively. */
23006 }
23008 /* Commit to the currently active tentative parse. */
23010 static void
23012 {
23016 /* Mark all of the levels as committed. */
23019 {
23026 }
23027 }
23029 /* Abort the currently active tentative parse. All consumed tokens
23030 will be rolled back, and no diagnostics will be issued. */
23032 static void
23034 {
23038 /* Now, pretend that we want to see if the construct was
23039 successfully parsed. */
23041 }
23043 /* Stop parsing tentatively. If a parse error has occurred, restore the
23044 token stream. Otherwise, commit to the tokens we have consumed.
23045 Returns true if no error occurred; false otherwise. */
23047 static bool
23049 {
23053 /* Remember whether or not an error occurred, since we are about to
23054 destroy that information. */
23056 /* Remove the topmost context from the stack. */
23059 /* If no parse errors occurred, commit to the tentative parse. */
23061 {
23062 /* Commit to the tokens read tentatively, unless that was
23063 already done. */
23068 }
23069 /* Otherwise, if errors occurred, roll back our state so that things
23070 are just as they were before we began the tentative parse. */
23071 else
23072 {
23075 }
23076 /* Add the context to the front of the free list. */
23081 }
23083 /* Returns true if we are parsing tentatively and are not committed to
23084 this tentative parse. */
23086 static bool
23088 {
23091 }
23093 /* Returns nonzero iff an error has occurred during the most recent
23094 tentative parse. */
23096 static bool
23098 {
23101 }
23103 /* Returns nonzero if GNU extensions are allowed. */
23105 static bool
23107 {
23109 }
23110 \f
23111 /* Objective-C++ Productions */
23114 /* Parse an Objective-C expression, which feeds into a primary-expression
23115 above.
23117 objc-expression:
23118 objc-message-expression
23119 objc-string-literal
23120 objc-encode-expression
23121 objc-protocol-expression
23122 objc-selector-expression
23124 Returns a tree representation of the expression. */
23126 static tree
23128 {
23129 /* Try to figure out what kind of declaration is present. */
23133 {
23143 {
23155 }
23161 }
23164 }
23166 /* Parse an Objective-C message expression.
23168 objc-message-expression:
23169 [ objc-message-receiver objc-message-args ]
23171 Returns a representation of an Objective-C message. */
23173 static tree
23175 {
23184 }
23186 /* Parse an objc-message-receiver.
23188 objc-message-receiver:
23189 expression
23190 simple-type-specifier
23192 Returns a representation of the type or expression. */
23194 static tree
23196 {
23197 tree rcv;
23199 /* An Objective-C message receiver may be either (1) a type
23200 or (2) an expression. */
23209 CP_PARSER_FLAGS_NONE);
23212 }
23214 /* Parse the arguments and selectors comprising an Objective-C message.
23216 objc-message-args:
23217 objc-selector
23218 objc-selector-args
23219 objc-selector-args , objc-comma-args
23221 objc-selector-args:
23222 objc-selector [opt] : assignment-expression
23223 objc-selector-args objc-selector [opt] : assignment-expression
23225 objc-comma-args:
23226 assignment-expression
23227 objc-comma-args , assignment-expression
23229 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
23230 selector arguments and TREE_VALUE containing a list of comma
23231 arguments. */
23233 static tree
23235 {
23241 {
23247 /* Detect if we have a unary selector. */
23256 sel_args
23261 }
23263 /* Handle non-selector arguments, if any. */
23265 {
23266 tree arg;
23271 addl_args
23276 }
23279 {
23282 }
23285 }
23287 /* Parse an Objective-C encode expression.
23289 objc-encode-expression:
23290 @encode objc-typename
23292 Returns an encoded representation of the type argument. */
23294 static tree
23296 {
23297 tree type;
23307 {
23311 }
23313 /* This happens if we find @encode(T) (where T is a template
23314 typename or something dependent on a template typename) when
23315 parsing a template. In that case, we can't compile it
23316 immediately, but we rather create an AT_ENCODE_EXPR which will
23317 need to be instantiated when the template is used.
23318 */
23320 {
23324 }
23327 }
23329 /* Parse an Objective-C @defs expression. */
23331 static tree
23333 {
23334 tree name;
23342 }
23344 /* Parse an Objective-C protocol expression.
23346 objc-protocol-expression:
23347 @protocol ( identifier )
23349 Returns a representation of the protocol expression. */
23351 static tree
23353 {
23354 tree proto;
23362 }
23364 /* Parse an Objective-C selector expression.
23366 objc-selector-expression:
23367 @selector ( objc-method-signature )
23369 objc-method-signature:
23370 objc-selector
23371 objc-selector-seq
23373 objc-selector-seq:
23374 objc-selector :
23375 objc-selector-seq objc-selector :
23377 Returns a representation of the method selector. */
23379 static tree
23381 {
23393 {
23402 {
23403 /* Detect if we have a unary selector. */
23405 {
23408 }
23409 else
23410 {
23412 }
23413 }
23418 {
23419 sel_seq
23422 sel_seq
23425 }
23426 else
23427 sel_seq
23432 }
23434 finish_selector:
23438 }
23440 /* Parse a list of identifiers.
23442 objc-identifier-list:
23443 identifier
23444 objc-identifier-list , identifier
23446 Returns a TREE_LIST of identifier nodes. */
23448 static tree
23450 {
23451 tree identifier;
23452 tree list;
23463 {
23470 identifier));
23472 }
23475 }
23477 /* Parse an Objective-C alias declaration.
23479 objc-alias-declaration:
23480 @compatibility_alias identifier identifier ;
23482 This function registers the alias mapping with the Objective-C front end.
23483 It returns nothing. */
23485 static void
23487 {
23495 }
23497 /* Parse an Objective-C class forward-declaration.
23499 objc-class-declaration:
23500 @class objc-identifier-list ;
23502 The function registers the forward declarations with the Objective-C
23503 front end. It returns nothing. */
23505 static void
23507 {
23510 {
23511 tree id;
23521 else
23523 }
23525 }
23527 /* Parse a list of Objective-C protocol references.
23529 objc-protocol-refs-opt:
23530 objc-protocol-refs [opt]
23532 objc-protocol-refs:
23533 < objc-identifier-list >
23535 Returns a TREE_LIST of identifiers, if any. */
23537 static tree
23539 {
23543 {
23547 }
23550 }
23552 /* Parse a Objective-C visibility specification. */
23554 static void
23556 {
23560 {
23575 }
23577 /* Eat '@private'/'@protected'/'@public'. */
23579 }
23581 /* Parse an Objective-C method type. Return 'true' if it is a class
23582 (+) method, and 'false' if it is an instance (-) method. */
23586 {
23589 else
23591 }
23593 /* Parse an Objective-C protocol qualifier. */
23595 static tree
23597 {
23610 {
23615 }
23618 }
23620 /* Parse an Objective-C typename. */
23622 static tree
23624 {
23628 {
23634 /* An ObjC type name may consist of just protocol qualifiers, in which
23635 case the type shall default to 'id'. */
23637 {
23640 /* If the type could not be parsed, an error has already
23641 been produced. For error recovery, behave as if it had
23642 not been specified, which will use the default type
23643 'id'. */
23645 {
23647 /* We need to skip to the closing parenthesis as
23648 cp_parser_type_id() does not seem to do it for
23649 us. */
23654 }
23655 }
23659 }
23662 }
23664 /* Check to see if TYPE refers to an Objective-C selector name. */
23666 static bool
23668 {
23674 }
23676 /* Parse an Objective-C selector. */
23678 static tree
23680 {
23684 {
23687 }
23689 /* C++ operator names are allowed to appear in ObjC selectors. */
23691 {
23704 }
23705 }
23707 /* Parse an Objective-C params list. */
23709 static tree
23711 {
23717 {
23727 /* Detect if we have a unary selector. */
23730 {
23733 }
23737 {
23738 /* Something went quite wrong. There should be a colon
23739 here, but there is not. Stop parsing parameters. */
23741 }
23743 /* New ObjC allows attributes on parameters too. */
23748 params
23751 type_name,
23752 identifier,
23753 parm_attr));
23756 }
23759 {
23762 }
23764 /* We allow tail attributes for the method. */
23766 {
23774 }
23777 {
23780 }
23782 }
23784 /* Parse the non-keyword Objective-C params. */
23786 static tree
23789 {
23795 {
23797 tree parm;
23803 {
23808 }
23810 /* TODO: parse attributes for tail parameters. */
23819 }
23821 /* We allow tail attributes for the method. */
23823 {
23825 {
23830 }
23831 else
23832 /* We have an error, but parse the attributes, so that we can
23833 carry on. */
23839 }
23842 }
23844 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
23846 static void
23848 {
23851 /* If the next token is `extern' and the following token is a string
23852 literal, then we have a linkage specification. */
23854 && cp_parser_is_pure_string_literal
23857 /* Handle #pragma, if any. */
23860 /* Allow stray semicolons. */
23863 /* Mark methods as optional or required, when building protocols. */
23865 {
23868 }
23870 {
23873 }
23876 /* Other stray characters must generate errors. */
23878 {
23882 }
23883 /* Finally, try to parse a block-declaration, or a function-definition. */
23884 else
23886 }
23888 /* Parse a method signature. */
23890 static tree
23892 {
23908 }
23910 static bool
23912 {
23913 tree tattr;
23918 /* If the attributes are followed by a method introducer, this is not allowed.
23919 Dump the attributes and flag the situation. */
23924 /* Otherwise, the attributes introduce some interstitial code, possibly so
23925 rewind to allow that check. */
23928 }
23930 /* Parse an Objective-C method prototype list. */
23932 static void
23934 {
23938 {
23940 {
23945 else
23949 {
23953 }
23956 }
23962 OPT_Wattributes,
23964 else
23965 /* Allow for interspersed non-ObjC++ code. */
23969 }
23973 else
23977 }
23979 /* Parse an Objective-C method definition list. */
23981 static void
23983 {
23987 {
23988 tree meth;
23991 {
23997 else
24002 {
24006 }
24008 NULL_TREE);
24010 /* For historical reasons, we accept an optional semicolon. */
24017 {
24024 }
24025 }
24026 /* The following case will be removed once @synthesize is
24027 completely implemented. */
24038 else
24039 /* Allow for interspersed non-ObjC++ code. */
24043 }
24047 else
24051 }
24053 /* Parse Objective-C ivars. */
24055 static void
24057 {
24068 {
24069 cp_decl_specifier_seq declspecs;
24071 tree prefix_attributes;
24079 CP_PARSER_FLAGS_OPTIONAL,
24083 /* auto, register, static, extern, mutable. */
24085 {
24088 }
24090 /* __thread. */
24092 {
24095 }
24097 /* typedef. */
24099 {
24102 }
24107 /* Keep going until we hit the `;' at the end of the
24108 declaration. */
24110 {
24115 /* Check for a (possibly unnamed) bitfield declaration. */
24123 {
24124 /* Get the name of the bitfield. */
24127 sfk_none);
24129 eat_colon:
24131 /* Get the width of the bitfield. */
24132 width
24135 NULL);
24136 }
24137 else
24138 {
24139 /* Parse the declarator. */
24140 declarator
24145 }
24147 /* Look for attributes that apply to the ivar. */
24149 /* Remember which attributes are prefix attributes and
24150 which are not. */
24152 /* Combine the attributes. */
24156 /* Create the bitfield declaration. */
24158 width,
24159 attributes);
24160 else
24165 /* Add the instance variable. */
24169 /* Reset PREFIX_ATTRIBUTES. */
24178 {
24181 }
24183 }
24187 }
24192 /* Do not consume the RID_AT_END, so it will be read again as terminating
24193 the @interface of @implementation. */
24197 /* For historical reasons, we accept an optional semicolon. */
24200 }
24202 /* Parse an Objective-C protocol declaration. */
24204 static void
24206 {
24212 {
24217 }
24219 /* See if we have a forward declaration or a definition. */
24222 /* Try a forward declaration first. */
24224 {
24226 {
24227 tree id;
24237 else
24239 }
24241 }
24243 /* Ok, we got a full-fledged definition (or at least should). */
24244 else
24245 {
24250 }
24251 }
24253 /* Parse an Objective-C superclass or category. */
24255 static void
24260 {
24266 {
24269 }
24271 {
24274 /* If there is no category name, and this is an @interface, we
24275 have a class extension. */
24277 {
24280 }
24281 else
24285 }
24286 }
24288 /* Parse an Objective-C class interface. */
24290 static void
24292 {
24299 {
24300 /* It's hard to recover because even if valid @interface stuff
24301 is to follow, we can't compile it (or validate it) if we
24302 don't even know which class it refers to. Let's assume this
24303 was a stray '@interface' token in the stream and skip it.
24304 */
24306 }
24311 /* We have either a class or a category on our hands. */
24314 else
24315 {
24317 /* Handle instance variable declarations, if any. */
24320 }
24323 }
24325 /* Parse an Objective-C class implementation. */
24327 static void
24329 {
24336 {
24337 /* It's hard to recover because even if valid @implementation
24338 stuff is to follow, we can't compile it (or validate it) if
24339 we don't even know which class it refers to. Let's assume
24340 this was a stray '@implementation' token in the stream and
24341 skip it.
24342 */
24344 }
24348 /* We have either a class or a category on our hands. */
24351 else
24352 {
24354 /* Handle instance variable declarations, if any. */
24357 }
24360 }
24362 /* Consume the @end token and finish off the implementation. */
24364 static void
24366 {
24369 }
24371 /* Parse an Objective-C declaration. */
24373 static void
24375 {
24376 /* Try to figure out what kind of declaration is present. */
24381 {
24397 }
24400 {
24423 }
24424 }
24426 /* Parse an Objective-C try-catch-finally statement.
24428 objc-try-catch-finally-stmt:
24429 @try compound-statement objc-catch-clause-seq [opt]
24430 objc-finally-clause [opt]
24432 objc-catch-clause-seq:
24433 objc-catch-clause objc-catch-clause-seq [opt]
24435 objc-catch-clause:
24436 @catch ( objc-exception-declaration ) compound-statement
24438 objc-finally-clause:
24439 @finally compound-statement
24441 objc-exception-declaration:
24442 parameter-declaration
24443 '...'
24445 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
24447 Returns NULL_TREE.
24449 PS: This function is identical to c_parser_objc_try_catch_finally_statement
24450 for C. Keep them in sync. */
24452 static tree
24454 {
24455 location_t location;
24456 tree stmt;
24461 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
24462 node, lest it get absorbed into the surrounding block. */
24468 {
24477 {
24478 /* We have "@catch (...)" (where the '...' are literally
24479 what is in the code). Skip the '...'.
24480 parameter_declaration is set to NULL_TREE, and
24481 objc_being_catch_clauses() knows that that means
24482 '...'. */
24485 }
24486 else
24487 {
24488 /* We have "@catch (NSException *exception)" or something
24489 like that. Parse the parameter declaration. */
24493 else
24498 }
24501 else
24502 {
24503 /* If there was no open parenthesis, we are recovering from
24504 an error, and we are trying to figure out what mistake
24505 the user has made. */
24507 /* If there is an immediate closing parenthesis, the user
24508 probably forgot the opening one (ie, they typed "@catch
24509 NSException *e)". Parse the closing parenthesis and keep
24510 going. */
24514 /* If these is no immediate closing parenthesis, the user
24515 probably doesn't know that parenthesis are required at
24516 all (ie, they typed "@catch NSException *e"). So, just
24517 forget about the closing parenthesis and keep going. */
24518 }
24522 }
24524 {
24527 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
24528 node, lest it get absorbed into the surrounding block. */
24532 }
24535 }
24537 /* Parse an Objective-C synchronized statement.
24539 objc-synchronized-stmt:
24540 @synchronized ( expression ) compound-statement
24542 Returns NULL_TREE. */
24544 static tree
24546 {
24547 location_t location;
24558 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
24559 node, lest it get absorbed into the surrounding block. */
24564 }
24566 /* Parse an Objective-C throw statement.
24568 objc-throw-stmt:
24569 @throw assignment-expression [opt] ;
24571 Returns a constructed '@throw' statement. */
24573 static tree
24575 {
24587 }
24589 /* Parse an Objective-C statement. */
24591 static tree
24593 {
24594 /* Try to figure out what kind of declaration is present. */
24598 {
24609 }
24612 }
24614 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
24615 look ahead to see if an objc keyword follows the attributes. This
24616 is to detect the use of prefix attributes on ObjC @interface and
24617 @protocol. */
24619 static bool
24621 {
24626 {
24629 }
24632 }
24634 /* This routine is a minimal replacement for
24635 c_parser_struct_declaration () used when parsing the list of
24636 types/names or ObjC++ properties. For example, when parsing the
24637 code
24639 @property (readonly) int a, b, c;
24641 this function is responsible for parsing "int a, int b, int c" and
24642 returning the declarations as CHAIN of DECLs.
24644 TODO: Share this code with cp_parser_objc_class_ivars. It's very
24645 similar parsing. */
24646 static tree
24648 {
24650 cp_decl_specifier_seq declspecs;
24652 tree prefix_attributes;
24655 CP_PARSER_FLAGS_NONE,
24662 /* auto, register, static, extern, mutable. */
24664 {
24667 }
24669 /* __thread. */
24671 {
24674 }
24676 /* typedef. */
24678 {
24681 }
24686 /* Keep going until we hit the `;' at the end of the declaration. */
24688 {
24693 /* Parse the declarator. */
24697 /* Look for attributes that apply to the ivar. */
24699 /* Remember which attributes are prefix attributes and
24700 which are not. */
24702 /* Combine the attributes. */
24712 /* Reset PREFIX_ATTRIBUTES. */
24723 {
24726 }
24727 else
24729 }
24731 }
24733 /* Parse an Objective-C @property declaration. The syntax is:
24735 objc-property-declaration:
24736 '@property' objc-property-attributes[opt] struct-declaration ;
24738 objc-property-attributes:
24739 '(' objc-property-attribute-list ')'
24741 objc-property-attribute-list:
24742 objc-property-attribute
24743 objc-property-attribute-list, objc-property-attribute
24745 objc-property-attribute
24746 'getter' = identifier
24747 'setter' = identifier
24748 'readonly'
24749 'readwrite'
24750 'assign'
24751 'retain'
24752 'copy'
24753 'nonatomic'
24755 For example:
24756 @property NSString *name;
24757 @property (readonly) id object;
24758 @property (retain, nonatomic, getter=getTheName) id name;
24759 @property int a, b, c;
24761 PS: This function is identical to
24762 c_parser_objc_at_property_declaration for C. Keep them in sync. */
24763 static void
24765 {
24766 /* The following variables hold the attributes of the properties as
24767 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
24768 seen. When we see an attribute, we set them to 'true' (if they
24769 are boolean properties) or to the identifier (if they have an
24770 argument, ie, for getter and setter). Note that here we only
24771 parse the list of attributes, check the syntax and accumulate the
24772 attributes that we find. objc_add_property_declaration() will
24773 then process the information. */
24783 /* 'properties' is the list of properties that we read. Usually a
24784 single one, but maybe more (eg, in "@property int a, b, c;" there
24785 are three). */
24786 tree properties;
24787 location_t loc;
24793 /* Parse the optional attribute list... */
24795 {
24796 /* Eat the '('. */
24800 {
24806 {
24809 }
24813 {
24824 {
24828 else
24833 }
24836 {
24840 }
24842 {
24844 {
24847 }
24848 else
24852 else
24854 }
24855 else
24856 {
24858 {
24861 }
24862 else
24864 }
24870 }
24877 else
24879 }
24881 /* FIXME: "@property (setter, assign);" will generate a spurious
24882 "error: expected ‘)’ before ‘,’ token". This is because
24883 cp_parser_require, unlike the C counterpart, will produce an
24884 error even if we are in error recovery. */
24886 {
24891 }
24892 }
24894 /* ... and the property declaration(s). */
24898 {
24900 /* If the next token is now a `;', consume it. */
24904 }
24908 else
24909 {
24910 /* Comma-separated properties are chained together in
24911 reverse order; add them one by one. */
24920 }
24923 }
24925 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
24927 objc-synthesize-declaration:
24928 @synthesize objc-synthesize-identifier-list ;
24930 objc-synthesize-identifier-list:
24931 objc-synthesize-identifier
24932 objc-synthesize-identifier-list, objc-synthesize-identifier
24934 objc-synthesize-identifier
24935 identifier
24936 identifier = identifier
24938 For example:
24939 @synthesize MyProperty;
24940 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
24942 PS: This function is identical to c_parser_objc_at_synthesize_declaration
24943 for C. Keep them in sync.
24944 */
24945 static void
24947 {
24949 location_t loc;
24954 {
24958 {
24961 }
24963 {
24967 {
24970 }
24971 }
24972 else
24977 else
24979 }
24982 }
24984 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
24986 objc-dynamic-declaration:
24987 @dynamic identifier-list ;
24989 For example:
24990 @dynamic MyProperty;
24991 @dynamic MyProperty, AnotherProperty;
24993 PS: This function is identical to c_parser_objc_at_dynamic_declaration
24994 for C. Keep them in sync.
24995 */
24996 static void
24998 {
25000 location_t loc;
25005 {
25006 tree property;
25009 {
25012 }
25016 else
25018 }
25021 }
25023 \f
25024 /* OpenMP 2.5 parsing routines. */
25026 /* Returns name of the next clause.
25027 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
25028 the token is not consumed. Otherwise appropriate pragma_omp_clause is
25029 returned and the token is consumed. */
25031 static pragma_omp_clause
25033 {
25043 {
25048 {
25095 }
25096 }
25102 }
25104 /* Validate that a clause of the given type does not already exist. */
25106 static void
25109 {
25110 tree c;
25114 {
25117 }
25118 }
25120 /* OpenMP 2.5:
25121 variable-list:
25122 identifier
25123 variable-list , identifier
25125 In addition, we match a closing parenthesis. An opening parenthesis
25126 will have been consumed by the caller.
25128 If KIND is nonzero, create the appropriate node and install the decl
25129 in OMP_CLAUSE_DECL and add the node to the head of the list.
25131 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
25132 return the list created. */
25134 static tree
25136 tree list)
25137 {
25140 {
25157 {
25162 }
25163 else
25166 get_comma:
25170 }
25173 {
25176 /* Try to resync to an unnested comma. Copied from
25177 cp_parser_parenthesized_expression_list. */
25178 skip_comma:
25185 }
25188 }
25190 /* Similarly, but expect leading and trailing parenthesis. This is a very
25191 common case for omp clauses. */
25193 static tree
25195 {
25199 }
25201 /* OpenMP 3.0:
25202 collapse ( constant-expression ) */
25204 static tree
25206 {
25208 location_t loc;
25209 HOST_WIDE_INT n;
25229 {
25232 }
25240 }
25242 /* OpenMP 2.5:
25243 default ( shared | none ) */
25245 static tree
25247 {
25249 tree c;
25254 {
25259 {
25274 }
25277 }
25278 else
25279 {
25280 invalid_kind:
25282 }
25298 }
25300 /* OpenMP 3.1:
25301 final ( expression ) */
25303 static tree
25305 {
25326 }
25328 /* OpenMP 2.5:
25329 if ( expression ) */
25331 static tree
25333 {
25354 }
25356 /* OpenMP 3.1:
25357 mergeable */
25359 static tree
25362 {
25363 tree c;
25366 location);
25371 }
25373 /* OpenMP 2.5:
25374 nowait */
25376 static tree
25379 {
25380 tree c;
25387 }
25389 /* OpenMP 2.5:
25390 num_threads ( expression ) */
25392 static tree
25394 location_t location)
25395 {
25417 }
25419 /* OpenMP 2.5:
25420 ordered */
25422 static tree
25425 {
25426 tree c;
25434 }
25436 /* OpenMP 2.5:
25437 reduction ( reduction-operator : variable-list )
25439 reduction-operator:
25440 One of: + * - & ^ | && ||
25442 OpenMP 3.1:
25444 reduction-operator:
25445 One of: + * - & ^ | && || min max */
25447 static tree
25449 {
25457 {
25483 {
25488 {
25491 }
25493 {
25496 }
25497 }
25498 /* FALLTHROUGH */
25502 resync_fail:
25507 }
25518 }
25520 /* OpenMP 2.5:
25521 schedule ( schedule-kind )
25522 schedule ( schedule-kind , expression )
25524 schedule-kind:
25525 static | dynamic | guided | runtime | auto */
25527 static tree
25529 {
25538 {
25543 {
25564 }
25565 }
25570 else
25575 {
25590 else
25595 }
25603 invalid_kind:
25605 resync_fail:
25610 }
25612 /* OpenMP 3.0:
25613 untied */
25615 static tree
25618 {
25619 tree c;
25626 }
25628 /* Parse all OpenMP clauses. The set clauses allowed by the directive
25629 is a bitmask in MASK. Return the list of clauses found; the result
25630 of clause default goes in *pdefault. */
25632 static tree
25635 {
25641 {
25642 pragma_omp_clause c_kind;
25654 {
25666 clauses);
25680 clauses);
25689 clauses);
25713 clauses);
25727 clauses);
25738 }
25741 {
25742 /* Remove the invalid clause(s) from the list to avoid
25743 confusing the rest of the compiler. */
25746 }
25747 }
25748 saw_error:
25751 }
25753 /* OpenMP 2.5:
25754 structured-block:
25755 statement
25757 In practice, we're also interested in adding the statement to an
25758 outer node. So it is convenient if we work around the fact that
25759 cp_parser_statement calls add_stmt. */
25761 static unsigned
25763 {
25766 /* Only move the values to IN_OMP_BLOCK if they weren't false.
25767 This preserves the "not within loop or switch" style error messages
25768 for nonsense cases like
25769 void foo() {
25770 #pragma omp single
25771 break;
25772 }
25773 */
25778 }
25780 static void
25782 {
25784 }
25786 static tree
25788 {
25796 }
25798 /* OpenMP 2.5:
25799 # pragma omp atomic new-line
25800 expression-stmt
25802 expression-stmt:
25803 x binop= expr | x++ | ++x | x-- | --x
25804 binop:
25805 +, *, -, /, &, ^, |, <<, >>
25807 where x is an lvalue expression with scalar type.
25809 OpenMP 3.1:
25810 # pragma omp atomic new-line
25811 update-stmt
25813 # pragma omp atomic read new-line
25814 read-stmt
25816 # pragma omp atomic write new-line
25817 write-stmt
25819 # pragma omp atomic update new-line
25820 update-stmt
25822 # pragma omp atomic capture new-line
25823 capture-stmt
25825 # pragma omp atomic capture new-line
25826 capture-block
25828 read-stmt:
25829 v = x
25830 write-stmt:
25831 x = expr
25832 update-stmt:
25833 expression-stmt | x = x binop expr
25834 capture-stmt:
25835 v = x binop= expr | v = x++ | v = ++x | v = x-- | v = --x
25836 capture-block:
25837 { v = x; update-stmt; } | { update-stmt; v = x; }
25839 where x and v are lvalue expressions with scalar type. */
25841 static void
25843 {
25850 {
25862 else
25866 }
25870 {
25881 else
25887 {
25888 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
25889 opcode. */
25894 }
25898 {
25901 }
25902 else
25903 {
25910 }
25913 }
25915 restart:
25920 {
25927 /* FALLTHROUGH */
25937 /* FALLTHROUGH */
25952 /* Undo effects of boolean_increment for post {in,de}crement. */
25954 /* FALLTHRU */
25958 {
25959 /* Undo effects of boolean_increment. */
25961 {
25962 /* This is pre or post increment. */
25967 && !structured_block
25971 }
25972 }
25973 /* FALLTHRU */
25976 {
26006 {
26016 {
26019 {
26027 }
26062 }
26073 }
26074 /* FALLTHROUGH */
26079 }
26086 }
26087 stmt_done:
26089 {
26102 }
26104 {
26107 }
26108 done:
26114 saw_error:
26117 {
26121 {
26125 }
26126 }
26127 }
26130 /* OpenMP 2.5:
26131 # pragma omp barrier new-line */
26133 static void
26135 {
26138 }
26140 /* OpenMP 2.5:
26141 # pragma omp critical [(name)] new-line
26142 structured-block */
26144 static tree
26146 {
26150 {
26162 }
26167 }
26169 /* OpenMP 2.5:
26170 # pragma omp flush flush-vars[opt] new-line
26172 flush-vars:
26173 ( variable-list ) */
26175 static void
26177 {
26183 }
26185 /* Helper function, to parse omp for increment expression. */
26187 static tree
26189 {
26194 {
26197 }
26200 {
26208 }
26210 /* If decl is an iterator, preserve LHS and RHS of the relational
26211 expr until finish_omp_for. */
26221 }
26223 /* Helper function, to parse omp for increment expression. */
26225 static tree
26227 {
26231 cp_id_kind idk;
26235 {
26243 }
26251 {
26256 }
26263 {
26267 }
26279 do
26280 {
26287 {
26289 {
26292 else
26294 tf_warning_or_error);
26295 }
26296 else
26299 }
26300 }
26304 {
26308 }
26309 else
26313 }
26315 /* Parse the restricted form of the for statement allowed by OpenMP. */
26317 static tree
26319 {
26323 location_t loc_first;
26342 {
26345 location_t loc;
26348 {
26351 }
26360 {
26361 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
26363 init-expr:
26364 var = lb
26365 integer-type var = lb
26366 random-access-iterator-type var = lb
26367 pointer-type var = lb
26368 */
26369 cp_decl_specifier_seq type_specifiers;
26371 /* First, try to parse as an initialized declaration. See
26372 cp_parser_condition, from whence the bulk of this is copied. */
26379 {
26380 /* If parsing a type specifier seq succeeded, then this
26381 MUST be a initialized declaration. */
26386 CP_PARSER_DECLARATOR_NAMED,
26396 else
26397 {
26407 {
26409 CPP_OPEN_PAREN))
26412 else
26413 /* Trigger an error. */
26418 }
26422 {
26430 {
26433 auto_node);
26438 }
26441 asm_specification,
26442 LOOKUP_ONLYCONVERTING);
26444 {
26447 }
26448 else
26451 }
26452 else
26453 {
26454 /* Consume '='. */
26458 non_class:
26461 else
26464 asm_specification,
26465 LOOKUP_ONLYCONVERTING);
26466 }
26470 }
26471 }
26472 else
26473 {
26474 cp_id_kind idk;
26475 /* If parsing a type specifier sequence failed, then
26476 this MUST be a simple expression. */
26481 && decl
26484 {
26485 tree rhs;
26492 rhs,
26493 tf_warning_or_error));
26495 }
26496 else
26497 {
26502 {
26506 }
26507 }
26508 }
26509 }
26512 {
26515 {
26521 }
26522 else
26524 }
26529 {
26534 {
26538 }
26541 {
26542 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
26543 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
26552 }
26553 else
26554 {
26559 }
26560 }
26563 {
26564 tree c;
26566 {
26575 decl);
26579 decl);
26580 }
26582 {
26587 {
26590 }
26591 }
26592 }
26601 {
26602 /* If decl is an iterator, preserve the operator on decl
26603 until finish_omp_for. */
26605 && ((processing_template_decl
26609 else
26613 }
26628 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
26629 in between the collapsed for loops to be still considered perfectly
26630 nested. Hopefully the final version clarifies this.
26631 For now handle (multiple) {'s and empty statements. */
26633 do
26634 {
26638 {
26640 bracecount++;
26641 }
26645 else
26646 {
26653 }
26654 }
26658 {
26661 }
26662 }
26664 /* Note that we saved the original contents of this flag when we entered
26665 the structured block, and so we don't need to re-save it here. */
26668 /* Note that the grammar doesn't call for a structured block here,
26669 though the loop as a whole is a structured block. */
26676 else
26681 {
26683 {
26685 nbraces--;
26686 }
26689 else
26690 {
26692 {
26695 }
26700 }
26701 }
26708 }
26710 /* OpenMP 2.5:
26711 #pragma omp for for-clause[optseq] new-line
26712 for-loop */
26714 #define OMP_FOR_CLAUSE_MASK \
26715 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26716 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26717 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
26718 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26719 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
26720 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
26721 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT) \
26722 | (1u << PRAGMA_OMP_CLAUSE_COLLAPSE))
26724 static tree
26726 {
26742 }
26744 /* OpenMP 2.5:
26745 # pragma omp master new-line
26746 structured-block */
26748 static tree
26750 {
26754 }
26756 /* OpenMP 2.5:
26757 # pragma omp ordered new-line
26758 structured-block */
26760 static tree
26762 {
26766 }
26768 /* OpenMP 2.5:
26770 section-scope:
26771 { section-sequence }
26773 section-sequence:
26774 section-directive[opt] structured-block
26775 section-sequence section-directive structured-block */
26777 static tree
26779 {
26790 {
26797 {
26807 }
26813 }
26816 {
26824 {
26828 }
26830 {
26833 }
26838 }
26849 }
26851 /* OpenMP 2.5:
26852 # pragma omp sections sections-clause[optseq] newline
26853 sections-scope */
26855 #define OMP_SECTIONS_CLAUSE_MASK \
26856 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26857 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26858 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
26859 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26860 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
26862 static tree
26864 {
26875 }
26877 /* OpenMP 2.5:
26878 # pragma parallel parallel-clause new-line
26879 # pragma parallel for parallel-for-clause new-line
26880 # pragma parallel sections parallel-sections-clause new-line */
26882 #define OMP_PARALLEL_CLAUSE_MASK \
26883 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
26884 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26885 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26886 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
26887 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
26888 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
26889 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26890 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
26892 static tree
26894 {
26903 {
26909 }
26911 {
26915 {
26921 }
26922 }
26929 {
26949 }
26956 }
26958 /* OpenMP 2.5:
26959 # pragma omp single single-clause[optseq] new-line
26960 structured-block */
26962 #define OMP_SINGLE_CLAUSE_MASK \
26963 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26964 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26965 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
26966 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
26968 static tree
26970 {
26980 }
26982 /* OpenMP 3.0:
26983 # pragma omp task task-clause[optseq] new-line
26984 structured-block */
26986 #define OMP_TASK_CLAUSE_MASK \
26987 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
26988 | (1u << PRAGMA_OMP_CLAUSE_UNTIED) \
26989 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
26990 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26991 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26992 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
26993 | (1u << PRAGMA_OMP_CLAUSE_FINAL) \
26994 | (1u << PRAGMA_OMP_CLAUSE_MERGEABLE))
26996 static tree
26998 {
27009 }
27011 /* OpenMP 3.0:
27012 # pragma omp taskwait new-line */
27014 static void
27016 {
27019 }
27021 /* OpenMP 3.1:
27022 # pragma omp taskyield new-line */
27024 static void
27026 {
27029 }
27031 /* OpenMP 2.5:
27032 # pragma omp threadprivate (variable-list) */
27034 static void
27036 {
27037 tree vars;
27043 }
27045 /* Main entry point to OpenMP statement pragmas. */
27047 static void
27049 {
27050 tree stmt;
27053 {
27083 }
27087 }
27088 \f
27089 /* Transactional Memory parsing routines. */
27091 /* Parse a transaction attribute.
27093 txn-attribute:
27094 attribute
27095 [ [ identifier ] ]
27097 ??? Simplify this when C++0x bracket attributes are
27098 implemented properly. */
27100 static tree
27102 {
27117 {
27121 /* For keywords, use the canonical spelling,
27122 not the parsed identifier. */
27126 }
27127 else
27131 error1:
27134 }
27136 /* Parse a __transaction_atomic or __transaction_relaxed statement.
27138 transaction-statement:
27139 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
27140 compound-statement
27141 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
27142 */
27144 static tree
27146 {
27161 else
27162 {
27166 }
27168 /* Parse a noexcept specification. */
27171 /* Keep track if we're in the lexical scope of an outer transaction. */
27183 }
27185 /* Parse a __transaction_atomic or __transaction_relaxed expression.
27187 transaction-expression:
27188 __transaction_atomic txn-noexcept-spec[opt] ( expression )
27189 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
27190 */
27192 static tree
27194 {
27219 /* Set this early. This might mean that we allow transaction_cancel in
27220 an expression that we find out later actually has to be a constexpr.
27221 However, we expect that cxx_constant_value will be able to deal with
27222 this; also, if the noexcept has no constexpr, then what we parse next
27223 really is a transaction's body. */
27226 /* Parse a noexcept specification. */
27232 {
27239 }
27240 else
27241 {
27242 /* The only expression that is available got parsed for the noexcept
27243 already. noexcept is true then. */
27246 }
27255 }
27257 /* Parse a function-transaction-block.
27259 function-transaction-block:
27260 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
27261 function-body
27262 __transaction_atomic txn-attribute[opt] function-try-block
27263 __transaction_relaxed ctor-initializer[opt] function-body
27264 __transaction_relaxed function-try-block
27265 */
27267 static bool
27269 {
27285 else
27286 {
27290 }
27298 else
27299 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
27307 }
27309 /* Parse a __transaction_cancel statement.
27311 cancel-statement:
27312 __transaction_cancel txn-attribute[opt] ;
27313 __transaction_cancel txn-attribute[opt] throw-expression ;
27315 ??? Cancel and throw is not yet implemented. */
27317 static tree
27319 {
27325 RT_TRANSACTION_CANCEL);
27332 /* ??? Parse cancel-and-throw here. */
27337 {
27341 }
27343 {
27347 }
27349 {
27352 {
27358 }
27359 }
27361 {
27365 }
27372 }
27373 \f
27374 /* The parser. */
27378 \f
27379 /* Special handling for the first token or line in the file. The first
27380 thing in the file might be #pragma GCC pch_preprocess, which loads a
27381 PCH file, which is a GC collection point. So we need to handle this
27382 first pragma without benefit of an existing lexer structure.
27384 Always returns one token to the caller in *FIRST_TOKEN. This is
27385 either the true first token of the file, or the first token after
27386 the initial pragma. */
27388 static void
27390 {
27399 {
27406 }
27407 else
27410 /* Skip to the end of the pragma. */
27414 /* Now actually load the PCH file. */
27418 /* Read one more token to return to our caller. We have to do this
27419 after reading the PCH file in, since its pointers have to be
27420 live. */
27422 }
27424 /* Normal parsing of a pragma token. Here we can (and must) use the
27425 regular lexer. */
27427 static bool
27429 {
27439 {
27447 {
27457 }
27462 {
27472 }
27477 {
27483 "%<#pragma omp taskwait%> may only be "
27488 }
27493 {
27499 "%<#pragma omp taskyield%> may only be "
27504 }
27527 "%<#pragma omp section%> may only be used in "
27536 bad_stmt:
27539 }
27543 }
27545 /* The interface the pragma parsers have to the lexer. */
27547 enum cpp_ttype
27549 {
27562 else
27563 {
27567 }
27570 }
27572 \f
27573 /* External interface. */
27575 /* Parse one entire translation unit. */
27577 void
27579 {
27583 {
27586 }
27594 }