| blob | 7107134639e27796bd11304fd306afc798edb67d |
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);
7478 /* If the binary operator required the use of an overloaded operator,
7479 then this expression cannot be an integral constant-expression.
7480 An overloaded operator can be used even if both operands are
7481 otherwise permissible in an integral constant-expression if at
7482 least one of the operands is of enumeration type. */
7486 NIC_OVERLOADED))
7488 }
7491 }
7494 /* Parse the `? expression : assignment-expression' part of a
7495 conditional-expression. The LOGICAL_OR_EXPR is the
7496 logical-or-expression that started the conditional-expression.
7497 Returns a representation of the entire conditional-expression.
7499 This routine is used by cp_parser_assignment_expression.
7501 ? expression : assignment-expression
7503 GNU Extensions:
7505 ? : assignment-expression */
7507 static tree
7509 {
7510 tree expr;
7511 tree assignment_expr;
7515 /* Consume the `?' token. */
7520 {
7523 /* Implicit true clause. */
7527 }
7528 else
7529 {
7532 /* Parse the expression. */
7535 c_inhibit_evaluation_warnings +=
7539 }
7541 /* The next token should be a `:'. */
7543 /* Parse the assignment-expression. */
7547 /* Build the conditional-expression. */
7549 expr,
7550 assignment_expr,
7551 tf_warning_or_error);
7552 }
7554 /* Parse an assignment-expression.
7556 assignment-expression:
7557 conditional-expression
7558 logical-or-expression assignment-operator assignment_expression
7559 throw-expression
7561 CAST_P is true if this expression is the target of a cast.
7563 Returns a representation for the expression. */
7565 static tree
7568 {
7569 tree expr;
7571 /* If the next token is the `throw' keyword, then we're looking at
7572 a throw-expression. */
7575 /* Otherwise, it must be that we are looking at a
7576 logical-or-expression. */
7577 else
7578 {
7579 /* Parse the binary expressions (logical-or-expression). */
7582 /* If the next token is a `?' then we're actually looking at a
7583 conditional-expression. */
7586 else
7587 {
7590 /* If it's an assignment-operator, we're using the second
7591 production. */
7592 enum tree_code assignment_operator
7595 {
7597 location_t saved_input_location;
7599 /* Parse the right-hand side of the assignment. */
7605 /* An assignment may not appear in a
7606 constant-expression. */
7608 NIC_ASSIGNMENT))
7610 /* Build the assignment expression. Its default
7611 location is the location of the '=' token. */
7615 assignment_operator,
7616 rhs,
7617 tf_warning_or_error);
7619 }
7620 }
7621 }
7624 }
7626 /* Parse an (optional) assignment-operator.
7628 assignment-operator: one of
7629 = *= /= %= += -= >>= <<= &= ^= |=
7631 GNU Extension:
7633 assignment-operator: one of
7634 <?= >?=
7636 If the next token is an assignment operator, the corresponding tree
7637 code is returned, and the token is consumed. For example, for
7638 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
7639 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
7640 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
7641 operator, ERROR_MARK is returned. */
7643 static enum tree_code
7645 {
7649 /* Peek at the next token. */
7653 {
7699 /* Nothing else is an assignment operator. */
7701 }
7703 /* If it was an assignment operator, consume it. */
7708 }
7710 /* Parse an expression.
7712 expression:
7713 assignment-expression
7714 expression , assignment-expression
7716 CAST_P is true if this expression is the target of a cast.
7718 Returns a representation of the expression. */
7720 static tree
7722 {
7727 {
7728 tree assignment_expression;
7730 /* Parse the next assignment-expression. */
7731 assignment_expression
7733 /* If this is the first assignment-expression, we can just
7734 save it away. */
7737 else
7739 assignment_expression,
7740 tf_warning_or_error);
7741 /* If the next token is not a comma, then we are done with the
7742 expression. */
7745 /* Consume the `,'. */
7748 /* A comma operator cannot appear in a constant-expression. */
7751 }
7754 }
7756 /* Parse a constant-expression.
7758 constant-expression:
7759 conditional-expression
7761 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
7762 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
7763 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
7764 is false, NON_CONSTANT_P should be NULL. */
7766 static tree
7770 {
7774 tree expression;
7776 /* It might seem that we could simply parse the
7777 conditional-expression, and then check to see if it were
7778 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
7779 one that the compiler can figure out is constant, possibly after
7780 doing some simplifications or optimizations. The standard has a
7781 precise definition of constant-expression, and we must honor
7782 that, even though it is somewhat more restrictive.
7784 For example:
7786 int i[(2, 3)];
7788 is not a legal declaration, because `(2, 3)' is not a
7789 constant-expression. The `,' operator is forbidden in a
7790 constant-expression. However, GCC's constant-folding machinery
7791 will fold this operation to an INTEGER_CST for `3'. */
7793 /* Save the old settings. */
7795 saved_allow_non_integral_constant_expression_p
7798 /* We are now parsing a constant-expression. */
7800 parser->allow_non_integral_constant_expression_p
7803 /* Although the grammar says "conditional-expression", we parse an
7804 "assignment-expression", which also permits "throw-expression"
7805 and the use of assignment operators. In the case that
7806 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
7807 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
7808 actually essential that we look for an assignment-expression.
7809 For example, cp_parser_initializer_clauses uses this function to
7810 determine whether a particular assignment-expression is in fact
7811 constant. */
7813 /* Restore the old settings. */
7814 parser->integral_constant_expression_p
7816 parser->allow_non_integral_constant_expression_p
7819 {
7820 /* Require an rvalue constant expression here; that's what our
7821 callers expect. Reference constant expressions are handled
7822 separately in e.g. cp_parser_template_argument. */
7827 }
7830 parser->non_integral_constant_expression_p
7834 }
7836 /* Parse __builtin_offsetof.
7838 offsetof-expression:
7839 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
7841 offsetof-member-designator:
7842 id-expression
7843 | offsetof-member-designator "." id-expression
7844 | offsetof-member-designator "[" expression "]"
7845 | offsetof-member-designator "->" id-expression */
7847 static tree
7849 {
7852 cp_id_kind dummy;
7855 /* We're about to accept non-integral-constant things, but will
7856 definitely yield an integral constant expression. Save and
7857 restore these values around our local parsing. */
7861 /* Consume the "__builtin_offsetof" token. */
7863 /* Consume the opening `('. */
7865 /* Parse the type-id. */
7867 /* Look for the `,'. */
7871 /* Build the (type *)null that begins the traditional offsetof macro. */
7873 tf_warning_or_error);
7875 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
7879 {
7882 {
7884 /* offsetof-member-designator "[" expression "]" */
7889 /* offsetof-member-designator "->" identifier */
7891 /* FALLTHRU */
7894 /* offsetof-member-designator "." identifier */
7902 /* Consume the ")" token. */
7907 /* Error. We know the following require will fail, but
7908 that gives the proper error message. */
7913 }
7914 }
7916 success:
7917 /* If we're processing a template, we can't finish the semantics yet.
7918 Otherwise we can fold the entire expression now. */
7921 else
7924 failure:
7929 }
7931 /* Parse a trait expression.
7933 Returns a representation of the expression, the underlying type
7934 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
7936 static tree
7938 {
7939 cp_trait_kind kind;
7942 cp_decl_specifier_seq decl_specs;
7945 {
8022 }
8024 /* Consume the token. */
8034 /* Build a trivial decl-specifier-seq. */
8038 /* Call grokdeclarator to figure out what type this is. */
8043 {
8051 /* Build a trivial decl-specifier-seq. */
8055 /* Call grokdeclarator to figure out what type this is. */
8058 }
8062 /* Complete the trait expression, which may mean either processing
8063 the trait expr now or saving it for template instantiation. */
8065 {
8074 }
8075 }
8077 /* Lambdas that appear in variable initializer or default argument scope
8078 get that in their mangling, so we need to record it. We might as well
8079 use the count for function and namespace scopes as well. */
8083 {
8084 tree t;
8091 static void
8093 {
8094 tree_int ti;
8096 /* Once we're inside a function, we ignore other scopes and just push
8097 the function again so that popping works properly. */
8104 {
8105 /* Don't reset the count if we're still in the same function. */
8108 }
8109 }
8111 static void
8113 {
8116 }
8118 static void
8120 {
8123 {
8126 }
8128 }
8130 /* Parse a lambda expression.
8132 lambda-expression:
8133 lambda-introducer lambda-declarator [opt] compound-statement
8135 Returns a representation of the expression. */
8137 static tree
8139 {
8141 tree type;
8151 /* We may be in the middle of deferred access check. Disable
8152 it now. */
8163 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8166 /* Now that we've started the type, add the capture fields for any
8167 explicit captures. */
8170 {
8171 /* Inside the class, surrounding template-parameter-lists do not apply. */
8172 unsigned int saved_num_template_parameter_lists
8181 /* By virtue of defining a local class, a lambda expression has access to
8182 the private variables of enclosing classes. */
8191 /* The capture list was built up in reverse order; fix that now. */
8192 {
8198 {
8202 }
8204 }
8214 }
8218 /* This field is only used during parsing of the lambda. */
8221 /* This lambda shouldn't have any proxies left at this point. */
8223 /* And now that we're done, push proxies for an enclosing lambda. */
8228 else
8230 }
8232 /* Parse the beginning of a lambda expression.
8234 lambda-introducer:
8235 [ lambda-capture [opt] ]
8237 LAMBDA_EXPR is the current representation of the lambda expression. */
8239 static void
8241 {
8242 /* Need commas after the first capture. */
8245 /* Eat the leading `['. */
8248 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8256 {
8259 }
8262 {
8264 tree capture_id;
8265 tree capture_init_expr;
8269 enum capture_kind_type
8270 {
8271 BY_COPY,
8272 BY_REFERENCE
8273 };
8277 {
8280 }
8284 else
8287 /* Possibly capture `this'. */
8289 {
8299 explicit_init_p);
8301 }
8303 /* Remember whether we want to capture as a reference or not. */
8305 {
8308 }
8310 /* Get the identifier. */
8315 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8316 delimiters, but I modified this to stop on unnested ']' as well. It
8317 was already changed to stop on unnested '}', so the
8318 "closing_parenthesis" name is no more misleading with my change. */
8319 {
8325 }
8327 /* Find the initializer for this capture. */
8329 {
8330 /* An explicit expression exists. */
8333 "ISO C++ does not allow initializers "
8339 }
8340 else
8341 {
8344 /* Turn the identifier into an id-expression. */
8345 capture_init_expr
8346 = cp_parser_lookup_name
8348 capture_id,
8349 none_type,
8357 {
8360 }
8364 {
8367 capture_init_expr);
8370 }
8373 {
8376 capture_init_expr);
8379 }
8381 capture_init_expr
8382 = finish_id_expression
8384 capture_init_expr,
8396 }
8400 {
8405 capture_id);
8409 "capture of %qD redundant with by-reference capture "
8411 }
8414 capture_id,
8415 capture_init_expr,
8417 explicit_init_p);
8418 }
8421 }
8423 /* Parse the (optional) middle of a lambda expression.
8425 lambda-declarator:
8426 ( parameter-declaration-clause [opt] )
8427 attribute-specifier [opt]
8428 mutable [opt]
8429 exception-specification [opt]
8430 lambda-return-type-clause [opt]
8432 LAMBDA_EXPR is the current representation of the lambda expression. */
8434 static bool
8436 {
8437 /* 5.1.1.4 of the standard says:
8438 If a lambda-expression does not include a lambda-declarator, it is as if
8439 the lambda-declarator were ().
8440 This means an empty parameter list, no attributes, and no exception
8441 specification. */
8445 tree t;
8447 /* The lambda-declarator is optional, but must begin with an opening
8448 parenthesis if present. */
8450 {
8455 /* Parse parameters. */
8458 /* Default arguments shall not be specified in the
8459 parameter-declaration-clause of a lambda-declarator. */
8469 /* Parse optional `mutable' keyword. */
8471 {
8474 }
8476 /* Parse optional exception specification. */
8479 /* Parse optional trailing return type. */
8481 {
8484 }
8486 /* The function parameters must be in scope all the way until after the
8487 trailing-return-type in case of decltype. */
8492 }
8494 /* Create the function call operator.
8496 Messing with declarators like this is no uglier than building up the
8497 FUNCTION_DECL by hand, and this is less likely to get out of sync with
8498 other code. */
8499 {
8500 cp_decl_specifier_seq return_type_specs;
8502 tree fco;
8509 else
8510 /* Maybe we will deduce the return type later. */
8516 sfk_none);
8521 VIRT_SPEC_UNSPECIFIED,
8522 exception_spec,
8527 declarator,
8528 attributes);
8530 {
8533 /* Give the object parameter a different name. */
8535 }
8542 }
8543 }
8545 /* Parse the body of a lambda expression, which is simply
8547 compound-statement
8549 but which requires special handling.
8550 LAMBDA_EXPR is the current representation of the lambda expression. */
8552 static void
8554 {
8559 else
8560 /* Still increment function_depth so that we don't GC in the
8561 middle of an expression. */
8563 /* Clear this in case we're in the middle of a default argument. */
8566 /* Finish the function call operator
8567 - class_specifier
8568 + late_parsing_for_member
8569 + function_definition_after_declarator
8570 + ctor_initializer_opt_and_function_body */
8571 {
8573 tree body;
8575 tree compound_stmt;
8576 tree cap;
8578 /* Let the front end know that we are going to be defining this
8579 function. */
8581 NULL_TREE,
8590 /* Push the proxies for any explicit captures. */
8597 /* 5.1.1.4 of the standard says:
8598 If a lambda-expression does not include a trailing-return-type, it
8599 is as if the trailing-return-type denotes the following type:
8600 * if the compound-statement is of the form
8601 { return attribute-specifier [opt] expression ; }
8602 the type of the returned expression after lvalue-to-rvalue
8603 conversion (_conv.lval_ 4.1), array-to-pointer conversion
8604 (_conv.array_ 4.2), and function-to-pointer conversion
8605 (_conv.func_ 4.3);
8606 * otherwise, void. */
8608 /* In a lambda that has neither a lambda-return-type-clause
8609 nor a deducible form, errors should be reported for return statements
8610 in the body. Since we used void as the placeholder return type, parsing
8611 the body as usual will give such desired behavior. */
8615 {
8619 /* Parse tentatively in case there's more after the initial return
8620 statement. */
8631 {
8635 /* Will get error here if type not deduced yet. */
8639 }
8640 }
8643 {
8648 }
8652 out:
8656 /* Finish the function and generate code for it if necessary. */
8658 }
8663 else
8665 }
8667 /* Statements [gram.stmt.stmt] */
8669 /* Parse a statement.
8671 statement:
8672 labeled-statement
8673 expression-statement
8674 compound-statement
8675 selection-statement
8676 iteration-statement
8677 jump-statement
8678 declaration-statement
8679 try-block
8681 C++11:
8683 statement:
8684 labeled-statement
8685 attribute-specifier-seq (opt) expression-statement
8686 attribute-specifier-seq (opt) compound-statement
8687 attribute-specifier-seq (opt) selection-statement
8688 attribute-specifier-seq (opt) iteration-statement
8689 attribute-specifier-seq (opt) jump-statement
8690 declaration-statement
8691 attribute-specifier-seq (opt) try-block
8693 TM Extension:
8695 statement:
8696 atomic-statement
8698 IN_COMPOUND is true when the statement is nested inside a
8699 cp_parser_compound_statement; this matters for certain pragmas.
8701 If IF_P is not NULL, *IF_P is set to indicate whether the statement
8702 is a (possibly labeled) if statement which is not enclosed in braces
8703 and has an else clause. This is used to implement -Wparentheses. */
8705 static void
8708 {
8713 restart:
8716 /* There is no statement yet. */
8722 /* In obj-c++, seing '[[' might be the either the beginning of
8723 c++11 attributes, or a nested objc-message-expression. So
8724 let's parse the c++11 attributes tentatively. */
8728 {
8731 }
8733 /* Peek at the next token. */
8735 /* Remember the location of the first token in the statement. */
8737 /* If this is a keyword, then that will often determine what kind of
8738 statement we have. */
8740 {
8744 {
8747 /* Looks like a labeled-statement with a case label.
8748 Parse the label, and then use tail recursion to parse
8749 the statement. */
8771 /* Objective-C++ exception-handling constructs. */
8785 /* This must be a namespace alias definition. */
8798 /* It might be a keyword like `int' that can start a
8799 declaration-statement. */
8801 }
8802 }
8804 {
8805 /* If the next token is a `:', then we are looking at a
8806 labeled-statement. */
8809 {
8810 /* Looks like a labeled-statement with an ordinary label.
8811 Parse the label, and then use tail recursion to parse
8812 the statement. */
8816 }
8817 }
8818 /* Anything that starts with a `{' must be a compound-statement. */
8821 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
8822 a statement all its own. */
8824 {
8825 /* Only certain OpenMP pragmas are attached to statements, and thus
8826 are considered statements themselves. All others are not. In
8827 the context of a compound, accept the pragma as a "statement" and
8828 return so that we can check for a close brace. Otherwise we
8829 require a real statement and must go back and read one. */
8835 }
8837 {
8840 }
8842 /* Everything else must be a declaration-statement or an
8843 expression-statement. Try for the declaration-statement
8844 first, unless we are looking at a `;', in which case we know that
8845 we have an expression-statement. */
8847 {
8849 {
8851 {
8852 /* Attributes should be parsed as part of the the
8853 declaration, so let's un-parse them. */
8856 }
8859 /* Try to parse the declaration-statement. */
8861 /* If that worked, we're done. */
8864 }
8865 /* Look for an expression-statement instead. */
8867 }
8869 /* Set the line number for the statement. */
8873 /* Note that for now, we don't do anything with c++11 statements
8874 parsed at this level. */
8877 OPT_Wattributes,
8879 }
8881 /* Parse the label for a labeled-statement, i.e.
8883 identifier :
8884 case constant-expression :
8885 default :
8887 GNU Extension:
8888 case constant-expression ... constant-expression : statement
8890 When a label is parsed without errors, the label is added to the
8891 parse tree by the finish_* functions, so this function doesn't
8892 have to return the label. */
8894 static void
8896 {
8901 /* The next token should be an identifier. */
8905 {
8908 }
8912 {
8914 {
8918 /* Consume the `case' token. */
8920 /* Parse the constant-expression. */
8923 NULL);
8927 {
8928 /* Consume the `...' token. */
8930 expr_hi =
8933 NULL);
8934 /* We don't need to emit warnings here, as the common code
8935 will do this for us. */
8936 }
8937 else
8942 else
8945 expr);
8946 }
8950 /* Consume the `default' token. */
8955 else
8960 /* Anything else must be an ordinary label. */
8963 }
8965 /* Require the `:' token. */
8968 /* An ordinary label may optionally be followed by attributes.
8969 However, this is only permitted if the attributes are then
8970 followed by a semicolon. This is because, for backward
8971 compatibility, when parsing
8972 lab: __attribute__ ((unused)) int i;
8973 we want the attribute to attach to "i", not "lab". */
8976 {
8977 tree attrs;
8984 ;
8985 else
8987 }
8993 }
8995 /* Parse an expression-statement.
8997 expression-statement:
8998 expression [opt] ;
9000 Returns the new EXPR_STMT -- or NULL_TREE if the expression
9001 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
9002 indicates whether this expression-statement is part of an
9003 expression statement. */
9005 static tree
9007 {
9011 /* If the next token is a ';', then there is no expression
9012 statement. */
9016 /* Give a helpful message for "A<T>::type t;" and the like. */
9019 {
9026 {
9027 /* A::A a; */
9032 }
9033 }
9035 /* Consume the final `;'. */
9040 /* This is the final expression statement of a statement
9041 expression. */
9045 else
9049 }
9051 /* Parse a compound-statement.
9053 compound-statement:
9054 { statement-seq [opt] }
9056 GNU extension:
9058 compound-statement:
9059 { label-declaration-seq [opt] statement-seq [opt] }
9061 label-declaration-seq:
9062 label-declaration
9063 label-declaration-seq label-declaration
9065 Returns a tree representing the statement. */
9067 static tree
9070 {
9071 tree compound_stmt;
9073 /* Consume the `{'. */
9080 /* Begin the compound-statement. */
9082 /* If the next keyword is `__label__' we have a label declaration. */
9085 /* Parse an (optional) statement-seq. */
9087 /* Finish the compound-statement. */
9089 /* Consume the `}'. */
9093 }
9095 /* Parse an (optional) statement-seq.
9097 statement-seq:
9098 statement
9099 statement-seq [opt] statement */
9101 static void
9103 {
9104 /* Scan statements until there aren't any more. */
9106 {
9109 /* If we are looking at a `}', then we have run out of
9110 statements; the same is true if we have reached the end
9111 of file, or have stumbled upon a stray '@end'. */
9118 /* If we are in a compound statement and find 'else' then
9119 something went wrong. */
9121 {
9124 else
9125 {
9128 }
9129 }
9131 /* Parse the statement. */
9133 }
9134 }
9136 /* Parse a selection-statement.
9138 selection-statement:
9139 if ( condition ) statement
9140 if ( condition ) statement else statement
9141 switch ( condition ) statement
9143 Returns the new IF_STMT or SWITCH_STMT.
9145 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9146 is a (possibly labeled) if statement which is not enclosed in
9147 braces and has an else clause. This is used to implement
9148 -Wparentheses. */
9150 static tree
9152 {
9159 /* Peek at the next token. */
9162 /* See what kind of keyword it is. */
9165 {
9168 {
9169 tree statement;
9170 tree condition;
9172 /* Look for the `('. */
9174 {
9177 }
9179 /* Begin the selection-statement. */
9182 else
9185 /* Parse the condition. */
9187 /* Look for the `)'. */
9193 {
9197 /* Add the condition. */
9200 /* Parse the then-clause. */
9204 {
9212 }
9213 else
9219 /* If the next token is `else', parse the else-clause. */
9221 RID_ELSE))
9222 {
9223 /* Consume the `else' keyword. */
9226 /* Parse the else-clause. */
9228 {
9229 location_t loc;
9236 }
9237 else
9242 /* If we are currently parsing a then-clause, then
9243 IF_P will not be NULL. We set it to true to
9244 indicate that this if statement has an else clause.
9245 This may trigger the Wparentheses warning below
9246 when we get back up to the parent if statement. */
9249 }
9250 else
9251 {
9252 /* This if statement does not have an else clause. If
9253 NESTED_IF is true, then the then-clause is an if
9254 statement which does have an else clause. We warn
9255 about the potential ambiguity. */
9258 "suggest explicit braces to avoid ambiguous"
9260 }
9262 /* Now we're all done with the if-statement. */
9264 }
9265 else
9266 {
9270 /* Add the condition. */
9273 /* Parse the body of the switch-statement. */
9282 /* Now we're all done with the switch-statement. */
9284 }
9287 }
9293 }
9294 }
9296 /* Parse a condition.
9298 condition:
9299 expression
9300 type-specifier-seq declarator = initializer-clause
9301 type-specifier-seq declarator braced-init-list
9303 GNU Extension:
9305 condition:
9306 type-specifier-seq declarator asm-specification [opt]
9307 attributes [opt] = assignment-expression
9309 Returns the expression that should be tested. */
9311 static tree
9313 {
9314 cp_decl_specifier_seq type_specifiers;
9318 /* Try the declaration first. */
9320 /* New types are not allowed in the type-specifier-seq for a
9321 condition. */
9323 parser->type_definition_forbidden_message
9325 /* Parse the type-specifier-seq. */
9327 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9330 /* Restore the saved message. */
9332 /* If all is well, we might be looking at a declaration. */
9334 {
9335 tree decl;
9336 tree asm_specification;
9337 tree attributes;
9341 /* Parse the declarator. */
9346 /* Parse the attributes. */
9348 /* Parse the asm-specification. */
9350 /* If the next token is not an `=' or '{', then we might still be
9351 looking at an expression. For example:
9353 if (A(a).x)
9355 looks like a decl-specifier-seq and a declarator -- but then
9356 there is no `=', so this is an expression. */
9361 /* If we did see an `=' or '{', then we are looking at a declaration
9362 for sure. */
9364 {
9365 tree pushed_scope;
9369 /* Create the declaration. */
9375 /* Parse the initializer. */
9377 {
9381 }
9382 else
9383 {
9384 /* Consume the `='. */
9387 }
9391 /* Process the initializer. */
9394 asm_specification,
9395 flags);
9401 }
9402 }
9403 /* If we didn't even get past the declarator successfully, we are
9404 definitely not looking at a declaration. */
9405 else
9408 /* Otherwise, we are looking at an expression. */
9410 }
9412 /* Parses a for-statement or range-for-statement until the closing ')',
9413 not included. */
9415 static tree
9417 {
9421 /* Begin the for-statement. */
9424 /* Parse the initialization. */
9429 else
9431 }
9433 static tree
9435 {
9436 /* Normal for loop */
9439 tree stmt;
9442 /* The for-init-statement has already been parsed in
9443 cp_parser_for_init_statement, so no work is needed here. */
9446 /* If there's a condition, process it. */
9450 /* Look for the `;'. */
9453 /* If there's an expression, process it. */
9459 }
9461 /* Tries to parse a range-based for-statement:
9463 range-based-for:
9464 decl-specifier-seq declarator : expression
9466 The decl-specifier-seq declarator and the `:' are already parsed by
9467 cp_parser_for_init_statement. If processing_template_decl it returns a
9468 newly created RANGE_FOR_STMT; if not, it is converted to a
9469 regular FOR_STMT. */
9471 static tree
9473 {
9477 {
9480 }
9481 else
9484 /* If in template, STMT is converted to a normal for-statement
9485 at instantiation. If not, it is done just ahead. */
9487 {
9493 /* do_auto_deduction doesn't mess with template init-lists. */
9496 }
9497 else
9498 {
9501 }
9503 }
9505 /* Subroutine of cp_convert_range_for: given the initializer expression,
9506 builds up the range temporary. */
9508 static tree
9510 {
9513 /* Find out the type deduced by the declaration
9514 `auto &&__range = range_expr'. */
9519 /* Create the __range variable. */
9526 }
9528 /* Used by cp_parser_range_for in template context: we aren't going to
9529 do a full conversion yet, but we still need to resolve auto in the
9530 type of the for-range-declaration if present. This is basically
9531 a shortcut version of cp_convert_range_for. */
9533 static void
9535 {
9538 {
9541 iter_type = (cp_parser_perform_range_for_lookup
9545 tf_warning_or_error);
9548 }
9549 }
9551 /* Converts a range-based for-statement into a normal
9552 for-statement, as per the definition.
9554 for (RANGE_DECL : RANGE_EXPR)
9555 BLOCK
9557 should be equivalent to:
9559 {
9560 auto &&__range = RANGE_EXPR;
9561 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
9562 __begin != __end;
9563 ++__begin)
9564 {
9565 RANGE_DECL = *__begin;
9566 BLOCK
9567 }
9568 }
9570 If RANGE_EXPR is an array:
9571 BEGIN_EXPR = __range
9572 END_EXPR = __range + ARRAY_SIZE(__range)
9573 Else if RANGE_EXPR has a member 'begin' or 'end':
9574 BEGIN_EXPR = __range.begin()
9575 END_EXPR = __range.end()
9576 Else:
9577 BEGIN_EXPR = begin(__range)
9578 END_EXPR = end(__range);
9580 If __range has a member 'begin' but not 'end', or vice versa, we must
9581 still use the second alternative (it will surely fail, however).
9582 When calling begin()/end() in the third alternative we must use
9583 argument dependent lookup, but always considering 'std' as an associated
9584 namespace. */
9586 tree
9588 {
9594 /* If an error happened previously do nothing or else a lot of
9595 unhelpful errors would be issued. */
9597 else
9598 {
9603 LOOKUP_ONLYCONVERTING);
9608 }
9610 /* The new for initialization statement. */
9618 LOOKUP_ONLYCONVERTING);
9627 LOOKUP_ONLYCONVERTING);
9631 /* The new for condition. */
9638 /* The new increment expression. */
9643 /* The declaration is initialized with *__begin inside the loop body. */
9646 tf_warning_or_error),
9648 LOOKUP_ONLYCONVERTING);
9651 }
9653 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
9654 We need to solve both at the same time because the method used
9655 depends on the existence of members begin or end.
9656 Returns the type deduced for the iterator expression. */
9658 static tree
9660 {
9662 {
9665 }
9668 {
9673 }
9675 {
9676 /* If RANGE is an array, we will use pointer arithmetic. */
9679 range,
9683 }
9684 else
9685 {
9686 /* If it is not an array, we must do a bit of magic. */
9696 tf_warning_or_error);
9699 tf_warning_or_error);
9702 {
9703 /* Use the member functions. */
9706 else
9712 else
9715 }
9716 else
9717 {
9718 /* Use global functions with ADL. */
9726 tf_warning_or_error);
9728 tf_warning_or_error);
9731 tf_warning_or_error);
9733 tf_warning_or_error);
9736 }
9738 /* Last common checks. */
9740 {
9741 /* If one of the expressions is an error do no more checks. */
9744 }
9745 else
9746 {
9748 /* The unqualified type of the __begin and __end temporaries should
9749 be the same, as required by the multiple auto declaration. */
9755 }
9756 }
9757 }
9759 /* Helper function for cp_parser_perform_range_for_lookup.
9760 Builds a tree for RANGE.IDENTIFIER(). */
9762 static tree
9764 {
9777 tf_warning_or_error);
9780 }
9782 /* Parse an iteration-statement.
9784 iteration-statement:
9785 while ( condition ) statement
9786 do statement while ( expression ) ;
9787 for ( for-init-statement condition [opt] ; expression [opt] )
9788 statement
9790 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
9792 static tree
9794 {
9797 tree statement;
9800 /* Peek at the next token. */
9805 /* Remember whether or not we are already within an iteration
9806 statement. */
9809 /* See what kind of keyword it is. */
9812 {
9814 {
9815 tree condition;
9817 /* Begin the while-statement. */
9819 /* Look for the `('. */
9821 /* Parse the condition. */
9824 /* Look for the `)'. */
9826 /* Parse the dependent statement. */
9830 /* We're done with the while-statement. */
9832 }
9836 {
9837 tree expression;
9839 /* Begin the do-statement. */
9841 /* Parse the body of the do-statement. */
9846 /* Look for the `while' keyword. */
9848 /* Look for the `('. */
9850 /* Parse the expression. */
9852 /* We're done with the do-statement. */
9854 /* Look for the `)'. */
9856 /* Look for the `;'. */
9858 }
9862 {
9863 /* Look for the `('. */
9868 /* Look for the `)'. */
9871 /* Parse the body of the for-statement. */
9876 /* We're done with the for-statement. */
9878 }
9885 }
9888 }
9890 /* Parse a for-init-statement or the declarator of a range-based-for.
9891 Returns true if a range-based-for declaration is seen.
9893 for-init-statement:
9894 expression-statement
9895 simple-declaration */
9897 static bool
9899 {
9900 /* If the next token is a `;', then we have an empty
9901 expression-statement. Grammatically, this is also a
9902 simple-declaration, but an invalid one, because it does not
9903 declare anything. Therefore, if we did not handle this case
9904 specially, we would issue an error message about an invalid
9905 declaration. */
9907 {
9913 /* We're going to speculatively look for a declaration, falling back
9914 to an expression, if necessary. */
9916 /* Parse the declaration. */
9919 decl);
9922 {
9923 /* It is a range-for, consume the ':' */
9927 {
9929 "range-based %<for%> loops are not allowed "
9932 }
9933 }
9934 else
9935 /* The ';' is not consumed yet because we told
9936 cp_parser_simple_declaration not to. */
9941 /* If the tentative parse failed, then we shall need to look for an
9942 expression-statement. */
9943 }
9944 /* If we are here, it is an expression-statement. */
9947 }
9949 /* Parse a jump-statement.
9951 jump-statement:
9952 break ;
9953 continue ;
9954 return expression [opt] ;
9955 return braced-init-list ;
9956 goto identifier ;
9958 GNU extension:
9960 jump-statement:
9961 goto * expression ;
9963 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
9965 static tree
9967 {
9973 /* Peek at the next token. */
9978 /* See what kind of keyword it is. */
9981 {
9985 {
10000 }
10006 {
10019 }
10024 {
10025 tree expr;
10029 {
10032 }
10035 else
10036 /* If the next token is a `;', then there is no
10037 expression. */
10039 /* Build the return-statement. */
10041 /* Look for the final `;'. */
10043 }
10047 /* Create the goto-statement. */
10049 {
10050 /* Issue a warning about this use of a GNU extension. */
10052 /* Consume the '*' token. */
10054 /* Parse the dependent expression. */
10056 }
10057 else
10059 /* Look for the final `;'. */
10066 }
10069 }
10071 /* Parse a declaration-statement.
10073 declaration-statement:
10074 block-declaration */
10076 static void
10078 {
10081 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10084 /* Parse the block-declaration. */
10087 /* Free any declarators allocated. */
10090 /* Finish off the statement. */
10092 }
10094 /* Some dependent statements (like `if (cond) statement'), are
10095 implicitly in their own scope. In other words, if the statement is
10096 a single statement (as opposed to a compound-statement), it is
10097 none-the-less treated as if it were enclosed in braces. Any
10098 declarations appearing in the dependent statement are out of scope
10099 after control passes that point. This function parses a statement,
10100 but ensures that is in its own scope, even if it is not a
10101 compound-statement.
10103 If IF_P is not NULL, *IF_P is set to indicate whether the statement
10104 is a (possibly labeled) if statement which is not enclosed in
10105 braces and has an else clause. This is used to implement
10106 -Wparentheses.
10108 Returns the new statement. */
10110 static tree
10112 {
10113 tree statement;
10118 /* Mark if () ; with a special NOP_EXPR. */
10120 {
10124 }
10125 /* if a compound is opened, we simply parse the statement directly. */
10128 /* If the token is not a `{', then we must take special action. */
10129 else
10130 {
10131 /* Create a compound-statement. */
10133 /* Parse the dependent-statement. */
10135 /* Finish the dummy compound-statement. */
10137 }
10139 /* Return the statement. */
10141 }
10143 /* For some dependent statements (like `while (cond) statement'), we
10144 have already created a scope. Therefore, even if the dependent
10145 statement is a compound-statement, we do not want to create another
10146 scope. */
10148 static void
10150 {
10151 /* If the token is a `{', then we must take special action. */
10154 else
10155 {
10156 /* Avoid calling cp_parser_compound_statement, so that we
10157 don't create a new scope. Do everything else by hand. */
10159 /* If the next keyword is `__label__' we have a label declaration. */
10162 /* Parse an (optional) statement-seq. */
10165 }
10166 }
10168 /* Declarations [gram.dcl.dcl] */
10170 /* Parse an optional declaration-sequence.
10172 declaration-seq:
10173 declaration
10174 declaration-seq declaration */
10176 static void
10178 {
10180 {
10191 {
10192 /* A declaration consisting of a single semicolon is
10193 invalid. Allow it unless we're being pedantic. */
10198 }
10200 /* If we're entering or exiting a region that's implicitly
10201 extern "C", modify the lang context appropriately. */
10203 {
10206 }
10208 {
10211 }
10214 {
10215 /* A top-level declaration can consist solely of a #pragma.
10216 A nested declaration cannot, so this is done here and not
10217 in cp_parser_declaration. (A #pragma at block scope is
10218 handled in cp_parser_statement.) */
10221 }
10223 /* Parse the declaration itself. */
10225 }
10226 }
10228 /* Parse a declaration.
10230 declaration:
10231 block-declaration
10232 function-definition
10233 template-declaration
10234 explicit-instantiation
10235 explicit-specialization
10236 linkage-specification
10237 namespace-definition
10239 GNU extension:
10241 declaration:
10242 __extension__ declaration */
10244 static void
10246 {
10247 cp_token token1;
10248 cp_token token2;
10253 /* Check for the `__extension__' keyword. */
10255 {
10256 /* Parse the qualified declaration. */
10258 /* Restore the PEDANTIC flag. */
10262 }
10264 /* Try to figure out what kind of declaration is present. */
10269 else
10270 {
10273 }
10275 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10278 /* If the next token is `extern' and the following token is a string
10279 literal, then we have a linkage specification. */
10283 /* If the next token is `template', then we have either a template
10284 declaration, an explicit instantiation, or an explicit
10285 specialization. */
10287 {
10288 /* `template <>' indicates a template specialization. */
10292 /* `template <' indicates a template declaration. */
10295 /* Anything else must be an explicit instantiation. */
10296 else
10298 }
10299 /* If the next token is `export', then we have a template
10300 declaration. */
10303 /* If the next token is `extern', 'static' or 'inline' and the one
10304 after that is `template', we have a GNU extended explicit
10305 instantiation directive. */
10312 /* If the next token is `namespace', check for a named or unnamed
10313 namespace definition. */
10319 /* An unnamed namespace definition. */
10323 /* An inline (associated) namespace definition. */
10327 /* Objective-C++ declaration/definition. */
10334 /* We must have either a block declaration or a function
10335 definition. */
10336 else
10337 /* Try to parse a block-declaration, or a function-definition. */
10340 /* Free any declarators allocated. */
10342 }
10344 /* Parse a block-declaration.
10346 block-declaration:
10347 simple-declaration
10348 asm-definition
10349 namespace-alias-definition
10350 using-declaration
10351 using-directive
10353 GNU Extension:
10355 block-declaration:
10356 __extension__ block-declaration
10358 C++0x Extension:
10360 block-declaration:
10361 static_assert-declaration
10363 If STATEMENT_P is TRUE, then this block-declaration is occurring as
10364 part of a declaration-statement. */
10366 static void
10369 {
10373 /* Check for the `__extension__' keyword. */
10375 {
10376 /* Parse the qualified declaration. */
10378 /* Restore the PEDANTIC flag. */
10382 }
10384 /* Peek at the next token to figure out which kind of declaration is
10385 present. */
10388 /* If the next keyword is `asm', we have an asm-definition. */
10390 {
10394 }
10395 /* If the next keyword is `namespace', we have a
10396 namespace-alias-definition. */
10399 /* If the next keyword is `using', we have a
10400 using-declaration, a using-directive, or an alias-declaration. */
10402 {
10407 /* If the token after `using' is `namespace', then we have a
10408 using-directive. */
10412 /* If the second token after 'using' is '=', then we have an
10413 alias-declaration. */
10419 /* Otherwise, it's a using-declaration. */
10420 else
10423 }
10424 /* If the next keyword is `__label__' we have a misplaced label
10425 declaration. */
10427 {
10431 /* If the next token is now a `;', consume it. */
10434 }
10435 /* If the next token is `static_assert' we have a static assertion. */
10438 /* Anything else must be a simple-declaration. */
10439 else
10442 }
10444 /* Parse a simple-declaration.
10446 simple-declaration:
10447 decl-specifier-seq [opt] init-declarator-list [opt] ;
10449 init-declarator-list:
10450 init-declarator
10451 init-declarator-list , init-declarator
10453 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
10454 function-definition as a simple-declaration.
10456 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
10457 parsed declaration if it is an uninitialized single declarator not followed
10458 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
10459 if present, will not be consumed. */
10461 static void
10465 {
10466 cp_decl_specifier_seq decl_specifiers;
10473 /* Defer access checks until we know what is being declared; the
10474 checks for names appearing in the decl-specifier-seq should be
10475 done as if we were in the scope of the thing being declared. */
10478 /* Parse the decl-specifier-seq. We have to keep track of whether
10479 or not the decl-specifier-seq declares a named class or
10480 enumeration type, since that is the only case in which the
10481 init-declarator-list is allowed to be empty.
10483 [dcl.dcl]
10485 In a simple-declaration, the optional init-declarator-list can be
10486 omitted only when declaring a class or enumeration, that is when
10487 the decl-specifier-seq contains either a class-specifier, an
10488 elaborated-type-specifier, or an enum-specifier. */
10490 CP_PARSER_FLAGS_OPTIONAL,
10493 /* We no longer need to defer access checks. */
10496 /* In a block scope, a valid declaration must always have a
10497 decl-specifier-seq. By not trying to parse declarators, we can
10498 resolve the declaration/expression ambiguity more quickly. */
10501 {
10504 }
10506 /* If the next two tokens are both identifiers, the code is
10507 erroneous. The usual cause of this situation is code like:
10509 T t;
10511 where "T" should name a type -- but does not. */
10514 {
10515 /* If parsing tentatively, we should commit; we really are
10516 looking at a declaration. */
10518 /* Give up. */
10520 }
10522 /* If we have seen at least one decl-specifier, and the next token
10523 is not a parenthesis, then we must be looking at a declaration.
10524 (After "int (" we might be looking at a functional cast.) */
10531 /* Keep going until we hit the `;' at the end of the simple
10532 declaration. */
10535 CPP_SEMICOLON))
10536 {
10539 tree decl;
10542 {
10543 /* If we are processing next declarator, coma is expected */
10549 }
10550 else
10553 /* Parse the init-declarator. */
10556 function_definition_allowed_p,
10558 declares_class_or_enum,
10560 maybe_range_for_decl);
10561 /* If an error occurred while parsing tentatively, exit quickly.
10562 (That usually happens when in the body of a function; each
10563 statement is treated as a declaration-statement until proven
10564 otherwise.) */
10567 /* Handle function definitions specially. */
10569 {
10570 /* If the next token is a `,', then we are probably
10571 processing something like:
10573 void f() {}, *p;
10575 which is erroneous. */
10577 {
10580 "mixing"
10582 }
10583 /* Otherwise, we're done with the list of declarators. */
10584 else
10585 {
10588 }
10589 }
10592 /* The next token should be either a `,' or a `;'. */
10594 /* If it's a `,', there are more declarators to come. */
10597 /* If it's a `;', we are done. */
10600 /* Anything else is an error. */
10601 else
10602 {
10603 /* If we have already issued an error message we don't need
10604 to issue another one. */
10608 /* Skip tokens until we reach the end of the statement. */
10610 /* If the next token is now a `;', consume it. */
10614 }
10615 /* After the first time around, a function-definition is not
10616 allowed -- even if it was OK at first. For example:
10618 int i, f() {}
10620 is not valid. */
10622 }
10624 /* Issue an error message if no declarators are present, and the
10625 decl-specifier-seq does not itself declare a class or
10626 enumeration. */
10628 {
10631 /* Perform any deferred access checks. */
10633 }
10635 /* Consume the `;'. */
10639 done:
10641 }
10643 /* Parse a decl-specifier-seq.
10645 decl-specifier-seq:
10646 decl-specifier-seq [opt] decl-specifier
10647 decl-specifier attribute-specifier-seq [opt] (C++11)
10649 decl-specifier:
10650 storage-class-specifier
10651 type-specifier
10652 function-specifier
10653 friend
10654 typedef
10656 GNU Extension:
10658 decl-specifier:
10659 attributes
10661 Set *DECL_SPECS to a representation of the decl-specifier-seq.
10663 The parser flags FLAGS is used to control type-specifier parsing.
10665 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
10666 flags:
10668 1: one of the decl-specifiers is an elaborated-type-specifier
10669 (i.e., a type declaration)
10670 2: one of the decl-specifiers is an enum-specifier or a
10671 class-specifier (i.e., a type definition)
10673 */
10675 static void
10677 cp_parser_flags flags,
10680 {
10684 cp_decl_spec ds;
10686 /* Clear DECL_SPECS. */
10689 /* Assume no class or enumeration type is declared. */
10692 /* Keep reading specifiers until there are no more to read. */
10694 {
10699 /* Peek at the next token. */
10702 /* Save the first token of the decl spec list for error
10703 reporting. */
10706 /* Handle attributes. */
10708 {
10709 /* Parse the attributes. */
10712 /* In a sequence of declaration specifiers, c++11 attributes
10713 appertain to the type that precede them. In that case
10714 [dcl.spec]/1 says:
10716 The attribute-specifier-seq affects the type only for
10717 the declaration it appears in, not other declarations
10718 involving the same type.
10720 But for now let's force the user to position the
10721 attribute either at the beginning of the declaration or
10722 after the declarator-id, which would clearly mean that it
10723 applies to the declarator. */
10725 {
10727 /* The c++11 attribute is at the beginning of the
10728 declaration. It appertains to the entity being
10730 else
10731 {
10733 {
10734 /* This is an attribute following a
10735 class-specifier. */
10740 }
10741 else
10742 {
10743 decl_specs->std_attributes
10745 attrs);
10748 }
10750 }
10751 }
10753 decl_specs->attributes
10755 attrs);
10759 }
10760 /* Assume we will find a decl-specifier keyword. */
10762 /* If the next token is an appropriate keyword, we can simply
10763 add it to the list. */
10765 {
10766 /* decl-specifier:
10767 friend
10768 constexpr */
10771 {
10774 }
10775 else
10776 {
10778 /* Consume the token. */
10780 }
10788 /* function-specifier:
10789 inline
10790 virtual
10791 explicit */
10798 /* decl-specifier:
10799 typedef */
10802 /* Consume the token. */
10804 /* A constructor declarator cannot appear in a typedef. */
10806 /* The "typedef" keyword can only occur in a declaration; we
10807 may as well commit at this point. */
10814 /* storage-class-specifier:
10815 auto
10816 register
10817 static
10818 extern
10819 mutable
10821 GNU Extension:
10822 thread */
10825 {
10826 /* Consume the token. */
10829 /* Complain about `auto' as a storage specifier, if
10830 we're complaining about C++0x compatibility. */
10834 /* Set the storage class anyway. */
10836 token);
10837 }
10838 else
10839 /* C++0x auto type-specifier. */
10847 /* Consume the token. */
10850 token);
10853 /* Consume the token. */
10859 /* We did not yet find a decl-specifier yet. */
10862 }
10872 /* Constructors are a special case. The `S' in `S()' is not a
10873 decl-specifier; it is the beginning of the declarator. */
10874 constructor_p
10875 = (!found_decl_spec
10876 && constructor_possible_p
10877 && (cp_parser_constructor_declarator_p
10880 /* If we don't have a DECL_SPEC yet, then we must be looking at
10881 a type-specifier. */
10883 {
10886 tree type_spec;
10888 type_spec
10890 decl_specs,
10896 /* If this type-specifier referenced a user-defined type
10897 (a typedef, class-name, etc.), then we can't allow any
10898 more such type-specifiers henceforth.
10900 [dcl.spec]
10902 The longest sequence of decl-specifiers that could
10903 possibly be a type name is taken as the
10904 decl-specifier-seq of a declaration. The sequence shall
10905 be self-consistent as described below.
10907 [dcl.type]
10909 As a general rule, at most one type-specifier is allowed
10910 in the complete decl-specifier-seq of a declaration. The
10911 only exceptions are the following:
10913 -- const or volatile can be combined with any other
10914 type-specifier.
10916 -- signed or unsigned can be combined with char, long,
10917 short, or int.
10919 -- ..
10921 Example:
10923 typedef char* Pc;
10924 void g (const int Pc);
10926 Here, Pc is *not* part of the decl-specifier seq; it's
10927 the declarator. Therefore, once we see a type-specifier
10928 (other than a cv-qualifier), we forbid any additional
10929 user-defined types. We *do* still allow things like `int
10930 int' to be considered a decl-specifier-seq, and issue the
10931 error message later. */
10934 /* A constructor declarator cannot follow a type-specifier. */
10936 {
10941 }
10942 }
10944 /* If we still do not have a DECL_SPEC, then there are no more
10945 decl-specifiers. */
10950 /* After we see one decl-specifier, further decl-specifiers are
10951 always optional. */
10953 }
10955 /* Don't allow a friend specifier with a class definition. */
10960 }
10962 /* Parse an (optional) storage-class-specifier.
10964 storage-class-specifier:
10965 auto
10966 register
10967 static
10968 extern
10969 mutable
10971 GNU Extension:
10973 storage-class-specifier:
10974 thread
10976 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
10978 static tree
10980 {
10982 {
10986 /* Fall through for C++98. */
10993 /* Consume the token. */
10998 }
10999 }
11001 /* Parse an (optional) function-specifier.
11003 function-specifier:
11004 inline
11005 virtual
11006 explicit
11008 Returns an IDENTIFIER_NODE corresponding to the keyword used.
11009 Updates DECL_SPECS, if it is non-NULL. */
11011 static tree
11014 {
11017 {
11023 /* 14.5.2.3 [temp.mem]
11025 A member function template shall not be virtual. */
11037 }
11039 /* Consume the token. */
11041 }
11043 /* Parse a linkage-specification.
11045 linkage-specification:
11046 extern string-literal { declaration-seq [opt] }
11047 extern string-literal declaration */
11049 static void
11051 {
11052 tree linkage;
11054 /* Look for the `extern' keyword. */
11057 /* Look for the string-literal. */
11060 /* Transform the literal into an identifier. If the literal is a
11061 wide-character string, or contains embedded NULs, then we can't
11062 handle it as the user wants. */
11065 {
11067 /* Assume C++ linkage. */
11069 }
11070 else
11073 /* We're now using the new linkage. */
11076 /* If the next token is a `{', then we're using the first
11077 production. */
11079 {
11080 /* Consume the `{' token. */
11082 /* Parse the declarations. */
11084 /* Look for the closing `}'. */
11086 }
11087 /* Otherwise, there's just one declaration. */
11088 else
11089 {
11092 saved_in_unbraced_linkage_specification_p
11096 parser->in_unbraced_linkage_specification_p
11098 }
11100 /* We're done with the linkage-specification. */
11102 }
11104 /* Parse a static_assert-declaration.
11106 static_assert-declaration:
11107 static_assert ( constant-expression , string-literal ) ;
11109 If MEMBER_P, this static_assert is a class member. */
11111 static void
11113 {
11114 tree condition;
11115 tree message;
11117 location_t saved_loc;
11120 /* Peek at the `static_assert' token so we can keep track of exactly
11121 where the static assertion started. */
11125 /* Look for the `static_assert' keyword. */
11127 RT_STATIC_ASSERT))
11130 /* We know we are in a static assertion; commit to any tentative
11131 parse. */
11135 /* Parse the `(' starting the static assertion condition. */
11138 /* Parse the constant-expression. Allow a non-constant expression
11139 here in order to give better diagnostics in finish_static_assert. */
11140 condition =
11145 /* Parse the separating `,'. */
11148 /* Parse the string-literal message. */
11153 /* A `)' completes the static assertion. */
11160 /* A semicolon terminates the declaration. */
11163 /* Complete the static assertion, which may mean either processing
11164 the static assert now or saving it for template instantiation. */
11166 }
11168 /* Parse a `decltype' type. Returns the type.
11170 simple-type-specifier:
11171 decltype ( expression ) */
11173 static tree
11175 {
11176 tree expr;
11185 {
11186 /* Already parsed. */
11189 }
11191 /* Look for the `decltype' token. */
11195 /* Types cannot be defined in a `decltype' expression. Save away the
11196 old message. */
11199 /* And create the new one. */
11200 parser->type_definition_forbidden_message
11203 /* The restrictions on constant-expressions do not apply inside
11204 decltype expressions. */
11205 saved_integral_constant_expression_p
11207 saved_non_integral_constant_expression_p
11211 /* Do not actually evaluate the expression. */
11214 /* Do not warn about problems with the expression. */
11217 /* Parse the opening `('. */
11221 /* First, try parsing an id-expression. */
11232 {
11235 cp_id_kind idk;
11239 /* Lookup the name we got back from the id-expression. */
11241 none_type,
11255 {
11256 /* Complete lookup of the id-expression. */
11257 expr = (finish_id_expression
11270 /* We found an id-expression, but it was something that we
11271 should not have found. This is an error, not something
11272 we can recover from, so note that we found an
11273 id-expression and we'll recover as gracefully as
11274 possible. */
11276 }
11281 /* We have an id-expression. */
11283 }
11286 {
11287 /* Abort the id-expression parse. */
11290 /* Parsing tentatively, again. */
11293 /* Parse a class member access. */
11301 /* We have an id-expression. */
11303 }
11306 /* We have parsed the complete id-expression or member access. */
11308 else
11309 {
11312 /* Abort our attempt to parse an id-expression or member access
11313 expression. */
11316 /* Within a parenthesized expression, a `>' token is always
11317 the greater-than operator. */
11318 saved_greater_than_is_operator_p
11322 /* Parse a full expression. */
11325 /* The `>' token might be the end of a template-id or
11326 template-parameter-list now. */
11327 parser->greater_than_is_operator_p
11329 }
11331 /* Go back to evaluating expressions. */
11335 /* Restore the old message and the integral constant expression
11336 flags. */
11338 parser->integral_constant_expression_p
11340 parser->non_integral_constant_expression_p
11343 /* Parse to the closing `)'. */
11345 {
11349 }
11352 tf_warning_or_error);
11354 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
11355 it again. */
11362 }
11364 /* Special member functions [gram.special] */
11366 /* Parse a conversion-function-id.
11368 conversion-function-id:
11369 operator conversion-type-id
11371 Returns an IDENTIFIER_NODE representing the operator. */
11373 static tree
11375 {
11376 tree type;
11377 tree saved_scope;
11378 tree saved_qualifying_scope;
11379 tree saved_object_scope;
11382 /* Look for the `operator' token. */
11385 /* When we parse the conversion-type-id, the current scope will be
11386 reset. However, we need that information in able to look up the
11387 conversion function later, so we save it here. */
11391 /* We must enter the scope of the class so that the names of
11392 entities declared within the class are available in the
11393 conversion-type-id. For example, consider:
11395 struct S {
11396 typedef int I;
11397 operator I();
11398 };
11400 S::operator I() { ... }
11402 In order to see that `I' is a type-name in the definition, we
11403 must be in the scope of `S'. */
11406 /* Parse the conversion-type-id. */
11408 /* Leave the scope of the class, if any. */
11411 /* Restore the saved scope. */
11415 /* If the TYPE is invalid, indicate failure. */
11419 }
11421 /* Parse a conversion-type-id:
11423 conversion-type-id:
11424 type-specifier-seq conversion-declarator [opt]
11426 Returns the TYPE specified. */
11428 static tree
11430 {
11431 tree attributes;
11432 cp_decl_specifier_seq type_specifiers;
11434 tree type_specified;
11436 /* Parse the attributes. */
11438 /* Parse the type-specifiers. */
11442 /* If that didn't work, stop. */
11445 /* Parse the conversion-declarator. */
11453 /* Don't give this error when parsing tentatively. This happens to
11454 work because we always parse this definitively once. */
11457 {
11459 {
11462 }
11466 }
11469 }
11471 /* Parse an (optional) conversion-declarator.
11473 conversion-declarator:
11474 ptr-operator conversion-declarator [opt]
11476 */
11480 {
11483 cp_cv_quals cv_quals;
11485 /* We don't know if there's a ptr-operator next, or not. */
11487 /* Try the ptr-operator. */
11490 /* If it worked, look for more conversion-declarators. */
11492 {
11495 /* Parse another optional declarator. */
11498 declarator = cp_parser_make_indirect_declarator
11502 }
11505 }
11507 /* Parse an (optional) ctor-initializer.
11509 ctor-initializer:
11510 : mem-initializer-list
11512 Returns TRUE iff the ctor-initializer was actually present. */
11514 static bool
11516 {
11517 /* If the next token is not a `:', then there is no
11518 ctor-initializer. */
11520 {
11521 /* Do default initialization of any bases and members. */
11526 }
11528 /* Consume the `:' token. */
11530 /* And the mem-initializer-list. */
11534 }
11536 /* Parse a mem-initializer-list.
11538 mem-initializer-list:
11539 mem-initializer ... [opt]
11540 mem-initializer ... [opt] , mem-initializer-list */
11542 static void
11544 {
11549 /* Let the semantic analysis code know that we are starting the
11550 mem-initializer-list. */
11555 /* Loop through the list. */
11557 {
11558 tree mem_initializer;
11561 /* Parse the mem-initializer. */
11563 /* If the next token is a `...', we're expanding member initializers. */
11565 {
11566 /* Consume the `...'. */
11569 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
11570 can be expanded but members cannot. */
11573 {
11578 }
11580 /* Construct the pack expansion type. */
11583 }
11586 {
11590 }
11591 /* Look for a target constructor. */
11595 {
11598 {
11602 }
11604 }
11605 /* Add it to the list, unless it was erroneous. */
11607 {
11610 }
11611 /* If the next token is not a `,', we're done. */
11614 /* Consume the `,' token. */
11616 }
11618 /* Perform semantic analysis. */
11621 }
11623 /* Parse a mem-initializer.
11625 mem-initializer:
11626 mem-initializer-id ( expression-list [opt] )
11627 mem-initializer-id braced-init-list
11629 GNU extension:
11631 mem-initializer:
11632 ( expression-list [opt] )
11634 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
11635 class) or FIELD_DECL (for a non-static data member) to initialize;
11636 the TREE_VALUE is the expression-list. An empty initialization
11637 list is represented by void_list_node. */
11639 static tree
11641 {
11642 tree mem_initializer_id;
11643 tree expression_list;
11644 tree member;
11647 /* Find out what is being initialized. */
11649 {
11653 }
11654 else
11655 {
11659 }
11665 {
11671 }
11672 else
11673 {
11683 }
11693 }
11695 /* Parse a mem-initializer-id.
11697 mem-initializer-id:
11698 :: [opt] nested-name-specifier [opt] class-name
11699 identifier
11701 Returns a TYPE indicating the class to be initializer for the first
11702 production. Returns an IDENTIFIER_NODE indicating the data member
11703 to be initialized for the second production. */
11705 static tree
11707 {
11711 tree id;
11715 /* `typename' is not allowed in this context ([temp.res]). */
11717 {
11719 "keyword %<typename%> not allowed in this context (a qualified "
11722 }
11723 /* Look for the optional `::' operator. */
11724 global_scope_p
11728 /* Look for the optional nested-name-specifier. The simplest way to
11729 implement:
11731 [temp.res]
11733 The keyword `typename' is not permitted in a base-specifier or
11734 mem-initializer; in these contexts a qualified name that
11735 depends on a template-parameter is implicitly assumed to be a
11736 type name.
11738 is to assume that we have seen the `typename' keyword at this
11739 point. */
11740 nested_name_specifier_p
11749 /* If there is a `::' operator or a nested-name-specifier, then we
11750 are definitely looking for a class-name. */
11755 typename_type,
11759 /* Otherwise, we could also be looking for an ordinary identifier. */
11761 /* Try a class-name. */
11765 none_type,
11769 /* If we found one, we're done. */
11772 /* Otherwise, look for an ordinary identifier. */
11774 }
11776 /* Overloading [gram.over] */
11778 /* Parse an operator-function-id.
11780 operator-function-id:
11781 operator operator
11783 Returns an IDENTIFIER_NODE for the operator which is a
11784 human-readable spelling of the identifier, e.g., `operator +'. */
11786 static tree
11788 {
11789 /* Look for the `operator' keyword. */
11792 /* And then the name of the operator itself. */
11794 }
11796 /* Return an identifier node for a user-defined literal operator.
11797 The suffix identifier is chained to the operator name identifier. */
11799 static tree
11801 {
11802 tree identifier;
11807 /*IDENTIFIER_UDLIT_OPNAME_P (identifier) = 1; If we get a flag someday. */
11810 }
11812 /* Parse an operator.
11814 operator:
11815 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
11816 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
11817 || ++ -- , ->* -> () []
11819 GNU Extensions:
11821 operator:
11822 <? >? <?= >?=
11824 Returns an IDENTIFIER_NODE for the operator which is a
11825 human-readable spelling of the identifier, e.g., `operator +'. */
11827 static tree
11829 {
11833 /* Peek at the next token. */
11835 /* Figure out which operator we have. */
11837 {
11839 {
11842 /* The keyword should be either `new' or `delete'. */
11847 else
11850 /* Consume the `new' or `delete' token. */
11853 /* Peek at the next token. */
11855 /* If it's a `[' token then this is the array variant of the
11856 operator. */
11858 {
11859 /* Consume the `[' token. */
11861 /* Look for the `]' token. */
11865 }
11866 /* Otherwise, we have the non-array variant. */
11867 else
11871 }
12018 /* Consume the `('. */
12020 /* Look for the matching `)'. */
12025 /* Consume the `['. */
12027 /* Look for the matching `]'. */
12035 {
12038 }
12039 /* Consume the string. */
12041 /* Look for the suffix identifier. */
12044 {
12047 {
12050 }
12051 }
12052 else
12053 {
12056 }
12063 /* Anything else is an error. */
12065 }
12067 /* If we have selected an identifier, we need to consume the
12068 operator token. */
12071 /* Otherwise, no valid operator name was present. */
12072 else
12073 {
12076 }
12079 }
12081 /* Parse a template-declaration.
12083 template-declaration:
12084 export [opt] template < template-parameter-list > declaration
12086 If MEMBER_P is TRUE, this template-declaration occurs within a
12087 class-specifier.
12089 The grammar rule given by the standard isn't correct. What
12090 is really meant is:
12092 template-declaration:
12093 export [opt] template-parameter-list-seq
12094 decl-specifier-seq [opt] init-declarator [opt] ;
12095 export [opt] template-parameter-list-seq
12096 function-definition
12098 template-parameter-list-seq:
12099 template-parameter-list-seq [opt]
12100 template < template-parameter-list > */
12102 static void
12104 {
12105 /* Check for `export'. */
12107 {
12108 /* Consume the `export' token. */
12110 /* Warn that we do not support `export'. */
12112 }
12115 }
12117 /* Parse a template-parameter-list.
12119 template-parameter-list:
12120 template-parameter
12121 template-parameter-list , template-parameter
12123 Returns a TREE_LIST. Each node represents a template parameter.
12124 The nodes are connected via their TREE_CHAINs. */
12126 static tree
12128 {
12133 /* The loop below parses the template parms. We first need to know
12134 the total number of template parms to be able to compute proper
12135 canonical types of each dependent type. So after the loop, when
12136 we know the total number of template parms,
12137 end_template_parm_list computes the proper canonical types and
12138 fixes up the dependent types accordingly. */
12140 {
12141 tree parameter;
12144 location_t parm_loc;
12146 /* Parse the template-parameter. */
12151 /* Add it to the list. */
12154 parm_loc,
12155 parameter,
12156 is_non_type,
12157 is_parameter_pack);
12158 else
12159 {
12162 }
12164 /* If the next token is not a `,', we're done. */
12167 /* Otherwise, consume the `,' token. */
12169 }
12172 }
12174 /* Parse a template-parameter.
12176 template-parameter:
12177 type-parameter
12178 parameter-declaration
12180 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
12181 the parameter. The TREE_PURPOSE is the default value, if any.
12182 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
12183 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
12184 set to true iff this parameter is a parameter pack. */
12186 static tree
12189 {
12193 tree parm;
12195 /* Assume it is a type parameter or a template parameter. */
12197 /* Assume it not a parameter pack. */
12199 /* Peek at the next token. */
12201 /* If it is `class' or `template', we have a type-parameter. */
12204 /* If it is `class' or `typename' we do not know yet whether it is a
12205 type parameter or a non-type parameter. Consider:
12207 template <typename T, typename T::X X> ...
12209 or:
12211 template <class C, class D*> ...
12213 Here, the first parameter is a type parameter, and the second is
12214 a non-type parameter. We can tell by looking at the token after
12215 the identifier -- if it is a `,', `=', or `>' then we have a type
12216 parameter. */
12218 {
12219 /* Peek at the token after `class' or `typename'. */
12221 /* If it's an ellipsis, we have a template type parameter
12222 pack. */
12225 /* If it's an identifier, skip it. */
12228 /* Now, see if the token looks like the end of a template
12229 parameter. */
12234 }
12236 /* Otherwise, it is a non-type parameter.
12238 [temp.param]
12240 When parsing a default template-argument for a non-type
12241 template-parameter, the first non-nested `>' is taken as the end
12242 of the template parameter-list rather than a greater-than
12243 operator. */
12245 parameter_declarator
12249 /* If the parameter declaration is marked as a parameter pack, set
12250 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
12251 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
12252 grokdeclarator. */
12256 {
12259 }
12263 {
12264 /* Can happen in some cases of erroneous input (c++/34892). */
12266 /* Consume the `...' for better error recovery. */
12268 }
12269 /* If the next token is an ellipsis, and we don't already have it
12270 marked as a parameter pack, then we have a parameter pack (that
12271 has no declarator). */
12274 && (declarator_can_be_parameter_pack
12276 {
12277 /* Consume the `...'. */
12282 }
12283 /* We might end up with a pack expansion as the type of the non-type
12284 template parameter, in which case this is a non-type template
12285 parameter pack. */
12289 {
12293 }
12296 {
12297 /* Parameter packs cannot have default arguments. However, a
12298 user may try to do so, so we'll parse them and give an
12299 appropriate diagnostic here. */
12303 /* Find the name of the parameter pack. */
12312 else
12316 /* Parse the default argument, but throw away the result. */
12318 }
12328 }
12330 /* Parse a type-parameter.
12332 type-parameter:
12333 class identifier [opt]
12334 class identifier [opt] = type-id
12335 typename identifier [opt]
12336 typename identifier [opt] = type-id
12337 template < template-parameter-list > class identifier [opt]
12338 template < template-parameter-list > class identifier [opt]
12339 = id-expression
12341 GNU Extension (variadic templates):
12343 type-parameter:
12344 class ... identifier [opt]
12345 typename ... identifier [opt]
12347 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
12348 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
12349 the declaration of the parameter.
12351 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
12353 static tree
12355 {
12357 tree parameter;
12359 /* Look for a keyword to tell us what kind of parameter this is. */
12365 {
12368 {
12369 tree identifier;
12370 tree default_argument;
12372 /* If the next token is an ellipsis, we have a template
12373 argument pack. */
12375 {
12376 /* Consume the `...' token. */
12381 }
12383 /* If the next token is an identifier, then it names the
12384 parameter. */
12387 else
12390 /* Create the parameter. */
12393 /* If the next token is an `=', we have a default argument. */
12395 {
12396 /* Consume the `=' token. */
12398 /* Parse the default-argument. */
12402 /* Template parameter packs cannot have default
12403 arguments. */
12405 {
12408 "template parameter pack %qD cannot have a "
12410 else
12412 "template parameter packs cannot have "
12415 }
12417 }
12418 else
12421 /* Create the combined representation of the parameter and the
12422 default argument. */
12424 }
12428 {
12429 tree identifier;
12430 tree default_argument;
12432 /* Look for the `<'. */
12434 /* Parse the template-parameter-list. */
12436 /* Look for the `>'. */
12438 /* Look for the `class' keyword. */
12440 /* If the next token is an ellipsis, we have a template
12441 argument pack. */
12443 {
12444 /* Consume the `...' token. */
12449 }
12450 /* If the next token is an `=', then there is a
12451 default-argument. If the next token is a `>', we are at
12452 the end of the parameter-list. If the next token is a `,',
12453 then we are at the end of this parameter. */
12457 {
12459 /* Treat invalid names as if the parameter were nameless. */
12462 }
12463 else
12466 /* Create the template parameter. */
12468 identifier);
12470 /* If the next token is an `=', then there is a
12471 default-argument. */
12473 {
12476 /* Consume the `='. */
12478 /* Parse the id-expression. */
12480 /* save token before parsing the id-expression, for error
12481 reporting */
12483 default_argument
12491 /* If the id-expression was a template-id that refers to
12492 a template-class, we already have the declaration here,
12493 so no further lookup is needed. */
12494 ;
12495 else
12496 /* Look up the name. */
12497 default_argument
12499 none_type,
12505 /* See if the default argument is valid. */
12506 default_argument
12509 /* Template parameter packs cannot have default
12510 arguments. */
12512 {
12515 "template parameter pack %qD cannot "
12517 identifier);
12518 else
12522 }
12524 }
12525 else
12528 /* Create the combined representation of the parameter and the
12529 default argument. */
12531 }
12537 }
12540 }
12542 /* Parse a template-id.
12544 template-id:
12545 template-name < template-argument-list [opt] >
12547 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
12548 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
12549 returned. Otherwise, if the template-name names a function, or set
12550 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
12551 names a class, returns a TYPE_DECL for the specialization.
12553 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
12554 uninstantiated templates. */
12556 static tree
12562 {
12564 tree templ;
12565 tree arguments;
12566 tree template_id;
12573 /* If the next token corresponds to a template-id, there is no need
12574 to reparse it. */
12577 {
12580 /* Get the stored value. */
12582 /* Perform any access checks that were deferred. */
12585 {
12590 tf_warning_or_error);
12591 }
12592 /* Return the stored value. */
12594 }
12596 /* Avoid performing name lookup if there is no possibility of
12597 finding a template-id. */
12600 && !cp_parser_nth_token_starts_template_argument_list_p
12602 {
12605 }
12607 /* Remember where the template-id starts. */
12613 /* Parse the template-name. */
12616 check_dependency_p,
12617 is_declaration,
12618 tag_type,
12621 {
12624 }
12626 /* If we find the sequence `[:' after a template-name, it's probably
12627 a digraph-typo for `< ::'. Substitute the tokens and check if we can
12628 parse correctly the argument list. */
12635 {
12637 /* Change `:' into `::'. */
12639 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
12640 CPP_LESS. */
12643 /* Parse the arguments. */
12646 {
12647 /* If we couldn't parse an argument list, then we revert our changes
12648 and return simply an error. Maybe this is not a template-id
12649 after all. */
12654 }
12655 /* Otherwise, emit an error about the invalid digraph, but continue
12656 parsing because we got our argument list. In C++11 do not emit
12657 any error, per 2.5/3. */
12661 {
12664 "%<<:%> is an alternate spelling for %<[%>."
12667 {
12669 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
12672 }
12673 }
12674 }
12675 else
12676 {
12677 /* Look for the `<' that starts the template-argument-list. */
12679 {
12682 }
12683 /* Parse the arguments. */
12685 }
12687 /* Build a representation of the specialization. */
12690 TEMPLATE_ID_EXPR,
12694 {
12696 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
12697 template (rather than some instantiation thereof) only if
12698 is not nested within some other construct. For example, in
12699 "template <typename T> void f(T) { A<T>::", A<T> is just an
12700 instantiation of A. */
12703 CPP_SCOPE));
12704 template_id
12706 }
12707 else
12708 {
12709 /* If it's not a class-template or a template-template, it should be
12710 a function-template. */
12716 }
12718 /* If parsing tentatively, replace the sequence of tokens that makes
12719 up the template-id with a CPP_TEMPLATE_ID token. That way,
12720 should we re-parse the token stream, we will not have to repeat
12721 the effort required to do the parse, nor will we issue duplicate
12722 error messages about problems during instantiation of the
12723 template. */
12725 {
12728 /* Reset the contents of the START_OF_ID token. */
12730 /* Retrieve any deferred checks. Do not pop this access checks yet
12731 so the memory will not be reclaimed during token replacing below. */
12737 /* Purge all subsequent tokens. */
12740 /* ??? Can we actually assume that, if template_id ==
12741 error_mark_node, we will have issued a diagnostic to the
12742 user, as opposed to simply marking the tentative parse as
12743 failed? */
12746 }
12750 }
12752 /* Parse a template-name.
12754 template-name:
12755 identifier
12757 The standard should actually say:
12759 template-name:
12760 identifier
12761 operator-function-id
12763 A defect report has been filed about this issue.
12765 A conversion-function-id cannot be a template name because they cannot
12766 be part of a template-id. In fact, looking at this code:
12768 a.operator K<int>()
12770 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
12771 It is impossible to call a templated conversion-function-id with an
12772 explicit argument list, since the only allowed template parameter is
12773 the type to which it is converting.
12775 If TEMPLATE_KEYWORD_P is true, then we have just seen the
12776 `template' keyword, in a construction like:
12778 T::template f<3>()
12780 In that case `f' is taken to be a template-name, even though there
12781 is no way of knowing for sure.
12783 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
12784 name refers to a set of overloaded functions, at least one of which
12785 is a template, or an IDENTIFIER_NODE with the name of the template,
12786 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
12787 names are looked up inside uninstantiated templates. */
12789 static tree
12796 {
12797 tree identifier;
12798 tree decl;
12799 tree fns;
12802 /* If the next token is `operator', then we have either an
12803 operator-function-id or a conversion-function-id. */
12805 {
12806 /* We don't know whether we're looking at an
12807 operator-function-id or a conversion-function-id. */
12809 /* Try an operator-function-id. */
12811 /* If that didn't work, try a conversion-function-id. */
12813 {
12816 }
12817 }
12818 /* Look for the identifier. */
12819 else
12822 /* If we didn't find an identifier, we don't have a template-id. */
12826 /* If the name immediately followed the `template' keyword, then it
12827 is a template-name. However, if the next token is not `<', then
12828 we do not treat it as a template-name, since it is not being used
12829 as part of a template-id. This enables us to handle constructs
12830 like:
12832 template <typename T> struct S { S(); };
12833 template <typename T> S<T>::S();
12835 correctly. We would treat `S' as a template -- if it were `S<T>'
12836 -- but we do not if there is no `<'. */
12840 {
12841 /* In a declaration, in a dependent context, we pretend that the
12842 "template" keyword was present in order to improve error
12843 recovery. For example, given:
12845 template <typename T> void f(T::X<int>);
12847 we want to treat "X<int>" as a template-id. */
12849 && !template_keyword_p
12851 && check_dependency_p
12853 /* Do not do this for dtors (or ctors), since they never
12854 need the template keyword before their name. */
12856 {
12859 /* Explain what went wrong. */
12861 identifier);
12864 /* If parsing tentatively, find the location of the "<" token. */
12867 /* Parse the template arguments so that we can issue error
12868 messages about them. */
12871 /* Skip tokens until we find a good place from which to
12872 continue parsing. */
12877 /* If parsing tentatively, permanently remove the
12878 template argument list. That will prevent duplicate
12879 error messages from being issued about the missing
12880 "template" keyword. */
12886 }
12888 /* If the "template" keyword is present, then there is generally
12889 no point in doing name-lookup, so we just return IDENTIFIER.
12890 But, if the qualifying scope is non-dependent then we can
12891 (and must) do name-lookup normally. */
12897 }
12899 /* Look up the name. */
12901 tag_type,
12904 check_dependency_p,
12908 /* If DECL is a template, then the name was a template-name. */
12910 ;
12911 else
12912 {
12915 /* The standard does not explicitly indicate whether a name that
12916 names a set of overloaded declarations, some of which are
12917 templates, is a template-name. However, such a name should
12918 be a template-name; otherwise, there is no way to form a
12919 template-id for the overloaded templates. */
12927 {
12928 /* The name does not name a template. */
12931 }
12932 }
12934 /* If DECL is dependent, and refers to a function, then just return
12935 its name; we will look it up again during template instantiation. */
12937 {
12941 }
12944 }
12946 /* Parse a template-argument-list.
12948 template-argument-list:
12949 template-argument ... [opt]
12950 template-argument-list , template-argument ... [opt]
12952 Returns a TREE_VEC containing the arguments. */
12954 static tree
12956 {
12961 tree vec;
12968 /* Even if the template-id appears in an integral
12969 constant-expression, the contents of the argument list do
12970 not. */
12976 /* Parse the arguments. */
12977 do
12978 {
12979 tree argument;
12982 /* Consume the comma. */
12985 /* Parse the template-argument. */
12988 /* If the next token is an ellipsis, we're expanding a template
12989 argument pack. */
12991 {
12993 {
12997 }
12998 /* Consume the `...' token. */
13001 /* Make the argument into a TYPE_PACK_EXPANSION or
13002 EXPR_PACK_EXPANSION. */
13004 }
13007 {
13011 {
13014 }
13015 else
13017 }
13019 }
13032 #ifdef ENABLE_CHECKING
13034 #endif
13036 }
13038 /* Parse a template-argument.
13040 template-argument:
13041 assignment-expression
13042 type-id
13043 id-expression
13045 The representation is that of an assignment-expression, type-id, or
13046 id-expression -- except that the qualified id-expression is
13047 evaluated, so that the value returned is either a DECL or an
13048 OVERLOAD.
13050 Although the standard says "assignment-expression", it forbids
13051 throw-expressions or assignments in the template argument.
13052 Therefore, we use "conditional-expression" instead. */
13054 static tree
13056 {
13057 tree argument;
13063 cp_id_kind idk;
13065 /* There's really no way to know what we're looking at, so we just
13066 try each alternative in order.
13068 [temp.arg]
13070 In a template-argument, an ambiguity between a type-id and an
13071 expression is resolved to a type-id, regardless of the form of
13072 the corresponding template-parameter.
13074 Therefore, we try a type-id first. */
13077 /* If there was no error parsing the type-id but the next token is a
13078 '>>', our behavior depends on which dialect of C++ we're
13079 parsing. In C++98, we probably found a typo for '> >'. But there
13080 are type-id which are also valid expressions. For instance:
13082 struct X { int operator >> (int); };
13083 template <int V> struct Foo {};
13084 Foo<X () >> 5> r;
13086 Here 'X()' is a valid type-id of a function type, but the user just
13087 wanted to write the expression "X() >> 5". Thus, we remember that we
13088 found a valid type-id, but we still try to parse the argument as an
13089 expression to see what happens.
13091 In C++0x, the '>>' will be considered two separate '>'
13092 tokens. */
13096 {
13099 }
13100 else
13101 {
13102 /* If the next token isn't a `,' or a `>', then this argument wasn't
13103 really finished. This means that the argument is not a valid
13104 type-id. */
13107 /* If that worked, we're done. */
13110 }
13111 /* We're still not sure what the argument will be. */
13113 /* Try a template. */
13121 /* If the next token isn't a `,' or a `>', then this argument wasn't
13122 really finished. */
13126 {
13127 /* Figure out what is being referred to. If the id-expression
13128 was for a class template specialization, then we will have a
13129 TYPE_DECL at this point. There is no need to do name lookup
13130 at this point in that case. */
13133 none_type,
13142 }
13145 /* It must be a non-type argument. There permitted cases are given
13146 in [temp.arg.nontype]:
13148 -- an integral constant-expression of integral or enumeration
13149 type; or
13151 -- the name of a non-type template-parameter; or
13153 -- the name of an object or function with external linkage...
13155 -- the address of an object or function with external linkage...
13157 -- a pointer to member... */
13158 /* Look for a non-type template parameter. */
13160 {
13172 }
13174 /* If the next token is "&", the argument must be the address of an
13175 object or function with external linkage. */
13178 {
13181 }
13182 /* See if we might have an id-expression. */
13189 {
13192 address_p,
13199 else
13200 {
13201 tree probe;
13204 {
13207 }
13209 /* If we're in a template, we represent a qualified-id referring
13210 to a static data member as a SCOPE_REF even if the scope isn't
13211 dependent so that we can check access control later. */
13216 {
13217 /* A variable without external linkage might still be a
13218 valid constant-expression, so no error is issued here
13219 if the external-linkage check fails. */
13222 }
13224 /* All overloaded functions are allowed; if the external
13225 linkage test does not pass, an error will be issued
13226 later. */
13227 ;
13231 /* A pointer-to-member. */
13232 ;
13234 ;
13235 else
13239 {
13242 tf_warning_or_error);
13244 }
13245 }
13246 }
13247 /* If the argument started with "&", there are no other valid
13248 alternatives at this point. */
13250 {
13253 }
13255 /* If the argument wasn't successfully parsed as a type-id followed
13256 by '>>', the argument can only be a constant expression now.
13257 Otherwise, we try parsing the constant-expression tentatively,
13258 because the argument could really be a type-id. */
13271 /* We did our best to parse the argument as a non type-id, but that
13272 was the only alternative that matched (albeit with a '>' after
13273 it). We can assume it's just a typo from the user, and a
13274 diagnostic will then be issued. */
13276 }
13278 /* Parse an explicit-instantiation.
13280 explicit-instantiation:
13281 template declaration
13283 Although the standard says `declaration', what it really means is:
13285 explicit-instantiation:
13286 template decl-specifier-seq [opt] declarator [opt] ;
13288 Things like `template int S<int>::i = 5, int S<double>::j;' are not
13289 supposed to be allowed. A defect report has been filed about this
13290 issue.
13292 GNU Extension:
13294 explicit-instantiation:
13295 storage-class-specifier template
13296 decl-specifier-seq [opt] declarator [opt] ;
13297 function-specifier template
13298 decl-specifier-seq [opt] declarator [opt] ; */
13300 static void
13302 {
13304 cp_decl_specifier_seq decl_specifiers;
13309 /* Look for an (optional) storage-class-specifier or
13310 function-specifier. */
13312 {
13313 extension_specifier
13316 extension_specifier
13319 }
13321 /* Look for the `template' keyword. */
13323 /* Let the front end know that we are processing an explicit
13324 instantiation. */
13326 /* [temp.explicit] says that we are supposed to ignore access
13327 control while processing explicit instantiation directives. */
13329 /* Parse a decl-specifier-seq. */
13331 CP_PARSER_FLAGS_OPTIONAL,
13334 /* If there was exactly one decl-specifier, and it declared a class,
13335 and there's no declarator, then we have an explicit type
13336 instantiation. */
13338 {
13339 tree type;
13343 /* Turn access control back on for names used during
13344 template instantiation. */
13349 }
13350 else
13351 {
13353 tree decl;
13355 /* Parse the declarator. */
13356 declarator
13366 {
13369 "explicit instantiation shall not use"
13373 "explicit instantiation shall not use"
13378 /* Turn access control back on for names used during
13379 template instantiation. */
13381 /* Do the explicit instantiation. */
13383 }
13384 else
13385 {
13387 /* Skip the body of the explicit instantiation. */
13389 }
13390 }
13391 /* We're done with the instantiation. */
13397 }
13399 /* Parse an explicit-specialization.
13401 explicit-specialization:
13402 template < > declaration
13404 Although the standard says `declaration', what it really means is:
13406 explicit-specialization:
13407 template <> decl-specifier [opt] init-declarator [opt] ;
13408 template <> function-definition
13409 template <> explicit-specialization
13410 template <> template-declaration */
13412 static void
13414 {
13418 /* Look for the `template' keyword. */
13420 /* Look for the `<'. */
13422 /* Look for the `>'. */
13424 /* We have processed another parameter list. */
13426 /* [temp]
13428 A template ... explicit specialization ... shall not have C
13429 linkage. */
13431 {
13433 /* Give it C++ linkage to avoid confusing other parts of the
13434 front end. */
13437 }
13438 else
13440 /* Let the front end know that we are beginning a specialization. */
13442 {
13445 }
13447 /* If the next keyword is `template', we need to figure out whether
13448 or not we're looking a template-declaration. */
13450 {
13455 else
13457 }
13458 else
13459 /* Parse the dependent declaration. */
13465 /* We're done with the specialization. */
13467 /* For the erroneous case of a template with C linkage, we pushed an
13468 implicit C++ linkage scope; exit that scope now. */
13471 /* We're done with this parameter list. */
13473 }
13475 /* Parse a type-specifier.
13477 type-specifier:
13478 simple-type-specifier
13479 class-specifier
13480 enum-specifier
13481 elaborated-type-specifier
13482 cv-qualifier
13484 GNU Extension:
13486 type-specifier:
13487 __complex__
13489 Returns a representation of the type-specifier. For a
13490 class-specifier, enum-specifier, or elaborated-type-specifier, a
13491 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
13493 The parser flags FLAGS is used to control type-specifier parsing.
13495 If IS_DECLARATION is TRUE, then this type-specifier is appearing
13496 in a decl-specifier-seq.
13498 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
13499 class-specifier, enum-specifier, or elaborated-type-specifier, then
13500 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
13501 if a type is declared; 2 if it is defined. Otherwise, it is set to
13502 zero.
13504 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
13505 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
13506 is set to FALSE. */
13508 static tree
13510 cp_parser_flags flags,
13515 {
13521 /* Assume this type-specifier does not declare a new type. */
13524 /* And that it does not specify a cv-qualifier. */
13527 /* Peek at the next token. */
13530 /* If we're looking at a keyword, we can use that to guide the
13531 production we choose. */
13534 {
13539 /* Look for the enum-specifier. */
13541 /* If that worked, we're done. */
13543 {
13548 type_spec,
13549 token,
13552 }
13553 else
13556 /* Any of these indicate either a class-specifier, or an
13557 elaborated-type-specifier. */
13564 /* Parse tentatively so that we can back up if we don't find a
13565 class-specifier. */
13567 /* Look for the class-specifier. */
13570 /* If that worked, we're done. */
13572 {
13577 type_spec,
13578 token,
13581 }
13583 /* Fall through. */
13584 elaborated_type_specifier:
13585 /* We're declaring (not defining) a class or enum. */
13589 /* Fall through. */
13591 /* Look for an elaborated-type-specifier. */
13592 type_spec
13593 = (cp_parser_elaborated_type_specifier
13596 is_declaration));
13599 type_spec,
13600 token,
13623 /* The `__complex__' keyword is a GNU extension. */
13629 }
13631 /* Handle simple keywords. */
13633 {
13635 {
13638 }
13640 }
13642 /* If we do not already have a type-specifier, assume we are looking
13643 at a simple-type-specifier. */
13645 decl_specs,
13646 flags);
13648 /* If we didn't find a type-specifier, and a type-specifier was not
13649 optional in this context, issue an error message. */
13651 {
13654 }
13657 }
13659 /* Parse a simple-type-specifier.
13661 simple-type-specifier:
13662 :: [opt] nested-name-specifier [opt] type-name
13663 :: [opt] nested-name-specifier template template-id
13664 char
13665 wchar_t
13666 bool
13667 short
13668 int
13669 long
13670 signed
13671 unsigned
13672 float
13673 double
13674 void
13676 C++0x Extension:
13678 simple-type-specifier:
13679 auto
13680 decltype ( expression )
13681 char16_t
13682 char32_t
13683 __underlying_type ( type-id )
13685 GNU Extension:
13687 simple-type-specifier:
13688 __int128
13689 __typeof__ unary-expression
13690 __typeof__ ( type-id )
13692 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
13693 appropriately updated. */
13695 static tree
13698 cp_parser_flags flags)
13699 {
13703 /* Peek at the next token. */
13706 /* If we're looking at a keyword, things are easy. */
13708 {
13771 /* Since DR 743, decltype can either be a simple-type-specifier by
13772 itself or begin a nested-name-specifier. Parsing it will replace
13773 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
13774 handling below decide what to do. */
13780 /* Consume the `typeof' token. */
13782 /* Parse the operand to `typeof'. */
13784 /* If it is not already a TYPE, take its type. */
13790 token,
13799 token,
13809 token,
13814 }
13816 /* If token is an already-parsed decltype not followed by ::,
13817 it's a simple-type-specifier. */
13820 {
13824 token,
13828 }
13830 /* If the type-specifier was for a built-in type, we're done. */
13832 {
13833 /* Record the type. */
13840 type,
13841 token,
13846 /* Consume the token. */
13849 /* There is no valid C++ program where a non-template type is
13850 followed by a "<". That usually indicates that the user thought
13851 that the type was a template. */
13856 }
13858 /* The type-specifier must be a user-defined type. */
13860 {
13864 /* Don't gobble tokens or issue error messages if this is an
13865 optional type-specifier. */
13869 /* Look for the optional `::' operator. */
13870 global_p
13874 /* Look for the nested-name specifier. */
13875 qualified_p
13883 /* If we have seen a nested-name-specifier, and the next token
13884 is `template', then we are using the template-id production. */
13887 {
13888 /* Look for the template-id. */
13892 none_type,
13894 /* If the template-id did not name a type, we are out of
13895 luck. */
13897 {
13900 }
13901 }
13902 /* Otherwise, look for a type-name. */
13903 else
13905 /* Keep track of all name-lookups performed in class scopes. */
13907 && !global_p
13908 && !qualified_p
13912 /* If it didn't work out, we don't have a TYPE. */
13918 token,
13920 }
13922 /* If we didn't get a type-name, issue an error message. */
13924 {
13927 }
13930 {
13931 /* See if TYPE is an Objective-C type, and if so, parse and
13932 accept any protocol references following it. Do this before
13933 the cp_parser_check_for_invalid_template_id() call, because
13934 Objective-C types can be followed by '<...>' which would
13935 enclose protocol names rather than template arguments, and so
13936 everything is fine. */
13939 {
13943 /* Clobber the "unqualified" type previously entered into
13944 DECL_SPECS with the new, improved protocol-qualified version. */
13949 }
13951 /* There is no valid C++ program where a non-template type is
13952 followed by a "<". That usually indicates that the user
13953 thought that the type was a template. */
13955 none_type,
13957 }
13960 }
13962 /* Parse a type-name.
13964 type-name:
13965 class-name
13966 enum-name
13967 typedef-name
13968 simple-template-id [in c++0x]
13970 enum-name:
13971 identifier
13973 typedef-name:
13974 identifier
13976 Returns a TYPE_DECL for the type. */
13978 static tree
13980 {
13981 tree type_decl;
13983 /* We can't know yet whether it is a class-name or not. */
13985 /* Try a class-name. */
13989 none_type,
13993 /* If it's not a class-name, keep looking. */
13995 {
13997 /* It must be a typedef-name or an enum-name. */
14001 /* It is either a simple-template-id representing an
14002 instantiation of an alias template... */
14006 none_type,
14008 /* Note that this must be an instantiation of an alias template
14009 because [temp.names]/6 says:
14011 A template-id that names an alias template specialization
14012 is a type-name.
14014 Whereas [temp.names]/7 says:
14016 A simple-template-id that names a class template
14017 specialization is a class-name. */
14022 else
14026 /* ... Or a typedef-name or an enum-name. */
14028 }
14031 }
14033 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
14035 enum-name:
14036 identifier
14038 typedef-name:
14039 identifier
14041 Returns a TYPE_DECL for the type. */
14043 static tree
14045 {
14046 tree type_decl;
14047 tree identifier;
14054 /* Look up the type-name. */
14058 {
14062 {
14063 /* We have found a type introduced by a using
14064 declaration at class scope that refers to a dependent
14065 type.
14067 using typename :: [opt] nested-name-specifier unqualified-id ;
14068 */
14074 }
14075 }
14079 {
14080 /* See if this is an Objective-C type. */
14085 }
14087 /* Issue an error if we did not find a type-name. */
14089 /* In Objective-C, we have the complication that class names are
14090 normally type names and start declarations (eg, the
14091 "NSObject" in "NSObject *object;"), but can be used in an
14092 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
14093 is an expression. So, a classname followed by a dot is not a
14094 valid type-name. */
14097 {
14102 }
14103 /* Remember that the name was used in the definition of the
14104 current class so that we can check later to see if the
14105 meaning would have been different after the class was
14106 entirely defined. */
14112 }
14114 /* Parse an elaborated-type-specifier. Note that the grammar given
14115 here incorporates the resolution to DR68.
14117 elaborated-type-specifier:
14118 class-key :: [opt] nested-name-specifier [opt] identifier
14119 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
14120 enum-key :: [opt] nested-name-specifier [opt] identifier
14121 typename :: [opt] nested-name-specifier identifier
14122 typename :: [opt] nested-name-specifier template [opt]
14123 template-id
14125 GNU extension:
14127 elaborated-type-specifier:
14128 class-key attributes :: [opt] nested-name-specifier [opt] identifier
14129 class-key attributes :: [opt] nested-name-specifier [opt]
14130 template [opt] template-id
14131 enum attributes :: [opt] nested-name-specifier [opt] identifier
14133 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
14134 declared `friend'. If IS_DECLARATION is TRUE, then this
14135 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
14136 something is being declared.
14138 Returns the TYPE specified. */
14140 static tree
14144 {
14146 tree identifier;
14149 tree globalscope;
14152 /* See if we're looking at the `enum' keyword. */
14154 {
14155 /* Consume the `enum' token. */
14157 /* Remember that it's an enumeration type. */
14159 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
14160 enums) is used here. */
14163 {
14167 /* Consume the `struct' or `class' and parse it anyway. */
14169 }
14170 /* Parse the attributes. */
14172 }
14173 /* Or, it might be `typename'. */
14175 RID_TYPENAME))
14176 {
14177 /* Consume the `typename' token. */
14179 /* Remember that it's a `typename' type. */
14181 }
14182 /* Otherwise it must be a class-key. */
14183 else
14184 {
14188 /* Parse the attributes. */
14190 }
14192 /* Look for the `::' operator. */
14195 /* Look for the nested-name-specifier. */
14197 {
14202 is_declaration))
14204 }
14205 else
14206 /* Even though `typename' is not present, the proposed resolution
14207 to Core Issue 180 says that in `class A<T>::B', `B' should be
14208 considered a type-name, even if `A<T>' is dependent. */
14213 is_declaration);
14214 /* For everything but enumeration types, consider a template-id.
14215 For an enumeration type, consider only a plain identifier. */
14217 {
14219 tree decl;
14221 /* Allow the `template' keyword. */
14223 /* If we didn't see `template', we don't know if there's a
14224 template-id or not. */
14227 /* Parse the template-id. */
14231 tag_type,
14232 is_declaration);
14233 /* If we didn't find a template-id, look for an ordinary
14234 identifier. */
14236 ;
14237 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
14238 in effect, then we must assume that, upon instantiation, the
14239 template will correspond to a class. */
14243 typename_type,
14245 /* If the `typename' keyword is in effect and DECL is not a type
14246 decl. Then type is non existant. */
14249 else
14252 }
14255 {
14260 {
14263 }
14265 /* For a `typename', we needn't call xref_tag. */
14269 identifier,
14271 /* Look up a qualified name in the usual way. */
14273 {
14274 tree decl;
14275 tree ambiguous_decls;
14278 tag_type,
14285 /* If the lookup was ambiguous, an error will already have been
14286 issued. */
14290 /* If we are parsing friend declaration, DECL may be a
14291 TEMPLATE_DECL tree node here. However, we need to check
14292 whether this TEMPLATE_DECL results in valid code. Consider
14293 the following example:
14295 namespace N {
14296 template <class T> class C {};
14297 }
14298 class X {
14299 template <class T> friend class N::C; // #1, valid code
14300 };
14301 template <class T> class Y {
14302 friend class N::C; // #2, invalid code
14303 };
14305 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
14306 name lookup of `N::C'. We see that friend declaration must
14307 be template for the code to be valid. Note that
14308 processing_template_decl does not work here since it is
14309 always 1 for the above two cases. */
14311 decl = (cp_parser_maybe_treat_template_as_class
14316 {
14319 identifier,
14322 }
14325 {
14329 allow_template);
14333 }
14335 /* Forward declarations of nested types, such as
14337 class C1::C2;
14338 class C1::C2::C3;
14340 are invalid unless all components preceding the final '::'
14341 are complete. If all enclosing types are complete, these
14342 declarations become merely pointless.
14344 Invalid forward declarations of nested types are errors
14345 caught elsewhere in parsing. Those that are pointless arrive
14346 here. */
14353 }
14354 else
14355 {
14356 /* An elaborated-type-specifier sometimes introduces a new type and
14357 sometimes names an existing type. Normally, the rule is that it
14358 introduces a new type only if there is not an existing type of
14359 the same name already in scope. For example, given:
14361 struct S {};
14362 void f() { struct S s; }
14364 the `struct S' in the body of `f' is the same `struct S' as in
14365 the global scope; the existing definition is used. However, if
14366 there were no global declaration, this would introduce a new
14367 local class named `S'.
14369 An exception to this rule applies to the following code:
14371 namespace N { struct S; }
14373 Here, the elaborated-type-specifier names a new type
14374 unconditionally; even if there is already an `S' in the
14375 containing scope this declaration names a new type.
14376 This exception only applies if the elaborated-type-specifier
14377 forms the complete declaration:
14379 [class.name]
14381 A declaration consisting solely of `class-key identifier ;' is
14382 either a redeclaration of the name in the current scope or a
14383 forward declaration of the identifier as a class name. It
14384 introduces the name into the current scope.
14386 We are in this situation precisely when the next token is a `;'.
14388 An exception to the exception is that a `friend' declaration does
14389 *not* name a new type; i.e., given:
14391 struct S { friend struct T; };
14393 `T' is not a new type in the scope of `S'.
14395 Also, `new struct S' or `sizeof (struct S)' never results in the
14396 definition of a new type; a new type can only be declared in a
14397 declaration context. */
14399 tag_scope ts;
14403 /* Friends have special name lookup rules. */
14407 CPP_SEMICOLON))
14408 /* This is a `class-key identifier ;' */
14410 else
14413 template_p =
14417 /* An unqualified name was used to reference this type, so
14418 there were no qualifying templates. */
14425 }
14426 }
14431 /* Allow attributes on forward declarations of classes. */
14433 {
14443 else
14446 }
14449 {
14450 /* Indicate whether this class was declared as a `class' or as a
14451 `struct'. */
14455 }
14457 /* A "<" cannot follow an elaborated type specifier. If that
14458 happens, the user was probably trying to form a template-id. */
14463 }
14465 /* Parse an enum-specifier.
14467 enum-specifier:
14468 enum-head { enumerator-list [opt] }
14469 enum-head { enumerator-list , } [C++0x]
14471 enum-head:
14472 enum-key identifier [opt] enum-base [opt]
14473 enum-key nested-name-specifier identifier enum-base [opt]
14475 enum-key:
14476 enum
14477 enum class [C++0x]
14478 enum struct [C++0x]
14480 enum-base: [C++0x]
14481 : type-specifier-seq
14483 opaque-enum-specifier:
14484 enum-key identifier enum-base [opt] ;
14486 GNU Extensions:
14487 enum-key attributes[opt] identifier [opt] enum-base [opt]
14488 { enumerator-list [opt] }attributes[opt]
14489 enum-key attributes[opt] identifier [opt] enum-base [opt]
14490 { enumerator-list, }attributes[opt] [C++0x]
14492 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
14493 if the token stream isn't an enum-specifier after all. */
14495 static tree
14497 {
14498 tree identifier;
14500 tree prev_scope;
14502 tree attributes;
14515 /* Parse tentatively so that we can back up if we don't find a
14516 enum-specifier. */
14519 /* Caller guarantees that the current token is 'enum', an identifier
14520 possibly follows, and the token after that is an opening brace.
14521 If we don't have an identifier, fabricate an anonymous name for
14522 the enumeration being defined. */
14525 /* Parse the "class" or "struct", which indicates a scoped
14526 enumeration type in C++0x. */
14529 {
14533 /* Consume the `struct' or `class' token. */
14537 }
14541 /* Clear the qualification. */
14546 /* Figure out in what scope the declaration is being placed. */
14552 nested_name_specifier
14560 {
14561 tree name;
14565 enum_type,
14570 input_location);
14572 {
14575 {
14576 /* Are template enums allowed in ISO? */
14580 /* ignore a typename reference, for it will be solved by name
14581 in start_enum. */
14583 }
14584 }
14585 else
14588 }
14589 else
14590 {
14593 else
14594 {
14597 }
14598 }
14601 /* Check for the `:' that denotes a specified underlying type in C++0x.
14602 Note that a ':' could also indicate a bitfield width, however. */
14604 {
14605 cp_decl_specifier_seq type_specifiers;
14607 /* Consume the `:'. */
14610 /* Parse the type-specifier-seq. */
14615 /* At this point this is surely not elaborated type specifier. */
14624 /* If that didn't work, stop. */
14626 {
14631 }
14632 }
14634 /* Look for the `{' but don't consume it yet. */
14636 {
14638 {
14641 {
14644 }
14645 }
14646 /* An opaque-enum-specifier must have a ';' here. */
14649 {
14652 {
14655 }
14656 }
14657 }
14663 {
14665 {
14669 }
14671 {
14673 }
14674 }
14676 /* Issue an error message if type-definitions are forbidden here. */
14679 else
14680 /* Create the new type. We do this before consuming the opening
14681 brace so the enum will be recorded as being on the line of its
14682 tag (or the 'enum' keyword, if there is no tag). */
14686 /* If the next token is not '{' it is an opaque-enum-specifier or an
14687 elaborated-type-specifier. */
14689 {
14692 {
14693 /* The following catches invalid code such as:
14694 enum class S<int>::E { A, B, C }; */
14701 /* If that scope does not contain the scope in which the
14702 class was originally declared, the program is invalid. */
14704 {
14707 "declaration of %qD in namespace %qD which does not "
14710 else
14715 }
14716 }
14721 /* Consume the opening brace. */
14728 {
14732 }
14733 else
14734 {
14739 }
14743 /* If the next token is not '}', then there are some enumerators. */
14747 /* Consume the final '}'. */
14753 }
14754 else
14755 {
14756 /* If a ';' follows, then it is an opaque-enum-specifier
14757 and additional restrictions apply. */
14759 {
14766 }
14767 }
14769 /* Look for trailing attributes to apply to this enumeration, and
14770 apply them if appropriate. */
14772 {
14776 trailing_attr,
14778 }
14780 /* Finish up the enumeration. */
14782 {
14787 }
14790 {
14792 {
14795 }
14797 {
14799 }
14800 }
14801 out:
14804 }
14806 /* Parse an enumerator-list. The enumerators all have the indicated
14807 TYPE.
14809 enumerator-list:
14810 enumerator-definition
14811 enumerator-list , enumerator-definition */
14813 static void
14815 {
14817 {
14818 /* Parse an enumerator-definition. */
14821 /* If the next token is not a ',', we've reached the end of
14822 the list. */
14825 /* Otherwise, consume the `,' and keep going. */
14827 /* If the next token is a `}', there is a trailing comma. */
14829 {
14834 }
14835 }
14836 }
14838 /* Parse an enumerator-definition. The enumerator has the indicated
14839 TYPE.
14841 enumerator-definition:
14842 enumerator
14843 enumerator = constant-expression
14845 enumerator:
14846 identifier */
14848 static void
14850 {
14851 tree identifier;
14852 tree value;
14853 location_t loc;
14855 /* Save the input location because we are interested in the location
14856 of the identifier and not the location of the explicit value. */
14859 /* Look for the identifier. */
14864 /* If the next token is an '=', then there is an explicit value. */
14866 {
14867 /* Consume the `=' token. */
14869 /* Parse the value. */
14872 NULL);
14873 }
14874 else
14877 /* If we are processing a template, make sure the initializer of the
14878 enumerator doesn't contain any bare template parameter pack. */
14882 /* integral_constant_value will pull out this expression, so make sure
14883 it's folded as appropriate. */
14886 /* Create the enumerator. */
14888 }
14890 /* Parse a namespace-name.
14892 namespace-name:
14893 original-namespace-name
14894 namespace-alias
14896 Returns the NAMESPACE_DECL for the namespace. */
14898 static tree
14900 {
14901 tree identifier;
14902 tree namespace_decl;
14906 /* Get the name of the namespace. */
14911 /* Look up the identifier in the currently active scope. Look only
14912 for namespaces, due to:
14914 [basic.lookup.udir]
14916 When looking up a namespace-name in a using-directive or alias
14917 definition, only namespace names are considered.
14919 And:
14921 [basic.lookup.qual]
14923 During the lookup of a name preceding the :: scope resolution
14924 operator, object, function, and enumerator names are ignored.
14926 (Note that cp_parser_qualifying_entity only calls this
14927 function if the token after the name is the scope resolution
14928 operator.) */
14930 none_type,
14936 /* If it's not a namespace, issue an error. */
14939 {
14944 }
14947 }
14949 /* Parse a namespace-definition.
14951 namespace-definition:
14952 named-namespace-definition
14953 unnamed-namespace-definition
14955 named-namespace-definition:
14956 original-namespace-definition
14957 extension-namespace-definition
14959 original-namespace-definition:
14960 namespace identifier { namespace-body }
14962 extension-namespace-definition:
14963 namespace original-namespace-name { namespace-body }
14965 unnamed-namespace-definition:
14966 namespace { namespace-body } */
14968 static void
14970 {
14976 {
14980 }
14981 else
14984 /* Look for the `namespace' keyword. */
14987 /* Get the name of the namespace. We do not attempt to distinguish
14988 between an original-namespace-definition and an
14989 extension-namespace-definition at this point. The semantic
14990 analysis routines are responsible for that. */
14993 else
14996 /* Parse any specified attributes. */
14999 /* Look for the `{' to start the namespace. */
15001 /* Start the namespace. */
15004 /* "inline namespace" is equivalent to a stub namespace definition
15005 followed by a strong using directive. */
15007 {
15009 /* Set up namespace association. */
15013 /* Import the contents of the inline namespace. */
15017 }
15021 /* Parse the body of the namespace. */
15027 /* Finish the namespace. */
15029 /* Look for the final `}'. */
15031 }
15033 /* Parse a namespace-body.
15035 namespace-body:
15036 declaration-seq [opt] */
15038 static void
15040 {
15042 }
15044 /* Parse a namespace-alias-definition.
15046 namespace-alias-definition:
15047 namespace identifier = qualified-namespace-specifier ; */
15049 static void
15051 {
15052 tree identifier;
15053 tree namespace_specifier;
15057 /* Look for the `namespace' keyword. */
15059 /* Look for the identifier. */
15063 /* Look for the `=' token. */
15066 {
15068 /* Skip the definition. */
15073 }
15075 /* Look for the qualified-namespace-specifier. */
15076 namespace_specifier
15078 /* Look for the `;' token. */
15081 /* Register the alias in the symbol table. */
15083 }
15085 /* Parse a qualified-namespace-specifier.
15087 qualified-namespace-specifier:
15088 :: [opt] nested-name-specifier [opt] namespace-name
15090 Returns a NAMESPACE_DECL corresponding to the specified
15091 namespace. */
15093 static tree
15095 {
15096 /* Look for the optional `::'. */
15100 /* Look for the optional nested-name-specifier. */
15108 }
15110 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
15111 access declaration.
15113 using-declaration:
15114 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
15115 using :: unqualified-id ;
15117 access-declaration:
15118 qualified-id ;
15120 */
15122 static bool
15125 {
15129 tree decl;
15130 tree identifier;
15131 tree qscope;
15136 {
15139 }
15140 else
15141 {
15142 /* Look for the `using' keyword. */
15145 /* Peek at the next token. */
15147 /* See if it's `typename'. */
15149 {
15150 /* Remember that we've seen it. */
15152 /* Consume the `typename' token. */
15154 }
15155 }
15157 /* Look for the optional global scope qualification. */
15158 global_scope_p
15163 /* If we saw `typename', or didn't see `::', then there must be a
15164 nested-name-specifier present. */
15170 /* Otherwise, we could be in either of the two productions. In that
15171 case, treat the nested-name-specifier as optional. */
15172 else
15182 /* Something has already gone wrong; there's no need to parse
15183 further. Since an error has occurred, the return value of
15184 cp_parser_parse_definitely will be false, as required. */
15188 /* Parse the unqualified-id. */
15196 {
15201 }
15203 /* The function we call to handle a using-declaration is different
15204 depending on what scope we are in. */
15206 ;
15209 /* [namespace.udecl]
15211 A using declaration shall not name a template-id. */
15214 else
15215 {
15217 {
15218 /* Create the USING_DECL. */
15226 else
15227 /* Add it to the list of members in this class. */
15229 }
15230 else
15231 {
15233 identifier,
15243 else
15245 }
15246 }
15248 /* Look for the final `;'. */
15253 "access declarations are deprecated "
15254 "in favour of using-declarations; "
15258 }
15260 /* Parse an alias-declaration.
15262 alias-declaration:
15263 using identifier attribute-specifier-seq [opt] = type-id */
15265 static tree
15267 {
15269 location_t id_location;
15271 cp_decl_specifier_seq decl_specs;
15275 /* Look for the `using' keyword. */
15276 cp_token *using_token
15296 /* Now we are going to parse the type-id of the declaration. */
15298 /*
15299 [dcl.type]/3 says:
15301 "A type-specifier-seq shall not define a class or enumeration
15302 unless it appears in the type-id of an alias-declaration (7.1.3) that
15303 is not the declaration of a template-declaration."
15305 In other words, if we currently are in an alias template, the
15306 type-id should not define a type.
15308 So let's set parser->type_definition_forbidden_message in that
15309 case; cp_parser_check_type_definition (called by
15310 cp_parser_class_specifier) will then emit an error if a type is
15311 defined in the type-id. */
15313 {
15317 }
15321 /* Restore the error message if need be. */
15330 /* A typedef-name can also be introduced by an alias-declaration. The
15331 identifier following the using keyword becomes a typedef-name. It has
15332 the same semantics as if it were introduced by the typedef
15333 specifier. In particular, it does not define a new type and it shall
15334 not appear in the type-id. */
15339 {
15342 ds_attribute,
15343 attrs_token);
15344 }
15346 ds_typedef,
15347 using_token);
15349 ds_alias,
15350 using_token);
15359 else
15370 /* If decl is a template, return its TEMPLATE_DECL so that it gets
15371 added into the symbol table; otherwise, return the TYPE_DECL. */
15375 {
15379 }
15382 }
15384 /* Parse a using-directive.
15386 using-directive:
15387 using namespace :: [opt] nested-name-specifier [opt]
15388 namespace-name ; */
15390 static void
15392 {
15393 tree namespace_decl;
15394 tree attribs;
15396 /* Look for the `using' keyword. */
15398 /* And the `namespace' keyword. */
15400 /* Look for the optional `::' operator. */
15402 /* And the optional nested-name-specifier. */
15408 /* Get the namespace being used. */
15410 /* And any specified attributes. */
15412 /* Update the symbol table. */
15414 /* Look for the final `;'. */
15416 }
15418 /* Parse an asm-definition.
15420 asm-definition:
15421 asm ( string-literal ) ;
15423 GNU Extension:
15425 asm-definition:
15426 asm volatile [opt] ( string-literal ) ;
15427 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
15428 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15429 : asm-operand-list [opt] ) ;
15430 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15431 : asm-operand-list [opt]
15432 : asm-clobber-list [opt] ) ;
15433 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
15434 : asm-clobber-list [opt]
15435 : asm-goto-list ) ; */
15437 static void
15439 {
15440 tree string;
15445 tree asm_stmt;
15453 /* Look for the `asm' keyword. */
15455 /* See if the next token is `volatile'. */
15458 {
15459 /* Remember that we saw the `volatile' keyword. */
15461 /* Consume the token. */
15463 }
15467 {
15468 /* Remember that we saw the `goto' keyword. */
15470 /* Consume the token. */
15472 }
15473 /* Look for the opening `('. */
15476 /* Look for the string. */
15479 {
15483 }
15485 /* If we're allowing GNU extensions, check for the extended assembly
15486 syntax. Unfortunately, the `:' tokens need not be separated by
15487 a space in C, and so, for compatibility, we tolerate that here
15488 too. Doing that means that we have to treat the `::' operator as
15489 two `:' tokens. */
15494 {
15499 /* The extended syntax was used. */
15502 /* Look for outputs. */
15504 {
15505 /* Consume the `:'. */
15507 /* Parse the output-operands. */
15509 CPP_COLON)
15511 CPP_SCOPE)
15513 CPP_CLOSE_PAREN)
15519 }
15520 /* If the next token is `::', there are no outputs, and the
15521 next token is the beginning of the inputs. */
15523 /* The inputs are coming next. */
15526 /* Look for inputs. */
15529 {
15530 /* Consume the `:' or `::'. */
15532 /* Parse the output-operands. */
15534 CPP_COLON)
15536 CPP_SCOPE)
15538 CPP_CLOSE_PAREN))
15543 }
15545 /* The clobbers are coming next. */
15548 /* Look for clobbers. */
15551 {
15553 /* Consume the `:' or `::'. */
15555 /* Parse the clobbers. */
15557 CPP_COLON)
15559 CPP_CLOSE_PAREN))
15561 }
15564 /* The labels are coming next. */
15567 /* Look for labels. */
15570 {
15572 /* Consume the `:' or `::'. */
15574 /* Parse the labels. */
15576 }
15580 }
15584 /* Look for the closing `)'. */
15592 {
15593 /* Create the ASM_EXPR. */
15595 {
15598 /* If the extended syntax was not used, mark the ASM_EXPR. */
15600 {
15606 }
15607 }
15608 else
15610 }
15611 }
15613 /* Declarators [gram.dcl.decl] */
15615 /* Parse an init-declarator.
15617 init-declarator:
15618 declarator initializer [opt]
15620 GNU Extension:
15622 init-declarator:
15623 declarator asm-specification [opt] attributes [opt] initializer [opt]
15625 function-definition:
15626 decl-specifier-seq [opt] declarator ctor-initializer [opt]
15627 function-body
15628 decl-specifier-seq [opt] declarator function-try-block
15630 GNU Extension:
15632 function-definition:
15633 __extension__ function-definition
15635 TM Extension:
15637 function-definition:
15638 decl-specifier-seq [opt] declarator function-transaction-block
15640 The DECL_SPECIFIERS apply to this declarator. Returns a
15641 representation of the entity declared. If MEMBER_P is TRUE, then
15642 this declarator appears in a class scope. The new DECL created by
15643 this declarator is returned.
15645 The CHECKS are access checks that should be performed once we know
15646 what entity is being declared (and, therefore, what classes have
15647 befriended it).
15649 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
15650 for a function-definition here as well. If the declarator is a
15651 declarator for a function-definition, *FUNCTION_DEFINITION_P will
15652 be TRUE upon return. By that point, the function-definition will
15653 have been completely parsed.
15655 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
15656 is FALSE.
15658 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15659 parsed declaration if it is an uninitialized single declarator not followed
15660 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15661 if present, will not be consumed. If returned, this declarator will be
15662 created with SD_INITIALIZED but will not call cp_finish_decl. */
15664 static tree
15673 {
15677 tree prefix_attributes;
15679 tree asm_specification;
15680 tree initializer;
15682 tree scope;
15684 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
15685 initialized with "= ..", CPP_OPEN_PAREN if initialized with
15686 "(...)". */
15695 /* Gather the attributes that were provided with the
15696 decl-specifiers. */
15699 /* Assume that this is not the declarator for a function
15700 definition. */
15704 /* Defer access checks while parsing the declarator; we cannot know
15705 what names are accessible until we know what is being
15706 declared. */
15709 /* Parse the declarator. */
15711 declarator
15715 member_p);
15716 /* Gather up the deferred checks. */
15719 /* If the DECLARATOR was erroneous, there's no need to go
15720 further. */
15724 /* Check that the number of template-parameter-lists is OK. */
15734 /* Figure out what scope the entity declared by the DECLARATOR is
15735 located in. `grokdeclarator' sometimes changes the scope, so
15736 we compute it now. */
15739 /* Perform any lookups in the declared type which were thought to be
15740 dependent, but are not in the scope of the declarator. */
15741 decl_specifiers->type
15744 /* If we're allowing GNU extensions, look for an
15745 asm-specification. */
15747 {
15748 /* Look for an asm-specification. */
15751 }
15752 else
15755 /* Look for attributes. */
15759 /* Peek at the next token. */
15761 /* Check to see if the token indicates the start of a
15762 function-definition. */
15765 {
15767 {
15768 /* If a function-definition should not appear here, issue an
15769 error message. */
15773 }
15774 else
15775 {
15776 location_t func_brace_location
15779 /* Neither attributes nor an asm-specification are allowed
15780 on a function-definition. */
15783 "an asm-specification is not allowed "
15788 /* This is a function-definition. */
15791 /* Parse the function definition. */
15794 decl_specifiers,
15795 declarator,
15796 prefix_attributes);
15797 else
15798 decl
15799 = (cp_parser_function_definition_from_specifiers_and_declarator
15803 {
15804 /* This is where the prologue starts... */
15807 }
15810 }
15811 }
15813 /* [dcl.dcl]
15815 Only in function declarations for constructors, destructors, and
15816 type conversions can the decl-specifier-seq be omitted.
15818 We explicitly postpone this check past the point where we handle
15819 function-definitions because we tolerate function-definitions
15820 that are missing their return types in some modes. */
15822 {
15826 }
15828 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
15832 {
15840 {
15846 }
15847 }
15848 else
15849 {
15850 /* If the init-declarator isn't initialized and isn't followed by a
15851 `,' or `;', it's not a valid init-declarator. */
15854 {
15857 else
15858 {
15861 }
15862 }
15865 }
15867 /* Because start_decl has side-effects, we should only call it if we
15868 know we're going ahead. By this point, we know that we cannot
15869 possibly be looking at any other construct. */
15872 /* If the decl specifiers were bad, issue an error now that we're
15873 sure this was intended to be a declarator. Then continue
15874 declaring the variable(s), as int, to try to cut down on further
15875 errors. */
15878 {
15881 }
15883 /* Check to see whether or not this declaration is a friend. */
15886 /* Enter the newly declared entry in the symbol table. If we're
15887 processing a declaration in a class-specifier, we wait until
15888 after processing the initializer. */
15890 {
15897 /* Adjust location of decl if declarator->id_loc is more appropriate:
15898 set, and decl wasn't merged with another decl, in which case its
15899 location would be different from input_location, and more accurate. */
15904 }
15906 /* Enter the SCOPE. That way unqualified names appearing in the
15907 initializer will be looked up in SCOPE. */
15910 /* Perform deferred access control checks, now that we know in which
15911 SCOPE the declared entity resides. */
15913 {
15916 /* If the entity being declared is a function, pretend that we
15917 are in its scope. If it is a `friend', it may have access to
15918 things that would not otherwise be accessible. */
15920 {
15923 }
15925 /* Perform access checks for template parameters. */
15928 /* Perform the access control checks for the declarator and the
15929 decl-specifiers. */
15932 /* Restore the saved value. */
15935 }
15937 /* Parse the initializer. */
15942 {
15944 {
15948 else
15949 {
15950 /* If the declaration was erroneous, we don't really
15951 know what the user intended, so just silently
15952 consume the initializer. */
15960 }
15961 }
15962 else
15963 {
15964 /* We want to record the extra mangling scope for in-class
15965 initializers of class members and initializers of static data
15966 member templates. The former involves deferring
15967 parsing of the initializer until end of class as with default
15968 arguments. So right here we only handle the latter. */
15978 }
15979 }
15981 /* The old parser allows attributes to appear after a parenthesized
15982 initializer. Mark Mitchell proposed removing this functionality
15983 on the GCC mailing lists on 2002-08-13. This parser accepts the
15984 attributes -- but ignores them. */
15991 /* For an in-class declaration, use `grokfield' to create the
15992 declaration. */
15994 {
15996 {
15999 }
16003 prefix_attributes);
16006 }
16008 /* Finish processing the declaration. But, skip member
16009 declarations. */
16011 {
16014 asm_specification,
16015 /* If the initializer is in parentheses, then this is
16016 a direct-initialization, which means that an
16017 `explicit' constructor is OK. Otherwise, an
16018 `explicit' constructor cannot be used. */
16021 }
16024 /* Core issue #226 (C++0x only): A default template-argument
16025 shall not be specified in a friend class template
16026 declaration. */
16034 }
16036 /* Parse a declarator.
16038 declarator:
16039 direct-declarator
16040 ptr-operator declarator
16042 abstract-declarator:
16043 ptr-operator abstract-declarator [opt]
16044 direct-abstract-declarator
16046 GNU Extensions:
16048 declarator:
16049 attributes [opt] direct-declarator
16050 attributes [opt] ptr-operator declarator
16052 abstract-declarator:
16053 attributes [opt] ptr-operator abstract-declarator [opt]
16054 attributes [opt] direct-abstract-declarator
16056 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
16057 detect constructor, destructor or conversion operators. It is set
16058 to -1 if the declarator is a name, and +1 if it is a
16059 function. Otherwise it is set to zero. Usually you just want to
16060 test for >0, but internally the negative value is used.
16062 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
16063 a decl-specifier-seq unless it declares a constructor, destructor,
16064 or conversion. It might seem that we could check this condition in
16065 semantic analysis, rather than parsing, but that makes it difficult
16066 to handle something like `f()'. We want to notice that there are
16067 no decl-specifiers, and therefore realize that this is an
16068 expression, not a declaration.)
16070 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
16071 the declarator is a direct-declarator of the form "(...)".
16073 MEMBER_P is true iff this declarator is a member-declarator. */
16077 cp_parser_declarator_kind dcl_kind,
16081 {
16084 cp_cv_quals cv_quals;
16085 tree class_type;
16088 /* Assume this is not a constructor, destructor, or type-conversion
16089 operator. */
16096 /* Check for the ptr-operator production. */
16098 /* Parse the ptr-operator. */
16104 /* If that worked, then we have a ptr-operator. */
16106 {
16107 /* If a ptr-operator was found, then this declarator was not
16108 parenthesized. */
16111 /* The dependent declarator is optional if we are parsing an
16112 abstract-declarator. */
16116 /* Parse the dependent declarator. */
16122 /* If we are parsing an abstract-declarator, we must handle the
16123 case where the dependent declarator is absent. */
16128 declarator = cp_parser_make_indirect_declarator
16130 }
16131 /* Everything else is a direct-declarator. */
16132 else
16133 {
16136 CPP_OPEN_PAREN);
16138 ctor_dtor_or_conv_p,
16139 member_p);
16140 }
16145 }
16147 /* Parse a direct-declarator or direct-abstract-declarator.
16149 direct-declarator:
16150 declarator-id
16151 direct-declarator ( parameter-declaration-clause )
16152 cv-qualifier-seq [opt]
16153 exception-specification [opt]
16154 direct-declarator [ constant-expression [opt] ]
16155 ( declarator )
16157 direct-abstract-declarator:
16158 direct-abstract-declarator [opt]
16159 ( parameter-declaration-clause )
16160 cv-qualifier-seq [opt]
16161 exception-specification [opt]
16162 direct-abstract-declarator [opt] [ constant-expression [opt] ]
16163 ( abstract-declarator )
16165 Returns a representation of the declarator. DCL_KIND is
16166 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
16167 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
16168 we are parsing a direct-declarator. It is
16169 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
16170 of ambiguity we prefer an abstract declarator, as per
16171 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
16172 cp_parser_declarator. */
16176 cp_parser_declarator_kind dcl_kind,
16179 {
16189 {
16190 /* Peek at the next token. */
16193 {
16194 /* This is either a parameter-declaration-clause, or a
16195 parenthesized declarator. When we know we are parsing a
16196 named declarator, it must be a parenthesized declarator
16197 if FIRST is true. For instance, `(int)' is a
16198 parameter-declaration-clause, with an omitted
16199 direct-abstract-declarator. But `((*))', is a
16200 parenthesized abstract declarator. Finally, when T is a
16201 template parameter `(T)' is a
16202 parameter-declaration-clause, and not a parenthesized
16203 named declarator.
16205 We first try and parse a parameter-declaration-clause,
16206 and then try a nested declarator (if FIRST is true).
16208 It is not an error for it not to be a
16209 parameter-declaration-clause, even when FIRST is
16210 false. Consider,
16212 int i (int);
16213 int i (3);
16215 The first is the declaration of a function while the
16216 second is the definition of a variable, including its
16217 initializer.
16219 Having seen only the parenthesis, we cannot know which of
16220 these two alternatives should be selected. Even more
16221 complex are examples like:
16223 int i (int (a));
16224 int i (int (3));
16226 The former is a function-declaration; the latter is a
16227 variable initialization.
16229 Thus again, we try a parameter-declaration-clause, and if
16230 that fails, we back out and return. */
16233 {
16234 tree params;
16237 tree t;
16239 /* In a member-declarator, the only valid interpretation
16240 of a parenthesis is the start of a
16241 parameter-declaration-clause. (It is invalid to
16242 initialize a static data member with a parenthesized
16243 initializer; only the "=" form of initialization is
16244 permitted.) */
16248 /* Consume the `('. */
16251 {
16252 /* If this is going to be an abstract declarator, we're
16253 in a declarator and we can't have default args. */
16256 }
16258 /* Inside the function parameter list, surrounding
16259 template-parameter-lists do not apply. */
16260 saved_num_template_parameter_lists
16266 /* Parse the parameter-declaration-clause. */
16269 parser->num_template_parameter_lists
16272 /* Consume the `)'. */
16275 /* If all went well, parse the cv-qualifier-seq and the
16276 exception-specification. */
16278 {
16279 cp_cv_quals cv_quals;
16280 cp_virt_specifiers virt_specifiers;
16281 tree exception_specification;
16282 tree late_return;
16283 tree attrs;
16291 /* Parse the cv-qualifier-seq. */
16293 /* And the exception-specification. */
16294 exception_specification
16299 late_return = (cp_parser_late_return_type_opt
16302 /* Parse the virt-specifier-seq. */
16305 /* Create the function-declarator. */
16307 params,
16308 cv_quals,
16309 virt_specifiers,
16310 exception_specification,
16311 late_return);
16313 /* Any subsequent parameter lists are to do with
16314 return type, so are not those of the declared
16315 function. */
16317 }
16319 /* Remove the function parms from scope. */
16325 /* Repeat the main loop. */
16327 }
16329 /* If this is the first, we can try a parenthesized
16330 declarator. */
16332 {
16338 /* Consume the `('. */
16340 /* Parse the nested declarator. */
16343 declarator
16346 member_p);
16349 /* Expect a `)'. */
16356 }
16357 /* Otherwise, we must be done. */
16358 else
16360 }
16364 {
16365 /* Parse an array-declarator. */
16374 /* Consume the `['. */
16376 /* Peek at the next token. */
16378 /* If the next token is `]', then there is no
16379 constant-expression. */
16381 {
16384 bounds
16394 {
16395 /* Normally, the array bound must be an integral constant
16396 expression. However, as an extension, we allow VLAs
16397 in function scopes as long as they aren't part of a
16398 parameter declaration. */
16402 }
16404 {
16405 /* Remember this wasn't a constant-expression. */
16408 }
16409 }
16410 else
16412 /* Look for the closing `]'. */
16414 {
16417 }
16422 }
16424 {
16425 {
16426 tree qualifying_scope;
16427 tree unqualified_name;
16428 tree attrs;
16429 special_function_kind sfk;
16434 /* Parse a declarator-id */
16437 {
16440 /* If we see an ellipsis, we should be looking at a
16441 parameter pack. */
16443 {
16444 /* Consume the `...' */
16448 }
16449 }
16452 unqualified_name
16456 {
16460 {
16461 /* Check whether an error occurred. */
16464 /* We already consumed the ellipsis to mark a
16465 parameter pack, but we have no way to report it,
16466 so abort the tentative parse. We will be exiting
16467 immediately anyway. */
16469 }
16470 else
16476 && (qualifying_scope
16479 {
16482 }
16483 }
16488 {
16493 }
16499 {
16500 /* In the declaration of a member of a template class
16501 outside of the class itself, the SCOPE will sometimes
16502 be a TYPENAME_TYPE. For example, given:
16504 template <typename T>
16505 int S<T>::R::i = 3;
16507 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
16508 this context, we must resolve S<T>::R to an ordinary
16509 type, rather than a typename type.
16511 The reason we normally avoid resolving TYPENAME_TYPEs
16512 is that a specialization of `S' might render
16513 `S<T>::R' not a type. However, if `S' is
16514 specialized, then this `i' will not be used, so there
16515 is no harm in resolving the types here. */
16516 tree type;
16518 /* Resolve the TYPENAME_TYPE. */
16521 /* If that failed, the declarator is invalid. */
16523 {
16526 "cannot define member of dependent typedef "
16528 else
16533 }
16535 }
16540 {
16541 tree class_type;
16546 else
16550 {
16553 {
16556 {
16560 "use %<%T::%D%> instead of %<%T::%D%> to "
16562 class_type,
16567 }
16568 else
16570 }
16571 else
16572 {
16573 /* We do not attempt to print the declarator
16574 here because we do not have enough
16575 information about its original syntactic
16576 form. */
16580 }
16581 }
16584 {
16590 for an anonymous type, even if the type
16591 got a name for linkage purposes. */
16594 class_type))
16595 {
16598 }
16606 }
16607 }
16609 unqualified_name,
16610 sfk);
16617 }
16619 handle_declarator:;
16622 /* Any names that appear after the declarator-id for a
16623 member are looked up in the containing scope. */
16628 /* Default args are only allowed on function
16629 declarations. */
16631 else
16635 }
16636 /* We're done. */
16637 else
16639 }
16641 /* For an abstract declarator, we might wind up with nothing at this
16642 point. That's an error; the declarator is not optional. */
16646 /* If we entered a scope, we must exit it now. */
16654 }
16656 /* Parse a ptr-operator.
16658 ptr-operator:
16659 * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
16660 * cv-qualifier-seq [opt]
16661 &
16662 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
16663 nested-name-specifier * attribute-specifier-seq [opt] cv-qualifier-seq [opt] (C++11)
16665 GNU Extension:
16667 ptr-operator:
16668 & cv-qualifier-seq [opt]
16670 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
16671 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
16672 an rvalue reference. In the case of a pointer-to-member, *TYPE is
16673 filled in with the TYPE containing the member. *CV_QUALS is
16674 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
16675 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
16676 Note that the tree codes returned by this function have nothing
16677 to do with the types of trees that will be eventually be created
16678 to represent the pointer or reference type being parsed. They are
16679 just constants with suggestive names. */
16680 static enum tree_code
16685 {
16690 /* Assume that it's not a pointer-to-member. */
16692 /* And that there are no cv-qualifiers. */
16695 /* Peek at the next token. */
16698 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
16708 {
16709 /* Consume the `*', `&' or `&&'. */
16712 /* A `*' can be followed by a cv-qualifier-seq, and so can a
16713 `&', if we are allowing GNU extensions. (The only qualifier
16714 that can legally appear after `&' is `restrict', but that is
16715 enforced during semantic analysis. */
16723 }
16724 else
16725 {
16726 /* Try the pointer-to-member case. */
16728 /* Look for the optional `::' operator. */
16731 /* Look for the nested-name specifier. */
16738 /* If we found it, and the next token is a `*', then we are
16739 indeed looking at a pointer-to-member operator. */
16742 {
16743 /* Indicate that the `*' operator was used. */
16751 else
16752 {
16753 /* The type of which the member is a member is given by the
16754 current SCOPE. */
16756 /* The next name will not be qualified. */
16760 /* Look for optional c++11 attributes. */
16764 /* Look for the optional cv-qualifier-seq. */
16766 }
16767 }
16768 /* If that didn't work we don't have a ptr-operator. */
16771 }
16774 }
16776 /* Parse an (optional) cv-qualifier-seq.
16778 cv-qualifier-seq:
16779 cv-qualifier cv-qualifier-seq [opt]
16781 cv-qualifier:
16782 const
16783 volatile
16785 GNU Extension:
16787 cv-qualifier:
16788 __restrict__
16790 Returns a bitmask representing the cv-qualifiers. */
16792 static cp_cv_quals
16794 {
16798 {
16800 cp_cv_quals cv_qualifier;
16802 /* Peek at the next token. */
16804 /* See if it's a cv-qualifier. */
16806 {
16822 }
16828 {
16831 }
16832 else
16833 {
16836 }
16837 }
16840 }
16842 /* Parse an (optional) virt-specifier-seq.
16844 virt-specifier-seq:
16845 virt-specifier virt-specifier-seq [opt]
16847 virt-specifier:
16848 override
16849 final
16851 Returns a bitmask representing the virt-specifiers. */
16853 static cp_virt_specifiers
16855 {
16859 {
16861 cp_virt_specifiers virt_specifier;
16863 /* Peek at the next token. */
16865 /* See if it's a virt-specifier-qualifier. */
16869 {
16872 }
16874 {
16877 }
16879 {
16881 }
16882 else
16886 {
16889 }
16890 else
16891 {
16894 }
16895 }
16897 }
16899 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
16900 is in scope even though it isn't real. */
16902 static void
16904 {
16905 tree this_parm;
16908 {
16909 /* We don't clear this between NSDMIs. Is it already what we want? */
16914 }
16917 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
16919 current_class_ref
16922 }
16924 /* Parse a late-specified return type, if any. This is not a separate
16925 non-terminal, but part of a function declarator, which looks like
16927 -> trailing-type-specifier-seq abstract-declarator(opt)
16929 Returns the type indicated by the type-id.
16931 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
16932 function. */
16934 static tree
16936 {
16938 tree type;
16940 /* Peek at the next token. */
16942 /* A late-specified return type is indicated by an initial '->'. */
16946 /* Consume the ->. */
16950 {
16951 /* DR 1207: 'this' is in scope in the trailing return type. */
16954 }
16962 }
16964 /* Parse a declarator-id.
16966 declarator-id:
16967 id-expression
16968 :: [opt] nested-name-specifier [opt] type-name
16970 In the `id-expression' case, the value returned is as for
16971 cp_parser_id_expression if the id-expression was an unqualified-id.
16972 If the id-expression was a qualified-id, then a SCOPE_REF is
16973 returned. The first operand is the scope (either a NAMESPACE_DECL
16974 or TREE_TYPE), but the second is still just a representation of an
16975 unqualified-id. */
16977 static tree
16979 {
16980 tree id;
16981 /* The expression must be an id-expression. Assume that qualified
16982 names are the names of types so that:
16984 template <class T>
16985 int S<T>::R::i = 3;
16987 will work; we must treat `S<T>::R' as the name of a type.
16988 Similarly, assume that qualified names are templates, where
16989 required, so that:
16991 template <class T>
16992 int S<T>::R<T>::i = 3;
16994 will work, too. */
17000 optional_p);
17004 }
17006 /* Parse a type-id.
17008 type-id:
17009 type-specifier-seq abstract-declarator [opt]
17011 Returns the TYPE specified. */
17013 static tree
17016 {
17017 cp_decl_specifier_seq type_specifier_seq;
17020 /* Parse the type-specifier-seq. */
17022 is_trailing_return,
17027 /* There might or might not be an abstract declarator. */
17029 /* Look for the declarator. */
17030 abstract_declarator
17034 /* Check to see if there really was a declarator. */
17040 {
17041 /* A type-id with type 'auto' is only ok if the abstract declarator
17042 is a function declarator with a late-specified return type. */
17047 else
17048 {
17051 }
17052 }
17055 is_template_arg);
17056 }
17059 {
17061 }
17064 {
17065 tree r;
17067 parser->type_definition_forbidden_message
17072 }
17075 {
17077 }
17079 /* Parse a type-specifier-seq.
17081 type-specifier-seq:
17082 type-specifier type-specifier-seq [opt]
17084 GNU extension:
17086 type-specifier-seq:
17087 attributes type-specifier-seq [opt]
17089 If IS_DECLARATION is true, we are at the start of a "condition" or
17090 exception-declaration, so we might be followed by a declarator-id.
17092 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
17093 i.e. we've just seen "->".
17095 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
17097 static void
17102 {
17107 /* Clear the TYPE_SPECIFIER_SEQ. */
17110 /* In the context of a trailing return type, enum E { } is an
17111 elaborated-type-specifier followed by a function-body, not an
17112 enum-specifier. */
17116 /* Parse the type-specifiers and attributes. */
17118 {
17119 tree type_specifier;
17122 /* Check for attributes first. */
17124 {
17129 }
17131 /* record the token of the beginning of the type specifier seq,
17132 for error reporting purposes*/
17136 /* Look for the type-specifier. */
17138 flags,
17139 type_specifier_seq,
17141 NULL,
17144 {
17145 /* If the first type-specifier could not be found, this is not a
17146 type-specifier-seq at all. */
17148 {
17152 }
17153 /* If subsequent type-specifiers could not be found, the
17154 type-specifier-seq is complete. */
17156 }
17159 /* The standard says that a condition can be:
17161 type-specifier-seq declarator = assignment-expression
17163 However, given:
17165 struct S {};
17166 if (int S = ...)
17168 we should treat the "S" as a declarator, not as a
17169 type-specifier. The standard doesn't say that explicitly for
17170 type-specifier-seq, but it does say that for
17171 decl-specifier-seq in an ordinary declaration. Perhaps it
17172 would be clearer just to allow a decl-specifier-seq here, and
17173 then add a semantic restriction that if any decl-specifiers
17174 that are not type-specifiers appear, the program is invalid. */
17177 }
17178 }
17180 /* Parse a parameter-declaration-clause.
17182 parameter-declaration-clause:
17183 parameter-declaration-list [opt] ... [opt]
17184 parameter-declaration-list , ...
17186 Returns a representation for the parameter declarations. A return
17187 value of NULL indicates a parameter-declaration-clause consisting
17188 only of an ellipsis. */
17190 static tree
17192 {
17193 tree parameters;
17198 /* Peek at the next token. */
17200 /* Check for trivial parameter-declaration-clauses. */
17202 {
17203 /* Consume the `...' token. */
17206 }
17208 /* There are no parameters. */
17209 {
17210 #ifndef NO_IMPLICIT_EXTERN_C
17214 else
17215 #endif
17217 }
17218 /* Check for `(void)', too, which is a special case. */
17222 {
17223 /* Consume the `void' token. */
17225 /* There are no parameters. */
17227 }
17229 /* Parse the parameter-declaration-list. */
17231 /* If a parse error occurred while parsing the
17232 parameter-declaration-list, then the entire
17233 parameter-declaration-clause is erroneous. */
17237 /* Peek at the next token. */
17239 /* If it's a `,', the clause should terminate with an ellipsis. */
17241 {
17242 /* Consume the `,'. */
17244 /* Expect an ellipsis. */
17245 ellipsis_p
17247 }
17248 /* It might also be `...' if the optional trailing `,' was
17249 omitted. */
17251 {
17252 /* Consume the `...' token. */
17254 /* And remember that we saw it. */
17256 }
17257 else
17260 /* Finish the parameter list. */
17265 }
17267 /* Parse a parameter-declaration-list.
17269 parameter-declaration-list:
17270 parameter-declaration
17271 parameter-declaration-list , parameter-declaration
17273 Returns a representation of the parameter-declaration-list, as for
17274 cp_parser_parameter_declaration_clause. However, the
17275 `void_list_node' is never appended to the list. Upon return,
17276 *IS_ERROR will be true iff an error occurred. */
17278 static tree
17280 {
17286 /* Assume all will go well. */
17288 /* The special considerations that apply to a function within an
17289 unbraced linkage specifications do not apply to the parameters
17290 to the function. */
17291 saved_in_unbraced_linkage_specification_p
17295 /* Look for more parameters. */
17297 {
17301 /* Parse the parameter. */
17302 parameter
17307 /* We don't know yet if the enclosing context is deprecated, so wait
17308 and warn in grokparms if appropriate. */
17314 PARM,
17320 /* If a parse error occurred parsing the parameter declaration,
17321 then the entire parameter-declaration-list is erroneous. */
17323 {
17327 }
17337 {
17341 }
17343 /* Add the new parameter to the list. */
17347 /* Peek at the next token. */
17350 /* These are for Objective-C++ */
17353 /* The parameter-declaration-list is complete. */
17356 {
17359 /* Peek at the next token. */
17361 /* If it's an ellipsis, then the list is complete. */
17364 /* Otherwise, there must be more parameters. Consume the
17365 `,'. */
17367 /* When parsing something like:
17369 int i(float f, double d)
17371 we can tell after seeing the declaration for "f" that we
17372 are not looking at an initialization of a variable "i",
17373 but rather at the declaration of a function "i".
17375 Due to the fact that the parsing of template arguments
17376 (as specified to a template-id) requires backtracking we
17377 cannot use this technique when inside a template argument
17378 list. */
17382 /* However, a parameter-declaration of the form
17383 "foat(f)" (which is a valid declaration of a
17384 parameter "f") can also be interpreted as an
17385 expression (the conversion of "f" to "float"). */
17388 }
17389 else
17390 {
17398 }
17399 }
17401 parser->in_unbraced_linkage_specification_p
17405 }
17407 /* Parse a parameter declaration.
17409 parameter-declaration:
17410 decl-specifier-seq ... [opt] declarator
17411 decl-specifier-seq declarator = assignment-expression
17412 decl-specifier-seq ... [opt] abstract-declarator [opt]
17413 decl-specifier-seq abstract-declarator [opt] = assignment-expression
17415 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
17416 declares a template parameter. (In that case, a non-nested `>'
17417 token encountered during the parsing of the assignment-expression
17418 is not interpreted as a greater-than operator.)
17420 Returns a representation of the parameter, or NULL if an error
17421 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
17422 true iff the declarator is of the form "(p)". */
17428 {
17430 cp_decl_specifier_seq decl_specifiers;
17432 tree default_argument;
17436 /* In a template parameter, `>' is not an operator.
17438 [temp.param]
17440 When parsing a default template-argument for a non-type
17441 template-parameter, the first non-nested `>' is taken as the end
17442 of the template parameter-list rather than a greater-than
17443 operator. */
17445 /* Type definitions may not appear in parameter types. */
17447 parser->type_definition_forbidden_message
17450 /* Parse the declaration-specifiers. */
17452 CP_PARSER_FLAGS_NONE,
17456 /* Complain about missing 'typename' or other invalid type names. */
17460 /* If an error occurred, there's no reason to attempt to parse the
17461 rest of the declaration. */
17463 {
17466 }
17468 /* Peek at the next token. */
17471 /* If the next token is a `)', `,', `=', `>', or `...', then there
17472 is no declarator. However, when variadic templates are enabled,
17473 there may be a declarator following `...'. */
17478 {
17482 }
17483 /* Otherwise, there should be a declarator. */
17484 else
17485 {
17489 /* After seeing a decl-specifier-seq, if the next token is not a
17490 "(", there is no possibility that the code is a valid
17491 expression. Therefore, if parsing tentatively, we commit at
17492 this point. */
17494 /* In an expression context, having seen:
17496 (int((char ...
17498 we cannot be sure whether we are looking at a
17499 function-type (taking a "char" as a parameter) or a cast
17500 of some object of type "char" to "int". */
17506 /* Parse the declarator. */
17509 CP_PARSER_DECLARATOR_EITHER,
17511 parenthesized_p,
17514 /* After the declarator, allow more attributes. */
17515 decl_specifiers.attributes
17518 }
17520 /* If the next token is an ellipsis, and we have not seen a
17521 declarator name, and the type of the declarator contains parameter
17522 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
17523 a parameter pack expansion expression. Otherwise, leave the
17524 ellipsis for a C-style variadic function. */
17527 {
17538 {
17539 /* Consume the `...'. */
17543 /* Build a pack expansion type */
17546 else
17548 }
17549 }
17551 /* The restriction on defining new types applies only to the type
17552 of the parameter, not to the default argument. */
17555 /* If the next token is `=', then process a default argument. */
17557 {
17559 /* If we are defining a class, then the tokens that make up the
17560 default argument must be saved and processed later. */
17565 /* Outside of a class definition, we can just parse the
17566 assignment-expression. */
17567 else
17568 default_argument
17572 {
17575 else
17576 {
17578 "default arguments are only "
17581 }
17582 }
17586 {
17587 /* Find the name of the parameter pack. */
17594 template_parm_p
17600 else
17602 template_parm_p
17609 }
17610 }
17611 else
17615 declarator,
17616 default_argument);
17617 }
17619 /* Parse a default argument and return it.
17621 TEMPLATE_PARM_P is true if this is a default argument for a
17622 non-type template parameter. */
17623 static tree
17625 {
17631 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
17632 set correctly. */
17635 /* Local variable names (and the `this' keyword) may not
17636 appear in a default argument. */
17639 /* Parse the assignment-expression. */
17642 default_argument
17652 }
17654 /* Parse a function-body.
17656 function-body:
17657 compound_statement */
17659 static void
17661 {
17663 }
17665 /* Parse a ctor-initializer-opt followed by a function-body. Return
17666 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
17667 is true we are parsing a function-try-block. */
17669 static bool
17672 {
17680 /* Begin the function body. */
17682 /* Parse the optional ctor-initializer. */
17685 /* If we're parsing a constexpr constructor definition, we need
17686 to check that the constructor body is indeed empty. However,
17687 before we get to cp_parser_function_body lot of junk has been
17688 generated, so we can't just check that we have an empty block.
17689 Rather we take a snapshot of the outermost block, and check whether
17690 cp_parser_function_body changed its state. */
17692 {
17696 }
17697 /* Parse the function-body. */
17701 /* Finish the function body. */
17705 }
17707 /* Parse an initializer.
17709 initializer:
17710 = initializer-clause
17711 ( expression-list )
17713 Returns an expression representing the initializer. If no
17714 initializer is present, NULL_TREE is returned.
17716 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
17717 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
17718 set to TRUE if there is no initializer present. If there is an
17719 initializer, and it is not a constant-expression, *NON_CONSTANT_P
17720 is set to true; otherwise it is set to false. */
17722 static tree
17725 {
17727 tree init;
17729 /* Peek at the next token. */
17732 /* Let our caller know whether or not this initializer was
17733 parenthesized. */
17735 /* Assume that the initializer is constant. */
17739 {
17740 /* Consume the `='. */
17742 /* Parse the initializer-clause. */
17744 }
17746 {
17751 non_constant_p);
17756 }
17758 {
17762 }
17763 else
17764 {
17765 /* Anything else is an error. */
17768 }
17771 }
17773 /* Parse an initializer-clause.
17775 initializer-clause:
17776 assignment-expression
17777 braced-init-list
17779 Returns an expression representing the initializer.
17781 If the `assignment-expression' production is used the value
17782 returned is simply a representation for the expression.
17784 Otherwise, calls cp_parser_braced_list. */
17786 static tree
17788 {
17789 tree initializer;
17791 /* Assume the expression is constant. */
17794 /* If it is not a `{', then we are looking at an
17795 assignment-expression. */
17797 {
17798 initializer
17801 non_constant_p);
17802 }
17803 else
17807 }
17809 /* Parse a brace-enclosed initializer list.
17811 braced-init-list:
17812 { initializer-list , [opt] }
17813 { }
17815 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
17816 the elements of the initializer-list (or NULL, if the last
17817 production is used). The TREE_TYPE for the CONSTRUCTOR will be
17818 NULL_TREE. There is no way to detect whether or not the optional
17819 trailing `,' was provided. NON_CONSTANT_P is as for
17820 cp_parser_initializer. */
17822 static tree
17824 {
17825 tree initializer;
17827 /* Consume the `{' token. */
17829 /* Create a CONSTRUCTOR to represent the braced-initializer. */
17831 /* If it's not a `}', then there is a non-trivial initializer. */
17833 {
17834 /* Parse the initializer list. */
17837 /* A trailing `,' token is allowed. */
17840 }
17841 /* Now, there should be a trailing `}'. */
17845 }
17847 /* Parse an initializer-list.
17849 initializer-list:
17850 initializer-clause ... [opt]
17851 initializer-list , initializer-clause ... [opt]
17853 GNU Extension:
17855 initializer-list:
17856 designation initializer-clause ...[opt]
17857 initializer-list , designation initializer-clause ...[opt]
17859 designation:
17860 . identifier =
17861 identifier :
17862 [ constant-expression ] =
17864 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
17865 for the initializer. If the INDEX of the elt is non-NULL, it is the
17866 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
17867 as for cp_parser_initializer. */
17871 {
17874 /* Assume all of the expressions are constant. */
17877 /* Parse the rest of the list. */
17879 {
17881 tree designator;
17882 tree initializer;
17885 /* If the next token is an identifier and the following one is a
17886 colon, we are looking at the GNU designated-initializer
17887 syntax. */
17891 {
17892 /* Warn the user that they are using an extension. */
17895 /* Consume the identifier. */
17897 /* Consume the `:'. */
17899 }
17900 /* Also handle the C99 syntax, '. id ='. */
17905 {
17906 /* Warn the user that they are using an extension. */
17909 /* Consume the `.'. */
17911 /* Consume the identifier. */
17913 /* Consume the `='. */
17915 }
17916 /* Also handle C99 array designators, '[ const ] ='. */
17920 {
17921 /* In C++11, [ could start a lambda-introducer. */
17929 }
17930 else
17933 /* Parse the initializer. */
17936 /* If any clause is non-constant, so is the entire initializer. */
17940 /* If we have an ellipsis, this is an initializer pack
17941 expansion. */
17943 {
17944 /* Consume the `...'. */
17947 /* Turn the initializer into an initializer expansion. */
17949 }
17951 /* Add it to the vector. */
17954 /* If the next token is not a comma, we have reached the end of
17955 the list. */
17959 /* Peek at the next token. */
17961 /* If the next token is a `}', then we're still done. An
17962 initializer-clause can have a trailing `,' after the
17963 initializer-list and before the closing `}'. */
17967 /* Consume the `,' token. */
17969 }
17972 }
17974 /* Classes [gram.class] */
17976 /* Parse a class-name.
17978 class-name:
17979 identifier
17980 template-id
17982 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
17983 to indicate that names looked up in dependent types should be
17984 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
17985 keyword has been used to indicate that the name that appears next
17986 is a template. TAG_TYPE indicates the explicit tag given before
17987 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
17988 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
17989 is the class being defined in a class-head.
17991 Returns the TYPE_DECL representing the class. */
17993 static tree
18001 {
18002 tree decl;
18003 tree scope;
18008 /* All class-names start with an identifier. */
18011 {
18014 }
18016 /* PARSER->SCOPE can be cleared when parsing the template-arguments
18017 to a template-id, so we save it here. */
18022 /* Any name names a type if we're following the `typename' keyword
18023 in a qualified name where the enclosing scope is type-dependent. */
18026 /* Handle the common case (an identifier, but not a template-id)
18027 efficiently. */
18030 {
18034 /* Look for the identifier. */
18038 /* If the next token isn't an identifier, we are certainly not
18039 looking at a class-name. */
18042 /* If we know this is a type-name, there's no need to look it
18043 up. */
18046 else
18047 {
18048 tree ambiguous_decls;
18049 /* If we already know that this lookup is ambiguous, then
18050 we've already issued an error message; there's no reason
18051 to check again. */
18053 {
18056 }
18057 /* If the next token is a `::', then the name must be a type
18058 name.
18060 [basic.lookup.qual]
18062 During the lookup for a name preceding the :: scope
18063 resolution operator, object, function, and enumerator
18064 names are ignored. */
18067 /* Look up the name. */
18069 tag_type,
18072 check_dependency_p,
18076 {
18080 }
18081 }
18082 }
18083 else
18084 {
18085 /* Try a template-id. */
18087 check_dependency_p,
18088 tag_type,
18089 is_declaration);
18092 }
18096 /* If this is a typename, create a TYPENAME_TYPE. */
18098 {
18103 }
18107 /* Check to see that it is really the name of a class. */
18111 /* Situations like this:
18113 template <typename T> struct A {
18114 typename T::template X<int>::I i;
18115 };
18117 are problematic. Is `T::template X<int>' a class-name? The
18118 standard does not seem to be definitive, but there is no other
18119 valid interpretation of the following `::'. Therefore, those
18120 names are considered class-names. */
18121 {
18125 }
18129 /* In Objective-C 2.0, a classname followed by '.' starts a
18130 dot-syntax expression, and it's not a type-name. */
18142 }
18144 /* Parse a class-specifier.
18146 class-specifier:
18147 class-head { member-specification [opt] }
18149 Returns the TREE_TYPE representing the class. */
18151 static tree
18153 {
18154 tree type;
18168 /* Parse the class-head. */
18171 /* If the class-head was a semantic disaster, skip the entire body
18172 of the class. */
18174 {
18178 }
18180 /* Look for the `{'. */
18182 {
18185 }
18187 /* Issue an error message if type-definitions are forbidden here. */
18189 /* Remember that we are defining one more class. */
18191 /* Inside the class, surrounding template-parameter-lists do not
18192 apply. */
18193 saved_num_template_parameter_lists
18196 /* We are not in a function body. */
18199 /* Or in a loop. */
18202 /* Or in a switch. */
18205 /* We are not immediately inside an extern "lang" block. */
18206 saved_in_unbraced_linkage_specification_p
18210 /* Start the class. */
18212 {
18215 }
18219 /* If the type is erroneous, skip the entire body of the class. */
18221 else
18222 /* Parse the member-specification. */
18225 /* Look for the trailing `}'. */
18227 /* Look for trailing attributes to apply to this class. */
18235 /* We've finished a type definition. Check for the common syntax
18236 error of forgetting a semicolon after the definition. We need to
18237 be careful, as we can't just check for not-a-semicolon and be done
18238 with it; the user might have typed:
18240 class X { } c = ...;
18241 class X { } *p = ...;
18243 and so forth. Instead, enumerate all the possible tokens that
18244 might follow this production; if we don't see one of them, then
18245 complain and silently insert the semicolon. */
18246 {
18251 /* Don't try to parse c++11 attributes here. As per the
18252 grammar, that should be a task for
18253 cp_parser_decl_specifier_seq. */
18257 {
18268 /* While it's legal for type qualifiers and storage class
18269 specifiers to follow type definitions in the grammar, only
18270 compiler testsuites contain code like that. Assume that if
18271 we see such code, then what we're really seeing is a case
18272 like:
18274 class X { }
18275 const <type> var = ...;
18277 or
18279 class Y { }
18280 static <type> func (...) ...
18282 i.e. the qualifier or specifier applies to the next
18283 declaration. To do so, however, we need to look ahead one
18284 more token to see if *that* token is a type specifier.
18286 This code could be improved to handle:
18288 class Z { }
18289 static const <type> var = ...; */
18292 {
18295 /* Handling user-defined types here would be nice, but very
18296 tricky. */
18297 want_semicolon
18300 }
18304 }
18306 /* If we don't have a type, then something is very wrong and we
18307 shouldn't try to do anything clever. Likewise for not seeing the
18308 closing brace. */
18310 {
18311 cp_token_position prev
18322 else
18325 /* Unget one token and smash it to look as though we encountered
18326 a semicolon in the input stream. */
18331 }
18332 }
18334 /* If this class is not itself within the scope of another class,
18335 then we need to parse the bodies of all of the queued function
18336 definitions. Note that the queued functions defined in a class
18337 are not always processed immediately following the
18338 class-specifier for that class. Consider:
18340 struct A {
18341 struct B { void f() { sizeof (A); } };
18342 };
18344 If `f' were processed before the processing of `A' were
18345 completed, there would be no way to compute the size of `A'.
18346 Note that the nesting we are interested in here is lexical --
18347 not the semantic nesting given by TYPE_CONTEXT. In particular,
18348 for:
18350 struct A { struct B; };
18351 struct A::B { void f() { } };
18353 there is no need to delay the parsing of `A::B::f'. */
18355 {
18356 tree decl;
18363 /* In a first pass, parse default arguments to the functions.
18364 Then, in a second pass, parse the bodies of the functions.
18365 This two-phased approach handles cases like:
18367 struct S {
18368 void f() { g(); }
18369 void g(int i = 3);
18370 };
18372 */
18375 {
18377 /* If there are default arguments that have not yet been processed,
18378 take care of them now. */
18380 {
18385 }
18386 /* Make sure that any template parameters are in scope. */
18388 /* Parse the default argument expressions. */
18390 /* Remove any template parameters from the symbol table. */
18392 }
18394 /* Now parse any NSDMIs. */
18398 {
18400 {
18405 }
18408 }
18414 /* Now parse the body of the functions. */
18418 }
18420 /* Put back any saved access checks. */
18423 /* Restore saved state. */
18427 parser->num_template_parameter_lists
18429 parser->in_unbraced_linkage_specification_p
18433 }
18435 static tree
18437 {
18438 tree ret;
18443 }
18445 /* Parse a class-head.
18447 class-head:
18448 class-key identifier [opt] base-clause [opt]
18449 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
18450 class-key nested-name-specifier [opt] template-id
18451 base-clause [opt]
18453 class-virt-specifier:
18454 final
18456 GNU Extensions:
18457 class-key attributes identifier [opt] base-clause [opt]
18458 class-key attributes nested-name-specifier identifier base-clause [opt]
18459 class-key attributes nested-name-specifier [opt] template-id
18460 base-clause [opt]
18462 Upon return BASES is initialized to the list of base classes (or
18463 NULL, if there are none) in the same form returned by
18464 cp_parser_base_clause.
18466 Returns the TYPE of the indicated class. Sets
18467 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
18468 involving a nested-name-specifier was used, and FALSE otherwise.
18470 Returns error_mark_node if this is not a class-head.
18472 Returns NULL_TREE if the class-head is syntactically valid, but
18473 semantically invalid in a way that means we should skip the entire
18474 body of the class. */
18476 static tree
18479 {
18480 tree nested_name_specifier;
18484 tree attributes;
18485 tree bases;
18495 /* Assume no nested-name-specifier will be present. */
18497 /* Assume no template parameter lists will be used in defining the
18498 type. */
18502 /* Look for the class-key. */
18507 /* Parse the attributes. */
18510 /* If the next token is `::', that is invalid -- but sometimes
18511 people do try to write:
18513 struct ::S {};
18515 Handle this gracefully by accepting the extra qualifier, and then
18516 issuing an error about it later if this really is a
18517 class-head. If it turns out just to be an elaborated type
18518 specifier, remain silent. */
18524 /* Determine the name of the class. Begin by looking for an
18525 optional nested-name-specifier. */
18527 nested_name_specifier
18533 /* If there was a nested-name-specifier, then there *must* be an
18534 identifier. */
18536 {
18538 /* Although the grammar says `identifier', it really means
18539 `class-name' or `template-name'. You are only allowed to
18540 define a class that has already been declared with this
18541 syntax.
18543 The proposed resolution for Core Issue 180 says that wherever
18544 you see `class T::X' you should treat `X' as a type-name.
18546 It is OK to define an inaccessible class; for example:
18548 class A { class B; };
18549 class A::B {};
18551 We do not know if we will see a class-name, or a
18552 template-name. We look for a class-name first, in case the
18553 class-name is a template-id; if we looked for the
18554 template-name first we would stop after the template-name. */
18559 class_type,
18563 /* If that didn't work, ignore the nested-name-specifier. */
18565 {
18571 }
18572 /* If we could not find a corresponding TYPE, treat this
18573 declaration like an unqualified declaration. */
18576 /* Otherwise, count the number of templates used in TYPE and its
18577 containing scopes. */
18578 else
18579 {
18580 tree scope;
18593 }
18594 }
18595 /* Otherwise, the identifier is optional. */
18596 else
18597 {
18598 /* We don't know whether what comes next is a template-id,
18599 an identifier, or nothing at all. */
18601 /* Check for a template-id. */
18606 class_key,
18608 /* If that didn't work, it could still be an identifier. */
18610 {
18612 {
18615 }
18616 else
18618 }
18619 else
18620 {
18623 }
18624 }
18629 {
18631 class_key,
18633 }
18636 /* If it's not a `:' or a `{' then we can't really be looking at a
18637 class-head, since a class-head only appears as part of a
18638 class-specifier. We have to detect this situation before calling
18639 xref_tag, since that has irreversible side-effects. */
18641 {
18645 }
18647 /* At this point, we're going ahead with the class-specifier, even
18648 if some other problem occurs. */
18651 {
18656 }
18657 /* Issue the error about the overly-qualified name now. */
18659 {
18664 }
18666 {
18671 }
18673 {
18674 tree scope;
18676 /* Reject typedef-names in class heads. */
18678 {
18681 type);
18684 }
18686 /* Figure out in what scope the declaration is being placed. */
18688 /* If that scope does not contain the scope in which the
18689 class was originally declared, the program is invalid. */
18691 {
18694 "declaration of %qD in namespace %qD which does not "
18697 else
18703 }
18704 /* [dcl.meaning]
18706 A declarator-id shall not be qualified except for the
18707 definition of a ... nested class outside of its class
18708 ... [or] the definition or explicit instantiation of a
18709 class member of a namespace outside of its namespace. */
18711 {
18716 }
18717 }
18718 /* An explicit-specialization must be preceded by "template <>". If
18719 it is not, try to recover gracefully. */
18723 {
18727 /* Take the same action that would have been taken by
18728 cp_parser_explicit_specialization. */
18731 }
18732 /* There must be no "return" statements between this point and the
18733 end of this function; set "type "to the correct return value and
18734 use "goto done;" to return. */
18735 /* Make sure that the right number of template parameters were
18736 present. */
18740 {
18741 /* If something went wrong, there is no point in even trying to
18742 process the class-definition. */
18745 }
18747 /* Look up the type. */
18749 {
18753 {
18757 }
18758 else
18759 {
18762 }
18765 }
18767 {
18768 tree class_type;
18770 /* Given:
18772 template <typename T> struct S { struct T };
18773 template <typename T> struct S<T>::T { };
18775 we will get a TYPENAME_TYPE when processing the definition of
18776 `S::T'. We need to resolve it to the actual type before we
18777 try to define it. */
18779 {
18784 else
18785 {
18788 }
18789 }
18793 {
18796 }
18799 /* Enter the scope indicated by the nested-name-specifier. */
18801 /* Get the canonical version of this type. */
18805 {
18808 {
18811 }
18812 }
18816 }
18818 {
18819 /* If the class was unnamed, create a dummy name. */
18824 }
18826 /* Indicate whether this class was declared as a `class' or as a
18827 `struct'. */
18832 /* If this type was already complete, and we see another definition,
18833 that's an error. */
18835 {
18837 type);
18839 type);
18842 }
18847 {
18848 /* Apply attributes now, before any use of the class as a template
18849 argument in its base list. */
18852 }
18854 /* We will have entered the scope containing the class; the names of
18855 base classes should be looked up in that context. For example:
18857 struct A { struct B {}; struct C; };
18858 struct A::C : B {};
18860 is valid. */
18862 /* Get the list of base-classes, if there is one. */
18865 else
18868 /* If we're really defining a class, process the base classes.
18869 If they're invalid, fail. */
18874 done:
18875 /* Leave the scope given by the nested-name-specifier. We will
18876 enter the class scope itself while processing the members. */
18881 {
18884 }
18890 out:
18893 }
18895 /* Parse a class-key.
18897 class-key:
18898 class
18899 struct
18900 union
18902 Returns the kind of class-key specified, or none_type to indicate
18903 error. */
18905 static enum tag_types
18907 {
18911 /* Look for the class-key. */
18916 /* Check to see if the TOKEN is a class-key. */
18921 }
18923 /* Parse an (optional) member-specification.
18925 member-specification:
18926 member-declaration member-specification [opt]
18927 access-specifier : member-specification [opt] */
18929 static void
18931 {
18933 {
18937 /* Peek at the next token. */
18939 /* If it's a `}', or EOF then we've seen all the members. */
18945 /* See if this token is a keyword. */
18948 {
18952 /* Consume the access-specifier. */
18954 /* Remember which access-specifier is active. */
18956 /* Look for the `:'. */
18961 /* Accept #pragmas at class scope. */
18963 {
18966 }
18968 /* Otherwise, the next construction must be a
18969 member-declaration. */
18971 }
18972 }
18973 }
18975 /* Parse a member-declaration.
18977 member-declaration:
18978 decl-specifier-seq [opt] member-declarator-list [opt] ;
18979 function-definition ; [opt]
18980 :: [opt] nested-name-specifier template [opt] unqualified-id ;
18981 using-declaration
18982 template-declaration
18983 alias-declaration
18985 member-declarator-list:
18986 member-declarator
18987 member-declarator-list , member-declarator
18989 member-declarator:
18990 declarator pure-specifier [opt]
18991 declarator constant-initializer [opt]
18992 identifier [opt] : constant-expression
18994 GNU Extensions:
18996 member-declaration:
18997 __extension__ member-declaration
18999 member-declarator:
19000 declarator attributes [opt] pure-specifier [opt]
19001 declarator attributes [opt] constant-initializer [opt]
19002 identifier [opt] attributes [opt] : constant-expression
19004 C++0x Extensions:
19006 member-declaration:
19007 static_assert-declaration */
19009 static void
19011 {
19012 cp_decl_specifier_seq decl_specifiers;
19013 tree prefix_attributes;
19014 tree decl;
19023 /* Check for the `__extension__' keyword. */
19025 {
19026 /* Recurse. */
19028 /* Restore the old value of the PEDANTIC flag. */
19032 }
19034 /* Check for a template-declaration. */
19036 {
19037 /* An explicit specialization here is an error condition, and we
19038 expect the specialization handler to detect and report this. */
19042 else
19046 }
19048 /* Check for a using-declaration. */
19050 {
19052 {
19053 /* Parse the using-declaration. */
19057 }
19058 else
19059 {
19060 tree decl;
19065 else
19069 }
19070 }
19072 /* Check for @defs. */
19074 {
19079 {
19084 }
19086 }
19088 /* If the next token is `static_assert' we have a static assertion. */
19090 {
19093 }
19100 /* Parse the decl-specifier-seq. */
19103 CP_PARSER_FLAGS_OPTIONAL,
19106 /* Check for an invalid type-name. */
19110 /* If there is no declarator, then the decl-specifier-seq should
19111 specify a type. */
19113 {
19114 /* If there was no decl-specifier-seq, and the next token is a
19115 `;', then we have something like:
19117 struct S { ; };
19119 [class.mem]
19121 Each member-declaration shall declare at least one member
19122 name of the class. */
19124 {
19128 }
19129 else
19130 {
19131 tree type;
19133 /* See if this declaration is a friend. */
19135 /* If there were decl-specifiers, check to see if there was
19136 a class-declaration. */
19139 /* Nested classes have already been added to the class, but
19140 a `friend' needs to be explicitly registered. */
19142 {
19143 /* If the `friend' keyword was present, the friend must
19144 be introduced with a class-key. */
19147 "in C++03 a class-key must be used "
19149 /* In this case:
19151 template <typename T> struct A {
19152 friend struct A<T>::B;
19153 };
19155 A<T>::B will be represented by a TYPENAME_TYPE, and
19156 therefore not recognized by check_tag_decl. */
19158 {
19162 }
19165 "friend declaration does not name a class or "
19167 else
19170 }
19171 /* If there is no TYPE, an error message will already have
19172 been issued. */
19174 ;
19175 /* An anonymous aggregate has to be handled specially; such
19176 a declaration really declares a data member (with a
19177 particular type), as opposed to a nested class. */
19179 {
19180 /* C++11 9.5/6. */
19183 "a storage class on an anonymous aggregate "
19186 /* Remove constructors and such from TYPE, now that we
19187 know it is an anonymous aggregate. */
19189 /* And make the corresponding data member. */
19192 /* Add it to the class. */
19194 }
19195 else
19196 cp_parser_check_access_in_redeclaration
19199 }
19200 }
19201 else
19202 {
19205 /* Clear attributes from the decl_specifiers but keep them
19206 around as prefix attributes that apply them to the entity
19207 being declared. */
19211 /* See if these declarations will be friends. */
19214 /* Keep going until we hit the `;' at the end of the
19215 declaration. */
19217 {
19219 tree first_attribute;
19221 /* Peek at the next token. */
19224 /* Check for a bitfield declaration. */
19229 {
19230 tree identifier;
19231 tree width;
19233 /* Get the name of the bitfield. Note that we cannot just
19234 check TOKEN here because it may have been invalidated by
19235 the call to cp_lexer_peek_nth_token above. */
19238 else
19241 /* Consume the `:' token. */
19243 /* Get the width of the bitfield. */
19244 width
19247 NULL);
19249 /* Look for attributes that apply to the bitfield. */
19251 /* Remember which attributes are prefix attributes and
19252 which are not. */
19254 /* Combine the attributes. */
19257 /* Create the bitfield declaration. */
19260 identifier,
19261 sfk_none)
19264 width,
19265 attributes);
19266 }
19267 else
19268 {
19270 tree initializer;
19271 tree asm_specification;
19274 /* Parse the declarator. */
19275 declarator
19281 /* If something went wrong parsing the declarator, make sure
19282 that we at least consume some tokens. */
19284 {
19285 /* Skip to the end of the statement. */
19287 /* If the next token is not a semicolon, that is
19288 probably because we just skipped over the body of
19289 a function. So, we consume a semicolon if
19290 present, but do not issue an error message if it
19291 is not present. */
19293 CPP_SEMICOLON))
19296 }
19299 cp_parser_check_for_definition_in_return_type
19303 /* Look for an asm-specification. */
19305 /* Look for attributes that apply to the declaration. */
19307 /* Remember which attributes are prefix attributes and
19308 which are not. */
19310 /* Combine the attributes. */
19313 /* If it's an `=', then we have a constant-initializer or a
19314 pure-specifier. It is not correct to parse the
19315 initializer before registering the member declaration
19316 since the member declaration should be in scope while
19317 its initializer is processed. However, the rest of the
19318 front end does not yet provide an interface that allows
19319 us to handle this correctly. */
19321 {
19322 /* In [class.mem]:
19324 A pure-specifier shall be used only in the declaration of
19325 a virtual function.
19327 A member-declarator can contain a constant-initializer
19328 only if it declares a static member of integral or
19329 enumeration type.
19331 Therefore, if the DECLARATOR is for a function, we look
19332 for a pure-specifier; otherwise, we look for a
19333 constant-initializer. When we call `grokfield', it will
19334 perform more stringent semantics checks. */
19345 {
19347 /* Don't require a constant rvalue in C++11, since we
19348 might want a reference constant. We'll enforce
19349 constancy later. */
19351 /* Parse the initializer. */
19354 }
19355 else
19356 /* Parse the initializer. */
19358 }
19361 {
19365 else
19367 }
19368 /* Otherwise, there is no initializer. */
19369 else
19372 /* See if we are probably looking at a function
19373 definition. We are certainly not looking at a
19374 member-declarator. Calling `grokfield' has
19375 side-effects, so we must not do it unless we are sure
19376 that we are looking at a member-declarator. */
19379 {
19380 /* The grammar does not allow a pure-specifier to be
19381 used when a member function is defined. (It is
19382 possible that this fact is an oversight in the
19383 standard, since a pure function may be defined
19384 outside of the class-specifier. */
19390 declarator,
19391 attributes);
19392 /* If the member was not a friend, declare it here. */
19395 /* Peek at the next token. */
19397 /* If the next token is a semicolon, consume it. */
19401 }
19402 else
19405 /* Create the declaration. */
19408 asm_specification,
19409 attributes);
19410 }
19412 /* Reset PREFIX_ATTRIBUTES. */
19418 /* If there is any qualification still in effect, clear it
19419 now; we will be starting fresh with the next declarator. */
19423 /* If it's a `,', then there are more declarators. */
19426 /* If the next token isn't a `;', then we have a parse error. */
19428 CPP_SEMICOLON))
19429 {
19430 /* The next token might be a ways away from where the
19431 actual semicolon is missing. Find the previous token
19432 and use that for our error position. */
19437 /* Assume that the user meant to provide a semicolon. If
19438 we were to cp_parser_skip_to_end_of_statement, we might
19439 skip to a semicolon inside a member function definition
19440 and issue nonsensical error messages. */
19442 }
19445 {
19446 /* Add DECL to the list of members. */
19455 /* Add DECL to the queue of NSDMI to be parsed later. */
19457 }
19461 }
19462 }
19465 out:
19467 }
19469 /* Parse a pure-specifier.
19471 pure-specifier:
19472 = 0
19474 Returns INTEGER_ZERO_NODE if a pure specifier is found.
19475 Otherwise, ERROR_MARK_NODE is returned. */
19477 static tree
19479 {
19482 /* Look for the `=' token. */
19485 /* Look for the `0' token. */
19494 /* Accept = default or = delete in c++0x mode. */
19497 {
19500 }
19502 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
19504 {
19509 }
19511 {
19514 }
19517 }
19519 /* Parse a constant-initializer.
19521 constant-initializer:
19522 = constant-expression
19524 Returns a representation of the constant-expression. */
19526 static tree
19528 {
19529 /* Look for the `=' token. */
19533 /* It is invalid to write:
19535 struct S { static const int i = { 7 }; };
19537 */
19539 {
19542 /* Consume the opening brace. */
19544 /* Skip the initializer. */
19546 /* Look for the trailing `}'. */
19550 }
19554 NULL);
19555 }
19557 /* Derived classes [gram.class.derived] */
19559 /* Parse a base-clause.
19561 base-clause:
19562 : base-specifier-list
19564 base-specifier-list:
19565 base-specifier ... [opt]
19566 base-specifier-list , base-specifier ... [opt]
19568 Returns a TREE_LIST representing the base-classes, in the order in
19569 which they were declared. The representation of each node is as
19570 described by cp_parser_base_specifier.
19572 In the case that no bases are specified, this function will return
19573 NULL_TREE, not ERROR_MARK_NODE. */
19575 static tree
19577 {
19580 /* Look for the `:' that begins the list. */
19583 /* Scan the base-specifier-list. */
19585 {
19587 tree base;
19590 /* Look for the base-specifier. */
19592 /* Look for the (optional) ellipsis. */
19594 {
19595 /* Consume the `...'. */
19599 }
19601 /* Add BASE to the front of the list. */
19603 {
19605 /* Make this a pack expansion type. */
19609 {
19612 }
19613 }
19614 /* Peek at the next token. */
19616 /* If it's not a comma, then the list is complete. */
19619 /* Consume the `,'. */
19621 }
19623 /* PARSER->SCOPE may still be non-NULL at this point, if the last
19624 base class had a qualified name. However, the next name that
19625 appears is certainly not qualified. */
19631 }
19633 /* Parse a base-specifier.
19635 base-specifier:
19636 :: [opt] nested-name-specifier [opt] class-name
19637 virtual access-specifier [opt] :: [opt] nested-name-specifier
19638 [opt] class-name
19639 access-specifier virtual [opt] :: [opt] nested-name-specifier
19640 [opt] class-name
19642 Returns a TREE_LIST. The TREE_PURPOSE will be one of
19643 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
19644 indicate the specifiers provided. The TREE_VALUE will be a TYPE
19645 (or the ERROR_MARK_NODE) indicating the type that was specified. */
19647 static tree
19649 {
19657 tree type;
19659 /* Process the optional `virtual' and `access-specifier'. */
19661 {
19662 /* Peek at the next token. */
19664 /* Process `virtual'. */
19666 {
19668 /* If `virtual' appears more than once, issue an error. */
19670 {
19674 }
19678 /* Consume the `virtual' token. */
19686 /* If more than one access specifier appears, issue an
19687 error. */
19690 {
19694 }
19698 /* Consume the access-specifier. */
19706 }
19707 }
19708 /* It is not uncommon to see programs mechanically, erroneously, use
19709 the 'typename' keyword to denote (dependent) qualified types
19710 as base classes. */
19712 {
19717 else
19719 "keyword %<typename%> not allowed in this context "
19722 }
19724 /* Look for the optional `::' operator. */
19726 /* Look for the nested-name-specifier. The simplest way to
19727 implement:
19729 [temp.res]
19731 The keyword `typename' is not permitted in a base-specifier or
19732 mem-initializer; in these contexts a qualified name that
19733 depends on a template-parameter is implicitly assumed to be a
19734 type name.
19736 is to pretend that we have seen the `typename' keyword at this
19737 point. */
19741 typename_type,
19743 /* If the base class is given by a qualified name, assume that names
19744 we see are type names or templates, as appropriate. */
19750 /* DR 950 allows decltype as a base-specifier. */
19752 else
19753 {
19754 /* Otherwise, look for the class-name. */
19756 class_scope_p,
19757 template_p,
19758 typename_type,
19763 }
19769 }
19771 /* Exception handling [gram.exception] */
19773 /* Parse an (optional) noexcept-specification.
19775 noexcept-specification:
19776 noexcept ( constant-expression ) [opt]
19778 If no noexcept-specification is present, returns NULL_TREE.
19779 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
19780 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
19781 there are no parentheses. CONSUMED_EXPR will be set accordingly.
19782 Otherwise, returns a noexcept specification unless RETURN_COND is true,
19783 in which case a boolean condition is returned instead. */
19785 static tree
19790 {
19794 /* Peek at the next token. */
19797 /* Is it a noexcept-specification? */
19799 {
19800 tree expr;
19804 {
19808 {
19809 /* Types may not be defined in an exception-specification. */
19811 parser->type_definition_forbidden_message
19816 /* Restore the saved message. */
19818 }
19819 else
19820 {
19823 }
19826 }
19827 else
19828 {
19832 }
19834 /* We cannot build a noexcept-spec right away because this will check
19835 that expr is a constexpr. */
19838 else
19840 }
19841 else
19843 }
19845 /* Parse an (optional) exception-specification.
19847 exception-specification:
19848 throw ( type-id-list [opt] )
19850 Returns a TREE_LIST representing the exception-specification. The
19851 TREE_VALUE of each node is a type. */
19853 static tree
19855 {
19857 tree type_id_list;
19860 /* Peek at the next token. */
19863 /* Is it a noexcept-specification? */
19869 /* If it's not `throw', then there's no exception-specification. */
19873 #if 0
19874 /* Enable this once a lot of code has transitioned to noexcept? */
19878 #endif
19880 /* Consume the `throw'. */
19883 /* Look for the `('. */
19886 /* Peek at the next token. */
19888 /* If it's not a `)', then there is a type-id-list. */
19890 {
19891 /* Types may not be defined in an exception-specification. */
19893 parser->type_definition_forbidden_message
19895 /* Parse the type-id-list. */
19897 /* Restore the saved message. */
19899 }
19900 else
19903 /* Look for the `)'. */
19907 }
19909 /* Parse an (optional) type-id-list.
19911 type-id-list:
19912 type-id ... [opt]
19913 type-id-list , type-id ... [opt]
19915 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
19916 in the order that the types were presented. */
19918 static tree
19920 {
19924 {
19926 tree type;
19928 /* Get the next type-id. */
19930 /* Parse the optional ellipsis. */
19932 {
19933 /* Consume the `...'. */
19936 /* Turn the type into a pack expansion expression. */
19938 }
19939 /* Add it to the list. */
19941 /* Peek at the next token. */
19943 /* If it is not a `,', we are done. */
19946 /* Consume the `,'. */
19948 }
19951 }
19953 /* Parse a try-block.
19955 try-block:
19956 try compound-statement handler-seq */
19958 static tree
19960 {
19961 tree try_block;
19971 }
19973 /* Parse a function-try-block.
19975 function-try-block:
19976 try ctor-initializer [opt] function-body handler-seq */
19978 static bool
19980 {
19981 tree compound_stmt;
19982 tree try_block;
19985 /* Look for the `try' keyword. */
19988 /* Let the rest of the front end know where we are. */
19990 /* Parse the function-body. */
19991 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
19993 /* We're done with the `try' part. */
19995 /* Parse the handlers. */
19997 /* We're done with the handlers. */
20001 }
20003 /* Parse a handler-seq.
20005 handler-seq:
20006 handler handler-seq [opt] */
20008 static void
20010 {
20012 {
20015 /* Parse the handler. */
20017 /* Peek at the next token. */
20019 /* If it's not `catch' then there are no more handlers. */
20022 }
20023 }
20025 /* Parse a handler.
20027 handler:
20028 catch ( exception-declaration ) compound-statement */
20030 static void
20032 {
20033 tree handler;
20034 tree declaration;
20044 }
20046 /* Parse an exception-declaration.
20048 exception-declaration:
20049 type-specifier-seq declarator
20050 type-specifier-seq abstract-declarator
20051 type-specifier-seq
20052 ...
20054 Returns a VAR_DECL for the declaration, or NULL_TREE if the
20055 ellipsis variant is used. */
20057 static tree
20059 {
20060 cp_decl_specifier_seq type_specifiers;
20064 /* If it's an ellipsis, it's easy to handle. */
20066 {
20067 /* Consume the `...' token. */
20070 }
20072 /* Types may not be defined in exception-declarations. */
20074 parser->type_definition_forbidden_message
20077 /* Parse the type-specifier-seq. */
20081 /* If it's a `)', then there is no declarator. */
20084 else
20090 /* Restore the saved message. */
20097 }
20099 /* Parse a throw-expression.
20101 throw-expression:
20102 throw assignment-expression [opt]
20104 Returns a THROW_EXPR representing the throw-expression. */
20106 static tree
20108 {
20109 tree expression;
20114 /* Figure out whether or not there is an assignment-expression
20115 following the "throw" keyword. */
20123 else
20128 }
20130 /* GNU Extensions */
20132 /* Parse an (optional) asm-specification.
20134 asm-specification:
20135 asm ( string-literal )
20137 If the asm-specification is present, returns a STRING_CST
20138 corresponding to the string-literal. Otherwise, returns
20139 NULL_TREE. */
20141 static tree
20143 {
20145 tree asm_specification;
20147 /* Peek at the next token. */
20149 /* If the next token isn't the `asm' keyword, then there's no
20150 asm-specification. */
20154 /* Consume the `asm' token. */
20156 /* Look for the `('. */
20159 /* Look for the string-literal. */
20162 /* Look for the `)'. */
20166 }
20168 /* Parse an asm-operand-list.
20170 asm-operand-list:
20171 asm-operand
20172 asm-operand-list , asm-operand
20174 asm-operand:
20175 string-literal ( expression )
20176 [ string-literal ] string-literal ( expression )
20178 Returns a TREE_LIST representing the operands. The TREE_VALUE of
20179 each node is the expression. The TREE_PURPOSE is itself a
20180 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
20181 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
20182 is a STRING_CST for the string literal before the parenthesis. Returns
20183 ERROR_MARK_NODE if any of the operands are invalid. */
20185 static tree
20187 {
20192 {
20193 tree string_literal;
20194 tree expression;
20195 tree name;
20198 {
20199 /* Consume the `[' token. */
20201 /* Read the operand name. */
20206 /* Look for the closing `]'. */
20208 }
20209 else
20211 /* Look for the string-literal. */
20214 /* Look for the `('. */
20216 /* Parse the expression. */
20218 /* Look for the `)'. */
20226 /* Add this operand to the list. */
20228 expression,
20229 asm_operands);
20230 /* If the next token is not a `,', there are no more
20231 operands. */
20234 /* Consume the `,'. */
20236 }
20239 }
20241 /* Parse an asm-clobber-list.
20243 asm-clobber-list:
20244 string-literal
20245 asm-clobber-list , string-literal
20247 Returns a TREE_LIST, indicating the clobbers in the order that they
20248 appeared. The TREE_VALUE of each node is a STRING_CST. */
20250 static tree
20252 {
20256 {
20257 tree string_literal;
20259 /* Look for the string literal. */
20261 /* Add it to the list. */
20263 /* If the next token is not a `,', then the list is
20264 complete. */
20267 /* Consume the `,' token. */
20269 }
20272 }
20274 /* Parse an asm-label-list.
20276 asm-label-list:
20277 identifier
20278 asm-label-list , identifier
20280 Returns a TREE_LIST, indicating the labels in the order that they
20281 appeared. The TREE_VALUE of each node is a label. */
20283 static tree
20285 {
20289 {
20292 /* Look for the identifier. */
20295 {
20298 {
20304 }
20305 }
20306 /* If the next token is not a `,', then the list is
20307 complete. */
20310 /* Consume the `,' token. */
20312 }
20315 }
20317 /* Return TRUE iff the next tokens in the stream are possibly the
20318 beginning of a GNU extension attribute. */
20320 static bool
20322 {
20324 }
20326 /* Return TRUE iff the next tokens in the stream are possibly the
20327 beginning of a standard C++-11 attribute specifier. */
20329 static bool
20331 {
20333 }
20335 /* Return TRUE iff the next Nth tokens in the stream are possibly the
20336 beginning of a standard C++-11 attribute specifier. */
20338 static bool
20340 {
20348 }
20350 /* Return TRUE iff the next Nth tokens in the stream are possibly the
20351 beginning of a GNU extension attribute. */
20353 static bool
20355 {
20359 }
20361 /* Return true iff the next tokens can be the beginning of either a
20362 GNU attribute list, or a standard C++11 attribute sequence. */
20364 static bool
20366 {
20369 }
20371 /* Return true iff the next Nth tokens can be the beginning of either
20372 a GNU attribute list, or a standard C++11 attribute sequence. */
20374 static bool
20376 {
20379 }
20381 /* Parse either a standard C++-11 attribute-specifier-seq, or a series
20382 of GNU attributes, or return NULL. */
20384 static tree
20386 {
20390 }
20392 /* Parse an (optional) series of attributes.
20394 attributes:
20395 attributes attribute
20397 attribute:
20398 __attribute__ (( attribute-list [opt] ))
20400 The return value is as for cp_parser_gnu_attribute_list. */
20402 static tree
20404 {
20408 {
20410 tree attribute_list;
20413 /* Peek at the next token. */
20415 /* If it's not `__attribute__', then we're done. */
20419 /* Consume the `__attribute__' keyword. */
20421 /* Look for the two `(' tokens. */
20425 /* Peek at the next token. */
20428 /* Parse the attribute-list. */
20430 else
20431 /* If the next token is a `)', then there is no attribute
20432 list. */
20435 /* Look for the two `)' tokens. */
20443 /* Add these new attributes to the list. */
20445 }
20448 }
20450 /* Parse a GNU attribute-list.
20452 attribute-list:
20453 attribute
20454 attribute-list , attribute
20456 attribute:
20457 identifier
20458 identifier ( identifier )
20459 identifier ( identifier , expression-list )
20460 identifier ( expression-list )
20462 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
20463 to an attribute. The TREE_PURPOSE of each node is the identifier
20464 indicating which attribute is in use. The TREE_VALUE represents
20465 the arguments, if any. */
20467 static tree
20469 {
20475 {
20477 tree identifier;
20478 tree attribute;
20480 /* Look for the identifier. We also allow keywords here; for
20481 example `__attribute__ ((const))' is legal. */
20485 {
20488 /* Consume the token. */
20491 /* Save away the identifier that indicates which attribute
20492 this is. */
20494 /* For keywords, use the canonical spelling, not the
20495 parsed identifier. */
20501 /* Peek at the next token. */
20503 /* If it's an `(', then parse the attribute arguments. */
20505 {
20509 vec = cp_parser_parenthesized_expression_list
20515 else
20516 {
20519 }
20520 /* Save the arguments away. */
20522 }
20525 {
20526 /* Add this attribute to the list. */
20529 }
20532 }
20533 /* Now, look for more attributes. If the next token isn't a
20534 `,', we're done. */
20538 /* Consume the comma and keep going. */
20540 }
20543 /* We built up the list in reverse order. */
20545 }
20547 /* Parse a standard C++11 attribute.
20549 The returned representation is a TREE_LIST which TREE_PURPOSE is
20550 the scoped name of the attribute, and the TREE_VALUE is its
20551 arguments list.
20553 Note that the scoped name of the attribute is itself a TREE_LIST
20554 which TREE_PURPOSE is the namespace of the attribute, and
20555 TREE_VALUE its name. This is unlike a GNU attribute -- as parsed
20556 by cp_parser_gnu_attribute_list -- that doesn't have any namespace
20557 and which TREE_PURPOSE is directly the attribute name.
20559 Clients of the attribute code should use get_attribute_namespace
20560 and get_attribute_name to get the actual namespace and name of
20561 attributes, regardless of their being GNU or C++11 attributes.
20563 attribute:
20564 attribute-token attribute-argument-clause [opt]
20566 attribute-token:
20567 identifier
20568 attribute-scoped-token
20570 attribute-scoped-token:
20571 attribute-namespace :: identifier
20573 attribute-namespace:
20574 identifier
20576 attribute-argument-clause:
20577 ( balanced-token-seq )
20579 balanced-token-seq:
20580 balanced-token [opt]
20581 balanced-token-seq balanced-token
20583 balanced-token:
20584 ( balanced-token-seq )
20585 [ balanced-token-seq ]
20586 { balanced-token-seq }. */
20588 static tree
20590 {
20594 /* First, parse name of the the attribute, a.k.a
20595 attribute-token. */
20612 {
20613 /* We are seeing a scoped attribute token. */
20623 else
20624 {
20628 }
20630 NULL_TREE);
20632 }
20633 else
20635 NULL_TREE);
20637 /* Now parse the optional argument clause of the attribute. */
20642 {
20648 /* A GNU attribute that takes an identifier in parameter. */
20651 vec = cp_parser_parenthesized_expression_list
20657 else
20658 {
20661 }
20665 else
20667 }
20670 }
20672 /* Parse a list of standard C++-11 attributes.
20674 attribute-list:
20675 attribute [opt]
20676 attribute-list , attribute[opt]
20677 attribute ...
20678 attribute-list , attribute ...
20679 */
20681 static tree
20683 {
20688 {
20693 {
20696 }
20701 }
20704 }
20706 /* Parse a standard C++-11 attribute specifier.
20708 attribute-specifier:
20709 [ [ attribute-list ] ]
20710 alignment-specifier
20712 alignment-specifier:
20713 alignas ( type-id ... [opt] )
20714 alignas ( alignment-expression ... [opt] ). */
20716 static tree
20718 {
20724 {
20733 else
20734 /* Warn about parsing c++11 attribute in non-c++1 mode, only
20735 when we are sure that we have actually parsed them. */
20737 }
20738 else
20739 {
20740 tree alignas_expr;
20742 /* Look for an alignment-specifier. */
20754 {
20757 }
20763 {
20767 alignas_expr =
20773 }
20776 {
20779 }
20783 /* Build the C++-11 representation of an 'aligned'
20784 attribute. */
20785 attributes =
20789 }
20792 }
20794 /* Parse a standard C++-11 attribute-specifier-seq.
20796 attribute-specifier-seq:
20797 attribute-specifier-seq [opt] attribute-specifier
20798 */
20800 static tree
20802 {
20806 {
20815 }
20819 }
20821 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
20822 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
20823 current value of the PEDANTIC flag, regardless of whether or not
20824 the `__extension__' keyword is present. The caller is responsible
20825 for restoring the value of the PEDANTIC flag. */
20827 static bool
20829 {
20830 /* Save the old value of the PEDANTIC flag. */
20834 {
20835 /* Consume the `__extension__' token. */
20837 /* We're not being pedantic while the `__extension__' keyword is
20838 in effect. */
20842 }
20845 }
20847 /* Parse a label declaration.
20849 label-declaration:
20850 __label__ label-declarator-seq ;
20852 label-declarator-seq:
20853 identifier , label-declarator-seq
20854 identifier */
20856 static void
20858 {
20859 /* Look for the `__label__' keyword. */
20863 {
20864 tree identifier;
20866 /* Look for an identifier. */
20868 /* If we failed, stop. */
20871 /* Declare it as a label. */
20873 /* If the next token is a `;', stop. */
20876 /* Look for the `,' separating the label declarations. */
20878 }
20880 /* Look for the final `;'. */
20882 }
20884 /* Support Functions */
20886 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
20887 NAME should have one of the representations used for an
20888 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
20889 is returned. If PARSER->SCOPE is a dependent type, then a
20890 SCOPE_REF is returned.
20892 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
20893 returned; the name was already resolved when the TEMPLATE_ID_EXPR
20894 was formed. Abstractly, such entities should not be passed to this
20895 function, because they do not need to be looked up, but it is
20896 simpler to check for this special case here, rather than at the
20897 call-sites.
20899 In cases not explicitly covered above, this function returns a
20900 DECL, OVERLOAD, or baselink representing the result of the lookup.
20901 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
20902 is returned.
20904 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
20905 (e.g., "struct") that was used. In that case bindings that do not
20906 refer to types are ignored.
20908 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
20909 ignored.
20911 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
20912 are ignored.
20914 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
20915 types.
20917 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
20918 TREE_LIST of candidates if name-lookup results in an ambiguity, and
20919 NULL_TREE otherwise. */
20921 static tree
20928 location_t name_location)
20929 {
20930 tree decl;
20933 /* Assume that the lookup will be unambiguous. */
20937 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
20938 no longer valid. Note that if we are parsing tentatively, and
20939 the parse fails, OBJECT_TYPE will be automatically restored. */
20945 /* A template-id has already been resolved; there is no lookup to
20946 do. */
20950 {
20954 }
20956 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
20957 it should already have been checked to make sure that the name
20958 used matches the type being destroyed. */
20960 {
20961 tree type;
20963 /* Figure out to which type this destructor applies. */
20968 else
20970 /* If that's not a class type, there is no destructor. */
20977 /* If it was a class type, return the destructor. */
20979 }
20981 /* By this point, the NAME should be an ordinary identifier. If
20982 the id-expression was a qualified name, the qualifying scope is
20983 stored in PARSER->SCOPE at this point. */
20986 /* Perform the lookup. */
20988 {
20994 /* If the SCOPE is dependent, the lookup must be deferred until
20995 the template is instantiated -- unless we are explicitly
20996 looking up names in uninstantiated templates. Even then, we
20997 cannot look up the name if the scope is not a class type; it
20998 might, for example, be a template type parameter. */
21003 /* Defer lookup. */
21005 else
21006 {
21009 /* If PARSER->SCOPE is a dependent type, then it must be a
21010 class type, and we must not be checking dependencies;
21011 otherwise, we would have processed this lookup above. So
21012 that PARSER->SCOPE is not considered a dependent base by
21013 lookup_member, we must enter the scope here. */
21017 /* If the PARSER->SCOPE is a template specialization, it
21018 may be instantiated during name lookup. In that case,
21019 errors may be issued. Even if we rollback the current
21020 tentative parse, those errors are valid. */
21025 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
21026 lookup result and the nested-name-specifier nominates a class C:
21027 * if the name specified after the nested-name-specifier, when
21028 looked up in C, is the injected-class-name of C (Clause 9), or
21029 * if the name specified after the nested-name-specifier is the
21030 same as the identifier or the simple-template-id's template-
21031 name in the last component of the nested-name-specifier,
21032 the name is instead considered to name the constructor of
21033 class C. [ Note: for example, the constructor is not an
21034 acceptable lookup result in an elaborated-type-specifier so
21035 the constructor would not be used in place of the
21036 injected-class-name. --end note ] Such a constructor name
21037 shall be used only in the declarator-id of a declaration that
21038 names a constructor or in a using-declaration. */
21046 /* If we have a single function from a using decl, pull it out. */
21053 }
21055 /* If the scope is a dependent type and either we deferred lookup or
21056 we did lookup but didn't find the name, rememeber the name. */
21059 {
21061 {
21062 tree type;
21064 /* The resolution to Core Issue 180 says that `struct
21065 A::B' should be considered a type-name, even if `A'
21066 is dependent. */
21070 }
21074 CPP_CLOSE_PAREN)))
21078 else
21081 is_template);
21082 }
21085 }
21087 {
21089 /* Look up the name in the scope of the OBJECT_TYPE, unless the
21090 OBJECT_TYPE is not a class. */
21092 /* If the OBJECT_TYPE is a template specialization, it may
21093 be instantiated during name lookup. In that case, errors
21094 may be issued. Even if we rollback the current tentative
21095 parse, those errors are valid. */
21097 name,
21100 tf_warning_or_error);
21101 /* Look it up in the enclosing context, too. */
21109 }
21110 else
21111 {
21117 }
21119 /* If the lookup failed, let our caller know. */
21123 /* Pull out the template from an injected-class-name (or multiple). */
21127 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
21129 {
21132 /* The error message we have to print is too complicated for
21133 cp_parser_error, so we incorporate its actions directly. */
21135 {
21137 name);
21139 }
21141 }
21149 /* If we have resolved the name of a member declaration, check to
21150 see if the declaration is accessible. When the name resolves to
21151 set of overloaded functions, accessibility is checked when
21152 overload resolution is done.
21154 During an explicit instantiation, access is not checked at all,
21155 as per [temp.explicit]. */
21162 }
21164 /* Like cp_parser_lookup_name, but for use in the typical case where
21165 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
21166 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
21168 static tree
21170 {
21172 none_type,
21177 location);
21178 }
21180 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
21181 the current context, return the TYPE_DECL. If TAG_NAME_P is
21182 true, the DECL indicates the class being defined in a class-head,
21183 or declared in an elaborated-type-specifier.
21185 Otherwise, return DECL. */
21187 static tree
21189 {
21190 /* If the TEMPLATE_DECL is being declared as part of a class-head,
21191 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
21193 struct A {
21194 template <typename T> struct B;
21195 };
21197 template <typename T> struct A::B {};
21199 Similarly, in an elaborated-type-specifier:
21201 namespace N { struct X{}; }
21203 struct A {
21204 template <typename T> friend struct N::X;
21205 };
21207 However, if the DECL refers to a class type, and we are in
21208 the scope of the class, then the name lookup automatically
21209 finds the TYPE_DECL created by build_self_reference rather
21210 than a TEMPLATE_DECL. For example, in:
21212 template <class T> struct S {
21213 S s;
21214 };
21216 there is no need to handle such case. */
21222 }
21224 /* If too many, or too few, template-parameter lists apply to the
21225 declarator, issue an error message. Returns TRUE if all went well,
21226 and FALSE otherwise. */
21228 static bool
21231 location_t declarator_location)
21232 {
21234 {
21236 {
21244 /* If the DECLARATOR has the form `X<y>' then it uses one
21245 additional level of template parameters. */
21248 return cp_parser_check_template_parameters
21250 }
21265 }
21267 }
21269 /* NUM_TEMPLATES were used in the current declaration. If that is
21270 invalid, return FALSE and issue an error messages. Otherwise,
21271 return TRUE. If DECLARATOR is non-NULL, then we are checking a
21272 declarator and we can print more accurate diagnostics. */
21274 static bool
21277 location_t location,
21279 {
21280 /* If there are the same number of template classes and parameter
21281 lists, that's OK. */
21284 /* If there are more, but only one more, then we are referring to a
21285 member template. That's OK too. */
21288 /* If there are more template classes than parameter lists, we have
21289 something like:
21291 template <class T> void S<T>::R<T>::f (); */
21293 {
21303 else
21306 }
21307 /* Otherwise, there are too many template parameter lists. We have
21308 something like:
21310 template <class T> template <class U> void S::f(); */
21313 }
21315 /* Parse an optional `::' token indicating that the following name is
21316 from the global namespace. If so, PARSER->SCOPE is set to the
21317 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
21318 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
21319 Returns the new value of PARSER->SCOPE, if the `::' token is
21320 present, and NULL_TREE otherwise. */
21322 static tree
21324 {
21327 /* Peek at the next token. */
21329 /* If we're looking at a `::' token then we're starting from the
21330 global namespace, not our current location. */
21332 {
21333 /* Consume the `::' token. */
21335 /* Set the SCOPE so that we know where to start the lookup. */
21341 }
21343 {
21347 }
21350 }
21352 /* Returns TRUE if the upcoming token sequence is the start of a
21353 constructor declarator. If FRIEND_P is true, the declarator is
21354 preceded by the `friend' specifier. */
21356 static bool
21358 {
21360 tree nested_name_specifier;
21363 /* The common case is that this is not a constructor declarator, so
21364 try to avoid doing lots of work if at all possible. It's not
21365 valid declare a constructor at function scope. */
21368 /* And only certain tokens can begin a constructor declarator. */
21376 /* Parse tentatively; we are going to roll back all of the tokens
21377 consumed here. */
21379 /* Assume that we are looking at a constructor declarator. */
21382 /* Look for the optional `::' operator. */
21385 /* Look for the nested-name-specifier. */
21386 nested_name_specifier
21392 /* Outside of a class-specifier, there must be a
21393 nested-name-specifier. */
21401 /* If we have a class scope, this is easy; DR 147 says that S::S always
21402 names the constructor, and no other qualified name could. */
21405 {
21415 }
21416 /* If we still think that this might be a constructor-declarator,
21417 look for a class-name. */
21419 {
21420 /* If we have:
21422 template <typename T> struct S {
21423 S();
21424 };
21426 we must recognize that the nested `S' names a class. */
21427 tree type_decl;
21431 none_type,
21435 /* If there was no class-name, then this is not a constructor. */
21438 /* If we're still considering a constructor, we have to see a `(',
21439 to begin the parameter-declaration-clause, followed by either a
21440 `)', an `...', or a decl-specifier. We need to check for a
21441 type-specifier to avoid being fooled into thinking that:
21443 S (f) (int);
21445 is a constructor. (It is actually a function named `f' that
21446 takes one parameter (of type `int') and returns a value of type
21447 `S'. */
21455 /* A parameter declaration begins with a decl-specifier,
21456 which is either the "attribute" keyword, a storage class
21457 specifier, or (usually) a type-specifier. */
21459 {
21460 tree type;
21464 /* Names appearing in the type-specifier should be looked up
21465 in the scope of the class. */
21468 else
21469 {
21472 {
21476 {
21479 }
21480 }
21482 }
21484 /* Inside the constructor parameter list, surrounding
21485 template-parameter-lists do not apply. */
21486 saved_num_template_parameter_lists
21490 /* Look for the type-specifier. */
21492 CP_PARSER_FLAGS_NONE,
21498 parser->num_template_parameter_lists
21501 /* Leave the scope of the class. */
21506 }
21507 }
21509 /* We did not really want to consume any tokens. */
21513 }
21515 /* Parse the definition of the function given by the DECL_SPECIFIERS,
21516 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
21517 they must be performed once we are in the scope of the function.
21519 Returns the function defined. */
21521 static tree
21522 cp_parser_function_definition_from_specifiers_and_declarator
21525 tree attributes,
21527 {
21528 tree fn;
21531 /* Begin the function-definition. */
21534 /* The things we're about to see are not directly qualified by any
21535 template headers we've seen thus far. */
21538 /* If there were names looked up in the decl-specifier-seq that we
21539 did not check, check them now. We must wait until we are in the
21540 scope of the function to perform the checks, since the function
21541 might be a friend. */
21545 {
21546 /* Skip the entire function. */
21549 }
21551 {
21552 /* Seen already, skip it. An error message has already been output. */
21556 /* If this is a function from a class, pop the nested class. */
21559 }
21560 else
21561 {
21562 timevar_id_t tv;
21565 else
21571 }
21574 }
21576 /* Parse the part of a function-definition that follows the
21577 declarator. INLINE_P is TRUE iff this function is an inline
21578 function defined within a class-specifier.
21580 Returns the function defined. */
21582 static tree
21585 {
21586 tree fn;
21595 /* If the next token is `return', then the code may be trying to
21596 make use of the "named return value" extension that G++ used to
21597 support. */
21600 {
21601 /* Consume the `return' keyword. */
21603 /* Look for the identifier that indicates what value is to be
21604 returned. */
21606 /* Issue an error message. */
21609 /* Skip tokens until we reach the start of the function body. */
21611 {
21618 }
21619 }
21620 /* The `extern' in `extern "C" void f () { ... }' does not apply to
21621 anything declared inside `f'. */
21622 saved_in_unbraced_linkage_specification_p
21625 /* Inside the function, surrounding template-parameter-lists do not
21626 apply. */
21627 saved_num_template_parameter_lists
21633 /* If the next token is `try', `__transaction_atomic', or
21634 `__transaction_relaxed`, then we are looking at either function-try-block
21635 or function-transaction-block. Note that all of these include the
21636 function-body. */
21639 RID_TRANSACTION_ATOMIC);
21641 RID_TRANSACTION_RELAXED))
21643 RID_TRANSACTION_RELAXED);
21646 else
21647 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21652 /* Finish the function. */
21655 /* Generate code for it, if necessary. */
21657 /* Restore the saved values. */
21658 parser->in_unbraced_linkage_specification_p
21660 parser->num_template_parameter_lists
21665 }
21667 /* Parse a template-declaration, assuming that the `export' (and
21668 `extern') keywords, if present, has already been scanned. MEMBER_P
21669 is as for cp_parser_template_declaration. */
21671 static void
21673 {
21676 tree parameter_list;
21681 /* Look for the `template' keyword. */
21686 /* And the `<'. */
21690 {
21691 /* 14.5.2.2 [temp.mem]
21693 A local class shall not have member templates. */
21698 }
21699 /* [temp]
21701 A template ... shall not have C linkage. */
21703 {
21705 /* Give it C++ linkage to avoid confusing other parts of the
21706 front end. */
21709 }
21710 else
21713 /* We cannot perform access checks on the template parameter
21714 declarations until we know what is being declared, just as we
21715 cannot check the decl-specifier list. */
21718 /* If the next token is `>', then we have an invalid
21719 specialization. Rather than complain about an invalid template
21720 parameter, issue an error message here. */
21722 {
21726 }
21727 else
21728 {
21729 /* Parse the template parameters. */
21731 }
21733 /* Get the deferred access checks from the parameter list. These
21734 will be checked once we know what is being declared, as for a
21735 member template the checks must be performed in the scope of the
21736 class containing the member. */
21739 /* Look for the `>'. */
21741 /* We just processed one more parameter list. */
21743 /* If the next token is `template', there are more template
21744 parameters. */
21746 RID_TEMPLATE))
21751 else
21752 {
21753 /* There are no access checks when parsing a template, as we do not
21754 know if a specialization will be a friend. */
21758 checks,
21759 member_p,
21764 /* If this is a member template declaration, let the front
21765 end know. */
21767 {
21772 }
21778 }
21779 /* We are done with the current parameter list. */
21784 /* Finish up. */
21787 /* Check the template arguments for a literal operator template. */
21791 {
21795 else
21796 {
21800 else
21801 {
21807 }
21808 }
21812 decl);
21813 }
21814 /* Register member declarations. */
21817 /* For the erroneous case of a template with C linkage, we pushed an
21818 implicit C++ linkage scope; exit that scope now. */
21821 /* If DECL is a function template, we must return to parse it later.
21822 (Even though there is no definition, there might be default
21823 arguments that need handling.) */
21828 }
21830 /* Perform the deferred access checks from a template-parameter-list.
21831 CHECKS is a TREE_LIST of access checks, as returned by
21832 get_deferred_access_checks. */
21834 static void
21836 {
21840 }
21842 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
21843 `function-definition' sequence that follows a template header.
21844 If MEMBER_P is true, this declaration appears in a class scope.
21846 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
21847 *FRIEND_P is set to TRUE iff the declaration is a friend. */
21849 static tree
21855 {
21858 cp_decl_specifier_seq decl_specifiers;
21862 /* This function is only used when processing a template
21863 declaration. */
21867 /* Defer access checks until we know what is being declared. */
21870 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
21871 alternative. */
21874 CP_PARSER_FLAGS_OPTIONAL,
21880 /* There are no template typedefs. */
21882 {
21886 }
21888 /* Gather up the access checks that occurred the
21889 decl-specifier-seq. */
21892 /* Check for the declaration of a template class. */
21894 {
21896 {
21899 /* In this case:
21901 struct C {
21902 friend template <typename T> struct A<T>::B;
21903 };
21905 A<T>::B will be represented by a TYPENAME_TYPE, and
21906 therefore not recognized by shadow_tag. */
21908 && !decl
21915 else
21918 /* Perform access checks for template parameters. */
21920 }
21921 }
21923 /* Complain about missing 'typename' or other invalid type names. */
21926 {
21927 /* cp_parser_parse_and_diagnose_invalid_type_name calls
21928 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
21929 the rest of this declaration. */
21932 }
21934 /* If it's not a template class, try for a template function. If
21935 the next token is a `;', then this declaration does not declare
21936 anything. But, if there were errors in the decl-specifiers, then
21937 the error might well have come from an attempted class-specifier.
21938 In that case, there's no need to warn about a missing declarator. */
21942 {
21945 checks,
21947 member_p,
21948 declares_class_or_enum,
21950 NULL);
21952 /* 7.1.1-1 [dcl.stc]
21954 A storage-class-specifier shall not be specified in an explicit
21955 specialization... */
21957 && explicit_specialization_p
21959 {
21963 }
21967 }
21969 /* Look for a trailing `;' after the declaration. */
21975 out:
21978 /* Clear any current qualification; whatever comes next is the start
21979 of something new. */
21985 }
21987 /* Parse a cast-expression that is not the operand of a unary "&". */
21989 static tree
21991 {
21994 }
21996 /* Parse a functional cast to TYPE. Returns an expression
21997 representing the cast. */
21999 static tree
22001 {
22003 tree expression_list;
22004 tree cast;
22008 {
22015 tf_warning_or_error);
22016 }
22025 else
22026 {
22029 }
22032 tf_warning_or_error);
22033 /* [expr.const]/1: In an integral constant expression "only type
22034 conversions to integral or enumeration type can be used". */
22040 NIC_CONSTRUCTOR))
22043 }
22045 /* Save the tokens that make up the body of a member function defined
22046 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
22047 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
22048 specifiers applied to the declaration. Returns the FUNCTION_DECL
22049 for the member function. */
22051 static tree
22055 tree attributes)
22056 {
22059 tree fn;
22061 /* Create the FUNCTION_DECL. */
22063 /* If something went badly wrong, bail out now. */
22065 {
22066 /* If there's a function-body, skip it. */
22071 }
22073 /* Remember it, if there default args to post process. */
22076 /* Save away the tokens that make up the body of the
22077 function. */
22079 /* We can have braced-init-list mem-initializers before the fn body. */
22081 {
22085 {
22086 /* cache_group will stop after an un-nested { } pair, too. */
22090 /* variadic mem-inits have ... after the ')'. */
22093 }
22094 }
22096 /* Handle function try blocks. */
22101 /* Save away the inline definition; we will process it when the
22102 class is complete. */
22106 /* We need to know that this was defined in the class, so that
22107 friend templates are handled correctly. */
22110 /* Add FN to the queue of functions to be parsed later. */
22114 }
22116 /* Save the tokens that make up the in-class initializer for a non-static
22117 data member. Returns a DEFAULT_ARG. */
22119 static tree
22121 {
22123 }
22125 /* Parse a template-argument-list, as well as the trailing ">" (but
22126 not the opening "<"). See cp_parser_template_argument_list for the
22127 return value. */
22129 static tree
22131 {
22132 tree arguments;
22133 tree saved_scope;
22134 tree saved_qualifying_scope;
22135 tree saved_object_scope;
22140 /* [temp.names]
22142 When parsing a template-id, the first non-nested `>' is taken as
22143 the end of the template-argument-list rather than a greater-than
22144 operator. */
22145 saved_greater_than_is_operator_p
22148 /* Parsing the argument list may modify SCOPE, so we save it
22149 here. */
22153 /* We need to evaluate the template arguments, even though this
22154 template-id may be nested within a "sizeof". */
22159 /* Parse the template-argument-list itself. */
22163 else
22165 /* Look for the `>' that ends the template-argument-list. If we find
22166 a '>>' instead, it's probably just a typo. */
22168 {
22170 {
22171 /* In C++0x, a `>>' in a template argument list or cast
22172 expression is considered to be two separate `>'
22173 tokens. So, change the current token to a `>', but don't
22174 consume it: it will be consumed later when the outer
22175 template argument list (or cast expression) is parsed.
22176 Note that this replacement of `>' for `>>' is necessary
22177 even if we are parsing tentatively: in the tentative
22178 case, after calling
22179 cp_parser_enclosed_template_argument_list we will always
22180 throw away all of the template arguments and the first
22181 closing `>', either because the template argument list
22182 was erroneous or because we are replacing those tokens
22183 with a CPP_TEMPLATE_ID token. The second `>' (which will
22184 not have been thrown away) is needed either to close an
22185 outer template argument list or to complete a new-style
22186 cast. */
22189 }
22191 {
22192 /* If we're in a nested template argument list, the '>>' has
22193 to be a typo for '> >'. We emit the error message, but we
22194 continue parsing and we push a '>' as next token, so that
22195 the argument list will be parsed correctly. Note that the
22196 global source location is still on the token before the
22197 '>>', so we need to say explicitly where we want it. */
22203 }
22204 else
22205 {
22206 /* If this is not a nested template argument list, the '>>'
22207 is a typo for '>'. Emit an error message and continue.
22208 Same deal about the token location, but here we can get it
22209 right by consuming the '>>' before issuing the diagnostic. */
22212 "spurious %<>>%>, use %<>%> to terminate "
22214 }
22215 }
22216 else
22218 /* The `>' token might be a greater-than operator again now. */
22219 parser->greater_than_is_operator_p
22221 /* Restore the SAVED_SCOPE. */
22229 }
22231 /* MEMBER_FUNCTION is a member function, or a friend. If default
22232 arguments, or the body of the function have not yet been parsed,
22233 parse them now. */
22235 static void
22237 {
22239 /* If this member is a template, get the underlying
22240 FUNCTION_DECL. */
22244 /* There should not be any class definitions in progress at this
22245 point; the bodies of members are only parsed outside of all class
22246 definitions. */
22248 /* While we're parsing the member functions we might encounter more
22249 classes. We want to handle them right away, but we don't want
22250 them getting mixed up with functions that are currently in the
22251 queue. */
22254 /* Make sure that any template parameters are in scope. */
22257 /* If the body of the function has not yet been parsed, parse it
22258 now. */
22260 {
22261 tree function_scope;
22264 /* The function is no longer pending; we are processing it. */
22269 /* If this is a local class, enter the scope of the containing
22270 function. */
22275 /* Push the body of the function onto the lexer stack. */
22278 /* Let the front end know that we going to be defining this
22279 function. */
22283 /* Don't do access checking if it is a templated function. */
22287 /* Now, parse the body of the function. */
22294 /* Leave the scope of the containing function. */
22298 }
22300 /* Remove any template parameters from the symbol table. */
22303 /* Restore the queue. */
22306 }
22308 /* If DECL contains any default args, remember it on the unparsed
22309 functions queue. */
22311 static void
22313 {
22314 tree probe;
22317 probe;
22320 {
22325 }
22326 }
22328 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
22329 which is either a FIELD_DECL or PARM_DECL. Parse it and return
22330 the result. For a PARM_DECL, PARMTYPE is the corresponding type
22331 from the parameter-type-list. */
22333 static tree
22336 {
22338 tree parsed_arg;
22344 /* Push the saved tokens for the default argument onto the parser's
22345 lexer stack. */
22351 /* Parse the default argument. */
22362 {
22363 /* In a non-template class, check conversions now. In a template,
22364 we'll wait and instantiate these as needed. */
22367 else
22368 {
22374 }
22375 }
22377 /* If the token stream has not been completely used up, then
22378 there was extra junk after the end of the default
22379 argument. */
22381 {
22384 else
22386 }
22388 /* Revert to the main lexer. */
22392 }
22394 /* FIELD is a non-static data member with an initializer which we saved for
22395 later; parse it now. */
22397 static void
22399 {
22400 tree def;
22405 NULL_TREE);
22409 }
22411 /* FN is a FUNCTION_DECL which may contains a parameter with an
22412 unparsed DEFAULT_ARG. Parse the default args now. This function
22413 assumes that the current scope is the scope in which the default
22414 argument should be processed. */
22416 static void
22418 {
22422 /* While we're parsing the default args, we might (due to the
22423 statement expression extension) encounter more classes. We want
22424 to handle them right away, but we don't want them getting mixed
22425 up with default args that are currently in the queue. */
22428 /* Local variable names (and the `this' keyword) may not appear
22429 in a default argument. */
22440 {
22442 tree parsed_arg;
22444 tree copy;
22451 /* This can happen for a friend declaration for a function
22452 already declared with default arguments. */
22455 parsed_arg
22457 default_arg,
22460 {
22462 }
22466 /* Update any instantiations we've already created. */
22470 }
22474 /* Make sure no default arg is missing. */
22477 /* Restore the state of local_variables_forbidden_p. */
22480 /* Restore the queue. */
22482 }
22484 /* Parse the operand of `sizeof' (or a similar operator). Returns
22485 either a TYPE or an expression, depending on the form of the
22486 input. The KEYWORD indicates which kind of expression we have
22487 encountered. */
22489 static tree
22491 {
22499 /* Types cannot be defined in a `sizeof' expression. Save away the
22500 old message. */
22502 /* And create the new one. */
22508 /* The restrictions on constant-expressions do not apply inside
22509 sizeof expressions. */
22510 saved_integral_constant_expression_p
22512 saved_non_integral_constant_expression_p
22516 /* If it's a `...', then we are computing the length of a parameter
22517 pack. */
22520 {
22521 /* Consume the `...'. */
22525 /* Note that this is an expansion. */
22527 }
22529 /* Do not actually evaluate the expression. */
22532 /* If it's a `(', then we might be looking at the type-id
22533 construction. */
22535 {
22536 tree type;
22539 /* We can't be sure yet whether we're looking at a type-id or an
22540 expression. */
22542 /* Consume the `('. */
22544 /* Parse the type-id. */
22549 /* Now, look for the trailing `)'. */
22551 /* If all went well, then we're done. */
22553 {
22554 cp_decl_specifier_seq decl_specs;
22556 /* Build a trivial decl-specifier-seq. */
22560 /* Call grokdeclarator to figure out what type this is. */
22563 TYPENAME,
22566 }
22567 }
22572 /* If the type-id production did not work out, then we must be
22573 looking at the unary-expression production. */
22579 /* Build a pack expansion. */
22582 /* Go back to evaluating expressions. */
22586 /* Free the message we created. */
22588 /* And restore the old one. */
22590 parser->integral_constant_expression_p
22592 parser->non_integral_constant_expression_p
22596 }
22598 /* If the current declaration has no declarator, return true. */
22600 static bool
22602 {
22603 /* If the next token is a `;' or a `,' then there is no
22604 declarator. */
22607 }
22609 /* Update the DECL_SPECS to reflect the storage class indicated by
22610 KEYWORD. */
22612 static void
22617 {
22618 cp_storage_class storage_class;
22621 {
22625 }
22627 {
22630 }
22635 {
22638 }
22641 {
22659 }
22663 /* A storage class specifier cannot be applied alongside a typedef
22664 specifier. If there is a typedef specifier present then set
22665 conflicting_specifiers_p which will trigger an error later
22666 on in grokdeclarator. */
22669 }
22671 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
22672 is true, the type is a class or enum definition. */
22674 static void
22676 tree type_spec,
22679 {
22682 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
22683 (with, for example, in "typedef int wchar_t;") we remember that
22684 this is what happened. In system headers, we ignore these
22685 declarations so that G++ can work with system headers that are not
22686 C++-safe. */
22688 && !type_definition_p
22698 {
22701 ds_redefined_builtin_type_spec,
22702 token);
22704 {
22708 }
22709 }
22712 else
22713 {
22718 }
22719 }
22721 /* True iff TOKEN is the GNU keyword __thread. */
22723 static bool
22725 {
22728 }
22730 /* Set the location for a declarator specifier and check if it is
22731 duplicated.
22733 DECL_SPECS is the sequence of declarator specifiers onto which to
22734 set the location.
22736 DS is the single declarator specifier to set which location is to
22737 be set onto the existing sequence of declarators.
22739 LOCATION is the location for the declarator specifier to
22740 consider. */
22742 static void
22745 {
22754 {
22758 }
22759 else
22760 {
22762 {
22766 else
22767 {
22770 OPT_Wlong_long,
22772 }
22773 }
22775 {
22780 else
22782 }
22783 else
22784 {
22800 "__complex"
22801 };
22804 }
22805 }
22806 }
22808 /* Return true iff the declarator specifier DS is present in the
22809 sequence of declarator specifiers DECL_SPECS. */
22811 bool
22813 cp_decl_spec ds)
22814 {
22821 }
22823 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
22824 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
22826 static bool
22828 {
22830 }
22832 /* Issue an error message indicating that TOKEN_DESC was expected.
22833 If KEYWORD is true, it indicated this function is called by
22834 cp_parser_require_keword and the required token can only be
22835 a indicated keyword. */
22837 static void
22839 required_token token_desc,
22841 {
22843 {
22912 }
22914 {
22916 {
22995 }
22996 }
22997 else
22999 }
23003 /* If the next token is of the indicated TYPE, consume it. Otherwise,
23004 issue an error message indicating that TOKEN_DESC was expected.
23006 Returns the token consumed, if the token had the appropriate type.
23007 Otherwise, returns NULL. */
23012 required_token token_desc)
23013 {
23016 else
23017 {
23018 /* Output the MESSAGE -- unless we're parsing tentatively. */
23022 }
23023 }
23025 /* An error message is produced if the next token is not '>'.
23026 All further tokens are skipped until the desired token is
23027 found or '{', '}', ';' or an unbalanced ')' or ']'. */
23029 static void
23031 {
23032 /* Current level of '< ... >'. */
23034 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
23037 /* Are we ready, yet? If not, issue error message. */
23041 /* Skip tokens until the desired token is found. */
23043 {
23044 /* Peek at the next token. */
23046 {
23054 /* C++0x views the `>>' operator as two `>' tokens, but
23055 C++98 does not. */
23058 {
23059 /* We've hit a `>>' where the first `>' closes the
23060 template argument list, and the second `>' is
23061 spurious. Just consume the `>>' and stop; we've
23062 already produced at least one error. */
23065 }
23066 /* Fall through for C++0x, so we handle the second `>' in
23067 the `>>'. */
23071 {
23072 /* We've reached the token we want, consume it and stop. */
23075 }
23094 /* The '>' was probably forgotten, don't look further. */
23099 }
23101 /* Consume this token. */
23103 }
23104 }
23106 /* If the next token is the indicated keyword, consume it. Otherwise,
23107 issue an error message indicating that TOKEN_DESC was expected.
23109 Returns the token consumed, if the token had the appropriate type.
23110 Otherwise, returns NULL. */
23115 required_token token_desc)
23116 {
23120 {
23123 }
23126 }
23128 /* Returns TRUE iff TOKEN is a token that can begin the body of a
23129 function-definition. */
23131 static bool
23133 {
23136 /* A ctor-initializer begins with a `:'. */
23138 /* A function-try-block begins with `try'. */
23140 /* A function-transaction-block begins with `__transaction_atomic'
23141 or `__transaction_relaxed'. */
23144 /* The named return value extension begins with `return'. */
23146 }
23148 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
23149 definition. */
23151 static bool
23153 {
23158 }
23160 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
23161 C++0x) ending a template-argument. */
23163 static bool
23165 {
23173 }
23175 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
23176 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
23178 static bool
23181 {
23187 /* Check for the sequence `<::' in the original code. It would be lexed as
23188 `[:', where `[' is a digraph, and there is no whitespace before
23189 `:'. */
23191 {
23196 }
23198 }
23200 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
23201 or none_type otherwise. */
23203 static enum tag_types
23205 {
23207 {
23217 }
23218 }
23220 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
23222 static void
23224 {
23228 {
23232 type);
23235 }
23236 }
23238 /* Issue an error message if DECL is redeclared with different
23239 access than its original declaration [class.access.spec/3].
23240 This applies to nested classes and nested class templates.
23241 [class.mem/1]. */
23243 static void
23245 {
23254 }
23256 /* Look for the `template' keyword, as a syntactic disambiguator.
23257 Return TRUE iff it is present, in which case it will be
23258 consumed. */
23260 static bool
23262 {
23264 {
23265 /* In C++98 the `template' keyword can only be used within templates;
23266 outside templates the parser can always figure out what is a
23267 template and what is not. In C++11, per the resolution of DR 468,
23268 `template' is allowed in cases where it is not strictly necessary. */
23271 {
23274 "in C++98 %<template%> (as a disambiguator) is only "
23276 /* If this part of the token stream is rescanned, the same
23277 error message would be generated. So, we purge the token
23278 from the stream. */
23281 }
23282 else
23283 {
23284 /* Consume the `template' keyword. */
23287 }
23288 }
23290 }
23292 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
23293 set PARSER->SCOPE, and perform other related actions. */
23295 static void
23297 {
23303 /* Get the stored value. */
23305 /* Perform any access checks that were deferred. */
23308 {
23313 }
23314 /* Set the scope from the stored value. */
23318 }
23320 /* Consume tokens up through a non-nested END token. Returns TRUE if we
23321 encounter the end of a block before what we were looking for. */
23323 static bool
23327 {
23329 {
23332 /* Abort a parenthesized expression if we encounter a semicolon. */
23336 /* If we've reached the end of the file, stop. */
23342 /* We've hit the end of an enclosing block, so there's been some
23343 kind of syntax error. */
23346 /* Consume the token. */
23348 /* See if it starts a new group. */
23350 {
23352 /* In theory this should probably check end == '}', but
23353 cp_parser_save_member_function_body needs it to exit
23354 after either '}' or ')' when called with ')'. */
23357 }
23359 {
23363 }
23368 }
23369 }
23371 /* Like above, for caching a default argument or NSDMI. Both of these are
23372 terminated by a non-nested comma, but it can be unclear whether or not a
23373 comma is nested in a template argument list unless we do more parsing.
23374 In order to handle this ambiguity, when we encounter a ',' after a '<'
23375 we try to parse what follows as a parameter-declaration-list (in the
23376 case of a default argument) or a member-declarator (in the case of an
23377 NSDMI). If that succeeds, then we stop caching. */
23379 static tree
23381 {
23386 tree default_argument;
23388 /* Add tokens until we have processed the entire default
23389 argument. We add the range [first_token, token). */
23392 {
23393 /* For list-initialization, this is straightforward. */
23396 }
23398 {
23401 /* Peek at the next token. */
23403 /* What we do depends on what token we have. */
23405 {
23406 /* In valid code, a default argument must be
23407 immediately followed by a `,' `)', or `...'. */
23410 {
23411 /* If we've seen a '<', we might be in a
23412 template-argument-list. Until Core issue 325 is
23413 resolved, we don't know how this situation ought
23414 to be handled, so try to DTRT. We check whether
23415 what comes after the comma is a valid parameter
23416 declaration list. If it is, then the comma ends
23417 the default argument; otherwise the default
23418 argument continues. */
23420 tree t;
23422 /* Set ITALP so cp_parser_parameter_declaration_list
23423 doesn't decide to commit to this parse. */
23431 {
23437 }
23438 else
23439 {
23445 }
23452 }
23455 /* If we run into a non-nested `;', `}', or `]',
23456 then the code is invalid -- but the default
23457 argument is certainly over. */
23463 /* Update DEPTH, if necessary. */
23478 /* This might be the comparison operator, or it might
23479 start a template argument list. */
23486 /* Fall through for C++0x, which treats the `>>'
23487 operator like two `>' tokens in certain
23488 cases. */
23492 {
23493 /* This might be an operator, or it might close a
23494 template argument list. But if a previous '<'
23495 started a template argument list, this will have
23496 closed it, so we can't be in one anymore. */
23500 }
23503 /* If we run out of tokens, issue an error message. */
23512 /* In these cases, we should look for template-ids.
23513 For example, if the default argument is
23514 `X<int, double>()', we need to do name lookup to
23515 figure out whether or not `X' is a template; if
23516 so, the `,' does not end the default argument.
23518 That is not yet done. */
23523 }
23525 /* If we've reached the end, stop. */
23529 /* Add the token to the token block. */
23531 }
23533 /* Create a DEFAULT_ARG to represent the unparsed default
23534 argument. */
23541 }
23543 /* Begin parsing tentatively. We always save tokens while parsing
23544 tentatively so that if the tentative parsing fails we can restore the
23545 tokens. */
23547 static void
23549 {
23550 /* Enter a new parsing context. */
23552 /* Begin saving tokens. */
23554 /* In order to avoid repetitive access control error messages,
23555 access checks are queued up until we are no longer parsing
23556 tentatively. */
23558 }
23560 /* Commit to the currently active tentative parse. */
23562 static void
23564 {
23568 /* Mark all of the levels as committed. */
23571 {
23578 }
23579 }
23581 /* Abort the currently active tentative parse. All consumed tokens
23582 will be rolled back, and no diagnostics will be issued. */
23584 static void
23586 {
23590 /* Now, pretend that we want to see if the construct was
23591 successfully parsed. */
23593 }
23595 /* Stop parsing tentatively. If a parse error has occurred, restore the
23596 token stream. Otherwise, commit to the tokens we have consumed.
23597 Returns true if no error occurred; false otherwise. */
23599 static bool
23601 {
23605 /* Remember whether or not an error occurred, since we are about to
23606 destroy that information. */
23608 /* Remove the topmost context from the stack. */
23611 /* If no parse errors occurred, commit to the tentative parse. */
23613 {
23614 /* Commit to the tokens read tentatively, unless that was
23615 already done. */
23620 }
23621 /* Otherwise, if errors occurred, roll back our state so that things
23622 are just as they were before we began the tentative parse. */
23623 else
23624 {
23627 }
23628 /* Add the context to the front of the free list. */
23633 }
23635 /* Returns true if we are parsing tentatively and are not committed to
23636 this tentative parse. */
23638 static bool
23640 {
23643 }
23645 /* Returns nonzero iff an error has occurred during the most recent
23646 tentative parse. */
23648 static bool
23650 {
23653 }
23655 /* Returns nonzero if GNU extensions are allowed. */
23657 static bool
23659 {
23661 }
23662 \f
23663 /* Objective-C++ Productions */
23666 /* Parse an Objective-C expression, which feeds into a primary-expression
23667 above.
23669 objc-expression:
23670 objc-message-expression
23671 objc-string-literal
23672 objc-encode-expression
23673 objc-protocol-expression
23674 objc-selector-expression
23676 Returns a tree representation of the expression. */
23678 static tree
23680 {
23681 /* Try to figure out what kind of declaration is present. */
23685 {
23695 {
23707 }
23713 }
23716 }
23718 /* Parse an Objective-C message expression.
23720 objc-message-expression:
23721 [ objc-message-receiver objc-message-args ]
23723 Returns a representation of an Objective-C message. */
23725 static tree
23727 {
23736 }
23738 /* Parse an objc-message-receiver.
23740 objc-message-receiver:
23741 expression
23742 simple-type-specifier
23744 Returns a representation of the type or expression. */
23746 static tree
23748 {
23749 tree rcv;
23751 /* An Objective-C message receiver may be either (1) a type
23752 or (2) an expression. */
23761 CP_PARSER_FLAGS_NONE);
23764 }
23766 /* Parse the arguments and selectors comprising an Objective-C message.
23768 objc-message-args:
23769 objc-selector
23770 objc-selector-args
23771 objc-selector-args , objc-comma-args
23773 objc-selector-args:
23774 objc-selector [opt] : assignment-expression
23775 objc-selector-args objc-selector [opt] : assignment-expression
23777 objc-comma-args:
23778 assignment-expression
23779 objc-comma-args , assignment-expression
23781 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
23782 selector arguments and TREE_VALUE containing a list of comma
23783 arguments. */
23785 static tree
23787 {
23793 {
23799 /* Detect if we have a unary selector. */
23808 sel_args
23813 }
23815 /* Handle non-selector arguments, if any. */
23817 {
23818 tree arg;
23823 addl_args
23828 }
23831 {
23834 }
23837 }
23839 /* Parse an Objective-C encode expression.
23841 objc-encode-expression:
23842 @encode objc-typename
23844 Returns an encoded representation of the type argument. */
23846 static tree
23848 {
23849 tree type;
23859 {
23863 }
23865 /* This happens if we find @encode(T) (where T is a template
23866 typename or something dependent on a template typename) when
23867 parsing a template. In that case, we can't compile it
23868 immediately, but we rather create an AT_ENCODE_EXPR which will
23869 need to be instantiated when the template is used.
23870 */
23872 {
23876 }
23879 }
23881 /* Parse an Objective-C @defs expression. */
23883 static tree
23885 {
23886 tree name;
23894 }
23896 /* Parse an Objective-C protocol expression.
23898 objc-protocol-expression:
23899 @protocol ( identifier )
23901 Returns a representation of the protocol expression. */
23903 static tree
23905 {
23906 tree proto;
23914 }
23916 /* Parse an Objective-C selector expression.
23918 objc-selector-expression:
23919 @selector ( objc-method-signature )
23921 objc-method-signature:
23922 objc-selector
23923 objc-selector-seq
23925 objc-selector-seq:
23926 objc-selector :
23927 objc-selector-seq objc-selector :
23929 Returns a representation of the method selector. */
23931 static tree
23933 {
23945 {
23954 {
23955 /* Detect if we have a unary selector. */
23957 {
23960 }
23961 else
23962 {
23964 }
23965 }
23970 {
23971 sel_seq
23974 sel_seq
23977 }
23978 else
23979 sel_seq
23984 }
23986 finish_selector:
23990 }
23992 /* Parse a list of identifiers.
23994 objc-identifier-list:
23995 identifier
23996 objc-identifier-list , identifier
23998 Returns a TREE_LIST of identifier nodes. */
24000 static tree
24002 {
24003 tree identifier;
24004 tree list;
24015 {
24022 identifier));
24024 }
24027 }
24029 /* Parse an Objective-C alias declaration.
24031 objc-alias-declaration:
24032 @compatibility_alias identifier identifier ;
24034 This function registers the alias mapping with the Objective-C front end.
24035 It returns nothing. */
24037 static void
24039 {
24047 }
24049 /* Parse an Objective-C class forward-declaration.
24051 objc-class-declaration:
24052 @class objc-identifier-list ;
24054 The function registers the forward declarations with the Objective-C
24055 front end. It returns nothing. */
24057 static void
24059 {
24062 {
24063 tree id;
24073 else
24075 }
24077 }
24079 /* Parse a list of Objective-C protocol references.
24081 objc-protocol-refs-opt:
24082 objc-protocol-refs [opt]
24084 objc-protocol-refs:
24085 < objc-identifier-list >
24087 Returns a TREE_LIST of identifiers, if any. */
24089 static tree
24091 {
24095 {
24099 }
24102 }
24104 /* Parse a Objective-C visibility specification. */
24106 static void
24108 {
24112 {
24127 }
24129 /* Eat '@private'/'@protected'/'@public'. */
24131 }
24133 /* Parse an Objective-C method type. Return 'true' if it is a class
24134 (+) method, and 'false' if it is an instance (-) method. */
24138 {
24141 else
24143 }
24145 /* Parse an Objective-C protocol qualifier. */
24147 static tree
24149 {
24162 {
24167 }
24170 }
24172 /* Parse an Objective-C typename. */
24174 static tree
24176 {
24180 {
24186 /* An ObjC type name may consist of just protocol qualifiers, in which
24187 case the type shall default to 'id'. */
24189 {
24192 /* If the type could not be parsed, an error has already
24193 been produced. For error recovery, behave as if it had
24194 not been specified, which will use the default type
24195 'id'. */
24197 {
24199 /* We need to skip to the closing parenthesis as
24200 cp_parser_type_id() does not seem to do it for
24201 us. */
24206 }
24207 }
24211 }
24214 }
24216 /* Check to see if TYPE refers to an Objective-C selector name. */
24218 static bool
24220 {
24226 }
24228 /* Parse an Objective-C selector. */
24230 static tree
24232 {
24236 {
24239 }
24241 /* C++ operator names are allowed to appear in ObjC selectors. */
24243 {
24256 }
24257 }
24259 /* Parse an Objective-C params list. */
24261 static tree
24263 {
24269 {
24279 /* Detect if we have a unary selector. */
24282 {
24285 }
24289 {
24290 /* Something went quite wrong. There should be a colon
24291 here, but there is not. Stop parsing parameters. */
24293 }
24295 /* New ObjC allows attributes on parameters too. */
24300 params
24303 type_name,
24304 identifier,
24305 parm_attr));
24308 }
24311 {
24314 }
24316 /* We allow tail attributes for the method. */
24318 {
24326 }
24329 {
24332 }
24334 }
24336 /* Parse the non-keyword Objective-C params. */
24338 static tree
24341 {
24347 {
24349 tree parm;
24355 {
24360 }
24362 /* TODO: parse attributes for tail parameters. */
24371 }
24373 /* We allow tail attributes for the method. */
24375 {
24377 {
24382 }
24383 else
24384 /* We have an error, but parse the attributes, so that we can
24385 carry on. */
24391 }
24394 }
24396 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
24398 static void
24400 {
24403 /* If the next token is `extern' and the following token is a string
24404 literal, then we have a linkage specification. */
24406 && cp_parser_is_pure_string_literal
24409 /* Handle #pragma, if any. */
24412 /* Allow stray semicolons. */
24415 /* Mark methods as optional or required, when building protocols. */
24417 {
24420 }
24422 {
24425 }
24428 /* Other stray characters must generate errors. */
24430 {
24434 }
24435 /* Finally, try to parse a block-declaration, or a function-definition. */
24436 else
24438 }
24440 /* Parse a method signature. */
24442 static tree
24444 {
24460 }
24462 static bool
24464 {
24465 tree tattr;
24470 /* If the attributes are followed by a method introducer, this is not allowed.
24471 Dump the attributes and flag the situation. */
24476 /* Otherwise, the attributes introduce some interstitial code, possibly so
24477 rewind to allow that check. */
24480 }
24482 /* Parse an Objective-C method prototype list. */
24484 static void
24486 {
24490 {
24492 {
24497 else
24501 {
24505 }
24508 }
24514 OPT_Wattributes,
24516 else
24517 /* Allow for interspersed non-ObjC++ code. */
24521 }
24525 else
24529 }
24531 /* Parse an Objective-C method definition list. */
24533 static void
24535 {
24539 {
24540 tree meth;
24543 {
24549 else
24554 {
24558 }
24560 NULL_TREE);
24562 /* For historical reasons, we accept an optional semicolon. */
24569 {
24576 }
24577 }
24578 /* The following case will be removed once @synthesize is
24579 completely implemented. */
24590 else
24591 /* Allow for interspersed non-ObjC++ code. */
24595 }
24599 else
24603 }
24605 /* Parse Objective-C ivars. */
24607 static void
24609 {
24620 {
24621 cp_decl_specifier_seq declspecs;
24623 tree prefix_attributes;
24631 CP_PARSER_FLAGS_OPTIONAL,
24635 /* auto, register, static, extern, mutable. */
24637 {
24640 }
24642 /* thread_local. */
24644 {
24647 }
24649 /* typedef. */
24651 {
24654 }
24659 /* Keep going until we hit the `;' at the end of the
24660 declaration. */
24662 {
24667 /* Check for a (possibly unnamed) bitfield declaration. */
24675 {
24676 /* Get the name of the bitfield. */
24679 sfk_none);
24681 eat_colon:
24683 /* Get the width of the bitfield. */
24684 width
24687 NULL);
24688 }
24689 else
24690 {
24691 /* Parse the declarator. */
24692 declarator
24697 }
24699 /* Look for attributes that apply to the ivar. */
24701 /* Remember which attributes are prefix attributes and
24702 which are not. */
24704 /* Combine the attributes. */
24708 /* Create the bitfield declaration. */
24710 width,
24711 attributes);
24712 else
24717 /* Add the instance variable. */
24721 /* Reset PREFIX_ATTRIBUTES. */
24730 {
24733 }
24735 }
24739 }
24744 /* Do not consume the RID_AT_END, so it will be read again as terminating
24745 the @interface of @implementation. */
24749 /* For historical reasons, we accept an optional semicolon. */
24752 }
24754 /* Parse an Objective-C protocol declaration. */
24756 static void
24758 {
24764 {
24769 }
24771 /* See if we have a forward declaration or a definition. */
24774 /* Try a forward declaration first. */
24776 {
24778 {
24779 tree id;
24789 else
24791 }
24793 }
24795 /* Ok, we got a full-fledged definition (or at least should). */
24796 else
24797 {
24802 }
24803 }
24805 /* Parse an Objective-C superclass or category. */
24807 static void
24812 {
24818 {
24821 }
24823 {
24826 /* If there is no category name, and this is an @interface, we
24827 have a class extension. */
24829 {
24832 }
24833 else
24837 }
24838 }
24840 /* Parse an Objective-C class interface. */
24842 static void
24844 {
24851 {
24852 /* It's hard to recover because even if valid @interface stuff
24853 is to follow, we can't compile it (or validate it) if we
24854 don't even know which class it refers to. Let's assume this
24855 was a stray '@interface' token in the stream and skip it.
24856 */
24858 }
24863 /* We have either a class or a category on our hands. */
24866 else
24867 {
24869 /* Handle instance variable declarations, if any. */
24872 }
24875 }
24877 /* Parse an Objective-C class implementation. */
24879 static void
24881 {
24888 {
24889 /* It's hard to recover because even if valid @implementation
24890 stuff is to follow, we can't compile it (or validate it) if
24891 we don't even know which class it refers to. Let's assume
24892 this was a stray '@implementation' token in the stream and
24893 skip it.
24894 */
24896 }
24900 /* We have either a class or a category on our hands. */
24903 else
24904 {
24906 /* Handle instance variable declarations, if any. */
24909 }
24912 }
24914 /* Consume the @end token and finish off the implementation. */
24916 static void
24918 {
24921 }
24923 /* Parse an Objective-C declaration. */
24925 static void
24927 {
24928 /* Try to figure out what kind of declaration is present. */
24933 {
24949 }
24952 {
24975 }
24976 }
24978 /* Parse an Objective-C try-catch-finally statement.
24980 objc-try-catch-finally-stmt:
24981 @try compound-statement objc-catch-clause-seq [opt]
24982 objc-finally-clause [opt]
24984 objc-catch-clause-seq:
24985 objc-catch-clause objc-catch-clause-seq [opt]
24987 objc-catch-clause:
24988 @catch ( objc-exception-declaration ) compound-statement
24990 objc-finally-clause:
24991 @finally compound-statement
24993 objc-exception-declaration:
24994 parameter-declaration
24995 '...'
24997 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
24999 Returns NULL_TREE.
25001 PS: This function is identical to c_parser_objc_try_catch_finally_statement
25002 for C. Keep them in sync. */
25004 static tree
25006 {
25007 location_t location;
25008 tree stmt;
25013 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
25014 node, lest it get absorbed into the surrounding block. */
25020 {
25029 {
25030 /* We have "@catch (...)" (where the '...' are literally
25031 what is in the code). Skip the '...'.
25032 parameter_declaration is set to NULL_TREE, and
25033 objc_being_catch_clauses() knows that that means
25034 '...'. */
25037 }
25038 else
25039 {
25040 /* We have "@catch (NSException *exception)" or something
25041 like that. Parse the parameter declaration. */
25045 else
25050 }
25053 else
25054 {
25055 /* If there was no open parenthesis, we are recovering from
25056 an error, and we are trying to figure out what mistake
25057 the user has made. */
25059 /* If there is an immediate closing parenthesis, the user
25060 probably forgot the opening one (ie, they typed "@catch
25061 NSException *e)". Parse the closing parenthesis and keep
25062 going. */
25066 /* If these is no immediate closing parenthesis, the user
25067 probably doesn't know that parenthesis are required at
25068 all (ie, they typed "@catch NSException *e"). So, just
25069 forget about the closing parenthesis and keep going. */
25070 }
25074 }
25076 {
25079 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
25080 node, lest it get absorbed into the surrounding block. */
25084 }
25087 }
25089 /* Parse an Objective-C synchronized statement.
25091 objc-synchronized-stmt:
25092 @synchronized ( expression ) compound-statement
25094 Returns NULL_TREE. */
25096 static tree
25098 {
25099 location_t location;
25110 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
25111 node, lest it get absorbed into the surrounding block. */
25116 }
25118 /* Parse an Objective-C throw statement.
25120 objc-throw-stmt:
25121 @throw assignment-expression [opt] ;
25123 Returns a constructed '@throw' statement. */
25125 static tree
25127 {
25139 }
25141 /* Parse an Objective-C statement. */
25143 static tree
25145 {
25146 /* Try to figure out what kind of declaration is present. */
25150 {
25161 }
25164 }
25166 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
25167 look ahead to see if an objc keyword follows the attributes. This
25168 is to detect the use of prefix attributes on ObjC @interface and
25169 @protocol. */
25171 static bool
25173 {
25178 {
25181 }
25184 }
25186 /* This routine is a minimal replacement for
25187 c_parser_struct_declaration () used when parsing the list of
25188 types/names or ObjC++ properties. For example, when parsing the
25189 code
25191 @property (readonly) int a, b, c;
25193 this function is responsible for parsing "int a, int b, int c" and
25194 returning the declarations as CHAIN of DECLs.
25196 TODO: Share this code with cp_parser_objc_class_ivars. It's very
25197 similar parsing. */
25198 static tree
25200 {
25202 cp_decl_specifier_seq declspecs;
25204 tree prefix_attributes;
25207 CP_PARSER_FLAGS_NONE,
25214 /* auto, register, static, extern, mutable. */
25216 {
25219 }
25221 /* thread_local. */
25223 {
25226 }
25228 /* typedef. */
25230 {
25233 }
25238 /* Keep going until we hit the `;' at the end of the declaration. */
25240 {
25245 /* Parse the declarator. */
25249 /* Look for attributes that apply to the ivar. */
25251 /* Remember which attributes are prefix attributes and
25252 which are not. */
25254 /* Combine the attributes. */
25264 /* Reset PREFIX_ATTRIBUTES. */
25275 {
25278 }
25279 else
25281 }
25283 }
25285 /* Parse an Objective-C @property declaration. The syntax is:
25287 objc-property-declaration:
25288 '@property' objc-property-attributes[opt] struct-declaration ;
25290 objc-property-attributes:
25291 '(' objc-property-attribute-list ')'
25293 objc-property-attribute-list:
25294 objc-property-attribute
25295 objc-property-attribute-list, objc-property-attribute
25297 objc-property-attribute
25298 'getter' = identifier
25299 'setter' = identifier
25300 'readonly'
25301 'readwrite'
25302 'assign'
25303 'retain'
25304 'copy'
25305 'nonatomic'
25307 For example:
25308 @property NSString *name;
25309 @property (readonly) id object;
25310 @property (retain, nonatomic, getter=getTheName) id name;
25311 @property int a, b, c;
25313 PS: This function is identical to
25314 c_parser_objc_at_property_declaration for C. Keep them in sync. */
25315 static void
25317 {
25318 /* The following variables hold the attributes of the properties as
25319 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
25320 seen. When we see an attribute, we set them to 'true' (if they
25321 are boolean properties) or to the identifier (if they have an
25322 argument, ie, for getter and setter). Note that here we only
25323 parse the list of attributes, check the syntax and accumulate the
25324 attributes that we find. objc_add_property_declaration() will
25325 then process the information. */
25335 /* 'properties' is the list of properties that we read. Usually a
25336 single one, but maybe more (eg, in "@property int a, b, c;" there
25337 are three). */
25338 tree properties;
25339 location_t loc;
25345 /* Parse the optional attribute list... */
25347 {
25348 /* Eat the '('. */
25352 {
25358 {
25361 }
25365 {
25376 {
25380 else
25385 }
25388 {
25392 }
25394 {
25396 {
25399 }
25400 else
25404 else
25406 }
25407 else
25408 {
25410 {
25413 }
25414 else
25416 }
25422 }
25429 else
25431 }
25433 /* FIXME: "@property (setter, assign);" will generate a spurious
25434 "error: expected ‘)’ before ‘,’ token". This is because
25435 cp_parser_require, unlike the C counterpart, will produce an
25436 error even if we are in error recovery. */
25438 {
25443 }
25444 }
25446 /* ... and the property declaration(s). */
25450 {
25452 /* If the next token is now a `;', consume it. */
25456 }
25460 else
25461 {
25462 /* Comma-separated properties are chained together in
25463 reverse order; add them one by one. */
25472 }
25475 }
25477 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
25479 objc-synthesize-declaration:
25480 @synthesize objc-synthesize-identifier-list ;
25482 objc-synthesize-identifier-list:
25483 objc-synthesize-identifier
25484 objc-synthesize-identifier-list, objc-synthesize-identifier
25486 objc-synthesize-identifier
25487 identifier
25488 identifier = identifier
25490 For example:
25491 @synthesize MyProperty;
25492 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
25494 PS: This function is identical to c_parser_objc_at_synthesize_declaration
25495 for C. Keep them in sync.
25496 */
25497 static void
25499 {
25501 location_t loc;
25506 {
25510 {
25513 }
25515 {
25519 {
25522 }
25523 }
25524 else
25529 else
25531 }
25534 }
25536 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
25538 objc-dynamic-declaration:
25539 @dynamic identifier-list ;
25541 For example:
25542 @dynamic MyProperty;
25543 @dynamic MyProperty, AnotherProperty;
25545 PS: This function is identical to c_parser_objc_at_dynamic_declaration
25546 for C. Keep them in sync.
25547 */
25548 static void
25550 {
25552 location_t loc;
25557 {
25558 tree property;
25561 {
25564 }
25568 else
25570 }
25573 }
25575 \f
25576 /* OpenMP 2.5 parsing routines. */
25578 /* Returns name of the next clause.
25579 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
25580 the token is not consumed. Otherwise appropriate pragma_omp_clause is
25581 returned and the token is consumed. */
25583 static pragma_omp_clause
25585 {
25595 {
25600 {
25647 }
25648 }
25654 }
25656 /* Validate that a clause of the given type does not already exist. */
25658 static void
25661 {
25662 tree c;
25666 {
25669 }
25670 }
25672 /* OpenMP 2.5:
25673 variable-list:
25674 identifier
25675 variable-list , identifier
25677 In addition, we match a closing parenthesis. An opening parenthesis
25678 will have been consumed by the caller.
25680 If KIND is nonzero, create the appropriate node and install the decl
25681 in OMP_CLAUSE_DECL and add the node to the head of the list.
25683 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
25684 return the list created. */
25686 static tree
25688 tree list)
25689 {
25692 {
25709 {
25714 }
25715 else
25718 get_comma:
25722 }
25725 {
25728 /* Try to resync to an unnested comma. Copied from
25729 cp_parser_parenthesized_expression_list. */
25730 skip_comma:
25737 }
25740 }
25742 /* Similarly, but expect leading and trailing parenthesis. This is a very
25743 common case for omp clauses. */
25745 static tree
25747 {
25751 }
25753 /* OpenMP 3.0:
25754 collapse ( constant-expression ) */
25756 static tree
25758 {
25760 location_t loc;
25761 HOST_WIDE_INT n;
25781 {
25784 }
25792 }
25794 /* OpenMP 2.5:
25795 default ( shared | none ) */
25797 static tree
25799 {
25801 tree c;
25806 {
25811 {
25826 }
25829 }
25830 else
25831 {
25832 invalid_kind:
25834 }
25850 }
25852 /* OpenMP 3.1:
25853 final ( expression ) */
25855 static tree
25857 {
25878 }
25880 /* OpenMP 2.5:
25881 if ( expression ) */
25883 static tree
25885 {
25906 }
25908 /* OpenMP 3.1:
25909 mergeable */
25911 static tree
25914 {
25915 tree c;
25918 location);
25923 }
25925 /* OpenMP 2.5:
25926 nowait */
25928 static tree
25931 {
25932 tree c;
25939 }
25941 /* OpenMP 2.5:
25942 num_threads ( expression ) */
25944 static tree
25946 location_t location)
25947 {
25969 }
25971 /* OpenMP 2.5:
25972 ordered */
25974 static tree
25977 {
25978 tree c;
25986 }
25988 /* OpenMP 2.5:
25989 reduction ( reduction-operator : variable-list )
25991 reduction-operator:
25992 One of: + * - & ^ | && ||
25994 OpenMP 3.1:
25996 reduction-operator:
25997 One of: + * - & ^ | && || min max */
25999 static tree
26001 {
26009 {
26035 {
26040 {
26043 }
26045 {
26048 }
26049 }
26050 /* FALLTHROUGH */
26054 resync_fail:
26059 }
26070 }
26072 /* OpenMP 2.5:
26073 schedule ( schedule-kind )
26074 schedule ( schedule-kind , expression )
26076 schedule-kind:
26077 static | dynamic | guided | runtime | auto */
26079 static tree
26081 {
26090 {
26095 {
26116 }
26117 }
26122 else
26127 {
26142 else
26147 }
26155 invalid_kind:
26157 resync_fail:
26162 }
26164 /* OpenMP 3.0:
26165 untied */
26167 static tree
26170 {
26171 tree c;
26178 }
26180 /* Parse all OpenMP clauses. The set clauses allowed by the directive
26181 is a bitmask in MASK. Return the list of clauses found; the result
26182 of clause default goes in *pdefault. */
26184 static tree
26187 {
26193 {
26194 pragma_omp_clause c_kind;
26206 {
26218 clauses);
26232 clauses);
26241 clauses);
26265 clauses);
26279 clauses);
26290 }
26293 {
26294 /* Remove the invalid clause(s) from the list to avoid
26295 confusing the rest of the compiler. */
26298 }
26299 }
26300 saw_error:
26303 }
26305 /* OpenMP 2.5:
26306 structured-block:
26307 statement
26309 In practice, we're also interested in adding the statement to an
26310 outer node. So it is convenient if we work around the fact that
26311 cp_parser_statement calls add_stmt. */
26313 static unsigned
26315 {
26318 /* Only move the values to IN_OMP_BLOCK if they weren't false.
26319 This preserves the "not within loop or switch" style error messages
26320 for nonsense cases like
26321 void foo() {
26322 #pragma omp single
26323 break;
26324 }
26325 */
26330 }
26332 static void
26334 {
26336 }
26338 static tree
26340 {
26348 }
26350 /* OpenMP 2.5:
26351 # pragma omp atomic new-line
26352 expression-stmt
26354 expression-stmt:
26355 x binop= expr | x++ | ++x | x-- | --x
26356 binop:
26357 +, *, -, /, &, ^, |, <<, >>
26359 where x is an lvalue expression with scalar type.
26361 OpenMP 3.1:
26362 # pragma omp atomic new-line
26363 update-stmt
26365 # pragma omp atomic read new-line
26366 read-stmt
26368 # pragma omp atomic write new-line
26369 write-stmt
26371 # pragma omp atomic update new-line
26372 update-stmt
26374 # pragma omp atomic capture new-line
26375 capture-stmt
26377 # pragma omp atomic capture new-line
26378 capture-block
26380 read-stmt:
26381 v = x
26382 write-stmt:
26383 x = expr
26384 update-stmt:
26385 expression-stmt | x = x binop expr
26386 capture-stmt:
26387 v = x binop= expr | v = x++ | v = ++x | v = x-- | v = --x
26388 capture-block:
26389 { v = x; update-stmt; } | { update-stmt; v = x; }
26391 where x and v are lvalue expressions with scalar type. */
26393 static void
26395 {
26402 {
26414 else
26418 }
26422 {
26433 else
26439 {
26440 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
26441 opcode. */
26446 }
26450 {
26453 }
26454 else
26455 {
26462 }
26465 }
26467 restart:
26472 {
26479 /* FALLTHROUGH */
26489 /* FALLTHROUGH */
26504 /* Undo effects of boolean_increment for post {in,de}crement. */
26506 /* FALLTHRU */
26510 {
26511 /* Undo effects of boolean_increment. */
26513 {
26514 /* This is pre or post increment. */
26519 && !structured_block
26523 }
26524 }
26525 /* FALLTHRU */
26528 {
26558 {
26568 {
26571 {
26579 }
26614 }
26625 }
26626 /* FALLTHROUGH */
26631 }
26638 }
26639 stmt_done:
26641 {
26654 }
26656 {
26659 }
26660 done:
26666 saw_error:
26669 {
26673 {
26677 }
26678 }
26679 }
26682 /* OpenMP 2.5:
26683 # pragma omp barrier new-line */
26685 static void
26687 {
26690 }
26692 /* OpenMP 2.5:
26693 # pragma omp critical [(name)] new-line
26694 structured-block */
26696 static tree
26698 {
26702 {
26714 }
26719 }
26721 /* OpenMP 2.5:
26722 # pragma omp flush flush-vars[opt] new-line
26724 flush-vars:
26725 ( variable-list ) */
26727 static void
26729 {
26735 }
26737 /* Helper function, to parse omp for increment expression. */
26739 static tree
26741 {
26746 {
26749 }
26752 {
26760 }
26762 /* If decl is an iterator, preserve LHS and RHS of the relational
26763 expr until finish_omp_for. */
26773 }
26775 /* Helper function, to parse omp for increment expression. */
26777 static tree
26779 {
26783 cp_id_kind idk;
26787 {
26795 }
26803 {
26808 }
26815 {
26819 }
26831 do
26832 {
26839 {
26841 {
26844 else
26846 tf_warning_or_error);
26847 }
26848 else
26851 }
26852 }
26856 {
26860 }
26861 else
26865 }
26867 /* Parse the restricted form of the for statement allowed by OpenMP. */
26869 static tree
26871 {
26875 location_t loc_first;
26894 {
26897 location_t loc;
26900 {
26903 }
26912 {
26913 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
26915 init-expr:
26916 var = lb
26917 integer-type var = lb
26918 random-access-iterator-type var = lb
26919 pointer-type var = lb
26920 */
26921 cp_decl_specifier_seq type_specifiers;
26923 /* First, try to parse as an initialized declaration. See
26924 cp_parser_condition, from whence the bulk of this is copied. */
26931 {
26932 /* If parsing a type specifier seq succeeded, then this
26933 MUST be a initialized declaration. */
26938 CP_PARSER_DECLARATOR_NAMED,
26948 else
26949 {
26959 {
26961 CPP_OPEN_PAREN))
26964 else
26965 /* Trigger an error. */
26970 }
26974 {
26982 {
26985 auto_node);
26990 }
26993 asm_specification,
26994 LOOKUP_ONLYCONVERTING);
26996 {
26999 }
27000 else
27003 }
27004 else
27005 {
27006 /* Consume '='. */
27010 non_class:
27013 else
27016 asm_specification,
27017 LOOKUP_ONLYCONVERTING);
27018 }
27022 }
27023 }
27024 else
27025 {
27026 cp_id_kind idk;
27027 /* If parsing a type specifier sequence failed, then
27028 this MUST be a simple expression. */
27033 && decl
27036 {
27037 tree rhs;
27044 rhs,
27045 tf_warning_or_error));
27047 }
27048 else
27049 {
27054 {
27058 }
27059 }
27060 }
27061 }
27064 {
27067 {
27073 }
27074 else
27076 }
27081 {
27086 {
27090 }
27093 {
27094 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
27095 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
27104 }
27105 else
27106 {
27111 }
27112 }
27115 {
27116 tree c;
27118 {
27127 decl);
27131 decl);
27132 }
27134 {
27139 {
27142 }
27143 }
27144 }
27153 {
27154 /* If decl is an iterator, preserve the operator on decl
27155 until finish_omp_for. */
27157 && ((processing_template_decl
27161 else
27165 }
27180 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
27181 in between the collapsed for loops to be still considered perfectly
27182 nested. Hopefully the final version clarifies this.
27183 For now handle (multiple) {'s and empty statements. */
27185 do
27186 {
27190 {
27192 bracecount++;
27193 }
27197 else
27198 {
27205 }
27206 }
27210 {
27213 }
27214 }
27216 /* Note that we saved the original contents of this flag when we entered
27217 the structured block, and so we don't need to re-save it here. */
27220 /* Note that the grammar doesn't call for a structured block here,
27221 though the loop as a whole is a structured block. */
27228 else
27233 {
27235 {
27237 nbraces--;
27238 }
27241 else
27242 {
27244 {
27247 }
27252 }
27253 }
27260 }
27262 /* OpenMP 2.5:
27263 #pragma omp for for-clause[optseq] new-line
27264 for-loop */
27266 #define OMP_FOR_CLAUSE_MASK \
27267 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27268 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27269 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
27270 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
27271 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
27272 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
27273 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT) \
27274 | (1u << PRAGMA_OMP_CLAUSE_COLLAPSE))
27276 static tree
27278 {
27294 }
27296 /* OpenMP 2.5:
27297 # pragma omp master new-line
27298 structured-block */
27300 static tree
27302 {
27306 }
27308 /* OpenMP 2.5:
27309 # pragma omp ordered new-line
27310 structured-block */
27312 static tree
27314 {
27318 }
27320 /* OpenMP 2.5:
27322 section-scope:
27323 { section-sequence }
27325 section-sequence:
27326 section-directive[opt] structured-block
27327 section-sequence section-directive structured-block */
27329 static tree
27331 {
27342 {
27349 {
27359 }
27365 }
27368 {
27376 {
27380 }
27382 {
27385 }
27390 }
27401 }
27403 /* OpenMP 2.5:
27404 # pragma omp sections sections-clause[optseq] newline
27405 sections-scope */
27407 #define OMP_SECTIONS_CLAUSE_MASK \
27408 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27409 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27410 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
27411 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
27412 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
27414 static tree
27416 {
27427 }
27429 /* OpenMP 2.5:
27430 # pragma parallel parallel-clause new-line
27431 # pragma parallel for parallel-for-clause new-line
27432 # pragma parallel sections parallel-sections-clause new-line */
27434 #define OMP_PARALLEL_CLAUSE_MASK \
27435 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
27436 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27437 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27438 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
27439 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
27440 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
27441 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
27442 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
27444 static tree
27446 {
27455 {
27461 }
27463 {
27467 {
27473 }
27474 }
27481 {
27501 }
27508 }
27510 /* OpenMP 2.5:
27511 # pragma omp single single-clause[optseq] new-line
27512 structured-block */
27514 #define OMP_SINGLE_CLAUSE_MASK \
27515 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27516 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27517 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
27518 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
27520 static tree
27522 {
27532 }
27534 /* OpenMP 3.0:
27535 # pragma omp task task-clause[optseq] new-line
27536 structured-block */
27538 #define OMP_TASK_CLAUSE_MASK \
27539 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
27540 | (1u << PRAGMA_OMP_CLAUSE_UNTIED) \
27541 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
27542 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
27543 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
27544 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
27545 | (1u << PRAGMA_OMP_CLAUSE_FINAL) \
27546 | (1u << PRAGMA_OMP_CLAUSE_MERGEABLE))
27548 static tree
27550 {
27561 }
27563 /* OpenMP 3.0:
27564 # pragma omp taskwait new-line */
27566 static void
27568 {
27571 }
27573 /* OpenMP 3.1:
27574 # pragma omp taskyield new-line */
27576 static void
27578 {
27581 }
27583 /* OpenMP 2.5:
27584 # pragma omp threadprivate (variable-list) */
27586 static void
27588 {
27589 tree vars;
27595 }
27597 /* Main entry point to OpenMP statement pragmas. */
27599 static void
27601 {
27602 tree stmt;
27605 {
27635 }
27639 }
27640 \f
27641 /* Transactional Memory parsing routines. */
27643 /* Parse a transaction attribute.
27645 txn-attribute:
27646 attribute
27647 [ [ identifier ] ]
27649 ??? Simplify this when C++0x bracket attributes are
27650 implemented properly. */
27652 static tree
27654 {
27669 {
27673 /* For keywords, use the canonical spelling,
27674 not the parsed identifier. */
27678 }
27679 else
27683 error1:
27686 }
27688 /* Parse a __transaction_atomic or __transaction_relaxed statement.
27690 transaction-statement:
27691 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
27692 compound-statement
27693 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
27694 */
27696 static tree
27698 {
27713 else
27714 {
27718 }
27720 /* Parse a noexcept specification. */
27723 /* Keep track if we're in the lexical scope of an outer transaction. */
27735 }
27737 /* Parse a __transaction_atomic or __transaction_relaxed expression.
27739 transaction-expression:
27740 __transaction_atomic txn-noexcept-spec[opt] ( expression )
27741 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
27742 */
27744 static tree
27746 {
27771 /* Set this early. This might mean that we allow transaction_cancel in
27772 an expression that we find out later actually has to be a constexpr.
27773 However, we expect that cxx_constant_value will be able to deal with
27774 this; also, if the noexcept has no constexpr, then what we parse next
27775 really is a transaction's body. */
27778 /* Parse a noexcept specification. */
27784 {
27791 }
27792 else
27793 {
27794 /* The only expression that is available got parsed for the noexcept
27795 already. noexcept is true then. */
27798 }
27807 }
27809 /* Parse a function-transaction-block.
27811 function-transaction-block:
27812 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
27813 function-body
27814 __transaction_atomic txn-attribute[opt] function-try-block
27815 __transaction_relaxed ctor-initializer[opt] function-body
27816 __transaction_relaxed function-try-block
27817 */
27819 static bool
27821 {
27837 else
27838 {
27842 }
27850 else
27851 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
27859 }
27861 /* Parse a __transaction_cancel statement.
27863 cancel-statement:
27864 __transaction_cancel txn-attribute[opt] ;
27865 __transaction_cancel txn-attribute[opt] throw-expression ;
27867 ??? Cancel and throw is not yet implemented. */
27869 static tree
27871 {
27877 RT_TRANSACTION_CANCEL);
27884 /* ??? Parse cancel-and-throw here. */
27889 {
27893 }
27895 {
27899 }
27901 {
27904 {
27910 }
27911 }
27913 {
27917 }
27924 }
27925 \f
27926 /* The parser. */
27930 \f
27931 /* Special handling for the first token or line in the file. The first
27932 thing in the file might be #pragma GCC pch_preprocess, which loads a
27933 PCH file, which is a GC collection point. So we need to handle this
27934 first pragma without benefit of an existing lexer structure.
27936 Always returns one token to the caller in *FIRST_TOKEN. This is
27937 either the true first token of the file, or the first token after
27938 the initial pragma. */
27940 static void
27942 {
27951 {
27958 }
27959 else
27962 /* Skip to the end of the pragma. */
27966 /* Now actually load the PCH file. */
27970 /* Read one more token to return to our caller. We have to do this
27971 after reading the PCH file in, since its pointers have to be
27972 live. */
27974 }
27976 /* Normal parsing of a pragma token. Here we can (and must) use the
27977 regular lexer. */
27979 static bool
27981 {
27991 {
27999 {
28009 }
28014 {
28024 }
28029 {
28035 "%<#pragma omp taskwait%> may only be "
28040 }
28045 {
28051 "%<#pragma omp taskyield%> may only be "
28056 }
28079 "%<#pragma omp section%> may only be used in "
28088 bad_stmt:
28091 }
28095 }
28097 /* The interface the pragma parsers have to the lexer. */
28099 enum cpp_ttype
28101 {
28114 else
28115 {
28119 }
28122 }
28124 \f
28125 /* External interface. */
28127 /* Parse one entire translation unit. */
28129 void
28131 {
28135 {
28138 }
28146 }