| blob | 3e2be97f9c9ed7f86210b436d8f0cfb0cde306b2 |
1 /* C++ Parser.
2 Copyright (C) 2000, 2001, 2002, 2003, 2004,
3 2005, 2007, 2008, 2009, 2010, 2011 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/>. */
44 \f
45 /* The lexer. */
47 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
48 and c-lex.c) and the C++ parser. */
51 {
53 };
55 /* The various kinds of non integral constant we encounter. */
57 NIC_NONE,
58 /* floating-point literal */
59 NIC_FLOAT,
60 /* %<this%> */
61 NIC_THIS,
62 /* %<__FUNCTION__%> */
63 NIC_FUNC_NAME,
64 /* %<__PRETTY_FUNCTION__%> */
65 NIC_PRETTY_FUNC,
66 /* %<__func__%> */
67 NIC_C99_FUNC,
68 /* "%<va_arg%> */
69 NIC_VA_ARG,
70 /* a cast */
71 NIC_CAST,
72 /* %<typeid%> operator */
73 NIC_TYPEID,
74 /* non-constant compound literals */
75 NIC_NCC,
76 /* a function call */
77 NIC_FUNC_CALL,
78 /* an increment */
79 NIC_INC,
80 /* an decrement */
81 NIC_DEC,
82 /* an array reference */
83 NIC_ARRAY_REF,
84 /* %<->%> */
85 NIC_ARROW,
86 /* %<.%> */
87 NIC_POINT,
88 /* the address of a label */
89 NIC_ADDR_LABEL,
90 /* %<*%> */
91 NIC_STAR,
92 /* %<&%> */
93 NIC_ADDR,
94 /* %<++%> */
95 NIC_PREINCREMENT,
96 /* %<--%> */
97 NIC_PREDECREMENT,
98 /* %<new%> */
99 NIC_NEW,
100 /* %<delete%> */
101 NIC_DEL,
102 /* calls to overloaded operators */
103 NIC_OVERLOADED,
104 /* an assignment */
105 NIC_ASSIGNMENT,
106 /* a comma operator */
107 NIC_COMMA,
108 /* a call to a constructor */
109 NIC_CONSTRUCTOR,
110 /* a transaction expression */
111 NIC_TRANSACTION
114 /* The various kinds of errors about name-lookup failing. */
116 /* NULL */
117 NLE_NULL,
118 /* is not a type */
119 NLE_TYPE,
120 /* is not a class or namespace */
121 NLE_CXX98,
122 /* is not a class, namespace, or enumeration */
123 NLE_NOT_CXX98
126 /* The various kinds of required token */
128 RT_NONE,
150 /* The type is CPP_KEYWORD */
179 RT_TRANSACTION_CANCEL /* __transaction_cancel */
182 /* Prototypes. */
188 static void cp_lexer_destroy
190 static int cp_lexer_saving_tokens
194 static void cp_lexer_get_preprocessor_token
202 static bool cp_lexer_next_token_is_not
204 static bool cp_lexer_next_token_is_keyword
208 static void cp_lexer_purge_token
210 static void cp_lexer_purge_tokens_after
212 static void cp_lexer_save_tokens
214 static void cp_lexer_commit_tokens
216 static void cp_lexer_rollback_tokens
218 static void cp_lexer_print_token
222 static void cp_lexer_start_debugging
224 static void cp_lexer_stop_debugging
230 static void cp_parser_initial_pragma
233 static tree cp_literal_operator_id
236 /* Manifest constants. */
237 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
238 #define CP_SAVED_TOKEN_STACK 5
240 /* Variables. */
242 /* The stream to which debugging output should be written. */
245 /* Nonzero if we are parsing an unevaluated operand: an operand to
246 sizeof, typeof, or alignof. */
249 /* Dump up to NUM tokens in BUFFER to FILE starting with token
250 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
251 first token in BUFFER. If NUM is 0, dump all the tokens. If
252 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
253 highlighted by surrounding it in [[ ]]. */
255 static void
259 {
276 {
279 }
284 {
291 nprinted++;
301 {
311 }
312 }
315 {
319 }
322 }
325 /* Dump all tokens in BUFFER to stderr. */
327 void
329 {
331 }
334 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
335 description for T. */
337 static void
339 {
341 {
344 }
345 }
348 /* Dump parser context C to FILE. */
350 static void
352 {
357 }
360 /* Print the stack of parsing contexts to FILE starting with FIRST. */
362 static void
364 {
370 {
373 }
374 }
377 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
379 static void
381 {
384 }
387 /* Print an unparsed function entry UF to FILE. */
389 static void
391 {
394 tree fn;
399 default_arg_fn);
400 i++)
401 {
407 }
412 {
415 }
421 {
424 }
426 }
429 /* Print the stack of unparsed member functions S to FILE. */
431 static void
434 {
440 {
443 }
444 }
447 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
448 the given PARSER. If FILE is NULL, the output is printed on stderr. */
450 static void
452 {
464 next_token);
465 }
468 /* Dump debugging information for the given PARSER. If FILE is NULL,
469 the output is printed on stderr. */
471 void
473 {
476 expanded_location eloc;
550 }
553 /* Allocate memory for a new lexer object and return it. */
557 {
562 /* Allocate the memory. */
565 /* Initially we are not debugging. */
569 CP_SAVED_TOKEN_STACK);
571 /* Create the buffer. */
575 }
578 /* Create a new main C++ lexer, the lexer that gets tokens from the
579 preprocessor. */
583 {
585 cp_token token;
587 /* It's possible that parsing the first pragma will load a PCH file,
588 which is a GC collection point. So we have to do that before
589 allocating any memory. */
594 /* Put the first token in the buffer. */
597 /* Get the remaining tokens from the preprocessor. */
599 {
602 }
611 /* Subsequent preprocessor diagnostics should use compiler
612 diagnostic functions to get the compiler source location. */
617 }
619 /* Create a new lexer whose token stream is primed with the tokens in
620 CACHE. When these tokens are exhausted, no new tokens will be read. */
624 {
629 /* We do not own the buffer. */
635 CP_SAVED_TOKEN_STACK);
637 /* Initially we are not debugging. */
642 }
644 /* Frees all resources associated with LEXER. */
646 static void
648 {
652 }
654 /* Returns nonzero if debugging information should be output. */
658 {
660 }
665 {
669 }
673 {
675 }
679 {
681 }
685 {
688 else
690 }
694 {
698 }
700 /* nonzero if we are presently saving tokens. */
704 {
706 }
708 /* Store the next token from the preprocessor in *TOKEN. Return true
709 if we reach EOF. If LEXER is NULL, assume we are handling an
710 initial #pragma pch_preprocess, and thus want the lexer to return
711 processed strings. */
713 static void
715 {
718 /* Get a new token from the preprocessor. */
719 token->type
726 /* On some systems, some header files are surrounded by an
727 implicit extern "C" block. Set a flag in the token if it
728 comes from such a header. */
733 /* Check to see if this token is a keyword. */
735 {
737 {
738 /* Mark this token as a keyword. */
740 /* Record which keyword. */
742 }
743 else
744 {
748 {
749 /* Warn about the C++0x keyword (but still treat it as
750 an identifier). */
755 /* Clear out the C_RID_CODE so we don't warn about this
756 particular identifier-turned-keyword again. */
758 }
762 }
763 }
765 {
766 /* This only happens in Objective-C++; it must be a keyword. */
769 {
770 /* Replace 'class' with '@class', 'private' with '@private',
771 etc. This prevents confusion with the C++ keyword
772 'class', and makes the tokens consistent with other
773 Objective-C 'AT' keywords. For example '@class' is
774 reported as RID_AT_CLASS which is consistent with
775 '@synchronized', which is reported as
776 RID_AT_SYNCHRONIZED.
777 */
786 }
787 }
789 {
790 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
794 }
795 }
797 /* Update the globals input_location and the input file stack from TOKEN. */
800 {
802 {
804 }
805 }
807 /* Return a pointer to the next token in the token stream, but do not
808 consume it. */
812 {
814 {
818 }
820 }
822 /* Return true if the next token has the indicated TYPE. */
826 {
828 }
830 /* Return true if the next token does not have the indicated TYPE. */
834 {
836 }
838 /* Return true if the next token is the indicated KEYWORD. */
842 {
844 }
846 /* Return true if the next token is not the indicated KEYWORD. */
850 {
852 }
854 /* Return true if the next token is a keyword for a decl-specifier. */
856 static bool
858 {
863 {
864 /* auto specifier: storage-class-specifier in C++,
865 simple-type-specifier in C++0x. */
867 /* Storage classes. */
873 /* Elaborated type specifiers. */
879 /* Simple type specifiers. */
894 /* GNU extensions. */
897 /* C++0x extensions. */
904 }
905 }
907 /* Returns TRUE iff the token T begins a decltype type. */
909 static bool
911 {
914 }
916 /* Returns TRUE iff the next token begins a decltype type. */
918 static bool
920 {
923 }
925 /* Return a pointer to the Nth token in the token stream. If N is 1,
926 then this is precisely equivalent to cp_lexer_peek_token (except
927 that it is not inline). One would like to disallow that case, but
928 there is one case (cp_parser_nth_token_starts_template_id) where
929 the caller passes a variable for N and it might be 1. */
933 {
936 /* N is 1-based, not zero-based. */
947 {
950 {
953 }
957 }
960 {
963 }
966 }
968 /* Return the next token, and advance the lexer's next_token pointer
969 to point to the next non-purged token. */
973 {
979 do
980 {
983 {
986 }
988 }
993 /* Provide debugging output. */
995 {
999 }
1002 }
1004 /* Permanently remove the next token from the token stream, and
1005 advance the next_token pointer to refer to the next non-purged
1006 token. */
1008 static void
1010 {
1019 do
1020 {
1021 tok++;
1023 {
1026 }
1027 }
1030 }
1032 /* Permanently remove all tokens after TOK, up to, but not
1033 including, the token that will be returned next by
1034 cp_lexer_peek_token. */
1036 static void
1038 {
1047 {
1052 }
1053 }
1055 /* Begin saving tokens. All tokens consumed after this point will be
1056 preserved. */
1058 static void
1060 {
1061 /* Provide debugging output. */
1067 }
1069 /* Commit to the portion of the token stream most recently saved. */
1071 static void
1073 {
1074 /* Provide debugging output. */
1079 }
1081 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1082 to the token stream. Stop saving tokens. */
1084 static void
1086 {
1087 /* Provide debugging output. */
1092 }
1094 /* Print a representation of the TOKEN on the STREAM. */
1096 static void
1098 {
1099 /* We don't use cpp_type2name here because the parser defines
1100 a few tokens of its own. */
1102 /* cpplib-defined token types */
1103 #define OP(e, s) #e,
1104 #define TK(e, s) #e,
1105 TTYPE_TABLE
1106 #undef OP
1107 #undef TK
1108 /* C++ parser token types - see "Manifest constants", above. */
1112 };
1114 /* For some tokens, print the associated data. */
1116 {
1118 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1119 For example, `struct' is mapped to an INTEGER_CST. */
1122 /* else fall through */
1140 /* If we have a name for the token, print it out. Otherwise, we
1141 simply give the numeric code. */
1144 else
1147 }
1148 }
1150 /* Start emitting debugging information. */
1152 static void
1154 {
1157 }
1159 /* Stop emitting debugging information. */
1161 static void
1163 {
1166 }
1168 /* Create a new cp_token_cache, representing a range of tokens. */
1172 {
1177 }
1179 \f
1180 /* Decl-specifiers. */
1182 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1184 static void
1186 {
1188 }
1190 /* Declarators. */
1192 /* Nothing other than the parser should be creating declarators;
1193 declarators are a semi-syntactic representation of C++ entities.
1194 Other parts of the front end that need to create entities (like
1195 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1210 /* An erroneous declarator. */
1213 /* The obstack on which declarators and related data structures are
1214 allocated. */
1217 /* Alloc BYTES from the declarator memory pool. */
1221 {
1223 }
1225 /* Allocate a declarator of the indicated KIND. Clear fields that are
1226 common to all declarators. */
1230 {
1241 }
1243 /* Make a declarator for a generalized identifier. If
1244 QUALIFYING_SCOPE is non-NULL, the identifier is
1245 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1246 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1247 is, if any. */
1251 special_function_kind sfk)
1252 {
1255 /* It is valid to write:
1257 class C { void f(); };
1258 typedef C D;
1259 void D::f();
1261 The standard is not clear about whether `typedef const C D' is
1262 legal; as of 2002-09-15 the committee is considering that
1263 question. EDG 3.0 allows that syntax. Therefore, we do as
1264 well. */
1278 }
1280 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1281 of modifiers such as const or volatile to apply to the pointer
1282 type, represented as identifiers. */
1284 cp_declarator *
1286 {
1294 {
1298 }
1299 else
1303 }
1305 /* Like make_pointer_declarator -- but for references. */
1307 cp_declarator *
1310 {
1318 {
1322 }
1323 else
1327 }
1329 /* Like make_pointer_declarator -- but for a pointer to a non-static
1330 member of CLASS_TYPE. */
1332 cp_declarator *
1335 {
1344 {
1347 }
1348 else
1352 }
1354 /* Make a declarator for the function given by TARGET, with the
1355 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1356 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1357 indicates what exceptions can be thrown. */
1359 cp_declarator *
1361 tree parms,
1362 cp_cv_quals cv_qualifiers,
1363 cp_virt_specifiers virt_specifiers,
1364 tree exception_specification,
1365 tree late_return_type)
1366 {
1377 {
1381 }
1382 else
1386 }
1388 /* Make a declarator for an array of BOUNDS elements, each of which is
1389 defined by ELEMENT. */
1391 cp_declarator *
1393 {
1400 {
1404 }
1405 else
1409 }
1411 /* Determine whether the declarator we've seen so far can be a
1412 parameter pack, when followed by an ellipsis. */
1413 static bool
1415 {
1416 /* Search for a declarator name, or any other declarator that goes
1417 after the point where the ellipsis could appear in a parameter
1418 pack. If we find any of these, then this declarator can not be
1419 made into a parameter pack. */
1422 {
1424 {
1436 }
1437 }
1440 }
1444 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1445 DECLARATOR and DEFAULT_ARGUMENT. */
1447 cp_parameter_declarator *
1450 tree default_argument)
1451 {
1459 else
1466 }
1468 /* Returns true iff DECLARATOR is a declaration for a function. */
1470 static bool
1472 {
1474 {
1482 }
1484 }
1486 /* The parser. */
1488 /* Overview
1489 --------
1491 A cp_parser parses the token stream as specified by the C++
1492 grammar. Its job is purely parsing, not semantic analysis. For
1493 example, the parser breaks the token stream into declarators,
1494 expressions, statements, and other similar syntactic constructs.
1495 It does not check that the types of the expressions on either side
1496 of an assignment-statement are compatible, or that a function is
1497 not declared with a parameter of type `void'.
1499 The parser invokes routines elsewhere in the compiler to perform
1500 semantic analysis and to build up the abstract syntax tree for the
1501 code processed.
1503 The parser (and the template instantiation code, which is, in a
1504 way, a close relative of parsing) are the only parts of the
1505 compiler that should be calling push_scope and pop_scope, or
1506 related functions. The parser (and template instantiation code)
1507 keeps track of what scope is presently active; everything else
1508 should simply honor that. (The code that generates static
1509 initializers may also need to set the scope, in order to check
1510 access control correctly when emitting the initializers.)
1512 Methodology
1513 -----------
1515 The parser is of the standard recursive-descent variety. Upcoming
1516 tokens in the token stream are examined in order to determine which
1517 production to use when parsing a non-terminal. Some C++ constructs
1518 require arbitrary look ahead to disambiguate. For example, it is
1519 impossible, in the general case, to tell whether a statement is an
1520 expression or declaration without scanning the entire statement.
1521 Therefore, the parser is capable of "parsing tentatively." When the
1522 parser is not sure what construct comes next, it enters this mode.
1523 Then, while we attempt to parse the construct, the parser queues up
1524 error messages, rather than issuing them immediately, and saves the
1525 tokens it consumes. If the construct is parsed successfully, the
1526 parser "commits", i.e., it issues any queued error messages and
1527 the tokens that were being preserved are permanently discarded.
1528 If, however, the construct is not parsed successfully, the parser
1529 rolls back its state completely so that it can resume parsing using
1530 a different alternative.
1532 Future Improvements
1533 -------------------
1535 The performance of the parser could probably be improved substantially.
1536 We could often eliminate the need to parse tentatively by looking ahead
1537 a little bit. In some places, this approach might not entirely eliminate
1538 the need to parse tentatively, but it might still speed up the average
1539 case. */
1541 /* Flags that are passed to some parsing functions. These values can
1542 be bitwise-ored together. */
1544 enum
1545 {
1546 /* No flags. */
1548 /* The construct is optional. If it is not present, then no error
1549 should be issued. */
1551 /* When parsing a type-specifier, treat user-defined type-names
1552 as non-type identifiers. */
1554 /* When parsing a type-specifier, do not try to parse a class-specifier
1555 or enum-specifier. */
1557 /* When parsing a decl-specifier-seq, only allow type-specifier or
1558 constexpr. */
1560 };
1562 /* This type is used for parameters and variables which hold
1563 combinations of the above flags. */
1566 /* The different kinds of declarators we want to parse. */
1569 {
1570 /* We want an abstract declarator. */
1571 CP_PARSER_DECLARATOR_ABSTRACT,
1572 /* We want a named declarator. */
1573 CP_PARSER_DECLARATOR_NAMED,
1574 /* We don't mind, but the name must be an unqualified-id. */
1575 CP_PARSER_DECLARATOR_EITHER
1578 /* The precedence values used to parse binary expressions. The minimum value
1579 of PREC must be 1, because zero is reserved to quickly discriminate
1580 binary operators from other tokens. */
1582 enum cp_parser_prec
1583 {
1584 PREC_NOT_OPERATOR,
1585 PREC_LOGICAL_OR_EXPRESSION,
1586 PREC_LOGICAL_AND_EXPRESSION,
1587 PREC_INCLUSIVE_OR_EXPRESSION,
1588 PREC_EXCLUSIVE_OR_EXPRESSION,
1589 PREC_AND_EXPRESSION,
1590 PREC_EQUALITY_EXPRESSION,
1591 PREC_RELATIONAL_EXPRESSION,
1592 PREC_SHIFT_EXPRESSION,
1593 PREC_ADDITIVE_EXPRESSION,
1594 PREC_MULTIPLICATIVE_EXPRESSION,
1595 PREC_PM_EXPRESSION,
1596 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1597 };
1599 /* A mapping from a token type to a corresponding tree node type, with a
1600 precedence value. */
1603 {
1604 /* The token type. */
1606 /* The corresponding tree code. */
1608 /* The precedence of this operator. */
1613 {
1614 /* Left hand side of the binary operation we are currently
1615 parsing. */
1616 tree lhs;
1617 /* Original tree code for left hand side, if it was a binary
1618 expression itself (used for -Wparentheses). */
1620 /* Tree code for the binary operation we are parsing. */
1622 /* Precedence of the binary operation we are parsing. */
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 bool cp_parser_friend_p
2226 static void cp_parser_required_error
2232 static bool cp_parser_token_starts_function_definition_p
2234 static bool cp_parser_next_token_starts_class_definition_p
2236 static bool cp_parser_next_token_ends_template_argument_p
2238 static bool cp_parser_nth_token_starts_template_argument_list_p
2240 static enum tag_types cp_parser_token_is_class_key
2242 static void cp_parser_check_class_key
2244 static void cp_parser_check_access_in_redeclaration
2246 static bool cp_parser_optional_template_keyword
2248 static void cp_parser_pre_parsed_nested_name_specifier
2250 static bool cp_parser_cache_group
2252 static tree cp_parser_cache_defarg
2254 static void cp_parser_parse_tentatively
2256 static void cp_parser_commit_to_tentative_parse
2258 static void cp_parser_abort_tentative_parse
2260 static bool cp_parser_parse_definitely
2264 static bool cp_parser_uncommitted_to_tentative_parse_p
2266 static void cp_parser_error
2268 static void cp_parser_name_lookup_error
2270 static bool cp_parser_simulate_error
2272 static bool cp_parser_check_type_definition
2274 static void cp_parser_check_for_definition_in_return_type
2276 static void cp_parser_check_for_invalid_template_id
2278 static bool cp_parser_non_integral_constant_expression
2280 static void cp_parser_diagnose_invalid_type_name
2282 static bool cp_parser_parse_and_diagnose_invalid_type_name
2284 static int cp_parser_skip_to_closing_parenthesis
2286 static void cp_parser_skip_to_end_of_statement
2288 static void cp_parser_consume_semicolon_at_end_of_statement
2290 static void cp_parser_skip_to_end_of_block_or_statement
2292 static bool cp_parser_skip_to_closing_brace
2294 static void cp_parser_skip_to_end_of_template_parameter_list
2296 static void cp_parser_skip_to_pragma_eol
2298 static bool cp_parser_error_occurred
2300 static bool cp_parser_allow_gnu_extensions_p
2302 static bool cp_parser_is_pure_string_literal
2304 static bool cp_parser_is_string_literal
2306 static bool cp_parser_is_keyword
2308 static tree cp_parser_make_typename_type
2313 /* Returns nonzero if we are parsing tentatively. */
2317 {
2319 }
2321 /* Returns nonzero if TOKEN is a string literal. */
2323 static bool
2325 {
2331 }
2333 /* Returns nonzero if TOKEN is a string literal
2334 of a user-defined string literal. */
2336 static bool
2338 {
2345 }
2347 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2349 static bool
2351 {
2353 }
2355 /* If not parsing tentatively, issue a diagnostic of the form
2356 FILE:LINE: MESSAGE before TOKEN
2357 where TOKEN is the next token in the input stream. MESSAGE
2358 (specified by the caller) is usually of the form "expected
2359 OTHER-TOKEN". */
2361 static void
2363 {
2365 {
2367 /* This diagnostic makes more sense if it is tagged to the line
2368 of the token we just peeked at. */
2372 {
2377 }
2380 /* Because c_parser_error does not understand
2381 CPP_KEYWORD, keywords are treated like
2382 identifiers. */
2385 }
2386 }
2388 /* Issue an error about name-lookup failing. NAME is the
2389 IDENTIFIER_NODE DECL is the result of
2390 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2391 the thing that we hoped to find. */
2393 static void
2395 tree name,
2396 tree decl,
2397 name_lookup_error desired,
2398 location_t location)
2399 {
2400 /* If name lookup completely failed, tell the user that NAME was not
2401 declared. */
2403 {
2416 else
2418 }
2420 {
2422 {
2439 }
2440 }
2442 {
2444 {
2454 name);
2458 }
2459 }
2460 else
2461 {
2463 {
2476 }
2477 }
2478 }
2480 /* If we are parsing tentatively, remember that an error has occurred
2481 during this tentative parse. Returns true if the error was
2482 simulated; false if a message should be issued by the caller. */
2484 static bool
2486 {
2488 {
2491 }
2493 }
2495 /* Check for repeated decl-specifiers. */
2497 static void
2499 location_t location)
2500 {
2504 {
2508 /* The "long" specifier is a special case because of "long long". */
2510 {
2513 else
2516 }
2518 {
2535 "__thread"
2536 };
2538 }
2539 }
2540 }
2542 /* This function is called when a type is defined. If type
2543 definitions are forbidden at this point, an error message is
2544 issued. */
2546 static bool
2548 {
2549 /* If types are forbidden here, issue a message. */
2551 {
2552 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2553 in the message need to be interpreted. */
2556 }
2558 }
2560 /* This function is called when the DECLARATOR is processed. The TYPE
2561 was a type defined in the decl-specifiers. If it is invalid to
2562 define a type in the decl-specifiers for DECLARATOR, an error is
2563 issued. TYPE_LOCATION is the location of TYPE and is used
2564 for error reporting. */
2566 static void
2569 {
2570 /* [dcl.fct] forbids type definitions in return types.
2571 Unfortunately, it's not easy to know whether or not we are
2572 processing a return type until after the fact. */
2580 {
2585 type);
2586 }
2587 }
2589 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2590 "<" in any valid C++ program. If the next token is indeed "<",
2591 issue a message warning the user about what appears to be an
2592 invalid attempt to form a template-id. LOCATION is the location
2593 of the type-specifier (TYPE) */
2595 static void
2598 {
2602 {
2607 else
2609 /* Remember the location of the invalid "<". */
2612 /* Consume the "<". */
2614 /* Parse the template arguments. */
2616 /* Permanently remove the invalid template arguments so that
2617 this error message is not issued again. */
2620 }
2621 }
2623 /* If parsing an integral constant-expression, issue an error message
2624 about the fact that THING appeared and return true. Otherwise,
2625 return false. In either case, set
2626 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2628 static bool
2630 non_integral_constant thing)
2631 {
2634 {
2636 {
2639 {
2646 "enumeration type cannot appear in a "
2737 }
2741 }
2742 }
2744 }
2746 /* Emit a diagnostic for an invalid type name. SCOPE is the
2747 qualifying scope (or NULL, if none) for ID. This function commits
2748 to the current active tentative parse, if any. (Otherwise, the
2749 problematic construct might be encountered again later, resulting
2750 in duplicate error messages.) LOCATION is the location of ID. */
2752 static void
2755 location_t location)
2756 {
2759 /* Try to lookup the identifier. */
2764 /* If the lookup found a template-name, it means that the user forgot
2765 to specify an argument list. Emit a useful error message. */
2769 decl);
2773 /* Something like 'unsigned A a;' */
2776 {
2777 /* Issue an error message. */
2779 /* If we're in a template class, it's possible that the user was
2780 referring to a type from a base class. For example:
2782 template <typename T> struct A { typedef T X; };
2783 template <typename T> struct B : public A<T> { X x; };
2785 The user should have said "typename A<T>::X". */
2791 {
2792 tree b;
2795 b;
2797 {
2801 {
2802 tree field;
2803 /* Go from a particular instantiation of the
2804 template (which will have an empty TYPE_FIELDs),
2805 to the main version. */
2808 field;
2812 {
2817 }
2820 }
2821 }
2822 }
2823 }
2824 /* Here we diagnose qualified-ids where the scope is actually correct,
2825 but the identifier does not resolve to a valid type name. */
2827 {
2833 {
2834 /* A<T>::A<T>() */
2840 }
2849 else
2851 }
2852 }
2854 /* Check for a common situation where a type-name should be present,
2855 but is not, and issue a sensible error message. Returns true if an
2856 invalid type-name was detected.
2858 The situation handled by this function are variable declarations of the
2859 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2860 Usually, `ID' should name a type, but if we got here it means that it
2861 does not. We try to emit the best possible error message depending on
2862 how exactly the id-expression looks like. */
2864 static bool
2866 {
2867 tree id;
2870 /* Avoid duplicate error about ambiguous lookup. */
2872 {
2876 }
2885 /* If the next token is a (, this is a function with no explicit return
2886 type, i.e. constructor, destructor or conversion op. */
2889 {
2892 }
2896 /* Emit a diagnostic for the invalid type. */
2899 out:
2900 /* If we aren't in the middle of a declarator (i.e. in a
2901 parameter-declaration-clause), skip to the end of the declaration;
2902 there's no point in trying to process it. */
2906 }
2908 /* Consume tokens up to, and including, the next non-nested closing `)'.
2909 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2910 are doing error recovery. Returns -1 if OR_COMMA is true and we
2911 found an unnested comma. */
2913 static int
2918 {
2928 {
2932 {
2935 /* If we've run out of tokens, then there is no closing `)'. */
2938 /* This is good for lambda expression capture-lists. */
2948 /* This matches the processing in skip_to_end_of_statement. */
2974 {
2978 }
2983 }
2985 /* Consume the token. */
2987 }
2988 }
2990 /* Consume tokens until we reach the end of the current statement.
2991 Normally, that will be just before consuming a `;'. However, if a
2992 non-nested `}' comes first, then we stop before consuming that. */
2994 static void
2996 {
3000 {
3004 {
3007 /* If we've run out of tokens, stop. */
3011 /* If the next token is a `;', we have reached the end of the
3012 statement. */
3018 /* If this is a non-nested '}', stop before consuming it.
3019 That way, when confronted with something like:
3021 { 3 + }
3023 we stop before consuming the closing '}', even though we
3024 have not yet reached a `;'. */
3028 /* If it is the closing '}' for a block that we have
3029 scanned, stop -- but only after consuming the token.
3030 That way given:
3032 void f g () { ... }
3033 typedef int I;
3035 we will stop after the body of the erroneously declared
3036 function, but before consuming the following `typedef'
3037 declaration. */
3039 {
3042 }
3050 }
3052 /* Consume the token. */
3054 }
3055 }
3057 /* This function is called at the end of a statement or declaration.
3058 If the next token is a semicolon, it is consumed; otherwise, error
3059 recovery is attempted. */
3061 static void
3063 {
3064 /* Look for the trailing `;'. */
3066 {
3067 /* If there is additional (erroneous) input, skip to the end of
3068 the statement. */
3070 /* If the next token is now a `;', consume it. */
3073 }
3074 }
3076 /* Skip tokens until we have consumed an entire block, or until we
3077 have consumed a non-nested `;'. */
3079 static void
3081 {
3085 {
3089 {
3092 /* If we've run out of tokens, stop. */
3096 /* Stop if this is an unnested ';'. */
3102 /* Stop if this is an unnested '}', or closes the outermost
3103 nesting level. */
3104 nesting_depth--;
3112 /* Nest. */
3113 nesting_depth++;
3118 }
3120 /* Consume the token. */
3122 }
3123 }
3125 /* Skip tokens until a non-nested closing curly brace is the next
3126 token, or there are no more tokens. Return true in the first case,
3127 false otherwise. */
3129 static bool
3131 {
3135 {
3139 {
3142 /* If we've run out of tokens, stop. */
3146 /* If the next token is a non-nested `}', then we have reached
3147 the end of the current block. */
3153 /* If it the next token is a `{', then we are entering a new
3154 block. Consume the entire block. */
3160 }
3162 /* Consume the token. */
3164 }
3165 }
3167 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3168 parameter is the PRAGMA token, allowing us to purge the entire pragma
3169 sequence. */
3171 static void
3173 {
3178 do
3182 /* Ensure that the pragma is not parsed again. */
3184 }
3186 /* Require pragma end of line, resyncing with it as necessary. The
3187 arguments are as for cp_parser_skip_to_pragma_eol. */
3189 static void
3191 {
3195 }
3197 /* This is a simple wrapper around make_typename_type. When the id is
3198 an unresolved identifier node, we can provide a superior diagnostic
3199 using cp_parser_diagnose_invalid_type_name. */
3201 static tree
3204 {
3205 tree result;
3207 {
3213 }
3215 }
3217 /* This is a wrapper around the
3218 make_{pointer,ptrmem,reference}_declarator functions that decides
3219 which one to call based on the CODE and CLASS_TYPE arguments. The
3220 CODE argument should be one of the values returned by
3221 cp_parser_ptr_operator. */
3224 cp_cv_quals cv_qualifiers,
3226 {
3233 else
3240 }
3242 /* Create a new C++ parser. */
3246 {
3251 /* cp_lexer_new_main is called before doing GC allocation because
3252 cp_lexer_new_main might load a PCH file. */
3255 /* Initialize the binops_by_token so that we can get the tree
3256 directly from the token. */
3264 /* For now, we always accept GNU extensions. */
3267 /* The `>' token is a greater-than operator, not the end of a
3268 template-id. */
3273 /* We are not parsing a constant-expression. */
3278 /* Local variable names are not forbidden. */
3281 /* We are not processing an `extern "C"' declaration. */
3284 /* We are not processing a declarator. */
3287 /* We are not processing a template-argument-list. */
3290 /* We are not in an iteration statement. */
3293 /* We are not in a switch statement. */
3296 /* We are not parsing a type-id inside an expression. */
3299 /* Declarations aren't implicitly extern "C". */
3302 /* String literals should be translated to the execution character set. */
3305 /* We are not parsing a function body. */
3308 /* We can correct until told otherwise. */
3311 /* The unparsed function queue is empty. */
3314 /* There are no classes being defined. */
3317 /* No template parameters apply. */
3321 }
3323 /* Create a cp_lexer structure which will emit the tokens in CACHE
3324 and push it onto the parser's lexer stack. This is used for delayed
3325 parsing of in-class method bodies and default arguments, and should
3326 not be confused with tentative parsing. */
3327 static void
3329 {
3334 /* Move the current source position to that of the first token in the
3335 new lexer. */
3337 }
3339 /* Pop the top lexer off the parser stack. This is never used for the
3340 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3341 static void
3343 {
3348 /* Put the current source position back where it was before this
3349 lexer was pushed. */
3351 }
3353 /* Lexical conventions [gram.lex] */
3355 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3356 identifier. */
3358 static tree
3360 {
3363 /* Look for the identifier. */
3365 /* Return the value. */
3367 }
3369 /* Parse a sequence of adjacent string constants. Returns a
3370 TREE_STRING representing the combined, nul-terminated string
3371 constant. If TRANSLATE is true, translate the string to the
3372 execution character set. If WIDE_OK is true, a wide string is
3373 invalid here.
3375 C++98 [lex.string] says that if a narrow string literal token is
3376 adjacent to a wide string literal token, the behavior is undefined.
3377 However, C99 6.4.5p4 says that this results in a wide string literal.
3378 We follow C99 here, for consistency with the C front end.
3380 This code is largely lifted from lex_string() in c-lex.c.
3382 FUTURE: ObjC++ will need to handle @-strings here. */
3383 static tree
3385 {
3386 tree value;
3393 tree string_tree;
3399 {
3402 }
3405 {
3409 }
3410 else
3411 {
3414 }
3417 /* Try to avoid the overhead of creating and destroying an obstack
3418 for the common case of just one string. */
3421 {
3429 {
3433 }
3434 else
3438 }
3439 else
3440 {
3444 do
3445 {
3447 count++;
3452 {
3455 {
3458 }
3461 {
3466 }
3468 }
3469 else
3473 {
3478 "unsupported non-standard concatenation "
3480 }
3486 {
3490 }
3491 else
3492 {
3496 }
3497 }
3501 }
3504 {
3507 }
3511 {
3516 {
3531 }
3536 {
3540 }
3541 }
3542 else
3543 /* cpp_interpret_string has issued an error. */
3550 }
3552 /* Look up a literal operator with the name and the exact arguments. */
3554 static tree
3556 {
3563 {
3570 {
3573 {
3583 }
3586 }
3587 }
3590 }
3592 /* Parse a user-defined char constant. Returns a call to a user-defined
3593 literal operator taking the character as an argument. */
3595 static tree
3597 {
3605 /* Build up a call to the user-defined operator */
3606 /* Lookup the name we got back from the id-expression. */
3611 {
3616 }
3625 }
3627 /* A subroutine of cp_parser_userdef_numeric_literal to
3628 create a char... template parameter pack from a string node. */
3630 static tree
3632 {
3633 tree charvec;
3639 /* Fill in CHARVEC with all of the parameters. */
3644 /* Build the argument packs. */
3651 }
3653 /* Parse a user-defined numeric constant. returns a call to a user-defined
3654 literal operator. */
3656 static tree
3658 {
3668 /* Look for a literal operator taking the exact type of numeric argument
3669 as the literal value. */
3674 {
3677 {
3680 }
3681 }
3684 /* If the numeric argument didn't work, look for a raw literal
3685 operator taking a const char* argument consisting of the number
3686 in string format. */
3691 {
3694 {
3697 }
3698 }
3701 /* If the raw literal didn't work, look for a non-type template
3702 function with parameter pack char.... Call the function with
3703 template parameter characters representing the number. */
3707 {
3712 {
3715 }
3716 }
3721 }
3723 /* Parse a user-defined string constant. Returns a call to a user-defined
3724 literal operator taking a character pointer and the length of the string
3725 as arguments. */
3727 static tree
3729 {
3738 /* Build up a call to the user-defined operator */
3739 /* Lookup the name we got back from the id-expression. */
3745 {
3749 }
3758 }
3761 /* Basic concepts [gram.basic] */
3763 /* Parse a translation-unit.
3765 translation-unit:
3766 declaration-seq [opt]
3768 Returns TRUE if all went well. */
3770 static bool
3772 {
3773 /* The address of the first non-permanent object on the declarator
3774 obstack. */
3779 /* Create the declarator obstack, if necessary. */
3781 {
3783 /* Create the error declarator. */
3785 /* Create the empty parameter list. */
3787 /* Remember where the base of the declarator obstack lies. */
3789 }
3793 /* If there are no tokens left then all went well. */
3795 {
3796 /* Get rid of the token array; we don't need it any more. */
3800 /* This file might have been a context that's implicitly extern
3801 "C". If so, pop the lang context. (Only relevant for PCH.) */
3803 {
3806 }
3808 /* Finish up. */
3812 }
3813 else
3814 {
3817 }
3819 /* Make sure the declarator obstack was fully cleaned up. */
3823 /* All went well. */
3825 }
3827 /* Expressions [gram.expr] */
3829 /* Parse a primary-expression.
3831 primary-expression:
3832 literal
3833 this
3834 ( expression )
3835 id-expression
3837 GNU Extensions:
3839 primary-expression:
3840 ( compound-statement )
3841 __builtin_va_arg ( assignment-expression , type-id )
3842 __builtin_offsetof ( type-id , offsetof-expression )
3844 C++ Extensions:
3845 __has_nothrow_assign ( type-id )
3846 __has_nothrow_constructor ( type-id )
3847 __has_nothrow_copy ( type-id )
3848 __has_trivial_assign ( type-id )
3849 __has_trivial_constructor ( type-id )
3850 __has_trivial_copy ( type-id )
3851 __has_trivial_destructor ( type-id )
3852 __has_virtual_destructor ( type-id )
3853 __is_abstract ( type-id )
3854 __is_base_of ( type-id , type-id )
3855 __is_class ( type-id )
3856 __is_convertible_to ( type-id , type-id )
3857 __is_empty ( type-id )
3858 __is_enum ( type-id )
3859 __is_final ( type-id )
3860 __is_literal_type ( type-id )
3861 __is_pod ( type-id )
3862 __is_polymorphic ( type-id )
3863 __is_std_layout ( type-id )
3864 __is_trivial ( type-id )
3865 __is_union ( type-id )
3867 Objective-C++ Extension:
3869 primary-expression:
3870 objc-expression
3872 literal:
3873 __null
3875 ADDRESS_P is true iff this expression was immediately preceded by
3876 "&" and therefore might denote a pointer-to-member. CAST_P is true
3877 iff this expression is the target of a cast. TEMPLATE_ARG_P is
3878 true iff this expression is a template argument.
3880 Returns a representation of the expression. Upon return, *IDK
3881 indicates what kind of id-expression (if any) was present. */
3883 static tree
3889 {
3892 /* Assume the primary expression is not an id-expression. */
3895 /* Peek at the next token. */
3898 {
3899 /* literal:
3900 integer-literal
3901 character-literal
3902 floating-literal
3903 string-literal
3904 boolean-literal
3905 pointer-literal
3906 user-defined-literal */
3916 {
3920 }
3921 /* Floating-point literals are only allowed in an integral
3922 constant expression if they are cast to an integral or
3923 enumeration type. */
3927 {
3928 /* CAST_P will be set even in invalid code like "int(2.7 +
3929 ...)". Therefore, we have to check that the next token
3930 is sure to end the cast. */
3932 {
3937 enumerator-definition. */
3939 /* The curly brace at the end of an enum-specifier. */
3941 /* The end of a statement. */
3943 /* The end of the cast-expression. */
3945 /* The end of an array bound. */
3947 /* The closing ">" in a template-argument-list. */
3950 /* C++0x only: A ">>" treated like two ">" tokens,
3951 in a template-argument-list. */
3956 }
3958 /* If we are within a cast, then the constraint that the
3959 cast is to an integral or enumeration type will be
3960 checked at that point. If we are not within a cast, then
3961 this code is invalid. */
3964 }
3983 /* ??? Should wide strings be allowed when parser->translate_strings_p
3984 is false (i.e. in attributes)? If not, we can kill the third
3985 argument to cp_parser_string_literal. */
3991 {
3992 tree expr;
3995 /* Consume the `('. */
3997 /* Within a parenthesized expression, a `>' token is always
3998 the greater-than operator. */
3999 saved_greater_than_is_operator_p
4002 /* If we see `( { ' then we are looking at the beginning of
4003 a GNU statement-expression. */
4006 {
4007 /* Statement-expressions are not allowed by the standard. */
4011 /* And they're not allowed outside of a function-body; you
4012 cannot, for example, write:
4014 int i = ({ int j = 3; j + 1; });
4016 at class or namespace scope. */
4019 {
4021 "statement-expressions are not allowed outside "
4025 }
4026 else
4027 {
4028 /* Start the statement-expression. */
4030 /* Parse the compound-statement. */
4032 /* Finish up. */
4034 }
4035 }
4036 else
4037 {
4038 /* Parse the parenthesized expression. */
4040 /* Let the front end know that this expression was
4041 enclosed in parentheses. This matters in case, for
4042 example, the expression is of the form `A::B', since
4043 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4044 not. */
4046 /* DR 705: Wrapping an unqualified name in parentheses
4047 suppresses arg-dependent lookup. We want to pass back
4048 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4049 (c++/37862), but none of the others. */
4052 }
4053 /* The `>' token might be the end of a template-id or
4054 template-parameter-list now. */
4055 parser->greater_than_is_operator_p
4057 /* Consume the `)'. */
4062 }
4066 /* We have an Objective-C++ message. */
4068 {
4070 /* Don't warn about a failed tentative parse. */
4075 }
4079 /* We have an Objective-C++ string literal. */
4086 {
4087 /* These two are the boolean literals. */
4095 /* The `__null' literal. */
4100 /* The `nullptr' literal. */
4105 /* Recognize the `this' keyword. */
4109 {
4113 }
4114 /* Pointers cannot appear in constant-expressions. */
4119 /* The `operator' keyword can be the beginning of an
4120 id-expression. */
4127 {
4128 non_integral_constant name;
4130 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4131 __func__ are the names of variables -- but they are
4132 treated specially. Therefore, they are handled here,
4133 rather than relying on the generic id-expression logic
4134 below. Grammatically, these names are id-expressions.
4136 Consume the token. */
4140 {
4152 }
4157 /* Look up the name. */
4159 }
4162 {
4163 tree expression;
4164 tree type;
4166 /* The `__builtin_va_arg' construct is used to handle
4167 `va_arg'. Consume the `__builtin_va_arg' token. */
4169 /* Look for the opening `('. */
4171 /* Now, parse the assignment-expression. */
4174 /* Look for the `,'. */
4176 /* Parse the type-id. */
4178 /* Look for the closing `)'. */
4180 /* Using `va_arg' in a constant-expression is not
4181 allowed. */
4183 NIC_VA_ARG))
4186 }
4214 /* Objective-C++ expressions. */
4224 {
4229 }
4233 }
4235 /* An id-expression can start with either an identifier, a
4236 `::' as the beginning of a qualified-id, or the "operator"
4237 keyword. */
4242 {
4243 tree id_expression;
4244 tree decl;
4250 id_expression:
4251 /* Parse the id-expression. */
4252 id_expression
4269 /* If we have a template-id, then no further lookup is
4270 required. If the template-id was for a template-class, we
4271 will sometimes have a TYPE_DECL at this point. */
4275 /* Look up the name. */
4276 else
4277 {
4278 tree ambiguous_decls;
4280 /* If we already know that this lookup is ambiguous, then
4281 we've already issued an error message; there's no reason
4282 to check again. */
4285 {
4288 }
4291 none_type,
4292 template_p,
4297 /* If the lookup was ambiguous, an error will already have
4298 been issued. */
4302 /* In Objective-C++, we may have an Objective-C 2.0
4303 dot-syntax for classes here. */
4308 {
4309 tree component;
4316 }
4318 /* In Objective-C++, an instance variable (ivar) may be preferred
4319 to whatever cp_parser_lookup_name() found. */
4322 /* If name lookup gives us a SCOPE_REF, then the
4323 qualifying scope was dependent. */
4325 {
4326 /* At this point, we do not know if DECL is a valid
4327 integral constant expression. We assume that it is
4328 in fact such an expression, so that code like:
4330 template <int N> struct A {
4331 int a[B<N>::i];
4332 };
4334 is accepted. At template-instantiation time, we
4335 will check that B<N>::i is actually a constant. */
4337 }
4338 /* Check to see if DECL is a local variable in a context
4339 where that is forbidden. */
4342 {
4343 /* It might be that we only found DECL because we are
4344 trying to be generous with pre-ISO scoping rules.
4345 For example, consider:
4347 int i;
4348 void g() {
4349 for (int i = 0; i < 10; ++i) {}
4350 extern void f(int j = i);
4351 }
4353 Here, name look up will originally find the out
4354 of scope `i'. We need to issue a warning message,
4355 but then use the global `i'. */
4358 {
4361 decl);
4363 }
4364 }
4365 }
4367 decl = (finish_id_expression
4369 idk,
4374 template_arg_p,
4380 }
4382 /* Anything else is an error. */
4386 }
4387 }
4389 /* Parse an id-expression.
4391 id-expression:
4392 unqualified-id
4393 qualified-id
4395 qualified-id:
4396 :: [opt] nested-name-specifier template [opt] unqualified-id
4397 :: identifier
4398 :: operator-function-id
4399 :: template-id
4401 Return a representation of the unqualified portion of the
4402 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4403 a `::' or nested-name-specifier.
4405 Often, if the id-expression was a qualified-id, the caller will
4406 want to make a SCOPE_REF to represent the qualified-id. This
4407 function does not do this in order to avoid wastefully creating
4408 SCOPE_REFs when they are not required.
4410 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4411 `template' keyword.
4413 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4414 uninstantiated templates.
4416 If *TEMPLATE_P is non-NULL, it is set to true iff the
4417 `template' keyword is used to explicitly indicate that the entity
4418 named is a template.
4420 If DECLARATOR_P is true, the id-expression is appearing as part of
4421 a declarator, rather than as part of an expression. */
4423 static tree
4430 {
4434 /* Assume the `template' keyword was not used. */
4438 /* Look for the optional `::' operator. */
4439 global_scope_p
4442 /* Look for the optional nested-name-specifier. */
4443 nested_name_specifier_p
4446 check_dependency_p,
4448 declarator_p)
4450 /* If there is a nested-name-specifier, then we are looking at
4451 the first qualified-id production. */
4453 {
4454 tree saved_scope;
4455 tree saved_object_scope;
4456 tree saved_qualifying_scope;
4457 tree unqualified_id;
4460 /* See if the next token is the `template' keyword. */
4464 /* Name lookup we do during the processing of the
4465 unqualified-id might obliterate SCOPE. */
4469 /* Process the final unqualified-id. */
4471 check_dependency_p,
4472 declarator_p,
4474 /* Restore the SAVED_SCOPE for our caller. */
4480 }
4481 /* Otherwise, if we are in global scope, then we are looking at one
4482 of the other qualified-id productions. */
4484 {
4486 tree id;
4488 /* Peek at the next token. */
4491 /* If it's an identifier, and the next token is not a "<", then
4492 we can avoid the template-id case. This is an optimization
4493 for this common case. */
4495 && !cp_parser_nth_token_starts_template_argument_list_p
4500 /* Try a template-id. */
4504 declarator_p);
4505 /* If that worked, we're done. */
4509 /* Peek at the next token. (Changes in the token buffer may
4510 have invalidated the pointer obtained above.) */
4514 {
4521 /* Fall through. */
4526 }
4527 }
4528 else
4531 declarator_p,
4532 optional_p);
4533 }
4535 /* Parse an unqualified-id.
4537 unqualified-id:
4538 identifier
4539 operator-function-id
4540 conversion-function-id
4541 ~ class-name
4542 template-id
4544 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4545 keyword, in a construct like `A::template ...'.
4547 Returns a representation of unqualified-id. For the `identifier'
4548 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4549 production a BIT_NOT_EXPR is returned; the operand of the
4550 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4551 other productions, see the documentation accompanying the
4552 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4553 names are looked up in uninstantiated templates. If DECLARATOR_P
4554 is true, the unqualified-id is appearing as part of a declarator,
4555 rather than as part of an expression. */
4557 static tree
4563 {
4566 /* Peek at the next token. */
4570 {
4572 {
4573 tree id;
4575 /* We don't know yet whether or not this will be a
4576 template-id. */
4578 /* Try a template-id. */
4580 check_dependency_p,
4581 declarator_p);
4582 /* If it worked, we're done. */
4585 /* Otherwise, it's an ordinary identifier. */
4587 }
4591 check_dependency_p,
4592 declarator_p);
4595 {
4596 tree type_decl;
4597 tree qualifying_scope;
4598 tree object_scope;
4599 tree scope;
4602 /* Consume the `~' token. */
4604 /* Parse the class-name. The standard, as written, seems to
4605 say that:
4607 template <typename T> struct S { ~S (); };
4608 template <typename T> S<T>::~S() {}
4610 is invalid, since `~' must be followed by a class-name, but
4611 `S<T>' is dependent, and so not known to be a class.
4612 That's not right; we need to look in uninstantiated
4613 templates. A further complication arises from:
4615 template <typename T> void f(T t) {
4616 t.T::~T();
4617 }
4619 Here, it is not possible to look up `T' in the scope of `T'
4620 itself. We must look in both the current scope, and the
4621 scope of the containing complete expression.
4623 Yet another issue is:
4625 struct S {
4626 int S;
4627 ~S();
4628 };
4630 S::~S() {}
4632 The standard does not seem to say that the `S' in `~S'
4633 should refer to the type `S' and not the data member
4634 `S::S'. */
4636 /* DR 244 says that we look up the name after the "~" in the
4637 same scope as we looked up the qualifying name. That idea
4638 isn't fully worked out; it's more complicated than that. */
4643 /* Check for invalid scopes. */
4645 {
4649 }
4651 {
4655 scope);
4660 }
4663 /* If the name is of the form "X::~X" it's OK even if X is a
4664 typedef. */
4673 {
4676 }
4678 /* If there was an explicit qualification (S::~T), first look
4679 in the scope given by the qualification (i.e., S).
4681 Note: in the calls to cp_parser_class_name below we pass
4682 typename_type so that lookup finds the injected-class-name
4683 rather than the constructor. */
4687 {
4692 typename_type,
4695 declarator_p);
4698 }
4699 /* In "N::S::~S", look in "N" as well. */
4701 {
4706 type_decl
4710 typename_type,
4713 declarator_p);
4716 }
4717 /* In "p->S::~T", look in the scope given by "*p" as well. */
4719 {
4724 type_decl
4728 typename_type,
4731 declarator_p);
4734 }
4735 /* Look in the surrounding context. */
4737 {
4743 type_decl
4747 typename_type,
4750 declarator_p);
4753 {
4754 /* We couldn't find a type with this name, so just accept
4755 it and check for a match at instantiation time. */
4760 }
4761 }
4762 /* If an error occurred, assume that the name of the
4763 destructor is the same as the name of the qualifying
4764 class. That allows us to keep parsing after running
4765 into ill-formed destructor names. */
4771 /* Check that destructor name and scope match. */
4773 {
4780 }
4782 /* [class.dtor]
4784 A typedef-name that names a class shall not be used as the
4785 identifier in the declarator for a destructor declaration. */
4792 type_decl);
4795 }
4799 {
4800 tree id;
4802 /* This could be a template-id, so we try that first. */
4804 /* Try a template-id. */
4807 declarator_p);
4808 /* If that worked, we're done. */
4811 /* We still don't know whether we're looking at an
4812 operator-function-id or a conversion-function-id. */
4814 /* Try an operator-function-id. */
4816 /* If that didn't work, try a conversion-function-id. */
4820 {
4821 /* 17.6.3.3.5 */
4826 }
4829 }
4830 /* Fall through. */
4837 }
4838 }
4840 /* Parse an (optional) nested-name-specifier.
4842 nested-name-specifier: [C++98]
4843 class-or-namespace-name :: nested-name-specifier [opt]
4844 class-or-namespace-name :: template nested-name-specifier [opt]
4846 nested-name-specifier: [C++0x]
4847 type-name ::
4848 namespace-name ::
4849 nested-name-specifier identifier ::
4850 nested-name-specifier template [opt] simple-template-id ::
4852 PARSER->SCOPE should be set appropriately before this function is
4853 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
4854 effect. TYPE_P is TRUE if we non-type bindings should be ignored
4855 in name lookups.
4857 Sets PARSER->SCOPE to the class (TYPE) or namespace
4858 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
4859 it unchanged if there is no nested-name-specifier. Returns the new
4860 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
4862 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
4863 part of a declaration and/or decl-specifier. */
4865 static tree
4871 {
4876 /* Remember where the nested-name-specifier starts. */
4878 {
4881 }
4884 {
4885 tree new_scope;
4886 tree old_scope;
4887 tree saved_qualifying_scope;
4890 /* Spot cases that cannot be the beginning of a
4891 nested-name-specifier. */
4894 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
4895 the already parsed nested-name-specifier. */
4897 {
4898 /* Grab the nested-name-specifier and continue the loop. */
4900 /* If we originally encountered this nested-name-specifier
4901 with IS_DECLARATION set to false, we will not have
4902 resolved TYPENAME_TYPEs, so we must do so here. */
4905 {
4910 }
4913 }
4915 /* Spot cases that cannot be the beginning of a
4916 nested-name-specifier. On the second and subsequent times
4917 through the loop, we look for the `template' keyword. */
4919 ;
4920 /* A template-id can start a nested-name-specifier. */
4922 ;
4923 /* DR 743: decltype can be used in a nested-name-specifier. */
4925 ;
4926 else
4927 {
4928 /* If the next token is not an identifier, then it is
4929 definitely not a type-name or namespace-name. */
4932 /* If the following token is neither a `<' (to begin a
4933 template-id), nor a `::', then we are not looking at a
4934 nested-name-specifier. */
4940 {
4944 }
4947 && !cp_parser_nth_token_starts_template_argument_list_p
4950 }
4952 /* The nested-name-specifier is optional, so we parse
4953 tentatively. */
4956 /* Look for the optional `template' keyword, if this isn't the
4957 first time through the loop. */
4960 else
4963 /* Save the old scope since the name lookup we are about to do
4964 might destroy it. */
4967 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
4968 look up names in "X<T>::I" in order to determine that "Y" is
4969 a template. So, if we have a typename at this point, we make
4970 an effort to look through it. */
4972 && !typename_keyword_p
4977 /* Parse the qualifying entity. */
4978 new_scope
4980 typename_keyword_p,
4981 template_keyword_p,
4982 check_dependency_p,
4983 type_p,
4984 is_declaration);
4985 /* Look for the `::' token. */
4988 /* If we found what we wanted, we keep going; otherwise, we're
4989 done. */
4991 {
4994 /* Restore the OLD_SCOPE since it was valid before the
4995 failed attempt at finding the last
4996 class-or-namespace-name. */
5000 /* If the next token is a decltype, and the one after that is a
5001 `::', then the decltype has failed to resolve to a class or
5002 enumeration type. Give this error even when parsing
5003 tentatively since it can't possibly be valid--and we're going
5004 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5005 won't get another chance.*/
5009 {
5016 /* As below. */
5019 }
5023 /* If the next token is an identifier, and the one after
5024 that is a `::', then any valid interpretation would have
5025 found a class-or-namespace-name. */
5031 {
5034 {
5036 {
5037 tree decl;
5038 tree ambiguous_decls;
5041 none_type,
5050 decl);
5052 {
5058 }
5059 else
5060 {
5062 cp_parser_name_lookup_error
5065 else
5066 cp_parser_name_lookup_error
5069 }
5070 }
5073 /* Treat this as a successful nested-name-specifier
5074 due to:
5076 [basic.lookup.qual]
5078 If the name found is not a class-name (clause
5079 _class_) or namespace-name (_namespace.def_), the
5080 program is ill-formed. */
5082 }
5084 }
5086 }
5087 /* We've found one valid nested-name-specifier. */
5089 /* Name lookup always gives us a DECL. */
5092 /* Uses of "template" must be followed by actual templates. */
5104 new_scope);
5105 /* If it is a class scope, try to complete it; we are about to
5106 be looking up names inside the class. */
5108 /* Since checking types for dependency can be expensive,
5109 avoid doing it if the type is already complete. */
5111 /* Do not try to complete dependent types. */
5113 {
5115 /* If it is a typedef to current class, use the current
5116 class instead, as the typedef won't have any names inside
5117 it yet. */
5121 }
5122 /* Make sure we look in the right scope the next time through
5123 the loop. */
5125 }
5127 /* If parsing tentatively, replace the sequence of tokens that makes
5128 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5129 token. That way, should we re-parse the token stream, we will
5130 not have to repeat the effort required to do the parse, nor will
5131 we issue duplicate error messages. */
5133 {
5137 /* Reset the contents of the START token. */
5139 /* Retrieve any deferred checks. Do not pop this access checks yet
5140 so the memory will not be reclaimed during token replacing below. */
5148 /* Purge all subsequent tokens. */
5150 }
5156 }
5158 /* Parse a nested-name-specifier. See
5159 cp_parser_nested_name_specifier_opt for details. This function
5160 behaves identically, except that it will an issue an error if no
5161 nested-name-specifier is present. */
5163 static tree
5169 {
5170 tree scope;
5172 /* Look for the nested-name-specifier. */
5174 typename_keyword_p,
5175 check_dependency_p,
5176 type_p,
5177 is_declaration);
5178 /* If it was not present, issue an error message. */
5180 {
5183 }
5186 }
5188 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5189 this is either a class-name or a namespace-name (which corresponds
5190 to the class-or-namespace-name production in the grammar). For
5191 C++0x, it can also be a type-name that refers to an enumeration
5192 type or a simple-template-id.
5194 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5195 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5196 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5197 TYPE_P is TRUE iff the next name should be taken as a class-name,
5198 even the same name is declared to be another entity in the same
5199 scope.
5201 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5202 specified by the class-or-namespace-name. If neither is found the
5203 ERROR_MARK_NODE is returned. */
5205 static tree
5212 {
5213 tree saved_scope;
5214 tree saved_qualifying_scope;
5215 tree saved_object_scope;
5216 tree scope;
5220 /* DR 743: decltype can appear in a nested-name-specifier. */
5222 {
5226 {
5229 }
5233 }
5235 /* Before we try to parse the class-name, we must save away the
5236 current PARSER->SCOPE since cp_parser_class_name will destroy
5237 it. */
5241 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5242 there is no need to look for a namespace-name. */
5243 only_class_p = template_keyword_p
5248 typename_keyword_p,
5249 template_keyword_p,
5251 check_dependency_p,
5253 is_declaration);
5255 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5259 {
5260 /* Restore the saved scope. */
5265 /* Parse tentatively. */
5268 /* Parse a type-name */
5271 /* "If the name found does not designate a namespace or a class,
5272 enumeration, or dependent type, the program is ill-formed."
5274 We cover classes and dependent types above and namespaces below,
5275 so this code is only looking for enums. */
5281 }
5282 /* If that didn't work, try for a namespace-name. */
5284 {
5285 /* Restore the saved scope. */
5289 /* If we are not looking at an identifier followed by the scope
5290 resolution operator, then this is not part of a
5291 nested-name-specifier. (Note that this function is only used
5292 to parse the components of a nested-name-specifier.) */
5297 }
5300 }
5302 /* Parse a postfix-expression.
5304 postfix-expression:
5305 primary-expression
5306 postfix-expression [ expression ]
5307 postfix-expression ( expression-list [opt] )
5308 simple-type-specifier ( expression-list [opt] )
5309 typename :: [opt] nested-name-specifier identifier
5310 ( expression-list [opt] )
5311 typename :: [opt] nested-name-specifier template [opt] template-id
5312 ( expression-list [opt] )
5313 postfix-expression . template [opt] id-expression
5314 postfix-expression -> template [opt] id-expression
5315 postfix-expression . pseudo-destructor-name
5316 postfix-expression -> pseudo-destructor-name
5317 postfix-expression ++
5318 postfix-expression --
5319 dynamic_cast < type-id > ( expression )
5320 static_cast < type-id > ( expression )
5321 reinterpret_cast < type-id > ( expression )
5322 const_cast < type-id > ( expression )
5323 typeid ( expression )
5324 typeid ( type-id )
5326 GNU Extension:
5328 postfix-expression:
5329 ( type-id ) { initializer-list , [opt] }
5331 This extension is a GNU version of the C99 compound-literal
5332 construct. (The C99 grammar uses `type-name' instead of `type-id',
5333 but they are essentially the same concept.)
5335 If ADDRESS_P is true, the postfix expression is the operand of the
5336 `&' operator. CAST_P is true if this expression is the target of a
5337 cast.
5339 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5340 class member access expressions [expr.ref].
5342 Returns a representation of the expression. */
5344 static tree
5348 {
5355 /* Peek at the next token. */
5357 /* Some of the productions are determined by keywords. */
5360 {
5365 {
5366 tree type;
5367 tree expression;
5370 /* All of these can be handled in the same way from the point
5371 of view of parsing. Begin by consuming the token
5372 identifying the cast. */
5375 /* New types cannot be defined in the cast. */
5377 parser->type_definition_forbidden_message
5380 /* Look for the opening `<'. */
5382 /* Parse the type to which we are casting. */
5384 /* Look for the closing `>'. */
5386 /* Restore the old message. */
5389 /* And the expression which is being cast. */
5394 /* Only type conversions to integral or enumeration types
5395 can be used in constant-expressions. */
5401 {
5403 postfix_expression
5407 postfix_expression
5411 postfix_expression
5413 tf_warning_or_error);
5416 postfix_expression
5421 }
5422 }
5426 {
5427 tree type;
5431 /* Consume the `typeid' token. */
5433 /* Look for the `(' token. */
5435 /* Types cannot be defined in a `typeid' expression. */
5437 parser->type_definition_forbidden_message
5439 /* We can't be sure yet whether we're looking at a type-id or an
5440 expression. */
5442 /* Try a type-id first. */
5447 /* Look for the `)' token. Otherwise, we can't be sure that
5448 we're not looking at an expression: consider `typeid (int
5449 (3))', for example. */
5451 /* If all went well, simply lookup the type-id. */
5454 /* Otherwise, fall back to the expression variant. */
5455 else
5456 {
5457 tree expression;
5459 /* Look for an expression. */
5461 /* Compute its typeid. */
5463 /* Look for the `)' token. */
5465 }
5466 /* Restore the saved message. */
5468 /* `typeid' may not appear in an integral constant expression. */
5471 }
5475 {
5476 tree type;
5477 /* The syntax permitted here is the same permitted for an
5478 elaborated-type-specifier. */
5483 }
5487 {
5488 tree type;
5490 /* If the next thing is a simple-type-specifier, we may be
5491 looking at a functional cast. We could also be looking at
5492 an id-expression. So, we try the functional cast, and if
5493 that doesn't work we fall back to the primary-expression. */
5495 /* Look for the simple-type-specifier. */
5498 CP_PARSER_FLAGS_NONE);
5499 /* Parse the cast itself. */
5501 postfix_expression
5503 /* If that worked, we're done. */
5507 /* If the functional-cast didn't work out, try a
5508 compound-literal. */
5511 {
5516 /* Consume the `('. */
5518 /* Parse the type. */
5523 /* Look for the `)'. */
5525 /* Look for the `{'. */
5527 /* If things aren't going well, there's no need to
5528 keep going. */
5530 {
5532 /* Parse the initializer-list. */
5533 initializer_list
5535 /* Allow a trailing `,'. */
5538 /* Look for the final `}'. */
5540 }
5541 /* If that worked, we're definitely looking at a
5542 compound-literal expression. */
5544 {
5545 /* Warn the user that a compound literal is not
5546 allowed in standard C++. */
5548 /* For simplicity, we disallow compound literals in
5549 constant-expressions. We could
5550 allow compound literals of integer type, whose
5551 initializer was a constant, in constant
5552 expressions. Permitting that usage, as a further
5553 extension, would not change the meaning of any
5554 currently accepted programs. (Of course, as
5555 compound literals are not part of ISO C++, the
5556 standard has nothing to say.) */
5558 NIC_NCC))
5559 {
5562 }
5563 /* Form the representation of the compound-literal. */
5564 postfix_expression
5565 = (finish_compound_literal
5567 initializer_list),
5568 tf_warning_or_error));
5570 }
5571 }
5573 /* It must be a primary-expression. */
5574 postfix_expression
5578 }
5580 }
5582 /* Keep looping until the postfix-expression is complete. */
5584 {
5588 /* It is not a Koenig lookup function call. */
5589 postfix_expression
5592 /* Peek at the next token. */
5596 {
5598 postfix_expression
5600 postfix_expression,
5607 /* postfix-expression ( expression-list [opt] ) */
5608 {
5617 is_builtin_constant_p
5620 {
5621 /* The whole point of __builtin_constant_p is to allow
5622 non-constant expressions to appear as arguments. */
5623 saved_integral_constant_expression_p
5625 saved_non_integral_constant_expression_p
5628 }
5629 args = (cp_parser_parenthesized_expression_list
5634 {
5635 parser->integral_constant_expression_p
5637 parser->non_integral_constant_expression_p
5639 }
5642 {
5645 }
5647 /* Function calls are not permitted in
5648 constant-expressions. */
5651 NIC_FUNC_CALL))
5652 {
5656 }
5661 {
5663 {
5665 {
5668 postfix_expression
5671 tf_warning_or_error);
5672 }
5673 else
5674 postfix_expression
5676 }
5677 /* We do not perform argument-dependent lookup if
5678 normal lookup finds a non-function, in accordance
5679 with the expected resolution of DR 218. */
5682 {
5686 /* Do not do argument dependent lookup if regular
5687 lookup finds a member function or a block-scope
5688 function declaration. [basic.lookup.argdep]/3 */
5691 {
5694 postfix_expression
5697 tf_warning_or_error);
5698 }
5699 }
5700 }
5703 {
5713 {
5714 postfix_expression
5718 }
5721 {
5722 postfix_expression
5723 = (build_new_method_call
5729 tf_warning_or_error));
5730 }
5731 else
5732 postfix_expression
5736 tf_warning_or_error);
5737 }
5741 postfix_expression = (build_offset_ref_call_from_tree
5744 /* A call to a static class member, or a namespace-scope
5745 function. */
5746 postfix_expression
5749 koenig_p,
5750 tf_warning_or_error);
5751 else
5752 /* All other function calls. */
5753 postfix_expression
5756 koenig_p,
5757 tf_warning_or_error);
5759 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
5763 }
5768 /* postfix-expression . template [opt] id-expression
5769 postfix-expression . pseudo-destructor-name
5770 postfix-expression -> template [opt] id-expression
5771 postfix-expression -> pseudo-destructor-name */
5773 /* Consume the `.' or `->' operator. */
5776 postfix_expression
5778 postfix_expression,
5786 /* postfix-expression ++ */
5787 /* Consume the `++' token. */
5789 /* Generate a representation for the complete expression. */
5790 postfix_expression
5792 POSTINCREMENT_EXPR);
5793 /* Increments may not appear in constant-expressions. */
5801 /* postfix-expression -- */
5802 /* Consume the `--' token. */
5804 /* Generate a representation for the complete expression. */
5805 postfix_expression
5807 POSTDECREMENT_EXPR);
5808 /* Decrements may not appear in constant-expressions. */
5820 else
5822 }
5823 }
5825 /* We should never get here. */
5828 }
5830 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5831 by cp_parser_builtin_offsetof. We're looking for
5833 postfix-expression [ expression ]
5834 postfix-expression [ braced-init-list ] (C++11)
5836 FOR_OFFSETOF is set if we're being called in that context, which
5837 changes how we deal with integer constant expressions. */
5839 static tree
5841 tree postfix_expression,
5843 {
5844 tree index;
5846 /* Consume the `[' token. */
5849 /* Parse the index expression. */
5850 /* ??? For offsetof, there is a question of what to allow here. If
5851 offsetof is not being used in an integral constant expression context,
5852 then we *could* get the right answer by computing the value at runtime.
5853 If we are in an integral constant expression context, then we might
5854 could accept any constant expression; hard to say without analysis.
5855 Rather than open the barn door too wide right away, allow only integer
5856 constant expressions here. */
5859 else
5860 {
5862 {
5866 }
5867 else
5869 }
5871 /* Look for the closing `]'. */
5874 /* Build the ARRAY_REF. */
5877 /* When not doing offsetof, array references are not permitted in
5878 constant-expressions. */
5884 }
5886 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5887 by cp_parser_builtin_offsetof. We're looking for
5889 postfix-expression . template [opt] id-expression
5890 postfix-expression . pseudo-destructor-name
5891 postfix-expression -> template [opt] id-expression
5892 postfix-expression -> pseudo-destructor-name
5894 FOR_OFFSETOF is set if we're being called in that context. That sorta
5895 limits what of the above we'll actually accept, but nevermind.
5896 TOKEN_TYPE is the "." or "->" token, which will already have been
5897 removed from the stream. */
5899 static tree
5902 tree postfix_expression,
5904 location_t location)
5905 {
5906 tree name;
5911 /* If this is a `->' operator, dereference the pointer. */
5914 /* Check to see whether or not the expression is type-dependent. */
5916 /* The identifier following the `->' or `.' is not qualified. */
5922 /* Enter the scope corresponding to the type of the object
5923 given by the POSTFIX_EXPRESSION. */
5925 {
5927 /* According to the standard, no expression should ever have
5928 reference type. Unfortunately, we do not currently match
5929 the standard in this respect in that our internal representation
5930 of an expression may have reference type even when the standard
5931 says it does not. Therefore, we have to manually obtain the
5932 underlying type here. */
5934 /* The type of the POSTFIX_EXPRESSION must be complete. */
5936 {
5938 postfix_expression);
5940 }
5941 /* Unlike the object expression in other contexts, *this is not
5942 required to be of complete type for purposes of class member
5943 access (5.2.5) outside the member function body. */
5947 /* Let the name lookup machinery know that we are processing a
5948 class member access expression. */
5950 /* If something went wrong, we want to be able to discern that case,
5951 as opposed to the case where there was no SCOPE due to the type
5952 of expression being dependent. */
5955 /* If the SCOPE was erroneous, make the various semantic analysis
5956 functions exit quickly -- and without issuing additional error
5957 messages. */
5960 }
5962 /* Assume this expression is not a pseudo-destructor access. */
5965 /* If the SCOPE is a scalar type, then, if this is a valid program,
5966 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
5967 is type dependent, it can be pseudo-destructor-name or something else.
5968 Try to parse it as pseudo-destructor-name first. */
5970 {
5971 tree s;
5972 tree type;
5975 /* Parse the pseudo-destructor-name. */
5984 {
5986 postfix_expression
5989 }
5990 }
5993 {
5994 /* If the SCOPE is not a scalar type, we are looking at an
5995 ordinary class member access expression, rather than a
5996 pseudo-destructor-name. */
5999 /* Parse the id-expression. */
6000 name = (cp_parser_id_expression
6007 /* In general, build a SCOPE_REF if the member name is qualified.
6008 However, if the name was not dependent and has already been
6009 resolved; there is no need to build the SCOPE_REF. For example;
6011 struct X { void f(); };
6012 template <typename T> void f(T* t) { t->X::f(); }
6014 Even though "t" is dependent, "X::f" is not and has been resolved
6015 to a BASELINK; there is no need to include scope information. */
6017 /* But we do need to remember that there was an explicit scope for
6018 virtual function calls. */
6022 /* If the name is a template-id that names a type, we will get a
6023 TYPE_DECL here. That is invalid code. */
6025 {
6028 }
6029 else
6030 {
6032 {
6034 {
6038 }
6039 else
6042 name,
6043 template_p);
6047 }
6049 adjust_result_of_qualified_name_lookup
6051 postfix_expression
6053 template_p,
6054 tf_warning_or_error);
6055 }
6056 }
6058 /* We no longer need to look up names in the scope of the object on
6059 the left-hand side of the `.' or `->' operator. */
6062 /* Outside of offsetof, these operators may not appear in
6063 constant-expressions. */
6065 && (cp_parser_non_integral_constant_expression
6070 }
6072 /* Parse a parenthesized expression-list.
6074 expression-list:
6075 assignment-expression
6076 expression-list, assignment-expression
6078 attribute-list:
6079 expression-list
6080 identifier
6081 identifier, expression-list
6083 CAST_P is true if this expression is the target of a cast.
6085 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6086 argument pack.
6088 Returns a vector of trees. Each element is a representation of an
6089 assignment-expression. NULL is returned if the ( and or ) are
6090 missing. An empty, but allocated, vector is returned on no
6091 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6092 if we are parsing an attribute list for an attribute that wants a
6093 plain identifier argument, normal_attr for an attribute that wants
6094 an expression, or non_attr if we aren't parsing an attribute list. If
6095 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6096 not all of the expressions in the list were constant. */
6104 {
6110 /* Assume all the expressions will be constant. */
6119 /* Within a parenthesized expression, a `>' token is always
6120 the greater-than operator. */
6121 saved_greater_than_is_operator_p
6125 /* Consume expressions until there are no more. */
6128 {
6129 tree expr;
6131 /* At the beginning of attribute lists, check to see if the
6132 next token is an identifier. */
6135 {
6138 /* Consume the identifier. */
6140 /* Save the identifier. */
6142 }
6143 else
6144 {
6147 /* Parse the next assignment-expression. */
6149 {
6150 /* A braced-init-list. */
6155 }
6157 {
6158 expr = (cp_parser_constant_expression
6163 }
6164 else
6170 /* If we have an ellipsis, then this is an expression
6171 expansion. */
6174 {
6175 /* Consume the `...'. */
6178 /* Build the argument pack. */
6180 }
6182 /* Add it to the list. We add error_mark_node
6183 expressions to the list, so that we can still tell if
6184 the correct form for a parenthesized expression-list
6185 is found. That gives better errors. */
6190 }
6192 /* After the first item, attribute lists look the same as
6193 expression lists. */
6196 get_comma:;
6197 /* If the next token isn't a `,', then we are done. */
6201 /* Otherwise, consume the `,' and keep going. */
6203 }
6206 {
6209 skip_comma:;
6210 /* We try and resync to an unnested comma, as that will give the
6211 user better diagnostics. */
6219 {
6220 parser->greater_than_is_operator_p
6223 }
6224 }
6226 parser->greater_than_is_operator_p
6233 }
6235 /* Parse a pseudo-destructor-name.
6237 pseudo-destructor-name:
6238 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6239 :: [opt] nested-name-specifier template template-id :: ~ type-name
6240 :: [opt] nested-name-specifier [opt] ~ type-name
6242 If either of the first two productions is used, sets *SCOPE to the
6243 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6244 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6245 or ERROR_MARK_NODE if the parse fails. */
6247 static void
6251 {
6254 /* Assume that things will not work out. */
6257 /* Look for the optional `::' operator. */
6259 /* Look for the optional nested-name-specifier. */
6260 nested_name_specifier_p
6267 /* Now, if we saw a nested-name-specifier, we might be doing the
6268 second production. */
6271 {
6272 /* Consume the `template' keyword. */
6274 /* Parse the template-id. */
6279 /* Look for the `::' token. */
6281 }
6282 /* If the next token is not a `~', then there might be some
6283 additional qualification. */
6285 {
6286 /* At this point, we're looking for "type-name :: ~". The type-name
6287 must not be a class-name, since this is a pseudo-destructor. So,
6288 it must be either an enum-name, or a typedef-name -- both of which
6289 are just identifiers. So, we peek ahead to check that the "::"
6290 and "~" tokens are present; if they are not, then we can avoid
6291 calling type_name. */
6295 {
6298 }
6300 /* Look for the type-name. */
6305 /* Look for the `::' token. */
6307 }
6308 else
6311 /* Look for the `~'. */
6314 /* Once we see the ~, this has to be a pseudo-destructor. */
6318 /* Look for the type-name again. We are not responsible for
6319 checking that it matches the first type-name. */
6321 }
6323 /* Parse a unary-expression.
6325 unary-expression:
6326 postfix-expression
6327 ++ cast-expression
6328 -- cast-expression
6329 unary-operator cast-expression
6330 sizeof unary-expression
6331 sizeof ( type-id )
6332 alignof ( type-id ) [C++0x]
6333 new-expression
6334 delete-expression
6336 GNU Extensions:
6338 unary-expression:
6339 __extension__ cast-expression
6340 __alignof__ unary-expression
6341 __alignof__ ( type-id )
6342 alignof unary-expression [C++0x]
6343 __real__ cast-expression
6344 __imag__ cast-expression
6345 && identifier
6347 ADDRESS_P is true iff the unary-expression is appearing as the
6348 operand of the `&' operator. CAST_P is true if this expression is
6349 the target of a cast.
6351 Returns a representation of the expression. */
6353 static tree
6356 {
6360 /* Peek at the next token. */
6362 /* Some keywords give away the kind of expression. */
6364 {
6368 {
6371 {
6372 tree operand;
6376 /* Consume the token. */
6378 /* Parse the operand. */
6383 else
6384 {
6385 /* ISO C++ defines alignof only with types, not with
6386 expressions. So pedwarn if alignof is used with a non-
6387 type expression. However, __alignof__ is ok. */
6390 "ISO C++ does not allow %<alignof%> "
6394 }
6395 }
6404 {
6405 /* The saved value of the PEDANTIC flag. */
6407 tree expr;
6409 /* Save away the PEDANTIC flag. */
6411 /* Parse the cast-expression. */
6413 /* Restore the PEDANTIC flag. */
6417 }
6421 {
6422 tree expression;
6424 /* Consume the `__real__' or `__imag__' token. */
6426 /* Parse the cast-expression. */
6428 /* Create the complete representation. */
6431 expression,
6432 tf_warning_or_error);
6433 }
6441 {
6442 tree expr;
6452 parser->type_definition_forbidden_message
6455 saved_integral_constant_expression_p
6457 saved_non_integral_constant_expression_p
6461 saved_greater_than_is_operator_p
6471 parser->greater_than_is_operator_p
6474 parser->integral_constant_expression_p
6476 parser->non_integral_constant_expression_p
6483 }
6487 }
6488 }
6490 /* Look for the `:: new' and `:: delete', which also signal the
6491 beginning of a new-expression, or delete-expression,
6492 respectively. If the next token is `::', then it might be one of
6493 these. */
6495 {
6498 /* See if the token after the `::' is one of the keywords in
6499 which we're interested. */
6501 /* If it's `new', we have a new-expression. */
6504 /* Similarly, for `delete'. */
6507 }
6509 /* Look for a unary operator. */
6511 /* The `++' and `--' operators can be handled similarly, even though
6512 they are not technically unary-operators in the grammar. */
6514 {
6519 /* Handle the GNU address-of-label extension. */
6522 {
6523 tree identifier;
6524 tree expression;
6527 /* Consume the '&&' token. */
6529 /* Look for the identifier. */
6531 /* Create an expression representing the address. */
6534 NIC_ADDR_LABEL))
6537 }
6538 }
6540 {
6541 tree cast_expression;
6545 /* Consume the operator token. */
6547 /* Parse the cast-expression. */
6548 cast_expression
6552 /* Now, build an appropriate representation. */
6554 {
6558 tf_warning_or_error);
6563 /* Fall through. */
6566 tf_warning_or_error);
6573 /* Fall through. */
6582 }
6586 non_constant_p))
6590 }
6594 pidk);
6595 }
6597 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
6598 unary-operator, the corresponding tree code is returned. */
6600 static enum tree_code
6602 {
6604 {
6625 }
6626 }
6628 /* Parse a new-expression.
6630 new-expression:
6631 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
6632 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
6634 Returns a representation of the expression. */
6636 static tree
6638 {
6641 tree type;
6643 tree nelts;
6644 tree ret;
6646 /* Look for the optional `::' operator. */
6647 global_scope_p
6651 /* Look for the `new' operator. */
6653 /* There's no easy way to tell a new-placement from the
6654 `( type-id )' construct. */
6656 /* Look for a new-placement. */
6658 /* If that didn't work out, there's no new-placement. */
6660 {
6664 }
6666 /* If the next token is a `(', then we have a parenthesized
6667 type-id. */
6669 {
6673 /* Consume the `('. */
6676 /* Parse the type-id. */
6677 parser->type_definition_forbidden_message
6682 /* Look for the closing `)'. */
6685 /* There should not be a direct-new-declarator in this production,
6686 but GCC used to allowed this, so we check and emit a sensible error
6687 message for this case. */
6689 {
6695 }
6697 }
6698 /* Otherwise, there must be a new-type-id. */
6699 else
6702 /* If the next token is a `(' or '{', then we have a new-initializer. */
6706 else
6709 /* A new-expression may not appear in an integral constant
6710 expression. */
6713 else
6714 {
6715 /* Create a representation of the new-expression. */
6717 tf_warning_or_error);
6718 }
6726 }
6728 /* Parse a new-placement.
6730 new-placement:
6731 ( expression-list )
6733 Returns the same representation as for an expression-list. */
6737 {
6740 /* Parse the expression-list. */
6741 expression_list = (cp_parser_parenthesized_expression_list
6747 }
6749 /* Parse a new-type-id.
6751 new-type-id:
6752 type-specifier-seq new-declarator [opt]
6754 Returns the TYPE allocated. If the new-type-id indicates an array
6755 type, *NELTS is set to the number of elements in the last array
6756 bound; the TYPE will not include the last array bound. */
6758 static tree
6760 {
6761 cp_decl_specifier_seq type_specifier_seq;
6766 tree type;
6768 /* The type-specifier sequence must not contain type definitions.
6769 (It cannot contain declarations of new types either, but if they
6770 are not definitions we will catch that because they are not
6771 complete.) */
6773 parser->type_definition_forbidden_message
6775 /* Parse the type-specifier-seq. */
6779 /* Restore the old message. */
6781 /* Parse the new-declarator. */
6784 /* Determine the number of elements in the last array dimension, if
6785 any. */
6787 /* Skip down to the last array dimension. */
6792 {
6795 }
6800 {
6803 }
6806 {
6813 else
6815 }
6819 }
6821 /* Parse an (optional) new-declarator.
6823 new-declarator:
6824 ptr-operator new-declarator [opt]
6825 direct-new-declarator
6827 Returns the declarator. */
6831 {
6833 tree type;
6834 cp_cv_quals cv_quals;
6836 /* We don't know if there's a ptr-operator next, or not. */
6838 /* Look for a ptr-operator. */
6840 /* If that worked, look for more new-declarators. */
6842 {
6845 /* Parse another optional declarator. */
6848 return cp_parser_make_indirect_declarator
6850 }
6852 /* If the next token is a `[', there is a direct-new-declarator. */
6857 }
6859 /* Parse a direct-new-declarator.
6861 direct-new-declarator:
6862 [ expression ]
6863 direct-new-declarator [constant-expression]
6865 */
6869 {
6873 {
6874 tree expression;
6876 /* Look for the opening `['. */
6878 /* The first expression is not required to be constant. */
6880 {
6883 /* The standard requires that the expression have integral
6884 type. DR 74 adds enumeration types. We believe that the
6885 real intent is that these expressions be handled like the
6886 expression in a `switch' condition, which also allows
6887 classes with a single conversion to integral or
6888 enumeration type. */
6890 {
6891 expression
6893 expression,
6896 {
6898 "expression in new-declarator must have integral "
6901 }
6902 }
6903 }
6904 /* But all the other expressions must be. */
6905 else
6906 expression
6909 NULL);
6910 /* Look for the closing `]'. */
6913 /* Add this bound to the declarator. */
6916 /* If the next token is not a `[', then there are no more
6917 bounds. */
6920 }
6923 }
6925 /* Parse a new-initializer.
6927 new-initializer:
6928 ( expression-list [opt] )
6929 braced-init-list
6931 Returns a representation of the expression-list. */
6935 {
6939 {
6940 tree t;
6946 }
6947 else
6948 expression_list = (cp_parser_parenthesized_expression_list
6954 }
6956 /* Parse a delete-expression.
6958 delete-expression:
6959 :: [opt] delete cast-expression
6960 :: [opt] delete [ ] cast-expression
6962 Returns a representation of the expression. */
6964 static tree
6966 {
6969 tree expression;
6971 /* Look for the optional `::' operator. */
6972 global_scope_p
6976 /* Look for the `delete' keyword. */
6978 /* See if the array syntax is in use. */
6980 {
6981 /* Consume the `[' token. */
6983 /* Look for the `]' token. */
6985 /* Remember that this is the `[]' construct. */
6987 }
6988 else
6991 /* Parse the cast-expression. */
6994 /* A delete-expression may not appear in an integral constant
6995 expression. */
7000 tf_warning_or_error);
7001 }
7003 /* Returns true if TOKEN may start a cast-expression and false
7004 otherwise. */
7006 static bool
7008 {
7010 {
7049 /* '[' may start a primary-expression in obj-c++. */
7055 }
7056 }
7058 /* Parse a cast-expression.
7060 cast-expression:
7061 unary-expression
7062 ( type-id ) cast-expression
7064 ADDRESS_P is true iff the unary-expression is appearing as the
7065 operand of the `&' operator. CAST_P is true if this expression is
7066 the target of a cast.
7068 Returns a representation of the expression. */
7070 static tree
7073 {
7074 /* If it's a `(', then we might be looking at a cast. */
7076 {
7082 /* There's no way to know yet whether or not this is a cast.
7083 For example, `(int (3))' is a unary-expression, while `(int)
7084 3' is a cast. So, we resort to parsing tentatively. */
7086 /* Types may not be defined in a cast. */
7088 parser->type_definition_forbidden_message
7090 /* Consume the `('. */
7092 /* A very tricky bit is that `(struct S) { 3 }' is a
7093 compound-literal (which we permit in C++ as an extension).
7094 But, that construct is not a cast-expression -- it is a
7095 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7096 is legal; if the compound-literal were a cast-expression,
7097 you'd need an extra set of parentheses.) But, if we parse
7098 the type-id, and it happens to be a class-specifier, then we
7099 will commit to the parse at that point, because we cannot
7100 undo the action that is done when creating a new class. So,
7101 then we cannot back up and do a postfix-expression.
7103 Therefore, we scan ahead to the closing `)', and check to see
7104 if the token after the `)' is a `{'. If so, we are not
7105 looking at a cast-expression.
7107 Save tokens so that we can put them back. */
7109 /* Skip tokens until the next token is a closing parenthesis.
7110 If we find the closing `)', and the next token is a `{', then
7111 we are looking at a compound-literal. */
7112 compound_literal_p
7116 /* Roll back the tokens we skipped. */
7118 /* If we were looking at a compound-literal, simulate an error
7119 so that the call to cp_parser_parse_definitely below will
7120 fail. */
7123 else
7124 {
7127 /* Look for the type-id. */
7129 /* Look for the closing `)'. */
7132 }
7134 /* Restore the saved message. */
7137 /* At this point this can only be either a cast or a
7138 parenthesized ctor such as `(T ())' that looks like a cast to
7139 function returning T. */
7143 {
7149 /* Warn about old-style casts, if so requested. */
7151 && !in_system_header
7156 /* Only type conversions to integral or enumeration types
7157 can be used in constant-expressions. */
7160 NIC_CAST))
7163 /* Perform the cast. */
7166 }
7167 else
7169 }
7171 /* If we get here, then it's not a cast, so it must be a
7172 unary-expression. */
7174 }
7176 /* Parse a binary expression of the general form:
7178 pm-expression:
7179 cast-expression
7180 pm-expression .* cast-expression
7181 pm-expression ->* cast-expression
7183 multiplicative-expression:
7184 pm-expression
7185 multiplicative-expression * pm-expression
7186 multiplicative-expression / pm-expression
7187 multiplicative-expression % pm-expression
7189 additive-expression:
7190 multiplicative-expression
7191 additive-expression + multiplicative-expression
7192 additive-expression - multiplicative-expression
7194 shift-expression:
7195 additive-expression
7196 shift-expression << additive-expression
7197 shift-expression >> additive-expression
7199 relational-expression:
7200 shift-expression
7201 relational-expression < shift-expression
7202 relational-expression > shift-expression
7203 relational-expression <= shift-expression
7204 relational-expression >= shift-expression
7206 GNU Extension:
7208 relational-expression:
7209 relational-expression <? shift-expression
7210 relational-expression >? shift-expression
7212 equality-expression:
7213 relational-expression
7214 equality-expression == relational-expression
7215 equality-expression != relational-expression
7217 and-expression:
7218 equality-expression
7219 and-expression & equality-expression
7221 exclusive-or-expression:
7222 and-expression
7223 exclusive-or-expression ^ and-expression
7225 inclusive-or-expression:
7226 exclusive-or-expression
7227 inclusive-or-expression | exclusive-or-expression
7229 logical-and-expression:
7230 inclusive-or-expression
7231 logical-and-expression && inclusive-or-expression
7233 logical-or-expression:
7234 logical-and-expression
7235 logical-or-expression || logical-and-expression
7237 All these are implemented with a single function like:
7239 binary-expression:
7240 simple-cast-expression
7241 binary-expression <token> binary-expression
7243 CAST_P is true if this expression is the target of a cast.
7245 The binops_by_token map is used to get the tree codes for each <token> type.
7246 binary-expressions are associated according to a precedence table. */
7248 #define TOKEN_PRECEDENCE(token) \
7249 (((token->type == CPP_GREATER \
7250 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7251 && !parser->greater_than_is_operator_p) \
7252 ? PREC_NOT_OPERATOR \
7253 : binops_by_token[token->type].prec)
7255 static tree
7260 {
7261 cp_parser_expression_stack stack;
7267 tree overload;
7269 /* Parse the first expression. */
7274 {
7275 /* Get an operator token. */
7281 {
7283 "%<>>%> operator is treated as"
7287 }
7291 /* Popping an entry off the stack means we completed a subexpression:
7292 - either we found a token which is not an operator (`>' where it is not
7293 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7294 will happen repeatedly;
7295 - or, we found an operator which has lower priority. This is the case
7296 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7297 parsing `3 * 4'. */
7299 {
7302 else
7304 }
7306 get_rhs:
7309 /* We used the operator token. */
7312 /* For "false && x" or "true || x", x will never be executed;
7313 disable warnings while evaluating it. */
7319 /* Extract another operand. It may be the RHS of this expression
7320 or the LHS of a new, higher priority expression. */
7324 /* Get another operator token. Look up its precedence to avoid
7325 building a useless (immediately popped) stack entry for common
7326 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7330 {
7331 /* ... and prepare to parse the RHS of the new, higher priority
7332 expression. Since precedence levels on the stack are
7333 monotonically increasing, we do not have to care about
7334 stack overflows. */
7339 sp++;
7346 pop:
7348 /* If the stack is not empty, we have parsed into LHS the right side
7349 (`4' in the example above) of an expression we had suspended.
7350 We can use the information on the stack to recover the LHS (`3')
7351 from the stack together with the tree code (`MULT_EXPR'), and
7352 the precedence of the higher level subexpression
7353 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7354 which will be used to actually build the additive expression. */
7362 }
7364 /* Undo the disabling of warnings done above. */
7371 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7372 ERROR_MARK for everything that is not a binary expression.
7373 This makes warn_about_parentheses miss some warnings that
7374 involve unary operators. For unary expressions we should
7375 pass the correct tree_code unless the unary expression was
7376 surrounded by parentheses.
7377 */
7383 else
7388 /* If the binary operator required the use of an overloaded operator,
7389 then this expression cannot be an integral constant-expression.
7390 An overloaded operator can be used even if both operands are
7391 otherwise permissible in an integral constant-expression if at
7392 least one of the operands is of enumeration type. */
7396 NIC_OVERLOADED))
7398 }
7401 }
7404 /* Parse the `? expression : assignment-expression' part of a
7405 conditional-expression. The LOGICAL_OR_EXPR is the
7406 logical-or-expression that started the conditional-expression.
7407 Returns a representation of the entire conditional-expression.
7409 This routine is used by cp_parser_assignment_expression.
7411 ? expression : assignment-expression
7413 GNU Extensions:
7415 ? : assignment-expression */
7417 static tree
7419 {
7420 tree expr;
7421 tree assignment_expr;
7424 /* Consume the `?' token. */
7429 {
7432 /* Implicit true clause. */
7436 }
7437 else
7438 {
7441 /* Parse the expression. */
7444 c_inhibit_evaluation_warnings +=
7448 }
7450 /* The next token should be a `:'. */
7452 /* Parse the assignment-expression. */
7456 /* Build the conditional-expression. */
7458 expr,
7459 assignment_expr,
7460 tf_warning_or_error);
7461 }
7463 /* Parse an assignment-expression.
7465 assignment-expression:
7466 conditional-expression
7467 logical-or-expression assignment-operator assignment_expression
7468 throw-expression
7470 CAST_P is true if this expression is the target of a cast.
7472 Returns a representation for the expression. */
7474 static tree
7477 {
7478 tree expr;
7480 /* If the next token is the `throw' keyword, then we're looking at
7481 a throw-expression. */
7484 /* Otherwise, it must be that we are looking at a
7485 logical-or-expression. */
7486 else
7487 {
7488 /* Parse the binary expressions (logical-or-expression). */
7491 /* If the next token is a `?' then we're actually looking at a
7492 conditional-expression. */
7495 else
7496 {
7499 /* If it's an assignment-operator, we're using the second
7500 production. */
7501 assignment_operator
7504 {
7507 /* Parse the right-hand side of the assignment. */
7513 /* An assignment may not appear in a
7514 constant-expression. */
7516 NIC_ASSIGNMENT))
7518 /* Build the assignment expression. */
7520 assignment_operator,
7521 rhs,
7522 tf_warning_or_error);
7523 }
7524 }
7525 }
7528 }
7530 /* Parse an (optional) assignment-operator.
7532 assignment-operator: one of
7533 = *= /= %= += -= >>= <<= &= ^= |=
7535 GNU Extension:
7537 assignment-operator: one of
7538 <?= >?=
7540 If the next token is an assignment operator, the corresponding tree
7541 code is returned, and the token is consumed. For example, for
7542 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
7543 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
7544 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
7545 operator, ERROR_MARK is returned. */
7547 static enum tree_code
7549 {
7553 /* Peek at the next token. */
7557 {
7603 /* Nothing else is an assignment operator. */
7605 }
7607 /* If it was an assignment operator, consume it. */
7612 }
7614 /* Parse an expression.
7616 expression:
7617 assignment-expression
7618 expression , assignment-expression
7620 CAST_P is true if this expression is the target of a cast.
7622 Returns a representation of the expression. */
7624 static tree
7626 {
7630 {
7631 tree assignment_expression;
7633 /* Parse the next assignment-expression. */
7634 assignment_expression
7636 /* If this is the first assignment-expression, we can just
7637 save it away. */
7640 else
7642 assignment_expression,
7643 tf_warning_or_error);
7644 /* If the next token is not a comma, then we are done with the
7645 expression. */
7648 /* Consume the `,'. */
7650 /* A comma operator cannot appear in a constant-expression. */
7653 }
7656 }
7658 /* Parse a constant-expression.
7660 constant-expression:
7661 conditional-expression
7663 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
7664 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
7665 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
7666 is false, NON_CONSTANT_P should be NULL. */
7668 static tree
7672 {
7676 tree expression;
7678 /* It might seem that we could simply parse the
7679 conditional-expression, and then check to see if it were
7680 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
7681 one that the compiler can figure out is constant, possibly after
7682 doing some simplifications or optimizations. The standard has a
7683 precise definition of constant-expression, and we must honor
7684 that, even though it is somewhat more restrictive.
7686 For example:
7688 int i[(2, 3)];
7690 is not a legal declaration, because `(2, 3)' is not a
7691 constant-expression. The `,' operator is forbidden in a
7692 constant-expression. However, GCC's constant-folding machinery
7693 will fold this operation to an INTEGER_CST for `3'. */
7695 /* Save the old settings. */
7697 saved_allow_non_integral_constant_expression_p
7700 /* We are now parsing a constant-expression. */
7702 parser->allow_non_integral_constant_expression_p
7705 /* Although the grammar says "conditional-expression", we parse an
7706 "assignment-expression", which also permits "throw-expression"
7707 and the use of assignment operators. In the case that
7708 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
7709 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
7710 actually essential that we look for an assignment-expression.
7711 For example, cp_parser_initializer_clauses uses this function to
7712 determine whether a particular assignment-expression is in fact
7713 constant. */
7715 /* Restore the old settings. */
7716 parser->integral_constant_expression_p
7718 parser->allow_non_integral_constant_expression_p
7721 {
7722 /* Require an rvalue constant expression here; that's what our
7723 callers expect. Reference constant expressions are handled
7724 separately in e.g. cp_parser_template_argument. */
7729 }
7732 parser->non_integral_constant_expression_p
7736 }
7738 /* Parse __builtin_offsetof.
7740 offsetof-expression:
7741 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
7743 offsetof-member-designator:
7744 id-expression
7745 | offsetof-member-designator "." id-expression
7746 | offsetof-member-designator "[" expression "]"
7747 | offsetof-member-designator "->" id-expression */
7749 static tree
7751 {
7754 cp_id_kind dummy;
7757 /* We're about to accept non-integral-constant things, but will
7758 definitely yield an integral constant expression. Save and
7759 restore these values around our local parsing. */
7763 /* Consume the "__builtin_offsetof" token. */
7765 /* Consume the opening `('. */
7767 /* Parse the type-id. */
7769 /* Look for the `,'. */
7773 /* Build the (type *)null that begins the traditional offsetof macro. */
7775 tf_warning_or_error);
7777 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
7781 {
7784 {
7786 /* offsetof-member-designator "[" expression "]" */
7791 /* offsetof-member-designator "->" identifier */
7793 /* FALLTHRU */
7796 /* offsetof-member-designator "." identifier */
7804 /* Consume the ")" token. */
7809 /* Error. We know the following require will fail, but
7810 that gives the proper error message. */
7815 }
7816 }
7818 success:
7819 /* If we're processing a template, we can't finish the semantics yet.
7820 Otherwise we can fold the entire expression now. */
7823 else
7826 failure:
7831 }
7833 /* Parse a trait expression.
7835 Returns a representation of the expression, the underlying type
7836 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
7838 static tree
7840 {
7841 cp_trait_kind kind;
7844 cp_decl_specifier_seq decl_specs;
7847 {
7924 }
7926 /* Consume the token. */
7936 /* Build a trivial decl-specifier-seq. */
7940 /* Call grokdeclarator to figure out what type this is. */
7945 {
7953 /* Build a trivial decl-specifier-seq. */
7957 /* Call grokdeclarator to figure out what type this is. */
7960 }
7964 /* Complete the trait expression, which may mean either processing
7965 the trait expr now or saving it for template instantiation. */
7967 {
7976 }
7977 }
7979 /* Lambdas that appear in variable initializer or default argument scope
7980 get that in their mangling, so we need to record it. We might as well
7981 use the count for function and namespace scopes as well. */
7985 {
7986 tree t;
7993 static void
7995 {
7996 tree_int ti;
7998 /* Once we're inside a function, we ignore other scopes and just push
7999 the function again so that popping works properly. */
8006 {
8007 /* Don't reset the count if we're still in the same function. */
8010 }
8011 }
8013 static void
8015 {
8018 }
8020 static void
8022 {
8025 {
8028 }
8030 }
8032 /* Parse a lambda expression.
8034 lambda-expression:
8035 lambda-introducer lambda-declarator [opt] compound-statement
8037 Returns a representation of the expression. */
8039 static tree
8041 {
8043 tree type;
8053 /* We may be in the middle of deferred access check. Disable
8054 it now. */
8065 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8068 /* Now that we've started the type, add the capture fields for any
8069 explicit captures. */
8072 {
8073 /* Inside the class, surrounding template-parameter-lists do not apply. */
8074 unsigned int saved_num_template_parameter_lists
8083 /* By virtue of defining a local class, a lambda expression has access to
8084 the private variables of enclosing classes. */
8093 /* The capture list was built up in reverse order; fix that now. */
8094 {
8100 {
8104 }
8106 }
8116 }
8120 /* This field is only used during parsing of the lambda. */
8123 /* This lambda shouldn't have any proxies left at this point. */
8125 /* And now that we're done, push proxies for an enclosing lambda. */
8130 else
8132 }
8134 /* Parse the beginning of a lambda expression.
8136 lambda-introducer:
8137 [ lambda-capture [opt] ]
8139 LAMBDA_EXPR is the current representation of the lambda expression. */
8141 static void
8143 {
8144 /* Need commas after the first capture. */
8147 /* Eat the leading `['. */
8150 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8158 {
8161 }
8164 {
8166 tree capture_id;
8167 tree capture_init_expr;
8171 enum capture_kind_type
8172 {
8173 BY_COPY,
8174 BY_REFERENCE
8175 };
8179 {
8182 }
8186 else
8189 /* Possibly capture `this'. */
8191 {
8201 explicit_init_p);
8203 }
8205 /* Remember whether we want to capture as a reference or not. */
8207 {
8210 }
8212 /* Get the identifier. */
8217 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8218 delimiters, but I modified this to stop on unnested ']' as well. It
8219 was already changed to stop on unnested '}', so the
8220 "closing_parenthesis" name is no more misleading with my change. */
8221 {
8227 }
8229 /* Find the initializer for this capture. */
8231 {
8232 /* An explicit expression exists. */
8235 "ISO C++ does not allow initializers "
8241 }
8242 else
8243 {
8246 /* Turn the identifier into an id-expression. */
8247 capture_init_expr
8248 = cp_parser_lookup_name
8250 capture_id,
8251 none_type,
8259 {
8262 }
8266 {
8269 capture_init_expr);
8272 }
8275 {
8278 capture_init_expr);
8281 }
8283 capture_init_expr
8284 = finish_id_expression
8286 capture_init_expr,
8298 }
8302 {
8307 capture_id);
8311 "capture of %qD redundant with by-reference capture "
8313 }
8316 capture_id,
8317 capture_init_expr,
8319 explicit_init_p);
8320 }
8323 }
8325 /* Parse the (optional) middle of a lambda expression.
8327 lambda-declarator:
8328 ( parameter-declaration-clause [opt] )
8329 attribute-specifier [opt]
8330 mutable [opt]
8331 exception-specification [opt]
8332 lambda-return-type-clause [opt]
8334 LAMBDA_EXPR is the current representation of the lambda expression. */
8336 static bool
8338 {
8339 /* 5.1.1.4 of the standard says:
8340 If a lambda-expression does not include a lambda-declarator, it is as if
8341 the lambda-declarator were ().
8342 This means an empty parameter list, no attributes, and no exception
8343 specification. */
8347 tree t;
8349 /* The lambda-declarator is optional, but must begin with an opening
8350 parenthesis if present. */
8352 {
8357 /* Parse parameters. */
8360 /* Default arguments shall not be specified in the
8361 parameter-declaration-clause of a lambda-declarator. */
8371 /* Parse optional `mutable' keyword. */
8373 {
8376 }
8378 /* Parse optional exception specification. */
8381 /* Parse optional trailing return type. */
8383 {
8386 }
8388 /* The function parameters must be in scope all the way until after the
8389 trailing-return-type in case of decltype. */
8394 }
8396 /* Create the function call operator.
8398 Messing with declarators like this is no uglier than building up the
8399 FUNCTION_DECL by hand, and this is less likely to get out of sync with
8400 other code. */
8401 {
8402 cp_decl_specifier_seq return_type_specs;
8404 tree fco;
8411 else
8412 /* Maybe we will deduce the return type later, but we can use void
8413 as a placeholder return type anyways. */
8419 sfk_none);
8424 VIRT_SPEC_UNSPECIFIED,
8425 exception_spec,
8430 declarator,
8431 attributes);
8433 {
8436 /* Give the object parameter a different name. */
8438 }
8445 }
8446 }
8448 /* Parse the body of a lambda expression, which is simply
8450 compound-statement
8452 but which requires special handling.
8453 LAMBDA_EXPR is the current representation of the lambda expression. */
8455 static void
8457 {
8462 else
8463 /* Still increment function_depth so that we don't GC in the
8464 middle of an expression. */
8466 /* Clear this in case we're in the middle of a default argument. */
8469 /* Finish the function call operator
8470 - class_specifier
8471 + late_parsing_for_member
8472 + function_definition_after_declarator
8473 + ctor_initializer_opt_and_function_body */
8474 {
8476 tree body;
8478 tree compound_stmt;
8479 tree cap;
8481 /* Let the front end know that we are going to be defining this
8482 function. */
8484 NULL_TREE,
8493 /* Push the proxies for any explicit captures. */
8500 /* 5.1.1.4 of the standard says:
8501 If a lambda-expression does not include a trailing-return-type, it
8502 is as if the trailing-return-type denotes the following type:
8503 * if the compound-statement is of the form
8504 { return attribute-specifier [opt] expression ; }
8505 the type of the returned expression after lvalue-to-rvalue
8506 conversion (_conv.lval_ 4.1), array-to-pointer conversion
8507 (_conv.array_ 4.2), and function-to-pointer conversion
8508 (_conv.func_ 4.3);
8509 * otherwise, void. */
8511 /* In a lambda that has neither a lambda-return-type-clause
8512 nor a deducible form, errors should be reported for return statements
8513 in the body. Since we used void as the placeholder return type, parsing
8514 the body as usual will give such desired behavior. */
8518 {
8522 /* Parse tentatively in case there's more after the initial return
8523 statement. */
8534 {
8537 /* Will get error here if type not deduced yet. */
8541 }
8542 }
8545 {
8553 }
8557 out:
8561 /* Finish the function and generate code for it if necessary. */
8563 }
8568 else
8570 }
8572 /* Statements [gram.stmt.stmt] */
8574 /* Parse a statement.
8576 statement:
8577 labeled-statement
8578 expression-statement
8579 compound-statement
8580 selection-statement
8581 iteration-statement
8582 jump-statement
8583 declaration-statement
8584 try-block
8586 TM Extension:
8588 statement:
8589 atomic-statement
8591 IN_COMPOUND is true when the statement is nested inside a
8592 cp_parser_compound_statement; this matters for certain pragmas.
8594 If IF_P is not NULL, *IF_P is set to indicate whether the statement
8595 is a (possibly labeled) if statement which is not enclosed in braces
8596 and has an else clause. This is used to implement -Wparentheses. */
8598 static void
8601 {
8602 tree statement;
8604 location_t statement_location;
8606 restart:
8609 /* There is no statement yet. */
8611 /* Peek at the next token. */
8613 /* Remember the location of the first token in the statement. */
8615 /* If this is a keyword, then that will often determine what kind of
8616 statement we have. */
8618 {
8622 {
8625 /* Looks like a labeled-statement with a case label.
8626 Parse the label, and then use tail recursion to parse
8627 the statement. */
8649 /* Objective-C++ exception-handling constructs. */
8663 /* This must be a namespace alias definition. */
8676 /* It might be a keyword like `int' that can start a
8677 declaration-statement. */
8679 }
8680 }
8682 {
8683 /* If the next token is a `:', then we are looking at a
8684 labeled-statement. */
8687 {
8688 /* Looks like a labeled-statement with an ordinary label.
8689 Parse the label, and then use tail recursion to parse
8690 the statement. */
8693 }
8694 }
8695 /* Anything that starts with a `{' must be a compound-statement. */
8698 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
8699 a statement all its own. */
8701 {
8702 /* Only certain OpenMP pragmas are attached to statements, and thus
8703 are considered statements themselves. All others are not. In
8704 the context of a compound, accept the pragma as a "statement" and
8705 return so that we can check for a close brace. Otherwise we
8706 require a real statement and must go back and read one. */
8712 }
8714 {
8717 }
8719 /* Everything else must be a declaration-statement or an
8720 expression-statement. Try for the declaration-statement
8721 first, unless we are looking at a `;', in which case we know that
8722 we have an expression-statement. */
8724 {
8726 {
8728 /* Try to parse the declaration-statement. */
8730 /* If that worked, we're done. */
8733 }
8734 /* Look for an expression-statement instead. */
8736 }
8738 /* Set the line number for the statement. */
8741 }
8743 /* Parse the label for a labeled-statement, i.e.
8745 identifier :
8746 case constant-expression :
8747 default :
8749 GNU Extension:
8750 case constant-expression ... constant-expression : statement
8752 When a label is parsed without errors, the label is added to the
8753 parse tree by the finish_* functions, so this function doesn't
8754 have to return the label. */
8756 static void
8758 {
8763 /* The next token should be an identifier. */
8767 {
8770 }
8774 {
8776 {
8780 /* Consume the `case' token. */
8782 /* Parse the constant-expression. */
8785 NULL);
8789 {
8790 /* Consume the `...' token. */
8792 expr_hi =
8795 NULL);
8796 /* We don't need to emit warnings here, as the common code
8797 will do this for us. */
8798 }
8799 else
8804 else
8807 expr);
8808 }
8812 /* Consume the `default' token. */
8817 else
8822 /* Anything else must be an ordinary label. */
8825 }
8827 /* Require the `:' token. */
8830 /* An ordinary label may optionally be followed by attributes.
8831 However, this is only permitted if the attributes are then
8832 followed by a semicolon. This is because, for backward
8833 compatibility, when parsing
8834 lab: __attribute__ ((unused)) int i;
8835 we want the attribute to attach to "i", not "lab". */
8838 {
8839 tree attrs;
8847 ;
8848 else
8850 }
8853 }
8855 /* Parse an expression-statement.
8857 expression-statement:
8858 expression [opt] ;
8860 Returns the new EXPR_STMT -- or NULL_TREE if the expression
8861 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
8862 indicates whether this expression-statement is part of an
8863 expression statement. */
8865 static tree
8867 {
8871 /* If the next token is a ';', then there is no expression
8872 statement. */
8876 /* Give a helpful message for "A<T>::type t;" and the like. */
8879 {
8886 {
8887 /* A::A a; */
8892 }
8893 }
8895 /* Consume the final `;'. */
8900 /* This is the final expression statement of a statement
8901 expression. */
8905 else
8909 }
8911 /* Parse a compound-statement.
8913 compound-statement:
8914 { statement-seq [opt] }
8916 GNU extension:
8918 compound-statement:
8919 { label-declaration-seq [opt] statement-seq [opt] }
8921 label-declaration-seq:
8922 label-declaration
8923 label-declaration-seq label-declaration
8925 Returns a tree representing the statement. */
8927 static tree
8930 {
8931 tree compound_stmt;
8933 /* Consume the `{'. */
8940 /* Begin the compound-statement. */
8942 /* If the next keyword is `__label__' we have a label declaration. */
8945 /* Parse an (optional) statement-seq. */
8947 /* Finish the compound-statement. */
8949 /* Consume the `}'. */
8953 }
8955 /* Parse an (optional) statement-seq.
8957 statement-seq:
8958 statement
8959 statement-seq [opt] statement */
8961 static void
8963 {
8964 /* Scan statements until there aren't any more. */
8966 {
8969 /* If we are looking at a `}', then we have run out of
8970 statements; the same is true if we have reached the end
8971 of file, or have stumbled upon a stray '@end'. */
8978 /* If we are in a compound statement and find 'else' then
8979 something went wrong. */
8981 {
8984 else
8985 {
8988 }
8989 }
8991 /* Parse the statement. */
8993 }
8994 }
8996 /* Parse a selection-statement.
8998 selection-statement:
8999 if ( condition ) statement
9000 if ( condition ) statement else statement
9001 switch ( condition ) statement
9003 Returns the new IF_STMT or SWITCH_STMT.
9005 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9006 is a (possibly labeled) if statement which is not enclosed in
9007 braces and has an else clause. This is used to implement
9008 -Wparentheses. */
9010 static tree
9012 {
9019 /* Peek at the next token. */
9022 /* See what kind of keyword it is. */
9025 {
9028 {
9029 tree statement;
9030 tree condition;
9032 /* Look for the `('. */
9034 {
9037 }
9039 /* Begin the selection-statement. */
9042 else
9045 /* Parse the condition. */
9047 /* Look for the `)'. */
9053 {
9057 /* Add the condition. */
9060 /* Parse the then-clause. */
9064 {
9072 }
9073 else
9079 /* If the next token is `else', parse the else-clause. */
9081 RID_ELSE))
9082 {
9083 /* Consume the `else' keyword. */
9086 /* Parse the else-clause. */
9088 {
9089 location_t loc;
9096 }
9097 else
9102 /* If we are currently parsing a then-clause, then
9103 IF_P will not be NULL. We set it to true to
9104 indicate that this if statement has an else clause.
9105 This may trigger the Wparentheses warning below
9106 when we get back up to the parent if statement. */
9109 }
9110 else
9111 {
9112 /* This if statement does not have an else clause. If
9113 NESTED_IF is true, then the then-clause is an if
9114 statement which does have an else clause. We warn
9115 about the potential ambiguity. */
9118 "suggest explicit braces to avoid ambiguous"
9120 }
9122 /* Now we're all done with the if-statement. */
9124 }
9125 else
9126 {
9130 /* Add the condition. */
9133 /* Parse the body of the switch-statement. */
9142 /* Now we're all done with the switch-statement. */
9144 }
9147 }
9153 }
9154 }
9156 /* Parse a condition.
9158 condition:
9159 expression
9160 type-specifier-seq declarator = initializer-clause
9161 type-specifier-seq declarator braced-init-list
9163 GNU Extension:
9165 condition:
9166 type-specifier-seq declarator asm-specification [opt]
9167 attributes [opt] = assignment-expression
9169 Returns the expression that should be tested. */
9171 static tree
9173 {
9174 cp_decl_specifier_seq type_specifiers;
9178 /* Try the declaration first. */
9180 /* New types are not allowed in the type-specifier-seq for a
9181 condition. */
9183 parser->type_definition_forbidden_message
9185 /* Parse the type-specifier-seq. */
9187 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9190 /* Restore the saved message. */
9192 /* If all is well, we might be looking at a declaration. */
9194 {
9195 tree decl;
9196 tree asm_specification;
9197 tree attributes;
9201 /* Parse the declarator. */
9206 /* Parse the attributes. */
9208 /* Parse the asm-specification. */
9210 /* If the next token is not an `=' or '{', then we might still be
9211 looking at an expression. For example:
9213 if (A(a).x)
9215 looks like a decl-specifier-seq and a declarator -- but then
9216 there is no `=', so this is an expression. */
9221 /* If we did see an `=' or '{', then we are looking at a declaration
9222 for sure. */
9224 {
9225 tree pushed_scope;
9229 /* Create the declaration. */
9235 /* Parse the initializer. */
9237 {
9241 }
9242 else
9243 {
9244 /* Consume the `='. */
9247 }
9251 /* Process the initializer. */
9254 asm_specification,
9255 flags);
9261 }
9262 }
9263 /* If we didn't even get past the declarator successfully, we are
9264 definitely not looking at a declaration. */
9265 else
9268 /* Otherwise, we are looking at an expression. */
9270 }
9272 /* Parses a for-statement or range-for-statement until the closing ')',
9273 not included. */
9275 static tree
9277 {
9281 /* Begin the for-statement. */
9284 /* Parse the initialization. */
9289 else
9291 }
9293 static tree
9295 {
9296 /* Normal for loop */
9299 tree stmt;
9302 /* The for-init-statement has already been parsed in
9303 cp_parser_for_init_statement, so no work is needed here. */
9306 /* If there's a condition, process it. */
9310 /* Look for the `;'. */
9313 /* If there's an expression, process it. */
9319 }
9321 /* Tries to parse a range-based for-statement:
9323 range-based-for:
9324 decl-specifier-seq declarator : expression
9326 The decl-specifier-seq declarator and the `:' are already parsed by
9327 cp_parser_for_init_statement. If processing_template_decl it returns a
9328 newly created RANGE_FOR_STMT; if not, it is converted to a
9329 regular FOR_STMT. */
9331 static tree
9333 {
9337 {
9340 }
9341 else
9344 /* If in template, STMT is converted to a normal for-statement
9345 at instantiation. If not, it is done just ahead. */
9347 {
9353 /* do_auto_deduction doesn't mess with template init-lists. */
9356 }
9357 else
9358 {
9361 }
9363 }
9365 /* Subroutine of cp_convert_range_for: given the initializer expression,
9366 builds up the range temporary. */
9368 static tree
9370 {
9373 /* Find out the type deduced by the declaration
9374 `auto &&__range = range_expr'. */
9379 /* Create the __range variable. */
9386 }
9388 /* Used by cp_parser_range_for in template context: we aren't going to
9389 do a full conversion yet, but we still need to resolve auto in the
9390 type of the for-range-declaration if present. This is basically
9391 a shortcut version of cp_convert_range_for. */
9393 static void
9395 {
9398 {
9401 iter_type = (cp_parser_perform_range_for_lookup
9405 tf_warning_or_error);
9408 }
9409 }
9411 /* Converts a range-based for-statement into a normal
9412 for-statement, as per the definition.
9414 for (RANGE_DECL : RANGE_EXPR)
9415 BLOCK
9417 should be equivalent to:
9419 {
9420 auto &&__range = RANGE_EXPR;
9421 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
9422 __begin != __end;
9423 ++__begin)
9424 {
9425 RANGE_DECL = *__begin;
9426 BLOCK
9427 }
9428 }
9430 If RANGE_EXPR is an array:
9431 BEGIN_EXPR = __range
9432 END_EXPR = __range + ARRAY_SIZE(__range)
9433 Else if RANGE_EXPR has a member 'begin' or 'end':
9434 BEGIN_EXPR = __range.begin()
9435 END_EXPR = __range.end()
9436 Else:
9437 BEGIN_EXPR = begin(__range)
9438 END_EXPR = end(__range);
9440 If __range has a member 'begin' but not 'end', or vice versa, we must
9441 still use the second alternative (it will surely fail, however).
9442 When calling begin()/end() in the third alternative we must use
9443 argument dependent lookup, but always considering 'std' as an associated
9444 namespace. */
9446 tree
9448 {
9454 /* If an error happened previously do nothing or else a lot of
9455 unhelpful errors would be issued. */
9457 else
9458 {
9463 LOOKUP_ONLYCONVERTING);
9468 }
9470 /* The new for initialization statement. */
9478 LOOKUP_ONLYCONVERTING);
9487 LOOKUP_ONLYCONVERTING);
9491 /* The new for condition. */
9498 /* The new increment expression. */
9502 /* The declaration is initialized with *__begin inside the loop body. */
9506 LOOKUP_ONLYCONVERTING);
9509 }
9511 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
9512 We need to solve both at the same time because the method used
9513 depends on the existence of members begin or end.
9514 Returns the type deduced for the iterator expression. */
9516 static tree
9518 {
9520 {
9523 }
9526 {
9531 }
9533 {
9534 /* If RANGE is an array, we will use pointer arithmetic. */
9537 range,
9541 }
9542 else
9543 {
9544 /* If it is not an array, we must do a bit of magic. */
9554 tf_warning_or_error);
9557 tf_warning_or_error);
9560 {
9561 /* Use the member functions. */
9564 else
9570 else
9573 }
9574 else
9575 {
9576 /* Use global functions with ADL. */
9584 tf_warning_or_error);
9586 tf_warning_or_error);
9589 tf_warning_or_error);
9591 tf_warning_or_error);
9594 }
9596 /* Last common checks. */
9598 {
9599 /* If one of the expressions is an error do no more checks. */
9602 }
9603 else
9604 {
9606 /* The unqualified type of the __begin and __end temporaries should
9607 be the same, as required by the multiple auto declaration. */
9613 }
9614 }
9615 }
9617 /* Helper function for cp_parser_perform_range_for_lookup.
9618 Builds a tree for RANGE.IDENTIFIER(). */
9620 static tree
9622 {
9635 tf_warning_or_error);
9638 }
9640 /* Parse an iteration-statement.
9642 iteration-statement:
9643 while ( condition ) statement
9644 do statement while ( expression ) ;
9645 for ( for-init-statement condition [opt] ; expression [opt] )
9646 statement
9648 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
9650 static tree
9652 {
9655 tree statement;
9658 /* Peek at the next token. */
9663 /* Remember whether or not we are already within an iteration
9664 statement. */
9667 /* See what kind of keyword it is. */
9670 {
9672 {
9673 tree condition;
9675 /* Begin the while-statement. */
9677 /* Look for the `('. */
9679 /* Parse the condition. */
9682 /* Look for the `)'. */
9684 /* Parse the dependent statement. */
9688 /* We're done with the while-statement. */
9690 }
9694 {
9695 tree expression;
9697 /* Begin the do-statement. */
9699 /* Parse the body of the do-statement. */
9704 /* Look for the `while' keyword. */
9706 /* Look for the `('. */
9708 /* Parse the expression. */
9710 /* We're done with the do-statement. */
9712 /* Look for the `)'. */
9714 /* Look for the `;'. */
9716 }
9720 {
9721 /* Look for the `('. */
9726 /* Look for the `)'. */
9729 /* Parse the body of the for-statement. */
9734 /* We're done with the for-statement. */
9736 }
9743 }
9746 }
9748 /* Parse a for-init-statement or the declarator of a range-based-for.
9749 Returns true if a range-based-for declaration is seen.
9751 for-init-statement:
9752 expression-statement
9753 simple-declaration */
9755 static bool
9757 {
9758 /* If the next token is a `;', then we have an empty
9759 expression-statement. Grammatically, this is also a
9760 simple-declaration, but an invalid one, because it does not
9761 declare anything. Therefore, if we did not handle this case
9762 specially, we would issue an error message about an invalid
9763 declaration. */
9765 {
9771 /* We're going to speculatively look for a declaration, falling back
9772 to an expression, if necessary. */
9774 /* Parse the declaration. */
9777 decl);
9780 {
9781 /* It is a range-for, consume the ':' */
9785 {
9787 "range-based %<for%> loops are not allowed "
9790 }
9791 }
9792 else
9793 /* The ';' is not consumed yet because we told
9794 cp_parser_simple_declaration not to. */
9799 /* If the tentative parse failed, then we shall need to look for an
9800 expression-statement. */
9801 }
9802 /* If we are here, it is an expression-statement. */
9805 }
9807 /* Parse a jump-statement.
9809 jump-statement:
9810 break ;
9811 continue ;
9812 return expression [opt] ;
9813 return braced-init-list ;
9814 goto identifier ;
9816 GNU extension:
9818 jump-statement:
9819 goto * expression ;
9821 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
9823 static tree
9825 {
9831 /* Peek at the next token. */
9836 /* See what kind of keyword it is. */
9839 {
9843 {
9858 }
9864 {
9877 }
9882 {
9883 tree expr;
9887 {
9890 }
9893 else
9894 /* If the next token is a `;', then there is no
9895 expression. */
9897 /* Build the return-statement. */
9899 /* Look for the final `;'. */
9901 }
9905 /* Create the goto-statement. */
9907 {
9908 /* Issue a warning about this use of a GNU extension. */
9910 /* Consume the '*' token. */
9912 /* Parse the dependent expression. */
9914 }
9915 else
9917 /* Look for the final `;'. */
9924 }
9927 }
9929 /* Parse a declaration-statement.
9931 declaration-statement:
9932 block-declaration */
9934 static void
9936 {
9939 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
9942 /* Parse the block-declaration. */
9945 /* Free any declarators allocated. */
9948 /* Finish off the statement. */
9950 }
9952 /* Some dependent statements (like `if (cond) statement'), are
9953 implicitly in their own scope. In other words, if the statement is
9954 a single statement (as opposed to a compound-statement), it is
9955 none-the-less treated as if it were enclosed in braces. Any
9956 declarations appearing in the dependent statement are out of scope
9957 after control passes that point. This function parses a statement,
9958 but ensures that is in its own scope, even if it is not a
9959 compound-statement.
9961 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9962 is a (possibly labeled) if statement which is not enclosed in
9963 braces and has an else clause. This is used to implement
9964 -Wparentheses.
9966 Returns the new statement. */
9968 static tree
9970 {
9971 tree statement;
9976 /* Mark if () ; with a special NOP_EXPR. */
9978 {
9982 }
9983 /* if a compound is opened, we simply parse the statement directly. */
9986 /* If the token is not a `{', then we must take special action. */
9987 else
9988 {
9989 /* Create a compound-statement. */
9991 /* Parse the dependent-statement. */
9993 /* Finish the dummy compound-statement. */
9995 }
9997 /* Return the statement. */
9999 }
10001 /* For some dependent statements (like `while (cond) statement'), we
10002 have already created a scope. Therefore, even if the dependent
10003 statement is a compound-statement, we do not want to create another
10004 scope. */
10006 static void
10008 {
10009 /* If the token is a `{', then we must take special action. */
10012 else
10013 {
10014 /* Avoid calling cp_parser_compound_statement, so that we
10015 don't create a new scope. Do everything else by hand. */
10017 /* If the next keyword is `__label__' we have a label declaration. */
10020 /* Parse an (optional) statement-seq. */
10023 }
10024 }
10026 /* Declarations [gram.dcl.dcl] */
10028 /* Parse an optional declaration-sequence.
10030 declaration-seq:
10031 declaration
10032 declaration-seq declaration */
10034 static void
10036 {
10038 {
10049 {
10050 /* A declaration consisting of a single semicolon is
10051 invalid. Allow it unless we're being pedantic. */
10056 }
10058 /* If we're entering or exiting a region that's implicitly
10059 extern "C", modify the lang context appropriately. */
10061 {
10064 }
10066 {
10069 }
10072 {
10073 /* A top-level declaration can consist solely of a #pragma.
10074 A nested declaration cannot, so this is done here and not
10075 in cp_parser_declaration. (A #pragma at block scope is
10076 handled in cp_parser_statement.) */
10079 }
10081 /* Parse the declaration itself. */
10083 }
10084 }
10086 /* Parse a declaration.
10088 declaration:
10089 block-declaration
10090 function-definition
10091 template-declaration
10092 explicit-instantiation
10093 explicit-specialization
10094 linkage-specification
10095 namespace-definition
10097 GNU extension:
10099 declaration:
10100 __extension__ declaration */
10102 static void
10104 {
10105 cp_token token1;
10106 cp_token token2;
10111 /* Check for the `__extension__' keyword. */
10113 {
10114 /* Parse the qualified declaration. */
10116 /* Restore the PEDANTIC flag. */
10120 }
10122 /* Try to figure out what kind of declaration is present. */
10127 else
10128 {
10131 }
10133 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10136 /* If the next token is `extern' and the following token is a string
10137 literal, then we have a linkage specification. */
10141 /* If the next token is `template', then we have either a template
10142 declaration, an explicit instantiation, or an explicit
10143 specialization. */
10145 {
10146 /* `template <>' indicates a template specialization. */
10150 /* `template <' indicates a template declaration. */
10153 /* Anything else must be an explicit instantiation. */
10154 else
10156 }
10157 /* If the next token is `export', then we have a template
10158 declaration. */
10161 /* If the next token is `extern', 'static' or 'inline' and the one
10162 after that is `template', we have a GNU extended explicit
10163 instantiation directive. */
10170 /* If the next token is `namespace', check for a named or unnamed
10171 namespace definition. */
10177 /* An unnamed namespace definition. */
10181 /* An inline (associated) namespace definition. */
10185 /* Objective-C++ declaration/definition. */
10192 /* We must have either a block declaration or a function
10193 definition. */
10194 else
10195 /* Try to parse a block-declaration, or a function-definition. */
10198 /* Free any declarators allocated. */
10200 }
10202 /* Parse a block-declaration.
10204 block-declaration:
10205 simple-declaration
10206 asm-definition
10207 namespace-alias-definition
10208 using-declaration
10209 using-directive
10211 GNU Extension:
10213 block-declaration:
10214 __extension__ block-declaration
10216 C++0x Extension:
10218 block-declaration:
10219 static_assert-declaration
10221 If STATEMENT_P is TRUE, then this block-declaration is occurring as
10222 part of a declaration-statement. */
10224 static void
10227 {
10231 /* Check for the `__extension__' keyword. */
10233 {
10234 /* Parse the qualified declaration. */
10236 /* Restore the PEDANTIC flag. */
10240 }
10242 /* Peek at the next token to figure out which kind of declaration is
10243 present. */
10246 /* If the next keyword is `asm', we have an asm-definition. */
10248 {
10252 }
10253 /* If the next keyword is `namespace', we have a
10254 namespace-alias-definition. */
10257 /* If the next keyword is `using', we have a
10258 using-declaration, a using-directive, or an alias-declaration. */
10260 {
10265 /* If the token after `using' is `namespace', then we have a
10266 using-directive. */
10270 /* If the second token after 'using' is '=', then we have an
10271 alias-declaration. */
10278 /* Otherwise, it's a using-declaration. */
10279 else
10282 }
10283 /* If the next keyword is `__label__' we have a misplaced label
10284 declaration. */
10286 {
10290 /* If the next token is now a `;', consume it. */
10293 }
10294 /* If the next token is `static_assert' we have a static assertion. */
10297 /* Anything else must be a simple-declaration. */
10298 else
10301 }
10303 /* Parse a simple-declaration.
10305 simple-declaration:
10306 decl-specifier-seq [opt] init-declarator-list [opt] ;
10308 init-declarator-list:
10309 init-declarator
10310 init-declarator-list , init-declarator
10312 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
10313 function-definition as a simple-declaration.
10315 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
10316 parsed declaration if it is an uninitialized single declarator not followed
10317 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
10318 if present, will not be consumed. */
10320 static void
10324 {
10325 cp_decl_specifier_seq decl_specifiers;
10332 /* Defer access checks until we know what is being declared; the
10333 checks for names appearing in the decl-specifier-seq should be
10334 done as if we were in the scope of the thing being declared. */
10337 /* Parse the decl-specifier-seq. We have to keep track of whether
10338 or not the decl-specifier-seq declares a named class or
10339 enumeration type, since that is the only case in which the
10340 init-declarator-list is allowed to be empty.
10342 [dcl.dcl]
10344 In a simple-declaration, the optional init-declarator-list can be
10345 omitted only when declaring a class or enumeration, that is when
10346 the decl-specifier-seq contains either a class-specifier, an
10347 elaborated-type-specifier, or an enum-specifier. */
10349 CP_PARSER_FLAGS_OPTIONAL,
10352 /* We no longer need to defer access checks. */
10355 /* In a block scope, a valid declaration must always have a
10356 decl-specifier-seq. By not trying to parse declarators, we can
10357 resolve the declaration/expression ambiguity more quickly. */
10360 {
10363 }
10365 /* If the next two tokens are both identifiers, the code is
10366 erroneous. The usual cause of this situation is code like:
10368 T t;
10370 where "T" should name a type -- but does not. */
10373 {
10374 /* If parsing tentatively, we should commit; we really are
10375 looking at a declaration. */
10377 /* Give up. */
10379 }
10381 /* If we have seen at least one decl-specifier, and the next token
10382 is not a parenthesis, then we must be looking at a declaration.
10383 (After "int (" we might be looking at a functional cast.) */
10390 /* Keep going until we hit the `;' at the end of the simple
10391 declaration. */
10394 CPP_SEMICOLON))
10395 {
10398 tree decl;
10401 {
10402 /* If we are processing next declarator, coma is expected */
10408 }
10409 else
10412 /* Parse the init-declarator. */
10415 function_definition_allowed_p,
10417 declares_class_or_enum,
10419 maybe_range_for_decl);
10420 /* If an error occurred while parsing tentatively, exit quickly.
10421 (That usually happens when in the body of a function; each
10422 statement is treated as a declaration-statement until proven
10423 otherwise.) */
10426 /* Handle function definitions specially. */
10428 {
10429 /* If the next token is a `,', then we are probably
10430 processing something like:
10432 void f() {}, *p;
10434 which is erroneous. */
10436 {
10439 "mixing"
10441 }
10442 /* Otherwise, we're done with the list of declarators. */
10443 else
10444 {
10447 }
10448 }
10451 /* The next token should be either a `,' or a `;'. */
10453 /* If it's a `,', there are more declarators to come. */
10456 /* If it's a `;', we are done. */
10459 /* Anything else is an error. */
10460 else
10461 {
10462 /* If we have already issued an error message we don't need
10463 to issue another one. */
10467 /* Skip tokens until we reach the end of the statement. */
10469 /* If the next token is now a `;', consume it. */
10473 }
10474 /* After the first time around, a function-definition is not
10475 allowed -- even if it was OK at first. For example:
10477 int i, f() {}
10479 is not valid. */
10481 }
10483 /* Issue an error message if no declarators are present, and the
10484 decl-specifier-seq does not itself declare a class or
10485 enumeration. */
10487 {
10490 /* Perform any deferred access checks. */
10492 }
10494 /* Consume the `;'. */
10498 done:
10500 }
10502 /* Parse a decl-specifier-seq.
10504 decl-specifier-seq:
10505 decl-specifier-seq [opt] decl-specifier
10507 decl-specifier:
10508 storage-class-specifier
10509 type-specifier
10510 function-specifier
10511 friend
10512 typedef
10514 GNU Extension:
10516 decl-specifier:
10517 attributes
10519 Set *DECL_SPECS to a representation of the decl-specifier-seq.
10521 The parser flags FLAGS is used to control type-specifier parsing.
10523 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
10524 flags:
10526 1: one of the decl-specifiers is an elaborated-type-specifier
10527 (i.e., a type declaration)
10528 2: one of the decl-specifiers is an enum-specifier or a
10529 class-specifier (i.e., a type definition)
10531 */
10533 static void
10535 cp_parser_flags flags,
10538 {
10542 /* Clear DECL_SPECS. */
10545 /* Assume no class or enumeration type is declared. */
10548 /* Keep reading specifiers until there are no more to read. */
10550 {
10555 /* Peek at the next token. */
10558 /* Save the first token of the decl spec list for error
10559 reporting. */
10562 /* Handle attributes. */
10564 {
10565 /* Parse the attributes. */
10566 decl_specs->attributes
10570 }
10571 /* Assume we will find a decl-specifier keyword. */
10573 /* If the next token is an appropriate keyword, we can simply
10574 add it to the list. */
10576 {
10577 /* decl-specifier:
10578 friend
10579 constexpr */
10582 {
10585 }
10586 else
10587 {
10589 /* Consume the token. */
10591 }
10599 /* function-specifier:
10600 inline
10601 virtual
10602 explicit */
10609 /* decl-specifier:
10610 typedef */
10613 /* Consume the token. */
10615 /* A constructor declarator cannot appear in a typedef. */
10617 /* The "typedef" keyword can only occur in a declaration; we
10618 may as well commit at this point. */
10625 /* storage-class-specifier:
10626 auto
10627 register
10628 static
10629 extern
10630 mutable
10632 GNU Extension:
10633 thread */
10636 {
10637 /* Consume the token. */
10640 /* Complain about `auto' as a storage specifier, if
10641 we're complaining about C++0x compatibility. */
10645 /* Set the storage class anyway. */
10648 }
10649 else
10650 /* C++0x auto type-specifier. */
10658 /* Consume the token. */
10664 /* Consume the token. */
10670 /* We did not yet find a decl-specifier yet. */
10673 }
10680 /* Constructors are a special case. The `S' in `S()' is not a
10681 decl-specifier; it is the beginning of the declarator. */
10682 constructor_p
10683 = (!found_decl_spec
10684 && constructor_possible_p
10685 && (cp_parser_constructor_declarator_p
10688 /* If we don't have a DECL_SPEC yet, then we must be looking at
10689 a type-specifier. */
10691 {
10694 tree type_spec;
10696 type_spec
10698 decl_specs,
10704 /* If this type-specifier referenced a user-defined type
10705 (a typedef, class-name, etc.), then we can't allow any
10706 more such type-specifiers henceforth.
10708 [dcl.spec]
10710 The longest sequence of decl-specifiers that could
10711 possibly be a type name is taken as the
10712 decl-specifier-seq of a declaration. The sequence shall
10713 be self-consistent as described below.
10715 [dcl.type]
10717 As a general rule, at most one type-specifier is allowed
10718 in the complete decl-specifier-seq of a declaration. The
10719 only exceptions are the following:
10721 -- const or volatile can be combined with any other
10722 type-specifier.
10724 -- signed or unsigned can be combined with char, long,
10725 short, or int.
10727 -- ..
10729 Example:
10731 typedef char* Pc;
10732 void g (const int Pc);
10734 Here, Pc is *not* part of the decl-specifier seq; it's
10735 the declarator. Therefore, once we see a type-specifier
10736 (other than a cv-qualifier), we forbid any additional
10737 user-defined types. We *do* still allow things like `int
10738 int' to be considered a decl-specifier-seq, and issue the
10739 error message later. */
10742 /* A constructor declarator cannot follow a type-specifier. */
10744 {
10749 }
10750 }
10752 /* If we still do not have a DECL_SPEC, then there are no more
10753 decl-specifiers. */
10758 /* After we see one decl-specifier, further decl-specifiers are
10759 always optional. */
10761 }
10765 /* Don't allow a friend specifier with a class definition. */
10770 }
10772 /* Parse an (optional) storage-class-specifier.
10774 storage-class-specifier:
10775 auto
10776 register
10777 static
10778 extern
10779 mutable
10781 GNU Extension:
10783 storage-class-specifier:
10784 thread
10786 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
10788 static tree
10790 {
10792 {
10796 /* Fall through for C++98. */
10803 /* Consume the token. */
10808 }
10809 }
10811 /* Parse an (optional) function-specifier.
10813 function-specifier:
10814 inline
10815 virtual
10816 explicit
10818 Returns an IDENTIFIER_NODE corresponding to the keyword used.
10819 Updates DECL_SPECS, if it is non-NULL. */
10821 static tree
10824 {
10827 {
10834 /* 14.5.2.3 [temp.mem]
10836 A member function template shall not be virtual. */
10850 }
10852 /* Consume the token. */
10854 }
10856 /* Parse a linkage-specification.
10858 linkage-specification:
10859 extern string-literal { declaration-seq [opt] }
10860 extern string-literal declaration */
10862 static void
10864 {
10865 tree linkage;
10867 /* Look for the `extern' keyword. */
10870 /* Look for the string-literal. */
10873 /* Transform the literal into an identifier. If the literal is a
10874 wide-character string, or contains embedded NULs, then we can't
10875 handle it as the user wants. */
10878 {
10880 /* Assume C++ linkage. */
10882 }
10883 else
10886 /* We're now using the new linkage. */
10889 /* If the next token is a `{', then we're using the first
10890 production. */
10892 {
10893 /* Consume the `{' token. */
10895 /* Parse the declarations. */
10897 /* Look for the closing `}'. */
10899 }
10900 /* Otherwise, there's just one declaration. */
10901 else
10902 {
10905 saved_in_unbraced_linkage_specification_p
10909 parser->in_unbraced_linkage_specification_p
10911 }
10913 /* We're done with the linkage-specification. */
10915 }
10917 /* Parse a static_assert-declaration.
10919 static_assert-declaration:
10920 static_assert ( constant-expression , string-literal ) ;
10922 If MEMBER_P, this static_assert is a class member. */
10924 static void
10926 {
10927 tree condition;
10928 tree message;
10930 location_t saved_loc;
10933 /* Peek at the `static_assert' token so we can keep track of exactly
10934 where the static assertion started. */
10938 /* Look for the `static_assert' keyword. */
10940 RT_STATIC_ASSERT))
10943 /* We know we are in a static assertion; commit to any tentative
10944 parse. */
10948 /* Parse the `(' starting the static assertion condition. */
10951 /* Parse the constant-expression. Allow a non-constant expression
10952 here in order to give better diagnostics in finish_static_assert. */
10953 condition =
10958 /* Parse the separating `,'. */
10961 /* Parse the string-literal message. */
10966 /* A `)' completes the static assertion. */
10973 /* A semicolon terminates the declaration. */
10976 /* Complete the static assertion, which may mean either processing
10977 the static assert now or saving it for template instantiation. */
10979 }
10981 /* Parse a `decltype' type. Returns the type.
10983 simple-type-specifier:
10984 decltype ( expression ) */
10986 static tree
10988 {
10989 tree expr;
10998 {
10999 /* Already parsed. */
11002 }
11004 /* Look for the `decltype' token. */
11008 /* Types cannot be defined in a `decltype' expression. Save away the
11009 old message. */
11012 /* And create the new one. */
11013 parser->type_definition_forbidden_message
11016 /* The restrictions on constant-expressions do not apply inside
11017 decltype expressions. */
11018 saved_integral_constant_expression_p
11020 saved_non_integral_constant_expression_p
11024 /* Do not actually evaluate the expression. */
11027 /* Do not warn about problems with the expression. */
11030 /* Parse the opening `('. */
11034 /* First, try parsing an id-expression. */
11045 {
11048 cp_id_kind idk;
11052 /* Lookup the name we got back from the id-expression. */
11054 none_type,
11068 {
11069 /* Complete lookup of the id-expression. */
11070 expr = (finish_id_expression
11083 /* We found an id-expression, but it was something that we
11084 should not have found. This is an error, not something
11085 we can recover from, so note that we found an
11086 id-expression and we'll recover as gracefully as
11087 possible. */
11089 }
11094 /* We have an id-expression. */
11096 }
11099 {
11100 /* Abort the id-expression parse. */
11103 /* Parsing tentatively, again. */
11106 /* Parse a class member access. */
11114 /* We have an id-expression. */
11116 }
11119 /* We have parsed the complete id-expression or member access. */
11121 else
11122 {
11125 /* Abort our attempt to parse an id-expression or member access
11126 expression. */
11129 /* Within a parenthesized expression, a `>' token is always
11130 the greater-than operator. */
11131 saved_greater_than_is_operator_p
11135 /* Parse a full expression. */
11138 /* The `>' token might be the end of a template-id or
11139 template-parameter-list now. */
11140 parser->greater_than_is_operator_p
11142 }
11144 /* Go back to evaluating expressions. */
11148 /* Restore the old message and the integral constant expression
11149 flags. */
11151 parser->integral_constant_expression_p
11153 parser->non_integral_constant_expression_p
11156 /* Parse to the closing `)'. */
11158 {
11162 }
11165 tf_warning_or_error);
11167 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
11168 it again. */
11175 }
11177 /* Special member functions [gram.special] */
11179 /* Parse a conversion-function-id.
11181 conversion-function-id:
11182 operator conversion-type-id
11184 Returns an IDENTIFIER_NODE representing the operator. */
11186 static tree
11188 {
11189 tree type;
11190 tree saved_scope;
11191 tree saved_qualifying_scope;
11192 tree saved_object_scope;
11195 /* Look for the `operator' token. */
11198 /* When we parse the conversion-type-id, the current scope will be
11199 reset. However, we need that information in able to look up the
11200 conversion function later, so we save it here. */
11204 /* We must enter the scope of the class so that the names of
11205 entities declared within the class are available in the
11206 conversion-type-id. For example, consider:
11208 struct S {
11209 typedef int I;
11210 operator I();
11211 };
11213 S::operator I() { ... }
11215 In order to see that `I' is a type-name in the definition, we
11216 must be in the scope of `S'. */
11219 /* Parse the conversion-type-id. */
11221 /* Leave the scope of the class, if any. */
11224 /* Restore the saved scope. */
11228 /* If the TYPE is invalid, indicate failure. */
11232 }
11234 /* Parse a conversion-type-id:
11236 conversion-type-id:
11237 type-specifier-seq conversion-declarator [opt]
11239 Returns the TYPE specified. */
11241 static tree
11243 {
11244 tree attributes;
11245 cp_decl_specifier_seq type_specifiers;
11247 tree type_specified;
11249 /* Parse the attributes. */
11251 /* Parse the type-specifiers. */
11255 /* If that didn't work, stop. */
11258 /* Parse the conversion-declarator. */
11266 /* Don't give this error when parsing tentatively. This happens to
11267 work because we always parse this definitively once. */
11270 {
11273 }
11276 }
11278 /* Parse an (optional) conversion-declarator.
11280 conversion-declarator:
11281 ptr-operator conversion-declarator [opt]
11283 */
11287 {
11289 tree class_type;
11290 cp_cv_quals cv_quals;
11292 /* We don't know if there's a ptr-operator next, or not. */
11294 /* Try the ptr-operator. */
11296 /* If it worked, look for more conversion-declarators. */
11298 {
11301 /* Parse another optional declarator. */
11304 return cp_parser_make_indirect_declarator
11306 }
11309 }
11311 /* Parse an (optional) ctor-initializer.
11313 ctor-initializer:
11314 : mem-initializer-list
11316 Returns TRUE iff the ctor-initializer was actually present. */
11318 static bool
11320 {
11321 /* If the next token is not a `:', then there is no
11322 ctor-initializer. */
11324 {
11325 /* Do default initialization of any bases and members. */
11330 }
11332 /* Consume the `:' token. */
11334 /* And the mem-initializer-list. */
11338 }
11340 /* Parse a mem-initializer-list.
11342 mem-initializer-list:
11343 mem-initializer ... [opt]
11344 mem-initializer ... [opt] , mem-initializer-list */
11346 static void
11348 {
11353 /* Let the semantic analysis code know that we are starting the
11354 mem-initializer-list. */
11359 /* Loop through the list. */
11361 {
11362 tree mem_initializer;
11365 /* Parse the mem-initializer. */
11367 /* If the next token is a `...', we're expanding member initializers. */
11369 {
11370 /* Consume the `...'. */
11373 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
11374 can be expanded but members cannot. */
11377 {
11382 }
11384 /* Construct the pack expansion type. */
11387 }
11390 {
11394 }
11395 /* Look for a target constructor. */
11399 {
11402 {
11406 }
11408 }
11409 /* Add it to the list, unless it was erroneous. */
11411 {
11414 }
11415 /* If the next token is not a `,', we're done. */
11418 /* Consume the `,' token. */
11420 }
11422 /* Perform semantic analysis. */
11425 }
11427 /* Parse a mem-initializer.
11429 mem-initializer:
11430 mem-initializer-id ( expression-list [opt] )
11431 mem-initializer-id braced-init-list
11433 GNU extension:
11435 mem-initializer:
11436 ( expression-list [opt] )
11438 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
11439 class) or FIELD_DECL (for a non-static data member) to initialize;
11440 the TREE_VALUE is the expression-list. An empty initialization
11441 list is represented by void_list_node. */
11443 static tree
11445 {
11446 tree mem_initializer_id;
11447 tree expression_list;
11448 tree member;
11451 /* Find out what is being initialized. */
11453 {
11457 }
11458 else
11459 {
11463 }
11469 {
11475 }
11476 else
11477 {
11487 }
11497 }
11499 /* Parse a mem-initializer-id.
11501 mem-initializer-id:
11502 :: [opt] nested-name-specifier [opt] class-name
11503 identifier
11505 Returns a TYPE indicating the class to be initializer for the first
11506 production. Returns an IDENTIFIER_NODE indicating the data member
11507 to be initialized for the second production. */
11509 static tree
11511 {
11515 tree id;
11519 /* `typename' is not allowed in this context ([temp.res]). */
11521 {
11523 "keyword %<typename%> not allowed in this context (a qualified "
11526 }
11527 /* Look for the optional `::' operator. */
11528 global_scope_p
11532 /* Look for the optional nested-name-specifier. The simplest way to
11533 implement:
11535 [temp.res]
11537 The keyword `typename' is not permitted in a base-specifier or
11538 mem-initializer; in these contexts a qualified name that
11539 depends on a template-parameter is implicitly assumed to be a
11540 type name.
11542 is to assume that we have seen the `typename' keyword at this
11543 point. */
11544 nested_name_specifier_p
11553 /* If there is a `::' operator or a nested-name-specifier, then we
11554 are definitely looking for a class-name. */
11559 typename_type,
11563 /* Otherwise, we could also be looking for an ordinary identifier. */
11565 /* Try a class-name. */
11569 none_type,
11573 /* If we found one, we're done. */
11576 /* Otherwise, look for an ordinary identifier. */
11578 }
11580 /* Overloading [gram.over] */
11582 /* Parse an operator-function-id.
11584 operator-function-id:
11585 operator operator
11587 Returns an IDENTIFIER_NODE for the operator which is a
11588 human-readable spelling of the identifier, e.g., `operator +'. */
11590 static tree
11592 {
11593 /* Look for the `operator' keyword. */
11596 /* And then the name of the operator itself. */
11598 }
11600 /* Return an identifier node for a user-defined literal operator.
11601 The suffix identifier is chained to the operator name identifier. */
11603 static tree
11605 {
11606 tree identifier;
11611 /*IDENTIFIER_UDLIT_OPNAME_P (identifier) = 1; If we get a flag someday. */
11614 }
11616 /* Parse an operator.
11618 operator:
11619 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
11620 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
11621 || ++ -- , ->* -> () []
11623 GNU Extensions:
11625 operator:
11626 <? >? <?= >?=
11628 Returns an IDENTIFIER_NODE for the operator which is a
11629 human-readable spelling of the identifier, e.g., `operator +'. */
11631 static tree
11633 {
11637 /* Peek at the next token. */
11639 /* Figure out which operator we have. */
11641 {
11643 {
11646 /* The keyword should be either `new' or `delete'. */
11651 else
11654 /* Consume the `new' or `delete' token. */
11657 /* Peek at the next token. */
11659 /* If it's a `[' token then this is the array variant of the
11660 operator. */
11662 {
11663 /* Consume the `[' token. */
11665 /* Look for the `]' token. */
11669 }
11670 /* Otherwise, we have the non-array variant. */
11671 else
11675 }
11822 /* Consume the `('. */
11824 /* Look for the matching `)'. */
11829 /* Consume the `['. */
11831 /* Look for the matching `]'. */
11839 {
11842 }
11843 /* Consume the string. */
11845 /* Look for the suffix identifier. */
11848 {
11851 {
11854 }
11855 }
11856 else
11857 {
11860 }
11867 /* Anything else is an error. */
11869 }
11871 /* If we have selected an identifier, we need to consume the
11872 operator token. */
11875 /* Otherwise, no valid operator name was present. */
11876 else
11877 {
11880 }
11883 }
11885 /* Parse a template-declaration.
11887 template-declaration:
11888 export [opt] template < template-parameter-list > declaration
11890 If MEMBER_P is TRUE, this template-declaration occurs within a
11891 class-specifier.
11893 The grammar rule given by the standard isn't correct. What
11894 is really meant is:
11896 template-declaration:
11897 export [opt] template-parameter-list-seq
11898 decl-specifier-seq [opt] init-declarator [opt] ;
11899 export [opt] template-parameter-list-seq
11900 function-definition
11902 template-parameter-list-seq:
11903 template-parameter-list-seq [opt]
11904 template < template-parameter-list > */
11906 static void
11908 {
11909 /* Check for `export'. */
11911 {
11912 /* Consume the `export' token. */
11914 /* Warn that we do not support `export'. */
11916 }
11919 }
11921 /* Parse a template-parameter-list.
11923 template-parameter-list:
11924 template-parameter
11925 template-parameter-list , template-parameter
11927 Returns a TREE_LIST. Each node represents a template parameter.
11928 The nodes are connected via their TREE_CHAINs. */
11930 static tree
11932 {
11937 /* The loop below parses the template parms. We first need to know
11938 the total number of template parms to be able to compute proper
11939 canonical types of each dependent type. So after the loop, when
11940 we know the total number of template parms,
11941 end_template_parm_list computes the proper canonical types and
11942 fixes up the dependent types accordingly. */
11944 {
11945 tree parameter;
11948 location_t parm_loc;
11950 /* Parse the template-parameter. */
11955 /* Add it to the list. */
11958 parm_loc,
11959 parameter,
11960 is_non_type,
11961 is_parameter_pack,
11963 else
11964 {
11967 }
11969 /* If the next token is not a `,', we're done. */
11972 /* Otherwise, consume the `,' token. */
11974 }
11977 }
11979 /* Parse a template-parameter.
11981 template-parameter:
11982 type-parameter
11983 parameter-declaration
11985 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
11986 the parameter. The TREE_PURPOSE is the default value, if any.
11987 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
11988 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
11989 set to true iff this parameter is a parameter pack. */
11991 static tree
11994 {
11998 tree parm;
12000 /* Assume it is a type parameter or a template parameter. */
12002 /* Assume it not a parameter pack. */
12004 /* Peek at the next token. */
12006 /* If it is `class' or `template', we have a type-parameter. */
12009 /* If it is `class' or `typename' we do not know yet whether it is a
12010 type parameter or a non-type parameter. Consider:
12012 template <typename T, typename T::X X> ...
12014 or:
12016 template <class C, class D*> ...
12018 Here, the first parameter is a type parameter, and the second is
12019 a non-type parameter. We can tell by looking at the token after
12020 the identifier -- if it is a `,', `=', or `>' then we have a type
12021 parameter. */
12023 {
12024 /* Peek at the token after `class' or `typename'. */
12026 /* If it's an ellipsis, we have a template type parameter
12027 pack. */
12030 /* If it's an identifier, skip it. */
12033 /* Now, see if the token looks like the end of a template
12034 parameter. */
12039 }
12041 /* Otherwise, it is a non-type parameter.
12043 [temp.param]
12045 When parsing a default template-argument for a non-type
12046 template-parameter, the first non-nested `>' is taken as the end
12047 of the template parameter-list rather than a greater-than
12048 operator. */
12050 parameter_declarator
12054 /* If the parameter declaration is marked as a parameter pack, set
12055 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
12056 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
12057 grokdeclarator. */
12061 {
12064 }
12066 /* If the next token is an ellipsis, and we don't already have it
12067 marked as a parameter pack, then we have a parameter pack (that
12068 has no declarator). */
12072 {
12073 /* Consume the `...'. */
12078 }
12079 /* We might end up with a pack expansion as the type of the non-type
12080 template parameter, in which case this is a non-type template
12081 parameter pack. */
12085 {
12089 }
12092 {
12093 /* Parameter packs cannot have default arguments. However, a
12094 user may try to do so, so we'll parse them and give an
12095 appropriate diagnostic here. */
12099 /* Find the name of the parameter pack. */
12108 else
12112 /* Parse the default argument, but throw away the result. */
12114 }
12124 }
12126 /* Parse a type-parameter.
12128 type-parameter:
12129 class identifier [opt]
12130 class identifier [opt] = type-id
12131 typename identifier [opt]
12132 typename identifier [opt] = type-id
12133 template < template-parameter-list > class identifier [opt]
12134 template < template-parameter-list > class identifier [opt]
12135 = id-expression
12137 GNU Extension (variadic templates):
12139 type-parameter:
12140 class ... identifier [opt]
12141 typename ... identifier [opt]
12143 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
12144 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
12145 the declaration of the parameter.
12147 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
12149 static tree
12151 {
12153 tree parameter;
12155 /* Look for a keyword to tell us what kind of parameter this is. */
12161 {
12164 {
12165 tree identifier;
12166 tree default_argument;
12168 /* If the next token is an ellipsis, we have a template
12169 argument pack. */
12171 {
12172 /* Consume the `...' token. */
12177 }
12179 /* If the next token is an identifier, then it names the
12180 parameter. */
12183 else
12186 /* Create the parameter. */
12189 /* If the next token is an `=', we have a default argument. */
12191 {
12192 /* Consume the `=' token. */
12194 /* Parse the default-argument. */
12198 /* Template parameter packs cannot have default
12199 arguments. */
12201 {
12204 "template parameter pack %qD cannot have a "
12206 else
12208 "template parameter packs cannot have "
12211 }
12213 }
12214 else
12217 /* Create the combined representation of the parameter and the
12218 default argument. */
12220 }
12224 {
12225 tree identifier;
12226 tree default_argument;
12228 /* Look for the `<'. */
12230 /* Parse the template-parameter-list. */
12232 /* Look for the `>'. */
12234 /* Look for the `class' keyword. */
12236 /* If the next token is an ellipsis, we have a template
12237 argument pack. */
12239 {
12240 /* Consume the `...' token. */
12245 }
12246 /* If the next token is an `=', then there is a
12247 default-argument. If the next token is a `>', we are at
12248 the end of the parameter-list. If the next token is a `,',
12249 then we are at the end of this parameter. */
12253 {
12255 /* Treat invalid names as if the parameter were nameless. */
12258 }
12259 else
12262 /* Create the template parameter. */
12264 identifier);
12266 /* If the next token is an `=', then there is a
12267 default-argument. */
12269 {
12272 /* Consume the `='. */
12274 /* Parse the id-expression. */
12276 /* save token before parsing the id-expression, for error
12277 reporting */
12279 default_argument
12287 /* If the id-expression was a template-id that refers to
12288 a template-class, we already have the declaration here,
12289 so no further lookup is needed. */
12290 ;
12291 else
12292 /* Look up the name. */
12293 default_argument
12295 none_type,
12301 /* See if the default argument is valid. */
12302 default_argument
12305 /* Template parameter packs cannot have default
12306 arguments. */
12308 {
12311 "template parameter pack %qD cannot "
12313 identifier);
12314 else
12318 }
12320 }
12321 else
12324 /* Create the combined representation of the parameter and the
12325 default argument. */
12327 }
12333 }
12336 }
12338 /* Parse a template-id.
12340 template-id:
12341 template-name < template-argument-list [opt] >
12343 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
12344 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
12345 returned. Otherwise, if the template-name names a function, or set
12346 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
12347 names a class, returns a TYPE_DECL for the specialization.
12349 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
12350 uninstantiated templates. */
12352 static tree
12357 {
12359 tree templ;
12360 tree arguments;
12361 tree template_id;
12368 /* If the next token corresponds to a template-id, there is no need
12369 to reparse it. */
12372 {
12375 /* Get the stored value. */
12377 /* Perform any access checks that were deferred. */
12380 {
12385 }
12386 /* Return the stored value. */
12388 }
12390 /* Avoid performing name lookup if there is no possibility of
12391 finding a template-id. */
12394 && !cp_parser_nth_token_starts_template_argument_list_p
12396 {
12399 }
12401 /* Remember where the template-id starts. */
12407 /* Parse the template-name. */
12410 check_dependency_p,
12411 is_declaration,
12414 {
12417 }
12419 /* If we find the sequence `[:' after a template-name, it's probably
12420 a digraph-typo for `< ::'. Substitute the tokens and check if we can
12421 parse correctly the argument list. */
12428 {
12430 /* Change `:' into `::'. */
12432 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
12433 CPP_LESS. */
12436 /* Parse the arguments. */
12439 {
12440 /* If we couldn't parse an argument list, then we revert our changes
12441 and return simply an error. Maybe this is not a template-id
12442 after all. */
12447 }
12448 /* Otherwise, emit an error about the invalid digraph, but continue
12449 parsing because we got our argument list. */
12452 {
12455 "%<<:%> is an alternate spelling for %<[%>."
12458 {
12462 }
12463 }
12464 }
12465 else
12466 {
12467 /* Look for the `<' that starts the template-argument-list. */
12469 {
12472 }
12473 /* Parse the arguments. */
12475 }
12477 /* Build a representation of the specialization. */
12482 {
12484 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
12485 template (rather than some instantiation thereof) only if
12486 is not nested within some other construct. For example, in
12487 "template <typename T> void f(T) { A<T>::", A<T> is just an
12488 instantiation of A. */
12491 CPP_SCOPE));
12492 template_id
12494 }
12495 else
12496 {
12497 /* If it's not a class-template or a template-template, it should be
12498 a function-template. */
12504 }
12506 /* If parsing tentatively, replace the sequence of tokens that makes
12507 up the template-id with a CPP_TEMPLATE_ID token. That way,
12508 should we re-parse the token stream, we will not have to repeat
12509 the effort required to do the parse, nor will we issue duplicate
12510 error messages about problems during instantiation of the
12511 template. */
12513 {
12516 /* Reset the contents of the START_OF_ID token. */
12518 /* Retrieve any deferred checks. Do not pop this access checks yet
12519 so the memory will not be reclaimed during token replacing below. */
12525 /* Purge all subsequent tokens. */
12528 /* ??? Can we actually assume that, if template_id ==
12529 error_mark_node, we will have issued a diagnostic to the
12530 user, as opposed to simply marking the tentative parse as
12531 failed? */
12534 }
12538 }
12540 /* Parse a template-name.
12542 template-name:
12543 identifier
12545 The standard should actually say:
12547 template-name:
12548 identifier
12549 operator-function-id
12551 A defect report has been filed about this issue.
12553 A conversion-function-id cannot be a template name because they cannot
12554 be part of a template-id. In fact, looking at this code:
12556 a.operator K<int>()
12558 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
12559 It is impossible to call a templated conversion-function-id with an
12560 explicit argument list, since the only allowed template parameter is
12561 the type to which it is converting.
12563 If TEMPLATE_KEYWORD_P is true, then we have just seen the
12564 `template' keyword, in a construction like:
12566 T::template f<3>()
12568 In that case `f' is taken to be a template-name, even though there
12569 is no way of knowing for sure.
12571 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
12572 name refers to a set of overloaded functions, at least one of which
12573 is a template, or an IDENTIFIER_NODE with the name of the template,
12574 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
12575 names are looked up inside uninstantiated templates. */
12577 static tree
12583 {
12584 tree identifier;
12585 tree decl;
12586 tree fns;
12589 /* If the next token is `operator', then we have either an
12590 operator-function-id or a conversion-function-id. */
12592 {
12593 /* We don't know whether we're looking at an
12594 operator-function-id or a conversion-function-id. */
12596 /* Try an operator-function-id. */
12598 /* If that didn't work, try a conversion-function-id. */
12600 {
12603 }
12604 }
12605 /* Look for the identifier. */
12606 else
12609 /* If we didn't find an identifier, we don't have a template-id. */
12613 /* If the name immediately followed the `template' keyword, then it
12614 is a template-name. However, if the next token is not `<', then
12615 we do not treat it as a template-name, since it is not being used
12616 as part of a template-id. This enables us to handle constructs
12617 like:
12619 template <typename T> struct S { S(); };
12620 template <typename T> S<T>::S();
12622 correctly. We would treat `S' as a template -- if it were `S<T>'
12623 -- but we do not if there is no `<'. */
12627 {
12628 /* In a declaration, in a dependent context, we pretend that the
12629 "template" keyword was present in order to improve error
12630 recovery. For example, given:
12632 template <typename T> void f(T::X<int>);
12634 we want to treat "X<int>" as a template-id. */
12636 && !template_keyword_p
12638 && check_dependency_p
12640 /* Do not do this for dtors (or ctors), since they never
12641 need the template keyword before their name. */
12643 {
12646 /* Explain what went wrong. */
12648 identifier);
12651 /* If parsing tentatively, find the location of the "<" token. */
12654 /* Parse the template arguments so that we can issue error
12655 messages about them. */
12658 /* Skip tokens until we find a good place from which to
12659 continue parsing. */
12664 /* If parsing tentatively, permanently remove the
12665 template argument list. That will prevent duplicate
12666 error messages from being issued about the missing
12667 "template" keyword. */
12673 }
12675 /* If the "template" keyword is present, then there is generally
12676 no point in doing name-lookup, so we just return IDENTIFIER.
12677 But, if the qualifying scope is non-dependent then we can
12678 (and must) do name-lookup normally. */
12684 }
12686 /* Look up the name. */
12688 none_type,
12691 check_dependency_p,
12695 /* If DECL is a template, then the name was a template-name. */
12697 ;
12698 else
12699 {
12702 /* The standard does not explicitly indicate whether a name that
12703 names a set of overloaded declarations, some of which are
12704 templates, is a template-name. However, such a name should
12705 be a template-name; otherwise, there is no way to form a
12706 template-id for the overloaded templates. */
12714 {
12715 /* The name does not name a template. */
12718 }
12719 }
12721 /* If DECL is dependent, and refers to a function, then just return
12722 its name; we will look it up again during template instantiation. */
12724 {
12728 }
12731 }
12733 /* Parse a template-argument-list.
12735 template-argument-list:
12736 template-argument ... [opt]
12737 template-argument-list , template-argument ... [opt]
12739 Returns a TREE_VEC containing the arguments. */
12741 static tree
12743 {
12748 tree vec;
12755 /* Even if the template-id appears in an integral
12756 constant-expression, the contents of the argument list do
12757 not. */
12763 /* Parse the arguments. */
12764 do
12765 {
12766 tree argument;
12769 /* Consume the comma. */
12772 /* Parse the template-argument. */
12775 /* If the next token is an ellipsis, we're expanding a template
12776 argument pack. */
12778 {
12780 {
12784 }
12785 /* Consume the `...' token. */
12788 /* Make the argument into a TYPE_PACK_EXPANSION or
12789 EXPR_PACK_EXPANSION. */
12791 }
12794 {
12798 {
12801 }
12802 else
12804 }
12806 }
12819 #ifdef ENABLE_CHECKING
12821 #endif
12823 }
12825 /* Parse a template-argument.
12827 template-argument:
12828 assignment-expression
12829 type-id
12830 id-expression
12832 The representation is that of an assignment-expression, type-id, or
12833 id-expression -- except that the qualified id-expression is
12834 evaluated, so that the value returned is either a DECL or an
12835 OVERLOAD.
12837 Although the standard says "assignment-expression", it forbids
12838 throw-expressions or assignments in the template argument.
12839 Therefore, we use "conditional-expression" instead. */
12841 static tree
12843 {
12844 tree argument;
12849 cp_id_kind idk;
12851 /* There's really no way to know what we're looking at, so we just
12852 try each alternative in order.
12854 [temp.arg]
12856 In a template-argument, an ambiguity between a type-id and an
12857 expression is resolved to a type-id, regardless of the form of
12858 the corresponding template-parameter.
12860 Therefore, we try a type-id first. */
12863 /* If there was no error parsing the type-id but the next token is a
12864 '>>', our behavior depends on which dialect of C++ we're
12865 parsing. In C++98, we probably found a typo for '> >'. But there
12866 are type-id which are also valid expressions. For instance:
12868 struct X { int operator >> (int); };
12869 template <int V> struct Foo {};
12870 Foo<X () >> 5> r;
12872 Here 'X()' is a valid type-id of a function type, but the user just
12873 wanted to write the expression "X() >> 5". Thus, we remember that we
12874 found a valid type-id, but we still try to parse the argument as an
12875 expression to see what happens.
12877 In C++0x, the '>>' will be considered two separate '>'
12878 tokens. */
12882 {
12885 }
12886 else
12887 {
12888 /* If the next token isn't a `,' or a `>', then this argument wasn't
12889 really finished. This means that the argument is not a valid
12890 type-id. */
12893 /* If that worked, we're done. */
12896 }
12897 /* We're still not sure what the argument will be. */
12899 /* Try a template. */
12907 /* If the next token isn't a `,' or a `>', then this argument wasn't
12908 really finished. */
12912 {
12913 /* Figure out what is being referred to. If the id-expression
12914 was for a class template specialization, then we will have a
12915 TYPE_DECL at this point. There is no need to do name lookup
12916 at this point in that case. */
12919 none_type,
12928 }
12931 /* It must be a non-type argument. There permitted cases are given
12932 in [temp.arg.nontype]:
12934 -- an integral constant-expression of integral or enumeration
12935 type; or
12937 -- the name of a non-type template-parameter; or
12939 -- the name of an object or function with external linkage...
12941 -- the address of an object or function with external linkage...
12943 -- a pointer to member... */
12944 /* Look for a non-type template parameter. */
12946 {
12958 }
12960 /* If the next token is "&", the argument must be the address of an
12961 object or function with external linkage. */
12965 /* See if we might have an id-expression. */
12972 {
12975 address_p,
12982 else
12983 {
12984 tree probe;
12987 {
12990 }
12992 /* If we're in a template, we represent a qualified-id referring
12993 to a static data member as a SCOPE_REF even if the scope isn't
12994 dependent so that we can check access control later. */
12999 {
13000 /* A variable without external linkage might still be a
13001 valid constant-expression, so no error is issued here
13002 if the external-linkage check fails. */
13005 }
13007 /* All overloaded functions are allowed; if the external
13008 linkage test does not pass, an error will be issued
13009 later. */
13010 ;
13014 /* A pointer-to-member. */
13015 ;
13017 ;
13018 else
13022 {
13025 tf_warning_or_error);
13027 }
13028 }
13029 }
13030 /* If the argument started with "&", there are no other valid
13031 alternatives at this point. */
13033 {
13036 }
13038 /* If the argument wasn't successfully parsed as a type-id followed
13039 by '>>', the argument can only be a constant expression now.
13040 Otherwise, we try parsing the constant-expression tentatively,
13041 because the argument could really be a type-id. */
13054 /* We did our best to parse the argument as a non type-id, but that
13055 was the only alternative that matched (albeit with a '>' after
13056 it). We can assume it's just a typo from the user, and a
13057 diagnostic will then be issued. */
13059 }
13061 /* Parse an explicit-instantiation.
13063 explicit-instantiation:
13064 template declaration
13066 Although the standard says `declaration', what it really means is:
13068 explicit-instantiation:
13069 template decl-specifier-seq [opt] declarator [opt] ;
13071 Things like `template int S<int>::i = 5, int S<double>::j;' are not
13072 supposed to be allowed. A defect report has been filed about this
13073 issue.
13075 GNU Extension:
13077 explicit-instantiation:
13078 storage-class-specifier template
13079 decl-specifier-seq [opt] declarator [opt] ;
13080 function-specifier template
13081 decl-specifier-seq [opt] declarator [opt] ; */
13083 static void
13085 {
13087 cp_decl_specifier_seq decl_specifiers;
13092 /* Look for an (optional) storage-class-specifier or
13093 function-specifier. */
13095 {
13096 extension_specifier
13099 extension_specifier
13102 }
13104 /* Look for the `template' keyword. */
13106 /* Let the front end know that we are processing an explicit
13107 instantiation. */
13109 /* [temp.explicit] says that we are supposed to ignore access
13110 control while processing explicit instantiation directives. */
13112 /* Parse a decl-specifier-seq. */
13114 CP_PARSER_FLAGS_OPTIONAL,
13117 /* If there was exactly one decl-specifier, and it declared a class,
13118 and there's no declarator, then we have an explicit type
13119 instantiation. */
13121 {
13122 tree type;
13128 /* Turn access control back on for names used during
13129 template instantiation. */
13134 }
13135 else
13136 {
13138 tree decl;
13140 /* Parse the declarator. */
13141 declarator
13151 {
13161 /* Turn access control back on for names used during
13162 template instantiation. */
13164 /* Do the explicit instantiation. */
13166 }
13167 else
13168 {
13170 /* Skip the body of the explicit instantiation. */
13172 }
13173 }
13174 /* We're done with the instantiation. */
13180 }
13182 /* Parse an explicit-specialization.
13184 explicit-specialization:
13185 template < > declaration
13187 Although the standard says `declaration', what it really means is:
13189 explicit-specialization:
13190 template <> decl-specifier [opt] init-declarator [opt] ;
13191 template <> function-definition
13192 template <> explicit-specialization
13193 template <> template-declaration */
13195 static void
13197 {
13201 /* Look for the `template' keyword. */
13203 /* Look for the `<'. */
13205 /* Look for the `>'. */
13207 /* We have processed another parameter list. */
13209 /* [temp]
13211 A template ... explicit specialization ... shall not have C
13212 linkage. */
13214 {
13216 /* Give it C++ linkage to avoid confusing other parts of the
13217 front end. */
13220 }
13221 else
13223 /* Let the front end know that we are beginning a specialization. */
13225 {
13228 }
13230 /* If the next keyword is `template', we need to figure out whether
13231 or not we're looking a template-declaration. */
13233 {
13238 else
13240 }
13241 else
13242 /* Parse the dependent declaration. */
13248 /* We're done with the specialization. */
13250 /* For the erroneous case of a template with C linkage, we pushed an
13251 implicit C++ linkage scope; exit that scope now. */
13254 /* We're done with this parameter list. */
13256 }
13258 /* Parse a type-specifier.
13260 type-specifier:
13261 simple-type-specifier
13262 class-specifier
13263 enum-specifier
13264 elaborated-type-specifier
13265 cv-qualifier
13267 GNU Extension:
13269 type-specifier:
13270 __complex__
13272 Returns a representation of the type-specifier. For a
13273 class-specifier, enum-specifier, or elaborated-type-specifier, a
13274 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
13276 The parser flags FLAGS is used to control type-specifier parsing.
13278 If IS_DECLARATION is TRUE, then this type-specifier is appearing
13279 in a decl-specifier-seq.
13281 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
13282 class-specifier, enum-specifier, or elaborated-type-specifier, then
13283 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
13284 if a type is declared; 2 if it is defined. Otherwise, it is set to
13285 zero.
13287 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
13288 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
13289 is set to FALSE. */
13291 static tree
13293 cp_parser_flags flags,
13298 {
13304 /* Assume this type-specifier does not declare a new type. */
13307 /* And that it does not specify a cv-qualifier. */
13310 /* Peek at the next token. */
13313 /* If we're looking at a keyword, we can use that to guide the
13314 production we choose. */
13317 {
13322 /* Look for the enum-specifier. */
13324 /* If that worked, we're done. */
13326 {
13331 type_spec,
13335 }
13336 else
13339 /* Any of these indicate either a class-specifier, or an
13340 elaborated-type-specifier. */
13347 /* Parse tentatively so that we can back up if we don't find a
13348 class-specifier. */
13350 /* Look for the class-specifier. */
13353 /* If that worked, we're done. */
13355 {
13360 type_spec,
13364 }
13366 /* Fall through. */
13367 elaborated_type_specifier:
13368 /* We're declaring (not defining) a class or enum. */
13372 /* Fall through. */
13374 /* Look for an elaborated-type-specifier. */
13375 type_spec
13376 = (cp_parser_elaborated_type_specifier
13379 is_declaration));
13382 type_spec,
13406 /* The `__complex__' keyword is a GNU extension. */
13412 }
13414 /* Handle simple keywords. */
13416 {
13418 {
13421 }
13423 }
13425 /* If we do not already have a type-specifier, assume we are looking
13426 at a simple-type-specifier. */
13428 decl_specs,
13429 flags);
13431 /* If we didn't find a type-specifier, and a type-specifier was not
13432 optional in this context, issue an error message. */
13434 {
13437 }
13440 }
13442 /* Parse a simple-type-specifier.
13444 simple-type-specifier:
13445 :: [opt] nested-name-specifier [opt] type-name
13446 :: [opt] nested-name-specifier template template-id
13447 char
13448 wchar_t
13449 bool
13450 short
13451 int
13452 long
13453 signed
13454 unsigned
13455 float
13456 double
13457 void
13459 C++0x Extension:
13461 simple-type-specifier:
13462 auto
13463 decltype ( expression )
13464 char16_t
13465 char32_t
13466 __underlying_type ( type-id )
13468 GNU Extension:
13470 simple-type-specifier:
13471 __int128
13472 __typeof__ unary-expression
13473 __typeof__ ( type-id )
13475 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
13476 appropriately updated. */
13478 static tree
13481 cp_parser_flags flags)
13482 {
13486 /* Peek at the next token. */
13489 /* If we're looking at a keyword, things are easy. */
13491 {
13557 /* Since DR 743, decltype can either be a simple-type-specifier by
13558 itself or begin a nested-name-specifier. Parsing it will replace
13559 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
13560 handling below decide what to do. */
13566 /* Consume the `typeof' token. */
13568 /* Parse the operand to `typeof'. */
13570 /* If it is not already a TYPE, take its type. */
13600 }
13602 /* If token is an already-parsed decltype not followed by ::,
13603 it's a simple-type-specifier. */
13606 {
13614 }
13616 /* If the type-specifier was for a built-in type, we're done. */
13618 {
13619 /* Record the type. */
13626 type,
13632 /* Consume the token. */
13635 /* There is no valid C++ program where a non-template type is
13636 followed by a "<". That usually indicates that the user thought
13637 that the type was a template. */
13641 }
13643 /* The type-specifier must be a user-defined type. */
13645 {
13649 /* Don't gobble tokens or issue error messages if this is an
13650 optional type-specifier. */
13654 /* Look for the optional `::' operator. */
13655 global_p
13659 /* Look for the nested-name specifier. */
13660 qualified_p
13668 /* If we have seen a nested-name-specifier, and the next token
13669 is `template', then we are using the template-id production. */
13672 {
13673 /* Look for the template-id. */
13678 /* If the template-id did not name a type, we are out of
13679 luck. */
13681 {
13684 }
13685 }
13686 /* Otherwise, look for a type-name. */
13687 else
13689 /* Keep track of all name-lookups performed in class scopes. */
13691 && !global_p
13692 && !qualified_p
13696 /* If it didn't work out, we don't have a TYPE. */
13704 }
13706 /* If we didn't get a type-name, issue an error message. */
13708 {
13711 }
13714 {
13715 /* See if TYPE is an Objective-C type, and if so, parse and
13716 accept any protocol references following it. Do this before
13717 the cp_parser_check_for_invalid_template_id() call, because
13718 Objective-C types can be followed by '<...>' which would
13719 enclose protocol names rather than template arguments, and so
13720 everything is fine. */
13723 {
13727 /* Clobber the "unqualified" type previously entered into
13728 DECL_SPECS with the new, improved protocol-qualified version. */
13733 }
13735 /* There is no valid C++ program where a non-template type is
13736 followed by a "<". That usually indicates that the user
13737 thought that the type was a template. */
13740 }
13743 }
13745 /* Parse a type-name.
13747 type-name:
13748 class-name
13749 enum-name
13750 typedef-name
13751 simple-template-id [in c++0x]
13753 enum-name:
13754 identifier
13756 typedef-name:
13757 identifier
13759 Returns a TYPE_DECL for the type. */
13761 static tree
13763 {
13764 tree type_decl;
13766 /* We can't know yet whether it is a class-name or not. */
13768 /* Try a class-name. */
13772 none_type,
13776 /* If it's not a class-name, keep looking. */
13778 {
13780 /* It must be a typedef-name or an enum-name. */
13784 /* It is either a simple-template-id representing an
13785 instantiation of an alias template... */
13790 /* Note that this must be an instantiation of an alias template
13791 because [temp.names]/6 says:
13793 A template-id that names an alias template specialization
13794 is a type-name.
13796 Whereas [temp.names]/7 says:
13798 A simple-template-id that names a class template
13799 specialization is a class-name. */
13804 else
13808 /* ... Or a typedef-name or an enum-name. */
13810 }
13813 }
13815 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
13817 enum-name:
13818 identifier
13820 typedef-name:
13821 identifier
13823 Returns a TYPE_DECL for the type. */
13825 static tree
13827 {
13828 tree type_decl;
13829 tree identifier;
13836 /* Look up the type-name. */
13840 {
13844 {
13845 /* We have found a type introduced by a using
13846 declaration at class scope that refers to a dependent
13847 type.
13849 using typename :: [opt] nested-name-specifier unqualified-id ;
13850 */
13856 }
13857 }
13861 {
13862 /* See if this is an Objective-C type. */
13867 }
13869 /* Issue an error if we did not find a type-name. */
13871 /* In Objective-C, we have the complication that class names are
13872 normally type names and start declarations (eg, the
13873 "NSObject" in "NSObject *object;"), but can be used in an
13874 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
13875 is an expression. So, a classname followed by a dot is not a
13876 valid type-name. */
13879 {
13884 }
13885 /* Remember that the name was used in the definition of the
13886 current class so that we can check later to see if the
13887 meaning would have been different after the class was
13888 entirely defined. */
13894 }
13896 /* Parse an elaborated-type-specifier. Note that the grammar given
13897 here incorporates the resolution to DR68.
13899 elaborated-type-specifier:
13900 class-key :: [opt] nested-name-specifier [opt] identifier
13901 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
13902 enum-key :: [opt] nested-name-specifier [opt] identifier
13903 typename :: [opt] nested-name-specifier identifier
13904 typename :: [opt] nested-name-specifier template [opt]
13905 template-id
13907 GNU extension:
13909 elaborated-type-specifier:
13910 class-key attributes :: [opt] nested-name-specifier [opt] identifier
13911 class-key attributes :: [opt] nested-name-specifier [opt]
13912 template [opt] template-id
13913 enum attributes :: [opt] nested-name-specifier [opt] identifier
13915 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
13916 declared `friend'. If IS_DECLARATION is TRUE, then this
13917 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
13918 something is being declared.
13920 Returns the TYPE specified. */
13922 static tree
13926 {
13928 tree identifier;
13931 tree globalscope;
13934 /* See if we're looking at the `enum' keyword. */
13936 {
13937 /* Consume the `enum' token. */
13939 /* Remember that it's an enumeration type. */
13941 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
13942 enums) is used here. */
13945 {
13949 /* Consume the `struct' or `class' and parse it anyway. */
13951 }
13952 /* Parse the attributes. */
13954 }
13955 /* Or, it might be `typename'. */
13957 RID_TYPENAME))
13958 {
13959 /* Consume the `typename' token. */
13961 /* Remember that it's a `typename' type. */
13963 }
13964 /* Otherwise it must be a class-key. */
13965 else
13966 {
13970 /* Parse the attributes. */
13972 }
13974 /* Look for the `::' operator. */
13977 /* Look for the nested-name-specifier. */
13979 {
13984 is_declaration))
13986 }
13987 else
13988 /* Even though `typename' is not present, the proposed resolution
13989 to Core Issue 180 says that in `class A<T>::B', `B' should be
13990 considered a type-name, even if `A<T>' is dependent. */
13995 is_declaration);
13996 /* For everything but enumeration types, consider a template-id.
13997 For an enumeration type, consider only a plain identifier. */
13999 {
14001 tree decl;
14003 /* Allow the `template' keyword. */
14005 /* If we didn't see `template', we don't know if there's a
14006 template-id or not. */
14009 /* Parse the template-id. */
14013 is_declaration);
14014 /* If we didn't find a template-id, look for an ordinary
14015 identifier. */
14017 ;
14018 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
14019 in effect, then we must assume that, upon instantiation, the
14020 template will correspond to a class. */
14024 typename_type,
14026 /* If the `typename' keyword is in effect and DECL is not a type
14027 decl. Then type is non existant. */
14030 else
14033 }
14036 {
14041 {
14044 }
14046 /* For a `typename', we needn't call xref_tag. */
14050 identifier,
14052 /* Look up a qualified name in the usual way. */
14054 {
14055 tree decl;
14056 tree ambiguous_decls;
14059 tag_type,
14066 /* If the lookup was ambiguous, an error will already have been
14067 issued. */
14071 /* If we are parsing friend declaration, DECL may be a
14072 TEMPLATE_DECL tree node here. However, we need to check
14073 whether this TEMPLATE_DECL results in valid code. Consider
14074 the following example:
14076 namespace N {
14077 template <class T> class C {};
14078 }
14079 class X {
14080 template <class T> friend class N::C; // #1, valid code
14081 };
14082 template <class T> class Y {
14083 friend class N::C; // #2, invalid code
14084 };
14086 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
14087 name lookup of `N::C'. We see that friend declaration must
14088 be template for the code to be valid. Note that
14089 processing_template_decl does not work here since it is
14090 always 1 for the above two cases. */
14092 decl = (cp_parser_maybe_treat_template_as_class
14097 {
14100 identifier,
14103 }
14106 {
14110 allow_template);
14114 }
14116 /* Forward declarations of nested types, such as
14118 class C1::C2;
14119 class C1::C2::C3;
14121 are invalid unless all components preceding the final '::'
14122 are complete. If all enclosing types are complete, these
14123 declarations become merely pointless.
14125 Invalid forward declarations of nested types are errors
14126 caught elsewhere in parsing. Those that are pointless arrive
14127 here. */
14134 }
14135 else
14136 {
14137 /* An elaborated-type-specifier sometimes introduces a new type and
14138 sometimes names an existing type. Normally, the rule is that it
14139 introduces a new type only if there is not an existing type of
14140 the same name already in scope. For example, given:
14142 struct S {};
14143 void f() { struct S s; }
14145 the `struct S' in the body of `f' is the same `struct S' as in
14146 the global scope; the existing definition is used. However, if
14147 there were no global declaration, this would introduce a new
14148 local class named `S'.
14150 An exception to this rule applies to the following code:
14152 namespace N { struct S; }
14154 Here, the elaborated-type-specifier names a new type
14155 unconditionally; even if there is already an `S' in the
14156 containing scope this declaration names a new type.
14157 This exception only applies if the elaborated-type-specifier
14158 forms the complete declaration:
14160 [class.name]
14162 A declaration consisting solely of `class-key identifier ;' is
14163 either a redeclaration of the name in the current scope or a
14164 forward declaration of the identifier as a class name. It
14165 introduces the name into the current scope.
14167 We are in this situation precisely when the next token is a `;'.
14169 An exception to the exception is that a `friend' declaration does
14170 *not* name a new type; i.e., given:
14172 struct S { friend struct T; };
14174 `T' is not a new type in the scope of `S'.
14176 Also, `new struct S' or `sizeof (struct S)' never results in the
14177 definition of a new type; a new type can only be declared in a
14178 declaration context. */
14180 tag_scope ts;
14184 /* Friends have special name lookup rules. */
14188 CPP_SEMICOLON))
14189 /* This is a `class-key identifier ;' */
14191 else
14194 template_p =
14198 /* An unqualified name was used to reference this type, so
14199 there were no qualifying templates. */
14206 }
14207 }
14212 /* Allow attributes on forward declarations of classes. */
14214 {
14224 else
14227 }
14230 {
14231 /* Indicate whether this class was declared as a `class' or as a
14232 `struct'. */
14236 }
14238 /* A "<" cannot follow an elaborated type specifier. If that
14239 happens, the user was probably trying to form a template-id. */
14243 }
14245 /* Parse an enum-specifier.
14247 enum-specifier:
14248 enum-head { enumerator-list [opt] }
14249 enum-head { enumerator-list , } [C++0x]
14251 enum-head:
14252 enum-key identifier [opt] enum-base [opt]
14253 enum-key nested-name-specifier identifier enum-base [opt]
14255 enum-key:
14256 enum
14257 enum class [C++0x]
14258 enum struct [C++0x]
14260 enum-base: [C++0x]
14261 : type-specifier-seq
14263 opaque-enum-specifier:
14264 enum-key identifier enum-base [opt] ;
14266 GNU Extensions:
14267 enum-key attributes[opt] identifier [opt] enum-base [opt]
14268 { enumerator-list [opt] }attributes[opt]
14269 enum-key attributes[opt] identifier [opt] enum-base [opt]
14270 { enumerator-list, }attributes[opt] [C++0x]
14272 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
14273 if the token stream isn't an enum-specifier after all. */
14275 static tree
14277 {
14278 tree identifier;
14280 tree prev_scope;
14282 tree attributes;
14295 /* Parse tentatively so that we can back up if we don't find a
14296 enum-specifier. */
14299 /* Caller guarantees that the current token is 'enum', an identifier
14300 possibly follows, and the token after that is an opening brace.
14301 If we don't have an identifier, fabricate an anonymous name for
14302 the enumeration being defined. */
14305 /* Parse the "class" or "struct", which indicates a scoped
14306 enumeration type in C++0x. */
14309 {
14313 /* Consume the `struct' or `class' token. */
14317 }
14321 /* Clear the qualification. */
14326 /* Figure out in what scope the declaration is being placed. */
14332 nested_name_specifier
14340 {
14341 tree name;
14345 enum_type,
14350 input_location);
14352 {
14355 {
14356 /* Are template enums allowed in ISO? */
14360 /* ignore a typename reference, for it will be solved by name
14361 in start_enum. */
14363 }
14364 }
14365 else
14368 }
14369 else
14370 {
14373 else
14374 {
14377 }
14378 }
14381 /* Check for the `:' that denotes a specified underlying type in C++0x.
14382 Note that a ':' could also indicate a bitfield width, however. */
14384 {
14385 cp_decl_specifier_seq type_specifiers;
14387 /* Consume the `:'. */
14390 /* Parse the type-specifier-seq. */
14395 /* At this point this is surely not elaborated type specifier. */
14404 /* If that didn't work, stop. */
14406 {
14411 }
14412 }
14414 /* Look for the `{' but don't consume it yet. */
14416 {
14418 {
14421 {
14424 }
14425 }
14426 /* An opaque-enum-specifier must have a ';' here. */
14429 {
14432 {
14435 }
14436 }
14437 }
14443 {
14445 {
14449 }
14451 {
14453 }
14454 }
14456 /* Issue an error message if type-definitions are forbidden here. */
14459 else
14460 /* Create the new type. We do this before consuming the opening
14461 brace so the enum will be recorded as being on the line of its
14462 tag (or the 'enum' keyword, if there is no tag). */
14466 /* If the next token is not '{' it is an opaque-enum-specifier or an
14467 elaborated-type-specifier. */
14469 {
14472 {
14473 /* The following catches invalid code such as:
14474 enum class S<int>::E { A, B, C }; */
14481 /* If that scope does not contain the scope in which the
14482 class was originally declared, the program is invalid. */
14484 {
14487 "declaration of %qD in namespace %qD which does not "
14490 else
14495 }
14496 }
14501 /* Consume the opening brace. */
14508 {
14512 }
14513 else
14514 {
14519 }
14523 /* If the next token is not '}', then there are some enumerators. */
14527 /* Consume the final '}'. */
14533 }
14534 else
14535 {
14536 /* If a ';' follows, then it is an opaque-enum-specifier
14537 and additional restrictions apply. */
14539 {
14546 }
14547 }
14549 /* Look for trailing attributes to apply to this enumeration, and
14550 apply them if appropriate. */
14552 {
14556 trailing_attr,
14558 }
14560 /* Finish up the enumeration. */
14562 {
14567 }
14570 {
14572 {
14575 }
14577 {
14579 }
14580 }
14581 out:
14584 }
14586 /* Parse an enumerator-list. The enumerators all have the indicated
14587 TYPE.
14589 enumerator-list:
14590 enumerator-definition
14591 enumerator-list , enumerator-definition */
14593 static void
14595 {
14597 {
14598 /* Parse an enumerator-definition. */
14601 /* If the next token is not a ',', we've reached the end of
14602 the list. */
14605 /* Otherwise, consume the `,' and keep going. */
14607 /* If the next token is a `}', there is a trailing comma. */
14609 {
14614 }
14615 }
14616 }
14618 /* Parse an enumerator-definition. The enumerator has the indicated
14619 TYPE.
14621 enumerator-definition:
14622 enumerator
14623 enumerator = constant-expression
14625 enumerator:
14626 identifier */
14628 static void
14630 {
14631 tree identifier;
14632 tree value;
14633 location_t loc;
14635 /* Save the input location because we are interested in the location
14636 of the identifier and not the location of the explicit value. */
14639 /* Look for the identifier. */
14644 /* If the next token is an '=', then there is an explicit value. */
14646 {
14647 /* Consume the `=' token. */
14649 /* Parse the value. */
14652 NULL);
14653 }
14654 else
14657 /* If we are processing a template, make sure the initializer of the
14658 enumerator doesn't contain any bare template parameter pack. */
14662 /* integral_constant_value will pull out this expression, so make sure
14663 it's folded as appropriate. */
14666 /* Create the enumerator. */
14668 }
14670 /* Parse a namespace-name.
14672 namespace-name:
14673 original-namespace-name
14674 namespace-alias
14676 Returns the NAMESPACE_DECL for the namespace. */
14678 static tree
14680 {
14681 tree identifier;
14682 tree namespace_decl;
14686 /* Get the name of the namespace. */
14691 /* Look up the identifier in the currently active scope. Look only
14692 for namespaces, due to:
14694 [basic.lookup.udir]
14696 When looking up a namespace-name in a using-directive or alias
14697 definition, only namespace names are considered.
14699 And:
14701 [basic.lookup.qual]
14703 During the lookup of a name preceding the :: scope resolution
14704 operator, object, function, and enumerator names are ignored.
14706 (Note that cp_parser_qualifying_entity only calls this
14707 function if the token after the name is the scope resolution
14708 operator.) */
14710 none_type,
14716 /* If it's not a namespace, issue an error. */
14719 {
14724 }
14727 }
14729 /* Parse a namespace-definition.
14731 namespace-definition:
14732 named-namespace-definition
14733 unnamed-namespace-definition
14735 named-namespace-definition:
14736 original-namespace-definition
14737 extension-namespace-definition
14739 original-namespace-definition:
14740 namespace identifier { namespace-body }
14742 extension-namespace-definition:
14743 namespace original-namespace-name { namespace-body }
14745 unnamed-namespace-definition:
14746 namespace { namespace-body } */
14748 static void
14750 {
14756 {
14760 }
14761 else
14764 /* Look for the `namespace' keyword. */
14767 /* Get the name of the namespace. We do not attempt to distinguish
14768 between an original-namespace-definition and an
14769 extension-namespace-definition at this point. The semantic
14770 analysis routines are responsible for that. */
14773 else
14776 /* Parse any specified attributes. */
14779 /* Look for the `{' to start the namespace. */
14781 /* Start the namespace. */
14784 /* "inline namespace" is equivalent to a stub namespace definition
14785 followed by a strong using directive. */
14787 {
14789 /* Set up namespace association. */
14793 /* Import the contents of the inline namespace. */
14797 }
14801 /* Parse the body of the namespace. */
14807 /* Finish the namespace. */
14809 /* Look for the final `}'. */
14811 }
14813 /* Parse a namespace-body.
14815 namespace-body:
14816 declaration-seq [opt] */
14818 static void
14820 {
14822 }
14824 /* Parse a namespace-alias-definition.
14826 namespace-alias-definition:
14827 namespace identifier = qualified-namespace-specifier ; */
14829 static void
14831 {
14832 tree identifier;
14833 tree namespace_specifier;
14837 /* Look for the `namespace' keyword. */
14839 /* Look for the identifier. */
14843 /* Look for the `=' token. */
14846 {
14848 /* Skip the definition. */
14853 }
14855 /* Look for the qualified-namespace-specifier. */
14856 namespace_specifier
14858 /* Look for the `;' token. */
14861 /* Register the alias in the symbol table. */
14863 }
14865 /* Parse a qualified-namespace-specifier.
14867 qualified-namespace-specifier:
14868 :: [opt] nested-name-specifier [opt] namespace-name
14870 Returns a NAMESPACE_DECL corresponding to the specified
14871 namespace. */
14873 static tree
14875 {
14876 /* Look for the optional `::'. */
14880 /* Look for the optional nested-name-specifier. */
14888 }
14890 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
14891 access declaration.
14893 using-declaration:
14894 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
14895 using :: unqualified-id ;
14897 access-declaration:
14898 qualified-id ;
14900 */
14902 static bool
14905 {
14909 tree decl;
14910 tree identifier;
14911 tree qscope;
14916 {
14919 }
14920 else
14921 {
14922 /* Look for the `using' keyword. */
14925 /* Peek at the next token. */
14927 /* See if it's `typename'. */
14929 {
14930 /* Remember that we've seen it. */
14932 /* Consume the `typename' token. */
14934 }
14935 }
14937 /* Look for the optional global scope qualification. */
14938 global_scope_p
14943 /* If we saw `typename', or didn't see `::', then there must be a
14944 nested-name-specifier present. */
14950 /* Otherwise, we could be in either of the two productions. In that
14951 case, treat the nested-name-specifier as optional. */
14952 else
14962 /* Something has already gone wrong; there's no need to parse
14963 further. Since an error has occurred, the return value of
14964 cp_parser_parse_definitely will be false, as required. */
14968 /* Parse the unqualified-id. */
14976 {
14981 }
14983 /* The function we call to handle a using-declaration is different
14984 depending on what scope we are in. */
14986 ;
14989 /* [namespace.udecl]
14991 A using declaration shall not name a template-id. */
14994 else
14995 {
14997 {
14998 /* Create the USING_DECL. */
15006 else
15007 /* Add it to the list of members in this class. */
15009 }
15010 else
15011 {
15013 identifier,
15023 else
15025 }
15026 }
15028 /* Look for the final `;'. */
15033 "access declarations are deprecated "
15034 "in favour of using-declarations; "
15038 }
15040 /* Parse an alias-declaration.
15042 alias-declaration:
15043 using identifier attribute-specifier-seq [opt] = type-id */
15045 static tree
15047 {
15049 location_t id_location;
15051 cp_decl_specifier_seq decl_specs;
15055 /* Look for the `using' keyword. */
15068 /* Now we are going to parse the type-id of the declaration. */
15070 /*
15071 [dcl.type]/3 says:
15073 "A type-specifier-seq shall not define a class or enumeration
15074 unless it appears in the type-id of an alias-declaration (7.1.3) that
15075 is not the declaration of a template-declaration."
15077 In other words, if we currently are in an alias template, the
15078 type-id should not define a type.
15080 So let's set parser->type_definition_forbidden_message in that
15081 case; cp_parser_check_type_definition (called by
15082 cp_parser_class_specifier) will then emit an error if a type is
15083 defined in the type-id. */
15085 {
15089 }
15093 /* Restore the error message if need be. */
15102 /* A typedef-name can also be introduced by an alias-declaration. The
15103 identifier following the using keyword becomes a typedef-name. It has
15104 the same semantics as if it were introduced by the typedef
15105 specifier. In particular, it does not define a new type and it shall
15106 not appear in the type-id. */
15121 else
15132 /* If decl is a template, return its TEMPLATE_DECL so that it gets
15133 added into the symbol table; otherwise, return the TYPE_DECL. */
15137 {
15141 }
15144 }
15146 /* Parse a using-directive.
15148 using-directive:
15149 using namespace :: [opt] nested-name-specifier [opt]
15150 namespace-name ; */
15152 static void
15154 {
15155 tree namespace_decl;
15156 tree attribs;
15158 /* Look for the `using' keyword. */
15160 /* And the `namespace' keyword. */
15162 /* Look for the optional `::' operator. */
15164 /* And the optional nested-name-specifier. */
15170 /* Get the namespace being used. */
15172 /* And any specified attributes. */
15174 /* Update the symbol table. */
15176 /* Look for the final `;'. */
15178 }
15180 /* Parse an asm-definition.
15182 asm-definition:
15183 asm ( string-literal ) ;
15185 GNU Extension:
15187 asm-definition:
15188 asm volatile [opt] ( string-literal ) ;
15189 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
15190 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15191 : asm-operand-list [opt] ) ;
15192 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15193 : asm-operand-list [opt]
15194 : asm-clobber-list [opt] ) ;
15195 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
15196 : asm-clobber-list [opt]
15197 : asm-goto-list ) ; */
15199 static void
15201 {
15202 tree string;
15207 tree asm_stmt;
15215 /* Look for the `asm' keyword. */
15217 /* See if the next token is `volatile'. */
15220 {
15221 /* Remember that we saw the `volatile' keyword. */
15223 /* Consume the token. */
15225 }
15229 {
15230 /* Remember that we saw the `goto' keyword. */
15232 /* Consume the token. */
15234 }
15235 /* Look for the opening `('. */
15238 /* Look for the string. */
15241 {
15245 }
15247 /* If we're allowing GNU extensions, check for the extended assembly
15248 syntax. Unfortunately, the `:' tokens need not be separated by
15249 a space in C, and so, for compatibility, we tolerate that here
15250 too. Doing that means that we have to treat the `::' operator as
15251 two `:' tokens. */
15256 {
15261 /* The extended syntax was used. */
15264 /* Look for outputs. */
15266 {
15267 /* Consume the `:'. */
15269 /* Parse the output-operands. */
15271 CPP_COLON)
15273 CPP_SCOPE)
15275 CPP_CLOSE_PAREN)
15281 }
15282 /* If the next token is `::', there are no outputs, and the
15283 next token is the beginning of the inputs. */
15285 /* The inputs are coming next. */
15288 /* Look for inputs. */
15291 {
15292 /* Consume the `:' or `::'. */
15294 /* Parse the output-operands. */
15296 CPP_COLON)
15298 CPP_SCOPE)
15300 CPP_CLOSE_PAREN))
15305 }
15307 /* The clobbers are coming next. */
15310 /* Look for clobbers. */
15313 {
15315 /* Consume the `:' or `::'. */
15317 /* Parse the clobbers. */
15319 CPP_COLON)
15321 CPP_CLOSE_PAREN))
15323 }
15326 /* The labels are coming next. */
15329 /* Look for labels. */
15332 {
15334 /* Consume the `:' or `::'. */
15336 /* Parse the labels. */
15338 }
15342 }
15346 /* Look for the closing `)'. */
15354 {
15355 /* Create the ASM_EXPR. */
15357 {
15360 /* If the extended syntax was not used, mark the ASM_EXPR. */
15362 {
15368 }
15369 }
15370 else
15372 }
15373 }
15375 /* Declarators [gram.dcl.decl] */
15377 /* Parse an init-declarator.
15379 init-declarator:
15380 declarator initializer [opt]
15382 GNU Extension:
15384 init-declarator:
15385 declarator asm-specification [opt] attributes [opt] initializer [opt]
15387 function-definition:
15388 decl-specifier-seq [opt] declarator ctor-initializer [opt]
15389 function-body
15390 decl-specifier-seq [opt] declarator function-try-block
15392 GNU Extension:
15394 function-definition:
15395 __extension__ function-definition
15397 TM Extension:
15399 function-definition:
15400 decl-specifier-seq [opt] declarator function-transaction-block
15402 The DECL_SPECIFIERS apply to this declarator. Returns a
15403 representation of the entity declared. If MEMBER_P is TRUE, then
15404 this declarator appears in a class scope. The new DECL created by
15405 this declarator is returned.
15407 The CHECKS are access checks that should be performed once we know
15408 what entity is being declared (and, therefore, what classes have
15409 befriended it).
15411 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
15412 for a function-definition here as well. If the declarator is a
15413 declarator for a function-definition, *FUNCTION_DEFINITION_P will
15414 be TRUE upon return. By that point, the function-definition will
15415 have been completely parsed.
15417 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
15418 is FALSE.
15420 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15421 parsed declaration if it is an uninitialized single declarator not followed
15422 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15423 if present, will not be consumed. If returned, this declarator will be
15424 created with SD_INITIALIZED but will not call cp_finish_decl. */
15426 static tree
15435 {
15439 tree prefix_attributes;
15440 tree attributes;
15441 tree asm_specification;
15442 tree initializer;
15444 tree scope;
15446 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
15447 initialized with "= ..", CPP_OPEN_PAREN if initialized with
15448 "(...)". */
15457 /* Gather the attributes that were provided with the
15458 decl-specifiers. */
15461 /* Assume that this is not the declarator for a function
15462 definition. */
15466 /* Defer access checks while parsing the declarator; we cannot know
15467 what names are accessible until we know what is being
15468 declared. */
15471 /* Parse the declarator. */
15473 declarator
15477 member_p);
15478 /* Gather up the deferred checks. */
15481 /* If the DECLARATOR was erroneous, there's no need to go
15482 further. */
15486 /* Check that the number of template-parameter-lists is OK. */
15496 /* Figure out what scope the entity declared by the DECLARATOR is
15497 located in. `grokdeclarator' sometimes changes the scope, so
15498 we compute it now. */
15501 /* Perform any lookups in the declared type which were thought to be
15502 dependent, but are not in the scope of the declarator. */
15503 decl_specifiers->type
15506 /* If we're allowing GNU extensions, look for an asm-specification
15507 and attributes. */
15509 {
15510 /* Look for an asm-specification. */
15513 /* And attributes. */
15516 }
15517 else
15518 {
15521 }
15523 /* Peek at the next token. */
15525 /* Check to see if the token indicates the start of a
15526 function-definition. */
15529 {
15531 {
15532 /* If a function-definition should not appear here, issue an
15533 error message. */
15537 }
15538 else
15539 {
15540 location_t func_brace_location
15543 /* Neither attributes nor an asm-specification are allowed
15544 on a function-definition. */
15547 "an asm-specification is not allowed "
15552 /* This is a function-definition. */
15555 /* Parse the function definition. */
15558 decl_specifiers,
15559 declarator,
15560 prefix_attributes);
15561 else
15562 decl
15563 = (cp_parser_function_definition_from_specifiers_and_declarator
15567 {
15568 /* This is where the prologue starts... */
15571 }
15574 }
15575 }
15577 /* [dcl.dcl]
15579 Only in function declarations for constructors, destructors, and
15580 type conversions can the decl-specifier-seq be omitted.
15582 We explicitly postpone this check past the point where we handle
15583 function-definitions because we tolerate function-definitions
15584 that are missing their return types in some modes. */
15586 {
15590 }
15592 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
15596 {
15604 {
15610 }
15611 }
15612 else
15613 {
15614 /* If the init-declarator isn't initialized and isn't followed by a
15615 `,' or `;', it's not a valid init-declarator. */
15618 {
15621 else
15622 {
15625 }
15626 }
15629 }
15631 /* Because start_decl has side-effects, we should only call it if we
15632 know we're going ahead. By this point, we know that we cannot
15633 possibly be looking at any other construct. */
15636 /* If the decl specifiers were bad, issue an error now that we're
15637 sure this was intended to be a declarator. Then continue
15638 declaring the variable(s), as int, to try to cut down on further
15639 errors. */
15642 {
15645 }
15647 /* Check to see whether or not this declaration is a friend. */
15650 /* Enter the newly declared entry in the symbol table. If we're
15651 processing a declaration in a class-specifier, we wait until
15652 after processing the initializer. */
15654 {
15661 /* Adjust location of decl if declarator->id_loc is more appropriate:
15662 set, and decl wasn't merged with another decl, in which case its
15663 location would be different from input_location, and more accurate. */
15668 }
15670 /* Enter the SCOPE. That way unqualified names appearing in the
15671 initializer will be looked up in SCOPE. */
15674 /* Perform deferred access control checks, now that we know in which
15675 SCOPE the declared entity resides. */
15677 {
15680 /* If the entity being declared is a function, pretend that we
15681 are in its scope. If it is a `friend', it may have access to
15682 things that would not otherwise be accessible. */
15684 {
15687 }
15689 /* Perform access checks for template parameters. */
15692 /* Perform the access control checks for the declarator and the
15693 decl-specifiers. */
15696 /* Restore the saved value. */
15699 }
15701 /* Parse the initializer. */
15706 {
15708 {
15712 else
15713 {
15714 /* If the declaration was erroneous, we don't really
15715 know what the user intended, so just silently
15716 consume the initializer. */
15724 }
15725 }
15726 else
15727 {
15728 /* We want to record the extra mangling scope for in-class
15729 initializers of class members and initializers of static data
15730 member templates. The former involves deferring
15731 parsing of the initializer until end of class as with default
15732 arguments. So right here we only handle the latter. */
15740 }
15741 }
15743 /* The old parser allows attributes to appear after a parenthesized
15744 initializer. Mark Mitchell proposed removing this functionality
15745 on the GCC mailing lists on 2002-08-13. This parser accepts the
15746 attributes -- but ignores them. */
15753 /* For an in-class declaration, use `grokfield' to create the
15754 declaration. */
15756 {
15758 {
15761 }
15765 prefix_attributes);
15768 }
15770 /* Finish processing the declaration. But, skip member
15771 declarations. */
15773 {
15776 asm_specification,
15777 /* If the initializer is in parentheses, then this is
15778 a direct-initialization, which means that an
15779 `explicit' constructor is OK. Otherwise, an
15780 `explicit' constructor cannot be used. */
15783 }
15786 /* Core issue #226 (C++0x only): A default template-argument
15787 shall not be specified in a friend class template
15788 declaration. */
15796 }
15798 /* Parse a declarator.
15800 declarator:
15801 direct-declarator
15802 ptr-operator declarator
15804 abstract-declarator:
15805 ptr-operator abstract-declarator [opt]
15806 direct-abstract-declarator
15808 GNU Extensions:
15810 declarator:
15811 attributes [opt] direct-declarator
15812 attributes [opt] ptr-operator declarator
15814 abstract-declarator:
15815 attributes [opt] ptr-operator abstract-declarator [opt]
15816 attributes [opt] direct-abstract-declarator
15818 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
15819 detect constructor, destructor or conversion operators. It is set
15820 to -1 if the declarator is a name, and +1 if it is a
15821 function. Otherwise it is set to zero. Usually you just want to
15822 test for >0, but internally the negative value is used.
15824 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
15825 a decl-specifier-seq unless it declares a constructor, destructor,
15826 or conversion. It might seem that we could check this condition in
15827 semantic analysis, rather than parsing, but that makes it difficult
15828 to handle something like `f()'. We want to notice that there are
15829 no decl-specifiers, and therefore realize that this is an
15830 expression, not a declaration.)
15832 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
15833 the declarator is a direct-declarator of the form "(...)".
15835 MEMBER_P is true iff this declarator is a member-declarator. */
15839 cp_parser_declarator_kind dcl_kind,
15843 {
15846 cp_cv_quals cv_quals;
15847 tree class_type;
15850 /* Assume this is not a constructor, destructor, or type-conversion
15851 operator. */
15858 /* Check for the ptr-operator production. */
15860 /* Parse the ptr-operator. */
15864 /* If that worked, then we have a ptr-operator. */
15866 {
15867 /* If a ptr-operator was found, then this declarator was not
15868 parenthesized. */
15871 /* The dependent declarator is optional if we are parsing an
15872 abstract-declarator. */
15876 /* Parse the dependent declarator. */
15882 /* If we are parsing an abstract-declarator, we must handle the
15883 case where the dependent declarator is absent. */
15888 declarator = cp_parser_make_indirect_declarator
15890 }
15891 /* Everything else is a direct-declarator. */
15892 else
15893 {
15896 CPP_OPEN_PAREN);
15898 ctor_dtor_or_conv_p,
15899 member_p);
15900 }
15906 }
15908 /* Parse a direct-declarator or direct-abstract-declarator.
15910 direct-declarator:
15911 declarator-id
15912 direct-declarator ( parameter-declaration-clause )
15913 cv-qualifier-seq [opt]
15914 exception-specification [opt]
15915 direct-declarator [ constant-expression [opt] ]
15916 ( declarator )
15918 direct-abstract-declarator:
15919 direct-abstract-declarator [opt]
15920 ( parameter-declaration-clause )
15921 cv-qualifier-seq [opt]
15922 exception-specification [opt]
15923 direct-abstract-declarator [opt] [ constant-expression [opt] ]
15924 ( abstract-declarator )
15926 Returns a representation of the declarator. DCL_KIND is
15927 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
15928 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
15929 we are parsing a direct-declarator. It is
15930 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
15931 of ambiguity we prefer an abstract declarator, as per
15932 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
15933 cp_parser_declarator. */
15937 cp_parser_declarator_kind dcl_kind,
15940 {
15950 {
15951 /* Peek at the next token. */
15954 {
15955 /* This is either a parameter-declaration-clause, or a
15956 parenthesized declarator. When we know we are parsing a
15957 named declarator, it must be a parenthesized declarator
15958 if FIRST is true. For instance, `(int)' is a
15959 parameter-declaration-clause, with an omitted
15960 direct-abstract-declarator. But `((*))', is a
15961 parenthesized abstract declarator. Finally, when T is a
15962 template parameter `(T)' is a
15963 parameter-declaration-clause, and not a parenthesized
15964 named declarator.
15966 We first try and parse a parameter-declaration-clause,
15967 and then try a nested declarator (if FIRST is true).
15969 It is not an error for it not to be a
15970 parameter-declaration-clause, even when FIRST is
15971 false. Consider,
15973 int i (int);
15974 int i (3);
15976 The first is the declaration of a function while the
15977 second is the definition of a variable, including its
15978 initializer.
15980 Having seen only the parenthesis, we cannot know which of
15981 these two alternatives should be selected. Even more
15982 complex are examples like:
15984 int i (int (a));
15985 int i (int (3));
15987 The former is a function-declaration; the latter is a
15988 variable initialization.
15990 Thus again, we try a parameter-declaration-clause, and if
15991 that fails, we back out and return. */
15994 {
15995 tree params;
15998 tree t;
16000 /* In a member-declarator, the only valid interpretation
16001 of a parenthesis is the start of a
16002 parameter-declaration-clause. (It is invalid to
16003 initialize a static data member with a parenthesized
16004 initializer; only the "=" form of initialization is
16005 permitted.) */
16009 /* Consume the `('. */
16012 {
16013 /* If this is going to be an abstract declarator, we're
16014 in a declarator and we can't have default args. */
16017 }
16019 /* Inside the function parameter list, surrounding
16020 template-parameter-lists do not apply. */
16021 saved_num_template_parameter_lists
16027 /* Parse the parameter-declaration-clause. */
16030 parser->num_template_parameter_lists
16033 /* Consume the `)'. */
16036 /* If all went well, parse the cv-qualifier-seq and the
16037 exception-specification. */
16039 {
16040 cp_cv_quals cv_quals;
16041 cp_virt_specifiers virt_specifiers;
16042 tree exception_specification;
16043 tree late_return;
16051 /* Parse the cv-qualifier-seq. */
16053 /* And the exception-specification. */
16054 exception_specification
16056 /* Parse the virt-specifier-seq. */
16059 late_return = (cp_parser_late_return_type_opt
16062 /* Create the function-declarator. */
16064 params,
16065 cv_quals,
16066 virt_specifiers,
16067 exception_specification,
16068 late_return);
16069 /* Any subsequent parameter lists are to do with
16070 return type, so are not those of the declared
16071 function. */
16073 }
16075 /* Remove the function parms from scope. */
16081 /* Repeat the main loop. */
16083 }
16085 /* If this is the first, we can try a parenthesized
16086 declarator. */
16088 {
16094 /* Consume the `('. */
16096 /* Parse the nested declarator. */
16099 declarator
16102 member_p);
16105 /* Expect a `)'. */
16112 }
16113 /* Otherwise, we must be done. */
16114 else
16116 }
16119 {
16120 /* Parse an array-declarator. */
16121 tree bounds;
16129 /* Consume the `['. */
16131 /* Peek at the next token. */
16133 /* If the next token is `]', then there is no
16134 constant-expression. */
16136 {
16139 bounds
16149 {
16150 /* Normally, the array bound must be an integral constant
16151 expression. However, as an extension, we allow VLAs
16152 in function scopes as long as they aren't part of a
16153 parameter declaration. */
16157 }
16159 {
16160 /* Remember this wasn't a constant-expression. */
16163 }
16164 }
16165 else
16167 /* Look for the closing `]'. */
16169 {
16172 }
16175 }
16177 {
16178 {
16179 tree qualifying_scope;
16180 tree unqualified_name;
16181 special_function_kind sfk;
16186 /* Parse a declarator-id */
16189 {
16192 /* If we see an ellipsis, we should be looking at a
16193 parameter pack. */
16195 {
16196 /* Consume the `...' */
16200 }
16201 }
16204 unqualified_name
16208 {
16212 {
16213 /* Check whether an error occurred. */
16216 /* We already consumed the ellipsis to mark a
16217 parameter pack, but we have no way to report it,
16218 so abort the tentative parse. We will be exiting
16219 immediately anyway. */
16221 }
16222 else
16228 && (qualifying_scope
16231 {
16234 }
16235 }
16240 {
16245 }
16249 {
16250 /* In the declaration of a member of a template class
16251 outside of the class itself, the SCOPE will sometimes
16252 be a TYPENAME_TYPE. For example, given:
16254 template <typename T>
16255 int S<T>::R::i = 3;
16257 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
16258 this context, we must resolve S<T>::R to an ordinary
16259 type, rather than a typename type.
16261 The reason we normally avoid resolving TYPENAME_TYPEs
16262 is that a specialization of `S' might render
16263 `S<T>::R' not a type. However, if `S' is
16264 specialized, then this `i' will not be used, so there
16265 is no harm in resolving the types here. */
16266 tree type;
16268 /* Resolve the TYPENAME_TYPE. */
16271 /* If that failed, the declarator is invalid. */
16273 {
16276 "cannot define member of dependent typedef "
16278 else
16283 }
16285 }
16290 {
16291 tree class_type;
16296 else
16300 {
16303 {
16306 {
16310 "use %<%T::%D%> instead of %<%T::%D%> to "
16312 class_type,
16317 }
16318 else
16320 }
16321 else
16322 {
16323 /* We do not attempt to print the declarator
16324 here because we do not have enough
16325 information about its original syntactic
16326 form. */
16330 }
16331 }
16334 {
16340 for an anonymous type, even if the type
16341 got a name for linkage purposes. */
16344 class_type))
16345 {
16348 }
16356 }
16357 }
16359 unqualified_name,
16360 sfk);
16366 }
16368 handle_declarator:;
16371 /* Any names that appear after the declarator-id for a
16372 member are looked up in the containing scope. */
16377 /* Default args are only allowed on function
16378 declarations. */
16380 else
16384 }
16385 /* We're done. */
16386 else
16388 }
16390 /* For an abstract declarator, we might wind up with nothing at this
16391 point. That's an error; the declarator is not optional. */
16395 /* If we entered a scope, we must exit it now. */
16403 }
16405 /* Parse a ptr-operator.
16407 ptr-operator:
16408 * cv-qualifier-seq [opt]
16409 &
16410 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
16412 GNU Extension:
16414 ptr-operator:
16415 & cv-qualifier-seq [opt]
16417 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
16418 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
16419 an rvalue reference. In the case of a pointer-to-member, *TYPE is
16420 filled in with the TYPE containing the member. *CV_QUALS is
16421 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
16422 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
16423 Note that the tree codes returned by this function have nothing
16424 to do with the types of trees that will be eventually be created
16425 to represent the pointer or reference type being parsed. They are
16426 just constants with suggestive names. */
16427 static enum tree_code
16431 {
16435 /* Assume that it's not a pointer-to-member. */
16437 /* And that there are no cv-qualifiers. */
16440 /* Peek at the next token. */
16443 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
16453 {
16454 /* Consume the `*', `&' or `&&'. */
16457 /* A `*' can be followed by a cv-qualifier-seq, and so can a
16458 `&', if we are allowing GNU extensions. (The only qualifier
16459 that can legally appear after `&' is `restrict', but that is
16460 enforced during semantic analysis. */
16464 }
16465 else
16466 {
16467 /* Try the pointer-to-member case. */
16469 /* Look for the optional `::' operator. */
16472 /* Look for the nested-name specifier. */
16479 /* If we found it, and the next token is a `*', then we are
16480 indeed looking at a pointer-to-member operator. */
16483 {
16484 /* Indicate that the `*' operator was used. */
16492 else
16493 {
16494 /* The type of which the member is a member is given by the
16495 current SCOPE. */
16497 /* The next name will not be qualified. */
16501 /* Look for the optional cv-qualifier-seq. */
16503 }
16504 }
16505 /* If that didn't work we don't have a ptr-operator. */
16508 }
16511 }
16513 /* Parse an (optional) cv-qualifier-seq.
16515 cv-qualifier-seq:
16516 cv-qualifier cv-qualifier-seq [opt]
16518 cv-qualifier:
16519 const
16520 volatile
16522 GNU Extension:
16524 cv-qualifier:
16525 __restrict__
16527 Returns a bitmask representing the cv-qualifiers. */
16529 static cp_cv_quals
16531 {
16535 {
16537 cp_cv_quals cv_qualifier;
16539 /* Peek at the next token. */
16541 /* See if it's a cv-qualifier. */
16543 {
16559 }
16565 {
16568 }
16569 else
16570 {
16573 }
16574 }
16577 }
16579 /* Parse an (optional) virt-specifier-seq.
16581 virt-specifier-seq:
16582 virt-specifier virt-specifier-seq [opt]
16584 virt-specifier:
16585 override
16586 final
16588 Returns a bitmask representing the virt-specifiers. */
16590 static cp_virt_specifiers
16592 {
16596 {
16598 cp_virt_specifiers virt_specifier;
16600 /* Peek at the next token. */
16602 /* See if it's a virt-specifier-qualifier. */
16606 {
16609 }
16611 {
16614 }
16616 {
16618 }
16619 else
16623 {
16626 }
16627 else
16628 {
16631 }
16632 }
16634 }
16636 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
16637 is in scope even though it isn't real. */
16639 static void
16641 {
16642 tree this_parm;
16645 {
16646 /* We don't clear this between NSDMIs. Is it already what we want? */
16651 }
16654 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
16656 current_class_ref
16659 }
16661 /* Parse a late-specified return type, if any. This is not a separate
16662 non-terminal, but part of a function declarator, which looks like
16664 -> trailing-type-specifier-seq abstract-declarator(opt)
16666 Returns the type indicated by the type-id.
16668 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
16669 function. */
16671 static tree
16673 {
16675 tree type;
16677 /* Peek at the next token. */
16679 /* A late-specified return type is indicated by an initial '->'. */
16683 /* Consume the ->. */
16687 {
16688 /* DR 1207: 'this' is in scope in the trailing return type. */
16691 }
16699 }
16701 /* Parse a declarator-id.
16703 declarator-id:
16704 id-expression
16705 :: [opt] nested-name-specifier [opt] type-name
16707 In the `id-expression' case, the value returned is as for
16708 cp_parser_id_expression if the id-expression was an unqualified-id.
16709 If the id-expression was a qualified-id, then a SCOPE_REF is
16710 returned. The first operand is the scope (either a NAMESPACE_DECL
16711 or TREE_TYPE), but the second is still just a representation of an
16712 unqualified-id. */
16714 static tree
16716 {
16717 tree id;
16718 /* The expression must be an id-expression. Assume that qualified
16719 names are the names of types so that:
16721 template <class T>
16722 int S<T>::R::i = 3;
16724 will work; we must treat `S<T>::R' as the name of a type.
16725 Similarly, assume that qualified names are templates, where
16726 required, so that:
16728 template <class T>
16729 int S<T>::R<T>::i = 3;
16731 will work, too. */
16737 optional_p);
16741 }
16743 /* Parse a type-id.
16745 type-id:
16746 type-specifier-seq abstract-declarator [opt]
16748 Returns the TYPE specified. */
16750 static tree
16753 {
16754 cp_decl_specifier_seq type_specifier_seq;
16757 /* Parse the type-specifier-seq. */
16759 is_trailing_return,
16764 /* There might or might not be an abstract declarator. */
16766 /* Look for the declarator. */
16767 abstract_declarator
16771 /* Check to see if there really was a declarator. */
16777 {
16778 /* A type-id with type 'auto' is only ok if the abstract declarator
16779 is a function declarator with a late-specified return type. */
16784 else
16785 {
16788 }
16789 }
16792 is_template_arg);
16793 }
16796 {
16798 }
16801 {
16802 tree r;
16804 parser->type_definition_forbidden_message
16809 }
16812 {
16814 }
16816 /* Parse a type-specifier-seq.
16818 type-specifier-seq:
16819 type-specifier type-specifier-seq [opt]
16821 GNU extension:
16823 type-specifier-seq:
16824 attributes type-specifier-seq [opt]
16826 If IS_DECLARATION is true, we are at the start of a "condition" or
16827 exception-declaration, so we might be followed by a declarator-id.
16829 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
16830 i.e. we've just seen "->".
16832 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
16834 static void
16839 {
16844 /* Clear the TYPE_SPECIFIER_SEQ. */
16847 /* In the context of a trailing return type, enum E { } is an
16848 elaborated-type-specifier followed by a function-body, not an
16849 enum-specifier. */
16853 /* Parse the type-specifiers and attributes. */
16855 {
16856 tree type_specifier;
16859 /* Check for attributes first. */
16861 {
16866 }
16868 /* record the token of the beginning of the type specifier seq,
16869 for error reporting purposes*/
16873 /* Look for the type-specifier. */
16875 flags,
16876 type_specifier_seq,
16878 NULL,
16881 {
16882 /* If the first type-specifier could not be found, this is not a
16883 type-specifier-seq at all. */
16885 {
16889 }
16890 /* If subsequent type-specifiers could not be found, the
16891 type-specifier-seq is complete. */
16893 }
16896 /* The standard says that a condition can be:
16898 type-specifier-seq declarator = assignment-expression
16900 However, given:
16902 struct S {};
16903 if (int S = ...)
16905 we should treat the "S" as a declarator, not as a
16906 type-specifier. The standard doesn't say that explicitly for
16907 type-specifier-seq, but it does say that for
16908 decl-specifier-seq in an ordinary declaration. Perhaps it
16909 would be clearer just to allow a decl-specifier-seq here, and
16910 then add a semantic restriction that if any decl-specifiers
16911 that are not type-specifiers appear, the program is invalid. */
16914 }
16917 }
16919 /* Parse a parameter-declaration-clause.
16921 parameter-declaration-clause:
16922 parameter-declaration-list [opt] ... [opt]
16923 parameter-declaration-list , ...
16925 Returns a representation for the parameter declarations. A return
16926 value of NULL indicates a parameter-declaration-clause consisting
16927 only of an ellipsis. */
16929 static tree
16931 {
16932 tree parameters;
16937 /* Peek at the next token. */
16939 /* Check for trivial parameter-declaration-clauses. */
16941 {
16942 /* Consume the `...' token. */
16945 }
16947 /* There are no parameters. */
16948 {
16949 #ifndef NO_IMPLICIT_EXTERN_C
16953 else
16954 #endif
16956 }
16957 /* Check for `(void)', too, which is a special case. */
16961 {
16962 /* Consume the `void' token. */
16964 /* There are no parameters. */
16966 }
16968 /* Parse the parameter-declaration-list. */
16970 /* If a parse error occurred while parsing the
16971 parameter-declaration-list, then the entire
16972 parameter-declaration-clause is erroneous. */
16976 /* Peek at the next token. */
16978 /* If it's a `,', the clause should terminate with an ellipsis. */
16980 {
16981 /* Consume the `,'. */
16983 /* Expect an ellipsis. */
16984 ellipsis_p
16986 }
16987 /* It might also be `...' if the optional trailing `,' was
16988 omitted. */
16990 {
16991 /* Consume the `...' token. */
16993 /* And remember that we saw it. */
16995 }
16996 else
16999 /* Finish the parameter list. */
17004 }
17006 /* Parse a parameter-declaration-list.
17008 parameter-declaration-list:
17009 parameter-declaration
17010 parameter-declaration-list , parameter-declaration
17012 Returns a representation of the parameter-declaration-list, as for
17013 cp_parser_parameter_declaration_clause. However, the
17014 `void_list_node' is never appended to the list. Upon return,
17015 *IS_ERROR will be true iff an error occurred. */
17017 static tree
17019 {
17025 /* Assume all will go well. */
17027 /* The special considerations that apply to a function within an
17028 unbraced linkage specifications do not apply to the parameters
17029 to the function. */
17030 saved_in_unbraced_linkage_specification_p
17034 /* Look for more parameters. */
17036 {
17040 /* Parse the parameter. */
17041 parameter
17046 /* We don't know yet if the enclosing context is deprecated, so wait
17047 and warn in grokparms if appropriate. */
17053 PARM,
17059 /* If a parse error occurred parsing the parameter declaration,
17060 then the entire parameter-declaration-list is erroneous. */
17062 {
17066 }
17076 {
17080 }
17082 /* Add the new parameter to the list. */
17086 /* Peek at the next token. */
17089 /* These are for Objective-C++ */
17092 /* The parameter-declaration-list is complete. */
17095 {
17098 /* Peek at the next token. */
17100 /* If it's an ellipsis, then the list is complete. */
17103 /* Otherwise, there must be more parameters. Consume the
17104 `,'. */
17106 /* When parsing something like:
17108 int i(float f, double d)
17110 we can tell after seeing the declaration for "f" that we
17111 are not looking at an initialization of a variable "i",
17112 but rather at the declaration of a function "i".
17114 Due to the fact that the parsing of template arguments
17115 (as specified to a template-id) requires backtracking we
17116 cannot use this technique when inside a template argument
17117 list. */
17121 /* However, a parameter-declaration of the form
17122 "foat(f)" (which is a valid declaration of a
17123 parameter "f") can also be interpreted as an
17124 expression (the conversion of "f" to "float"). */
17127 }
17128 else
17129 {
17137 }
17138 }
17140 parser->in_unbraced_linkage_specification_p
17144 }
17146 /* Parse a parameter declaration.
17148 parameter-declaration:
17149 decl-specifier-seq ... [opt] declarator
17150 decl-specifier-seq declarator = assignment-expression
17151 decl-specifier-seq ... [opt] abstract-declarator [opt]
17152 decl-specifier-seq abstract-declarator [opt] = assignment-expression
17154 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
17155 declares a template parameter. (In that case, a non-nested `>'
17156 token encountered during the parsing of the assignment-expression
17157 is not interpreted as a greater-than operator.)
17159 Returns a representation of the parameter, or NULL if an error
17160 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
17161 true iff the declarator is of the form "(p)". */
17167 {
17169 cp_decl_specifier_seq decl_specifiers;
17171 tree default_argument;
17175 /* In a template parameter, `>' is not an operator.
17177 [temp.param]
17179 When parsing a default template-argument for a non-type
17180 template-parameter, the first non-nested `>' is taken as the end
17181 of the template parameter-list rather than a greater-than
17182 operator. */
17184 /* Type definitions may not appear in parameter types. */
17186 parser->type_definition_forbidden_message
17189 /* Parse the declaration-specifiers. */
17191 CP_PARSER_FLAGS_NONE,
17195 /* Complain about missing 'typename' or other invalid type names. */
17199 /* If an error occurred, there's no reason to attempt to parse the
17200 rest of the declaration. */
17202 {
17205 }
17207 /* Peek at the next token. */
17210 /* If the next token is a `)', `,', `=', `>', or `...', then there
17211 is no declarator. However, when variadic templates are enabled,
17212 there may be a declarator following `...'. */
17217 {
17221 }
17222 /* Otherwise, there should be a declarator. */
17223 else
17224 {
17228 /* After seeing a decl-specifier-seq, if the next token is not a
17229 "(", there is no possibility that the code is a valid
17230 expression. Therefore, if parsing tentatively, we commit at
17231 this point. */
17233 /* In an expression context, having seen:
17235 (int((char ...
17237 we cannot be sure whether we are looking at a
17238 function-type (taking a "char" as a parameter) or a cast
17239 of some object of type "char" to "int". */
17245 /* Parse the declarator. */
17248 CP_PARSER_DECLARATOR_EITHER,
17250 parenthesized_p,
17253 /* After the declarator, allow more attributes. */
17254 decl_specifiers.attributes
17257 }
17259 /* If the next token is an ellipsis, and we have not seen a
17260 declarator name, and the type of the declarator contains parameter
17261 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
17262 a parameter pack expansion expression. Otherwise, leave the
17263 ellipsis for a C-style variadic function. */
17266 {
17277 {
17278 /* Consume the `...'. */
17282 /* Build a pack expansion type */
17285 else
17287 }
17288 }
17290 /* The restriction on defining new types applies only to the type
17291 of the parameter, not to the default argument. */
17294 /* If the next token is `=', then process a default argument. */
17296 {
17298 /* If we are defining a class, then the tokens that make up the
17299 default argument must be saved and processed later. */
17304 /* Outside of a class definition, we can just parse the
17305 assignment-expression. */
17306 else
17307 default_argument
17311 {
17314 else
17315 {
17317 "default arguments are only "
17320 }
17321 }
17325 {
17326 /* Find the name of the parameter pack. */
17333 template_parm_p
17339 else
17341 template_parm_p
17348 }
17349 }
17350 else
17354 declarator,
17355 default_argument);
17356 }
17358 /* Parse a default argument and return it.
17360 TEMPLATE_PARM_P is true if this is a default argument for a
17361 non-type template parameter. */
17362 static tree
17364 {
17370 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
17371 set correctly. */
17374 /* Local variable names (and the `this' keyword) may not
17375 appear in a default argument. */
17378 /* Parse the assignment-expression. */
17381 default_argument
17391 }
17393 /* Parse a function-body.
17395 function-body:
17396 compound_statement */
17398 static void
17400 {
17402 }
17404 /* Parse a ctor-initializer-opt followed by a function-body. Return
17405 true if a ctor-initializer was present. */
17407 static bool
17409 {
17417 /* Begin the function body. */
17419 /* Parse the optional ctor-initializer. */
17422 /* If we're parsing a constexpr constructor definition, we need
17423 to check that the constructor body is indeed empty. However,
17424 before we get to cp_parser_function_body lot of junk has been
17425 generated, so we can't just check that we have an empty block.
17426 Rather we take a snapshot of the outermost block, and check whether
17427 cp_parser_function_body changed its state. */
17429 {
17433 }
17434 /* Parse the function-body. */
17438 /* Finish the function body. */
17442 }
17444 /* Parse an initializer.
17446 initializer:
17447 = initializer-clause
17448 ( expression-list )
17450 Returns an expression representing the initializer. If no
17451 initializer is present, NULL_TREE is returned.
17453 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
17454 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
17455 set to TRUE if there is no initializer present. If there is an
17456 initializer, and it is not a constant-expression, *NON_CONSTANT_P
17457 is set to true; otherwise it is set to false. */
17459 static tree
17462 {
17464 tree init;
17466 /* Peek at the next token. */
17469 /* Let our caller know whether or not this initializer was
17470 parenthesized. */
17472 /* Assume that the initializer is constant. */
17476 {
17477 /* Consume the `='. */
17479 /* Parse the initializer-clause. */
17481 }
17483 {
17488 non_constant_p);
17493 }
17495 {
17499 }
17500 else
17501 {
17502 /* Anything else is an error. */
17505 }
17508 }
17510 /* Parse an initializer-clause.
17512 initializer-clause:
17513 assignment-expression
17514 braced-init-list
17516 Returns an expression representing the initializer.
17518 If the `assignment-expression' production is used the value
17519 returned is simply a representation for the expression.
17521 Otherwise, calls cp_parser_braced_list. */
17523 static tree
17525 {
17526 tree initializer;
17528 /* Assume the expression is constant. */
17531 /* If it is not a `{', then we are looking at an
17532 assignment-expression. */
17534 {
17535 initializer
17538 non_constant_p);
17539 }
17540 else
17544 }
17546 /* Parse a brace-enclosed initializer list.
17548 braced-init-list:
17549 { initializer-list , [opt] }
17550 { }
17552 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
17553 the elements of the initializer-list (or NULL, if the last
17554 production is used). The TREE_TYPE for the CONSTRUCTOR will be
17555 NULL_TREE. There is no way to detect whether or not the optional
17556 trailing `,' was provided. NON_CONSTANT_P is as for
17557 cp_parser_initializer. */
17559 static tree
17561 {
17562 tree initializer;
17564 /* Consume the `{' token. */
17566 /* Create a CONSTRUCTOR to represent the braced-initializer. */
17568 /* If it's not a `}', then there is a non-trivial initializer. */
17570 {
17571 /* Parse the initializer list. */
17574 /* A trailing `,' token is allowed. */
17577 }
17578 /* Now, there should be a trailing `}'. */
17582 }
17584 /* Parse an initializer-list.
17586 initializer-list:
17587 initializer-clause ... [opt]
17588 initializer-list , initializer-clause ... [opt]
17590 GNU Extension:
17592 initializer-list:
17593 designation initializer-clause ...[opt]
17594 initializer-list , designation initializer-clause ...[opt]
17596 designation:
17597 . identifier =
17598 identifier :
17599 [ constant-expression ] =
17601 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
17602 for the initializer. If the INDEX of the elt is non-NULL, it is the
17603 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
17604 as for cp_parser_initializer. */
17608 {
17611 /* Assume all of the expressions are constant. */
17614 /* Parse the rest of the list. */
17616 {
17618 tree designator;
17619 tree initializer;
17622 /* If the next token is an identifier and the following one is a
17623 colon, we are looking at the GNU designated-initializer
17624 syntax. */
17628 {
17629 /* Warn the user that they are using an extension. */
17632 /* Consume the identifier. */
17634 /* Consume the `:'. */
17636 }
17637 /* Also handle the C99 syntax, '. id ='. */
17642 {
17643 /* Warn the user that they are using an extension. */
17646 /* Consume the `.'. */
17648 /* Consume the identifier. */
17650 /* Consume the `='. */
17652 }
17653 /* Also handle C99 array designators, '[ const ] ='. */
17657 {
17658 /* In C++11, [ could start a lambda-introducer. */
17666 }
17667 else
17670 /* Parse the initializer. */
17673 /* If any clause is non-constant, so is the entire initializer. */
17677 /* If we have an ellipsis, this is an initializer pack
17678 expansion. */
17680 {
17681 /* Consume the `...'. */
17684 /* Turn the initializer into an initializer expansion. */
17686 }
17688 /* Add it to the vector. */
17691 /* If the next token is not a comma, we have reached the end of
17692 the list. */
17696 /* Peek at the next token. */
17698 /* If the next token is a `}', then we're still done. An
17699 initializer-clause can have a trailing `,' after the
17700 initializer-list and before the closing `}'. */
17704 /* Consume the `,' token. */
17706 }
17709 }
17711 /* Classes [gram.class] */
17713 /* Parse a class-name.
17715 class-name:
17716 identifier
17717 template-id
17719 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
17720 to indicate that names looked up in dependent types should be
17721 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
17722 keyword has been used to indicate that the name that appears next
17723 is a template. TAG_TYPE indicates the explicit tag given before
17724 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
17725 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
17726 is the class being defined in a class-head.
17728 Returns the TYPE_DECL representing the class. */
17730 static tree
17738 {
17739 tree decl;
17740 tree scope;
17745 /* All class-names start with an identifier. */
17748 {
17751 }
17753 /* PARSER->SCOPE can be cleared when parsing the template-arguments
17754 to a template-id, so we save it here. */
17759 /* Any name names a type if we're following the `typename' keyword
17760 in a qualified name where the enclosing scope is type-dependent. */
17763 /* Handle the common case (an identifier, but not a template-id)
17764 efficiently. */
17767 {
17771 /* Look for the identifier. */
17775 /* If the next token isn't an identifier, we are certainly not
17776 looking at a class-name. */
17779 /* If we know this is a type-name, there's no need to look it
17780 up. */
17783 else
17784 {
17785 tree ambiguous_decls;
17786 /* If we already know that this lookup is ambiguous, then
17787 we've already issued an error message; there's no reason
17788 to check again. */
17790 {
17793 }
17794 /* If the next token is a `::', then the name must be a type
17795 name.
17797 [basic.lookup.qual]
17799 During the lookup for a name preceding the :: scope
17800 resolution operator, object, function, and enumerator
17801 names are ignored. */
17804 /* Look up the name. */
17806 tag_type,
17809 check_dependency_p,
17813 {
17817 }
17818 }
17819 }
17820 else
17821 {
17822 /* Try a template-id. */
17824 check_dependency_p,
17825 is_declaration);
17828 }
17832 /* If this is a typename, create a TYPENAME_TYPE. */
17834 {
17839 }
17841 /* Check to see that it is really the name of a class. */
17845 /* Situations like this:
17847 template <typename T> struct A {
17848 typename T::template X<int>::I i;
17849 };
17851 are problematic. Is `T::template X<int>' a class-name? The
17852 standard does not seem to be definitive, but there is no other
17853 valid interpretation of the following `::'. Therefore, those
17854 names are considered class-names. */
17855 {
17859 }
17863 /* In Objective-C 2.0, a classname followed by '.' starts a
17864 dot-syntax expression, and it's not a type-name. */
17876 }
17878 /* Parse a class-specifier.
17880 class-specifier:
17881 class-head { member-specification [opt] }
17883 Returns the TREE_TYPE representing the class. */
17885 static tree
17887 {
17888 tree type;
17898 tree bases;
17903 /* Parse the class-head. */
17908 /* If the class-head was a semantic disaster, skip the entire body
17909 of the class. */
17911 {
17915 }
17917 /* Look for the `{'. */
17919 {
17922 }
17924 /* Process the base classes. If they're invalid, skip the
17925 entire class body. */
17927 {
17928 /* Consuming the closing brace yields better error messages
17929 later on. */
17934 }
17936 /* Issue an error message if type-definitions are forbidden here. */
17938 /* Remember that we are defining one more class. */
17940 /* Inside the class, surrounding template-parameter-lists do not
17941 apply. */
17942 saved_num_template_parameter_lists
17945 /* We are not in a function body. */
17948 /* Or in a loop. */
17951 /* Or in a switch. */
17954 /* We are not immediately inside an extern "lang" block. */
17955 saved_in_unbraced_linkage_specification_p
17959 /* Start the class. */
17961 {
17964 }
17968 /* If the type is erroneous, skip the entire body of the class. */
17970 else
17971 /* Parse the member-specification. */
17974 /* Look for the trailing `}'. */
17976 /* Look for trailing attributes to apply to this class. */
17984 /* We've finished a type definition. Check for the common syntax
17985 error of forgetting a semicolon after the definition. We need to
17986 be careful, as we can't just check for not-a-semicolon and be done
17987 with it; the user might have typed:
17989 class X { } c = ...;
17990 class X { } *p = ...;
17992 and so forth. Instead, enumerate all the possible tokens that
17993 might follow this production; if we don't see one of them, then
17994 complain and silently insert the semicolon. */
17995 {
18000 {
18011 /* While it's legal for type qualifiers and storage class
18012 specifiers to follow type definitions in the grammar, only
18013 compiler testsuites contain code like that. Assume that if
18014 we see such code, then what we're really seeing is a case
18015 like:
18017 class X { }
18018 const <type> var = ...;
18020 or
18022 class Y { }
18023 static <type> func (...) ...
18025 i.e. the qualifier or specifier applies to the next
18026 declaration. To do so, however, we need to look ahead one
18027 more token to see if *that* token is a type specifier.
18029 This code could be improved to handle:
18031 class Z { }
18032 static const <type> var = ...; */
18035 {
18038 /* Handling user-defined types here would be nice, but very
18039 tricky. */
18040 want_semicolon
18043 }
18047 }
18049 /* If we don't have a type, then something is very wrong and we
18050 shouldn't try to do anything clever. Likewise for not seeing the
18051 closing brace. */
18053 {
18054 cp_token_position prev
18065 else
18068 /* Unget one token and smash it to look as though we encountered
18069 a semicolon in the input stream. */
18074 }
18075 }
18077 /* If this class is not itself within the scope of another class,
18078 then we need to parse the bodies of all of the queued function
18079 definitions. Note that the queued functions defined in a class
18080 are not always processed immediately following the
18081 class-specifier for that class. Consider:
18083 struct A {
18084 struct B { void f() { sizeof (A); } };
18085 };
18087 If `f' were processed before the processing of `A' were
18088 completed, there would be no way to compute the size of `A'.
18089 Note that the nesting we are interested in here is lexical --
18090 not the semantic nesting given by TYPE_CONTEXT. In particular,
18091 for:
18093 struct A { struct B; };
18094 struct A::B { void f() { } };
18096 there is no need to delay the parsing of `A::B::f'. */
18098 {
18099 tree decl;
18106 /* In a first pass, parse default arguments to the functions.
18107 Then, in a second pass, parse the bodies of the functions.
18108 This two-phased approach handles cases like:
18110 struct S {
18111 void f() { g(); }
18112 void g(int i = 3);
18113 };
18115 */
18118 {
18120 /* If there are default arguments that have not yet been processed,
18121 take care of them now. */
18123 {
18128 }
18129 /* Make sure that any template parameters are in scope. */
18131 /* Parse the default argument expressions. */
18133 /* Remove any template parameters from the symbol table. */
18135 }
18137 /* Now parse any NSDMIs. */
18141 {
18143 {
18148 }
18151 }
18157 /* Now parse the body of the functions. */
18161 }
18163 /* Put back any saved access checks. */
18166 /* Restore saved state. */
18170 parser->num_template_parameter_lists
18172 parser->in_unbraced_linkage_specification_p
18176 }
18178 static tree
18180 {
18181 tree ret;
18186 }
18188 /* Parse a class-head.
18190 class-head:
18191 class-key identifier [opt] base-clause [opt]
18192 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
18193 class-key nested-name-specifier [opt] template-id
18194 base-clause [opt]
18196 class-virt-specifier:
18197 final
18199 GNU Extensions:
18200 class-key attributes identifier [opt] base-clause [opt]
18201 class-key attributes nested-name-specifier identifier base-clause [opt]
18202 class-key attributes nested-name-specifier [opt] template-id
18203 base-clause [opt]
18205 Upon return BASES is initialized to the list of base classes (or
18206 NULL, if there are none) in the same form returned by
18207 cp_parser_base_clause.
18209 Returns the TYPE of the indicated class. Sets
18210 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
18211 involving a nested-name-specifier was used, and FALSE otherwise.
18213 Returns error_mark_node if this is not a class-head.
18215 Returns NULL_TREE if the class-head is syntactically valid, but
18216 semantically invalid in a way that means we should skip the entire
18217 body of the class. */
18219 static tree
18224 {
18225 tree nested_name_specifier;
18229 tree attributes;
18239 /* Assume no nested-name-specifier will be present. */
18241 /* Assume no template parameter lists will be used in defining the
18242 type. */
18248 /* Look for the class-key. */
18253 /* Parse the attributes. */
18256 /* If the next token is `::', that is invalid -- but sometimes
18257 people do try to write:
18259 struct ::S {};
18261 Handle this gracefully by accepting the extra qualifier, and then
18262 issuing an error about it later if this really is a
18263 class-head. If it turns out just to be an elaborated type
18264 specifier, remain silent. */
18270 /* Determine the name of the class. Begin by looking for an
18271 optional nested-name-specifier. */
18273 nested_name_specifier
18279 /* If there was a nested-name-specifier, then there *must* be an
18280 identifier. */
18282 {
18284 /* Although the grammar says `identifier', it really means
18285 `class-name' or `template-name'. You are only allowed to
18286 define a class that has already been declared with this
18287 syntax.
18289 The proposed resolution for Core Issue 180 says that wherever
18290 you see `class T::X' you should treat `X' as a type-name.
18292 It is OK to define an inaccessible class; for example:
18294 class A { class B; };
18295 class A::B {};
18297 We do not know if we will see a class-name, or a
18298 template-name. We look for a class-name first, in case the
18299 class-name is a template-id; if we looked for the
18300 template-name first we would stop after the template-name. */
18305 class_type,
18309 /* If that didn't work, ignore the nested-name-specifier. */
18311 {
18317 }
18318 /* If we could not find a corresponding TYPE, treat this
18319 declaration like an unqualified declaration. */
18322 /* Otherwise, count the number of templates used in TYPE and its
18323 containing scopes. */
18324 else
18325 {
18326 tree scope;
18339 }
18340 }
18341 /* Otherwise, the identifier is optional. */
18342 else
18343 {
18344 /* We don't know whether what comes next is a template-id,
18345 an identifier, or nothing at all. */
18347 /* Check for a template-id. */
18353 /* If that didn't work, it could still be an identifier. */
18355 {
18357 {
18360 }
18361 else
18363 }
18364 else
18365 {
18368 }
18369 }
18374 {
18377 }
18380 /* If it's not a `:' or a `{' then we can't really be looking at a
18381 class-head, since a class-head only appears as part of a
18382 class-specifier. We have to detect this situation before calling
18383 xref_tag, since that has irreversible side-effects. */
18385 {
18389 }
18391 /* At this point, we're going ahead with the class-specifier, even
18392 if some other problem occurs. */
18395 {
18400 }
18401 /* Issue the error about the overly-qualified name now. */
18403 {
18408 }
18410 {
18415 }
18417 {
18418 tree scope;
18420 /* Reject typedef-names in class heads. */
18422 {
18425 type);
18428 }
18430 /* Figure out in what scope the declaration is being placed. */
18432 /* If that scope does not contain the scope in which the
18433 class was originally declared, the program is invalid. */
18435 {
18438 "declaration of %qD in namespace %qD which does not "
18441 else
18447 }
18448 /* [dcl.meaning]
18450 A declarator-id shall not be qualified except for the
18451 definition of a ... nested class outside of its class
18452 ... [or] the definition or explicit instantiation of a
18453 class member of a namespace outside of its namespace. */
18455 {
18460 }
18461 }
18462 /* An explicit-specialization must be preceded by "template <>". If
18463 it is not, try to recover gracefully. */
18467 {
18471 /* Take the same action that would have been taken by
18472 cp_parser_explicit_specialization. */
18475 }
18476 /* There must be no "return" statements between this point and the
18477 end of this function; set "type "to the correct return value and
18478 use "goto done;" to return. */
18479 /* Make sure that the right number of template parameters were
18480 present. */
18484 {
18485 /* If something went wrong, there is no point in even trying to
18486 process the class-definition. */
18489 }
18491 /* Look up the type. */
18493 {
18497 {
18501 }
18502 else
18503 {
18506 }
18509 }
18511 {
18512 tree class_type;
18514 /* Given:
18516 template <typename T> struct S { struct T };
18517 template <typename T> struct S<T>::T { };
18519 we will get a TYPENAME_TYPE when processing the definition of
18520 `S::T'. We need to resolve it to the actual type before we
18521 try to define it. */
18523 {
18528 else
18529 {
18532 }
18533 }
18537 {
18540 }
18543 /* Enter the scope indicated by the nested-name-specifier. */
18545 /* Get the canonical version of this type. */
18549 {
18552 {
18555 }
18556 }
18560 }
18562 {
18563 /* If the class was unnamed, create a dummy name. */
18568 }
18570 /* Indicate whether this class was declared as a `class' or as a
18571 `struct'. */
18576 /* If this type was already complete, and we see another definition,
18577 that's an error. */
18579 {
18581 type);
18583 type);
18586 }
18590 /* We will have entered the scope containing the class; the names of
18591 base classes should be looked up in that context. For example:
18593 struct A { struct B {}; struct C; };
18594 struct A::C : B {};
18596 is valid. */
18598 /* Get the list of base-classes, if there is one. */
18602 done:
18603 /* Leave the scope given by the nested-name-specifier. We will
18604 enter the class scope itself while processing the members. */
18609 {
18612 }
18619 out:
18622 }
18624 /* Parse a class-key.
18626 class-key:
18627 class
18628 struct
18629 union
18631 Returns the kind of class-key specified, or none_type to indicate
18632 error. */
18634 static enum tag_types
18636 {
18640 /* Look for the class-key. */
18645 /* Check to see if the TOKEN is a class-key. */
18650 }
18652 /* Parse an (optional) member-specification.
18654 member-specification:
18655 member-declaration member-specification [opt]
18656 access-specifier : member-specification [opt] */
18658 static void
18660 {
18662 {
18666 /* Peek at the next token. */
18668 /* If it's a `}', or EOF then we've seen all the members. */
18674 /* See if this token is a keyword. */
18677 {
18681 /* Consume the access-specifier. */
18683 /* Remember which access-specifier is active. */
18685 /* Look for the `:'. */
18690 /* Accept #pragmas at class scope. */
18692 {
18695 }
18697 /* Otherwise, the next construction must be a
18698 member-declaration. */
18700 }
18701 }
18702 }
18704 /* Parse a member-declaration.
18706 member-declaration:
18707 decl-specifier-seq [opt] member-declarator-list [opt] ;
18708 function-definition ; [opt]
18709 :: [opt] nested-name-specifier template [opt] unqualified-id ;
18710 using-declaration
18711 template-declaration
18712 alias-declaration
18714 member-declarator-list:
18715 member-declarator
18716 member-declarator-list , member-declarator
18718 member-declarator:
18719 declarator pure-specifier [opt]
18720 declarator constant-initializer [opt]
18721 identifier [opt] : constant-expression
18723 GNU Extensions:
18725 member-declaration:
18726 __extension__ member-declaration
18728 member-declarator:
18729 declarator attributes [opt] pure-specifier [opt]
18730 declarator attributes [opt] constant-initializer [opt]
18731 identifier [opt] attributes [opt] : constant-expression
18733 C++0x Extensions:
18735 member-declaration:
18736 static_assert-declaration */
18738 static void
18740 {
18741 cp_decl_specifier_seq decl_specifiers;
18742 tree prefix_attributes;
18743 tree decl;
18752 /* Check for the `__extension__' keyword. */
18754 {
18755 /* Recurse. */
18757 /* Restore the old value of the PEDANTIC flag. */
18761 }
18763 /* Check for a template-declaration. */
18765 {
18766 /* An explicit specialization here is an error condition, and we
18767 expect the specialization handler to detect and report this. */
18771 else
18775 }
18777 /* Check for a using-declaration. */
18779 {
18781 {
18782 /* Parse the using-declaration. */
18786 }
18787 else
18788 {
18789 tree decl;
18794 else
18798 }
18799 }
18801 /* Check for @defs. */
18803 {
18808 {
18813 }
18815 }
18817 /* If the next token is `static_assert' we have a static assertion. */
18819 {
18822 }
18829 /* Parse the decl-specifier-seq. */
18832 CP_PARSER_FLAGS_OPTIONAL,
18837 /* Check for an invalid type-name. */
18841 /* If there is no declarator, then the decl-specifier-seq should
18842 specify a type. */
18844 {
18845 /* If there was no decl-specifier-seq, and the next token is a
18846 `;', then we have something like:
18848 struct S { ; };
18850 [class.mem]
18852 Each member-declaration shall declare at least one member
18853 name of the class. */
18855 {
18859 }
18860 else
18861 {
18862 tree type;
18864 /* See if this declaration is a friend. */
18866 /* If there were decl-specifiers, check to see if there was
18867 a class-declaration. */
18869 /* Nested classes have already been added to the class, but
18870 a `friend' needs to be explicitly registered. */
18872 {
18873 /* If the `friend' keyword was present, the friend must
18874 be introduced with a class-key. */
18877 "in C++03 a class-key must be used "
18879 /* In this case:
18881 template <typename T> struct A {
18882 friend struct A<T>::B;
18883 };
18885 A<T>::B will be represented by a TYPENAME_TYPE, and
18886 therefore not recognized by check_tag_decl. */
18888 {
18892 }
18895 "friend declaration does not name a class or "
18897 else
18900 }
18901 /* If there is no TYPE, an error message will already have
18902 been issued. */
18904 ;
18905 /* An anonymous aggregate has to be handled specially; such
18906 a declaration really declares a data member (with a
18907 particular type), as opposed to a nested class. */
18909 {
18910 /* Remove constructors and such from TYPE, now that we
18911 know it is an anonymous aggregate. */
18913 /* And make the corresponding data member. */
18916 /* Add it to the class. */
18918 }
18919 else
18920 cp_parser_check_access_in_redeclaration
18923 }
18924 }
18925 else
18926 {
18929 /* See if these declarations will be friends. */
18932 /* Keep going until we hit the `;' at the end of the
18933 declaration. */
18935 {
18937 tree first_attribute;
18939 /* Peek at the next token. */
18942 /* Check for a bitfield declaration. */
18947 {
18948 tree identifier;
18949 tree width;
18951 /* Get the name of the bitfield. Note that we cannot just
18952 check TOKEN here because it may have been invalidated by
18953 the call to cp_lexer_peek_nth_token above. */
18956 else
18959 /* Consume the `:' token. */
18961 /* Get the width of the bitfield. */
18962 width
18965 NULL);
18967 /* Look for attributes that apply to the bitfield. */
18969 /* Remember which attributes are prefix attributes and
18970 which are not. */
18972 /* Combine the attributes. */
18975 /* Create the bitfield declaration. */
18978 identifier,
18979 sfk_none)
18982 width,
18983 attributes);
18984 }
18985 else
18986 {
18988 tree initializer;
18989 tree asm_specification;
18992 /* Parse the declarator. */
18993 declarator
18999 /* If something went wrong parsing the declarator, make sure
19000 that we at least consume some tokens. */
19002 {
19003 /* Skip to the end of the statement. */
19005 /* If the next token is not a semicolon, that is
19006 probably because we just skipped over the body of
19007 a function. So, we consume a semicolon if
19008 present, but do not issue an error message if it
19009 is not present. */
19011 CPP_SEMICOLON))
19014 }
19017 cp_parser_check_for_definition_in_return_type
19021 /* Look for an asm-specification. */
19023 /* Look for attributes that apply to the declaration. */
19025 /* Remember which attributes are prefix attributes and
19026 which are not. */
19028 /* Combine the attributes. */
19031 /* If it's an `=', then we have a constant-initializer or a
19032 pure-specifier. It is not correct to parse the
19033 initializer before registering the member declaration
19034 since the member declaration should be in scope while
19035 its initializer is processed. However, the rest of the
19036 front end does not yet provide an interface that allows
19037 us to handle this correctly. */
19039 {
19040 /* In [class.mem]:
19042 A pure-specifier shall be used only in the declaration of
19043 a virtual function.
19045 A member-declarator can contain a constant-initializer
19046 only if it declares a static member of integral or
19047 enumeration type.
19049 Therefore, if the DECLARATOR is for a function, we look
19050 for a pure-specifier; otherwise, we look for a
19051 constant-initializer. When we call `grokfield', it will
19052 perform more stringent semantics checks. */
19063 {
19065 /* Don't require a constant rvalue in C++11, since we
19066 might want a reference constant. We'll enforce
19067 constancy later. */
19069 /* Parse the initializer. */
19072 }
19073 else
19074 /* Parse the initializer. */
19076 }
19079 {
19083 else
19085 }
19086 /* Otherwise, there is no initializer. */
19087 else
19090 /* See if we are probably looking at a function
19091 definition. We are certainly not looking at a
19092 member-declarator. Calling `grokfield' has
19093 side-effects, so we must not do it unless we are sure
19094 that we are looking at a member-declarator. */
19097 {
19098 /* The grammar does not allow a pure-specifier to be
19099 used when a member function is defined. (It is
19100 possible that this fact is an oversight in the
19101 standard, since a pure function may be defined
19102 outside of the class-specifier. */
19108 declarator,
19109 attributes);
19110 /* If the member was not a friend, declare it here. */
19113 /* Peek at the next token. */
19115 /* If the next token is a semicolon, consume it. */
19119 }
19120 else
19123 /* Create the declaration. */
19126 asm_specification,
19127 attributes);
19128 }
19130 /* Reset PREFIX_ATTRIBUTES. */
19136 /* If there is any qualification still in effect, clear it
19137 now; we will be starting fresh with the next declarator. */
19141 /* If it's a `,', then there are more declarators. */
19144 /* If the next token isn't a `;', then we have a parse error. */
19146 CPP_SEMICOLON))
19147 {
19148 /* The next token might be a ways away from where the
19149 actual semicolon is missing. Find the previous token
19150 and use that for our error position. */
19155 /* Assume that the user meant to provide a semicolon. If
19156 we were to cp_parser_skip_to_end_of_statement, we might
19157 skip to a semicolon inside a member function definition
19158 and issue nonsensical error messages. */
19160 }
19163 {
19164 /* Add DECL to the list of members. */
19173 /* Add DECL to the queue of NSDMI to be parsed later. */
19175 }
19179 }
19180 }
19183 out:
19185 }
19187 /* Parse a pure-specifier.
19189 pure-specifier:
19190 = 0
19192 Returns INTEGER_ZERO_NODE if a pure specifier is found.
19193 Otherwise, ERROR_MARK_NODE is returned. */
19195 static tree
19197 {
19200 /* Look for the `=' token. */
19203 /* Look for the `0' token. */
19212 /* Accept = default or = delete in c++0x mode. */
19215 {
19218 }
19220 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
19222 {
19227 }
19229 {
19232 }
19235 }
19237 /* Parse a constant-initializer.
19239 constant-initializer:
19240 = constant-expression
19242 Returns a representation of the constant-expression. */
19244 static tree
19246 {
19247 /* Look for the `=' token. */
19251 /* It is invalid to write:
19253 struct S { static const int i = { 7 }; };
19255 */
19257 {
19260 /* Consume the opening brace. */
19262 /* Skip the initializer. */
19264 /* Look for the trailing `}'. */
19268 }
19272 NULL);
19273 }
19275 /* Derived classes [gram.class.derived] */
19277 /* Parse a base-clause.
19279 base-clause:
19280 : base-specifier-list
19282 base-specifier-list:
19283 base-specifier ... [opt]
19284 base-specifier-list , base-specifier ... [opt]
19286 Returns a TREE_LIST representing the base-classes, in the order in
19287 which they were declared. The representation of each node is as
19288 described by cp_parser_base_specifier.
19290 In the case that no bases are specified, this function will return
19291 NULL_TREE, not ERROR_MARK_NODE. */
19293 static tree
19295 {
19298 /* Look for the `:' that begins the list. */
19301 /* Scan the base-specifier-list. */
19303 {
19305 tree base;
19308 /* Look for the base-specifier. */
19310 /* Look for the (optional) ellipsis. */
19312 {
19313 /* Consume the `...'. */
19317 }
19319 /* Add BASE to the front of the list. */
19321 {
19323 /* Make this a pack expansion type. */
19327 {
19330 }
19331 }
19332 /* Peek at the next token. */
19334 /* If it's not a comma, then the list is complete. */
19337 /* Consume the `,'. */
19339 }
19341 /* PARSER->SCOPE may still be non-NULL at this point, if the last
19342 base class had a qualified name. However, the next name that
19343 appears is certainly not qualified. */
19349 }
19351 /* Parse a base-specifier.
19353 base-specifier:
19354 :: [opt] nested-name-specifier [opt] class-name
19355 virtual access-specifier [opt] :: [opt] nested-name-specifier
19356 [opt] class-name
19357 access-specifier virtual [opt] :: [opt] nested-name-specifier
19358 [opt] class-name
19360 Returns a TREE_LIST. The TREE_PURPOSE will be one of
19361 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
19362 indicate the specifiers provided. The TREE_VALUE will be a TYPE
19363 (or the ERROR_MARK_NODE) indicating the type that was specified. */
19365 static tree
19367 {
19375 tree type;
19377 /* Process the optional `virtual' and `access-specifier'. */
19379 {
19380 /* Peek at the next token. */
19382 /* Process `virtual'. */
19384 {
19386 /* If `virtual' appears more than once, issue an error. */
19388 {
19392 }
19396 /* Consume the `virtual' token. */
19404 /* If more than one access specifier appears, issue an
19405 error. */
19408 {
19412 }
19416 /* Consume the access-specifier. */
19424 }
19425 }
19426 /* It is not uncommon to see programs mechanically, erroneously, use
19427 the 'typename' keyword to denote (dependent) qualified types
19428 as base classes. */
19430 {
19435 else
19437 "keyword %<typename%> not allowed in this context "
19440 }
19442 /* Look for the optional `::' operator. */
19444 /* Look for the nested-name-specifier. The simplest way to
19445 implement:
19447 [temp.res]
19449 The keyword `typename' is not permitted in a base-specifier or
19450 mem-initializer; in these contexts a qualified name that
19451 depends on a template-parameter is implicitly assumed to be a
19452 type name.
19454 is to pretend that we have seen the `typename' keyword at this
19455 point. */
19459 typename_type,
19461 /* If the base class is given by a qualified name, assume that names
19462 we see are type names or templates, as appropriate. */
19468 /* DR 950 allows decltype as a base-specifier. */
19470 else
19471 {
19472 /* Otherwise, look for the class-name. */
19474 class_scope_p,
19475 template_p,
19476 typename_type,
19481 }
19487 }
19489 /* Exception handling [gram.exception] */
19491 /* Parse an (optional) noexcept-specification.
19493 noexcept-specification:
19494 noexcept ( constant-expression ) [opt]
19496 If no noexcept-specification is present, returns NULL_TREE.
19497 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
19498 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
19499 there are no parentheses. CONSUMED_EXPR will be set accordingly.
19500 Otherwise, returns a noexcept specification unless RETURN_COND is true,
19501 in which case a boolean condition is returned instead. */
19503 static tree
19508 {
19512 /* Peek at the next token. */
19515 /* Is it a noexcept-specification? */
19517 {
19518 tree expr;
19522 {
19526 {
19527 /* Types may not be defined in an exception-specification. */
19529 parser->type_definition_forbidden_message
19534 /* Restore the saved message. */
19536 }
19537 else
19538 {
19541 }
19544 }
19545 else
19546 {
19550 }
19552 /* We cannot build a noexcept-spec right away because this will check
19553 that expr is a constexpr. */
19556 else
19558 }
19559 else
19561 }
19563 /* Parse an (optional) exception-specification.
19565 exception-specification:
19566 throw ( type-id-list [opt] )
19568 Returns a TREE_LIST representing the exception-specification. The
19569 TREE_VALUE of each node is a type. */
19571 static tree
19573 {
19575 tree type_id_list;
19578 /* Peek at the next token. */
19581 /* Is it a noexcept-specification? */
19587 /* If it's not `throw', then there's no exception-specification. */
19591 #if 0
19592 /* Enable this once a lot of code has transitioned to noexcept? */
19596 #endif
19598 /* Consume the `throw'. */
19601 /* Look for the `('. */
19604 /* Peek at the next token. */
19606 /* If it's not a `)', then there is a type-id-list. */
19608 {
19609 /* Types may not be defined in an exception-specification. */
19611 parser->type_definition_forbidden_message
19613 /* Parse the type-id-list. */
19615 /* Restore the saved message. */
19617 }
19618 else
19621 /* Look for the `)'. */
19625 }
19627 /* Parse an (optional) type-id-list.
19629 type-id-list:
19630 type-id ... [opt]
19631 type-id-list , type-id ... [opt]
19633 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
19634 in the order that the types were presented. */
19636 static tree
19638 {
19642 {
19644 tree type;
19646 /* Get the next type-id. */
19648 /* Parse the optional ellipsis. */
19650 {
19651 /* Consume the `...'. */
19654 /* Turn the type into a pack expansion expression. */
19656 }
19657 /* Add it to the list. */
19659 /* Peek at the next token. */
19661 /* If it is not a `,', we are done. */
19664 /* Consume the `,'. */
19666 }
19669 }
19671 /* Parse a try-block.
19673 try-block:
19674 try compound-statement handler-seq */
19676 static tree
19678 {
19679 tree try_block;
19689 }
19691 /* Parse a function-try-block.
19693 function-try-block:
19694 try ctor-initializer [opt] function-body handler-seq */
19696 static bool
19698 {
19699 tree compound_stmt;
19700 tree try_block;
19703 /* Look for the `try' keyword. */
19706 /* Let the rest of the front end know where we are. */
19708 /* Parse the function-body. */
19709 ctor_initializer_p
19711 /* We're done with the `try' part. */
19713 /* Parse the handlers. */
19715 /* We're done with the handlers. */
19719 }
19721 /* Parse a handler-seq.
19723 handler-seq:
19724 handler handler-seq [opt] */
19726 static void
19728 {
19730 {
19733 /* Parse the handler. */
19735 /* Peek at the next token. */
19737 /* If it's not `catch' then there are no more handlers. */
19740 }
19741 }
19743 /* Parse a handler.
19745 handler:
19746 catch ( exception-declaration ) compound-statement */
19748 static void
19750 {
19751 tree handler;
19752 tree declaration;
19762 }
19764 /* Parse an exception-declaration.
19766 exception-declaration:
19767 type-specifier-seq declarator
19768 type-specifier-seq abstract-declarator
19769 type-specifier-seq
19770 ...
19772 Returns a VAR_DECL for the declaration, or NULL_TREE if the
19773 ellipsis variant is used. */
19775 static tree
19777 {
19778 cp_decl_specifier_seq type_specifiers;
19782 /* If it's an ellipsis, it's easy to handle. */
19784 {
19785 /* Consume the `...' token. */
19788 }
19790 /* Types may not be defined in exception-declarations. */
19792 parser->type_definition_forbidden_message
19795 /* Parse the type-specifier-seq. */
19799 /* If it's a `)', then there is no declarator. */
19802 else
19808 /* Restore the saved message. */
19815 }
19817 /* Parse a throw-expression.
19819 throw-expression:
19820 throw assignment-expression [opt]
19822 Returns a THROW_EXPR representing the throw-expression. */
19824 static tree
19826 {
19827 tree expression;
19832 /* Figure out whether or not there is an assignment-expression
19833 following the "throw" keyword. */
19841 else
19846 }
19848 /* GNU Extensions */
19850 /* Parse an (optional) asm-specification.
19852 asm-specification:
19853 asm ( string-literal )
19855 If the asm-specification is present, returns a STRING_CST
19856 corresponding to the string-literal. Otherwise, returns
19857 NULL_TREE. */
19859 static tree
19861 {
19863 tree asm_specification;
19865 /* Peek at the next token. */
19867 /* If the next token isn't the `asm' keyword, then there's no
19868 asm-specification. */
19872 /* Consume the `asm' token. */
19874 /* Look for the `('. */
19877 /* Look for the string-literal. */
19880 /* Look for the `)'. */
19884 }
19886 /* Parse an asm-operand-list.
19888 asm-operand-list:
19889 asm-operand
19890 asm-operand-list , asm-operand
19892 asm-operand:
19893 string-literal ( expression )
19894 [ string-literal ] string-literal ( expression )
19896 Returns a TREE_LIST representing the operands. The TREE_VALUE of
19897 each node is the expression. The TREE_PURPOSE is itself a
19898 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
19899 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
19900 is a STRING_CST for the string literal before the parenthesis. Returns
19901 ERROR_MARK_NODE if any of the operands are invalid. */
19903 static tree
19905 {
19910 {
19911 tree string_literal;
19912 tree expression;
19913 tree name;
19916 {
19917 /* Consume the `[' token. */
19919 /* Read the operand name. */
19924 /* Look for the closing `]'. */
19926 }
19927 else
19929 /* Look for the string-literal. */
19932 /* Look for the `('. */
19934 /* Parse the expression. */
19936 /* Look for the `)'. */
19944 /* Add this operand to the list. */
19946 expression,
19947 asm_operands);
19948 /* If the next token is not a `,', there are no more
19949 operands. */
19952 /* Consume the `,'. */
19954 }
19957 }
19959 /* Parse an asm-clobber-list.
19961 asm-clobber-list:
19962 string-literal
19963 asm-clobber-list , string-literal
19965 Returns a TREE_LIST, indicating the clobbers in the order that they
19966 appeared. The TREE_VALUE of each node is a STRING_CST. */
19968 static tree
19970 {
19974 {
19975 tree string_literal;
19977 /* Look for the string literal. */
19979 /* Add it to the list. */
19981 /* If the next token is not a `,', then the list is
19982 complete. */
19985 /* Consume the `,' token. */
19987 }
19990 }
19992 /* Parse an asm-label-list.
19994 asm-label-list:
19995 identifier
19996 asm-label-list , identifier
19998 Returns a TREE_LIST, indicating the labels in the order that they
19999 appeared. The TREE_VALUE of each node is a label. */
20001 static tree
20003 {
20007 {
20010 /* Look for the identifier. */
20013 {
20016 {
20022 }
20023 }
20024 /* If the next token is not a `,', then the list is
20025 complete. */
20028 /* Consume the `,' token. */
20030 }
20033 }
20035 /* Parse an (optional) series of attributes.
20037 attributes:
20038 attributes attribute
20040 attribute:
20041 __attribute__ (( attribute-list [opt] ))
20043 The return value is as for cp_parser_attribute_list. */
20045 static tree
20047 {
20051 {
20053 tree attribute_list;
20055 /* Peek at the next token. */
20057 /* If it's not `__attribute__', then we're done. */
20061 /* Consume the `__attribute__' keyword. */
20063 /* Look for the two `(' tokens. */
20067 /* Peek at the next token. */
20070 /* Parse the attribute-list. */
20072 else
20073 /* If the next token is a `)', then there is no attribute
20074 list. */
20077 /* Look for the two `)' tokens. */
20081 /* Add these new attributes to the list. */
20083 }
20086 }
20088 /* Parse an attribute-list.
20090 attribute-list:
20091 attribute
20092 attribute-list , attribute
20094 attribute:
20095 identifier
20096 identifier ( identifier )
20097 identifier ( identifier , expression-list )
20098 identifier ( expression-list )
20100 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
20101 to an attribute. The TREE_PURPOSE of each node is the identifier
20102 indicating which attribute is in use. The TREE_VALUE represents
20103 the arguments, if any. */
20105 static tree
20107 {
20113 {
20115 tree identifier;
20116 tree attribute;
20118 /* Look for the identifier. We also allow keywords here; for
20119 example `__attribute__ ((const))' is legal. */
20123 {
20126 /* Consume the token. */
20129 /* Save away the identifier that indicates which attribute
20130 this is. */
20132 /* For keywords, use the canonical spelling, not the
20133 parsed identifier. */
20139 /* Peek at the next token. */
20141 /* If it's an `(', then parse the attribute arguments. */
20143 {
20147 vec = cp_parser_parenthesized_expression_list
20153 else
20154 {
20157 }
20158 /* Save the arguments away. */
20160 }
20163 {
20164 /* Add this attribute to the list. */
20167 }
20170 }
20171 /* Now, look for more attributes. If the next token isn't a
20172 `,', we're done. */
20176 /* Consume the comma and keep going. */
20178 }
20181 /* We built up the list in reverse order. */
20183 }
20185 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
20186 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
20187 current value of the PEDANTIC flag, regardless of whether or not
20188 the `__extension__' keyword is present. The caller is responsible
20189 for restoring the value of the PEDANTIC flag. */
20191 static bool
20193 {
20194 /* Save the old value of the PEDANTIC flag. */
20198 {
20199 /* Consume the `__extension__' token. */
20201 /* We're not being pedantic while the `__extension__' keyword is
20202 in effect. */
20206 }
20209 }
20211 /* Parse a label declaration.
20213 label-declaration:
20214 __label__ label-declarator-seq ;
20216 label-declarator-seq:
20217 identifier , label-declarator-seq
20218 identifier */
20220 static void
20222 {
20223 /* Look for the `__label__' keyword. */
20227 {
20228 tree identifier;
20230 /* Look for an identifier. */
20232 /* If we failed, stop. */
20235 /* Declare it as a label. */
20237 /* If the next token is a `;', stop. */
20240 /* Look for the `,' separating the label declarations. */
20242 }
20244 /* Look for the final `;'. */
20246 }
20248 /* Support Functions */
20250 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
20251 NAME should have one of the representations used for an
20252 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
20253 is returned. If PARSER->SCOPE is a dependent type, then a
20254 SCOPE_REF is returned.
20256 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
20257 returned; the name was already resolved when the TEMPLATE_ID_EXPR
20258 was formed. Abstractly, such entities should not be passed to this
20259 function, because they do not need to be looked up, but it is
20260 simpler to check for this special case here, rather than at the
20261 call-sites.
20263 In cases not explicitly covered above, this function returns a
20264 DECL, OVERLOAD, or baselink representing the result of the lookup.
20265 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
20266 is returned.
20268 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
20269 (e.g., "struct") that was used. In that case bindings that do not
20270 refer to types are ignored.
20272 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
20273 ignored.
20275 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
20276 are ignored.
20278 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
20279 types.
20281 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
20282 TREE_LIST of candidates if name-lookup results in an ambiguity, and
20283 NULL_TREE otherwise. */
20285 static tree
20292 location_t name_location)
20293 {
20295 tree decl;
20301 /* Assume that the lookup will be unambiguous. */
20305 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
20306 no longer valid. Note that if we are parsing tentatively, and
20307 the parse fails, OBJECT_TYPE will be automatically restored. */
20313 /* A template-id has already been resolved; there is no lookup to
20314 do. */
20318 {
20322 }
20324 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
20325 it should already have been checked to make sure that the name
20326 used matches the type being destroyed. */
20328 {
20329 tree type;
20331 /* Figure out to which type this destructor applies. */
20336 else
20338 /* If that's not a class type, there is no destructor. */
20345 /* If it was a class type, return the destructor. */
20347 }
20349 /* By this point, the NAME should be an ordinary identifier. If
20350 the id-expression was a qualified name, the qualifying scope is
20351 stored in PARSER->SCOPE at this point. */
20354 /* Perform the lookup. */
20356 {
20362 /* If the SCOPE is dependent, the lookup must be deferred until
20363 the template is instantiated -- unless we are explicitly
20364 looking up names in uninstantiated templates. Even then, we
20365 cannot look up the name if the scope is not a class type; it
20366 might, for example, be a template type parameter. */
20371 /* Defer lookup. */
20373 else
20374 {
20377 /* If PARSER->SCOPE is a dependent type, then it must be a
20378 class type, and we must not be checking dependencies;
20379 otherwise, we would have processed this lookup above. So
20380 that PARSER->SCOPE is not considered a dependent base by
20381 lookup_member, we must enter the scope here. */
20385 /* If the PARSER->SCOPE is a template specialization, it
20386 may be instantiated during name lookup. In that case,
20387 errors may be issued. Even if we rollback the current
20388 tentative parse, those errors are valid. */
20393 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
20394 lookup result and the nested-name-specifier nominates a class C:
20395 * if the name specified after the nested-name-specifier, when
20396 looked up in C, is the injected-class-name of C (Clause 9), or
20397 * if the name specified after the nested-name-specifier is the
20398 same as the identifier or the simple-template-id's template-
20399 name in the last component of the nested-name-specifier,
20400 the name is instead considered to name the constructor of
20401 class C. [ Note: for example, the constructor is not an
20402 acceptable lookup result in an elaborated-type-specifier so
20403 the constructor would not be used in place of the
20404 injected-class-name. --end note ] Such a constructor name
20405 shall be used only in the declarator-id of a declaration that
20406 names a constructor or in a using-declaration. */
20414 /* If we have a single function from a using decl, pull it out. */
20421 }
20423 /* If the scope is a dependent type and either we deferred lookup or
20424 we did lookup but didn't find the name, rememeber the name. */
20427 {
20429 {
20430 tree type;
20432 /* The resolution to Core Issue 180 says that `struct
20433 A::B' should be considered a type-name, even if `A'
20434 is dependent. */
20438 }
20442 CPP_CLOSE_PAREN)))
20446 else
20449 is_template);
20450 }
20453 }
20455 {
20457 /* Look up the name in the scope of the OBJECT_TYPE, unless the
20458 OBJECT_TYPE is not a class. */
20460 /* If the OBJECT_TYPE is a template specialization, it may
20461 be instantiated during name lookup. In that case, errors
20462 may be issued. Even if we rollback the current tentative
20463 parse, those errors are valid. */
20465 name,
20468 tf_warning_or_error);
20469 /* Look it up in the enclosing context, too. */
20477 }
20478 else
20479 {
20485 }
20487 /* If the lookup failed, let our caller know. */
20491 /* Pull out the template from an injected-class-name (or multiple). */
20495 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
20497 {
20500 /* The error message we have to print is too complicated for
20501 cp_parser_error, so we incorporate its actions directly. */
20503 {
20505 name);
20507 }
20509 }
20517 /* If we have resolved the name of a member declaration, check to
20518 see if the declaration is accessible. When the name resolves to
20519 set of overloaded functions, accessibility is checked when
20520 overload resolution is done.
20522 During an explicit instantiation, access is not checked at all,
20523 as per [temp.explicit]. */
20530 }
20532 /* Like cp_parser_lookup_name, but for use in the typical case where
20533 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
20534 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
20536 static tree
20538 {
20540 none_type,
20545 location);
20546 }
20548 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
20549 the current context, return the TYPE_DECL. If TAG_NAME_P is
20550 true, the DECL indicates the class being defined in a class-head,
20551 or declared in an elaborated-type-specifier.
20553 Otherwise, return DECL. */
20555 static tree
20557 {
20558 /* If the TEMPLATE_DECL is being declared as part of a class-head,
20559 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
20561 struct A {
20562 template <typename T> struct B;
20563 };
20565 template <typename T> struct A::B {};
20567 Similarly, in an elaborated-type-specifier:
20569 namespace N { struct X{}; }
20571 struct A {
20572 template <typename T> friend struct N::X;
20573 };
20575 However, if the DECL refers to a class type, and we are in
20576 the scope of the class, then the name lookup automatically
20577 finds the TYPE_DECL created by build_self_reference rather
20578 than a TEMPLATE_DECL. For example, in:
20580 template <class T> struct S {
20581 S s;
20582 };
20584 there is no need to handle such case. */
20590 }
20592 /* If too many, or too few, template-parameter lists apply to the
20593 declarator, issue an error message. Returns TRUE if all went well,
20594 and FALSE otherwise. */
20596 static bool
20599 location_t declarator_location)
20600 {
20603 /* We haven't seen any classes that involve template parameters yet. */
20607 {
20610 {
20611 tree scope;
20616 {
20617 /* You're supposed to have one `template <...>'
20618 for every template class, but you don't need one
20619 for a full specialization. For example:
20621 template <class T> struct S{};
20622 template <> struct S<int> { void f(); };
20623 void S<int>::f () {}
20625 is correct; there shouldn't be a `template <>' for
20626 the definition of `S<int>::f'. */
20628 /* If SCOPE does not have template information of any
20629 kind, then it is not a template, nor is it nested
20630 within a template. */
20638 }
20639 }
20642 /* If the DECLARATOR has the form `X<y>' then it uses one
20643 additional level of template parameters. */
20646 return cp_parser_check_template_parameters
20663 }
20665 }
20667 /* NUM_TEMPLATES were used in the current declaration. If that is
20668 invalid, return FALSE and issue an error messages. Otherwise,
20669 return TRUE. If DECLARATOR is non-NULL, then we are checking a
20670 declarator and we can print more accurate diagnostics. */
20672 static bool
20675 location_t location,
20677 {
20678 /* If there are the same number of template classes and parameter
20679 lists, that's OK. */
20682 /* If there are more, but only one more, then we are referring to a
20683 member template. That's OK too. */
20686 /* If there are more template classes than parameter lists, we have
20687 something like:
20689 template <class T> void S<T>::R<T>::f (); */
20691 {
20701 else
20704 }
20705 /* Otherwise, there are too many template parameter lists. We have
20706 something like:
20708 template <class T> template <class U> void S::f(); */
20711 }
20713 /* Parse an optional `::' token indicating that the following name is
20714 from the global namespace. If so, PARSER->SCOPE is set to the
20715 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
20716 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
20717 Returns the new value of PARSER->SCOPE, if the `::' token is
20718 present, and NULL_TREE otherwise. */
20720 static tree
20722 {
20725 /* Peek at the next token. */
20727 /* If we're looking at a `::' token then we're starting from the
20728 global namespace, not our current location. */
20730 {
20731 /* Consume the `::' token. */
20733 /* Set the SCOPE so that we know where to start the lookup. */
20739 }
20741 {
20745 }
20748 }
20750 /* Returns TRUE if the upcoming token sequence is the start of a
20751 constructor declarator. If FRIEND_P is true, the declarator is
20752 preceded by the `friend' specifier. */
20754 static bool
20756 {
20758 tree nested_name_specifier;
20761 /* The common case is that this is not a constructor declarator, so
20762 try to avoid doing lots of work if at all possible. It's not
20763 valid declare a constructor at function scope. */
20766 /* And only certain tokens can begin a constructor declarator. */
20774 /* Parse tentatively; we are going to roll back all of the tokens
20775 consumed here. */
20777 /* Assume that we are looking at a constructor declarator. */
20780 /* Look for the optional `::' operator. */
20783 /* Look for the nested-name-specifier. */
20784 nested_name_specifier
20790 /* Outside of a class-specifier, there must be a
20791 nested-name-specifier. */
20799 /* If we have a class scope, this is easy; DR 147 says that S::S always
20800 names the constructor, and no other qualified name could. */
20803 {
20813 }
20814 /* If we still think that this might be a constructor-declarator,
20815 look for a class-name. */
20817 {
20818 /* If we have:
20820 template <typename T> struct S {
20821 S();
20822 };
20824 we must recognize that the nested `S' names a class. */
20825 tree type_decl;
20829 none_type,
20833 /* If there was no class-name, then this is not a constructor. */
20836 /* If we're still considering a constructor, we have to see a `(',
20837 to begin the parameter-declaration-clause, followed by either a
20838 `)', an `...', or a decl-specifier. We need to check for a
20839 type-specifier to avoid being fooled into thinking that:
20841 S (f) (int);
20843 is a constructor. (It is actually a function named `f' that
20844 takes one parameter (of type `int') and returns a value of type
20845 `S'. */
20853 /* A parameter declaration begins with a decl-specifier,
20854 which is either the "attribute" keyword, a storage class
20855 specifier, or (usually) a type-specifier. */
20857 {
20858 tree type;
20862 /* Names appearing in the type-specifier should be looked up
20863 in the scope of the class. */
20866 else
20867 {
20870 {
20874 {
20877 }
20878 }
20880 }
20882 /* Inside the constructor parameter list, surrounding
20883 template-parameter-lists do not apply. */
20884 saved_num_template_parameter_lists
20888 /* Look for the type-specifier. */
20890 CP_PARSER_FLAGS_NONE,
20896 parser->num_template_parameter_lists
20899 /* Leave the scope of the class. */
20904 }
20905 }
20907 /* We did not really want to consume any tokens. */
20911 }
20913 /* Parse the definition of the function given by the DECL_SPECIFIERS,
20914 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
20915 they must be performed once we are in the scope of the function.
20917 Returns the function defined. */
20919 static tree
20920 cp_parser_function_definition_from_specifiers_and_declarator
20923 tree attributes,
20925 {
20926 tree fn;
20929 /* Begin the function-definition. */
20932 /* The things we're about to see are not directly qualified by any
20933 template headers we've seen thus far. */
20936 /* If there were names looked up in the decl-specifier-seq that we
20937 did not check, check them now. We must wait until we are in the
20938 scope of the function to perform the checks, since the function
20939 might be a friend. */
20943 {
20944 /* Skip the entire function. */
20947 }
20949 {
20950 /* Seen already, skip it. An error message has already been output. */
20954 /* If this is a function from a class, pop the nested class. */
20957 }
20958 else
20959 {
20960 timevar_id_t tv;
20963 else
20969 }
20972 }
20974 /* Parse the part of a function-definition that follows the
20975 declarator. INLINE_P is TRUE iff this function is an inline
20976 function defined within a class-specifier.
20978 Returns the function defined. */
20980 static tree
20983 {
20984 tree fn;
20993 /* If the next token is `return', then the code may be trying to
20994 make use of the "named return value" extension that G++ used to
20995 support. */
20998 {
20999 /* Consume the `return' keyword. */
21001 /* Look for the identifier that indicates what value is to be
21002 returned. */
21004 /* Issue an error message. */
21007 /* Skip tokens until we reach the start of the function body. */
21009 {
21016 }
21017 }
21018 /* The `extern' in `extern "C" void f () { ... }' does not apply to
21019 anything declared inside `f'. */
21020 saved_in_unbraced_linkage_specification_p
21023 /* Inside the function, surrounding template-parameter-lists do not
21024 apply. */
21025 saved_num_template_parameter_lists
21031 /* If the next token is `try', `__transaction_atomic', or
21032 `__transaction_relaxed`, then we are looking at either function-try-block
21033 or function-transaction-block. Note that all of these include the
21034 function-body. */
21037 RID_TRANSACTION_ATOMIC);
21039 RID_TRANSACTION_RELAXED))
21041 RID_TRANSACTION_RELAXED);
21044 else
21045 ctor_initializer_p
21050 /* Finish the function. */
21053 /* Generate code for it, if necessary. */
21055 /* Restore the saved values. */
21056 parser->in_unbraced_linkage_specification_p
21058 parser->num_template_parameter_lists
21063 }
21065 /* Parse a template-declaration, assuming that the `export' (and
21066 `extern') keywords, if present, has already been scanned. MEMBER_P
21067 is as for cp_parser_template_declaration. */
21069 static void
21071 {
21074 tree parameter_list;
21079 /* Look for the `template' keyword. */
21084 /* And the `<'. */
21088 {
21089 /* 14.5.2.2 [temp.mem]
21091 A local class shall not have member templates. */
21096 }
21097 /* [temp]
21099 A template ... shall not have C linkage. */
21101 {
21103 /* Give it C++ linkage to avoid confusing other parts of the
21104 front end. */
21107 }
21108 else
21111 /* We cannot perform access checks on the template parameter
21112 declarations until we know what is being declared, just as we
21113 cannot check the decl-specifier list. */
21116 /* If the next token is `>', then we have an invalid
21117 specialization. Rather than complain about an invalid template
21118 parameter, issue an error message here. */
21120 {
21124 }
21125 else
21126 {
21127 /* Parse the template parameters. */
21130 }
21132 /* Get the deferred access checks from the parameter list. These
21133 will be checked once we know what is being declared, as for a
21134 member template the checks must be performed in the scope of the
21135 class containing the member. */
21138 /* Look for the `>'. */
21140 /* We just processed one more parameter list. */
21142 /* If the next token is `template', there are more template
21143 parameters. */
21145 RID_TEMPLATE))
21150 else
21151 {
21152 /* There are no access checks when parsing a template, as we do not
21153 know if a specialization will be a friend. */
21157 checks,
21158 member_p,
21163 /* If this is a member template declaration, let the front
21164 end know. */
21166 {
21171 }
21175 }
21176 /* We are done with the current parameter list. */
21181 /* Finish up. */
21184 /* Check the template arguments for a literal operator template. */
21188 {
21192 else
21193 {
21197 else
21198 {
21204 }
21205 }
21209 decl);
21210 }
21211 /* Register member declarations. */
21214 /* For the erroneous case of a template with C linkage, we pushed an
21215 implicit C++ linkage scope; exit that scope now. */
21218 /* If DECL is a function template, we must return to parse it later.
21219 (Even though there is no definition, there might be default
21220 arguments that need handling.) */
21225 }
21227 /* Perform the deferred access checks from a template-parameter-list.
21228 CHECKS is a TREE_LIST of access checks, as returned by
21229 get_deferred_access_checks. */
21231 static void
21233 {
21237 }
21239 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
21240 `function-definition' sequence. MEMBER_P is true, this declaration
21241 appears in a class scope.
21243 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
21244 *FRIEND_P is set to TRUE iff the declaration is a friend. */
21246 static tree
21252 {
21255 cp_decl_specifier_seq decl_specifiers;
21259 /* This function is only used when processing a template
21260 declaration. */
21264 /* Defer access checks until we know what is being declared. */
21267 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
21268 alternative. */
21271 CP_PARSER_FLAGS_OPTIONAL,
21277 /* There are no template typedefs. */
21279 {
21283 }
21285 /* Gather up the access checks that occurred the
21286 decl-specifier-seq. */
21289 /* Check for the declaration of a template class. */
21291 {
21293 {
21296 /* In this case:
21298 struct C {
21299 friend template <typename T> struct A<T>::B;
21300 };
21302 A<T>::B will be represented by a TYPENAME_TYPE, and
21303 therefore not recognized by shadow_tag. */
21305 && !decl
21312 else
21315 /* Perform access checks for template parameters. */
21317 }
21318 }
21320 /* Complain about missing 'typename' or other invalid type names. */
21323 {
21324 /* cp_parser_parse_and_diagnose_invalid_type_name calls
21325 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
21326 the rest of this declaration. */
21329 }
21331 /* If it's not a template class, try for a template function. If
21332 the next token is a `;', then this declaration does not declare
21333 anything. But, if there were errors in the decl-specifiers, then
21334 the error might well have come from an attempted class-specifier.
21335 In that case, there's no need to warn about a missing declarator. */
21339 {
21342 checks,
21344 member_p,
21345 declares_class_or_enum,
21347 NULL);
21349 /* 7.1.1-1 [dcl.stc]
21351 A storage-class-specifier shall not be specified in an explicit
21352 specialization... */
21354 && explicit_specialization_p
21356 {
21360 }
21361 }
21363 /* Look for a trailing `;' after the declaration. */
21369 out:
21372 /* Clear any current qualification; whatever comes next is the start
21373 of something new. */
21379 }
21381 /* Parse a cast-expression that is not the operand of a unary "&". */
21383 static tree
21385 {
21388 }
21390 /* Parse a functional cast to TYPE. Returns an expression
21391 representing the cast. */
21393 static tree
21395 {
21397 tree expression_list;
21398 tree cast;
21402 {
21409 tf_warning_or_error);
21410 }
21419 else
21420 {
21423 }
21426 tf_warning_or_error);
21427 /* [expr.const]/1: In an integral constant expression "only type
21428 conversions to integral or enumeration type can be used". */
21434 NIC_CONSTRUCTOR))
21437 }
21439 /* Save the tokens that make up the body of a member function defined
21440 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
21441 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
21442 specifiers applied to the declaration. Returns the FUNCTION_DECL
21443 for the member function. */
21445 static tree
21449 tree attributes)
21450 {
21453 tree fn;
21455 /* Create the FUNCTION_DECL. */
21457 /* If something went badly wrong, bail out now. */
21459 {
21460 /* If there's a function-body, skip it. */
21465 }
21467 /* Remember it, if there default args to post process. */
21470 /* Save away the tokens that make up the body of the
21471 function. */
21473 /* We can have braced-init-list mem-initializers before the fn body. */
21475 {
21479 {
21480 /* cache_group will stop after an un-nested { } pair, too. */
21484 /* variadic mem-inits have ... after the ')'. */
21487 }
21488 }
21490 /* Handle function try blocks. */
21495 /* Save away the inline definition; we will process it when the
21496 class is complete. */
21500 /* We need to know that this was defined in the class, so that
21501 friend templates are handled correctly. */
21504 /* Add FN to the queue of functions to be parsed later. */
21508 }
21510 /* Save the tokens that make up the in-class initializer for a non-static
21511 data member. Returns a DEFAULT_ARG. */
21513 static tree
21515 {
21517 }
21519 /* Parse a template-argument-list, as well as the trailing ">" (but
21520 not the opening "<"). See cp_parser_template_argument_list for the
21521 return value. */
21523 static tree
21525 {
21526 tree arguments;
21527 tree saved_scope;
21528 tree saved_qualifying_scope;
21529 tree saved_object_scope;
21534 /* [temp.names]
21536 When parsing a template-id, the first non-nested `>' is taken as
21537 the end of the template-argument-list rather than a greater-than
21538 operator. */
21539 saved_greater_than_is_operator_p
21542 /* Parsing the argument list may modify SCOPE, so we save it
21543 here. */
21547 /* We need to evaluate the template arguments, even though this
21548 template-id may be nested within a "sizeof". */
21553 /* Parse the template-argument-list itself. */
21557 else
21559 /* Look for the `>' that ends the template-argument-list. If we find
21560 a '>>' instead, it's probably just a typo. */
21562 {
21564 {
21565 /* In C++0x, a `>>' in a template argument list or cast
21566 expression is considered to be two separate `>'
21567 tokens. So, change the current token to a `>', but don't
21568 consume it: it will be consumed later when the outer
21569 template argument list (or cast expression) is parsed.
21570 Note that this replacement of `>' for `>>' is necessary
21571 even if we are parsing tentatively: in the tentative
21572 case, after calling
21573 cp_parser_enclosed_template_argument_list we will always
21574 throw away all of the template arguments and the first
21575 closing `>', either because the template argument list
21576 was erroneous or because we are replacing those tokens
21577 with a CPP_TEMPLATE_ID token. The second `>' (which will
21578 not have been thrown away) is needed either to close an
21579 outer template argument list or to complete a new-style
21580 cast. */
21583 }
21585 {
21586 /* If we're in a nested template argument list, the '>>' has
21587 to be a typo for '> >'. We emit the error message, but we
21588 continue parsing and we push a '>' as next token, so that
21589 the argument list will be parsed correctly. Note that the
21590 global source location is still on the token before the
21591 '>>', so we need to say explicitly where we want it. */
21597 }
21598 else
21599 {
21600 /* If this is not a nested template argument list, the '>>'
21601 is a typo for '>'. Emit an error message and continue.
21602 Same deal about the token location, but here we can get it
21603 right by consuming the '>>' before issuing the diagnostic. */
21606 "spurious %<>>%>, use %<>%> to terminate "
21608 }
21609 }
21610 else
21612 /* The `>' token might be a greater-than operator again now. */
21613 parser->greater_than_is_operator_p
21615 /* Restore the SAVED_SCOPE. */
21623 }
21625 /* MEMBER_FUNCTION is a member function, or a friend. If default
21626 arguments, or the body of the function have not yet been parsed,
21627 parse them now. */
21629 static void
21631 {
21633 /* If this member is a template, get the underlying
21634 FUNCTION_DECL. */
21638 /* There should not be any class definitions in progress at this
21639 point; the bodies of members are only parsed outside of all class
21640 definitions. */
21642 /* While we're parsing the member functions we might encounter more
21643 classes. We want to handle them right away, but we don't want
21644 them getting mixed up with functions that are currently in the
21645 queue. */
21648 /* Make sure that any template parameters are in scope. */
21651 /* If the body of the function has not yet been parsed, parse it
21652 now. */
21654 {
21655 tree function_scope;
21658 /* The function is no longer pending; we are processing it. */
21663 /* If this is a local class, enter the scope of the containing
21664 function. */
21669 /* Push the body of the function onto the lexer stack. */
21672 /* Let the front end know that we going to be defining this
21673 function. */
21677 /* Don't do access checking if it is a templated function. */
21681 /* Now, parse the body of the function. */
21688 /* Leave the scope of the containing function. */
21692 }
21694 /* Remove any template parameters from the symbol table. */
21697 /* Restore the queue. */
21700 }
21702 /* If DECL contains any default args, remember it on the unparsed
21703 functions queue. */
21705 static void
21707 {
21708 tree probe;
21711 probe;
21714 {
21715 cp_default_arg_entry *entry
21721 }
21722 }
21724 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
21725 which is either a FIELD_DECL or PARM_DECL. Parse it and return
21726 the result. For a PARM_DECL, PARMTYPE is the corresponding type
21727 from the parameter-type-list. */
21729 static tree
21732 {
21734 tree parsed_arg;
21740 /* Push the saved tokens for the default argument onto the parser's
21741 lexer stack. */
21747 /* Parse the default argument. */
21755 {
21756 /* In a non-template class, check conversions now. In a template,
21757 we'll wait and instantiate these as needed. */
21760 else
21761 {
21767 }
21768 }
21770 /* If the token stream has not been completely used up, then
21771 there was extra junk after the end of the default
21772 argument. */
21774 {
21777 else
21779 }
21781 /* Revert to the main lexer. */
21785 }
21787 /* FIELD is a non-static data member with an initializer which we saved for
21788 later; parse it now. */
21790 static void
21792 {
21793 tree def;
21798 NULL_TREE);
21802 }
21804 /* FN is a FUNCTION_DECL which may contains a parameter with an
21805 unparsed DEFAULT_ARG. Parse the default args now. This function
21806 assumes that the current scope is the scope in which the default
21807 argument should be processed. */
21809 static void
21811 {
21815 /* While we're parsing the default args, we might (due to the
21816 statement expression extension) encounter more classes. We want
21817 to handle them right away, but we don't want them getting mixed
21818 up with default args that are currently in the queue. */
21821 /* Local variable names (and the `this' keyword) may not appear
21822 in a default argument. */
21833 {
21835 tree parsed_arg;
21837 tree copy;
21844 /* This can happen for a friend declaration for a function
21845 already declared with default arguments. */
21848 parsed_arg
21850 default_arg,
21853 {
21855 }
21859 /* Update any instantiations we've already created. */
21863 }
21867 /* Make sure no default arg is missing. */
21870 /* Restore the state of local_variables_forbidden_p. */
21873 /* Restore the queue. */
21875 }
21877 /* Parse the operand of `sizeof' (or a similar operator). Returns
21878 either a TYPE or an expression, depending on the form of the
21879 input. The KEYWORD indicates which kind of expression we have
21880 encountered. */
21882 static tree
21884 {
21892 /* Types cannot be defined in a `sizeof' expression. Save away the
21893 old message. */
21895 /* And create the new one. */
21901 /* The restrictions on constant-expressions do not apply inside
21902 sizeof expressions. */
21903 saved_integral_constant_expression_p
21905 saved_non_integral_constant_expression_p
21909 /* If it's a `...', then we are computing the length of a parameter
21910 pack. */
21913 {
21914 /* Consume the `...'. */
21918 /* Note that this is an expansion. */
21920 }
21922 /* Do not actually evaluate the expression. */
21925 /* If it's a `(', then we might be looking at the type-id
21926 construction. */
21928 {
21929 tree type;
21932 /* We can't be sure yet whether we're looking at a type-id or an
21933 expression. */
21935 /* Consume the `('. */
21937 /* Parse the type-id. */
21942 /* Now, look for the trailing `)'. */
21944 /* If all went well, then we're done. */
21946 {
21947 cp_decl_specifier_seq decl_specs;
21949 /* Build a trivial decl-specifier-seq. */
21953 /* Call grokdeclarator to figure out what type this is. */
21956 TYPENAME,
21959 }
21960 }
21962 /* If the type-id production did not work out, then we must be
21963 looking at the unary-expression production. */
21969 /* Build a pack expansion. */
21972 /* Go back to evaluating expressions. */
21976 /* Free the message we created. */
21978 /* And restore the old one. */
21980 parser->integral_constant_expression_p
21982 parser->non_integral_constant_expression_p
21986 }
21988 /* If the current declaration has no declarator, return true. */
21990 static bool
21992 {
21993 /* If the next token is a `;' or a `,' then there is no
21994 declarator. */
21997 }
21999 /* Update the DECL_SPECS to reflect the storage class indicated by
22000 KEYWORD. */
22002 static void
22006 location_t location)
22007 {
22008 cp_storage_class storage_class;
22011 {
22015 }
22017 {
22020 }
22024 {
22027 }
22030 {
22048 }
22051 /* A storage class specifier cannot be applied alongside a typedef
22052 specifier. If there is a typedef specifier present then set
22053 conflicting_specifiers_p which will trigger an error later
22054 on in grokdeclarator. */
22057 }
22059 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
22060 is true, the type is a class or enum definition. */
22062 static void
22064 tree type_spec,
22065 location_t location,
22067 {
22070 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
22071 (with, for example, in "typedef int wchar_t;") we remember that
22072 this is what happened. In system headers, we ignore these
22073 declarations so that G++ can work with system headers that are not
22074 C++-safe. */
22076 && !type_definition_p
22086 {
22089 {
22093 }
22094 }
22097 else
22098 {
22103 }
22104 }
22106 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
22107 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
22109 static bool
22111 {
22113 }
22115 /* Issue an error message indicating that TOKEN_DESC was expected.
22116 If KEYWORD is true, it indicated this function is called by
22117 cp_parser_require_keword and the required token can only be
22118 a indicated keyword. */
22120 static void
22122 required_token token_desc,
22124 {
22126 {
22195 }
22197 {
22199 {
22278 }
22279 }
22280 else
22282 }
22286 /* If the next token is of the indicated TYPE, consume it. Otherwise,
22287 issue an error message indicating that TOKEN_DESC was expected.
22289 Returns the token consumed, if the token had the appropriate type.
22290 Otherwise, returns NULL. */
22295 required_token token_desc)
22296 {
22299 else
22300 {
22301 /* Output the MESSAGE -- unless we're parsing tentatively. */
22305 }
22306 }
22308 /* An error message is produced if the next token is not '>'.
22309 All further tokens are skipped until the desired token is
22310 found or '{', '}', ';' or an unbalanced ')' or ']'. */
22312 static void
22314 {
22315 /* Current level of '< ... >'. */
22317 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
22320 /* Are we ready, yet? If not, issue error message. */
22324 /* Skip tokens until the desired token is found. */
22326 {
22327 /* Peek at the next token. */
22329 {
22337 /* C++0x views the `>>' operator as two `>' tokens, but
22338 C++98 does not. */
22341 {
22342 /* We've hit a `>>' where the first `>' closes the
22343 template argument list, and the second `>' is
22344 spurious. Just consume the `>>' and stop; we've
22345 already produced at least one error. */
22348 }
22349 /* Fall through for C++0x, so we handle the second `>' in
22350 the `>>'. */
22354 {
22355 /* We've reached the token we want, consume it and stop. */
22358 }
22377 /* The '>' was probably forgotten, don't look further. */
22382 }
22384 /* Consume this token. */
22386 }
22387 }
22389 /* If the next token is the indicated keyword, consume it. Otherwise,
22390 issue an error message indicating that TOKEN_DESC was expected.
22392 Returns the token consumed, if the token had the appropriate type.
22393 Otherwise, returns NULL. */
22398 required_token token_desc)
22399 {
22403 {
22406 }
22409 }
22411 /* Returns TRUE iff TOKEN is a token that can begin the body of a
22412 function-definition. */
22414 static bool
22416 {
22419 /* A ctor-initializer begins with a `:'. */
22421 /* A function-try-block begins with `try'. */
22423 /* A function-transaction-block begins with `__transaction_atomic'
22424 or `__transaction_relaxed'. */
22427 /* The named return value extension begins with `return'. */
22429 }
22431 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
22432 definition. */
22434 static bool
22436 {
22441 }
22443 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
22444 C++0x) ending a template-argument. */
22446 static bool
22448 {
22456 }
22458 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
22459 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
22461 static bool
22464 {
22470 /* Check for the sequence `<::' in the original code. It would be lexed as
22471 `[:', where `[' is a digraph, and there is no whitespace before
22472 `:'. */
22474 {
22479 }
22481 }
22483 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
22484 or none_type otherwise. */
22486 static enum tag_types
22488 {
22490 {
22500 }
22501 }
22503 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
22505 static void
22507 {
22511 {
22515 type);
22518 }
22519 }
22521 /* Issue an error message if DECL is redeclared with different
22522 access than its original declaration [class.access.spec/3].
22523 This applies to nested classes and nested class templates.
22524 [class.mem/1]. */
22526 static void
22528 {
22537 }
22539 /* Look for the `template' keyword, as a syntactic disambiguator.
22540 Return TRUE iff it is present, in which case it will be
22541 consumed. */
22543 static bool
22545 {
22547 {
22548 /* The `template' keyword can only be used within templates;
22549 outside templates the parser can always figure out what is a
22550 template and what is not. */
22552 {
22555 "%<template%> (as a disambiguator) is only allowed "
22557 /* If this part of the token stream is rescanned, the same
22558 error message would be generated. So, we purge the token
22559 from the stream. */
22562 }
22563 else
22564 {
22565 /* Consume the `template' keyword. */
22568 }
22569 }
22572 }
22574 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
22575 set PARSER->SCOPE, and perform other related actions. */
22577 static void
22579 {
22585 /* Get the stored value. */
22587 /* Perform any access checks that were deferred. */
22590 {
22595 }
22596 /* Set the scope from the stored value. */
22600 }
22602 /* Consume tokens up through a non-nested END token. Returns TRUE if we
22603 encounter the end of a block before what we were looking for. */
22605 static bool
22609 {
22611 {
22614 /* Abort a parenthesized expression if we encounter a semicolon. */
22618 /* If we've reached the end of the file, stop. */
22624 /* We've hit the end of an enclosing block, so there's been some
22625 kind of syntax error. */
22628 /* Consume the token. */
22630 /* See if it starts a new group. */
22632 {
22634 /* In theory this should probably check end == '}', but
22635 cp_parser_save_member_function_body needs it to exit
22636 after either '}' or ')' when called with ')'. */
22639 }
22641 {
22645 }
22650 }
22651 }
22653 /* Like above, for caching a default argument or NSDMI. Both of these are
22654 terminated by a non-nested comma, but it can be unclear whether or not a
22655 comma is nested in a template argument list unless we do more parsing.
22656 In order to handle this ambiguity, when we encounter a ',' after a '<'
22657 we try to parse what follows as a parameter-declaration-list (in the
22658 case of a default argument) or a member-declarator (in the case of an
22659 NSDMI). If that succeeds, then we stop caching. */
22661 static tree
22663 {
22668 tree default_argument;
22670 /* Add tokens until we have processed the entire default
22671 argument. We add the range [first_token, token). */
22674 {
22675 /* For list-initialization, this is straightforward. */
22678 }
22680 {
22683 /* Peek at the next token. */
22685 /* What we do depends on what token we have. */
22687 {
22688 /* In valid code, a default argument must be
22689 immediately followed by a `,' `)', or `...'. */
22692 {
22693 /* If we've seen a '<', we might be in a
22694 template-argument-list. Until Core issue 325 is
22695 resolved, we don't know how this situation ought
22696 to be handled, so try to DTRT. We check whether
22697 what comes after the comma is a valid parameter
22698 declaration list. If it is, then the comma ends
22699 the default argument; otherwise the default
22700 argument continues. */
22702 tree t;
22704 /* Set ITALP so cp_parser_parameter_declaration_list
22705 doesn't decide to commit to this parse. */
22713 {
22719 }
22720 else
22721 {
22727 }
22734 }
22737 /* If we run into a non-nested `;', `}', or `]',
22738 then the code is invalid -- but the default
22739 argument is certainly over. */
22745 /* Update DEPTH, if necessary. */
22760 /* This might be the comparison operator, or it might
22761 start a template argument list. */
22768 /* Fall through for C++0x, which treats the `>>'
22769 operator like two `>' tokens in certain
22770 cases. */
22774 {
22775 /* This might be an operator, or it might close a
22776 template argument list. But if a previous '<'
22777 started a template argument list, this will have
22778 closed it, so we can't be in one anymore. */
22782 }
22785 /* If we run out of tokens, issue an error message. */
22794 /* In these cases, we should look for template-ids.
22795 For example, if the default argument is
22796 `X<int, double>()', we need to do name lookup to
22797 figure out whether or not `X' is a template; if
22798 so, the `,' does not end the default argument.
22800 That is not yet done. */
22805 }
22807 /* If we've reached the end, stop. */
22811 /* Add the token to the token block. */
22813 }
22815 /* Create a DEFAULT_ARG to represent the unparsed default
22816 argument. */
22823 }
22825 /* Begin parsing tentatively. We always save tokens while parsing
22826 tentatively so that if the tentative parsing fails we can restore the
22827 tokens. */
22829 static void
22831 {
22832 /* Enter a new parsing context. */
22834 /* Begin saving tokens. */
22836 /* In order to avoid repetitive access control error messages,
22837 access checks are queued up until we are no longer parsing
22838 tentatively. */
22840 }
22842 /* Commit to the currently active tentative parse. */
22844 static void
22846 {
22850 /* Mark all of the levels as committed. */
22853 {
22860 }
22861 }
22863 /* Abort the currently active tentative parse. All consumed tokens
22864 will be rolled back, and no diagnostics will be issued. */
22866 static void
22868 {
22872 /* Now, pretend that we want to see if the construct was
22873 successfully parsed. */
22875 }
22877 /* Stop parsing tentatively. If a parse error has occurred, restore the
22878 token stream. Otherwise, commit to the tokens we have consumed.
22879 Returns true if no error occurred; false otherwise. */
22881 static bool
22883 {
22887 /* Remember whether or not an error occurred, since we are about to
22888 destroy that information. */
22890 /* Remove the topmost context from the stack. */
22893 /* If no parse errors occurred, commit to the tentative parse. */
22895 {
22896 /* Commit to the tokens read tentatively, unless that was
22897 already done. */
22902 }
22903 /* Otherwise, if errors occurred, roll back our state so that things
22904 are just as they were before we began the tentative parse. */
22905 else
22906 {
22909 }
22910 /* Add the context to the front of the free list. */
22915 }
22917 /* Returns true if we are parsing tentatively and are not committed to
22918 this tentative parse. */
22920 static bool
22922 {
22925 }
22927 /* Returns nonzero iff an error has occurred during the most recent
22928 tentative parse. */
22930 static bool
22932 {
22935 }
22937 /* Returns nonzero if GNU extensions are allowed. */
22939 static bool
22941 {
22943 }
22944 \f
22945 /* Objective-C++ Productions */
22948 /* Parse an Objective-C expression, which feeds into a primary-expression
22949 above.
22951 objc-expression:
22952 objc-message-expression
22953 objc-string-literal
22954 objc-encode-expression
22955 objc-protocol-expression
22956 objc-selector-expression
22958 Returns a tree representation of the expression. */
22960 static tree
22962 {
22963 /* Try to figure out what kind of declaration is present. */
22967 {
22977 {
22989 }
22995 }
22998 }
23000 /* Parse an Objective-C message expression.
23002 objc-message-expression:
23003 [ objc-message-receiver objc-message-args ]
23005 Returns a representation of an Objective-C message. */
23007 static tree
23009 {
23018 }
23020 /* Parse an objc-message-receiver.
23022 objc-message-receiver:
23023 expression
23024 simple-type-specifier
23026 Returns a representation of the type or expression. */
23028 static tree
23030 {
23031 tree rcv;
23033 /* An Objective-C message receiver may be either (1) a type
23034 or (2) an expression. */
23043 CP_PARSER_FLAGS_NONE);
23046 }
23048 /* Parse the arguments and selectors comprising an Objective-C message.
23050 objc-message-args:
23051 objc-selector
23052 objc-selector-args
23053 objc-selector-args , objc-comma-args
23055 objc-selector-args:
23056 objc-selector [opt] : assignment-expression
23057 objc-selector-args objc-selector [opt] : assignment-expression
23059 objc-comma-args:
23060 assignment-expression
23061 objc-comma-args , assignment-expression
23063 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
23064 selector arguments and TREE_VALUE containing a list of comma
23065 arguments. */
23067 static tree
23069 {
23075 {
23081 /* Detect if we have a unary selector. */
23090 sel_args
23095 }
23097 /* Handle non-selector arguments, if any. */
23099 {
23100 tree arg;
23105 addl_args
23110 }
23113 {
23116 }
23119 }
23121 /* Parse an Objective-C encode expression.
23123 objc-encode-expression:
23124 @encode objc-typename
23126 Returns an encoded representation of the type argument. */
23128 static tree
23130 {
23131 tree type;
23141 {
23145 }
23147 /* This happens if we find @encode(T) (where T is a template
23148 typename or something dependent on a template typename) when
23149 parsing a template. In that case, we can't compile it
23150 immediately, but we rather create an AT_ENCODE_EXPR which will
23151 need to be instantiated when the template is used.
23152 */
23154 {
23158 }
23161 }
23163 /* Parse an Objective-C @defs expression. */
23165 static tree
23167 {
23168 tree name;
23176 }
23178 /* Parse an Objective-C protocol expression.
23180 objc-protocol-expression:
23181 @protocol ( identifier )
23183 Returns a representation of the protocol expression. */
23185 static tree
23187 {
23188 tree proto;
23196 }
23198 /* Parse an Objective-C selector expression.
23200 objc-selector-expression:
23201 @selector ( objc-method-signature )
23203 objc-method-signature:
23204 objc-selector
23205 objc-selector-seq
23207 objc-selector-seq:
23208 objc-selector :
23209 objc-selector-seq objc-selector :
23211 Returns a representation of the method selector. */
23213 static tree
23215 {
23227 {
23236 {
23237 /* Detect if we have a unary selector. */
23239 {
23242 }
23243 else
23244 {
23246 }
23247 }
23252 {
23253 sel_seq
23256 sel_seq
23259 }
23260 else
23261 sel_seq
23266 }
23268 finish_selector:
23272 }
23274 /* Parse a list of identifiers.
23276 objc-identifier-list:
23277 identifier
23278 objc-identifier-list , identifier
23280 Returns a TREE_LIST of identifier nodes. */
23282 static tree
23284 {
23285 tree identifier;
23286 tree list;
23297 {
23304 identifier));
23306 }
23309 }
23311 /* Parse an Objective-C alias declaration.
23313 objc-alias-declaration:
23314 @compatibility_alias identifier identifier ;
23316 This function registers the alias mapping with the Objective-C front end.
23317 It returns nothing. */
23319 static void
23321 {
23329 }
23331 /* Parse an Objective-C class forward-declaration.
23333 objc-class-declaration:
23334 @class objc-identifier-list ;
23336 The function registers the forward declarations with the Objective-C
23337 front end. It returns nothing. */
23339 static void
23341 {
23344 {
23345 tree id;
23355 else
23357 }
23359 }
23361 /* Parse a list of Objective-C protocol references.
23363 objc-protocol-refs-opt:
23364 objc-protocol-refs [opt]
23366 objc-protocol-refs:
23367 < objc-identifier-list >
23369 Returns a TREE_LIST of identifiers, if any. */
23371 static tree
23373 {
23377 {
23381 }
23384 }
23386 /* Parse a Objective-C visibility specification. */
23388 static void
23390 {
23394 {
23409 }
23411 /* Eat '@private'/'@protected'/'@public'. */
23413 }
23415 /* Parse an Objective-C method type. Return 'true' if it is a class
23416 (+) method, and 'false' if it is an instance (-) method. */
23420 {
23423 else
23425 }
23427 /* Parse an Objective-C protocol qualifier. */
23429 static tree
23431 {
23444 {
23449 }
23452 }
23454 /* Parse an Objective-C typename. */
23456 static tree
23458 {
23462 {
23468 /* An ObjC type name may consist of just protocol qualifiers, in which
23469 case the type shall default to 'id'. */
23471 {
23474 /* If the type could not be parsed, an error has already
23475 been produced. For error recovery, behave as if it had
23476 not been specified, which will use the default type
23477 'id'. */
23479 {
23481 /* We need to skip to the closing parenthesis as
23482 cp_parser_type_id() does not seem to do it for
23483 us. */
23488 }
23489 }
23493 }
23496 }
23498 /* Check to see if TYPE refers to an Objective-C selector name. */
23500 static bool
23502 {
23508 }
23510 /* Parse an Objective-C selector. */
23512 static tree
23514 {
23518 {
23521 }
23523 /* C++ operator names are allowed to appear in ObjC selectors. */
23525 {
23538 }
23539 }
23541 /* Parse an Objective-C params list. */
23543 static tree
23545 {
23551 {
23561 /* Detect if we have a unary selector. */
23564 {
23567 }
23571 {
23572 /* Something went quite wrong. There should be a colon
23573 here, but there is not. Stop parsing parameters. */
23575 }
23577 /* New ObjC allows attributes on parameters too. */
23582 params
23585 type_name,
23586 identifier,
23587 parm_attr));
23590 }
23593 {
23596 }
23598 /* We allow tail attributes for the method. */
23600 {
23608 }
23611 {
23614 }
23616 }
23618 /* Parse the non-keyword Objective-C params. */
23620 static tree
23623 {
23629 {
23631 tree parm;
23637 {
23642 }
23644 /* TODO: parse attributes for tail parameters. */
23653 }
23655 /* We allow tail attributes for the method. */
23657 {
23659 {
23664 }
23665 else
23666 /* We have an error, but parse the attributes, so that we can
23667 carry on. */
23673 }
23676 }
23678 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
23680 static void
23682 {
23685 /* If the next token is `extern' and the following token is a string
23686 literal, then we have a linkage specification. */
23688 && cp_parser_is_pure_string_literal
23691 /* Handle #pragma, if any. */
23694 /* Allow stray semicolons. */
23697 /* Mark methods as optional or required, when building protocols. */
23699 {
23702 }
23704 {
23707 }
23710 /* Other stray characters must generate errors. */
23712 {
23716 }
23717 /* Finally, try to parse a block-declaration, or a function-definition. */
23718 else
23720 }
23722 /* Parse a method signature. */
23724 static tree
23726 {
23742 }
23744 static bool
23746 {
23747 tree tattr;
23752 /* If the attributes are followed by a method introducer, this is not allowed.
23753 Dump the attributes and flag the situation. */
23758 /* Otherwise, the attributes introduce some interstitial code, possibly so
23759 rewind to allow that check. */
23762 }
23764 /* Parse an Objective-C method prototype list. */
23766 static void
23768 {
23772 {
23774 {
23779 else
23783 {
23787 }
23790 }
23796 OPT_Wattributes,
23798 else
23799 /* Allow for interspersed non-ObjC++ code. */
23803 }
23807 else
23811 }
23813 /* Parse an Objective-C method definition list. */
23815 static void
23817 {
23821 {
23822 tree meth;
23825 {
23831 else
23836 {
23840 }
23842 NULL_TREE);
23844 /* For historical reasons, we accept an optional semicolon. */
23851 {
23858 }
23859 }
23860 /* The following case will be removed once @synthesize is
23861 completely implemented. */
23872 else
23873 /* Allow for interspersed non-ObjC++ code. */
23877 }
23881 else
23885 }
23887 /* Parse Objective-C ivars. */
23889 static void
23891 {
23902 {
23903 cp_decl_specifier_seq declspecs;
23905 tree prefix_attributes;
23913 CP_PARSER_FLAGS_OPTIONAL,
23917 /* auto, register, static, extern, mutable. */
23919 {
23922 }
23924 /* __thread. */
23926 {
23929 }
23931 /* typedef. */
23933 {
23936 }
23941 /* Keep going until we hit the `;' at the end of the
23942 declaration. */
23944 {
23949 /* Check for a (possibly unnamed) bitfield declaration. */
23957 {
23958 /* Get the name of the bitfield. */
23961 sfk_none);
23963 eat_colon:
23965 /* Get the width of the bitfield. */
23966 width
23969 NULL);
23970 }
23971 else
23972 {
23973 /* Parse the declarator. */
23974 declarator
23979 }
23981 /* Look for attributes that apply to the ivar. */
23983 /* Remember which attributes are prefix attributes and
23984 which are not. */
23986 /* Combine the attributes. */
23990 /* Create the bitfield declaration. */
23992 width,
23993 attributes);
23994 else
23999 /* Add the instance variable. */
24003 /* Reset PREFIX_ATTRIBUTES. */
24012 {
24015 }
24017 }
24021 }
24026 /* Do not consume the RID_AT_END, so it will be read again as terminating
24027 the @interface of @implementation. */
24031 /* For historical reasons, we accept an optional semicolon. */
24034 }
24036 /* Parse an Objective-C protocol declaration. */
24038 static void
24040 {
24046 {
24051 }
24053 /* See if we have a forward declaration or a definition. */
24056 /* Try a forward declaration first. */
24058 {
24060 {
24061 tree id;
24071 else
24073 }
24075 }
24077 /* Ok, we got a full-fledged definition (or at least should). */
24078 else
24079 {
24084 }
24085 }
24087 /* Parse an Objective-C superclass or category. */
24089 static void
24094 {
24100 {
24103 }
24105 {
24108 /* If there is no category name, and this is an @interface, we
24109 have a class extension. */
24111 {
24114 }
24115 else
24119 }
24120 }
24122 /* Parse an Objective-C class interface. */
24124 static void
24126 {
24133 {
24134 /* It's hard to recover because even if valid @interface stuff
24135 is to follow, we can't compile it (or validate it) if we
24136 don't even know which class it refers to. Let's assume this
24137 was a stray '@interface' token in the stream and skip it.
24138 */
24140 }
24145 /* We have either a class or a category on our hands. */
24148 else
24149 {
24151 /* Handle instance variable declarations, if any. */
24154 }
24157 }
24159 /* Parse an Objective-C class implementation. */
24161 static void
24163 {
24170 {
24171 /* It's hard to recover because even if valid @implementation
24172 stuff is to follow, we can't compile it (or validate it) if
24173 we don't even know which class it refers to. Let's assume
24174 this was a stray '@implementation' token in the stream and
24175 skip it.
24176 */
24178 }
24182 /* We have either a class or a category on our hands. */
24185 else
24186 {
24188 /* Handle instance variable declarations, if any. */
24191 }
24194 }
24196 /* Consume the @end token and finish off the implementation. */
24198 static void
24200 {
24203 }
24205 /* Parse an Objective-C declaration. */
24207 static void
24209 {
24210 /* Try to figure out what kind of declaration is present. */
24215 {
24231 }
24234 {
24257 }
24258 }
24260 /* Parse an Objective-C try-catch-finally statement.
24262 objc-try-catch-finally-stmt:
24263 @try compound-statement objc-catch-clause-seq [opt]
24264 objc-finally-clause [opt]
24266 objc-catch-clause-seq:
24267 objc-catch-clause objc-catch-clause-seq [opt]
24269 objc-catch-clause:
24270 @catch ( objc-exception-declaration ) compound-statement
24272 objc-finally-clause:
24273 @finally compound-statement
24275 objc-exception-declaration:
24276 parameter-declaration
24277 '...'
24279 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
24281 Returns NULL_TREE.
24283 PS: This function is identical to c_parser_objc_try_catch_finally_statement
24284 for C. Keep them in sync. */
24286 static tree
24288 {
24289 location_t location;
24290 tree stmt;
24295 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
24296 node, lest it get absorbed into the surrounding block. */
24302 {
24311 {
24312 /* We have "@catch (...)" (where the '...' are literally
24313 what is in the code). Skip the '...'.
24314 parameter_declaration is set to NULL_TREE, and
24315 objc_being_catch_clauses() knows that that means
24316 '...'. */
24319 }
24320 else
24321 {
24322 /* We have "@catch (NSException *exception)" or something
24323 like that. Parse the parameter declaration. */
24327 else
24332 }
24335 else
24336 {
24337 /* If there was no open parenthesis, we are recovering from
24338 an error, and we are trying to figure out what mistake
24339 the user has made. */
24341 /* If there is an immediate closing parenthesis, the user
24342 probably forgot the opening one (ie, they typed "@catch
24343 NSException *e)". Parse the closing parenthesis and keep
24344 going. */
24348 /* If these is no immediate closing parenthesis, the user
24349 probably doesn't know that parenthesis are required at
24350 all (ie, they typed "@catch NSException *e"). So, just
24351 forget about the closing parenthesis and keep going. */
24352 }
24356 }
24358 {
24361 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
24362 node, lest it get absorbed into the surrounding block. */
24366 }
24369 }
24371 /* Parse an Objective-C synchronized statement.
24373 objc-synchronized-stmt:
24374 @synchronized ( expression ) compound-statement
24376 Returns NULL_TREE. */
24378 static tree
24380 {
24381 location_t location;
24392 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
24393 node, lest it get absorbed into the surrounding block. */
24398 }
24400 /* Parse an Objective-C throw statement.
24402 objc-throw-stmt:
24403 @throw assignment-expression [opt] ;
24405 Returns a constructed '@throw' statement. */
24407 static tree
24409 {
24421 }
24423 /* Parse an Objective-C statement. */
24425 static tree
24427 {
24428 /* Try to figure out what kind of declaration is present. */
24432 {
24443 }
24446 }
24448 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
24449 look ahead to see if an objc keyword follows the attributes. This
24450 is to detect the use of prefix attributes on ObjC @interface and
24451 @protocol. */
24453 static bool
24455 {
24460 {
24463 }
24466 }
24468 /* This routine is a minimal replacement for
24469 c_parser_struct_declaration () used when parsing the list of
24470 types/names or ObjC++ properties. For example, when parsing the
24471 code
24473 @property (readonly) int a, b, c;
24475 this function is responsible for parsing "int a, int b, int c" and
24476 returning the declarations as CHAIN of DECLs.
24478 TODO: Share this code with cp_parser_objc_class_ivars. It's very
24479 similar parsing. */
24480 static tree
24482 {
24484 cp_decl_specifier_seq declspecs;
24486 tree prefix_attributes;
24489 CP_PARSER_FLAGS_NONE,
24496 /* auto, register, static, extern, mutable. */
24498 {
24501 }
24503 /* __thread. */
24505 {
24508 }
24510 /* typedef. */
24512 {
24515 }
24520 /* Keep going until we hit the `;' at the end of the declaration. */
24522 {
24527 /* Parse the declarator. */
24531 /* Look for attributes that apply to the ivar. */
24533 /* Remember which attributes are prefix attributes and
24534 which are not. */
24536 /* Combine the attributes. */
24546 /* Reset PREFIX_ATTRIBUTES. */
24557 {
24560 }
24561 else
24563 }
24565 }
24567 /* Parse an Objective-C @property declaration. The syntax is:
24569 objc-property-declaration:
24570 '@property' objc-property-attributes[opt] struct-declaration ;
24572 objc-property-attributes:
24573 '(' objc-property-attribute-list ')'
24575 objc-property-attribute-list:
24576 objc-property-attribute
24577 objc-property-attribute-list, objc-property-attribute
24579 objc-property-attribute
24580 'getter' = identifier
24581 'setter' = identifier
24582 'readonly'
24583 'readwrite'
24584 'assign'
24585 'retain'
24586 'copy'
24587 'nonatomic'
24589 For example:
24590 @property NSString *name;
24591 @property (readonly) id object;
24592 @property (retain, nonatomic, getter=getTheName) id name;
24593 @property int a, b, c;
24595 PS: This function is identical to
24596 c_parser_objc_at_property_declaration for C. Keep them in sync. */
24597 static void
24599 {
24600 /* The following variables hold the attributes of the properties as
24601 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
24602 seen. When we see an attribute, we set them to 'true' (if they
24603 are boolean properties) or to the identifier (if they have an
24604 argument, ie, for getter and setter). Note that here we only
24605 parse the list of attributes, check the syntax and accumulate the
24606 attributes that we find. objc_add_property_declaration() will
24607 then process the information. */
24617 /* 'properties' is the list of properties that we read. Usually a
24618 single one, but maybe more (eg, in "@property int a, b, c;" there
24619 are three). */
24620 tree properties;
24621 location_t loc;
24627 /* Parse the optional attribute list... */
24629 {
24630 /* Eat the '('. */
24634 {
24640 {
24643 }
24647 {
24658 {
24662 else
24667 }
24670 {
24674 }
24676 {
24678 {
24681 }
24682 else
24686 else
24688 }
24689 else
24690 {
24692 {
24695 }
24696 else
24698 }
24704 }
24711 else
24713 }
24715 /* FIXME: "@property (setter, assign);" will generate a spurious
24716 "error: expected ‘)’ before ‘,’ token". This is because
24717 cp_parser_require, unlike the C counterpart, will produce an
24718 error even if we are in error recovery. */
24720 {
24725 }
24726 }
24728 /* ... and the property declaration(s). */
24732 {
24734 /* If the next token is now a `;', consume it. */
24738 }
24742 else
24743 {
24744 /* Comma-separated properties are chained together in
24745 reverse order; add them one by one. */
24754 }
24757 }
24759 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
24761 objc-synthesize-declaration:
24762 @synthesize objc-synthesize-identifier-list ;
24764 objc-synthesize-identifier-list:
24765 objc-synthesize-identifier
24766 objc-synthesize-identifier-list, objc-synthesize-identifier
24768 objc-synthesize-identifier
24769 identifier
24770 identifier = identifier
24772 For example:
24773 @synthesize MyProperty;
24774 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
24776 PS: This function is identical to c_parser_objc_at_synthesize_declaration
24777 for C. Keep them in sync.
24778 */
24779 static void
24781 {
24783 location_t loc;
24788 {
24792 {
24795 }
24797 {
24801 {
24804 }
24805 }
24806 else
24811 else
24813 }
24816 }
24818 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
24820 objc-dynamic-declaration:
24821 @dynamic identifier-list ;
24823 For example:
24824 @dynamic MyProperty;
24825 @dynamic MyProperty, AnotherProperty;
24827 PS: This function is identical to c_parser_objc_at_dynamic_declaration
24828 for C. Keep them in sync.
24829 */
24830 static void
24832 {
24834 location_t loc;
24839 {
24840 tree property;
24843 {
24846 }
24850 else
24852 }
24855 }
24857 \f
24858 /* OpenMP 2.5 parsing routines. */
24860 /* Returns name of the next clause.
24861 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
24862 the token is not consumed. Otherwise appropriate pragma_omp_clause is
24863 returned and the token is consumed. */
24865 static pragma_omp_clause
24867 {
24877 {
24882 {
24929 }
24930 }
24936 }
24938 /* Validate that a clause of the given type does not already exist. */
24940 static void
24943 {
24944 tree c;
24948 {
24951 }
24952 }
24954 /* OpenMP 2.5:
24955 variable-list:
24956 identifier
24957 variable-list , identifier
24959 In addition, we match a closing parenthesis. An opening parenthesis
24960 will have been consumed by the caller.
24962 If KIND is nonzero, create the appropriate node and install the decl
24963 in OMP_CLAUSE_DECL and add the node to the head of the list.
24965 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
24966 return the list created. */
24968 static tree
24970 tree list)
24971 {
24974 {
24991 {
24996 }
24997 else
25000 get_comma:
25004 }
25007 {
25010 /* Try to resync to an unnested comma. Copied from
25011 cp_parser_parenthesized_expression_list. */
25012 skip_comma:
25019 }
25022 }
25024 /* Similarly, but expect leading and trailing parenthesis. This is a very
25025 common case for omp clauses. */
25027 static tree
25029 {
25033 }
25035 /* OpenMP 3.0:
25036 collapse ( constant-expression ) */
25038 static tree
25040 {
25042 location_t loc;
25043 HOST_WIDE_INT n;
25063 {
25066 }
25074 }
25076 /* OpenMP 2.5:
25077 default ( shared | none ) */
25079 static tree
25081 {
25083 tree c;
25088 {
25093 {
25108 }
25111 }
25112 else
25113 {
25114 invalid_kind:
25116 }
25132 }
25134 /* OpenMP 3.1:
25135 final ( expression ) */
25137 static tree
25139 {
25160 }
25162 /* OpenMP 2.5:
25163 if ( expression ) */
25165 static tree
25167 {
25188 }
25190 /* OpenMP 3.1:
25191 mergeable */
25193 static tree
25196 {
25197 tree c;
25200 location);
25205 }
25207 /* OpenMP 2.5:
25208 nowait */
25210 static tree
25213 {
25214 tree c;
25221 }
25223 /* OpenMP 2.5:
25224 num_threads ( expression ) */
25226 static tree
25228 location_t location)
25229 {
25251 }
25253 /* OpenMP 2.5:
25254 ordered */
25256 static tree
25259 {
25260 tree c;
25268 }
25270 /* OpenMP 2.5:
25271 reduction ( reduction-operator : variable-list )
25273 reduction-operator:
25274 One of: + * - & ^ | && ||
25276 OpenMP 3.1:
25278 reduction-operator:
25279 One of: + * - & ^ | && || min max */
25281 static tree
25283 {
25291 {
25317 {
25322 {
25325 }
25327 {
25330 }
25331 }
25332 /* FALLTHROUGH */
25336 resync_fail:
25341 }
25352 }
25354 /* OpenMP 2.5:
25355 schedule ( schedule-kind )
25356 schedule ( schedule-kind , expression )
25358 schedule-kind:
25359 static | dynamic | guided | runtime | auto */
25361 static tree
25363 {
25372 {
25377 {
25398 }
25399 }
25404 else
25409 {
25424 else
25429 }
25437 invalid_kind:
25439 resync_fail:
25444 }
25446 /* OpenMP 3.0:
25447 untied */
25449 static tree
25452 {
25453 tree c;
25460 }
25462 /* Parse all OpenMP clauses. The set clauses allowed by the directive
25463 is a bitmask in MASK. Return the list of clauses found; the result
25464 of clause default goes in *pdefault. */
25466 static tree
25469 {
25475 {
25476 pragma_omp_clause c_kind;
25488 {
25500 clauses);
25514 clauses);
25523 clauses);
25547 clauses);
25561 clauses);
25572 }
25575 {
25576 /* Remove the invalid clause(s) from the list to avoid
25577 confusing the rest of the compiler. */
25580 }
25581 }
25582 saw_error:
25585 }
25587 /* OpenMP 2.5:
25588 structured-block:
25589 statement
25591 In practice, we're also interested in adding the statement to an
25592 outer node. So it is convenient if we work around the fact that
25593 cp_parser_statement calls add_stmt. */
25595 static unsigned
25597 {
25600 /* Only move the values to IN_OMP_BLOCK if they weren't false.
25601 This preserves the "not within loop or switch" style error messages
25602 for nonsense cases like
25603 void foo() {
25604 #pragma omp single
25605 break;
25606 }
25607 */
25612 }
25614 static void
25616 {
25618 }
25620 static tree
25622 {
25630 }
25632 /* OpenMP 2.5:
25633 # pragma omp atomic new-line
25634 expression-stmt
25636 expression-stmt:
25637 x binop= expr | x++ | ++x | x-- | --x
25638 binop:
25639 +, *, -, /, &, ^, |, <<, >>
25641 where x is an lvalue expression with scalar type.
25643 OpenMP 3.1:
25644 # pragma omp atomic new-line
25645 update-stmt
25647 # pragma omp atomic read new-line
25648 read-stmt
25650 # pragma omp atomic write new-line
25651 write-stmt
25653 # pragma omp atomic update new-line
25654 update-stmt
25656 # pragma omp atomic capture new-line
25657 capture-stmt
25659 # pragma omp atomic capture new-line
25660 capture-block
25662 read-stmt:
25663 v = x
25664 write-stmt:
25665 x = expr
25666 update-stmt:
25667 expression-stmt | x = x binop expr
25668 capture-stmt:
25669 v = x binop= expr | v = x++ | v = ++x | v = x-- | v = --x
25670 capture-block:
25671 { v = x; update-stmt; } | { update-stmt; v = x; }
25673 where x and v are lvalue expressions with scalar type. */
25675 static void
25677 {
25684 {
25696 else
25700 }
25704 {
25715 else
25721 {
25722 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
25723 opcode. */
25728 }
25732 {
25735 }
25736 else
25737 {
25744 }
25747 }
25749 restart:
25754 {
25761 /* FALLTHROUGH */
25771 /* FALLTHROUGH */
25786 /* Undo effects of boolean_increment for post {in,de}crement. */
25788 /* FALLTHRU */
25792 {
25793 /* Undo effects of boolean_increment. */
25795 {
25796 /* This is pre or post increment. */
25801 && !structured_block
25805 }
25806 }
25807 /* FALLTHRU */
25810 {
25840 {
25850 {
25853 {
25861 }
25896 }
25907 }
25908 /* FALLTHROUGH */
25913 }
25920 }
25921 stmt_done:
25923 {
25936 }
25938 {
25941 }
25942 done:
25948 saw_error:
25951 {
25955 {
25959 }
25960 }
25961 }
25964 /* OpenMP 2.5:
25965 # pragma omp barrier new-line */
25967 static void
25969 {
25972 }
25974 /* OpenMP 2.5:
25975 # pragma omp critical [(name)] new-line
25976 structured-block */
25978 static tree
25980 {
25984 {
25996 }
26001 }
26003 /* OpenMP 2.5:
26004 # pragma omp flush flush-vars[opt] new-line
26006 flush-vars:
26007 ( variable-list ) */
26009 static void
26011 {
26017 }
26019 /* Helper function, to parse omp for increment expression. */
26021 static tree
26023 {
26028 {
26031 }
26034 {
26042 }
26044 /* If decl is an iterator, preserve LHS and RHS of the relational
26045 expr until finish_omp_for. */
26055 }
26057 /* Helper function, to parse omp for increment expression. */
26059 static tree
26061 {
26065 cp_id_kind idk;
26069 {
26077 }
26085 {
26090 }
26097 {
26101 }
26113 do
26114 {
26121 {
26123 {
26126 else
26128 }
26129 else
26132 }
26133 }
26137 {
26141 }
26142 else
26146 }
26148 /* Parse the restricted form of the for statement allowed by OpenMP. */
26150 static tree
26152 {
26156 location_t loc_first;
26175 {
26178 location_t loc;
26181 {
26184 }
26193 {
26194 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
26196 init-expr:
26197 var = lb
26198 integer-type var = lb
26199 random-access-iterator-type var = lb
26200 pointer-type var = lb
26201 */
26202 cp_decl_specifier_seq type_specifiers;
26204 /* First, try to parse as an initialized declaration. See
26205 cp_parser_condition, from whence the bulk of this is copied. */
26212 {
26213 /* If parsing a type specifier seq succeeded, then this
26214 MUST be a initialized declaration. */
26219 CP_PARSER_DECLARATOR_NAMED,
26229 else
26230 {
26240 {
26242 CPP_OPEN_PAREN))
26245 else
26246 /* Trigger an error. */
26251 }
26255 {
26263 {
26266 auto_node);
26271 }
26274 asm_specification,
26275 LOOKUP_ONLYCONVERTING);
26277 {
26280 }
26281 else
26284 }
26285 else
26286 {
26287 /* Consume '='. */
26291 non_class:
26294 else
26297 asm_specification,
26298 LOOKUP_ONLYCONVERTING);
26299 }
26303 }
26304 }
26305 else
26306 {
26307 cp_id_kind idk;
26308 /* If parsing a type specifier sequence failed, then
26309 this MUST be a simple expression. */
26314 && decl
26317 {
26318 tree rhs;
26324 rhs,
26325 tf_warning_or_error));
26327 }
26328 else
26329 {
26334 {
26338 }
26339 }
26340 }
26341 }
26344 {
26347 {
26353 }
26354 else
26356 }
26361 {
26366 {
26370 }
26373 {
26374 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
26375 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
26384 }
26385 else
26386 {
26391 }
26392 }
26395 {
26396 tree c;
26398 {
26407 decl);
26411 decl);
26412 }
26414 {
26419 {
26422 }
26423 }
26424 }
26433 {
26434 /* If decl is an iterator, preserve the operator on decl
26435 until finish_omp_for. */
26437 && ((processing_template_decl
26441 else
26443 }
26458 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
26459 in between the collapsed for loops to be still considered perfectly
26460 nested. Hopefully the final version clarifies this.
26461 For now handle (multiple) {'s and empty statements. */
26463 do
26464 {
26468 {
26470 bracecount++;
26471 }
26475 else
26476 {
26483 }
26484 }
26488 {
26491 }
26492 }
26494 /* Note that we saved the original contents of this flag when we entered
26495 the structured block, and so we don't need to re-save it here. */
26498 /* Note that the grammar doesn't call for a structured block here,
26499 though the loop as a whole is a structured block. */
26506 else
26511 {
26513 {
26515 nbraces--;
26516 }
26519 else
26520 {
26522 {
26525 }
26530 }
26531 }
26538 }
26540 /* OpenMP 2.5:
26541 #pragma omp for for-clause[optseq] new-line
26542 for-loop */
26544 #define OMP_FOR_CLAUSE_MASK \
26545 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26546 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26547 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
26548 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26549 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
26550 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
26551 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT) \
26552 | (1u << PRAGMA_OMP_CLAUSE_COLLAPSE))
26554 static tree
26556 {
26572 }
26574 /* OpenMP 2.5:
26575 # pragma omp master new-line
26576 structured-block */
26578 static tree
26580 {
26584 }
26586 /* OpenMP 2.5:
26587 # pragma omp ordered new-line
26588 structured-block */
26590 static tree
26592 {
26596 }
26598 /* OpenMP 2.5:
26600 section-scope:
26601 { section-sequence }
26603 section-sequence:
26604 section-directive[opt] structured-block
26605 section-sequence section-directive structured-block */
26607 static tree
26609 {
26620 {
26627 {
26637 }
26643 }
26646 {
26654 {
26658 }
26660 {
26663 }
26668 }
26679 }
26681 /* OpenMP 2.5:
26682 # pragma omp sections sections-clause[optseq] newline
26683 sections-scope */
26685 #define OMP_SECTIONS_CLAUSE_MASK \
26686 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26687 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26688 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
26689 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26690 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
26692 static tree
26694 {
26705 }
26707 /* OpenMP 2.5:
26708 # pragma parallel parallel-clause new-line
26709 # pragma parallel for parallel-for-clause new-line
26710 # pragma parallel sections parallel-sections-clause new-line */
26712 #define OMP_PARALLEL_CLAUSE_MASK \
26713 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
26714 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26715 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26716 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
26717 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
26718 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
26719 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26720 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
26722 static tree
26724 {
26733 {
26739 }
26741 {
26745 {
26751 }
26752 }
26759 {
26779 }
26786 }
26788 /* OpenMP 2.5:
26789 # pragma omp single single-clause[optseq] new-line
26790 structured-block */
26792 #define OMP_SINGLE_CLAUSE_MASK \
26793 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26794 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26795 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
26796 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
26798 static tree
26800 {
26810 }
26812 /* OpenMP 3.0:
26813 # pragma omp task task-clause[optseq] new-line
26814 structured-block */
26816 #define OMP_TASK_CLAUSE_MASK \
26817 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
26818 | (1u << PRAGMA_OMP_CLAUSE_UNTIED) \
26819 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
26820 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26821 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26822 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
26823 | (1u << PRAGMA_OMP_CLAUSE_FINAL) \
26824 | (1u << PRAGMA_OMP_CLAUSE_MERGEABLE))
26826 static tree
26828 {
26839 }
26841 /* OpenMP 3.0:
26842 # pragma omp taskwait new-line */
26844 static void
26846 {
26849 }
26851 /* OpenMP 3.1:
26852 # pragma omp taskyield new-line */
26854 static void
26856 {
26859 }
26861 /* OpenMP 2.5:
26862 # pragma omp threadprivate (variable-list) */
26864 static void
26866 {
26867 tree vars;
26873 }
26875 /* Main entry point to OpenMP statement pragmas. */
26877 static void
26879 {
26880 tree stmt;
26883 {
26913 }
26917 }
26918 \f
26919 /* Transactional Memory parsing routines. */
26921 /* Parse a transaction attribute.
26923 txn-attribute:
26924 attribute
26925 [ [ identifier ] ]
26927 ??? Simplify this when C++0x bracket attributes are
26928 implemented properly. */
26930 static tree
26932 {
26947 {
26951 /* For keywords, use the canonical spelling,
26952 not the parsed identifier. */
26956 }
26957 else
26961 error1:
26964 }
26966 /* Parse a __transaction_atomic or __transaction_relaxed statement.
26968 transaction-statement:
26969 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
26970 compound-statement
26971 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
26972 */
26974 static tree
26976 {
26991 else
26992 {
26996 }
26998 /* Parse a noexcept specification. */
27001 /* Keep track if we're in the lexical scope of an outer transaction. */
27013 }
27015 /* Parse a __transaction_atomic or __transaction_relaxed expression.
27017 transaction-expression:
27018 __transaction_atomic txn-noexcept-spec[opt] ( expression )
27019 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
27020 */
27022 static tree
27024 {
27049 /* Set this early. This might mean that we allow transaction_cancel in
27050 an expression that we find out later actually has to be a constexpr.
27051 However, we expect that cxx_constant_value will be able to deal with
27052 this; also, if the noexcept has no constexpr, then what we parse next
27053 really is a transaction's body. */
27056 /* Parse a noexcept specification. */
27062 {
27069 }
27070 else
27071 {
27072 /* The only expression that is available got parsed for the noexcept
27073 already. noexcept is true then. */
27076 }
27085 }
27087 /* Parse a function-transaction-block.
27089 function-transaction-block:
27090 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
27091 function-body
27092 __transaction_atomic txn-attribute[opt] function-try-block
27093 __transaction_relaxed ctor-initializer[opt] function-body
27094 __transaction_relaxed function-try-block
27095 */
27097 static bool
27099 {
27115 else
27116 {
27120 }
27128 else
27129 ctor_initializer_p
27137 }
27139 /* Parse a __transaction_cancel statement.
27141 cancel-statement:
27142 __transaction_cancel txn-attribute[opt] ;
27143 __transaction_cancel txn-attribute[opt] throw-expression ;
27145 ??? Cancel and throw is not yet implemented. */
27147 static tree
27149 {
27155 RT_TRANSACTION_CANCEL);
27162 /* ??? Parse cancel-and-throw here. */
27167 {
27171 }
27173 {
27177 }
27179 {
27182 {
27188 }
27189 }
27191 {
27195 }
27202 }
27203 \f
27204 /* The parser. */
27208 \f
27209 /* Special handling for the first token or line in the file. The first
27210 thing in the file might be #pragma GCC pch_preprocess, which loads a
27211 PCH file, which is a GC collection point. So we need to handle this
27212 first pragma without benefit of an existing lexer structure.
27214 Always returns one token to the caller in *FIRST_TOKEN. This is
27215 either the true first token of the file, or the first token after
27216 the initial pragma. */
27218 static void
27220 {
27229 {
27236 }
27237 else
27240 /* Skip to the end of the pragma. */
27244 /* Now actually load the PCH file. */
27248 /* Read one more token to return to our caller. We have to do this
27249 after reading the PCH file in, since its pointers have to be
27250 live. */
27252 }
27254 /* Normal parsing of a pragma token. Here we can (and must) use the
27255 regular lexer. */
27257 static bool
27259 {
27269 {
27277 {
27287 }
27292 {
27302 }
27307 {
27313 "%<#pragma omp taskwait%> may only be "
27318 }
27323 {
27329 "%<#pragma omp taskyield%> may only be "
27334 }
27357 "%<#pragma omp section%> may only be used in "
27366 bad_stmt:
27369 }
27373 }
27375 /* The interface the pragma parsers have to the lexer. */
27377 enum cpp_ttype
27379 {
27392 else
27393 {
27397 }
27400 }
27402 \f
27403 /* External interface. */
27405 /* Parse one entire translation unit. */
27407 void
27409 {
27413 {
27416 }
27424 }