| blob | 0c423536dd7447c200ed701aaf2496d0e018b806 |
1 /* C++ Parser.
2 Copyright (C) 2000, 2001, 2002, 2003, 2004,
3 2005, 2007, 2008, 2009, 2010, 2011, 2012 Free Software Foundation, Inc.
4 Written by Mark Mitchell <mark@codesourcery.com>.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it
9 under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
11 any later version.
13 GCC is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
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 /* May be this should be sufficient_parms_p instead,
3587 depending on how exactly should user-defined literals
3588 work in presence of default arguments on the literal
3589 operator parameters. */
3592 }
3593 }
3596 }
3598 /* Parse a user-defined char constant. Returns a call to a user-defined
3599 literal operator taking the character as an argument. */
3601 static tree
3603 {
3611 /* Build up a call to the user-defined operator */
3612 /* Lookup the name we got back from the id-expression. */
3617 {
3622 }
3631 }
3633 /* A subroutine of cp_parser_userdef_numeric_literal to
3634 create a char... template parameter pack from a string node. */
3636 static tree
3638 {
3639 tree charvec;
3645 /* Fill in CHARVEC with all of the parameters. */
3650 /* Build the argument packs. */
3657 }
3659 /* Parse a user-defined numeric constant. returns a call to a user-defined
3660 literal operator. */
3662 static tree
3664 {
3674 /* Look for a literal operator taking the exact type of numeric argument
3675 as the literal value. */
3680 {
3683 {
3686 }
3687 }
3690 /* If the numeric argument didn't work, look for a raw literal
3691 operator taking a const char* argument consisting of the number
3692 in string format. */
3697 {
3700 {
3703 }
3704 }
3707 /* If the raw literal didn't work, look for a non-type template
3708 function with parameter pack char.... Call the function with
3709 template parameter characters representing the number. */
3713 {
3718 {
3721 }
3722 }
3727 }
3729 /* Parse a user-defined string constant. Returns a call to a user-defined
3730 literal operator taking a character pointer and the length of the string
3731 as arguments. */
3733 static tree
3735 {
3744 /* Build up a call to the user-defined operator */
3745 /* Lookup the name we got back from the id-expression. */
3751 {
3755 }
3764 }
3767 /* Basic concepts [gram.basic] */
3769 /* Parse a translation-unit.
3771 translation-unit:
3772 declaration-seq [opt]
3774 Returns TRUE if all went well. */
3776 static bool
3778 {
3779 /* The address of the first non-permanent object on the declarator
3780 obstack. */
3785 /* Create the declarator obstack, if necessary. */
3787 {
3789 /* Create the error declarator. */
3791 /* Create the empty parameter list. */
3793 /* Remember where the base of the declarator obstack lies. */
3795 }
3799 /* If there are no tokens left then all went well. */
3801 {
3802 /* Get rid of the token array; we don't need it any more. */
3806 /* This file might have been a context that's implicitly extern
3807 "C". If so, pop the lang context. (Only relevant for PCH.) */
3809 {
3812 }
3814 /* Finish up. */
3818 }
3819 else
3820 {
3823 }
3825 /* Make sure the declarator obstack was fully cleaned up. */
3829 /* All went well. */
3831 }
3833 /* Expressions [gram.expr] */
3835 /* Parse a primary-expression.
3837 primary-expression:
3838 literal
3839 this
3840 ( expression )
3841 id-expression
3843 GNU Extensions:
3845 primary-expression:
3846 ( compound-statement )
3847 __builtin_va_arg ( assignment-expression , type-id )
3848 __builtin_offsetof ( type-id , offsetof-expression )
3850 C++ Extensions:
3851 __has_nothrow_assign ( type-id )
3852 __has_nothrow_constructor ( type-id )
3853 __has_nothrow_copy ( type-id )
3854 __has_trivial_assign ( type-id )
3855 __has_trivial_constructor ( type-id )
3856 __has_trivial_copy ( type-id )
3857 __has_trivial_destructor ( type-id )
3858 __has_virtual_destructor ( type-id )
3859 __is_abstract ( type-id )
3860 __is_base_of ( type-id , type-id )
3861 __is_class ( type-id )
3862 __is_convertible_to ( type-id , type-id )
3863 __is_empty ( type-id )
3864 __is_enum ( type-id )
3865 __is_final ( type-id )
3866 __is_literal_type ( type-id )
3867 __is_pod ( type-id )
3868 __is_polymorphic ( type-id )
3869 __is_std_layout ( type-id )
3870 __is_trivial ( type-id )
3871 __is_union ( type-id )
3873 Objective-C++ Extension:
3875 primary-expression:
3876 objc-expression
3878 literal:
3879 __null
3881 ADDRESS_P is true iff this expression was immediately preceded by
3882 "&" and therefore might denote a pointer-to-member. CAST_P is true
3883 iff this expression is the target of a cast. TEMPLATE_ARG_P is
3884 true iff this expression is a template argument.
3886 Returns a representation of the expression. Upon return, *IDK
3887 indicates what kind of id-expression (if any) was present. */
3889 static tree
3895 {
3898 /* Assume the primary expression is not an id-expression. */
3901 /* Peek at the next token. */
3904 {
3905 /* literal:
3906 integer-literal
3907 character-literal
3908 floating-literal
3909 string-literal
3910 boolean-literal
3911 pointer-literal
3912 user-defined-literal */
3922 {
3926 }
3927 /* Floating-point literals are only allowed in an integral
3928 constant expression if they are cast to an integral or
3929 enumeration type. */
3933 {
3934 /* CAST_P will be set even in invalid code like "int(2.7 +
3935 ...)". Therefore, we have to check that the next token
3936 is sure to end the cast. */
3938 {
3943 enumerator-definition. */
3945 /* The curly brace at the end of an enum-specifier. */
3947 /* The end of a statement. */
3949 /* The end of the cast-expression. */
3951 /* The end of an array bound. */
3953 /* The closing ">" in a template-argument-list. */
3956 /* C++0x only: A ">>" treated like two ">" tokens,
3957 in a template-argument-list. */
3962 }
3964 /* If we are within a cast, then the constraint that the
3965 cast is to an integral or enumeration type will be
3966 checked at that point. If we are not within a cast, then
3967 this code is invalid. */
3970 }
3989 /* ??? Should wide strings be allowed when parser->translate_strings_p
3990 is false (i.e. in attributes)? If not, we can kill the third
3991 argument to cp_parser_string_literal. */
3997 {
3998 tree expr;
4001 /* Consume the `('. */
4003 /* Within a parenthesized expression, a `>' token is always
4004 the greater-than operator. */
4005 saved_greater_than_is_operator_p
4008 /* If we see `( { ' then we are looking at the beginning of
4009 a GNU statement-expression. */
4012 {
4013 /* Statement-expressions are not allowed by the standard. */
4017 /* And they're not allowed outside of a function-body; you
4018 cannot, for example, write:
4020 int i = ({ int j = 3; j + 1; });
4022 at class or namespace scope. */
4025 {
4027 "statement-expressions are not allowed outside "
4031 }
4032 else
4033 {
4034 /* Start the statement-expression. */
4036 /* Parse the compound-statement. */
4038 /* Finish up. */
4040 }
4041 }
4042 else
4043 {
4044 /* Parse the parenthesized expression. */
4046 /* Let the front end know that this expression was
4047 enclosed in parentheses. This matters in case, for
4048 example, the expression is of the form `A::B', since
4049 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4050 not. */
4052 /* DR 705: Wrapping an unqualified name in parentheses
4053 suppresses arg-dependent lookup. We want to pass back
4054 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4055 (c++/37862), but none of the others. */
4058 }
4059 /* The `>' token might be the end of a template-id or
4060 template-parameter-list now. */
4061 parser->greater_than_is_operator_p
4063 /* Consume the `)'. */
4068 }
4072 /* We have an Objective-C++ message. */
4074 {
4076 /* Don't warn about a failed tentative parse. */
4081 }
4085 /* We have an Objective-C++ string literal. */
4092 {
4093 /* These two are the boolean literals. */
4101 /* The `__null' literal. */
4106 /* The `nullptr' literal. */
4111 /* Recognize the `this' keyword. */
4115 {
4119 }
4120 /* Pointers cannot appear in constant-expressions. */
4125 /* The `operator' keyword can be the beginning of an
4126 id-expression. */
4133 {
4134 non_integral_constant name;
4136 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4137 __func__ are the names of variables -- but they are
4138 treated specially. Therefore, they are handled here,
4139 rather than relying on the generic id-expression logic
4140 below. Grammatically, these names are id-expressions.
4142 Consume the token. */
4146 {
4158 }
4163 /* Look up the name. */
4165 }
4168 {
4169 tree expression;
4170 tree type;
4171 source_location type_location;
4173 /* The `__builtin_va_arg' construct is used to handle
4174 `va_arg'. Consume the `__builtin_va_arg' token. */
4176 /* Look for the opening `('. */
4178 /* Now, parse the assignment-expression. */
4181 /* Look for the `,'. */
4184 /* Parse the type-id. */
4186 /* Look for the closing `)'. */
4188 /* Using `va_arg' in a constant-expression is not
4189 allowed. */
4191 NIC_VA_ARG))
4194 }
4222 /* Objective-C++ expressions. */
4232 {
4237 }
4241 }
4243 /* An id-expression can start with either an identifier, a
4244 `::' as the beginning of a qualified-id, or the "operator"
4245 keyword. */
4250 {
4251 tree id_expression;
4252 tree decl;
4258 id_expression:
4259 /* Parse the id-expression. */
4260 id_expression
4277 /* If we have a template-id, then no further lookup is
4278 required. If the template-id was for a template-class, we
4279 will sometimes have a TYPE_DECL at this point. */
4283 /* Look up the name. */
4284 else
4285 {
4286 tree ambiguous_decls;
4288 /* If we already know that this lookup is ambiguous, then
4289 we've already issued an error message; there's no reason
4290 to check again. */
4293 {
4296 }
4299 none_type,
4300 template_p,
4305 /* If the lookup was ambiguous, an error will already have
4306 been issued. */
4310 /* In Objective-C++, we may have an Objective-C 2.0
4311 dot-syntax for classes here. */
4316 {
4317 tree component;
4324 }
4326 /* In Objective-C++, an instance variable (ivar) may be preferred
4327 to whatever cp_parser_lookup_name() found. */
4330 /* If name lookup gives us a SCOPE_REF, then the
4331 qualifying scope was dependent. */
4333 {
4334 /* At this point, we do not know if DECL is a valid
4335 integral constant expression. We assume that it is
4336 in fact such an expression, so that code like:
4338 template <int N> struct A {
4339 int a[B<N>::i];
4340 };
4342 is accepted. At template-instantiation time, we
4343 will check that B<N>::i is actually a constant. */
4345 }
4346 /* Check to see if DECL is a local variable in a context
4347 where that is forbidden. */
4350 {
4351 /* It might be that we only found DECL because we are
4352 trying to be generous with pre-ISO scoping rules.
4353 For example, consider:
4355 int i;
4356 void g() {
4357 for (int i = 0; i < 10; ++i) {}
4358 extern void f(int j = i);
4359 }
4361 Here, name look up will originally find the out
4362 of scope `i'. We need to issue a warning message,
4363 but then use the global `i'. */
4366 {
4369 decl);
4371 }
4372 }
4373 }
4375 decl = (finish_id_expression
4377 idk,
4382 template_arg_p,
4388 }
4390 /* Anything else is an error. */
4394 }
4395 }
4397 /* Parse an id-expression.
4399 id-expression:
4400 unqualified-id
4401 qualified-id
4403 qualified-id:
4404 :: [opt] nested-name-specifier template [opt] unqualified-id
4405 :: identifier
4406 :: operator-function-id
4407 :: template-id
4409 Return a representation of the unqualified portion of the
4410 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4411 a `::' or nested-name-specifier.
4413 Often, if the id-expression was a qualified-id, the caller will
4414 want to make a SCOPE_REF to represent the qualified-id. This
4415 function does not do this in order to avoid wastefully creating
4416 SCOPE_REFs when they are not required.
4418 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4419 `template' keyword.
4421 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4422 uninstantiated templates.
4424 If *TEMPLATE_P is non-NULL, it is set to true iff the
4425 `template' keyword is used to explicitly indicate that the entity
4426 named is a template.
4428 If DECLARATOR_P is true, the id-expression is appearing as part of
4429 a declarator, rather than as part of an expression. */
4431 static tree
4438 {
4442 /* Assume the `template' keyword was not used. */
4446 /* Look for the optional `::' operator. */
4447 global_scope_p
4450 /* Look for the optional nested-name-specifier. */
4451 nested_name_specifier_p
4454 check_dependency_p,
4456 declarator_p)
4458 /* If there is a nested-name-specifier, then we are looking at
4459 the first qualified-id production. */
4461 {
4462 tree saved_scope;
4463 tree saved_object_scope;
4464 tree saved_qualifying_scope;
4465 tree unqualified_id;
4468 /* See if the next token is the `template' keyword. */
4472 /* Name lookup we do during the processing of the
4473 unqualified-id might obliterate SCOPE. */
4477 /* Process the final unqualified-id. */
4479 check_dependency_p,
4480 declarator_p,
4482 /* Restore the SAVED_SCOPE for our caller. */
4488 }
4489 /* Otherwise, if we are in global scope, then we are looking at one
4490 of the other qualified-id productions. */
4492 {
4494 tree id;
4496 /* Peek at the next token. */
4499 /* If it's an identifier, and the next token is not a "<", then
4500 we can avoid the template-id case. This is an optimization
4501 for this common case. */
4503 && !cp_parser_nth_token_starts_template_argument_list_p
4508 /* Try a template-id. */
4512 declarator_p);
4513 /* If that worked, we're done. */
4517 /* Peek at the next token. (Changes in the token buffer may
4518 have invalidated the pointer obtained above.) */
4522 {
4529 /* Fall through. */
4534 }
4535 }
4536 else
4539 declarator_p,
4540 optional_p);
4541 }
4543 /* Parse an unqualified-id.
4545 unqualified-id:
4546 identifier
4547 operator-function-id
4548 conversion-function-id
4549 ~ class-name
4550 template-id
4552 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4553 keyword, in a construct like `A::template ...'.
4555 Returns a representation of unqualified-id. For the `identifier'
4556 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4557 production a BIT_NOT_EXPR is returned; the operand of the
4558 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4559 other productions, see the documentation accompanying the
4560 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4561 names are looked up in uninstantiated templates. If DECLARATOR_P
4562 is true, the unqualified-id is appearing as part of a declarator,
4563 rather than as part of an expression. */
4565 static tree
4571 {
4574 /* Peek at the next token. */
4578 {
4580 {
4581 tree id;
4583 /* We don't know yet whether or not this will be a
4584 template-id. */
4586 /* Try a template-id. */
4588 check_dependency_p,
4589 declarator_p);
4590 /* If it worked, we're done. */
4593 /* Otherwise, it's an ordinary identifier. */
4595 }
4599 check_dependency_p,
4600 declarator_p);
4603 {
4604 tree type_decl;
4605 tree qualifying_scope;
4606 tree object_scope;
4607 tree scope;
4610 /* Consume the `~' token. */
4612 /* Parse the class-name. The standard, as written, seems to
4613 say that:
4615 template <typename T> struct S { ~S (); };
4616 template <typename T> S<T>::~S() {}
4618 is invalid, since `~' must be followed by a class-name, but
4619 `S<T>' is dependent, and so not known to be a class.
4620 That's not right; we need to look in uninstantiated
4621 templates. A further complication arises from:
4623 template <typename T> void f(T t) {
4624 t.T::~T();
4625 }
4627 Here, it is not possible to look up `T' in the scope of `T'
4628 itself. We must look in both the current scope, and the
4629 scope of the containing complete expression.
4631 Yet another issue is:
4633 struct S {
4634 int S;
4635 ~S();
4636 };
4638 S::~S() {}
4640 The standard does not seem to say that the `S' in `~S'
4641 should refer to the type `S' and not the data member
4642 `S::S'. */
4644 /* DR 244 says that we look up the name after the "~" in the
4645 same scope as we looked up the qualifying name. That idea
4646 isn't fully worked out; it's more complicated than that. */
4651 /* Check for invalid scopes. */
4653 {
4657 }
4659 {
4663 scope);
4668 }
4671 /* If the name is of the form "X::~X" it's OK even if X is a
4672 typedef. */
4681 {
4684 }
4686 /* If there was an explicit qualification (S::~T), first look
4687 in the scope given by the qualification (i.e., S).
4689 Note: in the calls to cp_parser_class_name below we pass
4690 typename_type so that lookup finds the injected-class-name
4691 rather than the constructor. */
4695 {
4700 typename_type,
4703 declarator_p);
4706 }
4707 /* In "N::S::~S", look in "N" as well. */
4709 {
4714 type_decl
4718 typename_type,
4721 declarator_p);
4724 }
4725 /* In "p->S::~T", look in the scope given by "*p" as well. */
4727 {
4732 type_decl
4736 typename_type,
4739 declarator_p);
4742 }
4743 /* Look in the surrounding context. */
4745 {
4751 type_decl
4755 typename_type,
4758 declarator_p);
4761 {
4762 /* We couldn't find a type with this name, so just accept
4763 it and check for a match at instantiation time. */
4768 }
4769 }
4770 /* If an error occurred, assume that the name of the
4771 destructor is the same as the name of the qualifying
4772 class. That allows us to keep parsing after running
4773 into ill-formed destructor names. */
4779 /* Check that destructor name and scope match. */
4781 {
4788 }
4790 /* [class.dtor]
4792 A typedef-name that names a class shall not be used as the
4793 identifier in the declarator for a destructor declaration. */
4800 type_decl);
4803 }
4807 {
4808 tree id;
4810 /* This could be a template-id, so we try that first. */
4812 /* Try a template-id. */
4815 declarator_p);
4816 /* If that worked, we're done. */
4819 /* We still don't know whether we're looking at an
4820 operator-function-id or a conversion-function-id. */
4822 /* Try an operator-function-id. */
4824 /* If that didn't work, try a conversion-function-id. */
4828 {
4829 /* 17.6.3.3.5 */
4834 }
4837 }
4838 /* Fall through. */
4845 }
4846 }
4848 /* Parse an (optional) nested-name-specifier.
4850 nested-name-specifier: [C++98]
4851 class-or-namespace-name :: nested-name-specifier [opt]
4852 class-or-namespace-name :: template nested-name-specifier [opt]
4854 nested-name-specifier: [C++0x]
4855 type-name ::
4856 namespace-name ::
4857 nested-name-specifier identifier ::
4858 nested-name-specifier template [opt] simple-template-id ::
4860 PARSER->SCOPE should be set appropriately before this function is
4861 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
4862 effect. TYPE_P is TRUE if we non-type bindings should be ignored
4863 in name lookups.
4865 Sets PARSER->SCOPE to the class (TYPE) or namespace
4866 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
4867 it unchanged if there is no nested-name-specifier. Returns the new
4868 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
4870 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
4871 part of a declaration and/or decl-specifier. */
4873 static tree
4879 {
4884 /* Remember where the nested-name-specifier starts. */
4886 {
4889 }
4892 {
4893 tree new_scope;
4894 tree old_scope;
4895 tree saved_qualifying_scope;
4898 /* Spot cases that cannot be the beginning of a
4899 nested-name-specifier. */
4902 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
4903 the already parsed nested-name-specifier. */
4905 {
4906 /* Grab the nested-name-specifier and continue the loop. */
4908 /* If we originally encountered this nested-name-specifier
4909 with IS_DECLARATION set to false, we will not have
4910 resolved TYPENAME_TYPEs, so we must do so here. */
4913 {
4918 }
4921 }
4923 /* Spot cases that cannot be the beginning of a
4924 nested-name-specifier. On the second and subsequent times
4925 through the loop, we look for the `template' keyword. */
4927 ;
4928 /* A template-id can start a nested-name-specifier. */
4930 ;
4931 /* DR 743: decltype can be used in a nested-name-specifier. */
4933 ;
4934 else
4935 {
4936 /* If the next token is not an identifier, then it is
4937 definitely not a type-name or namespace-name. */
4940 /* If the following token is neither a `<' (to begin a
4941 template-id), nor a `::', then we are not looking at a
4942 nested-name-specifier. */
4948 {
4952 }
4955 && !cp_parser_nth_token_starts_template_argument_list_p
4958 }
4960 /* The nested-name-specifier is optional, so we parse
4961 tentatively. */
4964 /* Look for the optional `template' keyword, if this isn't the
4965 first time through the loop. */
4968 else
4971 /* Save the old scope since the name lookup we are about to do
4972 might destroy it. */
4975 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
4976 look up names in "X<T>::I" in order to determine that "Y" is
4977 a template. So, if we have a typename at this point, we make
4978 an effort to look through it. */
4980 && !typename_keyword_p
4985 /* Parse the qualifying entity. */
4986 new_scope
4988 typename_keyword_p,
4989 template_keyword_p,
4990 check_dependency_p,
4991 type_p,
4992 is_declaration);
4993 /* Look for the `::' token. */
4996 /* If we found what we wanted, we keep going; otherwise, we're
4997 done. */
4999 {
5002 /* Restore the OLD_SCOPE since it was valid before the
5003 failed attempt at finding the last
5004 class-or-namespace-name. */
5008 /* If the next token is a decltype, and the one after that is a
5009 `::', then the decltype has failed to resolve to a class or
5010 enumeration type. Give this error even when parsing
5011 tentatively since it can't possibly be valid--and we're going
5012 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5013 won't get another chance.*/
5017 {
5024 /* As below. */
5027 }
5031 /* If the next token is an identifier, and the one after
5032 that is a `::', then any valid interpretation would have
5033 found a class-or-namespace-name. */
5039 {
5042 {
5044 {
5045 tree decl;
5046 tree ambiguous_decls;
5049 none_type,
5058 decl);
5060 {
5066 }
5067 else
5068 {
5070 cp_parser_name_lookup_error
5073 else
5074 cp_parser_name_lookup_error
5077 }
5078 }
5081 /* Treat this as a successful nested-name-specifier
5082 due to:
5084 [basic.lookup.qual]
5086 If the name found is not a class-name (clause
5087 _class_) or namespace-name (_namespace.def_), the
5088 program is ill-formed. */
5090 }
5092 }
5094 }
5095 /* We've found one valid nested-name-specifier. */
5097 /* Name lookup always gives us a DECL. */
5100 /* Uses of "template" must be followed by actual templates. */
5112 new_scope);
5113 /* If it is a class scope, try to complete it; we are about to
5114 be looking up names inside the class. */
5116 /* Since checking types for dependency can be expensive,
5117 avoid doing it if the type is already complete. */
5119 /* Do not try to complete dependent types. */
5121 {
5123 /* If it is a typedef to current class, use the current
5124 class instead, as the typedef won't have any names inside
5125 it yet. */
5129 }
5130 /* Make sure we look in the right scope the next time through
5131 the loop. */
5133 }
5135 /* If parsing tentatively, replace the sequence of tokens that makes
5136 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5137 token. That way, should we re-parse the token stream, we will
5138 not have to repeat the effort required to do the parse, nor will
5139 we issue duplicate error messages. */
5141 {
5145 /* Reset the contents of the START token. */
5147 /* Retrieve any deferred checks. Do not pop this access checks yet
5148 so the memory will not be reclaimed during token replacing below. */
5156 /* Purge all subsequent tokens. */
5158 }
5164 }
5166 /* Parse a nested-name-specifier. See
5167 cp_parser_nested_name_specifier_opt for details. This function
5168 behaves identically, except that it will an issue an error if no
5169 nested-name-specifier is present. */
5171 static tree
5177 {
5178 tree scope;
5180 /* Look for the nested-name-specifier. */
5182 typename_keyword_p,
5183 check_dependency_p,
5184 type_p,
5185 is_declaration);
5186 /* If it was not present, issue an error message. */
5188 {
5191 }
5194 }
5196 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5197 this is either a class-name or a namespace-name (which corresponds
5198 to the class-or-namespace-name production in the grammar). For
5199 C++0x, it can also be a type-name that refers to an enumeration
5200 type or a simple-template-id.
5202 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5203 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5204 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5205 TYPE_P is TRUE iff the next name should be taken as a class-name,
5206 even the same name is declared to be another entity in the same
5207 scope.
5209 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5210 specified by the class-or-namespace-name. If neither is found the
5211 ERROR_MARK_NODE is returned. */
5213 static tree
5220 {
5221 tree saved_scope;
5222 tree saved_qualifying_scope;
5223 tree saved_object_scope;
5224 tree scope;
5228 /* DR 743: decltype can appear in a nested-name-specifier. */
5230 {
5234 {
5237 }
5241 }
5243 /* Before we try to parse the class-name, we must save away the
5244 current PARSER->SCOPE since cp_parser_class_name will destroy
5245 it. */
5249 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5250 there is no need to look for a namespace-name. */
5251 only_class_p = template_keyword_p
5256 typename_keyword_p,
5257 template_keyword_p,
5259 check_dependency_p,
5261 is_declaration);
5263 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5267 {
5268 /* Restore the saved scope. */
5273 /* Parse tentatively. */
5276 /* Parse a type-name */
5279 /* "If the name found does not designate a namespace or a class,
5280 enumeration, or dependent type, the program is ill-formed."
5282 We cover classes and dependent types above and namespaces below,
5283 so this code is only looking for enums. */
5289 }
5290 /* If that didn't work, try for a namespace-name. */
5292 {
5293 /* Restore the saved scope. */
5297 /* If we are not looking at an identifier followed by the scope
5298 resolution operator, then this is not part of a
5299 nested-name-specifier. (Note that this function is only used
5300 to parse the components of a nested-name-specifier.) */
5305 }
5308 }
5310 /* Parse a postfix-expression.
5312 postfix-expression:
5313 primary-expression
5314 postfix-expression [ expression ]
5315 postfix-expression ( expression-list [opt] )
5316 simple-type-specifier ( expression-list [opt] )
5317 typename :: [opt] nested-name-specifier identifier
5318 ( expression-list [opt] )
5319 typename :: [opt] nested-name-specifier template [opt] template-id
5320 ( expression-list [opt] )
5321 postfix-expression . template [opt] id-expression
5322 postfix-expression -> template [opt] id-expression
5323 postfix-expression . pseudo-destructor-name
5324 postfix-expression -> pseudo-destructor-name
5325 postfix-expression ++
5326 postfix-expression --
5327 dynamic_cast < type-id > ( expression )
5328 static_cast < type-id > ( expression )
5329 reinterpret_cast < type-id > ( expression )
5330 const_cast < type-id > ( expression )
5331 typeid ( expression )
5332 typeid ( type-id )
5334 GNU Extension:
5336 postfix-expression:
5337 ( type-id ) { initializer-list , [opt] }
5339 This extension is a GNU version of the C99 compound-literal
5340 construct. (The C99 grammar uses `type-name' instead of `type-id',
5341 but they are essentially the same concept.)
5343 If ADDRESS_P is true, the postfix expression is the operand of the
5344 `&' operator. CAST_P is true if this expression is the target of a
5345 cast.
5347 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5348 class member access expressions [expr.ref].
5350 Returns a representation of the expression. */
5352 static tree
5356 {
5363 /* Peek at the next token. */
5365 /* Some of the productions are determined by keywords. */
5368 {
5373 {
5374 tree type;
5375 tree expression;
5378 /* All of these can be handled in the same way from the point
5379 of view of parsing. Begin by consuming the token
5380 identifying the cast. */
5383 /* New types cannot be defined in the cast. */
5385 parser->type_definition_forbidden_message
5388 /* Look for the opening `<'. */
5390 /* Parse the type to which we are casting. */
5392 /* Look for the closing `>'. */
5394 /* Restore the old message. */
5397 /* And the expression which is being cast. */
5402 /* Only type conversions to integral or enumeration types
5403 can be used in constant-expressions. */
5409 {
5411 postfix_expression
5415 postfix_expression
5419 postfix_expression
5421 tf_warning_or_error);
5424 postfix_expression
5429 }
5430 }
5434 {
5435 tree type;
5439 /* Consume the `typeid' token. */
5441 /* Look for the `(' token. */
5443 /* Types cannot be defined in a `typeid' expression. */
5445 parser->type_definition_forbidden_message
5447 /* We can't be sure yet whether we're looking at a type-id or an
5448 expression. */
5450 /* Try a type-id first. */
5455 /* Look for the `)' token. Otherwise, we can't be sure that
5456 we're not looking at an expression: consider `typeid (int
5457 (3))', for example. */
5459 /* If all went well, simply lookup the type-id. */
5462 /* Otherwise, fall back to the expression variant. */
5463 else
5464 {
5465 tree expression;
5467 /* Look for an expression. */
5469 /* Compute its typeid. */
5471 /* Look for the `)' token. */
5473 }
5474 /* Restore the saved message. */
5476 /* `typeid' may not appear in an integral constant expression. */
5479 }
5483 {
5484 tree type;
5485 /* The syntax permitted here is the same permitted for an
5486 elaborated-type-specifier. */
5491 }
5495 {
5496 tree type;
5498 /* If the next thing is a simple-type-specifier, we may be
5499 looking at a functional cast. We could also be looking at
5500 an id-expression. So, we try the functional cast, and if
5501 that doesn't work we fall back to the primary-expression. */
5503 /* Look for the simple-type-specifier. */
5506 CP_PARSER_FLAGS_NONE);
5507 /* Parse the cast itself. */
5509 postfix_expression
5511 /* If that worked, we're done. */
5515 /* If the functional-cast didn't work out, try a
5516 compound-literal. */
5519 {
5524 /* Consume the `('. */
5526 /* Parse the type. */
5531 /* Look for the `)'. */
5533 /* Look for the `{'. */
5535 /* If things aren't going well, there's no need to
5536 keep going. */
5538 {
5540 /* Parse the initializer-list. */
5541 initializer_list
5543 /* Allow a trailing `,'. */
5546 /* Look for the final `}'. */
5548 }
5549 /* If that worked, we're definitely looking at a
5550 compound-literal expression. */
5552 {
5553 /* Warn the user that a compound literal is not
5554 allowed in standard C++. */
5556 /* For simplicity, we disallow compound literals in
5557 constant-expressions. We could
5558 allow compound literals of integer type, whose
5559 initializer was a constant, in constant
5560 expressions. Permitting that usage, as a further
5561 extension, would not change the meaning of any
5562 currently accepted programs. (Of course, as
5563 compound literals are not part of ISO C++, the
5564 standard has nothing to say.) */
5566 NIC_NCC))
5567 {
5570 }
5571 /* Form the representation of the compound-literal. */
5572 postfix_expression
5573 = (finish_compound_literal
5575 initializer_list),
5576 tf_warning_or_error));
5578 }
5579 }
5581 /* It must be a primary-expression. */
5582 postfix_expression
5586 }
5588 }
5590 /* Keep looping until the postfix-expression is complete. */
5592 {
5596 /* It is not a Koenig lookup function call. */
5597 postfix_expression
5600 /* Peek at the next token. */
5604 {
5606 postfix_expression
5608 postfix_expression,
5615 /* postfix-expression ( expression-list [opt] ) */
5616 {
5625 is_builtin_constant_p
5628 {
5629 /* The whole point of __builtin_constant_p is to allow
5630 non-constant expressions to appear as arguments. */
5631 saved_integral_constant_expression_p
5633 saved_non_integral_constant_expression_p
5636 }
5637 args = (cp_parser_parenthesized_expression_list
5642 {
5643 parser->integral_constant_expression_p
5645 parser->non_integral_constant_expression_p
5647 }
5650 {
5653 }
5655 /* Function calls are not permitted in
5656 constant-expressions. */
5659 NIC_FUNC_CALL))
5660 {
5664 }
5669 {
5671 {
5673 {
5676 postfix_expression
5679 tf_warning_or_error);
5680 }
5681 else
5682 postfix_expression
5684 }
5685 /* We do not perform argument-dependent lookup if
5686 normal lookup finds a non-function, in accordance
5687 with the expected resolution of DR 218. */
5690 {
5694 /* Do not do argument dependent lookup if regular
5695 lookup finds a member function or a block-scope
5696 function declaration. [basic.lookup.argdep]/3 */
5699 {
5702 postfix_expression
5705 tf_warning_or_error);
5706 }
5707 }
5708 }
5711 {
5721 {
5722 postfix_expression
5726 }
5729 {
5730 postfix_expression
5731 = (build_new_method_call
5737 tf_warning_or_error));
5738 }
5739 else
5740 postfix_expression
5744 tf_warning_or_error);
5745 }
5749 postfix_expression = (build_offset_ref_call_from_tree
5752 /* A call to a static class member, or a namespace-scope
5753 function. */
5754 postfix_expression
5757 koenig_p,
5758 tf_warning_or_error);
5759 else
5760 /* All other function calls. */
5761 postfix_expression
5764 koenig_p,
5765 tf_warning_or_error);
5767 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
5771 }
5776 /* postfix-expression . template [opt] id-expression
5777 postfix-expression . pseudo-destructor-name
5778 postfix-expression -> template [opt] id-expression
5779 postfix-expression -> pseudo-destructor-name */
5781 /* Consume the `.' or `->' operator. */
5784 postfix_expression
5786 postfix_expression,
5794 /* postfix-expression ++ */
5795 /* Consume the `++' token. */
5797 /* Generate a representation for the complete expression. */
5798 postfix_expression
5800 POSTINCREMENT_EXPR);
5801 /* Increments may not appear in constant-expressions. */
5809 /* postfix-expression -- */
5810 /* Consume the `--' token. */
5812 /* Generate a representation for the complete expression. */
5813 postfix_expression
5815 POSTDECREMENT_EXPR);
5816 /* Decrements may not appear in constant-expressions. */
5828 else
5830 }
5831 }
5833 /* We should never get here. */
5836 }
5838 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5839 by cp_parser_builtin_offsetof. We're looking for
5841 postfix-expression [ expression ]
5842 postfix-expression [ braced-init-list ] (C++11)
5844 FOR_OFFSETOF is set if we're being called in that context, which
5845 changes how we deal with integer constant expressions. */
5847 static tree
5849 tree postfix_expression,
5851 {
5852 tree index;
5854 /* Consume the `[' token. */
5857 /* Parse the index expression. */
5858 /* ??? For offsetof, there is a question of what to allow here. If
5859 offsetof is not being used in an integral constant expression context,
5860 then we *could* get the right answer by computing the value at runtime.
5861 If we are in an integral constant expression context, then we might
5862 could accept any constant expression; hard to say without analysis.
5863 Rather than open the barn door too wide right away, allow only integer
5864 constant expressions here. */
5867 else
5868 {
5870 {
5874 }
5875 else
5877 }
5879 /* Look for the closing `]'. */
5882 /* Build the ARRAY_REF. */
5885 /* When not doing offsetof, array references are not permitted in
5886 constant-expressions. */
5892 }
5894 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5895 by cp_parser_builtin_offsetof. We're looking for
5897 postfix-expression . template [opt] id-expression
5898 postfix-expression . pseudo-destructor-name
5899 postfix-expression -> template [opt] id-expression
5900 postfix-expression -> pseudo-destructor-name
5902 FOR_OFFSETOF is set if we're being called in that context. That sorta
5903 limits what of the above we'll actually accept, but nevermind.
5904 TOKEN_TYPE is the "." or "->" token, which will already have been
5905 removed from the stream. */
5907 static tree
5910 tree postfix_expression,
5912 location_t location)
5913 {
5914 tree name;
5919 /* If this is a `->' operator, dereference the pointer. */
5922 tf_warning_or_error);
5923 /* Check to see whether or not the expression is type-dependent. */
5925 /* The identifier following the `->' or `.' is not qualified. */
5931 /* Enter the scope corresponding to the type of the object
5932 given by the POSTFIX_EXPRESSION. */
5934 {
5936 /* According to the standard, no expression should ever have
5937 reference type. Unfortunately, we do not currently match
5938 the standard in this respect in that our internal representation
5939 of an expression may have reference type even when the standard
5940 says it does not. Therefore, we have to manually obtain the
5941 underlying type here. */
5943 /* The type of the POSTFIX_EXPRESSION must be complete. */
5945 {
5947 postfix_expression);
5949 }
5950 /* Unlike the object expression in other contexts, *this is not
5951 required to be of complete type for purposes of class member
5952 access (5.2.5) outside the member function body. */
5956 /* Let the name lookup machinery know that we are processing a
5957 class member access expression. */
5959 /* If something went wrong, we want to be able to discern that case,
5960 as opposed to the case where there was no SCOPE due to the type
5961 of expression being dependent. */
5964 /* If the SCOPE was erroneous, make the various semantic analysis
5965 functions exit quickly -- and without issuing additional error
5966 messages. */
5969 }
5971 /* Assume this expression is not a pseudo-destructor access. */
5974 /* If the SCOPE is a scalar type, then, if this is a valid program,
5975 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
5976 is type dependent, it can be pseudo-destructor-name or something else.
5977 Try to parse it as pseudo-destructor-name first. */
5979 {
5980 tree s;
5981 tree type;
5984 /* Parse the pseudo-destructor-name. */
5993 {
5995 postfix_expression
5998 }
5999 }
6002 {
6003 /* If the SCOPE is not a scalar type, we are looking at an
6004 ordinary class member access expression, rather than a
6005 pseudo-destructor-name. */
6008 /* Parse the id-expression. */
6009 name = (cp_parser_id_expression
6016 /* In general, build a SCOPE_REF if the member name is qualified.
6017 However, if the name was not dependent and has already been
6018 resolved; there is no need to build the SCOPE_REF. For example;
6020 struct X { void f(); };
6021 template <typename T> void f(T* t) { t->X::f(); }
6023 Even though "t" is dependent, "X::f" is not and has been resolved
6024 to a BASELINK; there is no need to include scope information. */
6026 /* But we do need to remember that there was an explicit scope for
6027 virtual function calls. */
6031 /* If the name is a template-id that names a type, we will get a
6032 TYPE_DECL here. That is invalid code. */
6034 {
6037 }
6038 else
6039 {
6041 {
6043 {
6047 }
6048 else
6051 name,
6052 template_p);
6056 }
6058 adjust_result_of_qualified_name_lookup
6060 postfix_expression
6062 template_p,
6063 tf_warning_or_error);
6064 }
6065 }
6067 /* We no longer need to look up names in the scope of the object on
6068 the left-hand side of the `.' or `->' operator. */
6071 /* Outside of offsetof, these operators may not appear in
6072 constant-expressions. */
6074 && (cp_parser_non_integral_constant_expression
6079 }
6081 /* Parse a parenthesized expression-list.
6083 expression-list:
6084 assignment-expression
6085 expression-list, assignment-expression
6087 attribute-list:
6088 expression-list
6089 identifier
6090 identifier, expression-list
6092 CAST_P is true if this expression is the target of a cast.
6094 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6095 argument pack.
6097 Returns a vector of trees. Each element is a representation of an
6098 assignment-expression. NULL is returned if the ( and or ) are
6099 missing. An empty, but allocated, vector is returned on no
6100 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6101 if we are parsing an attribute list for an attribute that wants a
6102 plain identifier argument, normal_attr for an attribute that wants
6103 an expression, or non_attr if we aren't parsing an attribute list. If
6104 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6105 not all of the expressions in the list were constant. */
6113 {
6119 /* Assume all the expressions will be constant. */
6128 /* Within a parenthesized expression, a `>' token is always
6129 the greater-than operator. */
6130 saved_greater_than_is_operator_p
6134 /* Consume expressions until there are no more. */
6137 {
6138 tree expr;
6140 /* At the beginning of attribute lists, check to see if the
6141 next token is an identifier. */
6144 {
6147 /* Consume the identifier. */
6149 /* Save the identifier. */
6151 }
6152 else
6153 {
6156 /* Parse the next assignment-expression. */
6158 {
6159 /* A braced-init-list. */
6164 }
6166 {
6167 expr = (cp_parser_constant_expression
6172 }
6173 else
6179 /* If we have an ellipsis, then this is an expression
6180 expansion. */
6183 {
6184 /* Consume the `...'. */
6187 /* Build the argument pack. */
6189 }
6191 /* Add it to the list. We add error_mark_node
6192 expressions to the list, so that we can still tell if
6193 the correct form for a parenthesized expression-list
6194 is found. That gives better errors. */
6199 }
6201 /* After the first item, attribute lists look the same as
6202 expression lists. */
6205 get_comma:;
6206 /* If the next token isn't a `,', then we are done. */
6210 /* Otherwise, consume the `,' and keep going. */
6212 }
6215 {
6218 skip_comma:;
6219 /* We try and resync to an unnested comma, as that will give the
6220 user better diagnostics. */
6228 {
6229 parser->greater_than_is_operator_p
6232 }
6233 }
6235 parser->greater_than_is_operator_p
6242 }
6244 /* Parse a pseudo-destructor-name.
6246 pseudo-destructor-name:
6247 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6248 :: [opt] nested-name-specifier template template-id :: ~ type-name
6249 :: [opt] nested-name-specifier [opt] ~ type-name
6251 If either of the first two productions is used, sets *SCOPE to the
6252 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6253 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6254 or ERROR_MARK_NODE if the parse fails. */
6256 static void
6260 {
6263 /* Assume that things will not work out. */
6266 /* Look for the optional `::' operator. */
6268 /* Look for the optional nested-name-specifier. */
6269 nested_name_specifier_p
6276 /* Now, if we saw a nested-name-specifier, we might be doing the
6277 second production. */
6280 {
6281 /* Consume the `template' keyword. */
6283 /* Parse the template-id. */
6288 /* Look for the `::' token. */
6290 }
6291 /* If the next token is not a `~', then there might be some
6292 additional qualification. */
6294 {
6295 /* At this point, we're looking for "type-name :: ~". The type-name
6296 must not be a class-name, since this is a pseudo-destructor. So,
6297 it must be either an enum-name, or a typedef-name -- both of which
6298 are just identifiers. So, we peek ahead to check that the "::"
6299 and "~" tokens are present; if they are not, then we can avoid
6300 calling type_name. */
6304 {
6307 }
6309 /* Look for the type-name. */
6314 /* Look for the `::' token. */
6316 }
6317 else
6320 /* Look for the `~'. */
6323 /* Once we see the ~, this has to be a pseudo-destructor. */
6327 /* Look for the type-name again. We are not responsible for
6328 checking that it matches the first type-name. */
6330 }
6332 /* Parse a unary-expression.
6334 unary-expression:
6335 postfix-expression
6336 ++ cast-expression
6337 -- cast-expression
6338 unary-operator cast-expression
6339 sizeof unary-expression
6340 sizeof ( type-id )
6341 alignof ( type-id ) [C++0x]
6342 new-expression
6343 delete-expression
6345 GNU Extensions:
6347 unary-expression:
6348 __extension__ cast-expression
6349 __alignof__ unary-expression
6350 __alignof__ ( type-id )
6351 alignof unary-expression [C++0x]
6352 __real__ cast-expression
6353 __imag__ cast-expression
6354 && identifier
6356 ADDRESS_P is true iff the unary-expression is appearing as the
6357 operand of the `&' operator. CAST_P is true if this expression is
6358 the target of a cast.
6360 Returns a representation of the expression. */
6362 static tree
6365 {
6369 /* Peek at the next token. */
6371 /* Some keywords give away the kind of expression. */
6373 {
6377 {
6380 {
6381 tree operand;
6385 /* Consume the token. */
6387 /* Parse the operand. */
6392 else
6393 {
6394 /* ISO C++ defines alignof only with types, not with
6395 expressions. So pedwarn if alignof is used with a non-
6396 type expression. However, __alignof__ is ok. */
6399 "ISO C++ does not allow %<alignof%> "
6403 }
6404 }
6413 {
6414 /* The saved value of the PEDANTIC flag. */
6416 tree expr;
6418 /* Save away the PEDANTIC flag. */
6420 /* Parse the cast-expression. */
6422 /* Restore the PEDANTIC flag. */
6426 }
6430 {
6431 tree expression;
6433 /* Consume the `__real__' or `__imag__' token. */
6435 /* Parse the cast-expression. */
6437 /* Create the complete representation. */
6440 expression,
6441 tf_warning_or_error);
6442 }
6450 {
6451 tree expr;
6461 parser->type_definition_forbidden_message
6464 saved_integral_constant_expression_p
6466 saved_non_integral_constant_expression_p
6470 saved_greater_than_is_operator_p
6480 parser->greater_than_is_operator_p
6483 parser->integral_constant_expression_p
6485 parser->non_integral_constant_expression_p
6492 }
6496 }
6497 }
6499 /* Look for the `:: new' and `:: delete', which also signal the
6500 beginning of a new-expression, or delete-expression,
6501 respectively. If the next token is `::', then it might be one of
6502 these. */
6504 {
6507 /* See if the token after the `::' is one of the keywords in
6508 which we're interested. */
6510 /* If it's `new', we have a new-expression. */
6513 /* Similarly, for `delete'. */
6516 }
6518 /* Look for a unary operator. */
6520 /* The `++' and `--' operators can be handled similarly, even though
6521 they are not technically unary-operators in the grammar. */
6523 {
6528 /* Handle the GNU address-of-label extension. */
6531 {
6532 tree identifier;
6533 tree expression;
6536 /* Consume the '&&' token. */
6538 /* Look for the identifier. */
6540 /* Create an expression representing the address. */
6543 NIC_ADDR_LABEL))
6546 }
6547 }
6549 {
6550 tree cast_expression;
6554 /* Consume the operator token. */
6556 /* Parse the cast-expression. */
6557 cast_expression
6561 /* Now, build an appropriate representation. */
6563 {
6567 tf_warning_or_error);
6572 /* Fall through. */
6575 tf_warning_or_error);
6582 /* Fall through. */
6591 }
6595 non_constant_p))
6599 }
6603 pidk);
6604 }
6606 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
6607 unary-operator, the corresponding tree code is returned. */
6609 static enum tree_code
6611 {
6613 {
6634 }
6635 }
6637 /* Parse a new-expression.
6639 new-expression:
6640 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
6641 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
6643 Returns a representation of the expression. */
6645 static tree
6647 {
6650 tree type;
6652 tree nelts;
6653 tree ret;
6655 /* Look for the optional `::' operator. */
6656 global_scope_p
6660 /* Look for the `new' operator. */
6662 /* There's no easy way to tell a new-placement from the
6663 `( type-id )' construct. */
6665 /* Look for a new-placement. */
6667 /* If that didn't work out, there's no new-placement. */
6669 {
6673 }
6675 /* If the next token is a `(', then we have a parenthesized
6676 type-id. */
6678 {
6682 /* Consume the `('. */
6685 /* Parse the type-id. */
6686 parser->type_definition_forbidden_message
6691 /* Look for the closing `)'. */
6694 /* There should not be a direct-new-declarator in this production,
6695 but GCC used to allowed this, so we check and emit a sensible error
6696 message for this case. */
6698 {
6704 }
6706 }
6707 /* Otherwise, there must be a new-type-id. */
6708 else
6711 /* If the next token is a `(' or '{', then we have a new-initializer. */
6715 else
6718 /* A new-expression may not appear in an integral constant
6719 expression. */
6722 else
6723 {
6724 /* Create a representation of the new-expression. */
6726 tf_warning_or_error);
6727 }
6735 }
6737 /* Parse a new-placement.
6739 new-placement:
6740 ( expression-list )
6742 Returns the same representation as for an expression-list. */
6746 {
6749 /* Parse the expression-list. */
6750 expression_list = (cp_parser_parenthesized_expression_list
6756 }
6758 /* Parse a new-type-id.
6760 new-type-id:
6761 type-specifier-seq new-declarator [opt]
6763 Returns the TYPE allocated. If the new-type-id indicates an array
6764 type, *NELTS is set to the number of elements in the last array
6765 bound; the TYPE will not include the last array bound. */
6767 static tree
6769 {
6770 cp_decl_specifier_seq type_specifier_seq;
6775 tree type;
6777 /* The type-specifier sequence must not contain type definitions.
6778 (It cannot contain declarations of new types either, but if they
6779 are not definitions we will catch that because they are not
6780 complete.) */
6782 parser->type_definition_forbidden_message
6784 /* Parse the type-specifier-seq. */
6788 /* Restore the old message. */
6790 /* Parse the new-declarator. */
6793 /* Determine the number of elements in the last array dimension, if
6794 any. */
6796 /* Skip down to the last array dimension. */
6801 {
6804 }
6809 {
6812 }
6815 {
6822 else
6824 }
6828 }
6830 /* Parse an (optional) new-declarator.
6832 new-declarator:
6833 ptr-operator new-declarator [opt]
6834 direct-new-declarator
6836 Returns the declarator. */
6840 {
6842 tree type;
6843 cp_cv_quals cv_quals;
6845 /* We don't know if there's a ptr-operator next, or not. */
6847 /* Look for a ptr-operator. */
6849 /* If that worked, look for more new-declarators. */
6851 {
6854 /* Parse another optional declarator. */
6857 return cp_parser_make_indirect_declarator
6859 }
6861 /* If the next token is a `[', there is a direct-new-declarator. */
6866 }
6868 /* Parse a direct-new-declarator.
6870 direct-new-declarator:
6871 [ expression ]
6872 direct-new-declarator [constant-expression]
6874 */
6878 {
6882 {
6883 tree expression;
6885 /* Look for the opening `['. */
6887 /* The first expression is not required to be constant. */
6889 {
6892 /* The standard requires that the expression have integral
6893 type. DR 74 adds enumeration types. We believe that the
6894 real intent is that these expressions be handled like the
6895 expression in a `switch' condition, which also allows
6896 classes with a single conversion to integral or
6897 enumeration type. */
6899 {
6900 expression
6902 expression,
6905 {
6907 "expression in new-declarator must have integral "
6910 }
6911 }
6912 }
6913 /* But all the other expressions must be. */
6914 else
6915 expression
6918 NULL);
6919 /* Look for the closing `]'. */
6922 /* Add this bound to the declarator. */
6925 /* If the next token is not a `[', then there are no more
6926 bounds. */
6929 }
6932 }
6934 /* Parse a new-initializer.
6936 new-initializer:
6937 ( expression-list [opt] )
6938 braced-init-list
6940 Returns a representation of the expression-list. */
6944 {
6948 {
6949 tree t;
6955 }
6956 else
6957 expression_list = (cp_parser_parenthesized_expression_list
6963 }
6965 /* Parse a delete-expression.
6967 delete-expression:
6968 :: [opt] delete cast-expression
6969 :: [opt] delete [ ] cast-expression
6971 Returns a representation of the expression. */
6973 static tree
6975 {
6978 tree expression;
6980 /* Look for the optional `::' operator. */
6981 global_scope_p
6985 /* Look for the `delete' keyword. */
6987 /* See if the array syntax is in use. */
6989 {
6990 /* Consume the `[' token. */
6992 /* Look for the `]' token. */
6994 /* Remember that this is the `[]' construct. */
6996 }
6997 else
7000 /* Parse the cast-expression. */
7003 /* A delete-expression may not appear in an integral constant
7004 expression. */
7009 tf_warning_or_error);
7010 }
7012 /* Returns true if TOKEN may start a cast-expression and false
7013 otherwise. */
7015 static bool
7017 {
7019 {
7058 /* '[' may start a primary-expression in obj-c++. */
7064 }
7065 }
7067 /* Parse a cast-expression.
7069 cast-expression:
7070 unary-expression
7071 ( type-id ) cast-expression
7073 ADDRESS_P is true iff the unary-expression is appearing as the
7074 operand of the `&' operator. CAST_P is true if this expression is
7075 the target of a cast.
7077 Returns a representation of the expression. */
7079 static tree
7082 {
7083 /* If it's a `(', then we might be looking at a cast. */
7085 {
7091 /* There's no way to know yet whether or not this is a cast.
7092 For example, `(int (3))' is a unary-expression, while `(int)
7093 3' is a cast. So, we resort to parsing tentatively. */
7095 /* Types may not be defined in a cast. */
7097 parser->type_definition_forbidden_message
7099 /* Consume the `('. */
7101 /* A very tricky bit is that `(struct S) { 3 }' is a
7102 compound-literal (which we permit in C++ as an extension).
7103 But, that construct is not a cast-expression -- it is a
7104 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7105 is legal; if the compound-literal were a cast-expression,
7106 you'd need an extra set of parentheses.) But, if we parse
7107 the type-id, and it happens to be a class-specifier, then we
7108 will commit to the parse at that point, because we cannot
7109 undo the action that is done when creating a new class. So,
7110 then we cannot back up and do a postfix-expression.
7112 Therefore, we scan ahead to the closing `)', and check to see
7113 if the token after the `)' is a `{'. If so, we are not
7114 looking at a cast-expression.
7116 Save tokens so that we can put them back. */
7118 /* Skip tokens until the next token is a closing parenthesis.
7119 If we find the closing `)', and the next token is a `{', then
7120 we are looking at a compound-literal. */
7121 compound_literal_p
7125 /* Roll back the tokens we skipped. */
7127 /* If we were looking at a compound-literal, simulate an error
7128 so that the call to cp_parser_parse_definitely below will
7129 fail. */
7132 else
7133 {
7136 /* Look for the type-id. */
7138 /* Look for the closing `)'. */
7141 }
7143 /* Restore the saved message. */
7146 /* At this point this can only be either a cast or a
7147 parenthesized ctor such as `(T ())' that looks like a cast to
7148 function returning T. */
7152 {
7158 /* Warn about old-style casts, if so requested. */
7160 && !in_system_header
7165 /* Only type conversions to integral or enumeration types
7166 can be used in constant-expressions. */
7169 NIC_CAST))
7172 /* Perform the cast. */
7175 }
7176 else
7178 }
7180 /* If we get here, then it's not a cast, so it must be a
7181 unary-expression. */
7183 }
7185 /* Parse a binary expression of the general form:
7187 pm-expression:
7188 cast-expression
7189 pm-expression .* cast-expression
7190 pm-expression ->* cast-expression
7192 multiplicative-expression:
7193 pm-expression
7194 multiplicative-expression * pm-expression
7195 multiplicative-expression / pm-expression
7196 multiplicative-expression % pm-expression
7198 additive-expression:
7199 multiplicative-expression
7200 additive-expression + multiplicative-expression
7201 additive-expression - multiplicative-expression
7203 shift-expression:
7204 additive-expression
7205 shift-expression << additive-expression
7206 shift-expression >> additive-expression
7208 relational-expression:
7209 shift-expression
7210 relational-expression < shift-expression
7211 relational-expression > shift-expression
7212 relational-expression <= shift-expression
7213 relational-expression >= shift-expression
7215 GNU Extension:
7217 relational-expression:
7218 relational-expression <? shift-expression
7219 relational-expression >? shift-expression
7221 equality-expression:
7222 relational-expression
7223 equality-expression == relational-expression
7224 equality-expression != relational-expression
7226 and-expression:
7227 equality-expression
7228 and-expression & equality-expression
7230 exclusive-or-expression:
7231 and-expression
7232 exclusive-or-expression ^ and-expression
7234 inclusive-or-expression:
7235 exclusive-or-expression
7236 inclusive-or-expression | exclusive-or-expression
7238 logical-and-expression:
7239 inclusive-or-expression
7240 logical-and-expression && inclusive-or-expression
7242 logical-or-expression:
7243 logical-and-expression
7244 logical-or-expression || logical-and-expression
7246 All these are implemented with a single function like:
7248 binary-expression:
7249 simple-cast-expression
7250 binary-expression <token> binary-expression
7252 CAST_P is true if this expression is the target of a cast.
7254 The binops_by_token map is used to get the tree codes for each <token> type.
7255 binary-expressions are associated according to a precedence table. */
7257 #define TOKEN_PRECEDENCE(token) \
7258 (((token->type == CPP_GREATER \
7259 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7260 && !parser->greater_than_is_operator_p) \
7261 ? PREC_NOT_OPERATOR \
7262 : binops_by_token[token->type].prec)
7264 static tree
7269 {
7270 cp_parser_expression_stack stack;
7276 tree overload;
7278 /* Parse the first expression. */
7283 {
7284 /* Get an operator token. */
7290 {
7292 "%<>>%> operator is treated as"
7296 }
7300 /* Popping an entry off the stack means we completed a subexpression:
7301 - either we found a token which is not an operator (`>' where it is not
7302 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7303 will happen repeatedly;
7304 - or, we found an operator which has lower priority. This is the case
7305 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7306 parsing `3 * 4'. */
7308 {
7311 else
7313 }
7315 get_rhs:
7318 /* We used the operator token. */
7321 /* For "false && x" or "true || x", x will never be executed;
7322 disable warnings while evaluating it. */
7328 /* Extract another operand. It may be the RHS of this expression
7329 or the LHS of a new, higher priority expression. */
7333 /* Get another operator token. Look up its precedence to avoid
7334 building a useless (immediately popped) stack entry for common
7335 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7339 {
7340 /* ... and prepare to parse the RHS of the new, higher priority
7341 expression. Since precedence levels on the stack are
7342 monotonically increasing, we do not have to care about
7343 stack overflows. */
7348 sp++;
7355 pop:
7357 /* If the stack is not empty, we have parsed into LHS the right side
7358 (`4' in the example above) of an expression we had suspended.
7359 We can use the information on the stack to recover the LHS (`3')
7360 from the stack together with the tree code (`MULT_EXPR'), and
7361 the precedence of the higher level subexpression
7362 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7363 which will be used to actually build the additive expression. */
7371 }
7373 /* Undo the disabling of warnings done above. */
7380 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7381 ERROR_MARK for everything that is not a binary expression.
7382 This makes warn_about_parentheses miss some warnings that
7383 involve unary operators. For unary expressions we should
7384 pass the correct tree_code unless the unary expression was
7385 surrounded by parentheses.
7386 */
7392 else
7397 /* If the binary operator required the use of an overloaded operator,
7398 then this expression cannot be an integral constant-expression.
7399 An overloaded operator can be used even if both operands are
7400 otherwise permissible in an integral constant-expression if at
7401 least one of the operands is of enumeration type. */
7405 NIC_OVERLOADED))
7407 }
7410 }
7413 /* Parse the `? expression : assignment-expression' part of a
7414 conditional-expression. The LOGICAL_OR_EXPR is the
7415 logical-or-expression that started the conditional-expression.
7416 Returns a representation of the entire conditional-expression.
7418 This routine is used by cp_parser_assignment_expression.
7420 ? expression : assignment-expression
7422 GNU Extensions:
7424 ? : assignment-expression */
7426 static tree
7428 {
7429 tree expr;
7430 tree assignment_expr;
7433 /* Consume the `?' token. */
7438 {
7441 /* Implicit true clause. */
7445 }
7446 else
7447 {
7450 /* Parse the expression. */
7453 c_inhibit_evaluation_warnings +=
7457 }
7459 /* The next token should be a `:'. */
7461 /* Parse the assignment-expression. */
7465 /* Build the conditional-expression. */
7467 expr,
7468 assignment_expr,
7469 tf_warning_or_error);
7470 }
7472 /* Parse an assignment-expression.
7474 assignment-expression:
7475 conditional-expression
7476 logical-or-expression assignment-operator assignment_expression
7477 throw-expression
7479 CAST_P is true if this expression is the target of a cast.
7481 Returns a representation for the expression. */
7483 static tree
7486 {
7487 tree expr;
7489 /* If the next token is the `throw' keyword, then we're looking at
7490 a throw-expression. */
7493 /* Otherwise, it must be that we are looking at a
7494 logical-or-expression. */
7495 else
7496 {
7497 /* Parse the binary expressions (logical-or-expression). */
7500 /* If the next token is a `?' then we're actually looking at a
7501 conditional-expression. */
7504 else
7505 {
7508 /* If it's an assignment-operator, we're using the second
7509 production. */
7510 assignment_operator
7513 {
7516 /* Parse the right-hand side of the assignment. */
7522 /* An assignment may not appear in a
7523 constant-expression. */
7525 NIC_ASSIGNMENT))
7527 /* Build the assignment expression. */
7529 assignment_operator,
7530 rhs,
7531 tf_warning_or_error);
7532 }
7533 }
7534 }
7537 }
7539 /* Parse an (optional) assignment-operator.
7541 assignment-operator: one of
7542 = *= /= %= += -= >>= <<= &= ^= |=
7544 GNU Extension:
7546 assignment-operator: one of
7547 <?= >?=
7549 If the next token is an assignment operator, the corresponding tree
7550 code is returned, and the token is consumed. For example, for
7551 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
7552 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
7553 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
7554 operator, ERROR_MARK is returned. */
7556 static enum tree_code
7558 {
7562 /* Peek at the next token. */
7566 {
7612 /* Nothing else is an assignment operator. */
7614 }
7616 /* If it was an assignment operator, consume it. */
7621 }
7623 /* Parse an expression.
7625 expression:
7626 assignment-expression
7627 expression , assignment-expression
7629 CAST_P is true if this expression is the target of a cast.
7631 Returns a representation of the expression. */
7633 static tree
7635 {
7639 {
7640 tree assignment_expression;
7642 /* Parse the next assignment-expression. */
7643 assignment_expression
7645 /* If this is the first assignment-expression, we can just
7646 save it away. */
7649 else
7651 assignment_expression,
7652 tf_warning_or_error);
7653 /* If the next token is not a comma, then we are done with the
7654 expression. */
7657 /* Consume the `,'. */
7659 /* A comma operator cannot appear in a constant-expression. */
7662 }
7665 }
7667 /* Parse a constant-expression.
7669 constant-expression:
7670 conditional-expression
7672 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
7673 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
7674 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
7675 is false, NON_CONSTANT_P should be NULL. */
7677 static tree
7681 {
7685 tree expression;
7687 /* It might seem that we could simply parse the
7688 conditional-expression, and then check to see if it were
7689 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
7690 one that the compiler can figure out is constant, possibly after
7691 doing some simplifications or optimizations. The standard has a
7692 precise definition of constant-expression, and we must honor
7693 that, even though it is somewhat more restrictive.
7695 For example:
7697 int i[(2, 3)];
7699 is not a legal declaration, because `(2, 3)' is not a
7700 constant-expression. The `,' operator is forbidden in a
7701 constant-expression. However, GCC's constant-folding machinery
7702 will fold this operation to an INTEGER_CST for `3'. */
7704 /* Save the old settings. */
7706 saved_allow_non_integral_constant_expression_p
7709 /* We are now parsing a constant-expression. */
7711 parser->allow_non_integral_constant_expression_p
7714 /* Although the grammar says "conditional-expression", we parse an
7715 "assignment-expression", which also permits "throw-expression"
7716 and the use of assignment operators. In the case that
7717 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
7718 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
7719 actually essential that we look for an assignment-expression.
7720 For example, cp_parser_initializer_clauses uses this function to
7721 determine whether a particular assignment-expression is in fact
7722 constant. */
7724 /* Restore the old settings. */
7725 parser->integral_constant_expression_p
7727 parser->allow_non_integral_constant_expression_p
7730 {
7731 /* Require an rvalue constant expression here; that's what our
7732 callers expect. Reference constant expressions are handled
7733 separately in e.g. cp_parser_template_argument. */
7738 }
7741 parser->non_integral_constant_expression_p
7745 }
7747 /* Parse __builtin_offsetof.
7749 offsetof-expression:
7750 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
7752 offsetof-member-designator:
7753 id-expression
7754 | offsetof-member-designator "." id-expression
7755 | offsetof-member-designator "[" expression "]"
7756 | offsetof-member-designator "->" id-expression */
7758 static tree
7760 {
7763 cp_id_kind dummy;
7766 /* We're about to accept non-integral-constant things, but will
7767 definitely yield an integral constant expression. Save and
7768 restore these values around our local parsing. */
7772 /* Consume the "__builtin_offsetof" token. */
7774 /* Consume the opening `('. */
7776 /* Parse the type-id. */
7778 /* Look for the `,'. */
7782 /* Build the (type *)null that begins the traditional offsetof macro. */
7784 tf_warning_or_error);
7786 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
7790 {
7793 {
7795 /* offsetof-member-designator "[" expression "]" */
7800 /* offsetof-member-designator "->" identifier */
7802 /* FALLTHRU */
7805 /* offsetof-member-designator "." identifier */
7813 /* Consume the ")" token. */
7818 /* Error. We know the following require will fail, but
7819 that gives the proper error message. */
7824 }
7825 }
7827 success:
7828 /* If we're processing a template, we can't finish the semantics yet.
7829 Otherwise we can fold the entire expression now. */
7832 else
7835 failure:
7840 }
7842 /* Parse a trait expression.
7844 Returns a representation of the expression, the underlying type
7845 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
7847 static tree
7849 {
7850 cp_trait_kind kind;
7853 cp_decl_specifier_seq decl_specs;
7856 {
7933 }
7935 /* Consume the token. */
7945 /* Build a trivial decl-specifier-seq. */
7949 /* Call grokdeclarator to figure out what type this is. */
7954 {
7962 /* Build a trivial decl-specifier-seq. */
7966 /* Call grokdeclarator to figure out what type this is. */
7969 }
7973 /* Complete the trait expression, which may mean either processing
7974 the trait expr now or saving it for template instantiation. */
7976 {
7985 }
7986 }
7988 /* Lambdas that appear in variable initializer or default argument scope
7989 get that in their mangling, so we need to record it. We might as well
7990 use the count for function and namespace scopes as well. */
7994 {
7995 tree t;
8002 static void
8004 {
8005 tree_int ti;
8007 /* Once we're inside a function, we ignore other scopes and just push
8008 the function again so that popping works properly. */
8015 {
8016 /* Don't reset the count if we're still in the same function. */
8019 }
8020 }
8022 static void
8024 {
8027 }
8029 static void
8031 {
8034 {
8037 }
8039 }
8041 /* Parse a lambda expression.
8043 lambda-expression:
8044 lambda-introducer lambda-declarator [opt] compound-statement
8046 Returns a representation of the expression. */
8048 static tree
8050 {
8052 tree type;
8062 /* We may be in the middle of deferred access check. Disable
8063 it now. */
8074 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8077 /* Now that we've started the type, add the capture fields for any
8078 explicit captures. */
8081 {
8082 /* Inside the class, surrounding template-parameter-lists do not apply. */
8083 unsigned int saved_num_template_parameter_lists
8092 /* By virtue of defining a local class, a lambda expression has access to
8093 the private variables of enclosing classes. */
8102 /* The capture list was built up in reverse order; fix that now. */
8103 {
8109 {
8113 }
8115 }
8125 }
8129 /* This field is only used during parsing of the lambda. */
8132 /* This lambda shouldn't have any proxies left at this point. */
8134 /* And now that we're done, push proxies for an enclosing lambda. */
8139 else
8141 }
8143 /* Parse the beginning of a lambda expression.
8145 lambda-introducer:
8146 [ lambda-capture [opt] ]
8148 LAMBDA_EXPR is the current representation of the lambda expression. */
8150 static void
8152 {
8153 /* Need commas after the first capture. */
8156 /* Eat the leading `['. */
8159 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8167 {
8170 }
8173 {
8175 tree capture_id;
8176 tree capture_init_expr;
8180 enum capture_kind_type
8181 {
8182 BY_COPY,
8183 BY_REFERENCE
8184 };
8188 {
8191 }
8195 else
8198 /* Possibly capture `this'. */
8200 {
8210 explicit_init_p);
8212 }
8214 /* Remember whether we want to capture as a reference or not. */
8216 {
8219 }
8221 /* Get the identifier. */
8226 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8227 delimiters, but I modified this to stop on unnested ']' as well. It
8228 was already changed to stop on unnested '}', so the
8229 "closing_parenthesis" name is no more misleading with my change. */
8230 {
8236 }
8238 /* Find the initializer for this capture. */
8240 {
8241 /* An explicit expression exists. */
8244 "ISO C++ does not allow initializers "
8250 }
8251 else
8252 {
8255 /* Turn the identifier into an id-expression. */
8256 capture_init_expr
8257 = cp_parser_lookup_name
8259 capture_id,
8260 none_type,
8268 {
8271 }
8275 {
8278 capture_init_expr);
8281 }
8284 {
8287 capture_init_expr);
8290 }
8292 capture_init_expr
8293 = finish_id_expression
8295 capture_init_expr,
8307 }
8311 {
8316 capture_id);
8320 "capture of %qD redundant with by-reference capture "
8322 }
8325 capture_id,
8326 capture_init_expr,
8328 explicit_init_p);
8329 }
8332 }
8334 /* Parse the (optional) middle of a lambda expression.
8336 lambda-declarator:
8337 ( parameter-declaration-clause [opt] )
8338 attribute-specifier [opt]
8339 mutable [opt]
8340 exception-specification [opt]
8341 lambda-return-type-clause [opt]
8343 LAMBDA_EXPR is the current representation of the lambda expression. */
8345 static bool
8347 {
8348 /* 5.1.1.4 of the standard says:
8349 If a lambda-expression does not include a lambda-declarator, it is as if
8350 the lambda-declarator were ().
8351 This means an empty parameter list, no attributes, and no exception
8352 specification. */
8356 tree t;
8358 /* The lambda-declarator is optional, but must begin with an opening
8359 parenthesis if present. */
8361 {
8366 /* Parse parameters. */
8369 /* Default arguments shall not be specified in the
8370 parameter-declaration-clause of a lambda-declarator. */
8380 /* Parse optional `mutable' keyword. */
8382 {
8385 }
8387 /* Parse optional exception specification. */
8390 /* Parse optional trailing return type. */
8392 {
8395 }
8397 /* The function parameters must be in scope all the way until after the
8398 trailing-return-type in case of decltype. */
8403 }
8405 /* Create the function call operator.
8407 Messing with declarators like this is no uglier than building up the
8408 FUNCTION_DECL by hand, and this is less likely to get out of sync with
8409 other code. */
8410 {
8411 cp_decl_specifier_seq return_type_specs;
8413 tree fco;
8420 else
8421 /* Maybe we will deduce the return type later. */
8427 sfk_none);
8432 VIRT_SPEC_UNSPECIFIED,
8433 exception_spec,
8438 declarator,
8439 attributes);
8441 {
8444 /* Give the object parameter a different name. */
8446 }
8453 }
8454 }
8456 /* Parse the body of a lambda expression, which is simply
8458 compound-statement
8460 but which requires special handling.
8461 LAMBDA_EXPR is the current representation of the lambda expression. */
8463 static void
8465 {
8470 else
8471 /* Still increment function_depth so that we don't GC in the
8472 middle of an expression. */
8474 /* Clear this in case we're in the middle of a default argument. */
8477 /* Finish the function call operator
8478 - class_specifier
8479 + late_parsing_for_member
8480 + function_definition_after_declarator
8481 + ctor_initializer_opt_and_function_body */
8482 {
8484 tree body;
8486 tree compound_stmt;
8487 tree cap;
8489 /* Let the front end know that we are going to be defining this
8490 function. */
8492 NULL_TREE,
8501 /* Push the proxies for any explicit captures. */
8508 /* 5.1.1.4 of the standard says:
8509 If a lambda-expression does not include a trailing-return-type, it
8510 is as if the trailing-return-type denotes the following type:
8511 * if the compound-statement is of the form
8512 { return attribute-specifier [opt] expression ; }
8513 the type of the returned expression after lvalue-to-rvalue
8514 conversion (_conv.lval_ 4.1), array-to-pointer conversion
8515 (_conv.array_ 4.2), and function-to-pointer conversion
8516 (_conv.func_ 4.3);
8517 * otherwise, void. */
8519 /* In a lambda that has neither a lambda-return-type-clause
8520 nor a deducible form, errors should be reported for return statements
8521 in the body. Since we used void as the placeholder return type, parsing
8522 the body as usual will give such desired behavior. */
8526 {
8530 /* Parse tentatively in case there's more after the initial return
8531 statement. */
8542 {
8546 /* Will get error here if type not deduced yet. */
8550 }
8551 }
8554 {
8559 }
8563 out:
8567 /* Finish the function and generate code for it if necessary. */
8569 }
8574 else
8576 }
8578 /* Statements [gram.stmt.stmt] */
8580 /* Parse a statement.
8582 statement:
8583 labeled-statement
8584 expression-statement
8585 compound-statement
8586 selection-statement
8587 iteration-statement
8588 jump-statement
8589 declaration-statement
8590 try-block
8592 TM Extension:
8594 statement:
8595 atomic-statement
8597 IN_COMPOUND is true when the statement is nested inside a
8598 cp_parser_compound_statement; this matters for certain pragmas.
8600 If IF_P is not NULL, *IF_P is set to indicate whether the statement
8601 is a (possibly labeled) if statement which is not enclosed in braces
8602 and has an else clause. This is used to implement -Wparentheses. */
8604 static void
8607 {
8608 tree statement;
8610 location_t statement_location;
8612 restart:
8615 /* There is no statement yet. */
8617 /* Peek at the next token. */
8619 /* Remember the location of the first token in the statement. */
8621 /* If this is a keyword, then that will often determine what kind of
8622 statement we have. */
8624 {
8628 {
8631 /* Looks like a labeled-statement with a case label.
8632 Parse the label, and then use tail recursion to parse
8633 the statement. */
8655 /* Objective-C++ exception-handling constructs. */
8669 /* This must be a namespace alias definition. */
8682 /* It might be a keyword like `int' that can start a
8683 declaration-statement. */
8685 }
8686 }
8688 {
8689 /* If the next token is a `:', then we are looking at a
8690 labeled-statement. */
8693 {
8694 /* Looks like a labeled-statement with an ordinary label.
8695 Parse the label, and then use tail recursion to parse
8696 the statement. */
8699 }
8700 }
8701 /* Anything that starts with a `{' must be a compound-statement. */
8704 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
8705 a statement all its own. */
8707 {
8708 /* Only certain OpenMP pragmas are attached to statements, and thus
8709 are considered statements themselves. All others are not. In
8710 the context of a compound, accept the pragma as a "statement" and
8711 return so that we can check for a close brace. Otherwise we
8712 require a real statement and must go back and read one. */
8718 }
8720 {
8723 }
8725 /* Everything else must be a declaration-statement or an
8726 expression-statement. Try for the declaration-statement
8727 first, unless we are looking at a `;', in which case we know that
8728 we have an expression-statement. */
8730 {
8732 {
8734 /* Try to parse the declaration-statement. */
8736 /* If that worked, we're done. */
8739 }
8740 /* Look for an expression-statement instead. */
8742 }
8744 /* Set the line number for the statement. */
8747 }
8749 /* Parse the label for a labeled-statement, i.e.
8751 identifier :
8752 case constant-expression :
8753 default :
8755 GNU Extension:
8756 case constant-expression ... constant-expression : statement
8758 When a label is parsed without errors, the label is added to the
8759 parse tree by the finish_* functions, so this function doesn't
8760 have to return the label. */
8762 static void
8764 {
8769 /* The next token should be an identifier. */
8773 {
8776 }
8780 {
8782 {
8786 /* Consume the `case' token. */
8788 /* Parse the constant-expression. */
8791 NULL);
8795 {
8796 /* Consume the `...' token. */
8798 expr_hi =
8801 NULL);
8802 /* We don't need to emit warnings here, as the common code
8803 will do this for us. */
8804 }
8805 else
8810 else
8813 expr);
8814 }
8818 /* Consume the `default' token. */
8823 else
8828 /* Anything else must be an ordinary label. */
8831 }
8833 /* Require the `:' token. */
8836 /* An ordinary label may optionally be followed by attributes.
8837 However, this is only permitted if the attributes are then
8838 followed by a semicolon. This is because, for backward
8839 compatibility, when parsing
8840 lab: __attribute__ ((unused)) int i;
8841 we want the attribute to attach to "i", not "lab". */
8844 {
8845 tree attrs;
8853 ;
8854 else
8856 }
8859 }
8861 /* Parse an expression-statement.
8863 expression-statement:
8864 expression [opt] ;
8866 Returns the new EXPR_STMT -- or NULL_TREE if the expression
8867 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
8868 indicates whether this expression-statement is part of an
8869 expression statement. */
8871 static tree
8873 {
8877 /* If the next token is a ';', then there is no expression
8878 statement. */
8882 /* Give a helpful message for "A<T>::type t;" and the like. */
8885 {
8892 {
8893 /* A::A a; */
8898 }
8899 }
8901 /* Consume the final `;'. */
8906 /* This is the final expression statement of a statement
8907 expression. */
8911 else
8915 }
8917 /* Parse a compound-statement.
8919 compound-statement:
8920 { statement-seq [opt] }
8922 GNU extension:
8924 compound-statement:
8925 { label-declaration-seq [opt] statement-seq [opt] }
8927 label-declaration-seq:
8928 label-declaration
8929 label-declaration-seq label-declaration
8931 Returns a tree representing the statement. */
8933 static tree
8936 {
8937 tree compound_stmt;
8939 /* Consume the `{'. */
8946 /* Begin the compound-statement. */
8948 /* If the next keyword is `__label__' we have a label declaration. */
8951 /* Parse an (optional) statement-seq. */
8953 /* Finish the compound-statement. */
8955 /* Consume the `}'. */
8959 }
8961 /* Parse an (optional) statement-seq.
8963 statement-seq:
8964 statement
8965 statement-seq [opt] statement */
8967 static void
8969 {
8970 /* Scan statements until there aren't any more. */
8972 {
8975 /* If we are looking at a `}', then we have run out of
8976 statements; the same is true if we have reached the end
8977 of file, or have stumbled upon a stray '@end'. */
8984 /* If we are in a compound statement and find 'else' then
8985 something went wrong. */
8987 {
8990 else
8991 {
8994 }
8995 }
8997 /* Parse the statement. */
8999 }
9000 }
9002 /* Parse a selection-statement.
9004 selection-statement:
9005 if ( condition ) statement
9006 if ( condition ) statement else statement
9007 switch ( condition ) statement
9009 Returns the new IF_STMT or SWITCH_STMT.
9011 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9012 is a (possibly labeled) if statement which is not enclosed in
9013 braces and has an else clause. This is used to implement
9014 -Wparentheses. */
9016 static tree
9018 {
9025 /* Peek at the next token. */
9028 /* See what kind of keyword it is. */
9031 {
9034 {
9035 tree statement;
9036 tree condition;
9038 /* Look for the `('. */
9040 {
9043 }
9045 /* Begin the selection-statement. */
9048 else
9051 /* Parse the condition. */
9053 /* Look for the `)'. */
9059 {
9063 /* Add the condition. */
9066 /* Parse the then-clause. */
9070 {
9078 }
9079 else
9085 /* If the next token is `else', parse the else-clause. */
9087 RID_ELSE))
9088 {
9089 /* Consume the `else' keyword. */
9092 /* Parse the else-clause. */
9094 {
9095 location_t loc;
9102 }
9103 else
9108 /* If we are currently parsing a then-clause, then
9109 IF_P will not be NULL. We set it to true to
9110 indicate that this if statement has an else clause.
9111 This may trigger the Wparentheses warning below
9112 when we get back up to the parent if statement. */
9115 }
9116 else
9117 {
9118 /* This if statement does not have an else clause. If
9119 NESTED_IF is true, then the then-clause is an if
9120 statement which does have an else clause. We warn
9121 about the potential ambiguity. */
9124 "suggest explicit braces to avoid ambiguous"
9126 }
9128 /* Now we're all done with the if-statement. */
9130 }
9131 else
9132 {
9136 /* Add the condition. */
9139 /* Parse the body of the switch-statement. */
9148 /* Now we're all done with the switch-statement. */
9150 }
9153 }
9159 }
9160 }
9162 /* Parse a condition.
9164 condition:
9165 expression
9166 type-specifier-seq declarator = initializer-clause
9167 type-specifier-seq declarator braced-init-list
9169 GNU Extension:
9171 condition:
9172 type-specifier-seq declarator asm-specification [opt]
9173 attributes [opt] = assignment-expression
9175 Returns the expression that should be tested. */
9177 static tree
9179 {
9180 cp_decl_specifier_seq type_specifiers;
9184 /* Try the declaration first. */
9186 /* New types are not allowed in the type-specifier-seq for a
9187 condition. */
9189 parser->type_definition_forbidden_message
9191 /* Parse the type-specifier-seq. */
9193 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9196 /* Restore the saved message. */
9198 /* If all is well, we might be looking at a declaration. */
9200 {
9201 tree decl;
9202 tree asm_specification;
9203 tree attributes;
9207 /* Parse the declarator. */
9212 /* Parse the attributes. */
9214 /* Parse the asm-specification. */
9216 /* If the next token is not an `=' or '{', then we might still be
9217 looking at an expression. For example:
9219 if (A(a).x)
9221 looks like a decl-specifier-seq and a declarator -- but then
9222 there is no `=', so this is an expression. */
9227 /* If we did see an `=' or '{', then we are looking at a declaration
9228 for sure. */
9230 {
9231 tree pushed_scope;
9235 /* Create the declaration. */
9241 /* Parse the initializer. */
9243 {
9247 }
9248 else
9249 {
9250 /* Consume the `='. */
9253 }
9257 /* Process the initializer. */
9260 asm_specification,
9261 flags);
9267 }
9268 }
9269 /* If we didn't even get past the declarator successfully, we are
9270 definitely not looking at a declaration. */
9271 else
9274 /* Otherwise, we are looking at an expression. */
9276 }
9278 /* Parses a for-statement or range-for-statement until the closing ')',
9279 not included. */
9281 static tree
9283 {
9287 /* Begin the for-statement. */
9290 /* Parse the initialization. */
9295 else
9297 }
9299 static tree
9301 {
9302 /* Normal for loop */
9305 tree stmt;
9308 /* The for-init-statement has already been parsed in
9309 cp_parser_for_init_statement, so no work is needed here. */
9312 /* If there's a condition, process it. */
9316 /* Look for the `;'. */
9319 /* If there's an expression, process it. */
9325 }
9327 /* Tries to parse a range-based for-statement:
9329 range-based-for:
9330 decl-specifier-seq declarator : expression
9332 The decl-specifier-seq declarator and the `:' are already parsed by
9333 cp_parser_for_init_statement. If processing_template_decl it returns a
9334 newly created RANGE_FOR_STMT; if not, it is converted to a
9335 regular FOR_STMT. */
9337 static tree
9339 {
9343 {
9346 }
9347 else
9350 /* If in template, STMT is converted to a normal for-statement
9351 at instantiation. If not, it is done just ahead. */
9353 {
9359 /* do_auto_deduction doesn't mess with template init-lists. */
9362 }
9363 else
9364 {
9367 }
9369 }
9371 /* Subroutine of cp_convert_range_for: given the initializer expression,
9372 builds up the range temporary. */
9374 static tree
9376 {
9379 /* Find out the type deduced by the declaration
9380 `auto &&__range = range_expr'. */
9385 /* Create the __range variable. */
9392 }
9394 /* Used by cp_parser_range_for in template context: we aren't going to
9395 do a full conversion yet, but we still need to resolve auto in the
9396 type of the for-range-declaration if present. This is basically
9397 a shortcut version of cp_convert_range_for. */
9399 static void
9401 {
9404 {
9407 iter_type = (cp_parser_perform_range_for_lookup
9411 tf_warning_or_error);
9414 }
9415 }
9417 /* Converts a range-based for-statement into a normal
9418 for-statement, as per the definition.
9420 for (RANGE_DECL : RANGE_EXPR)
9421 BLOCK
9423 should be equivalent to:
9425 {
9426 auto &&__range = RANGE_EXPR;
9427 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
9428 __begin != __end;
9429 ++__begin)
9430 {
9431 RANGE_DECL = *__begin;
9432 BLOCK
9433 }
9434 }
9436 If RANGE_EXPR is an array:
9437 BEGIN_EXPR = __range
9438 END_EXPR = __range + ARRAY_SIZE(__range)
9439 Else if RANGE_EXPR has a member 'begin' or 'end':
9440 BEGIN_EXPR = __range.begin()
9441 END_EXPR = __range.end()
9442 Else:
9443 BEGIN_EXPR = begin(__range)
9444 END_EXPR = end(__range);
9446 If __range has a member 'begin' but not 'end', or vice versa, we must
9447 still use the second alternative (it will surely fail, however).
9448 When calling begin()/end() in the third alternative we must use
9449 argument dependent lookup, but always considering 'std' as an associated
9450 namespace. */
9452 tree
9454 {
9460 /* If an error happened previously do nothing or else a lot of
9461 unhelpful errors would be issued. */
9463 else
9464 {
9469 LOOKUP_ONLYCONVERTING);
9474 }
9476 /* The new for initialization statement. */
9484 LOOKUP_ONLYCONVERTING);
9493 LOOKUP_ONLYCONVERTING);
9497 /* The new for condition. */
9504 /* The new increment expression. */
9508 /* The declaration is initialized with *__begin inside the loop body. */
9512 LOOKUP_ONLYCONVERTING);
9515 }
9517 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
9518 We need to solve both at the same time because the method used
9519 depends on the existence of members begin or end.
9520 Returns the type deduced for the iterator expression. */
9522 static tree
9524 {
9526 {
9529 }
9532 {
9537 }
9539 {
9540 /* If RANGE is an array, we will use pointer arithmetic. */
9543 range,
9547 }
9548 else
9549 {
9550 /* If it is not an array, we must do a bit of magic. */
9560 tf_warning_or_error);
9563 tf_warning_or_error);
9566 {
9567 /* Use the member functions. */
9570 else
9576 else
9579 }
9580 else
9581 {
9582 /* Use global functions with ADL. */
9590 tf_warning_or_error);
9592 tf_warning_or_error);
9595 tf_warning_or_error);
9597 tf_warning_or_error);
9600 }
9602 /* Last common checks. */
9604 {
9605 /* If one of the expressions is an error do no more checks. */
9608 }
9609 else
9610 {
9612 /* The unqualified type of the __begin and __end temporaries should
9613 be the same, as required by the multiple auto declaration. */
9619 }
9620 }
9621 }
9623 /* Helper function for cp_parser_perform_range_for_lookup.
9624 Builds a tree for RANGE.IDENTIFIER(). */
9626 static tree
9628 {
9641 tf_warning_or_error);
9644 }
9646 /* Parse an iteration-statement.
9648 iteration-statement:
9649 while ( condition ) statement
9650 do statement while ( expression ) ;
9651 for ( for-init-statement condition [opt] ; expression [opt] )
9652 statement
9654 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
9656 static tree
9658 {
9661 tree statement;
9664 /* Peek at the next token. */
9669 /* Remember whether or not we are already within an iteration
9670 statement. */
9673 /* See what kind of keyword it is. */
9676 {
9678 {
9679 tree condition;
9681 /* Begin the while-statement. */
9683 /* Look for the `('. */
9685 /* Parse the condition. */
9688 /* Look for the `)'. */
9690 /* Parse the dependent statement. */
9694 /* We're done with the while-statement. */
9696 }
9700 {
9701 tree expression;
9703 /* Begin the do-statement. */
9705 /* Parse the body of the do-statement. */
9710 /* Look for the `while' keyword. */
9712 /* Look for the `('. */
9714 /* Parse the expression. */
9716 /* We're done with the do-statement. */
9718 /* Look for the `)'. */
9720 /* Look for the `;'. */
9722 }
9726 {
9727 /* Look for the `('. */
9732 /* Look for the `)'. */
9735 /* Parse the body of the for-statement. */
9740 /* We're done with the for-statement. */
9742 }
9749 }
9752 }
9754 /* Parse a for-init-statement or the declarator of a range-based-for.
9755 Returns true if a range-based-for declaration is seen.
9757 for-init-statement:
9758 expression-statement
9759 simple-declaration */
9761 static bool
9763 {
9764 /* If the next token is a `;', then we have an empty
9765 expression-statement. Grammatically, this is also a
9766 simple-declaration, but an invalid one, because it does not
9767 declare anything. Therefore, if we did not handle this case
9768 specially, we would issue an error message about an invalid
9769 declaration. */
9771 {
9777 /* We're going to speculatively look for a declaration, falling back
9778 to an expression, if necessary. */
9780 /* Parse the declaration. */
9783 decl);
9786 {
9787 /* It is a range-for, consume the ':' */
9791 {
9793 "range-based %<for%> loops are not allowed "
9796 }
9797 }
9798 else
9799 /* The ';' is not consumed yet because we told
9800 cp_parser_simple_declaration not to. */
9805 /* If the tentative parse failed, then we shall need to look for an
9806 expression-statement. */
9807 }
9808 /* If we are here, it is an expression-statement. */
9811 }
9813 /* Parse a jump-statement.
9815 jump-statement:
9816 break ;
9817 continue ;
9818 return expression [opt] ;
9819 return braced-init-list ;
9820 goto identifier ;
9822 GNU extension:
9824 jump-statement:
9825 goto * expression ;
9827 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
9829 static tree
9831 {
9837 /* Peek at the next token. */
9842 /* See what kind of keyword it is. */
9845 {
9849 {
9864 }
9870 {
9883 }
9888 {
9889 tree expr;
9893 {
9896 }
9899 else
9900 /* If the next token is a `;', then there is no
9901 expression. */
9903 /* Build the return-statement. */
9905 /* Look for the final `;'. */
9907 }
9911 /* Create the goto-statement. */
9913 {
9914 /* Issue a warning about this use of a GNU extension. */
9916 /* Consume the '*' token. */
9918 /* Parse the dependent expression. */
9920 }
9921 else
9923 /* Look for the final `;'. */
9930 }
9933 }
9935 /* Parse a declaration-statement.
9937 declaration-statement:
9938 block-declaration */
9940 static void
9942 {
9945 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
9948 /* Parse the block-declaration. */
9951 /* Free any declarators allocated. */
9954 /* Finish off the statement. */
9956 }
9958 /* Some dependent statements (like `if (cond) statement'), are
9959 implicitly in their own scope. In other words, if the statement is
9960 a single statement (as opposed to a compound-statement), it is
9961 none-the-less treated as if it were enclosed in braces. Any
9962 declarations appearing in the dependent statement are out of scope
9963 after control passes that point. This function parses a statement,
9964 but ensures that is in its own scope, even if it is not a
9965 compound-statement.
9967 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9968 is a (possibly labeled) if statement which is not enclosed in
9969 braces and has an else clause. This is used to implement
9970 -Wparentheses.
9972 Returns the new statement. */
9974 static tree
9976 {
9977 tree statement;
9982 /* Mark if () ; with a special NOP_EXPR. */
9984 {
9988 }
9989 /* if a compound is opened, we simply parse the statement directly. */
9992 /* If the token is not a `{', then we must take special action. */
9993 else
9994 {
9995 /* Create a compound-statement. */
9997 /* Parse the dependent-statement. */
9999 /* Finish the dummy compound-statement. */
10001 }
10003 /* Return the statement. */
10005 }
10007 /* For some dependent statements (like `while (cond) statement'), we
10008 have already created a scope. Therefore, even if the dependent
10009 statement is a compound-statement, we do not want to create another
10010 scope. */
10012 static void
10014 {
10015 /* If the token is a `{', then we must take special action. */
10018 else
10019 {
10020 /* Avoid calling cp_parser_compound_statement, so that we
10021 don't create a new scope. Do everything else by hand. */
10023 /* If the next keyword is `__label__' we have a label declaration. */
10026 /* Parse an (optional) statement-seq. */
10029 }
10030 }
10032 /* Declarations [gram.dcl.dcl] */
10034 /* Parse an optional declaration-sequence.
10036 declaration-seq:
10037 declaration
10038 declaration-seq declaration */
10040 static void
10042 {
10044 {
10055 {
10056 /* A declaration consisting of a single semicolon is
10057 invalid. Allow it unless we're being pedantic. */
10062 }
10064 /* If we're entering or exiting a region that's implicitly
10065 extern "C", modify the lang context appropriately. */
10067 {
10070 }
10072 {
10075 }
10078 {
10079 /* A top-level declaration can consist solely of a #pragma.
10080 A nested declaration cannot, so this is done here and not
10081 in cp_parser_declaration. (A #pragma at block scope is
10082 handled in cp_parser_statement.) */
10085 }
10087 /* Parse the declaration itself. */
10089 }
10090 }
10092 /* Parse a declaration.
10094 declaration:
10095 block-declaration
10096 function-definition
10097 template-declaration
10098 explicit-instantiation
10099 explicit-specialization
10100 linkage-specification
10101 namespace-definition
10103 GNU extension:
10105 declaration:
10106 __extension__ declaration */
10108 static void
10110 {
10111 cp_token token1;
10112 cp_token token2;
10117 /* Check for the `__extension__' keyword. */
10119 {
10120 /* Parse the qualified declaration. */
10122 /* Restore the PEDANTIC flag. */
10126 }
10128 /* Try to figure out what kind of declaration is present. */
10133 else
10134 {
10137 }
10139 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10142 /* If the next token is `extern' and the following token is a string
10143 literal, then we have a linkage specification. */
10147 /* If the next token is `template', then we have either a template
10148 declaration, an explicit instantiation, or an explicit
10149 specialization. */
10151 {
10152 /* `template <>' indicates a template specialization. */
10156 /* `template <' indicates a template declaration. */
10159 /* Anything else must be an explicit instantiation. */
10160 else
10162 }
10163 /* If the next token is `export', then we have a template
10164 declaration. */
10167 /* If the next token is `extern', 'static' or 'inline' and the one
10168 after that is `template', we have a GNU extended explicit
10169 instantiation directive. */
10176 /* If the next token is `namespace', check for a named or unnamed
10177 namespace definition. */
10183 /* An unnamed namespace definition. */
10187 /* An inline (associated) namespace definition. */
10191 /* Objective-C++ declaration/definition. */
10198 /* We must have either a block declaration or a function
10199 definition. */
10200 else
10201 /* Try to parse a block-declaration, or a function-definition. */
10204 /* Free any declarators allocated. */
10206 }
10208 /* Parse a block-declaration.
10210 block-declaration:
10211 simple-declaration
10212 asm-definition
10213 namespace-alias-definition
10214 using-declaration
10215 using-directive
10217 GNU Extension:
10219 block-declaration:
10220 __extension__ block-declaration
10222 C++0x Extension:
10224 block-declaration:
10225 static_assert-declaration
10227 If STATEMENT_P is TRUE, then this block-declaration is occurring as
10228 part of a declaration-statement. */
10230 static void
10233 {
10237 /* Check for the `__extension__' keyword. */
10239 {
10240 /* Parse the qualified declaration. */
10242 /* Restore the PEDANTIC flag. */
10246 }
10248 /* Peek at the next token to figure out which kind of declaration is
10249 present. */
10252 /* If the next keyword is `asm', we have an asm-definition. */
10254 {
10258 }
10259 /* If the next keyword is `namespace', we have a
10260 namespace-alias-definition. */
10263 /* If the next keyword is `using', we have a
10264 using-declaration, a using-directive, or an alias-declaration. */
10266 {
10271 /* If the token after `using' is `namespace', then we have a
10272 using-directive. */
10276 /* If the second token after 'using' is '=', then we have an
10277 alias-declaration. */
10284 /* Otherwise, it's a using-declaration. */
10285 else
10288 }
10289 /* If the next keyword is `__label__' we have a misplaced label
10290 declaration. */
10292 {
10296 /* If the next token is now a `;', consume it. */
10299 }
10300 /* If the next token is `static_assert' we have a static assertion. */
10303 /* Anything else must be a simple-declaration. */
10304 else
10307 }
10309 /* Parse a simple-declaration.
10311 simple-declaration:
10312 decl-specifier-seq [opt] init-declarator-list [opt] ;
10314 init-declarator-list:
10315 init-declarator
10316 init-declarator-list , init-declarator
10318 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
10319 function-definition as a simple-declaration.
10321 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
10322 parsed declaration if it is an uninitialized single declarator not followed
10323 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
10324 if present, will not be consumed. */
10326 static void
10330 {
10331 cp_decl_specifier_seq decl_specifiers;
10338 /* Defer access checks until we know what is being declared; the
10339 checks for names appearing in the decl-specifier-seq should be
10340 done as if we were in the scope of the thing being declared. */
10343 /* Parse the decl-specifier-seq. We have to keep track of whether
10344 or not the decl-specifier-seq declares a named class or
10345 enumeration type, since that is the only case in which the
10346 init-declarator-list is allowed to be empty.
10348 [dcl.dcl]
10350 In a simple-declaration, the optional init-declarator-list can be
10351 omitted only when declaring a class or enumeration, that is when
10352 the decl-specifier-seq contains either a class-specifier, an
10353 elaborated-type-specifier, or an enum-specifier. */
10355 CP_PARSER_FLAGS_OPTIONAL,
10358 /* We no longer need to defer access checks. */
10361 /* In a block scope, a valid declaration must always have a
10362 decl-specifier-seq. By not trying to parse declarators, we can
10363 resolve the declaration/expression ambiguity more quickly. */
10366 {
10369 }
10371 /* If the next two tokens are both identifiers, the code is
10372 erroneous. The usual cause of this situation is code like:
10374 T t;
10376 where "T" should name a type -- but does not. */
10379 {
10380 /* If parsing tentatively, we should commit; we really are
10381 looking at a declaration. */
10383 /* Give up. */
10385 }
10387 /* If we have seen at least one decl-specifier, and the next token
10388 is not a parenthesis, then we must be looking at a declaration.
10389 (After "int (" we might be looking at a functional cast.) */
10396 /* Keep going until we hit the `;' at the end of the simple
10397 declaration. */
10400 CPP_SEMICOLON))
10401 {
10404 tree decl;
10407 {
10408 /* If we are processing next declarator, coma is expected */
10414 }
10415 else
10418 /* Parse the init-declarator. */
10421 function_definition_allowed_p,
10423 declares_class_or_enum,
10425 maybe_range_for_decl);
10426 /* If an error occurred while parsing tentatively, exit quickly.
10427 (That usually happens when in the body of a function; each
10428 statement is treated as a declaration-statement until proven
10429 otherwise.) */
10432 /* Handle function definitions specially. */
10434 {
10435 /* If the next token is a `,', then we are probably
10436 processing something like:
10438 void f() {}, *p;
10440 which is erroneous. */
10442 {
10445 "mixing"
10447 }
10448 /* Otherwise, we're done with the list of declarators. */
10449 else
10450 {
10453 }
10454 }
10457 /* The next token should be either a `,' or a `;'. */
10459 /* If it's a `,', there are more declarators to come. */
10462 /* If it's a `;', we are done. */
10465 /* Anything else is an error. */
10466 else
10467 {
10468 /* If we have already issued an error message we don't need
10469 to issue another one. */
10473 /* Skip tokens until we reach the end of the statement. */
10475 /* If the next token is now a `;', consume it. */
10479 }
10480 /* After the first time around, a function-definition is not
10481 allowed -- even if it was OK at first. For example:
10483 int i, f() {}
10485 is not valid. */
10487 }
10489 /* Issue an error message if no declarators are present, and the
10490 decl-specifier-seq does not itself declare a class or
10491 enumeration. */
10493 {
10496 /* Perform any deferred access checks. */
10498 }
10500 /* Consume the `;'. */
10504 done:
10506 }
10508 /* Parse a decl-specifier-seq.
10510 decl-specifier-seq:
10511 decl-specifier-seq [opt] decl-specifier
10513 decl-specifier:
10514 storage-class-specifier
10515 type-specifier
10516 function-specifier
10517 friend
10518 typedef
10520 GNU Extension:
10522 decl-specifier:
10523 attributes
10525 Set *DECL_SPECS to a representation of the decl-specifier-seq.
10527 The parser flags FLAGS is used to control type-specifier parsing.
10529 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
10530 flags:
10532 1: one of the decl-specifiers is an elaborated-type-specifier
10533 (i.e., a type declaration)
10534 2: one of the decl-specifiers is an enum-specifier or a
10535 class-specifier (i.e., a type definition)
10537 */
10539 static void
10541 cp_parser_flags flags,
10544 {
10548 /* Clear DECL_SPECS. */
10551 /* Assume no class or enumeration type is declared. */
10554 /* Keep reading specifiers until there are no more to read. */
10556 {
10561 /* Peek at the next token. */
10564 /* Save the first token of the decl spec list for error
10565 reporting. */
10568 /* Handle attributes. */
10570 {
10571 /* Parse the attributes. */
10572 decl_specs->attributes
10576 }
10577 /* Assume we will find a decl-specifier keyword. */
10579 /* If the next token is an appropriate keyword, we can simply
10580 add it to the list. */
10582 {
10583 /* decl-specifier:
10584 friend
10585 constexpr */
10588 {
10591 }
10592 else
10593 {
10595 /* Consume the token. */
10597 }
10605 /* function-specifier:
10606 inline
10607 virtual
10608 explicit */
10615 /* decl-specifier:
10616 typedef */
10619 /* Consume the token. */
10621 /* A constructor declarator cannot appear in a typedef. */
10623 /* The "typedef" keyword can only occur in a declaration; we
10624 may as well commit at this point. */
10631 /* storage-class-specifier:
10632 auto
10633 register
10634 static
10635 extern
10636 mutable
10638 GNU Extension:
10639 thread */
10642 {
10643 /* Consume the token. */
10646 /* Complain about `auto' as a storage specifier, if
10647 we're complaining about C++0x compatibility. */
10651 /* Set the storage class anyway. */
10654 }
10655 else
10656 /* C++0x auto type-specifier. */
10664 /* Consume the token. */
10670 /* Consume the token. */
10676 /* We did not yet find a decl-specifier yet. */
10679 }
10686 /* Constructors are a special case. The `S' in `S()' is not a
10687 decl-specifier; it is the beginning of the declarator. */
10688 constructor_p
10689 = (!found_decl_spec
10690 && constructor_possible_p
10691 && (cp_parser_constructor_declarator_p
10694 /* If we don't have a DECL_SPEC yet, then we must be looking at
10695 a type-specifier. */
10697 {
10700 tree type_spec;
10702 type_spec
10704 decl_specs,
10710 /* If this type-specifier referenced a user-defined type
10711 (a typedef, class-name, etc.), then we can't allow any
10712 more such type-specifiers henceforth.
10714 [dcl.spec]
10716 The longest sequence of decl-specifiers that could
10717 possibly be a type name is taken as the
10718 decl-specifier-seq of a declaration. The sequence shall
10719 be self-consistent as described below.
10721 [dcl.type]
10723 As a general rule, at most one type-specifier is allowed
10724 in the complete decl-specifier-seq of a declaration. The
10725 only exceptions are the following:
10727 -- const or volatile can be combined with any other
10728 type-specifier.
10730 -- signed or unsigned can be combined with char, long,
10731 short, or int.
10733 -- ..
10735 Example:
10737 typedef char* Pc;
10738 void g (const int Pc);
10740 Here, Pc is *not* part of the decl-specifier seq; it's
10741 the declarator. Therefore, once we see a type-specifier
10742 (other than a cv-qualifier), we forbid any additional
10743 user-defined types. We *do* still allow things like `int
10744 int' to be considered a decl-specifier-seq, and issue the
10745 error message later. */
10748 /* A constructor declarator cannot follow a type-specifier. */
10750 {
10755 }
10756 }
10758 /* If we still do not have a DECL_SPEC, then there are no more
10759 decl-specifiers. */
10764 /* After we see one decl-specifier, further decl-specifiers are
10765 always optional. */
10767 }
10771 /* Don't allow a friend specifier with a class definition. */
10776 }
10778 /* Parse an (optional) storage-class-specifier.
10780 storage-class-specifier:
10781 auto
10782 register
10783 static
10784 extern
10785 mutable
10787 GNU Extension:
10789 storage-class-specifier:
10790 thread
10792 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
10794 static tree
10796 {
10798 {
10802 /* Fall through for C++98. */
10809 /* Consume the token. */
10814 }
10815 }
10817 /* Parse an (optional) function-specifier.
10819 function-specifier:
10820 inline
10821 virtual
10822 explicit
10824 Returns an IDENTIFIER_NODE corresponding to the keyword used.
10825 Updates DECL_SPECS, if it is non-NULL. */
10827 static tree
10830 {
10833 {
10840 /* 14.5.2.3 [temp.mem]
10842 A member function template shall not be virtual. */
10856 }
10858 /* Consume the token. */
10860 }
10862 /* Parse a linkage-specification.
10864 linkage-specification:
10865 extern string-literal { declaration-seq [opt] }
10866 extern string-literal declaration */
10868 static void
10870 {
10871 tree linkage;
10873 /* Look for the `extern' keyword. */
10876 /* Look for the string-literal. */
10879 /* Transform the literal into an identifier. If the literal is a
10880 wide-character string, or contains embedded NULs, then we can't
10881 handle it as the user wants. */
10884 {
10886 /* Assume C++ linkage. */
10888 }
10889 else
10892 /* We're now using the new linkage. */
10895 /* If the next token is a `{', then we're using the first
10896 production. */
10898 {
10899 /* Consume the `{' token. */
10901 /* Parse the declarations. */
10903 /* Look for the closing `}'. */
10905 }
10906 /* Otherwise, there's just one declaration. */
10907 else
10908 {
10911 saved_in_unbraced_linkage_specification_p
10915 parser->in_unbraced_linkage_specification_p
10917 }
10919 /* We're done with the linkage-specification. */
10921 }
10923 /* Parse a static_assert-declaration.
10925 static_assert-declaration:
10926 static_assert ( constant-expression , string-literal ) ;
10928 If MEMBER_P, this static_assert is a class member. */
10930 static void
10932 {
10933 tree condition;
10934 tree message;
10936 location_t saved_loc;
10939 /* Peek at the `static_assert' token so we can keep track of exactly
10940 where the static assertion started. */
10944 /* Look for the `static_assert' keyword. */
10946 RT_STATIC_ASSERT))
10949 /* We know we are in a static assertion; commit to any tentative
10950 parse. */
10954 /* Parse the `(' starting the static assertion condition. */
10957 /* Parse the constant-expression. Allow a non-constant expression
10958 here in order to give better diagnostics in finish_static_assert. */
10959 condition =
10964 /* Parse the separating `,'. */
10967 /* Parse the string-literal message. */
10972 /* A `)' completes the static assertion. */
10979 /* A semicolon terminates the declaration. */
10982 /* Complete the static assertion, which may mean either processing
10983 the static assert now or saving it for template instantiation. */
10985 }
10987 /* Parse a `decltype' type. Returns the type.
10989 simple-type-specifier:
10990 decltype ( expression ) */
10992 static tree
10994 {
10995 tree expr;
11004 {
11005 /* Already parsed. */
11008 }
11010 /* Look for the `decltype' token. */
11014 /* Types cannot be defined in a `decltype' expression. Save away the
11015 old message. */
11018 /* And create the new one. */
11019 parser->type_definition_forbidden_message
11022 /* The restrictions on constant-expressions do not apply inside
11023 decltype expressions. */
11024 saved_integral_constant_expression_p
11026 saved_non_integral_constant_expression_p
11030 /* Do not actually evaluate the expression. */
11033 /* Do not warn about problems with the expression. */
11036 /* Parse the opening `('. */
11040 /* First, try parsing an id-expression. */
11051 {
11054 cp_id_kind idk;
11058 /* Lookup the name we got back from the id-expression. */
11060 none_type,
11074 {
11075 /* Complete lookup of the id-expression. */
11076 expr = (finish_id_expression
11089 /* We found an id-expression, but it was something that we
11090 should not have found. This is an error, not something
11091 we can recover from, so note that we found an
11092 id-expression and we'll recover as gracefully as
11093 possible. */
11095 }
11100 /* We have an id-expression. */
11102 }
11105 {
11106 /* Abort the id-expression parse. */
11109 /* Parsing tentatively, again. */
11112 /* Parse a class member access. */
11120 /* We have an id-expression. */
11122 }
11125 /* We have parsed the complete id-expression or member access. */
11127 else
11128 {
11131 /* Abort our attempt to parse an id-expression or member access
11132 expression. */
11135 /* Within a parenthesized expression, a `>' token is always
11136 the greater-than operator. */
11137 saved_greater_than_is_operator_p
11141 /* Parse a full expression. */
11144 /* The `>' token might be the end of a template-id or
11145 template-parameter-list now. */
11146 parser->greater_than_is_operator_p
11148 }
11150 /* Go back to evaluating expressions. */
11154 /* Restore the old message and the integral constant expression
11155 flags. */
11157 parser->integral_constant_expression_p
11159 parser->non_integral_constant_expression_p
11162 /* Parse to the closing `)'. */
11164 {
11168 }
11171 tf_warning_or_error);
11173 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
11174 it again. */
11181 }
11183 /* Special member functions [gram.special] */
11185 /* Parse a conversion-function-id.
11187 conversion-function-id:
11188 operator conversion-type-id
11190 Returns an IDENTIFIER_NODE representing the operator. */
11192 static tree
11194 {
11195 tree type;
11196 tree saved_scope;
11197 tree saved_qualifying_scope;
11198 tree saved_object_scope;
11201 /* Look for the `operator' token. */
11204 /* When we parse the conversion-type-id, the current scope will be
11205 reset. However, we need that information in able to look up the
11206 conversion function later, so we save it here. */
11210 /* We must enter the scope of the class so that the names of
11211 entities declared within the class are available in the
11212 conversion-type-id. For example, consider:
11214 struct S {
11215 typedef int I;
11216 operator I();
11217 };
11219 S::operator I() { ... }
11221 In order to see that `I' is a type-name in the definition, we
11222 must be in the scope of `S'. */
11225 /* Parse the conversion-type-id. */
11227 /* Leave the scope of the class, if any. */
11230 /* Restore the saved scope. */
11234 /* If the TYPE is invalid, indicate failure. */
11238 }
11240 /* Parse a conversion-type-id:
11242 conversion-type-id:
11243 type-specifier-seq conversion-declarator [opt]
11245 Returns the TYPE specified. */
11247 static tree
11249 {
11250 tree attributes;
11251 cp_decl_specifier_seq type_specifiers;
11253 tree type_specified;
11255 /* Parse the attributes. */
11257 /* Parse the type-specifiers. */
11261 /* If that didn't work, stop. */
11264 /* Parse the conversion-declarator. */
11272 /* Don't give this error when parsing tentatively. This happens to
11273 work because we always parse this definitively once. */
11276 {
11278 {
11281 }
11285 }
11288 }
11290 /* Parse an (optional) conversion-declarator.
11292 conversion-declarator:
11293 ptr-operator conversion-declarator [opt]
11295 */
11299 {
11301 tree class_type;
11302 cp_cv_quals cv_quals;
11304 /* We don't know if there's a ptr-operator next, or not. */
11306 /* Try the ptr-operator. */
11308 /* If it worked, look for more conversion-declarators. */
11310 {
11313 /* Parse another optional declarator. */
11316 return cp_parser_make_indirect_declarator
11318 }
11321 }
11323 /* Parse an (optional) ctor-initializer.
11325 ctor-initializer:
11326 : mem-initializer-list
11328 Returns TRUE iff the ctor-initializer was actually present. */
11330 static bool
11332 {
11333 /* If the next token is not a `:', then there is no
11334 ctor-initializer. */
11336 {
11337 /* Do default initialization of any bases and members. */
11342 }
11344 /* Consume the `:' token. */
11346 /* And the mem-initializer-list. */
11350 }
11352 /* Parse a mem-initializer-list.
11354 mem-initializer-list:
11355 mem-initializer ... [opt]
11356 mem-initializer ... [opt] , mem-initializer-list */
11358 static void
11360 {
11365 /* Let the semantic analysis code know that we are starting the
11366 mem-initializer-list. */
11371 /* Loop through the list. */
11373 {
11374 tree mem_initializer;
11377 /* Parse the mem-initializer. */
11379 /* If the next token is a `...', we're expanding member initializers. */
11381 {
11382 /* Consume the `...'. */
11385 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
11386 can be expanded but members cannot. */
11389 {
11394 }
11396 /* Construct the pack expansion type. */
11399 }
11402 {
11406 }
11407 /* Look for a target constructor. */
11411 {
11414 {
11418 }
11420 }
11421 /* Add it to the list, unless it was erroneous. */
11423 {
11426 }
11427 /* If the next token is not a `,', we're done. */
11430 /* Consume the `,' token. */
11432 }
11434 /* Perform semantic analysis. */
11437 }
11439 /* Parse a mem-initializer.
11441 mem-initializer:
11442 mem-initializer-id ( expression-list [opt] )
11443 mem-initializer-id braced-init-list
11445 GNU extension:
11447 mem-initializer:
11448 ( expression-list [opt] )
11450 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
11451 class) or FIELD_DECL (for a non-static data member) to initialize;
11452 the TREE_VALUE is the expression-list. An empty initialization
11453 list is represented by void_list_node. */
11455 static tree
11457 {
11458 tree mem_initializer_id;
11459 tree expression_list;
11460 tree member;
11463 /* Find out what is being initialized. */
11465 {
11469 }
11470 else
11471 {
11475 }
11481 {
11487 }
11488 else
11489 {
11499 }
11509 }
11511 /* Parse a mem-initializer-id.
11513 mem-initializer-id:
11514 :: [opt] nested-name-specifier [opt] class-name
11515 identifier
11517 Returns a TYPE indicating the class to be initializer for the first
11518 production. Returns an IDENTIFIER_NODE indicating the data member
11519 to be initialized for the second production. */
11521 static tree
11523 {
11527 tree id;
11531 /* `typename' is not allowed in this context ([temp.res]). */
11533 {
11535 "keyword %<typename%> not allowed in this context (a qualified "
11538 }
11539 /* Look for the optional `::' operator. */
11540 global_scope_p
11544 /* Look for the optional nested-name-specifier. The simplest way to
11545 implement:
11547 [temp.res]
11549 The keyword `typename' is not permitted in a base-specifier or
11550 mem-initializer; in these contexts a qualified name that
11551 depends on a template-parameter is implicitly assumed to be a
11552 type name.
11554 is to assume that we have seen the `typename' keyword at this
11555 point. */
11556 nested_name_specifier_p
11565 /* If there is a `::' operator or a nested-name-specifier, then we
11566 are definitely looking for a class-name. */
11571 typename_type,
11575 /* Otherwise, we could also be looking for an ordinary identifier. */
11577 /* Try a class-name. */
11581 none_type,
11585 /* If we found one, we're done. */
11588 /* Otherwise, look for an ordinary identifier. */
11590 }
11592 /* Overloading [gram.over] */
11594 /* Parse an operator-function-id.
11596 operator-function-id:
11597 operator operator
11599 Returns an IDENTIFIER_NODE for the operator which is a
11600 human-readable spelling of the identifier, e.g., `operator +'. */
11602 static tree
11604 {
11605 /* Look for the `operator' keyword. */
11608 /* And then the name of the operator itself. */
11610 }
11612 /* Return an identifier node for a user-defined literal operator.
11613 The suffix identifier is chained to the operator name identifier. */
11615 static tree
11617 {
11618 tree identifier;
11623 /*IDENTIFIER_UDLIT_OPNAME_P (identifier) = 1; If we get a flag someday. */
11626 }
11628 /* Parse an operator.
11630 operator:
11631 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
11632 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
11633 || ++ -- , ->* -> () []
11635 GNU Extensions:
11637 operator:
11638 <? >? <?= >?=
11640 Returns an IDENTIFIER_NODE for the operator which is a
11641 human-readable spelling of the identifier, e.g., `operator +'. */
11643 static tree
11645 {
11649 /* Peek at the next token. */
11651 /* Figure out which operator we have. */
11653 {
11655 {
11658 /* The keyword should be either `new' or `delete'. */
11663 else
11666 /* Consume the `new' or `delete' token. */
11669 /* Peek at the next token. */
11671 /* If it's a `[' token then this is the array variant of the
11672 operator. */
11674 {
11675 /* Consume the `[' token. */
11677 /* Look for the `]' token. */
11681 }
11682 /* Otherwise, we have the non-array variant. */
11683 else
11687 }
11834 /* Consume the `('. */
11836 /* Look for the matching `)'. */
11841 /* Consume the `['. */
11843 /* Look for the matching `]'. */
11851 {
11854 }
11855 /* Consume the string. */
11857 /* Look for the suffix identifier. */
11860 {
11863 {
11866 }
11867 }
11868 else
11869 {
11872 }
11879 /* Anything else is an error. */
11881 }
11883 /* If we have selected an identifier, we need to consume the
11884 operator token. */
11887 /* Otherwise, no valid operator name was present. */
11888 else
11889 {
11892 }
11895 }
11897 /* Parse a template-declaration.
11899 template-declaration:
11900 export [opt] template < template-parameter-list > declaration
11902 If MEMBER_P is TRUE, this template-declaration occurs within a
11903 class-specifier.
11905 The grammar rule given by the standard isn't correct. What
11906 is really meant is:
11908 template-declaration:
11909 export [opt] template-parameter-list-seq
11910 decl-specifier-seq [opt] init-declarator [opt] ;
11911 export [opt] template-parameter-list-seq
11912 function-definition
11914 template-parameter-list-seq:
11915 template-parameter-list-seq [opt]
11916 template < template-parameter-list > */
11918 static void
11920 {
11921 /* Check for `export'. */
11923 {
11924 /* Consume the `export' token. */
11926 /* Warn that we do not support `export'. */
11928 }
11931 }
11933 /* Parse a template-parameter-list.
11935 template-parameter-list:
11936 template-parameter
11937 template-parameter-list , template-parameter
11939 Returns a TREE_LIST. Each node represents a template parameter.
11940 The nodes are connected via their TREE_CHAINs. */
11942 static tree
11944 {
11949 /* The loop below parses the template parms. We first need to know
11950 the total number of template parms to be able to compute proper
11951 canonical types of each dependent type. So after the loop, when
11952 we know the total number of template parms,
11953 end_template_parm_list computes the proper canonical types and
11954 fixes up the dependent types accordingly. */
11956 {
11957 tree parameter;
11960 location_t parm_loc;
11962 /* Parse the template-parameter. */
11967 /* Add it to the list. */
11970 parm_loc,
11971 parameter,
11972 is_non_type,
11973 is_parameter_pack,
11975 else
11976 {
11979 }
11981 /* If the next token is not a `,', we're done. */
11984 /* Otherwise, consume the `,' token. */
11986 }
11989 }
11991 /* Parse a template-parameter.
11993 template-parameter:
11994 type-parameter
11995 parameter-declaration
11997 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
11998 the parameter. The TREE_PURPOSE is the default value, if any.
11999 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
12000 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
12001 set to true iff this parameter is a parameter pack. */
12003 static tree
12006 {
12010 tree parm;
12012 /* Assume it is a type parameter or a template parameter. */
12014 /* Assume it not a parameter pack. */
12016 /* Peek at the next token. */
12018 /* If it is `class' or `template', we have a type-parameter. */
12021 /* If it is `class' or `typename' we do not know yet whether it is a
12022 type parameter or a non-type parameter. Consider:
12024 template <typename T, typename T::X X> ...
12026 or:
12028 template <class C, class D*> ...
12030 Here, the first parameter is a type parameter, and the second is
12031 a non-type parameter. We can tell by looking at the token after
12032 the identifier -- if it is a `,', `=', or `>' then we have a type
12033 parameter. */
12035 {
12036 /* Peek at the token after `class' or `typename'. */
12038 /* If it's an ellipsis, we have a template type parameter
12039 pack. */
12042 /* If it's an identifier, skip it. */
12045 /* Now, see if the token looks like the end of a template
12046 parameter. */
12051 }
12053 /* Otherwise, it is a non-type parameter.
12055 [temp.param]
12057 When parsing a default template-argument for a non-type
12058 template-parameter, the first non-nested `>' is taken as the end
12059 of the template parameter-list rather than a greater-than
12060 operator. */
12062 parameter_declarator
12066 /* If the parameter declaration is marked as a parameter pack, set
12067 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
12068 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
12069 grokdeclarator. */
12073 {
12076 }
12078 /* If the next token is an ellipsis, and we don't already have it
12079 marked as a parameter pack, then we have a parameter pack (that
12080 has no declarator). */
12084 {
12085 /* Consume the `...'. */
12090 }
12091 /* We might end up with a pack expansion as the type of the non-type
12092 template parameter, in which case this is a non-type template
12093 parameter pack. */
12097 {
12101 }
12104 {
12105 /* Parameter packs cannot have default arguments. However, a
12106 user may try to do so, so we'll parse them and give an
12107 appropriate diagnostic here. */
12111 /* Find the name of the parameter pack. */
12120 else
12124 /* Parse the default argument, but throw away the result. */
12126 }
12136 }
12138 /* Parse a type-parameter.
12140 type-parameter:
12141 class identifier [opt]
12142 class identifier [opt] = type-id
12143 typename identifier [opt]
12144 typename identifier [opt] = type-id
12145 template < template-parameter-list > class identifier [opt]
12146 template < template-parameter-list > class identifier [opt]
12147 = id-expression
12149 GNU Extension (variadic templates):
12151 type-parameter:
12152 class ... identifier [opt]
12153 typename ... identifier [opt]
12155 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
12156 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
12157 the declaration of the parameter.
12159 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
12161 static tree
12163 {
12165 tree parameter;
12167 /* Look for a keyword to tell us what kind of parameter this is. */
12173 {
12176 {
12177 tree identifier;
12178 tree default_argument;
12180 /* If the next token is an ellipsis, we have a template
12181 argument pack. */
12183 {
12184 /* Consume the `...' token. */
12189 }
12191 /* If the next token is an identifier, then it names the
12192 parameter. */
12195 else
12198 /* Create the parameter. */
12201 /* If the next token is an `=', we have a default argument. */
12203 {
12204 /* Consume the `=' token. */
12206 /* Parse the default-argument. */
12210 /* Template parameter packs cannot have default
12211 arguments. */
12213 {
12216 "template parameter pack %qD cannot have a "
12218 else
12220 "template parameter packs cannot have "
12223 }
12225 }
12226 else
12229 /* Create the combined representation of the parameter and the
12230 default argument. */
12232 }
12236 {
12237 tree identifier;
12238 tree default_argument;
12240 /* Look for the `<'. */
12242 /* Parse the template-parameter-list. */
12244 /* Look for the `>'. */
12246 /* Look for the `class' keyword. */
12248 /* If the next token is an ellipsis, we have a template
12249 argument pack. */
12251 {
12252 /* Consume the `...' token. */
12257 }
12258 /* If the next token is an `=', then there is a
12259 default-argument. If the next token is a `>', we are at
12260 the end of the parameter-list. If the next token is a `,',
12261 then we are at the end of this parameter. */
12265 {
12267 /* Treat invalid names as if the parameter were nameless. */
12270 }
12271 else
12274 /* Create the template parameter. */
12276 identifier);
12278 /* If the next token is an `=', then there is a
12279 default-argument. */
12281 {
12284 /* Consume the `='. */
12286 /* Parse the id-expression. */
12288 /* save token before parsing the id-expression, for error
12289 reporting */
12291 default_argument
12299 /* If the id-expression was a template-id that refers to
12300 a template-class, we already have the declaration here,
12301 so no further lookup is needed. */
12302 ;
12303 else
12304 /* Look up the name. */
12305 default_argument
12307 none_type,
12313 /* See if the default argument is valid. */
12314 default_argument
12317 /* Template parameter packs cannot have default
12318 arguments. */
12320 {
12323 "template parameter pack %qD cannot "
12325 identifier);
12326 else
12330 }
12332 }
12333 else
12336 /* Create the combined representation of the parameter and the
12337 default argument. */
12339 }
12345 }
12348 }
12350 /* Parse a template-id.
12352 template-id:
12353 template-name < template-argument-list [opt] >
12355 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
12356 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
12357 returned. Otherwise, if the template-name names a function, or set
12358 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
12359 names a class, returns a TYPE_DECL for the specialization.
12361 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
12362 uninstantiated templates. */
12364 static tree
12369 {
12371 tree templ;
12372 tree arguments;
12373 tree template_id;
12380 /* If the next token corresponds to a template-id, there is no need
12381 to reparse it. */
12384 {
12387 /* Get the stored value. */
12389 /* Perform any access checks that were deferred. */
12392 {
12397 }
12398 /* Return the stored value. */
12400 }
12402 /* Avoid performing name lookup if there is no possibility of
12403 finding a template-id. */
12406 && !cp_parser_nth_token_starts_template_argument_list_p
12408 {
12411 }
12413 /* Remember where the template-id starts. */
12419 /* Parse the template-name. */
12422 check_dependency_p,
12423 is_declaration,
12426 {
12429 }
12431 /* If we find the sequence `[:' after a template-name, it's probably
12432 a digraph-typo for `< ::'. Substitute the tokens and check if we can
12433 parse correctly the argument list. */
12440 {
12442 /* Change `:' into `::'. */
12444 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
12445 CPP_LESS. */
12448 /* Parse the arguments. */
12451 {
12452 /* If we couldn't parse an argument list, then we revert our changes
12453 and return simply an error. Maybe this is not a template-id
12454 after all. */
12459 }
12460 /* Otherwise, emit an error about the invalid digraph, but continue
12461 parsing because we got our argument list. */
12464 {
12467 "%<<:%> is an alternate spelling for %<[%>."
12470 {
12474 }
12475 }
12476 }
12477 else
12478 {
12479 /* Look for the `<' that starts the template-argument-list. */
12481 {
12484 }
12485 /* Parse the arguments. */
12487 }
12489 /* Build a representation of the specialization. */
12494 {
12496 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
12497 template (rather than some instantiation thereof) only if
12498 is not nested within some other construct. For example, in
12499 "template <typename T> void f(T) { A<T>::", A<T> is just an
12500 instantiation of A. */
12503 CPP_SCOPE));
12504 template_id
12506 }
12507 else
12508 {
12509 /* If it's not a class-template or a template-template, it should be
12510 a function-template. */
12516 }
12518 /* If parsing tentatively, replace the sequence of tokens that makes
12519 up the template-id with a CPP_TEMPLATE_ID token. That way,
12520 should we re-parse the token stream, we will not have to repeat
12521 the effort required to do the parse, nor will we issue duplicate
12522 error messages about problems during instantiation of the
12523 template. */
12525 {
12528 /* Reset the contents of the START_OF_ID token. */
12530 /* Retrieve any deferred checks. Do not pop this access checks yet
12531 so the memory will not be reclaimed during token replacing below. */
12537 /* Purge all subsequent tokens. */
12540 /* ??? Can we actually assume that, if template_id ==
12541 error_mark_node, we will have issued a diagnostic to the
12542 user, as opposed to simply marking the tentative parse as
12543 failed? */
12546 }
12550 }
12552 /* Parse a template-name.
12554 template-name:
12555 identifier
12557 The standard should actually say:
12559 template-name:
12560 identifier
12561 operator-function-id
12563 A defect report has been filed about this issue.
12565 A conversion-function-id cannot be a template name because they cannot
12566 be part of a template-id. In fact, looking at this code:
12568 a.operator K<int>()
12570 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
12571 It is impossible to call a templated conversion-function-id with an
12572 explicit argument list, since the only allowed template parameter is
12573 the type to which it is converting.
12575 If TEMPLATE_KEYWORD_P is true, then we have just seen the
12576 `template' keyword, in a construction like:
12578 T::template f<3>()
12580 In that case `f' is taken to be a template-name, even though there
12581 is no way of knowing for sure.
12583 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
12584 name refers to a set of overloaded functions, at least one of which
12585 is a template, or an IDENTIFIER_NODE with the name of the template,
12586 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
12587 names are looked up inside uninstantiated templates. */
12589 static tree
12595 {
12596 tree identifier;
12597 tree decl;
12598 tree fns;
12601 /* If the next token is `operator', then we have either an
12602 operator-function-id or a conversion-function-id. */
12604 {
12605 /* We don't know whether we're looking at an
12606 operator-function-id or a conversion-function-id. */
12608 /* Try an operator-function-id. */
12610 /* If that didn't work, try a conversion-function-id. */
12612 {
12615 }
12616 }
12617 /* Look for the identifier. */
12618 else
12621 /* If we didn't find an identifier, we don't have a template-id. */
12625 /* If the name immediately followed the `template' keyword, then it
12626 is a template-name. However, if the next token is not `<', then
12627 we do not treat it as a template-name, since it is not being used
12628 as part of a template-id. This enables us to handle constructs
12629 like:
12631 template <typename T> struct S { S(); };
12632 template <typename T> S<T>::S();
12634 correctly. We would treat `S' as a template -- if it were `S<T>'
12635 -- but we do not if there is no `<'. */
12639 {
12640 /* In a declaration, in a dependent context, we pretend that the
12641 "template" keyword was present in order to improve error
12642 recovery. For example, given:
12644 template <typename T> void f(T::X<int>);
12646 we want to treat "X<int>" as a template-id. */
12648 && !template_keyword_p
12650 && check_dependency_p
12652 /* Do not do this for dtors (or ctors), since they never
12653 need the template keyword before their name. */
12655 {
12658 /* Explain what went wrong. */
12660 identifier);
12663 /* If parsing tentatively, find the location of the "<" token. */
12666 /* Parse the template arguments so that we can issue error
12667 messages about them. */
12670 /* Skip tokens until we find a good place from which to
12671 continue parsing. */
12676 /* If parsing tentatively, permanently remove the
12677 template argument list. That will prevent duplicate
12678 error messages from being issued about the missing
12679 "template" keyword. */
12685 }
12687 /* If the "template" keyword is present, then there is generally
12688 no point in doing name-lookup, so we just return IDENTIFIER.
12689 But, if the qualifying scope is non-dependent then we can
12690 (and must) do name-lookup normally. */
12696 }
12698 /* Look up the name. */
12700 none_type,
12703 check_dependency_p,
12707 /* If DECL is a template, then the name was a template-name. */
12709 ;
12710 else
12711 {
12714 /* The standard does not explicitly indicate whether a name that
12715 names a set of overloaded declarations, some of which are
12716 templates, is a template-name. However, such a name should
12717 be a template-name; otherwise, there is no way to form a
12718 template-id for the overloaded templates. */
12726 {
12727 /* The name does not name a template. */
12730 }
12731 }
12733 /* If DECL is dependent, and refers to a function, then just return
12734 its name; we will look it up again during template instantiation. */
12736 {
12740 }
12743 }
12745 /* Parse a template-argument-list.
12747 template-argument-list:
12748 template-argument ... [opt]
12749 template-argument-list , template-argument ... [opt]
12751 Returns a TREE_VEC containing the arguments. */
12753 static tree
12755 {
12760 tree vec;
12767 /* Even if the template-id appears in an integral
12768 constant-expression, the contents of the argument list do
12769 not. */
12775 /* Parse the arguments. */
12776 do
12777 {
12778 tree argument;
12781 /* Consume the comma. */
12784 /* Parse the template-argument. */
12787 /* If the next token is an ellipsis, we're expanding a template
12788 argument pack. */
12790 {
12792 {
12796 }
12797 /* Consume the `...' token. */
12800 /* Make the argument into a TYPE_PACK_EXPANSION or
12801 EXPR_PACK_EXPANSION. */
12803 }
12806 {
12810 {
12813 }
12814 else
12816 }
12818 }
12831 #ifdef ENABLE_CHECKING
12833 #endif
12835 }
12837 /* Parse a template-argument.
12839 template-argument:
12840 assignment-expression
12841 type-id
12842 id-expression
12844 The representation is that of an assignment-expression, type-id, or
12845 id-expression -- except that the qualified id-expression is
12846 evaluated, so that the value returned is either a DECL or an
12847 OVERLOAD.
12849 Although the standard says "assignment-expression", it forbids
12850 throw-expressions or assignments in the template argument.
12851 Therefore, we use "conditional-expression" instead. */
12853 static tree
12855 {
12856 tree argument;
12861 cp_id_kind idk;
12863 /* There's really no way to know what we're looking at, so we just
12864 try each alternative in order.
12866 [temp.arg]
12868 In a template-argument, an ambiguity between a type-id and an
12869 expression is resolved to a type-id, regardless of the form of
12870 the corresponding template-parameter.
12872 Therefore, we try a type-id first. */
12875 /* If there was no error parsing the type-id but the next token is a
12876 '>>', our behavior depends on which dialect of C++ we're
12877 parsing. In C++98, we probably found a typo for '> >'. But there
12878 are type-id which are also valid expressions. For instance:
12880 struct X { int operator >> (int); };
12881 template <int V> struct Foo {};
12882 Foo<X () >> 5> r;
12884 Here 'X()' is a valid type-id of a function type, but the user just
12885 wanted to write the expression "X() >> 5". Thus, we remember that we
12886 found a valid type-id, but we still try to parse the argument as an
12887 expression to see what happens.
12889 In C++0x, the '>>' will be considered two separate '>'
12890 tokens. */
12894 {
12897 }
12898 else
12899 {
12900 /* If the next token isn't a `,' or a `>', then this argument wasn't
12901 really finished. This means that the argument is not a valid
12902 type-id. */
12905 /* If that worked, we're done. */
12908 }
12909 /* We're still not sure what the argument will be. */
12911 /* Try a template. */
12919 /* If the next token isn't a `,' or a `>', then this argument wasn't
12920 really finished. */
12924 {
12925 /* Figure out what is being referred to. If the id-expression
12926 was for a class template specialization, then we will have a
12927 TYPE_DECL at this point. There is no need to do name lookup
12928 at this point in that case. */
12931 none_type,
12940 }
12943 /* It must be a non-type argument. There permitted cases are given
12944 in [temp.arg.nontype]:
12946 -- an integral constant-expression of integral or enumeration
12947 type; or
12949 -- the name of a non-type template-parameter; or
12951 -- the name of an object or function with external linkage...
12953 -- the address of an object or function with external linkage...
12955 -- a pointer to member... */
12956 /* Look for a non-type template parameter. */
12958 {
12970 }
12972 /* If the next token is "&", the argument must be the address of an
12973 object or function with external linkage. */
12977 /* See if we might have an id-expression. */
12984 {
12987 address_p,
12994 else
12995 {
12996 tree probe;
12999 {
13002 }
13004 /* If we're in a template, we represent a qualified-id referring
13005 to a static data member as a SCOPE_REF even if the scope isn't
13006 dependent so that we can check access control later. */
13011 {
13012 /* A variable without external linkage might still be a
13013 valid constant-expression, so no error is issued here
13014 if the external-linkage check fails. */
13017 }
13019 /* All overloaded functions are allowed; if the external
13020 linkage test does not pass, an error will be issued
13021 later. */
13022 ;
13026 /* A pointer-to-member. */
13027 ;
13029 ;
13030 else
13034 {
13037 tf_warning_or_error);
13039 }
13040 }
13041 }
13042 /* If the argument started with "&", there are no other valid
13043 alternatives at this point. */
13045 {
13048 }
13050 /* If the argument wasn't successfully parsed as a type-id followed
13051 by '>>', the argument can only be a constant expression now.
13052 Otherwise, we try parsing the constant-expression tentatively,
13053 because the argument could really be a type-id. */
13066 /* We did our best to parse the argument as a non type-id, but that
13067 was the only alternative that matched (albeit with a '>' after
13068 it). We can assume it's just a typo from the user, and a
13069 diagnostic will then be issued. */
13071 }
13073 /* Parse an explicit-instantiation.
13075 explicit-instantiation:
13076 template declaration
13078 Although the standard says `declaration', what it really means is:
13080 explicit-instantiation:
13081 template decl-specifier-seq [opt] declarator [opt] ;
13083 Things like `template int S<int>::i = 5, int S<double>::j;' are not
13084 supposed to be allowed. A defect report has been filed about this
13085 issue.
13087 GNU Extension:
13089 explicit-instantiation:
13090 storage-class-specifier template
13091 decl-specifier-seq [opt] declarator [opt] ;
13092 function-specifier template
13093 decl-specifier-seq [opt] declarator [opt] ; */
13095 static void
13097 {
13099 cp_decl_specifier_seq decl_specifiers;
13104 /* Look for an (optional) storage-class-specifier or
13105 function-specifier. */
13107 {
13108 extension_specifier
13111 extension_specifier
13114 }
13116 /* Look for the `template' keyword. */
13118 /* Let the front end know that we are processing an explicit
13119 instantiation. */
13121 /* [temp.explicit] says that we are supposed to ignore access
13122 control while processing explicit instantiation directives. */
13124 /* Parse a decl-specifier-seq. */
13126 CP_PARSER_FLAGS_OPTIONAL,
13129 /* If there was exactly one decl-specifier, and it declared a class,
13130 and there's no declarator, then we have an explicit type
13131 instantiation. */
13133 {
13134 tree type;
13137 /* Turn access control back on for names used during
13138 template instantiation. */
13143 }
13144 else
13145 {
13147 tree decl;
13149 /* Parse the declarator. */
13150 declarator
13160 {
13170 /* Turn access control back on for names used during
13171 template instantiation. */
13173 /* Do the explicit instantiation. */
13175 }
13176 else
13177 {
13179 /* Skip the body of the explicit instantiation. */
13181 }
13182 }
13183 /* We're done with the instantiation. */
13189 }
13191 /* Parse an explicit-specialization.
13193 explicit-specialization:
13194 template < > declaration
13196 Although the standard says `declaration', what it really means is:
13198 explicit-specialization:
13199 template <> decl-specifier [opt] init-declarator [opt] ;
13200 template <> function-definition
13201 template <> explicit-specialization
13202 template <> template-declaration */
13204 static void
13206 {
13210 /* Look for the `template' keyword. */
13212 /* Look for the `<'. */
13214 /* Look for the `>'. */
13216 /* We have processed another parameter list. */
13218 /* [temp]
13220 A template ... explicit specialization ... shall not have C
13221 linkage. */
13223 {
13225 /* Give it C++ linkage to avoid confusing other parts of the
13226 front end. */
13229 }
13230 else
13232 /* Let the front end know that we are beginning a specialization. */
13234 {
13237 }
13239 /* If the next keyword is `template', we need to figure out whether
13240 or not we're looking a template-declaration. */
13242 {
13247 else
13249 }
13250 else
13251 /* Parse the dependent declaration. */
13257 /* We're done with the specialization. */
13259 /* For the erroneous case of a template with C linkage, we pushed an
13260 implicit C++ linkage scope; exit that scope now. */
13263 /* We're done with this parameter list. */
13265 }
13267 /* Parse a type-specifier.
13269 type-specifier:
13270 simple-type-specifier
13271 class-specifier
13272 enum-specifier
13273 elaborated-type-specifier
13274 cv-qualifier
13276 GNU Extension:
13278 type-specifier:
13279 __complex__
13281 Returns a representation of the type-specifier. For a
13282 class-specifier, enum-specifier, or elaborated-type-specifier, a
13283 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
13285 The parser flags FLAGS is used to control type-specifier parsing.
13287 If IS_DECLARATION is TRUE, then this type-specifier is appearing
13288 in a decl-specifier-seq.
13290 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
13291 class-specifier, enum-specifier, or elaborated-type-specifier, then
13292 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
13293 if a type is declared; 2 if it is defined. Otherwise, it is set to
13294 zero.
13296 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
13297 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
13298 is set to FALSE. */
13300 static tree
13302 cp_parser_flags flags,
13307 {
13313 /* Assume this type-specifier does not declare a new type. */
13316 /* And that it does not specify a cv-qualifier. */
13319 /* Peek at the next token. */
13322 /* If we're looking at a keyword, we can use that to guide the
13323 production we choose. */
13326 {
13331 /* Look for the enum-specifier. */
13333 /* If that worked, we're done. */
13335 {
13340 type_spec,
13344 }
13345 else
13348 /* Any of these indicate either a class-specifier, or an
13349 elaborated-type-specifier. */
13356 /* Parse tentatively so that we can back up if we don't find a
13357 class-specifier. */
13359 /* Look for the class-specifier. */
13362 /* If that worked, we're done. */
13364 {
13369 type_spec,
13373 }
13375 /* Fall through. */
13376 elaborated_type_specifier:
13377 /* We're declaring (not defining) a class or enum. */
13381 /* Fall through. */
13383 /* Look for an elaborated-type-specifier. */
13384 type_spec
13385 = (cp_parser_elaborated_type_specifier
13388 is_declaration));
13391 type_spec,
13415 /* The `__complex__' keyword is a GNU extension. */
13421 }
13423 /* Handle simple keywords. */
13425 {
13427 {
13430 }
13432 }
13434 /* If we do not already have a type-specifier, assume we are looking
13435 at a simple-type-specifier. */
13437 decl_specs,
13438 flags);
13440 /* If we didn't find a type-specifier, and a type-specifier was not
13441 optional in this context, issue an error message. */
13443 {
13446 }
13449 }
13451 /* Parse a simple-type-specifier.
13453 simple-type-specifier:
13454 :: [opt] nested-name-specifier [opt] type-name
13455 :: [opt] nested-name-specifier template template-id
13456 char
13457 wchar_t
13458 bool
13459 short
13460 int
13461 long
13462 signed
13463 unsigned
13464 float
13465 double
13466 void
13468 C++0x Extension:
13470 simple-type-specifier:
13471 auto
13472 decltype ( expression )
13473 char16_t
13474 char32_t
13475 __underlying_type ( type-id )
13477 GNU Extension:
13479 simple-type-specifier:
13480 __int128
13481 __typeof__ unary-expression
13482 __typeof__ ( type-id )
13484 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
13485 appropriately updated. */
13487 static tree
13490 cp_parser_flags flags)
13491 {
13495 /* Peek at the next token. */
13498 /* If we're looking at a keyword, things are easy. */
13500 {
13566 /* Since DR 743, decltype can either be a simple-type-specifier by
13567 itself or begin a nested-name-specifier. Parsing it will replace
13568 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
13569 handling below decide what to do. */
13575 /* Consume the `typeof' token. */
13577 /* Parse the operand to `typeof'. */
13579 /* If it is not already a TYPE, take its type. */
13609 }
13611 /* If token is an already-parsed decltype not followed by ::,
13612 it's a simple-type-specifier. */
13615 {
13623 }
13625 /* If the type-specifier was for a built-in type, we're done. */
13627 {
13628 /* Record the type. */
13635 type,
13641 /* Consume the token. */
13644 /* There is no valid C++ program where a non-template type is
13645 followed by a "<". That usually indicates that the user thought
13646 that the type was a template. */
13650 }
13652 /* The type-specifier must be a user-defined type. */
13654 {
13658 /* Don't gobble tokens or issue error messages if this is an
13659 optional type-specifier. */
13663 /* Look for the optional `::' operator. */
13664 global_p
13668 /* Look for the nested-name specifier. */
13669 qualified_p
13677 /* If we have seen a nested-name-specifier, and the next token
13678 is `template', then we are using the template-id production. */
13681 {
13682 /* Look for the template-id. */
13687 /* If the template-id did not name a type, we are out of
13688 luck. */
13690 {
13693 }
13694 }
13695 /* Otherwise, look for a type-name. */
13696 else
13698 /* Keep track of all name-lookups performed in class scopes. */
13700 && !global_p
13701 && !qualified_p
13705 /* If it didn't work out, we don't have a TYPE. */
13713 }
13715 /* If we didn't get a type-name, issue an error message. */
13717 {
13720 }
13723 {
13724 /* See if TYPE is an Objective-C type, and if so, parse and
13725 accept any protocol references following it. Do this before
13726 the cp_parser_check_for_invalid_template_id() call, because
13727 Objective-C types can be followed by '<...>' which would
13728 enclose protocol names rather than template arguments, and so
13729 everything is fine. */
13732 {
13736 /* Clobber the "unqualified" type previously entered into
13737 DECL_SPECS with the new, improved protocol-qualified version. */
13742 }
13744 /* There is no valid C++ program where a non-template type is
13745 followed by a "<". That usually indicates that the user
13746 thought that the type was a template. */
13749 }
13752 }
13754 /* Parse a type-name.
13756 type-name:
13757 class-name
13758 enum-name
13759 typedef-name
13760 simple-template-id [in c++0x]
13762 enum-name:
13763 identifier
13765 typedef-name:
13766 identifier
13768 Returns a TYPE_DECL for the type. */
13770 static tree
13772 {
13773 tree type_decl;
13775 /* We can't know yet whether it is a class-name or not. */
13777 /* Try a class-name. */
13781 none_type,
13785 /* If it's not a class-name, keep looking. */
13787 {
13789 /* It must be a typedef-name or an enum-name. */
13793 /* It is either a simple-template-id representing an
13794 instantiation of an alias template... */
13799 /* Note that this must be an instantiation of an alias template
13800 because [temp.names]/6 says:
13802 A template-id that names an alias template specialization
13803 is a type-name.
13805 Whereas [temp.names]/7 says:
13807 A simple-template-id that names a class template
13808 specialization is a class-name. */
13813 else
13817 /* ... Or a typedef-name or an enum-name. */
13819 }
13822 }
13824 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
13826 enum-name:
13827 identifier
13829 typedef-name:
13830 identifier
13832 Returns a TYPE_DECL for the type. */
13834 static tree
13836 {
13837 tree type_decl;
13838 tree identifier;
13845 /* Look up the type-name. */
13849 {
13853 {
13854 /* We have found a type introduced by a using
13855 declaration at class scope that refers to a dependent
13856 type.
13858 using typename :: [opt] nested-name-specifier unqualified-id ;
13859 */
13865 }
13866 }
13870 {
13871 /* See if this is an Objective-C type. */
13876 }
13878 /* Issue an error if we did not find a type-name. */
13880 /* In Objective-C, we have the complication that class names are
13881 normally type names and start declarations (eg, the
13882 "NSObject" in "NSObject *object;"), but can be used in an
13883 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
13884 is an expression. So, a classname followed by a dot is not a
13885 valid type-name. */
13888 {
13893 }
13894 /* Remember that the name was used in the definition of the
13895 current class so that we can check later to see if the
13896 meaning would have been different after the class was
13897 entirely defined. */
13903 }
13905 /* Parse an elaborated-type-specifier. Note that the grammar given
13906 here incorporates the resolution to DR68.
13908 elaborated-type-specifier:
13909 class-key :: [opt] nested-name-specifier [opt] identifier
13910 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
13911 enum-key :: [opt] nested-name-specifier [opt] identifier
13912 typename :: [opt] nested-name-specifier identifier
13913 typename :: [opt] nested-name-specifier template [opt]
13914 template-id
13916 GNU extension:
13918 elaborated-type-specifier:
13919 class-key attributes :: [opt] nested-name-specifier [opt] identifier
13920 class-key attributes :: [opt] nested-name-specifier [opt]
13921 template [opt] template-id
13922 enum attributes :: [opt] nested-name-specifier [opt] identifier
13924 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
13925 declared `friend'. If IS_DECLARATION is TRUE, then this
13926 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
13927 something is being declared.
13929 Returns the TYPE specified. */
13931 static tree
13935 {
13937 tree identifier;
13940 tree globalscope;
13943 /* See if we're looking at the `enum' keyword. */
13945 {
13946 /* Consume the `enum' token. */
13948 /* Remember that it's an enumeration type. */
13950 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
13951 enums) is used here. */
13954 {
13958 /* Consume the `struct' or `class' and parse it anyway. */
13960 }
13961 /* Parse the attributes. */
13963 }
13964 /* Or, it might be `typename'. */
13966 RID_TYPENAME))
13967 {
13968 /* Consume the `typename' token. */
13970 /* Remember that it's a `typename' type. */
13972 }
13973 /* Otherwise it must be a class-key. */
13974 else
13975 {
13979 /* Parse the attributes. */
13981 }
13983 /* Look for the `::' operator. */
13986 /* Look for the nested-name-specifier. */
13988 {
13993 is_declaration))
13995 }
13996 else
13997 /* Even though `typename' is not present, the proposed resolution
13998 to Core Issue 180 says that in `class A<T>::B', `B' should be
13999 considered a type-name, even if `A<T>' is dependent. */
14004 is_declaration);
14005 /* For everything but enumeration types, consider a template-id.
14006 For an enumeration type, consider only a plain identifier. */
14008 {
14010 tree decl;
14012 /* Allow the `template' keyword. */
14014 /* If we didn't see `template', we don't know if there's a
14015 template-id or not. */
14018 /* Parse the template-id. */
14022 is_declaration);
14023 /* If we didn't find a template-id, look for an ordinary
14024 identifier. */
14026 ;
14027 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
14028 in effect, then we must assume that, upon instantiation, the
14029 template will correspond to a class. */
14033 typename_type,
14035 /* If the `typename' keyword is in effect and DECL is not a type
14036 decl. Then type is non existant. */
14039 else
14042 }
14045 {
14050 {
14053 }
14055 /* For a `typename', we needn't call xref_tag. */
14059 identifier,
14061 /* Look up a qualified name in the usual way. */
14063 {
14064 tree decl;
14065 tree ambiguous_decls;
14068 tag_type,
14075 /* If the lookup was ambiguous, an error will already have been
14076 issued. */
14080 /* If we are parsing friend declaration, DECL may be a
14081 TEMPLATE_DECL tree node here. However, we need to check
14082 whether this TEMPLATE_DECL results in valid code. Consider
14083 the following example:
14085 namespace N {
14086 template <class T> class C {};
14087 }
14088 class X {
14089 template <class T> friend class N::C; // #1, valid code
14090 };
14091 template <class T> class Y {
14092 friend class N::C; // #2, invalid code
14093 };
14095 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
14096 name lookup of `N::C'. We see that friend declaration must
14097 be template for the code to be valid. Note that
14098 processing_template_decl does not work here since it is
14099 always 1 for the above two cases. */
14101 decl = (cp_parser_maybe_treat_template_as_class
14106 {
14109 identifier,
14112 }
14115 {
14119 allow_template);
14123 }
14125 /* Forward declarations of nested types, such as
14127 class C1::C2;
14128 class C1::C2::C3;
14130 are invalid unless all components preceding the final '::'
14131 are complete. If all enclosing types are complete, these
14132 declarations become merely pointless.
14134 Invalid forward declarations of nested types are errors
14135 caught elsewhere in parsing. Those that are pointless arrive
14136 here. */
14143 }
14144 else
14145 {
14146 /* An elaborated-type-specifier sometimes introduces a new type and
14147 sometimes names an existing type. Normally, the rule is that it
14148 introduces a new type only if there is not an existing type of
14149 the same name already in scope. For example, given:
14151 struct S {};
14152 void f() { struct S s; }
14154 the `struct S' in the body of `f' is the same `struct S' as in
14155 the global scope; the existing definition is used. However, if
14156 there were no global declaration, this would introduce a new
14157 local class named `S'.
14159 An exception to this rule applies to the following code:
14161 namespace N { struct S; }
14163 Here, the elaborated-type-specifier names a new type
14164 unconditionally; even if there is already an `S' in the
14165 containing scope this declaration names a new type.
14166 This exception only applies if the elaborated-type-specifier
14167 forms the complete declaration:
14169 [class.name]
14171 A declaration consisting solely of `class-key identifier ;' is
14172 either a redeclaration of the name in the current scope or a
14173 forward declaration of the identifier as a class name. It
14174 introduces the name into the current scope.
14176 We are in this situation precisely when the next token is a `;'.
14178 An exception to the exception is that a `friend' declaration does
14179 *not* name a new type; i.e., given:
14181 struct S { friend struct T; };
14183 `T' is not a new type in the scope of `S'.
14185 Also, `new struct S' or `sizeof (struct S)' never results in the
14186 definition of a new type; a new type can only be declared in a
14187 declaration context. */
14189 tag_scope ts;
14193 /* Friends have special name lookup rules. */
14197 CPP_SEMICOLON))
14198 /* This is a `class-key identifier ;' */
14200 else
14203 template_p =
14207 /* An unqualified name was used to reference this type, so
14208 there were no qualifying templates. */
14215 }
14216 }
14221 /* Allow attributes on forward declarations of classes. */
14223 {
14233 else
14236 }
14239 {
14240 /* Indicate whether this class was declared as a `class' or as a
14241 `struct'. */
14245 }
14247 /* A "<" cannot follow an elaborated type specifier. If that
14248 happens, the user was probably trying to form a template-id. */
14252 }
14254 /* Parse an enum-specifier.
14256 enum-specifier:
14257 enum-head { enumerator-list [opt] }
14258 enum-head { enumerator-list , } [C++0x]
14260 enum-head:
14261 enum-key identifier [opt] enum-base [opt]
14262 enum-key nested-name-specifier identifier enum-base [opt]
14264 enum-key:
14265 enum
14266 enum class [C++0x]
14267 enum struct [C++0x]
14269 enum-base: [C++0x]
14270 : type-specifier-seq
14272 opaque-enum-specifier:
14273 enum-key identifier enum-base [opt] ;
14275 GNU Extensions:
14276 enum-key attributes[opt] identifier [opt] enum-base [opt]
14277 { enumerator-list [opt] }attributes[opt]
14278 enum-key attributes[opt] identifier [opt] enum-base [opt]
14279 { enumerator-list, }attributes[opt] [C++0x]
14281 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
14282 if the token stream isn't an enum-specifier after all. */
14284 static tree
14286 {
14287 tree identifier;
14289 tree prev_scope;
14291 tree attributes;
14304 /* Parse tentatively so that we can back up if we don't find a
14305 enum-specifier. */
14308 /* Caller guarantees that the current token is 'enum', an identifier
14309 possibly follows, and the token after that is an opening brace.
14310 If we don't have an identifier, fabricate an anonymous name for
14311 the enumeration being defined. */
14314 /* Parse the "class" or "struct", which indicates a scoped
14315 enumeration type in C++0x. */
14318 {
14322 /* Consume the `struct' or `class' token. */
14326 }
14330 /* Clear the qualification. */
14335 /* Figure out in what scope the declaration is being placed. */
14341 nested_name_specifier
14349 {
14350 tree name;
14354 enum_type,
14359 input_location);
14361 {
14364 {
14365 /* Are template enums allowed in ISO? */
14369 /* ignore a typename reference, for it will be solved by name
14370 in start_enum. */
14372 }
14373 }
14374 else
14377 }
14378 else
14379 {
14382 else
14383 {
14386 }
14387 }
14390 /* Check for the `:' that denotes a specified underlying type in C++0x.
14391 Note that a ':' could also indicate a bitfield width, however. */
14393 {
14394 cp_decl_specifier_seq type_specifiers;
14396 /* Consume the `:'. */
14399 /* Parse the type-specifier-seq. */
14404 /* At this point this is surely not elaborated type specifier. */
14413 /* If that didn't work, stop. */
14415 {
14420 }
14421 }
14423 /* Look for the `{' but don't consume it yet. */
14425 {
14427 {
14430 {
14433 }
14434 }
14435 /* An opaque-enum-specifier must have a ';' here. */
14438 {
14441 {
14444 }
14445 }
14446 }
14452 {
14454 {
14458 }
14460 {
14462 }
14463 }
14465 /* Issue an error message if type-definitions are forbidden here. */
14468 else
14469 /* Create the new type. We do this before consuming the opening
14470 brace so the enum will be recorded as being on the line of its
14471 tag (or the 'enum' keyword, if there is no tag). */
14475 /* If the next token is not '{' it is an opaque-enum-specifier or an
14476 elaborated-type-specifier. */
14478 {
14481 {
14482 /* The following catches invalid code such as:
14483 enum class S<int>::E { A, B, C }; */
14490 /* If that scope does not contain the scope in which the
14491 class was originally declared, the program is invalid. */
14493 {
14496 "declaration of %qD in namespace %qD which does not "
14499 else
14504 }
14505 }
14510 /* Consume the opening brace. */
14517 {
14521 }
14522 else
14523 {
14528 }
14532 /* If the next token is not '}', then there are some enumerators. */
14536 /* Consume the final '}'. */
14542 }
14543 else
14544 {
14545 /* If a ';' follows, then it is an opaque-enum-specifier
14546 and additional restrictions apply. */
14548 {
14555 }
14556 }
14558 /* Look for trailing attributes to apply to this enumeration, and
14559 apply them if appropriate. */
14561 {
14565 trailing_attr,
14567 }
14569 /* Finish up the enumeration. */
14571 {
14576 }
14579 {
14581 {
14584 }
14586 {
14588 }
14589 }
14590 out:
14593 }
14595 /* Parse an enumerator-list. The enumerators all have the indicated
14596 TYPE.
14598 enumerator-list:
14599 enumerator-definition
14600 enumerator-list , enumerator-definition */
14602 static void
14604 {
14606 {
14607 /* Parse an enumerator-definition. */
14610 /* If the next token is not a ',', we've reached the end of
14611 the list. */
14614 /* Otherwise, consume the `,' and keep going. */
14616 /* If the next token is a `}', there is a trailing comma. */
14618 {
14623 }
14624 }
14625 }
14627 /* Parse an enumerator-definition. The enumerator has the indicated
14628 TYPE.
14630 enumerator-definition:
14631 enumerator
14632 enumerator = constant-expression
14634 enumerator:
14635 identifier */
14637 static void
14639 {
14640 tree identifier;
14641 tree value;
14642 location_t loc;
14644 /* Save the input location because we are interested in the location
14645 of the identifier and not the location of the explicit value. */
14648 /* Look for the identifier. */
14653 /* If the next token is an '=', then there is an explicit value. */
14655 {
14656 /* Consume the `=' token. */
14658 /* Parse the value. */
14661 NULL);
14662 }
14663 else
14666 /* If we are processing a template, make sure the initializer of the
14667 enumerator doesn't contain any bare template parameter pack. */
14671 /* integral_constant_value will pull out this expression, so make sure
14672 it's folded as appropriate. */
14675 /* Create the enumerator. */
14677 }
14679 /* Parse a namespace-name.
14681 namespace-name:
14682 original-namespace-name
14683 namespace-alias
14685 Returns the NAMESPACE_DECL for the namespace. */
14687 static tree
14689 {
14690 tree identifier;
14691 tree namespace_decl;
14695 /* Get the name of the namespace. */
14700 /* Look up the identifier in the currently active scope. Look only
14701 for namespaces, due to:
14703 [basic.lookup.udir]
14705 When looking up a namespace-name in a using-directive or alias
14706 definition, only namespace names are considered.
14708 And:
14710 [basic.lookup.qual]
14712 During the lookup of a name preceding the :: scope resolution
14713 operator, object, function, and enumerator names are ignored.
14715 (Note that cp_parser_qualifying_entity only calls this
14716 function if the token after the name is the scope resolution
14717 operator.) */
14719 none_type,
14725 /* If it's not a namespace, issue an error. */
14728 {
14733 }
14736 }
14738 /* Parse a namespace-definition.
14740 namespace-definition:
14741 named-namespace-definition
14742 unnamed-namespace-definition
14744 named-namespace-definition:
14745 original-namespace-definition
14746 extension-namespace-definition
14748 original-namespace-definition:
14749 namespace identifier { namespace-body }
14751 extension-namespace-definition:
14752 namespace original-namespace-name { namespace-body }
14754 unnamed-namespace-definition:
14755 namespace { namespace-body } */
14757 static void
14759 {
14765 {
14769 }
14770 else
14773 /* Look for the `namespace' keyword. */
14776 /* Get the name of the namespace. We do not attempt to distinguish
14777 between an original-namespace-definition and an
14778 extension-namespace-definition at this point. The semantic
14779 analysis routines are responsible for that. */
14782 else
14785 /* Parse any specified attributes. */
14788 /* Look for the `{' to start the namespace. */
14790 /* Start the namespace. */
14793 /* "inline namespace" is equivalent to a stub namespace definition
14794 followed by a strong using directive. */
14796 {
14798 /* Set up namespace association. */
14802 /* Import the contents of the inline namespace. */
14806 }
14810 /* Parse the body of the namespace. */
14816 /* Finish the namespace. */
14818 /* Look for the final `}'. */
14820 }
14822 /* Parse a namespace-body.
14824 namespace-body:
14825 declaration-seq [opt] */
14827 static void
14829 {
14831 }
14833 /* Parse a namespace-alias-definition.
14835 namespace-alias-definition:
14836 namespace identifier = qualified-namespace-specifier ; */
14838 static void
14840 {
14841 tree identifier;
14842 tree namespace_specifier;
14846 /* Look for the `namespace' keyword. */
14848 /* Look for the identifier. */
14852 /* Look for the `=' token. */
14855 {
14857 /* Skip the definition. */
14862 }
14864 /* Look for the qualified-namespace-specifier. */
14865 namespace_specifier
14867 /* Look for the `;' token. */
14870 /* Register the alias in the symbol table. */
14872 }
14874 /* Parse a qualified-namespace-specifier.
14876 qualified-namespace-specifier:
14877 :: [opt] nested-name-specifier [opt] namespace-name
14879 Returns a NAMESPACE_DECL corresponding to the specified
14880 namespace. */
14882 static tree
14884 {
14885 /* Look for the optional `::'. */
14889 /* Look for the optional nested-name-specifier. */
14897 }
14899 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
14900 access declaration.
14902 using-declaration:
14903 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
14904 using :: unqualified-id ;
14906 access-declaration:
14907 qualified-id ;
14909 */
14911 static bool
14914 {
14918 tree decl;
14919 tree identifier;
14920 tree qscope;
14925 {
14928 }
14929 else
14930 {
14931 /* Look for the `using' keyword. */
14934 /* Peek at the next token. */
14936 /* See if it's `typename'. */
14938 {
14939 /* Remember that we've seen it. */
14941 /* Consume the `typename' token. */
14943 }
14944 }
14946 /* Look for the optional global scope qualification. */
14947 global_scope_p
14952 /* If we saw `typename', or didn't see `::', then there must be a
14953 nested-name-specifier present. */
14959 /* Otherwise, we could be in either of the two productions. In that
14960 case, treat the nested-name-specifier as optional. */
14961 else
14971 /* Something has already gone wrong; there's no need to parse
14972 further. Since an error has occurred, the return value of
14973 cp_parser_parse_definitely will be false, as required. */
14977 /* Parse the unqualified-id. */
14985 {
14990 }
14992 /* The function we call to handle a using-declaration is different
14993 depending on what scope we are in. */
14995 ;
14998 /* [namespace.udecl]
15000 A using declaration shall not name a template-id. */
15003 else
15004 {
15006 {
15007 /* Create the USING_DECL. */
15015 else
15016 /* Add it to the list of members in this class. */
15018 }
15019 else
15020 {
15022 identifier,
15032 else
15034 }
15035 }
15037 /* Look for the final `;'. */
15042 "access declarations are deprecated "
15043 "in favour of using-declarations; "
15047 }
15049 /* Parse an alias-declaration.
15051 alias-declaration:
15052 using identifier attribute-specifier-seq [opt] = type-id */
15054 static tree
15056 {
15058 location_t id_location;
15060 cp_decl_specifier_seq decl_specs;
15064 /* Look for the `using' keyword. */
15077 /* Now we are going to parse the type-id of the declaration. */
15079 /*
15080 [dcl.type]/3 says:
15082 "A type-specifier-seq shall not define a class or enumeration
15083 unless it appears in the type-id of an alias-declaration (7.1.3) that
15084 is not the declaration of a template-declaration."
15086 In other words, if we currently are in an alias template, the
15087 type-id should not define a type.
15089 So let's set parser->type_definition_forbidden_message in that
15090 case; cp_parser_check_type_definition (called by
15091 cp_parser_class_specifier) will then emit an error if a type is
15092 defined in the type-id. */
15094 {
15098 }
15102 /* Restore the error message if need be. */
15111 /* A typedef-name can also be introduced by an alias-declaration. The
15112 identifier following the using keyword becomes a typedef-name. It has
15113 the same semantics as if it were introduced by the typedef
15114 specifier. In particular, it does not define a new type and it shall
15115 not appear in the type-id. */
15130 else
15141 /* If decl is a template, return its TEMPLATE_DECL so that it gets
15142 added into the symbol table; otherwise, return the TYPE_DECL. */
15146 {
15150 }
15153 }
15155 /* Parse a using-directive.
15157 using-directive:
15158 using namespace :: [opt] nested-name-specifier [opt]
15159 namespace-name ; */
15161 static void
15163 {
15164 tree namespace_decl;
15165 tree attribs;
15167 /* Look for the `using' keyword. */
15169 /* And the `namespace' keyword. */
15171 /* Look for the optional `::' operator. */
15173 /* And the optional nested-name-specifier. */
15179 /* Get the namespace being used. */
15181 /* And any specified attributes. */
15183 /* Update the symbol table. */
15185 /* Look for the final `;'. */
15187 }
15189 /* Parse an asm-definition.
15191 asm-definition:
15192 asm ( string-literal ) ;
15194 GNU Extension:
15196 asm-definition:
15197 asm volatile [opt] ( string-literal ) ;
15198 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
15199 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15200 : asm-operand-list [opt] ) ;
15201 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15202 : asm-operand-list [opt]
15203 : asm-clobber-list [opt] ) ;
15204 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
15205 : asm-clobber-list [opt]
15206 : asm-goto-list ) ; */
15208 static void
15210 {
15211 tree string;
15216 tree asm_stmt;
15224 /* Look for the `asm' keyword. */
15226 /* See if the next token is `volatile'. */
15229 {
15230 /* Remember that we saw the `volatile' keyword. */
15232 /* Consume the token. */
15234 }
15238 {
15239 /* Remember that we saw the `goto' keyword. */
15241 /* Consume the token. */
15243 }
15244 /* Look for the opening `('. */
15247 /* Look for the string. */
15250 {
15254 }
15256 /* If we're allowing GNU extensions, check for the extended assembly
15257 syntax. Unfortunately, the `:' tokens need not be separated by
15258 a space in C, and so, for compatibility, we tolerate that here
15259 too. Doing that means that we have to treat the `::' operator as
15260 two `:' tokens. */
15265 {
15270 /* The extended syntax was used. */
15273 /* Look for outputs. */
15275 {
15276 /* Consume the `:'. */
15278 /* Parse the output-operands. */
15280 CPP_COLON)
15282 CPP_SCOPE)
15284 CPP_CLOSE_PAREN)
15290 }
15291 /* If the next token is `::', there are no outputs, and the
15292 next token is the beginning of the inputs. */
15294 /* The inputs are coming next. */
15297 /* Look for inputs. */
15300 {
15301 /* Consume the `:' or `::'. */
15303 /* Parse the output-operands. */
15305 CPP_COLON)
15307 CPP_SCOPE)
15309 CPP_CLOSE_PAREN))
15314 }
15316 /* The clobbers are coming next. */
15319 /* Look for clobbers. */
15322 {
15324 /* Consume the `:' or `::'. */
15326 /* Parse the clobbers. */
15328 CPP_COLON)
15330 CPP_CLOSE_PAREN))
15332 }
15335 /* The labels are coming next. */
15338 /* Look for labels. */
15341 {
15343 /* Consume the `:' or `::'. */
15345 /* Parse the labels. */
15347 }
15351 }
15355 /* Look for the closing `)'. */
15363 {
15364 /* Create the ASM_EXPR. */
15366 {
15369 /* If the extended syntax was not used, mark the ASM_EXPR. */
15371 {
15377 }
15378 }
15379 else
15381 }
15382 }
15384 /* Declarators [gram.dcl.decl] */
15386 /* Parse an init-declarator.
15388 init-declarator:
15389 declarator initializer [opt]
15391 GNU Extension:
15393 init-declarator:
15394 declarator asm-specification [opt] attributes [opt] initializer [opt]
15396 function-definition:
15397 decl-specifier-seq [opt] declarator ctor-initializer [opt]
15398 function-body
15399 decl-specifier-seq [opt] declarator function-try-block
15401 GNU Extension:
15403 function-definition:
15404 __extension__ function-definition
15406 TM Extension:
15408 function-definition:
15409 decl-specifier-seq [opt] declarator function-transaction-block
15411 The DECL_SPECIFIERS apply to this declarator. Returns a
15412 representation of the entity declared. If MEMBER_P is TRUE, then
15413 this declarator appears in a class scope. The new DECL created by
15414 this declarator is returned.
15416 The CHECKS are access checks that should be performed once we know
15417 what entity is being declared (and, therefore, what classes have
15418 befriended it).
15420 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
15421 for a function-definition here as well. If the declarator is a
15422 declarator for a function-definition, *FUNCTION_DEFINITION_P will
15423 be TRUE upon return. By that point, the function-definition will
15424 have been completely parsed.
15426 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
15427 is FALSE.
15429 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15430 parsed declaration if it is an uninitialized single declarator not followed
15431 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15432 if present, will not be consumed. If returned, this declarator will be
15433 created with SD_INITIALIZED but will not call cp_finish_decl. */
15435 static tree
15444 {
15448 tree prefix_attributes;
15449 tree attributes;
15450 tree asm_specification;
15451 tree initializer;
15453 tree scope;
15455 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
15456 initialized with "= ..", CPP_OPEN_PAREN if initialized with
15457 "(...)". */
15466 /* Gather the attributes that were provided with the
15467 decl-specifiers. */
15470 /* Assume that this is not the declarator for a function
15471 definition. */
15475 /* Defer access checks while parsing the declarator; we cannot know
15476 what names are accessible until we know what is being
15477 declared. */
15480 /* Parse the declarator. */
15482 declarator
15486 member_p);
15487 /* Gather up the deferred checks. */
15490 /* If the DECLARATOR was erroneous, there's no need to go
15491 further. */
15495 /* Check that the number of template-parameter-lists is OK. */
15505 /* Figure out what scope the entity declared by the DECLARATOR is
15506 located in. `grokdeclarator' sometimes changes the scope, so
15507 we compute it now. */
15510 /* Perform any lookups in the declared type which were thought to be
15511 dependent, but are not in the scope of the declarator. */
15512 decl_specifiers->type
15515 /* If we're allowing GNU extensions, look for an asm-specification
15516 and attributes. */
15518 {
15519 /* Look for an asm-specification. */
15522 /* And attributes. */
15525 }
15526 else
15527 {
15530 }
15532 /* Peek at the next token. */
15534 /* Check to see if the token indicates the start of a
15535 function-definition. */
15538 {
15540 {
15541 /* If a function-definition should not appear here, issue an
15542 error message. */
15546 }
15547 else
15548 {
15549 location_t func_brace_location
15552 /* Neither attributes nor an asm-specification are allowed
15553 on a function-definition. */
15556 "an asm-specification is not allowed "
15561 /* This is a function-definition. */
15564 /* Parse the function definition. */
15567 decl_specifiers,
15568 declarator,
15569 prefix_attributes);
15570 else
15571 decl
15572 = (cp_parser_function_definition_from_specifiers_and_declarator
15576 {
15577 /* This is where the prologue starts... */
15580 }
15583 }
15584 }
15586 /* [dcl.dcl]
15588 Only in function declarations for constructors, destructors, and
15589 type conversions can the decl-specifier-seq be omitted.
15591 We explicitly postpone this check past the point where we handle
15592 function-definitions because we tolerate function-definitions
15593 that are missing their return types in some modes. */
15595 {
15599 }
15601 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
15605 {
15613 {
15619 }
15620 }
15621 else
15622 {
15623 /* If the init-declarator isn't initialized and isn't followed by a
15624 `,' or `;', it's not a valid init-declarator. */
15627 {
15630 else
15631 {
15634 }
15635 }
15638 }
15640 /* Because start_decl has side-effects, we should only call it if we
15641 know we're going ahead. By this point, we know that we cannot
15642 possibly be looking at any other construct. */
15645 /* If the decl specifiers were bad, issue an error now that we're
15646 sure this was intended to be a declarator. Then continue
15647 declaring the variable(s), as int, to try to cut down on further
15648 errors. */
15651 {
15654 }
15656 /* Check to see whether or not this declaration is a friend. */
15659 /* Enter the newly declared entry in the symbol table. If we're
15660 processing a declaration in a class-specifier, we wait until
15661 after processing the initializer. */
15663 {
15670 /* Adjust location of decl if declarator->id_loc is more appropriate:
15671 set, and decl wasn't merged with another decl, in which case its
15672 location would be different from input_location, and more accurate. */
15677 }
15679 /* Enter the SCOPE. That way unqualified names appearing in the
15680 initializer will be looked up in SCOPE. */
15683 /* Perform deferred access control checks, now that we know in which
15684 SCOPE the declared entity resides. */
15686 {
15689 /* If the entity being declared is a function, pretend that we
15690 are in its scope. If it is a `friend', it may have access to
15691 things that would not otherwise be accessible. */
15693 {
15696 }
15698 /* Perform access checks for template parameters. */
15701 /* Perform the access control checks for the declarator and the
15702 decl-specifiers. */
15705 /* Restore the saved value. */
15708 }
15710 /* Parse the initializer. */
15715 {
15717 {
15721 else
15722 {
15723 /* If the declaration was erroneous, we don't really
15724 know what the user intended, so just silently
15725 consume the initializer. */
15733 }
15734 }
15735 else
15736 {
15737 /* We want to record the extra mangling scope for in-class
15738 initializers of class members and initializers of static data
15739 member templates. The former involves deferring
15740 parsing of the initializer until end of class as with default
15741 arguments. So right here we only handle the latter. */
15749 }
15750 }
15752 /* The old parser allows attributes to appear after a parenthesized
15753 initializer. Mark Mitchell proposed removing this functionality
15754 on the GCC mailing lists on 2002-08-13. This parser accepts the
15755 attributes -- but ignores them. */
15762 /* For an in-class declaration, use `grokfield' to create the
15763 declaration. */
15765 {
15767 {
15770 }
15774 prefix_attributes);
15777 }
15779 /* Finish processing the declaration. But, skip member
15780 declarations. */
15782 {
15785 asm_specification,
15786 /* If the initializer is in parentheses, then this is
15787 a direct-initialization, which means that an
15788 `explicit' constructor is OK. Otherwise, an
15789 `explicit' constructor cannot be used. */
15792 }
15795 /* Core issue #226 (C++0x only): A default template-argument
15796 shall not be specified in a friend class template
15797 declaration. */
15805 }
15807 /* Parse a declarator.
15809 declarator:
15810 direct-declarator
15811 ptr-operator declarator
15813 abstract-declarator:
15814 ptr-operator abstract-declarator [opt]
15815 direct-abstract-declarator
15817 GNU Extensions:
15819 declarator:
15820 attributes [opt] direct-declarator
15821 attributes [opt] ptr-operator declarator
15823 abstract-declarator:
15824 attributes [opt] ptr-operator abstract-declarator [opt]
15825 attributes [opt] direct-abstract-declarator
15827 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
15828 detect constructor, destructor or conversion operators. It is set
15829 to -1 if the declarator is a name, and +1 if it is a
15830 function. Otherwise it is set to zero. Usually you just want to
15831 test for >0, but internally the negative value is used.
15833 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
15834 a decl-specifier-seq unless it declares a constructor, destructor,
15835 or conversion. It might seem that we could check this condition in
15836 semantic analysis, rather than parsing, but that makes it difficult
15837 to handle something like `f()'. We want to notice that there are
15838 no decl-specifiers, and therefore realize that this is an
15839 expression, not a declaration.)
15841 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
15842 the declarator is a direct-declarator of the form "(...)".
15844 MEMBER_P is true iff this declarator is a member-declarator. */
15848 cp_parser_declarator_kind dcl_kind,
15852 {
15855 cp_cv_quals cv_quals;
15856 tree class_type;
15859 /* Assume this is not a constructor, destructor, or type-conversion
15860 operator. */
15867 /* Check for the ptr-operator production. */
15869 /* Parse the ptr-operator. */
15873 /* If that worked, then we have a ptr-operator. */
15875 {
15876 /* If a ptr-operator was found, then this declarator was not
15877 parenthesized. */
15880 /* The dependent declarator is optional if we are parsing an
15881 abstract-declarator. */
15885 /* Parse the dependent declarator. */
15891 /* If we are parsing an abstract-declarator, we must handle the
15892 case where the dependent declarator is absent. */
15897 declarator = cp_parser_make_indirect_declarator
15899 }
15900 /* Everything else is a direct-declarator. */
15901 else
15902 {
15905 CPP_OPEN_PAREN);
15907 ctor_dtor_or_conv_p,
15908 member_p);
15909 }
15915 }
15917 /* Parse a direct-declarator or direct-abstract-declarator.
15919 direct-declarator:
15920 declarator-id
15921 direct-declarator ( parameter-declaration-clause )
15922 cv-qualifier-seq [opt]
15923 exception-specification [opt]
15924 direct-declarator [ constant-expression [opt] ]
15925 ( declarator )
15927 direct-abstract-declarator:
15928 direct-abstract-declarator [opt]
15929 ( parameter-declaration-clause )
15930 cv-qualifier-seq [opt]
15931 exception-specification [opt]
15932 direct-abstract-declarator [opt] [ constant-expression [opt] ]
15933 ( abstract-declarator )
15935 Returns a representation of the declarator. DCL_KIND is
15936 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
15937 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
15938 we are parsing a direct-declarator. It is
15939 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
15940 of ambiguity we prefer an abstract declarator, as per
15941 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
15942 cp_parser_declarator. */
15946 cp_parser_declarator_kind dcl_kind,
15949 {
15959 {
15960 /* Peek at the next token. */
15963 {
15964 /* This is either a parameter-declaration-clause, or a
15965 parenthesized declarator. When we know we are parsing a
15966 named declarator, it must be a parenthesized declarator
15967 if FIRST is true. For instance, `(int)' is a
15968 parameter-declaration-clause, with an omitted
15969 direct-abstract-declarator. But `((*))', is a
15970 parenthesized abstract declarator. Finally, when T is a
15971 template parameter `(T)' is a
15972 parameter-declaration-clause, and not a parenthesized
15973 named declarator.
15975 We first try and parse a parameter-declaration-clause,
15976 and then try a nested declarator (if FIRST is true).
15978 It is not an error for it not to be a
15979 parameter-declaration-clause, even when FIRST is
15980 false. Consider,
15982 int i (int);
15983 int i (3);
15985 The first is the declaration of a function while the
15986 second is the definition of a variable, including its
15987 initializer.
15989 Having seen only the parenthesis, we cannot know which of
15990 these two alternatives should be selected. Even more
15991 complex are examples like:
15993 int i (int (a));
15994 int i (int (3));
15996 The former is a function-declaration; the latter is a
15997 variable initialization.
15999 Thus again, we try a parameter-declaration-clause, and if
16000 that fails, we back out and return. */
16003 {
16004 tree params;
16007 tree t;
16009 /* In a member-declarator, the only valid interpretation
16010 of a parenthesis is the start of a
16011 parameter-declaration-clause. (It is invalid to
16012 initialize a static data member with a parenthesized
16013 initializer; only the "=" form of initialization is
16014 permitted.) */
16018 /* Consume the `('. */
16021 {
16022 /* If this is going to be an abstract declarator, we're
16023 in a declarator and we can't have default args. */
16026 }
16028 /* Inside the function parameter list, surrounding
16029 template-parameter-lists do not apply. */
16030 saved_num_template_parameter_lists
16036 /* Parse the parameter-declaration-clause. */
16039 parser->num_template_parameter_lists
16042 /* Consume the `)'. */
16045 /* If all went well, parse the cv-qualifier-seq and the
16046 exception-specification. */
16048 {
16049 cp_cv_quals cv_quals;
16050 cp_virt_specifiers virt_specifiers;
16051 tree exception_specification;
16052 tree late_return;
16060 /* Parse the cv-qualifier-seq. */
16062 /* And the exception-specification. */
16063 exception_specification
16065 /* Parse the virt-specifier-seq. */
16068 late_return = (cp_parser_late_return_type_opt
16071 /* Create the function-declarator. */
16073 params,
16074 cv_quals,
16075 virt_specifiers,
16076 exception_specification,
16077 late_return);
16078 /* Any subsequent parameter lists are to do with
16079 return type, so are not those of the declared
16080 function. */
16082 }
16084 /* Remove the function parms from scope. */
16090 /* Repeat the main loop. */
16092 }
16094 /* If this is the first, we can try a parenthesized
16095 declarator. */
16097 {
16103 /* Consume the `('. */
16105 /* Parse the nested declarator. */
16108 declarator
16111 member_p);
16114 /* Expect a `)'. */
16121 }
16122 /* Otherwise, we must be done. */
16123 else
16125 }
16128 {
16129 /* Parse an array-declarator. */
16130 tree bounds;
16138 /* Consume the `['. */
16140 /* Peek at the next token. */
16142 /* If the next token is `]', then there is no
16143 constant-expression. */
16145 {
16148 bounds
16158 {
16159 /* Normally, the array bound must be an integral constant
16160 expression. However, as an extension, we allow VLAs
16161 in function scopes as long as they aren't part of a
16162 parameter declaration. */
16166 }
16168 {
16169 /* Remember this wasn't a constant-expression. */
16172 }
16173 }
16174 else
16176 /* Look for the closing `]'. */
16178 {
16181 }
16184 }
16186 {
16187 {
16188 tree qualifying_scope;
16189 tree unqualified_name;
16190 special_function_kind sfk;
16195 /* Parse a declarator-id */
16198 {
16201 /* If we see an ellipsis, we should be looking at a
16202 parameter pack. */
16204 {
16205 /* Consume the `...' */
16209 }
16210 }
16213 unqualified_name
16217 {
16221 {
16222 /* Check whether an error occurred. */
16225 /* We already consumed the ellipsis to mark a
16226 parameter pack, but we have no way to report it,
16227 so abort the tentative parse. We will be exiting
16228 immediately anyway. */
16230 }
16231 else
16237 && (qualifying_scope
16240 {
16243 }
16244 }
16249 {
16254 }
16258 {
16259 /* In the declaration of a member of a template class
16260 outside of the class itself, the SCOPE will sometimes
16261 be a TYPENAME_TYPE. For example, given:
16263 template <typename T>
16264 int S<T>::R::i = 3;
16266 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
16267 this context, we must resolve S<T>::R to an ordinary
16268 type, rather than a typename type.
16270 The reason we normally avoid resolving TYPENAME_TYPEs
16271 is that a specialization of `S' might render
16272 `S<T>::R' not a type. However, if `S' is
16273 specialized, then this `i' will not be used, so there
16274 is no harm in resolving the types here. */
16275 tree type;
16277 /* Resolve the TYPENAME_TYPE. */
16280 /* If that failed, the declarator is invalid. */
16282 {
16285 "cannot define member of dependent typedef "
16287 else
16292 }
16294 }
16299 {
16300 tree class_type;
16305 else
16309 {
16312 {
16315 {
16319 "use %<%T::%D%> instead of %<%T::%D%> to "
16321 class_type,
16326 }
16327 else
16329 }
16330 else
16331 {
16332 /* We do not attempt to print the declarator
16333 here because we do not have enough
16334 information about its original syntactic
16335 form. */
16339 }
16340 }
16343 {
16349 for an anonymous type, even if the type
16350 got a name for linkage purposes. */
16353 class_type))
16354 {
16357 }
16365 }
16366 }
16368 unqualified_name,
16369 sfk);
16375 }
16377 handle_declarator:;
16380 /* Any names that appear after the declarator-id for a
16381 member are looked up in the containing scope. */
16386 /* Default args are only allowed on function
16387 declarations. */
16389 else
16393 }
16394 /* We're done. */
16395 else
16397 }
16399 /* For an abstract declarator, we might wind up with nothing at this
16400 point. That's an error; the declarator is not optional. */
16404 /* If we entered a scope, we must exit it now. */
16412 }
16414 /* Parse a ptr-operator.
16416 ptr-operator:
16417 * cv-qualifier-seq [opt]
16418 &
16419 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
16421 GNU Extension:
16423 ptr-operator:
16424 & cv-qualifier-seq [opt]
16426 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
16427 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
16428 an rvalue reference. In the case of a pointer-to-member, *TYPE is
16429 filled in with the TYPE containing the member. *CV_QUALS is
16430 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
16431 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
16432 Note that the tree codes returned by this function have nothing
16433 to do with the types of trees that will be eventually be created
16434 to represent the pointer or reference type being parsed. They are
16435 just constants with suggestive names. */
16436 static enum tree_code
16440 {
16444 /* Assume that it's not a pointer-to-member. */
16446 /* And that there are no cv-qualifiers. */
16449 /* Peek at the next token. */
16452 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
16462 {
16463 /* Consume the `*', `&' or `&&'. */
16466 /* A `*' can be followed by a cv-qualifier-seq, and so can a
16467 `&', if we are allowing GNU extensions. (The only qualifier
16468 that can legally appear after `&' is `restrict', but that is
16469 enforced during semantic analysis. */
16473 }
16474 else
16475 {
16476 /* Try the pointer-to-member case. */
16478 /* Look for the optional `::' operator. */
16481 /* Look for the nested-name specifier. */
16488 /* If we found it, and the next token is a `*', then we are
16489 indeed looking at a pointer-to-member operator. */
16492 {
16493 /* Indicate that the `*' operator was used. */
16501 else
16502 {
16503 /* The type of which the member is a member is given by the
16504 current SCOPE. */
16506 /* The next name will not be qualified. */
16510 /* Look for the optional cv-qualifier-seq. */
16512 }
16513 }
16514 /* If that didn't work we don't have a ptr-operator. */
16517 }
16520 }
16522 /* Parse an (optional) cv-qualifier-seq.
16524 cv-qualifier-seq:
16525 cv-qualifier cv-qualifier-seq [opt]
16527 cv-qualifier:
16528 const
16529 volatile
16531 GNU Extension:
16533 cv-qualifier:
16534 __restrict__
16536 Returns a bitmask representing the cv-qualifiers. */
16538 static cp_cv_quals
16540 {
16544 {
16546 cp_cv_quals cv_qualifier;
16548 /* Peek at the next token. */
16550 /* See if it's a cv-qualifier. */
16552 {
16568 }
16574 {
16577 }
16578 else
16579 {
16582 }
16583 }
16586 }
16588 /* Parse an (optional) virt-specifier-seq.
16590 virt-specifier-seq:
16591 virt-specifier virt-specifier-seq [opt]
16593 virt-specifier:
16594 override
16595 final
16597 Returns a bitmask representing the virt-specifiers. */
16599 static cp_virt_specifiers
16601 {
16605 {
16607 cp_virt_specifiers virt_specifier;
16609 /* Peek at the next token. */
16611 /* See if it's a virt-specifier-qualifier. */
16615 {
16618 }
16620 {
16623 }
16625 {
16627 }
16628 else
16632 {
16635 }
16636 else
16637 {
16640 }
16641 }
16643 }
16645 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
16646 is in scope even though it isn't real. */
16648 static void
16650 {
16651 tree this_parm;
16654 {
16655 /* We don't clear this between NSDMIs. Is it already what we want? */
16660 }
16663 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
16665 current_class_ref
16668 }
16670 /* Parse a late-specified return type, if any. This is not a separate
16671 non-terminal, but part of a function declarator, which looks like
16673 -> trailing-type-specifier-seq abstract-declarator(opt)
16675 Returns the type indicated by the type-id.
16677 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
16678 function. */
16680 static tree
16682 {
16684 tree type;
16686 /* Peek at the next token. */
16688 /* A late-specified return type is indicated by an initial '->'. */
16692 /* Consume the ->. */
16696 {
16697 /* DR 1207: 'this' is in scope in the trailing return type. */
16700 }
16708 }
16710 /* Parse a declarator-id.
16712 declarator-id:
16713 id-expression
16714 :: [opt] nested-name-specifier [opt] type-name
16716 In the `id-expression' case, the value returned is as for
16717 cp_parser_id_expression if the id-expression was an unqualified-id.
16718 If the id-expression was a qualified-id, then a SCOPE_REF is
16719 returned. The first operand is the scope (either a NAMESPACE_DECL
16720 or TREE_TYPE), but the second is still just a representation of an
16721 unqualified-id. */
16723 static tree
16725 {
16726 tree id;
16727 /* The expression must be an id-expression. Assume that qualified
16728 names are the names of types so that:
16730 template <class T>
16731 int S<T>::R::i = 3;
16733 will work; we must treat `S<T>::R' as the name of a type.
16734 Similarly, assume that qualified names are templates, where
16735 required, so that:
16737 template <class T>
16738 int S<T>::R<T>::i = 3;
16740 will work, too. */
16746 optional_p);
16750 }
16752 /* Parse a type-id.
16754 type-id:
16755 type-specifier-seq abstract-declarator [opt]
16757 Returns the TYPE specified. */
16759 static tree
16762 {
16763 cp_decl_specifier_seq type_specifier_seq;
16766 /* Parse the type-specifier-seq. */
16768 is_trailing_return,
16773 /* There might or might not be an abstract declarator. */
16775 /* Look for the declarator. */
16776 abstract_declarator
16780 /* Check to see if there really was a declarator. */
16786 {
16787 /* A type-id with type 'auto' is only ok if the abstract declarator
16788 is a function declarator with a late-specified return type. */
16793 else
16794 {
16797 }
16798 }
16801 is_template_arg);
16802 }
16805 {
16807 }
16810 {
16811 tree r;
16813 parser->type_definition_forbidden_message
16818 }
16821 {
16823 }
16825 /* Parse a type-specifier-seq.
16827 type-specifier-seq:
16828 type-specifier type-specifier-seq [opt]
16830 GNU extension:
16832 type-specifier-seq:
16833 attributes type-specifier-seq [opt]
16835 If IS_DECLARATION is true, we are at the start of a "condition" or
16836 exception-declaration, so we might be followed by a declarator-id.
16838 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
16839 i.e. we've just seen "->".
16841 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
16843 static void
16848 {
16853 /* Clear the TYPE_SPECIFIER_SEQ. */
16856 /* In the context of a trailing return type, enum E { } is an
16857 elaborated-type-specifier followed by a function-body, not an
16858 enum-specifier. */
16862 /* Parse the type-specifiers and attributes. */
16864 {
16865 tree type_specifier;
16868 /* Check for attributes first. */
16870 {
16875 }
16877 /* record the token of the beginning of the type specifier seq,
16878 for error reporting purposes*/
16882 /* Look for the type-specifier. */
16884 flags,
16885 type_specifier_seq,
16887 NULL,
16890 {
16891 /* If the first type-specifier could not be found, this is not a
16892 type-specifier-seq at all. */
16894 {
16898 }
16899 /* If subsequent type-specifiers could not be found, the
16900 type-specifier-seq is complete. */
16902 }
16905 /* The standard says that a condition can be:
16907 type-specifier-seq declarator = assignment-expression
16909 However, given:
16911 struct S {};
16912 if (int S = ...)
16914 we should treat the "S" as a declarator, not as a
16915 type-specifier. The standard doesn't say that explicitly for
16916 type-specifier-seq, but it does say that for
16917 decl-specifier-seq in an ordinary declaration. Perhaps it
16918 would be clearer just to allow a decl-specifier-seq here, and
16919 then add a semantic restriction that if any decl-specifiers
16920 that are not type-specifiers appear, the program is invalid. */
16923 }
16926 }
16928 /* Parse a parameter-declaration-clause.
16930 parameter-declaration-clause:
16931 parameter-declaration-list [opt] ... [opt]
16932 parameter-declaration-list , ...
16934 Returns a representation for the parameter declarations. A return
16935 value of NULL indicates a parameter-declaration-clause consisting
16936 only of an ellipsis. */
16938 static tree
16940 {
16941 tree parameters;
16946 /* Peek at the next token. */
16948 /* Check for trivial parameter-declaration-clauses. */
16950 {
16951 /* Consume the `...' token. */
16954 }
16956 /* There are no parameters. */
16957 {
16958 #ifndef NO_IMPLICIT_EXTERN_C
16962 else
16963 #endif
16965 }
16966 /* Check for `(void)', too, which is a special case. */
16970 {
16971 /* Consume the `void' token. */
16973 /* There are no parameters. */
16975 }
16977 /* Parse the parameter-declaration-list. */
16979 /* If a parse error occurred while parsing the
16980 parameter-declaration-list, then the entire
16981 parameter-declaration-clause is erroneous. */
16985 /* Peek at the next token. */
16987 /* If it's a `,', the clause should terminate with an ellipsis. */
16989 {
16990 /* Consume the `,'. */
16992 /* Expect an ellipsis. */
16993 ellipsis_p
16995 }
16996 /* It might also be `...' if the optional trailing `,' was
16997 omitted. */
16999 {
17000 /* Consume the `...' token. */
17002 /* And remember that we saw it. */
17004 }
17005 else
17008 /* Finish the parameter list. */
17013 }
17015 /* Parse a parameter-declaration-list.
17017 parameter-declaration-list:
17018 parameter-declaration
17019 parameter-declaration-list , parameter-declaration
17021 Returns a representation of the parameter-declaration-list, as for
17022 cp_parser_parameter_declaration_clause. However, the
17023 `void_list_node' is never appended to the list. Upon return,
17024 *IS_ERROR will be true iff an error occurred. */
17026 static tree
17028 {
17034 /* Assume all will go well. */
17036 /* The special considerations that apply to a function within an
17037 unbraced linkage specifications do not apply to the parameters
17038 to the function. */
17039 saved_in_unbraced_linkage_specification_p
17043 /* Look for more parameters. */
17045 {
17049 /* Parse the parameter. */
17050 parameter
17055 /* We don't know yet if the enclosing context is deprecated, so wait
17056 and warn in grokparms if appropriate. */
17062 PARM,
17068 /* If a parse error occurred parsing the parameter declaration,
17069 then the entire parameter-declaration-list is erroneous. */
17071 {
17075 }
17085 {
17089 }
17091 /* Add the new parameter to the list. */
17095 /* Peek at the next token. */
17098 /* These are for Objective-C++ */
17101 /* The parameter-declaration-list is complete. */
17104 {
17107 /* Peek at the next token. */
17109 /* If it's an ellipsis, then the list is complete. */
17112 /* Otherwise, there must be more parameters. Consume the
17113 `,'. */
17115 /* When parsing something like:
17117 int i(float f, double d)
17119 we can tell after seeing the declaration for "f" that we
17120 are not looking at an initialization of a variable "i",
17121 but rather at the declaration of a function "i".
17123 Due to the fact that the parsing of template arguments
17124 (as specified to a template-id) requires backtracking we
17125 cannot use this technique when inside a template argument
17126 list. */
17130 /* However, a parameter-declaration of the form
17131 "foat(f)" (which is a valid declaration of a
17132 parameter "f") can also be interpreted as an
17133 expression (the conversion of "f" to "float"). */
17136 }
17137 else
17138 {
17146 }
17147 }
17149 parser->in_unbraced_linkage_specification_p
17153 }
17155 /* Parse a parameter declaration.
17157 parameter-declaration:
17158 decl-specifier-seq ... [opt] declarator
17159 decl-specifier-seq declarator = assignment-expression
17160 decl-specifier-seq ... [opt] abstract-declarator [opt]
17161 decl-specifier-seq abstract-declarator [opt] = assignment-expression
17163 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
17164 declares a template parameter. (In that case, a non-nested `>'
17165 token encountered during the parsing of the assignment-expression
17166 is not interpreted as a greater-than operator.)
17168 Returns a representation of the parameter, or NULL if an error
17169 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
17170 true iff the declarator is of the form "(p)". */
17176 {
17178 cp_decl_specifier_seq decl_specifiers;
17180 tree default_argument;
17184 /* In a template parameter, `>' is not an operator.
17186 [temp.param]
17188 When parsing a default template-argument for a non-type
17189 template-parameter, the first non-nested `>' is taken as the end
17190 of the template parameter-list rather than a greater-than
17191 operator. */
17193 /* Type definitions may not appear in parameter types. */
17195 parser->type_definition_forbidden_message
17198 /* Parse the declaration-specifiers. */
17200 CP_PARSER_FLAGS_NONE,
17204 /* Complain about missing 'typename' or other invalid type names. */
17208 /* If an error occurred, there's no reason to attempt to parse the
17209 rest of the declaration. */
17211 {
17214 }
17216 /* Peek at the next token. */
17219 /* If the next token is a `)', `,', `=', `>', or `...', then there
17220 is no declarator. However, when variadic templates are enabled,
17221 there may be a declarator following `...'. */
17226 {
17230 }
17231 /* Otherwise, there should be a declarator. */
17232 else
17233 {
17237 /* After seeing a decl-specifier-seq, if the next token is not a
17238 "(", there is no possibility that the code is a valid
17239 expression. Therefore, if parsing tentatively, we commit at
17240 this point. */
17242 /* In an expression context, having seen:
17244 (int((char ...
17246 we cannot be sure whether we are looking at a
17247 function-type (taking a "char" as a parameter) or a cast
17248 of some object of type "char" to "int". */
17254 /* Parse the declarator. */
17257 CP_PARSER_DECLARATOR_EITHER,
17259 parenthesized_p,
17262 /* After the declarator, allow more attributes. */
17263 decl_specifiers.attributes
17266 }
17268 /* If the next token is an ellipsis, and we have not seen a
17269 declarator name, and the type of the declarator contains parameter
17270 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
17271 a parameter pack expansion expression. Otherwise, leave the
17272 ellipsis for a C-style variadic function. */
17275 {
17286 {
17287 /* Consume the `...'. */
17291 /* Build a pack expansion type */
17294 else
17296 }
17297 }
17299 /* The restriction on defining new types applies only to the type
17300 of the parameter, not to the default argument. */
17303 /* If the next token is `=', then process a default argument. */
17305 {
17307 /* If we are defining a class, then the tokens that make up the
17308 default argument must be saved and processed later. */
17313 /* Outside of a class definition, we can just parse the
17314 assignment-expression. */
17315 else
17316 default_argument
17320 {
17323 else
17324 {
17326 "default arguments are only "
17329 }
17330 }
17334 {
17335 /* Find the name of the parameter pack. */
17342 template_parm_p
17348 else
17350 template_parm_p
17357 }
17358 }
17359 else
17363 declarator,
17364 default_argument);
17365 }
17367 /* Parse a default argument and return it.
17369 TEMPLATE_PARM_P is true if this is a default argument for a
17370 non-type template parameter. */
17371 static tree
17373 {
17379 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
17380 set correctly. */
17383 /* Local variable names (and the `this' keyword) may not
17384 appear in a default argument. */
17387 /* Parse the assignment-expression. */
17390 default_argument
17400 }
17402 /* Parse a function-body.
17404 function-body:
17405 compound_statement */
17407 static void
17409 {
17411 }
17413 /* Parse a ctor-initializer-opt followed by a function-body. Return
17414 true if a ctor-initializer was present. */
17416 static bool
17418 {
17426 /* Begin the function body. */
17428 /* Parse the optional ctor-initializer. */
17431 /* If we're parsing a constexpr constructor definition, we need
17432 to check that the constructor body is indeed empty. However,
17433 before we get to cp_parser_function_body lot of junk has been
17434 generated, so we can't just check that we have an empty block.
17435 Rather we take a snapshot of the outermost block, and check whether
17436 cp_parser_function_body changed its state. */
17438 {
17442 }
17443 /* Parse the function-body. */
17447 /* Finish the function body. */
17451 }
17453 /* Parse an initializer.
17455 initializer:
17456 = initializer-clause
17457 ( expression-list )
17459 Returns an expression representing the initializer. If no
17460 initializer is present, NULL_TREE is returned.
17462 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
17463 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
17464 set to TRUE if there is no initializer present. If there is an
17465 initializer, and it is not a constant-expression, *NON_CONSTANT_P
17466 is set to true; otherwise it is set to false. */
17468 static tree
17471 {
17473 tree init;
17475 /* Peek at the next token. */
17478 /* Let our caller know whether or not this initializer was
17479 parenthesized. */
17481 /* Assume that the initializer is constant. */
17485 {
17486 /* Consume the `='. */
17488 /* Parse the initializer-clause. */
17490 }
17492 {
17497 non_constant_p);
17502 }
17504 {
17508 }
17509 else
17510 {
17511 /* Anything else is an error. */
17514 }
17517 }
17519 /* Parse an initializer-clause.
17521 initializer-clause:
17522 assignment-expression
17523 braced-init-list
17525 Returns an expression representing the initializer.
17527 If the `assignment-expression' production is used the value
17528 returned is simply a representation for the expression.
17530 Otherwise, calls cp_parser_braced_list. */
17532 static tree
17534 {
17535 tree initializer;
17537 /* Assume the expression is constant. */
17540 /* If it is not a `{', then we are looking at an
17541 assignment-expression. */
17543 {
17544 initializer
17547 non_constant_p);
17548 }
17549 else
17553 }
17555 /* Parse a brace-enclosed initializer list.
17557 braced-init-list:
17558 { initializer-list , [opt] }
17559 { }
17561 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
17562 the elements of the initializer-list (or NULL, if the last
17563 production is used). The TREE_TYPE for the CONSTRUCTOR will be
17564 NULL_TREE. There is no way to detect whether or not the optional
17565 trailing `,' was provided. NON_CONSTANT_P is as for
17566 cp_parser_initializer. */
17568 static tree
17570 {
17571 tree initializer;
17573 /* Consume the `{' token. */
17575 /* Create a CONSTRUCTOR to represent the braced-initializer. */
17577 /* If it's not a `}', then there is a non-trivial initializer. */
17579 {
17580 /* Parse the initializer list. */
17583 /* A trailing `,' token is allowed. */
17586 }
17587 /* Now, there should be a trailing `}'. */
17591 }
17593 /* Parse an initializer-list.
17595 initializer-list:
17596 initializer-clause ... [opt]
17597 initializer-list , initializer-clause ... [opt]
17599 GNU Extension:
17601 initializer-list:
17602 designation initializer-clause ...[opt]
17603 initializer-list , designation initializer-clause ...[opt]
17605 designation:
17606 . identifier =
17607 identifier :
17608 [ constant-expression ] =
17610 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
17611 for the initializer. If the INDEX of the elt is non-NULL, it is the
17612 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
17613 as for cp_parser_initializer. */
17617 {
17620 /* Assume all of the expressions are constant. */
17623 /* Parse the rest of the list. */
17625 {
17627 tree designator;
17628 tree initializer;
17631 /* If the next token is an identifier and the following one is a
17632 colon, we are looking at the GNU designated-initializer
17633 syntax. */
17637 {
17638 /* Warn the user that they are using an extension. */
17641 /* Consume the identifier. */
17643 /* Consume the `:'. */
17645 }
17646 /* Also handle the C99 syntax, '. id ='. */
17651 {
17652 /* Warn the user that they are using an extension. */
17655 /* Consume the `.'. */
17657 /* Consume the identifier. */
17659 /* Consume the `='. */
17661 }
17662 /* Also handle C99 array designators, '[ const ] ='. */
17666 {
17667 /* In C++11, [ could start a lambda-introducer. */
17675 }
17676 else
17679 /* Parse the initializer. */
17682 /* If any clause is non-constant, so is the entire initializer. */
17686 /* If we have an ellipsis, this is an initializer pack
17687 expansion. */
17689 {
17690 /* Consume the `...'. */
17693 /* Turn the initializer into an initializer expansion. */
17695 }
17697 /* Add it to the vector. */
17700 /* If the next token is not a comma, we have reached the end of
17701 the list. */
17705 /* Peek at the next token. */
17707 /* If the next token is a `}', then we're still done. An
17708 initializer-clause can have a trailing `,' after the
17709 initializer-list and before the closing `}'. */
17713 /* Consume the `,' token. */
17715 }
17718 }
17720 /* Classes [gram.class] */
17722 /* Parse a class-name.
17724 class-name:
17725 identifier
17726 template-id
17728 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
17729 to indicate that names looked up in dependent types should be
17730 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
17731 keyword has been used to indicate that the name that appears next
17732 is a template. TAG_TYPE indicates the explicit tag given before
17733 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
17734 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
17735 is the class being defined in a class-head.
17737 Returns the TYPE_DECL representing the class. */
17739 static tree
17747 {
17748 tree decl;
17749 tree scope;
17754 /* All class-names start with an identifier. */
17757 {
17760 }
17762 /* PARSER->SCOPE can be cleared when parsing the template-arguments
17763 to a template-id, so we save it here. */
17768 /* Any name names a type if we're following the `typename' keyword
17769 in a qualified name where the enclosing scope is type-dependent. */
17772 /* Handle the common case (an identifier, but not a template-id)
17773 efficiently. */
17776 {
17780 /* Look for the identifier. */
17784 /* If the next token isn't an identifier, we are certainly not
17785 looking at a class-name. */
17788 /* If we know this is a type-name, there's no need to look it
17789 up. */
17792 else
17793 {
17794 tree ambiguous_decls;
17795 /* If we already know that this lookup is ambiguous, then
17796 we've already issued an error message; there's no reason
17797 to check again. */
17799 {
17802 }
17803 /* If the next token is a `::', then the name must be a type
17804 name.
17806 [basic.lookup.qual]
17808 During the lookup for a name preceding the :: scope
17809 resolution operator, object, function, and enumerator
17810 names are ignored. */
17813 /* Look up the name. */
17815 tag_type,
17818 check_dependency_p,
17822 {
17826 }
17827 }
17828 }
17829 else
17830 {
17831 /* Try a template-id. */
17833 check_dependency_p,
17834 is_declaration);
17837 }
17841 /* If this is a typename, create a TYPENAME_TYPE. */
17843 {
17848 }
17852 /* Check to see that it is really the name of a class. */
17856 /* Situations like this:
17858 template <typename T> struct A {
17859 typename T::template X<int>::I i;
17860 };
17862 are problematic. Is `T::template X<int>' a class-name? The
17863 standard does not seem to be definitive, but there is no other
17864 valid interpretation of the following `::'. Therefore, those
17865 names are considered class-names. */
17866 {
17870 }
17874 /* In Objective-C 2.0, a classname followed by '.' starts a
17875 dot-syntax expression, and it's not a type-name. */
17887 }
17889 /* Parse a class-specifier.
17891 class-specifier:
17892 class-head { member-specification [opt] }
17894 Returns the TREE_TYPE representing the class. */
17896 static tree
17898 {
17899 tree type;
17909 tree bases;
17914 /* Parse the class-head. */
17919 /* If the class-head was a semantic disaster, skip the entire body
17920 of the class. */
17922 {
17926 }
17928 /* Look for the `{'. */
17930 {
17933 }
17935 /* Process the base classes. If they're invalid, skip the
17936 entire class body. */
17938 {
17939 /* Consuming the closing brace yields better error messages
17940 later on. */
17945 }
17947 /* Issue an error message if type-definitions are forbidden here. */
17949 /* Remember that we are defining one more class. */
17951 /* Inside the class, surrounding template-parameter-lists do not
17952 apply. */
17953 saved_num_template_parameter_lists
17956 /* We are not in a function body. */
17959 /* Or in a loop. */
17962 /* Or in a switch. */
17965 /* We are not immediately inside an extern "lang" block. */
17966 saved_in_unbraced_linkage_specification_p
17970 /* Start the class. */
17972 {
17975 }
17979 /* If the type is erroneous, skip the entire body of the class. */
17981 else
17982 /* Parse the member-specification. */
17985 /* Look for the trailing `}'. */
17987 /* Look for trailing attributes to apply to this class. */
17995 /* We've finished a type definition. Check for the common syntax
17996 error of forgetting a semicolon after the definition. We need to
17997 be careful, as we can't just check for not-a-semicolon and be done
17998 with it; the user might have typed:
18000 class X { } c = ...;
18001 class X { } *p = ...;
18003 and so forth. Instead, enumerate all the possible tokens that
18004 might follow this production; if we don't see one of them, then
18005 complain and silently insert the semicolon. */
18006 {
18011 {
18022 /* While it's legal for type qualifiers and storage class
18023 specifiers to follow type definitions in the grammar, only
18024 compiler testsuites contain code like that. Assume that if
18025 we see such code, then what we're really seeing is a case
18026 like:
18028 class X { }
18029 const <type> var = ...;
18031 or
18033 class Y { }
18034 static <type> func (...) ...
18036 i.e. the qualifier or specifier applies to the next
18037 declaration. To do so, however, we need to look ahead one
18038 more token to see if *that* token is a type specifier.
18040 This code could be improved to handle:
18042 class Z { }
18043 static const <type> var = ...; */
18046 {
18049 /* Handling user-defined types here would be nice, but very
18050 tricky. */
18051 want_semicolon
18054 }
18058 }
18060 /* If we don't have a type, then something is very wrong and we
18061 shouldn't try to do anything clever. Likewise for not seeing the
18062 closing brace. */
18064 {
18065 cp_token_position prev
18076 else
18079 /* Unget one token and smash it to look as though we encountered
18080 a semicolon in the input stream. */
18085 }
18086 }
18088 /* If this class is not itself within the scope of another class,
18089 then we need to parse the bodies of all of the queued function
18090 definitions. Note that the queued functions defined in a class
18091 are not always processed immediately following the
18092 class-specifier for that class. Consider:
18094 struct A {
18095 struct B { void f() { sizeof (A); } };
18096 };
18098 If `f' were processed before the processing of `A' were
18099 completed, there would be no way to compute the size of `A'.
18100 Note that the nesting we are interested in here is lexical --
18101 not the semantic nesting given by TYPE_CONTEXT. In particular,
18102 for:
18104 struct A { struct B; };
18105 struct A::B { void f() { } };
18107 there is no need to delay the parsing of `A::B::f'. */
18109 {
18110 tree decl;
18117 /* In a first pass, parse default arguments to the functions.
18118 Then, in a second pass, parse the bodies of the functions.
18119 This two-phased approach handles cases like:
18121 struct S {
18122 void f() { g(); }
18123 void g(int i = 3);
18124 };
18126 */
18129 {
18131 /* If there are default arguments that have not yet been processed,
18132 take care of them now. */
18134 {
18139 }
18140 /* Make sure that any template parameters are in scope. */
18142 /* Parse the default argument expressions. */
18144 /* Remove any template parameters from the symbol table. */
18146 }
18148 /* Now parse any NSDMIs. */
18152 {
18154 {
18159 }
18162 }
18168 /* Now parse the body of the functions. */
18172 }
18174 /* Put back any saved access checks. */
18177 /* Restore saved state. */
18181 parser->num_template_parameter_lists
18183 parser->in_unbraced_linkage_specification_p
18187 }
18189 static tree
18191 {
18192 tree ret;
18197 }
18199 /* Parse a class-head.
18201 class-head:
18202 class-key identifier [opt] base-clause [opt]
18203 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
18204 class-key nested-name-specifier [opt] template-id
18205 base-clause [opt]
18207 class-virt-specifier:
18208 final
18210 GNU Extensions:
18211 class-key attributes identifier [opt] base-clause [opt]
18212 class-key attributes nested-name-specifier identifier base-clause [opt]
18213 class-key attributes nested-name-specifier [opt] template-id
18214 base-clause [opt]
18216 Upon return BASES is initialized to the list of base classes (or
18217 NULL, if there are none) in the same form returned by
18218 cp_parser_base_clause.
18220 Returns the TYPE of the indicated class. Sets
18221 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
18222 involving a nested-name-specifier was used, and FALSE otherwise.
18224 Returns error_mark_node if this is not a class-head.
18226 Returns NULL_TREE if the class-head is syntactically valid, but
18227 semantically invalid in a way that means we should skip the entire
18228 body of the class. */
18230 static tree
18235 {
18236 tree nested_name_specifier;
18240 tree attributes;
18250 /* Assume no nested-name-specifier will be present. */
18252 /* Assume no template parameter lists will be used in defining the
18253 type. */
18259 /* Look for the class-key. */
18264 /* Parse the attributes. */
18267 /* If the next token is `::', that is invalid -- but sometimes
18268 people do try to write:
18270 struct ::S {};
18272 Handle this gracefully by accepting the extra qualifier, and then
18273 issuing an error about it later if this really is a
18274 class-head. If it turns out just to be an elaborated type
18275 specifier, remain silent. */
18281 /* Determine the name of the class. Begin by looking for an
18282 optional nested-name-specifier. */
18284 nested_name_specifier
18290 /* If there was a nested-name-specifier, then there *must* be an
18291 identifier. */
18293 {
18295 /* Although the grammar says `identifier', it really means
18296 `class-name' or `template-name'. You are only allowed to
18297 define a class that has already been declared with this
18298 syntax.
18300 The proposed resolution for Core Issue 180 says that wherever
18301 you see `class T::X' you should treat `X' as a type-name.
18303 It is OK to define an inaccessible class; for example:
18305 class A { class B; };
18306 class A::B {};
18308 We do not know if we will see a class-name, or a
18309 template-name. We look for a class-name first, in case the
18310 class-name is a template-id; if we looked for the
18311 template-name first we would stop after the template-name. */
18316 class_type,
18320 /* If that didn't work, ignore the nested-name-specifier. */
18322 {
18328 }
18329 /* If we could not find a corresponding TYPE, treat this
18330 declaration like an unqualified declaration. */
18333 /* Otherwise, count the number of templates used in TYPE and its
18334 containing scopes. */
18335 else
18336 {
18337 tree scope;
18350 }
18351 }
18352 /* Otherwise, the identifier is optional. */
18353 else
18354 {
18355 /* We don't know whether what comes next is a template-id,
18356 an identifier, or nothing at all. */
18358 /* Check for a template-id. */
18364 /* If that didn't work, it could still be an identifier. */
18366 {
18368 {
18371 }
18372 else
18374 }
18375 else
18376 {
18379 }
18380 }
18385 {
18388 }
18391 /* If it's not a `:' or a `{' then we can't really be looking at a
18392 class-head, since a class-head only appears as part of a
18393 class-specifier. We have to detect this situation before calling
18394 xref_tag, since that has irreversible side-effects. */
18396 {
18400 }
18402 /* At this point, we're going ahead with the class-specifier, even
18403 if some other problem occurs. */
18406 {
18411 }
18412 /* Issue the error about the overly-qualified name now. */
18414 {
18419 }
18421 {
18426 }
18428 {
18429 tree scope;
18431 /* Reject typedef-names in class heads. */
18433 {
18436 type);
18439 }
18441 /* Figure out in what scope the declaration is being placed. */
18443 /* If that scope does not contain the scope in which the
18444 class was originally declared, the program is invalid. */
18446 {
18449 "declaration of %qD in namespace %qD which does not "
18452 else
18458 }
18459 /* [dcl.meaning]
18461 A declarator-id shall not be qualified except for the
18462 definition of a ... nested class outside of its class
18463 ... [or] the definition or explicit instantiation of a
18464 class member of a namespace outside of its namespace. */
18466 {
18471 }
18472 }
18473 /* An explicit-specialization must be preceded by "template <>". If
18474 it is not, try to recover gracefully. */
18478 {
18482 /* Take the same action that would have been taken by
18483 cp_parser_explicit_specialization. */
18486 }
18487 /* There must be no "return" statements between this point and the
18488 end of this function; set "type "to the correct return value and
18489 use "goto done;" to return. */
18490 /* Make sure that the right number of template parameters were
18491 present. */
18495 {
18496 /* If something went wrong, there is no point in even trying to
18497 process the class-definition. */
18500 }
18502 /* Look up the type. */
18504 {
18508 {
18512 }
18513 else
18514 {
18517 }
18520 }
18522 {
18523 tree class_type;
18525 /* Given:
18527 template <typename T> struct S { struct T };
18528 template <typename T> struct S<T>::T { };
18530 we will get a TYPENAME_TYPE when processing the definition of
18531 `S::T'. We need to resolve it to the actual type before we
18532 try to define it. */
18534 {
18539 else
18540 {
18543 }
18544 }
18548 {
18551 }
18554 /* Enter the scope indicated by the nested-name-specifier. */
18556 /* Get the canonical version of this type. */
18560 {
18563 {
18566 }
18567 }
18571 }
18573 {
18574 /* If the class was unnamed, create a dummy name. */
18579 }
18581 /* Indicate whether this class was declared as a `class' or as a
18582 `struct'. */
18587 /* If this type was already complete, and we see another definition,
18588 that's an error. */
18590 {
18592 type);
18594 type);
18597 }
18601 /* We will have entered the scope containing the class; the names of
18602 base classes should be looked up in that context. For example:
18604 struct A { struct B {}; struct C; };
18605 struct A::C : B {};
18607 is valid. */
18609 /* Get the list of base-classes, if there is one. */
18613 done:
18614 /* Leave the scope given by the nested-name-specifier. We will
18615 enter the class scope itself while processing the members. */
18620 {
18623 }
18630 out:
18633 }
18635 /* Parse a class-key.
18637 class-key:
18638 class
18639 struct
18640 union
18642 Returns the kind of class-key specified, or none_type to indicate
18643 error. */
18645 static enum tag_types
18647 {
18651 /* Look for the class-key. */
18656 /* Check to see if the TOKEN is a class-key. */
18661 }
18663 /* Parse an (optional) member-specification.
18665 member-specification:
18666 member-declaration member-specification [opt]
18667 access-specifier : member-specification [opt] */
18669 static void
18671 {
18673 {
18677 /* Peek at the next token. */
18679 /* If it's a `}', or EOF then we've seen all the members. */
18685 /* See if this token is a keyword. */
18688 {
18692 /* Consume the access-specifier. */
18694 /* Remember which access-specifier is active. */
18696 /* Look for the `:'. */
18701 /* Accept #pragmas at class scope. */
18703 {
18706 }
18708 /* Otherwise, the next construction must be a
18709 member-declaration. */
18711 }
18712 }
18713 }
18715 /* Parse a member-declaration.
18717 member-declaration:
18718 decl-specifier-seq [opt] member-declarator-list [opt] ;
18719 function-definition ; [opt]
18720 :: [opt] nested-name-specifier template [opt] unqualified-id ;
18721 using-declaration
18722 template-declaration
18723 alias-declaration
18725 member-declarator-list:
18726 member-declarator
18727 member-declarator-list , member-declarator
18729 member-declarator:
18730 declarator pure-specifier [opt]
18731 declarator constant-initializer [opt]
18732 identifier [opt] : constant-expression
18734 GNU Extensions:
18736 member-declaration:
18737 __extension__ member-declaration
18739 member-declarator:
18740 declarator attributes [opt] pure-specifier [opt]
18741 declarator attributes [opt] constant-initializer [opt]
18742 identifier [opt] attributes [opt] : constant-expression
18744 C++0x Extensions:
18746 member-declaration:
18747 static_assert-declaration */
18749 static void
18751 {
18752 cp_decl_specifier_seq decl_specifiers;
18753 tree prefix_attributes;
18754 tree decl;
18763 /* Check for the `__extension__' keyword. */
18765 {
18766 /* Recurse. */
18768 /* Restore the old value of the PEDANTIC flag. */
18772 }
18774 /* Check for a template-declaration. */
18776 {
18777 /* An explicit specialization here is an error condition, and we
18778 expect the specialization handler to detect and report this. */
18782 else
18786 }
18788 /* Check for a using-declaration. */
18790 {
18792 {
18793 /* Parse the using-declaration. */
18797 }
18798 else
18799 {
18800 tree decl;
18805 else
18809 }
18810 }
18812 /* Check for @defs. */
18814 {
18819 {
18824 }
18826 }
18828 /* If the next token is `static_assert' we have a static assertion. */
18830 {
18833 }
18840 /* Parse the decl-specifier-seq. */
18843 CP_PARSER_FLAGS_OPTIONAL,
18848 /* Check for an invalid type-name. */
18852 /* If there is no declarator, then the decl-specifier-seq should
18853 specify a type. */
18855 {
18856 /* If there was no decl-specifier-seq, and the next token is a
18857 `;', then we have something like:
18859 struct S { ; };
18861 [class.mem]
18863 Each member-declaration shall declare at least one member
18864 name of the class. */
18866 {
18870 }
18871 else
18872 {
18873 tree type;
18875 /* See if this declaration is a friend. */
18877 /* If there were decl-specifiers, check to see if there was
18878 a class-declaration. */
18880 /* Nested classes have already been added to the class, but
18881 a `friend' needs to be explicitly registered. */
18883 {
18884 /* If the `friend' keyword was present, the friend must
18885 be introduced with a class-key. */
18888 "in C++03 a class-key must be used "
18890 /* In this case:
18892 template <typename T> struct A {
18893 friend struct A<T>::B;
18894 };
18896 A<T>::B will be represented by a TYPENAME_TYPE, and
18897 therefore not recognized by check_tag_decl. */
18899 {
18903 }
18906 "friend declaration does not name a class or "
18908 else
18911 }
18912 /* If there is no TYPE, an error message will already have
18913 been issued. */
18915 ;
18916 /* An anonymous aggregate has to be handled specially; such
18917 a declaration really declares a data member (with a
18918 particular type), as opposed to a nested class. */
18920 {
18921 /* Remove constructors and such from TYPE, now that we
18922 know it is an anonymous aggregate. */
18924 /* And make the corresponding data member. */
18927 /* Add it to the class. */
18929 }
18930 else
18931 cp_parser_check_access_in_redeclaration
18934 }
18935 }
18936 else
18937 {
18940 /* See if these declarations will be friends. */
18943 /* Keep going until we hit the `;' at the end of the
18944 declaration. */
18946 {
18948 tree first_attribute;
18950 /* Peek at the next token. */
18953 /* Check for a bitfield declaration. */
18958 {
18959 tree identifier;
18960 tree width;
18962 /* Get the name of the bitfield. Note that we cannot just
18963 check TOKEN here because it may have been invalidated by
18964 the call to cp_lexer_peek_nth_token above. */
18967 else
18970 /* Consume the `:' token. */
18972 /* Get the width of the bitfield. */
18973 width
18976 NULL);
18978 /* Look for attributes that apply to the bitfield. */
18980 /* Remember which attributes are prefix attributes and
18981 which are not. */
18983 /* Combine the attributes. */
18986 /* Create the bitfield declaration. */
18989 identifier,
18990 sfk_none)
18993 width,
18994 attributes);
18995 }
18996 else
18997 {
18999 tree initializer;
19000 tree asm_specification;
19003 /* Parse the declarator. */
19004 declarator
19010 /* If something went wrong parsing the declarator, make sure
19011 that we at least consume some tokens. */
19013 {
19014 /* Skip to the end of the statement. */
19016 /* If the next token is not a semicolon, that is
19017 probably because we just skipped over the body of
19018 a function. So, we consume a semicolon if
19019 present, but do not issue an error message if it
19020 is not present. */
19022 CPP_SEMICOLON))
19025 }
19028 cp_parser_check_for_definition_in_return_type
19032 /* Look for an asm-specification. */
19034 /* Look for attributes that apply to the declaration. */
19036 /* Remember which attributes are prefix attributes and
19037 which are not. */
19039 /* Combine the attributes. */
19042 /* If it's an `=', then we have a constant-initializer or a
19043 pure-specifier. It is not correct to parse the
19044 initializer before registering the member declaration
19045 since the member declaration should be in scope while
19046 its initializer is processed. However, the rest of the
19047 front end does not yet provide an interface that allows
19048 us to handle this correctly. */
19050 {
19051 /* In [class.mem]:
19053 A pure-specifier shall be used only in the declaration of
19054 a virtual function.
19056 A member-declarator can contain a constant-initializer
19057 only if it declares a static member of integral or
19058 enumeration type.
19060 Therefore, if the DECLARATOR is for a function, we look
19061 for a pure-specifier; otherwise, we look for a
19062 constant-initializer. When we call `grokfield', it will
19063 perform more stringent semantics checks. */
19074 {
19076 /* Don't require a constant rvalue in C++11, since we
19077 might want a reference constant. We'll enforce
19078 constancy later. */
19080 /* Parse the initializer. */
19083 }
19084 else
19085 /* Parse the initializer. */
19087 }
19090 {
19094 else
19096 }
19097 /* Otherwise, there is no initializer. */
19098 else
19101 /* See if we are probably looking at a function
19102 definition. We are certainly not looking at a
19103 member-declarator. Calling `grokfield' has
19104 side-effects, so we must not do it unless we are sure
19105 that we are looking at a member-declarator. */
19108 {
19109 /* The grammar does not allow a pure-specifier to be
19110 used when a member function is defined. (It is
19111 possible that this fact is an oversight in the
19112 standard, since a pure function may be defined
19113 outside of the class-specifier. */
19119 declarator,
19120 attributes);
19121 /* If the member was not a friend, declare it here. */
19124 /* Peek at the next token. */
19126 /* If the next token is a semicolon, consume it. */
19130 }
19131 else
19134 /* Create the declaration. */
19137 asm_specification,
19138 attributes);
19139 }
19141 /* Reset PREFIX_ATTRIBUTES. */
19147 /* If there is any qualification still in effect, clear it
19148 now; we will be starting fresh with the next declarator. */
19152 /* If it's a `,', then there are more declarators. */
19155 /* If the next token isn't a `;', then we have a parse error. */
19157 CPP_SEMICOLON))
19158 {
19159 /* The next token might be a ways away from where the
19160 actual semicolon is missing. Find the previous token
19161 and use that for our error position. */
19166 /* Assume that the user meant to provide a semicolon. If
19167 we were to cp_parser_skip_to_end_of_statement, we might
19168 skip to a semicolon inside a member function definition
19169 and issue nonsensical error messages. */
19171 }
19174 {
19175 /* Add DECL to the list of members. */
19184 /* Add DECL to the queue of NSDMI to be parsed later. */
19186 }
19190 }
19191 }
19194 out:
19196 }
19198 /* Parse a pure-specifier.
19200 pure-specifier:
19201 = 0
19203 Returns INTEGER_ZERO_NODE if a pure specifier is found.
19204 Otherwise, ERROR_MARK_NODE is returned. */
19206 static tree
19208 {
19211 /* Look for the `=' token. */
19214 /* Look for the `0' token. */
19223 /* Accept = default or = delete in c++0x mode. */
19226 {
19229 }
19231 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
19233 {
19238 }
19240 {
19243 }
19246 }
19248 /* Parse a constant-initializer.
19250 constant-initializer:
19251 = constant-expression
19253 Returns a representation of the constant-expression. */
19255 static tree
19257 {
19258 /* Look for the `=' token. */
19262 /* It is invalid to write:
19264 struct S { static const int i = { 7 }; };
19266 */
19268 {
19271 /* Consume the opening brace. */
19273 /* Skip the initializer. */
19275 /* Look for the trailing `}'. */
19279 }
19283 NULL);
19284 }
19286 /* Derived classes [gram.class.derived] */
19288 /* Parse a base-clause.
19290 base-clause:
19291 : base-specifier-list
19293 base-specifier-list:
19294 base-specifier ... [opt]
19295 base-specifier-list , base-specifier ... [opt]
19297 Returns a TREE_LIST representing the base-classes, in the order in
19298 which they were declared. The representation of each node is as
19299 described by cp_parser_base_specifier.
19301 In the case that no bases are specified, this function will return
19302 NULL_TREE, not ERROR_MARK_NODE. */
19304 static tree
19306 {
19309 /* Look for the `:' that begins the list. */
19312 /* Scan the base-specifier-list. */
19314 {
19316 tree base;
19319 /* Look for the base-specifier. */
19321 /* Look for the (optional) ellipsis. */
19323 {
19324 /* Consume the `...'. */
19328 }
19330 /* Add BASE to the front of the list. */
19332 {
19334 /* Make this a pack expansion type. */
19338 {
19341 }
19342 }
19343 /* Peek at the next token. */
19345 /* If it's not a comma, then the list is complete. */
19348 /* Consume the `,'. */
19350 }
19352 /* PARSER->SCOPE may still be non-NULL at this point, if the last
19353 base class had a qualified name. However, the next name that
19354 appears is certainly not qualified. */
19360 }
19362 /* Parse a base-specifier.
19364 base-specifier:
19365 :: [opt] nested-name-specifier [opt] class-name
19366 virtual access-specifier [opt] :: [opt] nested-name-specifier
19367 [opt] class-name
19368 access-specifier virtual [opt] :: [opt] nested-name-specifier
19369 [opt] class-name
19371 Returns a TREE_LIST. The TREE_PURPOSE will be one of
19372 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
19373 indicate the specifiers provided. The TREE_VALUE will be a TYPE
19374 (or the ERROR_MARK_NODE) indicating the type that was specified. */
19376 static tree
19378 {
19386 tree type;
19388 /* Process the optional `virtual' and `access-specifier'. */
19390 {
19391 /* Peek at the next token. */
19393 /* Process `virtual'. */
19395 {
19397 /* If `virtual' appears more than once, issue an error. */
19399 {
19403 }
19407 /* Consume the `virtual' token. */
19415 /* If more than one access specifier appears, issue an
19416 error. */
19419 {
19423 }
19427 /* Consume the access-specifier. */
19435 }
19436 }
19437 /* It is not uncommon to see programs mechanically, erroneously, use
19438 the 'typename' keyword to denote (dependent) qualified types
19439 as base classes. */
19441 {
19446 else
19448 "keyword %<typename%> not allowed in this context "
19451 }
19453 /* Look for the optional `::' operator. */
19455 /* Look for the nested-name-specifier. The simplest way to
19456 implement:
19458 [temp.res]
19460 The keyword `typename' is not permitted in a base-specifier or
19461 mem-initializer; in these contexts a qualified name that
19462 depends on a template-parameter is implicitly assumed to be a
19463 type name.
19465 is to pretend that we have seen the `typename' keyword at this
19466 point. */
19470 typename_type,
19472 /* If the base class is given by a qualified name, assume that names
19473 we see are type names or templates, as appropriate. */
19479 /* DR 950 allows decltype as a base-specifier. */
19481 else
19482 {
19483 /* Otherwise, look for the class-name. */
19485 class_scope_p,
19486 template_p,
19487 typename_type,
19492 }
19498 }
19500 /* Exception handling [gram.exception] */
19502 /* Parse an (optional) noexcept-specification.
19504 noexcept-specification:
19505 noexcept ( constant-expression ) [opt]
19507 If no noexcept-specification is present, returns NULL_TREE.
19508 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
19509 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
19510 there are no parentheses. CONSUMED_EXPR will be set accordingly.
19511 Otherwise, returns a noexcept specification unless RETURN_COND is true,
19512 in which case a boolean condition is returned instead. */
19514 static tree
19519 {
19523 /* Peek at the next token. */
19526 /* Is it a noexcept-specification? */
19528 {
19529 tree expr;
19533 {
19537 {
19538 /* Types may not be defined in an exception-specification. */
19540 parser->type_definition_forbidden_message
19545 /* Restore the saved message. */
19547 }
19548 else
19549 {
19552 }
19555 }
19556 else
19557 {
19561 }
19563 /* We cannot build a noexcept-spec right away because this will check
19564 that expr is a constexpr. */
19567 else
19569 }
19570 else
19572 }
19574 /* Parse an (optional) exception-specification.
19576 exception-specification:
19577 throw ( type-id-list [opt] )
19579 Returns a TREE_LIST representing the exception-specification. The
19580 TREE_VALUE of each node is a type. */
19582 static tree
19584 {
19586 tree type_id_list;
19589 /* Peek at the next token. */
19592 /* Is it a noexcept-specification? */
19598 /* If it's not `throw', then there's no exception-specification. */
19602 #if 0
19603 /* Enable this once a lot of code has transitioned to noexcept? */
19607 #endif
19609 /* Consume the `throw'. */
19612 /* Look for the `('. */
19615 /* Peek at the next token. */
19617 /* If it's not a `)', then there is a type-id-list. */
19619 {
19620 /* Types may not be defined in an exception-specification. */
19622 parser->type_definition_forbidden_message
19624 /* Parse the type-id-list. */
19626 /* Restore the saved message. */
19628 }
19629 else
19632 /* Look for the `)'. */
19636 }
19638 /* Parse an (optional) type-id-list.
19640 type-id-list:
19641 type-id ... [opt]
19642 type-id-list , type-id ... [opt]
19644 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
19645 in the order that the types were presented. */
19647 static tree
19649 {
19653 {
19655 tree type;
19657 /* Get the next type-id. */
19659 /* Parse the optional ellipsis. */
19661 {
19662 /* Consume the `...'. */
19665 /* Turn the type into a pack expansion expression. */
19667 }
19668 /* Add it to the list. */
19670 /* Peek at the next token. */
19672 /* If it is not a `,', we are done. */
19675 /* Consume the `,'. */
19677 }
19680 }
19682 /* Parse a try-block.
19684 try-block:
19685 try compound-statement handler-seq */
19687 static tree
19689 {
19690 tree try_block;
19700 }
19702 /* Parse a function-try-block.
19704 function-try-block:
19705 try ctor-initializer [opt] function-body handler-seq */
19707 static bool
19709 {
19710 tree compound_stmt;
19711 tree try_block;
19714 /* Look for the `try' keyword. */
19717 /* Let the rest of the front end know where we are. */
19719 /* Parse the function-body. */
19720 ctor_initializer_p
19722 /* We're done with the `try' part. */
19724 /* Parse the handlers. */
19726 /* We're done with the handlers. */
19730 }
19732 /* Parse a handler-seq.
19734 handler-seq:
19735 handler handler-seq [opt] */
19737 static void
19739 {
19741 {
19744 /* Parse the handler. */
19746 /* Peek at the next token. */
19748 /* If it's not `catch' then there are no more handlers. */
19751 }
19752 }
19754 /* Parse a handler.
19756 handler:
19757 catch ( exception-declaration ) compound-statement */
19759 static void
19761 {
19762 tree handler;
19763 tree declaration;
19773 }
19775 /* Parse an exception-declaration.
19777 exception-declaration:
19778 type-specifier-seq declarator
19779 type-specifier-seq abstract-declarator
19780 type-specifier-seq
19781 ...
19783 Returns a VAR_DECL for the declaration, or NULL_TREE if the
19784 ellipsis variant is used. */
19786 static tree
19788 {
19789 cp_decl_specifier_seq type_specifiers;
19793 /* If it's an ellipsis, it's easy to handle. */
19795 {
19796 /* Consume the `...' token. */
19799 }
19801 /* Types may not be defined in exception-declarations. */
19803 parser->type_definition_forbidden_message
19806 /* Parse the type-specifier-seq. */
19810 /* If it's a `)', then there is no declarator. */
19813 else
19819 /* Restore the saved message. */
19826 }
19828 /* Parse a throw-expression.
19830 throw-expression:
19831 throw assignment-expression [opt]
19833 Returns a THROW_EXPR representing the throw-expression. */
19835 static tree
19837 {
19838 tree expression;
19843 /* Figure out whether or not there is an assignment-expression
19844 following the "throw" keyword. */
19852 else
19857 }
19859 /* GNU Extensions */
19861 /* Parse an (optional) asm-specification.
19863 asm-specification:
19864 asm ( string-literal )
19866 If the asm-specification is present, returns a STRING_CST
19867 corresponding to the string-literal. Otherwise, returns
19868 NULL_TREE. */
19870 static tree
19872 {
19874 tree asm_specification;
19876 /* Peek at the next token. */
19878 /* If the next token isn't the `asm' keyword, then there's no
19879 asm-specification. */
19883 /* Consume the `asm' token. */
19885 /* Look for the `('. */
19888 /* Look for the string-literal. */
19891 /* Look for the `)'. */
19895 }
19897 /* Parse an asm-operand-list.
19899 asm-operand-list:
19900 asm-operand
19901 asm-operand-list , asm-operand
19903 asm-operand:
19904 string-literal ( expression )
19905 [ string-literal ] string-literal ( expression )
19907 Returns a TREE_LIST representing the operands. The TREE_VALUE of
19908 each node is the expression. The TREE_PURPOSE is itself a
19909 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
19910 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
19911 is a STRING_CST for the string literal before the parenthesis. Returns
19912 ERROR_MARK_NODE if any of the operands are invalid. */
19914 static tree
19916 {
19921 {
19922 tree string_literal;
19923 tree expression;
19924 tree name;
19927 {
19928 /* Consume the `[' token. */
19930 /* Read the operand name. */
19935 /* Look for the closing `]'. */
19937 }
19938 else
19940 /* Look for the string-literal. */
19943 /* Look for the `('. */
19945 /* Parse the expression. */
19947 /* Look for the `)'. */
19955 /* Add this operand to the list. */
19957 expression,
19958 asm_operands);
19959 /* If the next token is not a `,', there are no more
19960 operands. */
19963 /* Consume the `,'. */
19965 }
19968 }
19970 /* Parse an asm-clobber-list.
19972 asm-clobber-list:
19973 string-literal
19974 asm-clobber-list , string-literal
19976 Returns a TREE_LIST, indicating the clobbers in the order that they
19977 appeared. The TREE_VALUE of each node is a STRING_CST. */
19979 static tree
19981 {
19985 {
19986 tree string_literal;
19988 /* Look for the string literal. */
19990 /* Add it to the list. */
19992 /* If the next token is not a `,', then the list is
19993 complete. */
19996 /* Consume the `,' token. */
19998 }
20001 }
20003 /* Parse an asm-label-list.
20005 asm-label-list:
20006 identifier
20007 asm-label-list , identifier
20009 Returns a TREE_LIST, indicating the labels in the order that they
20010 appeared. The TREE_VALUE of each node is a label. */
20012 static tree
20014 {
20018 {
20021 /* Look for the identifier. */
20024 {
20027 {
20033 }
20034 }
20035 /* If the next token is not a `,', then the list is
20036 complete. */
20039 /* Consume the `,' token. */
20041 }
20044 }
20046 /* Parse an (optional) series of attributes.
20048 attributes:
20049 attributes attribute
20051 attribute:
20052 __attribute__ (( attribute-list [opt] ))
20054 The return value is as for cp_parser_attribute_list. */
20056 static tree
20058 {
20062 {
20064 tree attribute_list;
20066 /* Peek at the next token. */
20068 /* If it's not `__attribute__', then we're done. */
20072 /* Consume the `__attribute__' keyword. */
20074 /* Look for the two `(' tokens. */
20078 /* Peek at the next token. */
20081 /* Parse the attribute-list. */
20083 else
20084 /* If the next token is a `)', then there is no attribute
20085 list. */
20088 /* Look for the two `)' tokens. */
20092 /* Add these new attributes to the list. */
20094 }
20097 }
20099 /* Parse an attribute-list.
20101 attribute-list:
20102 attribute
20103 attribute-list , attribute
20105 attribute:
20106 identifier
20107 identifier ( identifier )
20108 identifier ( identifier , expression-list )
20109 identifier ( expression-list )
20111 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
20112 to an attribute. The TREE_PURPOSE of each node is the identifier
20113 indicating which attribute is in use. The TREE_VALUE represents
20114 the arguments, if any. */
20116 static tree
20118 {
20124 {
20126 tree identifier;
20127 tree attribute;
20129 /* Look for the identifier. We also allow keywords here; for
20130 example `__attribute__ ((const))' is legal. */
20134 {
20137 /* Consume the token. */
20140 /* Save away the identifier that indicates which attribute
20141 this is. */
20143 /* For keywords, use the canonical spelling, not the
20144 parsed identifier. */
20150 /* Peek at the next token. */
20152 /* If it's an `(', then parse the attribute arguments. */
20154 {
20158 vec = cp_parser_parenthesized_expression_list
20164 else
20165 {
20168 }
20169 /* Save the arguments away. */
20171 }
20174 {
20175 /* Add this attribute to the list. */
20178 }
20181 }
20182 /* Now, look for more attributes. If the next token isn't a
20183 `,', we're done. */
20187 /* Consume the comma and keep going. */
20189 }
20192 /* We built up the list in reverse order. */
20194 }
20196 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
20197 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
20198 current value of the PEDANTIC flag, regardless of whether or not
20199 the `__extension__' keyword is present. The caller is responsible
20200 for restoring the value of the PEDANTIC flag. */
20202 static bool
20204 {
20205 /* Save the old value of the PEDANTIC flag. */
20209 {
20210 /* Consume the `__extension__' token. */
20212 /* We're not being pedantic while the `__extension__' keyword is
20213 in effect. */
20217 }
20220 }
20222 /* Parse a label declaration.
20224 label-declaration:
20225 __label__ label-declarator-seq ;
20227 label-declarator-seq:
20228 identifier , label-declarator-seq
20229 identifier */
20231 static void
20233 {
20234 /* Look for the `__label__' keyword. */
20238 {
20239 tree identifier;
20241 /* Look for an identifier. */
20243 /* If we failed, stop. */
20246 /* Declare it as a label. */
20248 /* If the next token is a `;', stop. */
20251 /* Look for the `,' separating the label declarations. */
20253 }
20255 /* Look for the final `;'. */
20257 }
20259 /* Support Functions */
20261 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
20262 NAME should have one of the representations used for an
20263 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
20264 is returned. If PARSER->SCOPE is a dependent type, then a
20265 SCOPE_REF is returned.
20267 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
20268 returned; the name was already resolved when the TEMPLATE_ID_EXPR
20269 was formed. Abstractly, such entities should not be passed to this
20270 function, because they do not need to be looked up, but it is
20271 simpler to check for this special case here, rather than at the
20272 call-sites.
20274 In cases not explicitly covered above, this function returns a
20275 DECL, OVERLOAD, or baselink representing the result of the lookup.
20276 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
20277 is returned.
20279 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
20280 (e.g., "struct") that was used. In that case bindings that do not
20281 refer to types are ignored.
20283 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
20284 ignored.
20286 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
20287 are ignored.
20289 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
20290 types.
20292 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
20293 TREE_LIST of candidates if name-lookup results in an ambiguity, and
20294 NULL_TREE otherwise. */
20296 static tree
20303 location_t name_location)
20304 {
20306 tree decl;
20312 /* Assume that the lookup will be unambiguous. */
20316 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
20317 no longer valid. Note that if we are parsing tentatively, and
20318 the parse fails, OBJECT_TYPE will be automatically restored. */
20324 /* A template-id has already been resolved; there is no lookup to
20325 do. */
20329 {
20333 }
20335 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
20336 it should already have been checked to make sure that the name
20337 used matches the type being destroyed. */
20339 {
20340 tree type;
20342 /* Figure out to which type this destructor applies. */
20347 else
20349 /* If that's not a class type, there is no destructor. */
20356 /* If it was a class type, return the destructor. */
20358 }
20360 /* By this point, the NAME should be an ordinary identifier. If
20361 the id-expression was a qualified name, the qualifying scope is
20362 stored in PARSER->SCOPE at this point. */
20365 /* Perform the lookup. */
20367 {
20373 /* If the SCOPE is dependent, the lookup must be deferred until
20374 the template is instantiated -- unless we are explicitly
20375 looking up names in uninstantiated templates. Even then, we
20376 cannot look up the name if the scope is not a class type; it
20377 might, for example, be a template type parameter. */
20382 /* Defer lookup. */
20384 else
20385 {
20388 /* If PARSER->SCOPE is a dependent type, then it must be a
20389 class type, and we must not be checking dependencies;
20390 otherwise, we would have processed this lookup above. So
20391 that PARSER->SCOPE is not considered a dependent base by
20392 lookup_member, we must enter the scope here. */
20396 /* If the PARSER->SCOPE is a template specialization, it
20397 may be instantiated during name lookup. In that case,
20398 errors may be issued. Even if we rollback the current
20399 tentative parse, those errors are valid. */
20404 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
20405 lookup result and the nested-name-specifier nominates a class C:
20406 * if the name specified after the nested-name-specifier, when
20407 looked up in C, is the injected-class-name of C (Clause 9), or
20408 * if the name specified after the nested-name-specifier is the
20409 same as the identifier or the simple-template-id's template-
20410 name in the last component of the nested-name-specifier,
20411 the name is instead considered to name the constructor of
20412 class C. [ Note: for example, the constructor is not an
20413 acceptable lookup result in an elaborated-type-specifier so
20414 the constructor would not be used in place of the
20415 injected-class-name. --end note ] Such a constructor name
20416 shall be used only in the declarator-id of a declaration that
20417 names a constructor or in a using-declaration. */
20425 /* If we have a single function from a using decl, pull it out. */
20432 }
20434 /* If the scope is a dependent type and either we deferred lookup or
20435 we did lookup but didn't find the name, rememeber the name. */
20438 {
20440 {
20441 tree type;
20443 /* The resolution to Core Issue 180 says that `struct
20444 A::B' should be considered a type-name, even if `A'
20445 is dependent. */
20449 }
20453 CPP_CLOSE_PAREN)))
20457 else
20460 is_template);
20461 }
20464 }
20466 {
20468 /* Look up the name in the scope of the OBJECT_TYPE, unless the
20469 OBJECT_TYPE is not a class. */
20471 /* If the OBJECT_TYPE is a template specialization, it may
20472 be instantiated during name lookup. In that case, errors
20473 may be issued. Even if we rollback the current tentative
20474 parse, those errors are valid. */
20476 name,
20479 tf_warning_or_error);
20480 /* Look it up in the enclosing context, too. */
20488 }
20489 else
20490 {
20496 }
20498 /* If the lookup failed, let our caller know. */
20502 /* Pull out the template from an injected-class-name (or multiple). */
20506 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
20508 {
20511 /* The error message we have to print is too complicated for
20512 cp_parser_error, so we incorporate its actions directly. */
20514 {
20516 name);
20518 }
20520 }
20528 /* If we have resolved the name of a member declaration, check to
20529 see if the declaration is accessible. When the name resolves to
20530 set of overloaded functions, accessibility is checked when
20531 overload resolution is done.
20533 During an explicit instantiation, access is not checked at all,
20534 as per [temp.explicit]. */
20541 }
20543 /* Like cp_parser_lookup_name, but for use in the typical case where
20544 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
20545 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
20547 static tree
20549 {
20551 none_type,
20556 location);
20557 }
20559 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
20560 the current context, return the TYPE_DECL. If TAG_NAME_P is
20561 true, the DECL indicates the class being defined in a class-head,
20562 or declared in an elaborated-type-specifier.
20564 Otherwise, return DECL. */
20566 static tree
20568 {
20569 /* If the TEMPLATE_DECL is being declared as part of a class-head,
20570 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
20572 struct A {
20573 template <typename T> struct B;
20574 };
20576 template <typename T> struct A::B {};
20578 Similarly, in an elaborated-type-specifier:
20580 namespace N { struct X{}; }
20582 struct A {
20583 template <typename T> friend struct N::X;
20584 };
20586 However, if the DECL refers to a class type, and we are in
20587 the scope of the class, then the name lookup automatically
20588 finds the TYPE_DECL created by build_self_reference rather
20589 than a TEMPLATE_DECL. For example, in:
20591 template <class T> struct S {
20592 S s;
20593 };
20595 there is no need to handle such case. */
20601 }
20603 /* If too many, or too few, template-parameter lists apply to the
20604 declarator, issue an error message. Returns TRUE if all went well,
20605 and FALSE otherwise. */
20607 static bool
20610 location_t declarator_location)
20611 {
20614 /* We haven't seen any classes that involve template parameters yet. */
20618 {
20621 {
20622 tree scope;
20627 {
20628 /* You're supposed to have one `template <...>'
20629 for every template class, but you don't need one
20630 for a full specialization. For example:
20632 template <class T> struct S{};
20633 template <> struct S<int> { void f(); };
20634 void S<int>::f () {}
20636 is correct; there shouldn't be a `template <>' for
20637 the definition of `S<int>::f'. */
20639 /* If SCOPE does not have template information of any
20640 kind, then it is not a template, nor is it nested
20641 within a template. */
20649 }
20650 }
20653 /* If the DECLARATOR has the form `X<y>' then it uses one
20654 additional level of template parameters. */
20657 return cp_parser_check_template_parameters
20674 }
20676 }
20678 /* NUM_TEMPLATES were used in the current declaration. If that is
20679 invalid, return FALSE and issue an error messages. Otherwise,
20680 return TRUE. If DECLARATOR is non-NULL, then we are checking a
20681 declarator and we can print more accurate diagnostics. */
20683 static bool
20686 location_t location,
20688 {
20689 /* If there are the same number of template classes and parameter
20690 lists, that's OK. */
20693 /* If there are more, but only one more, then we are referring to a
20694 member template. That's OK too. */
20697 /* If there are more template classes than parameter lists, we have
20698 something like:
20700 template <class T> void S<T>::R<T>::f (); */
20702 {
20712 else
20715 }
20716 /* Otherwise, there are too many template parameter lists. We have
20717 something like:
20719 template <class T> template <class U> void S::f(); */
20722 }
20724 /* Parse an optional `::' token indicating that the following name is
20725 from the global namespace. If so, PARSER->SCOPE is set to the
20726 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
20727 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
20728 Returns the new value of PARSER->SCOPE, if the `::' token is
20729 present, and NULL_TREE otherwise. */
20731 static tree
20733 {
20736 /* Peek at the next token. */
20738 /* If we're looking at a `::' token then we're starting from the
20739 global namespace, not our current location. */
20741 {
20742 /* Consume the `::' token. */
20744 /* Set the SCOPE so that we know where to start the lookup. */
20750 }
20752 {
20756 }
20759 }
20761 /* Returns TRUE if the upcoming token sequence is the start of a
20762 constructor declarator. If FRIEND_P is true, the declarator is
20763 preceded by the `friend' specifier. */
20765 static bool
20767 {
20769 tree nested_name_specifier;
20772 /* The common case is that this is not a constructor declarator, so
20773 try to avoid doing lots of work if at all possible. It's not
20774 valid declare a constructor at function scope. */
20777 /* And only certain tokens can begin a constructor declarator. */
20785 /* Parse tentatively; we are going to roll back all of the tokens
20786 consumed here. */
20788 /* Assume that we are looking at a constructor declarator. */
20791 /* Look for the optional `::' operator. */
20794 /* Look for the nested-name-specifier. */
20795 nested_name_specifier
20801 /* Outside of a class-specifier, there must be a
20802 nested-name-specifier. */
20810 /* If we have a class scope, this is easy; DR 147 says that S::S always
20811 names the constructor, and no other qualified name could. */
20814 {
20824 }
20825 /* If we still think that this might be a constructor-declarator,
20826 look for a class-name. */
20828 {
20829 /* If we have:
20831 template <typename T> struct S {
20832 S();
20833 };
20835 we must recognize that the nested `S' names a class. */
20836 tree type_decl;
20840 none_type,
20844 /* If there was no class-name, then this is not a constructor. */
20847 /* If we're still considering a constructor, we have to see a `(',
20848 to begin the parameter-declaration-clause, followed by either a
20849 `)', an `...', or a decl-specifier. We need to check for a
20850 type-specifier to avoid being fooled into thinking that:
20852 S (f) (int);
20854 is a constructor. (It is actually a function named `f' that
20855 takes one parameter (of type `int') and returns a value of type
20856 `S'. */
20864 /* A parameter declaration begins with a decl-specifier,
20865 which is either the "attribute" keyword, a storage class
20866 specifier, or (usually) a type-specifier. */
20868 {
20869 tree type;
20873 /* Names appearing in the type-specifier should be looked up
20874 in the scope of the class. */
20877 else
20878 {
20881 {
20885 {
20888 }
20889 }
20891 }
20893 /* Inside the constructor parameter list, surrounding
20894 template-parameter-lists do not apply. */
20895 saved_num_template_parameter_lists
20899 /* Look for the type-specifier. */
20901 CP_PARSER_FLAGS_NONE,
20907 parser->num_template_parameter_lists
20910 /* Leave the scope of the class. */
20915 }
20916 }
20918 /* We did not really want to consume any tokens. */
20922 }
20924 /* Parse the definition of the function given by the DECL_SPECIFIERS,
20925 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
20926 they must be performed once we are in the scope of the function.
20928 Returns the function defined. */
20930 static tree
20931 cp_parser_function_definition_from_specifiers_and_declarator
20934 tree attributes,
20936 {
20937 tree fn;
20940 /* Begin the function-definition. */
20943 /* The things we're about to see are not directly qualified by any
20944 template headers we've seen thus far. */
20947 /* If there were names looked up in the decl-specifier-seq that we
20948 did not check, check them now. We must wait until we are in the
20949 scope of the function to perform the checks, since the function
20950 might be a friend. */
20954 {
20955 /* Skip the entire function. */
20958 }
20960 {
20961 /* Seen already, skip it. An error message has already been output. */
20965 /* If this is a function from a class, pop the nested class. */
20968 }
20969 else
20970 {
20971 timevar_id_t tv;
20974 else
20980 }
20983 }
20985 /* Parse the part of a function-definition that follows the
20986 declarator. INLINE_P is TRUE iff this function is an inline
20987 function defined within a class-specifier.
20989 Returns the function defined. */
20991 static tree
20994 {
20995 tree fn;
21004 /* If the next token is `return', then the code may be trying to
21005 make use of the "named return value" extension that G++ used to
21006 support. */
21009 {
21010 /* Consume the `return' keyword. */
21012 /* Look for the identifier that indicates what value is to be
21013 returned. */
21015 /* Issue an error message. */
21018 /* Skip tokens until we reach the start of the function body. */
21020 {
21027 }
21028 }
21029 /* The `extern' in `extern "C" void f () { ... }' does not apply to
21030 anything declared inside `f'. */
21031 saved_in_unbraced_linkage_specification_p
21034 /* Inside the function, surrounding template-parameter-lists do not
21035 apply. */
21036 saved_num_template_parameter_lists
21042 /* If the next token is `try', `__transaction_atomic', or
21043 `__transaction_relaxed`, then we are looking at either function-try-block
21044 or function-transaction-block. Note that all of these include the
21045 function-body. */
21048 RID_TRANSACTION_ATOMIC);
21050 RID_TRANSACTION_RELAXED))
21052 RID_TRANSACTION_RELAXED);
21055 else
21056 ctor_initializer_p
21061 /* Finish the function. */
21064 /* Generate code for it, if necessary. */
21066 /* Restore the saved values. */
21067 parser->in_unbraced_linkage_specification_p
21069 parser->num_template_parameter_lists
21074 }
21076 /* Parse a template-declaration, assuming that the `export' (and
21077 `extern') keywords, if present, has already been scanned. MEMBER_P
21078 is as for cp_parser_template_declaration. */
21080 static void
21082 {
21085 tree parameter_list;
21090 /* Look for the `template' keyword. */
21095 /* And the `<'. */
21099 {
21100 /* 14.5.2.2 [temp.mem]
21102 A local class shall not have member templates. */
21107 }
21108 /* [temp]
21110 A template ... shall not have C linkage. */
21112 {
21114 /* Give it C++ linkage to avoid confusing other parts of the
21115 front end. */
21118 }
21119 else
21122 /* We cannot perform access checks on the template parameter
21123 declarations until we know what is being declared, just as we
21124 cannot check the decl-specifier list. */
21127 /* If the next token is `>', then we have an invalid
21128 specialization. Rather than complain about an invalid template
21129 parameter, issue an error message here. */
21131 {
21135 }
21136 else
21137 {
21138 /* Parse the template parameters. */
21141 }
21143 /* Get the deferred access checks from the parameter list. These
21144 will be checked once we know what is being declared, as for a
21145 member template the checks must be performed in the scope of the
21146 class containing the member. */
21149 /* Look for the `>'. */
21151 /* We just processed one more parameter list. */
21153 /* If the next token is `template', there are more template
21154 parameters. */
21156 RID_TEMPLATE))
21161 else
21162 {
21163 /* There are no access checks when parsing a template, as we do not
21164 know if a specialization will be a friend. */
21168 checks,
21169 member_p,
21174 /* If this is a member template declaration, let the front
21175 end know. */
21177 {
21182 }
21186 }
21187 /* We are done with the current parameter list. */
21192 /* Finish up. */
21195 /* Check the template arguments for a literal operator template. */
21199 {
21203 else
21204 {
21208 else
21209 {
21215 }
21216 }
21220 decl);
21221 }
21222 /* Register member declarations. */
21225 /* For the erroneous case of a template with C linkage, we pushed an
21226 implicit C++ linkage scope; exit that scope now. */
21229 /* If DECL is a function template, we must return to parse it later.
21230 (Even though there is no definition, there might be default
21231 arguments that need handling.) */
21236 }
21238 /* Perform the deferred access checks from a template-parameter-list.
21239 CHECKS is a TREE_LIST of access checks, as returned by
21240 get_deferred_access_checks. */
21242 static void
21244 {
21248 }
21250 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
21251 `function-definition' sequence. MEMBER_P is true, this declaration
21252 appears in a class scope.
21254 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
21255 *FRIEND_P is set to TRUE iff the declaration is a friend. */
21257 static tree
21263 {
21266 cp_decl_specifier_seq decl_specifiers;
21270 /* This function is only used when processing a template
21271 declaration. */
21275 /* Defer access checks until we know what is being declared. */
21278 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
21279 alternative. */
21282 CP_PARSER_FLAGS_OPTIONAL,
21288 /* There are no template typedefs. */
21290 {
21294 }
21296 /* Gather up the access checks that occurred the
21297 decl-specifier-seq. */
21300 /* Check for the declaration of a template class. */
21302 {
21304 {
21307 /* In this case:
21309 struct C {
21310 friend template <typename T> struct A<T>::B;
21311 };
21313 A<T>::B will be represented by a TYPENAME_TYPE, and
21314 therefore not recognized by shadow_tag. */
21316 && !decl
21323 else
21326 /* Perform access checks for template parameters. */
21328 }
21329 }
21331 /* Complain about missing 'typename' or other invalid type names. */
21334 {
21335 /* cp_parser_parse_and_diagnose_invalid_type_name calls
21336 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
21337 the rest of this declaration. */
21340 }
21342 /* If it's not a template class, try for a template function. If
21343 the next token is a `;', then this declaration does not declare
21344 anything. But, if there were errors in the decl-specifiers, then
21345 the error might well have come from an attempted class-specifier.
21346 In that case, there's no need to warn about a missing declarator. */
21350 {
21353 checks,
21355 member_p,
21356 declares_class_or_enum,
21358 NULL);
21360 /* 7.1.1-1 [dcl.stc]
21362 A storage-class-specifier shall not be specified in an explicit
21363 specialization... */
21365 && explicit_specialization_p
21367 {
21371 }
21372 }
21374 /* Look for a trailing `;' after the declaration. */
21380 out:
21383 /* Clear any current qualification; whatever comes next is the start
21384 of something new. */
21390 }
21392 /* Parse a cast-expression that is not the operand of a unary "&". */
21394 static tree
21396 {
21399 }
21401 /* Parse a functional cast to TYPE. Returns an expression
21402 representing the cast. */
21404 static tree
21406 {
21408 tree expression_list;
21409 tree cast;
21413 {
21420 tf_warning_or_error);
21421 }
21430 else
21431 {
21434 }
21437 tf_warning_or_error);
21438 /* [expr.const]/1: In an integral constant expression "only type
21439 conversions to integral or enumeration type can be used". */
21445 NIC_CONSTRUCTOR))
21448 }
21450 /* Save the tokens that make up the body of a member function defined
21451 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
21452 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
21453 specifiers applied to the declaration. Returns the FUNCTION_DECL
21454 for the member function. */
21456 static tree
21460 tree attributes)
21461 {
21464 tree fn;
21466 /* Create the FUNCTION_DECL. */
21468 /* If something went badly wrong, bail out now. */
21470 {
21471 /* If there's a function-body, skip it. */
21476 }
21478 /* Remember it, if there default args to post process. */
21481 /* Save away the tokens that make up the body of the
21482 function. */
21484 /* We can have braced-init-list mem-initializers before the fn body. */
21486 {
21490 {
21491 /* cache_group will stop after an un-nested { } pair, too. */
21495 /* variadic mem-inits have ... after the ')'. */
21498 }
21499 }
21501 /* Handle function try blocks. */
21506 /* Save away the inline definition; we will process it when the
21507 class is complete. */
21511 /* We need to know that this was defined in the class, so that
21512 friend templates are handled correctly. */
21515 /* Add FN to the queue of functions to be parsed later. */
21519 }
21521 /* Save the tokens that make up the in-class initializer for a non-static
21522 data member. Returns a DEFAULT_ARG. */
21524 static tree
21526 {
21528 }
21530 /* Parse a template-argument-list, as well as the trailing ">" (but
21531 not the opening "<"). See cp_parser_template_argument_list for the
21532 return value. */
21534 static tree
21536 {
21537 tree arguments;
21538 tree saved_scope;
21539 tree saved_qualifying_scope;
21540 tree saved_object_scope;
21545 /* [temp.names]
21547 When parsing a template-id, the first non-nested `>' is taken as
21548 the end of the template-argument-list rather than a greater-than
21549 operator. */
21550 saved_greater_than_is_operator_p
21553 /* Parsing the argument list may modify SCOPE, so we save it
21554 here. */
21558 /* We need to evaluate the template arguments, even though this
21559 template-id may be nested within a "sizeof". */
21564 /* Parse the template-argument-list itself. */
21568 else
21570 /* Look for the `>' that ends the template-argument-list. If we find
21571 a '>>' instead, it's probably just a typo. */
21573 {
21575 {
21576 /* In C++0x, a `>>' in a template argument list or cast
21577 expression is considered to be two separate `>'
21578 tokens. So, change the current token to a `>', but don't
21579 consume it: it will be consumed later when the outer
21580 template argument list (or cast expression) is parsed.
21581 Note that this replacement of `>' for `>>' is necessary
21582 even if we are parsing tentatively: in the tentative
21583 case, after calling
21584 cp_parser_enclosed_template_argument_list we will always
21585 throw away all of the template arguments and the first
21586 closing `>', either because the template argument list
21587 was erroneous or because we are replacing those tokens
21588 with a CPP_TEMPLATE_ID token. The second `>' (which will
21589 not have been thrown away) is needed either to close an
21590 outer template argument list or to complete a new-style
21591 cast. */
21594 }
21596 {
21597 /* If we're in a nested template argument list, the '>>' has
21598 to be a typo for '> >'. We emit the error message, but we
21599 continue parsing and we push a '>' as next token, so that
21600 the argument list will be parsed correctly. Note that the
21601 global source location is still on the token before the
21602 '>>', so we need to say explicitly where we want it. */
21608 }
21609 else
21610 {
21611 /* If this is not a nested template argument list, the '>>'
21612 is a typo for '>'. Emit an error message and continue.
21613 Same deal about the token location, but here we can get it
21614 right by consuming the '>>' before issuing the diagnostic. */
21617 "spurious %<>>%>, use %<>%> to terminate "
21619 }
21620 }
21621 else
21623 /* The `>' token might be a greater-than operator again now. */
21624 parser->greater_than_is_operator_p
21626 /* Restore the SAVED_SCOPE. */
21634 }
21636 /* MEMBER_FUNCTION is a member function, or a friend. If default
21637 arguments, or the body of the function have not yet been parsed,
21638 parse them now. */
21640 static void
21642 {
21644 /* If this member is a template, get the underlying
21645 FUNCTION_DECL. */
21649 /* There should not be any class definitions in progress at this
21650 point; the bodies of members are only parsed outside of all class
21651 definitions. */
21653 /* While we're parsing the member functions we might encounter more
21654 classes. We want to handle them right away, but we don't want
21655 them getting mixed up with functions that are currently in the
21656 queue. */
21659 /* Make sure that any template parameters are in scope. */
21662 /* If the body of the function has not yet been parsed, parse it
21663 now. */
21665 {
21666 tree function_scope;
21669 /* The function is no longer pending; we are processing it. */
21674 /* If this is a local class, enter the scope of the containing
21675 function. */
21680 /* Push the body of the function onto the lexer stack. */
21683 /* Let the front end know that we going to be defining this
21684 function. */
21688 /* Don't do access checking if it is a templated function. */
21692 /* Now, parse the body of the function. */
21699 /* Leave the scope of the containing function. */
21703 }
21705 /* Remove any template parameters from the symbol table. */
21708 /* Restore the queue. */
21711 }
21713 /* If DECL contains any default args, remember it on the unparsed
21714 functions queue. */
21716 static void
21718 {
21719 tree probe;
21722 probe;
21725 {
21726 cp_default_arg_entry *entry
21732 }
21733 }
21735 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
21736 which is either a FIELD_DECL or PARM_DECL. Parse it and return
21737 the result. For a PARM_DECL, PARMTYPE is the corresponding type
21738 from the parameter-type-list. */
21740 static tree
21743 {
21745 tree parsed_arg;
21751 /* Push the saved tokens for the default argument onto the parser's
21752 lexer stack. */
21758 /* Parse the default argument. */
21766 {
21767 /* In a non-template class, check conversions now. In a template,
21768 we'll wait and instantiate these as needed. */
21771 else
21772 {
21778 }
21779 }
21781 /* If the token stream has not been completely used up, then
21782 there was extra junk after the end of the default
21783 argument. */
21785 {
21788 else
21790 }
21792 /* Revert to the main lexer. */
21796 }
21798 /* FIELD is a non-static data member with an initializer which we saved for
21799 later; parse it now. */
21801 static void
21803 {
21804 tree def;
21809 NULL_TREE);
21813 }
21815 /* FN is a FUNCTION_DECL which may contains a parameter with an
21816 unparsed DEFAULT_ARG. Parse the default args now. This function
21817 assumes that the current scope is the scope in which the default
21818 argument should be processed. */
21820 static void
21822 {
21826 /* While we're parsing the default args, we might (due to the
21827 statement expression extension) encounter more classes. We want
21828 to handle them right away, but we don't want them getting mixed
21829 up with default args that are currently in the queue. */
21832 /* Local variable names (and the `this' keyword) may not appear
21833 in a default argument. */
21844 {
21846 tree parsed_arg;
21848 tree copy;
21855 /* This can happen for a friend declaration for a function
21856 already declared with default arguments. */
21859 parsed_arg
21861 default_arg,
21864 {
21866 }
21870 /* Update any instantiations we've already created. */
21874 }
21878 /* Make sure no default arg is missing. */
21881 /* Restore the state of local_variables_forbidden_p. */
21884 /* Restore the queue. */
21886 }
21888 /* Parse the operand of `sizeof' (or a similar operator). Returns
21889 either a TYPE or an expression, depending on the form of the
21890 input. The KEYWORD indicates which kind of expression we have
21891 encountered. */
21893 static tree
21895 {
21903 /* Types cannot be defined in a `sizeof' expression. Save away the
21904 old message. */
21906 /* And create the new one. */
21912 /* The restrictions on constant-expressions do not apply inside
21913 sizeof expressions. */
21914 saved_integral_constant_expression_p
21916 saved_non_integral_constant_expression_p
21920 /* If it's a `...', then we are computing the length of a parameter
21921 pack. */
21924 {
21925 /* Consume the `...'. */
21929 /* Note that this is an expansion. */
21931 }
21933 /* Do not actually evaluate the expression. */
21936 /* If it's a `(', then we might be looking at the type-id
21937 construction. */
21939 {
21940 tree type;
21943 /* We can't be sure yet whether we're looking at a type-id or an
21944 expression. */
21946 /* Consume the `('. */
21948 /* Parse the type-id. */
21953 /* Now, look for the trailing `)'. */
21955 /* If all went well, then we're done. */
21957 {
21958 cp_decl_specifier_seq decl_specs;
21960 /* Build a trivial decl-specifier-seq. */
21964 /* Call grokdeclarator to figure out what type this is. */
21967 TYPENAME,
21970 }
21971 }
21976 /* If the type-id production did not work out, then we must be
21977 looking at the unary-expression production. */
21983 /* Build a pack expansion. */
21986 /* Go back to evaluating expressions. */
21990 /* Free the message we created. */
21992 /* And restore the old one. */
21994 parser->integral_constant_expression_p
21996 parser->non_integral_constant_expression_p
22000 }
22002 /* If the current declaration has no declarator, return true. */
22004 static bool
22006 {
22007 /* If the next token is a `;' or a `,' then there is no
22008 declarator. */
22011 }
22013 /* Update the DECL_SPECS to reflect the storage class indicated by
22014 KEYWORD. */
22016 static void
22020 location_t location)
22021 {
22022 cp_storage_class storage_class;
22025 {
22029 }
22031 {
22034 }
22038 {
22041 }
22044 {
22062 }
22065 /* A storage class specifier cannot be applied alongside a typedef
22066 specifier. If there is a typedef specifier present then set
22067 conflicting_specifiers_p which will trigger an error later
22068 on in grokdeclarator. */
22071 }
22073 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
22074 is true, the type is a class or enum definition. */
22076 static void
22078 tree type_spec,
22079 location_t location,
22081 {
22084 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
22085 (with, for example, in "typedef int wchar_t;") we remember that
22086 this is what happened. In system headers, we ignore these
22087 declarations so that G++ can work with system headers that are not
22088 C++-safe. */
22090 && !type_definition_p
22100 {
22103 {
22107 }
22108 }
22111 else
22112 {
22117 }
22118 }
22120 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
22121 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
22123 static bool
22125 {
22127 }
22129 /* Issue an error message indicating that TOKEN_DESC was expected.
22130 If KEYWORD is true, it indicated this function is called by
22131 cp_parser_require_keword and the required token can only be
22132 a indicated keyword. */
22134 static void
22136 required_token token_desc,
22138 {
22140 {
22209 }
22211 {
22213 {
22292 }
22293 }
22294 else
22296 }
22300 /* If the next token is of the indicated TYPE, consume it. Otherwise,
22301 issue an error message indicating that TOKEN_DESC was expected.
22303 Returns the token consumed, if the token had the appropriate type.
22304 Otherwise, returns NULL. */
22309 required_token token_desc)
22310 {
22313 else
22314 {
22315 /* Output the MESSAGE -- unless we're parsing tentatively. */
22319 }
22320 }
22322 /* An error message is produced if the next token is not '>'.
22323 All further tokens are skipped until the desired token is
22324 found or '{', '}', ';' or an unbalanced ')' or ']'. */
22326 static void
22328 {
22329 /* Current level of '< ... >'. */
22331 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
22334 /* Are we ready, yet? If not, issue error message. */
22338 /* Skip tokens until the desired token is found. */
22340 {
22341 /* Peek at the next token. */
22343 {
22351 /* C++0x views the `>>' operator as two `>' tokens, but
22352 C++98 does not. */
22355 {
22356 /* We've hit a `>>' where the first `>' closes the
22357 template argument list, and the second `>' is
22358 spurious. Just consume the `>>' and stop; we've
22359 already produced at least one error. */
22362 }
22363 /* Fall through for C++0x, so we handle the second `>' in
22364 the `>>'. */
22368 {
22369 /* We've reached the token we want, consume it and stop. */
22372 }
22391 /* The '>' was probably forgotten, don't look further. */
22396 }
22398 /* Consume this token. */
22400 }
22401 }
22403 /* If the next token is the indicated keyword, consume it. Otherwise,
22404 issue an error message indicating that TOKEN_DESC was expected.
22406 Returns the token consumed, if the token had the appropriate type.
22407 Otherwise, returns NULL. */
22412 required_token token_desc)
22413 {
22417 {
22420 }
22423 }
22425 /* Returns TRUE iff TOKEN is a token that can begin the body of a
22426 function-definition. */
22428 static bool
22430 {
22433 /* A ctor-initializer begins with a `:'. */
22435 /* A function-try-block begins with `try'. */
22437 /* A function-transaction-block begins with `__transaction_atomic'
22438 or `__transaction_relaxed'. */
22441 /* The named return value extension begins with `return'. */
22443 }
22445 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
22446 definition. */
22448 static bool
22450 {
22455 }
22457 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
22458 C++0x) ending a template-argument. */
22460 static bool
22462 {
22470 }
22472 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
22473 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
22475 static bool
22478 {
22484 /* Check for the sequence `<::' in the original code. It would be lexed as
22485 `[:', where `[' is a digraph, and there is no whitespace before
22486 `:'. */
22488 {
22493 }
22495 }
22497 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
22498 or none_type otherwise. */
22500 static enum tag_types
22502 {
22504 {
22514 }
22515 }
22517 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
22519 static void
22521 {
22525 {
22529 type);
22532 }
22533 }
22535 /* Issue an error message if DECL is redeclared with different
22536 access than its original declaration [class.access.spec/3].
22537 This applies to nested classes and nested class templates.
22538 [class.mem/1]. */
22540 static void
22542 {
22551 }
22553 /* Look for the `template' keyword, as a syntactic disambiguator.
22554 Return TRUE iff it is present, in which case it will be
22555 consumed. */
22557 static bool
22559 {
22561 {
22562 /* The `template' keyword can only be used within templates;
22563 outside templates the parser can always figure out what is a
22564 template and what is not. */
22566 {
22569 "%<template%> (as a disambiguator) is only allowed "
22571 /* If this part of the token stream is rescanned, the same
22572 error message would be generated. So, we purge the token
22573 from the stream. */
22576 }
22577 else
22578 {
22579 /* Consume the `template' keyword. */
22582 }
22583 }
22586 }
22588 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
22589 set PARSER->SCOPE, and perform other related actions. */
22591 static void
22593 {
22599 /* Get the stored value. */
22601 /* Perform any access checks that were deferred. */
22604 {
22609 }
22610 /* Set the scope from the stored value. */
22614 }
22616 /* Consume tokens up through a non-nested END token. Returns TRUE if we
22617 encounter the end of a block before what we were looking for. */
22619 static bool
22623 {
22625 {
22628 /* Abort a parenthesized expression if we encounter a semicolon. */
22632 /* If we've reached the end of the file, stop. */
22638 /* We've hit the end of an enclosing block, so there's been some
22639 kind of syntax error. */
22642 /* Consume the token. */
22644 /* See if it starts a new group. */
22646 {
22648 /* In theory this should probably check end == '}', but
22649 cp_parser_save_member_function_body needs it to exit
22650 after either '}' or ')' when called with ')'. */
22653 }
22655 {
22659 }
22664 }
22665 }
22667 /* Like above, for caching a default argument or NSDMI. Both of these are
22668 terminated by a non-nested comma, but it can be unclear whether or not a
22669 comma is nested in a template argument list unless we do more parsing.
22670 In order to handle this ambiguity, when we encounter a ',' after a '<'
22671 we try to parse what follows as a parameter-declaration-list (in the
22672 case of a default argument) or a member-declarator (in the case of an
22673 NSDMI). If that succeeds, then we stop caching. */
22675 static tree
22677 {
22682 tree default_argument;
22684 /* Add tokens until we have processed the entire default
22685 argument. We add the range [first_token, token). */
22688 {
22689 /* For list-initialization, this is straightforward. */
22692 }
22694 {
22697 /* Peek at the next token. */
22699 /* What we do depends on what token we have. */
22701 {
22702 /* In valid code, a default argument must be
22703 immediately followed by a `,' `)', or `...'. */
22706 {
22707 /* If we've seen a '<', we might be in a
22708 template-argument-list. Until Core issue 325 is
22709 resolved, we don't know how this situation ought
22710 to be handled, so try to DTRT. We check whether
22711 what comes after the comma is a valid parameter
22712 declaration list. If it is, then the comma ends
22713 the default argument; otherwise the default
22714 argument continues. */
22716 tree t;
22718 /* Set ITALP so cp_parser_parameter_declaration_list
22719 doesn't decide to commit to this parse. */
22727 {
22733 }
22734 else
22735 {
22741 }
22748 }
22751 /* If we run into a non-nested `;', `}', or `]',
22752 then the code is invalid -- but the default
22753 argument is certainly over. */
22759 /* Update DEPTH, if necessary. */
22774 /* This might be the comparison operator, or it might
22775 start a template argument list. */
22782 /* Fall through for C++0x, which treats the `>>'
22783 operator like two `>' tokens in certain
22784 cases. */
22788 {
22789 /* This might be an operator, or it might close a
22790 template argument list. But if a previous '<'
22791 started a template argument list, this will have
22792 closed it, so we can't be in one anymore. */
22796 }
22799 /* If we run out of tokens, issue an error message. */
22808 /* In these cases, we should look for template-ids.
22809 For example, if the default argument is
22810 `X<int, double>()', we need to do name lookup to
22811 figure out whether or not `X' is a template; if
22812 so, the `,' does not end the default argument.
22814 That is not yet done. */
22819 }
22821 /* If we've reached the end, stop. */
22825 /* Add the token to the token block. */
22827 }
22829 /* Create a DEFAULT_ARG to represent the unparsed default
22830 argument. */
22837 }
22839 /* Begin parsing tentatively. We always save tokens while parsing
22840 tentatively so that if the tentative parsing fails we can restore the
22841 tokens. */
22843 static void
22845 {
22846 /* Enter a new parsing context. */
22848 /* Begin saving tokens. */
22850 /* In order to avoid repetitive access control error messages,
22851 access checks are queued up until we are no longer parsing
22852 tentatively. */
22854 }
22856 /* Commit to the currently active tentative parse. */
22858 static void
22860 {
22864 /* Mark all of the levels as committed. */
22867 {
22874 }
22875 }
22877 /* Abort the currently active tentative parse. All consumed tokens
22878 will be rolled back, and no diagnostics will be issued. */
22880 static void
22882 {
22886 /* Now, pretend that we want to see if the construct was
22887 successfully parsed. */
22889 }
22891 /* Stop parsing tentatively. If a parse error has occurred, restore the
22892 token stream. Otherwise, commit to the tokens we have consumed.
22893 Returns true if no error occurred; false otherwise. */
22895 static bool
22897 {
22901 /* Remember whether or not an error occurred, since we are about to
22902 destroy that information. */
22904 /* Remove the topmost context from the stack. */
22907 /* If no parse errors occurred, commit to the tentative parse. */
22909 {
22910 /* Commit to the tokens read tentatively, unless that was
22911 already done. */
22916 }
22917 /* Otherwise, if errors occurred, roll back our state so that things
22918 are just as they were before we began the tentative parse. */
22919 else
22920 {
22923 }
22924 /* Add the context to the front of the free list. */
22929 }
22931 /* Returns true if we are parsing tentatively and are not committed to
22932 this tentative parse. */
22934 static bool
22936 {
22939 }
22941 /* Returns nonzero iff an error has occurred during the most recent
22942 tentative parse. */
22944 static bool
22946 {
22949 }
22951 /* Returns nonzero if GNU extensions are allowed. */
22953 static bool
22955 {
22957 }
22958 \f
22959 /* Objective-C++ Productions */
22962 /* Parse an Objective-C expression, which feeds into a primary-expression
22963 above.
22965 objc-expression:
22966 objc-message-expression
22967 objc-string-literal
22968 objc-encode-expression
22969 objc-protocol-expression
22970 objc-selector-expression
22972 Returns a tree representation of the expression. */
22974 static tree
22976 {
22977 /* Try to figure out what kind of declaration is present. */
22981 {
22991 {
23003 }
23009 }
23012 }
23014 /* Parse an Objective-C message expression.
23016 objc-message-expression:
23017 [ objc-message-receiver objc-message-args ]
23019 Returns a representation of an Objective-C message. */
23021 static tree
23023 {
23032 }
23034 /* Parse an objc-message-receiver.
23036 objc-message-receiver:
23037 expression
23038 simple-type-specifier
23040 Returns a representation of the type or expression. */
23042 static tree
23044 {
23045 tree rcv;
23047 /* An Objective-C message receiver may be either (1) a type
23048 or (2) an expression. */
23057 CP_PARSER_FLAGS_NONE);
23060 }
23062 /* Parse the arguments and selectors comprising an Objective-C message.
23064 objc-message-args:
23065 objc-selector
23066 objc-selector-args
23067 objc-selector-args , objc-comma-args
23069 objc-selector-args:
23070 objc-selector [opt] : assignment-expression
23071 objc-selector-args objc-selector [opt] : assignment-expression
23073 objc-comma-args:
23074 assignment-expression
23075 objc-comma-args , assignment-expression
23077 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
23078 selector arguments and TREE_VALUE containing a list of comma
23079 arguments. */
23081 static tree
23083 {
23089 {
23095 /* Detect if we have a unary selector. */
23104 sel_args
23109 }
23111 /* Handle non-selector arguments, if any. */
23113 {
23114 tree arg;
23119 addl_args
23124 }
23127 {
23130 }
23133 }
23135 /* Parse an Objective-C encode expression.
23137 objc-encode-expression:
23138 @encode objc-typename
23140 Returns an encoded representation of the type argument. */
23142 static tree
23144 {
23145 tree type;
23155 {
23159 }
23161 /* This happens if we find @encode(T) (where T is a template
23162 typename or something dependent on a template typename) when
23163 parsing a template. In that case, we can't compile it
23164 immediately, but we rather create an AT_ENCODE_EXPR which will
23165 need to be instantiated when the template is used.
23166 */
23168 {
23172 }
23175 }
23177 /* Parse an Objective-C @defs expression. */
23179 static tree
23181 {
23182 tree name;
23190 }
23192 /* Parse an Objective-C protocol expression.
23194 objc-protocol-expression:
23195 @protocol ( identifier )
23197 Returns a representation of the protocol expression. */
23199 static tree
23201 {
23202 tree proto;
23210 }
23212 /* Parse an Objective-C selector expression.
23214 objc-selector-expression:
23215 @selector ( objc-method-signature )
23217 objc-method-signature:
23218 objc-selector
23219 objc-selector-seq
23221 objc-selector-seq:
23222 objc-selector :
23223 objc-selector-seq objc-selector :
23225 Returns a representation of the method selector. */
23227 static tree
23229 {
23241 {
23250 {
23251 /* Detect if we have a unary selector. */
23253 {
23256 }
23257 else
23258 {
23260 }
23261 }
23266 {
23267 sel_seq
23270 sel_seq
23273 }
23274 else
23275 sel_seq
23280 }
23282 finish_selector:
23286 }
23288 /* Parse a list of identifiers.
23290 objc-identifier-list:
23291 identifier
23292 objc-identifier-list , identifier
23294 Returns a TREE_LIST of identifier nodes. */
23296 static tree
23298 {
23299 tree identifier;
23300 tree list;
23311 {
23318 identifier));
23320 }
23323 }
23325 /* Parse an Objective-C alias declaration.
23327 objc-alias-declaration:
23328 @compatibility_alias identifier identifier ;
23330 This function registers the alias mapping with the Objective-C front end.
23331 It returns nothing. */
23333 static void
23335 {
23343 }
23345 /* Parse an Objective-C class forward-declaration.
23347 objc-class-declaration:
23348 @class objc-identifier-list ;
23350 The function registers the forward declarations with the Objective-C
23351 front end. It returns nothing. */
23353 static void
23355 {
23358 {
23359 tree id;
23369 else
23371 }
23373 }
23375 /* Parse a list of Objective-C protocol references.
23377 objc-protocol-refs-opt:
23378 objc-protocol-refs [opt]
23380 objc-protocol-refs:
23381 < objc-identifier-list >
23383 Returns a TREE_LIST of identifiers, if any. */
23385 static tree
23387 {
23391 {
23395 }
23398 }
23400 /* Parse a Objective-C visibility specification. */
23402 static void
23404 {
23408 {
23423 }
23425 /* Eat '@private'/'@protected'/'@public'. */
23427 }
23429 /* Parse an Objective-C method type. Return 'true' if it is a class
23430 (+) method, and 'false' if it is an instance (-) method. */
23434 {
23437 else
23439 }
23441 /* Parse an Objective-C protocol qualifier. */
23443 static tree
23445 {
23458 {
23463 }
23466 }
23468 /* Parse an Objective-C typename. */
23470 static tree
23472 {
23476 {
23482 /* An ObjC type name may consist of just protocol qualifiers, in which
23483 case the type shall default to 'id'. */
23485 {
23488 /* If the type could not be parsed, an error has already
23489 been produced. For error recovery, behave as if it had
23490 not been specified, which will use the default type
23491 'id'. */
23493 {
23495 /* We need to skip to the closing parenthesis as
23496 cp_parser_type_id() does not seem to do it for
23497 us. */
23502 }
23503 }
23507 }
23510 }
23512 /* Check to see if TYPE refers to an Objective-C selector name. */
23514 static bool
23516 {
23522 }
23524 /* Parse an Objective-C selector. */
23526 static tree
23528 {
23532 {
23535 }
23537 /* C++ operator names are allowed to appear in ObjC selectors. */
23539 {
23552 }
23553 }
23555 /* Parse an Objective-C params list. */
23557 static tree
23559 {
23565 {
23575 /* Detect if we have a unary selector. */
23578 {
23581 }
23585 {
23586 /* Something went quite wrong. There should be a colon
23587 here, but there is not. Stop parsing parameters. */
23589 }
23591 /* New ObjC allows attributes on parameters too. */
23596 params
23599 type_name,
23600 identifier,
23601 parm_attr));
23604 }
23607 {
23610 }
23612 /* We allow tail attributes for the method. */
23614 {
23622 }
23625 {
23628 }
23630 }
23632 /* Parse the non-keyword Objective-C params. */
23634 static tree
23637 {
23643 {
23645 tree parm;
23651 {
23656 }
23658 /* TODO: parse attributes for tail parameters. */
23667 }
23669 /* We allow tail attributes for the method. */
23671 {
23673 {
23678 }
23679 else
23680 /* We have an error, but parse the attributes, so that we can
23681 carry on. */
23687 }
23690 }
23692 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
23694 static void
23696 {
23699 /* If the next token is `extern' and the following token is a string
23700 literal, then we have a linkage specification. */
23702 && cp_parser_is_pure_string_literal
23705 /* Handle #pragma, if any. */
23708 /* Allow stray semicolons. */
23711 /* Mark methods as optional or required, when building protocols. */
23713 {
23716 }
23718 {
23721 }
23724 /* Other stray characters must generate errors. */
23726 {
23730 }
23731 /* Finally, try to parse a block-declaration, or a function-definition. */
23732 else
23734 }
23736 /* Parse a method signature. */
23738 static tree
23740 {
23756 }
23758 static bool
23760 {
23761 tree tattr;
23766 /* If the attributes are followed by a method introducer, this is not allowed.
23767 Dump the attributes and flag the situation. */
23772 /* Otherwise, the attributes introduce some interstitial code, possibly so
23773 rewind to allow that check. */
23776 }
23778 /* Parse an Objective-C method prototype list. */
23780 static void
23782 {
23786 {
23788 {
23793 else
23797 {
23801 }
23804 }
23810 OPT_Wattributes,
23812 else
23813 /* Allow for interspersed non-ObjC++ code. */
23817 }
23821 else
23825 }
23827 /* Parse an Objective-C method definition list. */
23829 static void
23831 {
23835 {
23836 tree meth;
23839 {
23845 else
23850 {
23854 }
23856 NULL_TREE);
23858 /* For historical reasons, we accept an optional semicolon. */
23865 {
23872 }
23873 }
23874 /* The following case will be removed once @synthesize is
23875 completely implemented. */
23886 else
23887 /* Allow for interspersed non-ObjC++ code. */
23891 }
23895 else
23899 }
23901 /* Parse Objective-C ivars. */
23903 static void
23905 {
23916 {
23917 cp_decl_specifier_seq declspecs;
23919 tree prefix_attributes;
23927 CP_PARSER_FLAGS_OPTIONAL,
23931 /* auto, register, static, extern, mutable. */
23933 {
23936 }
23938 /* __thread. */
23940 {
23943 }
23945 /* typedef. */
23947 {
23950 }
23955 /* Keep going until we hit the `;' at the end of the
23956 declaration. */
23958 {
23963 /* Check for a (possibly unnamed) bitfield declaration. */
23971 {
23972 /* Get the name of the bitfield. */
23975 sfk_none);
23977 eat_colon:
23979 /* Get the width of the bitfield. */
23980 width
23983 NULL);
23984 }
23985 else
23986 {
23987 /* Parse the declarator. */
23988 declarator
23993 }
23995 /* Look for attributes that apply to the ivar. */
23997 /* Remember which attributes are prefix attributes and
23998 which are not. */
24000 /* Combine the attributes. */
24004 /* Create the bitfield declaration. */
24006 width,
24007 attributes);
24008 else
24013 /* Add the instance variable. */
24017 /* Reset PREFIX_ATTRIBUTES. */
24026 {
24029 }
24031 }
24035 }
24040 /* Do not consume the RID_AT_END, so it will be read again as terminating
24041 the @interface of @implementation. */
24045 /* For historical reasons, we accept an optional semicolon. */
24048 }
24050 /* Parse an Objective-C protocol declaration. */
24052 static void
24054 {
24060 {
24065 }
24067 /* See if we have a forward declaration or a definition. */
24070 /* Try a forward declaration first. */
24072 {
24074 {
24075 tree id;
24085 else
24087 }
24089 }
24091 /* Ok, we got a full-fledged definition (or at least should). */
24092 else
24093 {
24098 }
24099 }
24101 /* Parse an Objective-C superclass or category. */
24103 static void
24108 {
24114 {
24117 }
24119 {
24122 /* If there is no category name, and this is an @interface, we
24123 have a class extension. */
24125 {
24128 }
24129 else
24133 }
24134 }
24136 /* Parse an Objective-C class interface. */
24138 static void
24140 {
24147 {
24148 /* It's hard to recover because even if valid @interface stuff
24149 is to follow, we can't compile it (or validate it) if we
24150 don't even know which class it refers to. Let's assume this
24151 was a stray '@interface' token in the stream and skip it.
24152 */
24154 }
24159 /* We have either a class or a category on our hands. */
24162 else
24163 {
24165 /* Handle instance variable declarations, if any. */
24168 }
24171 }
24173 /* Parse an Objective-C class implementation. */
24175 static void
24177 {
24184 {
24185 /* It's hard to recover because even if valid @implementation
24186 stuff is to follow, we can't compile it (or validate it) if
24187 we don't even know which class it refers to. Let's assume
24188 this was a stray '@implementation' token in the stream and
24189 skip it.
24190 */
24192 }
24196 /* We have either a class or a category on our hands. */
24199 else
24200 {
24202 /* Handle instance variable declarations, if any. */
24205 }
24208 }
24210 /* Consume the @end token and finish off the implementation. */
24212 static void
24214 {
24217 }
24219 /* Parse an Objective-C declaration. */
24221 static void
24223 {
24224 /* Try to figure out what kind of declaration is present. */
24229 {
24245 }
24248 {
24271 }
24272 }
24274 /* Parse an Objective-C try-catch-finally statement.
24276 objc-try-catch-finally-stmt:
24277 @try compound-statement objc-catch-clause-seq [opt]
24278 objc-finally-clause [opt]
24280 objc-catch-clause-seq:
24281 objc-catch-clause objc-catch-clause-seq [opt]
24283 objc-catch-clause:
24284 @catch ( objc-exception-declaration ) compound-statement
24286 objc-finally-clause:
24287 @finally compound-statement
24289 objc-exception-declaration:
24290 parameter-declaration
24291 '...'
24293 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
24295 Returns NULL_TREE.
24297 PS: This function is identical to c_parser_objc_try_catch_finally_statement
24298 for C. Keep them in sync. */
24300 static tree
24302 {
24303 location_t location;
24304 tree stmt;
24309 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
24310 node, lest it get absorbed into the surrounding block. */
24316 {
24325 {
24326 /* We have "@catch (...)" (where the '...' are literally
24327 what is in the code). Skip the '...'.
24328 parameter_declaration is set to NULL_TREE, and
24329 objc_being_catch_clauses() knows that that means
24330 '...'. */
24333 }
24334 else
24335 {
24336 /* We have "@catch (NSException *exception)" or something
24337 like that. Parse the parameter declaration. */
24341 else
24346 }
24349 else
24350 {
24351 /* If there was no open parenthesis, we are recovering from
24352 an error, and we are trying to figure out what mistake
24353 the user has made. */
24355 /* If there is an immediate closing parenthesis, the user
24356 probably forgot the opening one (ie, they typed "@catch
24357 NSException *e)". Parse the closing parenthesis and keep
24358 going. */
24362 /* If these is no immediate closing parenthesis, the user
24363 probably doesn't know that parenthesis are required at
24364 all (ie, they typed "@catch NSException *e"). So, just
24365 forget about the closing parenthesis and keep going. */
24366 }
24370 }
24372 {
24375 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
24376 node, lest it get absorbed into the surrounding block. */
24380 }
24383 }
24385 /* Parse an Objective-C synchronized statement.
24387 objc-synchronized-stmt:
24388 @synchronized ( expression ) compound-statement
24390 Returns NULL_TREE. */
24392 static tree
24394 {
24395 location_t location;
24406 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
24407 node, lest it get absorbed into the surrounding block. */
24412 }
24414 /* Parse an Objective-C throw statement.
24416 objc-throw-stmt:
24417 @throw assignment-expression [opt] ;
24419 Returns a constructed '@throw' statement. */
24421 static tree
24423 {
24435 }
24437 /* Parse an Objective-C statement. */
24439 static tree
24441 {
24442 /* Try to figure out what kind of declaration is present. */
24446 {
24457 }
24460 }
24462 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
24463 look ahead to see if an objc keyword follows the attributes. This
24464 is to detect the use of prefix attributes on ObjC @interface and
24465 @protocol. */
24467 static bool
24469 {
24474 {
24477 }
24480 }
24482 /* This routine is a minimal replacement for
24483 c_parser_struct_declaration () used when parsing the list of
24484 types/names or ObjC++ properties. For example, when parsing the
24485 code
24487 @property (readonly) int a, b, c;
24489 this function is responsible for parsing "int a, int b, int c" and
24490 returning the declarations as CHAIN of DECLs.
24492 TODO: Share this code with cp_parser_objc_class_ivars. It's very
24493 similar parsing. */
24494 static tree
24496 {
24498 cp_decl_specifier_seq declspecs;
24500 tree prefix_attributes;
24503 CP_PARSER_FLAGS_NONE,
24510 /* auto, register, static, extern, mutable. */
24512 {
24515 }
24517 /* __thread. */
24519 {
24522 }
24524 /* typedef. */
24526 {
24529 }
24534 /* Keep going until we hit the `;' at the end of the declaration. */
24536 {
24541 /* Parse the declarator. */
24545 /* Look for attributes that apply to the ivar. */
24547 /* Remember which attributes are prefix attributes and
24548 which are not. */
24550 /* Combine the attributes. */
24560 /* Reset PREFIX_ATTRIBUTES. */
24571 {
24574 }
24575 else
24577 }
24579 }
24581 /* Parse an Objective-C @property declaration. The syntax is:
24583 objc-property-declaration:
24584 '@property' objc-property-attributes[opt] struct-declaration ;
24586 objc-property-attributes:
24587 '(' objc-property-attribute-list ')'
24589 objc-property-attribute-list:
24590 objc-property-attribute
24591 objc-property-attribute-list, objc-property-attribute
24593 objc-property-attribute
24594 'getter' = identifier
24595 'setter' = identifier
24596 'readonly'
24597 'readwrite'
24598 'assign'
24599 'retain'
24600 'copy'
24601 'nonatomic'
24603 For example:
24604 @property NSString *name;
24605 @property (readonly) id object;
24606 @property (retain, nonatomic, getter=getTheName) id name;
24607 @property int a, b, c;
24609 PS: This function is identical to
24610 c_parser_objc_at_property_declaration for C. Keep them in sync. */
24611 static void
24613 {
24614 /* The following variables hold the attributes of the properties as
24615 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
24616 seen. When we see an attribute, we set them to 'true' (if they
24617 are boolean properties) or to the identifier (if they have an
24618 argument, ie, for getter and setter). Note that here we only
24619 parse the list of attributes, check the syntax and accumulate the
24620 attributes that we find. objc_add_property_declaration() will
24621 then process the information. */
24631 /* 'properties' is the list of properties that we read. Usually a
24632 single one, but maybe more (eg, in "@property int a, b, c;" there
24633 are three). */
24634 tree properties;
24635 location_t loc;
24641 /* Parse the optional attribute list... */
24643 {
24644 /* Eat the '('. */
24648 {
24654 {
24657 }
24661 {
24672 {
24676 else
24681 }
24684 {
24688 }
24690 {
24692 {
24695 }
24696 else
24700 else
24702 }
24703 else
24704 {
24706 {
24709 }
24710 else
24712 }
24718 }
24725 else
24727 }
24729 /* FIXME: "@property (setter, assign);" will generate a spurious
24730 "error: expected ‘)’ before ‘,’ token". This is because
24731 cp_parser_require, unlike the C counterpart, will produce an
24732 error even if we are in error recovery. */
24734 {
24739 }
24740 }
24742 /* ... and the property declaration(s). */
24746 {
24748 /* If the next token is now a `;', consume it. */
24752 }
24756 else
24757 {
24758 /* Comma-separated properties are chained together in
24759 reverse order; add them one by one. */
24768 }
24771 }
24773 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
24775 objc-synthesize-declaration:
24776 @synthesize objc-synthesize-identifier-list ;
24778 objc-synthesize-identifier-list:
24779 objc-synthesize-identifier
24780 objc-synthesize-identifier-list, objc-synthesize-identifier
24782 objc-synthesize-identifier
24783 identifier
24784 identifier = identifier
24786 For example:
24787 @synthesize MyProperty;
24788 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
24790 PS: This function is identical to c_parser_objc_at_synthesize_declaration
24791 for C. Keep them in sync.
24792 */
24793 static void
24795 {
24797 location_t loc;
24802 {
24806 {
24809 }
24811 {
24815 {
24818 }
24819 }
24820 else
24825 else
24827 }
24830 }
24832 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
24834 objc-dynamic-declaration:
24835 @dynamic identifier-list ;
24837 For example:
24838 @dynamic MyProperty;
24839 @dynamic MyProperty, AnotherProperty;
24841 PS: This function is identical to c_parser_objc_at_dynamic_declaration
24842 for C. Keep them in sync.
24843 */
24844 static void
24846 {
24848 location_t loc;
24853 {
24854 tree property;
24857 {
24860 }
24864 else
24866 }
24869 }
24871 \f
24872 /* OpenMP 2.5 parsing routines. */
24874 /* Returns name of the next clause.
24875 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
24876 the token is not consumed. Otherwise appropriate pragma_omp_clause is
24877 returned and the token is consumed. */
24879 static pragma_omp_clause
24881 {
24891 {
24896 {
24943 }
24944 }
24950 }
24952 /* Validate that a clause of the given type does not already exist. */
24954 static void
24957 {
24958 tree c;
24962 {
24965 }
24966 }
24968 /* OpenMP 2.5:
24969 variable-list:
24970 identifier
24971 variable-list , identifier
24973 In addition, we match a closing parenthesis. An opening parenthesis
24974 will have been consumed by the caller.
24976 If KIND is nonzero, create the appropriate node and install the decl
24977 in OMP_CLAUSE_DECL and add the node to the head of the list.
24979 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
24980 return the list created. */
24982 static tree
24984 tree list)
24985 {
24988 {
25005 {
25010 }
25011 else
25014 get_comma:
25018 }
25021 {
25024 /* Try to resync to an unnested comma. Copied from
25025 cp_parser_parenthesized_expression_list. */
25026 skip_comma:
25033 }
25036 }
25038 /* Similarly, but expect leading and trailing parenthesis. This is a very
25039 common case for omp clauses. */
25041 static tree
25043 {
25047 }
25049 /* OpenMP 3.0:
25050 collapse ( constant-expression ) */
25052 static tree
25054 {
25056 location_t loc;
25057 HOST_WIDE_INT n;
25077 {
25080 }
25088 }
25090 /* OpenMP 2.5:
25091 default ( shared | none ) */
25093 static tree
25095 {
25097 tree c;
25102 {
25107 {
25122 }
25125 }
25126 else
25127 {
25128 invalid_kind:
25130 }
25146 }
25148 /* OpenMP 3.1:
25149 final ( expression ) */
25151 static tree
25153 {
25174 }
25176 /* OpenMP 2.5:
25177 if ( expression ) */
25179 static tree
25181 {
25202 }
25204 /* OpenMP 3.1:
25205 mergeable */
25207 static tree
25210 {
25211 tree c;
25214 location);
25219 }
25221 /* OpenMP 2.5:
25222 nowait */
25224 static tree
25227 {
25228 tree c;
25235 }
25237 /* OpenMP 2.5:
25238 num_threads ( expression ) */
25240 static tree
25242 location_t location)
25243 {
25265 }
25267 /* OpenMP 2.5:
25268 ordered */
25270 static tree
25273 {
25274 tree c;
25282 }
25284 /* OpenMP 2.5:
25285 reduction ( reduction-operator : variable-list )
25287 reduction-operator:
25288 One of: + * - & ^ | && ||
25290 OpenMP 3.1:
25292 reduction-operator:
25293 One of: + * - & ^ | && || min max */
25295 static tree
25297 {
25305 {
25331 {
25336 {
25339 }
25341 {
25344 }
25345 }
25346 /* FALLTHROUGH */
25350 resync_fail:
25355 }
25366 }
25368 /* OpenMP 2.5:
25369 schedule ( schedule-kind )
25370 schedule ( schedule-kind , expression )
25372 schedule-kind:
25373 static | dynamic | guided | runtime | auto */
25375 static tree
25377 {
25386 {
25391 {
25412 }
25413 }
25418 else
25423 {
25438 else
25443 }
25451 invalid_kind:
25453 resync_fail:
25458 }
25460 /* OpenMP 3.0:
25461 untied */
25463 static tree
25466 {
25467 tree c;
25474 }
25476 /* Parse all OpenMP clauses. The set clauses allowed by the directive
25477 is a bitmask in MASK. Return the list of clauses found; the result
25478 of clause default goes in *pdefault. */
25480 static tree
25483 {
25489 {
25490 pragma_omp_clause c_kind;
25502 {
25514 clauses);
25528 clauses);
25537 clauses);
25561 clauses);
25575 clauses);
25586 }
25589 {
25590 /* Remove the invalid clause(s) from the list to avoid
25591 confusing the rest of the compiler. */
25594 }
25595 }
25596 saw_error:
25599 }
25601 /* OpenMP 2.5:
25602 structured-block:
25603 statement
25605 In practice, we're also interested in adding the statement to an
25606 outer node. So it is convenient if we work around the fact that
25607 cp_parser_statement calls add_stmt. */
25609 static unsigned
25611 {
25614 /* Only move the values to IN_OMP_BLOCK if they weren't false.
25615 This preserves the "not within loop or switch" style error messages
25616 for nonsense cases like
25617 void foo() {
25618 #pragma omp single
25619 break;
25620 }
25621 */
25626 }
25628 static void
25630 {
25632 }
25634 static tree
25636 {
25644 }
25646 /* OpenMP 2.5:
25647 # pragma omp atomic new-line
25648 expression-stmt
25650 expression-stmt:
25651 x binop= expr | x++ | ++x | x-- | --x
25652 binop:
25653 +, *, -, /, &, ^, |, <<, >>
25655 where x is an lvalue expression with scalar type.
25657 OpenMP 3.1:
25658 # pragma omp atomic new-line
25659 update-stmt
25661 # pragma omp atomic read new-line
25662 read-stmt
25664 # pragma omp atomic write new-line
25665 write-stmt
25667 # pragma omp atomic update new-line
25668 update-stmt
25670 # pragma omp atomic capture new-line
25671 capture-stmt
25673 # pragma omp atomic capture new-line
25674 capture-block
25676 read-stmt:
25677 v = x
25678 write-stmt:
25679 x = expr
25680 update-stmt:
25681 expression-stmt | x = x binop expr
25682 capture-stmt:
25683 v = x binop= expr | v = x++ | v = ++x | v = x-- | v = --x
25684 capture-block:
25685 { v = x; update-stmt; } | { update-stmt; v = x; }
25687 where x and v are lvalue expressions with scalar type. */
25689 static void
25691 {
25698 {
25710 else
25714 }
25718 {
25729 else
25735 {
25736 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
25737 opcode. */
25742 }
25746 {
25749 }
25750 else
25751 {
25758 }
25761 }
25763 restart:
25768 {
25775 /* FALLTHROUGH */
25785 /* FALLTHROUGH */
25800 /* Undo effects of boolean_increment for post {in,de}crement. */
25802 /* FALLTHRU */
25806 {
25807 /* Undo effects of boolean_increment. */
25809 {
25810 /* This is pre or post increment. */
25815 && !structured_block
25819 }
25820 }
25821 /* FALLTHRU */
25824 {
25854 {
25864 {
25867 {
25875 }
25910 }
25921 }
25922 /* FALLTHROUGH */
25927 }
25934 }
25935 stmt_done:
25937 {
25950 }
25952 {
25955 }
25956 done:
25962 saw_error:
25965 {
25969 {
25973 }
25974 }
25975 }
25978 /* OpenMP 2.5:
25979 # pragma omp barrier new-line */
25981 static void
25983 {
25986 }
25988 /* OpenMP 2.5:
25989 # pragma omp critical [(name)] new-line
25990 structured-block */
25992 static tree
25994 {
25998 {
26010 }
26015 }
26017 /* OpenMP 2.5:
26018 # pragma omp flush flush-vars[opt] new-line
26020 flush-vars:
26021 ( variable-list ) */
26023 static void
26025 {
26031 }
26033 /* Helper function, to parse omp for increment expression. */
26035 static tree
26037 {
26042 {
26045 }
26048 {
26056 }
26058 /* If decl is an iterator, preserve LHS and RHS of the relational
26059 expr until finish_omp_for. */
26069 }
26071 /* Helper function, to parse omp for increment expression. */
26073 static tree
26075 {
26079 cp_id_kind idk;
26083 {
26091 }
26099 {
26104 }
26111 {
26115 }
26127 do
26128 {
26135 {
26137 {
26140 else
26142 }
26143 else
26146 }
26147 }
26151 {
26155 }
26156 else
26160 }
26162 /* Parse the restricted form of the for statement allowed by OpenMP. */
26164 static tree
26166 {
26170 location_t loc_first;
26189 {
26192 location_t loc;
26195 {
26198 }
26207 {
26208 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
26210 init-expr:
26211 var = lb
26212 integer-type var = lb
26213 random-access-iterator-type var = lb
26214 pointer-type var = lb
26215 */
26216 cp_decl_specifier_seq type_specifiers;
26218 /* First, try to parse as an initialized declaration. See
26219 cp_parser_condition, from whence the bulk of this is copied. */
26226 {
26227 /* If parsing a type specifier seq succeeded, then this
26228 MUST be a initialized declaration. */
26233 CP_PARSER_DECLARATOR_NAMED,
26243 else
26244 {
26254 {
26256 CPP_OPEN_PAREN))
26259 else
26260 /* Trigger an error. */
26265 }
26269 {
26277 {
26280 auto_node);
26285 }
26288 asm_specification,
26289 LOOKUP_ONLYCONVERTING);
26291 {
26294 }
26295 else
26298 }
26299 else
26300 {
26301 /* Consume '='. */
26305 non_class:
26308 else
26311 asm_specification,
26312 LOOKUP_ONLYCONVERTING);
26313 }
26317 }
26318 }
26319 else
26320 {
26321 cp_id_kind idk;
26322 /* If parsing a type specifier sequence failed, then
26323 this MUST be a simple expression. */
26328 && decl
26331 {
26332 tree rhs;
26338 rhs,
26339 tf_warning_or_error));
26341 }
26342 else
26343 {
26348 {
26352 }
26353 }
26354 }
26355 }
26358 {
26361 {
26367 }
26368 else
26370 }
26375 {
26380 {
26384 }
26387 {
26388 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
26389 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
26398 }
26399 else
26400 {
26405 }
26406 }
26409 {
26410 tree c;
26412 {
26421 decl);
26425 decl);
26426 }
26428 {
26433 {
26436 }
26437 }
26438 }
26447 {
26448 /* If decl is an iterator, preserve the operator on decl
26449 until finish_omp_for. */
26451 && ((processing_template_decl
26455 else
26457 }
26472 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
26473 in between the collapsed for loops to be still considered perfectly
26474 nested. Hopefully the final version clarifies this.
26475 For now handle (multiple) {'s and empty statements. */
26477 do
26478 {
26482 {
26484 bracecount++;
26485 }
26489 else
26490 {
26497 }
26498 }
26502 {
26505 }
26506 }
26508 /* Note that we saved the original contents of this flag when we entered
26509 the structured block, and so we don't need to re-save it here. */
26512 /* Note that the grammar doesn't call for a structured block here,
26513 though the loop as a whole is a structured block. */
26520 else
26525 {
26527 {
26529 nbraces--;
26530 }
26533 else
26534 {
26536 {
26539 }
26544 }
26545 }
26552 }
26554 /* OpenMP 2.5:
26555 #pragma omp for for-clause[optseq] new-line
26556 for-loop */
26558 #define OMP_FOR_CLAUSE_MASK \
26559 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26560 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26561 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
26562 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26563 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
26564 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
26565 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT) \
26566 | (1u << PRAGMA_OMP_CLAUSE_COLLAPSE))
26568 static tree
26570 {
26586 }
26588 /* OpenMP 2.5:
26589 # pragma omp master new-line
26590 structured-block */
26592 static tree
26594 {
26598 }
26600 /* OpenMP 2.5:
26601 # pragma omp ordered new-line
26602 structured-block */
26604 static tree
26606 {
26610 }
26612 /* OpenMP 2.5:
26614 section-scope:
26615 { section-sequence }
26617 section-sequence:
26618 section-directive[opt] structured-block
26619 section-sequence section-directive structured-block */
26621 static tree
26623 {
26634 {
26641 {
26651 }
26657 }
26660 {
26668 {
26672 }
26674 {
26677 }
26682 }
26693 }
26695 /* OpenMP 2.5:
26696 # pragma omp sections sections-clause[optseq] newline
26697 sections-scope */
26699 #define OMP_SECTIONS_CLAUSE_MASK \
26700 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26701 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26702 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
26703 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26704 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
26706 static tree
26708 {
26719 }
26721 /* OpenMP 2.5:
26722 # pragma parallel parallel-clause new-line
26723 # pragma parallel for parallel-for-clause new-line
26724 # pragma parallel sections parallel-sections-clause new-line */
26726 #define OMP_PARALLEL_CLAUSE_MASK \
26727 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
26728 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26729 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26730 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
26731 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
26732 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
26733 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26734 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
26736 static tree
26738 {
26747 {
26753 }
26755 {
26759 {
26765 }
26766 }
26773 {
26793 }
26800 }
26802 /* OpenMP 2.5:
26803 # pragma omp single single-clause[optseq] new-line
26804 structured-block */
26806 #define OMP_SINGLE_CLAUSE_MASK \
26807 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26808 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26809 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
26810 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
26812 static tree
26814 {
26824 }
26826 /* OpenMP 3.0:
26827 # pragma omp task task-clause[optseq] new-line
26828 structured-block */
26830 #define OMP_TASK_CLAUSE_MASK \
26831 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
26832 | (1u << PRAGMA_OMP_CLAUSE_UNTIED) \
26833 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
26834 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26835 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26836 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
26837 | (1u << PRAGMA_OMP_CLAUSE_FINAL) \
26838 | (1u << PRAGMA_OMP_CLAUSE_MERGEABLE))
26840 static tree
26842 {
26853 }
26855 /* OpenMP 3.0:
26856 # pragma omp taskwait new-line */
26858 static void
26860 {
26863 }
26865 /* OpenMP 3.1:
26866 # pragma omp taskyield new-line */
26868 static void
26870 {
26873 }
26875 /* OpenMP 2.5:
26876 # pragma omp threadprivate (variable-list) */
26878 static void
26880 {
26881 tree vars;
26887 }
26889 /* Main entry point to OpenMP statement pragmas. */
26891 static void
26893 {
26894 tree stmt;
26897 {
26927 }
26931 }
26932 \f
26933 /* Transactional Memory parsing routines. */
26935 /* Parse a transaction attribute.
26937 txn-attribute:
26938 attribute
26939 [ [ identifier ] ]
26941 ??? Simplify this when C++0x bracket attributes are
26942 implemented properly. */
26944 static tree
26946 {
26961 {
26965 /* For keywords, use the canonical spelling,
26966 not the parsed identifier. */
26970 }
26971 else
26975 error1:
26978 }
26980 /* Parse a __transaction_atomic or __transaction_relaxed statement.
26982 transaction-statement:
26983 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
26984 compound-statement
26985 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
26986 */
26988 static tree
26990 {
27005 else
27006 {
27010 }
27012 /* Parse a noexcept specification. */
27015 /* Keep track if we're in the lexical scope of an outer transaction. */
27027 }
27029 /* Parse a __transaction_atomic or __transaction_relaxed expression.
27031 transaction-expression:
27032 __transaction_atomic txn-noexcept-spec[opt] ( expression )
27033 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
27034 */
27036 static tree
27038 {
27063 /* Set this early. This might mean that we allow transaction_cancel in
27064 an expression that we find out later actually has to be a constexpr.
27065 However, we expect that cxx_constant_value will be able to deal with
27066 this; also, if the noexcept has no constexpr, then what we parse next
27067 really is a transaction's body. */
27070 /* Parse a noexcept specification. */
27076 {
27083 }
27084 else
27085 {
27086 /* The only expression that is available got parsed for the noexcept
27087 already. noexcept is true then. */
27090 }
27099 }
27101 /* Parse a function-transaction-block.
27103 function-transaction-block:
27104 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
27105 function-body
27106 __transaction_atomic txn-attribute[opt] function-try-block
27107 __transaction_relaxed ctor-initializer[opt] function-body
27108 __transaction_relaxed function-try-block
27109 */
27111 static bool
27113 {
27129 else
27130 {
27134 }
27142 else
27143 ctor_initializer_p
27151 }
27153 /* Parse a __transaction_cancel statement.
27155 cancel-statement:
27156 __transaction_cancel txn-attribute[opt] ;
27157 __transaction_cancel txn-attribute[opt] throw-expression ;
27159 ??? Cancel and throw is not yet implemented. */
27161 static tree
27163 {
27169 RT_TRANSACTION_CANCEL);
27176 /* ??? Parse cancel-and-throw here. */
27181 {
27185 }
27187 {
27191 }
27193 {
27196 {
27202 }
27203 }
27205 {
27209 }
27216 }
27217 \f
27218 /* The parser. */
27222 \f
27223 /* Special handling for the first token or line in the file. The first
27224 thing in the file might be #pragma GCC pch_preprocess, which loads a
27225 PCH file, which is a GC collection point. So we need to handle this
27226 first pragma without benefit of an existing lexer structure.
27228 Always returns one token to the caller in *FIRST_TOKEN. This is
27229 either the true first token of the file, or the first token after
27230 the initial pragma. */
27232 static void
27234 {
27243 {
27250 }
27251 else
27254 /* Skip to the end of the pragma. */
27258 /* Now actually load the PCH file. */
27262 /* Read one more token to return to our caller. We have to do this
27263 after reading the PCH file in, since its pointers have to be
27264 live. */
27266 }
27268 /* Normal parsing of a pragma token. Here we can (and must) use the
27269 regular lexer. */
27271 static bool
27273 {
27283 {
27291 {
27301 }
27306 {
27316 }
27321 {
27327 "%<#pragma omp taskwait%> may only be "
27332 }
27337 {
27343 "%<#pragma omp taskyield%> may only be "
27348 }
27371 "%<#pragma omp section%> may only be used in "
27380 bad_stmt:
27383 }
27387 }
27389 /* The interface the pragma parsers have to the lexer. */
27391 enum cpp_ttype
27393 {
27406 else
27407 {
27411 }
27414 }
27416 \f
27417 /* External interface. */
27419 /* Parse one entire translation unit. */
27421 void
27423 {
27427 {
27430 }
27438 }