| blob | 52a152d1925cdd69ba85e2727dc734836439f223 |
1 /* C++ Parser.
2 Copyright (C) 2000, 2001, 2002, 2003, 2004,
3 2005, 2007, 2008, 2009, 2010, 2011, 2012 Free Software Foundation, Inc.
4 Written by Mark Mitchell <mark@codesourcery.com>.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it
9 under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
11 any later version.
13 GCC is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
43 \f
44 /* The lexer. */
46 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
47 and c-lex.c) and the C++ parser. */
50 {
52 };
54 /* The various kinds of non integral constant we encounter. */
56 NIC_NONE,
57 /* floating-point literal */
58 NIC_FLOAT,
59 /* %<this%> */
60 NIC_THIS,
61 /* %<__FUNCTION__%> */
62 NIC_FUNC_NAME,
63 /* %<__PRETTY_FUNCTION__%> */
64 NIC_PRETTY_FUNC,
65 /* %<__func__%> */
66 NIC_C99_FUNC,
67 /* "%<va_arg%> */
68 NIC_VA_ARG,
69 /* a cast */
70 NIC_CAST,
71 /* %<typeid%> operator */
72 NIC_TYPEID,
73 /* non-constant compound literals */
74 NIC_NCC,
75 /* a function call */
76 NIC_FUNC_CALL,
77 /* an increment */
78 NIC_INC,
79 /* an decrement */
80 NIC_DEC,
81 /* an array reference */
82 NIC_ARRAY_REF,
83 /* %<->%> */
84 NIC_ARROW,
85 /* %<.%> */
86 NIC_POINT,
87 /* the address of a label */
88 NIC_ADDR_LABEL,
89 /* %<*%> */
90 NIC_STAR,
91 /* %<&%> */
92 NIC_ADDR,
93 /* %<++%> */
94 NIC_PREINCREMENT,
95 /* %<--%> */
96 NIC_PREDECREMENT,
97 /* %<new%> */
98 NIC_NEW,
99 /* %<delete%> */
100 NIC_DEL,
101 /* calls to overloaded operators */
102 NIC_OVERLOADED,
103 /* an assignment */
104 NIC_ASSIGNMENT,
105 /* a comma operator */
106 NIC_COMMA,
107 /* a call to a constructor */
108 NIC_CONSTRUCTOR,
109 /* a transaction expression */
110 NIC_TRANSACTION
113 /* The various kinds of errors about name-lookup failing. */
115 /* NULL */
116 NLE_NULL,
117 /* is not a type */
118 NLE_TYPE,
119 /* is not a class or namespace */
120 NLE_CXX98,
121 /* is not a class, namespace, or enumeration */
122 NLE_NOT_CXX98
125 /* The various kinds of required token */
127 RT_NONE,
149 /* The type is CPP_KEYWORD */
178 RT_TRANSACTION_CANCEL /* __transaction_cancel */
181 /* Prototypes. */
187 static void cp_lexer_destroy
189 static int cp_lexer_saving_tokens
193 static void cp_lexer_get_preprocessor_token
201 static bool cp_lexer_next_token_is_not
203 static bool cp_lexer_next_token_is_keyword
207 static void cp_lexer_purge_token
209 static void cp_lexer_purge_tokens_after
211 static void cp_lexer_save_tokens
213 static void cp_lexer_commit_tokens
215 static void cp_lexer_rollback_tokens
217 static void cp_lexer_print_token
221 static void cp_lexer_start_debugging
223 static void cp_lexer_stop_debugging
229 static void cp_parser_initial_pragma
232 static tree cp_literal_operator_id
235 /* Manifest constants. */
236 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
237 #define CP_SAVED_TOKEN_STACK 5
239 /* Variables. */
241 /* The stream to which debugging output should be written. */
244 /* Nonzero if we are parsing an unevaluated operand: an operand to
245 sizeof, typeof, or alignof. */
248 /* Dump up to NUM tokens in BUFFER to FILE starting with token
249 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
250 first token in BUFFER. If NUM is 0, dump all the tokens. If
251 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
252 highlighted by surrounding it in [[ ]]. */
254 static void
258 {
275 {
278 }
283 {
290 nprinted++;
300 {
310 }
311 }
314 {
317 }
320 }
323 /* Dump all tokens in BUFFER to stderr. */
325 void
327 {
329 }
332 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
333 description for T. */
335 static void
337 {
339 {
342 }
343 }
346 /* Dump parser context C to FILE. */
348 static void
350 {
355 }
358 /* Print the stack of parsing contexts to FILE starting with FIRST. */
360 static void
362 {
368 {
371 }
372 }
375 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
377 static void
379 {
382 }
385 /* Print an unparsed function entry UF to FILE. */
387 static void
389 {
392 tree fn;
397 default_arg_fn);
398 i++)
399 {
405 }
410 {
413 }
419 {
422 }
424 }
427 /* Print the stack of unparsed member functions S to FILE. */
429 static void
432 {
438 {
441 }
442 }
445 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
446 the given PARSER. If FILE is NULL, the output is printed on stderr. */
448 static void
450 {
462 next_token);
463 }
466 /* Dump debugging information for the given PARSER. If FILE is NULL,
467 the output is printed on stderr. */
469 void
471 {
474 expanded_location eloc;
548 }
551 /* Allocate memory for a new lexer object and return it. */
555 {
560 /* Allocate the memory. */
563 /* Initially we are not debugging. */
567 CP_SAVED_TOKEN_STACK);
569 /* Create the buffer. */
573 }
576 /* Create a new main C++ lexer, the lexer that gets tokens from the
577 preprocessor. */
581 {
583 cp_token token;
585 /* It's possible that parsing the first pragma will load a PCH file,
586 which is a GC collection point. So we have to do that before
587 allocating any memory. */
592 /* Put the first token in the buffer. */
595 /* Get the remaining tokens from the preprocessor. */
597 {
600 }
609 /* Subsequent preprocessor diagnostics should use compiler
610 diagnostic functions to get the compiler source location. */
615 }
617 /* Create a new lexer whose token stream is primed with the tokens in
618 CACHE. When these tokens are exhausted, no new tokens will be read. */
622 {
627 /* We do not own the buffer. */
633 CP_SAVED_TOKEN_STACK);
635 /* Initially we are not debugging. */
640 }
642 /* Frees all resources associated with LEXER. */
644 static void
646 {
650 }
652 /* Returns nonzero if debugging information should be output. */
656 {
658 }
663 {
667 }
671 {
673 }
677 {
679 }
683 {
686 else
688 }
692 {
696 }
698 /* nonzero if we are presently saving tokens. */
702 {
704 }
706 /* Store the next token from the preprocessor in *TOKEN. Return true
707 if we reach EOF. If LEXER is NULL, assume we are handling an
708 initial #pragma pch_preprocess, and thus want the lexer to return
709 processed strings. */
711 static void
713 {
716 /* Get a new token from the preprocessor. */
717 token->type
724 /* On some systems, some header files are surrounded by an
725 implicit extern "C" block. Set a flag in the token if it
726 comes from such a header. */
731 /* Check to see if this token is a keyword. */
733 {
735 {
736 /* Mark this token as a keyword. */
738 /* Record which keyword. */
740 }
741 else
742 {
746 {
747 /* Warn about the C++0x keyword (but still treat it as
748 an identifier). */
753 /* Clear out the C_RID_CODE so we don't warn about this
754 particular identifier-turned-keyword again. */
756 }
760 }
761 }
763 {
764 /* This only happens in Objective-C++; it must be a keyword. */
767 {
768 /* Replace 'class' with '@class', 'private' with '@private',
769 etc. This prevents confusion with the C++ keyword
770 'class', and makes the tokens consistent with other
771 Objective-C 'AT' keywords. For example '@class' is
772 reported as RID_AT_CLASS which is consistent with
773 '@synchronized', which is reported as
774 RID_AT_SYNCHRONIZED.
775 */
784 }
785 }
787 {
788 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
792 }
793 }
795 /* Update the globals input_location and the input file stack from TOKEN. */
798 {
800 {
802 }
803 }
805 /* Return a pointer to the next token in the token stream, but do not
806 consume it. */
810 {
812 {
816 }
818 }
820 /* Return true if the next token has the indicated TYPE. */
824 {
826 }
828 /* Return true if the next token does not have the indicated TYPE. */
832 {
834 }
836 /* Return true if the next token is the indicated KEYWORD. */
840 {
842 }
844 /* Return true if the next token is not the indicated KEYWORD. */
848 {
850 }
852 /* Return true if the next token is a keyword for a decl-specifier. */
854 static bool
856 {
861 {
862 /* auto specifier: storage-class-specifier in C++,
863 simple-type-specifier in C++0x. */
865 /* Storage classes. */
871 /* Elaborated type specifiers. */
877 /* Simple type specifiers. */
892 /* GNU extensions. */
895 /* C++0x extensions. */
902 }
903 }
905 /* Returns TRUE iff the token T begins a decltype type. */
907 static bool
909 {
912 }
914 /* Returns TRUE iff the next token begins a decltype type. */
916 static bool
918 {
921 }
923 /* Return a pointer to the Nth token in the token stream. If N is 1,
924 then this is precisely equivalent to cp_lexer_peek_token (except
925 that it is not inline). One would like to disallow that case, but
926 there is one case (cp_parser_nth_token_starts_template_id) where
927 the caller passes a variable for N and it might be 1. */
931 {
934 /* N is 1-based, not zero-based. */
945 {
948 {
951 }
955 }
958 {
961 }
964 }
966 /* Return the next token, and advance the lexer's next_token pointer
967 to point to the next non-purged token. */
971 {
977 do
978 {
981 {
984 }
986 }
991 /* Provide debugging output. */
993 {
997 }
1000 }
1002 /* Permanently remove the next token from the token stream, and
1003 advance the next_token pointer to refer to the next non-purged
1004 token. */
1006 static void
1008 {
1017 do
1018 {
1019 tok++;
1021 {
1024 }
1025 }
1028 }
1030 /* Permanently remove all tokens after TOK, up to, but not
1031 including, the token that will be returned next by
1032 cp_lexer_peek_token. */
1034 static void
1036 {
1045 {
1050 }
1051 }
1053 /* Begin saving tokens. All tokens consumed after this point will be
1054 preserved. */
1056 static void
1058 {
1059 /* Provide debugging output. */
1065 }
1067 /* Commit to the portion of the token stream most recently saved. */
1069 static void
1071 {
1072 /* Provide debugging output. */
1077 }
1079 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1080 to the token stream. Stop saving tokens. */
1082 static void
1084 {
1085 /* Provide debugging output. */
1090 }
1092 /* Print a representation of the TOKEN on the STREAM. */
1094 static void
1096 {
1097 /* We don't use cpp_type2name here because the parser defines
1098 a few tokens of its own. */
1100 /* cpplib-defined token types */
1101 #define OP(e, s) #e,
1102 #define TK(e, s) #e,
1103 TTYPE_TABLE
1104 #undef OP
1105 #undef TK
1106 /* C++ parser token types - see "Manifest constants", above. */
1110 };
1112 /* For some tokens, print the associated data. */
1114 {
1116 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1117 For example, `struct' is mapped to an INTEGER_CST. */
1120 /* else fall through */
1138 /* If we have a name for the token, print it out. Otherwise, we
1139 simply give the numeric code. */
1142 else
1145 }
1146 }
1148 /* Start emitting debugging information. */
1150 static void
1152 {
1155 }
1157 /* Stop emitting debugging information. */
1159 static void
1161 {
1164 }
1166 /* Create a new cp_token_cache, representing a range of tokens. */
1170 {
1175 }
1177 \f
1178 /* Decl-specifiers. */
1180 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1182 static void
1184 {
1186 }
1188 /* Declarators. */
1190 /* Nothing other than the parser should be creating declarators;
1191 declarators are a semi-syntactic representation of C++ entities.
1192 Other parts of the front end that need to create entities (like
1193 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1208 /* An erroneous declarator. */
1211 /* The obstack on which declarators and related data structures are
1212 allocated. */
1215 /* Alloc BYTES from the declarator memory pool. */
1219 {
1221 }
1223 /* Allocate a declarator of the indicated KIND. Clear fields that are
1224 common to all declarators. */
1228 {
1240 }
1242 /* Make a declarator for a generalized identifier. If
1243 QUALIFYING_SCOPE is non-NULL, the identifier is
1244 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1245 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1246 is, if any. */
1250 special_function_kind sfk)
1251 {
1254 /* It is valid to write:
1256 class C { void f(); };
1257 typedef C D;
1258 void D::f();
1260 The standard is not clear about whether `typedef const C D' is
1261 legal; as of 2002-09-15 the committee is considering that
1262 question. EDG 3.0 allows that syntax. Therefore, we do as
1263 well. */
1277 }
1279 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1280 of modifiers such as const or volatile to apply to the pointer
1281 type, represented as identifiers. ATTRIBUTES represent the attributes that
1282 appertain to the pointer or reference. */
1284 cp_declarator *
1286 tree attributes)
1287 {
1295 {
1299 }
1300 else
1306 }
1308 /* Like make_pointer_declarator -- but for references. ATTRIBUTES
1309 represent the attributes that appertain to the pointer or
1310 reference. */
1312 cp_declarator *
1315 {
1323 {
1327 }
1328 else
1334 }
1336 /* Like make_pointer_declarator -- but for a pointer to a non-static
1337 member of CLASS_TYPE. ATTRIBUTES represent the attributes that
1338 appertain to the pointer or reference. */
1340 cp_declarator *
1343 tree attributes)
1344 {
1353 {
1356 }
1357 else
1363 }
1365 /* Make a declarator for the function given by TARGET, with the
1366 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1367 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1368 indicates what exceptions can be thrown. */
1370 cp_declarator *
1372 tree parms,
1373 cp_cv_quals cv_qualifiers,
1374 cp_virt_specifiers virt_specifiers,
1375 tree exception_specification,
1376 tree late_return_type)
1377 {
1388 {
1392 }
1393 else
1397 }
1399 /* Make a declarator for an array of BOUNDS elements, each of which is
1400 defined by ELEMENT. */
1402 cp_declarator *
1404 {
1411 {
1415 }
1416 else
1420 }
1422 /* Determine whether the declarator we've seen so far can be a
1423 parameter pack, when followed by an ellipsis. */
1424 static bool
1426 {
1427 /* Search for a declarator name, or any other declarator that goes
1428 after the point where the ellipsis could appear in a parameter
1429 pack. If we find any of these, then this declarator can not be
1430 made into a parameter pack. */
1433 {
1435 {
1447 }
1448 }
1451 }
1455 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1456 DECLARATOR and DEFAULT_ARGUMENT. */
1458 cp_parameter_declarator *
1461 tree default_argument)
1462 {
1470 else
1477 }
1479 /* Returns true iff DECLARATOR is a declaration for a function. */
1481 static bool
1483 {
1485 {
1493 }
1495 }
1497 /* The parser. */
1499 /* Overview
1500 --------
1502 A cp_parser parses the token stream as specified by the C++
1503 grammar. Its job is purely parsing, not semantic analysis. For
1504 example, the parser breaks the token stream into declarators,
1505 expressions, statements, and other similar syntactic constructs.
1506 It does not check that the types of the expressions on either side
1507 of an assignment-statement are compatible, or that a function is
1508 not declared with a parameter of type `void'.
1510 The parser invokes routines elsewhere in the compiler to perform
1511 semantic analysis and to build up the abstract syntax tree for the
1512 code processed.
1514 The parser (and the template instantiation code, which is, in a
1515 way, a close relative of parsing) are the only parts of the
1516 compiler that should be calling push_scope and pop_scope, or
1517 related functions. The parser (and template instantiation code)
1518 keeps track of what scope is presently active; everything else
1519 should simply honor that. (The code that generates static
1520 initializers may also need to set the scope, in order to check
1521 access control correctly when emitting the initializers.)
1523 Methodology
1524 -----------
1526 The parser is of the standard recursive-descent variety. Upcoming
1527 tokens in the token stream are examined in order to determine which
1528 production to use when parsing a non-terminal. Some C++ constructs
1529 require arbitrary look ahead to disambiguate. For example, it is
1530 impossible, in the general case, to tell whether a statement is an
1531 expression or declaration without scanning the entire statement.
1532 Therefore, the parser is capable of "parsing tentatively." When the
1533 parser is not sure what construct comes next, it enters this mode.
1534 Then, while we attempt to parse the construct, the parser queues up
1535 error messages, rather than issuing them immediately, and saves the
1536 tokens it consumes. If the construct is parsed successfully, the
1537 parser "commits", i.e., it issues any queued error messages and
1538 the tokens that were being preserved are permanently discarded.
1539 If, however, the construct is not parsed successfully, the parser
1540 rolls back its state completely so that it can resume parsing using
1541 a different alternative.
1543 Future Improvements
1544 -------------------
1546 The performance of the parser could probably be improved substantially.
1547 We could often eliminate the need to parse tentatively by looking ahead
1548 a little bit. In some places, this approach might not entirely eliminate
1549 the need to parse tentatively, but it might still speed up the average
1550 case. */
1552 /* Flags that are passed to some parsing functions. These values can
1553 be bitwise-ored together. */
1555 enum
1556 {
1557 /* No flags. */
1559 /* The construct is optional. If it is not present, then no error
1560 should be issued. */
1562 /* When parsing a type-specifier, treat user-defined type-names
1563 as non-type identifiers. */
1565 /* When parsing a type-specifier, do not try to parse a class-specifier
1566 or enum-specifier. */
1568 /* When parsing a decl-specifier-seq, only allow type-specifier or
1569 constexpr. */
1571 };
1573 /* This type is used for parameters and variables which hold
1574 combinations of the above flags. */
1577 /* The different kinds of declarators we want to parse. */
1580 {
1581 /* We want an abstract declarator. */
1582 CP_PARSER_DECLARATOR_ABSTRACT,
1583 /* We want a named declarator. */
1584 CP_PARSER_DECLARATOR_NAMED,
1585 /* We don't mind, but the name must be an unqualified-id. */
1586 CP_PARSER_DECLARATOR_EITHER
1589 /* The precedence values used to parse binary expressions. The minimum value
1590 of PREC must be 1, because zero is reserved to quickly discriminate
1591 binary operators from other tokens. */
1593 enum cp_parser_prec
1594 {
1595 PREC_NOT_OPERATOR,
1596 PREC_LOGICAL_OR_EXPRESSION,
1597 PREC_LOGICAL_AND_EXPRESSION,
1598 PREC_INCLUSIVE_OR_EXPRESSION,
1599 PREC_EXCLUSIVE_OR_EXPRESSION,
1600 PREC_AND_EXPRESSION,
1601 PREC_EQUALITY_EXPRESSION,
1602 PREC_RELATIONAL_EXPRESSION,
1603 PREC_SHIFT_EXPRESSION,
1604 PREC_ADDITIVE_EXPRESSION,
1605 PREC_MULTIPLICATIVE_EXPRESSION,
1606 PREC_PM_EXPRESSION,
1607 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1608 };
1610 /* A mapping from a token type to a corresponding tree node type, with a
1611 precedence value. */
1614 {
1615 /* The token type. */
1617 /* The corresponding tree code. */
1619 /* The precedence of this operator. */
1624 {
1625 /* Left hand side of the binary operation we are currently
1626 parsing. */
1627 tree lhs;
1628 /* Original tree code for left hand side, if it was a binary
1629 expression itself (used for -Wparentheses). */
1631 /* Tree code for the binary operation we are parsing. */
1633 /* Precedence of the binary operation we are parsing. */
1635 /* Location of the binary operation we are parsing. */
1636 location_t loc;
1639 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1640 entries because precedence levels on the stack are monotonically
1641 increasing. */
1645 /* Prototypes. */
1647 /* Constructors and destructors. */
1652 /* Class variables. */
1656 /* The operator-precedence table used by cp_parser_binary_expression.
1657 Transformed into an associative array (binops_by_token) by
1658 cp_parser_new. */
1691 };
1693 /* The same as binops, but initialized by cp_parser_new so that
1694 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1695 for speed. */
1698 /* Constructors and destructors. */
1700 /* Construct a new context. The context below this one on the stack
1701 is given by NEXT. */
1705 {
1708 /* Allocate the storage. */
1710 {
1711 /* Pull the first entry from the free list. */
1715 }
1716 else
1719 /* No errors have occurred yet in this context. */
1721 /* If this is not the bottommost context, copy information that we
1722 need from the previous context. */
1724 {
1725 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1726 expression, then we are parsing one in this context, too. */
1728 /* Thread the stack. */
1730 }
1733 }
1735 /* Managing the unparsed function queues. */
1737 #define unparsed_funs_with_default_args \
1738 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues).funs_with_default_args
1739 #define unparsed_funs_with_definitions \
1740 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues).funs_with_definitions
1741 #define unparsed_nsdmis \
1742 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues).nsdmis
1744 static void
1746 {
1749 }
1751 static void
1753 {
1756 }
1758 /* Prototypes. */
1760 /* Constructors and destructors. */
1765 /* Routines to parse various constructs.
1767 Those that return `tree' will return the error_mark_node (rather
1768 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1769 Sometimes, they will return an ordinary node if error-recovery was
1770 attempted, even though a parse error occurred. So, to check
1771 whether or not a parse error occurred, you should always use
1772 cp_parser_error_occurred. If the construct is optional (indicated
1773 either by an `_opt' in the name of the function that does the
1774 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1775 the construct is not present. */
1777 /* Lexical conventions [gram.lex] */
1779 static tree cp_parser_identifier
1781 static tree cp_parser_string_literal
1783 static tree cp_parser_userdef_char_literal
1785 static tree cp_parser_userdef_string_literal
1787 static tree cp_parser_userdef_numeric_literal
1790 /* Basic concepts [gram.basic] */
1792 static bool cp_parser_translation_unit
1795 /* Expressions [gram.expr] */
1797 static tree cp_parser_primary_expression
1799 static tree cp_parser_id_expression
1801 static tree cp_parser_unqualified_id
1803 static tree cp_parser_nested_name_specifier_opt
1805 static tree cp_parser_nested_name_specifier
1807 static tree cp_parser_qualifying_entity
1809 static tree cp_parser_postfix_expression
1811 static tree cp_parser_postfix_open_square_expression
1813 static tree cp_parser_postfix_dot_deref_expression
1817 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1819 static void cp_parser_pseudo_destructor_name
1821 static tree cp_parser_unary_expression
1823 static enum tree_code cp_parser_unary_operator
1825 static tree cp_parser_new_expression
1829 static tree cp_parser_new_type_id
1837 static tree cp_parser_delete_expression
1839 static tree cp_parser_cast_expression
1841 static tree cp_parser_binary_expression
1843 static tree cp_parser_question_colon_clause
1845 static tree cp_parser_assignment_expression
1847 static enum tree_code cp_parser_assignment_operator_opt
1849 static tree cp_parser_expression
1851 static tree cp_parser_constant_expression
1853 static tree cp_parser_builtin_offsetof
1855 static tree cp_parser_lambda_expression
1857 static void cp_parser_lambda_introducer
1859 static bool cp_parser_lambda_declarator_opt
1861 static void cp_parser_lambda_body
1864 /* Statements [gram.stmt.stmt] */
1866 static void cp_parser_statement
1868 static void cp_parser_label_for_labeled_statement
1870 static tree cp_parser_expression_statement
1872 static tree cp_parser_compound_statement
1874 static void cp_parser_statement_seq_opt
1876 static tree cp_parser_selection_statement
1878 static tree cp_parser_condition
1880 static tree cp_parser_iteration_statement
1882 static bool cp_parser_for_init_statement
1884 static tree cp_parser_for
1886 static tree cp_parser_c_for
1888 static tree cp_parser_range_for
1890 static void do_range_for_auto_deduction
1892 static tree cp_parser_perform_range_for_lookup
1894 static tree cp_parser_range_for_member_function
1896 static tree cp_parser_jump_statement
1898 static void cp_parser_declaration_statement
1901 static tree cp_parser_implicitly_scoped_statement
1903 static void cp_parser_already_scoped_statement
1906 /* Declarations [gram.dcl.dcl] */
1908 static void cp_parser_declaration_seq_opt
1910 static void cp_parser_declaration
1912 static void cp_parser_block_declaration
1914 static void cp_parser_simple_declaration
1916 static void cp_parser_decl_specifier_seq
1918 static tree cp_parser_storage_class_specifier_opt
1920 static tree cp_parser_function_specifier_opt
1922 static tree cp_parser_type_specifier
1925 static tree cp_parser_simple_type_specifier
1927 static tree cp_parser_type_name
1929 static tree cp_parser_nonclass_name
1931 static tree cp_parser_elaborated_type_specifier
1933 static tree cp_parser_enum_specifier
1935 static void cp_parser_enumerator_list
1937 static void cp_parser_enumerator_definition
1939 static tree cp_parser_namespace_name
1941 static void cp_parser_namespace_definition
1943 static void cp_parser_namespace_body
1945 static tree cp_parser_qualified_namespace_specifier
1947 static void cp_parser_namespace_alias_definition
1949 static bool cp_parser_using_declaration
1951 static void cp_parser_using_directive
1953 static tree cp_parser_alias_declaration
1955 static void cp_parser_asm_definition
1957 static void cp_parser_linkage_specification
1959 static void cp_parser_static_assert
1961 static tree cp_parser_decltype
1964 /* Declarators [gram.dcl.decl] */
1966 static tree cp_parser_init_declarator
1967 (cp_parser *, cp_decl_specifier_seq *, VEC (deferred_access_check,gc)*, bool, bool, int, bool *, tree *);
1972 static enum tree_code cp_parser_ptr_operator
1974 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
1976 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
1978 static tree cp_parser_late_return_type_opt
1980 static tree cp_parser_declarator_id
1982 static tree cp_parser_type_id
1984 static tree cp_parser_template_type_arg
1987 static tree cp_parser_type_id_1
1989 static void cp_parser_type_specifier_seq
1991 static tree cp_parser_parameter_declaration_clause
1993 static tree cp_parser_parameter_declaration_list
1997 static tree cp_parser_default_argument
1999 static void cp_parser_function_body
2001 static tree cp_parser_initializer
2003 static tree cp_parser_initializer_clause
2005 static tree cp_parser_braced_list
2010 static bool cp_parser_ctor_initializer_opt_and_function_body
2013 /* Classes [gram.class] */
2015 static tree cp_parser_class_name
2017 static tree cp_parser_class_specifier
2019 static tree cp_parser_class_head
2021 static enum tag_types cp_parser_class_key
2023 static void cp_parser_member_specification_opt
2025 static void cp_parser_member_declaration
2027 static tree cp_parser_pure_specifier
2029 static tree cp_parser_constant_initializer
2032 /* Derived classes [gram.class.derived] */
2034 static tree cp_parser_base_clause
2036 static tree cp_parser_base_specifier
2039 /* Special member functions [gram.special] */
2041 static tree cp_parser_conversion_function_id
2043 static tree cp_parser_conversion_type_id
2047 static bool cp_parser_ctor_initializer_opt
2049 static void cp_parser_mem_initializer_list
2051 static tree cp_parser_mem_initializer
2053 static tree cp_parser_mem_initializer_id
2056 /* Overloading [gram.over] */
2058 static tree cp_parser_operator_function_id
2060 static tree cp_parser_operator
2063 /* Templates [gram.temp] */
2065 static void cp_parser_template_declaration
2067 static tree cp_parser_template_parameter_list
2069 static tree cp_parser_template_parameter
2071 static tree cp_parser_type_parameter
2073 static tree cp_parser_template_id
2075 static tree cp_parser_template_name
2077 static tree cp_parser_template_argument_list
2079 static tree cp_parser_template_argument
2081 static void cp_parser_explicit_instantiation
2083 static void cp_parser_explicit_specialization
2086 /* Exception handling [gram.exception] */
2088 static tree cp_parser_try_block
2090 static bool cp_parser_function_try_block
2092 static void cp_parser_handler_seq
2094 static void cp_parser_handler
2096 static tree cp_parser_exception_declaration
2098 static tree cp_parser_throw_expression
2100 static tree cp_parser_exception_specification_opt
2102 static tree cp_parser_type_id_list
2105 /* GNU Extensions */
2107 static tree cp_parser_asm_specification_opt
2109 static tree cp_parser_asm_operand_list
2111 static tree cp_parser_asm_clobber_list
2113 static tree cp_parser_asm_label_list
2115 static bool cp_next_tokens_can_be_attribute_p
2117 static bool cp_next_tokens_can_be_gnu_attribute_p
2119 static bool cp_next_tokens_can_be_std_attribute_p
2121 static bool cp_nth_tokens_can_be_std_attribute_p
2123 static bool cp_nth_tokens_can_be_gnu_attribute_p
2125 static bool cp_nth_tokens_can_be_attribute_p
2127 static tree cp_parser_attributes_opt
2129 static tree cp_parser_gnu_attributes_opt
2131 static tree cp_parser_gnu_attribute_list
2133 static tree cp_parser_std_attribute
2135 static tree cp_parser_std_attribute_spec
2137 static tree cp_parser_std_attribute_spec_seq
2139 static bool cp_parser_extension_opt
2141 static void cp_parser_label_declaration
2144 /* Transactional Memory Extensions */
2146 static tree cp_parser_transaction
2148 static tree cp_parser_transaction_expression
2150 static bool cp_parser_function_transaction
2152 static tree cp_parser_transaction_cancel
2156 static bool cp_parser_pragma
2159 /* Objective-C++ Productions */
2161 static tree cp_parser_objc_message_receiver
2163 static tree cp_parser_objc_message_args
2165 static tree cp_parser_objc_message_expression
2167 static tree cp_parser_objc_encode_expression
2169 static tree cp_parser_objc_defs_expression
2171 static tree cp_parser_objc_protocol_expression
2173 static tree cp_parser_objc_selector_expression
2175 static tree cp_parser_objc_expression
2177 static bool cp_parser_objc_selector_p
2179 static tree cp_parser_objc_selector
2181 static tree cp_parser_objc_protocol_refs_opt
2183 static void cp_parser_objc_declaration
2185 static tree cp_parser_objc_statement
2187 static bool cp_parser_objc_valid_prefix_attributes
2189 static void cp_parser_objc_at_property_declaration
2191 static void cp_parser_objc_at_synthesize_declaration
2193 static void cp_parser_objc_at_dynamic_declaration
2195 static tree cp_parser_objc_struct_declaration
2198 /* Utility Routines */
2200 static tree cp_parser_lookup_name
2202 static tree cp_parser_lookup_name_simple
2204 static tree cp_parser_maybe_treat_template_as_class
2206 static bool cp_parser_check_declarator_template_parameters
2208 static bool cp_parser_check_template_parameters
2210 static tree cp_parser_simple_cast_expression
2212 static tree cp_parser_global_scope_opt
2214 static bool cp_parser_constructor_declarator_p
2216 static tree cp_parser_function_definition_from_specifiers_and_declarator
2218 static tree cp_parser_function_definition_after_declarator
2220 static void cp_parser_template_declaration_after_export
2222 static void cp_parser_perform_template_parameter_access_checks
2224 static tree cp_parser_single_declaration
2226 static tree cp_parser_functional_cast
2228 static tree cp_parser_save_member_function_body
2230 static tree cp_parser_save_nsdmi
2232 static tree cp_parser_enclosed_template_argument_list
2234 static void cp_parser_save_default_args
2236 static void cp_parser_late_parsing_for_member
2238 static tree cp_parser_late_parse_one_default_arg
2240 static void cp_parser_late_parsing_nsdmi
2242 static void cp_parser_late_parsing_default_args
2244 static tree cp_parser_sizeof_operand
2246 static tree cp_parser_trait_expr
2248 static bool cp_parser_declares_only_class_p
2250 static void cp_parser_set_storage_class
2252 static void cp_parser_set_decl_spec_type
2254 static void set_and_check_decl_spec_loc
2257 static bool cp_parser_friend_p
2259 static void cp_parser_required_error
2265 static bool cp_parser_token_starts_function_definition_p
2267 static bool cp_parser_next_token_starts_class_definition_p
2269 static bool cp_parser_next_token_ends_template_argument_p
2271 static bool cp_parser_nth_token_starts_template_argument_list_p
2273 static enum tag_types cp_parser_token_is_class_key
2275 static void cp_parser_check_class_key
2277 static void cp_parser_check_access_in_redeclaration
2279 static bool cp_parser_optional_template_keyword
2281 static void cp_parser_pre_parsed_nested_name_specifier
2283 static bool cp_parser_cache_group
2285 static tree cp_parser_cache_defarg
2287 static void cp_parser_parse_tentatively
2289 static void cp_parser_commit_to_tentative_parse
2291 static void cp_parser_abort_tentative_parse
2293 static bool cp_parser_parse_definitely
2297 static bool cp_parser_uncommitted_to_tentative_parse_p
2299 static void cp_parser_error
2301 static void cp_parser_name_lookup_error
2303 static bool cp_parser_simulate_error
2305 static bool cp_parser_check_type_definition
2307 static void cp_parser_check_for_definition_in_return_type
2309 static void cp_parser_check_for_invalid_template_id
2311 static bool cp_parser_non_integral_constant_expression
2313 static void cp_parser_diagnose_invalid_type_name
2315 static bool cp_parser_parse_and_diagnose_invalid_type_name
2317 static int cp_parser_skip_to_closing_parenthesis
2319 static void cp_parser_skip_to_end_of_statement
2321 static void cp_parser_consume_semicolon_at_end_of_statement
2323 static void cp_parser_skip_to_end_of_block_or_statement
2325 static bool cp_parser_skip_to_closing_brace
2327 static void cp_parser_skip_to_end_of_template_parameter_list
2329 static void cp_parser_skip_to_pragma_eol
2331 static bool cp_parser_error_occurred
2333 static bool cp_parser_allow_gnu_extensions_p
2335 static bool cp_parser_is_pure_string_literal
2337 static bool cp_parser_is_string_literal
2339 static bool cp_parser_is_keyword
2341 static tree cp_parser_make_typename_type
2346 /* Returns nonzero if we are parsing tentatively. */
2350 {
2352 }
2354 /* Returns nonzero if TOKEN is a string literal. */
2356 static bool
2358 {
2364 }
2366 /* Returns nonzero if TOKEN is a string literal
2367 of a user-defined string literal. */
2369 static bool
2371 {
2378 }
2380 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2382 static bool
2384 {
2386 }
2388 /* If not parsing tentatively, issue a diagnostic of the form
2389 FILE:LINE: MESSAGE before TOKEN
2390 where TOKEN is the next token in the input stream. MESSAGE
2391 (specified by the caller) is usually of the form "expected
2392 OTHER-TOKEN". */
2394 static void
2396 {
2398 {
2400 /* This diagnostic makes more sense if it is tagged to the line
2401 of the token we just peeked at. */
2405 {
2410 }
2413 /* Because c_parser_error does not understand
2414 CPP_KEYWORD, keywords are treated like
2415 identifiers. */
2418 }
2419 }
2421 /* Issue an error about name-lookup failing. NAME is the
2422 IDENTIFIER_NODE DECL is the result of
2423 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2424 the thing that we hoped to find. */
2426 static void
2428 tree name,
2429 tree decl,
2430 name_lookup_error desired,
2431 location_t location)
2432 {
2433 /* If name lookup completely failed, tell the user that NAME was not
2434 declared. */
2436 {
2449 else
2451 }
2453 {
2455 {
2472 }
2473 }
2475 {
2477 {
2487 name);
2491 }
2492 }
2493 else
2494 {
2496 {
2509 }
2510 }
2511 }
2513 /* If we are parsing tentatively, remember that an error has occurred
2514 during this tentative parse. Returns true if the error was
2515 simulated; false if a message should be issued by the caller. */
2517 static bool
2519 {
2521 {
2524 }
2526 }
2528 /* This function is called when a type is defined. If type
2529 definitions are forbidden at this point, an error message is
2530 issued. */
2532 static bool
2534 {
2535 /* If types are forbidden here, issue a message. */
2537 {
2538 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2539 in the message need to be interpreted. */
2542 }
2544 }
2546 /* This function is called when the DECLARATOR is processed. The TYPE
2547 was a type defined in the decl-specifiers. If it is invalid to
2548 define a type in the decl-specifiers for DECLARATOR, an error is
2549 issued. TYPE_LOCATION is the location of TYPE and is used
2550 for error reporting. */
2552 static void
2555 {
2556 /* [dcl.fct] forbids type definitions in return types.
2557 Unfortunately, it's not easy to know whether or not we are
2558 processing a return type until after the fact. */
2566 {
2571 type);
2572 }
2573 }
2575 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2576 "<" in any valid C++ program. If the next token is indeed "<",
2577 issue a message warning the user about what appears to be an
2578 invalid attempt to form a template-id. LOCATION is the location
2579 of the type-specifier (TYPE) */
2581 static void
2583 tree type,
2585 location_t location)
2586 {
2590 {
2594 {
2597 else
2599 }
2600 else
2602 /* Remember the location of the invalid "<". */
2605 /* Consume the "<". */
2607 /* Parse the template arguments. */
2609 /* Permanently remove the invalid template arguments so that
2610 this error message is not issued again. */
2613 }
2614 }
2616 /* If parsing an integral constant-expression, issue an error message
2617 about the fact that THING appeared and return true. Otherwise,
2618 return false. In either case, set
2619 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2621 static bool
2623 non_integral_constant thing)
2624 {
2627 {
2629 {
2632 {
2639 "enumeration type cannot appear in a "
2730 }
2734 }
2735 }
2737 }
2739 /* Emit a diagnostic for an invalid type name. SCOPE is the
2740 qualifying scope (or NULL, if none) for ID. This function commits
2741 to the current active tentative parse, if any. (Otherwise, the
2742 problematic construct might be encountered again later, resulting
2743 in duplicate error messages.) LOCATION is the location of ID. */
2745 static void
2748 location_t location)
2749 {
2752 /* Try to lookup the identifier. */
2757 /* If the lookup found a template-name, it means that the user forgot
2758 to specify an argument list. Emit a useful error message. */
2762 decl);
2766 /* Something like 'unsigned A a;' */
2769 {
2770 /* Issue an error message. */
2772 /* If we're in a template class, it's possible that the user was
2773 referring to a type from a base class. For example:
2775 template <typename T> struct A { typedef T X; };
2776 template <typename T> struct B : public A<T> { X x; };
2778 The user should have said "typename A<T>::X". */
2784 {
2785 tree b;
2788 b;
2790 {
2794 {
2795 tree field;
2796 /* Go from a particular instantiation of the
2797 template (which will have an empty TYPE_FIELDs),
2798 to the main version. */
2801 field;
2805 {
2810 }
2813 }
2814 }
2815 }
2816 }
2817 /* Here we diagnose qualified-ids where the scope is actually correct,
2818 but the identifier does not resolve to a valid type name. */
2820 {
2826 {
2827 /* A<T>::A<T>() */
2833 }
2842 else
2844 }
2845 }
2847 /* Check for a common situation where a type-name should be present,
2848 but is not, and issue a sensible error message. Returns true if an
2849 invalid type-name was detected.
2851 The situation handled by this function are variable declarations of the
2852 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2853 Usually, `ID' should name a type, but if we got here it means that it
2854 does not. We try to emit the best possible error message depending on
2855 how exactly the id-expression looks like. */
2857 static bool
2859 {
2860 tree id;
2863 /* Avoid duplicate error about ambiguous lookup. */
2865 {
2869 }
2878 /* If the next token is a (, this is a function with no explicit return
2879 type, i.e. constructor, destructor or conversion op. */
2882 {
2885 }
2889 /* Emit a diagnostic for the invalid type. */
2892 out:
2893 /* If we aren't in the middle of a declarator (i.e. in a
2894 parameter-declaration-clause), skip to the end of the declaration;
2895 there's no point in trying to process it. */
2899 }
2901 /* Consume tokens up to, and including, the next non-nested closing `)'.
2902 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2903 are doing error recovery. Returns -1 if OR_COMMA is true and we
2904 found an unnested comma. */
2906 static int
2911 {
2921 {
2925 {
2928 /* If we've run out of tokens, then there is no closing `)'. */
2931 /* This is good for lambda expression capture-lists. */
2941 /* This matches the processing in skip_to_end_of_statement. */
2967 {
2971 }
2976 }
2978 /* Consume the token. */
2980 }
2981 }
2983 /* Consume tokens until we reach the end of the current statement.
2984 Normally, that will be just before consuming a `;'. However, if a
2985 non-nested `}' comes first, then we stop before consuming that. */
2987 static void
2989 {
2993 {
2997 {
3000 /* If we've run out of tokens, stop. */
3004 /* If the next token is a `;', we have reached the end of the
3005 statement. */
3011 /* If this is a non-nested '}', stop before consuming it.
3012 That way, when confronted with something like:
3014 { 3 + }
3016 we stop before consuming the closing '}', even though we
3017 have not yet reached a `;'. */
3021 /* If it is the closing '}' for a block that we have
3022 scanned, stop -- but only after consuming the token.
3023 That way given:
3025 void f g () { ... }
3026 typedef int I;
3028 we will stop after the body of the erroneously declared
3029 function, but before consuming the following `typedef'
3030 declaration. */
3032 {
3035 }
3043 }
3045 /* Consume the token. */
3047 }
3048 }
3050 /* This function is called at the end of a statement or declaration.
3051 If the next token is a semicolon, it is consumed; otherwise, error
3052 recovery is attempted. */
3054 static void
3056 {
3057 /* Look for the trailing `;'. */
3059 {
3060 /* If there is additional (erroneous) input, skip to the end of
3061 the statement. */
3063 /* If the next token is now a `;', consume it. */
3066 }
3067 }
3069 /* Skip tokens until we have consumed an entire block, or until we
3070 have consumed a non-nested `;'. */
3072 static void
3074 {
3078 {
3082 {
3085 /* If we've run out of tokens, stop. */
3089 /* Stop if this is an unnested ';'. */
3095 /* Stop if this is an unnested '}', or closes the outermost
3096 nesting level. */
3097 nesting_depth--;
3105 /* Nest. */
3106 nesting_depth++;
3111 }
3113 /* Consume the token. */
3115 }
3116 }
3118 /* Skip tokens until a non-nested closing curly brace is the next
3119 token, or there are no more tokens. Return true in the first case,
3120 false otherwise. */
3122 static bool
3124 {
3128 {
3132 {
3135 /* If we've run out of tokens, stop. */
3139 /* If the next token is a non-nested `}', then we have reached
3140 the end of the current block. */
3146 /* If it the next token is a `{', then we are entering a new
3147 block. Consume the entire block. */
3153 }
3155 /* Consume the token. */
3157 }
3158 }
3160 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3161 parameter is the PRAGMA token, allowing us to purge the entire pragma
3162 sequence. */
3164 static void
3166 {
3171 do
3175 /* Ensure that the pragma is not parsed again. */
3177 }
3179 /* Require pragma end of line, resyncing with it as necessary. The
3180 arguments are as for cp_parser_skip_to_pragma_eol. */
3182 static void
3184 {
3188 }
3190 /* This is a simple wrapper around make_typename_type. When the id is
3191 an unresolved identifier node, we can provide a superior diagnostic
3192 using cp_parser_diagnose_invalid_type_name. */
3194 static tree
3197 {
3198 tree result;
3200 {
3206 }
3208 }
3210 /* This is a wrapper around the
3211 make_{pointer,ptrmem,reference}_declarator functions that decides
3212 which one to call based on the CODE and CLASS_TYPE arguments. The
3213 CODE argument should be one of the values returned by
3214 cp_parser_ptr_operator. ATTRIBUTES represent the attributes that
3215 appertain to the pointer or reference. */
3219 cp_cv_quals cv_qualifiers,
3221 tree attributes)
3222 {
3229 else
3239 }
3241 /* Create a new C++ parser. */
3245 {
3250 /* cp_lexer_new_main is called before doing GC allocation because
3251 cp_lexer_new_main might load a PCH file. */
3254 /* Initialize the binops_by_token so that we can get the tree
3255 directly from the token. */
3263 /* For now, we always accept GNU extensions. */
3266 /* The `>' token is a greater-than operator, not the end of a
3267 template-id. */
3272 /* We are not parsing a constant-expression. */
3277 /* Local variable names are not forbidden. */
3280 /* We are not processing an `extern "C"' declaration. */
3283 /* We are not processing a declarator. */
3286 /* We are not processing a template-argument-list. */
3289 /* We are not in an iteration statement. */
3292 /* We are not in a switch statement. */
3295 /* We are not parsing a type-id inside an expression. */
3298 /* Declarations aren't implicitly extern "C". */
3301 /* String literals should be translated to the execution character set. */
3304 /* We are not parsing a function body. */
3307 /* We can correct until told otherwise. */
3310 /* The unparsed function queue is empty. */
3313 /* There are no classes being defined. */
3316 /* No template parameters apply. */
3320 }
3322 /* Create a cp_lexer structure which will emit the tokens in CACHE
3323 and push it onto the parser's lexer stack. This is used for delayed
3324 parsing of in-class method bodies and default arguments, and should
3325 not be confused with tentative parsing. */
3326 static void
3328 {
3333 /* Move the current source position to that of the first token in the
3334 new lexer. */
3336 }
3338 /* Pop the top lexer off the parser stack. This is never used for the
3339 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3340 static void
3342 {
3347 /* Put the current source position back where it was before this
3348 lexer was pushed. */
3350 }
3352 /* Lexical conventions [gram.lex] */
3354 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3355 identifier. */
3357 static tree
3359 {
3362 /* Look for the identifier. */
3364 /* Return the value. */
3366 }
3368 /* Parse a sequence of adjacent string constants. Returns a
3369 TREE_STRING representing the combined, nul-terminated string
3370 constant. If TRANSLATE is true, translate the string to the
3371 execution character set. If WIDE_OK is true, a wide string is
3372 invalid here.
3374 C++98 [lex.string] says that if a narrow string literal token is
3375 adjacent to a wide string literal token, the behavior is undefined.
3376 However, C99 6.4.5p4 says that this results in a wide string literal.
3377 We follow C99 here, for consistency with the C front end.
3379 This code is largely lifted from lex_string() in c-lex.c.
3381 FUTURE: ObjC++ will need to handle @-strings here. */
3382 static tree
3384 {
3385 tree value;
3392 tree string_tree;
3398 {
3401 }
3404 {
3408 }
3409 else
3410 {
3413 }
3416 /* Try to avoid the overhead of creating and destroying an obstack
3417 for the common case of just one string. */
3420 {
3428 {
3432 }
3433 else
3437 }
3438 else
3439 {
3443 do
3444 {
3446 count++;
3451 {
3454 {
3457 }
3460 {
3465 }
3467 }
3468 else
3472 {
3477 "unsupported non-standard concatenation "
3479 }
3485 {
3489 }
3490 else
3491 {
3495 }
3496 }
3500 }
3503 {
3506 }
3510 {
3515 {
3530 }
3535 {
3539 }
3540 }
3541 else
3542 /* cpp_interpret_string has issued an error. */
3549 }
3551 /* Look up a literal operator with the name and the exact arguments. */
3553 static tree
3555 {
3562 {
3569 {
3572 {
3582 }
3585 /* May be this should be sufficient_parms_p instead,
3586 depending on how exactly should user-defined literals
3587 work in presence of default arguments on the literal
3588 operator parameters. */
3591 }
3592 }
3595 }
3597 /* Parse a user-defined char constant. Returns a call to a user-defined
3598 literal operator taking the character as an argument. */
3600 static tree
3602 {
3610 /* Build up a call to the user-defined operator */
3611 /* Lookup the name we got back from the id-expression. */
3616 {
3621 }
3630 }
3632 /* A subroutine of cp_parser_userdef_numeric_literal to
3633 create a char... template parameter pack from a string node. */
3635 static tree
3637 {
3638 tree charvec;
3644 /* Fill in CHARVEC with all of the parameters. */
3649 /* Build the argument packs. */
3656 }
3658 /* Parse a user-defined numeric constant. returns a call to a user-defined
3659 literal operator. */
3661 static tree
3663 {
3673 /* Look for a literal operator taking the exact type of numeric argument
3674 as the literal value. */
3679 {
3682 {
3685 }
3686 }
3689 /* If the numeric argument didn't work, look for a raw literal
3690 operator taking a const char* argument consisting of the number
3691 in string format. */
3696 {
3699 {
3702 }
3703 }
3706 /* If the raw literal didn't work, look for a non-type template
3707 function with parameter pack char.... Call the function with
3708 template parameter characters representing the number. */
3712 {
3717 {
3720 }
3721 }
3726 }
3728 /* Parse a user-defined string constant. Returns a call to a user-defined
3729 literal operator taking a character pointer and the length of the string
3730 as arguments. */
3732 static tree
3734 {
3743 /* Build up a call to the user-defined operator */
3744 /* Lookup the name we got back from the id-expression. */
3750 {
3754 }
3763 }
3766 /* Basic concepts [gram.basic] */
3768 /* Parse a translation-unit.
3770 translation-unit:
3771 declaration-seq [opt]
3773 Returns TRUE if all went well. */
3775 static bool
3777 {
3778 /* The address of the first non-permanent object on the declarator
3779 obstack. */
3784 /* Create the declarator obstack, if necessary. */
3786 {
3788 /* Create the error declarator. */
3790 /* Create the empty parameter list. */
3792 /* Remember where the base of the declarator obstack lies. */
3794 }
3798 /* If there are no tokens left then all went well. */
3800 {
3801 /* Get rid of the token array; we don't need it any more. */
3805 /* This file might have been a context that's implicitly extern
3806 "C". If so, pop the lang context. (Only relevant for PCH.) */
3808 {
3811 }
3813 /* Finish up. */
3817 }
3818 else
3819 {
3822 }
3824 /* Make sure the declarator obstack was fully cleaned up. */
3828 /* All went well. */
3830 }
3832 /* Expressions [gram.expr] */
3834 /* Parse a primary-expression.
3836 primary-expression:
3837 literal
3838 this
3839 ( expression )
3840 id-expression
3842 GNU Extensions:
3844 primary-expression:
3845 ( compound-statement )
3846 __builtin_va_arg ( assignment-expression , type-id )
3847 __builtin_offsetof ( type-id , offsetof-expression )
3849 C++ Extensions:
3850 __has_nothrow_assign ( type-id )
3851 __has_nothrow_constructor ( type-id )
3852 __has_nothrow_copy ( type-id )
3853 __has_trivial_assign ( type-id )
3854 __has_trivial_constructor ( type-id )
3855 __has_trivial_copy ( type-id )
3856 __has_trivial_destructor ( type-id )
3857 __has_virtual_destructor ( type-id )
3858 __is_abstract ( type-id )
3859 __is_base_of ( type-id , type-id )
3860 __is_class ( type-id )
3861 __is_convertible_to ( type-id , type-id )
3862 __is_empty ( type-id )
3863 __is_enum ( type-id )
3864 __is_final ( type-id )
3865 __is_literal_type ( type-id )
3866 __is_pod ( type-id )
3867 __is_polymorphic ( type-id )
3868 __is_std_layout ( type-id )
3869 __is_trivial ( type-id )
3870 __is_union ( type-id )
3872 Objective-C++ Extension:
3874 primary-expression:
3875 objc-expression
3877 literal:
3878 __null
3880 ADDRESS_P is true iff this expression was immediately preceded by
3881 "&" and therefore might denote a pointer-to-member. CAST_P is true
3882 iff this expression is the target of a cast. TEMPLATE_ARG_P is
3883 true iff this expression is a template argument.
3885 Returns a representation of the expression. Upon return, *IDK
3886 indicates what kind of id-expression (if any) was present. */
3888 static tree
3894 {
3897 /* Assume the primary expression is not an id-expression. */
3900 /* Peek at the next token. */
3903 {
3904 /* literal:
3905 integer-literal
3906 character-literal
3907 floating-literal
3908 string-literal
3909 boolean-literal
3910 pointer-literal
3911 user-defined-literal */
3921 {
3925 }
3926 /* Floating-point literals are only allowed in an integral
3927 constant expression if they are cast to an integral or
3928 enumeration type. */
3932 {
3933 /* CAST_P will be set even in invalid code like "int(2.7 +
3934 ...)". Therefore, we have to check that the next token
3935 is sure to end the cast. */
3937 {
3942 enumerator-definition. */
3944 /* The curly brace at the end of an enum-specifier. */
3946 /* The end of a statement. */
3948 /* The end of the cast-expression. */
3950 /* The end of an array bound. */
3952 /* The closing ">" in a template-argument-list. */
3955 /* C++0x only: A ">>" treated like two ">" tokens,
3956 in a template-argument-list. */
3961 }
3963 /* If we are within a cast, then the constraint that the
3964 cast is to an integral or enumeration type will be
3965 checked at that point. If we are not within a cast, then
3966 this code is invalid. */
3969 }
3988 /* ??? Should wide strings be allowed when parser->translate_strings_p
3989 is false (i.e. in attributes)? If not, we can kill the third
3990 argument to cp_parser_string_literal. */
3996 {
3997 tree expr;
4000 /* Consume the `('. */
4002 /* Within a parenthesized expression, a `>' token is always
4003 the greater-than operator. */
4004 saved_greater_than_is_operator_p
4007 /* If we see `( { ' then we are looking at the beginning of
4008 a GNU statement-expression. */
4011 {
4012 /* Statement-expressions are not allowed by the standard. */
4016 /* And they're not allowed outside of a function-body; you
4017 cannot, for example, write:
4019 int i = ({ int j = 3; j + 1; });
4021 at class or namespace scope. */
4024 {
4026 "statement-expressions are not allowed outside "
4030 }
4031 else
4032 {
4033 /* Start the statement-expression. */
4035 /* Parse the compound-statement. */
4037 /* Finish up. */
4039 }
4040 }
4041 else
4042 {
4043 /* Parse the parenthesized expression. */
4045 /* Let the front end know that this expression was
4046 enclosed in parentheses. This matters in case, for
4047 example, the expression is of the form `A::B', since
4048 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4049 not. */
4051 /* DR 705: Wrapping an unqualified name in parentheses
4052 suppresses arg-dependent lookup. We want to pass back
4053 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4054 (c++/37862), but none of the others. */
4057 }
4058 /* The `>' token might be the end of a template-id or
4059 template-parameter-list now. */
4060 parser->greater_than_is_operator_p
4062 /* Consume the `)'. */
4067 }
4071 /* We have an Objective-C++ message. */
4073 {
4075 /* Don't warn about a failed tentative parse. */
4080 }
4084 /* We have an Objective-C++ string literal. */
4091 {
4092 /* These two are the boolean literals. */
4100 /* The `__null' literal. */
4105 /* The `nullptr' literal. */
4110 /* Recognize the `this' keyword. */
4114 {
4118 }
4119 /* Pointers cannot appear in constant-expressions. */
4124 /* The `operator' keyword can be the beginning of an
4125 id-expression. */
4132 {
4133 non_integral_constant name;
4135 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4136 __func__ are the names of variables -- but they are
4137 treated specially. Therefore, they are handled here,
4138 rather than relying on the generic id-expression logic
4139 below. Grammatically, these names are id-expressions.
4141 Consume the token. */
4145 {
4157 }
4162 /* Look up the name. */
4164 }
4167 {
4168 tree expression;
4169 tree type;
4170 source_location type_location;
4172 /* The `__builtin_va_arg' construct is used to handle
4173 `va_arg'. Consume the `__builtin_va_arg' token. */
4175 /* Look for the opening `('. */
4177 /* Now, parse the assignment-expression. */
4180 /* Look for the `,'. */
4183 /* Parse the type-id. */
4185 /* Look for the closing `)'. */
4187 /* Using `va_arg' in a constant-expression is not
4188 allowed. */
4190 NIC_VA_ARG))
4193 }
4221 /* Objective-C++ expressions. */
4231 {
4236 }
4240 }
4242 /* An id-expression can start with either an identifier, a
4243 `::' as the beginning of a qualified-id, or the "operator"
4244 keyword. */
4249 {
4250 tree id_expression;
4251 tree decl;
4257 id_expression:
4258 /* Parse the id-expression. */
4259 id_expression
4276 /* If we have a template-id, then no further lookup is
4277 required. If the template-id was for a template-class, we
4278 will sometimes have a TYPE_DECL at this point. */
4282 /* Look up the name. */
4283 else
4284 {
4285 tree ambiguous_decls;
4287 /* If we already know that this lookup is ambiguous, then
4288 we've already issued an error message; there's no reason
4289 to check again. */
4292 {
4295 }
4298 none_type,
4299 template_p,
4304 /* If the lookup was ambiguous, an error will already have
4305 been issued. */
4309 /* In Objective-C++, we may have an Objective-C 2.0
4310 dot-syntax for classes here. */
4315 {
4316 tree component;
4323 }
4325 /* In Objective-C++, an instance variable (ivar) may be preferred
4326 to whatever cp_parser_lookup_name() found. */
4329 /* If name lookup gives us a SCOPE_REF, then the
4330 qualifying scope was dependent. */
4332 {
4333 /* At this point, we do not know if DECL is a valid
4334 integral constant expression. We assume that it is
4335 in fact such an expression, so that code like:
4337 template <int N> struct A {
4338 int a[B<N>::i];
4339 };
4341 is accepted. At template-instantiation time, we
4342 will check that B<N>::i is actually a constant. */
4344 }
4345 /* Check to see if DECL is a local variable in a context
4346 where that is forbidden. */
4349 {
4350 /* It might be that we only found DECL because we are
4351 trying to be generous with pre-ISO scoping rules.
4352 For example, consider:
4354 int i;
4355 void g() {
4356 for (int i = 0; i < 10; ++i) {}
4357 extern void f(int j = i);
4358 }
4360 Here, name look up will originally find the out
4361 of scope `i'. We need to issue a warning message,
4362 but then use the global `i'. */
4365 {
4368 decl);
4370 }
4371 }
4372 }
4374 decl = (finish_id_expression
4376 idk,
4381 template_arg_p,
4387 }
4389 /* Anything else is an error. */
4393 }
4394 }
4396 /* Parse an id-expression.
4398 id-expression:
4399 unqualified-id
4400 qualified-id
4402 qualified-id:
4403 :: [opt] nested-name-specifier template [opt] unqualified-id
4404 :: identifier
4405 :: operator-function-id
4406 :: template-id
4408 Return a representation of the unqualified portion of the
4409 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4410 a `::' or nested-name-specifier.
4412 Often, if the id-expression was a qualified-id, the caller will
4413 want to make a SCOPE_REF to represent the qualified-id. This
4414 function does not do this in order to avoid wastefully creating
4415 SCOPE_REFs when they are not required.
4417 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4418 `template' keyword.
4420 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4421 uninstantiated templates.
4423 If *TEMPLATE_P is non-NULL, it is set to true iff the
4424 `template' keyword is used to explicitly indicate that the entity
4425 named is a template.
4427 If DECLARATOR_P is true, the id-expression is appearing as part of
4428 a declarator, rather than as part of an expression. */
4430 static tree
4437 {
4441 /* Assume the `template' keyword was not used. */
4445 /* Look for the optional `::' operator. */
4446 global_scope_p
4449 /* Look for the optional nested-name-specifier. */
4450 nested_name_specifier_p
4453 check_dependency_p,
4455 declarator_p)
4457 /* If there is a nested-name-specifier, then we are looking at
4458 the first qualified-id production. */
4460 {
4461 tree saved_scope;
4462 tree saved_object_scope;
4463 tree saved_qualifying_scope;
4464 tree unqualified_id;
4467 /* See if the next token is the `template' keyword. */
4471 /* Name lookup we do during the processing of the
4472 unqualified-id might obliterate SCOPE. */
4476 /* Process the final unqualified-id. */
4478 check_dependency_p,
4479 declarator_p,
4481 /* Restore the SAVED_SCOPE for our caller. */
4487 }
4488 /* Otherwise, if we are in global scope, then we are looking at one
4489 of the other qualified-id productions. */
4491 {
4493 tree id;
4495 /* Peek at the next token. */
4498 /* If it's an identifier, and the next token is not a "<", then
4499 we can avoid the template-id case. This is an optimization
4500 for this common case. */
4502 && !cp_parser_nth_token_starts_template_argument_list_p
4507 /* Try a template-id. */
4511 none_type,
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 none_type,
4590 declarator_p);
4591 /* If it worked, we're done. */
4594 /* Otherwise, it's an ordinary identifier. */
4596 }
4600 check_dependency_p,
4601 none_type,
4602 declarator_p);
4605 {
4606 tree type_decl;
4607 tree qualifying_scope;
4608 tree object_scope;
4609 tree scope;
4612 /* Consume the `~' token. */
4614 /* Parse the class-name. The standard, as written, seems to
4615 say that:
4617 template <typename T> struct S { ~S (); };
4618 template <typename T> S<T>::~S() {}
4620 is invalid, since `~' must be followed by a class-name, but
4621 `S<T>' is dependent, and so not known to be a class.
4622 That's not right; we need to look in uninstantiated
4623 templates. A further complication arises from:
4625 template <typename T> void f(T t) {
4626 t.T::~T();
4627 }
4629 Here, it is not possible to look up `T' in the scope of `T'
4630 itself. We must look in both the current scope, and the
4631 scope of the containing complete expression.
4633 Yet another issue is:
4635 struct S {
4636 int S;
4637 ~S();
4638 };
4640 S::~S() {}
4642 The standard does not seem to say that the `S' in `~S'
4643 should refer to the type `S' and not the data member
4644 `S::S'. */
4646 /* DR 244 says that we look up the name after the "~" in the
4647 same scope as we looked up the qualifying name. That idea
4648 isn't fully worked out; it's more complicated than that. */
4653 /* Check for invalid scopes. */
4655 {
4659 }
4661 {
4665 scope);
4670 }
4673 /* If the name is of the form "X::~X" it's OK even if X is a
4674 typedef. */
4683 {
4686 }
4688 /* If there was an explicit qualification (S::~T), first look
4689 in the scope given by the qualification (i.e., S).
4691 Note: in the calls to cp_parser_class_name below we pass
4692 typename_type so that lookup finds the injected-class-name
4693 rather than the constructor. */
4697 {
4702 typename_type,
4705 declarator_p);
4708 }
4709 /* In "N::S::~S", look in "N" as well. */
4711 {
4716 type_decl
4720 typename_type,
4723 declarator_p);
4726 }
4727 /* In "p->S::~T", look in the scope given by "*p" as well. */
4729 {
4734 type_decl
4738 typename_type,
4741 declarator_p);
4744 }
4745 /* Look in the surrounding context. */
4747 {
4753 type_decl
4757 typename_type,
4760 declarator_p);
4763 {
4764 /* We couldn't find a type with this name, so just accept
4765 it and check for a match at instantiation time. */
4770 }
4771 }
4772 /* If an error occurred, assume that the name of the
4773 destructor is the same as the name of the qualifying
4774 class. That allows us to keep parsing after running
4775 into ill-formed destructor names. */
4781 /* Check that destructor name and scope match. */
4783 {
4790 }
4792 /* [class.dtor]
4794 A typedef-name that names a class shall not be used as the
4795 identifier in the declarator for a destructor declaration. */
4802 type_decl);
4805 }
4809 {
4810 tree id;
4812 /* This could be a template-id, so we try that first. */
4814 /* Try a template-id. */
4817 none_type,
4818 declarator_p);
4819 /* If that worked, we're done. */
4822 /* We still don't know whether we're looking at an
4823 operator-function-id or a conversion-function-id. */
4825 /* Try an operator-function-id. */
4827 /* If that didn't work, try a conversion-function-id. */
4831 {
4832 /* 17.6.3.3.5 */
4837 }
4840 }
4841 /* Fall through. */
4848 }
4849 }
4851 /* Parse an (optional) nested-name-specifier.
4853 nested-name-specifier: [C++98]
4854 class-or-namespace-name :: nested-name-specifier [opt]
4855 class-or-namespace-name :: template nested-name-specifier [opt]
4857 nested-name-specifier: [C++0x]
4858 type-name ::
4859 namespace-name ::
4860 nested-name-specifier identifier ::
4861 nested-name-specifier template [opt] simple-template-id ::
4863 PARSER->SCOPE should be set appropriately before this function is
4864 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
4865 effect. TYPE_P is TRUE if we non-type bindings should be ignored
4866 in name lookups.
4868 Sets PARSER->SCOPE to the class (TYPE) or namespace
4869 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
4870 it unchanged if there is no nested-name-specifier. Returns the new
4871 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
4873 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
4874 part of a declaration and/or decl-specifier. */
4876 static tree
4882 {
4887 /* Remember where the nested-name-specifier starts. */
4889 {
4892 }
4895 {
4896 tree new_scope;
4897 tree old_scope;
4898 tree saved_qualifying_scope;
4901 /* Spot cases that cannot be the beginning of a
4902 nested-name-specifier. */
4905 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
4906 the already parsed nested-name-specifier. */
4908 {
4909 /* Grab the nested-name-specifier and continue the loop. */
4911 /* If we originally encountered this nested-name-specifier
4912 with IS_DECLARATION set to false, we will not have
4913 resolved TYPENAME_TYPEs, so we must do so here. */
4916 {
4921 }
4924 }
4926 /* Spot cases that cannot be the beginning of a
4927 nested-name-specifier. On the second and subsequent times
4928 through the loop, we look for the `template' keyword. */
4930 ;
4931 /* A template-id can start a nested-name-specifier. */
4933 ;
4934 /* DR 743: decltype can be used in a nested-name-specifier. */
4936 ;
4937 else
4938 {
4939 /* If the next token is not an identifier, then it is
4940 definitely not a type-name or namespace-name. */
4943 /* If the following token is neither a `<' (to begin a
4944 template-id), nor a `::', then we are not looking at a
4945 nested-name-specifier. */
4951 {
4955 }
4958 && !cp_parser_nth_token_starts_template_argument_list_p
4961 }
4963 /* The nested-name-specifier is optional, so we parse
4964 tentatively. */
4967 /* Look for the optional `template' keyword, if this isn't the
4968 first time through the loop. */
4971 else
4974 /* Save the old scope since the name lookup we are about to do
4975 might destroy it. */
4978 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
4979 look up names in "X<T>::I" in order to determine that "Y" is
4980 a template. So, if we have a typename at this point, we make
4981 an effort to look through it. */
4983 && !typename_keyword_p
4988 /* Parse the qualifying entity. */
4989 new_scope
4991 typename_keyword_p,
4992 template_keyword_p,
4993 check_dependency_p,
4994 type_p,
4995 is_declaration);
4996 /* Look for the `::' token. */
4999 /* If we found what we wanted, we keep going; otherwise, we're
5000 done. */
5002 {
5005 /* Restore the OLD_SCOPE since it was valid before the
5006 failed attempt at finding the last
5007 class-or-namespace-name. */
5011 /* If the next token is a decltype, and the one after that is a
5012 `::', then the decltype has failed to resolve to a class or
5013 enumeration type. Give this error even when parsing
5014 tentatively since it can't possibly be valid--and we're going
5015 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
5016 won't get another chance.*/
5020 {
5027 /* As below. */
5030 }
5034 /* If the next token is an identifier, and the one after
5035 that is a `::', then any valid interpretation would have
5036 found a class-or-namespace-name. */
5042 {
5045 {
5047 {
5048 tree decl;
5049 tree ambiguous_decls;
5052 none_type,
5061 decl);
5063 {
5069 }
5070 else
5071 {
5073 cp_parser_name_lookup_error
5076 else
5077 cp_parser_name_lookup_error
5080 }
5081 }
5084 /* Treat this as a successful nested-name-specifier
5085 due to:
5087 [basic.lookup.qual]
5089 If the name found is not a class-name (clause
5090 _class_) or namespace-name (_namespace.def_), the
5091 program is ill-formed. */
5093 }
5095 }
5097 }
5098 /* We've found one valid nested-name-specifier. */
5100 /* Name lookup always gives us a DECL. */
5103 /* Uses of "template" must be followed by actual templates. */
5115 new_scope);
5116 /* If it is a class scope, try to complete it; we are about to
5117 be looking up names inside the class. */
5119 /* Since checking types for dependency can be expensive,
5120 avoid doing it if the type is already complete. */
5122 /* Do not try to complete dependent types. */
5124 {
5126 /* If it is a typedef to current class, use the current
5127 class instead, as the typedef won't have any names inside
5128 it yet. */
5132 }
5133 /* Make sure we look in the right scope the next time through
5134 the loop. */
5136 }
5138 /* If parsing tentatively, replace the sequence of tokens that makes
5139 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5140 token. That way, should we re-parse the token stream, we will
5141 not have to repeat the effort required to do the parse, nor will
5142 we issue duplicate error messages. */
5144 {
5148 /* Reset the contents of the START token. */
5150 /* Retrieve any deferred checks. Do not pop this access checks yet
5151 so the memory will not be reclaimed during token replacing below. */
5159 /* Purge all subsequent tokens. */
5161 }
5167 }
5169 /* Parse a nested-name-specifier. See
5170 cp_parser_nested_name_specifier_opt for details. This function
5171 behaves identically, except that it will an issue an error if no
5172 nested-name-specifier is present. */
5174 static tree
5180 {
5181 tree scope;
5183 /* Look for the nested-name-specifier. */
5185 typename_keyword_p,
5186 check_dependency_p,
5187 type_p,
5188 is_declaration);
5189 /* If it was not present, issue an error message. */
5191 {
5194 }
5197 }
5199 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5200 this is either a class-name or a namespace-name (which corresponds
5201 to the class-or-namespace-name production in the grammar). For
5202 C++0x, it can also be a type-name that refers to an enumeration
5203 type or a simple-template-id.
5205 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5206 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5207 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5208 TYPE_P is TRUE iff the next name should be taken as a class-name,
5209 even the same name is declared to be another entity in the same
5210 scope.
5212 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5213 specified by the class-or-namespace-name. If neither is found the
5214 ERROR_MARK_NODE is returned. */
5216 static tree
5223 {
5224 tree saved_scope;
5225 tree saved_qualifying_scope;
5226 tree saved_object_scope;
5227 tree scope;
5231 /* DR 743: decltype can appear in a nested-name-specifier. */
5233 {
5237 {
5240 }
5244 }
5246 /* Before we try to parse the class-name, we must save away the
5247 current PARSER->SCOPE since cp_parser_class_name will destroy
5248 it. */
5252 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5253 there is no need to look for a namespace-name. */
5254 only_class_p = template_keyword_p
5259 typename_keyword_p,
5260 template_keyword_p,
5262 check_dependency_p,
5264 is_declaration);
5266 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5270 {
5271 /* Restore the saved scope. */
5276 /* Parse tentatively. */
5279 /* Parse a type-name */
5282 /* "If the name found does not designate a namespace or a class,
5283 enumeration, or dependent type, the program is ill-formed."
5285 We cover classes and dependent types above and namespaces below,
5286 so this code is only looking for enums. */
5292 }
5293 /* If that didn't work, try for a namespace-name. */
5295 {
5296 /* Restore the saved scope. */
5300 /* If we are not looking at an identifier followed by the scope
5301 resolution operator, then this is not part of a
5302 nested-name-specifier. (Note that this function is only used
5303 to parse the components of a nested-name-specifier.) */
5308 }
5311 }
5313 /* Parse a postfix-expression.
5315 postfix-expression:
5316 primary-expression
5317 postfix-expression [ expression ]
5318 postfix-expression ( expression-list [opt] )
5319 simple-type-specifier ( expression-list [opt] )
5320 typename :: [opt] nested-name-specifier identifier
5321 ( expression-list [opt] )
5322 typename :: [opt] nested-name-specifier template [opt] template-id
5323 ( expression-list [opt] )
5324 postfix-expression . template [opt] id-expression
5325 postfix-expression -> template [opt] id-expression
5326 postfix-expression . pseudo-destructor-name
5327 postfix-expression -> pseudo-destructor-name
5328 postfix-expression ++
5329 postfix-expression --
5330 dynamic_cast < type-id > ( expression )
5331 static_cast < type-id > ( expression )
5332 reinterpret_cast < type-id > ( expression )
5333 const_cast < type-id > ( expression )
5334 typeid ( expression )
5335 typeid ( type-id )
5337 GNU Extension:
5339 postfix-expression:
5340 ( type-id ) { initializer-list , [opt] }
5342 This extension is a GNU version of the C99 compound-literal
5343 construct. (The C99 grammar uses `type-name' instead of `type-id',
5344 but they are essentially the same concept.)
5346 If ADDRESS_P is true, the postfix expression is the operand of the
5347 `&' operator. CAST_P is true if this expression is the target of a
5348 cast.
5350 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5351 class member access expressions [expr.ref].
5353 Returns a representation of the expression. */
5355 static tree
5359 {
5366 /* Peek at the next token. */
5368 /* Some of the productions are determined by keywords. */
5371 {
5376 {
5377 tree type;
5378 tree expression;
5381 /* All of these can be handled in the same way from the point
5382 of view of parsing. Begin by consuming the token
5383 identifying the cast. */
5386 /* New types cannot be defined in the cast. */
5388 parser->type_definition_forbidden_message
5391 /* Look for the opening `<'. */
5393 /* Parse the type to which we are casting. */
5395 /* Look for the closing `>'. */
5397 /* Restore the old message. */
5400 /* And the expression which is being cast. */
5405 /* Only type conversions to integral or enumeration types
5406 can be used in constant-expressions. */
5412 {
5414 postfix_expression
5418 postfix_expression
5422 postfix_expression
5424 tf_warning_or_error);
5427 postfix_expression
5432 }
5433 }
5437 {
5438 tree type;
5442 /* Consume the `typeid' token. */
5444 /* Look for the `(' token. */
5446 /* Types cannot be defined in a `typeid' expression. */
5448 parser->type_definition_forbidden_message
5450 /* We can't be sure yet whether we're looking at a type-id or an
5451 expression. */
5453 /* Try a type-id first. */
5458 /* Look for the `)' token. Otherwise, we can't be sure that
5459 we're not looking at an expression: consider `typeid (int
5460 (3))', for example. */
5462 /* If all went well, simply lookup the type-id. */
5465 /* Otherwise, fall back to the expression variant. */
5466 else
5467 {
5468 tree expression;
5470 /* Look for an expression. */
5472 /* Compute its typeid. */
5474 /* Look for the `)' token. */
5476 }
5477 /* Restore the saved message. */
5479 /* `typeid' may not appear in an integral constant expression. */
5482 }
5486 {
5487 tree type;
5488 /* The syntax permitted here is the same permitted for an
5489 elaborated-type-specifier. */
5494 }
5498 {
5501 tree p;
5515 return
5516 c_build_vec_perm_expr
5521 return
5522 c_build_vec_perm_expr
5526 else
5527 {
5531 }
5533 }
5536 {
5537 tree type;
5539 /* If the next thing is a simple-type-specifier, we may be
5540 looking at a functional cast. We could also be looking at
5541 an id-expression. So, we try the functional cast, and if
5542 that doesn't work we fall back to the primary-expression. */
5544 /* Look for the simple-type-specifier. */
5547 CP_PARSER_FLAGS_NONE);
5548 /* Parse the cast itself. */
5550 postfix_expression
5552 /* If that worked, we're done. */
5556 /* If the functional-cast didn't work out, try a
5557 compound-literal. */
5560 {
5565 /* Consume the `('. */
5567 /* Parse the type. */
5572 /* Look for the `)'. */
5574 /* Look for the `{'. */
5576 /* If things aren't going well, there's no need to
5577 keep going. */
5579 {
5581 /* Parse the initializer-list. */
5582 initializer_list
5584 /* Allow a trailing `,'. */
5587 /* Look for the final `}'. */
5589 }
5590 /* If that worked, we're definitely looking at a
5591 compound-literal expression. */
5593 {
5594 /* Warn the user that a compound literal is not
5595 allowed in standard C++. */
5597 /* For simplicity, we disallow compound literals in
5598 constant-expressions. We could
5599 allow compound literals of integer type, whose
5600 initializer was a constant, in constant
5601 expressions. Permitting that usage, as a further
5602 extension, would not change the meaning of any
5603 currently accepted programs. (Of course, as
5604 compound literals are not part of ISO C++, the
5605 standard has nothing to say.) */
5607 NIC_NCC))
5608 {
5611 }
5612 /* Form the representation of the compound-literal. */
5613 postfix_expression
5614 = (finish_compound_literal
5616 initializer_list),
5617 tf_warning_or_error));
5619 }
5620 }
5622 /* It must be a primary-expression. */
5623 postfix_expression
5627 }
5629 }
5631 /* Keep looping until the postfix-expression is complete. */
5633 {
5637 /* It is not a Koenig lookup function call. */
5638 postfix_expression
5641 /* Peek at the next token. */
5645 {
5648 {
5650 "two consecutive %<[%> shall "
5653 }
5654 postfix_expression
5656 postfix_expression,
5663 /* postfix-expression ( expression-list [opt] ) */
5664 {
5673 is_builtin_constant_p
5676 {
5677 /* The whole point of __builtin_constant_p is to allow
5678 non-constant expressions to appear as arguments. */
5679 saved_integral_constant_expression_p
5681 saved_non_integral_constant_expression_p
5684 }
5685 args = (cp_parser_parenthesized_expression_list
5690 {
5691 parser->integral_constant_expression_p
5693 parser->non_integral_constant_expression_p
5695 }
5698 {
5701 }
5703 /* Function calls are not permitted in
5704 constant-expressions. */
5707 NIC_FUNC_CALL))
5708 {
5712 }
5717 {
5719 {
5721 {
5724 postfix_expression
5727 tf_warning_or_error);
5728 }
5729 else
5730 postfix_expression
5732 }
5733 /* We do not perform argument-dependent lookup if
5734 normal lookup finds a non-function, in accordance
5735 with the expected resolution of DR 218. */
5738 {
5742 /* Do not do argument dependent lookup if regular
5743 lookup finds a member function or a block-scope
5744 function declaration. [basic.lookup.argdep]/3 */
5747 {
5750 postfix_expression
5753 tf_warning_or_error);
5754 }
5755 }
5756 }
5759 {
5769 {
5770 postfix_expression
5774 }
5777 {
5778 postfix_expression
5779 = (build_new_method_call
5785 tf_warning_or_error));
5786 }
5787 else
5788 postfix_expression
5792 tf_warning_or_error);
5793 }
5797 postfix_expression = (build_offset_ref_call_from_tree
5799 tf_warning_or_error));
5801 /* A call to a static class member, or a namespace-scope
5802 function. */
5803 postfix_expression
5806 koenig_p,
5807 tf_warning_or_error);
5808 else
5809 /* All other function calls. */
5810 postfix_expression
5813 koenig_p,
5814 tf_warning_or_error);
5816 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
5820 }
5825 /* postfix-expression . template [opt] id-expression
5826 postfix-expression . pseudo-destructor-name
5827 postfix-expression -> template [opt] id-expression
5828 postfix-expression -> pseudo-destructor-name */
5830 /* Consume the `.' or `->' operator. */
5833 postfix_expression
5835 postfix_expression,
5843 /* postfix-expression ++ */
5844 /* Consume the `++' token. */
5846 /* Generate a representation for the complete expression. */
5847 postfix_expression
5849 POSTINCREMENT_EXPR);
5850 /* Increments may not appear in constant-expressions. */
5858 /* postfix-expression -- */
5859 /* Consume the `--' token. */
5861 /* Generate a representation for the complete expression. */
5862 postfix_expression
5864 POSTDECREMENT_EXPR);
5865 /* Decrements may not appear in constant-expressions. */
5877 else
5879 }
5880 }
5882 /* We should never get here. */
5885 }
5887 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5888 by cp_parser_builtin_offsetof. We're looking for
5890 postfix-expression [ expression ]
5891 postfix-expression [ braced-init-list ] (C++11)
5893 FOR_OFFSETOF is set if we're being called in that context, which
5894 changes how we deal with integer constant expressions. */
5896 static tree
5898 tree postfix_expression,
5900 {
5901 tree index;
5904 /* Consume the `[' token. */
5907 /* Parse the index expression. */
5908 /* ??? For offsetof, there is a question of what to allow here. If
5909 offsetof is not being used in an integral constant expression context,
5910 then we *could* get the right answer by computing the value at runtime.
5911 If we are in an integral constant expression context, then we might
5912 could accept any constant expression; hard to say without analysis.
5913 Rather than open the barn door too wide right away, allow only integer
5914 constant expressions here. */
5917 else
5918 {
5920 {
5924 }
5925 else
5927 }
5929 /* Look for the closing `]'. */
5932 /* Build the ARRAY_REF. */
5935 /* When not doing offsetof, array references are not permitted in
5936 constant-expressions. */
5942 }
5944 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5945 by cp_parser_builtin_offsetof. We're looking for
5947 postfix-expression . template [opt] id-expression
5948 postfix-expression . pseudo-destructor-name
5949 postfix-expression -> template [opt] id-expression
5950 postfix-expression -> pseudo-destructor-name
5952 FOR_OFFSETOF is set if we're being called in that context. That sorta
5953 limits what of the above we'll actually accept, but nevermind.
5954 TOKEN_TYPE is the "." or "->" token, which will already have been
5955 removed from the stream. */
5957 static tree
5960 tree postfix_expression,
5962 location_t location)
5963 {
5964 tree name;
5969 /* If this is a `->' operator, dereference the pointer. */
5972 tf_warning_or_error);
5973 /* Check to see whether or not the expression is type-dependent. */
5975 /* The identifier following the `->' or `.' is not qualified. */
5981 /* Enter the scope corresponding to the type of the object
5982 given by the POSTFIX_EXPRESSION. */
5984 {
5986 /* According to the standard, no expression should ever have
5987 reference type. Unfortunately, we do not currently match
5988 the standard in this respect in that our internal representation
5989 of an expression may have reference type even when the standard
5990 says it does not. Therefore, we have to manually obtain the
5991 underlying type here. */
5993 /* The type of the POSTFIX_EXPRESSION must be complete. */
5995 {
5997 postfix_expression);
5999 }
6000 /* Unlike the object expression in other contexts, *this is not
6001 required to be of complete type for purposes of class member
6002 access (5.2.5) outside the member function body. */
6006 /* Let the name lookup machinery know that we are processing a
6007 class member access expression. */
6009 /* If something went wrong, we want to be able to discern that case,
6010 as opposed to the case where there was no SCOPE due to the type
6011 of expression being dependent. */
6014 /* If the SCOPE was erroneous, make the various semantic analysis
6015 functions exit quickly -- and without issuing additional error
6016 messages. */
6019 }
6021 /* Assume this expression is not a pseudo-destructor access. */
6024 /* If the SCOPE is a scalar type, then, if this is a valid program,
6025 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
6026 is type dependent, it can be pseudo-destructor-name or something else.
6027 Try to parse it as pseudo-destructor-name first. */
6029 {
6030 tree s;
6031 tree type;
6034 /* Parse the pseudo-destructor-name. */
6043 {
6045 postfix_expression
6048 }
6049 }
6052 {
6053 /* If the SCOPE is not a scalar type, we are looking at an
6054 ordinary class member access expression, rather than a
6055 pseudo-destructor-name. */
6058 /* Parse the id-expression. */
6059 name = (cp_parser_id_expression
6066 /* In general, build a SCOPE_REF if the member name is qualified.
6067 However, if the name was not dependent and has already been
6068 resolved; there is no need to build the SCOPE_REF. For example;
6070 struct X { void f(); };
6071 template <typename T> void f(T* t) { t->X::f(); }
6073 Even though "t" is dependent, "X::f" is not and has been resolved
6074 to a BASELINK; there is no need to include scope information. */
6076 /* But we do need to remember that there was an explicit scope for
6077 virtual function calls. */
6081 /* If the name is a template-id that names a type, we will get a
6082 TYPE_DECL here. That is invalid code. */
6084 {
6087 }
6088 else
6089 {
6091 {
6093 {
6097 }
6098 else
6101 name,
6102 template_p);
6106 }
6108 adjust_result_of_qualified_name_lookup
6110 postfix_expression
6112 template_p,
6113 tf_warning_or_error);
6114 }
6115 }
6117 /* We no longer need to look up names in the scope of the object on
6118 the left-hand side of the `.' or `->' operator. */
6121 /* Outside of offsetof, these operators may not appear in
6122 constant-expressions. */
6124 && (cp_parser_non_integral_constant_expression
6129 }
6131 /* Parse a parenthesized expression-list.
6133 expression-list:
6134 assignment-expression
6135 expression-list, assignment-expression
6137 attribute-list:
6138 expression-list
6139 identifier
6140 identifier, expression-list
6142 CAST_P is true if this expression is the target of a cast.
6144 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6145 argument pack.
6147 Returns a vector of trees. Each element is a representation of an
6148 assignment-expression. NULL is returned if the ( and or ) are
6149 missing. An empty, but allocated, vector is returned on no
6150 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6151 if we are parsing an attribute list for an attribute that wants a
6152 plain identifier argument, normal_attr for an attribute that wants
6153 an expression, or non_attr if we aren't parsing an attribute list. If
6154 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6155 not all of the expressions in the list were constant. */
6163 {
6169 /* Assume all the expressions will be constant. */
6178 /* Within a parenthesized expression, a `>' token is always
6179 the greater-than operator. */
6180 saved_greater_than_is_operator_p
6184 /* Consume expressions until there are no more. */
6187 {
6188 tree expr;
6190 /* At the beginning of attribute lists, check to see if the
6191 next token is an identifier. */
6194 {
6197 /* Consume the identifier. */
6199 /* Save the identifier. */
6201 }
6202 else
6203 {
6206 /* Parse the next assignment-expression. */
6208 {
6209 /* A braced-init-list. */
6214 }
6216 {
6217 expr = (cp_parser_constant_expression
6222 }
6223 else
6229 /* If we have an ellipsis, then this is an expression
6230 expansion. */
6233 {
6234 /* Consume the `...'. */
6237 /* Build the argument pack. */
6239 }
6241 /* Add it to the list. We add error_mark_node
6242 expressions to the list, so that we can still tell if
6243 the correct form for a parenthesized expression-list
6244 is found. That gives better errors. */
6249 }
6251 /* After the first item, attribute lists look the same as
6252 expression lists. */
6255 get_comma:;
6256 /* If the next token isn't a `,', then we are done. */
6260 /* Otherwise, consume the `,' and keep going. */
6262 }
6265 {
6268 skip_comma:;
6269 /* We try and resync to an unnested comma, as that will give the
6270 user better diagnostics. */
6278 {
6279 parser->greater_than_is_operator_p
6282 }
6283 }
6285 parser->greater_than_is_operator_p
6292 }
6294 /* Parse a pseudo-destructor-name.
6296 pseudo-destructor-name:
6297 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6298 :: [opt] nested-name-specifier template template-id :: ~ type-name
6299 :: [opt] nested-name-specifier [opt] ~ type-name
6301 If either of the first two productions is used, sets *SCOPE to the
6302 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6303 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6304 or ERROR_MARK_NODE if the parse fails. */
6306 static void
6310 {
6313 /* Assume that things will not work out. */
6316 /* Look for the optional `::' operator. */
6318 /* Look for the optional nested-name-specifier. */
6319 nested_name_specifier_p
6326 /* Now, if we saw a nested-name-specifier, we might be doing the
6327 second production. */
6330 {
6331 /* Consume the `template' keyword. */
6333 /* Parse the template-id. */
6337 class_type,
6339 /* Look for the `::' token. */
6341 }
6342 /* If the next token is not a `~', then there might be some
6343 additional qualification. */
6345 {
6346 /* At this point, we're looking for "type-name :: ~". The type-name
6347 must not be a class-name, since this is a pseudo-destructor. So,
6348 it must be either an enum-name, or a typedef-name -- both of which
6349 are just identifiers. So, we peek ahead to check that the "::"
6350 and "~" tokens are present; if they are not, then we can avoid
6351 calling type_name. */
6355 {
6358 }
6360 /* Look for the type-name. */
6365 /* Look for the `::' token. */
6367 }
6368 else
6371 /* Look for the `~'. */
6374 /* Once we see the ~, this has to be a pseudo-destructor. */
6378 /* Look for the type-name again. We are not responsible for
6379 checking that it matches the first type-name. */
6381 }
6383 /* Parse a unary-expression.
6385 unary-expression:
6386 postfix-expression
6387 ++ cast-expression
6388 -- cast-expression
6389 unary-operator cast-expression
6390 sizeof unary-expression
6391 sizeof ( type-id )
6392 alignof ( type-id ) [C++0x]
6393 new-expression
6394 delete-expression
6396 GNU Extensions:
6398 unary-expression:
6399 __extension__ cast-expression
6400 __alignof__ unary-expression
6401 __alignof__ ( type-id )
6402 alignof unary-expression [C++0x]
6403 __real__ cast-expression
6404 __imag__ cast-expression
6405 && identifier
6407 ADDRESS_P is true iff the unary-expression is appearing as the
6408 operand of the `&' operator. CAST_P is true if this expression is
6409 the target of a cast.
6411 Returns a representation of the expression. */
6413 static tree
6416 {
6420 /* Peek at the next token. */
6422 /* Some keywords give away the kind of expression. */
6424 {
6428 {
6431 {
6434 location_t first_loc;
6437 /* Consume the token. */
6440 /* Parse the operand. */
6445 else
6446 {
6447 /* ISO C++ defines alignof only with types, not with
6448 expressions. So pedwarn if alignof is used with a non-
6449 type expression. However, __alignof__ is ok. */
6452 "ISO C++ does not allow %<alignof%> "
6456 }
6457 /* For SIZEOF_EXPR, just issue diagnostics, but keep
6458 SIZEOF_EXPR with the original operand. */
6460 {
6462 {
6464 {
6467 error_mark_node));
6469 }
6470 else
6474 }
6476 }
6478 }
6487 {
6488 /* The saved value of the PEDANTIC flag. */
6490 tree expr;
6492 /* Save away the PEDANTIC flag. */
6494 /* Parse the cast-expression. */
6496 /* Restore the PEDANTIC flag. */
6500 }
6504 {
6505 tree expression;
6507 /* Consume the `__real__' or `__imag__' token. */
6509 /* Parse the cast-expression. */
6511 /* Create the complete representation. */
6515 expression,
6516 tf_warning_or_error);
6517 }
6525 {
6526 tree expr;
6536 parser->type_definition_forbidden_message
6539 saved_integral_constant_expression_p
6541 saved_non_integral_constant_expression_p
6545 saved_greater_than_is_operator_p
6555 parser->greater_than_is_operator_p
6558 parser->integral_constant_expression_p
6560 parser->non_integral_constant_expression_p
6567 }
6571 }
6572 }
6574 /* Look for the `:: new' and `:: delete', which also signal the
6575 beginning of a new-expression, or delete-expression,
6576 respectively. If the next token is `::', then it might be one of
6577 these. */
6579 {
6582 /* See if the token after the `::' is one of the keywords in
6583 which we're interested. */
6585 /* If it's `new', we have a new-expression. */
6588 /* Similarly, for `delete'. */
6591 }
6593 /* Look for a unary operator. */
6595 /* The `++' and `--' operators can be handled similarly, even though
6596 they are not technically unary-operators in the grammar. */
6598 {
6603 /* Handle the GNU address-of-label extension. */
6606 {
6607 tree identifier;
6608 tree expression;
6611 /* Consume the '&&' token. */
6613 /* Look for the identifier. */
6615 /* Create an expression representing the address. */
6618 NIC_ADDR_LABEL))
6621 }
6622 }
6624 {
6625 tree cast_expression;
6630 /* Consume the operator token. */
6632 /* Parse the cast-expression. */
6633 cast_expression
6637 /* Now, build an appropriate representation. */
6639 {
6643 RO_UNARY_STAR,
6644 tf_warning_or_error);
6649 /* Fall through. */
6652 cast_expression,
6653 tf_warning_or_error);
6660 /* Fall through. */
6665 cast_expression);
6670 }
6674 non_constant_p))
6678 }
6682 pidk);
6683 }
6685 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
6686 unary-operator, the corresponding tree code is returned. */
6688 static enum tree_code
6690 {
6692 {
6713 }
6714 }
6716 /* Parse a new-expression.
6718 new-expression:
6719 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
6720 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
6722 Returns a representation of the expression. */
6724 static tree
6726 {
6729 tree type;
6732 tree ret;
6734 /* Look for the optional `::' operator. */
6735 global_scope_p
6739 /* Look for the `new' operator. */
6741 /* There's no easy way to tell a new-placement from the
6742 `( type-id )' construct. */
6744 /* Look for a new-placement. */
6746 /* If that didn't work out, there's no new-placement. */
6748 {
6752 }
6754 /* If the next token is a `(', then we have a parenthesized
6755 type-id. */
6757 {
6761 /* Consume the `('. */
6764 /* Parse the type-id. */
6765 parser->type_definition_forbidden_message
6770 /* Look for the closing `)'. */
6773 /* There should not be a direct-new-declarator in this production,
6774 but GCC used to allowed this, so we check and emit a sensible error
6775 message for this case. */
6777 {
6783 }
6784 }
6785 /* Otherwise, there must be a new-type-id. */
6786 else
6789 /* If the next token is a `(' or '{', then we have a new-initializer. */
6793 else
6796 /* A new-expression may not appear in an integral constant
6797 expression. */
6800 else
6801 {
6802 /* Create a representation of the new-expression. */
6804 tf_warning_or_error);
6805 }
6813 }
6815 /* Parse a new-placement.
6817 new-placement:
6818 ( expression-list )
6820 Returns the same representation as for an expression-list. */
6824 {
6827 /* Parse the expression-list. */
6828 expression_list = (cp_parser_parenthesized_expression_list
6834 }
6836 /* Parse a new-type-id.
6838 new-type-id:
6839 type-specifier-seq new-declarator [opt]
6841 Returns the TYPE allocated. If the new-type-id indicates an array
6842 type, *NELTS is set to the number of elements in the last array
6843 bound; the TYPE will not include the last array bound. */
6845 static tree
6847 {
6848 cp_decl_specifier_seq type_specifier_seq;
6854 /* The type-specifier sequence must not contain type definitions.
6855 (It cannot contain declarations of new types either, but if they
6856 are not definitions we will catch that because they are not
6857 complete.) */
6859 parser->type_definition_forbidden_message
6861 /* Parse the type-specifier-seq. */
6865 /* Restore the old message. */
6871 /* Parse the new-declarator. */
6874 /* Determine the number of elements in the last array dimension, if
6875 any. */
6877 /* Skip down to the last array dimension. */
6882 {
6885 }
6890 {
6893 }
6896 {
6903 else
6905 }
6908 }
6910 /* Parse an (optional) new-declarator.
6912 new-declarator:
6913 ptr-operator new-declarator [opt]
6914 direct-new-declarator
6916 Returns the declarator. */
6920 {
6923 cp_cv_quals cv_quals;
6925 /* We don't know if there's a ptr-operator next, or not. */
6927 /* Look for a ptr-operator. */
6929 /* If that worked, look for more new-declarators. */
6931 {
6934 /* Parse another optional declarator. */
6937 declarator = cp_parser_make_indirect_declarator
6941 }
6943 /* If the next token is a `[', there is a direct-new-declarator. */
6948 }
6950 /* Parse a direct-new-declarator.
6952 direct-new-declarator:
6953 [ expression ]
6954 direct-new-declarator [constant-expression]
6956 */
6960 {
6964 {
6965 tree expression;
6968 /* Look for the opening `['. */
6973 /* The standard requires that the expression have integral
6974 type. DR 74 adds enumeration types. We believe that the
6975 real intent is that these expressions be handled like the
6976 expression in a `switch' condition, which also allows
6977 classes with a single conversion to integral or
6978 enumeration type. */
6980 {
6981 expression
6983 expression,
6986 {
6988 "expression in new-declarator must have integral "
6991 }
6992 }
6994 /* Look for the closing `]'. */
6997 /* Add this bound to the declarator. */
7000 /* If the next token is not a `[', then there are no more
7001 bounds. */
7004 }
7007 }
7009 /* Parse a new-initializer.
7011 new-initializer:
7012 ( expression-list [opt] )
7013 braced-init-list
7015 Returns a representation of the expression-list. */
7019 {
7023 {
7024 tree t;
7030 }
7031 else
7032 expression_list = (cp_parser_parenthesized_expression_list
7038 }
7040 /* Parse a delete-expression.
7042 delete-expression:
7043 :: [opt] delete cast-expression
7044 :: [opt] delete [ ] cast-expression
7046 Returns a representation of the expression. */
7048 static tree
7050 {
7053 tree expression;
7055 /* Look for the optional `::' operator. */
7056 global_scope_p
7060 /* Look for the `delete' keyword. */
7062 /* See if the array syntax is in use. */
7064 {
7065 /* Consume the `[' token. */
7067 /* Look for the `]' token. */
7069 /* Remember that this is the `[]' construct. */
7071 }
7072 else
7075 /* Parse the cast-expression. */
7078 /* A delete-expression may not appear in an integral constant
7079 expression. */
7084 tf_warning_or_error);
7085 }
7087 /* Returns true if TOKEN may start a cast-expression and false
7088 otherwise. */
7090 static bool
7092 {
7094 {
7133 /* '[' may start a primary-expression in obj-c++. */
7139 }
7140 }
7142 /* Parse a cast-expression.
7144 cast-expression:
7145 unary-expression
7146 ( type-id ) cast-expression
7148 ADDRESS_P is true iff the unary-expression is appearing as the
7149 operand of the `&' operator. CAST_P is true if this expression is
7150 the target of a cast.
7152 Returns a representation of the expression. */
7154 static tree
7157 {
7158 /* If it's a `(', then we might be looking at a cast. */
7160 {
7166 /* There's no way to know yet whether or not this is a cast.
7167 For example, `(int (3))' is a unary-expression, while `(int)
7168 3' is a cast. So, we resort to parsing tentatively. */
7170 /* Types may not be defined in a cast. */
7172 parser->type_definition_forbidden_message
7174 /* Consume the `('. */
7176 /* A very tricky bit is that `(struct S) { 3 }' is a
7177 compound-literal (which we permit in C++ as an extension).
7178 But, that construct is not a cast-expression -- it is a
7179 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7180 is legal; if the compound-literal were a cast-expression,
7181 you'd need an extra set of parentheses.) But, if we parse
7182 the type-id, and it happens to be a class-specifier, then we
7183 will commit to the parse at that point, because we cannot
7184 undo the action that is done when creating a new class. So,
7185 then we cannot back up and do a postfix-expression.
7187 Therefore, we scan ahead to the closing `)', and check to see
7188 if the token after the `)' is a `{'. If so, we are not
7189 looking at a cast-expression.
7191 Save tokens so that we can put them back. */
7193 /* Skip tokens until the next token is a closing parenthesis.
7194 If we find the closing `)', and the next token is a `{', then
7195 we are looking at a compound-literal. */
7196 compound_literal_p
7200 /* Roll back the tokens we skipped. */
7202 /* If we were looking at a compound-literal, simulate an error
7203 so that the call to cp_parser_parse_definitely below will
7204 fail. */
7207 else
7208 {
7211 /* Look for the type-id. */
7213 /* Look for the closing `)'. */
7216 }
7218 /* Restore the saved message. */
7221 /* At this point this can only be either a cast or a
7222 parenthesized ctor such as `(T ())' that looks like a cast to
7223 function returning T. */
7227 {
7233 /* Warn about old-style casts, if so requested. */
7235 && !in_system_header
7240 /* Only type conversions to integral or enumeration types
7241 can be used in constant-expressions. */
7244 NIC_CAST))
7247 /* Perform the cast. */
7250 }
7251 else
7253 }
7255 /* If we get here, then it's not a cast, so it must be a
7256 unary-expression. */
7258 }
7260 /* Parse a binary expression of the general form:
7262 pm-expression:
7263 cast-expression
7264 pm-expression .* cast-expression
7265 pm-expression ->* cast-expression
7267 multiplicative-expression:
7268 pm-expression
7269 multiplicative-expression * pm-expression
7270 multiplicative-expression / pm-expression
7271 multiplicative-expression % pm-expression
7273 additive-expression:
7274 multiplicative-expression
7275 additive-expression + multiplicative-expression
7276 additive-expression - multiplicative-expression
7278 shift-expression:
7279 additive-expression
7280 shift-expression << additive-expression
7281 shift-expression >> additive-expression
7283 relational-expression:
7284 shift-expression
7285 relational-expression < shift-expression
7286 relational-expression > shift-expression
7287 relational-expression <= shift-expression
7288 relational-expression >= shift-expression
7290 GNU Extension:
7292 relational-expression:
7293 relational-expression <? shift-expression
7294 relational-expression >? shift-expression
7296 equality-expression:
7297 relational-expression
7298 equality-expression == relational-expression
7299 equality-expression != relational-expression
7301 and-expression:
7302 equality-expression
7303 and-expression & equality-expression
7305 exclusive-or-expression:
7306 and-expression
7307 exclusive-or-expression ^ and-expression
7309 inclusive-or-expression:
7310 exclusive-or-expression
7311 inclusive-or-expression | exclusive-or-expression
7313 logical-and-expression:
7314 inclusive-or-expression
7315 logical-and-expression && inclusive-or-expression
7317 logical-or-expression:
7318 logical-and-expression
7319 logical-or-expression || logical-and-expression
7321 All these are implemented with a single function like:
7323 binary-expression:
7324 simple-cast-expression
7325 binary-expression <token> binary-expression
7327 CAST_P is true if this expression is the target of a cast.
7329 The binops_by_token map is used to get the tree codes for each <token> type.
7330 binary-expressions are associated according to a precedence table. */
7332 #define TOKEN_PRECEDENCE(token) \
7333 (((token->type == CPP_GREATER \
7334 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7335 && !parser->greater_than_is_operator_p) \
7336 ? PREC_NOT_OPERATOR \
7337 : binops_by_token[token->type].prec)
7339 static tree
7344 {
7345 cp_parser_expression_stack stack;
7347 cp_parser_expression_stack_entry current;
7348 tree rhs;
7352 tree overload;
7354 /* Parse the first expression. */
7364 {
7365 /* Get an operator token. */
7371 {
7373 "%<>>%> operator is treated"
7377 }
7381 /* Popping an entry off the stack means we completed a subexpression:
7382 - either we found a token which is not an operator (`>' where it is not
7383 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7384 will happen repeatedly;
7385 - or, we found an operator which has lower priority. This is the case
7386 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7387 parsing `3 * 4'. */
7389 {
7392 else
7394 }
7396 get_rhs:
7400 /* We used the operator token. */
7403 /* For "false && x" or "true || x", x will never be executed;
7404 disable warnings while evaluating it. */
7410 /* Extract another operand. It may be the RHS of this expression
7411 or the LHS of a new, higher priority expression. */
7415 /* Get another operator token. Look up its precedence to avoid
7416 building a useless (immediately popped) stack entry for common
7417 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7421 {
7422 /* ... and prepare to parse the RHS of the new, higher priority
7423 expression. Since precedence levels on the stack are
7424 monotonically increasing, we do not have to care about
7425 stack overflows. */
7434 pop:
7436 /* If the stack is not empty, we have parsed into LHS the right side
7437 (`4' in the example above) of an expression we had suspended.
7438 We can use the information on the stack to recover the LHS (`3')
7439 from the stack together with the tree code (`MULT_EXPR'), and
7440 the precedence of the higher level subexpression
7441 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7442 which will be used to actually build the additive expression. */
7447 }
7449 /* Undo the disabling of warnings done above. */
7456 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7457 ERROR_MARK for everything that is not a binary expression.
7458 This makes warn_about_parentheses miss some warnings that
7459 involve unary operators. For unary expressions we should
7460 pass the correct tree_code unless the unary expression was
7461 surrounded by parentheses.
7462 */
7469 else
7473 tf_warning_or_error);
7476 /* If the binary operator required the use of an overloaded operator,
7477 then this expression cannot be an integral constant-expression.
7478 An overloaded operator can be used even if both operands are
7479 otherwise permissible in an integral constant-expression if at
7480 least one of the operands is of enumeration type. */
7484 NIC_OVERLOADED))
7486 }
7489 }
7492 /* Parse the `? expression : assignment-expression' part of a
7493 conditional-expression. The LOGICAL_OR_EXPR is the
7494 logical-or-expression that started the conditional-expression.
7495 Returns a representation of the entire conditional-expression.
7497 This routine is used by cp_parser_assignment_expression.
7499 ? expression : assignment-expression
7501 GNU Extensions:
7503 ? : assignment-expression */
7505 static tree
7507 {
7508 tree expr;
7509 tree assignment_expr;
7513 /* Consume the `?' token. */
7518 {
7521 /* Implicit true clause. */
7525 }
7526 else
7527 {
7530 /* Parse the expression. */
7533 c_inhibit_evaluation_warnings +=
7537 }
7539 /* The next token should be a `:'. */
7541 /* Parse the assignment-expression. */
7545 /* Build the conditional-expression. */
7547 expr,
7548 assignment_expr,
7549 tf_warning_or_error);
7550 }
7552 /* Parse an assignment-expression.
7554 assignment-expression:
7555 conditional-expression
7556 logical-or-expression assignment-operator assignment_expression
7557 throw-expression
7559 CAST_P is true if this expression is the target of a cast.
7561 Returns a representation for the expression. */
7563 static tree
7566 {
7567 tree expr;
7569 /* If the next token is the `throw' keyword, then we're looking at
7570 a throw-expression. */
7573 /* Otherwise, it must be that we are looking at a
7574 logical-or-expression. */
7575 else
7576 {
7577 /* Parse the binary expressions (logical-or-expression). */
7580 /* If the next token is a `?' then we're actually looking at a
7581 conditional-expression. */
7584 else
7585 {
7588 /* If it's an assignment-operator, we're using the second
7589 production. */
7590 enum tree_code assignment_operator
7593 {
7595 location_t saved_input_location;
7597 /* Parse the right-hand side of the assignment. */
7603 /* An assignment may not appear in a
7604 constant-expression. */
7606 NIC_ASSIGNMENT))
7608 /* Build the assignment expression. Its default
7609 location is the location of the '=' token. */
7613 assignment_operator,
7614 rhs,
7615 tf_warning_or_error);
7617 }
7618 }
7619 }
7622 }
7624 /* Parse an (optional) assignment-operator.
7626 assignment-operator: one of
7627 = *= /= %= += -= >>= <<= &= ^= |=
7629 GNU Extension:
7631 assignment-operator: one of
7632 <?= >?=
7634 If the next token is an assignment operator, the corresponding tree
7635 code is returned, and the token is consumed. For example, for
7636 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
7637 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
7638 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
7639 operator, ERROR_MARK is returned. */
7641 static enum tree_code
7643 {
7647 /* Peek at the next token. */
7651 {
7697 /* Nothing else is an assignment operator. */
7699 }
7701 /* If it was an assignment operator, consume it. */
7706 }
7708 /* Parse an expression.
7710 expression:
7711 assignment-expression
7712 expression , assignment-expression
7714 CAST_P is true if this expression is the target of a cast.
7716 Returns a representation of the expression. */
7718 static tree
7720 {
7725 {
7726 tree assignment_expression;
7728 /* Parse the next assignment-expression. */
7729 assignment_expression
7731 /* If this is the first assignment-expression, we can just
7732 save it away. */
7735 else
7737 assignment_expression,
7738 tf_warning_or_error);
7739 /* If the next token is not a comma, then we are done with the
7740 expression. */
7743 /* Consume the `,'. */
7746 /* A comma operator cannot appear in a constant-expression. */
7749 }
7752 }
7754 /* Parse a constant-expression.
7756 constant-expression:
7757 conditional-expression
7759 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
7760 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
7761 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
7762 is false, NON_CONSTANT_P should be NULL. */
7764 static tree
7768 {
7772 tree expression;
7774 /* It might seem that we could simply parse the
7775 conditional-expression, and then check to see if it were
7776 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
7777 one that the compiler can figure out is constant, possibly after
7778 doing some simplifications or optimizations. The standard has a
7779 precise definition of constant-expression, and we must honor
7780 that, even though it is somewhat more restrictive.
7782 For example:
7784 int i[(2, 3)];
7786 is not a legal declaration, because `(2, 3)' is not a
7787 constant-expression. The `,' operator is forbidden in a
7788 constant-expression. However, GCC's constant-folding machinery
7789 will fold this operation to an INTEGER_CST for `3'. */
7791 /* Save the old settings. */
7793 saved_allow_non_integral_constant_expression_p
7796 /* We are now parsing a constant-expression. */
7798 parser->allow_non_integral_constant_expression_p
7801 /* Although the grammar says "conditional-expression", we parse an
7802 "assignment-expression", which also permits "throw-expression"
7803 and the use of assignment operators. In the case that
7804 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
7805 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
7806 actually essential that we look for an assignment-expression.
7807 For example, cp_parser_initializer_clauses uses this function to
7808 determine whether a particular assignment-expression is in fact
7809 constant. */
7811 /* Restore the old settings. */
7812 parser->integral_constant_expression_p
7814 parser->allow_non_integral_constant_expression_p
7817 {
7818 /* Require an rvalue constant expression here; that's what our
7819 callers expect. Reference constant expressions are handled
7820 separately in e.g. cp_parser_template_argument. */
7825 }
7828 parser->non_integral_constant_expression_p
7832 }
7834 /* Parse __builtin_offsetof.
7836 offsetof-expression:
7837 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
7839 offsetof-member-designator:
7840 id-expression
7841 | offsetof-member-designator "." id-expression
7842 | offsetof-member-designator "[" expression "]"
7843 | offsetof-member-designator "->" id-expression */
7845 static tree
7847 {
7850 cp_id_kind dummy;
7853 /* We're about to accept non-integral-constant things, but will
7854 definitely yield an integral constant expression. Save and
7855 restore these values around our local parsing. */
7859 /* Consume the "__builtin_offsetof" token. */
7861 /* Consume the opening `('. */
7863 /* Parse the type-id. */
7865 /* Look for the `,'. */
7869 /* Build the (type *)null that begins the traditional offsetof macro. */
7871 tf_warning_or_error);
7873 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
7877 {
7880 {
7882 /* offsetof-member-designator "[" expression "]" */
7887 /* offsetof-member-designator "->" identifier */
7889 /* FALLTHRU */
7892 /* offsetof-member-designator "." identifier */
7900 /* Consume the ")" token. */
7905 /* Error. We know the following require will fail, but
7906 that gives the proper error message. */
7911 }
7912 }
7914 success:
7915 /* If we're processing a template, we can't finish the semantics yet.
7916 Otherwise we can fold the entire expression now. */
7919 else
7922 failure:
7927 }
7929 /* Parse a trait expression.
7931 Returns a representation of the expression, the underlying type
7932 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
7934 static tree
7936 {
7937 cp_trait_kind kind;
7940 cp_decl_specifier_seq decl_specs;
7943 {
8020 }
8022 /* Consume the token. */
8032 /* Build a trivial decl-specifier-seq. */
8036 /* Call grokdeclarator to figure out what type this is. */
8041 {
8049 /* Build a trivial decl-specifier-seq. */
8053 /* Call grokdeclarator to figure out what type this is. */
8056 }
8060 /* Complete the trait expression, which may mean either processing
8061 the trait expr now or saving it for template instantiation. */
8063 {
8072 }
8073 }
8075 /* Lambdas that appear in variable initializer or default argument scope
8076 get that in their mangling, so we need to record it. We might as well
8077 use the count for function and namespace scopes as well. */
8081 {
8082 tree t;
8089 static void
8091 {
8092 tree_int ti;
8094 /* Once we're inside a function, we ignore other scopes and just push
8095 the function again so that popping works properly. */
8102 {
8103 /* Don't reset the count if we're still in the same function. */
8106 }
8107 }
8109 static void
8111 {
8114 }
8116 static void
8118 {
8121 {
8124 }
8126 }
8128 /* Parse a lambda expression.
8130 lambda-expression:
8131 lambda-introducer lambda-declarator [opt] compound-statement
8133 Returns a representation of the expression. */
8135 static tree
8137 {
8139 tree type;
8149 /* We may be in the middle of deferred access check. Disable
8150 it now. */
8161 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8164 /* Now that we've started the type, add the capture fields for any
8165 explicit captures. */
8168 {
8169 /* Inside the class, surrounding template-parameter-lists do not apply. */
8170 unsigned int saved_num_template_parameter_lists
8179 /* By virtue of defining a local class, a lambda expression has access to
8180 the private variables of enclosing classes. */
8189 /* The capture list was built up in reverse order; fix that now. */
8190 {
8196 {
8200 }
8202 }
8212 }
8216 /* This field is only used during parsing of the lambda. */
8219 /* This lambda shouldn't have any proxies left at this point. */
8221 /* And now that we're done, push proxies for an enclosing lambda. */
8226 else
8228 }
8230 /* Parse the beginning of a lambda expression.
8232 lambda-introducer:
8233 [ lambda-capture [opt] ]
8235 LAMBDA_EXPR is the current representation of the lambda expression. */
8237 static void
8239 {
8240 /* Need commas after the first capture. */
8243 /* Eat the leading `['. */
8246 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8254 {
8257 }
8260 {
8262 tree capture_id;
8263 tree capture_init_expr;
8267 enum capture_kind_type
8268 {
8269 BY_COPY,
8270 BY_REFERENCE
8271 };
8275 {
8278 }
8282 else
8285 /* Possibly capture `this'. */
8287 {
8297 explicit_init_p);
8299 }
8301 /* Remember whether we want to capture as a reference or not. */
8303 {
8306 }
8308 /* Get the identifier. */
8313 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8314 delimiters, but I modified this to stop on unnested ']' as well. It
8315 was already changed to stop on unnested '}', so the
8316 "closing_parenthesis" name is no more misleading with my change. */
8317 {
8323 }
8325 /* Find the initializer for this capture. */
8327 {
8328 /* An explicit expression exists. */
8331 "ISO C++ does not allow initializers "
8337 }
8338 else
8339 {
8342 /* Turn the identifier into an id-expression. */
8343 capture_init_expr
8344 = cp_parser_lookup_name
8346 capture_id,
8347 none_type,
8355 {
8358 }
8362 {
8365 capture_init_expr);
8368 }
8371 {
8374 capture_init_expr);
8377 }
8379 capture_init_expr
8380 = finish_id_expression
8382 capture_init_expr,
8394 }
8398 {
8403 capture_id);
8407 "capture of %qD redundant with by-reference capture "
8409 }
8412 capture_id,
8413 capture_init_expr,
8415 explicit_init_p);
8416 }
8419 }
8421 /* Parse the (optional) middle of a lambda expression.
8423 lambda-declarator:
8424 ( parameter-declaration-clause [opt] )
8425 attribute-specifier [opt]
8426 mutable [opt]
8427 exception-specification [opt]
8428 lambda-return-type-clause [opt]
8430 LAMBDA_EXPR is the current representation of the lambda expression. */
8432 static bool
8434 {
8435 /* 5.1.1.4 of the standard says:
8436 If a lambda-expression does not include a lambda-declarator, it is as if
8437 the lambda-declarator were ().
8438 This means an empty parameter list, no attributes, and no exception
8439 specification. */
8443 tree t;
8445 /* The lambda-declarator is optional, but must begin with an opening
8446 parenthesis if present. */
8448 {
8453 /* Parse parameters. */
8456 /* Default arguments shall not be specified in the
8457 parameter-declaration-clause of a lambda-declarator. */
8467 /* Parse optional `mutable' keyword. */
8469 {
8472 }
8474 /* Parse optional exception specification. */
8477 /* Parse optional trailing return type. */
8479 {
8482 }
8484 /* The function parameters must be in scope all the way until after the
8485 trailing-return-type in case of decltype. */
8490 }
8492 /* Create the function call operator.
8494 Messing with declarators like this is no uglier than building up the
8495 FUNCTION_DECL by hand, and this is less likely to get out of sync with
8496 other code. */
8497 {
8498 cp_decl_specifier_seq return_type_specs;
8500 tree fco;
8507 else
8508 /* Maybe we will deduce the return type later. */
8514 sfk_none);
8519 VIRT_SPEC_UNSPECIFIED,
8520 exception_spec,
8525 declarator,
8526 attributes);
8528 {
8531 /* Give the object parameter a different name. */
8533 }
8540 }
8541 }
8543 /* Parse the body of a lambda expression, which is simply
8545 compound-statement
8547 but which requires special handling.
8548 LAMBDA_EXPR is the current representation of the lambda expression. */
8550 static void
8552 {
8557 else
8558 /* Still increment function_depth so that we don't GC in the
8559 middle of an expression. */
8561 /* Clear this in case we're in the middle of a default argument. */
8564 /* Finish the function call operator
8565 - class_specifier
8566 + late_parsing_for_member
8567 + function_definition_after_declarator
8568 + ctor_initializer_opt_and_function_body */
8569 {
8571 tree body;
8573 tree compound_stmt;
8574 tree cap;
8576 /* Let the front end know that we are going to be defining this
8577 function. */
8579 NULL_TREE,
8588 /* Push the proxies for any explicit captures. */
8595 /* 5.1.1.4 of the standard says:
8596 If a lambda-expression does not include a trailing-return-type, it
8597 is as if the trailing-return-type denotes the following type:
8598 * if the compound-statement is of the form
8599 { return attribute-specifier [opt] expression ; }
8600 the type of the returned expression after lvalue-to-rvalue
8601 conversion (_conv.lval_ 4.1), array-to-pointer conversion
8602 (_conv.array_ 4.2), and function-to-pointer conversion
8603 (_conv.func_ 4.3);
8604 * otherwise, void. */
8606 /* In a lambda that has neither a lambda-return-type-clause
8607 nor a deducible form, errors should be reported for return statements
8608 in the body. Since we used void as the placeholder return type, parsing
8609 the body as usual will give such desired behavior. */
8613 {
8617 /* Parse tentatively in case there's more after the initial return
8618 statement. */
8629 {
8633 /* Will get error here if type not deduced yet. */
8637 }
8638 }
8641 {
8646 }
8650 out:
8654 /* Finish the function and generate code for it if necessary. */
8656 }
8661 else
8663 }
8665 /* Statements [gram.stmt.stmt] */
8667 /* Parse a statement.
8669 statement:
8670 labeled-statement
8671 expression-statement
8672 compound-statement
8673 selection-statement
8674 iteration-statement
8675 jump-statement
8676 declaration-statement
8677 try-block
8679 C++11:
8681 statement:
8682 labeled-statement
8683 attribute-specifier-seq (opt) expression-statement
8684 attribute-specifier-seq (opt) compound-statement
8685 attribute-specifier-seq (opt) selection-statement
8686 attribute-specifier-seq (opt) iteration-statement
8687 attribute-specifier-seq (opt) jump-statement
8688 declaration-statement
8689 attribute-specifier-seq (opt) try-block
8691 TM Extension:
8693 statement:
8694 atomic-statement
8696 IN_COMPOUND is true when the statement is nested inside a
8697 cp_parser_compound_statement; this matters for certain pragmas.
8699 If IF_P is not NULL, *IF_P is set to indicate whether the statement
8700 is a (possibly labeled) if statement which is not enclosed in braces
8701 and has an else clause. This is used to implement -Wparentheses. */
8703 static void
8706 {
8711 restart:
8714 /* There is no statement yet. */
8721 /* Peek at the next token. */
8723 /* Remember the location of the first token in the statement. */
8725 /* If this is a keyword, then that will often determine what kind of
8726 statement we have. */
8728 {
8732 {
8735 /* Looks like a labeled-statement with a case label.
8736 Parse the label, and then use tail recursion to parse
8737 the statement. */
8759 /* Objective-C++ exception-handling constructs. */
8773 /* This must be a namespace alias definition. */
8786 /* It might be a keyword like `int' that can start a
8787 declaration-statement. */
8789 }
8790 }
8792 {
8793 /* If the next token is a `:', then we are looking at a
8794 labeled-statement. */
8797 {
8798 /* Looks like a labeled-statement with an ordinary label.
8799 Parse the label, and then use tail recursion to parse
8800 the statement. */
8804 }
8805 }
8806 /* Anything that starts with a `{' must be a compound-statement. */
8809 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
8810 a statement all its own. */
8812 {
8813 /* Only certain OpenMP pragmas are attached to statements, and thus
8814 are considered statements themselves. All others are not. In
8815 the context of a compound, accept the pragma as a "statement" and
8816 return so that we can check for a close brace. Otherwise we
8817 require a real statement and must go back and read one. */
8823 }
8825 {
8828 }
8830 /* Everything else must be a declaration-statement or an
8831 expression-statement. Try for the declaration-statement
8832 first, unless we are looking at a `;', in which case we know that
8833 we have an expression-statement. */
8835 {
8837 {
8839 {
8840 /* Attributes should be parsed as part of the the
8841 declaration, so let's un-parse them. */
8844 }
8847 /* Try to parse the declaration-statement. */
8849 /* If that worked, we're done. */
8852 }
8853 /* Look for an expression-statement instead. */
8855 }
8857 /* Set the line number for the statement. */
8861 /* Note that for now, we don't do anything with c++11 statements
8862 parsed at this level. */
8865 OPT_Wattributes,
8867 }
8869 /* Parse the label for a labeled-statement, i.e.
8871 identifier :
8872 case constant-expression :
8873 default :
8875 GNU Extension:
8876 case constant-expression ... constant-expression : statement
8878 When a label is parsed without errors, the label is added to the
8879 parse tree by the finish_* functions, so this function doesn't
8880 have to return the label. */
8882 static void
8884 {
8889 /* The next token should be an identifier. */
8893 {
8896 }
8900 {
8902 {
8906 /* Consume the `case' token. */
8908 /* Parse the constant-expression. */
8911 NULL);
8915 {
8916 /* Consume the `...' token. */
8918 expr_hi =
8921 NULL);
8922 /* We don't need to emit warnings here, as the common code
8923 will do this for us. */
8924 }
8925 else
8930 else
8933 expr);
8934 }
8938 /* Consume the `default' token. */
8943 else
8948 /* Anything else must be an ordinary label. */
8951 }
8953 /* Require the `:' token. */
8956 /* An ordinary label may optionally be followed by attributes.
8957 However, this is only permitted if the attributes are then
8958 followed by a semicolon. This is because, for backward
8959 compatibility, when parsing
8960 lab: __attribute__ ((unused)) int i;
8961 we want the attribute to attach to "i", not "lab". */
8964 {
8965 tree attrs;
8972 ;
8973 else
8975 }
8981 }
8983 /* Parse an expression-statement.
8985 expression-statement:
8986 expression [opt] ;
8988 Returns the new EXPR_STMT -- or NULL_TREE if the expression
8989 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
8990 indicates whether this expression-statement is part of an
8991 expression statement. */
8993 static tree
8995 {
8999 /* If the next token is a ';', then there is no expression
9000 statement. */
9004 /* Give a helpful message for "A<T>::type t;" and the like. */
9007 {
9014 {
9015 /* A::A a; */
9020 }
9021 }
9023 /* Consume the final `;'. */
9028 /* This is the final expression statement of a statement
9029 expression. */
9033 else
9037 }
9039 /* Parse a compound-statement.
9041 compound-statement:
9042 { statement-seq [opt] }
9044 GNU extension:
9046 compound-statement:
9047 { label-declaration-seq [opt] statement-seq [opt] }
9049 label-declaration-seq:
9050 label-declaration
9051 label-declaration-seq label-declaration
9053 Returns a tree representing the statement. */
9055 static tree
9058 {
9059 tree compound_stmt;
9061 /* Consume the `{'. */
9068 /* Begin the compound-statement. */
9070 /* If the next keyword is `__label__' we have a label declaration. */
9073 /* Parse an (optional) statement-seq. */
9075 /* Finish the compound-statement. */
9077 /* Consume the `}'. */
9081 }
9083 /* Parse an (optional) statement-seq.
9085 statement-seq:
9086 statement
9087 statement-seq [opt] statement */
9089 static void
9091 {
9092 /* Scan statements until there aren't any more. */
9094 {
9097 /* If we are looking at a `}', then we have run out of
9098 statements; the same is true if we have reached the end
9099 of file, or have stumbled upon a stray '@end'. */
9106 /* If we are in a compound statement and find 'else' then
9107 something went wrong. */
9109 {
9112 else
9113 {
9116 }
9117 }
9119 /* Parse the statement. */
9121 }
9122 }
9124 /* Parse a selection-statement.
9126 selection-statement:
9127 if ( condition ) statement
9128 if ( condition ) statement else statement
9129 switch ( condition ) statement
9131 Returns the new IF_STMT or SWITCH_STMT.
9133 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9134 is a (possibly labeled) if statement which is not enclosed in
9135 braces and has an else clause. This is used to implement
9136 -Wparentheses. */
9138 static tree
9140 {
9147 /* Peek at the next token. */
9150 /* See what kind of keyword it is. */
9153 {
9156 {
9157 tree statement;
9158 tree condition;
9160 /* Look for the `('. */
9162 {
9165 }
9167 /* Begin the selection-statement. */
9170 else
9173 /* Parse the condition. */
9175 /* Look for the `)'. */
9181 {
9185 /* Add the condition. */
9188 /* Parse the then-clause. */
9192 {
9200 }
9201 else
9207 /* If the next token is `else', parse the else-clause. */
9209 RID_ELSE))
9210 {
9211 /* Consume the `else' keyword. */
9214 /* Parse the else-clause. */
9216 {
9217 location_t loc;
9224 }
9225 else
9230 /* If we are currently parsing a then-clause, then
9231 IF_P will not be NULL. We set it to true to
9232 indicate that this if statement has an else clause.
9233 This may trigger the Wparentheses warning below
9234 when we get back up to the parent if statement. */
9237 }
9238 else
9239 {
9240 /* This if statement does not have an else clause. If
9241 NESTED_IF is true, then the then-clause is an if
9242 statement which does have an else clause. We warn
9243 about the potential ambiguity. */
9246 "suggest explicit braces to avoid ambiguous"
9248 }
9250 /* Now we're all done with the if-statement. */
9252 }
9253 else
9254 {
9258 /* Add the condition. */
9261 /* Parse the body of the switch-statement. */
9270 /* Now we're all done with the switch-statement. */
9272 }
9275 }
9281 }
9282 }
9284 /* Parse a condition.
9286 condition:
9287 expression
9288 type-specifier-seq declarator = initializer-clause
9289 type-specifier-seq declarator braced-init-list
9291 GNU Extension:
9293 condition:
9294 type-specifier-seq declarator asm-specification [opt]
9295 attributes [opt] = assignment-expression
9297 Returns the expression that should be tested. */
9299 static tree
9301 {
9302 cp_decl_specifier_seq type_specifiers;
9306 /* Try the declaration first. */
9308 /* New types are not allowed in the type-specifier-seq for a
9309 condition. */
9311 parser->type_definition_forbidden_message
9313 /* Parse the type-specifier-seq. */
9315 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9318 /* Restore the saved message. */
9320 /* If all is well, we might be looking at a declaration. */
9322 {
9323 tree decl;
9324 tree asm_specification;
9325 tree attributes;
9329 /* Parse the declarator. */
9334 /* Parse the attributes. */
9336 /* Parse the asm-specification. */
9338 /* If the next token is not an `=' or '{', then we might still be
9339 looking at an expression. For example:
9341 if (A(a).x)
9343 looks like a decl-specifier-seq and a declarator -- but then
9344 there is no `=', so this is an expression. */
9349 /* If we did see an `=' or '{', then we are looking at a declaration
9350 for sure. */
9352 {
9353 tree pushed_scope;
9357 /* Create the declaration. */
9363 /* Parse the initializer. */
9365 {
9369 }
9370 else
9371 {
9372 /* Consume the `='. */
9375 }
9379 /* Process the initializer. */
9382 asm_specification,
9383 flags);
9389 }
9390 }
9391 /* If we didn't even get past the declarator successfully, we are
9392 definitely not looking at a declaration. */
9393 else
9396 /* Otherwise, we are looking at an expression. */
9398 }
9400 /* Parses a for-statement or range-for-statement until the closing ')',
9401 not included. */
9403 static tree
9405 {
9409 /* Begin the for-statement. */
9412 /* Parse the initialization. */
9417 else
9419 }
9421 static tree
9423 {
9424 /* Normal for loop */
9427 tree stmt;
9430 /* The for-init-statement has already been parsed in
9431 cp_parser_for_init_statement, so no work is needed here. */
9434 /* If there's a condition, process it. */
9438 /* Look for the `;'. */
9441 /* If there's an expression, process it. */
9447 }
9449 /* Tries to parse a range-based for-statement:
9451 range-based-for:
9452 decl-specifier-seq declarator : expression
9454 The decl-specifier-seq declarator and the `:' are already parsed by
9455 cp_parser_for_init_statement. If processing_template_decl it returns a
9456 newly created RANGE_FOR_STMT; if not, it is converted to a
9457 regular FOR_STMT. */
9459 static tree
9461 {
9465 {
9468 }
9469 else
9472 /* If in template, STMT is converted to a normal for-statement
9473 at instantiation. If not, it is done just ahead. */
9475 {
9481 /* do_auto_deduction doesn't mess with template init-lists. */
9484 }
9485 else
9486 {
9489 }
9491 }
9493 /* Subroutine of cp_convert_range_for: given the initializer expression,
9494 builds up the range temporary. */
9496 static tree
9498 {
9501 /* Find out the type deduced by the declaration
9502 `auto &&__range = range_expr'. */
9507 /* Create the __range variable. */
9514 }
9516 /* Used by cp_parser_range_for in template context: we aren't going to
9517 do a full conversion yet, but we still need to resolve auto in the
9518 type of the for-range-declaration if present. This is basically
9519 a shortcut version of cp_convert_range_for. */
9521 static void
9523 {
9526 {
9529 iter_type = (cp_parser_perform_range_for_lookup
9533 tf_warning_or_error);
9536 }
9537 }
9539 /* Converts a range-based for-statement into a normal
9540 for-statement, as per the definition.
9542 for (RANGE_DECL : RANGE_EXPR)
9543 BLOCK
9545 should be equivalent to:
9547 {
9548 auto &&__range = RANGE_EXPR;
9549 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
9550 __begin != __end;
9551 ++__begin)
9552 {
9553 RANGE_DECL = *__begin;
9554 BLOCK
9555 }
9556 }
9558 If RANGE_EXPR is an array:
9559 BEGIN_EXPR = __range
9560 END_EXPR = __range + ARRAY_SIZE(__range)
9561 Else if RANGE_EXPR has a member 'begin' or 'end':
9562 BEGIN_EXPR = __range.begin()
9563 END_EXPR = __range.end()
9564 Else:
9565 BEGIN_EXPR = begin(__range)
9566 END_EXPR = end(__range);
9568 If __range has a member 'begin' but not 'end', or vice versa, we must
9569 still use the second alternative (it will surely fail, however).
9570 When calling begin()/end() in the third alternative we must use
9571 argument dependent lookup, but always considering 'std' as an associated
9572 namespace. */
9574 tree
9576 {
9582 /* If an error happened previously do nothing or else a lot of
9583 unhelpful errors would be issued. */
9585 else
9586 {
9591 LOOKUP_ONLYCONVERTING);
9596 }
9598 /* The new for initialization statement. */
9606 LOOKUP_ONLYCONVERTING);
9615 LOOKUP_ONLYCONVERTING);
9619 /* The new for condition. */
9626 /* The new increment expression. */
9631 /* The declaration is initialized with *__begin inside the loop body. */
9634 tf_warning_or_error),
9636 LOOKUP_ONLYCONVERTING);
9639 }
9641 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
9642 We need to solve both at the same time because the method used
9643 depends on the existence of members begin or end.
9644 Returns the type deduced for the iterator expression. */
9646 static tree
9648 {
9650 {
9653 }
9656 {
9661 }
9663 {
9664 /* If RANGE is an array, we will use pointer arithmetic. */
9667 range,
9671 }
9672 else
9673 {
9674 /* If it is not an array, we must do a bit of magic. */
9684 tf_warning_or_error);
9687 tf_warning_or_error);
9690 {
9691 /* Use the member functions. */
9694 else
9700 else
9703 }
9704 else
9705 {
9706 /* Use global functions with ADL. */
9714 tf_warning_or_error);
9716 tf_warning_or_error);
9719 tf_warning_or_error);
9721 tf_warning_or_error);
9724 }
9726 /* Last common checks. */
9728 {
9729 /* If one of the expressions is an error do no more checks. */
9732 }
9733 else
9734 {
9736 /* The unqualified type of the __begin and __end temporaries should
9737 be the same, as required by the multiple auto declaration. */
9743 }
9744 }
9745 }
9747 /* Helper function for cp_parser_perform_range_for_lookup.
9748 Builds a tree for RANGE.IDENTIFIER(). */
9750 static tree
9752 {
9765 tf_warning_or_error);
9768 }
9770 /* Parse an iteration-statement.
9772 iteration-statement:
9773 while ( condition ) statement
9774 do statement while ( expression ) ;
9775 for ( for-init-statement condition [opt] ; expression [opt] )
9776 statement
9778 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
9780 static tree
9782 {
9785 tree statement;
9788 /* Peek at the next token. */
9793 /* Remember whether or not we are already within an iteration
9794 statement. */
9797 /* See what kind of keyword it is. */
9800 {
9802 {
9803 tree condition;
9805 /* Begin the while-statement. */
9807 /* Look for the `('. */
9809 /* Parse the condition. */
9812 /* Look for the `)'. */
9814 /* Parse the dependent statement. */
9818 /* We're done with the while-statement. */
9820 }
9824 {
9825 tree expression;
9827 /* Begin the do-statement. */
9829 /* Parse the body of the do-statement. */
9834 /* Look for the `while' keyword. */
9836 /* Look for the `('. */
9838 /* Parse the expression. */
9840 /* We're done with the do-statement. */
9842 /* Look for the `)'. */
9844 /* Look for the `;'. */
9846 }
9850 {
9851 /* Look for the `('. */
9856 /* Look for the `)'. */
9859 /* Parse the body of the for-statement. */
9864 /* We're done with the for-statement. */
9866 }
9873 }
9876 }
9878 /* Parse a for-init-statement or the declarator of a range-based-for.
9879 Returns true if a range-based-for declaration is seen.
9881 for-init-statement:
9882 expression-statement
9883 simple-declaration */
9885 static bool
9887 {
9888 /* If the next token is a `;', then we have an empty
9889 expression-statement. Grammatically, this is also a
9890 simple-declaration, but an invalid one, because it does not
9891 declare anything. Therefore, if we did not handle this case
9892 specially, we would issue an error message about an invalid
9893 declaration. */
9895 {
9901 /* We're going to speculatively look for a declaration, falling back
9902 to an expression, if necessary. */
9904 /* Parse the declaration. */
9907 decl);
9910 {
9911 /* It is a range-for, consume the ':' */
9915 {
9917 "range-based %<for%> loops are not allowed "
9920 }
9921 }
9922 else
9923 /* The ';' is not consumed yet because we told
9924 cp_parser_simple_declaration not to. */
9929 /* If the tentative parse failed, then we shall need to look for an
9930 expression-statement. */
9931 }
9932 /* If we are here, it is an expression-statement. */
9935 }
9937 /* Parse a jump-statement.
9939 jump-statement:
9940 break ;
9941 continue ;
9942 return expression [opt] ;
9943 return braced-init-list ;
9944 goto identifier ;
9946 GNU extension:
9948 jump-statement:
9949 goto * expression ;
9951 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
9953 static tree
9955 {
9961 /* Peek at the next token. */
9966 /* See what kind of keyword it is. */
9969 {
9973 {
9988 }
9994 {
10007 }
10012 {
10013 tree expr;
10017 {
10020 }
10023 else
10024 /* If the next token is a `;', then there is no
10025 expression. */
10027 /* Build the return-statement. */
10029 /* Look for the final `;'. */
10031 }
10035 /* Create the goto-statement. */
10037 {
10038 /* Issue a warning about this use of a GNU extension. */
10040 /* Consume the '*' token. */
10042 /* Parse the dependent expression. */
10044 }
10045 else
10047 /* Look for the final `;'. */
10054 }
10057 }
10059 /* Parse a declaration-statement.
10061 declaration-statement:
10062 block-declaration */
10064 static void
10066 {
10069 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10072 /* Parse the block-declaration. */
10075 /* Free any declarators allocated. */
10078 /* Finish off the statement. */
10080 }
10082 /* Some dependent statements (like `if (cond) statement'), are
10083 implicitly in their own scope. In other words, if the statement is
10084 a single statement (as opposed to a compound-statement), it is
10085 none-the-less treated as if it were enclosed in braces. Any
10086 declarations appearing in the dependent statement are out of scope
10087 after control passes that point. This function parses a statement,
10088 but ensures that is in its own scope, even if it is not a
10089 compound-statement.
10091 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10092 is a (possibly labeled) if statement which is not enclosed in
10093 braces and has an else clause. This is used to implement
10094 -Wparentheses.
10096 Returns the new statement. */
10098 static tree
10100 {
10101 tree statement;
10106 /* Mark if () ; with a special NOP_EXPR. */
10108 {
10112 }
10113 /* if a compound is opened, we simply parse the statement directly. */
10116 /* If the token is not a `{', then we must take special action. */
10117 else
10118 {
10119 /* Create a compound-statement. */
10121 /* Parse the dependent-statement. */
10123 /* Finish the dummy compound-statement. */
10125 }
10127 /* Return the statement. */
10129 }
10131 /* For some dependent statements (like `while (cond) statement'), we
10132 have already created a scope. Therefore, even if the dependent
10133 statement is a compound-statement, we do not want to create another
10134 scope. */
10136 static void
10138 {
10139 /* If the token is a `{', then we must take special action. */
10142 else
10143 {
10144 /* Avoid calling cp_parser_compound_statement, so that we
10145 don't create a new scope. Do everything else by hand. */
10147 /* If the next keyword is `__label__' we have a label declaration. */
10150 /* Parse an (optional) statement-seq. */
10153 }
10154 }
10156 /* Declarations [gram.dcl.dcl] */
10158 /* Parse an optional declaration-sequence.
10160 declaration-seq:
10161 declaration
10162 declaration-seq declaration */
10164 static void
10166 {
10168 {
10179 {
10180 /* A declaration consisting of a single semicolon is
10181 invalid. Allow it unless we're being pedantic. */
10186 }
10188 /* If we're entering or exiting a region that's implicitly
10189 extern "C", modify the lang context appropriately. */
10191 {
10194 }
10196 {
10199 }
10202 {
10203 /* A top-level declaration can consist solely of a #pragma.
10204 A nested declaration cannot, so this is done here and not
10205 in cp_parser_declaration. (A #pragma at block scope is
10206 handled in cp_parser_statement.) */
10209 }
10211 /* Parse the declaration itself. */
10213 }
10214 }
10216 /* Parse a declaration.
10218 declaration:
10219 block-declaration
10220 function-definition
10221 template-declaration
10222 explicit-instantiation
10223 explicit-specialization
10224 linkage-specification
10225 namespace-definition
10227 GNU extension:
10229 declaration:
10230 __extension__ declaration */
10232 static void
10234 {
10235 cp_token token1;
10236 cp_token token2;
10241 /* Check for the `__extension__' keyword. */
10243 {
10244 /* Parse the qualified declaration. */
10246 /* Restore the PEDANTIC flag. */
10250 }
10252 /* Try to figure out what kind of declaration is present. */
10257 else
10258 {
10261 }
10263 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10266 /* If the next token is `extern' and the following token is a string
10267 literal, then we have a linkage specification. */
10271 /* If the next token is `template', then we have either a template
10272 declaration, an explicit instantiation, or an explicit
10273 specialization. */
10275 {
10276 /* `template <>' indicates a template specialization. */
10280 /* `template <' indicates a template declaration. */
10283 /* Anything else must be an explicit instantiation. */
10284 else
10286 }
10287 /* If the next token is `export', then we have a template
10288 declaration. */
10291 /* If the next token is `extern', 'static' or 'inline' and the one
10292 after that is `template', we have a GNU extended explicit
10293 instantiation directive. */
10300 /* If the next token is `namespace', check for a named or unnamed
10301 namespace definition. */
10307 /* An unnamed namespace definition. */
10311 /* An inline (associated) namespace definition. */
10315 /* Objective-C++ declaration/definition. */
10322 /* We must have either a block declaration or a function
10323 definition. */
10324 else
10325 /* Try to parse a block-declaration, or a function-definition. */
10328 /* Free any declarators allocated. */
10330 }
10332 /* Parse a block-declaration.
10334 block-declaration:
10335 simple-declaration
10336 asm-definition
10337 namespace-alias-definition
10338 using-declaration
10339 using-directive
10341 GNU Extension:
10343 block-declaration:
10344 __extension__ block-declaration
10346 C++0x Extension:
10348 block-declaration:
10349 static_assert-declaration
10351 If STATEMENT_P is TRUE, then this block-declaration is occurring as
10352 part of a declaration-statement. */
10354 static void
10357 {
10361 /* Check for the `__extension__' keyword. */
10363 {
10364 /* Parse the qualified declaration. */
10366 /* Restore the PEDANTIC flag. */
10370 }
10372 /* Peek at the next token to figure out which kind of declaration is
10373 present. */
10376 /* If the next keyword is `asm', we have an asm-definition. */
10378 {
10382 }
10383 /* If the next keyword is `namespace', we have a
10384 namespace-alias-definition. */
10387 /* If the next keyword is `using', we have a
10388 using-declaration, a using-directive, or an alias-declaration. */
10390 {
10395 /* If the token after `using' is `namespace', then we have a
10396 using-directive. */
10400 /* If the second token after 'using' is '=', then we have an
10401 alias-declaration. */
10407 /* Otherwise, it's a using-declaration. */
10408 else
10411 }
10412 /* If the next keyword is `__label__' we have a misplaced label
10413 declaration. */
10415 {
10419 /* If the next token is now a `;', consume it. */
10422 }
10423 /* If the next token is `static_assert' we have a static assertion. */
10426 /* Anything else must be a simple-declaration. */
10427 else
10430 }
10432 /* Parse a simple-declaration.
10434 simple-declaration:
10435 decl-specifier-seq [opt] init-declarator-list [opt] ;
10437 init-declarator-list:
10438 init-declarator
10439 init-declarator-list , init-declarator
10441 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
10442 function-definition as a simple-declaration.
10444 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
10445 parsed declaration if it is an uninitialized single declarator not followed
10446 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
10447 if present, will not be consumed. */
10449 static void
10453 {
10454 cp_decl_specifier_seq decl_specifiers;
10461 /* Defer access checks until we know what is being declared; the
10462 checks for names appearing in the decl-specifier-seq should be
10463 done as if we were in the scope of the thing being declared. */
10466 /* Parse the decl-specifier-seq. We have to keep track of whether
10467 or not the decl-specifier-seq declares a named class or
10468 enumeration type, since that is the only case in which the
10469 init-declarator-list is allowed to be empty.
10471 [dcl.dcl]
10473 In a simple-declaration, the optional init-declarator-list can be
10474 omitted only when declaring a class or enumeration, that is when
10475 the decl-specifier-seq contains either a class-specifier, an
10476 elaborated-type-specifier, or an enum-specifier. */
10478 CP_PARSER_FLAGS_OPTIONAL,
10481 /* We no longer need to defer access checks. */
10484 /* In a block scope, a valid declaration must always have a
10485 decl-specifier-seq. By not trying to parse declarators, we can
10486 resolve the declaration/expression ambiguity more quickly. */
10489 {
10492 }
10494 /* If the next two tokens are both identifiers, the code is
10495 erroneous. The usual cause of this situation is code like:
10497 T t;
10499 where "T" should name a type -- but does not. */
10502 {
10503 /* If parsing tentatively, we should commit; we really are
10504 looking at a declaration. */
10506 /* Give up. */
10508 }
10510 /* If we have seen at least one decl-specifier, and the next token
10511 is not a parenthesis, then we must be looking at a declaration.
10512 (After "int (" we might be looking at a functional cast.) */
10519 /* Keep going until we hit the `;' at the end of the simple
10520 declaration. */
10523 CPP_SEMICOLON))
10524 {
10527 tree decl;
10530 {
10531 /* If we are processing next declarator, coma is expected */
10537 }
10538 else
10541 /* Parse the init-declarator. */
10544 function_definition_allowed_p,
10546 declares_class_or_enum,
10548 maybe_range_for_decl);
10549 /* If an error occurred while parsing tentatively, exit quickly.
10550 (That usually happens when in the body of a function; each
10551 statement is treated as a declaration-statement until proven
10552 otherwise.) */
10555 /* Handle function definitions specially. */
10557 {
10558 /* If the next token is a `,', then we are probably
10559 processing something like:
10561 void f() {}, *p;
10563 which is erroneous. */
10565 {
10568 "mixing"
10570 }
10571 /* Otherwise, we're done with the list of declarators. */
10572 else
10573 {
10576 }
10577 }
10580 /* The next token should be either a `,' or a `;'. */
10582 /* If it's a `,', there are more declarators to come. */
10585 /* If it's a `;', we are done. */
10588 /* Anything else is an error. */
10589 else
10590 {
10591 /* If we have already issued an error message we don't need
10592 to issue another one. */
10596 /* Skip tokens until we reach the end of the statement. */
10598 /* If the next token is now a `;', consume it. */
10602 }
10603 /* After the first time around, a function-definition is not
10604 allowed -- even if it was OK at first. For example:
10606 int i, f() {}
10608 is not valid. */
10610 }
10612 /* Issue an error message if no declarators are present, and the
10613 decl-specifier-seq does not itself declare a class or
10614 enumeration. */
10616 {
10619 /* Perform any deferred access checks. */
10621 }
10623 /* Consume the `;'. */
10627 done:
10629 }
10631 /* Parse a decl-specifier-seq.
10633 decl-specifier-seq:
10634 decl-specifier-seq [opt] decl-specifier
10635 decl-specifier attribute-specifier-seq [opt] (C++11)
10637 decl-specifier:
10638 storage-class-specifier
10639 type-specifier
10640 function-specifier
10641 friend
10642 typedef
10644 GNU Extension:
10646 decl-specifier:
10647 attributes
10649 Set *DECL_SPECS to a representation of the decl-specifier-seq.
10651 The parser flags FLAGS is used to control type-specifier parsing.
10653 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
10654 flags:
10656 1: one of the decl-specifiers is an elaborated-type-specifier
10657 (i.e., a type declaration)
10658 2: one of the decl-specifiers is an enum-specifier or a
10659 class-specifier (i.e., a type definition)
10661 */
10663 static void
10665 cp_parser_flags flags,
10668 {
10672 cp_decl_spec ds;
10674 /* Clear DECL_SPECS. */
10677 /* Assume no class or enumeration type is declared. */
10680 /* Keep reading specifiers until there are no more to read. */
10682 {
10687 /* Peek at the next token. */
10690 /* Save the first token of the decl spec list for error
10691 reporting. */
10694 /* Handle attributes. */
10696 {
10697 /* Parse the attributes. */
10700 /* In a sequence of declaration specifiers, c++11 attributes
10701 appertain to the type that precede them. In that case
10702 [dcl.spec]/1 says:
10704 The attribute-specifier-seq affects the type only for
10705 the declaration it appears in, not other declarations
10706 involving the same type.
10708 But for now let's force the user to position the
10709 attribute either at the beginning of the declaration or
10710 after the declarator-id, which would clearly mean that it
10711 applies to the declarator. */
10713 {
10715 /* The c++11 attribute is at the beginning of the
10716 declaration. It appertains to the entity being
10718 else
10719 {
10721 {
10722 /* This is an attribute following a
10723 class-specifier. */
10728 }
10729 else
10730 {
10731 decl_specs->std_attributes
10733 attrs);
10736 }
10738 }
10739 }
10741 decl_specs->attributes
10743 attrs);
10747 }
10748 /* Assume we will find a decl-specifier keyword. */
10750 /* If the next token is an appropriate keyword, we can simply
10751 add it to the list. */
10753 {
10754 /* decl-specifier:
10755 friend
10756 constexpr */
10759 {
10762 }
10763 else
10764 {
10766 /* Consume the token. */
10768 }
10776 /* function-specifier:
10777 inline
10778 virtual
10779 explicit */
10786 /* decl-specifier:
10787 typedef */
10790 /* Consume the token. */
10792 /* A constructor declarator cannot appear in a typedef. */
10794 /* The "typedef" keyword can only occur in a declaration; we
10795 may as well commit at this point. */
10802 /* storage-class-specifier:
10803 auto
10804 register
10805 static
10806 extern
10807 mutable
10809 GNU Extension:
10810 thread */
10813 {
10814 /* Consume the token. */
10817 /* Complain about `auto' as a storage specifier, if
10818 we're complaining about C++0x compatibility. */
10822 /* Set the storage class anyway. */
10824 token);
10825 }
10826 else
10827 /* C++0x auto type-specifier. */
10835 /* Consume the token. */
10838 token);
10841 /* Consume the token. */
10847 /* We did not yet find a decl-specifier yet. */
10850 }
10860 /* Constructors are a special case. The `S' in `S()' is not a
10861 decl-specifier; it is the beginning of the declarator. */
10862 constructor_p
10863 = (!found_decl_spec
10864 && constructor_possible_p
10865 && (cp_parser_constructor_declarator_p
10868 /* If we don't have a DECL_SPEC yet, then we must be looking at
10869 a type-specifier. */
10871 {
10874 tree type_spec;
10876 type_spec
10878 decl_specs,
10884 /* If this type-specifier referenced a user-defined type
10885 (a typedef, class-name, etc.), then we can't allow any
10886 more such type-specifiers henceforth.
10888 [dcl.spec]
10890 The longest sequence of decl-specifiers that could
10891 possibly be a type name is taken as the
10892 decl-specifier-seq of a declaration. The sequence shall
10893 be self-consistent as described below.
10895 [dcl.type]
10897 As a general rule, at most one type-specifier is allowed
10898 in the complete decl-specifier-seq of a declaration. The
10899 only exceptions are the following:
10901 -- const or volatile can be combined with any other
10902 type-specifier.
10904 -- signed or unsigned can be combined with char, long,
10905 short, or int.
10907 -- ..
10909 Example:
10911 typedef char* Pc;
10912 void g (const int Pc);
10914 Here, Pc is *not* part of the decl-specifier seq; it's
10915 the declarator. Therefore, once we see a type-specifier
10916 (other than a cv-qualifier), we forbid any additional
10917 user-defined types. We *do* still allow things like `int
10918 int' to be considered a decl-specifier-seq, and issue the
10919 error message later. */
10922 /* A constructor declarator cannot follow a type-specifier. */
10924 {
10929 }
10930 }
10932 /* If we still do not have a DECL_SPEC, then there are no more
10933 decl-specifiers. */
10938 /* After we see one decl-specifier, further decl-specifiers are
10939 always optional. */
10941 }
10943 /* Don't allow a friend specifier with a class definition. */
10948 }
10950 /* Parse an (optional) storage-class-specifier.
10952 storage-class-specifier:
10953 auto
10954 register
10955 static
10956 extern
10957 mutable
10959 GNU Extension:
10961 storage-class-specifier:
10962 thread
10964 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
10966 static tree
10968 {
10970 {
10974 /* Fall through for C++98. */
10981 /* Consume the token. */
10986 }
10987 }
10989 /* Parse an (optional) function-specifier.
10991 function-specifier:
10992 inline
10993 virtual
10994 explicit
10996 Returns an IDENTIFIER_NODE corresponding to the keyword used.
10997 Updates DECL_SPECS, if it is non-NULL. */
10999 static tree
11002 {
11005 {
11011 /* 14.5.2.3 [temp.mem]
11013 A member function template shall not be virtual. */
11025 }
11027 /* Consume the token. */
11029 }
11031 /* Parse a linkage-specification.
11033 linkage-specification:
11034 extern string-literal { declaration-seq [opt] }
11035 extern string-literal declaration */
11037 static void
11039 {
11040 tree linkage;
11042 /* Look for the `extern' keyword. */
11045 /* Look for the string-literal. */
11048 /* Transform the literal into an identifier. If the literal is a
11049 wide-character string, or contains embedded NULs, then we can't
11050 handle it as the user wants. */
11053 {
11055 /* Assume C++ linkage. */
11057 }
11058 else
11061 /* We're now using the new linkage. */
11064 /* If the next token is a `{', then we're using the first
11065 production. */
11067 {
11068 /* Consume the `{' token. */
11070 /* Parse the declarations. */
11072 /* Look for the closing `}'. */
11074 }
11075 /* Otherwise, there's just one declaration. */
11076 else
11077 {
11080 saved_in_unbraced_linkage_specification_p
11084 parser->in_unbraced_linkage_specification_p
11086 }
11088 /* We're done with the linkage-specification. */
11090 }
11092 /* Parse a static_assert-declaration.
11094 static_assert-declaration:
11095 static_assert ( constant-expression , string-literal ) ;
11097 If MEMBER_P, this static_assert is a class member. */
11099 static void
11101 {
11102 tree condition;
11103 tree message;
11105 location_t saved_loc;
11108 /* Peek at the `static_assert' token so we can keep track of exactly
11109 where the static assertion started. */
11113 /* Look for the `static_assert' keyword. */
11115 RT_STATIC_ASSERT))
11118 /* We know we are in a static assertion; commit to any tentative
11119 parse. */
11123 /* Parse the `(' starting the static assertion condition. */
11126 /* Parse the constant-expression. Allow a non-constant expression
11127 here in order to give better diagnostics in finish_static_assert. */
11128 condition =
11133 /* Parse the separating `,'. */
11136 /* Parse the string-literal message. */
11141 /* A `)' completes the static assertion. */
11148 /* A semicolon terminates the declaration. */
11151 /* Complete the static assertion, which may mean either processing
11152 the static assert now or saving it for template instantiation. */
11154 }
11156 /* Parse a `decltype' type. Returns the type.
11158 simple-type-specifier:
11159 decltype ( expression ) */
11161 static tree
11163 {
11164 tree expr;
11173 {
11174 /* Already parsed. */
11177 }
11179 /* Look for the `decltype' token. */
11183 /* Types cannot be defined in a `decltype' expression. Save away the
11184 old message. */
11187 /* And create the new one. */
11188 parser->type_definition_forbidden_message
11191 /* The restrictions on constant-expressions do not apply inside
11192 decltype expressions. */
11193 saved_integral_constant_expression_p
11195 saved_non_integral_constant_expression_p
11199 /* Do not actually evaluate the expression. */
11202 /* Do not warn about problems with the expression. */
11205 /* Parse the opening `('. */
11209 /* First, try parsing an id-expression. */
11220 {
11223 cp_id_kind idk;
11227 /* Lookup the name we got back from the id-expression. */
11229 none_type,
11243 {
11244 /* Complete lookup of the id-expression. */
11245 expr = (finish_id_expression
11258 /* We found an id-expression, but it was something that we
11259 should not have found. This is an error, not something
11260 we can recover from, so note that we found an
11261 id-expression and we'll recover as gracefully as
11262 possible. */
11264 }
11269 /* We have an id-expression. */
11271 }
11274 {
11275 /* Abort the id-expression parse. */
11278 /* Parsing tentatively, again. */
11281 /* Parse a class member access. */
11289 /* We have an id-expression. */
11291 }
11294 /* We have parsed the complete id-expression or member access. */
11296 else
11297 {
11300 /* Abort our attempt to parse an id-expression or member access
11301 expression. */
11304 /* Within a parenthesized expression, a `>' token is always
11305 the greater-than operator. */
11306 saved_greater_than_is_operator_p
11310 /* Parse a full expression. */
11313 /* The `>' token might be the end of a template-id or
11314 template-parameter-list now. */
11315 parser->greater_than_is_operator_p
11317 }
11319 /* Go back to evaluating expressions. */
11323 /* Restore the old message and the integral constant expression
11324 flags. */
11326 parser->integral_constant_expression_p
11328 parser->non_integral_constant_expression_p
11331 /* Parse to the closing `)'. */
11333 {
11337 }
11340 tf_warning_or_error);
11342 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
11343 it again. */
11350 }
11352 /* Special member functions [gram.special] */
11354 /* Parse a conversion-function-id.
11356 conversion-function-id:
11357 operator conversion-type-id
11359 Returns an IDENTIFIER_NODE representing the operator. */
11361 static tree
11363 {
11364 tree type;
11365 tree saved_scope;
11366 tree saved_qualifying_scope;
11367 tree saved_object_scope;
11370 /* Look for the `operator' token. */
11373 /* When we parse the conversion-type-id, the current scope will be
11374 reset. However, we need that information in able to look up the
11375 conversion function later, so we save it here. */
11379 /* We must enter the scope of the class so that the names of
11380 entities declared within the class are available in the
11381 conversion-type-id. For example, consider:
11383 struct S {
11384 typedef int I;
11385 operator I();
11386 };
11388 S::operator I() { ... }
11390 In order to see that `I' is a type-name in the definition, we
11391 must be in the scope of `S'. */
11394 /* Parse the conversion-type-id. */
11396 /* Leave the scope of the class, if any. */
11399 /* Restore the saved scope. */
11403 /* If the TYPE is invalid, indicate failure. */
11407 }
11409 /* Parse a conversion-type-id:
11411 conversion-type-id:
11412 type-specifier-seq conversion-declarator [opt]
11414 Returns the TYPE specified. */
11416 static tree
11418 {
11419 tree attributes;
11420 cp_decl_specifier_seq type_specifiers;
11422 tree type_specified;
11424 /* Parse the attributes. */
11426 /* Parse the type-specifiers. */
11430 /* If that didn't work, stop. */
11433 /* Parse the conversion-declarator. */
11441 /* Don't give this error when parsing tentatively. This happens to
11442 work because we always parse this definitively once. */
11445 {
11447 {
11450 }
11454 }
11457 }
11459 /* Parse an (optional) conversion-declarator.
11461 conversion-declarator:
11462 ptr-operator conversion-declarator [opt]
11464 */
11468 {
11471 cp_cv_quals cv_quals;
11473 /* We don't know if there's a ptr-operator next, or not. */
11475 /* Try the ptr-operator. */
11478 /* If it worked, look for more conversion-declarators. */
11480 {
11483 /* Parse another optional declarator. */
11486 declarator = cp_parser_make_indirect_declarator
11490 }
11493 }
11495 /* Parse an (optional) ctor-initializer.
11497 ctor-initializer:
11498 : mem-initializer-list
11500 Returns TRUE iff the ctor-initializer was actually present. */
11502 static bool
11504 {
11505 /* If the next token is not a `:', then there is no
11506 ctor-initializer. */
11508 {
11509 /* Do default initialization of any bases and members. */
11514 }
11516 /* Consume the `:' token. */
11518 /* And the mem-initializer-list. */
11522 }
11524 /* Parse a mem-initializer-list.
11526 mem-initializer-list:
11527 mem-initializer ... [opt]
11528 mem-initializer ... [opt] , mem-initializer-list */
11530 static void
11532 {
11537 /* Let the semantic analysis code know that we are starting the
11538 mem-initializer-list. */
11543 /* Loop through the list. */
11545 {
11546 tree mem_initializer;
11549 /* Parse the mem-initializer. */
11551 /* If the next token is a `...', we're expanding member initializers. */
11553 {
11554 /* Consume the `...'. */
11557 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
11558 can be expanded but members cannot. */
11561 {
11566 }
11568 /* Construct the pack expansion type. */
11571 }
11574 {
11578 }
11579 /* Look for a target constructor. */
11583 {
11586 {
11590 }
11592 }
11593 /* Add it to the list, unless it was erroneous. */
11595 {
11598 }
11599 /* If the next token is not a `,', we're done. */
11602 /* Consume the `,' token. */
11604 }
11606 /* Perform semantic analysis. */
11609 }
11611 /* Parse a mem-initializer.
11613 mem-initializer:
11614 mem-initializer-id ( expression-list [opt] )
11615 mem-initializer-id braced-init-list
11617 GNU extension:
11619 mem-initializer:
11620 ( expression-list [opt] )
11622 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
11623 class) or FIELD_DECL (for a non-static data member) to initialize;
11624 the TREE_VALUE is the expression-list. An empty initialization
11625 list is represented by void_list_node. */
11627 static tree
11629 {
11630 tree mem_initializer_id;
11631 tree expression_list;
11632 tree member;
11635 /* Find out what is being initialized. */
11637 {
11641 }
11642 else
11643 {
11647 }
11653 {
11659 }
11660 else
11661 {
11671 }
11681 }
11683 /* Parse a mem-initializer-id.
11685 mem-initializer-id:
11686 :: [opt] nested-name-specifier [opt] class-name
11687 identifier
11689 Returns a TYPE indicating the class to be initializer for the first
11690 production. Returns an IDENTIFIER_NODE indicating the data member
11691 to be initialized for the second production. */
11693 static tree
11695 {
11699 tree id;
11703 /* `typename' is not allowed in this context ([temp.res]). */
11705 {
11707 "keyword %<typename%> not allowed in this context (a qualified "
11710 }
11711 /* Look for the optional `::' operator. */
11712 global_scope_p
11716 /* Look for the optional nested-name-specifier. The simplest way to
11717 implement:
11719 [temp.res]
11721 The keyword `typename' is not permitted in a base-specifier or
11722 mem-initializer; in these contexts a qualified name that
11723 depends on a template-parameter is implicitly assumed to be a
11724 type name.
11726 is to assume that we have seen the `typename' keyword at this
11727 point. */
11728 nested_name_specifier_p
11737 /* If there is a `::' operator or a nested-name-specifier, then we
11738 are definitely looking for a class-name. */
11743 typename_type,
11747 /* Otherwise, we could also be looking for an ordinary identifier. */
11749 /* Try a class-name. */
11753 none_type,
11757 /* If we found one, we're done. */
11760 /* Otherwise, look for an ordinary identifier. */
11762 }
11764 /* Overloading [gram.over] */
11766 /* Parse an operator-function-id.
11768 operator-function-id:
11769 operator operator
11771 Returns an IDENTIFIER_NODE for the operator which is a
11772 human-readable spelling of the identifier, e.g., `operator +'. */
11774 static tree
11776 {
11777 /* Look for the `operator' keyword. */
11780 /* And then the name of the operator itself. */
11782 }
11784 /* Return an identifier node for a user-defined literal operator.
11785 The suffix identifier is chained to the operator name identifier. */
11787 static tree
11789 {
11790 tree identifier;
11795 /*IDENTIFIER_UDLIT_OPNAME_P (identifier) = 1; If we get a flag someday. */
11798 }
11800 /* Parse an operator.
11802 operator:
11803 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
11804 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
11805 || ++ -- , ->* -> () []
11807 GNU Extensions:
11809 operator:
11810 <? >? <?= >?=
11812 Returns an IDENTIFIER_NODE for the operator which is a
11813 human-readable spelling of the identifier, e.g., `operator +'. */
11815 static tree
11817 {
11821 /* Peek at the next token. */
11823 /* Figure out which operator we have. */
11825 {
11827 {
11830 /* The keyword should be either `new' or `delete'. */
11835 else
11838 /* Consume the `new' or `delete' token. */
11841 /* Peek at the next token. */
11843 /* If it's a `[' token then this is the array variant of the
11844 operator. */
11846 {
11847 /* Consume the `[' token. */
11849 /* Look for the `]' token. */
11853 }
11854 /* Otherwise, we have the non-array variant. */
11855 else
11859 }
12006 /* Consume the `('. */
12008 /* Look for the matching `)'. */
12013 /* Consume the `['. */
12015 /* Look for the matching `]'. */
12023 {
12026 }
12027 /* Consume the string. */
12029 /* Look for the suffix identifier. */
12032 {
12035 {
12038 }
12039 }
12040 else
12041 {
12044 }
12051 /* Anything else is an error. */
12053 }
12055 /* If we have selected an identifier, we need to consume the
12056 operator token. */
12059 /* Otherwise, no valid operator name was present. */
12060 else
12061 {
12064 }
12067 }
12069 /* Parse a template-declaration.
12071 template-declaration:
12072 export [opt] template < template-parameter-list > declaration
12074 If MEMBER_P is TRUE, this template-declaration occurs within a
12075 class-specifier.
12077 The grammar rule given by the standard isn't correct. What
12078 is really meant is:
12080 template-declaration:
12081 export [opt] template-parameter-list-seq
12082 decl-specifier-seq [opt] init-declarator [opt] ;
12083 export [opt] template-parameter-list-seq
12084 function-definition
12086 template-parameter-list-seq:
12087 template-parameter-list-seq [opt]
12088 template < template-parameter-list > */
12090 static void
12092 {
12093 /* Check for `export'. */
12095 {
12096 /* Consume the `export' token. */
12098 /* Warn that we do not support `export'. */
12100 }
12103 }
12105 /* Parse a template-parameter-list.
12107 template-parameter-list:
12108 template-parameter
12109 template-parameter-list , template-parameter
12111 Returns a TREE_LIST. Each node represents a template parameter.
12112 The nodes are connected via their TREE_CHAINs. */
12114 static tree
12116 {
12121 /* The loop below parses the template parms. We first need to know
12122 the total number of template parms to be able to compute proper
12123 canonical types of each dependent type. So after the loop, when
12124 we know the total number of template parms,
12125 end_template_parm_list computes the proper canonical types and
12126 fixes up the dependent types accordingly. */
12128 {
12129 tree parameter;
12132 location_t parm_loc;
12134 /* Parse the template-parameter. */
12139 /* Add it to the list. */
12142 parm_loc,
12143 parameter,
12144 is_non_type,
12145 is_parameter_pack);
12146 else
12147 {
12150 }
12152 /* If the next token is not a `,', we're done. */
12155 /* Otherwise, consume the `,' token. */
12157 }
12160 }
12162 /* Parse a template-parameter.
12164 template-parameter:
12165 type-parameter
12166 parameter-declaration
12168 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
12169 the parameter. The TREE_PURPOSE is the default value, if any.
12170 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
12171 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
12172 set to true iff this parameter is a parameter pack. */
12174 static tree
12177 {
12181 tree parm;
12183 /* Assume it is a type parameter or a template parameter. */
12185 /* Assume it not a parameter pack. */
12187 /* Peek at the next token. */
12189 /* If it is `class' or `template', we have a type-parameter. */
12192 /* If it is `class' or `typename' we do not know yet whether it is a
12193 type parameter or a non-type parameter. Consider:
12195 template <typename T, typename T::X X> ...
12197 or:
12199 template <class C, class D*> ...
12201 Here, the first parameter is a type parameter, and the second is
12202 a non-type parameter. We can tell by looking at the token after
12203 the identifier -- if it is a `,', `=', or `>' then we have a type
12204 parameter. */
12206 {
12207 /* Peek at the token after `class' or `typename'. */
12209 /* If it's an ellipsis, we have a template type parameter
12210 pack. */
12213 /* If it's an identifier, skip it. */
12216 /* Now, see if the token looks like the end of a template
12217 parameter. */
12222 }
12224 /* Otherwise, it is a non-type parameter.
12226 [temp.param]
12228 When parsing a default template-argument for a non-type
12229 template-parameter, the first non-nested `>' is taken as the end
12230 of the template parameter-list rather than a greater-than
12231 operator. */
12233 parameter_declarator
12237 /* If the parameter declaration is marked as a parameter pack, set
12238 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
12239 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
12240 grokdeclarator. */
12244 {
12247 }
12249 /* If the next token is an ellipsis, and we don't already have it
12250 marked as a parameter pack, then we have a parameter pack (that
12251 has no declarator). */
12255 {
12256 /* Consume the `...'. */
12261 }
12262 /* We might end up with a pack expansion as the type of the non-type
12263 template parameter, in which case this is a non-type template
12264 parameter pack. */
12268 {
12272 }
12275 {
12276 /* Parameter packs cannot have default arguments. However, a
12277 user may try to do so, so we'll parse them and give an
12278 appropriate diagnostic here. */
12282 /* Find the name of the parameter pack. */
12291 else
12295 /* Parse the default argument, but throw away the result. */
12297 }
12307 }
12309 /* Parse a type-parameter.
12311 type-parameter:
12312 class identifier [opt]
12313 class identifier [opt] = type-id
12314 typename identifier [opt]
12315 typename identifier [opt] = type-id
12316 template < template-parameter-list > class identifier [opt]
12317 template < template-parameter-list > class identifier [opt]
12318 = id-expression
12320 GNU Extension (variadic templates):
12322 type-parameter:
12323 class ... identifier [opt]
12324 typename ... identifier [opt]
12326 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
12327 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
12328 the declaration of the parameter.
12330 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
12332 static tree
12334 {
12336 tree parameter;
12338 /* Look for a keyword to tell us what kind of parameter this is. */
12344 {
12347 {
12348 tree identifier;
12349 tree default_argument;
12351 /* If the next token is an ellipsis, we have a template
12352 argument pack. */
12354 {
12355 /* Consume the `...' token. */
12360 }
12362 /* If the next token is an identifier, then it names the
12363 parameter. */
12366 else
12369 /* Create the parameter. */
12372 /* If the next token is an `=', we have a default argument. */
12374 {
12375 /* Consume the `=' token. */
12377 /* Parse the default-argument. */
12381 /* Template parameter packs cannot have default
12382 arguments. */
12384 {
12387 "template parameter pack %qD cannot have a "
12389 else
12391 "template parameter packs cannot have "
12394 }
12396 }
12397 else
12400 /* Create the combined representation of the parameter and the
12401 default argument. */
12403 }
12407 {
12408 tree identifier;
12409 tree default_argument;
12411 /* Look for the `<'. */
12413 /* Parse the template-parameter-list. */
12415 /* Look for the `>'. */
12417 /* Look for the `class' keyword. */
12419 /* If the next token is an ellipsis, we have a template
12420 argument pack. */
12422 {
12423 /* Consume the `...' token. */
12428 }
12429 /* If the next token is an `=', then there is a
12430 default-argument. If the next token is a `>', we are at
12431 the end of the parameter-list. If the next token is a `,',
12432 then we are at the end of this parameter. */
12436 {
12438 /* Treat invalid names as if the parameter were nameless. */
12441 }
12442 else
12445 /* Create the template parameter. */
12447 identifier);
12449 /* If the next token is an `=', then there is a
12450 default-argument. */
12452 {
12455 /* Consume the `='. */
12457 /* Parse the id-expression. */
12459 /* save token before parsing the id-expression, for error
12460 reporting */
12462 default_argument
12470 /* If the id-expression was a template-id that refers to
12471 a template-class, we already have the declaration here,
12472 so no further lookup is needed. */
12473 ;
12474 else
12475 /* Look up the name. */
12476 default_argument
12478 none_type,
12484 /* See if the default argument is valid. */
12485 default_argument
12488 /* Template parameter packs cannot have default
12489 arguments. */
12491 {
12494 "template parameter pack %qD cannot "
12496 identifier);
12497 else
12501 }
12503 }
12504 else
12507 /* Create the combined representation of the parameter and the
12508 default argument. */
12510 }
12516 }
12519 }
12521 /* Parse a template-id.
12523 template-id:
12524 template-name < template-argument-list [opt] >
12526 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
12527 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
12528 returned. Otherwise, if the template-name names a function, or set
12529 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
12530 names a class, returns a TYPE_DECL for the specialization.
12532 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
12533 uninstantiated templates. */
12535 static tree
12541 {
12543 tree templ;
12544 tree arguments;
12545 tree template_id;
12552 /* If the next token corresponds to a template-id, there is no need
12553 to reparse it. */
12556 {
12559 /* Get the stored value. */
12561 /* Perform any access checks that were deferred. */
12564 {
12569 tf_warning_or_error);
12570 }
12571 /* Return the stored value. */
12573 }
12575 /* Avoid performing name lookup if there is no possibility of
12576 finding a template-id. */
12579 && !cp_parser_nth_token_starts_template_argument_list_p
12581 {
12584 }
12586 /* Remember where the template-id starts. */
12592 /* Parse the template-name. */
12595 check_dependency_p,
12596 is_declaration,
12597 tag_type,
12600 {
12603 }
12605 /* If we find the sequence `[:' after a template-name, it's probably
12606 a digraph-typo for `< ::'. Substitute the tokens and check if we can
12607 parse correctly the argument list. */
12614 {
12616 /* Change `:' into `::'. */
12618 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
12619 CPP_LESS. */
12622 /* Parse the arguments. */
12625 {
12626 /* If we couldn't parse an argument list, then we revert our changes
12627 and return simply an error. Maybe this is not a template-id
12628 after all. */
12633 }
12634 /* Otherwise, emit an error about the invalid digraph, but continue
12635 parsing because we got our argument list. In C++11 do not emit
12636 any error, per 2.5/3. */
12640 {
12643 "%<<:%> is an alternate spelling for %<[%>."
12646 {
12648 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
12651 }
12652 }
12653 }
12654 else
12655 {
12656 /* Look for the `<' that starts the template-argument-list. */
12658 {
12661 }
12662 /* Parse the arguments. */
12664 }
12666 /* Build a representation of the specialization. */
12669 TEMPLATE_ID_EXPR,
12673 {
12675 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
12676 template (rather than some instantiation thereof) only if
12677 is not nested within some other construct. For example, in
12678 "template <typename T> void f(T) { A<T>::", A<T> is just an
12679 instantiation of A. */
12682 CPP_SCOPE));
12683 template_id
12685 }
12686 else
12687 {
12688 /* If it's not a class-template or a template-template, it should be
12689 a function-template. */
12695 }
12697 /* If parsing tentatively, replace the sequence of tokens that makes
12698 up the template-id with a CPP_TEMPLATE_ID token. That way,
12699 should we re-parse the token stream, we will not have to repeat
12700 the effort required to do the parse, nor will we issue duplicate
12701 error messages about problems during instantiation of the
12702 template. */
12704 {
12707 /* Reset the contents of the START_OF_ID token. */
12709 /* Retrieve any deferred checks. Do not pop this access checks yet
12710 so the memory will not be reclaimed during token replacing below. */
12716 /* Purge all subsequent tokens. */
12719 /* ??? Can we actually assume that, if template_id ==
12720 error_mark_node, we will have issued a diagnostic to the
12721 user, as opposed to simply marking the tentative parse as
12722 failed? */
12725 }
12729 }
12731 /* Parse a template-name.
12733 template-name:
12734 identifier
12736 The standard should actually say:
12738 template-name:
12739 identifier
12740 operator-function-id
12742 A defect report has been filed about this issue.
12744 A conversion-function-id cannot be a template name because they cannot
12745 be part of a template-id. In fact, looking at this code:
12747 a.operator K<int>()
12749 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
12750 It is impossible to call a templated conversion-function-id with an
12751 explicit argument list, since the only allowed template parameter is
12752 the type to which it is converting.
12754 If TEMPLATE_KEYWORD_P is true, then we have just seen the
12755 `template' keyword, in a construction like:
12757 T::template f<3>()
12759 In that case `f' is taken to be a template-name, even though there
12760 is no way of knowing for sure.
12762 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
12763 name refers to a set of overloaded functions, at least one of which
12764 is a template, or an IDENTIFIER_NODE with the name of the template,
12765 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
12766 names are looked up inside uninstantiated templates. */
12768 static tree
12775 {
12776 tree identifier;
12777 tree decl;
12778 tree fns;
12781 /* If the next token is `operator', then we have either an
12782 operator-function-id or a conversion-function-id. */
12784 {
12785 /* We don't know whether we're looking at an
12786 operator-function-id or a conversion-function-id. */
12788 /* Try an operator-function-id. */
12790 /* If that didn't work, try a conversion-function-id. */
12792 {
12795 }
12796 }
12797 /* Look for the identifier. */
12798 else
12801 /* If we didn't find an identifier, we don't have a template-id. */
12805 /* If the name immediately followed the `template' keyword, then it
12806 is a template-name. However, if the next token is not `<', then
12807 we do not treat it as a template-name, since it is not being used
12808 as part of a template-id. This enables us to handle constructs
12809 like:
12811 template <typename T> struct S { S(); };
12812 template <typename T> S<T>::S();
12814 correctly. We would treat `S' as a template -- if it were `S<T>'
12815 -- but we do not if there is no `<'. */
12819 {
12820 /* In a declaration, in a dependent context, we pretend that the
12821 "template" keyword was present in order to improve error
12822 recovery. For example, given:
12824 template <typename T> void f(T::X<int>);
12826 we want to treat "X<int>" as a template-id. */
12828 && !template_keyword_p
12830 && check_dependency_p
12832 /* Do not do this for dtors (or ctors), since they never
12833 need the template keyword before their name. */
12835 {
12838 /* Explain what went wrong. */
12840 identifier);
12843 /* If parsing tentatively, find the location of the "<" token. */
12846 /* Parse the template arguments so that we can issue error
12847 messages about them. */
12850 /* Skip tokens until we find a good place from which to
12851 continue parsing. */
12856 /* If parsing tentatively, permanently remove the
12857 template argument list. That will prevent duplicate
12858 error messages from being issued about the missing
12859 "template" keyword. */
12865 }
12867 /* If the "template" keyword is present, then there is generally
12868 no point in doing name-lookup, so we just return IDENTIFIER.
12869 But, if the qualifying scope is non-dependent then we can
12870 (and must) do name-lookup normally. */
12876 }
12878 /* Look up the name. */
12880 tag_type,
12883 check_dependency_p,
12887 /* If DECL is a template, then the name was a template-name. */
12889 ;
12890 else
12891 {
12894 /* The standard does not explicitly indicate whether a name that
12895 names a set of overloaded declarations, some of which are
12896 templates, is a template-name. However, such a name should
12897 be a template-name; otherwise, there is no way to form a
12898 template-id for the overloaded templates. */
12906 {
12907 /* The name does not name a template. */
12910 }
12911 }
12913 /* If DECL is dependent, and refers to a function, then just return
12914 its name; we will look it up again during template instantiation. */
12916 {
12920 }
12923 }
12925 /* Parse a template-argument-list.
12927 template-argument-list:
12928 template-argument ... [opt]
12929 template-argument-list , template-argument ... [opt]
12931 Returns a TREE_VEC containing the arguments. */
12933 static tree
12935 {
12940 tree vec;
12947 /* Even if the template-id appears in an integral
12948 constant-expression, the contents of the argument list do
12949 not. */
12955 /* Parse the arguments. */
12956 do
12957 {
12958 tree argument;
12961 /* Consume the comma. */
12964 /* Parse the template-argument. */
12967 /* If the next token is an ellipsis, we're expanding a template
12968 argument pack. */
12970 {
12972 {
12976 }
12977 /* Consume the `...' token. */
12980 /* Make the argument into a TYPE_PACK_EXPANSION or
12981 EXPR_PACK_EXPANSION. */
12983 }
12986 {
12990 {
12993 }
12994 else
12996 }
12998 }
13011 #ifdef ENABLE_CHECKING
13013 #endif
13015 }
13017 /* Parse a template-argument.
13019 template-argument:
13020 assignment-expression
13021 type-id
13022 id-expression
13024 The representation is that of an assignment-expression, type-id, or
13025 id-expression -- except that the qualified id-expression is
13026 evaluated, so that the value returned is either a DECL or an
13027 OVERLOAD.
13029 Although the standard says "assignment-expression", it forbids
13030 throw-expressions or assignments in the template argument.
13031 Therefore, we use "conditional-expression" instead. */
13033 static tree
13035 {
13036 tree argument;
13042 cp_id_kind idk;
13044 /* There's really no way to know what we're looking at, so we just
13045 try each alternative in order.
13047 [temp.arg]
13049 In a template-argument, an ambiguity between a type-id and an
13050 expression is resolved to a type-id, regardless of the form of
13051 the corresponding template-parameter.
13053 Therefore, we try a type-id first. */
13056 /* If there was no error parsing the type-id but the next token is a
13057 '>>', our behavior depends on which dialect of C++ we're
13058 parsing. In C++98, we probably found a typo for '> >'. But there
13059 are type-id which are also valid expressions. For instance:
13061 struct X { int operator >> (int); };
13062 template <int V> struct Foo {};
13063 Foo<X () >> 5> r;
13065 Here 'X()' is a valid type-id of a function type, but the user just
13066 wanted to write the expression "X() >> 5". Thus, we remember that we
13067 found a valid type-id, but we still try to parse the argument as an
13068 expression to see what happens.
13070 In C++0x, the '>>' will be considered two separate '>'
13071 tokens. */
13075 {
13078 }
13079 else
13080 {
13081 /* If the next token isn't a `,' or a `>', then this argument wasn't
13082 really finished. This means that the argument is not a valid
13083 type-id. */
13086 /* If that worked, we're done. */
13089 }
13090 /* We're still not sure what the argument will be. */
13092 /* Try a template. */
13100 /* If the next token isn't a `,' or a `>', then this argument wasn't
13101 really finished. */
13105 {
13106 /* Figure out what is being referred to. If the id-expression
13107 was for a class template specialization, then we will have a
13108 TYPE_DECL at this point. There is no need to do name lookup
13109 at this point in that case. */
13112 none_type,
13121 }
13124 /* It must be a non-type argument. There permitted cases are given
13125 in [temp.arg.nontype]:
13127 -- an integral constant-expression of integral or enumeration
13128 type; or
13130 -- the name of a non-type template-parameter; or
13132 -- the name of an object or function with external linkage...
13134 -- the address of an object or function with external linkage...
13136 -- a pointer to member... */
13137 /* Look for a non-type template parameter. */
13139 {
13151 }
13153 /* If the next token is "&", the argument must be the address of an
13154 object or function with external linkage. */
13157 {
13160 }
13161 /* See if we might have an id-expression. */
13168 {
13171 address_p,
13178 else
13179 {
13180 tree probe;
13183 {
13186 }
13188 /* If we're in a template, we represent a qualified-id referring
13189 to a static data member as a SCOPE_REF even if the scope isn't
13190 dependent so that we can check access control later. */
13195 {
13196 /* A variable without external linkage might still be a
13197 valid constant-expression, so no error is issued here
13198 if the external-linkage check fails. */
13201 }
13203 /* All overloaded functions are allowed; if the external
13204 linkage test does not pass, an error will be issued
13205 later. */
13206 ;
13210 /* A pointer-to-member. */
13211 ;
13213 ;
13214 else
13218 {
13221 tf_warning_or_error);
13223 }
13224 }
13225 }
13226 /* If the argument started with "&", there are no other valid
13227 alternatives at this point. */
13229 {
13232 }
13234 /* If the argument wasn't successfully parsed as a type-id followed
13235 by '>>', the argument can only be a constant expression now.
13236 Otherwise, we try parsing the constant-expression tentatively,
13237 because the argument could really be a type-id. */
13250 /* We did our best to parse the argument as a non type-id, but that
13251 was the only alternative that matched (albeit with a '>' after
13252 it). We can assume it's just a typo from the user, and a
13253 diagnostic will then be issued. */
13255 }
13257 /* Parse an explicit-instantiation.
13259 explicit-instantiation:
13260 template declaration
13262 Although the standard says `declaration', what it really means is:
13264 explicit-instantiation:
13265 template decl-specifier-seq [opt] declarator [opt] ;
13267 Things like `template int S<int>::i = 5, int S<double>::j;' are not
13268 supposed to be allowed. A defect report has been filed about this
13269 issue.
13271 GNU Extension:
13273 explicit-instantiation:
13274 storage-class-specifier template
13275 decl-specifier-seq [opt] declarator [opt] ;
13276 function-specifier template
13277 decl-specifier-seq [opt] declarator [opt] ; */
13279 static void
13281 {
13283 cp_decl_specifier_seq decl_specifiers;
13288 /* Look for an (optional) storage-class-specifier or
13289 function-specifier. */
13291 {
13292 extension_specifier
13295 extension_specifier
13298 }
13300 /* Look for the `template' keyword. */
13302 /* Let the front end know that we are processing an explicit
13303 instantiation. */
13305 /* [temp.explicit] says that we are supposed to ignore access
13306 control while processing explicit instantiation directives. */
13308 /* Parse a decl-specifier-seq. */
13310 CP_PARSER_FLAGS_OPTIONAL,
13313 /* If there was exactly one decl-specifier, and it declared a class,
13314 and there's no declarator, then we have an explicit type
13315 instantiation. */
13317 {
13318 tree type;
13322 /* Turn access control back on for names used during
13323 template instantiation. */
13328 }
13329 else
13330 {
13332 tree decl;
13334 /* Parse the declarator. */
13335 declarator
13345 {
13348 "explicit instantiation shall not use"
13352 "explicit instantiation shall not use"
13357 /* Turn access control back on for names used during
13358 template instantiation. */
13360 /* Do the explicit instantiation. */
13362 }
13363 else
13364 {
13366 /* Skip the body of the explicit instantiation. */
13368 }
13369 }
13370 /* We're done with the instantiation. */
13376 }
13378 /* Parse an explicit-specialization.
13380 explicit-specialization:
13381 template < > declaration
13383 Although the standard says `declaration', what it really means is:
13385 explicit-specialization:
13386 template <> decl-specifier [opt] init-declarator [opt] ;
13387 template <> function-definition
13388 template <> explicit-specialization
13389 template <> template-declaration */
13391 static void
13393 {
13397 /* Look for the `template' keyword. */
13399 /* Look for the `<'. */
13401 /* Look for the `>'. */
13403 /* We have processed another parameter list. */
13405 /* [temp]
13407 A template ... explicit specialization ... shall not have C
13408 linkage. */
13410 {
13412 /* Give it C++ linkage to avoid confusing other parts of the
13413 front end. */
13416 }
13417 else
13419 /* Let the front end know that we are beginning a specialization. */
13421 {
13424 }
13426 /* If the next keyword is `template', we need to figure out whether
13427 or not we're looking a template-declaration. */
13429 {
13434 else
13436 }
13437 else
13438 /* Parse the dependent declaration. */
13444 /* We're done with the specialization. */
13446 /* For the erroneous case of a template with C linkage, we pushed an
13447 implicit C++ linkage scope; exit that scope now. */
13450 /* We're done with this parameter list. */
13452 }
13454 /* Parse a type-specifier.
13456 type-specifier:
13457 simple-type-specifier
13458 class-specifier
13459 enum-specifier
13460 elaborated-type-specifier
13461 cv-qualifier
13463 GNU Extension:
13465 type-specifier:
13466 __complex__
13468 Returns a representation of the type-specifier. For a
13469 class-specifier, enum-specifier, or elaborated-type-specifier, a
13470 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
13472 The parser flags FLAGS is used to control type-specifier parsing.
13474 If IS_DECLARATION is TRUE, then this type-specifier is appearing
13475 in a decl-specifier-seq.
13477 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
13478 class-specifier, enum-specifier, or elaborated-type-specifier, then
13479 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
13480 if a type is declared; 2 if it is defined. Otherwise, it is set to
13481 zero.
13483 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
13484 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
13485 is set to FALSE. */
13487 static tree
13489 cp_parser_flags flags,
13494 {
13500 /* Assume this type-specifier does not declare a new type. */
13503 /* And that it does not specify a cv-qualifier. */
13506 /* Peek at the next token. */
13509 /* If we're looking at a keyword, we can use that to guide the
13510 production we choose. */
13513 {
13518 /* Look for the enum-specifier. */
13520 /* If that worked, we're done. */
13522 {
13527 type_spec,
13528 token,
13531 }
13532 else
13535 /* Any of these indicate either a class-specifier, or an
13536 elaborated-type-specifier. */
13543 /* Parse tentatively so that we can back up if we don't find a
13544 class-specifier. */
13546 /* Look for the class-specifier. */
13549 /* If that worked, we're done. */
13551 {
13556 type_spec,
13557 token,
13560 }
13562 /* Fall through. */
13563 elaborated_type_specifier:
13564 /* We're declaring (not defining) a class or enum. */
13568 /* Fall through. */
13570 /* Look for an elaborated-type-specifier. */
13571 type_spec
13572 = (cp_parser_elaborated_type_specifier
13575 is_declaration));
13578 type_spec,
13579 token,
13602 /* The `__complex__' keyword is a GNU extension. */
13608 }
13610 /* Handle simple keywords. */
13612 {
13614 {
13617 }
13619 }
13621 /* If we do not already have a type-specifier, assume we are looking
13622 at a simple-type-specifier. */
13624 decl_specs,
13625 flags);
13627 /* If we didn't find a type-specifier, and a type-specifier was not
13628 optional in this context, issue an error message. */
13630 {
13633 }
13636 }
13638 /* Parse a simple-type-specifier.
13640 simple-type-specifier:
13641 :: [opt] nested-name-specifier [opt] type-name
13642 :: [opt] nested-name-specifier template template-id
13643 char
13644 wchar_t
13645 bool
13646 short
13647 int
13648 long
13649 signed
13650 unsigned
13651 float
13652 double
13653 void
13655 C++0x Extension:
13657 simple-type-specifier:
13658 auto
13659 decltype ( expression )
13660 char16_t
13661 char32_t
13662 __underlying_type ( type-id )
13664 GNU Extension:
13666 simple-type-specifier:
13667 __int128
13668 __typeof__ unary-expression
13669 __typeof__ ( type-id )
13671 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
13672 appropriately updated. */
13674 static tree
13677 cp_parser_flags flags)
13678 {
13682 /* Peek at the next token. */
13685 /* If we're looking at a keyword, things are easy. */
13687 {
13750 /* Since DR 743, decltype can either be a simple-type-specifier by
13751 itself or begin a nested-name-specifier. Parsing it will replace
13752 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
13753 handling below decide what to do. */
13759 /* Consume the `typeof' token. */
13761 /* Parse the operand to `typeof'. */
13763 /* If it is not already a TYPE, take its type. */
13769 token,
13778 token,
13788 token,
13793 }
13795 /* If token is an already-parsed decltype not followed by ::,
13796 it's a simple-type-specifier. */
13799 {
13803 token,
13807 }
13809 /* If the type-specifier was for a built-in type, we're done. */
13811 {
13812 /* Record the type. */
13819 type,
13820 token,
13825 /* Consume the token. */
13828 /* There is no valid C++ program where a non-template type is
13829 followed by a "<". That usually indicates that the user thought
13830 that the type was a template. */
13835 }
13837 /* The type-specifier must be a user-defined type. */
13839 {
13843 /* Don't gobble tokens or issue error messages if this is an
13844 optional type-specifier. */
13848 /* Look for the optional `::' operator. */
13849 global_p
13853 /* Look for the nested-name specifier. */
13854 qualified_p
13862 /* If we have seen a nested-name-specifier, and the next token
13863 is `template', then we are using the template-id production. */
13866 {
13867 /* Look for the template-id. */
13871 none_type,
13873 /* If the template-id did not name a type, we are out of
13874 luck. */
13876 {
13879 }
13880 }
13881 /* Otherwise, look for a type-name. */
13882 else
13884 /* Keep track of all name-lookups performed in class scopes. */
13886 && !global_p
13887 && !qualified_p
13891 /* If it didn't work out, we don't have a TYPE. */
13897 token,
13899 }
13901 /* If we didn't get a type-name, issue an error message. */
13903 {
13906 }
13909 {
13910 /* See if TYPE is an Objective-C type, and if so, parse and
13911 accept any protocol references following it. Do this before
13912 the cp_parser_check_for_invalid_template_id() call, because
13913 Objective-C types can be followed by '<...>' which would
13914 enclose protocol names rather than template arguments, and so
13915 everything is fine. */
13918 {
13922 /* Clobber the "unqualified" type previously entered into
13923 DECL_SPECS with the new, improved protocol-qualified version. */
13928 }
13930 /* There is no valid C++ program where a non-template type is
13931 followed by a "<". That usually indicates that the user
13932 thought that the type was a template. */
13934 none_type,
13936 }
13939 }
13941 /* Parse a type-name.
13943 type-name:
13944 class-name
13945 enum-name
13946 typedef-name
13947 simple-template-id [in c++0x]
13949 enum-name:
13950 identifier
13952 typedef-name:
13953 identifier
13955 Returns a TYPE_DECL for the type. */
13957 static tree
13959 {
13960 tree type_decl;
13962 /* We can't know yet whether it is a class-name or not. */
13964 /* Try a class-name. */
13968 none_type,
13972 /* If it's not a class-name, keep looking. */
13974 {
13976 /* It must be a typedef-name or an enum-name. */
13980 /* It is either a simple-template-id representing an
13981 instantiation of an alias template... */
13985 none_type,
13987 /* Note that this must be an instantiation of an alias template
13988 because [temp.names]/6 says:
13990 A template-id that names an alias template specialization
13991 is a type-name.
13993 Whereas [temp.names]/7 says:
13995 A simple-template-id that names a class template
13996 specialization is a class-name. */
14001 else
14005 /* ... Or a typedef-name or an enum-name. */
14007 }
14010 }
14012 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
14014 enum-name:
14015 identifier
14017 typedef-name:
14018 identifier
14020 Returns a TYPE_DECL for the type. */
14022 static tree
14024 {
14025 tree type_decl;
14026 tree identifier;
14033 /* Look up the type-name. */
14037 {
14041 {
14042 /* We have found a type introduced by a using
14043 declaration at class scope that refers to a dependent
14044 type.
14046 using typename :: [opt] nested-name-specifier unqualified-id ;
14047 */
14053 }
14054 }
14058 {
14059 /* See if this is an Objective-C type. */
14064 }
14066 /* Issue an error if we did not find a type-name. */
14068 /* In Objective-C, we have the complication that class names are
14069 normally type names and start declarations (eg, the
14070 "NSObject" in "NSObject *object;"), but can be used in an
14071 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
14072 is an expression. So, a classname followed by a dot is not a
14073 valid type-name. */
14076 {
14081 }
14082 /* Remember that the name was used in the definition of the
14083 current class so that we can check later to see if the
14084 meaning would have been different after the class was
14085 entirely defined. */
14091 }
14093 /* Parse an elaborated-type-specifier. Note that the grammar given
14094 here incorporates the resolution to DR68.
14096 elaborated-type-specifier:
14097 class-key :: [opt] nested-name-specifier [opt] identifier
14098 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
14099 enum-key :: [opt] nested-name-specifier [opt] identifier
14100 typename :: [opt] nested-name-specifier identifier
14101 typename :: [opt] nested-name-specifier template [opt]
14102 template-id
14104 GNU extension:
14106 elaborated-type-specifier:
14107 class-key attributes :: [opt] nested-name-specifier [opt] identifier
14108 class-key attributes :: [opt] nested-name-specifier [opt]
14109 template [opt] template-id
14110 enum attributes :: [opt] nested-name-specifier [opt] identifier
14112 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
14113 declared `friend'. If IS_DECLARATION is TRUE, then this
14114 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
14115 something is being declared.
14117 Returns the TYPE specified. */
14119 static tree
14123 {
14125 tree identifier;
14128 tree globalscope;
14131 /* See if we're looking at the `enum' keyword. */
14133 {
14134 /* Consume the `enum' token. */
14136 /* Remember that it's an enumeration type. */
14138 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
14139 enums) is used here. */
14142 {
14146 /* Consume the `struct' or `class' and parse it anyway. */
14148 }
14149 /* Parse the attributes. */
14151 }
14152 /* Or, it might be `typename'. */
14154 RID_TYPENAME))
14155 {
14156 /* Consume the `typename' token. */
14158 /* Remember that it's a `typename' type. */
14160 }
14161 /* Otherwise it must be a class-key. */
14162 else
14163 {
14167 /* Parse the attributes. */
14169 }
14171 /* Look for the `::' operator. */
14174 /* Look for the nested-name-specifier. */
14176 {
14181 is_declaration))
14183 }
14184 else
14185 /* Even though `typename' is not present, the proposed resolution
14186 to Core Issue 180 says that in `class A<T>::B', `B' should be
14187 considered a type-name, even if `A<T>' is dependent. */
14192 is_declaration);
14193 /* For everything but enumeration types, consider a template-id.
14194 For an enumeration type, consider only a plain identifier. */
14196 {
14198 tree decl;
14200 /* Allow the `template' keyword. */
14202 /* If we didn't see `template', we don't know if there's a
14203 template-id or not. */
14206 /* Parse the template-id. */
14210 tag_type,
14211 is_declaration);
14212 /* If we didn't find a template-id, look for an ordinary
14213 identifier. */
14215 ;
14216 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
14217 in effect, then we must assume that, upon instantiation, the
14218 template will correspond to a class. */
14222 typename_type,
14224 /* If the `typename' keyword is in effect and DECL is not a type
14225 decl. Then type is non existant. */
14228 else
14231 }
14234 {
14239 {
14242 }
14244 /* For a `typename', we needn't call xref_tag. */
14248 identifier,
14250 /* Look up a qualified name in the usual way. */
14252 {
14253 tree decl;
14254 tree ambiguous_decls;
14257 tag_type,
14264 /* If the lookup was ambiguous, an error will already have been
14265 issued. */
14269 /* If we are parsing friend declaration, DECL may be a
14270 TEMPLATE_DECL tree node here. However, we need to check
14271 whether this TEMPLATE_DECL results in valid code. Consider
14272 the following example:
14274 namespace N {
14275 template <class T> class C {};
14276 }
14277 class X {
14278 template <class T> friend class N::C; // #1, valid code
14279 };
14280 template <class T> class Y {
14281 friend class N::C; // #2, invalid code
14282 };
14284 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
14285 name lookup of `N::C'. We see that friend declaration must
14286 be template for the code to be valid. Note that
14287 processing_template_decl does not work here since it is
14288 always 1 for the above two cases. */
14290 decl = (cp_parser_maybe_treat_template_as_class
14295 {
14298 identifier,
14301 }
14304 {
14308 allow_template);
14312 }
14314 /* Forward declarations of nested types, such as
14316 class C1::C2;
14317 class C1::C2::C3;
14319 are invalid unless all components preceding the final '::'
14320 are complete. If all enclosing types are complete, these
14321 declarations become merely pointless.
14323 Invalid forward declarations of nested types are errors
14324 caught elsewhere in parsing. Those that are pointless arrive
14325 here. */
14332 }
14333 else
14334 {
14335 /* An elaborated-type-specifier sometimes introduces a new type and
14336 sometimes names an existing type. Normally, the rule is that it
14337 introduces a new type only if there is not an existing type of
14338 the same name already in scope. For example, given:
14340 struct S {};
14341 void f() { struct S s; }
14343 the `struct S' in the body of `f' is the same `struct S' as in
14344 the global scope; the existing definition is used. However, if
14345 there were no global declaration, this would introduce a new
14346 local class named `S'.
14348 An exception to this rule applies to the following code:
14350 namespace N { struct S; }
14352 Here, the elaborated-type-specifier names a new type
14353 unconditionally; even if there is already an `S' in the
14354 containing scope this declaration names a new type.
14355 This exception only applies if the elaborated-type-specifier
14356 forms the complete declaration:
14358 [class.name]
14360 A declaration consisting solely of `class-key identifier ;' is
14361 either a redeclaration of the name in the current scope or a
14362 forward declaration of the identifier as a class name. It
14363 introduces the name into the current scope.
14365 We are in this situation precisely when the next token is a `;'.
14367 An exception to the exception is that a `friend' declaration does
14368 *not* name a new type; i.e., given:
14370 struct S { friend struct T; };
14372 `T' is not a new type in the scope of `S'.
14374 Also, `new struct S' or `sizeof (struct S)' never results in the
14375 definition of a new type; a new type can only be declared in a
14376 declaration context. */
14378 tag_scope ts;
14382 /* Friends have special name lookup rules. */
14386 CPP_SEMICOLON))
14387 /* This is a `class-key identifier ;' */
14389 else
14392 template_p =
14396 /* An unqualified name was used to reference this type, so
14397 there were no qualifying templates. */
14404 }
14405 }
14410 /* Allow attributes on forward declarations of classes. */
14412 {
14422 else
14425 }
14428 {
14429 /* Indicate whether this class was declared as a `class' or as a
14430 `struct'. */
14434 }
14436 /* A "<" cannot follow an elaborated type specifier. If that
14437 happens, the user was probably trying to form a template-id. */
14442 }
14444 /* Parse an enum-specifier.
14446 enum-specifier:
14447 enum-head { enumerator-list [opt] }
14448 enum-head { enumerator-list , } [C++0x]
14450 enum-head:
14451 enum-key identifier [opt] enum-base [opt]
14452 enum-key nested-name-specifier identifier enum-base [opt]
14454 enum-key:
14455 enum
14456 enum class [C++0x]
14457 enum struct [C++0x]
14459 enum-base: [C++0x]
14460 : type-specifier-seq
14462 opaque-enum-specifier:
14463 enum-key identifier enum-base [opt] ;
14465 GNU Extensions:
14466 enum-key attributes[opt] identifier [opt] enum-base [opt]
14467 { enumerator-list [opt] }attributes[opt]
14468 enum-key attributes[opt] identifier [opt] enum-base [opt]
14469 { enumerator-list, }attributes[opt] [C++0x]
14471 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
14472 if the token stream isn't an enum-specifier after all. */
14474 static tree
14476 {
14477 tree identifier;
14479 tree prev_scope;
14481 tree attributes;
14494 /* Parse tentatively so that we can back up if we don't find a
14495 enum-specifier. */
14498 /* Caller guarantees that the current token is 'enum', an identifier
14499 possibly follows, and the token after that is an opening brace.
14500 If we don't have an identifier, fabricate an anonymous name for
14501 the enumeration being defined. */
14504 /* Parse the "class" or "struct", which indicates a scoped
14505 enumeration type in C++0x. */
14508 {
14512 /* Consume the `struct' or `class' token. */
14516 }
14520 /* Clear the qualification. */
14525 /* Figure out in what scope the declaration is being placed. */
14531 nested_name_specifier
14539 {
14540 tree name;
14544 enum_type,
14549 input_location);
14551 {
14554 {
14555 /* Are template enums allowed in ISO? */
14559 /* ignore a typename reference, for it will be solved by name
14560 in start_enum. */
14562 }
14563 }
14564 else
14567 }
14568 else
14569 {
14572 else
14573 {
14576 }
14577 }
14580 /* Check for the `:' that denotes a specified underlying type in C++0x.
14581 Note that a ':' could also indicate a bitfield width, however. */
14583 {
14584 cp_decl_specifier_seq type_specifiers;
14586 /* Consume the `:'. */
14589 /* Parse the type-specifier-seq. */
14594 /* At this point this is surely not elaborated type specifier. */
14603 /* If that didn't work, stop. */
14605 {
14610 }
14611 }
14613 /* Look for the `{' but don't consume it yet. */
14615 {
14617 {
14620 {
14623 }
14624 }
14625 /* An opaque-enum-specifier must have a ';' here. */
14628 {
14631 {
14634 }
14635 }
14636 }
14642 {
14644 {
14648 }
14650 {
14652 }
14653 }
14655 /* Issue an error message if type-definitions are forbidden here. */
14658 else
14659 /* Create the new type. We do this before consuming the opening
14660 brace so the enum will be recorded as being on the line of its
14661 tag (or the 'enum' keyword, if there is no tag). */
14665 /* If the next token is not '{' it is an opaque-enum-specifier or an
14666 elaborated-type-specifier. */
14668 {
14671 {
14672 /* The following catches invalid code such as:
14673 enum class S<int>::E { A, B, C }; */
14680 /* If that scope does not contain the scope in which the
14681 class was originally declared, the program is invalid. */
14683 {
14686 "declaration of %qD in namespace %qD which does not "
14689 else
14694 }
14695 }
14700 /* Consume the opening brace. */
14707 {
14711 }
14712 else
14713 {
14718 }
14722 /* If the next token is not '}', then there are some enumerators. */
14726 /* Consume the final '}'. */
14732 }
14733 else
14734 {
14735 /* If a ';' follows, then it is an opaque-enum-specifier
14736 and additional restrictions apply. */
14738 {
14745 }
14746 }
14748 /* Look for trailing attributes to apply to this enumeration, and
14749 apply them if appropriate. */
14751 {
14755 trailing_attr,
14757 }
14759 /* Finish up the enumeration. */
14761 {
14766 }
14769 {
14771 {
14774 }
14776 {
14778 }
14779 }
14780 out:
14783 }
14785 /* Parse an enumerator-list. The enumerators all have the indicated
14786 TYPE.
14788 enumerator-list:
14789 enumerator-definition
14790 enumerator-list , enumerator-definition */
14792 static void
14794 {
14796 {
14797 /* Parse an enumerator-definition. */
14800 /* If the next token is not a ',', we've reached the end of
14801 the list. */
14804 /* Otherwise, consume the `,' and keep going. */
14806 /* If the next token is a `}', there is a trailing comma. */
14808 {
14813 }
14814 }
14815 }
14817 /* Parse an enumerator-definition. The enumerator has the indicated
14818 TYPE.
14820 enumerator-definition:
14821 enumerator
14822 enumerator = constant-expression
14824 enumerator:
14825 identifier */
14827 static void
14829 {
14830 tree identifier;
14831 tree value;
14832 location_t loc;
14834 /* Save the input location because we are interested in the location
14835 of the identifier and not the location of the explicit value. */
14838 /* Look for the identifier. */
14843 /* If the next token is an '=', then there is an explicit value. */
14845 {
14846 /* Consume the `=' token. */
14848 /* Parse the value. */
14851 NULL);
14852 }
14853 else
14856 /* If we are processing a template, make sure the initializer of the
14857 enumerator doesn't contain any bare template parameter pack. */
14861 /* integral_constant_value will pull out this expression, so make sure
14862 it's folded as appropriate. */
14865 /* Create the enumerator. */
14867 }
14869 /* Parse a namespace-name.
14871 namespace-name:
14872 original-namespace-name
14873 namespace-alias
14875 Returns the NAMESPACE_DECL for the namespace. */
14877 static tree
14879 {
14880 tree identifier;
14881 tree namespace_decl;
14885 /* Get the name of the namespace. */
14890 /* Look up the identifier in the currently active scope. Look only
14891 for namespaces, due to:
14893 [basic.lookup.udir]
14895 When looking up a namespace-name in a using-directive or alias
14896 definition, only namespace names are considered.
14898 And:
14900 [basic.lookup.qual]
14902 During the lookup of a name preceding the :: scope resolution
14903 operator, object, function, and enumerator names are ignored.
14905 (Note that cp_parser_qualifying_entity only calls this
14906 function if the token after the name is the scope resolution
14907 operator.) */
14909 none_type,
14915 /* If it's not a namespace, issue an error. */
14918 {
14923 }
14926 }
14928 /* Parse a namespace-definition.
14930 namespace-definition:
14931 named-namespace-definition
14932 unnamed-namespace-definition
14934 named-namespace-definition:
14935 original-namespace-definition
14936 extension-namespace-definition
14938 original-namespace-definition:
14939 namespace identifier { namespace-body }
14941 extension-namespace-definition:
14942 namespace original-namespace-name { namespace-body }
14944 unnamed-namespace-definition:
14945 namespace { namespace-body } */
14947 static void
14949 {
14955 {
14959 }
14960 else
14963 /* Look for the `namespace' keyword. */
14966 /* Get the name of the namespace. We do not attempt to distinguish
14967 between an original-namespace-definition and an
14968 extension-namespace-definition at this point. The semantic
14969 analysis routines are responsible for that. */
14972 else
14975 /* Parse any specified attributes. */
14978 /* Look for the `{' to start the namespace. */
14980 /* Start the namespace. */
14983 /* "inline namespace" is equivalent to a stub namespace definition
14984 followed by a strong using directive. */
14986 {
14988 /* Set up namespace association. */
14992 /* Import the contents of the inline namespace. */
14996 }
15000 /* Parse the body of the namespace. */
15006 /* Finish the namespace. */
15008 /* Look for the final `}'. */
15010 }
15012 /* Parse a namespace-body.
15014 namespace-body:
15015 declaration-seq [opt] */
15017 static void
15019 {
15021 }
15023 /* Parse a namespace-alias-definition.
15025 namespace-alias-definition:
15026 namespace identifier = qualified-namespace-specifier ; */
15028 static void
15030 {
15031 tree identifier;
15032 tree namespace_specifier;
15036 /* Look for the `namespace' keyword. */
15038 /* Look for the identifier. */
15042 /* Look for the `=' token. */
15045 {
15047 /* Skip the definition. */
15052 }
15054 /* Look for the qualified-namespace-specifier. */
15055 namespace_specifier
15057 /* Look for the `;' token. */
15060 /* Register the alias in the symbol table. */
15062 }
15064 /* Parse a qualified-namespace-specifier.
15066 qualified-namespace-specifier:
15067 :: [opt] nested-name-specifier [opt] namespace-name
15069 Returns a NAMESPACE_DECL corresponding to the specified
15070 namespace. */
15072 static tree
15074 {
15075 /* Look for the optional `::'. */
15079 /* Look for the optional nested-name-specifier. */
15087 }
15089 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
15090 access declaration.
15092 using-declaration:
15093 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
15094 using :: unqualified-id ;
15096 access-declaration:
15097 qualified-id ;
15099 */
15101 static bool
15104 {
15108 tree decl;
15109 tree identifier;
15110 tree qscope;
15115 {
15118 }
15119 else
15120 {
15121 /* Look for the `using' keyword. */
15124 /* Peek at the next token. */
15126 /* See if it's `typename'. */
15128 {
15129 /* Remember that we've seen it. */
15131 /* Consume the `typename' token. */
15133 }
15134 }
15136 /* Look for the optional global scope qualification. */
15137 global_scope_p
15142 /* If we saw `typename', or didn't see `::', then there must be a
15143 nested-name-specifier present. */
15149 /* Otherwise, we could be in either of the two productions. In that
15150 case, treat the nested-name-specifier as optional. */
15151 else
15161 /* Something has already gone wrong; there's no need to parse
15162 further. Since an error has occurred, the return value of
15163 cp_parser_parse_definitely will be false, as required. */
15167 /* Parse the unqualified-id. */
15175 {
15180 }
15182 /* The function we call to handle a using-declaration is different
15183 depending on what scope we are in. */
15185 ;
15188 /* [namespace.udecl]
15190 A using declaration shall not name a template-id. */
15193 else
15194 {
15196 {
15197 /* Create the USING_DECL. */
15205 else
15206 /* Add it to the list of members in this class. */
15208 }
15209 else
15210 {
15212 identifier,
15222 else
15224 }
15225 }
15227 /* Look for the final `;'. */
15232 "access declarations are deprecated "
15233 "in favour of using-declarations; "
15237 }
15239 /* Parse an alias-declaration.
15241 alias-declaration:
15242 using identifier attribute-specifier-seq [opt] = type-id */
15244 static tree
15246 {
15248 location_t id_location;
15250 cp_decl_specifier_seq decl_specs;
15254 /* Look for the `using' keyword. */
15255 cp_token *using_token
15275 /* Now we are going to parse the type-id of the declaration. */
15277 /*
15278 [dcl.type]/3 says:
15280 "A type-specifier-seq shall not define a class or enumeration
15281 unless it appears in the type-id of an alias-declaration (7.1.3) that
15282 is not the declaration of a template-declaration."
15284 In other words, if we currently are in an alias template, the
15285 type-id should not define a type.
15287 So let's set parser->type_definition_forbidden_message in that
15288 case; cp_parser_check_type_definition (called by
15289 cp_parser_class_specifier) will then emit an error if a type is
15290 defined in the type-id. */
15292 {
15296 }
15300 /* Restore the error message if need be. */
15309 /* A typedef-name can also be introduced by an alias-declaration. The
15310 identifier following the using keyword becomes a typedef-name. It has
15311 the same semantics as if it were introduced by the typedef
15312 specifier. In particular, it does not define a new type and it shall
15313 not appear in the type-id. */
15318 {
15321 ds_attribute,
15322 attrs_token);
15323 }
15325 ds_typedef,
15326 using_token);
15328 ds_alias,
15329 using_token);
15338 else
15349 /* If decl is a template, return its TEMPLATE_DECL so that it gets
15350 added into the symbol table; otherwise, return the TYPE_DECL. */
15354 {
15358 }
15361 }
15363 /* Parse a using-directive.
15365 using-directive:
15366 using namespace :: [opt] nested-name-specifier [opt]
15367 namespace-name ; */
15369 static void
15371 {
15372 tree namespace_decl;
15373 tree attribs;
15375 /* Look for the `using' keyword. */
15377 /* And the `namespace' keyword. */
15379 /* Look for the optional `::' operator. */
15381 /* And the optional nested-name-specifier. */
15387 /* Get the namespace being used. */
15389 /* And any specified attributes. */
15391 /* Update the symbol table. */
15393 /* Look for the final `;'. */
15395 }
15397 /* Parse an asm-definition.
15399 asm-definition:
15400 asm ( string-literal ) ;
15402 GNU Extension:
15404 asm-definition:
15405 asm volatile [opt] ( string-literal ) ;
15406 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
15407 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15408 : asm-operand-list [opt] ) ;
15409 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15410 : asm-operand-list [opt]
15411 : asm-clobber-list [opt] ) ;
15412 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
15413 : asm-clobber-list [opt]
15414 : asm-goto-list ) ; */
15416 static void
15418 {
15419 tree string;
15424 tree asm_stmt;
15432 /* Look for the `asm' keyword. */
15434 /* See if the next token is `volatile'. */
15437 {
15438 /* Remember that we saw the `volatile' keyword. */
15440 /* Consume the token. */
15442 }
15446 {
15447 /* Remember that we saw the `goto' keyword. */
15449 /* Consume the token. */
15451 }
15452 /* Look for the opening `('. */
15455 /* Look for the string. */
15458 {
15462 }
15464 /* If we're allowing GNU extensions, check for the extended assembly
15465 syntax. Unfortunately, the `:' tokens need not be separated by
15466 a space in C, and so, for compatibility, we tolerate that here
15467 too. Doing that means that we have to treat the `::' operator as
15468 two `:' tokens. */
15473 {
15478 /* The extended syntax was used. */
15481 /* Look for outputs. */
15483 {
15484 /* Consume the `:'. */
15486 /* Parse the output-operands. */
15488 CPP_COLON)
15490 CPP_SCOPE)
15492 CPP_CLOSE_PAREN)
15498 }
15499 /* If the next token is `::', there are no outputs, and the
15500 next token is the beginning of the inputs. */
15502 /* The inputs are coming next. */
15505 /* Look for inputs. */
15508 {
15509 /* Consume the `:' or `::'. */
15511 /* Parse the output-operands. */
15513 CPP_COLON)
15515 CPP_SCOPE)
15517 CPP_CLOSE_PAREN))
15522 }
15524 /* The clobbers are coming next. */
15527 /* Look for clobbers. */
15530 {
15532 /* Consume the `:' or `::'. */
15534 /* Parse the clobbers. */
15536 CPP_COLON)
15538 CPP_CLOSE_PAREN))
15540 }
15543 /* The labels are coming next. */
15546 /* Look for labels. */
15549 {
15551 /* Consume the `:' or `::'. */
15553 /* Parse the labels. */
15555 }
15559 }
15563 /* Look for the closing `)'. */
15571 {
15572 /* Create the ASM_EXPR. */
15574 {
15577 /* If the extended syntax was not used, mark the ASM_EXPR. */
15579 {
15585 }
15586 }
15587 else
15589 }
15590 }
15592 /* Declarators [gram.dcl.decl] */
15594 /* Parse an init-declarator.
15596 init-declarator:
15597 declarator initializer [opt]
15599 GNU Extension:
15601 init-declarator:
15602 declarator asm-specification [opt] attributes [opt] initializer [opt]
15604 function-definition:
15605 decl-specifier-seq [opt] declarator ctor-initializer [opt]
15606 function-body
15607 decl-specifier-seq [opt] declarator function-try-block
15609 GNU Extension:
15611 function-definition:
15612 __extension__ function-definition
15614 TM Extension:
15616 function-definition:
15617 decl-specifier-seq [opt] declarator function-transaction-block
15619 The DECL_SPECIFIERS apply to this declarator. Returns a
15620 representation of the entity declared. If MEMBER_P is TRUE, then
15621 this declarator appears in a class scope. The new DECL created by
15622 this declarator is returned.
15624 The CHECKS are access checks that should be performed once we know
15625 what entity is being declared (and, therefore, what classes have
15626 befriended it).
15628 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
15629 for a function-definition here as well. If the declarator is a
15630 declarator for a function-definition, *FUNCTION_DEFINITION_P will
15631 be TRUE upon return. By that point, the function-definition will
15632 have been completely parsed.
15634 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
15635 is FALSE.
15637 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15638 parsed declaration if it is an uninitialized single declarator not followed
15639 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15640 if present, will not be consumed. If returned, this declarator will be
15641 created with SD_INITIALIZED but will not call cp_finish_decl. */
15643 static tree
15652 {
15656 tree prefix_attributes;
15658 tree asm_specification;
15659 tree initializer;
15661 tree scope;
15663 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
15664 initialized with "= ..", CPP_OPEN_PAREN if initialized with
15665 "(...)". */
15674 /* Gather the attributes that were provided with the
15675 decl-specifiers. */
15678 /* Assume that this is not the declarator for a function
15679 definition. */
15683 /* Defer access checks while parsing the declarator; we cannot know
15684 what names are accessible until we know what is being
15685 declared. */
15688 /* Parse the declarator. */
15690 declarator
15694 member_p);
15695 /* Gather up the deferred checks. */
15698 /* If the DECLARATOR was erroneous, there's no need to go
15699 further. */
15703 /* Check that the number of template-parameter-lists is OK. */
15713 /* Figure out what scope the entity declared by the DECLARATOR is
15714 located in. `grokdeclarator' sometimes changes the scope, so
15715 we compute it now. */
15718 /* Perform any lookups in the declared type which were thought to be
15719 dependent, but are not in the scope of the declarator. */
15720 decl_specifiers->type
15723 /* If we're allowing GNU extensions, look for an
15724 asm-specification. */
15726 {
15727 /* Look for an asm-specification. */
15730 }
15731 else
15734 /* Look for attributes. */
15738 /* Peek at the next token. */
15740 /* Check to see if the token indicates the start of a
15741 function-definition. */
15744 {
15746 {
15747 /* If a function-definition should not appear here, issue an
15748 error message. */
15752 }
15753 else
15754 {
15755 location_t func_brace_location
15758 /* Neither attributes nor an asm-specification are allowed
15759 on a function-definition. */
15762 "an asm-specification is not allowed "
15767 /* This is a function-definition. */
15770 /* Parse the function definition. */
15773 decl_specifiers,
15774 declarator,
15775 prefix_attributes);
15776 else
15777 decl
15778 = (cp_parser_function_definition_from_specifiers_and_declarator
15782 {
15783 /* This is where the prologue starts... */
15786 }
15789 }
15790 }
15792 /* [dcl.dcl]
15794 Only in function declarations for constructors, destructors, and
15795 type conversions can the decl-specifier-seq be omitted.
15797 We explicitly postpone this check past the point where we handle
15798 function-definitions because we tolerate function-definitions
15799 that are missing their return types in some modes. */
15801 {
15805 }
15807 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
15811 {
15819 {
15825 }
15826 }
15827 else
15828 {
15829 /* If the init-declarator isn't initialized and isn't followed by a
15830 `,' or `;', it's not a valid init-declarator. */
15833 {
15836 else
15837 {
15840 }
15841 }
15844 }
15846 /* Because start_decl has side-effects, we should only call it if we
15847 know we're going ahead. By this point, we know that we cannot
15848 possibly be looking at any other construct. */
15851 /* If the decl specifiers were bad, issue an error now that we're
15852 sure this was intended to be a declarator. Then continue
15853 declaring the variable(s), as int, to try to cut down on further
15854 errors. */
15857 {
15860 }
15862 /* Check to see whether or not this declaration is a friend. */
15865 /* Enter the newly declared entry in the symbol table. If we're
15866 processing a declaration in a class-specifier, we wait until
15867 after processing the initializer. */
15869 {
15876 /* Adjust location of decl if declarator->id_loc is more appropriate:
15877 set, and decl wasn't merged with another decl, in which case its
15878 location would be different from input_location, and more accurate. */
15883 }
15885 /* Enter the SCOPE. That way unqualified names appearing in the
15886 initializer will be looked up in SCOPE. */
15889 /* Perform deferred access control checks, now that we know in which
15890 SCOPE the declared entity resides. */
15892 {
15895 /* If the entity being declared is a function, pretend that we
15896 are in its scope. If it is a `friend', it may have access to
15897 things that would not otherwise be accessible. */
15899 {
15902 }
15904 /* Perform access checks for template parameters. */
15907 /* Perform the access control checks for the declarator and the
15908 decl-specifiers. */
15911 /* Restore the saved value. */
15914 }
15916 /* Parse the initializer. */
15921 {
15923 {
15927 else
15928 {
15929 /* If the declaration was erroneous, we don't really
15930 know what the user intended, so just silently
15931 consume the initializer. */
15939 }
15940 }
15941 else
15942 {
15943 /* We want to record the extra mangling scope for in-class
15944 initializers of class members and initializers of static data
15945 member templates. The former involves deferring
15946 parsing of the initializer until end of class as with default
15947 arguments. So right here we only handle the latter. */
15957 }
15958 }
15960 /* The old parser allows attributes to appear after a parenthesized
15961 initializer. Mark Mitchell proposed removing this functionality
15962 on the GCC mailing lists on 2002-08-13. This parser accepts the
15963 attributes -- but ignores them. */
15970 /* For an in-class declaration, use `grokfield' to create the
15971 declaration. */
15973 {
15975 {
15978 }
15982 prefix_attributes);
15985 }
15987 /* Finish processing the declaration. But, skip member
15988 declarations. */
15990 {
15993 asm_specification,
15994 /* If the initializer is in parentheses, then this is
15995 a direct-initialization, which means that an
15996 `explicit' constructor is OK. Otherwise, an
15997 `explicit' constructor cannot be used. */
16000 }
16003 /* Core issue #226 (C++0x only): A default template-argument
16004 shall not be specified in a friend class template
16005 declaration. */
16013 }
16015 /* Parse a declarator.
16017 declarator:
16018 direct-declarator
16019 ptr-operator declarator
16021 abstract-declarator:
16022 ptr-operator abstract-declarator [opt]
16023 direct-abstract-declarator
16025 GNU Extensions:
16027 declarator:
16028 attributes [opt] direct-declarator
16029 attributes [opt] ptr-operator declarator
16031 abstract-declarator:
16032 attributes [opt] ptr-operator abstract-declarator [opt]
16033 attributes [opt] direct-abstract-declarator
16035 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
16036 detect constructor, destructor or conversion operators. It is set
16037 to -1 if the declarator is a name, and +1 if it is a
16038 function. Otherwise it is set to zero. Usually you just want to
16039 test for >0, but internally the negative value is used.
16041 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
16042 a decl-specifier-seq unless it declares a constructor, destructor,
16043 or conversion. It might seem that we could check this condition in
16044 semantic analysis, rather than parsing, but that makes it difficult
16045 to handle something like `f()'. We want to notice that there are
16046 no decl-specifiers, and therefore realize that this is an
16047 expression, not a declaration.)
16049 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
16050 the declarator is a direct-declarator of the form "(...)".
16052 MEMBER_P is true iff this declarator is a member-declarator. */
16056 cp_parser_declarator_kind dcl_kind,
16060 {
16063 cp_cv_quals cv_quals;
16064 tree class_type;
16067 /* Assume this is not a constructor, destructor, or type-conversion
16068 operator. */
16075 /* Check for the ptr-operator production. */
16077 /* Parse the ptr-operator. */
16083 /* If that worked, then we have a ptr-operator. */
16085 {
16086 /* If a ptr-operator was found, then this declarator was not
16087 parenthesized. */
16090 /* The dependent declarator is optional if we are parsing an
16091 abstract-declarator. */
16095 /* Parse the dependent declarator. */
16101 /* If we are parsing an abstract-declarator, we must handle the
16102 case where the dependent declarator is absent. */
16107 declarator = cp_parser_make_indirect_declarator
16109 }
16110 /* Everything else is a direct-declarator. */
16111 else
16112 {
16115 CPP_OPEN_PAREN);
16117 ctor_dtor_or_conv_p,
16118 member_p);
16119 }
16124 }
16126 /* Parse a direct-declarator or direct-abstract-declarator.
16128 direct-declarator:
16129 declarator-id
16130 direct-declarator ( parameter-declaration-clause )
16131 cv-qualifier-seq [opt]
16132 exception-specification [opt]
16133 direct-declarator [ constant-expression [opt] ]
16134 ( declarator )
16136 direct-abstract-declarator:
16137 direct-abstract-declarator [opt]
16138 ( parameter-declaration-clause )
16139 cv-qualifier-seq [opt]
16140 exception-specification [opt]
16141 direct-abstract-declarator [opt] [ constant-expression [opt] ]
16142 ( abstract-declarator )
16144 Returns a representation of the declarator. DCL_KIND is
16145 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
16146 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
16147 we are parsing a direct-declarator. It is
16148 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
16149 of ambiguity we prefer an abstract declarator, as per
16150 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
16151 cp_parser_declarator. */
16155 cp_parser_declarator_kind dcl_kind,
16158 {
16168 {
16169 /* Peek at the next token. */
16172 {
16173 /* This is either a parameter-declaration-clause, or a
16174 parenthesized declarator. When we know we are parsing a
16175 named declarator, it must be a parenthesized declarator
16176 if FIRST is true. For instance, `(int)' is a
16177 parameter-declaration-clause, with an omitted
16178 direct-abstract-declarator. But `((*))', is a
16179 parenthesized abstract declarator. Finally, when T is a
16180 template parameter `(T)' is a
16181 parameter-declaration-clause, and not a parenthesized
16182 named declarator.
16184 We first try and parse a parameter-declaration-clause,
16185 and then try a nested declarator (if FIRST is true).
16187 It is not an error for it not to be a
16188 parameter-declaration-clause, even when FIRST is
16189 false. Consider,
16191 int i (int);
16192 int i (3);
16194 The first is the declaration of a function while the
16195 second is the definition of a variable, including its
16196 initializer.
16198 Having seen only the parenthesis, we cannot know which of
16199 these two alternatives should be selected. Even more
16200 complex are examples like:
16202 int i (int (a));
16203 int i (int (3));
16205 The former is a function-declaration; the latter is a
16206 variable initialization.
16208 Thus again, we try a parameter-declaration-clause, and if
16209 that fails, we back out and return. */
16212 {
16213 tree params;
16216 tree t;
16218 /* In a member-declarator, the only valid interpretation
16219 of a parenthesis is the start of a
16220 parameter-declaration-clause. (It is invalid to
16221 initialize a static data member with a parenthesized
16222 initializer; only the "=" form of initialization is
16223 permitted.) */
16227 /* Consume the `('. */
16230 {
16231 /* If this is going to be an abstract declarator, we're
16232 in a declarator and we can't have default args. */
16235 }
16237 /* Inside the function parameter list, surrounding
16238 template-parameter-lists do not apply. */
16239 saved_num_template_parameter_lists
16245 /* Parse the parameter-declaration-clause. */
16248 parser->num_template_parameter_lists
16251 /* Consume the `)'. */
16254 /* If all went well, parse the cv-qualifier-seq and the
16255 exception-specification. */
16257 {
16258 cp_cv_quals cv_quals;
16259 cp_virt_specifiers virt_specifiers;
16260 tree exception_specification;
16261 tree late_return;
16262 tree attrs;
16270 /* Parse the cv-qualifier-seq. */
16272 /* And the exception-specification. */
16273 exception_specification
16278 late_return = (cp_parser_late_return_type_opt
16281 /* Parse the virt-specifier-seq. */
16284 /* Create the function-declarator. */
16286 params,
16287 cv_quals,
16288 virt_specifiers,
16289 exception_specification,
16290 late_return);
16292 /* Any subsequent parameter lists are to do with
16293 return type, so are not those of the declared
16294 function. */
16296 }
16298 /* Remove the function parms from scope. */
16304 /* Repeat the main loop. */
16306 }
16308 /* If this is the first, we can try a parenthesized
16309 declarator. */
16311 {
16317 /* Consume the `('. */
16319 /* Parse the nested declarator. */
16322 declarator
16325 member_p);
16328 /* Expect a `)'. */
16335 }
16336 /* Otherwise, we must be done. */
16337 else
16339 }
16343 {
16344 /* Parse an array-declarator. */
16353 /* Consume the `['. */
16355 /* Peek at the next token. */
16357 /* If the next token is `]', then there is no
16358 constant-expression. */
16360 {
16363 bounds
16373 {
16374 /* Normally, the array bound must be an integral constant
16375 expression. However, as an extension, we allow VLAs
16376 in function scopes as long as they aren't part of a
16377 parameter declaration. */
16381 }
16383 {
16384 /* Remember this wasn't a constant-expression. */
16387 }
16388 }
16389 else
16391 /* Look for the closing `]'. */
16393 {
16396 }
16401 }
16403 {
16404 {
16405 tree qualifying_scope;
16406 tree unqualified_name;
16407 tree attrs;
16408 special_function_kind sfk;
16413 /* Parse a declarator-id */
16416 {
16419 /* If we see an ellipsis, we should be looking at a
16420 parameter pack. */
16422 {
16423 /* Consume the `...' */
16427 }
16428 }
16431 unqualified_name
16435 {
16439 {
16440 /* Check whether an error occurred. */
16443 /* We already consumed the ellipsis to mark a
16444 parameter pack, but we have no way to report it,
16445 so abort the tentative parse. We will be exiting
16446 immediately anyway. */
16448 }
16449 else
16455 && (qualifying_scope
16458 {
16461 }
16462 }
16467 {
16472 }
16478 {
16479 /* In the declaration of a member of a template class
16480 outside of the class itself, the SCOPE will sometimes
16481 be a TYPENAME_TYPE. For example, given:
16483 template <typename T>
16484 int S<T>::R::i = 3;
16486 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
16487 this context, we must resolve S<T>::R to an ordinary
16488 type, rather than a typename type.
16490 The reason we normally avoid resolving TYPENAME_TYPEs
16491 is that a specialization of `S' might render
16492 `S<T>::R' not a type. However, if `S' is
16493 specialized, then this `i' will not be used, so there
16494 is no harm in resolving the types here. */
16495 tree type;
16497 /* Resolve the TYPENAME_TYPE. */
16500 /* If that failed, the declarator is invalid. */
16502 {
16505 "cannot define member of dependent typedef "
16507 else
16512 }
16514 }
16519 {
16520 tree class_type;
16525 else
16529 {
16532 {
16535 {
16539 "use %<%T::%D%> instead of %<%T::%D%> to "
16541 class_type,
16546 }
16547 else
16549 }
16550 else
16551 {
16552 /* We do not attempt to print the declarator
16553 here because we do not have enough
16554 information about its original syntactic
16555 form. */
16559 }
16560 }
16563 {
16569 for an anonymous type, even if the type
16570 got a name for linkage purposes. */
16573 class_type))
16574 {
16577 }
16585 }
16586 }
16588 unqualified_name,
16589 sfk);
16596 }
16598 handle_declarator:;
16601 /* Any names that appear after the declarator-id for a
16602 member are looked up in the containing scope. */
16607 /* Default args are only allowed on function
16608 declarations. */
16610 else
16614 }
16615 /* We're done. */
16616 else
16618 }
16620 /* For an abstract declarator, we might wind up with nothing at this
16621 point. That's an error; the declarator is not optional. */
16625 /* If we entered a scope, we must exit it now. */
16633 }
16635 /* Parse a ptr-operator.
16637 ptr-operator:
16638 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
16639 * cv-qualifier-seq [opt]
16640 &
16641 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
16642 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
16644 GNU Extension:
16646 ptr-operator:
16647 & cv-qualifier-seq [opt]
16649 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
16650 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
16651 an rvalue reference. In the case of a pointer-to-member, *TYPE is
16652 filled in with the TYPE containing the member. *CV_QUALS is
16653 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
16654 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
16655 Note that the tree codes returned by this function have nothing
16656 to do with the types of trees that will be eventually be created
16657 to represent the pointer or reference type being parsed. They are
16658 just constants with suggestive names. */
16659 static enum tree_code
16664 {
16669 /* Assume that it's not a pointer-to-member. */
16671 /* And that there are no cv-qualifiers. */
16674 /* Peek at the next token. */
16677 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
16687 {
16688 /* Consume the `*', `&' or `&&'. */
16691 /* A `*' can be followed by a cv-qualifier-seq, and so can a
16692 `&', if we are allowing GNU extensions. (The only qualifier
16693 that can legally appear after `&' is `restrict', but that is
16694 enforced during semantic analysis. */
16702 }
16703 else
16704 {
16705 /* Try the pointer-to-member case. */
16707 /* Look for the optional `::' operator. */
16710 /* Look for the nested-name specifier. */
16717 /* If we found it, and the next token is a `*', then we are
16718 indeed looking at a pointer-to-member operator. */
16721 {
16722 /* Indicate that the `*' operator was used. */
16730 else
16731 {
16732 /* The type of which the member is a member is given by the
16733 current SCOPE. */
16735 /* The next name will not be qualified. */
16739 /* Look for optional c++11 attributes. */
16743 /* Look for the optional cv-qualifier-seq. */
16745 }
16746 }
16747 /* If that didn't work we don't have a ptr-operator. */
16750 }
16753 }
16755 /* Parse an (optional) cv-qualifier-seq.
16757 cv-qualifier-seq:
16758 cv-qualifier cv-qualifier-seq [opt]
16760 cv-qualifier:
16761 const
16762 volatile
16764 GNU Extension:
16766 cv-qualifier:
16767 __restrict__
16769 Returns a bitmask representing the cv-qualifiers. */
16771 static cp_cv_quals
16773 {
16777 {
16779 cp_cv_quals cv_qualifier;
16781 /* Peek at the next token. */
16783 /* See if it's a cv-qualifier. */
16785 {
16801 }
16807 {
16810 }
16811 else
16812 {
16815 }
16816 }
16819 }
16821 /* Parse an (optional) virt-specifier-seq.
16823 virt-specifier-seq:
16824 virt-specifier virt-specifier-seq [opt]
16826 virt-specifier:
16827 override
16828 final
16830 Returns a bitmask representing the virt-specifiers. */
16832 static cp_virt_specifiers
16834 {
16838 {
16840 cp_virt_specifiers virt_specifier;
16842 /* Peek at the next token. */
16844 /* See if it's a virt-specifier-qualifier. */
16848 {
16851 }
16853 {
16856 }
16858 {
16860 }
16861 else
16865 {
16868 }
16869 else
16870 {
16873 }
16874 }
16876 }
16878 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
16879 is in scope even though it isn't real. */
16881 static void
16883 {
16884 tree this_parm;
16887 {
16888 /* We don't clear this between NSDMIs. Is it already what we want? */
16893 }
16896 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
16898 current_class_ref
16901 }
16903 /* Parse a late-specified return type, if any. This is not a separate
16904 non-terminal, but part of a function declarator, which looks like
16906 -> trailing-type-specifier-seq abstract-declarator(opt)
16908 Returns the type indicated by the type-id.
16910 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
16911 function. */
16913 static tree
16915 {
16917 tree type;
16919 /* Peek at the next token. */
16921 /* A late-specified return type is indicated by an initial '->'. */
16925 /* Consume the ->. */
16929 {
16930 /* DR 1207: 'this' is in scope in the trailing return type. */
16933 }
16941 }
16943 /* Parse a declarator-id.
16945 declarator-id:
16946 id-expression
16947 :: [opt] nested-name-specifier [opt] type-name
16949 In the `id-expression' case, the value returned is as for
16950 cp_parser_id_expression if the id-expression was an unqualified-id.
16951 If the id-expression was a qualified-id, then a SCOPE_REF is
16952 returned. The first operand is the scope (either a NAMESPACE_DECL
16953 or TREE_TYPE), but the second is still just a representation of an
16954 unqualified-id. */
16956 static tree
16958 {
16959 tree id;
16960 /* The expression must be an id-expression. Assume that qualified
16961 names are the names of types so that:
16963 template <class T>
16964 int S<T>::R::i = 3;
16966 will work; we must treat `S<T>::R' as the name of a type.
16967 Similarly, assume that qualified names are templates, where
16968 required, so that:
16970 template <class T>
16971 int S<T>::R<T>::i = 3;
16973 will work, too. */
16979 optional_p);
16983 }
16985 /* Parse a type-id.
16987 type-id:
16988 type-specifier-seq abstract-declarator [opt]
16990 Returns the TYPE specified. */
16992 static tree
16995 {
16996 cp_decl_specifier_seq type_specifier_seq;
16999 /* Parse the type-specifier-seq. */
17001 is_trailing_return,
17006 /* There might or might not be an abstract declarator. */
17008 /* Look for the declarator. */
17009 abstract_declarator
17013 /* Check to see if there really was a declarator. */
17019 {
17020 /* A type-id with type 'auto' is only ok if the abstract declarator
17021 is a function declarator with a late-specified return type. */
17026 else
17027 {
17030 }
17031 }
17034 is_template_arg);
17035 }
17038 {
17040 }
17043 {
17044 tree r;
17046 parser->type_definition_forbidden_message
17051 }
17054 {
17056 }
17058 /* Parse a type-specifier-seq.
17060 type-specifier-seq:
17061 type-specifier type-specifier-seq [opt]
17063 GNU extension:
17065 type-specifier-seq:
17066 attributes type-specifier-seq [opt]
17068 If IS_DECLARATION is true, we are at the start of a "condition" or
17069 exception-declaration, so we might be followed by a declarator-id.
17071 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
17072 i.e. we've just seen "->".
17074 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
17076 static void
17081 {
17086 /* Clear the TYPE_SPECIFIER_SEQ. */
17089 /* In the context of a trailing return type, enum E { } is an
17090 elaborated-type-specifier followed by a function-body, not an
17091 enum-specifier. */
17095 /* Parse the type-specifiers and attributes. */
17097 {
17098 tree type_specifier;
17101 /* Check for attributes first. */
17103 {
17108 }
17110 /* record the token of the beginning of the type specifier seq,
17111 for error reporting purposes*/
17115 /* Look for the type-specifier. */
17117 flags,
17118 type_specifier_seq,
17120 NULL,
17123 {
17124 /* If the first type-specifier could not be found, this is not a
17125 type-specifier-seq at all. */
17127 {
17131 }
17132 /* If subsequent type-specifiers could not be found, the
17133 type-specifier-seq is complete. */
17135 }
17138 /* The standard says that a condition can be:
17140 type-specifier-seq declarator = assignment-expression
17142 However, given:
17144 struct S {};
17145 if (int S = ...)
17147 we should treat the "S" as a declarator, not as a
17148 type-specifier. The standard doesn't say that explicitly for
17149 type-specifier-seq, but it does say that for
17150 decl-specifier-seq in an ordinary declaration. Perhaps it
17151 would be clearer just to allow a decl-specifier-seq here, and
17152 then add a semantic restriction that if any decl-specifiers
17153 that are not type-specifiers appear, the program is invalid. */
17156 }
17157 }
17159 /* Parse a parameter-declaration-clause.
17161 parameter-declaration-clause:
17162 parameter-declaration-list [opt] ... [opt]
17163 parameter-declaration-list , ...
17165 Returns a representation for the parameter declarations. A return
17166 value of NULL indicates a parameter-declaration-clause consisting
17167 only of an ellipsis. */
17169 static tree
17171 {
17172 tree parameters;
17177 /* Peek at the next token. */
17179 /* Check for trivial parameter-declaration-clauses. */
17181 {
17182 /* Consume the `...' token. */
17185 }
17187 /* There are no parameters. */
17188 {
17189 #ifndef NO_IMPLICIT_EXTERN_C
17193 else
17194 #endif
17196 }
17197 /* Check for `(void)', too, which is a special case. */
17201 {
17202 /* Consume the `void' token. */
17204 /* There are no parameters. */
17206 }
17208 /* Parse the parameter-declaration-list. */
17210 /* If a parse error occurred while parsing the
17211 parameter-declaration-list, then the entire
17212 parameter-declaration-clause is erroneous. */
17216 /* Peek at the next token. */
17218 /* If it's a `,', the clause should terminate with an ellipsis. */
17220 {
17221 /* Consume the `,'. */
17223 /* Expect an ellipsis. */
17224 ellipsis_p
17226 }
17227 /* It might also be `...' if the optional trailing `,' was
17228 omitted. */
17230 {
17231 /* Consume the `...' token. */
17233 /* And remember that we saw it. */
17235 }
17236 else
17239 /* Finish the parameter list. */
17244 }
17246 /* Parse a parameter-declaration-list.
17248 parameter-declaration-list:
17249 parameter-declaration
17250 parameter-declaration-list , parameter-declaration
17252 Returns a representation of the parameter-declaration-list, as for
17253 cp_parser_parameter_declaration_clause. However, the
17254 `void_list_node' is never appended to the list. Upon return,
17255 *IS_ERROR will be true iff an error occurred. */
17257 static tree
17259 {
17265 /* Assume all will go well. */
17267 /* The special considerations that apply to a function within an
17268 unbraced linkage specifications do not apply to the parameters
17269 to the function. */
17270 saved_in_unbraced_linkage_specification_p
17274 /* Look for more parameters. */
17276 {
17280 /* Parse the parameter. */
17281 parameter
17286 /* We don't know yet if the enclosing context is deprecated, so wait
17287 and warn in grokparms if appropriate. */
17293 PARM,
17299 /* If a parse error occurred parsing the parameter declaration,
17300 then the entire parameter-declaration-list is erroneous. */
17302 {
17306 }
17316 {
17320 }
17322 /* Add the new parameter to the list. */
17326 /* Peek at the next token. */
17329 /* These are for Objective-C++ */
17332 /* The parameter-declaration-list is complete. */
17335 {
17338 /* Peek at the next token. */
17340 /* If it's an ellipsis, then the list is complete. */
17343 /* Otherwise, there must be more parameters. Consume the
17344 `,'. */
17346 /* When parsing something like:
17348 int i(float f, double d)
17350 we can tell after seeing the declaration for "f" that we
17351 are not looking at an initialization of a variable "i",
17352 but rather at the declaration of a function "i".
17354 Due to the fact that the parsing of template arguments
17355 (as specified to a template-id) requires backtracking we
17356 cannot use this technique when inside a template argument
17357 list. */
17361 /* However, a parameter-declaration of the form
17362 "foat(f)" (which is a valid declaration of a
17363 parameter "f") can also be interpreted as an
17364 expression (the conversion of "f" to "float"). */
17367 }
17368 else
17369 {
17377 }
17378 }
17380 parser->in_unbraced_linkage_specification_p
17384 }
17386 /* Parse a parameter declaration.
17388 parameter-declaration:
17389 decl-specifier-seq ... [opt] declarator
17390 decl-specifier-seq declarator = assignment-expression
17391 decl-specifier-seq ... [opt] abstract-declarator [opt]
17392 decl-specifier-seq abstract-declarator [opt] = assignment-expression
17394 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
17395 declares a template parameter. (In that case, a non-nested `>'
17396 token encountered during the parsing of the assignment-expression
17397 is not interpreted as a greater-than operator.)
17399 Returns a representation of the parameter, or NULL if an error
17400 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
17401 true iff the declarator is of the form "(p)". */
17407 {
17409 cp_decl_specifier_seq decl_specifiers;
17411 tree default_argument;
17415 /* In a template parameter, `>' is not an operator.
17417 [temp.param]
17419 When parsing a default template-argument for a non-type
17420 template-parameter, the first non-nested `>' is taken as the end
17421 of the template parameter-list rather than a greater-than
17422 operator. */
17424 /* Type definitions may not appear in parameter types. */
17426 parser->type_definition_forbidden_message
17429 /* Parse the declaration-specifiers. */
17431 CP_PARSER_FLAGS_NONE,
17435 /* Complain about missing 'typename' or other invalid type names. */
17439 /* If an error occurred, there's no reason to attempt to parse the
17440 rest of the declaration. */
17442 {
17445 }
17447 /* Peek at the next token. */
17450 /* If the next token is a `)', `,', `=', `>', or `...', then there
17451 is no declarator. However, when variadic templates are enabled,
17452 there may be a declarator following `...'. */
17457 {
17461 }
17462 /* Otherwise, there should be a declarator. */
17463 else
17464 {
17468 /* After seeing a decl-specifier-seq, if the next token is not a
17469 "(", there is no possibility that the code is a valid
17470 expression. Therefore, if parsing tentatively, we commit at
17471 this point. */
17473 /* In an expression context, having seen:
17475 (int((char ...
17477 we cannot be sure whether we are looking at a
17478 function-type (taking a "char" as a parameter) or a cast
17479 of some object of type "char" to "int". */
17485 /* Parse the declarator. */
17488 CP_PARSER_DECLARATOR_EITHER,
17490 parenthesized_p,
17493 /* After the declarator, allow more attributes. */
17494 decl_specifiers.attributes
17497 }
17499 /* If the next token is an ellipsis, and we have not seen a
17500 declarator name, and the type of the declarator contains parameter
17501 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
17502 a parameter pack expansion expression. Otherwise, leave the
17503 ellipsis for a C-style variadic function. */
17506 {
17517 {
17518 /* Consume the `...'. */
17522 /* Build a pack expansion type */
17525 else
17527 }
17528 }
17530 /* The restriction on defining new types applies only to the type
17531 of the parameter, not to the default argument. */
17534 /* If the next token is `=', then process a default argument. */
17536 {
17538 /* If we are defining a class, then the tokens that make up the
17539 default argument must be saved and processed later. */
17544 /* Outside of a class definition, we can just parse the
17545 assignment-expression. */
17546 else
17547 default_argument
17551 {
17554 else
17555 {
17557 "default arguments are only "
17560 }
17561 }
17565 {
17566 /* Find the name of the parameter pack. */
17573 template_parm_p
17579 else
17581 template_parm_p
17588 }
17589 }
17590 else
17594 declarator,
17595 default_argument);
17596 }
17598 /* Parse a default argument and return it.
17600 TEMPLATE_PARM_P is true if this is a default argument for a
17601 non-type template parameter. */
17602 static tree
17604 {
17610 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
17611 set correctly. */
17614 /* Local variable names (and the `this' keyword) may not
17615 appear in a default argument. */
17618 /* Parse the assignment-expression. */
17621 default_argument
17631 }
17633 /* Parse a function-body.
17635 function-body:
17636 compound_statement */
17638 static void
17640 {
17642 }
17644 /* Parse a ctor-initializer-opt followed by a function-body. Return
17645 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
17646 is true we are parsing a function-try-block. */
17648 static bool
17651 {
17659 /* Begin the function body. */
17661 /* Parse the optional ctor-initializer. */
17664 /* If we're parsing a constexpr constructor definition, we need
17665 to check that the constructor body is indeed empty. However,
17666 before we get to cp_parser_function_body lot of junk has been
17667 generated, so we can't just check that we have an empty block.
17668 Rather we take a snapshot of the outermost block, and check whether
17669 cp_parser_function_body changed its state. */
17671 {
17675 }
17676 /* Parse the function-body. */
17680 /* Finish the function body. */
17684 }
17686 /* Parse an initializer.
17688 initializer:
17689 = initializer-clause
17690 ( expression-list )
17692 Returns an expression representing the initializer. If no
17693 initializer is present, NULL_TREE is returned.
17695 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
17696 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
17697 set to TRUE if there is no initializer present. If there is an
17698 initializer, and it is not a constant-expression, *NON_CONSTANT_P
17699 is set to true; otherwise it is set to false. */
17701 static tree
17704 {
17706 tree init;
17708 /* Peek at the next token. */
17711 /* Let our caller know whether or not this initializer was
17712 parenthesized. */
17714 /* Assume that the initializer is constant. */
17718 {
17719 /* Consume the `='. */
17721 /* Parse the initializer-clause. */
17723 }
17725 {
17730 non_constant_p);
17735 }
17737 {
17741 }
17742 else
17743 {
17744 /* Anything else is an error. */
17747 }
17750 }
17752 /* Parse an initializer-clause.
17754 initializer-clause:
17755 assignment-expression
17756 braced-init-list
17758 Returns an expression representing the initializer.
17760 If the `assignment-expression' production is used the value
17761 returned is simply a representation for the expression.
17763 Otherwise, calls cp_parser_braced_list. */
17765 static tree
17767 {
17768 tree initializer;
17770 /* Assume the expression is constant. */
17773 /* If it is not a `{', then we are looking at an
17774 assignment-expression. */
17776 {
17777 initializer
17780 non_constant_p);
17781 }
17782 else
17786 }
17788 /* Parse a brace-enclosed initializer list.
17790 braced-init-list:
17791 { initializer-list , [opt] }
17792 { }
17794 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
17795 the elements of the initializer-list (or NULL, if the last
17796 production is used). The TREE_TYPE for the CONSTRUCTOR will be
17797 NULL_TREE. There is no way to detect whether or not the optional
17798 trailing `,' was provided. NON_CONSTANT_P is as for
17799 cp_parser_initializer. */
17801 static tree
17803 {
17804 tree initializer;
17806 /* Consume the `{' token. */
17808 /* Create a CONSTRUCTOR to represent the braced-initializer. */
17810 /* If it's not a `}', then there is a non-trivial initializer. */
17812 {
17813 /* Parse the initializer list. */
17816 /* A trailing `,' token is allowed. */
17819 }
17820 /* Now, there should be a trailing `}'. */
17824 }
17826 /* Parse an initializer-list.
17828 initializer-list:
17829 initializer-clause ... [opt]
17830 initializer-list , initializer-clause ... [opt]
17832 GNU Extension:
17834 initializer-list:
17835 designation initializer-clause ...[opt]
17836 initializer-list , designation initializer-clause ...[opt]
17838 designation:
17839 . identifier =
17840 identifier :
17841 [ constant-expression ] =
17843 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
17844 for the initializer. If the INDEX of the elt is non-NULL, it is the
17845 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
17846 as for cp_parser_initializer. */
17850 {
17853 /* Assume all of the expressions are constant. */
17856 /* Parse the rest of the list. */
17858 {
17860 tree designator;
17861 tree initializer;
17864 /* If the next token is an identifier and the following one is a
17865 colon, we are looking at the GNU designated-initializer
17866 syntax. */
17870 {
17871 /* Warn the user that they are using an extension. */
17874 /* Consume the identifier. */
17876 /* Consume the `:'. */
17878 }
17879 /* Also handle the C99 syntax, '. id ='. */
17884 {
17885 /* Warn the user that they are using an extension. */
17888 /* Consume the `.'. */
17890 /* Consume the identifier. */
17892 /* Consume the `='. */
17894 }
17895 /* Also handle C99 array designators, '[ const ] ='. */
17899 {
17900 /* In C++11, [ could start a lambda-introducer. */
17908 }
17909 else
17912 /* Parse the initializer. */
17915 /* If any clause is non-constant, so is the entire initializer. */
17919 /* If we have an ellipsis, this is an initializer pack
17920 expansion. */
17922 {
17923 /* Consume the `...'. */
17926 /* Turn the initializer into an initializer expansion. */
17928 }
17930 /* Add it to the vector. */
17933 /* If the next token is not a comma, we have reached the end of
17934 the list. */
17938 /* Peek at the next token. */
17940 /* If the next token is a `}', then we're still done. An
17941 initializer-clause can have a trailing `,' after the
17942 initializer-list and before the closing `}'. */
17946 /* Consume the `,' token. */
17948 }
17951 }
17953 /* Classes [gram.class] */
17955 /* Parse a class-name.
17957 class-name:
17958 identifier
17959 template-id
17961 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
17962 to indicate that names looked up in dependent types should be
17963 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
17964 keyword has been used to indicate that the name that appears next
17965 is a template. TAG_TYPE indicates the explicit tag given before
17966 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
17967 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
17968 is the class being defined in a class-head.
17970 Returns the TYPE_DECL representing the class. */
17972 static tree
17980 {
17981 tree decl;
17982 tree scope;
17987 /* All class-names start with an identifier. */
17990 {
17993 }
17995 /* PARSER->SCOPE can be cleared when parsing the template-arguments
17996 to a template-id, so we save it here. */
18001 /* Any name names a type if we're following the `typename' keyword
18002 in a qualified name where the enclosing scope is type-dependent. */
18005 /* Handle the common case (an identifier, but not a template-id)
18006 efficiently. */
18009 {
18013 /* Look for the identifier. */
18017 /* If the next token isn't an identifier, we are certainly not
18018 looking at a class-name. */
18021 /* If we know this is a type-name, there's no need to look it
18022 up. */
18025 else
18026 {
18027 tree ambiguous_decls;
18028 /* If we already know that this lookup is ambiguous, then
18029 we've already issued an error message; there's no reason
18030 to check again. */
18032 {
18035 }
18036 /* If the next token is a `::', then the name must be a type
18037 name.
18039 [basic.lookup.qual]
18041 During the lookup for a name preceding the :: scope
18042 resolution operator, object, function, and enumerator
18043 names are ignored. */
18046 /* Look up the name. */
18048 tag_type,
18051 check_dependency_p,
18055 {
18059 }
18060 }
18061 }
18062 else
18063 {
18064 /* Try a template-id. */
18066 check_dependency_p,
18067 tag_type,
18068 is_declaration);
18071 }
18075 /* If this is a typename, create a TYPENAME_TYPE. */
18077 {
18082 }
18086 /* Check to see that it is really the name of a class. */
18090 /* Situations like this:
18092 template <typename T> struct A {
18093 typename T::template X<int>::I i;
18094 };
18096 are problematic. Is `T::template X<int>' a class-name? The
18097 standard does not seem to be definitive, but there is no other
18098 valid interpretation of the following `::'. Therefore, those
18099 names are considered class-names. */
18100 {
18104 }
18108 /* In Objective-C 2.0, a classname followed by '.' starts a
18109 dot-syntax expression, and it's not a type-name. */
18121 }
18123 /* Parse a class-specifier.
18125 class-specifier:
18126 class-head { member-specification [opt] }
18128 Returns the TREE_TYPE representing the class. */
18130 static tree
18132 {
18133 tree type;
18147 /* Parse the class-head. */
18150 /* If the class-head was a semantic disaster, skip the entire body
18151 of the class. */
18153 {
18157 }
18159 /* Look for the `{'. */
18161 {
18164 }
18166 /* Issue an error message if type-definitions are forbidden here. */
18168 /* Remember that we are defining one more class. */
18170 /* Inside the class, surrounding template-parameter-lists do not
18171 apply. */
18172 saved_num_template_parameter_lists
18175 /* We are not in a function body. */
18178 /* Or in a loop. */
18181 /* Or in a switch. */
18184 /* We are not immediately inside an extern "lang" block. */
18185 saved_in_unbraced_linkage_specification_p
18189 /* Start the class. */
18191 {
18194 }
18198 /* If the type is erroneous, skip the entire body of the class. */
18200 else
18201 /* Parse the member-specification. */
18204 /* Look for the trailing `}'. */
18206 /* Look for trailing attributes to apply to this class. */
18214 /* We've finished a type definition. Check for the common syntax
18215 error of forgetting a semicolon after the definition. We need to
18216 be careful, as we can't just check for not-a-semicolon and be done
18217 with it; the user might have typed:
18219 class X { } c = ...;
18220 class X { } *p = ...;
18222 and so forth. Instead, enumerate all the possible tokens that
18223 might follow this production; if we don't see one of them, then
18224 complain and silently insert the semicolon. */
18225 {
18230 /* Don't try to parse c++11 attributes here. As per the
18231 grammar, that should be a task for
18232 cp_parser_decl_specifier_seq. */
18236 {
18247 /* While it's legal for type qualifiers and storage class
18248 specifiers to follow type definitions in the grammar, only
18249 compiler testsuites contain code like that. Assume that if
18250 we see such code, then what we're really seeing is a case
18251 like:
18253 class X { }
18254 const <type> var = ...;
18256 or
18258 class Y { }
18259 static <type> func (...) ...
18261 i.e. the qualifier or specifier applies to the next
18262 declaration. To do so, however, we need to look ahead one
18263 more token to see if *that* token is a type specifier.
18265 This code could be improved to handle:
18267 class Z { }
18268 static const <type> var = ...; */
18271 {
18274 /* Handling user-defined types here would be nice, but very
18275 tricky. */
18276 want_semicolon
18279 }
18283 }
18285 /* If we don't have a type, then something is very wrong and we
18286 shouldn't try to do anything clever. Likewise for not seeing the
18287 closing brace. */
18289 {
18290 cp_token_position prev
18301 else
18304 /* Unget one token and smash it to look as though we encountered
18305 a semicolon in the input stream. */
18310 }
18311 }
18313 /* If this class is not itself within the scope of another class,
18314 then we need to parse the bodies of all of the queued function
18315 definitions. Note that the queued functions defined in a class
18316 are not always processed immediately following the
18317 class-specifier for that class. Consider:
18319 struct A {
18320 struct B { void f() { sizeof (A); } };
18321 };
18323 If `f' were processed before the processing of `A' were
18324 completed, there would be no way to compute the size of `A'.
18325 Note that the nesting we are interested in here is lexical --
18326 not the semantic nesting given by TYPE_CONTEXT. In particular,
18327 for:
18329 struct A { struct B; };
18330 struct A::B { void f() { } };
18332 there is no need to delay the parsing of `A::B::f'. */
18334 {
18335 tree decl;
18342 /* In a first pass, parse default arguments to the functions.
18343 Then, in a second pass, parse the bodies of the functions.
18344 This two-phased approach handles cases like:
18346 struct S {
18347 void f() { g(); }
18348 void g(int i = 3);
18349 };
18351 */
18354 {
18356 /* If there are default arguments that have not yet been processed,
18357 take care of them now. */
18359 {
18364 }
18365 /* Make sure that any template parameters are in scope. */
18367 /* Parse the default argument expressions. */
18369 /* Remove any template parameters from the symbol table. */
18371 }
18373 /* Now parse any NSDMIs. */
18377 {
18379 {
18384 }
18387 }
18393 /* Now parse the body of the functions. */
18397 }
18399 /* Put back any saved access checks. */
18402 /* Restore saved state. */
18406 parser->num_template_parameter_lists
18408 parser->in_unbraced_linkage_specification_p
18412 }
18414 static tree
18416 {
18417 tree ret;
18422 }
18424 /* Parse a class-head.
18426 class-head:
18427 class-key identifier [opt] base-clause [opt]
18428 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
18429 class-key nested-name-specifier [opt] template-id
18430 base-clause [opt]
18432 class-virt-specifier:
18433 final
18435 GNU Extensions:
18436 class-key attributes identifier [opt] base-clause [opt]
18437 class-key attributes nested-name-specifier identifier base-clause [opt]
18438 class-key attributes nested-name-specifier [opt] template-id
18439 base-clause [opt]
18441 Upon return BASES is initialized to the list of base classes (or
18442 NULL, if there are none) in the same form returned by
18443 cp_parser_base_clause.
18445 Returns the TYPE of the indicated class. Sets
18446 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
18447 involving a nested-name-specifier was used, and FALSE otherwise.
18449 Returns error_mark_node if this is not a class-head.
18451 Returns NULL_TREE if the class-head is syntactically valid, but
18452 semantically invalid in a way that means we should skip the entire
18453 body of the class. */
18455 static tree
18458 {
18459 tree nested_name_specifier;
18463 tree attributes;
18464 tree bases;
18474 /* Assume no nested-name-specifier will be present. */
18476 /* Assume no template parameter lists will be used in defining the
18477 type. */
18481 /* Look for the class-key. */
18486 /* Parse the attributes. */
18489 /* If the next token is `::', that is invalid -- but sometimes
18490 people do try to write:
18492 struct ::S {};
18494 Handle this gracefully by accepting the extra qualifier, and then
18495 issuing an error about it later if this really is a
18496 class-head. If it turns out just to be an elaborated type
18497 specifier, remain silent. */
18503 /* Determine the name of the class. Begin by looking for an
18504 optional nested-name-specifier. */
18506 nested_name_specifier
18512 /* If there was a nested-name-specifier, then there *must* be an
18513 identifier. */
18515 {
18517 /* Although the grammar says `identifier', it really means
18518 `class-name' or `template-name'. You are only allowed to
18519 define a class that has already been declared with this
18520 syntax.
18522 The proposed resolution for Core Issue 180 says that wherever
18523 you see `class T::X' you should treat `X' as a type-name.
18525 It is OK to define an inaccessible class; for example:
18527 class A { class B; };
18528 class A::B {};
18530 We do not know if we will see a class-name, or a
18531 template-name. We look for a class-name first, in case the
18532 class-name is a template-id; if we looked for the
18533 template-name first we would stop after the template-name. */
18538 class_type,
18542 /* If that didn't work, ignore the nested-name-specifier. */
18544 {
18550 }
18551 /* If we could not find a corresponding TYPE, treat this
18552 declaration like an unqualified declaration. */
18555 /* Otherwise, count the number of templates used in TYPE and its
18556 containing scopes. */
18557 else
18558 {
18559 tree scope;
18572 }
18573 }
18574 /* Otherwise, the identifier is optional. */
18575 else
18576 {
18577 /* We don't know whether what comes next is a template-id,
18578 an identifier, or nothing at all. */
18580 /* Check for a template-id. */
18585 class_key,
18587 /* If that didn't work, it could still be an identifier. */
18589 {
18591 {
18594 }
18595 else
18597 }
18598 else
18599 {
18602 }
18603 }
18608 {
18610 class_key,
18612 }
18615 /* If it's not a `:' or a `{' then we can't really be looking at a
18616 class-head, since a class-head only appears as part of a
18617 class-specifier. We have to detect this situation before calling
18618 xref_tag, since that has irreversible side-effects. */
18620 {
18624 }
18626 /* At this point, we're going ahead with the class-specifier, even
18627 if some other problem occurs. */
18630 {
18635 }
18636 /* Issue the error about the overly-qualified name now. */
18638 {
18643 }
18645 {
18650 }
18652 {
18653 tree scope;
18655 /* Reject typedef-names in class heads. */
18657 {
18660 type);
18663 }
18665 /* Figure out in what scope the declaration is being placed. */
18667 /* If that scope does not contain the scope in which the
18668 class was originally declared, the program is invalid. */
18670 {
18673 "declaration of %qD in namespace %qD which does not "
18676 else
18682 }
18683 /* [dcl.meaning]
18685 A declarator-id shall not be qualified except for the
18686 definition of a ... nested class outside of its class
18687 ... [or] the definition or explicit instantiation of a
18688 class member of a namespace outside of its namespace. */
18690 {
18695 }
18696 }
18697 /* An explicit-specialization must be preceded by "template <>". If
18698 it is not, try to recover gracefully. */
18702 {
18706 /* Take the same action that would have been taken by
18707 cp_parser_explicit_specialization. */
18710 }
18711 /* There must be no "return" statements between this point and the
18712 end of this function; set "type "to the correct return value and
18713 use "goto done;" to return. */
18714 /* Make sure that the right number of template parameters were
18715 present. */
18719 {
18720 /* If something went wrong, there is no point in even trying to
18721 process the class-definition. */
18724 }
18726 /* Look up the type. */
18728 {
18732 {
18736 }
18737 else
18738 {
18741 }
18744 }
18746 {
18747 tree class_type;
18749 /* Given:
18751 template <typename T> struct S { struct T };
18752 template <typename T> struct S<T>::T { };
18754 we will get a TYPENAME_TYPE when processing the definition of
18755 `S::T'. We need to resolve it to the actual type before we
18756 try to define it. */
18758 {
18763 else
18764 {
18767 }
18768 }
18772 {
18775 }
18778 /* Enter the scope indicated by the nested-name-specifier. */
18780 /* Get the canonical version of this type. */
18784 {
18787 {
18790 }
18791 }
18795 }
18797 {
18798 /* If the class was unnamed, create a dummy name. */
18803 }
18805 /* Indicate whether this class was declared as a `class' or as a
18806 `struct'. */
18811 /* If this type was already complete, and we see another definition,
18812 that's an error. */
18814 {
18816 type);
18818 type);
18821 }
18826 {
18827 /* Apply attributes now, before any use of the class as a template
18828 argument in its base list. */
18831 }
18833 /* We will have entered the scope containing the class; the names of
18834 base classes should be looked up in that context. For example:
18836 struct A { struct B {}; struct C; };
18837 struct A::C : B {};
18839 is valid. */
18841 /* Get the list of base-classes, if there is one. */
18844 else
18847 /* If we're really defining a class, process the base classes.
18848 If they're invalid, fail. */
18853 done:
18854 /* Leave the scope given by the nested-name-specifier. We will
18855 enter the class scope itself while processing the members. */
18860 {
18863 }
18869 out:
18872 }
18874 /* Parse a class-key.
18876 class-key:
18877 class
18878 struct
18879 union
18881 Returns the kind of class-key specified, or none_type to indicate
18882 error. */
18884 static enum tag_types
18886 {
18890 /* Look for the class-key. */
18895 /* Check to see if the TOKEN is a class-key. */
18900 }
18902 /* Parse an (optional) member-specification.
18904 member-specification:
18905 member-declaration member-specification [opt]
18906 access-specifier : member-specification [opt] */
18908 static void
18910 {
18912 {
18916 /* Peek at the next token. */
18918 /* If it's a `}', or EOF then we've seen all the members. */
18924 /* See if this token is a keyword. */
18927 {
18931 /* Consume the access-specifier. */
18933 /* Remember which access-specifier is active. */
18935 /* Look for the `:'. */
18940 /* Accept #pragmas at class scope. */
18942 {
18945 }
18947 /* Otherwise, the next construction must be a
18948 member-declaration. */
18950 }
18951 }
18952 }
18954 /* Parse a member-declaration.
18956 member-declaration:
18957 decl-specifier-seq [opt] member-declarator-list [opt] ;
18958 function-definition ; [opt]
18959 :: [opt] nested-name-specifier template [opt] unqualified-id ;
18960 using-declaration
18961 template-declaration
18962 alias-declaration
18964 member-declarator-list:
18965 member-declarator
18966 member-declarator-list , member-declarator
18968 member-declarator:
18969 declarator pure-specifier [opt]
18970 declarator constant-initializer [opt]
18971 identifier [opt] : constant-expression
18973 GNU Extensions:
18975 member-declaration:
18976 __extension__ member-declaration
18978 member-declarator:
18979 declarator attributes [opt] pure-specifier [opt]
18980 declarator attributes [opt] constant-initializer [opt]
18981 identifier [opt] attributes [opt] : constant-expression
18983 C++0x Extensions:
18985 member-declaration:
18986 static_assert-declaration */
18988 static void
18990 {
18991 cp_decl_specifier_seq decl_specifiers;
18992 tree prefix_attributes;
18993 tree decl;
19002 /* Check for the `__extension__' keyword. */
19004 {
19005 /* Recurse. */
19007 /* Restore the old value of the PEDANTIC flag. */
19011 }
19013 /* Check for a template-declaration. */
19015 {
19016 /* An explicit specialization here is an error condition, and we
19017 expect the specialization handler to detect and report this. */
19021 else
19025 }
19027 /* Check for a using-declaration. */
19029 {
19031 {
19032 /* Parse the using-declaration. */
19036 }
19037 else
19038 {
19039 tree decl;
19044 else
19048 }
19049 }
19051 /* Check for @defs. */
19053 {
19058 {
19063 }
19065 }
19067 /* If the next token is `static_assert' we have a static assertion. */
19069 {
19072 }
19079 /* Parse the decl-specifier-seq. */
19082 CP_PARSER_FLAGS_OPTIONAL,
19085 /* Check for an invalid type-name. */
19089 /* If there is no declarator, then the decl-specifier-seq should
19090 specify a type. */
19092 {
19093 /* If there was no decl-specifier-seq, and the next token is a
19094 `;', then we have something like:
19096 struct S { ; };
19098 [class.mem]
19100 Each member-declaration shall declare at least one member
19101 name of the class. */
19103 {
19107 }
19108 else
19109 {
19110 tree type;
19112 /* See if this declaration is a friend. */
19114 /* If there were decl-specifiers, check to see if there was
19115 a class-declaration. */
19118 /* Nested classes have already been added to the class, but
19119 a `friend' needs to be explicitly registered. */
19121 {
19122 /* If the `friend' keyword was present, the friend must
19123 be introduced with a class-key. */
19126 "in C++03 a class-key must be used "
19128 /* In this case:
19130 template <typename T> struct A {
19131 friend struct A<T>::B;
19132 };
19134 A<T>::B will be represented by a TYPENAME_TYPE, and
19135 therefore not recognized by check_tag_decl. */
19137 {
19141 }
19144 "friend declaration does not name a class or "
19146 else
19149 }
19150 /* If there is no TYPE, an error message will already have
19151 been issued. */
19153 ;
19154 /* An anonymous aggregate has to be handled specially; such
19155 a declaration really declares a data member (with a
19156 particular type), as opposed to a nested class. */
19158 {
19159 /* C++11 9.5/6. */
19162 "a storage class on an anonymous aggregate "
19165 /* Remove constructors and such from TYPE, now that we
19166 know it is an anonymous aggregate. */
19168 /* And make the corresponding data member. */
19171 /* Add it to the class. */
19173 }
19174 else
19175 cp_parser_check_access_in_redeclaration
19178 }
19179 }
19180 else
19181 {
19184 /* Clear attributes from the decl_specifiers but keep them
19185 around as prefix attributes that apply them to the entity
19186 being declared. */
19190 /* See if these declarations will be friends. */
19193 /* Keep going until we hit the `;' at the end of the
19194 declaration. */
19196 {
19198 tree first_attribute;
19200 /* Peek at the next token. */
19203 /* Check for a bitfield declaration. */
19208 {
19209 tree identifier;
19210 tree width;
19212 /* Get the name of the bitfield. Note that we cannot just
19213 check TOKEN here because it may have been invalidated by
19214 the call to cp_lexer_peek_nth_token above. */
19217 else
19220 /* Consume the `:' token. */
19222 /* Get the width of the bitfield. */
19223 width
19226 NULL);
19228 /* Look for attributes that apply to the bitfield. */
19230 /* Remember which attributes are prefix attributes and
19231 which are not. */
19233 /* Combine the attributes. */
19236 /* Create the bitfield declaration. */
19239 identifier,
19240 sfk_none)
19243 width,
19244 attributes);
19245 }
19246 else
19247 {
19249 tree initializer;
19250 tree asm_specification;
19253 /* Parse the declarator. */
19254 declarator
19260 /* If something went wrong parsing the declarator, make sure
19261 that we at least consume some tokens. */
19263 {
19264 /* Skip to the end of the statement. */
19266 /* If the next token is not a semicolon, that is
19267 probably because we just skipped over the body of
19268 a function. So, we consume a semicolon if
19269 present, but do not issue an error message if it
19270 is not present. */
19272 CPP_SEMICOLON))
19275 }
19278 cp_parser_check_for_definition_in_return_type
19282 /* Look for an asm-specification. */
19284 /* Look for attributes that apply to the declaration. */
19286 /* Remember which attributes are prefix attributes and
19287 which are not. */
19289 /* Combine the attributes. */
19292 /* If it's an `=', then we have a constant-initializer or a
19293 pure-specifier. It is not correct to parse the
19294 initializer before registering the member declaration
19295 since the member declaration should be in scope while
19296 its initializer is processed. However, the rest of the
19297 front end does not yet provide an interface that allows
19298 us to handle this correctly. */
19300 {
19301 /* In [class.mem]:
19303 A pure-specifier shall be used only in the declaration of
19304 a virtual function.
19306 A member-declarator can contain a constant-initializer
19307 only if it declares a static member of integral or
19308 enumeration type.
19310 Therefore, if the DECLARATOR is for a function, we look
19311 for a pure-specifier; otherwise, we look for a
19312 constant-initializer. When we call `grokfield', it will
19313 perform more stringent semantics checks. */
19324 {
19326 /* Don't require a constant rvalue in C++11, since we
19327 might want a reference constant. We'll enforce
19328 constancy later. */
19330 /* Parse the initializer. */
19333 }
19334 else
19335 /* Parse the initializer. */
19337 }
19340 {
19344 else
19346 }
19347 /* Otherwise, there is no initializer. */
19348 else
19351 /* See if we are probably looking at a function
19352 definition. We are certainly not looking at a
19353 member-declarator. Calling `grokfield' has
19354 side-effects, so we must not do it unless we are sure
19355 that we are looking at a member-declarator. */
19358 {
19359 /* The grammar does not allow a pure-specifier to be
19360 used when a member function is defined. (It is
19361 possible that this fact is an oversight in the
19362 standard, since a pure function may be defined
19363 outside of the class-specifier. */
19369 declarator,
19370 attributes);
19371 /* If the member was not a friend, declare it here. */
19374 /* Peek at the next token. */
19376 /* If the next token is a semicolon, consume it. */
19380 }
19381 else
19384 /* Create the declaration. */
19387 asm_specification,
19388 attributes);
19389 }
19391 /* Reset PREFIX_ATTRIBUTES. */
19397 /* If there is any qualification still in effect, clear it
19398 now; we will be starting fresh with the next declarator. */
19402 /* If it's a `,', then there are more declarators. */
19405 /* If the next token isn't a `;', then we have a parse error. */
19407 CPP_SEMICOLON))
19408 {
19409 /* The next token might be a ways away from where the
19410 actual semicolon is missing. Find the previous token
19411 and use that for our error position. */
19416 /* Assume that the user meant to provide a semicolon. If
19417 we were to cp_parser_skip_to_end_of_statement, we might
19418 skip to a semicolon inside a member function definition
19419 and issue nonsensical error messages. */
19421 }
19424 {
19425 /* Add DECL to the list of members. */
19434 /* Add DECL to the queue of NSDMI to be parsed later. */
19436 }
19440 }
19441 }
19444 out:
19446 }
19448 /* Parse a pure-specifier.
19450 pure-specifier:
19451 = 0
19453 Returns INTEGER_ZERO_NODE if a pure specifier is found.
19454 Otherwise, ERROR_MARK_NODE is returned. */
19456 static tree
19458 {
19461 /* Look for the `=' token. */
19464 /* Look for the `0' token. */
19473 /* Accept = default or = delete in c++0x mode. */
19476 {
19479 }
19481 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
19483 {
19488 }
19490 {
19493 }
19496 }
19498 /* Parse a constant-initializer.
19500 constant-initializer:
19501 = constant-expression
19503 Returns a representation of the constant-expression. */
19505 static tree
19507 {
19508 /* Look for the `=' token. */
19512 /* It is invalid to write:
19514 struct S { static const int i = { 7 }; };
19516 */
19518 {
19521 /* Consume the opening brace. */
19523 /* Skip the initializer. */
19525 /* Look for the trailing `}'. */
19529 }
19533 NULL);
19534 }
19536 /* Derived classes [gram.class.derived] */
19538 /* Parse a base-clause.
19540 base-clause:
19541 : base-specifier-list
19543 base-specifier-list:
19544 base-specifier ... [opt]
19545 base-specifier-list , base-specifier ... [opt]
19547 Returns a TREE_LIST representing the base-classes, in the order in
19548 which they were declared. The representation of each node is as
19549 described by cp_parser_base_specifier.
19551 In the case that no bases are specified, this function will return
19552 NULL_TREE, not ERROR_MARK_NODE. */
19554 static tree
19556 {
19559 /* Look for the `:' that begins the list. */
19562 /* Scan the base-specifier-list. */
19564 {
19566 tree base;
19569 /* Look for the base-specifier. */
19571 /* Look for the (optional) ellipsis. */
19573 {
19574 /* Consume the `...'. */
19578 }
19580 /* Add BASE to the front of the list. */
19582 {
19584 /* Make this a pack expansion type. */
19588 {
19591 }
19592 }
19593 /* Peek at the next token. */
19595 /* If it's not a comma, then the list is complete. */
19598 /* Consume the `,'. */
19600 }
19602 /* PARSER->SCOPE may still be non-NULL at this point, if the last
19603 base class had a qualified name. However, the next name that
19604 appears is certainly not qualified. */
19610 }
19612 /* Parse a base-specifier.
19614 base-specifier:
19615 :: [opt] nested-name-specifier [opt] class-name
19616 virtual access-specifier [opt] :: [opt] nested-name-specifier
19617 [opt] class-name
19618 access-specifier virtual [opt] :: [opt] nested-name-specifier
19619 [opt] class-name
19621 Returns a TREE_LIST. The TREE_PURPOSE will be one of
19622 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
19623 indicate the specifiers provided. The TREE_VALUE will be a TYPE
19624 (or the ERROR_MARK_NODE) indicating the type that was specified. */
19626 static tree
19628 {
19636 tree type;
19638 /* Process the optional `virtual' and `access-specifier'. */
19640 {
19641 /* Peek at the next token. */
19643 /* Process `virtual'. */
19645 {
19647 /* If `virtual' appears more than once, issue an error. */
19649 {
19653 }
19657 /* Consume the `virtual' token. */
19665 /* If more than one access specifier appears, issue an
19666 error. */
19669 {
19673 }
19677 /* Consume the access-specifier. */
19685 }
19686 }
19687 /* It is not uncommon to see programs mechanically, erroneously, use
19688 the 'typename' keyword to denote (dependent) qualified types
19689 as base classes. */
19691 {
19696 else
19698 "keyword %<typename%> not allowed in this context "
19701 }
19703 /* Look for the optional `::' operator. */
19705 /* Look for the nested-name-specifier. The simplest way to
19706 implement:
19708 [temp.res]
19710 The keyword `typename' is not permitted in a base-specifier or
19711 mem-initializer; in these contexts a qualified name that
19712 depends on a template-parameter is implicitly assumed to be a
19713 type name.
19715 is to pretend that we have seen the `typename' keyword at this
19716 point. */
19720 typename_type,
19722 /* If the base class is given by a qualified name, assume that names
19723 we see are type names or templates, as appropriate. */
19729 /* DR 950 allows decltype as a base-specifier. */
19731 else
19732 {
19733 /* Otherwise, look for the class-name. */
19735 class_scope_p,
19736 template_p,
19737 typename_type,
19742 }
19748 }
19750 /* Exception handling [gram.exception] */
19752 /* Parse an (optional) noexcept-specification.
19754 noexcept-specification:
19755 noexcept ( constant-expression ) [opt]
19757 If no noexcept-specification is present, returns NULL_TREE.
19758 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
19759 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
19760 there are no parentheses. CONSUMED_EXPR will be set accordingly.
19761 Otherwise, returns a noexcept specification unless RETURN_COND is true,
19762 in which case a boolean condition is returned instead. */
19764 static tree
19769 {
19773 /* Peek at the next token. */
19776 /* Is it a noexcept-specification? */
19778 {
19779 tree expr;
19783 {
19787 {
19788 /* Types may not be defined in an exception-specification. */
19790 parser->type_definition_forbidden_message
19795 /* Restore the saved message. */
19797 }
19798 else
19799 {
19802 }
19805 }
19806 else
19807 {
19811 }
19813 /* We cannot build a noexcept-spec right away because this will check
19814 that expr is a constexpr. */
19817 else
19819 }
19820 else
19822 }
19824 /* Parse an (optional) exception-specification.
19826 exception-specification:
19827 throw ( type-id-list [opt] )
19829 Returns a TREE_LIST representing the exception-specification. The
19830 TREE_VALUE of each node is a type. */
19832 static tree
19834 {
19836 tree type_id_list;
19839 /* Peek at the next token. */
19842 /* Is it a noexcept-specification? */
19848 /* If it's not `throw', then there's no exception-specification. */
19852 #if 0
19853 /* Enable this once a lot of code has transitioned to noexcept? */
19857 #endif
19859 /* Consume the `throw'. */
19862 /* Look for the `('. */
19865 /* Peek at the next token. */
19867 /* If it's not a `)', then there is a type-id-list. */
19869 {
19870 /* Types may not be defined in an exception-specification. */
19872 parser->type_definition_forbidden_message
19874 /* Parse the type-id-list. */
19876 /* Restore the saved message. */
19878 }
19879 else
19882 /* Look for the `)'. */
19886 }
19888 /* Parse an (optional) type-id-list.
19890 type-id-list:
19891 type-id ... [opt]
19892 type-id-list , type-id ... [opt]
19894 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
19895 in the order that the types were presented. */
19897 static tree
19899 {
19903 {
19905 tree type;
19907 /* Get the next type-id. */
19909 /* Parse the optional ellipsis. */
19911 {
19912 /* Consume the `...'. */
19915 /* Turn the type into a pack expansion expression. */
19917 }
19918 /* Add it to the list. */
19920 /* Peek at the next token. */
19922 /* If it is not a `,', we are done. */
19925 /* Consume the `,'. */
19927 }
19930 }
19932 /* Parse a try-block.
19934 try-block:
19935 try compound-statement handler-seq */
19937 static tree
19939 {
19940 tree try_block;
19950 }
19952 /* Parse a function-try-block.
19954 function-try-block:
19955 try ctor-initializer [opt] function-body handler-seq */
19957 static bool
19959 {
19960 tree compound_stmt;
19961 tree try_block;
19964 /* Look for the `try' keyword. */
19967 /* Let the rest of the front end know where we are. */
19969 /* Parse the function-body. */
19970 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
19972 /* We're done with the `try' part. */
19974 /* Parse the handlers. */
19976 /* We're done with the handlers. */
19980 }
19982 /* Parse a handler-seq.
19984 handler-seq:
19985 handler handler-seq [opt] */
19987 static void
19989 {
19991 {
19994 /* Parse the handler. */
19996 /* Peek at the next token. */
19998 /* If it's not `catch' then there are no more handlers. */
20001 }
20002 }
20004 /* Parse a handler.
20006 handler:
20007 catch ( exception-declaration ) compound-statement */
20009 static void
20011 {
20012 tree handler;
20013 tree declaration;
20023 }
20025 /* Parse an exception-declaration.
20027 exception-declaration:
20028 type-specifier-seq declarator
20029 type-specifier-seq abstract-declarator
20030 type-specifier-seq
20031 ...
20033 Returns a VAR_DECL for the declaration, or NULL_TREE if the
20034 ellipsis variant is used. */
20036 static tree
20038 {
20039 cp_decl_specifier_seq type_specifiers;
20043 /* If it's an ellipsis, it's easy to handle. */
20045 {
20046 /* Consume the `...' token. */
20049 }
20051 /* Types may not be defined in exception-declarations. */
20053 parser->type_definition_forbidden_message
20056 /* Parse the type-specifier-seq. */
20060 /* If it's a `)', then there is no declarator. */
20063 else
20069 /* Restore the saved message. */
20076 }
20078 /* Parse a throw-expression.
20080 throw-expression:
20081 throw assignment-expression [opt]
20083 Returns a THROW_EXPR representing the throw-expression. */
20085 static tree
20087 {
20088 tree expression;
20093 /* Figure out whether or not there is an assignment-expression
20094 following the "throw" keyword. */
20102 else
20107 }
20109 /* GNU Extensions */
20111 /* Parse an (optional) asm-specification.
20113 asm-specification:
20114 asm ( string-literal )
20116 If the asm-specification is present, returns a STRING_CST
20117 corresponding to the string-literal. Otherwise, returns
20118 NULL_TREE. */
20120 static tree
20122 {
20124 tree asm_specification;
20126 /* Peek at the next token. */
20128 /* If the next token isn't the `asm' keyword, then there's no
20129 asm-specification. */
20133 /* Consume the `asm' token. */
20135 /* Look for the `('. */
20138 /* Look for the string-literal. */
20141 /* Look for the `)'. */
20145 }
20147 /* Parse an asm-operand-list.
20149 asm-operand-list:
20150 asm-operand
20151 asm-operand-list , asm-operand
20153 asm-operand:
20154 string-literal ( expression )
20155 [ string-literal ] string-literal ( expression )
20157 Returns a TREE_LIST representing the operands. The TREE_VALUE of
20158 each node is the expression. The TREE_PURPOSE is itself a
20159 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
20160 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
20161 is a STRING_CST for the string literal before the parenthesis. Returns
20162 ERROR_MARK_NODE if any of the operands are invalid. */
20164 static tree
20166 {
20171 {
20172 tree string_literal;
20173 tree expression;
20174 tree name;
20177 {
20178 /* Consume the `[' token. */
20180 /* Read the operand name. */
20185 /* Look for the closing `]'. */
20187 }
20188 else
20190 /* Look for the string-literal. */
20193 /* Look for the `('. */
20195 /* Parse the expression. */
20197 /* Look for the `)'. */
20205 /* Add this operand to the list. */
20207 expression,
20208 asm_operands);
20209 /* If the next token is not a `,', there are no more
20210 operands. */
20213 /* Consume the `,'. */
20215 }
20218 }
20220 /* Parse an asm-clobber-list.
20222 asm-clobber-list:
20223 string-literal
20224 asm-clobber-list , string-literal
20226 Returns a TREE_LIST, indicating the clobbers in the order that they
20227 appeared. The TREE_VALUE of each node is a STRING_CST. */
20229 static tree
20231 {
20235 {
20236 tree string_literal;
20238 /* Look for the string literal. */
20240 /* Add it to the list. */
20242 /* If the next token is not a `,', then the list is
20243 complete. */
20246 /* Consume the `,' token. */
20248 }
20251 }
20253 /* Parse an asm-label-list.
20255 asm-label-list:
20256 identifier
20257 asm-label-list , identifier
20259 Returns a TREE_LIST, indicating the labels in the order that they
20260 appeared. The TREE_VALUE of each node is a label. */
20262 static tree
20264 {
20268 {
20271 /* Look for the identifier. */
20274 {
20277 {
20283 }
20284 }
20285 /* If the next token is not a `,', then the list is
20286 complete. */
20289 /* Consume the `,' token. */
20291 }
20294 }
20296 /* Return TRUE iff the next tokens in the stream are possibly the
20297 beginning of a GNU extension attribute. */
20299 static bool
20301 {
20303 }
20305 /* Return TRUE iff the next tokens in the stream are possibly the
20306 beginning of a standard C++-11 attribute. */
20308 static bool
20310 {
20312 }
20314 /* Return TRUE iff the next Nth tokens in the stream are possibly the
20315 beginning of a standard C++-11 attribute. */
20317 static bool
20319 {
20326 }
20328 /* Return TRUE iff the next Nth tokens in the stream are possibly the
20329 beginning of a GNU extension attribute. */
20331 static bool
20333 {
20337 }
20339 /* Return true iff the next tokens can be the beginning of either a
20340 GNU attribute list, or a standard C++11 attribute sequence. */
20342 static bool
20344 {
20347 }
20349 /* Return true iff the next Nth tokens can be the beginning of either
20350 a GNU attribute list, or a standard C++11 attribute sequence. */
20352 static bool
20354 {
20357 }
20359 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
20360 of GNU attributes, or return NULL. */
20362 static tree
20364 {
20368 }
20370 /* Parse an (optional) series of attributes.
20372 attributes:
20373 attributes attribute
20375 attribute:
20376 __attribute__ (( attribute-list [opt] ))
20378 The return value is as for cp_parser_gnu_attribute_list. */
20380 static tree
20382 {
20386 {
20388 tree attribute_list;
20391 /* Peek at the next token. */
20393 /* If it's not `__attribute__', then we're done. */
20397 /* Consume the `__attribute__' keyword. */
20399 /* Look for the two `(' tokens. */
20403 /* Peek at the next token. */
20406 /* Parse the attribute-list. */
20408 else
20409 /* If the next token is a `)', then there is no attribute
20410 list. */
20413 /* Look for the two `)' tokens. */
20421 /* Add these new attributes to the list. */
20423 }
20426 }
20428 /* Parse a GNU attribute-list.
20430 attribute-list:
20431 attribute
20432 attribute-list , attribute
20434 attribute:
20435 identifier
20436 identifier ( identifier )
20437 identifier ( identifier , expression-list )
20438 identifier ( expression-list )
20440 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
20441 to an attribute. The TREE_PURPOSE of each node is the identifier
20442 indicating which attribute is in use. The TREE_VALUE represents
20443 the arguments, if any. */
20445 static tree
20447 {
20453 {
20455 tree identifier;
20456 tree attribute;
20458 /* Look for the identifier. We also allow keywords here; for
20459 example `__attribute__ ((const))' is legal. */
20463 {
20466 /* Consume the token. */
20469 /* Save away the identifier that indicates which attribute
20470 this is. */
20472 /* For keywords, use the canonical spelling, not the
20473 parsed identifier. */
20479 /* Peek at the next token. */
20481 /* If it's an `(', then parse the attribute arguments. */
20483 {
20487 vec = cp_parser_parenthesized_expression_list
20493 else
20494 {
20497 }
20498 /* Save the arguments away. */
20500 }
20503 {
20504 /* Add this attribute to the list. */
20507 }
20510 }
20511 /* Now, look for more attributes. If the next token isn't a
20512 `,', we're done. */
20516 /* Consume the comma and keep going. */
20518 }
20521 /* We built up the list in reverse order. */
20523 }
20525 /* Parse a standard C++11 attribute.
20527 The returned representation is a TREE_LIST which TREE_PURPOSE is
20528 the scoped name of the attribute, and the TREE_VALUE is its
20529 arguments list.
20531 Note that the scoped name of the attribute is itself a TREE_LIST
20532 which TREE_PURPOSE is the namespace of the attribute, and
20533 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
20534 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
20535 and which TREE_PURPOSE is directly the attribute name.
20537 Clients of the attribute code should use get_attribute_namespace
20538 and get_attribute_name to get the actual namespace and name of
20539 attributes, regardless of their being GNU or C++11 attributes.
20541 attribute:
20542 attribute-token attribute-argument-clause [opt]
20544 attribute-token:
20545 identifier
20546 attribute-scoped-token
20548 attribute-scoped-token:
20549 attribute-namespace :: identifier
20551 attribute-namespace:
20552 identifier
20554 attribute-argument-clause:
20555 ( balanced-token-seq )
20557 balanced-token-seq:
20558 balanced-token [opt]
20559 balanced-token-seq balanced-token
20561 balanced-token:
20562 ( balanced-token-seq )
20563 [ balanced-token-seq ]
20564 { balanced-token-seq }. */
20566 static tree
20568 {
20572 /* First, parse name of the the attribute, a.k.a
20573 attribute-token. */
20590 {
20591 /* We are seeing a scoped attribute token. */
20601 else
20602 {
20606 }
20608 NULL_TREE);
20610 }
20611 else
20613 NULL_TREE);
20615 /* Now parse the optional argument clause of the attribute. */
20620 {
20626 /* A GNU attribute that takes an identifier in parameter. */
20629 vec = cp_parser_parenthesized_expression_list
20635 else
20636 {
20639 }
20643 else
20645 }
20648 }
20650 /* Parse a list of standard C++-11 attributes.
20652 attribute-list:
20653 attribute [opt]
20654 attribute-list , attribute[opt]
20655 attribute ...
20656 attribute-list , attribute ...
20657 */
20659 static tree
20661 {
20666 {
20671 {
20674 }
20679 }
20682 }
20684 /* Parse a standard C++-11 attribute specifier.
20686 attribute-specifier:
20687 [ [ attribute-list ] ]
20688 alignment-specifier
20690 alignment-specifier:
20691 alignas ( type-id ... [opt] )
20692 alignas ( alignment-expression ... [opt] ). */
20694 static tree
20696 {
20702 {
20712 }
20713 else
20714 {
20715 tree alignas_expr;
20717 /* Look for an alignment-specifier. */
20729 {
20732 }
20738 {
20742 alignas_expr =
20748 }
20751 {
20754 }
20758 /* Build the C++-11 representation of an 'aligned'
20759 attribute. */
20760 attributes =
20764 }
20767 }
20769 /* Parse a standard C++-11 attribute-specifier-seq.
20771 attribute-specifier-seq:
20772 attribute-specifier-seq [opt] attribute-specifier
20773 */
20775 static tree
20777 {
20781 {
20790 }
20794 }
20796 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
20797 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
20798 current value of the PEDANTIC flag, regardless of whether or not
20799 the `__extension__' keyword is present. The caller is responsible
20800 for restoring the value of the PEDANTIC flag. */
20802 static bool
20804 {
20805 /* Save the old value of the PEDANTIC flag. */
20809 {
20810 /* Consume the `__extension__' token. */
20812 /* We're not being pedantic while the `__extension__' keyword is
20813 in effect. */
20817 }
20820 }
20822 /* Parse a label declaration.
20824 label-declaration:
20825 __label__ label-declarator-seq ;
20827 label-declarator-seq:
20828 identifier , label-declarator-seq
20829 identifier */
20831 static void
20833 {
20834 /* Look for the `__label__' keyword. */
20838 {
20839 tree identifier;
20841 /* Look for an identifier. */
20843 /* If we failed, stop. */
20846 /* Declare it as a label. */
20848 /* If the next token is a `;', stop. */
20851 /* Look for the `,' separating the label declarations. */
20853 }
20855 /* Look for the final `;'. */
20857 }
20859 /* Support Functions */
20861 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
20862 NAME should have one of the representations used for an
20863 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
20864 is returned. If PARSER->SCOPE is a dependent type, then a
20865 SCOPE_REF is returned.
20867 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
20868 returned; the name was already resolved when the TEMPLATE_ID_EXPR
20869 was formed. Abstractly, such entities should not be passed to this
20870 function, because they do not need to be looked up, but it is
20871 simpler to check for this special case here, rather than at the
20872 call-sites.
20874 In cases not explicitly covered above, this function returns a
20875 DECL, OVERLOAD, or baselink representing the result of the lookup.
20876 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
20877 is returned.
20879 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
20880 (e.g., "struct") that was used. In that case bindings that do not
20881 refer to types are ignored.
20883 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
20884 ignored.
20886 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
20887 are ignored.
20889 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
20890 types.
20892 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
20893 TREE_LIST of candidates if name-lookup results in an ambiguity, and
20894 NULL_TREE otherwise. */
20896 static tree
20903 location_t name_location)
20904 {
20905 tree decl;
20908 /* Assume that the lookup will be unambiguous. */
20912 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
20913 no longer valid. Note that if we are parsing tentatively, and
20914 the parse fails, OBJECT_TYPE will be automatically restored. */
20920 /* A template-id has already been resolved; there is no lookup to
20921 do. */
20925 {
20929 }
20931 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
20932 it should already have been checked to make sure that the name
20933 used matches the type being destroyed. */
20935 {
20936 tree type;
20938 /* Figure out to which type this destructor applies. */
20943 else
20945 /* If that's not a class type, there is no destructor. */
20952 /* If it was a class type, return the destructor. */
20954 }
20956 /* By this point, the NAME should be an ordinary identifier. If
20957 the id-expression was a qualified name, the qualifying scope is
20958 stored in PARSER->SCOPE at this point. */
20961 /* Perform the lookup. */
20963 {
20969 /* If the SCOPE is dependent, the lookup must be deferred until
20970 the template is instantiated -- unless we are explicitly
20971 looking up names in uninstantiated templates. Even then, we
20972 cannot look up the name if the scope is not a class type; it
20973 might, for example, be a template type parameter. */
20978 /* Defer lookup. */
20980 else
20981 {
20984 /* If PARSER->SCOPE is a dependent type, then it must be a
20985 class type, and we must not be checking dependencies;
20986 otherwise, we would have processed this lookup above. So
20987 that PARSER->SCOPE is not considered a dependent base by
20988 lookup_member, we must enter the scope here. */
20992 /* If the PARSER->SCOPE is a template specialization, it
20993 may be instantiated during name lookup. In that case,
20994 errors may be issued. Even if we rollback the current
20995 tentative parse, those errors are valid. */
21000 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
21001 lookup result and the nested-name-specifier nominates a class C:
21002 * if the name specified after the nested-name-specifier, when
21003 looked up in C, is the injected-class-name of C (Clause 9), or
21004 * if the name specified after the nested-name-specifier is the
21005 same as the identifier or the simple-template-id's template-
21006 name in the last component of the nested-name-specifier,
21007 the name is instead considered to name the constructor of
21008 class C. [ Note: for example, the constructor is not an
21009 acceptable lookup result in an elaborated-type-specifier so
21010 the constructor would not be used in place of the
21011 injected-class-name. --end note ] Such a constructor name
21012 shall be used only in the declarator-id of a declaration that
21013 names a constructor or in a using-declaration. */
21021 /* If we have a single function from a using decl, pull it out. */
21028 }
21030 /* If the scope is a dependent type and either we deferred lookup or
21031 we did lookup but didn't find the name, rememeber the name. */
21034 {
21036 {
21037 tree type;
21039 /* The resolution to Core Issue 180 says that `struct
21040 A::B' should be considered a type-name, even if `A'
21041 is dependent. */
21045 }
21049 CPP_CLOSE_PAREN)))
21053 else
21056 is_template);
21057 }
21060 }
21062 {
21064 /* Look up the name in the scope of the OBJECT_TYPE, unless the
21065 OBJECT_TYPE is not a class. */
21067 /* If the OBJECT_TYPE is a template specialization, it may
21068 be instantiated during name lookup. In that case, errors
21069 may be issued. Even if we rollback the current tentative
21070 parse, those errors are valid. */
21072 name,
21075 tf_warning_or_error);
21076 /* Look it up in the enclosing context, too. */
21084 }
21085 else
21086 {
21092 }
21094 /* If the lookup failed, let our caller know. */
21098 /* Pull out the template from an injected-class-name (or multiple). */
21102 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
21104 {
21107 /* The error message we have to print is too complicated for
21108 cp_parser_error, so we incorporate its actions directly. */
21110 {
21112 name);
21114 }
21116 }
21124 /* If we have resolved the name of a member declaration, check to
21125 see if the declaration is accessible. When the name resolves to
21126 set of overloaded functions, accessibility is checked when
21127 overload resolution is done.
21129 During an explicit instantiation, access is not checked at all,
21130 as per [temp.explicit]. */
21137 }
21139 /* Like cp_parser_lookup_name, but for use in the typical case where
21140 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
21141 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
21143 static tree
21145 {
21147 none_type,
21152 location);
21153 }
21155 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
21156 the current context, return the TYPE_DECL. If TAG_NAME_P is
21157 true, the DECL indicates the class being defined in a class-head,
21158 or declared in an elaborated-type-specifier.
21160 Otherwise, return DECL. */
21162 static tree
21164 {
21165 /* If the TEMPLATE_DECL is being declared as part of a class-head,
21166 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
21168 struct A {
21169 template <typename T> struct B;
21170 };
21172 template <typename T> struct A::B {};
21174 Similarly, in an elaborated-type-specifier:
21176 namespace N { struct X{}; }
21178 struct A {
21179 template <typename T> friend struct N::X;
21180 };
21182 However, if the DECL refers to a class type, and we are in
21183 the scope of the class, then the name lookup automatically
21184 finds the TYPE_DECL created by build_self_reference rather
21185 than a TEMPLATE_DECL. For example, in:
21187 template <class T> struct S {
21188 S s;
21189 };
21191 there is no need to handle such case. */
21197 }
21199 /* If too many, or too few, template-parameter lists apply to the
21200 declarator, issue an error message. Returns TRUE if all went well,
21201 and FALSE otherwise. */
21203 static bool
21206 location_t declarator_location)
21207 {
21209 {
21211 {
21219 /* If the DECLARATOR has the form `X<y>' then it uses one
21220 additional level of template parameters. */
21223 return cp_parser_check_template_parameters
21225 }
21240 }
21242 }
21244 /* NUM_TEMPLATES were used in the current declaration. If that is
21245 invalid, return FALSE and issue an error messages. Otherwise,
21246 return TRUE. If DECLARATOR is non-NULL, then we are checking a
21247 declarator and we can print more accurate diagnostics. */
21249 static bool
21252 location_t location,
21254 {
21255 /* If there are the same number of template classes and parameter
21256 lists, that's OK. */
21259 /* If there are more, but only one more, then we are referring to a
21260 member template. That's OK too. */
21263 /* If there are more template classes than parameter lists, we have
21264 something like:
21266 template <class T> void S<T>::R<T>::f (); */
21268 {
21278 else
21281 }
21282 /* Otherwise, there are too many template parameter lists. We have
21283 something like:
21285 template <class T> template <class U> void S::f(); */
21288 }
21290 /* Parse an optional `::' token indicating that the following name is
21291 from the global namespace. If so, PARSER->SCOPE is set to the
21292 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
21293 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
21294 Returns the new value of PARSER->SCOPE, if the `::' token is
21295 present, and NULL_TREE otherwise. */
21297 static tree
21299 {
21302 /* Peek at the next token. */
21304 /* If we're looking at a `::' token then we're starting from the
21305 global namespace, not our current location. */
21307 {
21308 /* Consume the `::' token. */
21310 /* Set the SCOPE so that we know where to start the lookup. */
21316 }
21318 {
21322 }
21325 }
21327 /* Returns TRUE if the upcoming token sequence is the start of a
21328 constructor declarator. If FRIEND_P is true, the declarator is
21329 preceded by the `friend' specifier. */
21331 static bool
21333 {
21335 tree nested_name_specifier;
21338 /* The common case is that this is not a constructor declarator, so
21339 try to avoid doing lots of work if at all possible. It's not
21340 valid declare a constructor at function scope. */
21343 /* And only certain tokens can begin a constructor declarator. */
21351 /* Parse tentatively; we are going to roll back all of the tokens
21352 consumed here. */
21354 /* Assume that we are looking at a constructor declarator. */
21357 /* Look for the optional `::' operator. */
21360 /* Look for the nested-name-specifier. */
21361 nested_name_specifier
21367 /* Outside of a class-specifier, there must be a
21368 nested-name-specifier. */
21376 /* If we have a class scope, this is easy; DR 147 says that S::S always
21377 names the constructor, and no other qualified name could. */
21380 {
21390 }
21391 /* If we still think that this might be a constructor-declarator,
21392 look for a class-name. */
21394 {
21395 /* If we have:
21397 template <typename T> struct S {
21398 S();
21399 };
21401 we must recognize that the nested `S' names a class. */
21402 tree type_decl;
21406 none_type,
21410 /* If there was no class-name, then this is not a constructor. */
21413 /* If we're still considering a constructor, we have to see a `(',
21414 to begin the parameter-declaration-clause, followed by either a
21415 `)', an `...', or a decl-specifier. We need to check for a
21416 type-specifier to avoid being fooled into thinking that:
21418 S (f) (int);
21420 is a constructor. (It is actually a function named `f' that
21421 takes one parameter (of type `int') and returns a value of type
21422 `S'. */
21430 /* A parameter declaration begins with a decl-specifier,
21431 which is either the "attribute" keyword, a storage class
21432 specifier, or (usually) a type-specifier. */
21434 {
21435 tree type;
21439 /* Names appearing in the type-specifier should be looked up
21440 in the scope of the class. */
21443 else
21444 {
21447 {
21451 {
21454 }
21455 }
21457 }
21459 /* Inside the constructor parameter list, surrounding
21460 template-parameter-lists do not apply. */
21461 saved_num_template_parameter_lists
21465 /* Look for the type-specifier. */
21467 CP_PARSER_FLAGS_NONE,
21473 parser->num_template_parameter_lists
21476 /* Leave the scope of the class. */
21481 }
21482 }
21484 /* We did not really want to consume any tokens. */
21488 }
21490 /* Parse the definition of the function given by the DECL_SPECIFIERS,
21491 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
21492 they must be performed once we are in the scope of the function.
21494 Returns the function defined. */
21496 static tree
21497 cp_parser_function_definition_from_specifiers_and_declarator
21500 tree attributes,
21502 {
21503 tree fn;
21506 /* Begin the function-definition. */
21509 /* The things we're about to see are not directly qualified by any
21510 template headers we've seen thus far. */
21513 /* If there were names looked up in the decl-specifier-seq that we
21514 did not check, check them now. We must wait until we are in the
21515 scope of the function to perform the checks, since the function
21516 might be a friend. */
21520 {
21521 /* Skip the entire function. */
21524 }
21526 {
21527 /* Seen already, skip it. An error message has already been output. */
21531 /* If this is a function from a class, pop the nested class. */
21534 }
21535 else
21536 {
21537 timevar_id_t tv;
21540 else
21546 }
21549 }
21551 /* Parse the part of a function-definition that follows the
21552 declarator. INLINE_P is TRUE iff this function is an inline
21553 function defined within a class-specifier.
21555 Returns the function defined. */
21557 static tree
21560 {
21561 tree fn;
21570 /* If the next token is `return', then the code may be trying to
21571 make use of the "named return value" extension that G++ used to
21572 support. */
21575 {
21576 /* Consume the `return' keyword. */
21578 /* Look for the identifier that indicates what value is to be
21579 returned. */
21581 /* Issue an error message. */
21584 /* Skip tokens until we reach the start of the function body. */
21586 {
21593 }
21594 }
21595 /* The `extern' in `extern "C" void f () { ... }' does not apply to
21596 anything declared inside `f'. */
21597 saved_in_unbraced_linkage_specification_p
21600 /* Inside the function, surrounding template-parameter-lists do not
21601 apply. */
21602 saved_num_template_parameter_lists
21608 /* If the next token is `try', `__transaction_atomic', or
21609 `__transaction_relaxed`, then we are looking at either function-try-block
21610 or function-transaction-block. Note that all of these include the
21611 function-body. */
21614 RID_TRANSACTION_ATOMIC);
21616 RID_TRANSACTION_RELAXED))
21618 RID_TRANSACTION_RELAXED);
21621 else
21622 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21627 /* Finish the function. */
21630 /* Generate code for it, if necessary. */
21632 /* Restore the saved values. */
21633 parser->in_unbraced_linkage_specification_p
21635 parser->num_template_parameter_lists
21640 }
21642 /* Parse a template-declaration, assuming that the `export' (and
21643 `extern') keywords, if present, has already been scanned. MEMBER_P
21644 is as for cp_parser_template_declaration. */
21646 static void
21648 {
21651 tree parameter_list;
21656 /* Look for the `template' keyword. */
21661 /* And the `<'. */
21665 {
21666 /* 14.5.2.2 [temp.mem]
21668 A local class shall not have member templates. */
21673 }
21674 /* [temp]
21676 A template ... shall not have C linkage. */
21678 {
21680 /* Give it C++ linkage to avoid confusing other parts of the
21681 front end. */
21684 }
21685 else
21688 /* We cannot perform access checks on the template parameter
21689 declarations until we know what is being declared, just as we
21690 cannot check the decl-specifier list. */
21693 /* If the next token is `>', then we have an invalid
21694 specialization. Rather than complain about an invalid template
21695 parameter, issue an error message here. */
21697 {
21701 }
21702 else
21703 {
21704 /* Parse the template parameters. */
21706 }
21708 /* Get the deferred access checks from the parameter list. These
21709 will be checked once we know what is being declared, as for a
21710 member template the checks must be performed in the scope of the
21711 class containing the member. */
21714 /* Look for the `>'. */
21716 /* We just processed one more parameter list. */
21718 /* If the next token is `template', there are more template
21719 parameters. */
21721 RID_TEMPLATE))
21726 else
21727 {
21728 /* There are no access checks when parsing a template, as we do not
21729 know if a specialization will be a friend. */
21733 checks,
21734 member_p,
21739 /* If this is a member template declaration, let the front
21740 end know. */
21742 {
21747 }
21753 }
21754 /* We are done with the current parameter list. */
21759 /* Finish up. */
21762 /* Check the template arguments for a literal operator template. */
21766 {
21770 else
21771 {
21775 else
21776 {
21782 }
21783 }
21787 decl);
21788 }
21789 /* Register member declarations. */
21792 /* For the erroneous case of a template with C linkage, we pushed an
21793 implicit C++ linkage scope; exit that scope now. */
21796 /* If DECL is a function template, we must return to parse it later.
21797 (Even though there is no definition, there might be default
21798 arguments that need handling.) */
21803 }
21805 /* Perform the deferred access checks from a template-parameter-list.
21806 CHECKS is a TREE_LIST of access checks, as returned by
21807 get_deferred_access_checks. */
21809 static void
21811 {
21815 }
21817 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
21818 `function-definition' sequence that follows a template header.
21819 If MEMBER_P is true, this declaration appears in a class scope.
21821 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
21822 *FRIEND_P is set to TRUE iff the declaration is a friend. */
21824 static tree
21830 {
21833 cp_decl_specifier_seq decl_specifiers;
21837 /* This function is only used when processing a template
21838 declaration. */
21842 /* Defer access checks until we know what is being declared. */
21845 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
21846 alternative. */
21849 CP_PARSER_FLAGS_OPTIONAL,
21855 /* There are no template typedefs. */
21857 {
21861 }
21863 /* Gather up the access checks that occurred the
21864 decl-specifier-seq. */
21867 /* Check for the declaration of a template class. */
21869 {
21871 {
21874 /* In this case:
21876 struct C {
21877 friend template <typename T> struct A<T>::B;
21878 };
21880 A<T>::B will be represented by a TYPENAME_TYPE, and
21881 therefore not recognized by shadow_tag. */
21883 && !decl
21890 else
21893 /* Perform access checks for template parameters. */
21895 }
21896 }
21898 /* Complain about missing 'typename' or other invalid type names. */
21901 {
21902 /* cp_parser_parse_and_diagnose_invalid_type_name calls
21903 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
21904 the rest of this declaration. */
21907 }
21909 /* If it's not a template class, try for a template function. If
21910 the next token is a `;', then this declaration does not declare
21911 anything. But, if there were errors in the decl-specifiers, then
21912 the error might well have come from an attempted class-specifier.
21913 In that case, there's no need to warn about a missing declarator. */
21917 {
21920 checks,
21922 member_p,
21923 declares_class_or_enum,
21925 NULL);
21927 /* 7.1.1-1 [dcl.stc]
21929 A storage-class-specifier shall not be specified in an explicit
21930 specialization... */
21932 && explicit_specialization_p
21934 {
21938 }
21942 }
21944 /* Look for a trailing `;' after the declaration. */
21950 out:
21953 /* Clear any current qualification; whatever comes next is the start
21954 of something new. */
21960 }
21962 /* Parse a cast-expression that is not the operand of a unary "&". */
21964 static tree
21966 {
21969 }
21971 /* Parse a functional cast to TYPE. Returns an expression
21972 representing the cast. */
21974 static tree
21976 {
21978 tree expression_list;
21979 tree cast;
21983 {
21990 tf_warning_or_error);
21991 }
22000 else
22001 {
22004 }
22007 tf_warning_or_error);
22008 /* [expr.const]/1: In an integral constant expression "only type
22009 conversions to integral or enumeration type can be used". */
22015 NIC_CONSTRUCTOR))
22018 }
22020 /* Save the tokens that make up the body of a member function defined
22021 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
22022 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
22023 specifiers applied to the declaration. Returns the FUNCTION_DECL
22024 for the member function. */
22026 static tree
22030 tree attributes)
22031 {
22034 tree fn;
22036 /* Create the FUNCTION_DECL. */
22038 /* If something went badly wrong, bail out now. */
22040 {
22041 /* If there's a function-body, skip it. */
22046 }
22048 /* Remember it, if there default args to post process. */
22051 /* Save away the tokens that make up the body of the
22052 function. */
22054 /* We can have braced-init-list mem-initializers before the fn body. */
22056 {
22060 {
22061 /* cache_group will stop after an un-nested { } pair, too. */
22065 /* variadic mem-inits have ... after the ')'. */
22068 }
22069 }
22071 /* Handle function try blocks. */
22076 /* Save away the inline definition; we will process it when the
22077 class is complete. */
22081 /* We need to know that this was defined in the class, so that
22082 friend templates are handled correctly. */
22085 /* Add FN to the queue of functions to be parsed later. */
22089 }
22091 /* Save the tokens that make up the in-class initializer for a non-static
22092 data member. Returns a DEFAULT_ARG. */
22094 static tree
22096 {
22098 }
22100 /* Parse a template-argument-list, as well as the trailing ">" (but
22101 not the opening "<"). See cp_parser_template_argument_list for the
22102 return value. */
22104 static tree
22106 {
22107 tree arguments;
22108 tree saved_scope;
22109 tree saved_qualifying_scope;
22110 tree saved_object_scope;
22115 /* [temp.names]
22117 When parsing a template-id, the first non-nested `>' is taken as
22118 the end of the template-argument-list rather than a greater-than
22119 operator. */
22120 saved_greater_than_is_operator_p
22123 /* Parsing the argument list may modify SCOPE, so we save it
22124 here. */
22128 /* We need to evaluate the template arguments, even though this
22129 template-id may be nested within a "sizeof". */
22134 /* Parse the template-argument-list itself. */
22138 else
22140 /* Look for the `>' that ends the template-argument-list. If we find
22141 a '>>' instead, it's probably just a typo. */
22143 {
22145 {
22146 /* In C++0x, a `>>' in a template argument list or cast
22147 expression is considered to be two separate `>'
22148 tokens. So, change the current token to a `>', but don't
22149 consume it: it will be consumed later when the outer
22150 template argument list (or cast expression) is parsed.
22151 Note that this replacement of `>' for `>>' is necessary
22152 even if we are parsing tentatively: in the tentative
22153 case, after calling
22154 cp_parser_enclosed_template_argument_list we will always
22155 throw away all of the template arguments and the first
22156 closing `>', either because the template argument list
22157 was erroneous or because we are replacing those tokens
22158 with a CPP_TEMPLATE_ID token. The second `>' (which will
22159 not have been thrown away) is needed either to close an
22160 outer template argument list or to complete a new-style
22161 cast. */
22164 }
22166 {
22167 /* If we're in a nested template argument list, the '>>' has
22168 to be a typo for '> >'. We emit the error message, but we
22169 continue parsing and we push a '>' as next token, so that
22170 the argument list will be parsed correctly. Note that the
22171 global source location is still on the token before the
22172 '>>', so we need to say explicitly where we want it. */
22178 }
22179 else
22180 {
22181 /* If this is not a nested template argument list, the '>>'
22182 is a typo for '>'. Emit an error message and continue.
22183 Same deal about the token location, but here we can get it
22184 right by consuming the '>>' before issuing the diagnostic. */
22187 "spurious %<>>%>, use %<>%> to terminate "
22189 }
22190 }
22191 else
22193 /* The `>' token might be a greater-than operator again now. */
22194 parser->greater_than_is_operator_p
22196 /* Restore the SAVED_SCOPE. */
22204 }
22206 /* MEMBER_FUNCTION is a member function, or a friend. If default
22207 arguments, or the body of the function have not yet been parsed,
22208 parse them now. */
22210 static void
22212 {
22214 /* If this member is a template, get the underlying
22215 FUNCTION_DECL. */
22219 /* There should not be any class definitions in progress at this
22220 point; the bodies of members are only parsed outside of all class
22221 definitions. */
22223 /* While we're parsing the member functions we might encounter more
22224 classes. We want to handle them right away, but we don't want
22225 them getting mixed up with functions that are currently in the
22226 queue. */
22229 /* Make sure that any template parameters are in scope. */
22232 /* If the body of the function has not yet been parsed, parse it
22233 now. */
22235 {
22236 tree function_scope;
22239 /* The function is no longer pending; we are processing it. */
22244 /* If this is a local class, enter the scope of the containing
22245 function. */
22250 /* Push the body of the function onto the lexer stack. */
22253 /* Let the front end know that we going to be defining this
22254 function. */
22258 /* Don't do access checking if it is a templated function. */
22262 /* Now, parse the body of the function. */
22269 /* Leave the scope of the containing function. */
22273 }
22275 /* Remove any template parameters from the symbol table. */
22278 /* Restore the queue. */
22281 }
22283 /* If DECL contains any default args, remember it on the unparsed
22284 functions queue. */
22286 static void
22288 {
22289 tree probe;
22292 probe;
22295 {
22300 }
22301 }
22303 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
22304 which is either a FIELD_DECL or PARM_DECL. Parse it and return
22305 the result. For a PARM_DECL, PARMTYPE is the corresponding type
22306 from the parameter-type-list. */
22308 static tree
22311 {
22313 tree parsed_arg;
22319 /* Push the saved tokens for the default argument onto the parser's
22320 lexer stack. */
22326 /* Parse the default argument. */
22337 {
22338 /* In a non-template class, check conversions now. In a template,
22339 we'll wait and instantiate these as needed. */
22342 else
22343 {
22349 }
22350 }
22352 /* If the token stream has not been completely used up, then
22353 there was extra junk after the end of the default
22354 argument. */
22356 {
22359 else
22361 }
22363 /* Revert to the main lexer. */
22367 }
22369 /* FIELD is a non-static data member with an initializer which we saved for
22370 later; parse it now. */
22372 static void
22374 {
22375 tree def;
22380 NULL_TREE);
22384 }
22386 /* FN is a FUNCTION_DECL which may contains a parameter with an
22387 unparsed DEFAULT_ARG. Parse the default args now. This function
22388 assumes that the current scope is the scope in which the default
22389 argument should be processed. */
22391 static void
22393 {
22397 /* While we're parsing the default args, we might (due to the
22398 statement expression extension) encounter more classes. We want
22399 to handle them right away, but we don't want them getting mixed
22400 up with default args that are currently in the queue. */
22403 /* Local variable names (and the `this' keyword) may not appear
22404 in a default argument. */
22415 {
22417 tree parsed_arg;
22419 tree copy;
22426 /* This can happen for a friend declaration for a function
22427 already declared with default arguments. */
22430 parsed_arg
22432 default_arg,
22435 {
22437 }
22441 /* Update any instantiations we've already created. */
22445 }
22449 /* Make sure no default arg is missing. */
22452 /* Restore the state of local_variables_forbidden_p. */
22455 /* Restore the queue. */
22457 }
22459 /* Parse the operand of `sizeof' (or a similar operator). Returns
22460 either a TYPE or an expression, depending on the form of the
22461 input. The KEYWORD indicates which kind of expression we have
22462 encountered. */
22464 static tree
22466 {
22474 /* Types cannot be defined in a `sizeof' expression. Save away the
22475 old message. */
22477 /* And create the new one. */
22483 /* The restrictions on constant-expressions do not apply inside
22484 sizeof expressions. */
22485 saved_integral_constant_expression_p
22487 saved_non_integral_constant_expression_p
22491 /* If it's a `...', then we are computing the length of a parameter
22492 pack. */
22495 {
22496 /* Consume the `...'. */
22500 /* Note that this is an expansion. */
22502 }
22504 /* Do not actually evaluate the expression. */
22507 /* If it's a `(', then we might be looking at the type-id
22508 construction. */
22510 {
22511 tree type;
22514 /* We can't be sure yet whether we're looking at a type-id or an
22515 expression. */
22517 /* Consume the `('. */
22519 /* Parse the type-id. */
22524 /* Now, look for the trailing `)'. */
22526 /* If all went well, then we're done. */
22528 {
22529 cp_decl_specifier_seq decl_specs;
22531 /* Build a trivial decl-specifier-seq. */
22535 /* Call grokdeclarator to figure out what type this is. */
22538 TYPENAME,
22541 }
22542 }
22547 /* If the type-id production did not work out, then we must be
22548 looking at the unary-expression production. */
22554 /* Build a pack expansion. */
22557 /* Go back to evaluating expressions. */
22561 /* Free the message we created. */
22563 /* And restore the old one. */
22565 parser->integral_constant_expression_p
22567 parser->non_integral_constant_expression_p
22571 }
22573 /* If the current declaration has no declarator, return true. */
22575 static bool
22577 {
22578 /* If the next token is a `;' or a `,' then there is no
22579 declarator. */
22582 }
22584 /* Update the DECL_SPECS to reflect the storage class indicated by
22585 KEYWORD. */
22587 static void
22592 {
22593 cp_storage_class storage_class;
22596 {
22600 }
22602 {
22605 }
22610 {
22613 }
22616 {
22634 }
22638 /* A storage class specifier cannot be applied alongside a typedef
22639 specifier. If there is a typedef specifier present then set
22640 conflicting_specifiers_p which will trigger an error later
22641 on in grokdeclarator. */
22644 }
22646 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
22647 is true, the type is a class or enum definition. */
22649 static void
22651 tree type_spec,
22654 {
22657 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
22658 (with, for example, in "typedef int wchar_t;") we remember that
22659 this is what happened. In system headers, we ignore these
22660 declarations so that G++ can work with system headers that are not
22661 C++-safe. */
22663 && !type_definition_p
22673 {
22676 ds_redefined_builtin_type_spec,
22677 token);
22679 {
22683 }
22684 }
22687 else
22688 {
22693 }
22694 }
22696 /* True iff TOKEN is the GNU keyword __thread. */
22698 static bool
22700 {
22703 }
22705 /* Set the location for a declarator specifier and check if it is
22706 duplicated.
22708 DECL_SPECS is the sequence of declarator specifiers onto which to
22709 set the location.
22711 DS is the single declarator specifier to set which location is to
22712 be set onto the existing sequence of declarators.
22714 LOCATION is the location for the declarator specifier to
22715 consider. */
22717 static void
22720 {
22729 {
22733 }
22734 else
22735 {
22737 {
22741 else
22742 {
22745 OPT_Wlong_long,
22747 }
22748 }
22750 {
22755 else
22757 }
22758 else
22759 {
22775 "__complex"
22776 };
22779 }
22780 }
22781 }
22783 /* Return true iff the declarator specifier DS is present in the
22784 sequence of declarator specifiers DECL_SPECS. */
22786 bool
22788 cp_decl_spec ds)
22789 {
22796 }
22798 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
22799 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
22801 static bool
22803 {
22805 }
22807 /* Issue an error message indicating that TOKEN_DESC was expected.
22808 If KEYWORD is true, it indicated this function is called by
22809 cp_parser_require_keword and the required token can only be
22810 a indicated keyword. */
22812 static void
22814 required_token token_desc,
22816 {
22818 {
22887 }
22889 {
22891 {
22970 }
22971 }
22972 else
22974 }
22978 /* If the next token is of the indicated TYPE, consume it. Otherwise,
22979 issue an error message indicating that TOKEN_DESC was expected.
22981 Returns the token consumed, if the token had the appropriate type.
22982 Otherwise, returns NULL. */
22987 required_token token_desc)
22988 {
22991 else
22992 {
22993 /* Output the MESSAGE -- unless we're parsing tentatively. */
22997 }
22998 }
23000 /* An error message is produced if the next token is not '>'.
23001 All further tokens are skipped until the desired token is
23002 found or '{', '}', ';' or an unbalanced ')' or ']'. */
23004 static void
23006 {
23007 /* Current level of '< ... >'. */
23009 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
23012 /* Are we ready, yet? If not, issue error message. */
23016 /* Skip tokens until the desired token is found. */
23018 {
23019 /* Peek at the next token. */
23021 {
23029 /* C++0x views the `>>' operator as two `>' tokens, but
23030 C++98 does not. */
23033 {
23034 /* We've hit a `>>' where the first `>' closes the
23035 template argument list, and the second `>' is
23036 spurious. Just consume the `>>' and stop; we've
23037 already produced at least one error. */
23040 }
23041 /* Fall through for C++0x, so we handle the second `>' in
23042 the `>>'. */
23046 {
23047 /* We've reached the token we want, consume it and stop. */
23050 }
23069 /* The '>' was probably forgotten, don't look further. */
23074 }
23076 /* Consume this token. */
23078 }
23079 }
23081 /* If the next token is the indicated keyword, consume it. Otherwise,
23082 issue an error message indicating that TOKEN_DESC was expected.
23084 Returns the token consumed, if the token had the appropriate type.
23085 Otherwise, returns NULL. */
23090 required_token token_desc)
23091 {
23095 {
23098 }
23101 }
23103 /* Returns TRUE iff TOKEN is a token that can begin the body of a
23104 function-definition. */
23106 static bool
23108 {
23111 /* A ctor-initializer begins with a `:'. */
23113 /* A function-try-block begins with `try'. */
23115 /* A function-transaction-block begins with `__transaction_atomic'
23116 or `__transaction_relaxed'. */
23119 /* The named return value extension begins with `return'. */
23121 }
23123 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
23124 definition. */
23126 static bool
23128 {
23133 }
23135 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
23136 C++0x) ending a template-argument. */
23138 static bool
23140 {
23148 }
23150 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
23151 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
23153 static bool
23156 {
23162 /* Check for the sequence `<::' in the original code. It would be lexed as
23163 `[:', where `[' is a digraph, and there is no whitespace before
23164 `:'. */
23166 {
23171 }
23173 }
23175 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
23176 or none_type otherwise. */
23178 static enum tag_types
23180 {
23182 {
23192 }
23193 }
23195 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
23197 static void
23199 {
23203 {
23207 type);
23210 }
23211 }
23213 /* Issue an error message if DECL is redeclared with different
23214 access than its original declaration [class.access.spec/3].
23215 This applies to nested classes and nested class templates.
23216 [class.mem/1]. */
23218 static void
23220 {
23229 }
23231 /* Look for the `template' keyword, as a syntactic disambiguator.
23232 Return TRUE iff it is present, in which case it will be
23233 consumed. */
23235 static bool
23237 {
23239 {
23240 /* The `template' keyword can only be used within templates;
23241 outside templates the parser can always figure out what is a
23242 template and what is not. */
23244 {
23247 "%<template%> (as a disambiguator) is only allowed "
23249 /* If this part of the token stream is rescanned, the same
23250 error message would be generated. So, we purge the token
23251 from the stream. */
23254 }
23255 else
23256 {
23257 /* Consume the `template' keyword. */
23260 }
23261 }
23264 }
23266 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
23267 set PARSER->SCOPE, and perform other related actions. */
23269 static void
23271 {
23277 /* Get the stored value. */
23279 /* Perform any access checks that were deferred. */
23282 {
23287 }
23288 /* Set the scope from the stored value. */
23292 }
23294 /* Consume tokens up through a non-nested END token. Returns TRUE if we
23295 encounter the end of a block before what we were looking for. */
23297 static bool
23301 {
23303 {
23306 /* Abort a parenthesized expression if we encounter a semicolon. */
23310 /* If we've reached the end of the file, stop. */
23316 /* We've hit the end of an enclosing block, so there's been some
23317 kind of syntax error. */
23320 /* Consume the token. */
23322 /* See if it starts a new group. */
23324 {
23326 /* In theory this should probably check end == '}', but
23327 cp_parser_save_member_function_body needs it to exit
23328 after either '}' or ')' when called with ')'. */
23331 }
23333 {
23337 }
23342 }
23343 }
23345 /* Like above, for caching a default argument or NSDMI. Both of these are
23346 terminated by a non-nested comma, but it can be unclear whether or not a
23347 comma is nested in a template argument list unless we do more parsing.
23348 In order to handle this ambiguity, when we encounter a ',' after a '<'
23349 we try to parse what follows as a parameter-declaration-list (in the
23350 case of a default argument) or a member-declarator (in the case of an
23351 NSDMI). If that succeeds, then we stop caching. */
23353 static tree
23355 {
23360 tree default_argument;
23362 /* Add tokens until we have processed the entire default
23363 argument. We add the range [first_token, token). */
23366 {
23367 /* For list-initialization, this is straightforward. */
23370 }
23372 {
23375 /* Peek at the next token. */
23377 /* What we do depends on what token we have. */
23379 {
23380 /* In valid code, a default argument must be
23381 immediately followed by a `,' `)', or `...'. */
23384 {
23385 /* If we've seen a '<', we might be in a
23386 template-argument-list. Until Core issue 325 is
23387 resolved, we don't know how this situation ought
23388 to be handled, so try to DTRT. We check whether
23389 what comes after the comma is a valid parameter
23390 declaration list. If it is, then the comma ends
23391 the default argument; otherwise the default
23392 argument continues. */
23394 tree t;
23396 /* Set ITALP so cp_parser_parameter_declaration_list
23397 doesn't decide to commit to this parse. */
23405 {
23411 }
23412 else
23413 {
23419 }
23426 }
23429 /* If we run into a non-nested `;', `}', or `]',
23430 then the code is invalid -- but the default
23431 argument is certainly over. */
23437 /* Update DEPTH, if necessary. */
23452 /* This might be the comparison operator, or it might
23453 start a template argument list. */
23460 /* Fall through for C++0x, which treats the `>>'
23461 operator like two `>' tokens in certain
23462 cases. */
23466 {
23467 /* This might be an operator, or it might close a
23468 template argument list. But if a previous '<'
23469 started a template argument list, this will have
23470 closed it, so we can't be in one anymore. */
23474 }
23477 /* If we run out of tokens, issue an error message. */
23486 /* In these cases, we should look for template-ids.
23487 For example, if the default argument is
23488 `X<int, double>()', we need to do name lookup to
23489 figure out whether or not `X' is a template; if
23490 so, the `,' does not end the default argument.
23492 That is not yet done. */
23497 }
23499 /* If we've reached the end, stop. */
23503 /* Add the token to the token block. */
23505 }
23507 /* Create a DEFAULT_ARG to represent the unparsed default
23508 argument. */
23515 }
23517 /* Begin parsing tentatively. We always save tokens while parsing
23518 tentatively so that if the tentative parsing fails we can restore the
23519 tokens. */
23521 static void
23523 {
23524 /* Enter a new parsing context. */
23526 /* Begin saving tokens. */
23528 /* In order to avoid repetitive access control error messages,
23529 access checks are queued up until we are no longer parsing
23530 tentatively. */
23532 }
23534 /* Commit to the currently active tentative parse. */
23536 static void
23538 {
23542 /* Mark all of the levels as committed. */
23545 {
23552 }
23553 }
23555 /* Abort the currently active tentative parse. All consumed tokens
23556 will be rolled back, and no diagnostics will be issued. */
23558 static void
23560 {
23564 /* Now, pretend that we want to see if the construct was
23565 successfully parsed. */
23567 }
23569 /* Stop parsing tentatively. If a parse error has occurred, restore the
23570 token stream. Otherwise, commit to the tokens we have consumed.
23571 Returns true if no error occurred; false otherwise. */
23573 static bool
23575 {
23579 /* Remember whether or not an error occurred, since we are about to
23580 destroy that information. */
23582 /* Remove the topmost context from the stack. */
23585 /* If no parse errors occurred, commit to the tentative parse. */
23587 {
23588 /* Commit to the tokens read tentatively, unless that was
23589 already done. */
23594 }
23595 /* Otherwise, if errors occurred, roll back our state so that things
23596 are just as they were before we began the tentative parse. */
23597 else
23598 {
23601 }
23602 /* Add the context to the front of the free list. */
23607 }
23609 /* Returns true if we are parsing tentatively and are not committed to
23610 this tentative parse. */
23612 static bool
23614 {
23617 }
23619 /* Returns nonzero iff an error has occurred during the most recent
23620 tentative parse. */
23622 static bool
23624 {
23627 }
23629 /* Returns nonzero if GNU extensions are allowed. */
23631 static bool
23633 {
23635 }
23636 \f
23637 /* Objective-C++ Productions */
23640 /* Parse an Objective-C expression, which feeds into a primary-expression
23641 above.
23643 objc-expression:
23644 objc-message-expression
23645 objc-string-literal
23646 objc-encode-expression
23647 objc-protocol-expression
23648 objc-selector-expression
23650 Returns a tree representation of the expression. */
23652 static tree
23654 {
23655 /* Try to figure out what kind of declaration is present. */
23659 {
23669 {
23681 }
23687 }
23690 }
23692 /* Parse an Objective-C message expression.
23694 objc-message-expression:
23695 [ objc-message-receiver objc-message-args ]
23697 Returns a representation of an Objective-C message. */
23699 static tree
23701 {
23710 }
23712 /* Parse an objc-message-receiver.
23714 objc-message-receiver:
23715 expression
23716 simple-type-specifier
23718 Returns a representation of the type or expression. */
23720 static tree
23722 {
23723 tree rcv;
23725 /* An Objective-C message receiver may be either (1) a type
23726 or (2) an expression. */
23735 CP_PARSER_FLAGS_NONE);
23738 }
23740 /* Parse the arguments and selectors comprising an Objective-C message.
23742 objc-message-args:
23743 objc-selector
23744 objc-selector-args
23745 objc-selector-args , objc-comma-args
23747 objc-selector-args:
23748 objc-selector [opt] : assignment-expression
23749 objc-selector-args objc-selector [opt] : assignment-expression
23751 objc-comma-args:
23752 assignment-expression
23753 objc-comma-args , assignment-expression
23755 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
23756 selector arguments and TREE_VALUE containing a list of comma
23757 arguments. */
23759 static tree
23761 {
23767 {
23773 /* Detect if we have a unary selector. */
23782 sel_args
23787 }
23789 /* Handle non-selector arguments, if any. */
23791 {
23792 tree arg;
23797 addl_args
23802 }
23805 {
23808 }
23811 }
23813 /* Parse an Objective-C encode expression.
23815 objc-encode-expression:
23816 @encode objc-typename
23818 Returns an encoded representation of the type argument. */
23820 static tree
23822 {
23823 tree type;
23833 {
23837 }
23839 /* This happens if we find @encode(T) (where T is a template
23840 typename or something dependent on a template typename) when
23841 parsing a template. In that case, we can't compile it
23842 immediately, but we rather create an AT_ENCODE_EXPR which will
23843 need to be instantiated when the template is used.
23844 */
23846 {
23850 }
23853 }
23855 /* Parse an Objective-C @defs expression. */
23857 static tree
23859 {
23860 tree name;
23868 }
23870 /* Parse an Objective-C protocol expression.
23872 objc-protocol-expression:
23873 @protocol ( identifier )
23875 Returns a representation of the protocol expression. */
23877 static tree
23879 {
23880 tree proto;
23888 }
23890 /* Parse an Objective-C selector expression.
23892 objc-selector-expression:
23893 @selector ( objc-method-signature )
23895 objc-method-signature:
23896 objc-selector
23897 objc-selector-seq
23899 objc-selector-seq:
23900 objc-selector :
23901 objc-selector-seq objc-selector :
23903 Returns a representation of the method selector. */
23905 static tree
23907 {
23919 {
23928 {
23929 /* Detect if we have a unary selector. */
23931 {
23934 }
23935 else
23936 {
23938 }
23939 }
23944 {
23945 sel_seq
23948 sel_seq
23951 }
23952 else
23953 sel_seq
23958 }
23960 finish_selector:
23964 }
23966 /* Parse a list of identifiers.
23968 objc-identifier-list:
23969 identifier
23970 objc-identifier-list , identifier
23972 Returns a TREE_LIST of identifier nodes. */
23974 static tree
23976 {
23977 tree identifier;
23978 tree list;
23989 {
23996 identifier));
23998 }
24001 }
24003 /* Parse an Objective-C alias declaration.
24005 objc-alias-declaration:
24006 @compatibility_alias identifier identifier ;
24008 This function registers the alias mapping with the Objective-C front end.
24009 It returns nothing. */
24011 static void
24013 {
24021 }
24023 /* Parse an Objective-C class forward-declaration.
24025 objc-class-declaration:
24026 @class objc-identifier-list ;
24028 The function registers the forward declarations with the Objective-C
24029 front end. It returns nothing. */
24031 static void
24033 {
24036 {
24037 tree id;
24047 else
24049 }
24051 }
24053 /* Parse a list of Objective-C protocol references.
24055 objc-protocol-refs-opt:
24056 objc-protocol-refs [opt]
24058 objc-protocol-refs:
24059 < objc-identifier-list >
24061 Returns a TREE_LIST of identifiers, if any. */
24063 static tree
24065 {
24069 {
24073 }
24076 }
24078 /* Parse a Objective-C visibility specification. */
24080 static void
24082 {
24086 {
24101 }
24103 /* Eat '@private'/'@protected'/'@public'. */
24105 }
24107 /* Parse an Objective-C method type. Return 'true' if it is a class
24108 (+) method, and 'false' if it is an instance (-) method. */
24112 {
24115 else
24117 }
24119 /* Parse an Objective-C protocol qualifier. */
24121 static tree
24123 {
24136 {
24141 }
24144 }
24146 /* Parse an Objective-C typename. */
24148 static tree
24150 {
24154 {
24160 /* An ObjC type name may consist of just protocol qualifiers, in which
24161 case the type shall default to 'id'. */
24163 {
24166 /* If the type could not be parsed, an error has already
24167 been produced. For error recovery, behave as if it had
24168 not been specified, which will use the default type
24169 'id'. */
24171 {
24173 /* We need to skip to the closing parenthesis as
24174 cp_parser_type_id() does not seem to do it for
24175 us. */
24180 }
24181 }
24185 }
24188 }
24190 /* Check to see if TYPE refers to an Objective-C selector name. */
24192 static bool
24194 {
24200 }
24202 /* Parse an Objective-C selector. */
24204 static tree
24206 {
24210 {
24213 }
24215 /* C++ operator names are allowed to appear in ObjC selectors. */
24217 {
24230 }
24231 }
24233 /* Parse an Objective-C params list. */
24235 static tree
24237 {
24243 {
24253 /* Detect if we have a unary selector. */
24256 {
24259 }
24263 {
24264 /* Something went quite wrong. There should be a colon
24265 here, but there is not. Stop parsing parameters. */
24267 }
24269 /* New ObjC allows attributes on parameters too. */
24274 params
24277 type_name,
24278 identifier,
24279 parm_attr));
24282 }
24285 {
24288 }
24290 /* We allow tail attributes for the method. */
24292 {
24300 }
24303 {
24306 }
24308 }
24310 /* Parse the non-keyword Objective-C params. */
24312 static tree
24315 {
24321 {
24323 tree parm;
24329 {
24334 }
24336 /* TODO: parse attributes for tail parameters. */
24345 }
24347 /* We allow tail attributes for the method. */
24349 {
24351 {
24356 }
24357 else
24358 /* We have an error, but parse the attributes, so that we can
24359 carry on. */
24365 }
24368 }
24370 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
24372 static void
24374 {
24377 /* If the next token is `extern' and the following token is a string
24378 literal, then we have a linkage specification. */
24380 && cp_parser_is_pure_string_literal
24383 /* Handle #pragma, if any. */
24386 /* Allow stray semicolons. */
24389 /* Mark methods as optional or required, when building protocols. */
24391 {
24394 }
24396 {
24399 }
24402 /* Other stray characters must generate errors. */
24404 {
24408 }
24409 /* Finally, try to parse a block-declaration, or a function-definition. */
24410 else
24412 }
24414 /* Parse a method signature. */
24416 static tree
24418 {
24434 }
24436 static bool
24438 {
24439 tree tattr;
24444 /* If the attributes are followed by a method introducer, this is not allowed.
24445 Dump the attributes and flag the situation. */
24450 /* Otherwise, the attributes introduce some interstitial code, possibly so
24451 rewind to allow that check. */
24454 }
24456 /* Parse an Objective-C method prototype list. */
24458 static void
24460 {
24464 {
24466 {
24471 else
24475 {
24479 }
24482 }
24488 OPT_Wattributes,
24490 else
24491 /* Allow for interspersed non-ObjC++ code. */
24495 }
24499 else
24503 }
24505 /* Parse an Objective-C method definition list. */
24507 static void
24509 {
24513 {
24514 tree meth;
24517 {
24523 else
24528 {
24532 }
24534 NULL_TREE);
24536 /* For historical reasons, we accept an optional semicolon. */
24543 {
24550 }
24551 }
24552 /* The following case will be removed once @synthesize is
24553 completely implemented. */
24564 else
24565 /* Allow for interspersed non-ObjC++ code. */
24569 }
24573 else
24577 }
24579 /* Parse Objective-C ivars. */
24581 static void
24583 {
24594 {
24595 cp_decl_specifier_seq declspecs;
24597 tree prefix_attributes;
24605 CP_PARSER_FLAGS_OPTIONAL,
24609 /* auto, register, static, extern, mutable. */
24611 {
24614 }
24616 /* thread_local. */
24618 {
24621 }
24623 /* typedef. */
24625 {
24628 }
24633 /* Keep going until we hit the `;' at the end of the
24634 declaration. */
24636 {
24641 /* Check for a (possibly unnamed) bitfield declaration. */
24649 {
24650 /* Get the name of the bitfield. */
24653 sfk_none);
24655 eat_colon:
24657 /* Get the width of the bitfield. */
24658 width
24661 NULL);
24662 }
24663 else
24664 {
24665 /* Parse the declarator. */
24666 declarator
24671 }
24673 /* Look for attributes that apply to the ivar. */
24675 /* Remember which attributes are prefix attributes and
24676 which are not. */
24678 /* Combine the attributes. */
24682 /* Create the bitfield declaration. */
24684 width,
24685 attributes);
24686 else
24691 /* Add the instance variable. */
24695 /* Reset PREFIX_ATTRIBUTES. */
24704 {
24707 }
24709 }
24713 }
24718 /* Do not consume the RID_AT_END, so it will be read again as terminating
24719 the @interface of @implementation. */
24723 /* For historical reasons, we accept an optional semicolon. */
24726 }
24728 /* Parse an Objective-C protocol declaration. */
24730 static void
24732 {
24738 {
24743 }
24745 /* See if we have a forward declaration or a definition. */
24748 /* Try a forward declaration first. */
24750 {
24752 {
24753 tree id;
24763 else
24765 }
24767 }
24769 /* Ok, we got a full-fledged definition (or at least should). */
24770 else
24771 {
24776 }
24777 }
24779 /* Parse an Objective-C superclass or category. */
24781 static void
24786 {
24792 {
24795 }
24797 {
24800 /* If there is no category name, and this is an @interface, we
24801 have a class extension. */
24803 {
24806 }
24807 else
24811 }
24812 }
24814 /* Parse an Objective-C class interface. */
24816 static void
24818 {
24825 {
24826 /* It's hard to recover because even if valid @interface stuff
24827 is to follow, we can't compile it (or validate it) if we
24828 don't even know which class it refers to. Let's assume this
24829 was a stray '@interface' token in the stream and skip it.
24830 */
24832 }
24837 /* We have either a class or a category on our hands. */
24840 else
24841 {
24843 /* Handle instance variable declarations, if any. */
24846 }
24849 }
24851 /* Parse an Objective-C class implementation. */
24853 static void
24855 {
24862 {
24863 /* It's hard to recover because even if valid @implementation
24864 stuff is to follow, we can't compile it (or validate it) if
24865 we don't even know which class it refers to. Let's assume
24866 this was a stray '@implementation' token in the stream and
24867 skip it.
24868 */
24870 }
24874 /* We have either a class or a category on our hands. */
24877 else
24878 {
24880 /* Handle instance variable declarations, if any. */
24883 }
24886 }
24888 /* Consume the @end token and finish off the implementation. */
24890 static void
24892 {
24895 }
24897 /* Parse an Objective-C declaration. */
24899 static void
24901 {
24902 /* Try to figure out what kind of declaration is present. */
24907 {
24923 }
24926 {
24949 }
24950 }
24952 /* Parse an Objective-C try-catch-finally statement.
24954 objc-try-catch-finally-stmt:
24955 @try compound-statement objc-catch-clause-seq [opt]
24956 objc-finally-clause [opt]
24958 objc-catch-clause-seq:
24959 objc-catch-clause objc-catch-clause-seq [opt]
24961 objc-catch-clause:
24962 @catch ( objc-exception-declaration ) compound-statement
24964 objc-finally-clause:
24965 @finally compound-statement
24967 objc-exception-declaration:
24968 parameter-declaration
24969 '...'
24971 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
24973 Returns NULL_TREE.
24975 PS: This function is identical to c_parser_objc_try_catch_finally_statement
24976 for C. Keep them in sync. */
24978 static tree
24980 {
24981 location_t location;
24982 tree stmt;
24987 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
24988 node, lest it get absorbed into the surrounding block. */
24994 {
25003 {
25004 /* We have "@catch (...)" (where the '...' are literally
25005 what is in the code). Skip the '...'.
25006 parameter_declaration is set to NULL_TREE, and
25007 objc_being_catch_clauses() knows that that means
25008 '...'. */
25011 }
25012 else
25013 {
25014 /* We have "@catch (NSException *exception)" or something
25015 like that. Parse the parameter declaration. */
25019 else
25024 }
25027 else
25028 {
25029 /* If there was no open parenthesis, we are recovering from
25030 an error, and we are trying to figure out what mistake
25031 the user has made. */
25033 /* If there is an immediate closing parenthesis, the user
25034 probably forgot the opening one (ie, they typed "@catch
25035 NSException *e)". Parse the closing parenthesis and keep
25036 going. */
25040 /* If these is no immediate closing parenthesis, the user
25041 probably doesn't know that parenthesis are required at
25042 all (ie, they typed "@catch NSException *e"). So, just
25043 forget about the closing parenthesis and keep going. */
25044 }
25048 }
25050 {
25053 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
25054 node, lest it get absorbed into the surrounding block. */
25058 }
25061 }
25063 /* Parse an Objective-C synchronized statement.
25065 objc-synchronized-stmt:
25066 @synchronized ( expression ) compound-statement
25068 Returns NULL_TREE. */
25070 static tree
25072 {
25073 location_t location;
25084 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
25085 node, lest it get absorbed into the surrounding block. */
25090 }
25092 /* Parse an Objective-C throw statement.
25094 objc-throw-stmt:
25095 @throw assignment-expression [opt] ;
25097 Returns a constructed '@throw' statement. */
25099 static tree
25101 {
25113 }
25115 /* Parse an Objective-C statement. */
25117 static tree
25119 {
25120 /* Try to figure out what kind of declaration is present. */
25124 {
25135 }
25138 }
25140 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
25141 look ahead to see if an objc keyword follows the attributes. This
25142 is to detect the use of prefix attributes on ObjC @interface and
25143 @protocol. */
25145 static bool
25147 {
25152 {
25155 }
25158 }
25160 /* This routine is a minimal replacement for
25161 c_parser_struct_declaration () used when parsing the list of
25162 types/names or ObjC++ properties. For example, when parsing the
25163 code
25165 @property (readonly) int a, b, c;
25167 this function is responsible for parsing "int a, int b, int c" and
25168 returning the declarations as CHAIN of DECLs.
25170 TODO: Share this code with cp_parser_objc_class_ivars. It's very
25171 similar parsing. */
25172 static tree
25174 {
25176 cp_decl_specifier_seq declspecs;
25178 tree prefix_attributes;
25181 CP_PARSER_FLAGS_NONE,
25188 /* auto, register, static, extern, mutable. */
25190 {
25193 }
25195 /* thread_local. */
25197 {
25200 }
25202 /* typedef. */
25204 {
25207 }
25212 /* Keep going until we hit the `;' at the end of the declaration. */
25214 {
25219 /* Parse the declarator. */
25223 /* Look for attributes that apply to the ivar. */
25225 /* Remember which attributes are prefix attributes and
25226 which are not. */
25228 /* Combine the attributes. */
25238 /* Reset PREFIX_ATTRIBUTES. */
25249 {
25252 }
25253 else
25255 }
25257 }
25259 /* Parse an Objective-C @property declaration. The syntax is:
25261 objc-property-declaration:
25262 '@property' objc-property-attributes[opt] struct-declaration ;
25264 objc-property-attributes:
25265 '(' objc-property-attribute-list ')'
25267 objc-property-attribute-list:
25268 objc-property-attribute
25269 objc-property-attribute-list, objc-property-attribute
25271 objc-property-attribute
25272 'getter' = identifier
25273 'setter' = identifier
25274 'readonly'
25275 'readwrite'
25276 'assign'
25277 'retain'
25278 'copy'
25279 'nonatomic'
25281 For example:
25282 @property NSString *name;
25283 @property (readonly) id object;
25284 @property (retain, nonatomic, getter=getTheName) id name;
25285 @property int a, b, c;
25287 PS: This function is identical to
25288 c_parser_objc_at_property_declaration for C. Keep them in sync. */
25289 static void
25291 {
25292 /* The following variables hold the attributes of the properties as
25293 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
25294 seen. When we see an attribute, we set them to 'true' (if they
25295 are boolean properties) or to the identifier (if they have an
25296 argument, ie, for getter and setter). Note that here we only
25297 parse the list of attributes, check the syntax and accumulate the
25298 attributes that we find. objc_add_property_declaration() will
25299 then process the information. */
25309 /* 'properties' is the list of properties that we read. Usually a
25310 single one, but maybe more (eg, in "@property int a, b, c;" there
25311 are three). */
25312 tree properties;
25313 location_t loc;
25319 /* Parse the optional attribute list... */
25321 {
25322 /* Eat the '('. */
25326 {
25332 {
25335 }
25339 {
25350 {
25354 else
25359 }
25362 {
25366 }
25368 {
25370 {
25373 }
25374 else
25378 else
25380 }
25381 else
25382 {
25384 {
25387 }
25388 else
25390 }
25396 }
25403 else
25405 }
25407 /* FIXME: "@property (setter, assign);" will generate a spurious
25408 "error: expected ‘)’ before ‘,’ token". This is because
25409 cp_parser_require, unlike the C counterpart, will produce an
25410 error even if we are in error recovery. */
25412 {
25417 }
25418 }
25420 /* ... and the property declaration(s). */
25424 {
25426 /* If the next token is now a `;', consume it. */
25430 }
25434 else
25435 {
25436 /* Comma-separated properties are chained together in
25437 reverse order; add them one by one. */
25446 }
25449 }
25451 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
25453 objc-synthesize-declaration:
25454 @synthesize objc-synthesize-identifier-list ;
25456 objc-synthesize-identifier-list:
25457 objc-synthesize-identifier
25458 objc-synthesize-identifier-list, objc-synthesize-identifier
25460 objc-synthesize-identifier
25461 identifier
25462 identifier = identifier
25464 For example:
25465 @synthesize MyProperty;
25466 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
25468 PS: This function is identical to c_parser_objc_at_synthesize_declaration
25469 for C. Keep them in sync.
25470 */
25471 static void
25473 {
25475 location_t loc;
25480 {
25484 {
25487 }
25489 {
25493 {
25496 }
25497 }
25498 else
25503 else
25505 }
25508 }
25510 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
25512 objc-dynamic-declaration:
25513 @dynamic identifier-list ;
25515 For example:
25516 @dynamic MyProperty;
25517 @dynamic MyProperty, AnotherProperty;
25519 PS: This function is identical to c_parser_objc_at_dynamic_declaration
25520 for C. Keep them in sync.
25521 */
25522 static void
25524 {
25526 location_t loc;
25531 {
25532 tree property;
25535 {
25538 }
25542 else
25544 }
25547 }
25549 \f
25550 /* OpenMP 2.5 parsing routines. */
25552 /* Returns name of the next clause.
25553 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
25554 the token is not consumed. Otherwise appropriate pragma_omp_clause is
25555 returned and the token is consumed. */
25557 static pragma_omp_clause
25559 {
25569 {
25574 {
25621 }
25622 }
25628 }
25630 /* Validate that a clause of the given type does not already exist. */
25632 static void
25635 {
25636 tree c;
25640 {
25643 }
25644 }
25646 /* OpenMP 2.5:
25647 variable-list:
25648 identifier
25649 variable-list , identifier
25651 In addition, we match a closing parenthesis. An opening parenthesis
25652 will have been consumed by the caller.
25654 If KIND is nonzero, create the appropriate node and install the decl
25655 in OMP_CLAUSE_DECL and add the node to the head of the list.
25657 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
25658 return the list created. */
25660 static tree
25662 tree list)
25663 {
25666 {
25683 {
25688 }
25689 else
25692 get_comma:
25696 }
25699 {
25702 /* Try to resync to an unnested comma. Copied from
25703 cp_parser_parenthesized_expression_list. */
25704 skip_comma:
25711 }
25714 }
25716 /* Similarly, but expect leading and trailing parenthesis. This is a very
25717 common case for omp clauses. */
25719 static tree
25721 {
25725 }
25727 /* OpenMP 3.0:
25728 collapse ( constant-expression ) */
25730 static tree
25732 {
25734 location_t loc;
25735 HOST_WIDE_INT n;
25755 {
25758 }
25766 }
25768 /* OpenMP 2.5:
25769 default ( shared | none ) */
25771 static tree
25773 {
25775 tree c;
25780 {
25785 {
25800 }
25803 }
25804 else
25805 {
25806 invalid_kind:
25808 }
25824 }
25826 /* OpenMP 3.1:
25827 final ( expression ) */
25829 static tree
25831 {
25852 }
25854 /* OpenMP 2.5:
25855 if ( expression ) */
25857 static tree
25859 {
25880 }
25882 /* OpenMP 3.1:
25883 mergeable */
25885 static tree
25888 {
25889 tree c;
25892 location);
25897 }
25899 /* OpenMP 2.5:
25900 nowait */
25902 static tree
25905 {
25906 tree c;
25913 }
25915 /* OpenMP 2.5:
25916 num_threads ( expression ) */
25918 static tree
25920 location_t location)
25921 {
25943 }
25945 /* OpenMP 2.5:
25946 ordered */
25948 static tree
25951 {
25952 tree c;
25960 }
25962 /* OpenMP 2.5:
25963 reduction ( reduction-operator : variable-list )
25965 reduction-operator:
25966 One of: + * - & ^ | && ||
25968 OpenMP 3.1:
25970 reduction-operator:
25971 One of: + * - & ^ | && || min max */
25973 static tree
25975 {
25983 {
26009 {
26014 {
26017 }
26019 {
26022 }
26023 }
26024 /* FALLTHROUGH */
26028 resync_fail:
26033 }
26044 }
26046 /* OpenMP 2.5:
26047 schedule ( schedule-kind )
26048 schedule ( schedule-kind , expression )
26050 schedule-kind:
26051 static | dynamic | guided | runtime | auto */
26053 static tree
26055 {
26064 {
26069 {
26090 }
26091 }
26096 else
26101 {
26116 else
26121 }
26129 invalid_kind:
26131 resync_fail:
26136 }
26138 /* OpenMP 3.0:
26139 untied */
26141 static tree
26144 {
26145 tree c;
26152 }
26154 /* Parse all OpenMP clauses. The set clauses allowed by the directive
26155 is a bitmask in MASK. Return the list of clauses found; the result
26156 of clause default goes in *pdefault. */
26158 static tree
26161 {
26167 {
26168 pragma_omp_clause c_kind;
26180 {
26192 clauses);
26206 clauses);
26215 clauses);
26239 clauses);
26253 clauses);
26264 }
26267 {
26268 /* Remove the invalid clause(s) from the list to avoid
26269 confusing the rest of the compiler. */
26272 }
26273 }
26274 saw_error:
26277 }
26279 /* OpenMP 2.5:
26280 structured-block:
26281 statement
26283 In practice, we're also interested in adding the statement to an
26284 outer node. So it is convenient if we work around the fact that
26285 cp_parser_statement calls add_stmt. */
26287 static unsigned
26289 {
26292 /* Only move the values to IN_OMP_BLOCK if they weren't false.
26293 This preserves the "not within loop or switch" style error messages
26294 for nonsense cases like
26295 void foo() {
26296 #pragma omp single
26297 break;
26298 }
26299 */
26304 }
26306 static void
26308 {
26310 }
26312 static tree
26314 {
26322 }
26324 /* OpenMP 2.5:
26325 # pragma omp atomic new-line
26326 expression-stmt
26328 expression-stmt:
26329 x binop= expr | x++ | ++x | x-- | --x
26330 binop:
26331 +, *, -, /, &, ^, |, <<, >>
26333 where x is an lvalue expression with scalar type.
26335 OpenMP 3.1:
26336 # pragma omp atomic new-line
26337 update-stmt
26339 # pragma omp atomic read new-line
26340 read-stmt
26342 # pragma omp atomic write new-line
26343 write-stmt
26345 # pragma omp atomic update new-line
26346 update-stmt
26348 # pragma omp atomic capture new-line
26349 capture-stmt
26351 # pragma omp atomic capture new-line
26352 capture-block
26354 read-stmt:
26355 v = x
26356 write-stmt:
26357 x = expr
26358 update-stmt:
26359 expression-stmt | x = x binop expr
26360 capture-stmt:
26361 v = x binop= expr | v = x++ | v = ++x | v = x-- | v = --x
26362 capture-block:
26363 { v = x; update-stmt; } | { update-stmt; v = x; }
26365 where x and v are lvalue expressions with scalar type. */
26367 static void
26369 {
26376 {
26388 else
26392 }
26396 {
26407 else
26413 {
26414 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
26415 opcode. */
26420 }
26424 {
26427 }
26428 else
26429 {
26436 }
26439 }
26441 restart:
26446 {
26453 /* FALLTHROUGH */
26463 /* FALLTHROUGH */
26478 /* Undo effects of boolean_increment for post {in,de}crement. */
26480 /* FALLTHRU */
26484 {
26485 /* Undo effects of boolean_increment. */
26487 {
26488 /* This is pre or post increment. */
26493 && !structured_block
26497 }
26498 }
26499 /* FALLTHRU */
26502 {
26532 {
26542 {
26545 {
26553 }
26588 }
26599 }
26600 /* FALLTHROUGH */
26605 }
26612 }
26613 stmt_done:
26615 {
26628 }
26630 {
26633 }
26634 done:
26640 saw_error:
26643 {
26647 {
26651 }
26652 }
26653 }
26656 /* OpenMP 2.5:
26657 # pragma omp barrier new-line */
26659 static void
26661 {
26664 }
26666 /* OpenMP 2.5:
26667 # pragma omp critical [(name)] new-line
26668 structured-block */
26670 static tree
26672 {
26676 {
26688 }
26693 }
26695 /* OpenMP 2.5:
26696 # pragma omp flush flush-vars[opt] new-line
26698 flush-vars:
26699 ( variable-list ) */
26701 static void
26703 {
26709 }
26711 /* Helper function, to parse omp for increment expression. */
26713 static tree
26715 {
26720 {
26723 }
26726 {
26734 }
26736 /* If decl is an iterator, preserve LHS and RHS of the relational
26737 expr until finish_omp_for. */
26747 }
26749 /* Helper function, to parse omp for increment expression. */
26751 static tree
26753 {
26757 cp_id_kind idk;
26761 {
26769 }
26777 {
26782 }
26789 {
26793 }
26805 do
26806 {
26813 {
26815 {
26818 else
26820 tf_warning_or_error);
26821 }
26822 else
26825 }
26826 }
26830 {
26834 }
26835 else
26839 }
26841 /* Parse the restricted form of the for statement allowed by OpenMP. */
26843 static tree
26845 {
26849 location_t loc_first;
26868 {
26871 location_t loc;
26874 {
26877 }
26886 {
26887 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
26889 init-expr:
26890 var = lb
26891 integer-type var = lb
26892 random-access-iterator-type var = lb
26893 pointer-type var = lb
26894 */
26895 cp_decl_specifier_seq type_specifiers;
26897 /* First, try to parse as an initialized declaration. See
26898 cp_parser_condition, from whence the bulk of this is copied. */
26905 {
26906 /* If parsing a type specifier seq succeeded, then this
26907 MUST be a initialized declaration. */
26912 CP_PARSER_DECLARATOR_NAMED,
26922 else
26923 {
26933 {
26935 CPP_OPEN_PAREN))
26938 else
26939 /* Trigger an error. */
26944 }
26948 {
26956 {
26959 auto_node);
26964 }
26967 asm_specification,
26968 LOOKUP_ONLYCONVERTING);
26970 {
26973 }
26974 else
26977 }
26978 else
26979 {
26980 /* Consume '='. */
26984 non_class:
26987 else
26990 asm_specification,
26991 LOOKUP_ONLYCONVERTING);
26992 }
26996 }
26997 }
26998 else
26999 {
27000 cp_id_kind idk;
27001 /* If parsing a type specifier sequence failed, then
27002 this MUST be a simple expression. */
27007 && decl
27010 {
27011 tree rhs;
27018 rhs,
27019 tf_warning_or_error));
27021 }
27022 else
27023 {
27028 {
27032 }
27033 }
27034 }
27035 }
27038 {
27041 {
27047 }
27048 else
27050 }
27055 {
27060 {
27064 }
27067 {
27068 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
27069 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
27078 }
27079 else
27080 {
27085 }
27086 }
27089 {
27090 tree c;
27092 {
27101 decl);
27105 decl);
27106 }
27108 {
27113 {
27116 }
27117 }
27118 }
27127 {
27128 /* If decl is an iterator, preserve the operator on decl
27129 until finish_omp_for. */
27131 && ((processing_template_decl
27135 else
27139 }
27154 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
27155 in between the collapsed for loops to be still considered perfectly
27156 nested. Hopefully the final version clarifies this.
27157 For now handle (multiple) {'s and empty statements. */
27159 do
27160 {
27164 {
27166 bracecount++;
27167 }
27171 else
27172 {
27179 }
27180 }
27184 {
27187 }
27188 }
27190 /* Note that we saved the original contents of this flag when we entered
27191 the structured block, and so we don't need to re-save it here. */
27194 /* Note that the grammar doesn't call for a structured block here,
27195 though the loop as a whole is a structured block. */
27202 else
27207 {
27209 {
27211 nbraces--;
27212 }
27215 else
27216 {
27218 {
27221 }
27226 }
27227 }
27234 }
27236 /* OpenMP 2.5:
27237 #pragma omp for for-clause[optseq] new-line
27238 for-loop */
27240 #define OMP_FOR_CLAUSE_MASK \
27241 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27242 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27243 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
27244 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
27245 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
27246 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
27247 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT) \
27248 | (1u << PRAGMA_OMP_CLAUSE_COLLAPSE))
27250 static tree
27252 {
27268 }
27270 /* OpenMP 2.5:
27271 # pragma omp master new-line
27272 structured-block */
27274 static tree
27276 {
27280 }
27282 /* OpenMP 2.5:
27283 # pragma omp ordered new-line
27284 structured-block */
27286 static tree
27288 {
27292 }
27294 /* OpenMP 2.5:
27296 section-scope:
27297 { section-sequence }
27299 section-sequence:
27300 section-directive[opt] structured-block
27301 section-sequence section-directive structured-block */
27303 static tree
27305 {
27316 {
27323 {
27333 }
27339 }
27342 {
27350 {
27354 }
27356 {
27359 }
27364 }
27375 }
27377 /* OpenMP 2.5:
27378 # pragma omp sections sections-clause[optseq] newline
27379 sections-scope */
27381 #define OMP_SECTIONS_CLAUSE_MASK \
27382 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27383 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27384 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
27385 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
27386 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
27388 static tree
27390 {
27401 }
27403 /* OpenMP 2.5:
27404 # pragma parallel parallel-clause new-line
27405 # pragma parallel for parallel-for-clause new-line
27406 # pragma parallel sections parallel-sections-clause new-line */
27408 #define OMP_PARALLEL_CLAUSE_MASK \
27409 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
27410 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27411 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27412 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
27413 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
27414 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
27415 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
27416 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
27418 static tree
27420 {
27429 {
27435 }
27437 {
27441 {
27447 }
27448 }
27455 {
27475 }
27482 }
27484 /* OpenMP 2.5:
27485 # pragma omp single single-clause[optseq] new-line
27486 structured-block */
27488 #define OMP_SINGLE_CLAUSE_MASK \
27489 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27490 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27491 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
27492 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
27494 static tree
27496 {
27506 }
27508 /* OpenMP 3.0:
27509 # pragma omp task task-clause[optseq] new-line
27510 structured-block */
27512 #define OMP_TASK_CLAUSE_MASK \
27513 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
27514 | (1u << PRAGMA_OMP_CLAUSE_UNTIED) \
27515 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
27516 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27517 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27518 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
27519 | (1u << PRAGMA_OMP_CLAUSE_FINAL) \
27520 | (1u << PRAGMA_OMP_CLAUSE_MERGEABLE))
27522 static tree
27524 {
27535 }
27537 /* OpenMP 3.0:
27538 # pragma omp taskwait new-line */
27540 static void
27542 {
27545 }
27547 /* OpenMP 3.1:
27548 # pragma omp taskyield new-line */
27550 static void
27552 {
27555 }
27557 /* OpenMP 2.5:
27558 # pragma omp threadprivate (variable-list) */
27560 static void
27562 {
27563 tree vars;
27569 }
27571 /* Main entry point to OpenMP statement pragmas. */
27573 static void
27575 {
27576 tree stmt;
27579 {
27609 }
27613 }
27614 \f
27615 /* Transactional Memory parsing routines. */
27617 /* Parse a transaction attribute.
27619 txn-attribute:
27620 attribute
27621 [ [ identifier ] ]
27623 ??? Simplify this when C++0x bracket attributes are
27624 implemented properly. */
27626 static tree
27628 {
27643 {
27647 /* For keywords, use the canonical spelling,
27648 not the parsed identifier. */
27652 }
27653 else
27657 error1:
27660 }
27662 /* Parse a __transaction_atomic or __transaction_relaxed statement.
27664 transaction-statement:
27665 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
27666 compound-statement
27667 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
27668 */
27670 static tree
27672 {
27687 else
27688 {
27692 }
27694 /* Parse a noexcept specification. */
27697 /* Keep track if we're in the lexical scope of an outer transaction. */
27709 }
27711 /* Parse a __transaction_atomic or __transaction_relaxed expression.
27713 transaction-expression:
27714 __transaction_atomic txn-noexcept-spec[opt] ( expression )
27715 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
27716 */
27718 static tree
27720 {
27745 /* Set this early. This might mean that we allow transaction_cancel in
27746 an expression that we find out later actually has to be a constexpr.
27747 However, we expect that cxx_constant_value will be able to deal with
27748 this; also, if the noexcept has no constexpr, then what we parse next
27749 really is a transaction's body. */
27752 /* Parse a noexcept specification. */
27758 {
27765 }
27766 else
27767 {
27768 /* The only expression that is available got parsed for the noexcept
27769 already. noexcept is true then. */
27772 }
27781 }
27783 /* Parse a function-transaction-block.
27785 function-transaction-block:
27786 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
27787 function-body
27788 __transaction_atomic txn-attribute[opt] function-try-block
27789 __transaction_relaxed ctor-initializer[opt] function-body
27790 __transaction_relaxed function-try-block
27791 */
27793 static bool
27795 {
27811 else
27812 {
27816 }
27824 else
27825 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
27833 }
27835 /* Parse a __transaction_cancel statement.
27837 cancel-statement:
27838 __transaction_cancel txn-attribute[opt] ;
27839 __transaction_cancel txn-attribute[opt] throw-expression ;
27841 ??? Cancel and throw is not yet implemented. */
27843 static tree
27845 {
27851 RT_TRANSACTION_CANCEL);
27858 /* ??? Parse cancel-and-throw here. */
27863 {
27867 }
27869 {
27873 }
27875 {
27878 {
27884 }
27885 }
27887 {
27891 }
27898 }
27899 \f
27900 /* The parser. */
27904 \f
27905 /* Special handling for the first token or line in the file. The first
27906 thing in the file might be #pragma GCC pch_preprocess, which loads a
27907 PCH file, which is a GC collection point. So we need to handle this
27908 first pragma without benefit of an existing lexer structure.
27910 Always returns one token to the caller in *FIRST_TOKEN. This is
27911 either the true first token of the file, or the first token after
27912 the initial pragma. */
27914 static void
27916 {
27925 {
27932 }
27933 else
27936 /* Skip to the end of the pragma. */
27940 /* Now actually load the PCH file. */
27944 /* Read one more token to return to our caller. We have to do this
27945 after reading the PCH file in, since its pointers have to be
27946 live. */
27948 }
27950 /* Normal parsing of a pragma token. Here we can (and must) use the
27951 regular lexer. */
27953 static bool
27955 {
27965 {
27973 {
27983 }
27988 {
27998 }
28003 {
28009 "%<#pragma omp taskwait%> may only be "
28014 }
28019 {
28025 "%<#pragma omp taskyield%> may only be "
28030 }
28053 "%<#pragma omp section%> may only be used in "
28062 bad_stmt:
28065 }
28069 }
28071 /* The interface the pragma parsers have to the lexer. */
28073 enum cpp_ttype
28075 {
28088 else
28089 {
28093 }
28096 }
28098 \f
28099 /* External interface. */
28101 /* Parse one entire translation unit. */
28103 void
28105 {
28109 {
28112 }
28120 }