| blob | 155b51a180d9f6168283aff464fd8d77733a4ee8 |
1 /* C++ Parser.
2 Copyright (C) 2000, 2001, 2002, 2003, 2004,
3 2005, 2007, 2008, 2009, 2010, 2011, 2012 Free Software Foundation, Inc.
4 Written by Mark Mitchell <mark@codesourcery.com>.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it
9 under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
11 any later version.
13 GCC is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
43 \f
44 /* The lexer. */
46 /* The cp_lexer_* routines mediate between the lexer proper (in libcpp
47 and c-lex.c) and the C++ parser. */
50 {
52 };
54 /* The various kinds of non integral constant we encounter. */
56 NIC_NONE,
57 /* floating-point literal */
58 NIC_FLOAT,
59 /* %<this%> */
60 NIC_THIS,
61 /* %<__FUNCTION__%> */
62 NIC_FUNC_NAME,
63 /* %<__PRETTY_FUNCTION__%> */
64 NIC_PRETTY_FUNC,
65 /* %<__func__%> */
66 NIC_C99_FUNC,
67 /* "%<va_arg%> */
68 NIC_VA_ARG,
69 /* a cast */
70 NIC_CAST,
71 /* %<typeid%> operator */
72 NIC_TYPEID,
73 /* non-constant compound literals */
74 NIC_NCC,
75 /* a function call */
76 NIC_FUNC_CALL,
77 /* an increment */
78 NIC_INC,
79 /* an decrement */
80 NIC_DEC,
81 /* an array reference */
82 NIC_ARRAY_REF,
83 /* %<->%> */
84 NIC_ARROW,
85 /* %<.%> */
86 NIC_POINT,
87 /* the address of a label */
88 NIC_ADDR_LABEL,
89 /* %<*%> */
90 NIC_STAR,
91 /* %<&%> */
92 NIC_ADDR,
93 /* %<++%> */
94 NIC_PREINCREMENT,
95 /* %<--%> */
96 NIC_PREDECREMENT,
97 /* %<new%> */
98 NIC_NEW,
99 /* %<delete%> */
100 NIC_DEL,
101 /* calls to overloaded operators */
102 NIC_OVERLOADED,
103 /* an assignment */
104 NIC_ASSIGNMENT,
105 /* a comma operator */
106 NIC_COMMA,
107 /* a call to a constructor */
108 NIC_CONSTRUCTOR,
109 /* a transaction expression */
110 NIC_TRANSACTION
113 /* The various kinds of errors about name-lookup failing. */
115 /* NULL */
116 NLE_NULL,
117 /* is not a type */
118 NLE_TYPE,
119 /* is not a class or namespace */
120 NLE_CXX98,
121 /* is not a class, namespace, or enumeration */
122 NLE_NOT_CXX98
125 /* The various kinds of required token */
127 RT_NONE,
149 /* The type is CPP_KEYWORD */
178 RT_TRANSACTION_CANCEL /* __transaction_cancel */
181 /* Prototypes. */
187 static void cp_lexer_destroy
189 static int cp_lexer_saving_tokens
193 static void cp_lexer_get_preprocessor_token
201 static bool cp_lexer_next_token_is_not
203 static bool cp_lexer_next_token_is_keyword
207 static void cp_lexer_purge_token
209 static void cp_lexer_purge_tokens_after
211 static void cp_lexer_save_tokens
213 static void cp_lexer_commit_tokens
215 static void cp_lexer_rollback_tokens
217 static void cp_lexer_print_token
221 static void cp_lexer_start_debugging
223 static void cp_lexer_stop_debugging
229 static void cp_parser_initial_pragma
232 static tree cp_literal_operator_id
235 /* Manifest constants. */
236 #define CP_LEXER_BUFFER_SIZE ((256 * 1024) / sizeof (cp_token))
237 #define CP_SAVED_TOKEN_STACK 5
239 /* Variables. */
241 /* The stream to which debugging output should be written. */
244 /* Nonzero if we are parsing an unevaluated operand: an operand to
245 sizeof, typeof, or alignof. */
248 /* Dump up to NUM tokens in BUFFER to FILE starting with token
249 START_TOKEN. If START_TOKEN is NULL, the dump starts with the
250 first token in BUFFER. If NUM is 0, dump all the tokens. If
251 CURR_TOKEN is set and it is one of the tokens in BUFFER, it will be
252 highlighted by surrounding it in [[ ]]. */
254 static void
258 {
275 {
278 }
283 {
290 nprinted++;
300 {
310 }
311 }
314 {
317 }
320 }
323 /* Dump all tokens in BUFFER to stderr. */
325 void
327 {
329 }
332 /* Dump the cp_parser tree field T to FILE if T is non-NULL. DESC is the
333 description for T. */
335 static void
337 {
339 {
342 }
343 }
346 /* Dump parser context C to FILE. */
348 static void
350 {
355 }
358 /* Print the stack of parsing contexts to FILE starting with FIRST. */
360 static void
362 {
368 {
371 }
372 }
375 /* Print the value of FLAG to FILE. DESC is a string describing the flag. */
377 static void
379 {
382 }
385 /* Print an unparsed function entry UF to FILE. */
387 static void
389 {
392 tree fn;
397 default_arg_fn);
398 i++)
399 {
405 }
410 {
413 }
419 {
422 }
424 }
427 /* Print the stack of unparsed member functions S to FILE. */
429 static void
432 {
438 {
441 }
442 }
445 /* Dump the tokens in a window of size WINDOW_SIZE around the next_token for
446 the given PARSER. If FILE is NULL, the output is printed on stderr. */
448 static void
450 {
462 next_token);
463 }
466 /* Dump debugging information for the given PARSER. If FILE is NULL,
467 the output is printed on stderr. */
469 void
471 {
474 expanded_location eloc;
548 }
551 /* Allocate memory for a new lexer object and return it. */
555 {
560 /* Allocate the memory. */
563 /* Initially we are not debugging. */
567 CP_SAVED_TOKEN_STACK);
569 /* Create the buffer. */
573 }
576 /* Create a new main C++ lexer, the lexer that gets tokens from the
577 preprocessor. */
581 {
583 cp_token token;
585 /* It's possible that parsing the first pragma will load a PCH file,
586 which is a GC collection point. So we have to do that before
587 allocating any memory. */
592 /* Put the first token in the buffer. */
595 /* Get the remaining tokens from the preprocessor. */
597 {
600 }
609 /* Subsequent preprocessor diagnostics should use compiler
610 diagnostic functions to get the compiler source location. */
615 }
617 /* Create a new lexer whose token stream is primed with the tokens in
618 CACHE. When these tokens are exhausted, no new tokens will be read. */
622 {
627 /* We do not own the buffer. */
633 CP_SAVED_TOKEN_STACK);
635 /* Initially we are not debugging. */
640 }
642 /* Frees all resources associated with LEXER. */
644 static void
646 {
650 }
652 /* Returns nonzero if debugging information should be output. */
656 {
658 }
663 {
667 }
671 {
673 }
677 {
679 }
683 {
686 else
688 }
692 {
696 }
698 /* nonzero if we are presently saving tokens. */
702 {
704 }
706 /* Store the next token from the preprocessor in *TOKEN. Return true
707 if we reach EOF. If LEXER is NULL, assume we are handling an
708 initial #pragma pch_preprocess, and thus want the lexer to return
709 processed strings. */
711 static void
713 {
716 /* Get a new token from the preprocessor. */
717 token->type
724 /* On some systems, some header files are surrounded by an
725 implicit extern "C" block. Set a flag in the token if it
726 comes from such a header. */
731 /* Check to see if this token is a keyword. */
733 {
735 {
736 /* Mark this token as a keyword. */
738 /* Record which keyword. */
740 }
741 else
742 {
746 {
747 /* Warn about the C++0x keyword (but still treat it as
748 an identifier). */
753 /* Clear out the C_RID_CODE so we don't warn about this
754 particular identifier-turned-keyword again. */
756 }
760 }
761 }
763 {
764 /* This only happens in Objective-C++; it must be a keyword. */
767 {
768 /* Replace 'class' with '@class', 'private' with '@private',
769 etc. This prevents confusion with the C++ keyword
770 'class', and makes the tokens consistent with other
771 Objective-C 'AT' keywords. For example '@class' is
772 reported as RID_AT_CLASS which is consistent with
773 '@synchronized', which is reported as
774 RID_AT_SYNCHRONIZED.
775 */
784 }
785 }
787 {
788 /* We smuggled the cpp_token->u.pragma value in an INTEGER_CST. */
792 }
793 }
795 /* Update the globals input_location and the input file stack from TOKEN. */
798 {
800 {
802 }
803 }
805 /* Return a pointer to the next token in the token stream, but do not
806 consume it. */
810 {
812 {
816 }
818 }
820 /* Return true if the next token has the indicated TYPE. */
824 {
826 }
828 /* Return true if the next token does not have the indicated TYPE. */
832 {
834 }
836 /* Return true if the next token is the indicated KEYWORD. */
840 {
842 }
844 /* Return true if the next token is not the indicated KEYWORD. */
848 {
850 }
852 /* Return true if the next token is a keyword for a decl-specifier. */
854 static bool
856 {
861 {
862 /* auto specifier: storage-class-specifier in C++,
863 simple-type-specifier in C++0x. */
865 /* Storage classes. */
871 /* Elaborated type specifiers. */
877 /* Simple type specifiers. */
892 /* GNU extensions. */
895 /* C++0x extensions. */
902 }
903 }
905 /* Returns TRUE iff the token T begins a decltype type. */
907 static bool
909 {
912 }
914 /* Returns TRUE iff the next token begins a decltype type. */
916 static bool
918 {
921 }
923 /* Return a pointer to the Nth token in the token stream. If N is 1,
924 then this is precisely equivalent to cp_lexer_peek_token (except
925 that it is not inline). One would like to disallow that case, but
926 there is one case (cp_parser_nth_token_starts_template_id) where
927 the caller passes a variable for N and it might be 1. */
931 {
934 /* N is 1-based, not zero-based. */
945 {
948 {
951 }
955 }
958 {
961 }
964 }
966 /* Return the next token, and advance the lexer's next_token pointer
967 to point to the next non-purged token. */
971 {
977 do
978 {
981 {
984 }
986 }
991 /* Provide debugging output. */
993 {
997 }
1000 }
1002 /* Permanently remove the next token from the token stream, and
1003 advance the next_token pointer to refer to the next non-purged
1004 token. */
1006 static void
1008 {
1017 do
1018 {
1019 tok++;
1021 {
1024 }
1025 }
1028 }
1030 /* Permanently remove all tokens after TOK, up to, but not
1031 including, the token that will be returned next by
1032 cp_lexer_peek_token. */
1034 static void
1036 {
1045 {
1050 }
1051 }
1053 /* Begin saving tokens. All tokens consumed after this point will be
1054 preserved. */
1056 static void
1058 {
1059 /* Provide debugging output. */
1065 }
1067 /* Commit to the portion of the token stream most recently saved. */
1069 static void
1071 {
1072 /* Provide debugging output. */
1077 }
1079 /* Return all tokens saved since the last call to cp_lexer_save_tokens
1080 to the token stream. Stop saving tokens. */
1082 static void
1084 {
1085 /* Provide debugging output. */
1090 }
1092 /* Print a representation of the TOKEN on the STREAM. */
1094 static void
1096 {
1097 /* We don't use cpp_type2name here because the parser defines
1098 a few tokens of its own. */
1100 /* cpplib-defined token types */
1101 #define OP(e, s) #e,
1102 #define TK(e, s) #e,
1103 TTYPE_TABLE
1104 #undef OP
1105 #undef TK
1106 /* C++ parser token types - see "Manifest constants", above. */
1110 };
1112 /* For some tokens, print the associated data. */
1114 {
1116 /* Some keywords have a value that is not an IDENTIFIER_NODE.
1117 For example, `struct' is mapped to an INTEGER_CST. */
1120 /* else fall through */
1138 /* If we have a name for the token, print it out. Otherwise, we
1139 simply give the numeric code. */
1142 else
1145 }
1146 }
1148 /* Start emitting debugging information. */
1150 static void
1152 {
1155 }
1157 /* Stop emitting debugging information. */
1159 static void
1161 {
1164 }
1166 /* Create a new cp_token_cache, representing a range of tokens. */
1170 {
1175 }
1177 \f
1178 /* Decl-specifiers. */
1180 /* Set *DECL_SPECS to represent an empty decl-specifier-seq. */
1182 static void
1184 {
1186 }
1188 /* Declarators. */
1190 /* Nothing other than the parser should be creating declarators;
1191 declarators are a semi-syntactic representation of C++ entities.
1192 Other parts of the front end that need to create entities (like
1193 VAR_DECLs or FUNCTION_DECLs) should do that directly. */
1208 /* An erroneous declarator. */
1211 /* The obstack on which declarators and related data structures are
1212 allocated. */
1215 /* Alloc BYTES from the declarator memory pool. */
1219 {
1221 }
1223 /* Allocate a declarator of the indicated KIND. Clear fields that are
1224 common to all declarators. */
1228 {
1239 }
1241 /* Make a declarator for a generalized identifier. If
1242 QUALIFYING_SCOPE is non-NULL, the identifier is
1243 QUALIFYING_SCOPE::UNQUALIFIED_NAME; otherwise, it is just
1244 UNQUALIFIED_NAME. SFK indicates the kind of special function this
1245 is, if any. */
1249 special_function_kind sfk)
1250 {
1253 /* It is valid to write:
1255 class C { void f(); };
1256 typedef C D;
1257 void D::f();
1259 The standard is not clear about whether `typedef const C D' is
1260 legal; as of 2002-09-15 the committee is considering that
1261 question. EDG 3.0 allows that syntax. Therefore, we do as
1262 well. */
1276 }
1278 /* Make a declarator for a pointer to TARGET. CV_QUALIFIERS is a list
1279 of modifiers such as const or volatile to apply to the pointer
1280 type, represented as identifiers. */
1282 cp_declarator *
1284 {
1292 {
1296 }
1297 else
1301 }
1303 /* Like make_pointer_declarator -- but for references. */
1305 cp_declarator *
1308 {
1316 {
1320 }
1321 else
1325 }
1327 /* Like make_pointer_declarator -- but for a pointer to a non-static
1328 member of CLASS_TYPE. */
1330 cp_declarator *
1333 {
1342 {
1345 }
1346 else
1350 }
1352 /* Make a declarator for the function given by TARGET, with the
1353 indicated PARMS. The CV_QUALIFIERS aply to the function, as in
1354 "const"-qualified member function. The EXCEPTION_SPECIFICATION
1355 indicates what exceptions can be thrown. */
1357 cp_declarator *
1359 tree parms,
1360 cp_cv_quals cv_qualifiers,
1361 cp_virt_specifiers virt_specifiers,
1362 tree exception_specification,
1363 tree late_return_type)
1364 {
1375 {
1379 }
1380 else
1384 }
1386 /* Make a declarator for an array of BOUNDS elements, each of which is
1387 defined by ELEMENT. */
1389 cp_declarator *
1391 {
1398 {
1402 }
1403 else
1407 }
1409 /* Determine whether the declarator we've seen so far can be a
1410 parameter pack, when followed by an ellipsis. */
1411 static bool
1413 {
1414 /* Search for a declarator name, or any other declarator that goes
1415 after the point where the ellipsis could appear in a parameter
1416 pack. If we find any of these, then this declarator can not be
1417 made into a parameter pack. */
1420 {
1422 {
1434 }
1435 }
1438 }
1442 /* Create a parameter declarator with the indicated DECL_SPECIFIERS,
1443 DECLARATOR and DEFAULT_ARGUMENT. */
1445 cp_parameter_declarator *
1448 tree default_argument)
1449 {
1457 else
1464 }
1466 /* Returns true iff DECLARATOR is a declaration for a function. */
1468 static bool
1470 {
1472 {
1480 }
1482 }
1484 /* The parser. */
1486 /* Overview
1487 --------
1489 A cp_parser parses the token stream as specified by the C++
1490 grammar. Its job is purely parsing, not semantic analysis. For
1491 example, the parser breaks the token stream into declarators,
1492 expressions, statements, and other similar syntactic constructs.
1493 It does not check that the types of the expressions on either side
1494 of an assignment-statement are compatible, or that a function is
1495 not declared with a parameter of type `void'.
1497 The parser invokes routines elsewhere in the compiler to perform
1498 semantic analysis and to build up the abstract syntax tree for the
1499 code processed.
1501 The parser (and the template instantiation code, which is, in a
1502 way, a close relative of parsing) are the only parts of the
1503 compiler that should be calling push_scope and pop_scope, or
1504 related functions. The parser (and template instantiation code)
1505 keeps track of what scope is presently active; everything else
1506 should simply honor that. (The code that generates static
1507 initializers may also need to set the scope, in order to check
1508 access control correctly when emitting the initializers.)
1510 Methodology
1511 -----------
1513 The parser is of the standard recursive-descent variety. Upcoming
1514 tokens in the token stream are examined in order to determine which
1515 production to use when parsing a non-terminal. Some C++ constructs
1516 require arbitrary look ahead to disambiguate. For example, it is
1517 impossible, in the general case, to tell whether a statement is an
1518 expression or declaration without scanning the entire statement.
1519 Therefore, the parser is capable of "parsing tentatively." When the
1520 parser is not sure what construct comes next, it enters this mode.
1521 Then, while we attempt to parse the construct, the parser queues up
1522 error messages, rather than issuing them immediately, and saves the
1523 tokens it consumes. If the construct is parsed successfully, the
1524 parser "commits", i.e., it issues any queued error messages and
1525 the tokens that were being preserved are permanently discarded.
1526 If, however, the construct is not parsed successfully, the parser
1527 rolls back its state completely so that it can resume parsing using
1528 a different alternative.
1530 Future Improvements
1531 -------------------
1533 The performance of the parser could probably be improved substantially.
1534 We could often eliminate the need to parse tentatively by looking ahead
1535 a little bit. In some places, this approach might not entirely eliminate
1536 the need to parse tentatively, but it might still speed up the average
1537 case. */
1539 /* Flags that are passed to some parsing functions. These values can
1540 be bitwise-ored together. */
1542 enum
1543 {
1544 /* No flags. */
1546 /* The construct is optional. If it is not present, then no error
1547 should be issued. */
1549 /* When parsing a type-specifier, treat user-defined type-names
1550 as non-type identifiers. */
1552 /* When parsing a type-specifier, do not try to parse a class-specifier
1553 or enum-specifier. */
1555 /* When parsing a decl-specifier-seq, only allow type-specifier or
1556 constexpr. */
1558 };
1560 /* This type is used for parameters and variables which hold
1561 combinations of the above flags. */
1564 /* The different kinds of declarators we want to parse. */
1567 {
1568 /* We want an abstract declarator. */
1569 CP_PARSER_DECLARATOR_ABSTRACT,
1570 /* We want a named declarator. */
1571 CP_PARSER_DECLARATOR_NAMED,
1572 /* We don't mind, but the name must be an unqualified-id. */
1573 CP_PARSER_DECLARATOR_EITHER
1576 /* The precedence values used to parse binary expressions. The minimum value
1577 of PREC must be 1, because zero is reserved to quickly discriminate
1578 binary operators from other tokens. */
1580 enum cp_parser_prec
1581 {
1582 PREC_NOT_OPERATOR,
1583 PREC_LOGICAL_OR_EXPRESSION,
1584 PREC_LOGICAL_AND_EXPRESSION,
1585 PREC_INCLUSIVE_OR_EXPRESSION,
1586 PREC_EXCLUSIVE_OR_EXPRESSION,
1587 PREC_AND_EXPRESSION,
1588 PREC_EQUALITY_EXPRESSION,
1589 PREC_RELATIONAL_EXPRESSION,
1590 PREC_SHIFT_EXPRESSION,
1591 PREC_ADDITIVE_EXPRESSION,
1592 PREC_MULTIPLICATIVE_EXPRESSION,
1593 PREC_PM_EXPRESSION,
1594 NUM_PREC_VALUES = PREC_PM_EXPRESSION
1595 };
1597 /* A mapping from a token type to a corresponding tree node type, with a
1598 precedence value. */
1601 {
1602 /* The token type. */
1604 /* The corresponding tree code. */
1606 /* The precedence of this operator. */
1611 {
1612 /* Left hand side of the binary operation we are currently
1613 parsing. */
1614 tree lhs;
1615 /* Original tree code for left hand side, if it was a binary
1616 expression itself (used for -Wparentheses). */
1618 /* Tree code for the binary operation we are parsing. */
1620 /* Precedence of the binary operation we are parsing. */
1622 /* Location of the binary operation we are parsing. */
1623 location_t loc;
1626 /* The stack for storing partial expressions. We only need NUM_PREC_VALUES
1627 entries because precedence levels on the stack are monotonically
1628 increasing. */
1632 /* Prototypes. */
1634 /* Constructors and destructors. */
1639 /* Class variables. */
1643 /* The operator-precedence table used by cp_parser_binary_expression.
1644 Transformed into an associative array (binops_by_token) by
1645 cp_parser_new. */
1678 };
1680 /* The same as binops, but initialized by cp_parser_new so that
1681 binops_by_token[N].token_type == N. Used in cp_parser_binary_expression
1682 for speed. */
1685 /* Constructors and destructors. */
1687 /* Construct a new context. The context below this one on the stack
1688 is given by NEXT. */
1692 {
1695 /* Allocate the storage. */
1697 {
1698 /* Pull the first entry from the free list. */
1702 }
1703 else
1706 /* No errors have occurred yet in this context. */
1708 /* If this is not the bottommost context, copy information that we
1709 need from the previous context. */
1711 {
1712 /* If, in the NEXT context, we are parsing an `x->' or `x.'
1713 expression, then we are parsing one in this context, too. */
1715 /* Thread the stack. */
1717 }
1720 }
1722 /* Managing the unparsed function queues. */
1724 #define unparsed_funs_with_default_args \
1725 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues).funs_with_default_args
1726 #define unparsed_funs_with_definitions \
1727 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues).funs_with_definitions
1728 #define unparsed_nsdmis \
1729 VEC_last (cp_unparsed_functions_entry, parser->unparsed_queues).nsdmis
1731 static void
1733 {
1736 }
1738 static void
1740 {
1743 }
1745 /* Prototypes. */
1747 /* Constructors and destructors. */
1752 /* Routines to parse various constructs.
1754 Those that return `tree' will return the error_mark_node (rather
1755 than NULL_TREE) if a parse error occurs, unless otherwise noted.
1756 Sometimes, they will return an ordinary node if error-recovery was
1757 attempted, even though a parse error occurred. So, to check
1758 whether or not a parse error occurred, you should always use
1759 cp_parser_error_occurred. If the construct is optional (indicated
1760 either by an `_opt' in the name of the function that does the
1761 parsing or via a FLAGS parameter), then NULL_TREE is returned if
1762 the construct is not present. */
1764 /* Lexical conventions [gram.lex] */
1766 static tree cp_parser_identifier
1768 static tree cp_parser_string_literal
1770 static tree cp_parser_userdef_char_literal
1772 static tree cp_parser_userdef_string_literal
1774 static tree cp_parser_userdef_numeric_literal
1777 /* Basic concepts [gram.basic] */
1779 static bool cp_parser_translation_unit
1782 /* Expressions [gram.expr] */
1784 static tree cp_parser_primary_expression
1786 static tree cp_parser_id_expression
1788 static tree cp_parser_unqualified_id
1790 static tree cp_parser_nested_name_specifier_opt
1792 static tree cp_parser_nested_name_specifier
1794 static tree cp_parser_qualifying_entity
1796 static tree cp_parser_postfix_expression
1798 static tree cp_parser_postfix_open_square_expression
1800 static tree cp_parser_postfix_dot_deref_expression
1804 /* Values for the second parameter of cp_parser_parenthesized_expression_list. */
1806 static void cp_parser_pseudo_destructor_name
1808 static tree cp_parser_unary_expression
1810 static enum tree_code cp_parser_unary_operator
1812 static tree cp_parser_new_expression
1816 static tree cp_parser_new_type_id
1824 static tree cp_parser_delete_expression
1826 static tree cp_parser_cast_expression
1828 static tree cp_parser_binary_expression
1830 static tree cp_parser_question_colon_clause
1832 static tree cp_parser_assignment_expression
1834 static enum tree_code cp_parser_assignment_operator_opt
1836 static tree cp_parser_expression
1838 static tree cp_parser_constant_expression
1840 static tree cp_parser_builtin_offsetof
1842 static tree cp_parser_lambda_expression
1844 static void cp_parser_lambda_introducer
1846 static bool cp_parser_lambda_declarator_opt
1848 static void cp_parser_lambda_body
1851 /* Statements [gram.stmt.stmt] */
1853 static void cp_parser_statement
1855 static void cp_parser_label_for_labeled_statement
1857 static tree cp_parser_expression_statement
1859 static tree cp_parser_compound_statement
1861 static void cp_parser_statement_seq_opt
1863 static tree cp_parser_selection_statement
1865 static tree cp_parser_condition
1867 static tree cp_parser_iteration_statement
1869 static bool cp_parser_for_init_statement
1871 static tree cp_parser_for
1873 static tree cp_parser_c_for
1875 static tree cp_parser_range_for
1877 static void do_range_for_auto_deduction
1879 static tree cp_parser_perform_range_for_lookup
1881 static tree cp_parser_range_for_member_function
1883 static tree cp_parser_jump_statement
1885 static void cp_parser_declaration_statement
1888 static tree cp_parser_implicitly_scoped_statement
1890 static void cp_parser_already_scoped_statement
1893 /* Declarations [gram.dcl.dcl] */
1895 static void cp_parser_declaration_seq_opt
1897 static void cp_parser_declaration
1899 static void cp_parser_block_declaration
1901 static void cp_parser_simple_declaration
1903 static void cp_parser_decl_specifier_seq
1905 static tree cp_parser_storage_class_specifier_opt
1907 static tree cp_parser_function_specifier_opt
1909 static tree cp_parser_type_specifier
1912 static tree cp_parser_simple_type_specifier
1914 static tree cp_parser_type_name
1916 static tree cp_parser_nonclass_name
1918 static tree cp_parser_elaborated_type_specifier
1920 static tree cp_parser_enum_specifier
1922 static void cp_parser_enumerator_list
1924 static void cp_parser_enumerator_definition
1926 static tree cp_parser_namespace_name
1928 static void cp_parser_namespace_definition
1930 static void cp_parser_namespace_body
1932 static tree cp_parser_qualified_namespace_specifier
1934 static void cp_parser_namespace_alias_definition
1936 static bool cp_parser_using_declaration
1938 static void cp_parser_using_directive
1940 static tree cp_parser_alias_declaration
1942 static void cp_parser_asm_definition
1944 static void cp_parser_linkage_specification
1946 static void cp_parser_static_assert
1948 static tree cp_parser_decltype
1951 /* Declarators [gram.dcl.decl] */
1953 static tree cp_parser_init_declarator
1954 (cp_parser *, cp_decl_specifier_seq *, VEC (deferred_access_check,gc)*, bool, bool, int, bool *, tree *);
1959 static enum tree_code cp_parser_ptr_operator
1961 static cp_cv_quals cp_parser_cv_qualifier_seq_opt
1963 static cp_virt_specifiers cp_parser_virt_specifier_seq_opt
1965 static tree cp_parser_late_return_type_opt
1967 static tree cp_parser_declarator_id
1969 static tree cp_parser_type_id
1971 static tree cp_parser_template_type_arg
1974 static tree cp_parser_type_id_1
1976 static void cp_parser_type_specifier_seq
1978 static tree cp_parser_parameter_declaration_clause
1980 static tree cp_parser_parameter_declaration_list
1984 static tree cp_parser_default_argument
1986 static void cp_parser_function_body
1988 static tree cp_parser_initializer
1990 static tree cp_parser_initializer_clause
1992 static tree cp_parser_braced_list
1997 static bool cp_parser_ctor_initializer_opt_and_function_body
2000 /* Classes [gram.class] */
2002 static tree cp_parser_class_name
2004 static tree cp_parser_class_specifier
2006 static tree cp_parser_class_head
2008 static enum tag_types cp_parser_class_key
2010 static void cp_parser_member_specification_opt
2012 static void cp_parser_member_declaration
2014 static tree cp_parser_pure_specifier
2016 static tree cp_parser_constant_initializer
2019 /* Derived classes [gram.class.derived] */
2021 static tree cp_parser_base_clause
2023 static tree cp_parser_base_specifier
2026 /* Special member functions [gram.special] */
2028 static tree cp_parser_conversion_function_id
2030 static tree cp_parser_conversion_type_id
2034 static bool cp_parser_ctor_initializer_opt
2036 static void cp_parser_mem_initializer_list
2038 static tree cp_parser_mem_initializer
2040 static tree cp_parser_mem_initializer_id
2043 /* Overloading [gram.over] */
2045 static tree cp_parser_operator_function_id
2047 static tree cp_parser_operator
2050 /* Templates [gram.temp] */
2052 static void cp_parser_template_declaration
2054 static tree cp_parser_template_parameter_list
2056 static tree cp_parser_template_parameter
2058 static tree cp_parser_type_parameter
2060 static tree cp_parser_template_id
2062 static tree cp_parser_template_name
2064 static tree cp_parser_template_argument_list
2066 static tree cp_parser_template_argument
2068 static void cp_parser_explicit_instantiation
2070 static void cp_parser_explicit_specialization
2073 /* Exception handling [gram.exception] */
2075 static tree cp_parser_try_block
2077 static bool cp_parser_function_try_block
2079 static void cp_parser_handler_seq
2081 static void cp_parser_handler
2083 static tree cp_parser_exception_declaration
2085 static tree cp_parser_throw_expression
2087 static tree cp_parser_exception_specification_opt
2089 static tree cp_parser_type_id_list
2092 /* GNU Extensions */
2094 static tree cp_parser_asm_specification_opt
2096 static tree cp_parser_asm_operand_list
2098 static tree cp_parser_asm_clobber_list
2100 static tree cp_parser_asm_label_list
2102 static tree cp_parser_attributes_opt
2104 static tree cp_parser_attribute_list
2106 static bool cp_parser_extension_opt
2108 static void cp_parser_label_declaration
2111 /* Transactional Memory Extensions */
2113 static tree cp_parser_transaction
2115 static tree cp_parser_transaction_expression
2117 static bool cp_parser_function_transaction
2119 static tree cp_parser_transaction_cancel
2123 static bool cp_parser_pragma
2126 /* Objective-C++ Productions */
2128 static tree cp_parser_objc_message_receiver
2130 static tree cp_parser_objc_message_args
2132 static tree cp_parser_objc_message_expression
2134 static tree cp_parser_objc_encode_expression
2136 static tree cp_parser_objc_defs_expression
2138 static tree cp_parser_objc_protocol_expression
2140 static tree cp_parser_objc_selector_expression
2142 static tree cp_parser_objc_expression
2144 static bool cp_parser_objc_selector_p
2146 static tree cp_parser_objc_selector
2148 static tree cp_parser_objc_protocol_refs_opt
2150 static void cp_parser_objc_declaration
2152 static tree cp_parser_objc_statement
2154 static bool cp_parser_objc_valid_prefix_attributes
2156 static void cp_parser_objc_at_property_declaration
2158 static void cp_parser_objc_at_synthesize_declaration
2160 static void cp_parser_objc_at_dynamic_declaration
2162 static tree cp_parser_objc_struct_declaration
2165 /* Utility Routines */
2167 static tree cp_parser_lookup_name
2169 static tree cp_parser_lookup_name_simple
2171 static tree cp_parser_maybe_treat_template_as_class
2173 static bool cp_parser_check_declarator_template_parameters
2175 static bool cp_parser_check_template_parameters
2177 static tree cp_parser_simple_cast_expression
2179 static tree cp_parser_global_scope_opt
2181 static bool cp_parser_constructor_declarator_p
2183 static tree cp_parser_function_definition_from_specifiers_and_declarator
2185 static tree cp_parser_function_definition_after_declarator
2187 static void cp_parser_template_declaration_after_export
2189 static void cp_parser_perform_template_parameter_access_checks
2191 static tree cp_parser_single_declaration
2193 static tree cp_parser_functional_cast
2195 static tree cp_parser_save_member_function_body
2197 static tree cp_parser_save_nsdmi
2199 static tree cp_parser_enclosed_template_argument_list
2201 static void cp_parser_save_default_args
2203 static void cp_parser_late_parsing_for_member
2205 static tree cp_parser_late_parse_one_default_arg
2207 static void cp_parser_late_parsing_nsdmi
2209 static void cp_parser_late_parsing_default_args
2211 static tree cp_parser_sizeof_operand
2213 static tree cp_parser_trait_expr
2215 static bool cp_parser_declares_only_class_p
2217 static void cp_parser_set_storage_class
2219 static void cp_parser_set_decl_spec_type
2221 static void set_and_check_decl_spec_loc
2224 static bool cp_parser_friend_p
2226 static void cp_parser_required_error
2232 static bool cp_parser_token_starts_function_definition_p
2234 static bool cp_parser_next_token_starts_class_definition_p
2236 static bool cp_parser_next_token_ends_template_argument_p
2238 static bool cp_parser_nth_token_starts_template_argument_list_p
2240 static enum tag_types cp_parser_token_is_class_key
2242 static void cp_parser_check_class_key
2244 static void cp_parser_check_access_in_redeclaration
2246 static bool cp_parser_optional_template_keyword
2248 static void cp_parser_pre_parsed_nested_name_specifier
2250 static bool cp_parser_cache_group
2252 static tree cp_parser_cache_defarg
2254 static void cp_parser_parse_tentatively
2256 static void cp_parser_commit_to_tentative_parse
2258 static void cp_parser_abort_tentative_parse
2260 static bool cp_parser_parse_definitely
2264 static bool cp_parser_uncommitted_to_tentative_parse_p
2266 static void cp_parser_error
2268 static void cp_parser_name_lookup_error
2270 static bool cp_parser_simulate_error
2272 static bool cp_parser_check_type_definition
2274 static void cp_parser_check_for_definition_in_return_type
2276 static void cp_parser_check_for_invalid_template_id
2278 static bool cp_parser_non_integral_constant_expression
2280 static void cp_parser_diagnose_invalid_type_name
2282 static bool cp_parser_parse_and_diagnose_invalid_type_name
2284 static int cp_parser_skip_to_closing_parenthesis
2286 static void cp_parser_skip_to_end_of_statement
2288 static void cp_parser_consume_semicolon_at_end_of_statement
2290 static void cp_parser_skip_to_end_of_block_or_statement
2292 static bool cp_parser_skip_to_closing_brace
2294 static void cp_parser_skip_to_end_of_template_parameter_list
2296 static void cp_parser_skip_to_pragma_eol
2298 static bool cp_parser_error_occurred
2300 static bool cp_parser_allow_gnu_extensions_p
2302 static bool cp_parser_is_pure_string_literal
2304 static bool cp_parser_is_string_literal
2306 static bool cp_parser_is_keyword
2308 static tree cp_parser_make_typename_type
2313 /* Returns nonzero if we are parsing tentatively. */
2317 {
2319 }
2321 /* Returns nonzero if TOKEN is a string literal. */
2323 static bool
2325 {
2331 }
2333 /* Returns nonzero if TOKEN is a string literal
2334 of a user-defined string literal. */
2336 static bool
2338 {
2345 }
2347 /* Returns nonzero if TOKEN is the indicated KEYWORD. */
2349 static bool
2351 {
2353 }
2355 /* If not parsing tentatively, issue a diagnostic of the form
2356 FILE:LINE: MESSAGE before TOKEN
2357 where TOKEN is the next token in the input stream. MESSAGE
2358 (specified by the caller) is usually of the form "expected
2359 OTHER-TOKEN". */
2361 static void
2363 {
2365 {
2367 /* This diagnostic makes more sense if it is tagged to the line
2368 of the token we just peeked at. */
2372 {
2377 }
2380 /* Because c_parser_error does not understand
2381 CPP_KEYWORD, keywords are treated like
2382 identifiers. */
2385 }
2386 }
2388 /* Issue an error about name-lookup failing. NAME is the
2389 IDENTIFIER_NODE DECL is the result of
2390 the lookup (as returned from cp_parser_lookup_name). DESIRED is
2391 the thing that we hoped to find. */
2393 static void
2395 tree name,
2396 tree decl,
2397 name_lookup_error desired,
2398 location_t location)
2399 {
2400 /* If name lookup completely failed, tell the user that NAME was not
2401 declared. */
2403 {
2416 else
2418 }
2420 {
2422 {
2439 }
2440 }
2442 {
2444 {
2454 name);
2458 }
2459 }
2460 else
2461 {
2463 {
2476 }
2477 }
2478 }
2480 /* If we are parsing tentatively, remember that an error has occurred
2481 during this tentative parse. Returns true if the error was
2482 simulated; false if a message should be issued by the caller. */
2484 static bool
2486 {
2488 {
2491 }
2493 }
2495 /* This function is called when a type is defined. If type
2496 definitions are forbidden at this point, an error message is
2497 issued. */
2499 static bool
2501 {
2502 /* If types are forbidden here, issue a message. */
2504 {
2505 /* Don't use `%s' to print the string, because quotations (`%<', `%>')
2506 in the message need to be interpreted. */
2509 }
2511 }
2513 /* This function is called when the DECLARATOR is processed. The TYPE
2514 was a type defined in the decl-specifiers. If it is invalid to
2515 define a type in the decl-specifiers for DECLARATOR, an error is
2516 issued. TYPE_LOCATION is the location of TYPE and is used
2517 for error reporting. */
2519 static void
2522 {
2523 /* [dcl.fct] forbids type definitions in return types.
2524 Unfortunately, it's not easy to know whether or not we are
2525 processing a return type until after the fact. */
2533 {
2538 type);
2539 }
2540 }
2542 /* A type-specifier (TYPE) has been parsed which cannot be followed by
2543 "<" in any valid C++ program. If the next token is indeed "<",
2544 issue a message warning the user about what appears to be an
2545 invalid attempt to form a template-id. LOCATION is the location
2546 of the type-specifier (TYPE) */
2548 static void
2550 tree type,
2552 location_t location)
2553 {
2557 {
2561 {
2564 else
2566 }
2567 else
2569 /* Remember the location of the invalid "<". */
2572 /* Consume the "<". */
2574 /* Parse the template arguments. */
2576 /* Permanently remove the invalid template arguments so that
2577 this error message is not issued again. */
2580 }
2581 }
2583 /* If parsing an integral constant-expression, issue an error message
2584 about the fact that THING appeared and return true. Otherwise,
2585 return false. In either case, set
2586 PARSER->NON_INTEGRAL_CONSTANT_EXPRESSION_P. */
2588 static bool
2590 non_integral_constant thing)
2591 {
2594 {
2596 {
2599 {
2606 "enumeration type cannot appear in a "
2697 }
2701 }
2702 }
2704 }
2706 /* Emit a diagnostic for an invalid type name. SCOPE is the
2707 qualifying scope (or NULL, if none) for ID. This function commits
2708 to the current active tentative parse, if any. (Otherwise, the
2709 problematic construct might be encountered again later, resulting
2710 in duplicate error messages.) LOCATION is the location of ID. */
2712 static void
2715 location_t location)
2716 {
2719 /* Try to lookup the identifier. */
2724 /* If the lookup found a template-name, it means that the user forgot
2725 to specify an argument list. Emit a useful error message. */
2729 decl);
2733 /* Something like 'unsigned A a;' */
2736 {
2737 /* Issue an error message. */
2739 /* If we're in a template class, it's possible that the user was
2740 referring to a type from a base class. For example:
2742 template <typename T> struct A { typedef T X; };
2743 template <typename T> struct B : public A<T> { X x; };
2745 The user should have said "typename A<T>::X". */
2751 {
2752 tree b;
2755 b;
2757 {
2761 {
2762 tree field;
2763 /* Go from a particular instantiation of the
2764 template (which will have an empty TYPE_FIELDs),
2765 to the main version. */
2768 field;
2772 {
2777 }
2780 }
2781 }
2782 }
2783 }
2784 /* Here we diagnose qualified-ids where the scope is actually correct,
2785 but the identifier does not resolve to a valid type name. */
2787 {
2793 {
2794 /* A<T>::A<T>() */
2800 }
2809 else
2811 }
2812 }
2814 /* Check for a common situation where a type-name should be present,
2815 but is not, and issue a sensible error message. Returns true if an
2816 invalid type-name was detected.
2818 The situation handled by this function are variable declarations of the
2819 form `ID a', where `ID' is an id-expression and `a' is a plain identifier.
2820 Usually, `ID' should name a type, but if we got here it means that it
2821 does not. We try to emit the best possible error message depending on
2822 how exactly the id-expression looks like. */
2824 static bool
2826 {
2827 tree id;
2830 /* Avoid duplicate error about ambiguous lookup. */
2832 {
2836 }
2845 /* If the next token is a (, this is a function with no explicit return
2846 type, i.e. constructor, destructor or conversion op. */
2849 {
2852 }
2856 /* Emit a diagnostic for the invalid type. */
2859 out:
2860 /* If we aren't in the middle of a declarator (i.e. in a
2861 parameter-declaration-clause), skip to the end of the declaration;
2862 there's no point in trying to process it. */
2866 }
2868 /* Consume tokens up to, and including, the next non-nested closing `)'.
2869 Returns 1 iff we found a closing `)'. RECOVERING is true, if we
2870 are doing error recovery. Returns -1 if OR_COMMA is true and we
2871 found an unnested comma. */
2873 static int
2878 {
2888 {
2892 {
2895 /* If we've run out of tokens, then there is no closing `)'. */
2898 /* This is good for lambda expression capture-lists. */
2908 /* This matches the processing in skip_to_end_of_statement. */
2934 {
2938 }
2943 }
2945 /* Consume the token. */
2947 }
2948 }
2950 /* Consume tokens until we reach the end of the current statement.
2951 Normally, that will be just before consuming a `;'. However, if a
2952 non-nested `}' comes first, then we stop before consuming that. */
2954 static void
2956 {
2960 {
2964 {
2967 /* If we've run out of tokens, stop. */
2971 /* If the next token is a `;', we have reached the end of the
2972 statement. */
2978 /* If this is a non-nested '}', stop before consuming it.
2979 That way, when confronted with something like:
2981 { 3 + }
2983 we stop before consuming the closing '}', even though we
2984 have not yet reached a `;'. */
2988 /* If it is the closing '}' for a block that we have
2989 scanned, stop -- but only after consuming the token.
2990 That way given:
2992 void f g () { ... }
2993 typedef int I;
2995 we will stop after the body of the erroneously declared
2996 function, but before consuming the following `typedef'
2997 declaration. */
2999 {
3002 }
3010 }
3012 /* Consume the token. */
3014 }
3015 }
3017 /* This function is called at the end of a statement or declaration.
3018 If the next token is a semicolon, it is consumed; otherwise, error
3019 recovery is attempted. */
3021 static void
3023 {
3024 /* Look for the trailing `;'. */
3026 {
3027 /* If there is additional (erroneous) input, skip to the end of
3028 the statement. */
3030 /* If the next token is now a `;', consume it. */
3033 }
3034 }
3036 /* Skip tokens until we have consumed an entire block, or until we
3037 have consumed a non-nested `;'. */
3039 static void
3041 {
3045 {
3049 {
3052 /* If we've run out of tokens, stop. */
3056 /* Stop if this is an unnested ';'. */
3062 /* Stop if this is an unnested '}', or closes the outermost
3063 nesting level. */
3064 nesting_depth--;
3072 /* Nest. */
3073 nesting_depth++;
3078 }
3080 /* Consume the token. */
3082 }
3083 }
3085 /* Skip tokens until a non-nested closing curly brace is the next
3086 token, or there are no more tokens. Return true in the first case,
3087 false otherwise. */
3089 static bool
3091 {
3095 {
3099 {
3102 /* If we've run out of tokens, stop. */
3106 /* If the next token is a non-nested `}', then we have reached
3107 the end of the current block. */
3113 /* If it the next token is a `{', then we are entering a new
3114 block. Consume the entire block. */
3120 }
3122 /* Consume the token. */
3124 }
3125 }
3127 /* Consume tokens until we reach the end of the pragma. The PRAGMA_TOK
3128 parameter is the PRAGMA token, allowing us to purge the entire pragma
3129 sequence. */
3131 static void
3133 {
3138 do
3142 /* Ensure that the pragma is not parsed again. */
3144 }
3146 /* Require pragma end of line, resyncing with it as necessary. The
3147 arguments are as for cp_parser_skip_to_pragma_eol. */
3149 static void
3151 {
3155 }
3157 /* This is a simple wrapper around make_typename_type. When the id is
3158 an unresolved identifier node, we can provide a superior diagnostic
3159 using cp_parser_diagnose_invalid_type_name. */
3161 static tree
3164 {
3165 tree result;
3167 {
3173 }
3175 }
3177 /* This is a wrapper around the
3178 make_{pointer,ptrmem,reference}_declarator functions that decides
3179 which one to call based on the CODE and CLASS_TYPE arguments. The
3180 CODE argument should be one of the values returned by
3181 cp_parser_ptr_operator. */
3184 cp_cv_quals cv_qualifiers,
3186 {
3193 else
3200 }
3202 /* Create a new C++ parser. */
3206 {
3211 /* cp_lexer_new_main is called before doing GC allocation because
3212 cp_lexer_new_main might load a PCH file. */
3215 /* Initialize the binops_by_token so that we can get the tree
3216 directly from the token. */
3224 /* For now, we always accept GNU extensions. */
3227 /* The `>' token is a greater-than operator, not the end of a
3228 template-id. */
3233 /* We are not parsing a constant-expression. */
3238 /* Local variable names are not forbidden. */
3241 /* We are not processing an `extern "C"' declaration. */
3244 /* We are not processing a declarator. */
3247 /* We are not processing a template-argument-list. */
3250 /* We are not in an iteration statement. */
3253 /* We are not in a switch statement. */
3256 /* We are not parsing a type-id inside an expression. */
3259 /* Declarations aren't implicitly extern "C". */
3262 /* String literals should be translated to the execution character set. */
3265 /* We are not parsing a function body. */
3268 /* We can correct until told otherwise. */
3271 /* The unparsed function queue is empty. */
3274 /* There are no classes being defined. */
3277 /* No template parameters apply. */
3281 }
3283 /* Create a cp_lexer structure which will emit the tokens in CACHE
3284 and push it onto the parser's lexer stack. This is used for delayed
3285 parsing of in-class method bodies and default arguments, and should
3286 not be confused with tentative parsing. */
3287 static void
3289 {
3294 /* Move the current source position to that of the first token in the
3295 new lexer. */
3297 }
3299 /* Pop the top lexer off the parser stack. This is never used for the
3300 "main" lexer, only for those pushed by cp_parser_push_lexer_for_tokens. */
3301 static void
3303 {
3308 /* Put the current source position back where it was before this
3309 lexer was pushed. */
3311 }
3313 /* Lexical conventions [gram.lex] */
3315 /* Parse an identifier. Returns an IDENTIFIER_NODE representing the
3316 identifier. */
3318 static tree
3320 {
3323 /* Look for the identifier. */
3325 /* Return the value. */
3327 }
3329 /* Parse a sequence of adjacent string constants. Returns a
3330 TREE_STRING representing the combined, nul-terminated string
3331 constant. If TRANSLATE is true, translate the string to the
3332 execution character set. If WIDE_OK is true, a wide string is
3333 invalid here.
3335 C++98 [lex.string] says that if a narrow string literal token is
3336 adjacent to a wide string literal token, the behavior is undefined.
3337 However, C99 6.4.5p4 says that this results in a wide string literal.
3338 We follow C99 here, for consistency with the C front end.
3340 This code is largely lifted from lex_string() in c-lex.c.
3342 FUTURE: ObjC++ will need to handle @-strings here. */
3343 static tree
3345 {
3346 tree value;
3353 tree string_tree;
3359 {
3362 }
3365 {
3369 }
3370 else
3371 {
3374 }
3377 /* Try to avoid the overhead of creating and destroying an obstack
3378 for the common case of just one string. */
3381 {
3389 {
3393 }
3394 else
3398 }
3399 else
3400 {
3404 do
3405 {
3407 count++;
3412 {
3415 {
3418 }
3421 {
3426 }
3428 }
3429 else
3433 {
3438 "unsupported non-standard concatenation "
3440 }
3446 {
3450 }
3451 else
3452 {
3456 }
3457 }
3461 }
3464 {
3467 }
3471 {
3476 {
3491 }
3496 {
3500 }
3501 }
3502 else
3503 /* cpp_interpret_string has issued an error. */
3510 }
3512 /* Look up a literal operator with the name and the exact arguments. */
3514 static tree
3516 {
3523 {
3530 {
3533 {
3543 }
3546 /* May be this should be sufficient_parms_p instead,
3547 depending on how exactly should user-defined literals
3548 work in presence of default arguments on the literal
3549 operator parameters. */
3552 }
3553 }
3556 }
3558 /* Parse a user-defined char constant. Returns a call to a user-defined
3559 literal operator taking the character as an argument. */
3561 static tree
3563 {
3571 /* Build up a call to the user-defined operator */
3572 /* Lookup the name we got back from the id-expression. */
3577 {
3582 }
3591 }
3593 /* A subroutine of cp_parser_userdef_numeric_literal to
3594 create a char... template parameter pack from a string node. */
3596 static tree
3598 {
3599 tree charvec;
3605 /* Fill in CHARVEC with all of the parameters. */
3610 /* Build the argument packs. */
3617 }
3619 /* Parse a user-defined numeric constant. returns a call to a user-defined
3620 literal operator. */
3622 static tree
3624 {
3634 /* Look for a literal operator taking the exact type of numeric argument
3635 as the literal value. */
3640 {
3643 {
3646 }
3647 }
3650 /* If the numeric argument didn't work, look for a raw literal
3651 operator taking a const char* argument consisting of the number
3652 in string format. */
3657 {
3660 {
3663 }
3664 }
3667 /* If the raw literal didn't work, look for a non-type template
3668 function with parameter pack char.... Call the function with
3669 template parameter characters representing the number. */
3673 {
3678 {
3681 }
3682 }
3687 }
3689 /* Parse a user-defined string constant. Returns a call to a user-defined
3690 literal operator taking a character pointer and the length of the string
3691 as arguments. */
3693 static tree
3695 {
3704 /* Build up a call to the user-defined operator */
3705 /* Lookup the name we got back from the id-expression. */
3711 {
3715 }
3724 }
3727 /* Basic concepts [gram.basic] */
3729 /* Parse a translation-unit.
3731 translation-unit:
3732 declaration-seq [opt]
3734 Returns TRUE if all went well. */
3736 static bool
3738 {
3739 /* The address of the first non-permanent object on the declarator
3740 obstack. */
3745 /* Create the declarator obstack, if necessary. */
3747 {
3749 /* Create the error declarator. */
3751 /* Create the empty parameter list. */
3753 /* Remember where the base of the declarator obstack lies. */
3755 }
3759 /* If there are no tokens left then all went well. */
3761 {
3762 /* Get rid of the token array; we don't need it any more. */
3766 /* This file might have been a context that's implicitly extern
3767 "C". If so, pop the lang context. (Only relevant for PCH.) */
3769 {
3772 }
3774 /* Finish up. */
3778 }
3779 else
3780 {
3783 }
3785 /* Make sure the declarator obstack was fully cleaned up. */
3789 /* All went well. */
3791 }
3793 /* Expressions [gram.expr] */
3795 /* Parse a primary-expression.
3797 primary-expression:
3798 literal
3799 this
3800 ( expression )
3801 id-expression
3803 GNU Extensions:
3805 primary-expression:
3806 ( compound-statement )
3807 __builtin_va_arg ( assignment-expression , type-id )
3808 __builtin_offsetof ( type-id , offsetof-expression )
3810 C++ Extensions:
3811 __has_nothrow_assign ( type-id )
3812 __has_nothrow_constructor ( type-id )
3813 __has_nothrow_copy ( type-id )
3814 __has_trivial_assign ( type-id )
3815 __has_trivial_constructor ( type-id )
3816 __has_trivial_copy ( type-id )
3817 __has_trivial_destructor ( type-id )
3818 __has_virtual_destructor ( type-id )
3819 __is_abstract ( type-id )
3820 __is_base_of ( type-id , type-id )
3821 __is_class ( type-id )
3822 __is_convertible_to ( type-id , type-id )
3823 __is_empty ( type-id )
3824 __is_enum ( type-id )
3825 __is_final ( type-id )
3826 __is_literal_type ( type-id )
3827 __is_pod ( type-id )
3828 __is_polymorphic ( type-id )
3829 __is_std_layout ( type-id )
3830 __is_trivial ( type-id )
3831 __is_union ( type-id )
3833 Objective-C++ Extension:
3835 primary-expression:
3836 objc-expression
3838 literal:
3839 __null
3841 ADDRESS_P is true iff this expression was immediately preceded by
3842 "&" and therefore might denote a pointer-to-member. CAST_P is true
3843 iff this expression is the target of a cast. TEMPLATE_ARG_P is
3844 true iff this expression is a template argument.
3846 Returns a representation of the expression. Upon return, *IDK
3847 indicates what kind of id-expression (if any) was present. */
3849 static tree
3855 {
3858 /* Assume the primary expression is not an id-expression. */
3861 /* Peek at the next token. */
3864 {
3865 /* literal:
3866 integer-literal
3867 character-literal
3868 floating-literal
3869 string-literal
3870 boolean-literal
3871 pointer-literal
3872 user-defined-literal */
3882 {
3886 }
3887 /* Floating-point literals are only allowed in an integral
3888 constant expression if they are cast to an integral or
3889 enumeration type. */
3893 {
3894 /* CAST_P will be set even in invalid code like "int(2.7 +
3895 ...)". Therefore, we have to check that the next token
3896 is sure to end the cast. */
3898 {
3903 enumerator-definition. */
3905 /* The curly brace at the end of an enum-specifier. */
3907 /* The end of a statement. */
3909 /* The end of the cast-expression. */
3911 /* The end of an array bound. */
3913 /* The closing ">" in a template-argument-list. */
3916 /* C++0x only: A ">>" treated like two ">" tokens,
3917 in a template-argument-list. */
3922 }
3924 /* If we are within a cast, then the constraint that the
3925 cast is to an integral or enumeration type will be
3926 checked at that point. If we are not within a cast, then
3927 this code is invalid. */
3930 }
3949 /* ??? Should wide strings be allowed when parser->translate_strings_p
3950 is false (i.e. in attributes)? If not, we can kill the third
3951 argument to cp_parser_string_literal. */
3957 {
3958 tree expr;
3961 /* Consume the `('. */
3963 /* Within a parenthesized expression, a `>' token is always
3964 the greater-than operator. */
3965 saved_greater_than_is_operator_p
3968 /* If we see `( { ' then we are looking at the beginning of
3969 a GNU statement-expression. */
3972 {
3973 /* Statement-expressions are not allowed by the standard. */
3977 /* And they're not allowed outside of a function-body; you
3978 cannot, for example, write:
3980 int i = ({ int j = 3; j + 1; });
3982 at class or namespace scope. */
3985 {
3987 "statement-expressions are not allowed outside "
3991 }
3992 else
3993 {
3994 /* Start the statement-expression. */
3996 /* Parse the compound-statement. */
3998 /* Finish up. */
4000 }
4001 }
4002 else
4003 {
4004 /* Parse the parenthesized expression. */
4006 /* Let the front end know that this expression was
4007 enclosed in parentheses. This matters in case, for
4008 example, the expression is of the form `A::B', since
4009 `&A::B' might be a pointer-to-member, but `&(A::B)' is
4010 not. */
4012 /* DR 705: Wrapping an unqualified name in parentheses
4013 suppresses arg-dependent lookup. We want to pass back
4014 CP_ID_KIND_QUALIFIED for suppressing vtable lookup
4015 (c++/37862), but none of the others. */
4018 }
4019 /* The `>' token might be the end of a template-id or
4020 template-parameter-list now. */
4021 parser->greater_than_is_operator_p
4023 /* Consume the `)'. */
4028 }
4032 /* We have an Objective-C++ message. */
4034 {
4036 /* Don't warn about a failed tentative parse. */
4041 }
4045 /* We have an Objective-C++ string literal. */
4052 {
4053 /* These two are the boolean literals. */
4061 /* The `__null' literal. */
4066 /* The `nullptr' literal. */
4071 /* Recognize the `this' keyword. */
4075 {
4079 }
4080 /* Pointers cannot appear in constant-expressions. */
4085 /* The `operator' keyword can be the beginning of an
4086 id-expression. */
4093 {
4094 non_integral_constant name;
4096 /* The symbols __FUNCTION__, __PRETTY_FUNCTION__, and
4097 __func__ are the names of variables -- but they are
4098 treated specially. Therefore, they are handled here,
4099 rather than relying on the generic id-expression logic
4100 below. Grammatically, these names are id-expressions.
4102 Consume the token. */
4106 {
4118 }
4123 /* Look up the name. */
4125 }
4128 {
4129 tree expression;
4130 tree type;
4131 source_location type_location;
4133 /* The `__builtin_va_arg' construct is used to handle
4134 `va_arg'. Consume the `__builtin_va_arg' token. */
4136 /* Look for the opening `('. */
4138 /* Now, parse the assignment-expression. */
4141 /* Look for the `,'. */
4144 /* Parse the type-id. */
4146 /* Look for the closing `)'. */
4148 /* Using `va_arg' in a constant-expression is not
4149 allowed. */
4151 NIC_VA_ARG))
4154 }
4182 /* Objective-C++ expressions. */
4192 {
4197 }
4201 }
4203 /* An id-expression can start with either an identifier, a
4204 `::' as the beginning of a qualified-id, or the "operator"
4205 keyword. */
4210 {
4211 tree id_expression;
4212 tree decl;
4218 id_expression:
4219 /* Parse the id-expression. */
4220 id_expression
4237 /* If we have a template-id, then no further lookup is
4238 required. If the template-id was for a template-class, we
4239 will sometimes have a TYPE_DECL at this point. */
4243 /* Look up the name. */
4244 else
4245 {
4246 tree ambiguous_decls;
4248 /* If we already know that this lookup is ambiguous, then
4249 we've already issued an error message; there's no reason
4250 to check again. */
4253 {
4256 }
4259 none_type,
4260 template_p,
4265 /* If the lookup was ambiguous, an error will already have
4266 been issued. */
4270 /* In Objective-C++, we may have an Objective-C 2.0
4271 dot-syntax for classes here. */
4276 {
4277 tree component;
4284 }
4286 /* In Objective-C++, an instance variable (ivar) may be preferred
4287 to whatever cp_parser_lookup_name() found. */
4290 /* If name lookup gives us a SCOPE_REF, then the
4291 qualifying scope was dependent. */
4293 {
4294 /* At this point, we do not know if DECL is a valid
4295 integral constant expression. We assume that it is
4296 in fact such an expression, so that code like:
4298 template <int N> struct A {
4299 int a[B<N>::i];
4300 };
4302 is accepted. At template-instantiation time, we
4303 will check that B<N>::i is actually a constant. */
4305 }
4306 /* Check to see if DECL is a local variable in a context
4307 where that is forbidden. */
4310 {
4311 /* It might be that we only found DECL because we are
4312 trying to be generous with pre-ISO scoping rules.
4313 For example, consider:
4315 int i;
4316 void g() {
4317 for (int i = 0; i < 10; ++i) {}
4318 extern void f(int j = i);
4319 }
4321 Here, name look up will originally find the out
4322 of scope `i'. We need to issue a warning message,
4323 but then use the global `i'. */
4326 {
4329 decl);
4331 }
4332 }
4333 }
4335 decl = (finish_id_expression
4337 idk,
4342 template_arg_p,
4348 }
4350 /* Anything else is an error. */
4354 }
4355 }
4357 /* Parse an id-expression.
4359 id-expression:
4360 unqualified-id
4361 qualified-id
4363 qualified-id:
4364 :: [opt] nested-name-specifier template [opt] unqualified-id
4365 :: identifier
4366 :: operator-function-id
4367 :: template-id
4369 Return a representation of the unqualified portion of the
4370 identifier. Sets PARSER->SCOPE to the qualifying scope if there is
4371 a `::' or nested-name-specifier.
4373 Often, if the id-expression was a qualified-id, the caller will
4374 want to make a SCOPE_REF to represent the qualified-id. This
4375 function does not do this in order to avoid wastefully creating
4376 SCOPE_REFs when they are not required.
4378 If TEMPLATE_KEYWORD_P is true, then we have just seen the
4379 `template' keyword.
4381 If CHECK_DEPENDENCY_P is false, then names are looked up inside
4382 uninstantiated templates.
4384 If *TEMPLATE_P is non-NULL, it is set to true iff the
4385 `template' keyword is used to explicitly indicate that the entity
4386 named is a template.
4388 If DECLARATOR_P is true, the id-expression is appearing as part of
4389 a declarator, rather than as part of an expression. */
4391 static tree
4398 {
4402 /* Assume the `template' keyword was not used. */
4406 /* Look for the optional `::' operator. */
4407 global_scope_p
4410 /* Look for the optional nested-name-specifier. */
4411 nested_name_specifier_p
4414 check_dependency_p,
4416 declarator_p)
4418 /* If there is a nested-name-specifier, then we are looking at
4419 the first qualified-id production. */
4421 {
4422 tree saved_scope;
4423 tree saved_object_scope;
4424 tree saved_qualifying_scope;
4425 tree unqualified_id;
4428 /* See if the next token is the `template' keyword. */
4432 /* Name lookup we do during the processing of the
4433 unqualified-id might obliterate SCOPE. */
4437 /* Process the final unqualified-id. */
4439 check_dependency_p,
4440 declarator_p,
4442 /* Restore the SAVED_SCOPE for our caller. */
4448 }
4449 /* Otherwise, if we are in global scope, then we are looking at one
4450 of the other qualified-id productions. */
4452 {
4454 tree id;
4456 /* Peek at the next token. */
4459 /* If it's an identifier, and the next token is not a "<", then
4460 we can avoid the template-id case. This is an optimization
4461 for this common case. */
4463 && !cp_parser_nth_token_starts_template_argument_list_p
4468 /* Try a template-id. */
4472 none_type,
4473 declarator_p);
4474 /* If that worked, we're done. */
4478 /* Peek at the next token. (Changes in the token buffer may
4479 have invalidated the pointer obtained above.) */
4483 {
4490 /* Fall through. */
4495 }
4496 }
4497 else
4500 declarator_p,
4501 optional_p);
4502 }
4504 /* Parse an unqualified-id.
4506 unqualified-id:
4507 identifier
4508 operator-function-id
4509 conversion-function-id
4510 ~ class-name
4511 template-id
4513 If TEMPLATE_KEYWORD_P is TRUE, we have just seen the `template'
4514 keyword, in a construct like `A::template ...'.
4516 Returns a representation of unqualified-id. For the `identifier'
4517 production, an IDENTIFIER_NODE is returned. For the `~ class-name'
4518 production a BIT_NOT_EXPR is returned; the operand of the
4519 BIT_NOT_EXPR is an IDENTIFIER_NODE for the class-name. For the
4520 other productions, see the documentation accompanying the
4521 corresponding parsing functions. If CHECK_DEPENDENCY_P is false,
4522 names are looked up in uninstantiated templates. If DECLARATOR_P
4523 is true, the unqualified-id is appearing as part of a declarator,
4524 rather than as part of an expression. */
4526 static tree
4532 {
4535 /* Peek at the next token. */
4539 {
4541 {
4542 tree id;
4544 /* We don't know yet whether or not this will be a
4545 template-id. */
4547 /* Try a template-id. */
4549 check_dependency_p,
4550 none_type,
4551 declarator_p);
4552 /* If it worked, we're done. */
4555 /* Otherwise, it's an ordinary identifier. */
4557 }
4561 check_dependency_p,
4562 none_type,
4563 declarator_p);
4566 {
4567 tree type_decl;
4568 tree qualifying_scope;
4569 tree object_scope;
4570 tree scope;
4573 /* Consume the `~' token. */
4575 /* Parse the class-name. The standard, as written, seems to
4576 say that:
4578 template <typename T> struct S { ~S (); };
4579 template <typename T> S<T>::~S() {}
4581 is invalid, since `~' must be followed by a class-name, but
4582 `S<T>' is dependent, and so not known to be a class.
4583 That's not right; we need to look in uninstantiated
4584 templates. A further complication arises from:
4586 template <typename T> void f(T t) {
4587 t.T::~T();
4588 }
4590 Here, it is not possible to look up `T' in the scope of `T'
4591 itself. We must look in both the current scope, and the
4592 scope of the containing complete expression.
4594 Yet another issue is:
4596 struct S {
4597 int S;
4598 ~S();
4599 };
4601 S::~S() {}
4603 The standard does not seem to say that the `S' in `~S'
4604 should refer to the type `S' and not the data member
4605 `S::S'. */
4607 /* DR 244 says that we look up the name after the "~" in the
4608 same scope as we looked up the qualifying name. That idea
4609 isn't fully worked out; it's more complicated than that. */
4614 /* Check for invalid scopes. */
4616 {
4620 }
4622 {
4626 scope);
4631 }
4634 /* If the name is of the form "X::~X" it's OK even if X is a
4635 typedef. */
4644 {
4647 }
4649 /* If there was an explicit qualification (S::~T), first look
4650 in the scope given by the qualification (i.e., S).
4652 Note: in the calls to cp_parser_class_name below we pass
4653 typename_type so that lookup finds the injected-class-name
4654 rather than the constructor. */
4658 {
4663 typename_type,
4666 declarator_p);
4669 }
4670 /* In "N::S::~S", look in "N" as well. */
4672 {
4677 type_decl
4681 typename_type,
4684 declarator_p);
4687 }
4688 /* In "p->S::~T", look in the scope given by "*p" as well. */
4690 {
4695 type_decl
4699 typename_type,
4702 declarator_p);
4705 }
4706 /* Look in the surrounding context. */
4708 {
4714 type_decl
4718 typename_type,
4721 declarator_p);
4724 {
4725 /* We couldn't find a type with this name, so just accept
4726 it and check for a match at instantiation time. */
4731 }
4732 }
4733 /* If an error occurred, assume that the name of the
4734 destructor is the same as the name of the qualifying
4735 class. That allows us to keep parsing after running
4736 into ill-formed destructor names. */
4742 /* Check that destructor name and scope match. */
4744 {
4751 }
4753 /* [class.dtor]
4755 A typedef-name that names a class shall not be used as the
4756 identifier in the declarator for a destructor declaration. */
4763 type_decl);
4766 }
4770 {
4771 tree id;
4773 /* This could be a template-id, so we try that first. */
4775 /* Try a template-id. */
4778 none_type,
4779 declarator_p);
4780 /* If that worked, we're done. */
4783 /* We still don't know whether we're looking at an
4784 operator-function-id or a conversion-function-id. */
4786 /* Try an operator-function-id. */
4788 /* If that didn't work, try a conversion-function-id. */
4792 {
4793 /* 17.6.3.3.5 */
4798 }
4801 }
4802 /* Fall through. */
4809 }
4810 }
4812 /* Parse an (optional) nested-name-specifier.
4814 nested-name-specifier: [C++98]
4815 class-or-namespace-name :: nested-name-specifier [opt]
4816 class-or-namespace-name :: template nested-name-specifier [opt]
4818 nested-name-specifier: [C++0x]
4819 type-name ::
4820 namespace-name ::
4821 nested-name-specifier identifier ::
4822 nested-name-specifier template [opt] simple-template-id ::
4824 PARSER->SCOPE should be set appropriately before this function is
4825 called. TYPENAME_KEYWORD_P is TRUE if the `typename' keyword is in
4826 effect. TYPE_P is TRUE if we non-type bindings should be ignored
4827 in name lookups.
4829 Sets PARSER->SCOPE to the class (TYPE) or namespace
4830 (NAMESPACE_DECL) specified by the nested-name-specifier, or leaves
4831 it unchanged if there is no nested-name-specifier. Returns the new
4832 scope iff there is a nested-name-specifier, or NULL_TREE otherwise.
4834 If IS_DECLARATION is TRUE, the nested-name-specifier is known to be
4835 part of a declaration and/or decl-specifier. */
4837 static tree
4843 {
4848 /* Remember where the nested-name-specifier starts. */
4850 {
4853 }
4856 {
4857 tree new_scope;
4858 tree old_scope;
4859 tree saved_qualifying_scope;
4862 /* Spot cases that cannot be the beginning of a
4863 nested-name-specifier. */
4866 /* If the next token is CPP_NESTED_NAME_SPECIFIER, just process
4867 the already parsed nested-name-specifier. */
4869 {
4870 /* Grab the nested-name-specifier and continue the loop. */
4872 /* If we originally encountered this nested-name-specifier
4873 with IS_DECLARATION set to false, we will not have
4874 resolved TYPENAME_TYPEs, so we must do so here. */
4877 {
4882 }
4885 }
4887 /* Spot cases that cannot be the beginning of a
4888 nested-name-specifier. On the second and subsequent times
4889 through the loop, we look for the `template' keyword. */
4891 ;
4892 /* A template-id can start a nested-name-specifier. */
4894 ;
4895 /* DR 743: decltype can be used in a nested-name-specifier. */
4897 ;
4898 else
4899 {
4900 /* If the next token is not an identifier, then it is
4901 definitely not a type-name or namespace-name. */
4904 /* If the following token is neither a `<' (to begin a
4905 template-id), nor a `::', then we are not looking at a
4906 nested-name-specifier. */
4912 {
4916 }
4919 && !cp_parser_nth_token_starts_template_argument_list_p
4922 }
4924 /* The nested-name-specifier is optional, so we parse
4925 tentatively. */
4928 /* Look for the optional `template' keyword, if this isn't the
4929 first time through the loop. */
4932 else
4935 /* Save the old scope since the name lookup we are about to do
4936 might destroy it. */
4939 /* In a declarator-id like "X<T>::I::Y<T>" we must be able to
4940 look up names in "X<T>::I" in order to determine that "Y" is
4941 a template. So, if we have a typename at this point, we make
4942 an effort to look through it. */
4944 && !typename_keyword_p
4949 /* Parse the qualifying entity. */
4950 new_scope
4952 typename_keyword_p,
4953 template_keyword_p,
4954 check_dependency_p,
4955 type_p,
4956 is_declaration);
4957 /* Look for the `::' token. */
4960 /* If we found what we wanted, we keep going; otherwise, we're
4961 done. */
4963 {
4966 /* Restore the OLD_SCOPE since it was valid before the
4967 failed attempt at finding the last
4968 class-or-namespace-name. */
4972 /* If the next token is a decltype, and the one after that is a
4973 `::', then the decltype has failed to resolve to a class or
4974 enumeration type. Give this error even when parsing
4975 tentatively since it can't possibly be valid--and we're going
4976 to replace it with a CPP_NESTED_NAME_SPECIFIER below, so we
4977 won't get another chance.*/
4981 {
4988 /* As below. */
4991 }
4995 /* If the next token is an identifier, and the one after
4996 that is a `::', then any valid interpretation would have
4997 found a class-or-namespace-name. */
5003 {
5006 {
5008 {
5009 tree decl;
5010 tree ambiguous_decls;
5013 none_type,
5022 decl);
5024 {
5030 }
5031 else
5032 {
5034 cp_parser_name_lookup_error
5037 else
5038 cp_parser_name_lookup_error
5041 }
5042 }
5045 /* Treat this as a successful nested-name-specifier
5046 due to:
5048 [basic.lookup.qual]
5050 If the name found is not a class-name (clause
5051 _class_) or namespace-name (_namespace.def_), the
5052 program is ill-formed. */
5054 }
5056 }
5058 }
5059 /* We've found one valid nested-name-specifier. */
5061 /* Name lookup always gives us a DECL. */
5064 /* Uses of "template" must be followed by actual templates. */
5076 new_scope);
5077 /* If it is a class scope, try to complete it; we are about to
5078 be looking up names inside the class. */
5080 /* Since checking types for dependency can be expensive,
5081 avoid doing it if the type is already complete. */
5083 /* Do not try to complete dependent types. */
5085 {
5087 /* If it is a typedef to current class, use the current
5088 class instead, as the typedef won't have any names inside
5089 it yet. */
5093 }
5094 /* Make sure we look in the right scope the next time through
5095 the loop. */
5097 }
5099 /* If parsing tentatively, replace the sequence of tokens that makes
5100 up the nested-name-specifier with a CPP_NESTED_NAME_SPECIFIER
5101 token. That way, should we re-parse the token stream, we will
5102 not have to repeat the effort required to do the parse, nor will
5103 we issue duplicate error messages. */
5105 {
5109 /* Reset the contents of the START token. */
5111 /* Retrieve any deferred checks. Do not pop this access checks yet
5112 so the memory will not be reclaimed during token replacing below. */
5120 /* Purge all subsequent tokens. */
5122 }
5128 }
5130 /* Parse a nested-name-specifier. See
5131 cp_parser_nested_name_specifier_opt for details. This function
5132 behaves identically, except that it will an issue an error if no
5133 nested-name-specifier is present. */
5135 static tree
5141 {
5142 tree scope;
5144 /* Look for the nested-name-specifier. */
5146 typename_keyword_p,
5147 check_dependency_p,
5148 type_p,
5149 is_declaration);
5150 /* If it was not present, issue an error message. */
5152 {
5155 }
5158 }
5160 /* Parse the qualifying entity in a nested-name-specifier. For C++98,
5161 this is either a class-name or a namespace-name (which corresponds
5162 to the class-or-namespace-name production in the grammar). For
5163 C++0x, it can also be a type-name that refers to an enumeration
5164 type or a simple-template-id.
5166 TYPENAME_KEYWORD_P is TRUE iff the `typename' keyword is in effect.
5167 TEMPLATE_KEYWORD_P is TRUE iff the `template' keyword is in effect.
5168 CHECK_DEPENDENCY_P is FALSE iff dependent names should be looked up.
5169 TYPE_P is TRUE iff the next name should be taken as a class-name,
5170 even the same name is declared to be another entity in the same
5171 scope.
5173 Returns the class (TYPE_DECL) or namespace (NAMESPACE_DECL)
5174 specified by the class-or-namespace-name. If neither is found the
5175 ERROR_MARK_NODE is returned. */
5177 static tree
5184 {
5185 tree saved_scope;
5186 tree saved_qualifying_scope;
5187 tree saved_object_scope;
5188 tree scope;
5192 /* DR 743: decltype can appear in a nested-name-specifier. */
5194 {
5198 {
5201 }
5205 }
5207 /* Before we try to parse the class-name, we must save away the
5208 current PARSER->SCOPE since cp_parser_class_name will destroy
5209 it. */
5213 /* Try for a class-name first. If the SAVED_SCOPE is a type, then
5214 there is no need to look for a namespace-name. */
5215 only_class_p = template_keyword_p
5220 typename_keyword_p,
5221 template_keyword_p,
5223 check_dependency_p,
5225 is_declaration);
5227 /* If that didn't work and we're in C++0x mode, try for a type-name. */
5231 {
5232 /* Restore the saved scope. */
5237 /* Parse tentatively. */
5240 /* Parse a type-name */
5243 /* "If the name found does not designate a namespace or a class,
5244 enumeration, or dependent type, the program is ill-formed."
5246 We cover classes and dependent types above and namespaces below,
5247 so this code is only looking for enums. */
5253 }
5254 /* If that didn't work, try for a namespace-name. */
5256 {
5257 /* Restore the saved scope. */
5261 /* If we are not looking at an identifier followed by the scope
5262 resolution operator, then this is not part of a
5263 nested-name-specifier. (Note that this function is only used
5264 to parse the components of a nested-name-specifier.) */
5269 }
5272 }
5274 /* Parse a postfix-expression.
5276 postfix-expression:
5277 primary-expression
5278 postfix-expression [ expression ]
5279 postfix-expression ( expression-list [opt] )
5280 simple-type-specifier ( expression-list [opt] )
5281 typename :: [opt] nested-name-specifier identifier
5282 ( expression-list [opt] )
5283 typename :: [opt] nested-name-specifier template [opt] template-id
5284 ( expression-list [opt] )
5285 postfix-expression . template [opt] id-expression
5286 postfix-expression -> template [opt] id-expression
5287 postfix-expression . pseudo-destructor-name
5288 postfix-expression -> pseudo-destructor-name
5289 postfix-expression ++
5290 postfix-expression --
5291 dynamic_cast < type-id > ( expression )
5292 static_cast < type-id > ( expression )
5293 reinterpret_cast < type-id > ( expression )
5294 const_cast < type-id > ( expression )
5295 typeid ( expression )
5296 typeid ( type-id )
5298 GNU Extension:
5300 postfix-expression:
5301 ( type-id ) { initializer-list , [opt] }
5303 This extension is a GNU version of the C99 compound-literal
5304 construct. (The C99 grammar uses `type-name' instead of `type-id',
5305 but they are essentially the same concept.)
5307 If ADDRESS_P is true, the postfix expression is the operand of the
5308 `&' operator. CAST_P is true if this expression is the target of a
5309 cast.
5311 If MEMBER_ACCESS_ONLY_P, we only allow postfix expressions that are
5312 class member access expressions [expr.ref].
5314 Returns a representation of the expression. */
5316 static tree
5320 {
5327 /* Peek at the next token. */
5329 /* Some of the productions are determined by keywords. */
5332 {
5337 {
5338 tree type;
5339 tree expression;
5342 /* All of these can be handled in the same way from the point
5343 of view of parsing. Begin by consuming the token
5344 identifying the cast. */
5347 /* New types cannot be defined in the cast. */
5349 parser->type_definition_forbidden_message
5352 /* Look for the opening `<'. */
5354 /* Parse the type to which we are casting. */
5356 /* Look for the closing `>'. */
5358 /* Restore the old message. */
5361 /* And the expression which is being cast. */
5366 /* Only type conversions to integral or enumeration types
5367 can be used in constant-expressions. */
5373 {
5375 postfix_expression
5379 postfix_expression
5383 postfix_expression
5385 tf_warning_or_error);
5388 postfix_expression
5393 }
5394 }
5398 {
5399 tree type;
5403 /* Consume the `typeid' token. */
5405 /* Look for the `(' token. */
5407 /* Types cannot be defined in a `typeid' expression. */
5409 parser->type_definition_forbidden_message
5411 /* We can't be sure yet whether we're looking at a type-id or an
5412 expression. */
5414 /* Try a type-id first. */
5419 /* Look for the `)' token. Otherwise, we can't be sure that
5420 we're not looking at an expression: consider `typeid (int
5421 (3))', for example. */
5423 /* If all went well, simply lookup the type-id. */
5426 /* Otherwise, fall back to the expression variant. */
5427 else
5428 {
5429 tree expression;
5431 /* Look for an expression. */
5433 /* Compute its typeid. */
5435 /* Look for the `)' token. */
5437 }
5438 /* Restore the saved message. */
5440 /* `typeid' may not appear in an integral constant expression. */
5443 }
5447 {
5448 tree type;
5449 /* The syntax permitted here is the same permitted for an
5450 elaborated-type-specifier. */
5455 }
5459 {
5462 tree p;
5476 return
5477 c_build_vec_perm_expr
5482 return
5483 c_build_vec_perm_expr
5487 else
5488 {
5492 }
5494 }
5497 {
5498 tree type;
5500 /* If the next thing is a simple-type-specifier, we may be
5501 looking at a functional cast. We could also be looking at
5502 an id-expression. So, we try the functional cast, and if
5503 that doesn't work we fall back to the primary-expression. */
5505 /* Look for the simple-type-specifier. */
5508 CP_PARSER_FLAGS_NONE);
5509 /* Parse the cast itself. */
5511 postfix_expression
5513 /* If that worked, we're done. */
5517 /* If the functional-cast didn't work out, try a
5518 compound-literal. */
5521 {
5526 /* Consume the `('. */
5528 /* Parse the type. */
5533 /* Look for the `)'. */
5535 /* Look for the `{'. */
5537 /* If things aren't going well, there's no need to
5538 keep going. */
5540 {
5542 /* Parse the initializer-list. */
5543 initializer_list
5545 /* Allow a trailing `,'. */
5548 /* Look for the final `}'. */
5550 }
5551 /* If that worked, we're definitely looking at a
5552 compound-literal expression. */
5554 {
5555 /* Warn the user that a compound literal is not
5556 allowed in standard C++. */
5558 /* For simplicity, we disallow compound literals in
5559 constant-expressions. We could
5560 allow compound literals of integer type, whose
5561 initializer was a constant, in constant
5562 expressions. Permitting that usage, as a further
5563 extension, would not change the meaning of any
5564 currently accepted programs. (Of course, as
5565 compound literals are not part of ISO C++, the
5566 standard has nothing to say.) */
5568 NIC_NCC))
5569 {
5572 }
5573 /* Form the representation of the compound-literal. */
5574 postfix_expression
5575 = (finish_compound_literal
5577 initializer_list),
5578 tf_warning_or_error));
5580 }
5581 }
5583 /* It must be a primary-expression. */
5584 postfix_expression
5588 }
5590 }
5592 /* Keep looping until the postfix-expression is complete. */
5594 {
5598 /* It is not a Koenig lookup function call. */
5599 postfix_expression
5602 /* Peek at the next token. */
5606 {
5608 postfix_expression
5610 postfix_expression,
5617 /* postfix-expression ( expression-list [opt] ) */
5618 {
5627 is_builtin_constant_p
5630 {
5631 /* The whole point of __builtin_constant_p is to allow
5632 non-constant expressions to appear as arguments. */
5633 saved_integral_constant_expression_p
5635 saved_non_integral_constant_expression_p
5638 }
5639 args = (cp_parser_parenthesized_expression_list
5644 {
5645 parser->integral_constant_expression_p
5647 parser->non_integral_constant_expression_p
5649 }
5652 {
5655 }
5657 /* Function calls are not permitted in
5658 constant-expressions. */
5661 NIC_FUNC_CALL))
5662 {
5666 }
5671 {
5673 {
5675 {
5678 postfix_expression
5681 tf_warning_or_error);
5682 }
5683 else
5684 postfix_expression
5686 }
5687 /* We do not perform argument-dependent lookup if
5688 normal lookup finds a non-function, in accordance
5689 with the expected resolution of DR 218. */
5692 {
5696 /* Do not do argument dependent lookup if regular
5697 lookup finds a member function or a block-scope
5698 function declaration. [basic.lookup.argdep]/3 */
5701 {
5704 postfix_expression
5707 tf_warning_or_error);
5708 }
5709 }
5710 }
5713 {
5723 {
5724 postfix_expression
5728 }
5731 {
5732 postfix_expression
5733 = (build_new_method_call
5739 tf_warning_or_error));
5740 }
5741 else
5742 postfix_expression
5746 tf_warning_or_error);
5747 }
5751 postfix_expression = (build_offset_ref_call_from_tree
5753 tf_warning_or_error));
5755 /* A call to a static class member, or a namespace-scope
5756 function. */
5757 postfix_expression
5760 koenig_p,
5761 tf_warning_or_error);
5762 else
5763 /* All other function calls. */
5764 postfix_expression
5767 koenig_p,
5768 tf_warning_or_error);
5770 /* The POSTFIX_EXPRESSION is certainly no longer an id. */
5774 }
5779 /* postfix-expression . template [opt] id-expression
5780 postfix-expression . pseudo-destructor-name
5781 postfix-expression -> template [opt] id-expression
5782 postfix-expression -> pseudo-destructor-name */
5784 /* Consume the `.' or `->' operator. */
5787 postfix_expression
5789 postfix_expression,
5797 /* postfix-expression ++ */
5798 /* Consume the `++' token. */
5800 /* Generate a representation for the complete expression. */
5801 postfix_expression
5803 POSTINCREMENT_EXPR);
5804 /* Increments may not appear in constant-expressions. */
5812 /* postfix-expression -- */
5813 /* Consume the `--' token. */
5815 /* Generate a representation for the complete expression. */
5816 postfix_expression
5818 POSTDECREMENT_EXPR);
5819 /* Decrements may not appear in constant-expressions. */
5831 else
5833 }
5834 }
5836 /* We should never get here. */
5839 }
5841 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5842 by cp_parser_builtin_offsetof. We're looking for
5844 postfix-expression [ expression ]
5845 postfix-expression [ braced-init-list ] (C++11)
5847 FOR_OFFSETOF is set if we're being called in that context, which
5848 changes how we deal with integer constant expressions. */
5850 static tree
5852 tree postfix_expression,
5854 {
5855 tree index;
5858 /* Consume the `[' token. */
5861 /* Parse the index expression. */
5862 /* ??? For offsetof, there is a question of what to allow here. If
5863 offsetof is not being used in an integral constant expression context,
5864 then we *could* get the right answer by computing the value at runtime.
5865 If we are in an integral constant expression context, then we might
5866 could accept any constant expression; hard to say without analysis.
5867 Rather than open the barn door too wide right away, allow only integer
5868 constant expressions here. */
5871 else
5872 {
5874 {
5878 }
5879 else
5881 }
5883 /* Look for the closing `]'. */
5886 /* Build the ARRAY_REF. */
5889 /* When not doing offsetof, array references are not permitted in
5890 constant-expressions. */
5896 }
5898 /* A subroutine of cp_parser_postfix_expression that also gets hijacked
5899 by cp_parser_builtin_offsetof. We're looking for
5901 postfix-expression . template [opt] id-expression
5902 postfix-expression . pseudo-destructor-name
5903 postfix-expression -> template [opt] id-expression
5904 postfix-expression -> pseudo-destructor-name
5906 FOR_OFFSETOF is set if we're being called in that context. That sorta
5907 limits what of the above we'll actually accept, but nevermind.
5908 TOKEN_TYPE is the "." or "->" token, which will already have been
5909 removed from the stream. */
5911 static tree
5914 tree postfix_expression,
5916 location_t location)
5917 {
5918 tree name;
5923 /* If this is a `->' operator, dereference the pointer. */
5926 tf_warning_or_error);
5927 /* Check to see whether or not the expression is type-dependent. */
5929 /* The identifier following the `->' or `.' is not qualified. */
5935 /* Enter the scope corresponding to the type of the object
5936 given by the POSTFIX_EXPRESSION. */
5938 {
5940 /* According to the standard, no expression should ever have
5941 reference type. Unfortunately, we do not currently match
5942 the standard in this respect in that our internal representation
5943 of an expression may have reference type even when the standard
5944 says it does not. Therefore, we have to manually obtain the
5945 underlying type here. */
5947 /* The type of the POSTFIX_EXPRESSION must be complete. */
5949 {
5951 postfix_expression);
5953 }
5954 /* Unlike the object expression in other contexts, *this is not
5955 required to be of complete type for purposes of class member
5956 access (5.2.5) outside the member function body. */
5960 /* Let the name lookup machinery know that we are processing a
5961 class member access expression. */
5963 /* If something went wrong, we want to be able to discern that case,
5964 as opposed to the case where there was no SCOPE due to the type
5965 of expression being dependent. */
5968 /* If the SCOPE was erroneous, make the various semantic analysis
5969 functions exit quickly -- and without issuing additional error
5970 messages. */
5973 }
5975 /* Assume this expression is not a pseudo-destructor access. */
5978 /* If the SCOPE is a scalar type, then, if this is a valid program,
5979 we must be looking at a pseudo-destructor-name. If POSTFIX_EXPRESSION
5980 is type dependent, it can be pseudo-destructor-name or something else.
5981 Try to parse it as pseudo-destructor-name first. */
5983 {
5984 tree s;
5985 tree type;
5988 /* Parse the pseudo-destructor-name. */
5997 {
5999 postfix_expression
6002 }
6003 }
6006 {
6007 /* If the SCOPE is not a scalar type, we are looking at an
6008 ordinary class member access expression, rather than a
6009 pseudo-destructor-name. */
6012 /* Parse the id-expression. */
6013 name = (cp_parser_id_expression
6020 /* In general, build a SCOPE_REF if the member name is qualified.
6021 However, if the name was not dependent and has already been
6022 resolved; there is no need to build the SCOPE_REF. For example;
6024 struct X { void f(); };
6025 template <typename T> void f(T* t) { t->X::f(); }
6027 Even though "t" is dependent, "X::f" is not and has been resolved
6028 to a BASELINK; there is no need to include scope information. */
6030 /* But we do need to remember that there was an explicit scope for
6031 virtual function calls. */
6035 /* If the name is a template-id that names a type, we will get a
6036 TYPE_DECL here. That is invalid code. */
6038 {
6041 }
6042 else
6043 {
6045 {
6047 {
6051 }
6052 else
6055 name,
6056 template_p);
6060 }
6062 adjust_result_of_qualified_name_lookup
6064 postfix_expression
6066 template_p,
6067 tf_warning_or_error);
6068 }
6069 }
6071 /* We no longer need to look up names in the scope of the object on
6072 the left-hand side of the `.' or `->' operator. */
6075 /* Outside of offsetof, these operators may not appear in
6076 constant-expressions. */
6078 && (cp_parser_non_integral_constant_expression
6083 }
6085 /* Parse a parenthesized expression-list.
6087 expression-list:
6088 assignment-expression
6089 expression-list, assignment-expression
6091 attribute-list:
6092 expression-list
6093 identifier
6094 identifier, expression-list
6096 CAST_P is true if this expression is the target of a cast.
6098 ALLOW_EXPANSION_P is true if this expression allows expansion of an
6099 argument pack.
6101 Returns a vector of trees. Each element is a representation of an
6102 assignment-expression. NULL is returned if the ( and or ) are
6103 missing. An empty, but allocated, vector is returned on no
6104 expressions. The parentheses are eaten. IS_ATTRIBUTE_LIST is id_attr
6105 if we are parsing an attribute list for an attribute that wants a
6106 plain identifier argument, normal_attr for an attribute that wants
6107 an expression, or non_attr if we aren't parsing an attribute list. If
6108 NON_CONSTANT_P is non-NULL, *NON_CONSTANT_P indicates whether or
6109 not all of the expressions in the list were constant. */
6117 {
6123 /* Assume all the expressions will be constant. */
6132 /* Within a parenthesized expression, a `>' token is always
6133 the greater-than operator. */
6134 saved_greater_than_is_operator_p
6138 /* Consume expressions until there are no more. */
6141 {
6142 tree expr;
6144 /* At the beginning of attribute lists, check to see if the
6145 next token is an identifier. */
6148 {
6151 /* Consume the identifier. */
6153 /* Save the identifier. */
6155 }
6156 else
6157 {
6160 /* Parse the next assignment-expression. */
6162 {
6163 /* A braced-init-list. */
6168 }
6170 {
6171 expr = (cp_parser_constant_expression
6176 }
6177 else
6183 /* If we have an ellipsis, then this is an expression
6184 expansion. */
6187 {
6188 /* Consume the `...'. */
6191 /* Build the argument pack. */
6193 }
6195 /* Add it to the list. We add error_mark_node
6196 expressions to the list, so that we can still tell if
6197 the correct form for a parenthesized expression-list
6198 is found. That gives better errors. */
6203 }
6205 /* After the first item, attribute lists look the same as
6206 expression lists. */
6209 get_comma:;
6210 /* If the next token isn't a `,', then we are done. */
6214 /* Otherwise, consume the `,' and keep going. */
6216 }
6219 {
6222 skip_comma:;
6223 /* We try and resync to an unnested comma, as that will give the
6224 user better diagnostics. */
6232 {
6233 parser->greater_than_is_operator_p
6236 }
6237 }
6239 parser->greater_than_is_operator_p
6246 }
6248 /* Parse a pseudo-destructor-name.
6250 pseudo-destructor-name:
6251 :: [opt] nested-name-specifier [opt] type-name :: ~ type-name
6252 :: [opt] nested-name-specifier template template-id :: ~ type-name
6253 :: [opt] nested-name-specifier [opt] ~ type-name
6255 If either of the first two productions is used, sets *SCOPE to the
6256 TYPE specified before the final `::'. Otherwise, *SCOPE is set to
6257 NULL_TREE. *TYPE is set to the TYPE_DECL for the final type-name,
6258 or ERROR_MARK_NODE if the parse fails. */
6260 static void
6264 {
6267 /* Assume that things will not work out. */
6270 /* Look for the optional `::' operator. */
6272 /* Look for the optional nested-name-specifier. */
6273 nested_name_specifier_p
6280 /* Now, if we saw a nested-name-specifier, we might be doing the
6281 second production. */
6284 {
6285 /* Consume the `template' keyword. */
6287 /* Parse the template-id. */
6291 class_type,
6293 /* Look for the `::' token. */
6295 }
6296 /* If the next token is not a `~', then there might be some
6297 additional qualification. */
6299 {
6300 /* At this point, we're looking for "type-name :: ~". The type-name
6301 must not be a class-name, since this is a pseudo-destructor. So,
6302 it must be either an enum-name, or a typedef-name -- both of which
6303 are just identifiers. So, we peek ahead to check that the "::"
6304 and "~" tokens are present; if they are not, then we can avoid
6305 calling type_name. */
6309 {
6312 }
6314 /* Look for the type-name. */
6319 /* Look for the `::' token. */
6321 }
6322 else
6325 /* Look for the `~'. */
6328 /* Once we see the ~, this has to be a pseudo-destructor. */
6332 /* Look for the type-name again. We are not responsible for
6333 checking that it matches the first type-name. */
6335 }
6337 /* Parse a unary-expression.
6339 unary-expression:
6340 postfix-expression
6341 ++ cast-expression
6342 -- cast-expression
6343 unary-operator cast-expression
6344 sizeof unary-expression
6345 sizeof ( type-id )
6346 alignof ( type-id ) [C++0x]
6347 new-expression
6348 delete-expression
6350 GNU Extensions:
6352 unary-expression:
6353 __extension__ cast-expression
6354 __alignof__ unary-expression
6355 __alignof__ ( type-id )
6356 alignof unary-expression [C++0x]
6357 __real__ cast-expression
6358 __imag__ cast-expression
6359 && identifier
6361 ADDRESS_P is true iff the unary-expression is appearing as the
6362 operand of the `&' operator. CAST_P is true if this expression is
6363 the target of a cast.
6365 Returns a representation of the expression. */
6367 static tree
6370 {
6374 /* Peek at the next token. */
6376 /* Some keywords give away the kind of expression. */
6378 {
6382 {
6385 {
6386 tree operand;
6390 /* Consume the token. */
6392 /* Parse the operand. */
6397 else
6398 {
6399 /* ISO C++ defines alignof only with types, not with
6400 expressions. So pedwarn if alignof is used with a non-
6401 type expression. However, __alignof__ is ok. */
6404 "ISO C++ does not allow %<alignof%> "
6408 }
6409 }
6418 {
6419 /* The saved value of the PEDANTIC flag. */
6421 tree expr;
6423 /* Save away the PEDANTIC flag. */
6425 /* Parse the cast-expression. */
6427 /* Restore the PEDANTIC flag. */
6431 }
6435 {
6436 tree expression;
6438 /* Consume the `__real__' or `__imag__' token. */
6440 /* Parse the cast-expression. */
6442 /* Create the complete representation. */
6446 expression,
6447 tf_warning_or_error);
6448 }
6456 {
6457 tree expr;
6467 parser->type_definition_forbidden_message
6470 saved_integral_constant_expression_p
6472 saved_non_integral_constant_expression_p
6476 saved_greater_than_is_operator_p
6486 parser->greater_than_is_operator_p
6489 parser->integral_constant_expression_p
6491 parser->non_integral_constant_expression_p
6498 }
6502 }
6503 }
6505 /* Look for the `:: new' and `:: delete', which also signal the
6506 beginning of a new-expression, or delete-expression,
6507 respectively. If the next token is `::', then it might be one of
6508 these. */
6510 {
6513 /* See if the token after the `::' is one of the keywords in
6514 which we're interested. */
6516 /* If it's `new', we have a new-expression. */
6519 /* Similarly, for `delete'. */
6522 }
6524 /* Look for a unary operator. */
6526 /* The `++' and `--' operators can be handled similarly, even though
6527 they are not technically unary-operators in the grammar. */
6529 {
6534 /* Handle the GNU address-of-label extension. */
6537 {
6538 tree identifier;
6539 tree expression;
6542 /* Consume the '&&' token. */
6544 /* Look for the identifier. */
6546 /* Create an expression representing the address. */
6549 NIC_ADDR_LABEL))
6552 }
6553 }
6555 {
6556 tree cast_expression;
6561 /* Consume the operator token. */
6563 /* Parse the cast-expression. */
6564 cast_expression
6568 /* Now, build an appropriate representation. */
6570 {
6574 RO_UNARY_STAR,
6575 tf_warning_or_error);
6580 /* Fall through. */
6583 cast_expression,
6584 tf_warning_or_error);
6591 /* Fall through. */
6596 cast_expression);
6601 }
6605 non_constant_p))
6609 }
6613 pidk);
6614 }
6616 /* Returns ERROR_MARK if TOKEN is not a unary-operator. If TOKEN is a
6617 unary-operator, the corresponding tree code is returned. */
6619 static enum tree_code
6621 {
6623 {
6644 }
6645 }
6647 /* Parse a new-expression.
6649 new-expression:
6650 :: [opt] new new-placement [opt] new-type-id new-initializer [opt]
6651 :: [opt] new new-placement [opt] ( type-id ) new-initializer [opt]
6653 Returns a representation of the expression. */
6655 static tree
6657 {
6660 tree type;
6663 tree ret;
6665 /* Look for the optional `::' operator. */
6666 global_scope_p
6670 /* Look for the `new' operator. */
6672 /* There's no easy way to tell a new-placement from the
6673 `( type-id )' construct. */
6675 /* Look for a new-placement. */
6677 /* If that didn't work out, there's no new-placement. */
6679 {
6683 }
6685 /* If the next token is a `(', then we have a parenthesized
6686 type-id. */
6688 {
6692 /* Consume the `('. */
6695 /* Parse the type-id. */
6696 parser->type_definition_forbidden_message
6701 /* Look for the closing `)'. */
6704 /* There should not be a direct-new-declarator in this production,
6705 but GCC used to allowed this, so we check and emit a sensible error
6706 message for this case. */
6708 {
6714 }
6715 }
6716 /* Otherwise, there must be a new-type-id. */
6717 else
6720 /* If the next token is a `(' or '{', then we have a new-initializer. */
6724 else
6727 /* A new-expression may not appear in an integral constant
6728 expression. */
6731 else
6732 {
6733 /* Create a representation of the new-expression. */
6735 tf_warning_or_error);
6736 }
6744 }
6746 /* Parse a new-placement.
6748 new-placement:
6749 ( expression-list )
6751 Returns the same representation as for an expression-list. */
6755 {
6758 /* Parse the expression-list. */
6759 expression_list = (cp_parser_parenthesized_expression_list
6765 }
6767 /* Parse a new-type-id.
6769 new-type-id:
6770 type-specifier-seq new-declarator [opt]
6772 Returns the TYPE allocated. If the new-type-id indicates an array
6773 type, *NELTS is set to the number of elements in the last array
6774 bound; the TYPE will not include the last array bound. */
6776 static tree
6778 {
6779 cp_decl_specifier_seq type_specifier_seq;
6785 /* The type-specifier sequence must not contain type definitions.
6786 (It cannot contain declarations of new types either, but if they
6787 are not definitions we will catch that because they are not
6788 complete.) */
6790 parser->type_definition_forbidden_message
6792 /* Parse the type-specifier-seq. */
6796 /* Restore the old message. */
6802 /* Parse the new-declarator. */
6805 /* Determine the number of elements in the last array dimension, if
6806 any. */
6808 /* Skip down to the last array dimension. */
6813 {
6816 }
6821 {
6824 }
6827 {
6834 else
6836 }
6839 }
6841 /* Parse an (optional) new-declarator.
6843 new-declarator:
6844 ptr-operator new-declarator [opt]
6845 direct-new-declarator
6847 Returns the declarator. */
6851 {
6853 tree type;
6854 cp_cv_quals cv_quals;
6856 /* We don't know if there's a ptr-operator next, or not. */
6858 /* Look for a ptr-operator. */
6860 /* If that worked, look for more new-declarators. */
6862 {
6865 /* Parse another optional declarator. */
6868 return cp_parser_make_indirect_declarator
6870 }
6872 /* If the next token is a `[', there is a direct-new-declarator. */
6877 }
6879 /* Parse a direct-new-declarator.
6881 direct-new-declarator:
6882 [ expression ]
6883 direct-new-declarator [constant-expression]
6885 */
6889 {
6893 {
6894 tree expression;
6897 /* Look for the opening `['. */
6902 /* The standard requires that the expression have integral
6903 type. DR 74 adds enumeration types. We believe that the
6904 real intent is that these expressions be handled like the
6905 expression in a `switch' condition, which also allows
6906 classes with a single conversion to integral or
6907 enumeration type. */
6909 {
6910 expression
6912 expression,
6915 {
6917 "expression in new-declarator must have integral "
6920 }
6921 }
6923 /* Look for the closing `]'. */
6926 /* Add this bound to the declarator. */
6929 /* If the next token is not a `[', then there are no more
6930 bounds. */
6933 }
6936 }
6938 /* Parse a new-initializer.
6940 new-initializer:
6941 ( expression-list [opt] )
6942 braced-init-list
6944 Returns a representation of the expression-list. */
6948 {
6952 {
6953 tree t;
6959 }
6960 else
6961 expression_list = (cp_parser_parenthesized_expression_list
6967 }
6969 /* Parse a delete-expression.
6971 delete-expression:
6972 :: [opt] delete cast-expression
6973 :: [opt] delete [ ] cast-expression
6975 Returns a representation of the expression. */
6977 static tree
6979 {
6982 tree expression;
6984 /* Look for the optional `::' operator. */
6985 global_scope_p
6989 /* Look for the `delete' keyword. */
6991 /* See if the array syntax is in use. */
6993 {
6994 /* Consume the `[' token. */
6996 /* Look for the `]' token. */
6998 /* Remember that this is the `[]' construct. */
7000 }
7001 else
7004 /* Parse the cast-expression. */
7007 /* A delete-expression may not appear in an integral constant
7008 expression. */
7013 tf_warning_or_error);
7014 }
7016 /* Returns true if TOKEN may start a cast-expression and false
7017 otherwise. */
7019 static bool
7021 {
7023 {
7062 /* '[' may start a primary-expression in obj-c++. */
7068 }
7069 }
7071 /* Parse a cast-expression.
7073 cast-expression:
7074 unary-expression
7075 ( type-id ) cast-expression
7077 ADDRESS_P is true iff the unary-expression is appearing as the
7078 operand of the `&' operator. CAST_P is true if this expression is
7079 the target of a cast.
7081 Returns a representation of the expression. */
7083 static tree
7086 {
7087 /* If it's a `(', then we might be looking at a cast. */
7089 {
7095 /* There's no way to know yet whether or not this is a cast.
7096 For example, `(int (3))' is a unary-expression, while `(int)
7097 3' is a cast. So, we resort to parsing tentatively. */
7099 /* Types may not be defined in a cast. */
7101 parser->type_definition_forbidden_message
7103 /* Consume the `('. */
7105 /* A very tricky bit is that `(struct S) { 3 }' is a
7106 compound-literal (which we permit in C++ as an extension).
7107 But, that construct is not a cast-expression -- it is a
7108 postfix-expression. (The reason is that `(struct S) { 3 }.i'
7109 is legal; if the compound-literal were a cast-expression,
7110 you'd need an extra set of parentheses.) But, if we parse
7111 the type-id, and it happens to be a class-specifier, then we
7112 will commit to the parse at that point, because we cannot
7113 undo the action that is done when creating a new class. So,
7114 then we cannot back up and do a postfix-expression.
7116 Therefore, we scan ahead to the closing `)', and check to see
7117 if the token after the `)' is a `{'. If so, we are not
7118 looking at a cast-expression.
7120 Save tokens so that we can put them back. */
7122 /* Skip tokens until the next token is a closing parenthesis.
7123 If we find the closing `)', and the next token is a `{', then
7124 we are looking at a compound-literal. */
7125 compound_literal_p
7129 /* Roll back the tokens we skipped. */
7131 /* If we were looking at a compound-literal, simulate an error
7132 so that the call to cp_parser_parse_definitely below will
7133 fail. */
7136 else
7137 {
7140 /* Look for the type-id. */
7142 /* Look for the closing `)'. */
7145 }
7147 /* Restore the saved message. */
7150 /* At this point this can only be either a cast or a
7151 parenthesized ctor such as `(T ())' that looks like a cast to
7152 function returning T. */
7156 {
7162 /* Warn about old-style casts, if so requested. */
7164 && !in_system_header
7169 /* Only type conversions to integral or enumeration types
7170 can be used in constant-expressions. */
7173 NIC_CAST))
7176 /* Perform the cast. */
7179 }
7180 else
7182 }
7184 /* If we get here, then it's not a cast, so it must be a
7185 unary-expression. */
7187 }
7189 /* Parse a binary expression of the general form:
7191 pm-expression:
7192 cast-expression
7193 pm-expression .* cast-expression
7194 pm-expression ->* cast-expression
7196 multiplicative-expression:
7197 pm-expression
7198 multiplicative-expression * pm-expression
7199 multiplicative-expression / pm-expression
7200 multiplicative-expression % pm-expression
7202 additive-expression:
7203 multiplicative-expression
7204 additive-expression + multiplicative-expression
7205 additive-expression - multiplicative-expression
7207 shift-expression:
7208 additive-expression
7209 shift-expression << additive-expression
7210 shift-expression >> additive-expression
7212 relational-expression:
7213 shift-expression
7214 relational-expression < shift-expression
7215 relational-expression > shift-expression
7216 relational-expression <= shift-expression
7217 relational-expression >= shift-expression
7219 GNU Extension:
7221 relational-expression:
7222 relational-expression <? shift-expression
7223 relational-expression >? shift-expression
7225 equality-expression:
7226 relational-expression
7227 equality-expression == relational-expression
7228 equality-expression != relational-expression
7230 and-expression:
7231 equality-expression
7232 and-expression & equality-expression
7234 exclusive-or-expression:
7235 and-expression
7236 exclusive-or-expression ^ and-expression
7238 inclusive-or-expression:
7239 exclusive-or-expression
7240 inclusive-or-expression | exclusive-or-expression
7242 logical-and-expression:
7243 inclusive-or-expression
7244 logical-and-expression && inclusive-or-expression
7246 logical-or-expression:
7247 logical-and-expression
7248 logical-or-expression || logical-and-expression
7250 All these are implemented with a single function like:
7252 binary-expression:
7253 simple-cast-expression
7254 binary-expression <token> binary-expression
7256 CAST_P is true if this expression is the target of a cast.
7258 The binops_by_token map is used to get the tree codes for each <token> type.
7259 binary-expressions are associated according to a precedence table. */
7261 #define TOKEN_PRECEDENCE(token) \
7262 (((token->type == CPP_GREATER \
7263 || ((cxx_dialect != cxx98) && token->type == CPP_RSHIFT)) \
7264 && !parser->greater_than_is_operator_p) \
7265 ? PREC_NOT_OPERATOR \
7266 : binops_by_token[token->type].prec)
7268 static tree
7273 {
7274 cp_parser_expression_stack stack;
7276 cp_parser_expression_stack_entry current;
7277 tree rhs;
7281 tree overload;
7283 /* Parse the first expression. */
7293 {
7294 /* Get an operator token. */
7300 {
7302 "%<>>%> operator is treated"
7306 }
7310 /* Popping an entry off the stack means we completed a subexpression:
7311 - either we found a token which is not an operator (`>' where it is not
7312 an operator, or prec == PREC_NOT_OPERATOR), in which case popping
7313 will happen repeatedly;
7314 - or, we found an operator which has lower priority. This is the case
7315 where the recursive descent *ascends*, as in `3 * 4 + 5' after
7316 parsing `3 * 4'. */
7318 {
7321 else
7323 }
7325 get_rhs:
7329 /* We used the operator token. */
7332 /* For "false && x" or "true || x", x will never be executed;
7333 disable warnings while evaluating it. */
7339 /* Extract another operand. It may be the RHS of this expression
7340 or the LHS of a new, higher priority expression. */
7344 /* Get another operator token. Look up its precedence to avoid
7345 building a useless (immediately popped) stack entry for common
7346 cases such as 3 + 4 + 5 or 3 * 4 + 5. */
7350 {
7351 /* ... and prepare to parse the RHS of the new, higher priority
7352 expression. Since precedence levels on the stack are
7353 monotonically increasing, we do not have to care about
7354 stack overflows. */
7363 pop:
7365 /* If the stack is not empty, we have parsed into LHS the right side
7366 (`4' in the example above) of an expression we had suspended.
7367 We can use the information on the stack to recover the LHS (`3')
7368 from the stack together with the tree code (`MULT_EXPR'), and
7369 the precedence of the higher level subexpression
7370 (`PREC_ADDITIVE_EXPRESSION'). TOKEN is the CPP_PLUS token,
7371 which will be used to actually build the additive expression. */
7376 }
7378 /* Undo the disabling of warnings done above. */
7385 /* ??? Currently we pass lhs_type == ERROR_MARK and rhs_type ==
7386 ERROR_MARK for everything that is not a binary expression.
7387 This makes warn_about_parentheses miss some warnings that
7388 involve unary operators. For unary expressions we should
7389 pass the correct tree_code unless the unary expression was
7390 surrounded by parentheses.
7391 */
7398 else
7402 tf_warning_or_error);
7405 /* If the binary operator required the use of an overloaded operator,
7406 then this expression cannot be an integral constant-expression.
7407 An overloaded operator can be used even if both operands are
7408 otherwise permissible in an integral constant-expression if at
7409 least one of the operands is of enumeration type. */
7413 NIC_OVERLOADED))
7415 }
7418 }
7421 /* Parse the `? expression : assignment-expression' part of a
7422 conditional-expression. The LOGICAL_OR_EXPR is the
7423 logical-or-expression that started the conditional-expression.
7424 Returns a representation of the entire conditional-expression.
7426 This routine is used by cp_parser_assignment_expression.
7428 ? expression : assignment-expression
7430 GNU Extensions:
7432 ? : assignment-expression */
7434 static tree
7436 {
7437 tree expr;
7438 tree assignment_expr;
7442 /* Consume the `?' token. */
7447 {
7450 /* Implicit true clause. */
7454 }
7455 else
7456 {
7459 /* Parse the expression. */
7462 c_inhibit_evaluation_warnings +=
7466 }
7468 /* The next token should be a `:'. */
7470 /* Parse the assignment-expression. */
7474 /* Build the conditional-expression. */
7476 expr,
7477 assignment_expr,
7478 tf_warning_or_error);
7479 }
7481 /* Parse an assignment-expression.
7483 assignment-expression:
7484 conditional-expression
7485 logical-or-expression assignment-operator assignment_expression
7486 throw-expression
7488 CAST_P is true if this expression is the target of a cast.
7490 Returns a representation for the expression. */
7492 static tree
7495 {
7496 tree expr;
7498 /* If the next token is the `throw' keyword, then we're looking at
7499 a throw-expression. */
7502 /* Otherwise, it must be that we are looking at a
7503 logical-or-expression. */
7504 else
7505 {
7506 /* Parse the binary expressions (logical-or-expression). */
7509 /* If the next token is a `?' then we're actually looking at a
7510 conditional-expression. */
7513 else
7514 {
7517 /* If it's an assignment-operator, we're using the second
7518 production. */
7519 enum tree_code assignment_operator
7522 {
7524 location_t saved_input_location;
7526 /* Parse the right-hand side of the assignment. */
7532 /* An assignment may not appear in a
7533 constant-expression. */
7535 NIC_ASSIGNMENT))
7537 /* Build the assignment expression. Its default
7538 location is the location of the '=' token. */
7542 assignment_operator,
7543 rhs,
7544 tf_warning_or_error);
7546 }
7547 }
7548 }
7551 }
7553 /* Parse an (optional) assignment-operator.
7555 assignment-operator: one of
7556 = *= /= %= += -= >>= <<= &= ^= |=
7558 GNU Extension:
7560 assignment-operator: one of
7561 <?= >?=
7563 If the next token is an assignment operator, the corresponding tree
7564 code is returned, and the token is consumed. For example, for
7565 `+=', PLUS_EXPR is returned. For `=' itself, the code returned is
7566 NOP_EXPR. For `/', TRUNC_DIV_EXPR is returned; for `%',
7567 TRUNC_MOD_EXPR is returned. If TOKEN is not an assignment
7568 operator, ERROR_MARK is returned. */
7570 static enum tree_code
7572 {
7576 /* Peek at the next token. */
7580 {
7626 /* Nothing else is an assignment operator. */
7628 }
7630 /* If it was an assignment operator, consume it. */
7635 }
7637 /* Parse an expression.
7639 expression:
7640 assignment-expression
7641 expression , assignment-expression
7643 CAST_P is true if this expression is the target of a cast.
7645 Returns a representation of the expression. */
7647 static tree
7649 {
7654 {
7655 tree assignment_expression;
7657 /* Parse the next assignment-expression. */
7658 assignment_expression
7660 /* If this is the first assignment-expression, we can just
7661 save it away. */
7664 else
7666 assignment_expression,
7667 tf_warning_or_error);
7668 /* If the next token is not a comma, then we are done with the
7669 expression. */
7672 /* Consume the `,'. */
7675 /* A comma operator cannot appear in a constant-expression. */
7678 }
7681 }
7683 /* Parse a constant-expression.
7685 constant-expression:
7686 conditional-expression
7688 If ALLOW_NON_CONSTANT_P a non-constant expression is silently
7689 accepted. If ALLOW_NON_CONSTANT_P is true and the expression is not
7690 constant, *NON_CONSTANT_P is set to TRUE. If ALLOW_NON_CONSTANT_P
7691 is false, NON_CONSTANT_P should be NULL. */
7693 static tree
7697 {
7701 tree expression;
7703 /* It might seem that we could simply parse the
7704 conditional-expression, and then check to see if it were
7705 TREE_CONSTANT. However, an expression that is TREE_CONSTANT is
7706 one that the compiler can figure out is constant, possibly after
7707 doing some simplifications or optimizations. The standard has a
7708 precise definition of constant-expression, and we must honor
7709 that, even though it is somewhat more restrictive.
7711 For example:
7713 int i[(2, 3)];
7715 is not a legal declaration, because `(2, 3)' is not a
7716 constant-expression. The `,' operator is forbidden in a
7717 constant-expression. However, GCC's constant-folding machinery
7718 will fold this operation to an INTEGER_CST for `3'. */
7720 /* Save the old settings. */
7722 saved_allow_non_integral_constant_expression_p
7725 /* We are now parsing a constant-expression. */
7727 parser->allow_non_integral_constant_expression_p
7730 /* Although the grammar says "conditional-expression", we parse an
7731 "assignment-expression", which also permits "throw-expression"
7732 and the use of assignment operators. In the case that
7733 ALLOW_NON_CONSTANT_P is false, we get better errors than we would
7734 otherwise. In the case that ALLOW_NON_CONSTANT_P is true, it is
7735 actually essential that we look for an assignment-expression.
7736 For example, cp_parser_initializer_clauses uses this function to
7737 determine whether a particular assignment-expression is in fact
7738 constant. */
7740 /* Restore the old settings. */
7741 parser->integral_constant_expression_p
7743 parser->allow_non_integral_constant_expression_p
7746 {
7747 /* Require an rvalue constant expression here; that's what our
7748 callers expect. Reference constant expressions are handled
7749 separately in e.g. cp_parser_template_argument. */
7754 }
7757 parser->non_integral_constant_expression_p
7761 }
7763 /* Parse __builtin_offsetof.
7765 offsetof-expression:
7766 "__builtin_offsetof" "(" type-id "," offsetof-member-designator ")"
7768 offsetof-member-designator:
7769 id-expression
7770 | offsetof-member-designator "." id-expression
7771 | offsetof-member-designator "[" expression "]"
7772 | offsetof-member-designator "->" id-expression */
7774 static tree
7776 {
7779 cp_id_kind dummy;
7782 /* We're about to accept non-integral-constant things, but will
7783 definitely yield an integral constant expression. Save and
7784 restore these values around our local parsing. */
7788 /* Consume the "__builtin_offsetof" token. */
7790 /* Consume the opening `('. */
7792 /* Parse the type-id. */
7794 /* Look for the `,'. */
7798 /* Build the (type *)null that begins the traditional offsetof macro. */
7800 tf_warning_or_error);
7802 /* Parse the offsetof-member-designator. We begin as if we saw "expr->". */
7806 {
7809 {
7811 /* offsetof-member-designator "[" expression "]" */
7816 /* offsetof-member-designator "->" identifier */
7818 /* FALLTHRU */
7821 /* offsetof-member-designator "." identifier */
7829 /* Consume the ")" token. */
7834 /* Error. We know the following require will fail, but
7835 that gives the proper error message. */
7840 }
7841 }
7843 success:
7844 /* If we're processing a template, we can't finish the semantics yet.
7845 Otherwise we can fold the entire expression now. */
7848 else
7851 failure:
7856 }
7858 /* Parse a trait expression.
7860 Returns a representation of the expression, the underlying type
7861 of the type at issue when KEYWORD is RID_UNDERLYING_TYPE. */
7863 static tree
7865 {
7866 cp_trait_kind kind;
7869 cp_decl_specifier_seq decl_specs;
7872 {
7949 }
7951 /* Consume the token. */
7961 /* Build a trivial decl-specifier-seq. */
7965 /* Call grokdeclarator to figure out what type this is. */
7970 {
7978 /* Build a trivial decl-specifier-seq. */
7982 /* Call grokdeclarator to figure out what type this is. */
7985 }
7989 /* Complete the trait expression, which may mean either processing
7990 the trait expr now or saving it for template instantiation. */
7992 {
8001 }
8002 }
8004 /* Lambdas that appear in variable initializer or default argument scope
8005 get that in their mangling, so we need to record it. We might as well
8006 use the count for function and namespace scopes as well. */
8010 {
8011 tree t;
8018 static void
8020 {
8021 tree_int ti;
8023 /* Once we're inside a function, we ignore other scopes and just push
8024 the function again so that popping works properly. */
8031 {
8032 /* Don't reset the count if we're still in the same function. */
8035 }
8036 }
8038 static void
8040 {
8043 }
8045 static void
8047 {
8050 {
8053 }
8055 }
8057 /* Parse a lambda expression.
8059 lambda-expression:
8060 lambda-introducer lambda-declarator [opt] compound-statement
8062 Returns a representation of the expression. */
8064 static tree
8066 {
8068 tree type;
8078 /* We may be in the middle of deferred access check. Disable
8079 it now. */
8090 /* Do this again now that LAMBDA_EXPR_EXTRA_SCOPE is set. */
8093 /* Now that we've started the type, add the capture fields for any
8094 explicit captures. */
8097 {
8098 /* Inside the class, surrounding template-parameter-lists do not apply. */
8099 unsigned int saved_num_template_parameter_lists
8108 /* By virtue of defining a local class, a lambda expression has access to
8109 the private variables of enclosing classes. */
8118 /* The capture list was built up in reverse order; fix that now. */
8119 {
8125 {
8129 }
8131 }
8141 }
8145 /* This field is only used during parsing of the lambda. */
8148 /* This lambda shouldn't have any proxies left at this point. */
8150 /* And now that we're done, push proxies for an enclosing lambda. */
8155 else
8157 }
8159 /* Parse the beginning of a lambda expression.
8161 lambda-introducer:
8162 [ lambda-capture [opt] ]
8164 LAMBDA_EXPR is the current representation of the lambda expression. */
8166 static void
8168 {
8169 /* Need commas after the first capture. */
8172 /* Eat the leading `['. */
8175 /* Record default capture mode. "[&" "[=" "[&," "[=," */
8183 {
8186 }
8189 {
8191 tree capture_id;
8192 tree capture_init_expr;
8196 enum capture_kind_type
8197 {
8198 BY_COPY,
8199 BY_REFERENCE
8200 };
8204 {
8207 }
8211 else
8214 /* Possibly capture `this'. */
8216 {
8226 explicit_init_p);
8228 }
8230 /* Remember whether we want to capture as a reference or not. */
8232 {
8235 }
8237 /* Get the identifier. */
8242 /* Would be nice to have a cp_parser_skip_to_closing_x for general
8243 delimiters, but I modified this to stop on unnested ']' as well. It
8244 was already changed to stop on unnested '}', so the
8245 "closing_parenthesis" name is no more misleading with my change. */
8246 {
8252 }
8254 /* Find the initializer for this capture. */
8256 {
8257 /* An explicit expression exists. */
8260 "ISO C++ does not allow initializers "
8266 }
8267 else
8268 {
8271 /* Turn the identifier into an id-expression. */
8272 capture_init_expr
8273 = cp_parser_lookup_name
8275 capture_id,
8276 none_type,
8284 {
8287 }
8291 {
8294 capture_init_expr);
8297 }
8300 {
8303 capture_init_expr);
8306 }
8308 capture_init_expr
8309 = finish_id_expression
8311 capture_init_expr,
8323 }
8327 {
8332 capture_id);
8336 "capture of %qD redundant with by-reference capture "
8338 }
8341 capture_id,
8342 capture_init_expr,
8344 explicit_init_p);
8345 }
8348 }
8350 /* Parse the (optional) middle of a lambda expression.
8352 lambda-declarator:
8353 ( parameter-declaration-clause [opt] )
8354 attribute-specifier [opt]
8355 mutable [opt]
8356 exception-specification [opt]
8357 lambda-return-type-clause [opt]
8359 LAMBDA_EXPR is the current representation of the lambda expression. */
8361 static bool
8363 {
8364 /* 5.1.1.4 of the standard says:
8365 If a lambda-expression does not include a lambda-declarator, it is as if
8366 the lambda-declarator were ().
8367 This means an empty parameter list, no attributes, and no exception
8368 specification. */
8372 tree t;
8374 /* The lambda-declarator is optional, but must begin with an opening
8375 parenthesis if present. */
8377 {
8382 /* Parse parameters. */
8385 /* Default arguments shall not be specified in the
8386 parameter-declaration-clause of a lambda-declarator. */
8396 /* Parse optional `mutable' keyword. */
8398 {
8401 }
8403 /* Parse optional exception specification. */
8406 /* Parse optional trailing return type. */
8408 {
8411 }
8413 /* The function parameters must be in scope all the way until after the
8414 trailing-return-type in case of decltype. */
8419 }
8421 /* Create the function call operator.
8423 Messing with declarators like this is no uglier than building up the
8424 FUNCTION_DECL by hand, and this is less likely to get out of sync with
8425 other code. */
8426 {
8427 cp_decl_specifier_seq return_type_specs;
8429 tree fco;
8436 else
8437 /* Maybe we will deduce the return type later. */
8443 sfk_none);
8448 VIRT_SPEC_UNSPECIFIED,
8449 exception_spec,
8454 declarator,
8455 attributes);
8457 {
8460 /* Give the object parameter a different name. */
8462 }
8469 }
8470 }
8472 /* Parse the body of a lambda expression, which is simply
8474 compound-statement
8476 but which requires special handling.
8477 LAMBDA_EXPR is the current representation of the lambda expression. */
8479 static void
8481 {
8486 else
8487 /* Still increment function_depth so that we don't GC in the
8488 middle of an expression. */
8490 /* Clear this in case we're in the middle of a default argument. */
8493 /* Finish the function call operator
8494 - class_specifier
8495 + late_parsing_for_member
8496 + function_definition_after_declarator
8497 + ctor_initializer_opt_and_function_body */
8498 {
8500 tree body;
8502 tree compound_stmt;
8503 tree cap;
8505 /* Let the front end know that we are going to be defining this
8506 function. */
8508 NULL_TREE,
8517 /* Push the proxies for any explicit captures. */
8524 /* 5.1.1.4 of the standard says:
8525 If a lambda-expression does not include a trailing-return-type, it
8526 is as if the trailing-return-type denotes the following type:
8527 * if the compound-statement is of the form
8528 { return attribute-specifier [opt] expression ; }
8529 the type of the returned expression after lvalue-to-rvalue
8530 conversion (_conv.lval_ 4.1), array-to-pointer conversion
8531 (_conv.array_ 4.2), and function-to-pointer conversion
8532 (_conv.func_ 4.3);
8533 * otherwise, void. */
8535 /* In a lambda that has neither a lambda-return-type-clause
8536 nor a deducible form, errors should be reported for return statements
8537 in the body. Since we used void as the placeholder return type, parsing
8538 the body as usual will give such desired behavior. */
8542 {
8546 /* Parse tentatively in case there's more after the initial return
8547 statement. */
8558 {
8562 /* Will get error here if type not deduced yet. */
8566 }
8567 }
8570 {
8575 }
8579 out:
8583 /* Finish the function and generate code for it if necessary. */
8585 }
8590 else
8592 }
8594 /* Statements [gram.stmt.stmt] */
8596 /* Parse a statement.
8598 statement:
8599 labeled-statement
8600 expression-statement
8601 compound-statement
8602 selection-statement
8603 iteration-statement
8604 jump-statement
8605 declaration-statement
8606 try-block
8608 TM Extension:
8610 statement:
8611 atomic-statement
8613 IN_COMPOUND is true when the statement is nested inside a
8614 cp_parser_compound_statement; this matters for certain pragmas.
8616 If IF_P is not NULL, *IF_P is set to indicate whether the statement
8617 is a (possibly labeled) if statement which is not enclosed in braces
8618 and has an else clause. This is used to implement -Wparentheses. */
8620 static void
8623 {
8624 tree statement;
8626 location_t statement_location;
8628 restart:
8631 /* There is no statement yet. */
8633 /* Peek at the next token. */
8635 /* Remember the location of the first token in the statement. */
8637 /* If this is a keyword, then that will often determine what kind of
8638 statement we have. */
8640 {
8644 {
8647 /* Looks like a labeled-statement with a case label.
8648 Parse the label, and then use tail recursion to parse
8649 the statement. */
8671 /* Objective-C++ exception-handling constructs. */
8685 /* This must be a namespace alias definition. */
8698 /* It might be a keyword like `int' that can start a
8699 declaration-statement. */
8701 }
8702 }
8704 {
8705 /* If the next token is a `:', then we are looking at a
8706 labeled-statement. */
8709 {
8710 /* Looks like a labeled-statement with an ordinary label.
8711 Parse the label, and then use tail recursion to parse
8712 the statement. */
8715 }
8716 }
8717 /* Anything that starts with a `{' must be a compound-statement. */
8720 /* CPP_PRAGMA is a #pragma inside a function body, which constitutes
8721 a statement all its own. */
8723 {
8724 /* Only certain OpenMP pragmas are attached to statements, and thus
8725 are considered statements themselves. All others are not. In
8726 the context of a compound, accept the pragma as a "statement" and
8727 return so that we can check for a close brace. Otherwise we
8728 require a real statement and must go back and read one. */
8734 }
8736 {
8739 }
8741 /* Everything else must be a declaration-statement or an
8742 expression-statement. Try for the declaration-statement
8743 first, unless we are looking at a `;', in which case we know that
8744 we have an expression-statement. */
8746 {
8748 {
8750 /* Try to parse the declaration-statement. */
8752 /* If that worked, we're done. */
8755 }
8756 /* Look for an expression-statement instead. */
8758 }
8760 /* Set the line number for the statement. */
8763 }
8765 /* Parse the label for a labeled-statement, i.e.
8767 identifier :
8768 case constant-expression :
8769 default :
8771 GNU Extension:
8772 case constant-expression ... constant-expression : statement
8774 When a label is parsed without errors, the label is added to the
8775 parse tree by the finish_* functions, so this function doesn't
8776 have to return the label. */
8778 static void
8780 {
8785 /* The next token should be an identifier. */
8789 {
8792 }
8796 {
8798 {
8802 /* Consume the `case' token. */
8804 /* Parse the constant-expression. */
8807 NULL);
8811 {
8812 /* Consume the `...' token. */
8814 expr_hi =
8817 NULL);
8818 /* We don't need to emit warnings here, as the common code
8819 will do this for us. */
8820 }
8821 else
8826 else
8829 expr);
8830 }
8834 /* Consume the `default' token. */
8839 else
8844 /* Anything else must be an ordinary label. */
8847 }
8849 /* Require the `:' token. */
8852 /* An ordinary label may optionally be followed by attributes.
8853 However, this is only permitted if the attributes are then
8854 followed by a semicolon. This is because, for backward
8855 compatibility, when parsing
8856 lab: __attribute__ ((unused)) int i;
8857 we want the attribute to attach to "i", not "lab". */
8860 {
8861 tree attrs;
8869 ;
8870 else
8872 }
8875 }
8877 /* Parse an expression-statement.
8879 expression-statement:
8880 expression [opt] ;
8882 Returns the new EXPR_STMT -- or NULL_TREE if the expression
8883 statement consists of nothing more than an `;'. IN_STATEMENT_EXPR_P
8884 indicates whether this expression-statement is part of an
8885 expression statement. */
8887 static tree
8889 {
8893 /* If the next token is a ';', then there is no expression
8894 statement. */
8898 /* Give a helpful message for "A<T>::type t;" and the like. */
8901 {
8908 {
8909 /* A::A a; */
8914 }
8915 }
8917 /* Consume the final `;'. */
8922 /* This is the final expression statement of a statement
8923 expression. */
8927 else
8931 }
8933 /* Parse a compound-statement.
8935 compound-statement:
8936 { statement-seq [opt] }
8938 GNU extension:
8940 compound-statement:
8941 { label-declaration-seq [opt] statement-seq [opt] }
8943 label-declaration-seq:
8944 label-declaration
8945 label-declaration-seq label-declaration
8947 Returns a tree representing the statement. */
8949 static tree
8952 {
8953 tree compound_stmt;
8955 /* Consume the `{'. */
8962 /* Begin the compound-statement. */
8964 /* If the next keyword is `__label__' we have a label declaration. */
8967 /* Parse an (optional) statement-seq. */
8969 /* Finish the compound-statement. */
8971 /* Consume the `}'. */
8975 }
8977 /* Parse an (optional) statement-seq.
8979 statement-seq:
8980 statement
8981 statement-seq [opt] statement */
8983 static void
8985 {
8986 /* Scan statements until there aren't any more. */
8988 {
8991 /* If we are looking at a `}', then we have run out of
8992 statements; the same is true if we have reached the end
8993 of file, or have stumbled upon a stray '@end'. */
9000 /* If we are in a compound statement and find 'else' then
9001 something went wrong. */
9003 {
9006 else
9007 {
9010 }
9011 }
9013 /* Parse the statement. */
9015 }
9016 }
9018 /* Parse a selection-statement.
9020 selection-statement:
9021 if ( condition ) statement
9022 if ( condition ) statement else statement
9023 switch ( condition ) statement
9025 Returns the new IF_STMT or SWITCH_STMT.
9027 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9028 is a (possibly labeled) if statement which is not enclosed in
9029 braces and has an else clause. This is used to implement
9030 -Wparentheses. */
9032 static tree
9034 {
9041 /* Peek at the next token. */
9044 /* See what kind of keyword it is. */
9047 {
9050 {
9051 tree statement;
9052 tree condition;
9054 /* Look for the `('. */
9056 {
9059 }
9061 /* Begin the selection-statement. */
9064 else
9067 /* Parse the condition. */
9069 /* Look for the `)'. */
9075 {
9079 /* Add the condition. */
9082 /* Parse the then-clause. */
9086 {
9094 }
9095 else
9101 /* If the next token is `else', parse the else-clause. */
9103 RID_ELSE))
9104 {
9105 /* Consume the `else' keyword. */
9108 /* Parse the else-clause. */
9110 {
9111 location_t loc;
9118 }
9119 else
9124 /* If we are currently parsing a then-clause, then
9125 IF_P will not be NULL. We set it to true to
9126 indicate that this if statement has an else clause.
9127 This may trigger the Wparentheses warning below
9128 when we get back up to the parent if statement. */
9131 }
9132 else
9133 {
9134 /* This if statement does not have an else clause. If
9135 NESTED_IF is true, then the then-clause is an if
9136 statement which does have an else clause. We warn
9137 about the potential ambiguity. */
9140 "suggest explicit braces to avoid ambiguous"
9142 }
9144 /* Now we're all done with the if-statement. */
9146 }
9147 else
9148 {
9152 /* Add the condition. */
9155 /* Parse the body of the switch-statement. */
9164 /* Now we're all done with the switch-statement. */
9166 }
9169 }
9175 }
9176 }
9178 /* Parse a condition.
9180 condition:
9181 expression
9182 type-specifier-seq declarator = initializer-clause
9183 type-specifier-seq declarator braced-init-list
9185 GNU Extension:
9187 condition:
9188 type-specifier-seq declarator asm-specification [opt]
9189 attributes [opt] = assignment-expression
9191 Returns the expression that should be tested. */
9193 static tree
9195 {
9196 cp_decl_specifier_seq type_specifiers;
9200 /* Try the declaration first. */
9202 /* New types are not allowed in the type-specifier-seq for a
9203 condition. */
9205 parser->type_definition_forbidden_message
9207 /* Parse the type-specifier-seq. */
9209 CP_PARSER_FLAGS_ONLY_TYPE_OR_CONSTEXPR,
9212 /* Restore the saved message. */
9214 /* If all is well, we might be looking at a declaration. */
9216 {
9217 tree decl;
9218 tree asm_specification;
9219 tree attributes;
9223 /* Parse the declarator. */
9228 /* Parse the attributes. */
9230 /* Parse the asm-specification. */
9232 /* If the next token is not an `=' or '{', then we might still be
9233 looking at an expression. For example:
9235 if (A(a).x)
9237 looks like a decl-specifier-seq and a declarator -- but then
9238 there is no `=', so this is an expression. */
9243 /* If we did see an `=' or '{', then we are looking at a declaration
9244 for sure. */
9246 {
9247 tree pushed_scope;
9251 /* Create the declaration. */
9257 /* Parse the initializer. */
9259 {
9263 }
9264 else
9265 {
9266 /* Consume the `='. */
9269 }
9273 /* Process the initializer. */
9276 asm_specification,
9277 flags);
9283 }
9284 }
9285 /* If we didn't even get past the declarator successfully, we are
9286 definitely not looking at a declaration. */
9287 else
9290 /* Otherwise, we are looking at an expression. */
9292 }
9294 /* Parses a for-statement or range-for-statement until the closing ')',
9295 not included. */
9297 static tree
9299 {
9303 /* Begin the for-statement. */
9306 /* Parse the initialization. */
9311 else
9313 }
9315 static tree
9317 {
9318 /* Normal for loop */
9321 tree stmt;
9324 /* The for-init-statement has already been parsed in
9325 cp_parser_for_init_statement, so no work is needed here. */
9328 /* If there's a condition, process it. */
9332 /* Look for the `;'. */
9335 /* If there's an expression, process it. */
9341 }
9343 /* Tries to parse a range-based for-statement:
9345 range-based-for:
9346 decl-specifier-seq declarator : expression
9348 The decl-specifier-seq declarator and the `:' are already parsed by
9349 cp_parser_for_init_statement. If processing_template_decl it returns a
9350 newly created RANGE_FOR_STMT; if not, it is converted to a
9351 regular FOR_STMT. */
9353 static tree
9355 {
9359 {
9362 }
9363 else
9366 /* If in template, STMT is converted to a normal for-statement
9367 at instantiation. If not, it is done just ahead. */
9369 {
9375 /* do_auto_deduction doesn't mess with template init-lists. */
9378 }
9379 else
9380 {
9383 }
9385 }
9387 /* Subroutine of cp_convert_range_for: given the initializer expression,
9388 builds up the range temporary. */
9390 static tree
9392 {
9395 /* Find out the type deduced by the declaration
9396 `auto &&__range = range_expr'. */
9401 /* Create the __range variable. */
9408 }
9410 /* Used by cp_parser_range_for in template context: we aren't going to
9411 do a full conversion yet, but we still need to resolve auto in the
9412 type of the for-range-declaration if present. This is basically
9413 a shortcut version of cp_convert_range_for. */
9415 static void
9417 {
9420 {
9423 iter_type = (cp_parser_perform_range_for_lookup
9427 tf_warning_or_error);
9430 }
9431 }
9433 /* Converts a range-based for-statement into a normal
9434 for-statement, as per the definition.
9436 for (RANGE_DECL : RANGE_EXPR)
9437 BLOCK
9439 should be equivalent to:
9441 {
9442 auto &&__range = RANGE_EXPR;
9443 for (auto __begin = BEGIN_EXPR, end = END_EXPR;
9444 __begin != __end;
9445 ++__begin)
9446 {
9447 RANGE_DECL = *__begin;
9448 BLOCK
9449 }
9450 }
9452 If RANGE_EXPR is an array:
9453 BEGIN_EXPR = __range
9454 END_EXPR = __range + ARRAY_SIZE(__range)
9455 Else if RANGE_EXPR has a member 'begin' or 'end':
9456 BEGIN_EXPR = __range.begin()
9457 END_EXPR = __range.end()
9458 Else:
9459 BEGIN_EXPR = begin(__range)
9460 END_EXPR = end(__range);
9462 If __range has a member 'begin' but not 'end', or vice versa, we must
9463 still use the second alternative (it will surely fail, however).
9464 When calling begin()/end() in the third alternative we must use
9465 argument dependent lookup, but always considering 'std' as an associated
9466 namespace. */
9468 tree
9470 {
9476 /* If an error happened previously do nothing or else a lot of
9477 unhelpful errors would be issued. */
9479 else
9480 {
9485 LOOKUP_ONLYCONVERTING);
9490 }
9492 /* The new for initialization statement. */
9500 LOOKUP_ONLYCONVERTING);
9509 LOOKUP_ONLYCONVERTING);
9513 /* The new for condition. */
9520 /* The new increment expression. */
9525 /* The declaration is initialized with *__begin inside the loop body. */
9528 tf_warning_or_error),
9530 LOOKUP_ONLYCONVERTING);
9533 }
9535 /* Solves BEGIN_EXPR and END_EXPR as described in cp_convert_range_for.
9536 We need to solve both at the same time because the method used
9537 depends on the existence of members begin or end.
9538 Returns the type deduced for the iterator expression. */
9540 static tree
9542 {
9544 {
9547 }
9550 {
9555 }
9557 {
9558 /* If RANGE is an array, we will use pointer arithmetic. */
9561 range,
9565 }
9566 else
9567 {
9568 /* If it is not an array, we must do a bit of magic. */
9578 tf_warning_or_error);
9581 tf_warning_or_error);
9584 {
9585 /* Use the member functions. */
9588 else
9594 else
9597 }
9598 else
9599 {
9600 /* Use global functions with ADL. */
9608 tf_warning_or_error);
9610 tf_warning_or_error);
9613 tf_warning_or_error);
9615 tf_warning_or_error);
9618 }
9620 /* Last common checks. */
9622 {
9623 /* If one of the expressions is an error do no more checks. */
9626 }
9627 else
9628 {
9630 /* The unqualified type of the __begin and __end temporaries should
9631 be the same, as required by the multiple auto declaration. */
9637 }
9638 }
9639 }
9641 /* Helper function for cp_parser_perform_range_for_lookup.
9642 Builds a tree for RANGE.IDENTIFIER(). */
9644 static tree
9646 {
9659 tf_warning_or_error);
9662 }
9664 /* Parse an iteration-statement.
9666 iteration-statement:
9667 while ( condition ) statement
9668 do statement while ( expression ) ;
9669 for ( for-init-statement condition [opt] ; expression [opt] )
9670 statement
9672 Returns the new WHILE_STMT, DO_STMT, FOR_STMT or RANGE_FOR_STMT. */
9674 static tree
9676 {
9679 tree statement;
9682 /* Peek at the next token. */
9687 /* Remember whether or not we are already within an iteration
9688 statement. */
9691 /* See what kind of keyword it is. */
9694 {
9696 {
9697 tree condition;
9699 /* Begin the while-statement. */
9701 /* Look for the `('. */
9703 /* Parse the condition. */
9706 /* Look for the `)'. */
9708 /* Parse the dependent statement. */
9712 /* We're done with the while-statement. */
9714 }
9718 {
9719 tree expression;
9721 /* Begin the do-statement. */
9723 /* Parse the body of the do-statement. */
9728 /* Look for the `while' keyword. */
9730 /* Look for the `('. */
9732 /* Parse the expression. */
9734 /* We're done with the do-statement. */
9736 /* Look for the `)'. */
9738 /* Look for the `;'. */
9740 }
9744 {
9745 /* Look for the `('. */
9750 /* Look for the `)'. */
9753 /* Parse the body of the for-statement. */
9758 /* We're done with the for-statement. */
9760 }
9767 }
9770 }
9772 /* Parse a for-init-statement or the declarator of a range-based-for.
9773 Returns true if a range-based-for declaration is seen.
9775 for-init-statement:
9776 expression-statement
9777 simple-declaration */
9779 static bool
9781 {
9782 /* If the next token is a `;', then we have an empty
9783 expression-statement. Grammatically, this is also a
9784 simple-declaration, but an invalid one, because it does not
9785 declare anything. Therefore, if we did not handle this case
9786 specially, we would issue an error message about an invalid
9787 declaration. */
9789 {
9795 /* We're going to speculatively look for a declaration, falling back
9796 to an expression, if necessary. */
9798 /* Parse the declaration. */
9801 decl);
9804 {
9805 /* It is a range-for, consume the ':' */
9809 {
9811 "range-based %<for%> loops are not allowed "
9814 }
9815 }
9816 else
9817 /* The ';' is not consumed yet because we told
9818 cp_parser_simple_declaration not to. */
9823 /* If the tentative parse failed, then we shall need to look for an
9824 expression-statement. */
9825 }
9826 /* If we are here, it is an expression-statement. */
9829 }
9831 /* Parse a jump-statement.
9833 jump-statement:
9834 break ;
9835 continue ;
9836 return expression [opt] ;
9837 return braced-init-list ;
9838 goto identifier ;
9840 GNU extension:
9842 jump-statement:
9843 goto * expression ;
9845 Returns the new BREAK_STMT, CONTINUE_STMT, RETURN_EXPR, or GOTO_EXPR. */
9847 static tree
9849 {
9855 /* Peek at the next token. */
9860 /* See what kind of keyword it is. */
9863 {
9867 {
9882 }
9888 {
9901 }
9906 {
9907 tree expr;
9911 {
9914 }
9917 else
9918 /* If the next token is a `;', then there is no
9919 expression. */
9921 /* Build the return-statement. */
9923 /* Look for the final `;'. */
9925 }
9929 /* Create the goto-statement. */
9931 {
9932 /* Issue a warning about this use of a GNU extension. */
9934 /* Consume the '*' token. */
9936 /* Parse the dependent expression. */
9938 }
9939 else
9941 /* Look for the final `;'. */
9948 }
9951 }
9953 /* Parse a declaration-statement.
9955 declaration-statement:
9956 block-declaration */
9958 static void
9960 {
9963 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
9966 /* Parse the block-declaration. */
9969 /* Free any declarators allocated. */
9972 /* Finish off the statement. */
9974 }
9976 /* Some dependent statements (like `if (cond) statement'), are
9977 implicitly in their own scope. In other words, if the statement is
9978 a single statement (as opposed to a compound-statement), it is
9979 none-the-less treated as if it were enclosed in braces. Any
9980 declarations appearing in the dependent statement are out of scope
9981 after control passes that point. This function parses a statement,
9982 but ensures that is in its own scope, even if it is not a
9983 compound-statement.
9985 If IF_P is not NULL, *IF_P is set to indicate whether the statement
9986 is a (possibly labeled) if statement which is not enclosed in
9987 braces and has an else clause. This is used to implement
9988 -Wparentheses.
9990 Returns the new statement. */
9992 static tree
9994 {
9995 tree statement;
10000 /* Mark if () ; with a special NOP_EXPR. */
10002 {
10006 }
10007 /* if a compound is opened, we simply parse the statement directly. */
10010 /* If the token is not a `{', then we must take special action. */
10011 else
10012 {
10013 /* Create a compound-statement. */
10015 /* Parse the dependent-statement. */
10017 /* Finish the dummy compound-statement. */
10019 }
10021 /* Return the statement. */
10023 }
10025 /* For some dependent statements (like `while (cond) statement'), we
10026 have already created a scope. Therefore, even if the dependent
10027 statement is a compound-statement, we do not want to create another
10028 scope. */
10030 static void
10032 {
10033 /* If the token is a `{', then we must take special action. */
10036 else
10037 {
10038 /* Avoid calling cp_parser_compound_statement, so that we
10039 don't create a new scope. Do everything else by hand. */
10041 /* If the next keyword is `__label__' we have a label declaration. */
10044 /* Parse an (optional) statement-seq. */
10047 }
10048 }
10050 /* Declarations [gram.dcl.dcl] */
10052 /* Parse an optional declaration-sequence.
10054 declaration-seq:
10055 declaration
10056 declaration-seq declaration */
10058 static void
10060 {
10062 {
10073 {
10074 /* A declaration consisting of a single semicolon is
10075 invalid. Allow it unless we're being pedantic. */
10080 }
10082 /* If we're entering or exiting a region that's implicitly
10083 extern "C", modify the lang context appropriately. */
10085 {
10088 }
10090 {
10093 }
10096 {
10097 /* A top-level declaration can consist solely of a #pragma.
10098 A nested declaration cannot, so this is done here and not
10099 in cp_parser_declaration. (A #pragma at block scope is
10100 handled in cp_parser_statement.) */
10103 }
10105 /* Parse the declaration itself. */
10107 }
10108 }
10110 /* Parse a declaration.
10112 declaration:
10113 block-declaration
10114 function-definition
10115 template-declaration
10116 explicit-instantiation
10117 explicit-specialization
10118 linkage-specification
10119 namespace-definition
10121 GNU extension:
10123 declaration:
10124 __extension__ declaration */
10126 static void
10128 {
10129 cp_token token1;
10130 cp_token token2;
10135 /* Check for the `__extension__' keyword. */
10137 {
10138 /* Parse the qualified declaration. */
10140 /* Restore the PEDANTIC flag. */
10144 }
10146 /* Try to figure out what kind of declaration is present. */
10151 else
10152 {
10155 }
10157 /* Get the high-water mark for the DECLARATOR_OBSTACK. */
10160 /* If the next token is `extern' and the following token is a string
10161 literal, then we have a linkage specification. */
10165 /* If the next token is `template', then we have either a template
10166 declaration, an explicit instantiation, or an explicit
10167 specialization. */
10169 {
10170 /* `template <>' indicates a template specialization. */
10174 /* `template <' indicates a template declaration. */
10177 /* Anything else must be an explicit instantiation. */
10178 else
10180 }
10181 /* If the next token is `export', then we have a template
10182 declaration. */
10185 /* If the next token is `extern', 'static' or 'inline' and the one
10186 after that is `template', we have a GNU extended explicit
10187 instantiation directive. */
10194 /* If the next token is `namespace', check for a named or unnamed
10195 namespace definition. */
10201 /* An unnamed namespace definition. */
10205 /* An inline (associated) namespace definition. */
10209 /* Objective-C++ declaration/definition. */
10216 /* We must have either a block declaration or a function
10217 definition. */
10218 else
10219 /* Try to parse a block-declaration, or a function-definition. */
10222 /* Free any declarators allocated. */
10224 }
10226 /* Parse a block-declaration.
10228 block-declaration:
10229 simple-declaration
10230 asm-definition
10231 namespace-alias-definition
10232 using-declaration
10233 using-directive
10235 GNU Extension:
10237 block-declaration:
10238 __extension__ block-declaration
10240 C++0x Extension:
10242 block-declaration:
10243 static_assert-declaration
10245 If STATEMENT_P is TRUE, then this block-declaration is occurring as
10246 part of a declaration-statement. */
10248 static void
10251 {
10255 /* Check for the `__extension__' keyword. */
10257 {
10258 /* Parse the qualified declaration. */
10260 /* Restore the PEDANTIC flag. */
10264 }
10266 /* Peek at the next token to figure out which kind of declaration is
10267 present. */
10270 /* If the next keyword is `asm', we have an asm-definition. */
10272 {
10276 }
10277 /* If the next keyword is `namespace', we have a
10278 namespace-alias-definition. */
10281 /* If the next keyword is `using', we have a
10282 using-declaration, a using-directive, or an alias-declaration. */
10284 {
10289 /* If the token after `using' is `namespace', then we have a
10290 using-directive. */
10294 /* If the second token after 'using' is '=', then we have an
10295 alias-declaration. */
10302 /* Otherwise, it's a using-declaration. */
10303 else
10306 }
10307 /* If the next keyword is `__label__' we have a misplaced label
10308 declaration. */
10310 {
10314 /* If the next token is now a `;', consume it. */
10317 }
10318 /* If the next token is `static_assert' we have a static assertion. */
10321 /* Anything else must be a simple-declaration. */
10322 else
10325 }
10327 /* Parse a simple-declaration.
10329 simple-declaration:
10330 decl-specifier-seq [opt] init-declarator-list [opt] ;
10332 init-declarator-list:
10333 init-declarator
10334 init-declarator-list , init-declarator
10336 If FUNCTION_DEFINITION_ALLOWED_P is TRUE, then we also recognize a
10337 function-definition as a simple-declaration.
10339 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
10340 parsed declaration if it is an uninitialized single declarator not followed
10341 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
10342 if present, will not be consumed. */
10344 static void
10348 {
10349 cp_decl_specifier_seq decl_specifiers;
10356 /* Defer access checks until we know what is being declared; the
10357 checks for names appearing in the decl-specifier-seq should be
10358 done as if we were in the scope of the thing being declared. */
10361 /* Parse the decl-specifier-seq. We have to keep track of whether
10362 or not the decl-specifier-seq declares a named class or
10363 enumeration type, since that is the only case in which the
10364 init-declarator-list is allowed to be empty.
10366 [dcl.dcl]
10368 In a simple-declaration, the optional init-declarator-list can be
10369 omitted only when declaring a class or enumeration, that is when
10370 the decl-specifier-seq contains either a class-specifier, an
10371 elaborated-type-specifier, or an enum-specifier. */
10373 CP_PARSER_FLAGS_OPTIONAL,
10376 /* We no longer need to defer access checks. */
10379 /* In a block scope, a valid declaration must always have a
10380 decl-specifier-seq. By not trying to parse declarators, we can
10381 resolve the declaration/expression ambiguity more quickly. */
10384 {
10387 }
10389 /* If the next two tokens are both identifiers, the code is
10390 erroneous. The usual cause of this situation is code like:
10392 T t;
10394 where "T" should name a type -- but does not. */
10397 {
10398 /* If parsing tentatively, we should commit; we really are
10399 looking at a declaration. */
10401 /* Give up. */
10403 }
10405 /* If we have seen at least one decl-specifier, and the next token
10406 is not a parenthesis, then we must be looking at a declaration.
10407 (After "int (" we might be looking at a functional cast.) */
10414 /* Keep going until we hit the `;' at the end of the simple
10415 declaration. */
10418 CPP_SEMICOLON))
10419 {
10422 tree decl;
10425 {
10426 /* If we are processing next declarator, coma is expected */
10432 }
10433 else
10436 /* Parse the init-declarator. */
10439 function_definition_allowed_p,
10441 declares_class_or_enum,
10443 maybe_range_for_decl);
10444 /* If an error occurred while parsing tentatively, exit quickly.
10445 (That usually happens when in the body of a function; each
10446 statement is treated as a declaration-statement until proven
10447 otherwise.) */
10450 /* Handle function definitions specially. */
10452 {
10453 /* If the next token is a `,', then we are probably
10454 processing something like:
10456 void f() {}, *p;
10458 which is erroneous. */
10460 {
10463 "mixing"
10465 }
10466 /* Otherwise, we're done with the list of declarators. */
10467 else
10468 {
10471 }
10472 }
10475 /* The next token should be either a `,' or a `;'. */
10477 /* If it's a `,', there are more declarators to come. */
10480 /* If it's a `;', we are done. */
10483 /* Anything else is an error. */
10484 else
10485 {
10486 /* If we have already issued an error message we don't need
10487 to issue another one. */
10491 /* Skip tokens until we reach the end of the statement. */
10493 /* If the next token is now a `;', consume it. */
10497 }
10498 /* After the first time around, a function-definition is not
10499 allowed -- even if it was OK at first. For example:
10501 int i, f() {}
10503 is not valid. */
10505 }
10507 /* Issue an error message if no declarators are present, and the
10508 decl-specifier-seq does not itself declare a class or
10509 enumeration. */
10511 {
10514 /* Perform any deferred access checks. */
10516 }
10518 /* Consume the `;'. */
10522 done:
10524 }
10526 /* Parse a decl-specifier-seq.
10528 decl-specifier-seq:
10529 decl-specifier-seq [opt] decl-specifier
10531 decl-specifier:
10532 storage-class-specifier
10533 type-specifier
10534 function-specifier
10535 friend
10536 typedef
10538 GNU Extension:
10540 decl-specifier:
10541 attributes
10543 Set *DECL_SPECS to a representation of the decl-specifier-seq.
10545 The parser flags FLAGS is used to control type-specifier parsing.
10547 *DECLARES_CLASS_OR_ENUM is set to the bitwise or of the following
10548 flags:
10550 1: one of the decl-specifiers is an elaborated-type-specifier
10551 (i.e., a type declaration)
10552 2: one of the decl-specifiers is an enum-specifier or a
10553 class-specifier (i.e., a type definition)
10555 */
10557 static void
10559 cp_parser_flags flags,
10562 {
10565 cp_decl_spec ds;
10567 /* Clear DECL_SPECS. */
10570 /* Assume no class or enumeration type is declared. */
10573 /* Keep reading specifiers until there are no more to read. */
10575 {
10581 /* Peek at the next token. */
10584 /* Save the first token of the decl spec list for error
10585 reporting. */
10588 /* Handle attributes. */
10590 {
10591 /* Parse the attributes. */
10592 decl_specs->attributes
10598 }
10599 /* Assume we will find a decl-specifier keyword. */
10601 /* If the next token is an appropriate keyword, we can simply
10602 add it to the list. */
10604 {
10605 /* decl-specifier:
10606 friend
10607 constexpr */
10610 {
10613 }
10614 else
10615 {
10617 /* Consume the token. */
10619 }
10627 /* function-specifier:
10628 inline
10629 virtual
10630 explicit */
10637 /* decl-specifier:
10638 typedef */
10641 /* Consume the token. */
10643 /* A constructor declarator cannot appear in a typedef. */
10645 /* The "typedef" keyword can only occur in a declaration; we
10646 may as well commit at this point. */
10653 /* storage-class-specifier:
10654 auto
10655 register
10656 static
10657 extern
10658 mutable
10660 GNU Extension:
10661 thread */
10664 {
10665 /* Consume the token. */
10668 /* Complain about `auto' as a storage specifier, if
10669 we're complaining about C++0x compatibility. */
10673 /* Set the storage class anyway. */
10676 }
10677 else
10678 /* C++0x auto type-specifier. */
10686 /* Consume the token. */
10692 /* Consume the token. */
10698 /* We did not yet find a decl-specifier yet. */
10701 }
10711 /* Constructors are a special case. The `S' in `S()' is not a
10712 decl-specifier; it is the beginning of the declarator. */
10713 constructor_p
10714 = (!found_decl_spec
10715 && constructor_possible_p
10716 && (cp_parser_constructor_declarator_p
10719 /* If we don't have a DECL_SPEC yet, then we must be looking at
10720 a type-specifier. */
10722 {
10725 tree type_spec;
10727 type_spec
10729 decl_specs,
10735 /* If this type-specifier referenced a user-defined type
10736 (a typedef, class-name, etc.), then we can't allow any
10737 more such type-specifiers henceforth.
10739 [dcl.spec]
10741 The longest sequence of decl-specifiers that could
10742 possibly be a type name is taken as the
10743 decl-specifier-seq of a declaration. The sequence shall
10744 be self-consistent as described below.
10746 [dcl.type]
10748 As a general rule, at most one type-specifier is allowed
10749 in the complete decl-specifier-seq of a declaration. The
10750 only exceptions are the following:
10752 -- const or volatile can be combined with any other
10753 type-specifier.
10755 -- signed or unsigned can be combined with char, long,
10756 short, or int.
10758 -- ..
10760 Example:
10762 typedef char* Pc;
10763 void g (const int Pc);
10765 Here, Pc is *not* part of the decl-specifier seq; it's
10766 the declarator. Therefore, once we see a type-specifier
10767 (other than a cv-qualifier), we forbid any additional
10768 user-defined types. We *do* still allow things like `int
10769 int' to be considered a decl-specifier-seq, and issue the
10770 error message later. */
10773 /* A constructor declarator cannot follow a type-specifier. */
10775 {
10780 }
10781 }
10783 /* If we still do not have a DECL_SPEC, then there are no more
10784 decl-specifiers. */
10789 /* After we see one decl-specifier, further decl-specifiers are
10790 always optional. */
10792 }
10794 /* Don't allow a friend specifier with a class definition. */
10799 }
10801 /* Parse an (optional) storage-class-specifier.
10803 storage-class-specifier:
10804 auto
10805 register
10806 static
10807 extern
10808 mutable
10810 GNU Extension:
10812 storage-class-specifier:
10813 thread
10815 Returns an IDENTIFIER_NODE corresponding to the keyword used. */
10817 static tree
10819 {
10821 {
10825 /* Fall through for C++98. */
10832 /* Consume the token. */
10837 }
10838 }
10840 /* Parse an (optional) function-specifier.
10842 function-specifier:
10843 inline
10844 virtual
10845 explicit
10847 Returns an IDENTIFIER_NODE corresponding to the keyword used.
10848 Updates DECL_SPECS, if it is non-NULL. */
10850 static tree
10853 {
10856 {
10862 /* 14.5.2.3 [temp.mem]
10864 A member function template shall not be virtual. */
10876 }
10878 /* Consume the token. */
10880 }
10882 /* Parse a linkage-specification.
10884 linkage-specification:
10885 extern string-literal { declaration-seq [opt] }
10886 extern string-literal declaration */
10888 static void
10890 {
10891 tree linkage;
10893 /* Look for the `extern' keyword. */
10896 /* Look for the string-literal. */
10899 /* Transform the literal into an identifier. If the literal is a
10900 wide-character string, or contains embedded NULs, then we can't
10901 handle it as the user wants. */
10904 {
10906 /* Assume C++ linkage. */
10908 }
10909 else
10912 /* We're now using the new linkage. */
10915 /* If the next token is a `{', then we're using the first
10916 production. */
10918 {
10919 /* Consume the `{' token. */
10921 /* Parse the declarations. */
10923 /* Look for the closing `}'. */
10925 }
10926 /* Otherwise, there's just one declaration. */
10927 else
10928 {
10931 saved_in_unbraced_linkage_specification_p
10935 parser->in_unbraced_linkage_specification_p
10937 }
10939 /* We're done with the linkage-specification. */
10941 }
10943 /* Parse a static_assert-declaration.
10945 static_assert-declaration:
10946 static_assert ( constant-expression , string-literal ) ;
10948 If MEMBER_P, this static_assert is a class member. */
10950 static void
10952 {
10953 tree condition;
10954 tree message;
10956 location_t saved_loc;
10959 /* Peek at the `static_assert' token so we can keep track of exactly
10960 where the static assertion started. */
10964 /* Look for the `static_assert' keyword. */
10966 RT_STATIC_ASSERT))
10969 /* We know we are in a static assertion; commit to any tentative
10970 parse. */
10974 /* Parse the `(' starting the static assertion condition. */
10977 /* Parse the constant-expression. Allow a non-constant expression
10978 here in order to give better diagnostics in finish_static_assert. */
10979 condition =
10984 /* Parse the separating `,'. */
10987 /* Parse the string-literal message. */
10992 /* A `)' completes the static assertion. */
10999 /* A semicolon terminates the declaration. */
11002 /* Complete the static assertion, which may mean either processing
11003 the static assert now or saving it for template instantiation. */
11005 }
11007 /* Parse a `decltype' type. Returns the type.
11009 simple-type-specifier:
11010 decltype ( expression ) */
11012 static tree
11014 {
11015 tree expr;
11024 {
11025 /* Already parsed. */
11028 }
11030 /* Look for the `decltype' token. */
11034 /* Types cannot be defined in a `decltype' expression. Save away the
11035 old message. */
11038 /* And create the new one. */
11039 parser->type_definition_forbidden_message
11042 /* The restrictions on constant-expressions do not apply inside
11043 decltype expressions. */
11044 saved_integral_constant_expression_p
11046 saved_non_integral_constant_expression_p
11050 /* Do not actually evaluate the expression. */
11053 /* Do not warn about problems with the expression. */
11056 /* Parse the opening `('. */
11060 /* First, try parsing an id-expression. */
11071 {
11074 cp_id_kind idk;
11078 /* Lookup the name we got back from the id-expression. */
11080 none_type,
11094 {
11095 /* Complete lookup of the id-expression. */
11096 expr = (finish_id_expression
11109 /* We found an id-expression, but it was something that we
11110 should not have found. This is an error, not something
11111 we can recover from, so note that we found an
11112 id-expression and we'll recover as gracefully as
11113 possible. */
11115 }
11120 /* We have an id-expression. */
11122 }
11125 {
11126 /* Abort the id-expression parse. */
11129 /* Parsing tentatively, again. */
11132 /* Parse a class member access. */
11140 /* We have an id-expression. */
11142 }
11145 /* We have parsed the complete id-expression or member access. */
11147 else
11148 {
11151 /* Abort our attempt to parse an id-expression or member access
11152 expression. */
11155 /* Within a parenthesized expression, a `>' token is always
11156 the greater-than operator. */
11157 saved_greater_than_is_operator_p
11161 /* Parse a full expression. */
11164 /* The `>' token might be the end of a template-id or
11165 template-parameter-list now. */
11166 parser->greater_than_is_operator_p
11168 }
11170 /* Go back to evaluating expressions. */
11174 /* Restore the old message and the integral constant expression
11175 flags. */
11177 parser->integral_constant_expression_p
11179 parser->non_integral_constant_expression_p
11182 /* Parse to the closing `)'. */
11184 {
11188 }
11191 tf_warning_or_error);
11193 /* Replace the decltype with a CPP_DECLTYPE so we don't need to parse
11194 it again. */
11201 }
11203 /* Special member functions [gram.special] */
11205 /* Parse a conversion-function-id.
11207 conversion-function-id:
11208 operator conversion-type-id
11210 Returns an IDENTIFIER_NODE representing the operator. */
11212 static tree
11214 {
11215 tree type;
11216 tree saved_scope;
11217 tree saved_qualifying_scope;
11218 tree saved_object_scope;
11221 /* Look for the `operator' token. */
11224 /* When we parse the conversion-type-id, the current scope will be
11225 reset. However, we need that information in able to look up the
11226 conversion function later, so we save it here. */
11230 /* We must enter the scope of the class so that the names of
11231 entities declared within the class are available in the
11232 conversion-type-id. For example, consider:
11234 struct S {
11235 typedef int I;
11236 operator I();
11237 };
11239 S::operator I() { ... }
11241 In order to see that `I' is a type-name in the definition, we
11242 must be in the scope of `S'. */
11245 /* Parse the conversion-type-id. */
11247 /* Leave the scope of the class, if any. */
11250 /* Restore the saved scope. */
11254 /* If the TYPE is invalid, indicate failure. */
11258 }
11260 /* Parse a conversion-type-id:
11262 conversion-type-id:
11263 type-specifier-seq conversion-declarator [opt]
11265 Returns the TYPE specified. */
11267 static tree
11269 {
11270 tree attributes;
11271 cp_decl_specifier_seq type_specifiers;
11273 tree type_specified;
11275 /* Parse the attributes. */
11277 /* Parse the type-specifiers. */
11281 /* If that didn't work, stop. */
11284 /* Parse the conversion-declarator. */
11292 /* Don't give this error when parsing tentatively. This happens to
11293 work because we always parse this definitively once. */
11296 {
11298 {
11301 }
11305 }
11308 }
11310 /* Parse an (optional) conversion-declarator.
11312 conversion-declarator:
11313 ptr-operator conversion-declarator [opt]
11315 */
11319 {
11321 tree class_type;
11322 cp_cv_quals cv_quals;
11324 /* We don't know if there's a ptr-operator next, or not. */
11326 /* Try the ptr-operator. */
11328 /* If it worked, look for more conversion-declarators. */
11330 {
11333 /* Parse another optional declarator. */
11336 return cp_parser_make_indirect_declarator
11338 }
11341 }
11343 /* Parse an (optional) ctor-initializer.
11345 ctor-initializer:
11346 : mem-initializer-list
11348 Returns TRUE iff the ctor-initializer was actually present. */
11350 static bool
11352 {
11353 /* If the next token is not a `:', then there is no
11354 ctor-initializer. */
11356 {
11357 /* Do default initialization of any bases and members. */
11362 }
11364 /* Consume the `:' token. */
11366 /* And the mem-initializer-list. */
11370 }
11372 /* Parse a mem-initializer-list.
11374 mem-initializer-list:
11375 mem-initializer ... [opt]
11376 mem-initializer ... [opt] , mem-initializer-list */
11378 static void
11380 {
11385 /* Let the semantic analysis code know that we are starting the
11386 mem-initializer-list. */
11391 /* Loop through the list. */
11393 {
11394 tree mem_initializer;
11397 /* Parse the mem-initializer. */
11399 /* If the next token is a `...', we're expanding member initializers. */
11401 {
11402 /* Consume the `...'. */
11405 /* The TREE_PURPOSE must be a _TYPE, because base-specifiers
11406 can be expanded but members cannot. */
11409 {
11414 }
11416 /* Construct the pack expansion type. */
11419 }
11422 {
11426 }
11427 /* Look for a target constructor. */
11431 {
11434 {
11438 }
11440 }
11441 /* Add it to the list, unless it was erroneous. */
11443 {
11446 }
11447 /* If the next token is not a `,', we're done. */
11450 /* Consume the `,' token. */
11452 }
11454 /* Perform semantic analysis. */
11457 }
11459 /* Parse a mem-initializer.
11461 mem-initializer:
11462 mem-initializer-id ( expression-list [opt] )
11463 mem-initializer-id braced-init-list
11465 GNU extension:
11467 mem-initializer:
11468 ( expression-list [opt] )
11470 Returns a TREE_LIST. The TREE_PURPOSE is the TYPE (for a base
11471 class) or FIELD_DECL (for a non-static data member) to initialize;
11472 the TREE_VALUE is the expression-list. An empty initialization
11473 list is represented by void_list_node. */
11475 static tree
11477 {
11478 tree mem_initializer_id;
11479 tree expression_list;
11480 tree member;
11483 /* Find out what is being initialized. */
11485 {
11489 }
11490 else
11491 {
11495 }
11501 {
11507 }
11508 else
11509 {
11519 }
11529 }
11531 /* Parse a mem-initializer-id.
11533 mem-initializer-id:
11534 :: [opt] nested-name-specifier [opt] class-name
11535 identifier
11537 Returns a TYPE indicating the class to be initializer for the first
11538 production. Returns an IDENTIFIER_NODE indicating the data member
11539 to be initialized for the second production. */
11541 static tree
11543 {
11547 tree id;
11551 /* `typename' is not allowed in this context ([temp.res]). */
11553 {
11555 "keyword %<typename%> not allowed in this context (a qualified "
11558 }
11559 /* Look for the optional `::' operator. */
11560 global_scope_p
11564 /* Look for the optional nested-name-specifier. The simplest way to
11565 implement:
11567 [temp.res]
11569 The keyword `typename' is not permitted in a base-specifier or
11570 mem-initializer; in these contexts a qualified name that
11571 depends on a template-parameter is implicitly assumed to be a
11572 type name.
11574 is to assume that we have seen the `typename' keyword at this
11575 point. */
11576 nested_name_specifier_p
11585 /* If there is a `::' operator or a nested-name-specifier, then we
11586 are definitely looking for a class-name. */
11591 typename_type,
11595 /* Otherwise, we could also be looking for an ordinary identifier. */
11597 /* Try a class-name. */
11601 none_type,
11605 /* If we found one, we're done. */
11608 /* Otherwise, look for an ordinary identifier. */
11610 }
11612 /* Overloading [gram.over] */
11614 /* Parse an operator-function-id.
11616 operator-function-id:
11617 operator operator
11619 Returns an IDENTIFIER_NODE for the operator which is a
11620 human-readable spelling of the identifier, e.g., `operator +'. */
11622 static tree
11624 {
11625 /* Look for the `operator' keyword. */
11628 /* And then the name of the operator itself. */
11630 }
11632 /* Return an identifier node for a user-defined literal operator.
11633 The suffix identifier is chained to the operator name identifier. */
11635 static tree
11637 {
11638 tree identifier;
11643 /*IDENTIFIER_UDLIT_OPNAME_P (identifier) = 1; If we get a flag someday. */
11646 }
11648 /* Parse an operator.
11650 operator:
11651 new delete new[] delete[] + - * / % ^ & | ~ ! = < >
11652 += -= *= /= %= ^= &= |= << >> >>= <<= == != <= >= &&
11653 || ++ -- , ->* -> () []
11655 GNU Extensions:
11657 operator:
11658 <? >? <?= >?=
11660 Returns an IDENTIFIER_NODE for the operator which is a
11661 human-readable spelling of the identifier, e.g., `operator +'. */
11663 static tree
11665 {
11669 /* Peek at the next token. */
11671 /* Figure out which operator we have. */
11673 {
11675 {
11678 /* The keyword should be either `new' or `delete'. */
11683 else
11686 /* Consume the `new' or `delete' token. */
11689 /* Peek at the next token. */
11691 /* If it's a `[' token then this is the array variant of the
11692 operator. */
11694 {
11695 /* Consume the `[' token. */
11697 /* Look for the `]' token. */
11701 }
11702 /* Otherwise, we have the non-array variant. */
11703 else
11707 }
11854 /* Consume the `('. */
11856 /* Look for the matching `)'. */
11861 /* Consume the `['. */
11863 /* Look for the matching `]'. */
11871 {
11874 }
11875 /* Consume the string. */
11877 /* Look for the suffix identifier. */
11880 {
11883 {
11886 }
11887 }
11888 else
11889 {
11892 }
11899 /* Anything else is an error. */
11901 }
11903 /* If we have selected an identifier, we need to consume the
11904 operator token. */
11907 /* Otherwise, no valid operator name was present. */
11908 else
11909 {
11912 }
11915 }
11917 /* Parse a template-declaration.
11919 template-declaration:
11920 export [opt] template < template-parameter-list > declaration
11922 If MEMBER_P is TRUE, this template-declaration occurs within a
11923 class-specifier.
11925 The grammar rule given by the standard isn't correct. What
11926 is really meant is:
11928 template-declaration:
11929 export [opt] template-parameter-list-seq
11930 decl-specifier-seq [opt] init-declarator [opt] ;
11931 export [opt] template-parameter-list-seq
11932 function-definition
11934 template-parameter-list-seq:
11935 template-parameter-list-seq [opt]
11936 template < template-parameter-list > */
11938 static void
11940 {
11941 /* Check for `export'. */
11943 {
11944 /* Consume the `export' token. */
11946 /* Warn that we do not support `export'. */
11948 }
11951 }
11953 /* Parse a template-parameter-list.
11955 template-parameter-list:
11956 template-parameter
11957 template-parameter-list , template-parameter
11959 Returns a TREE_LIST. Each node represents a template parameter.
11960 The nodes are connected via their TREE_CHAINs. */
11962 static tree
11964 {
11969 /* The loop below parses the template parms. We first need to know
11970 the total number of template parms to be able to compute proper
11971 canonical types of each dependent type. So after the loop, when
11972 we know the total number of template parms,
11973 end_template_parm_list computes the proper canonical types and
11974 fixes up the dependent types accordingly. */
11976 {
11977 tree parameter;
11980 location_t parm_loc;
11982 /* Parse the template-parameter. */
11987 /* Add it to the list. */
11990 parm_loc,
11991 parameter,
11992 is_non_type,
11993 is_parameter_pack);
11994 else
11995 {
11998 }
12000 /* If the next token is not a `,', we're done. */
12003 /* Otherwise, consume the `,' token. */
12005 }
12008 }
12010 /* Parse a template-parameter.
12012 template-parameter:
12013 type-parameter
12014 parameter-declaration
12016 If all goes well, returns a TREE_LIST. The TREE_VALUE represents
12017 the parameter. The TREE_PURPOSE is the default value, if any.
12018 Returns ERROR_MARK_NODE on failure. *IS_NON_TYPE is set to true
12019 iff this parameter is a non-type parameter. *IS_PARAMETER_PACK is
12020 set to true iff this parameter is a parameter pack. */
12022 static tree
12025 {
12029 tree parm;
12031 /* Assume it is a type parameter or a template parameter. */
12033 /* Assume it not a parameter pack. */
12035 /* Peek at the next token. */
12037 /* If it is `class' or `template', we have a type-parameter. */
12040 /* If it is `class' or `typename' we do not know yet whether it is a
12041 type parameter or a non-type parameter. Consider:
12043 template <typename T, typename T::X X> ...
12045 or:
12047 template <class C, class D*> ...
12049 Here, the first parameter is a type parameter, and the second is
12050 a non-type parameter. We can tell by looking at the token after
12051 the identifier -- if it is a `,', `=', or `>' then we have a type
12052 parameter. */
12054 {
12055 /* Peek at the token after `class' or `typename'. */
12057 /* If it's an ellipsis, we have a template type parameter
12058 pack. */
12061 /* If it's an identifier, skip it. */
12064 /* Now, see if the token looks like the end of a template
12065 parameter. */
12070 }
12072 /* Otherwise, it is a non-type parameter.
12074 [temp.param]
12076 When parsing a default template-argument for a non-type
12077 template-parameter, the first non-nested `>' is taken as the end
12078 of the template parameter-list rather than a greater-than
12079 operator. */
12081 parameter_declarator
12085 /* If the parameter declaration is marked as a parameter pack, set
12086 *IS_PARAMETER_PACK to notify the caller. Also, unmark the
12087 declarator's PACK_EXPANSION_P, otherwise we'll get errors from
12088 grokdeclarator. */
12092 {
12095 }
12097 /* If the next token is an ellipsis, and we don't already have it
12098 marked as a parameter pack, then we have a parameter pack (that
12099 has no declarator). */
12103 {
12104 /* Consume the `...'. */
12109 }
12110 /* We might end up with a pack expansion as the type of the non-type
12111 template parameter, in which case this is a non-type template
12112 parameter pack. */
12116 {
12120 }
12123 {
12124 /* Parameter packs cannot have default arguments. However, a
12125 user may try to do so, so we'll parse them and give an
12126 appropriate diagnostic here. */
12130 /* Find the name of the parameter pack. */
12139 else
12143 /* Parse the default argument, but throw away the result. */
12145 }
12155 }
12157 /* Parse a type-parameter.
12159 type-parameter:
12160 class identifier [opt]
12161 class identifier [opt] = type-id
12162 typename identifier [opt]
12163 typename identifier [opt] = type-id
12164 template < template-parameter-list > class identifier [opt]
12165 template < template-parameter-list > class identifier [opt]
12166 = id-expression
12168 GNU Extension (variadic templates):
12170 type-parameter:
12171 class ... identifier [opt]
12172 typename ... identifier [opt]
12174 Returns a TREE_LIST. The TREE_VALUE is itself a TREE_LIST. The
12175 TREE_PURPOSE is the default-argument, if any. The TREE_VALUE is
12176 the declaration of the parameter.
12178 Sets *IS_PARAMETER_PACK if this is a template parameter pack. */
12180 static tree
12182 {
12184 tree parameter;
12186 /* Look for a keyword to tell us what kind of parameter this is. */
12192 {
12195 {
12196 tree identifier;
12197 tree default_argument;
12199 /* If the next token is an ellipsis, we have a template
12200 argument pack. */
12202 {
12203 /* Consume the `...' token. */
12208 }
12210 /* If the next token is an identifier, then it names the
12211 parameter. */
12214 else
12217 /* Create the parameter. */
12220 /* If the next token is an `=', we have a default argument. */
12222 {
12223 /* Consume the `=' token. */
12225 /* Parse the default-argument. */
12229 /* Template parameter packs cannot have default
12230 arguments. */
12232 {
12235 "template parameter pack %qD cannot have a "
12237 else
12239 "template parameter packs cannot have "
12242 }
12244 }
12245 else
12248 /* Create the combined representation of the parameter and the
12249 default argument. */
12251 }
12255 {
12256 tree identifier;
12257 tree default_argument;
12259 /* Look for the `<'. */
12261 /* Parse the template-parameter-list. */
12263 /* Look for the `>'. */
12265 /* Look for the `class' keyword. */
12267 /* If the next token is an ellipsis, we have a template
12268 argument pack. */
12270 {
12271 /* Consume the `...' token. */
12276 }
12277 /* If the next token is an `=', then there is a
12278 default-argument. If the next token is a `>', we are at
12279 the end of the parameter-list. If the next token is a `,',
12280 then we are at the end of this parameter. */
12284 {
12286 /* Treat invalid names as if the parameter were nameless. */
12289 }
12290 else
12293 /* Create the template parameter. */
12295 identifier);
12297 /* If the next token is an `=', then there is a
12298 default-argument. */
12300 {
12303 /* Consume the `='. */
12305 /* Parse the id-expression. */
12307 /* save token before parsing the id-expression, for error
12308 reporting */
12310 default_argument
12318 /* If the id-expression was a template-id that refers to
12319 a template-class, we already have the declaration here,
12320 so no further lookup is needed. */
12321 ;
12322 else
12323 /* Look up the name. */
12324 default_argument
12326 none_type,
12332 /* See if the default argument is valid. */
12333 default_argument
12336 /* Template parameter packs cannot have default
12337 arguments. */
12339 {
12342 "template parameter pack %qD cannot "
12344 identifier);
12345 else
12349 }
12351 }
12352 else
12355 /* Create the combined representation of the parameter and the
12356 default argument. */
12358 }
12364 }
12367 }
12369 /* Parse a template-id.
12371 template-id:
12372 template-name < template-argument-list [opt] >
12374 If TEMPLATE_KEYWORD_P is TRUE, then we have just seen the
12375 `template' keyword. In this case, a TEMPLATE_ID_EXPR will be
12376 returned. Otherwise, if the template-name names a function, or set
12377 of functions, returns a TEMPLATE_ID_EXPR. If the template-name
12378 names a class, returns a TYPE_DECL for the specialization.
12380 If CHECK_DEPENDENCY_P is FALSE, names are looked up in
12381 uninstantiated templates. */
12383 static tree
12389 {
12391 tree templ;
12392 tree arguments;
12393 tree template_id;
12400 /* If the next token corresponds to a template-id, there is no need
12401 to reparse it. */
12404 {
12407 /* Get the stored value. */
12409 /* Perform any access checks that were deferred. */
12412 {
12417 tf_warning_or_error);
12418 }
12419 /* Return the stored value. */
12421 }
12423 /* Avoid performing name lookup if there is no possibility of
12424 finding a template-id. */
12427 && !cp_parser_nth_token_starts_template_argument_list_p
12429 {
12432 }
12434 /* Remember where the template-id starts. */
12440 /* Parse the template-name. */
12443 check_dependency_p,
12444 is_declaration,
12445 tag_type,
12448 {
12451 }
12453 /* If we find the sequence `[:' after a template-name, it's probably
12454 a digraph-typo for `< ::'. Substitute the tokens and check if we can
12455 parse correctly the argument list. */
12462 {
12464 /* Change `:' into `::'. */
12466 /* Consume the first token (CPP_OPEN_SQUARE - which we pretend it is
12467 CPP_LESS. */
12470 /* Parse the arguments. */
12473 {
12474 /* If we couldn't parse an argument list, then we revert our changes
12475 and return simply an error. Maybe this is not a template-id
12476 after all. */
12481 }
12482 /* Otherwise, emit an error about the invalid digraph, but continue
12483 parsing because we got our argument list. In C++11 do not emit
12484 any error, per 2.5/3. */
12488 {
12491 "%<<:%> is an alternate spelling for %<[%>."
12494 {
12496 "or %<-std=c++11%>, or %<-std=gnu++11%> G++ will "
12499 }
12500 }
12501 }
12502 else
12503 {
12504 /* Look for the `<' that starts the template-argument-list. */
12506 {
12509 }
12510 /* Parse the arguments. */
12512 }
12514 /* Build a representation of the specialization. */
12517 TEMPLATE_ID_EXPR,
12521 {
12523 /* In "template <typename T> ... A<T>::", A<T> is the abstract A
12524 template (rather than some instantiation thereof) only if
12525 is not nested within some other construct. For example, in
12526 "template <typename T> void f(T) { A<T>::", A<T> is just an
12527 instantiation of A. */
12530 CPP_SCOPE));
12531 template_id
12533 }
12534 else
12535 {
12536 /* If it's not a class-template or a template-template, it should be
12537 a function-template. */
12543 }
12545 /* If parsing tentatively, replace the sequence of tokens that makes
12546 up the template-id with a CPP_TEMPLATE_ID token. That way,
12547 should we re-parse the token stream, we will not have to repeat
12548 the effort required to do the parse, nor will we issue duplicate
12549 error messages about problems during instantiation of the
12550 template. */
12552 {
12555 /* Reset the contents of the START_OF_ID token. */
12557 /* Retrieve any deferred checks. Do not pop this access checks yet
12558 so the memory will not be reclaimed during token replacing below. */
12564 /* Purge all subsequent tokens. */
12567 /* ??? Can we actually assume that, if template_id ==
12568 error_mark_node, we will have issued a diagnostic to the
12569 user, as opposed to simply marking the tentative parse as
12570 failed? */
12573 }
12577 }
12579 /* Parse a template-name.
12581 template-name:
12582 identifier
12584 The standard should actually say:
12586 template-name:
12587 identifier
12588 operator-function-id
12590 A defect report has been filed about this issue.
12592 A conversion-function-id cannot be a template name because they cannot
12593 be part of a template-id. In fact, looking at this code:
12595 a.operator K<int>()
12597 the conversion-function-id is "operator K<int>", and K<int> is a type-id.
12598 It is impossible to call a templated conversion-function-id with an
12599 explicit argument list, since the only allowed template parameter is
12600 the type to which it is converting.
12602 If TEMPLATE_KEYWORD_P is true, then we have just seen the
12603 `template' keyword, in a construction like:
12605 T::template f<3>()
12607 In that case `f' is taken to be a template-name, even though there
12608 is no way of knowing for sure.
12610 Returns the TEMPLATE_DECL for the template, or an OVERLOAD if the
12611 name refers to a set of overloaded functions, at least one of which
12612 is a template, or an IDENTIFIER_NODE with the name of the template,
12613 if TEMPLATE_KEYWORD_P is true. If CHECK_DEPENDENCY_P is FALSE,
12614 names are looked up inside uninstantiated templates. */
12616 static tree
12623 {
12624 tree identifier;
12625 tree decl;
12626 tree fns;
12629 /* If the next token is `operator', then we have either an
12630 operator-function-id or a conversion-function-id. */
12632 {
12633 /* We don't know whether we're looking at an
12634 operator-function-id or a conversion-function-id. */
12636 /* Try an operator-function-id. */
12638 /* If that didn't work, try a conversion-function-id. */
12640 {
12643 }
12644 }
12645 /* Look for the identifier. */
12646 else
12649 /* If we didn't find an identifier, we don't have a template-id. */
12653 /* If the name immediately followed the `template' keyword, then it
12654 is a template-name. However, if the next token is not `<', then
12655 we do not treat it as a template-name, since it is not being used
12656 as part of a template-id. This enables us to handle constructs
12657 like:
12659 template <typename T> struct S { S(); };
12660 template <typename T> S<T>::S();
12662 correctly. We would treat `S' as a template -- if it were `S<T>'
12663 -- but we do not if there is no `<'. */
12667 {
12668 /* In a declaration, in a dependent context, we pretend that the
12669 "template" keyword was present in order to improve error
12670 recovery. For example, given:
12672 template <typename T> void f(T::X<int>);
12674 we want to treat "X<int>" as a template-id. */
12676 && !template_keyword_p
12678 && check_dependency_p
12680 /* Do not do this for dtors (or ctors), since they never
12681 need the template keyword before their name. */
12683 {
12686 /* Explain what went wrong. */
12688 identifier);
12691 /* If parsing tentatively, find the location of the "<" token. */
12694 /* Parse the template arguments so that we can issue error
12695 messages about them. */
12698 /* Skip tokens until we find a good place from which to
12699 continue parsing. */
12704 /* If parsing tentatively, permanently remove the
12705 template argument list. That will prevent duplicate
12706 error messages from being issued about the missing
12707 "template" keyword. */
12713 }
12715 /* If the "template" keyword is present, then there is generally
12716 no point in doing name-lookup, so we just return IDENTIFIER.
12717 But, if the qualifying scope is non-dependent then we can
12718 (and must) do name-lookup normally. */
12724 }
12726 /* Look up the name. */
12728 tag_type,
12731 check_dependency_p,
12735 /* If DECL is a template, then the name was a template-name. */
12737 ;
12738 else
12739 {
12742 /* The standard does not explicitly indicate whether a name that
12743 names a set of overloaded declarations, some of which are
12744 templates, is a template-name. However, such a name should
12745 be a template-name; otherwise, there is no way to form a
12746 template-id for the overloaded templates. */
12754 {
12755 /* The name does not name a template. */
12758 }
12759 }
12761 /* If DECL is dependent, and refers to a function, then just return
12762 its name; we will look it up again during template instantiation. */
12764 {
12768 }
12771 }
12773 /* Parse a template-argument-list.
12775 template-argument-list:
12776 template-argument ... [opt]
12777 template-argument-list , template-argument ... [opt]
12779 Returns a TREE_VEC containing the arguments. */
12781 static tree
12783 {
12788 tree vec;
12795 /* Even if the template-id appears in an integral
12796 constant-expression, the contents of the argument list do
12797 not. */
12803 /* Parse the arguments. */
12804 do
12805 {
12806 tree argument;
12809 /* Consume the comma. */
12812 /* Parse the template-argument. */
12815 /* If the next token is an ellipsis, we're expanding a template
12816 argument pack. */
12818 {
12820 {
12824 }
12825 /* Consume the `...' token. */
12828 /* Make the argument into a TYPE_PACK_EXPANSION or
12829 EXPR_PACK_EXPANSION. */
12831 }
12834 {
12838 {
12841 }
12842 else
12844 }
12846 }
12859 #ifdef ENABLE_CHECKING
12861 #endif
12863 }
12865 /* Parse a template-argument.
12867 template-argument:
12868 assignment-expression
12869 type-id
12870 id-expression
12872 The representation is that of an assignment-expression, type-id, or
12873 id-expression -- except that the qualified id-expression is
12874 evaluated, so that the value returned is either a DECL or an
12875 OVERLOAD.
12877 Although the standard says "assignment-expression", it forbids
12878 throw-expressions or assignments in the template argument.
12879 Therefore, we use "conditional-expression" instead. */
12881 static tree
12883 {
12884 tree argument;
12890 cp_id_kind idk;
12892 /* There's really no way to know what we're looking at, so we just
12893 try each alternative in order.
12895 [temp.arg]
12897 In a template-argument, an ambiguity between a type-id and an
12898 expression is resolved to a type-id, regardless of the form of
12899 the corresponding template-parameter.
12901 Therefore, we try a type-id first. */
12904 /* If there was no error parsing the type-id but the next token is a
12905 '>>', our behavior depends on which dialect of C++ we're
12906 parsing. In C++98, we probably found a typo for '> >'. But there
12907 are type-id which are also valid expressions. For instance:
12909 struct X { int operator >> (int); };
12910 template <int V> struct Foo {};
12911 Foo<X () >> 5> r;
12913 Here 'X()' is a valid type-id of a function type, but the user just
12914 wanted to write the expression "X() >> 5". Thus, we remember that we
12915 found a valid type-id, but we still try to parse the argument as an
12916 expression to see what happens.
12918 In C++0x, the '>>' will be considered two separate '>'
12919 tokens. */
12923 {
12926 }
12927 else
12928 {
12929 /* If the next token isn't a `,' or a `>', then this argument wasn't
12930 really finished. This means that the argument is not a valid
12931 type-id. */
12934 /* If that worked, we're done. */
12937 }
12938 /* We're still not sure what the argument will be. */
12940 /* Try a template. */
12948 /* If the next token isn't a `,' or a `>', then this argument wasn't
12949 really finished. */
12953 {
12954 /* Figure out what is being referred to. If the id-expression
12955 was for a class template specialization, then we will have a
12956 TYPE_DECL at this point. There is no need to do name lookup
12957 at this point in that case. */
12960 none_type,
12969 }
12972 /* It must be a non-type argument. There permitted cases are given
12973 in [temp.arg.nontype]:
12975 -- an integral constant-expression of integral or enumeration
12976 type; or
12978 -- the name of a non-type template-parameter; or
12980 -- the name of an object or function with external linkage...
12982 -- the address of an object or function with external linkage...
12984 -- a pointer to member... */
12985 /* Look for a non-type template parameter. */
12987 {
12999 }
13001 /* If the next token is "&", the argument must be the address of an
13002 object or function with external linkage. */
13005 {
13008 }
13009 /* See if we might have an id-expression. */
13016 {
13019 address_p,
13026 else
13027 {
13028 tree probe;
13031 {
13034 }
13036 /* If we're in a template, we represent a qualified-id referring
13037 to a static data member as a SCOPE_REF even if the scope isn't
13038 dependent so that we can check access control later. */
13043 {
13044 /* A variable without external linkage might still be a
13045 valid constant-expression, so no error is issued here
13046 if the external-linkage check fails. */
13049 }
13051 /* All overloaded functions are allowed; if the external
13052 linkage test does not pass, an error will be issued
13053 later. */
13054 ;
13058 /* A pointer-to-member. */
13059 ;
13061 ;
13062 else
13066 {
13069 tf_warning_or_error);
13071 }
13072 }
13073 }
13074 /* If the argument started with "&", there are no other valid
13075 alternatives at this point. */
13077 {
13080 }
13082 /* If the argument wasn't successfully parsed as a type-id followed
13083 by '>>', the argument can only be a constant expression now.
13084 Otherwise, we try parsing the constant-expression tentatively,
13085 because the argument could really be a type-id. */
13098 /* We did our best to parse the argument as a non type-id, but that
13099 was the only alternative that matched (albeit with a '>' after
13100 it). We can assume it's just a typo from the user, and a
13101 diagnostic will then be issued. */
13103 }
13105 /* Parse an explicit-instantiation.
13107 explicit-instantiation:
13108 template declaration
13110 Although the standard says `declaration', what it really means is:
13112 explicit-instantiation:
13113 template decl-specifier-seq [opt] declarator [opt] ;
13115 Things like `template int S<int>::i = 5, int S<double>::j;' are not
13116 supposed to be allowed. A defect report has been filed about this
13117 issue.
13119 GNU Extension:
13121 explicit-instantiation:
13122 storage-class-specifier template
13123 decl-specifier-seq [opt] declarator [opt] ;
13124 function-specifier template
13125 decl-specifier-seq [opt] declarator [opt] ; */
13127 static void
13129 {
13131 cp_decl_specifier_seq decl_specifiers;
13136 /* Look for an (optional) storage-class-specifier or
13137 function-specifier. */
13139 {
13140 extension_specifier
13143 extension_specifier
13146 }
13148 /* Look for the `template' keyword. */
13150 /* Let the front end know that we are processing an explicit
13151 instantiation. */
13153 /* [temp.explicit] says that we are supposed to ignore access
13154 control while processing explicit instantiation directives. */
13156 /* Parse a decl-specifier-seq. */
13158 CP_PARSER_FLAGS_OPTIONAL,
13161 /* If there was exactly one decl-specifier, and it declared a class,
13162 and there's no declarator, then we have an explicit type
13163 instantiation. */
13165 {
13166 tree type;
13169 /* Turn access control back on for names used during
13170 template instantiation. */
13175 }
13176 else
13177 {
13179 tree decl;
13181 /* Parse the declarator. */
13182 declarator
13192 {
13195 "explicit instantiation shall not use"
13199 "explicit instantiation shall not use"
13204 /* Turn access control back on for names used during
13205 template instantiation. */
13207 /* Do the explicit instantiation. */
13209 }
13210 else
13211 {
13213 /* Skip the body of the explicit instantiation. */
13215 }
13216 }
13217 /* We're done with the instantiation. */
13223 }
13225 /* Parse an explicit-specialization.
13227 explicit-specialization:
13228 template < > declaration
13230 Although the standard says `declaration', what it really means is:
13232 explicit-specialization:
13233 template <> decl-specifier [opt] init-declarator [opt] ;
13234 template <> function-definition
13235 template <> explicit-specialization
13236 template <> template-declaration */
13238 static void
13240 {
13244 /* Look for the `template' keyword. */
13246 /* Look for the `<'. */
13248 /* Look for the `>'. */
13250 /* We have processed another parameter list. */
13252 /* [temp]
13254 A template ... explicit specialization ... shall not have C
13255 linkage. */
13257 {
13259 /* Give it C++ linkage to avoid confusing other parts of the
13260 front end. */
13263 }
13264 else
13266 /* Let the front end know that we are beginning a specialization. */
13268 {
13271 }
13273 /* If the next keyword is `template', we need to figure out whether
13274 or not we're looking a template-declaration. */
13276 {
13281 else
13283 }
13284 else
13285 /* Parse the dependent declaration. */
13291 /* We're done with the specialization. */
13293 /* For the erroneous case of a template with C linkage, we pushed an
13294 implicit C++ linkage scope; exit that scope now. */
13297 /* We're done with this parameter list. */
13299 }
13301 /* Parse a type-specifier.
13303 type-specifier:
13304 simple-type-specifier
13305 class-specifier
13306 enum-specifier
13307 elaborated-type-specifier
13308 cv-qualifier
13310 GNU Extension:
13312 type-specifier:
13313 __complex__
13315 Returns a representation of the type-specifier. For a
13316 class-specifier, enum-specifier, or elaborated-type-specifier, a
13317 TREE_TYPE is returned; otherwise, a TYPE_DECL is returned.
13319 The parser flags FLAGS is used to control type-specifier parsing.
13321 If IS_DECLARATION is TRUE, then this type-specifier is appearing
13322 in a decl-specifier-seq.
13324 If DECLARES_CLASS_OR_ENUM is non-NULL, and the type-specifier is a
13325 class-specifier, enum-specifier, or elaborated-type-specifier, then
13326 *DECLARES_CLASS_OR_ENUM is set to a nonzero value. The value is 1
13327 if a type is declared; 2 if it is defined. Otherwise, it is set to
13328 zero.
13330 If IS_CV_QUALIFIER is non-NULL, and the type-specifier is a
13331 cv-qualifier, then IS_CV_QUALIFIER is set to TRUE. Otherwise, it
13332 is set to FALSE. */
13334 static tree
13336 cp_parser_flags flags,
13341 {
13347 /* Assume this type-specifier does not declare a new type. */
13350 /* And that it does not specify a cv-qualifier. */
13353 /* Peek at the next token. */
13356 /* If we're looking at a keyword, we can use that to guide the
13357 production we choose. */
13360 {
13365 /* Look for the enum-specifier. */
13367 /* If that worked, we're done. */
13369 {
13374 type_spec,
13378 }
13379 else
13382 /* Any of these indicate either a class-specifier, or an
13383 elaborated-type-specifier. */
13390 /* Parse tentatively so that we can back up if we don't find a
13391 class-specifier. */
13393 /* Look for the class-specifier. */
13396 /* If that worked, we're done. */
13398 {
13403 type_spec,
13407 }
13409 /* Fall through. */
13410 elaborated_type_specifier:
13411 /* We're declaring (not defining) a class or enum. */
13415 /* Fall through. */
13417 /* Look for an elaborated-type-specifier. */
13418 type_spec
13419 = (cp_parser_elaborated_type_specifier
13422 is_declaration));
13425 type_spec,
13449 /* The `__complex__' keyword is a GNU extension. */
13455 }
13457 /* Handle simple keywords. */
13459 {
13461 {
13464 }
13466 }
13468 /* If we do not already have a type-specifier, assume we are looking
13469 at a simple-type-specifier. */
13471 decl_specs,
13472 flags);
13474 /* If we didn't find a type-specifier, and a type-specifier was not
13475 optional in this context, issue an error message. */
13477 {
13480 }
13483 }
13485 /* Parse a simple-type-specifier.
13487 simple-type-specifier:
13488 :: [opt] nested-name-specifier [opt] type-name
13489 :: [opt] nested-name-specifier template template-id
13490 char
13491 wchar_t
13492 bool
13493 short
13494 int
13495 long
13496 signed
13497 unsigned
13498 float
13499 double
13500 void
13502 C++0x Extension:
13504 simple-type-specifier:
13505 auto
13506 decltype ( expression )
13507 char16_t
13508 char32_t
13509 __underlying_type ( type-id )
13511 GNU Extension:
13513 simple-type-specifier:
13514 __int128
13515 __typeof__ unary-expression
13516 __typeof__ ( type-id )
13518 Returns the indicated TYPE_DECL. If DECL_SPECS is not NULL, it is
13519 appropriately updated. */
13521 static tree
13524 cp_parser_flags flags)
13525 {
13529 /* Peek at the next token. */
13532 /* If we're looking at a keyword, things are easy. */
13534 {
13597 /* Since DR 743, decltype can either be a simple-type-specifier by
13598 itself or begin a nested-name-specifier. Parsing it will replace
13599 it with a CPP_DECLTYPE, so just rewind and let the CPP_DECLTYPE
13600 handling below decide what to do. */
13606 /* Consume the `typeof' token. */
13608 /* Parse the operand to `typeof'. */
13610 /* If it is not already a TYPE, take its type. */
13640 }
13642 /* If token is an already-parsed decltype not followed by ::,
13643 it's a simple-type-specifier. */
13646 {
13654 }
13656 /* If the type-specifier was for a built-in type, we're done. */
13658 {
13659 /* Record the type. */
13666 type,
13672 /* Consume the token. */
13675 /* There is no valid C++ program where a non-template type is
13676 followed by a "<". That usually indicates that the user thought
13677 that the type was a template. */
13682 }
13684 /* The type-specifier must be a user-defined type. */
13686 {
13690 /* Don't gobble tokens or issue error messages if this is an
13691 optional type-specifier. */
13695 /* Look for the optional `::' operator. */
13696 global_p
13700 /* Look for the nested-name specifier. */
13701 qualified_p
13709 /* If we have seen a nested-name-specifier, and the next token
13710 is `template', then we are using the template-id production. */
13713 {
13714 /* Look for the template-id. */
13718 none_type,
13720 /* If the template-id did not name a type, we are out of
13721 luck. */
13723 {
13726 }
13727 }
13728 /* Otherwise, look for a type-name. */
13729 else
13731 /* Keep track of all name-lookups performed in class scopes. */
13733 && !global_p
13734 && !qualified_p
13738 /* If it didn't work out, we don't have a TYPE. */
13746 }
13748 /* If we didn't get a type-name, issue an error message. */
13750 {
13753 }
13756 {
13757 /* See if TYPE is an Objective-C type, and if so, parse and
13758 accept any protocol references following it. Do this before
13759 the cp_parser_check_for_invalid_template_id() call, because
13760 Objective-C types can be followed by '<...>' which would
13761 enclose protocol names rather than template arguments, and so
13762 everything is fine. */
13765 {
13769 /* Clobber the "unqualified" type previously entered into
13770 DECL_SPECS with the new, improved protocol-qualified version. */
13775 }
13777 /* There is no valid C++ program where a non-template type is
13778 followed by a "<". That usually indicates that the user
13779 thought that the type was a template. */
13781 none_type,
13783 }
13786 }
13788 /* Parse a type-name.
13790 type-name:
13791 class-name
13792 enum-name
13793 typedef-name
13794 simple-template-id [in c++0x]
13796 enum-name:
13797 identifier
13799 typedef-name:
13800 identifier
13802 Returns a TYPE_DECL for the type. */
13804 static tree
13806 {
13807 tree type_decl;
13809 /* We can't know yet whether it is a class-name or not. */
13811 /* Try a class-name. */
13815 none_type,
13819 /* If it's not a class-name, keep looking. */
13821 {
13823 /* It must be a typedef-name or an enum-name. */
13827 /* It is either a simple-template-id representing an
13828 instantiation of an alias template... */
13832 none_type,
13834 /* Note that this must be an instantiation of an alias template
13835 because [temp.names]/6 says:
13837 A template-id that names an alias template specialization
13838 is a type-name.
13840 Whereas [temp.names]/7 says:
13842 A simple-template-id that names a class template
13843 specialization is a class-name. */
13848 else
13852 /* ... Or a typedef-name or an enum-name. */
13854 }
13857 }
13859 /* Parse a non-class type-name, that is, either an enum-name or a typedef-name.
13861 enum-name:
13862 identifier
13864 typedef-name:
13865 identifier
13867 Returns a TYPE_DECL for the type. */
13869 static tree
13871 {
13872 tree type_decl;
13873 tree identifier;
13880 /* Look up the type-name. */
13884 {
13888 {
13889 /* We have found a type introduced by a using
13890 declaration at class scope that refers to a dependent
13891 type.
13893 using typename :: [opt] nested-name-specifier unqualified-id ;
13894 */
13900 }
13901 }
13905 {
13906 /* See if this is an Objective-C type. */
13911 }
13913 /* Issue an error if we did not find a type-name. */
13915 /* In Objective-C, we have the complication that class names are
13916 normally type names and start declarations (eg, the
13917 "NSObject" in "NSObject *object;"), but can be used in an
13918 Objective-C 2.0 dot-syntax (as in "NSObject.version") which
13919 is an expression. So, a classname followed by a dot is not a
13920 valid type-name. */
13923 {
13928 }
13929 /* Remember that the name was used in the definition of the
13930 current class so that we can check later to see if the
13931 meaning would have been different after the class was
13932 entirely defined. */
13938 }
13940 /* Parse an elaborated-type-specifier. Note that the grammar given
13941 here incorporates the resolution to DR68.
13943 elaborated-type-specifier:
13944 class-key :: [opt] nested-name-specifier [opt] identifier
13945 class-key :: [opt] nested-name-specifier [opt] template [opt] template-id
13946 enum-key :: [opt] nested-name-specifier [opt] identifier
13947 typename :: [opt] nested-name-specifier identifier
13948 typename :: [opt] nested-name-specifier template [opt]
13949 template-id
13951 GNU extension:
13953 elaborated-type-specifier:
13954 class-key attributes :: [opt] nested-name-specifier [opt] identifier
13955 class-key attributes :: [opt] nested-name-specifier [opt]
13956 template [opt] template-id
13957 enum attributes :: [opt] nested-name-specifier [opt] identifier
13959 If IS_FRIEND is TRUE, then this elaborated-type-specifier is being
13960 declared `friend'. If IS_DECLARATION is TRUE, then this
13961 elaborated-type-specifier appears in a decl-specifiers-seq, i.e.,
13962 something is being declared.
13964 Returns the TYPE specified. */
13966 static tree
13970 {
13972 tree identifier;
13975 tree globalscope;
13978 /* See if we're looking at the `enum' keyword. */
13980 {
13981 /* Consume the `enum' token. */
13983 /* Remember that it's an enumeration type. */
13985 /* Issue a warning if the `struct' or `class' key (for C++0x scoped
13986 enums) is used here. */
13989 {
13993 /* Consume the `struct' or `class' and parse it anyway. */
13995 }
13996 /* Parse the attributes. */
13998 }
13999 /* Or, it might be `typename'. */
14001 RID_TYPENAME))
14002 {
14003 /* Consume the `typename' token. */
14005 /* Remember that it's a `typename' type. */
14007 }
14008 /* Otherwise it must be a class-key. */
14009 else
14010 {
14014 /* Parse the attributes. */
14016 }
14018 /* Look for the `::' operator. */
14021 /* Look for the nested-name-specifier. */
14023 {
14028 is_declaration))
14030 }
14031 else
14032 /* Even though `typename' is not present, the proposed resolution
14033 to Core Issue 180 says that in `class A<T>::B', `B' should be
14034 considered a type-name, even if `A<T>' is dependent. */
14039 is_declaration);
14040 /* For everything but enumeration types, consider a template-id.
14041 For an enumeration type, consider only a plain identifier. */
14043 {
14045 tree decl;
14047 /* Allow the `template' keyword. */
14049 /* If we didn't see `template', we don't know if there's a
14050 template-id or not. */
14053 /* Parse the template-id. */
14057 tag_type,
14058 is_declaration);
14059 /* If we didn't find a template-id, look for an ordinary
14060 identifier. */
14062 ;
14063 /* If DECL is a TEMPLATE_ID_EXPR, and the `typename' keyword is
14064 in effect, then we must assume that, upon instantiation, the
14065 template will correspond to a class. */
14069 typename_type,
14071 /* If the `typename' keyword is in effect and DECL is not a type
14072 decl. Then type is non existant. */
14075 else
14078 }
14081 {
14086 {
14089 }
14091 /* For a `typename', we needn't call xref_tag. */
14095 identifier,
14097 /* Look up a qualified name in the usual way. */
14099 {
14100 tree decl;
14101 tree ambiguous_decls;
14104 tag_type,
14111 /* If the lookup was ambiguous, an error will already have been
14112 issued. */
14116 /* If we are parsing friend declaration, DECL may be a
14117 TEMPLATE_DECL tree node here. However, we need to check
14118 whether this TEMPLATE_DECL results in valid code. Consider
14119 the following example:
14121 namespace N {
14122 template <class T> class C {};
14123 }
14124 class X {
14125 template <class T> friend class N::C; // #1, valid code
14126 };
14127 template <class T> class Y {
14128 friend class N::C; // #2, invalid code
14129 };
14131 For both case #1 and #2, we arrive at a TEMPLATE_DECL after
14132 name lookup of `N::C'. We see that friend declaration must
14133 be template for the code to be valid. Note that
14134 processing_template_decl does not work here since it is
14135 always 1 for the above two cases. */
14137 decl = (cp_parser_maybe_treat_template_as_class
14142 {
14145 identifier,
14148 }
14151 {
14155 allow_template);
14159 }
14161 /* Forward declarations of nested types, such as
14163 class C1::C2;
14164 class C1::C2::C3;
14166 are invalid unless all components preceding the final '::'
14167 are complete. If all enclosing types are complete, these
14168 declarations become merely pointless.
14170 Invalid forward declarations of nested types are errors
14171 caught elsewhere in parsing. Those that are pointless arrive
14172 here. */
14179 }
14180 else
14181 {
14182 /* An elaborated-type-specifier sometimes introduces a new type and
14183 sometimes names an existing type. Normally, the rule is that it
14184 introduces a new type only if there is not an existing type of
14185 the same name already in scope. For example, given:
14187 struct S {};
14188 void f() { struct S s; }
14190 the `struct S' in the body of `f' is the same `struct S' as in
14191 the global scope; the existing definition is used. However, if
14192 there were no global declaration, this would introduce a new
14193 local class named `S'.
14195 An exception to this rule applies to the following code:
14197 namespace N { struct S; }
14199 Here, the elaborated-type-specifier names a new type
14200 unconditionally; even if there is already an `S' in the
14201 containing scope this declaration names a new type.
14202 This exception only applies if the elaborated-type-specifier
14203 forms the complete declaration:
14205 [class.name]
14207 A declaration consisting solely of `class-key identifier ;' is
14208 either a redeclaration of the name in the current scope or a
14209 forward declaration of the identifier as a class name. It
14210 introduces the name into the current scope.
14212 We are in this situation precisely when the next token is a `;'.
14214 An exception to the exception is that a `friend' declaration does
14215 *not* name a new type; i.e., given:
14217 struct S { friend struct T; };
14219 `T' is not a new type in the scope of `S'.
14221 Also, `new struct S' or `sizeof (struct S)' never results in the
14222 definition of a new type; a new type can only be declared in a
14223 declaration context. */
14225 tag_scope ts;
14229 /* Friends have special name lookup rules. */
14233 CPP_SEMICOLON))
14234 /* This is a `class-key identifier ;' */
14236 else
14239 template_p =
14243 /* An unqualified name was used to reference this type, so
14244 there were no qualifying templates. */
14251 }
14252 }
14257 /* Allow attributes on forward declarations of classes. */
14259 {
14269 else
14272 }
14275 {
14276 /* Indicate whether this class was declared as a `class' or as a
14277 `struct'. */
14281 }
14283 /* A "<" cannot follow an elaborated type specifier. If that
14284 happens, the user was probably trying to form a template-id. */
14289 }
14291 /* Parse an enum-specifier.
14293 enum-specifier:
14294 enum-head { enumerator-list [opt] }
14295 enum-head { enumerator-list , } [C++0x]
14297 enum-head:
14298 enum-key identifier [opt] enum-base [opt]
14299 enum-key nested-name-specifier identifier enum-base [opt]
14301 enum-key:
14302 enum
14303 enum class [C++0x]
14304 enum struct [C++0x]
14306 enum-base: [C++0x]
14307 : type-specifier-seq
14309 opaque-enum-specifier:
14310 enum-key identifier enum-base [opt] ;
14312 GNU Extensions:
14313 enum-key attributes[opt] identifier [opt] enum-base [opt]
14314 { enumerator-list [opt] }attributes[opt]
14315 enum-key attributes[opt] identifier [opt] enum-base [opt]
14316 { enumerator-list, }attributes[opt] [C++0x]
14318 Returns an ENUM_TYPE representing the enumeration, or NULL_TREE
14319 if the token stream isn't an enum-specifier after all. */
14321 static tree
14323 {
14324 tree identifier;
14326 tree prev_scope;
14328 tree attributes;
14341 /* Parse tentatively so that we can back up if we don't find a
14342 enum-specifier. */
14345 /* Caller guarantees that the current token is 'enum', an identifier
14346 possibly follows, and the token after that is an opening brace.
14347 If we don't have an identifier, fabricate an anonymous name for
14348 the enumeration being defined. */
14351 /* Parse the "class" or "struct", which indicates a scoped
14352 enumeration type in C++0x. */
14355 {
14359 /* Consume the `struct' or `class' token. */
14363 }
14367 /* Clear the qualification. */
14372 /* Figure out in what scope the declaration is being placed. */
14378 nested_name_specifier
14386 {
14387 tree name;
14391 enum_type,
14396 input_location);
14398 {
14401 {
14402 /* Are template enums allowed in ISO? */
14406 /* ignore a typename reference, for it will be solved by name
14407 in start_enum. */
14409 }
14410 }
14411 else
14414 }
14415 else
14416 {
14419 else
14420 {
14423 }
14424 }
14427 /* Check for the `:' that denotes a specified underlying type in C++0x.
14428 Note that a ':' could also indicate a bitfield width, however. */
14430 {
14431 cp_decl_specifier_seq type_specifiers;
14433 /* Consume the `:'. */
14436 /* Parse the type-specifier-seq. */
14441 /* At this point this is surely not elaborated type specifier. */
14450 /* If that didn't work, stop. */
14452 {
14457 }
14458 }
14460 /* Look for the `{' but don't consume it yet. */
14462 {
14464 {
14467 {
14470 }
14471 }
14472 /* An opaque-enum-specifier must have a ';' here. */
14475 {
14478 {
14481 }
14482 }
14483 }
14489 {
14491 {
14495 }
14497 {
14499 }
14500 }
14502 /* Issue an error message if type-definitions are forbidden here. */
14505 else
14506 /* Create the new type. We do this before consuming the opening
14507 brace so the enum will be recorded as being on the line of its
14508 tag (or the 'enum' keyword, if there is no tag). */
14512 /* If the next token is not '{' it is an opaque-enum-specifier or an
14513 elaborated-type-specifier. */
14515 {
14518 {
14519 /* The following catches invalid code such as:
14520 enum class S<int>::E { A, B, C }; */
14527 /* If that scope does not contain the scope in which the
14528 class was originally declared, the program is invalid. */
14530 {
14533 "declaration of %qD in namespace %qD which does not "
14536 else
14541 }
14542 }
14547 /* Consume the opening brace. */
14554 {
14558 }
14559 else
14560 {
14565 }
14569 /* If the next token is not '}', then there are some enumerators. */
14573 /* Consume the final '}'. */
14579 }
14580 else
14581 {
14582 /* If a ';' follows, then it is an opaque-enum-specifier
14583 and additional restrictions apply. */
14585 {
14592 }
14593 }
14595 /* Look for trailing attributes to apply to this enumeration, and
14596 apply them if appropriate. */
14598 {
14602 trailing_attr,
14604 }
14606 /* Finish up the enumeration. */
14608 {
14613 }
14616 {
14618 {
14621 }
14623 {
14625 }
14626 }
14627 out:
14630 }
14632 /* Parse an enumerator-list. The enumerators all have the indicated
14633 TYPE.
14635 enumerator-list:
14636 enumerator-definition
14637 enumerator-list , enumerator-definition */
14639 static void
14641 {
14643 {
14644 /* Parse an enumerator-definition. */
14647 /* If the next token is not a ',', we've reached the end of
14648 the list. */
14651 /* Otherwise, consume the `,' and keep going. */
14653 /* If the next token is a `}', there is a trailing comma. */
14655 {
14660 }
14661 }
14662 }
14664 /* Parse an enumerator-definition. The enumerator has the indicated
14665 TYPE.
14667 enumerator-definition:
14668 enumerator
14669 enumerator = constant-expression
14671 enumerator:
14672 identifier */
14674 static void
14676 {
14677 tree identifier;
14678 tree value;
14679 location_t loc;
14681 /* Save the input location because we are interested in the location
14682 of the identifier and not the location of the explicit value. */
14685 /* Look for the identifier. */
14690 /* If the next token is an '=', then there is an explicit value. */
14692 {
14693 /* Consume the `=' token. */
14695 /* Parse the value. */
14698 NULL);
14699 }
14700 else
14703 /* If we are processing a template, make sure the initializer of the
14704 enumerator doesn't contain any bare template parameter pack. */
14708 /* integral_constant_value will pull out this expression, so make sure
14709 it's folded as appropriate. */
14712 /* Create the enumerator. */
14714 }
14716 /* Parse a namespace-name.
14718 namespace-name:
14719 original-namespace-name
14720 namespace-alias
14722 Returns the NAMESPACE_DECL for the namespace. */
14724 static tree
14726 {
14727 tree identifier;
14728 tree namespace_decl;
14732 /* Get the name of the namespace. */
14737 /* Look up the identifier in the currently active scope. Look only
14738 for namespaces, due to:
14740 [basic.lookup.udir]
14742 When looking up a namespace-name in a using-directive or alias
14743 definition, only namespace names are considered.
14745 And:
14747 [basic.lookup.qual]
14749 During the lookup of a name preceding the :: scope resolution
14750 operator, object, function, and enumerator names are ignored.
14752 (Note that cp_parser_qualifying_entity only calls this
14753 function if the token after the name is the scope resolution
14754 operator.) */
14756 none_type,
14762 /* If it's not a namespace, issue an error. */
14765 {
14770 }
14773 }
14775 /* Parse a namespace-definition.
14777 namespace-definition:
14778 named-namespace-definition
14779 unnamed-namespace-definition
14781 named-namespace-definition:
14782 original-namespace-definition
14783 extension-namespace-definition
14785 original-namespace-definition:
14786 namespace identifier { namespace-body }
14788 extension-namespace-definition:
14789 namespace original-namespace-name { namespace-body }
14791 unnamed-namespace-definition:
14792 namespace { namespace-body } */
14794 static void
14796 {
14802 {
14806 }
14807 else
14810 /* Look for the `namespace' keyword. */
14813 /* Get the name of the namespace. We do not attempt to distinguish
14814 between an original-namespace-definition and an
14815 extension-namespace-definition at this point. The semantic
14816 analysis routines are responsible for that. */
14819 else
14822 /* Parse any specified attributes. */
14825 /* Look for the `{' to start the namespace. */
14827 /* Start the namespace. */
14830 /* "inline namespace" is equivalent to a stub namespace definition
14831 followed by a strong using directive. */
14833 {
14835 /* Set up namespace association. */
14839 /* Import the contents of the inline namespace. */
14843 }
14847 /* Parse the body of the namespace. */
14853 /* Finish the namespace. */
14855 /* Look for the final `}'. */
14857 }
14859 /* Parse a namespace-body.
14861 namespace-body:
14862 declaration-seq [opt] */
14864 static void
14866 {
14868 }
14870 /* Parse a namespace-alias-definition.
14872 namespace-alias-definition:
14873 namespace identifier = qualified-namespace-specifier ; */
14875 static void
14877 {
14878 tree identifier;
14879 tree namespace_specifier;
14883 /* Look for the `namespace' keyword. */
14885 /* Look for the identifier. */
14889 /* Look for the `=' token. */
14892 {
14894 /* Skip the definition. */
14899 }
14901 /* Look for the qualified-namespace-specifier. */
14902 namespace_specifier
14904 /* Look for the `;' token. */
14907 /* Register the alias in the symbol table. */
14909 }
14911 /* Parse a qualified-namespace-specifier.
14913 qualified-namespace-specifier:
14914 :: [opt] nested-name-specifier [opt] namespace-name
14916 Returns a NAMESPACE_DECL corresponding to the specified
14917 namespace. */
14919 static tree
14921 {
14922 /* Look for the optional `::'. */
14926 /* Look for the optional nested-name-specifier. */
14934 }
14936 /* Parse a using-declaration, or, if ACCESS_DECLARATION_P is true, an
14937 access declaration.
14939 using-declaration:
14940 using typename [opt] :: [opt] nested-name-specifier unqualified-id ;
14941 using :: unqualified-id ;
14943 access-declaration:
14944 qualified-id ;
14946 */
14948 static bool
14951 {
14955 tree decl;
14956 tree identifier;
14957 tree qscope;
14962 {
14965 }
14966 else
14967 {
14968 /* Look for the `using' keyword. */
14971 /* Peek at the next token. */
14973 /* See if it's `typename'. */
14975 {
14976 /* Remember that we've seen it. */
14978 /* Consume the `typename' token. */
14980 }
14981 }
14983 /* Look for the optional global scope qualification. */
14984 global_scope_p
14989 /* If we saw `typename', or didn't see `::', then there must be a
14990 nested-name-specifier present. */
14996 /* Otherwise, we could be in either of the two productions. In that
14997 case, treat the nested-name-specifier as optional. */
14998 else
15008 /* Something has already gone wrong; there's no need to parse
15009 further. Since an error has occurred, the return value of
15010 cp_parser_parse_definitely will be false, as required. */
15014 /* Parse the unqualified-id. */
15022 {
15027 }
15029 /* The function we call to handle a using-declaration is different
15030 depending on what scope we are in. */
15032 ;
15035 /* [namespace.udecl]
15037 A using declaration shall not name a template-id. */
15040 else
15041 {
15043 {
15044 /* Create the USING_DECL. */
15052 else
15053 /* Add it to the list of members in this class. */
15055 }
15056 else
15057 {
15059 identifier,
15069 else
15071 }
15072 }
15074 /* Look for the final `;'. */
15079 "access declarations are deprecated "
15080 "in favour of using-declarations; "
15084 }
15086 /* Parse an alias-declaration.
15088 alias-declaration:
15089 using identifier attribute-specifier-seq [opt] = type-id */
15091 static tree
15093 {
15097 cp_decl_specifier_seq decl_specs;
15101 /* Look for the `using' keyword. */
15119 /* Now we are going to parse the type-id of the declaration. */
15121 /*
15122 [dcl.type]/3 says:
15124 "A type-specifier-seq shall not define a class or enumeration
15125 unless it appears in the type-id of an alias-declaration (7.1.3) that
15126 is not the declaration of a template-declaration."
15128 In other words, if we currently are in an alias template, the
15129 type-id should not define a type.
15131 So let's set parser->type_definition_forbidden_message in that
15132 case; cp_parser_check_type_definition (called by
15133 cp_parser_class_specifier) will then emit an error if a type is
15134 defined in the type-id. */
15136 {
15140 }
15144 /* Restore the error message if need be. */
15153 /* A typedef-name can also be introduced by an alias-declaration. The
15154 identifier following the using keyword becomes a typedef-name. It has
15155 the same semantics as if it were introduced by the typedef
15156 specifier. In particular, it does not define a new type and it shall
15157 not appear in the type-id. */
15162 {
15165 ds_attribute,
15166 attrs_location);
15167 }
15169 ds_typedef,
15170 using_location);
15172 ds_alias,
15173 using_location);
15182 else
15193 /* If decl is a template, return its TEMPLATE_DECL so that it gets
15194 added into the symbol table; otherwise, return the TYPE_DECL. */
15198 {
15202 }
15205 }
15207 /* Parse a using-directive.
15209 using-directive:
15210 using namespace :: [opt] nested-name-specifier [opt]
15211 namespace-name ; */
15213 static void
15215 {
15216 tree namespace_decl;
15217 tree attribs;
15219 /* Look for the `using' keyword. */
15221 /* And the `namespace' keyword. */
15223 /* Look for the optional `::' operator. */
15225 /* And the optional nested-name-specifier. */
15231 /* Get the namespace being used. */
15233 /* And any specified attributes. */
15235 /* Update the symbol table. */
15237 /* Look for the final `;'. */
15239 }
15241 /* Parse an asm-definition.
15243 asm-definition:
15244 asm ( string-literal ) ;
15246 GNU Extension:
15248 asm-definition:
15249 asm volatile [opt] ( string-literal ) ;
15250 asm volatile [opt] ( string-literal : asm-operand-list [opt] ) ;
15251 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15252 : asm-operand-list [opt] ) ;
15253 asm volatile [opt] ( string-literal : asm-operand-list [opt]
15254 : asm-operand-list [opt]
15255 : asm-clobber-list [opt] ) ;
15256 asm volatile [opt] goto ( string-literal : : asm-operand-list [opt]
15257 : asm-clobber-list [opt]
15258 : asm-goto-list ) ; */
15260 static void
15262 {
15263 tree string;
15268 tree asm_stmt;
15276 /* Look for the `asm' keyword. */
15278 /* See if the next token is `volatile'. */
15281 {
15282 /* Remember that we saw the `volatile' keyword. */
15284 /* Consume the token. */
15286 }
15290 {
15291 /* Remember that we saw the `goto' keyword. */
15293 /* Consume the token. */
15295 }
15296 /* Look for the opening `('. */
15299 /* Look for the string. */
15302 {
15306 }
15308 /* If we're allowing GNU extensions, check for the extended assembly
15309 syntax. Unfortunately, the `:' tokens need not be separated by
15310 a space in C, and so, for compatibility, we tolerate that here
15311 too. Doing that means that we have to treat the `::' operator as
15312 two `:' tokens. */
15317 {
15322 /* The extended syntax was used. */
15325 /* Look for outputs. */
15327 {
15328 /* Consume the `:'. */
15330 /* Parse the output-operands. */
15332 CPP_COLON)
15334 CPP_SCOPE)
15336 CPP_CLOSE_PAREN)
15342 }
15343 /* If the next token is `::', there are no outputs, and the
15344 next token is the beginning of the inputs. */
15346 /* The inputs are coming next. */
15349 /* Look for inputs. */
15352 {
15353 /* Consume the `:' or `::'. */
15355 /* Parse the output-operands. */
15357 CPP_COLON)
15359 CPP_SCOPE)
15361 CPP_CLOSE_PAREN))
15366 }
15368 /* The clobbers are coming next. */
15371 /* Look for clobbers. */
15374 {
15376 /* Consume the `:' or `::'. */
15378 /* Parse the clobbers. */
15380 CPP_COLON)
15382 CPP_CLOSE_PAREN))
15384 }
15387 /* The labels are coming next. */
15390 /* Look for labels. */
15393 {
15395 /* Consume the `:' or `::'. */
15397 /* Parse the labels. */
15399 }
15403 }
15407 /* Look for the closing `)'. */
15415 {
15416 /* Create the ASM_EXPR. */
15418 {
15421 /* If the extended syntax was not used, mark the ASM_EXPR. */
15423 {
15429 }
15430 }
15431 else
15433 }
15434 }
15436 /* Declarators [gram.dcl.decl] */
15438 /* Parse an init-declarator.
15440 init-declarator:
15441 declarator initializer [opt]
15443 GNU Extension:
15445 init-declarator:
15446 declarator asm-specification [opt] attributes [opt] initializer [opt]
15448 function-definition:
15449 decl-specifier-seq [opt] declarator ctor-initializer [opt]
15450 function-body
15451 decl-specifier-seq [opt] declarator function-try-block
15453 GNU Extension:
15455 function-definition:
15456 __extension__ function-definition
15458 TM Extension:
15460 function-definition:
15461 decl-specifier-seq [opt] declarator function-transaction-block
15463 The DECL_SPECIFIERS apply to this declarator. Returns a
15464 representation of the entity declared. If MEMBER_P is TRUE, then
15465 this declarator appears in a class scope. The new DECL created by
15466 this declarator is returned.
15468 The CHECKS are access checks that should be performed once we know
15469 what entity is being declared (and, therefore, what classes have
15470 befriended it).
15472 If FUNCTION_DEFINITION_ALLOWED_P then we handle the declarator and
15473 for a function-definition here as well. If the declarator is a
15474 declarator for a function-definition, *FUNCTION_DEFINITION_P will
15475 be TRUE upon return. By that point, the function-definition will
15476 have been completely parsed.
15478 FUNCTION_DEFINITION_P may be NULL if FUNCTION_DEFINITION_ALLOWED_P
15479 is FALSE.
15481 If MAYBE_RANGE_FOR_DECL is not NULL, the pointed tree will be set to the
15482 parsed declaration if it is an uninitialized single declarator not followed
15483 by a `;', or to error_mark_node otherwise. Either way, the trailing `;',
15484 if present, will not be consumed. If returned, this declarator will be
15485 created with SD_INITIALIZED but will not call cp_finish_decl. */
15487 static tree
15496 {
15500 tree prefix_attributes;
15501 tree attributes;
15502 tree asm_specification;
15503 tree initializer;
15505 tree scope;
15507 /* Only valid if IS_INITIALIZED is true. In that case, CPP_EQ if
15508 initialized with "= ..", CPP_OPEN_PAREN if initialized with
15509 "(...)". */
15518 /* Gather the attributes that were provided with the
15519 decl-specifiers. */
15522 /* Assume that this is not the declarator for a function
15523 definition. */
15527 /* Defer access checks while parsing the declarator; we cannot know
15528 what names are accessible until we know what is being
15529 declared. */
15532 /* Parse the declarator. */
15534 declarator
15538 member_p);
15539 /* Gather up the deferred checks. */
15542 /* If the DECLARATOR was erroneous, there's no need to go
15543 further. */
15547 /* Check that the number of template-parameter-lists is OK. */
15557 /* Figure out what scope the entity declared by the DECLARATOR is
15558 located in. `grokdeclarator' sometimes changes the scope, so
15559 we compute it now. */
15562 /* Perform any lookups in the declared type which were thought to be
15563 dependent, but are not in the scope of the declarator. */
15564 decl_specifiers->type
15567 /* If we're allowing GNU extensions, look for an asm-specification
15568 and attributes. */
15570 {
15571 /* Look for an asm-specification. */
15574 /* And attributes. */
15577 }
15578 else
15579 {
15582 }
15584 /* Peek at the next token. */
15586 /* Check to see if the token indicates the start of a
15587 function-definition. */
15590 {
15592 {
15593 /* If a function-definition should not appear here, issue an
15594 error message. */
15598 }
15599 else
15600 {
15601 location_t func_brace_location
15604 /* Neither attributes nor an asm-specification are allowed
15605 on a function-definition. */
15608 "an asm-specification is not allowed "
15613 /* This is a function-definition. */
15616 /* Parse the function definition. */
15619 decl_specifiers,
15620 declarator,
15621 prefix_attributes);
15622 else
15623 decl
15624 = (cp_parser_function_definition_from_specifiers_and_declarator
15628 {
15629 /* This is where the prologue starts... */
15632 }
15635 }
15636 }
15638 /* [dcl.dcl]
15640 Only in function declarations for constructors, destructors, and
15641 type conversions can the decl-specifier-seq be omitted.
15643 We explicitly postpone this check past the point where we handle
15644 function-definitions because we tolerate function-definitions
15645 that are missing their return types in some modes. */
15647 {
15651 }
15653 /* An `=' or an `(', or an '{' in C++0x, indicates an initializer. */
15657 {
15665 {
15671 }
15672 }
15673 else
15674 {
15675 /* If the init-declarator isn't initialized and isn't followed by a
15676 `,' or `;', it's not a valid init-declarator. */
15679 {
15682 else
15683 {
15686 }
15687 }
15690 }
15692 /* Because start_decl has side-effects, we should only call it if we
15693 know we're going ahead. By this point, we know that we cannot
15694 possibly be looking at any other construct. */
15697 /* If the decl specifiers were bad, issue an error now that we're
15698 sure this was intended to be a declarator. Then continue
15699 declaring the variable(s), as int, to try to cut down on further
15700 errors. */
15703 {
15706 }
15708 /* Check to see whether or not this declaration is a friend. */
15711 /* Enter the newly declared entry in the symbol table. If we're
15712 processing a declaration in a class-specifier, we wait until
15713 after processing the initializer. */
15715 {
15722 /* Adjust location of decl if declarator->id_loc is more appropriate:
15723 set, and decl wasn't merged with another decl, in which case its
15724 location would be different from input_location, and more accurate. */
15729 }
15731 /* Enter the SCOPE. That way unqualified names appearing in the
15732 initializer will be looked up in SCOPE. */
15735 /* Perform deferred access control checks, now that we know in which
15736 SCOPE the declared entity resides. */
15738 {
15741 /* If the entity being declared is a function, pretend that we
15742 are in its scope. If it is a `friend', it may have access to
15743 things that would not otherwise be accessible. */
15745 {
15748 }
15750 /* Perform access checks for template parameters. */
15753 /* Perform the access control checks for the declarator and the
15754 decl-specifiers. */
15757 /* Restore the saved value. */
15760 }
15762 /* Parse the initializer. */
15767 {
15769 {
15773 else
15774 {
15775 /* If the declaration was erroneous, we don't really
15776 know what the user intended, so just silently
15777 consume the initializer. */
15785 }
15786 }
15787 else
15788 {
15789 /* We want to record the extra mangling scope for in-class
15790 initializers of class members and initializers of static data
15791 member templates. The former involves deferring
15792 parsing of the initializer until end of class as with default
15793 arguments. So right here we only handle the latter. */
15803 }
15804 }
15806 /* The old parser allows attributes to appear after a parenthesized
15807 initializer. Mark Mitchell proposed removing this functionality
15808 on the GCC mailing lists on 2002-08-13. This parser accepts the
15809 attributes -- but ignores them. */
15816 /* For an in-class declaration, use `grokfield' to create the
15817 declaration. */
15819 {
15821 {
15824 }
15828 prefix_attributes);
15831 }
15833 /* Finish processing the declaration. But, skip member
15834 declarations. */
15836 {
15839 asm_specification,
15840 /* If the initializer is in parentheses, then this is
15841 a direct-initialization, which means that an
15842 `explicit' constructor is OK. Otherwise, an
15843 `explicit' constructor cannot be used. */
15846 }
15849 /* Core issue #226 (C++0x only): A default template-argument
15850 shall not be specified in a friend class template
15851 declaration. */
15859 }
15861 /* Parse a declarator.
15863 declarator:
15864 direct-declarator
15865 ptr-operator declarator
15867 abstract-declarator:
15868 ptr-operator abstract-declarator [opt]
15869 direct-abstract-declarator
15871 GNU Extensions:
15873 declarator:
15874 attributes [opt] direct-declarator
15875 attributes [opt] ptr-operator declarator
15877 abstract-declarator:
15878 attributes [opt] ptr-operator abstract-declarator [opt]
15879 attributes [opt] direct-abstract-declarator
15881 If CTOR_DTOR_OR_CONV_P is not NULL, *CTOR_DTOR_OR_CONV_P is used to
15882 detect constructor, destructor or conversion operators. It is set
15883 to -1 if the declarator is a name, and +1 if it is a
15884 function. Otherwise it is set to zero. Usually you just want to
15885 test for >0, but internally the negative value is used.
15887 (The reason for CTOR_DTOR_OR_CONV_P is that a declaration must have
15888 a decl-specifier-seq unless it declares a constructor, destructor,
15889 or conversion. It might seem that we could check this condition in
15890 semantic analysis, rather than parsing, but that makes it difficult
15891 to handle something like `f()'. We want to notice that there are
15892 no decl-specifiers, and therefore realize that this is an
15893 expression, not a declaration.)
15895 If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to true iff
15896 the declarator is a direct-declarator of the form "(...)".
15898 MEMBER_P is true iff this declarator is a member-declarator. */
15902 cp_parser_declarator_kind dcl_kind,
15906 {
15909 cp_cv_quals cv_quals;
15910 tree class_type;
15913 /* Assume this is not a constructor, destructor, or type-conversion
15914 operator. */
15921 /* Check for the ptr-operator production. */
15923 /* Parse the ptr-operator. */
15927 /* If that worked, then we have a ptr-operator. */
15929 {
15930 /* If a ptr-operator was found, then this declarator was not
15931 parenthesized. */
15934 /* The dependent declarator is optional if we are parsing an
15935 abstract-declarator. */
15939 /* Parse the dependent declarator. */
15945 /* If we are parsing an abstract-declarator, we must handle the
15946 case where the dependent declarator is absent. */
15951 declarator = cp_parser_make_indirect_declarator
15953 }
15954 /* Everything else is a direct-declarator. */
15955 else
15956 {
15959 CPP_OPEN_PAREN);
15961 ctor_dtor_or_conv_p,
15962 member_p);
15963 }
15969 }
15971 /* Parse a direct-declarator or direct-abstract-declarator.
15973 direct-declarator:
15974 declarator-id
15975 direct-declarator ( parameter-declaration-clause )
15976 cv-qualifier-seq [opt]
15977 exception-specification [opt]
15978 direct-declarator [ constant-expression [opt] ]
15979 ( declarator )
15981 direct-abstract-declarator:
15982 direct-abstract-declarator [opt]
15983 ( parameter-declaration-clause )
15984 cv-qualifier-seq [opt]
15985 exception-specification [opt]
15986 direct-abstract-declarator [opt] [ constant-expression [opt] ]
15987 ( abstract-declarator )
15989 Returns a representation of the declarator. DCL_KIND is
15990 CP_PARSER_DECLARATOR_ABSTRACT, if we are parsing a
15991 direct-abstract-declarator. It is CP_PARSER_DECLARATOR_NAMED, if
15992 we are parsing a direct-declarator. It is
15993 CP_PARSER_DECLARATOR_EITHER, if we can accept either - in the case
15994 of ambiguity we prefer an abstract declarator, as per
15995 [dcl.ambig.res]. CTOR_DTOR_OR_CONV_P and MEMBER_P are as for
15996 cp_parser_declarator. */
16000 cp_parser_declarator_kind dcl_kind,
16003 {
16013 {
16014 /* Peek at the next token. */
16017 {
16018 /* This is either a parameter-declaration-clause, or a
16019 parenthesized declarator. When we know we are parsing a
16020 named declarator, it must be a parenthesized declarator
16021 if FIRST is true. For instance, `(int)' is a
16022 parameter-declaration-clause, with an omitted
16023 direct-abstract-declarator. But `((*))', is a
16024 parenthesized abstract declarator. Finally, when T is a
16025 template parameter `(T)' is a
16026 parameter-declaration-clause, and not a parenthesized
16027 named declarator.
16029 We first try and parse a parameter-declaration-clause,
16030 and then try a nested declarator (if FIRST is true).
16032 It is not an error for it not to be a
16033 parameter-declaration-clause, even when FIRST is
16034 false. Consider,
16036 int i (int);
16037 int i (3);
16039 The first is the declaration of a function while the
16040 second is the definition of a variable, including its
16041 initializer.
16043 Having seen only the parenthesis, we cannot know which of
16044 these two alternatives should be selected. Even more
16045 complex are examples like:
16047 int i (int (a));
16048 int i (int (3));
16050 The former is a function-declaration; the latter is a
16051 variable initialization.
16053 Thus again, we try a parameter-declaration-clause, and if
16054 that fails, we back out and return. */
16057 {
16058 tree params;
16061 tree t;
16063 /* In a member-declarator, the only valid interpretation
16064 of a parenthesis is the start of a
16065 parameter-declaration-clause. (It is invalid to
16066 initialize a static data member with a parenthesized
16067 initializer; only the "=" form of initialization is
16068 permitted.) */
16072 /* Consume the `('. */
16075 {
16076 /* If this is going to be an abstract declarator, we're
16077 in a declarator and we can't have default args. */
16080 }
16082 /* Inside the function parameter list, surrounding
16083 template-parameter-lists do not apply. */
16084 saved_num_template_parameter_lists
16090 /* Parse the parameter-declaration-clause. */
16093 parser->num_template_parameter_lists
16096 /* Consume the `)'. */
16099 /* If all went well, parse the cv-qualifier-seq and the
16100 exception-specification. */
16102 {
16103 cp_cv_quals cv_quals;
16104 cp_virt_specifiers virt_specifiers;
16105 tree exception_specification;
16106 tree late_return;
16114 /* Parse the cv-qualifier-seq. */
16116 /* And the exception-specification. */
16117 exception_specification
16120 late_return = (cp_parser_late_return_type_opt
16123 /* Parse the virt-specifier-seq. */
16126 /* Create the function-declarator. */
16128 params,
16129 cv_quals,
16130 virt_specifiers,
16131 exception_specification,
16132 late_return);
16133 /* Any subsequent parameter lists are to do with
16134 return type, so are not those of the declared
16135 function. */
16137 }
16139 /* Remove the function parms from scope. */
16145 /* Repeat the main loop. */
16147 }
16149 /* If this is the first, we can try a parenthesized
16150 declarator. */
16152 {
16158 /* Consume the `('. */
16160 /* Parse the nested declarator. */
16163 declarator
16166 member_p);
16169 /* Expect a `)'. */
16176 }
16177 /* Otherwise, we must be done. */
16178 else
16180 }
16183 {
16184 /* Parse an array-declarator. */
16185 tree bounds;
16193 /* Consume the `['. */
16195 /* Peek at the next token. */
16197 /* If the next token is `]', then there is no
16198 constant-expression. */
16200 {
16203 bounds
16213 {
16214 /* Normally, the array bound must be an integral constant
16215 expression. However, as an extension, we allow VLAs
16216 in function scopes as long as they aren't part of a
16217 parameter declaration. */
16221 }
16223 {
16224 /* Remember this wasn't a constant-expression. */
16227 }
16228 }
16229 else
16231 /* Look for the closing `]'. */
16233 {
16236 }
16239 }
16241 {
16242 {
16243 tree qualifying_scope;
16244 tree unqualified_name;
16245 special_function_kind sfk;
16250 /* Parse a declarator-id */
16253 {
16256 /* If we see an ellipsis, we should be looking at a
16257 parameter pack. */
16259 {
16260 /* Consume the `...' */
16264 }
16265 }
16268 unqualified_name
16272 {
16276 {
16277 /* Check whether an error occurred. */
16280 /* We already consumed the ellipsis to mark a
16281 parameter pack, but we have no way to report it,
16282 so abort the tentative parse. We will be exiting
16283 immediately anyway. */
16285 }
16286 else
16292 && (qualifying_scope
16295 {
16298 }
16299 }
16304 {
16309 }
16313 {
16314 /* In the declaration of a member of a template class
16315 outside of the class itself, the SCOPE will sometimes
16316 be a TYPENAME_TYPE. For example, given:
16318 template <typename T>
16319 int S<T>::R::i = 3;
16321 the SCOPE will be a TYPENAME_TYPE for `S<T>::R'. In
16322 this context, we must resolve S<T>::R to an ordinary
16323 type, rather than a typename type.
16325 The reason we normally avoid resolving TYPENAME_TYPEs
16326 is that a specialization of `S' might render
16327 `S<T>::R' not a type. However, if `S' is
16328 specialized, then this `i' will not be used, so there
16329 is no harm in resolving the types here. */
16330 tree type;
16332 /* Resolve the TYPENAME_TYPE. */
16335 /* If that failed, the declarator is invalid. */
16337 {
16340 "cannot define member of dependent typedef "
16342 else
16347 }
16349 }
16354 {
16355 tree class_type;
16360 else
16364 {
16367 {
16370 {
16374 "use %<%T::%D%> instead of %<%T::%D%> to "
16376 class_type,
16381 }
16382 else
16384 }
16385 else
16386 {
16387 /* We do not attempt to print the declarator
16388 here because we do not have enough
16389 information about its original syntactic
16390 form. */
16394 }
16395 }
16398 {
16404 for an anonymous type, even if the type
16405 got a name for linkage purposes. */
16408 class_type))
16409 {
16412 }
16420 }
16421 }
16423 unqualified_name,
16424 sfk);
16430 }
16432 handle_declarator:;
16435 /* Any names that appear after the declarator-id for a
16436 member are looked up in the containing scope. */
16441 /* Default args are only allowed on function
16442 declarations. */
16444 else
16448 }
16449 /* We're done. */
16450 else
16452 }
16454 /* For an abstract declarator, we might wind up with nothing at this
16455 point. That's an error; the declarator is not optional. */
16459 /* If we entered a scope, we must exit it now. */
16467 }
16469 /* Parse a ptr-operator.
16471 ptr-operator:
16472 * cv-qualifier-seq [opt]
16473 &
16474 :: [opt] nested-name-specifier * cv-qualifier-seq [opt]
16476 GNU Extension:
16478 ptr-operator:
16479 & cv-qualifier-seq [opt]
16481 Returns INDIRECT_REF if a pointer, or pointer-to-member, was used.
16482 Returns ADDR_EXPR if a reference was used, or NON_LVALUE_EXPR for
16483 an rvalue reference. In the case of a pointer-to-member, *TYPE is
16484 filled in with the TYPE containing the member. *CV_QUALS is
16485 filled in with the cv-qualifier-seq, or TYPE_UNQUALIFIED, if there
16486 are no cv-qualifiers. Returns ERROR_MARK if an error occurred.
16487 Note that the tree codes returned by this function have nothing
16488 to do with the types of trees that will be eventually be created
16489 to represent the pointer or reference type being parsed. They are
16490 just constants with suggestive names. */
16491 static enum tree_code
16495 {
16499 /* Assume that it's not a pointer-to-member. */
16501 /* And that there are no cv-qualifiers. */
16504 /* Peek at the next token. */
16507 /* If it's a `*', `&' or `&&' we have a pointer or reference. */
16517 {
16518 /* Consume the `*', `&' or `&&'. */
16521 /* A `*' can be followed by a cv-qualifier-seq, and so can a
16522 `&', if we are allowing GNU extensions. (The only qualifier
16523 that can legally appear after `&' is `restrict', but that is
16524 enforced during semantic analysis. */
16528 }
16529 else
16530 {
16531 /* Try the pointer-to-member case. */
16533 /* Look for the optional `::' operator. */
16536 /* Look for the nested-name specifier. */
16543 /* If we found it, and the next token is a `*', then we are
16544 indeed looking at a pointer-to-member operator. */
16547 {
16548 /* Indicate that the `*' operator was used. */
16556 else
16557 {
16558 /* The type of which the member is a member is given by the
16559 current SCOPE. */
16561 /* The next name will not be qualified. */
16565 /* Look for the optional cv-qualifier-seq. */
16567 }
16568 }
16569 /* If that didn't work we don't have a ptr-operator. */
16572 }
16575 }
16577 /* Parse an (optional) cv-qualifier-seq.
16579 cv-qualifier-seq:
16580 cv-qualifier cv-qualifier-seq [opt]
16582 cv-qualifier:
16583 const
16584 volatile
16586 GNU Extension:
16588 cv-qualifier:
16589 __restrict__
16591 Returns a bitmask representing the cv-qualifiers. */
16593 static cp_cv_quals
16595 {
16599 {
16601 cp_cv_quals cv_qualifier;
16603 /* Peek at the next token. */
16605 /* See if it's a cv-qualifier. */
16607 {
16623 }
16629 {
16632 }
16633 else
16634 {
16637 }
16638 }
16641 }
16643 /* Parse an (optional) virt-specifier-seq.
16645 virt-specifier-seq:
16646 virt-specifier virt-specifier-seq [opt]
16648 virt-specifier:
16649 override
16650 final
16652 Returns a bitmask representing the virt-specifiers. */
16654 static cp_virt_specifiers
16656 {
16660 {
16662 cp_virt_specifiers virt_specifier;
16664 /* Peek at the next token. */
16666 /* See if it's a virt-specifier-qualifier. */
16670 {
16673 }
16675 {
16678 }
16680 {
16682 }
16683 else
16687 {
16690 }
16691 else
16692 {
16695 }
16696 }
16698 }
16700 /* Used by handling of trailing-return-types and NSDMI, in which 'this'
16701 is in scope even though it isn't real. */
16703 static void
16705 {
16706 tree this_parm;
16709 {
16710 /* We don't clear this between NSDMIs. Is it already what we want? */
16715 }
16718 /* Clear this first to avoid shortcut in cp_build_indirect_ref. */
16720 current_class_ref
16723 }
16725 /* Parse a late-specified return type, if any. This is not a separate
16726 non-terminal, but part of a function declarator, which looks like
16728 -> trailing-type-specifier-seq abstract-declarator(opt)
16730 Returns the type indicated by the type-id.
16732 QUALS is either a bitmask of cv_qualifiers or -1 for a non-member
16733 function. */
16735 static tree
16737 {
16739 tree type;
16741 /* Peek at the next token. */
16743 /* A late-specified return type is indicated by an initial '->'. */
16747 /* Consume the ->. */
16751 {
16752 /* DR 1207: 'this' is in scope in the trailing return type. */
16755 }
16763 }
16765 /* Parse a declarator-id.
16767 declarator-id:
16768 id-expression
16769 :: [opt] nested-name-specifier [opt] type-name
16771 In the `id-expression' case, the value returned is as for
16772 cp_parser_id_expression if the id-expression was an unqualified-id.
16773 If the id-expression was a qualified-id, then a SCOPE_REF is
16774 returned. The first operand is the scope (either a NAMESPACE_DECL
16775 or TREE_TYPE), but the second is still just a representation of an
16776 unqualified-id. */
16778 static tree
16780 {
16781 tree id;
16782 /* The expression must be an id-expression. Assume that qualified
16783 names are the names of types so that:
16785 template <class T>
16786 int S<T>::R::i = 3;
16788 will work; we must treat `S<T>::R' as the name of a type.
16789 Similarly, assume that qualified names are templates, where
16790 required, so that:
16792 template <class T>
16793 int S<T>::R<T>::i = 3;
16795 will work, too. */
16801 optional_p);
16805 }
16807 /* Parse a type-id.
16809 type-id:
16810 type-specifier-seq abstract-declarator [opt]
16812 Returns the TYPE specified. */
16814 static tree
16817 {
16818 cp_decl_specifier_seq type_specifier_seq;
16821 /* Parse the type-specifier-seq. */
16823 is_trailing_return,
16828 /* There might or might not be an abstract declarator. */
16830 /* Look for the declarator. */
16831 abstract_declarator
16835 /* Check to see if there really was a declarator. */
16841 {
16842 /* A type-id with type 'auto' is only ok if the abstract declarator
16843 is a function declarator with a late-specified return type. */
16848 else
16849 {
16852 }
16853 }
16856 is_template_arg);
16857 }
16860 {
16862 }
16865 {
16866 tree r;
16868 parser->type_definition_forbidden_message
16873 }
16876 {
16878 }
16880 /* Parse a type-specifier-seq.
16882 type-specifier-seq:
16883 type-specifier type-specifier-seq [opt]
16885 GNU extension:
16887 type-specifier-seq:
16888 attributes type-specifier-seq [opt]
16890 If IS_DECLARATION is true, we are at the start of a "condition" or
16891 exception-declaration, so we might be followed by a declarator-id.
16893 If IS_TRAILING_RETURN is true, we are in a trailing-return-type,
16894 i.e. we've just seen "->".
16896 Sets *TYPE_SPECIFIER_SEQ to represent the sequence. */
16898 static void
16903 {
16908 /* Clear the TYPE_SPECIFIER_SEQ. */
16911 /* In the context of a trailing return type, enum E { } is an
16912 elaborated-type-specifier followed by a function-body, not an
16913 enum-specifier. */
16917 /* Parse the type-specifiers and attributes. */
16919 {
16920 tree type_specifier;
16923 /* Check for attributes first. */
16925 {
16930 }
16932 /* record the token of the beginning of the type specifier seq,
16933 for error reporting purposes*/
16937 /* Look for the type-specifier. */
16939 flags,
16940 type_specifier_seq,
16942 NULL,
16945 {
16946 /* If the first type-specifier could not be found, this is not a
16947 type-specifier-seq at all. */
16949 {
16953 }
16954 /* If subsequent type-specifiers could not be found, the
16955 type-specifier-seq is complete. */
16957 }
16960 /* The standard says that a condition can be:
16962 type-specifier-seq declarator = assignment-expression
16964 However, given:
16966 struct S {};
16967 if (int S = ...)
16969 we should treat the "S" as a declarator, not as a
16970 type-specifier. The standard doesn't say that explicitly for
16971 type-specifier-seq, but it does say that for
16972 decl-specifier-seq in an ordinary declaration. Perhaps it
16973 would be clearer just to allow a decl-specifier-seq here, and
16974 then add a semantic restriction that if any decl-specifiers
16975 that are not type-specifiers appear, the program is invalid. */
16978 }
16979 }
16981 /* Parse a parameter-declaration-clause.
16983 parameter-declaration-clause:
16984 parameter-declaration-list [opt] ... [opt]
16985 parameter-declaration-list , ...
16987 Returns a representation for the parameter declarations. A return
16988 value of NULL indicates a parameter-declaration-clause consisting
16989 only of an ellipsis. */
16991 static tree
16993 {
16994 tree parameters;
16999 /* Peek at the next token. */
17001 /* Check for trivial parameter-declaration-clauses. */
17003 {
17004 /* Consume the `...' token. */
17007 }
17009 /* There are no parameters. */
17010 {
17011 #ifndef NO_IMPLICIT_EXTERN_C
17015 else
17016 #endif
17018 }
17019 /* Check for `(void)', too, which is a special case. */
17023 {
17024 /* Consume the `void' token. */
17026 /* There are no parameters. */
17028 }
17030 /* Parse the parameter-declaration-list. */
17032 /* If a parse error occurred while parsing the
17033 parameter-declaration-list, then the entire
17034 parameter-declaration-clause is erroneous. */
17038 /* Peek at the next token. */
17040 /* If it's a `,', the clause should terminate with an ellipsis. */
17042 {
17043 /* Consume the `,'. */
17045 /* Expect an ellipsis. */
17046 ellipsis_p
17048 }
17049 /* It might also be `...' if the optional trailing `,' was
17050 omitted. */
17052 {
17053 /* Consume the `...' token. */
17055 /* And remember that we saw it. */
17057 }
17058 else
17061 /* Finish the parameter list. */
17066 }
17068 /* Parse a parameter-declaration-list.
17070 parameter-declaration-list:
17071 parameter-declaration
17072 parameter-declaration-list , parameter-declaration
17074 Returns a representation of the parameter-declaration-list, as for
17075 cp_parser_parameter_declaration_clause. However, the
17076 `void_list_node' is never appended to the list. Upon return,
17077 *IS_ERROR will be true iff an error occurred. */
17079 static tree
17081 {
17087 /* Assume all will go well. */
17089 /* The special considerations that apply to a function within an
17090 unbraced linkage specifications do not apply to the parameters
17091 to the function. */
17092 saved_in_unbraced_linkage_specification_p
17096 /* Look for more parameters. */
17098 {
17102 /* Parse the parameter. */
17103 parameter
17108 /* We don't know yet if the enclosing context is deprecated, so wait
17109 and warn in grokparms if appropriate. */
17115 PARM,
17121 /* If a parse error occurred parsing the parameter declaration,
17122 then the entire parameter-declaration-list is erroneous. */
17124 {
17128 }
17138 {
17142 }
17144 /* Add the new parameter to the list. */
17148 /* Peek at the next token. */
17151 /* These are for Objective-C++ */
17154 /* The parameter-declaration-list is complete. */
17157 {
17160 /* Peek at the next token. */
17162 /* If it's an ellipsis, then the list is complete. */
17165 /* Otherwise, there must be more parameters. Consume the
17166 `,'. */
17168 /* When parsing something like:
17170 int i(float f, double d)
17172 we can tell after seeing the declaration for "f" that we
17173 are not looking at an initialization of a variable "i",
17174 but rather at the declaration of a function "i".
17176 Due to the fact that the parsing of template arguments
17177 (as specified to a template-id) requires backtracking we
17178 cannot use this technique when inside a template argument
17179 list. */
17183 /* However, a parameter-declaration of the form
17184 "foat(f)" (which is a valid declaration of a
17185 parameter "f") can also be interpreted as an
17186 expression (the conversion of "f" to "float"). */
17189 }
17190 else
17191 {
17199 }
17200 }
17202 parser->in_unbraced_linkage_specification_p
17206 }
17208 /* Parse a parameter declaration.
17210 parameter-declaration:
17211 decl-specifier-seq ... [opt] declarator
17212 decl-specifier-seq declarator = assignment-expression
17213 decl-specifier-seq ... [opt] abstract-declarator [opt]
17214 decl-specifier-seq abstract-declarator [opt] = assignment-expression
17216 If TEMPLATE_PARM_P is TRUE, then this parameter-declaration
17217 declares a template parameter. (In that case, a non-nested `>'
17218 token encountered during the parsing of the assignment-expression
17219 is not interpreted as a greater-than operator.)
17221 Returns a representation of the parameter, or NULL if an error
17222 occurs. If PARENTHESIZED_P is non-NULL, *PARENTHESIZED_P is set to
17223 true iff the declarator is of the form "(p)". */
17229 {
17231 cp_decl_specifier_seq decl_specifiers;
17233 tree default_argument;
17237 /* In a template parameter, `>' is not an operator.
17239 [temp.param]
17241 When parsing a default template-argument for a non-type
17242 template-parameter, the first non-nested `>' is taken as the end
17243 of the template parameter-list rather than a greater-than
17244 operator. */
17246 /* Type definitions may not appear in parameter types. */
17248 parser->type_definition_forbidden_message
17251 /* Parse the declaration-specifiers. */
17253 CP_PARSER_FLAGS_NONE,
17257 /* Complain about missing 'typename' or other invalid type names. */
17261 /* If an error occurred, there's no reason to attempt to parse the
17262 rest of the declaration. */
17264 {
17267 }
17269 /* Peek at the next token. */
17272 /* If the next token is a `)', `,', `=', `>', or `...', then there
17273 is no declarator. However, when variadic templates are enabled,
17274 there may be a declarator following `...'. */
17279 {
17283 }
17284 /* Otherwise, there should be a declarator. */
17285 else
17286 {
17290 /* After seeing a decl-specifier-seq, if the next token is not a
17291 "(", there is no possibility that the code is a valid
17292 expression. Therefore, if parsing tentatively, we commit at
17293 this point. */
17295 /* In an expression context, having seen:
17297 (int((char ...
17299 we cannot be sure whether we are looking at a
17300 function-type (taking a "char" as a parameter) or a cast
17301 of some object of type "char" to "int". */
17307 /* Parse the declarator. */
17310 CP_PARSER_DECLARATOR_EITHER,
17312 parenthesized_p,
17315 /* After the declarator, allow more attributes. */
17316 decl_specifiers.attributes
17319 }
17321 /* If the next token is an ellipsis, and we have not seen a
17322 declarator name, and the type of the declarator contains parameter
17323 packs but it is not a TYPE_PACK_EXPANSION, then we actually have
17324 a parameter pack expansion expression. Otherwise, leave the
17325 ellipsis for a C-style variadic function. */
17328 {
17339 {
17340 /* Consume the `...'. */
17344 /* Build a pack expansion type */
17347 else
17349 }
17350 }
17352 /* The restriction on defining new types applies only to the type
17353 of the parameter, not to the default argument. */
17356 /* If the next token is `=', then process a default argument. */
17358 {
17360 /* If we are defining a class, then the tokens that make up the
17361 default argument must be saved and processed later. */
17366 /* Outside of a class definition, we can just parse the
17367 assignment-expression. */
17368 else
17369 default_argument
17373 {
17376 else
17377 {
17379 "default arguments are only "
17382 }
17383 }
17387 {
17388 /* Find the name of the parameter pack. */
17395 template_parm_p
17401 else
17403 template_parm_p
17410 }
17411 }
17412 else
17416 declarator,
17417 default_argument);
17418 }
17420 /* Parse a default argument and return it.
17422 TEMPLATE_PARM_P is true if this is a default argument for a
17423 non-type template parameter. */
17424 static tree
17426 {
17432 /* Make sure that PARSER->GREATER_THAN_IS_OPERATOR_P is
17433 set correctly. */
17436 /* Local variable names (and the `this' keyword) may not
17437 appear in a default argument. */
17440 /* Parse the assignment-expression. */
17443 default_argument
17453 }
17455 /* Parse a function-body.
17457 function-body:
17458 compound_statement */
17460 static void
17462 {
17464 }
17466 /* Parse a ctor-initializer-opt followed by a function-body. Return
17467 true if a ctor-initializer was present. When IN_FUNCTION_TRY_BLOCK
17468 is true we are parsing a function-try-block. */
17470 static bool
17473 {
17481 /* Begin the function body. */
17483 /* Parse the optional ctor-initializer. */
17486 /* If we're parsing a constexpr constructor definition, we need
17487 to check that the constructor body is indeed empty. However,
17488 before we get to cp_parser_function_body lot of junk has been
17489 generated, so we can't just check that we have an empty block.
17490 Rather we take a snapshot of the outermost block, and check whether
17491 cp_parser_function_body changed its state. */
17493 {
17497 }
17498 /* Parse the function-body. */
17502 /* Finish the function body. */
17506 }
17508 /* Parse an initializer.
17510 initializer:
17511 = initializer-clause
17512 ( expression-list )
17514 Returns an expression representing the initializer. If no
17515 initializer is present, NULL_TREE is returned.
17517 *IS_DIRECT_INIT is set to FALSE if the `= initializer-clause'
17518 production is used, and TRUE otherwise. *IS_DIRECT_INIT is
17519 set to TRUE if there is no initializer present. If there is an
17520 initializer, and it is not a constant-expression, *NON_CONSTANT_P
17521 is set to true; otherwise it is set to false. */
17523 static tree
17526 {
17528 tree init;
17530 /* Peek at the next token. */
17533 /* Let our caller know whether or not this initializer was
17534 parenthesized. */
17536 /* Assume that the initializer is constant. */
17540 {
17541 /* Consume the `='. */
17543 /* Parse the initializer-clause. */
17545 }
17547 {
17552 non_constant_p);
17557 }
17559 {
17563 }
17564 else
17565 {
17566 /* Anything else is an error. */
17569 }
17572 }
17574 /* Parse an initializer-clause.
17576 initializer-clause:
17577 assignment-expression
17578 braced-init-list
17580 Returns an expression representing the initializer.
17582 If the `assignment-expression' production is used the value
17583 returned is simply a representation for the expression.
17585 Otherwise, calls cp_parser_braced_list. */
17587 static tree
17589 {
17590 tree initializer;
17592 /* Assume the expression is constant. */
17595 /* If it is not a `{', then we are looking at an
17596 assignment-expression. */
17598 {
17599 initializer
17602 non_constant_p);
17603 }
17604 else
17608 }
17610 /* Parse a brace-enclosed initializer list.
17612 braced-init-list:
17613 { initializer-list , [opt] }
17614 { }
17616 Returns a CONSTRUCTOR. The CONSTRUCTOR_ELTS will be
17617 the elements of the initializer-list (or NULL, if the last
17618 production is used). The TREE_TYPE for the CONSTRUCTOR will be
17619 NULL_TREE. There is no way to detect whether or not the optional
17620 trailing `,' was provided. NON_CONSTANT_P is as for
17621 cp_parser_initializer. */
17623 static tree
17625 {
17626 tree initializer;
17628 /* Consume the `{' token. */
17630 /* Create a CONSTRUCTOR to represent the braced-initializer. */
17632 /* If it's not a `}', then there is a non-trivial initializer. */
17634 {
17635 /* Parse the initializer list. */
17638 /* A trailing `,' token is allowed. */
17641 }
17642 /* Now, there should be a trailing `}'. */
17646 }
17648 /* Parse an initializer-list.
17650 initializer-list:
17651 initializer-clause ... [opt]
17652 initializer-list , initializer-clause ... [opt]
17654 GNU Extension:
17656 initializer-list:
17657 designation initializer-clause ...[opt]
17658 initializer-list , designation initializer-clause ...[opt]
17660 designation:
17661 . identifier =
17662 identifier :
17663 [ constant-expression ] =
17665 Returns a VEC of constructor_elt. The VALUE of each elt is an expression
17666 for the initializer. If the INDEX of the elt is non-NULL, it is the
17667 IDENTIFIER_NODE naming the field to initialize. NON_CONSTANT_P is
17668 as for cp_parser_initializer. */
17672 {
17675 /* Assume all of the expressions are constant. */
17678 /* Parse the rest of the list. */
17680 {
17682 tree designator;
17683 tree initializer;
17686 /* If the next token is an identifier and the following one is a
17687 colon, we are looking at the GNU designated-initializer
17688 syntax. */
17692 {
17693 /* Warn the user that they are using an extension. */
17696 /* Consume the identifier. */
17698 /* Consume the `:'. */
17700 }
17701 /* Also handle the C99 syntax, '. id ='. */
17706 {
17707 /* Warn the user that they are using an extension. */
17710 /* Consume the `.'. */
17712 /* Consume the identifier. */
17714 /* Consume the `='. */
17716 }
17717 /* Also handle C99 array designators, '[ const ] ='. */
17721 {
17722 /* In C++11, [ could start a lambda-introducer. */
17730 }
17731 else
17734 /* Parse the initializer. */
17737 /* If any clause is non-constant, so is the entire initializer. */
17741 /* If we have an ellipsis, this is an initializer pack
17742 expansion. */
17744 {
17745 /* Consume the `...'. */
17748 /* Turn the initializer into an initializer expansion. */
17750 }
17752 /* Add it to the vector. */
17755 /* If the next token is not a comma, we have reached the end of
17756 the list. */
17760 /* Peek at the next token. */
17762 /* If the next token is a `}', then we're still done. An
17763 initializer-clause can have a trailing `,' after the
17764 initializer-list and before the closing `}'. */
17768 /* Consume the `,' token. */
17770 }
17773 }
17775 /* Classes [gram.class] */
17777 /* Parse a class-name.
17779 class-name:
17780 identifier
17781 template-id
17783 TYPENAME_KEYWORD_P is true iff the `typename' keyword has been used
17784 to indicate that names looked up in dependent types should be
17785 assumed to be types. TEMPLATE_KEYWORD_P is true iff the `template'
17786 keyword has been used to indicate that the name that appears next
17787 is a template. TAG_TYPE indicates the explicit tag given before
17788 the type name, if any. If CHECK_DEPENDENCY_P is FALSE, names are
17789 looked up in dependent scopes. If CLASS_HEAD_P is TRUE, this class
17790 is the class being defined in a class-head.
17792 Returns the TYPE_DECL representing the class. */
17794 static tree
17802 {
17803 tree decl;
17804 tree scope;
17809 /* All class-names start with an identifier. */
17812 {
17815 }
17817 /* PARSER->SCOPE can be cleared when parsing the template-arguments
17818 to a template-id, so we save it here. */
17823 /* Any name names a type if we're following the `typename' keyword
17824 in a qualified name where the enclosing scope is type-dependent. */
17827 /* Handle the common case (an identifier, but not a template-id)
17828 efficiently. */
17831 {
17835 /* Look for the identifier. */
17839 /* If the next token isn't an identifier, we are certainly not
17840 looking at a class-name. */
17843 /* If we know this is a type-name, there's no need to look it
17844 up. */
17847 else
17848 {
17849 tree ambiguous_decls;
17850 /* If we already know that this lookup is ambiguous, then
17851 we've already issued an error message; there's no reason
17852 to check again. */
17854 {
17857 }
17858 /* If the next token is a `::', then the name must be a type
17859 name.
17861 [basic.lookup.qual]
17863 During the lookup for a name preceding the :: scope
17864 resolution operator, object, function, and enumerator
17865 names are ignored. */
17868 /* Look up the name. */
17870 tag_type,
17873 check_dependency_p,
17877 {
17881 }
17882 }
17883 }
17884 else
17885 {
17886 /* Try a template-id. */
17888 check_dependency_p,
17889 tag_type,
17890 is_declaration);
17893 }
17897 /* If this is a typename, create a TYPENAME_TYPE. */
17899 {
17904 }
17908 /* Check to see that it is really the name of a class. */
17912 /* Situations like this:
17914 template <typename T> struct A {
17915 typename T::template X<int>::I i;
17916 };
17918 are problematic. Is `T::template X<int>' a class-name? The
17919 standard does not seem to be definitive, but there is no other
17920 valid interpretation of the following `::'. Therefore, those
17921 names are considered class-names. */
17922 {
17926 }
17930 /* In Objective-C 2.0, a classname followed by '.' starts a
17931 dot-syntax expression, and it's not a type-name. */
17943 }
17945 /* Parse a class-specifier.
17947 class-specifier:
17948 class-head { member-specification [opt] }
17950 Returns the TREE_TYPE representing the class. */
17952 static tree
17954 {
17955 tree type;
17969 /* Parse the class-head. */
17972 /* If the class-head was a semantic disaster, skip the entire body
17973 of the class. */
17975 {
17979 }
17981 /* Look for the `{'. */
17983 {
17986 }
17988 /* Issue an error message if type-definitions are forbidden here. */
17990 /* Remember that we are defining one more class. */
17992 /* Inside the class, surrounding template-parameter-lists do not
17993 apply. */
17994 saved_num_template_parameter_lists
17997 /* We are not in a function body. */
18000 /* Or in a loop. */
18003 /* Or in a switch. */
18006 /* We are not immediately inside an extern "lang" block. */
18007 saved_in_unbraced_linkage_specification_p
18011 /* Start the class. */
18013 {
18016 }
18020 /* If the type is erroneous, skip the entire body of the class. */
18022 else
18023 /* Parse the member-specification. */
18026 /* Look for the trailing `}'. */
18028 /* Look for trailing attributes to apply to this class. */
18036 /* We've finished a type definition. Check for the common syntax
18037 error of forgetting a semicolon after the definition. We need to
18038 be careful, as we can't just check for not-a-semicolon and be done
18039 with it; the user might have typed:
18041 class X { } c = ...;
18042 class X { } *p = ...;
18044 and so forth. Instead, enumerate all the possible tokens that
18045 might follow this production; if we don't see one of them, then
18046 complain and silently insert the semicolon. */
18047 {
18052 {
18063 /* While it's legal for type qualifiers and storage class
18064 specifiers to follow type definitions in the grammar, only
18065 compiler testsuites contain code like that. Assume that if
18066 we see such code, then what we're really seeing is a case
18067 like:
18069 class X { }
18070 const <type> var = ...;
18072 or
18074 class Y { }
18075 static <type> func (...) ...
18077 i.e. the qualifier or specifier applies to the next
18078 declaration. To do so, however, we need to look ahead one
18079 more token to see if *that* token is a type specifier.
18081 This code could be improved to handle:
18083 class Z { }
18084 static const <type> var = ...; */
18087 {
18090 /* Handling user-defined types here would be nice, but very
18091 tricky. */
18092 want_semicolon
18095 }
18099 }
18101 /* If we don't have a type, then something is very wrong and we
18102 shouldn't try to do anything clever. Likewise for not seeing the
18103 closing brace. */
18105 {
18106 cp_token_position prev
18117 else
18120 /* Unget one token and smash it to look as though we encountered
18121 a semicolon in the input stream. */
18126 }
18127 }
18129 /* If this class is not itself within the scope of another class,
18130 then we need to parse the bodies of all of the queued function
18131 definitions. Note that the queued functions defined in a class
18132 are not always processed immediately following the
18133 class-specifier for that class. Consider:
18135 struct A {
18136 struct B { void f() { sizeof (A); } };
18137 };
18139 If `f' were processed before the processing of `A' were
18140 completed, there would be no way to compute the size of `A'.
18141 Note that the nesting we are interested in here is lexical --
18142 not the semantic nesting given by TYPE_CONTEXT. In particular,
18143 for:
18145 struct A { struct B; };
18146 struct A::B { void f() { } };
18148 there is no need to delay the parsing of `A::B::f'. */
18150 {
18151 tree decl;
18158 /* In a first pass, parse default arguments to the functions.
18159 Then, in a second pass, parse the bodies of the functions.
18160 This two-phased approach handles cases like:
18162 struct S {
18163 void f() { g(); }
18164 void g(int i = 3);
18165 };
18167 */
18170 {
18172 /* If there are default arguments that have not yet been processed,
18173 take care of them now. */
18175 {
18180 }
18181 /* Make sure that any template parameters are in scope. */
18183 /* Parse the default argument expressions. */
18185 /* Remove any template parameters from the symbol table. */
18187 }
18189 /* Now parse any NSDMIs. */
18193 {
18195 {
18200 }
18203 }
18209 /* Now parse the body of the functions. */
18213 }
18215 /* Put back any saved access checks. */
18218 /* Restore saved state. */
18222 parser->num_template_parameter_lists
18224 parser->in_unbraced_linkage_specification_p
18228 }
18230 static tree
18232 {
18233 tree ret;
18238 }
18240 /* Parse a class-head.
18242 class-head:
18243 class-key identifier [opt] base-clause [opt]
18244 class-key nested-name-specifier identifier class-virt-specifier [opt] base-clause [opt]
18245 class-key nested-name-specifier [opt] template-id
18246 base-clause [opt]
18248 class-virt-specifier:
18249 final
18251 GNU Extensions:
18252 class-key attributes identifier [opt] base-clause [opt]
18253 class-key attributes nested-name-specifier identifier base-clause [opt]
18254 class-key attributes nested-name-specifier [opt] template-id
18255 base-clause [opt]
18257 Upon return BASES is initialized to the list of base classes (or
18258 NULL, if there are none) in the same form returned by
18259 cp_parser_base_clause.
18261 Returns the TYPE of the indicated class. Sets
18262 *NESTED_NAME_SPECIFIER_P to TRUE iff one of the productions
18263 involving a nested-name-specifier was used, and FALSE otherwise.
18265 Returns error_mark_node if this is not a class-head.
18267 Returns NULL_TREE if the class-head is syntactically valid, but
18268 semantically invalid in a way that means we should skip the entire
18269 body of the class. */
18271 static tree
18274 {
18275 tree nested_name_specifier;
18279 tree attributes;
18280 tree bases;
18290 /* Assume no nested-name-specifier will be present. */
18292 /* Assume no template parameter lists will be used in defining the
18293 type. */
18297 /* Look for the class-key. */
18302 /* Parse the attributes. */
18305 /* If the next token is `::', that is invalid -- but sometimes
18306 people do try to write:
18308 struct ::S {};
18310 Handle this gracefully by accepting the extra qualifier, and then
18311 issuing an error about it later if this really is a
18312 class-head. If it turns out just to be an elaborated type
18313 specifier, remain silent. */
18319 /* Determine the name of the class. Begin by looking for an
18320 optional nested-name-specifier. */
18322 nested_name_specifier
18328 /* If there was a nested-name-specifier, then there *must* be an
18329 identifier. */
18331 {
18333 /* Although the grammar says `identifier', it really means
18334 `class-name' or `template-name'. You are only allowed to
18335 define a class that has already been declared with this
18336 syntax.
18338 The proposed resolution for Core Issue 180 says that wherever
18339 you see `class T::X' you should treat `X' as a type-name.
18341 It is OK to define an inaccessible class; for example:
18343 class A { class B; };
18344 class A::B {};
18346 We do not know if we will see a class-name, or a
18347 template-name. We look for a class-name first, in case the
18348 class-name is a template-id; if we looked for the
18349 template-name first we would stop after the template-name. */
18354 class_type,
18358 /* If that didn't work, ignore the nested-name-specifier. */
18360 {
18366 }
18367 /* If we could not find a corresponding TYPE, treat this
18368 declaration like an unqualified declaration. */
18371 /* Otherwise, count the number of templates used in TYPE and its
18372 containing scopes. */
18373 else
18374 {
18375 tree scope;
18388 }
18389 }
18390 /* Otherwise, the identifier is optional. */
18391 else
18392 {
18393 /* We don't know whether what comes next is a template-id,
18394 an identifier, or nothing at all. */
18396 /* Check for a template-id. */
18401 class_key,
18403 /* If that didn't work, it could still be an identifier. */
18405 {
18407 {
18410 }
18411 else
18413 }
18414 else
18415 {
18418 }
18419 }
18424 {
18426 class_key,
18428 }
18431 /* If it's not a `:' or a `{' then we can't really be looking at a
18432 class-head, since a class-head only appears as part of a
18433 class-specifier. We have to detect this situation before calling
18434 xref_tag, since that has irreversible side-effects. */
18436 {
18440 }
18442 /* At this point, we're going ahead with the class-specifier, even
18443 if some other problem occurs. */
18446 {
18451 }
18452 /* Issue the error about the overly-qualified name now. */
18454 {
18459 }
18461 {
18466 }
18468 {
18469 tree scope;
18471 /* Reject typedef-names in class heads. */
18473 {
18476 type);
18479 }
18481 /* Figure out in what scope the declaration is being placed. */
18483 /* If that scope does not contain the scope in which the
18484 class was originally declared, the program is invalid. */
18486 {
18489 "declaration of %qD in namespace %qD which does not "
18492 else
18498 }
18499 /* [dcl.meaning]
18501 A declarator-id shall not be qualified except for the
18502 definition of a ... nested class outside of its class
18503 ... [or] the definition or explicit instantiation of a
18504 class member of a namespace outside of its namespace. */
18506 {
18511 }
18512 }
18513 /* An explicit-specialization must be preceded by "template <>". If
18514 it is not, try to recover gracefully. */
18518 {
18522 /* Take the same action that would have been taken by
18523 cp_parser_explicit_specialization. */
18526 }
18527 /* There must be no "return" statements between this point and the
18528 end of this function; set "type "to the correct return value and
18529 use "goto done;" to return. */
18530 /* Make sure that the right number of template parameters were
18531 present. */
18535 {
18536 /* If something went wrong, there is no point in even trying to
18537 process the class-definition. */
18540 }
18542 /* Look up the type. */
18544 {
18548 {
18552 }
18553 else
18554 {
18557 }
18560 }
18562 {
18563 tree class_type;
18565 /* Given:
18567 template <typename T> struct S { struct T };
18568 template <typename T> struct S<T>::T { };
18570 we will get a TYPENAME_TYPE when processing the definition of
18571 `S::T'. We need to resolve it to the actual type before we
18572 try to define it. */
18574 {
18579 else
18580 {
18583 }
18584 }
18588 {
18591 }
18594 /* Enter the scope indicated by the nested-name-specifier. */
18596 /* Get the canonical version of this type. */
18600 {
18603 {
18606 }
18607 }
18611 }
18613 {
18614 /* If the class was unnamed, create a dummy name. */
18619 }
18621 /* Indicate whether this class was declared as a `class' or as a
18622 `struct'. */
18627 /* If this type was already complete, and we see another definition,
18628 that's an error. */
18630 {
18632 type);
18634 type);
18637 }
18642 {
18643 /* Apply attributes now, before any use of the class as a template
18644 argument in its base list. */
18647 }
18649 /* We will have entered the scope containing the class; the names of
18650 base classes should be looked up in that context. For example:
18652 struct A { struct B {}; struct C; };
18653 struct A::C : B {};
18655 is valid. */
18657 /* Get the list of base-classes, if there is one. */
18660 else
18663 /* If we're really defining a class, process the base classes.
18664 If they're invalid, fail. */
18669 done:
18670 /* Leave the scope given by the nested-name-specifier. We will
18671 enter the class scope itself while processing the members. */
18676 {
18679 }
18685 out:
18688 }
18690 /* Parse a class-key.
18692 class-key:
18693 class
18694 struct
18695 union
18697 Returns the kind of class-key specified, or none_type to indicate
18698 error. */
18700 static enum tag_types
18702 {
18706 /* Look for the class-key. */
18711 /* Check to see if the TOKEN is a class-key. */
18716 }
18718 /* Parse an (optional) member-specification.
18720 member-specification:
18721 member-declaration member-specification [opt]
18722 access-specifier : member-specification [opt] */
18724 static void
18726 {
18728 {
18732 /* Peek at the next token. */
18734 /* If it's a `}', or EOF then we've seen all the members. */
18740 /* See if this token is a keyword. */
18743 {
18747 /* Consume the access-specifier. */
18749 /* Remember which access-specifier is active. */
18751 /* Look for the `:'. */
18756 /* Accept #pragmas at class scope. */
18758 {
18761 }
18763 /* Otherwise, the next construction must be a
18764 member-declaration. */
18766 }
18767 }
18768 }
18770 /* Parse a member-declaration.
18772 member-declaration:
18773 decl-specifier-seq [opt] member-declarator-list [opt] ;
18774 function-definition ; [opt]
18775 :: [opt] nested-name-specifier template [opt] unqualified-id ;
18776 using-declaration
18777 template-declaration
18778 alias-declaration
18780 member-declarator-list:
18781 member-declarator
18782 member-declarator-list , member-declarator
18784 member-declarator:
18785 declarator pure-specifier [opt]
18786 declarator constant-initializer [opt]
18787 identifier [opt] : constant-expression
18789 GNU Extensions:
18791 member-declaration:
18792 __extension__ member-declaration
18794 member-declarator:
18795 declarator attributes [opt] pure-specifier [opt]
18796 declarator attributes [opt] constant-initializer [opt]
18797 identifier [opt] attributes [opt] : constant-expression
18799 C++0x Extensions:
18801 member-declaration:
18802 static_assert-declaration */
18804 static void
18806 {
18807 cp_decl_specifier_seq decl_specifiers;
18808 tree prefix_attributes;
18809 tree decl;
18818 /* Check for the `__extension__' keyword. */
18820 {
18821 /* Recurse. */
18823 /* Restore the old value of the PEDANTIC flag. */
18827 }
18829 /* Check for a template-declaration. */
18831 {
18832 /* An explicit specialization here is an error condition, and we
18833 expect the specialization handler to detect and report this. */
18837 else
18841 }
18843 /* Check for a using-declaration. */
18845 {
18847 {
18848 /* Parse the using-declaration. */
18852 }
18853 else
18854 {
18855 tree decl;
18860 else
18864 }
18865 }
18867 /* Check for @defs. */
18869 {
18874 {
18879 }
18881 }
18883 /* If the next token is `static_assert' we have a static assertion. */
18885 {
18888 }
18895 /* Parse the decl-specifier-seq. */
18898 CP_PARSER_FLAGS_OPTIONAL,
18903 /* Check for an invalid type-name. */
18907 /* If there is no declarator, then the decl-specifier-seq should
18908 specify a type. */
18910 {
18911 /* If there was no decl-specifier-seq, and the next token is a
18912 `;', then we have something like:
18914 struct S { ; };
18916 [class.mem]
18918 Each member-declaration shall declare at least one member
18919 name of the class. */
18921 {
18925 }
18926 else
18927 {
18928 tree type;
18930 /* See if this declaration is a friend. */
18932 /* If there were decl-specifiers, check to see if there was
18933 a class-declaration. */
18935 /* Nested classes have already been added to the class, but
18936 a `friend' needs to be explicitly registered. */
18938 {
18939 /* If the `friend' keyword was present, the friend must
18940 be introduced with a class-key. */
18943 "in C++03 a class-key must be used "
18945 /* In this case:
18947 template <typename T> struct A {
18948 friend struct A<T>::B;
18949 };
18951 A<T>::B will be represented by a TYPENAME_TYPE, and
18952 therefore not recognized by check_tag_decl. */
18954 {
18958 }
18961 "friend declaration does not name a class or "
18963 else
18966 }
18967 /* If there is no TYPE, an error message will already have
18968 been issued. */
18970 ;
18971 /* An anonymous aggregate has to be handled specially; such
18972 a declaration really declares a data member (with a
18973 particular type), as opposed to a nested class. */
18975 {
18976 /* C++11 9.5/6. */
18979 "a storage class on an anonymous aggregate "
18982 /* Remove constructors and such from TYPE, now that we
18983 know it is an anonymous aggregate. */
18985 /* And make the corresponding data member. */
18988 /* Add it to the class. */
18990 }
18991 else
18992 cp_parser_check_access_in_redeclaration
18995 }
18996 }
18997 else
18998 {
19001 /* See if these declarations will be friends. */
19004 /* Keep going until we hit the `;' at the end of the
19005 declaration. */
19007 {
19009 tree first_attribute;
19011 /* Peek at the next token. */
19014 /* Check for a bitfield declaration. */
19019 {
19020 tree identifier;
19021 tree width;
19023 /* Get the name of the bitfield. Note that we cannot just
19024 check TOKEN here because it may have been invalidated by
19025 the call to cp_lexer_peek_nth_token above. */
19028 else
19031 /* Consume the `:' token. */
19033 /* Get the width of the bitfield. */
19034 width
19037 NULL);
19039 /* Look for attributes that apply to the bitfield. */
19041 /* Remember which attributes are prefix attributes and
19042 which are not. */
19044 /* Combine the attributes. */
19047 /* Create the bitfield declaration. */
19050 identifier,
19051 sfk_none)
19054 width,
19055 attributes);
19056 }
19057 else
19058 {
19060 tree initializer;
19061 tree asm_specification;
19064 /* Parse the declarator. */
19065 declarator
19071 /* If something went wrong parsing the declarator, make sure
19072 that we at least consume some tokens. */
19074 {
19075 /* Skip to the end of the statement. */
19077 /* If the next token is not a semicolon, that is
19078 probably because we just skipped over the body of
19079 a function. So, we consume a semicolon if
19080 present, but do not issue an error message if it
19081 is not present. */
19083 CPP_SEMICOLON))
19086 }
19089 cp_parser_check_for_definition_in_return_type
19093 /* Look for an asm-specification. */
19095 /* Look for attributes that apply to the declaration. */
19097 /* Remember which attributes are prefix attributes and
19098 which are not. */
19100 /* Combine the attributes. */
19103 /* If it's an `=', then we have a constant-initializer or a
19104 pure-specifier. It is not correct to parse the
19105 initializer before registering the member declaration
19106 since the member declaration should be in scope while
19107 its initializer is processed. However, the rest of the
19108 front end does not yet provide an interface that allows
19109 us to handle this correctly. */
19111 {
19112 /* In [class.mem]:
19114 A pure-specifier shall be used only in the declaration of
19115 a virtual function.
19117 A member-declarator can contain a constant-initializer
19118 only if it declares a static member of integral or
19119 enumeration type.
19121 Therefore, if the DECLARATOR is for a function, we look
19122 for a pure-specifier; otherwise, we look for a
19123 constant-initializer. When we call `grokfield', it will
19124 perform more stringent semantics checks. */
19135 {
19137 /* Don't require a constant rvalue in C++11, since we
19138 might want a reference constant. We'll enforce
19139 constancy later. */
19141 /* Parse the initializer. */
19144 }
19145 else
19146 /* Parse the initializer. */
19148 }
19151 {
19155 else
19157 }
19158 /* Otherwise, there is no initializer. */
19159 else
19162 /* See if we are probably looking at a function
19163 definition. We are certainly not looking at a
19164 member-declarator. Calling `grokfield' has
19165 side-effects, so we must not do it unless we are sure
19166 that we are looking at a member-declarator. */
19169 {
19170 /* The grammar does not allow a pure-specifier to be
19171 used when a member function is defined. (It is
19172 possible that this fact is an oversight in the
19173 standard, since a pure function may be defined
19174 outside of the class-specifier. */
19180 declarator,
19181 attributes);
19182 /* If the member was not a friend, declare it here. */
19185 /* Peek at the next token. */
19187 /* If the next token is a semicolon, consume it. */
19191 }
19192 else
19195 /* Create the declaration. */
19198 asm_specification,
19199 attributes);
19200 }
19202 /* Reset PREFIX_ATTRIBUTES. */
19208 /* If there is any qualification still in effect, clear it
19209 now; we will be starting fresh with the next declarator. */
19213 /* If it's a `,', then there are more declarators. */
19216 /* If the next token isn't a `;', then we have a parse error. */
19218 CPP_SEMICOLON))
19219 {
19220 /* The next token might be a ways away from where the
19221 actual semicolon is missing. Find the previous token
19222 and use that for our error position. */
19227 /* Assume that the user meant to provide a semicolon. If
19228 we were to cp_parser_skip_to_end_of_statement, we might
19229 skip to a semicolon inside a member function definition
19230 and issue nonsensical error messages. */
19232 }
19235 {
19236 /* Add DECL to the list of members. */
19245 /* Add DECL to the queue of NSDMI to be parsed later. */
19247 }
19251 }
19252 }
19255 out:
19257 }
19259 /* Parse a pure-specifier.
19261 pure-specifier:
19262 = 0
19264 Returns INTEGER_ZERO_NODE if a pure specifier is found.
19265 Otherwise, ERROR_MARK_NODE is returned. */
19267 static tree
19269 {
19272 /* Look for the `=' token. */
19275 /* Look for the `0' token. */
19284 /* Accept = default or = delete in c++0x mode. */
19287 {
19290 }
19292 /* c_lex_with_flags marks a single digit '0' with PURE_ZERO. */
19294 {
19299 }
19301 {
19304 }
19307 }
19309 /* Parse a constant-initializer.
19311 constant-initializer:
19312 = constant-expression
19314 Returns a representation of the constant-expression. */
19316 static tree
19318 {
19319 /* Look for the `=' token. */
19323 /* It is invalid to write:
19325 struct S { static const int i = { 7 }; };
19327 */
19329 {
19332 /* Consume the opening brace. */
19334 /* Skip the initializer. */
19336 /* Look for the trailing `}'. */
19340 }
19344 NULL);
19345 }
19347 /* Derived classes [gram.class.derived] */
19349 /* Parse a base-clause.
19351 base-clause:
19352 : base-specifier-list
19354 base-specifier-list:
19355 base-specifier ... [opt]
19356 base-specifier-list , base-specifier ... [opt]
19358 Returns a TREE_LIST representing the base-classes, in the order in
19359 which they were declared. The representation of each node is as
19360 described by cp_parser_base_specifier.
19362 In the case that no bases are specified, this function will return
19363 NULL_TREE, not ERROR_MARK_NODE. */
19365 static tree
19367 {
19370 /* Look for the `:' that begins the list. */
19373 /* Scan the base-specifier-list. */
19375 {
19377 tree base;
19380 /* Look for the base-specifier. */
19382 /* Look for the (optional) ellipsis. */
19384 {
19385 /* Consume the `...'. */
19389 }
19391 /* Add BASE to the front of the list. */
19393 {
19395 /* Make this a pack expansion type. */
19399 {
19402 }
19403 }
19404 /* Peek at the next token. */
19406 /* If it's not a comma, then the list is complete. */
19409 /* Consume the `,'. */
19411 }
19413 /* PARSER->SCOPE may still be non-NULL at this point, if the last
19414 base class had a qualified name. However, the next name that
19415 appears is certainly not qualified. */
19421 }
19423 /* Parse a base-specifier.
19425 base-specifier:
19426 :: [opt] nested-name-specifier [opt] class-name
19427 virtual access-specifier [opt] :: [opt] nested-name-specifier
19428 [opt] class-name
19429 access-specifier virtual [opt] :: [opt] nested-name-specifier
19430 [opt] class-name
19432 Returns a TREE_LIST. The TREE_PURPOSE will be one of
19433 ACCESS_{DEFAULT,PUBLIC,PROTECTED,PRIVATE}_[VIRTUAL]_NODE to
19434 indicate the specifiers provided. The TREE_VALUE will be a TYPE
19435 (or the ERROR_MARK_NODE) indicating the type that was specified. */
19437 static tree
19439 {
19447 tree type;
19449 /* Process the optional `virtual' and `access-specifier'. */
19451 {
19452 /* Peek at the next token. */
19454 /* Process `virtual'. */
19456 {
19458 /* If `virtual' appears more than once, issue an error. */
19460 {
19464 }
19468 /* Consume the `virtual' token. */
19476 /* If more than one access specifier appears, issue an
19477 error. */
19480 {
19484 }
19488 /* Consume the access-specifier. */
19496 }
19497 }
19498 /* It is not uncommon to see programs mechanically, erroneously, use
19499 the 'typename' keyword to denote (dependent) qualified types
19500 as base classes. */
19502 {
19507 else
19509 "keyword %<typename%> not allowed in this context "
19512 }
19514 /* Look for the optional `::' operator. */
19516 /* Look for the nested-name-specifier. The simplest way to
19517 implement:
19519 [temp.res]
19521 The keyword `typename' is not permitted in a base-specifier or
19522 mem-initializer; in these contexts a qualified name that
19523 depends on a template-parameter is implicitly assumed to be a
19524 type name.
19526 is to pretend that we have seen the `typename' keyword at this
19527 point. */
19531 typename_type,
19533 /* If the base class is given by a qualified name, assume that names
19534 we see are type names or templates, as appropriate. */
19540 /* DR 950 allows decltype as a base-specifier. */
19542 else
19543 {
19544 /* Otherwise, look for the class-name. */
19546 class_scope_p,
19547 template_p,
19548 typename_type,
19553 }
19559 }
19561 /* Exception handling [gram.exception] */
19563 /* Parse an (optional) noexcept-specification.
19565 noexcept-specification:
19566 noexcept ( constant-expression ) [opt]
19568 If no noexcept-specification is present, returns NULL_TREE.
19569 Otherwise, if REQUIRE_CONSTEXPR is false, then either parse and return any
19570 expression if parentheses follow noexcept, or return BOOLEAN_TRUE_NODE if
19571 there are no parentheses. CONSUMED_EXPR will be set accordingly.
19572 Otherwise, returns a noexcept specification unless RETURN_COND is true,
19573 in which case a boolean condition is returned instead. */
19575 static tree
19580 {
19584 /* Peek at the next token. */
19587 /* Is it a noexcept-specification? */
19589 {
19590 tree expr;
19594 {
19598 {
19599 /* Types may not be defined in an exception-specification. */
19601 parser->type_definition_forbidden_message
19606 /* Restore the saved message. */
19608 }
19609 else
19610 {
19613 }
19616 }
19617 else
19618 {
19622 }
19624 /* We cannot build a noexcept-spec right away because this will check
19625 that expr is a constexpr. */
19628 else
19630 }
19631 else
19633 }
19635 /* Parse an (optional) exception-specification.
19637 exception-specification:
19638 throw ( type-id-list [opt] )
19640 Returns a TREE_LIST representing the exception-specification. The
19641 TREE_VALUE of each node is a type. */
19643 static tree
19645 {
19647 tree type_id_list;
19650 /* Peek at the next token. */
19653 /* Is it a noexcept-specification? */
19659 /* If it's not `throw', then there's no exception-specification. */
19663 #if 0
19664 /* Enable this once a lot of code has transitioned to noexcept? */
19668 #endif
19670 /* Consume the `throw'. */
19673 /* Look for the `('. */
19676 /* Peek at the next token. */
19678 /* If it's not a `)', then there is a type-id-list. */
19680 {
19681 /* Types may not be defined in an exception-specification. */
19683 parser->type_definition_forbidden_message
19685 /* Parse the type-id-list. */
19687 /* Restore the saved message. */
19689 }
19690 else
19693 /* Look for the `)'. */
19697 }
19699 /* Parse an (optional) type-id-list.
19701 type-id-list:
19702 type-id ... [opt]
19703 type-id-list , type-id ... [opt]
19705 Returns a TREE_LIST. The TREE_VALUE of each node is a TYPE,
19706 in the order that the types were presented. */
19708 static tree
19710 {
19714 {
19716 tree type;
19718 /* Get the next type-id. */
19720 /* Parse the optional ellipsis. */
19722 {
19723 /* Consume the `...'. */
19726 /* Turn the type into a pack expansion expression. */
19728 }
19729 /* Add it to the list. */
19731 /* Peek at the next token. */
19733 /* If it is not a `,', we are done. */
19736 /* Consume the `,'. */
19738 }
19741 }
19743 /* Parse a try-block.
19745 try-block:
19746 try compound-statement handler-seq */
19748 static tree
19750 {
19751 tree try_block;
19761 }
19763 /* Parse a function-try-block.
19765 function-try-block:
19766 try ctor-initializer [opt] function-body handler-seq */
19768 static bool
19770 {
19771 tree compound_stmt;
19772 tree try_block;
19775 /* Look for the `try' keyword. */
19778 /* Let the rest of the front end know where we are. */
19780 /* Parse the function-body. */
19781 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
19783 /* We're done with the `try' part. */
19785 /* Parse the handlers. */
19787 /* We're done with the handlers. */
19791 }
19793 /* Parse a handler-seq.
19795 handler-seq:
19796 handler handler-seq [opt] */
19798 static void
19800 {
19802 {
19805 /* Parse the handler. */
19807 /* Peek at the next token. */
19809 /* If it's not `catch' then there are no more handlers. */
19812 }
19813 }
19815 /* Parse a handler.
19817 handler:
19818 catch ( exception-declaration ) compound-statement */
19820 static void
19822 {
19823 tree handler;
19824 tree declaration;
19834 }
19836 /* Parse an exception-declaration.
19838 exception-declaration:
19839 type-specifier-seq declarator
19840 type-specifier-seq abstract-declarator
19841 type-specifier-seq
19842 ...
19844 Returns a VAR_DECL for the declaration, or NULL_TREE if the
19845 ellipsis variant is used. */
19847 static tree
19849 {
19850 cp_decl_specifier_seq type_specifiers;
19854 /* If it's an ellipsis, it's easy to handle. */
19856 {
19857 /* Consume the `...' token. */
19860 }
19862 /* Types may not be defined in exception-declarations. */
19864 parser->type_definition_forbidden_message
19867 /* Parse the type-specifier-seq. */
19871 /* If it's a `)', then there is no declarator. */
19874 else
19880 /* Restore the saved message. */
19887 }
19889 /* Parse a throw-expression.
19891 throw-expression:
19892 throw assignment-expression [opt]
19894 Returns a THROW_EXPR representing the throw-expression. */
19896 static tree
19898 {
19899 tree expression;
19904 /* Figure out whether or not there is an assignment-expression
19905 following the "throw" keyword. */
19913 else
19918 }
19920 /* GNU Extensions */
19922 /* Parse an (optional) asm-specification.
19924 asm-specification:
19925 asm ( string-literal )
19927 If the asm-specification is present, returns a STRING_CST
19928 corresponding to the string-literal. Otherwise, returns
19929 NULL_TREE. */
19931 static tree
19933 {
19935 tree asm_specification;
19937 /* Peek at the next token. */
19939 /* If the next token isn't the `asm' keyword, then there's no
19940 asm-specification. */
19944 /* Consume the `asm' token. */
19946 /* Look for the `('. */
19949 /* Look for the string-literal. */
19952 /* Look for the `)'. */
19956 }
19958 /* Parse an asm-operand-list.
19960 asm-operand-list:
19961 asm-operand
19962 asm-operand-list , asm-operand
19964 asm-operand:
19965 string-literal ( expression )
19966 [ string-literal ] string-literal ( expression )
19968 Returns a TREE_LIST representing the operands. The TREE_VALUE of
19969 each node is the expression. The TREE_PURPOSE is itself a
19970 TREE_LIST whose TREE_PURPOSE is a STRING_CST for the bracketed
19971 string-literal (or NULL_TREE if not present) and whose TREE_VALUE
19972 is a STRING_CST for the string literal before the parenthesis. Returns
19973 ERROR_MARK_NODE if any of the operands are invalid. */
19975 static tree
19977 {
19982 {
19983 tree string_literal;
19984 tree expression;
19985 tree name;
19988 {
19989 /* Consume the `[' token. */
19991 /* Read the operand name. */
19996 /* Look for the closing `]'. */
19998 }
19999 else
20001 /* Look for the string-literal. */
20004 /* Look for the `('. */
20006 /* Parse the expression. */
20008 /* Look for the `)'. */
20016 /* Add this operand to the list. */
20018 expression,
20019 asm_operands);
20020 /* If the next token is not a `,', there are no more
20021 operands. */
20024 /* Consume the `,'. */
20026 }
20029 }
20031 /* Parse an asm-clobber-list.
20033 asm-clobber-list:
20034 string-literal
20035 asm-clobber-list , string-literal
20037 Returns a TREE_LIST, indicating the clobbers in the order that they
20038 appeared. The TREE_VALUE of each node is a STRING_CST. */
20040 static tree
20042 {
20046 {
20047 tree string_literal;
20049 /* Look for the string literal. */
20051 /* Add it to the list. */
20053 /* If the next token is not a `,', then the list is
20054 complete. */
20057 /* Consume the `,' token. */
20059 }
20062 }
20064 /* Parse an asm-label-list.
20066 asm-label-list:
20067 identifier
20068 asm-label-list , identifier
20070 Returns a TREE_LIST, indicating the labels in the order that they
20071 appeared. The TREE_VALUE of each node is a label. */
20073 static tree
20075 {
20079 {
20082 /* Look for the identifier. */
20085 {
20088 {
20094 }
20095 }
20096 /* If the next token is not a `,', then the list is
20097 complete. */
20100 /* Consume the `,' token. */
20102 }
20105 }
20107 /* Parse an (optional) series of attributes.
20109 attributes:
20110 attributes attribute
20112 attribute:
20113 __attribute__ (( attribute-list [opt] ))
20115 The return value is as for cp_parser_attribute_list. */
20117 static tree
20119 {
20123 {
20125 tree attribute_list;
20128 /* Peek at the next token. */
20130 /* If it's not `__attribute__', then we're done. */
20134 /* Consume the `__attribute__' keyword. */
20136 /* Look for the two `(' tokens. */
20140 /* Peek at the next token. */
20143 /* Parse the attribute-list. */
20145 else
20146 /* If the next token is a `)', then there is no attribute
20147 list. */
20150 /* Look for the two `)' tokens. */
20158 /* Add these new attributes to the list. */
20160 }
20163 }
20165 /* Parse an attribute-list.
20167 attribute-list:
20168 attribute
20169 attribute-list , attribute
20171 attribute:
20172 identifier
20173 identifier ( identifier )
20174 identifier ( identifier , expression-list )
20175 identifier ( expression-list )
20177 Returns a TREE_LIST, or NULL_TREE on error. Each node corresponds
20178 to an attribute. The TREE_PURPOSE of each node is the identifier
20179 indicating which attribute is in use. The TREE_VALUE represents
20180 the arguments, if any. */
20182 static tree
20184 {
20190 {
20192 tree identifier;
20193 tree attribute;
20195 /* Look for the identifier. We also allow keywords here; for
20196 example `__attribute__ ((const))' is legal. */
20200 {
20203 /* Consume the token. */
20206 /* Save away the identifier that indicates which attribute
20207 this is. */
20209 /* For keywords, use the canonical spelling, not the
20210 parsed identifier. */
20216 /* Peek at the next token. */
20218 /* If it's an `(', then parse the attribute arguments. */
20220 {
20224 vec = cp_parser_parenthesized_expression_list
20230 else
20231 {
20234 }
20235 /* Save the arguments away. */
20237 }
20240 {
20241 /* Add this attribute to the list. */
20244 }
20247 }
20248 /* Now, look for more attributes. If the next token isn't a
20249 `,', we're done. */
20253 /* Consume the comma and keep going. */
20255 }
20258 /* We built up the list in reverse order. */
20260 }
20262 /* Parse an optional `__extension__' keyword. Returns TRUE if it is
20263 present, and FALSE otherwise. *SAVED_PEDANTIC is set to the
20264 current value of the PEDANTIC flag, regardless of whether or not
20265 the `__extension__' keyword is present. The caller is responsible
20266 for restoring the value of the PEDANTIC flag. */
20268 static bool
20270 {
20271 /* Save the old value of the PEDANTIC flag. */
20275 {
20276 /* Consume the `__extension__' token. */
20278 /* We're not being pedantic while the `__extension__' keyword is
20279 in effect. */
20283 }
20286 }
20288 /* Parse a label declaration.
20290 label-declaration:
20291 __label__ label-declarator-seq ;
20293 label-declarator-seq:
20294 identifier , label-declarator-seq
20295 identifier */
20297 static void
20299 {
20300 /* Look for the `__label__' keyword. */
20304 {
20305 tree identifier;
20307 /* Look for an identifier. */
20309 /* If we failed, stop. */
20312 /* Declare it as a label. */
20314 /* If the next token is a `;', stop. */
20317 /* Look for the `,' separating the label declarations. */
20319 }
20321 /* Look for the final `;'. */
20323 }
20325 /* Support Functions */
20327 /* Looks up NAME in the current scope, as given by PARSER->SCOPE.
20328 NAME should have one of the representations used for an
20329 id-expression. If NAME is the ERROR_MARK_NODE, the ERROR_MARK_NODE
20330 is returned. If PARSER->SCOPE is a dependent type, then a
20331 SCOPE_REF is returned.
20333 If NAME is a TEMPLATE_ID_EXPR, then it will be immediately
20334 returned; the name was already resolved when the TEMPLATE_ID_EXPR
20335 was formed. Abstractly, such entities should not be passed to this
20336 function, because they do not need to be looked up, but it is
20337 simpler to check for this special case here, rather than at the
20338 call-sites.
20340 In cases not explicitly covered above, this function returns a
20341 DECL, OVERLOAD, or baselink representing the result of the lookup.
20342 If there was no entity with the indicated NAME, the ERROR_MARK_NODE
20343 is returned.
20345 If TAG_TYPE is not NONE_TYPE, it indicates an explicit type keyword
20346 (e.g., "struct") that was used. In that case bindings that do not
20347 refer to types are ignored.
20349 If IS_TEMPLATE is TRUE, bindings that do not refer to templates are
20350 ignored.
20352 If IS_NAMESPACE is TRUE, bindings that do not refer to namespaces
20353 are ignored.
20355 If CHECK_DEPENDENCY is TRUE, names are not looked up in dependent
20356 types.
20358 If AMBIGUOUS_DECLS is non-NULL, *AMBIGUOUS_DECLS is set to a
20359 TREE_LIST of candidates if name-lookup results in an ambiguity, and
20360 NULL_TREE otherwise. */
20362 static tree
20369 location_t name_location)
20370 {
20371 tree decl;
20374 /* Assume that the lookup will be unambiguous. */
20378 /* Now that we have looked up the name, the OBJECT_TYPE (if any) is
20379 no longer valid. Note that if we are parsing tentatively, and
20380 the parse fails, OBJECT_TYPE will be automatically restored. */
20386 /* A template-id has already been resolved; there is no lookup to
20387 do. */
20391 {
20395 }
20397 /* A BIT_NOT_EXPR is used to represent a destructor. By this point,
20398 it should already have been checked to make sure that the name
20399 used matches the type being destroyed. */
20401 {
20402 tree type;
20404 /* Figure out to which type this destructor applies. */
20409 else
20411 /* If that's not a class type, there is no destructor. */
20418 /* If it was a class type, return the destructor. */
20420 }
20422 /* By this point, the NAME should be an ordinary identifier. If
20423 the id-expression was a qualified name, the qualifying scope is
20424 stored in PARSER->SCOPE at this point. */
20427 /* Perform the lookup. */
20429 {
20435 /* If the SCOPE is dependent, the lookup must be deferred until
20436 the template is instantiated -- unless we are explicitly
20437 looking up names in uninstantiated templates. Even then, we
20438 cannot look up the name if the scope is not a class type; it
20439 might, for example, be a template type parameter. */
20444 /* Defer lookup. */
20446 else
20447 {
20450 /* If PARSER->SCOPE is a dependent type, then it must be a
20451 class type, and we must not be checking dependencies;
20452 otherwise, we would have processed this lookup above. So
20453 that PARSER->SCOPE is not considered a dependent base by
20454 lookup_member, we must enter the scope here. */
20458 /* If the PARSER->SCOPE is a template specialization, it
20459 may be instantiated during name lookup. In that case,
20460 errors may be issued. Even if we rollback the current
20461 tentative parse, those errors are valid. */
20466 /* 3.4.3.1: In a lookup in which the constructor is an acceptable
20467 lookup result and the nested-name-specifier nominates a class C:
20468 * if the name specified after the nested-name-specifier, when
20469 looked up in C, is the injected-class-name of C (Clause 9), or
20470 * if the name specified after the nested-name-specifier is the
20471 same as the identifier or the simple-template-id's template-
20472 name in the last component of the nested-name-specifier,
20473 the name is instead considered to name the constructor of
20474 class C. [ Note: for example, the constructor is not an
20475 acceptable lookup result in an elaborated-type-specifier so
20476 the constructor would not be used in place of the
20477 injected-class-name. --end note ] Such a constructor name
20478 shall be used only in the declarator-id of a declaration that
20479 names a constructor or in a using-declaration. */
20487 /* If we have a single function from a using decl, pull it out. */
20494 }
20496 /* If the scope is a dependent type and either we deferred lookup or
20497 we did lookup but didn't find the name, rememeber the name. */
20500 {
20502 {
20503 tree type;
20505 /* The resolution to Core Issue 180 says that `struct
20506 A::B' should be considered a type-name, even if `A'
20507 is dependent. */
20511 }
20515 CPP_CLOSE_PAREN)))
20519 else
20522 is_template);
20523 }
20526 }
20528 {
20530 /* Look up the name in the scope of the OBJECT_TYPE, unless the
20531 OBJECT_TYPE is not a class. */
20533 /* If the OBJECT_TYPE is a template specialization, it may
20534 be instantiated during name lookup. In that case, errors
20535 may be issued. Even if we rollback the current tentative
20536 parse, those errors are valid. */
20538 name,
20541 tf_warning_or_error);
20542 /* Look it up in the enclosing context, too. */
20550 }
20551 else
20552 {
20558 }
20560 /* If the lookup failed, let our caller know. */
20564 /* Pull out the template from an injected-class-name (or multiple). */
20568 /* If it's a TREE_LIST, the result of the lookup was ambiguous. */
20570 {
20573 /* The error message we have to print is too complicated for
20574 cp_parser_error, so we incorporate its actions directly. */
20576 {
20578 name);
20580 }
20582 }
20590 /* If we have resolved the name of a member declaration, check to
20591 see if the declaration is accessible. When the name resolves to
20592 set of overloaded functions, accessibility is checked when
20593 overload resolution is done.
20595 During an explicit instantiation, access is not checked at all,
20596 as per [temp.explicit]. */
20603 }
20605 /* Like cp_parser_lookup_name, but for use in the typical case where
20606 CHECK_ACCESS is TRUE, IS_TYPE is FALSE, IS_TEMPLATE is FALSE,
20607 IS_NAMESPACE is FALSE, and CHECK_DEPENDENCY is TRUE. */
20609 static tree
20611 {
20613 none_type,
20618 location);
20619 }
20621 /* If DECL is a TEMPLATE_DECL that can be treated like a TYPE_DECL in
20622 the current context, return the TYPE_DECL. If TAG_NAME_P is
20623 true, the DECL indicates the class being defined in a class-head,
20624 or declared in an elaborated-type-specifier.
20626 Otherwise, return DECL. */
20628 static tree
20630 {
20631 /* If the TEMPLATE_DECL is being declared as part of a class-head,
20632 the translation from TEMPLATE_DECL to TYPE_DECL occurs:
20634 struct A {
20635 template <typename T> struct B;
20636 };
20638 template <typename T> struct A::B {};
20640 Similarly, in an elaborated-type-specifier:
20642 namespace N { struct X{}; }
20644 struct A {
20645 template <typename T> friend struct N::X;
20646 };
20648 However, if the DECL refers to a class type, and we are in
20649 the scope of the class, then the name lookup automatically
20650 finds the TYPE_DECL created by build_self_reference rather
20651 than a TEMPLATE_DECL. For example, in:
20653 template <class T> struct S {
20654 S s;
20655 };
20657 there is no need to handle such case. */
20663 }
20665 /* If too many, or too few, template-parameter lists apply to the
20666 declarator, issue an error message. Returns TRUE if all went well,
20667 and FALSE otherwise. */
20669 static bool
20672 location_t declarator_location)
20673 {
20675 {
20677 {
20685 /* If the DECLARATOR has the form `X<y>' then it uses one
20686 additional level of template parameters. */
20689 return cp_parser_check_template_parameters
20691 }
20706 }
20708 }
20710 /* NUM_TEMPLATES were used in the current declaration. If that is
20711 invalid, return FALSE and issue an error messages. Otherwise,
20712 return TRUE. If DECLARATOR is non-NULL, then we are checking a
20713 declarator and we can print more accurate diagnostics. */
20715 static bool
20718 location_t location,
20720 {
20721 /* If there are the same number of template classes and parameter
20722 lists, that's OK. */
20725 /* If there are more, but only one more, then we are referring to a
20726 member template. That's OK too. */
20729 /* If there are more template classes than parameter lists, we have
20730 something like:
20732 template <class T> void S<T>::R<T>::f (); */
20734 {
20744 else
20747 }
20748 /* Otherwise, there are too many template parameter lists. We have
20749 something like:
20751 template <class T> template <class U> void S::f(); */
20754 }
20756 /* Parse an optional `::' token indicating that the following name is
20757 from the global namespace. If so, PARSER->SCOPE is set to the
20758 GLOBAL_NAMESPACE. Otherwise, PARSER->SCOPE is set to NULL_TREE,
20759 unless CURRENT_SCOPE_VALID_P is TRUE, in which case it is left alone.
20760 Returns the new value of PARSER->SCOPE, if the `::' token is
20761 present, and NULL_TREE otherwise. */
20763 static tree
20765 {
20768 /* Peek at the next token. */
20770 /* If we're looking at a `::' token then we're starting from the
20771 global namespace, not our current location. */
20773 {
20774 /* Consume the `::' token. */
20776 /* Set the SCOPE so that we know where to start the lookup. */
20782 }
20784 {
20788 }
20791 }
20793 /* Returns TRUE if the upcoming token sequence is the start of a
20794 constructor declarator. If FRIEND_P is true, the declarator is
20795 preceded by the `friend' specifier. */
20797 static bool
20799 {
20801 tree nested_name_specifier;
20804 /* The common case is that this is not a constructor declarator, so
20805 try to avoid doing lots of work if at all possible. It's not
20806 valid declare a constructor at function scope. */
20809 /* And only certain tokens can begin a constructor declarator. */
20817 /* Parse tentatively; we are going to roll back all of the tokens
20818 consumed here. */
20820 /* Assume that we are looking at a constructor declarator. */
20823 /* Look for the optional `::' operator. */
20826 /* Look for the nested-name-specifier. */
20827 nested_name_specifier
20833 /* Outside of a class-specifier, there must be a
20834 nested-name-specifier. */
20842 /* If we have a class scope, this is easy; DR 147 says that S::S always
20843 names the constructor, and no other qualified name could. */
20846 {
20856 }
20857 /* If we still think that this might be a constructor-declarator,
20858 look for a class-name. */
20860 {
20861 /* If we have:
20863 template <typename T> struct S {
20864 S();
20865 };
20867 we must recognize that the nested `S' names a class. */
20868 tree type_decl;
20872 none_type,
20876 /* If there was no class-name, then this is not a constructor. */
20879 /* If we're still considering a constructor, we have to see a `(',
20880 to begin the parameter-declaration-clause, followed by either a
20881 `)', an `...', or a decl-specifier. We need to check for a
20882 type-specifier to avoid being fooled into thinking that:
20884 S (f) (int);
20886 is a constructor. (It is actually a function named `f' that
20887 takes one parameter (of type `int') and returns a value of type
20888 `S'. */
20896 /* A parameter declaration begins with a decl-specifier,
20897 which is either the "attribute" keyword, a storage class
20898 specifier, or (usually) a type-specifier. */
20900 {
20901 tree type;
20905 /* Names appearing in the type-specifier should be looked up
20906 in the scope of the class. */
20909 else
20910 {
20913 {
20917 {
20920 }
20921 }
20923 }
20925 /* Inside the constructor parameter list, surrounding
20926 template-parameter-lists do not apply. */
20927 saved_num_template_parameter_lists
20931 /* Look for the type-specifier. */
20933 CP_PARSER_FLAGS_NONE,
20939 parser->num_template_parameter_lists
20942 /* Leave the scope of the class. */
20947 }
20948 }
20950 /* We did not really want to consume any tokens. */
20954 }
20956 /* Parse the definition of the function given by the DECL_SPECIFIERS,
20957 ATTRIBUTES, and DECLARATOR. The access checks have been deferred;
20958 they must be performed once we are in the scope of the function.
20960 Returns the function defined. */
20962 static tree
20963 cp_parser_function_definition_from_specifiers_and_declarator
20966 tree attributes,
20968 {
20969 tree fn;
20972 /* Begin the function-definition. */
20975 /* The things we're about to see are not directly qualified by any
20976 template headers we've seen thus far. */
20979 /* If there were names looked up in the decl-specifier-seq that we
20980 did not check, check them now. We must wait until we are in the
20981 scope of the function to perform the checks, since the function
20982 might be a friend. */
20986 {
20987 /* Skip the entire function. */
20990 }
20992 {
20993 /* Seen already, skip it. An error message has already been output. */
20997 /* If this is a function from a class, pop the nested class. */
21000 }
21001 else
21002 {
21003 timevar_id_t tv;
21006 else
21012 }
21015 }
21017 /* Parse the part of a function-definition that follows the
21018 declarator. INLINE_P is TRUE iff this function is an inline
21019 function defined within a class-specifier.
21021 Returns the function defined. */
21023 static tree
21026 {
21027 tree fn;
21036 /* If the next token is `return', then the code may be trying to
21037 make use of the "named return value" extension that G++ used to
21038 support. */
21041 {
21042 /* Consume the `return' keyword. */
21044 /* Look for the identifier that indicates what value is to be
21045 returned. */
21047 /* Issue an error message. */
21050 /* Skip tokens until we reach the start of the function body. */
21052 {
21059 }
21060 }
21061 /* The `extern' in `extern "C" void f () { ... }' does not apply to
21062 anything declared inside `f'. */
21063 saved_in_unbraced_linkage_specification_p
21066 /* Inside the function, surrounding template-parameter-lists do not
21067 apply. */
21068 saved_num_template_parameter_lists
21074 /* If the next token is `try', `__transaction_atomic', or
21075 `__transaction_relaxed`, then we are looking at either function-try-block
21076 or function-transaction-block. Note that all of these include the
21077 function-body. */
21080 RID_TRANSACTION_ATOMIC);
21082 RID_TRANSACTION_RELAXED))
21084 RID_TRANSACTION_RELAXED);
21087 else
21088 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
21093 /* Finish the function. */
21096 /* Generate code for it, if necessary. */
21098 /* Restore the saved values. */
21099 parser->in_unbraced_linkage_specification_p
21101 parser->num_template_parameter_lists
21106 }
21108 /* Parse a template-declaration, assuming that the `export' (and
21109 `extern') keywords, if present, has already been scanned. MEMBER_P
21110 is as for cp_parser_template_declaration. */
21112 static void
21114 {
21117 tree parameter_list;
21122 /* Look for the `template' keyword. */
21127 /* And the `<'. */
21131 {
21132 /* 14.5.2.2 [temp.mem]
21134 A local class shall not have member templates. */
21139 }
21140 /* [temp]
21142 A template ... shall not have C linkage. */
21144 {
21146 /* Give it C++ linkage to avoid confusing other parts of the
21147 front end. */
21150 }
21151 else
21154 /* We cannot perform access checks on the template parameter
21155 declarations until we know what is being declared, just as we
21156 cannot check the decl-specifier list. */
21159 /* If the next token is `>', then we have an invalid
21160 specialization. Rather than complain about an invalid template
21161 parameter, issue an error message here. */
21163 {
21167 }
21168 else
21169 {
21170 /* Parse the template parameters. */
21172 }
21174 /* Get the deferred access checks from the parameter list. These
21175 will be checked once we know what is being declared, as for a
21176 member template the checks must be performed in the scope of the
21177 class containing the member. */
21180 /* Look for the `>'. */
21182 /* We just processed one more parameter list. */
21184 /* If the next token is `template', there are more template
21185 parameters. */
21187 RID_TEMPLATE))
21192 else
21193 {
21194 /* There are no access checks when parsing a template, as we do not
21195 know if a specialization will be a friend. */
21199 checks,
21200 member_p,
21205 /* If this is a member template declaration, let the front
21206 end know. */
21208 {
21213 }
21219 }
21220 /* We are done with the current parameter list. */
21225 /* Finish up. */
21228 /* Check the template arguments for a literal operator template. */
21232 {
21236 else
21237 {
21241 else
21242 {
21248 }
21249 }
21253 decl);
21254 }
21255 /* Register member declarations. */
21258 /* For the erroneous case of a template with C linkage, we pushed an
21259 implicit C++ linkage scope; exit that scope now. */
21262 /* If DECL is a function template, we must return to parse it later.
21263 (Even though there is no definition, there might be default
21264 arguments that need handling.) */
21269 }
21271 /* Perform the deferred access checks from a template-parameter-list.
21272 CHECKS is a TREE_LIST of access checks, as returned by
21273 get_deferred_access_checks. */
21275 static void
21277 {
21281 }
21283 /* Parse a `decl-specifier-seq [opt] init-declarator [opt] ;' or
21284 `function-definition' sequence that follows a template header.
21285 If MEMBER_P is true, this declaration appears in a class scope.
21287 Returns the DECL for the declared entity. If FRIEND_P is non-NULL,
21288 *FRIEND_P is set to TRUE iff the declaration is a friend. */
21290 static tree
21296 {
21299 cp_decl_specifier_seq decl_specifiers;
21303 /* This function is only used when processing a template
21304 declaration. */
21308 /* Defer access checks until we know what is being declared. */
21311 /* Try the `decl-specifier-seq [opt] init-declarator [opt]'
21312 alternative. */
21315 CP_PARSER_FLAGS_OPTIONAL,
21321 /* There are no template typedefs. */
21323 {
21327 }
21329 /* Gather up the access checks that occurred the
21330 decl-specifier-seq. */
21333 /* Check for the declaration of a template class. */
21335 {
21337 {
21340 /* In this case:
21342 struct C {
21343 friend template <typename T> struct A<T>::B;
21344 };
21346 A<T>::B will be represented by a TYPENAME_TYPE, and
21347 therefore not recognized by shadow_tag. */
21349 && !decl
21356 else
21359 /* Perform access checks for template parameters. */
21361 }
21362 }
21364 /* Complain about missing 'typename' or other invalid type names. */
21367 {
21368 /* cp_parser_parse_and_diagnose_invalid_type_name calls
21369 cp_parser_skip_to_end_of_block_or_statement, so don't try to parse
21370 the rest of this declaration. */
21373 }
21375 /* If it's not a template class, try for a template function. If
21376 the next token is a `;', then this declaration does not declare
21377 anything. But, if there were errors in the decl-specifiers, then
21378 the error might well have come from an attempted class-specifier.
21379 In that case, there's no need to warn about a missing declarator. */
21383 {
21386 checks,
21388 member_p,
21389 declares_class_or_enum,
21391 NULL);
21393 /* 7.1.1-1 [dcl.stc]
21395 A storage-class-specifier shall not be specified in an explicit
21396 specialization... */
21398 && explicit_specialization_p
21400 {
21404 }
21408 }
21410 /* Look for a trailing `;' after the declaration. */
21416 out:
21419 /* Clear any current qualification; whatever comes next is the start
21420 of something new. */
21426 }
21428 /* Parse a cast-expression that is not the operand of a unary "&". */
21430 static tree
21432 {
21435 }
21437 /* Parse a functional cast to TYPE. Returns an expression
21438 representing the cast. */
21440 static tree
21442 {
21444 tree expression_list;
21445 tree cast;
21449 {
21456 tf_warning_or_error);
21457 }
21466 else
21467 {
21470 }
21473 tf_warning_or_error);
21474 /* [expr.const]/1: In an integral constant expression "only type
21475 conversions to integral or enumeration type can be used". */
21481 NIC_CONSTRUCTOR))
21484 }
21486 /* Save the tokens that make up the body of a member function defined
21487 in a class-specifier. The DECL_SPECIFIERS and DECLARATOR have
21488 already been parsed. The ATTRIBUTES are any GNU "__attribute__"
21489 specifiers applied to the declaration. Returns the FUNCTION_DECL
21490 for the member function. */
21492 static tree
21496 tree attributes)
21497 {
21500 tree fn;
21502 /* Create the FUNCTION_DECL. */
21504 /* If something went badly wrong, bail out now. */
21506 {
21507 /* If there's a function-body, skip it. */
21512 }
21514 /* Remember it, if there default args to post process. */
21517 /* Save away the tokens that make up the body of the
21518 function. */
21520 /* We can have braced-init-list mem-initializers before the fn body. */
21522 {
21526 {
21527 /* cache_group will stop after an un-nested { } pair, too. */
21531 /* variadic mem-inits have ... after the ')'. */
21534 }
21535 }
21537 /* Handle function try blocks. */
21542 /* Save away the inline definition; we will process it when the
21543 class is complete. */
21547 /* We need to know that this was defined in the class, so that
21548 friend templates are handled correctly. */
21551 /* Add FN to the queue of functions to be parsed later. */
21555 }
21557 /* Save the tokens that make up the in-class initializer for a non-static
21558 data member. Returns a DEFAULT_ARG. */
21560 static tree
21562 {
21564 }
21566 /* Parse a template-argument-list, as well as the trailing ">" (but
21567 not the opening "<"). See cp_parser_template_argument_list for the
21568 return value. */
21570 static tree
21572 {
21573 tree arguments;
21574 tree saved_scope;
21575 tree saved_qualifying_scope;
21576 tree saved_object_scope;
21581 /* [temp.names]
21583 When parsing a template-id, the first non-nested `>' is taken as
21584 the end of the template-argument-list rather than a greater-than
21585 operator. */
21586 saved_greater_than_is_operator_p
21589 /* Parsing the argument list may modify SCOPE, so we save it
21590 here. */
21594 /* We need to evaluate the template arguments, even though this
21595 template-id may be nested within a "sizeof". */
21600 /* Parse the template-argument-list itself. */
21604 else
21606 /* Look for the `>' that ends the template-argument-list. If we find
21607 a '>>' instead, it's probably just a typo. */
21609 {
21611 {
21612 /* In C++0x, a `>>' in a template argument list or cast
21613 expression is considered to be two separate `>'
21614 tokens. So, change the current token to a `>', but don't
21615 consume it: it will be consumed later when the outer
21616 template argument list (or cast expression) is parsed.
21617 Note that this replacement of `>' for `>>' is necessary
21618 even if we are parsing tentatively: in the tentative
21619 case, after calling
21620 cp_parser_enclosed_template_argument_list we will always
21621 throw away all of the template arguments and the first
21622 closing `>', either because the template argument list
21623 was erroneous or because we are replacing those tokens
21624 with a CPP_TEMPLATE_ID token. The second `>' (which will
21625 not have been thrown away) is needed either to close an
21626 outer template argument list or to complete a new-style
21627 cast. */
21630 }
21632 {
21633 /* If we're in a nested template argument list, the '>>' has
21634 to be a typo for '> >'. We emit the error message, but we
21635 continue parsing and we push a '>' as next token, so that
21636 the argument list will be parsed correctly. Note that the
21637 global source location is still on the token before the
21638 '>>', so we need to say explicitly where we want it. */
21644 }
21645 else
21646 {
21647 /* If this is not a nested template argument list, the '>>'
21648 is a typo for '>'. Emit an error message and continue.
21649 Same deal about the token location, but here we can get it
21650 right by consuming the '>>' before issuing the diagnostic. */
21653 "spurious %<>>%>, use %<>%> to terminate "
21655 }
21656 }
21657 else
21659 /* The `>' token might be a greater-than operator again now. */
21660 parser->greater_than_is_operator_p
21662 /* Restore the SAVED_SCOPE. */
21670 }
21672 /* MEMBER_FUNCTION is a member function, or a friend. If default
21673 arguments, or the body of the function have not yet been parsed,
21674 parse them now. */
21676 static void
21678 {
21680 /* If this member is a template, get the underlying
21681 FUNCTION_DECL. */
21685 /* There should not be any class definitions in progress at this
21686 point; the bodies of members are only parsed outside of all class
21687 definitions. */
21689 /* While we're parsing the member functions we might encounter more
21690 classes. We want to handle them right away, but we don't want
21691 them getting mixed up with functions that are currently in the
21692 queue. */
21695 /* Make sure that any template parameters are in scope. */
21698 /* If the body of the function has not yet been parsed, parse it
21699 now. */
21701 {
21702 tree function_scope;
21705 /* The function is no longer pending; we are processing it. */
21710 /* If this is a local class, enter the scope of the containing
21711 function. */
21716 /* Push the body of the function onto the lexer stack. */
21719 /* Let the front end know that we going to be defining this
21720 function. */
21724 /* Don't do access checking if it is a templated function. */
21728 /* Now, parse the body of the function. */
21735 /* Leave the scope of the containing function. */
21739 }
21741 /* Remove any template parameters from the symbol table. */
21744 /* Restore the queue. */
21747 }
21749 /* If DECL contains any default args, remember it on the unparsed
21750 functions queue. */
21752 static void
21754 {
21755 tree probe;
21758 probe;
21761 {
21766 }
21767 }
21769 /* DEFAULT_ARG contains the saved tokens for the initializer of DECL,
21770 which is either a FIELD_DECL or PARM_DECL. Parse it and return
21771 the result. For a PARM_DECL, PARMTYPE is the corresponding type
21772 from the parameter-type-list. */
21774 static tree
21777 {
21779 tree parsed_arg;
21785 /* Push the saved tokens for the default argument onto the parser's
21786 lexer stack. */
21792 /* Parse the default argument. */
21803 {
21804 /* In a non-template class, check conversions now. In a template,
21805 we'll wait and instantiate these as needed. */
21808 else
21809 {
21815 }
21816 }
21818 /* If the token stream has not been completely used up, then
21819 there was extra junk after the end of the default
21820 argument. */
21822 {
21825 else
21827 }
21829 /* Revert to the main lexer. */
21833 }
21835 /* FIELD is a non-static data member with an initializer which we saved for
21836 later; parse it now. */
21838 static void
21840 {
21841 tree def;
21846 NULL_TREE);
21850 }
21852 /* FN is a FUNCTION_DECL which may contains a parameter with an
21853 unparsed DEFAULT_ARG. Parse the default args now. This function
21854 assumes that the current scope is the scope in which the default
21855 argument should be processed. */
21857 static void
21859 {
21863 /* While we're parsing the default args, we might (due to the
21864 statement expression extension) encounter more classes. We want
21865 to handle them right away, but we don't want them getting mixed
21866 up with default args that are currently in the queue. */
21869 /* Local variable names (and the `this' keyword) may not appear
21870 in a default argument. */
21881 {
21883 tree parsed_arg;
21885 tree copy;
21892 /* This can happen for a friend declaration for a function
21893 already declared with default arguments. */
21896 parsed_arg
21898 default_arg,
21901 {
21903 }
21907 /* Update any instantiations we've already created. */
21911 }
21915 /* Make sure no default arg is missing. */
21918 /* Restore the state of local_variables_forbidden_p. */
21921 /* Restore the queue. */
21923 }
21925 /* Parse the operand of `sizeof' (or a similar operator). Returns
21926 either a TYPE or an expression, depending on the form of the
21927 input. The KEYWORD indicates which kind of expression we have
21928 encountered. */
21930 static tree
21932 {
21940 /* Types cannot be defined in a `sizeof' expression. Save away the
21941 old message. */
21943 /* And create the new one. */
21949 /* The restrictions on constant-expressions do not apply inside
21950 sizeof expressions. */
21951 saved_integral_constant_expression_p
21953 saved_non_integral_constant_expression_p
21957 /* If it's a `...', then we are computing the length of a parameter
21958 pack. */
21961 {
21962 /* Consume the `...'. */
21966 /* Note that this is an expansion. */
21968 }
21970 /* Do not actually evaluate the expression. */
21973 /* If it's a `(', then we might be looking at the type-id
21974 construction. */
21976 {
21977 tree type;
21980 /* We can't be sure yet whether we're looking at a type-id or an
21981 expression. */
21983 /* Consume the `('. */
21985 /* Parse the type-id. */
21990 /* Now, look for the trailing `)'. */
21992 /* If all went well, then we're done. */
21994 {
21995 cp_decl_specifier_seq decl_specs;
21997 /* Build a trivial decl-specifier-seq. */
22001 /* Call grokdeclarator to figure out what type this is. */
22004 TYPENAME,
22007 }
22008 }
22013 /* If the type-id production did not work out, then we must be
22014 looking at the unary-expression production. */
22020 /* Build a pack expansion. */
22023 /* Go back to evaluating expressions. */
22027 /* Free the message we created. */
22029 /* And restore the old one. */
22031 parser->integral_constant_expression_p
22033 parser->non_integral_constant_expression_p
22037 }
22039 /* If the current declaration has no declarator, return true. */
22041 static bool
22043 {
22044 /* If the next token is a `;' or a `,' then there is no
22045 declarator. */
22048 }
22050 /* Update the DECL_SPECS to reflect the storage class indicated by
22051 KEYWORD. */
22053 static void
22057 location_t location)
22058 {
22059 cp_storage_class storage_class;
22062 {
22066 }
22068 {
22071 }
22075 {
22079 }
22082 {
22100 }
22104 /* A storage class specifier cannot be applied alongside a typedef
22105 specifier. If there is a typedef specifier present then set
22106 conflicting_specifiers_p which will trigger an error later
22107 on in grokdeclarator. */
22110 }
22112 /* Update the DECL_SPECS to reflect the TYPE_SPEC. If TYPE_DEFINITION_P
22113 is true, the type is a class or enum definition. */
22115 static void
22117 tree type_spec,
22118 location_t location,
22120 {
22123 /* If the user tries to redeclare bool, char16_t, char32_t, or wchar_t
22124 (with, for example, in "typedef int wchar_t;") we remember that
22125 this is what happened. In system headers, we ignore these
22126 declarations so that G++ can work with system headers that are not
22127 C++-safe. */
22129 && !type_definition_p
22139 {
22142 ds_redefined_builtin_type_spec,
22143 location);
22145 {
22149 }
22150 }
22153 else
22154 {
22159 }
22160 }
22162 /* Set the location for a declarator specifier and check if it is
22163 duplicated.
22165 DECL_SPECS is the sequence of declarator specifiers onto which to
22166 set the location.
22168 DS is the single declarator specifier to set which location is to
22169 be set onto the existing sequence of declarators.
22171 LOCATION is the location for the declarator specifier to
22172 consider. */
22174 static void
22177 {
22185 else
22186 {
22188 {
22192 else
22193 {
22196 OPT_Wlong_long,
22198 }
22199 }
22200 else
22201 {
22218 "__thread"
22219 };
22222 }
22223 }
22224 }
22226 /* Return true iff the declarator specifier DS is present in the
22227 sequence of declarator specifiers DECL_SPECS. */
22229 bool
22231 cp_decl_spec ds)
22232 {
22239 }
22241 /* DECL_SPECIFIERS is the representation of a decl-specifier-seq.
22242 Returns TRUE iff `friend' appears among the DECL_SPECIFIERS. */
22244 static bool
22246 {
22248 }
22250 /* Issue an error message indicating that TOKEN_DESC was expected.
22251 If KEYWORD is true, it indicated this function is called by
22252 cp_parser_require_keword and the required token can only be
22253 a indicated keyword. */
22255 static void
22257 required_token token_desc,
22259 {
22261 {
22330 }
22332 {
22334 {
22413 }
22414 }
22415 else
22417 }
22421 /* If the next token is of the indicated TYPE, consume it. Otherwise,
22422 issue an error message indicating that TOKEN_DESC was expected.
22424 Returns the token consumed, if the token had the appropriate type.
22425 Otherwise, returns NULL. */
22430 required_token token_desc)
22431 {
22434 else
22435 {
22436 /* Output the MESSAGE -- unless we're parsing tentatively. */
22440 }
22441 }
22443 /* An error message is produced if the next token is not '>'.
22444 All further tokens are skipped until the desired token is
22445 found or '{', '}', ';' or an unbalanced ')' or ']'. */
22447 static void
22449 {
22450 /* Current level of '< ... >'. */
22452 /* Ignore '<' and '>' nested inside '( ... )' or '[ ... ]'. */
22455 /* Are we ready, yet? If not, issue error message. */
22459 /* Skip tokens until the desired token is found. */
22461 {
22462 /* Peek at the next token. */
22464 {
22472 /* C++0x views the `>>' operator as two `>' tokens, but
22473 C++98 does not. */
22476 {
22477 /* We've hit a `>>' where the first `>' closes the
22478 template argument list, and the second `>' is
22479 spurious. Just consume the `>>' and stop; we've
22480 already produced at least one error. */
22483 }
22484 /* Fall through for C++0x, so we handle the second `>' in
22485 the `>>'. */
22489 {
22490 /* We've reached the token we want, consume it and stop. */
22493 }
22512 /* The '>' was probably forgotten, don't look further. */
22517 }
22519 /* Consume this token. */
22521 }
22522 }
22524 /* If the next token is the indicated keyword, consume it. Otherwise,
22525 issue an error message indicating that TOKEN_DESC was expected.
22527 Returns the token consumed, if the token had the appropriate type.
22528 Otherwise, returns NULL. */
22533 required_token token_desc)
22534 {
22538 {
22541 }
22544 }
22546 /* Returns TRUE iff TOKEN is a token that can begin the body of a
22547 function-definition. */
22549 static bool
22551 {
22554 /* A ctor-initializer begins with a `:'. */
22556 /* A function-try-block begins with `try'. */
22558 /* A function-transaction-block begins with `__transaction_atomic'
22559 or `__transaction_relaxed'. */
22562 /* The named return value extension begins with `return'. */
22564 }
22566 /* Returns TRUE iff the next token is the ":" or "{" beginning a class
22567 definition. */
22569 static bool
22571 {
22576 }
22578 /* Returns TRUE iff the next token is the "," or ">" (or `>>', in
22579 C++0x) ending a template-argument. */
22581 static bool
22583 {
22591 }
22593 /* Returns TRUE iff the n-th token is a "<", or the n-th is a "[" and the
22594 (n+1)-th is a ":" (which is a possible digraph typo for "< ::"). */
22596 static bool
22599 {
22605 /* Check for the sequence `<::' in the original code. It would be lexed as
22606 `[:', where `[' is a digraph, and there is no whitespace before
22607 `:'. */
22609 {
22614 }
22616 }
22618 /* Returns the kind of tag indicated by TOKEN, if it is a class-key,
22619 or none_type otherwise. */
22621 static enum tag_types
22623 {
22625 {
22635 }
22636 }
22638 /* Issue an error message if the CLASS_KEY does not match the TYPE. */
22640 static void
22642 {
22646 {
22650 type);
22653 }
22654 }
22656 /* Issue an error message if DECL is redeclared with different
22657 access than its original declaration [class.access.spec/3].
22658 This applies to nested classes and nested class templates.
22659 [class.mem/1]. */
22661 static void
22663 {
22672 }
22674 /* Look for the `template' keyword, as a syntactic disambiguator.
22675 Return TRUE iff it is present, in which case it will be
22676 consumed. */
22678 static bool
22680 {
22682 {
22683 /* The `template' keyword can only be used within templates;
22684 outside templates the parser can always figure out what is a
22685 template and what is not. */
22687 {
22690 "%<template%> (as a disambiguator) is only allowed "
22692 /* If this part of the token stream is rescanned, the same
22693 error message would be generated. So, we purge the token
22694 from the stream. */
22697 }
22698 else
22699 {
22700 /* Consume the `template' keyword. */
22703 }
22704 }
22707 }
22709 /* The next token is a CPP_NESTED_NAME_SPECIFIER. Consume the token,
22710 set PARSER->SCOPE, and perform other related actions. */
22712 static void
22714 {
22720 /* Get the stored value. */
22722 /* Perform any access checks that were deferred. */
22725 {
22730 }
22731 /* Set the scope from the stored value. */
22735 }
22737 /* Consume tokens up through a non-nested END token. Returns TRUE if we
22738 encounter the end of a block before what we were looking for. */
22740 static bool
22744 {
22746 {
22749 /* Abort a parenthesized expression if we encounter a semicolon. */
22753 /* If we've reached the end of the file, stop. */
22759 /* We've hit the end of an enclosing block, so there's been some
22760 kind of syntax error. */
22763 /* Consume the token. */
22765 /* See if it starts a new group. */
22767 {
22769 /* In theory this should probably check end == '}', but
22770 cp_parser_save_member_function_body needs it to exit
22771 after either '}' or ')' when called with ')'. */
22774 }
22776 {
22780 }
22785 }
22786 }
22788 /* Like above, for caching a default argument or NSDMI. Both of these are
22789 terminated by a non-nested comma, but it can be unclear whether or not a
22790 comma is nested in a template argument list unless we do more parsing.
22791 In order to handle this ambiguity, when we encounter a ',' after a '<'
22792 we try to parse what follows as a parameter-declaration-list (in the
22793 case of a default argument) or a member-declarator (in the case of an
22794 NSDMI). If that succeeds, then we stop caching. */
22796 static tree
22798 {
22803 tree default_argument;
22805 /* Add tokens until we have processed the entire default
22806 argument. We add the range [first_token, token). */
22809 {
22810 /* For list-initialization, this is straightforward. */
22813 }
22815 {
22818 /* Peek at the next token. */
22820 /* What we do depends on what token we have. */
22822 {
22823 /* In valid code, a default argument must be
22824 immediately followed by a `,' `)', or `...'. */
22827 {
22828 /* If we've seen a '<', we might be in a
22829 template-argument-list. Until Core issue 325 is
22830 resolved, we don't know how this situation ought
22831 to be handled, so try to DTRT. We check whether
22832 what comes after the comma is a valid parameter
22833 declaration list. If it is, then the comma ends
22834 the default argument; otherwise the default
22835 argument continues. */
22837 tree t;
22839 /* Set ITALP so cp_parser_parameter_declaration_list
22840 doesn't decide to commit to this parse. */
22848 {
22854 }
22855 else
22856 {
22862 }
22869 }
22872 /* If we run into a non-nested `;', `}', or `]',
22873 then the code is invalid -- but the default
22874 argument is certainly over. */
22880 /* Update DEPTH, if necessary. */
22895 /* This might be the comparison operator, or it might
22896 start a template argument list. */
22903 /* Fall through for C++0x, which treats the `>>'
22904 operator like two `>' tokens in certain
22905 cases. */
22909 {
22910 /* This might be an operator, or it might close a
22911 template argument list. But if a previous '<'
22912 started a template argument list, this will have
22913 closed it, so we can't be in one anymore. */
22917 }
22920 /* If we run out of tokens, issue an error message. */
22929 /* In these cases, we should look for template-ids.
22930 For example, if the default argument is
22931 `X<int, double>()', we need to do name lookup to
22932 figure out whether or not `X' is a template; if
22933 so, the `,' does not end the default argument.
22935 That is not yet done. */
22940 }
22942 /* If we've reached the end, stop. */
22946 /* Add the token to the token block. */
22948 }
22950 /* Create a DEFAULT_ARG to represent the unparsed default
22951 argument. */
22958 }
22960 /* Begin parsing tentatively. We always save tokens while parsing
22961 tentatively so that if the tentative parsing fails we can restore the
22962 tokens. */
22964 static void
22966 {
22967 /* Enter a new parsing context. */
22969 /* Begin saving tokens. */
22971 /* In order to avoid repetitive access control error messages,
22972 access checks are queued up until we are no longer parsing
22973 tentatively. */
22975 }
22977 /* Commit to the currently active tentative parse. */
22979 static void
22981 {
22985 /* Mark all of the levels as committed. */
22988 {
22995 }
22996 }
22998 /* Abort the currently active tentative parse. All consumed tokens
22999 will be rolled back, and no diagnostics will be issued. */
23001 static void
23003 {
23007 /* Now, pretend that we want to see if the construct was
23008 successfully parsed. */
23010 }
23012 /* Stop parsing tentatively. If a parse error has occurred, restore the
23013 token stream. Otherwise, commit to the tokens we have consumed.
23014 Returns true if no error occurred; false otherwise. */
23016 static bool
23018 {
23022 /* Remember whether or not an error occurred, since we are about to
23023 destroy that information. */
23025 /* Remove the topmost context from the stack. */
23028 /* If no parse errors occurred, commit to the tentative parse. */
23030 {
23031 /* Commit to the tokens read tentatively, unless that was
23032 already done. */
23037 }
23038 /* Otherwise, if errors occurred, roll back our state so that things
23039 are just as they were before we began the tentative parse. */
23040 else
23041 {
23044 }
23045 /* Add the context to the front of the free list. */
23050 }
23052 /* Returns true if we are parsing tentatively and are not committed to
23053 this tentative parse. */
23055 static bool
23057 {
23060 }
23062 /* Returns nonzero iff an error has occurred during the most recent
23063 tentative parse. */
23065 static bool
23067 {
23070 }
23072 /* Returns nonzero if GNU extensions are allowed. */
23074 static bool
23076 {
23078 }
23079 \f
23080 /* Objective-C++ Productions */
23083 /* Parse an Objective-C expression, which feeds into a primary-expression
23084 above.
23086 objc-expression:
23087 objc-message-expression
23088 objc-string-literal
23089 objc-encode-expression
23090 objc-protocol-expression
23091 objc-selector-expression
23093 Returns a tree representation of the expression. */
23095 static tree
23097 {
23098 /* Try to figure out what kind of declaration is present. */
23102 {
23112 {
23124 }
23130 }
23133 }
23135 /* Parse an Objective-C message expression.
23137 objc-message-expression:
23138 [ objc-message-receiver objc-message-args ]
23140 Returns a representation of an Objective-C message. */
23142 static tree
23144 {
23153 }
23155 /* Parse an objc-message-receiver.
23157 objc-message-receiver:
23158 expression
23159 simple-type-specifier
23161 Returns a representation of the type or expression. */
23163 static tree
23165 {
23166 tree rcv;
23168 /* An Objective-C message receiver may be either (1) a type
23169 or (2) an expression. */
23178 CP_PARSER_FLAGS_NONE);
23181 }
23183 /* Parse the arguments and selectors comprising an Objective-C message.
23185 objc-message-args:
23186 objc-selector
23187 objc-selector-args
23188 objc-selector-args , objc-comma-args
23190 objc-selector-args:
23191 objc-selector [opt] : assignment-expression
23192 objc-selector-args objc-selector [opt] : assignment-expression
23194 objc-comma-args:
23195 assignment-expression
23196 objc-comma-args , assignment-expression
23198 Returns a TREE_LIST, with TREE_PURPOSE containing a list of
23199 selector arguments and TREE_VALUE containing a list of comma
23200 arguments. */
23202 static tree
23204 {
23210 {
23216 /* Detect if we have a unary selector. */
23225 sel_args
23230 }
23232 /* Handle non-selector arguments, if any. */
23234 {
23235 tree arg;
23240 addl_args
23245 }
23248 {
23251 }
23254 }
23256 /* Parse an Objective-C encode expression.
23258 objc-encode-expression:
23259 @encode objc-typename
23261 Returns an encoded representation of the type argument. */
23263 static tree
23265 {
23266 tree type;
23276 {
23280 }
23282 /* This happens if we find @encode(T) (where T is a template
23283 typename or something dependent on a template typename) when
23284 parsing a template. In that case, we can't compile it
23285 immediately, but we rather create an AT_ENCODE_EXPR which will
23286 need to be instantiated when the template is used.
23287 */
23289 {
23293 }
23296 }
23298 /* Parse an Objective-C @defs expression. */
23300 static tree
23302 {
23303 tree name;
23311 }
23313 /* Parse an Objective-C protocol expression.
23315 objc-protocol-expression:
23316 @protocol ( identifier )
23318 Returns a representation of the protocol expression. */
23320 static tree
23322 {
23323 tree proto;
23331 }
23333 /* Parse an Objective-C selector expression.
23335 objc-selector-expression:
23336 @selector ( objc-method-signature )
23338 objc-method-signature:
23339 objc-selector
23340 objc-selector-seq
23342 objc-selector-seq:
23343 objc-selector :
23344 objc-selector-seq objc-selector :
23346 Returns a representation of the method selector. */
23348 static tree
23350 {
23362 {
23371 {
23372 /* Detect if we have a unary selector. */
23374 {
23377 }
23378 else
23379 {
23381 }
23382 }
23387 {
23388 sel_seq
23391 sel_seq
23394 }
23395 else
23396 sel_seq
23401 }
23403 finish_selector:
23407 }
23409 /* Parse a list of identifiers.
23411 objc-identifier-list:
23412 identifier
23413 objc-identifier-list , identifier
23415 Returns a TREE_LIST of identifier nodes. */
23417 static tree
23419 {
23420 tree identifier;
23421 tree list;
23432 {
23439 identifier));
23441 }
23444 }
23446 /* Parse an Objective-C alias declaration.
23448 objc-alias-declaration:
23449 @compatibility_alias identifier identifier ;
23451 This function registers the alias mapping with the Objective-C front end.
23452 It returns nothing. */
23454 static void
23456 {
23464 }
23466 /* Parse an Objective-C class forward-declaration.
23468 objc-class-declaration:
23469 @class objc-identifier-list ;
23471 The function registers the forward declarations with the Objective-C
23472 front end. It returns nothing. */
23474 static void
23476 {
23479 {
23480 tree id;
23490 else
23492 }
23494 }
23496 /* Parse a list of Objective-C protocol references.
23498 objc-protocol-refs-opt:
23499 objc-protocol-refs [opt]
23501 objc-protocol-refs:
23502 < objc-identifier-list >
23504 Returns a TREE_LIST of identifiers, if any. */
23506 static tree
23508 {
23512 {
23516 }
23519 }
23521 /* Parse a Objective-C visibility specification. */
23523 static void
23525 {
23529 {
23544 }
23546 /* Eat '@private'/'@protected'/'@public'. */
23548 }
23550 /* Parse an Objective-C method type. Return 'true' if it is a class
23551 (+) method, and 'false' if it is an instance (-) method. */
23555 {
23558 else
23560 }
23562 /* Parse an Objective-C protocol qualifier. */
23564 static tree
23566 {
23579 {
23584 }
23587 }
23589 /* Parse an Objective-C typename. */
23591 static tree
23593 {
23597 {
23603 /* An ObjC type name may consist of just protocol qualifiers, in which
23604 case the type shall default to 'id'. */
23606 {
23609 /* If the type could not be parsed, an error has already
23610 been produced. For error recovery, behave as if it had
23611 not been specified, which will use the default type
23612 'id'. */
23614 {
23616 /* We need to skip to the closing parenthesis as
23617 cp_parser_type_id() does not seem to do it for
23618 us. */
23623 }
23624 }
23628 }
23631 }
23633 /* Check to see if TYPE refers to an Objective-C selector name. */
23635 static bool
23637 {
23643 }
23645 /* Parse an Objective-C selector. */
23647 static tree
23649 {
23653 {
23656 }
23658 /* C++ operator names are allowed to appear in ObjC selectors. */
23660 {
23673 }
23674 }
23676 /* Parse an Objective-C params list. */
23678 static tree
23680 {
23686 {
23696 /* Detect if we have a unary selector. */
23699 {
23702 }
23706 {
23707 /* Something went quite wrong. There should be a colon
23708 here, but there is not. Stop parsing parameters. */
23710 }
23712 /* New ObjC allows attributes on parameters too. */
23717 params
23720 type_name,
23721 identifier,
23722 parm_attr));
23725 }
23728 {
23731 }
23733 /* We allow tail attributes for the method. */
23735 {
23743 }
23746 {
23749 }
23751 }
23753 /* Parse the non-keyword Objective-C params. */
23755 static tree
23758 {
23764 {
23766 tree parm;
23772 {
23777 }
23779 /* TODO: parse attributes for tail parameters. */
23788 }
23790 /* We allow tail attributes for the method. */
23792 {
23794 {
23799 }
23800 else
23801 /* We have an error, but parse the attributes, so that we can
23802 carry on. */
23808 }
23811 }
23813 /* Parse a linkage specification, a pragma, an extra semicolon or a block. */
23815 static void
23817 {
23820 /* If the next token is `extern' and the following token is a string
23821 literal, then we have a linkage specification. */
23823 && cp_parser_is_pure_string_literal
23826 /* Handle #pragma, if any. */
23829 /* Allow stray semicolons. */
23832 /* Mark methods as optional or required, when building protocols. */
23834 {
23837 }
23839 {
23842 }
23845 /* Other stray characters must generate errors. */
23847 {
23851 }
23852 /* Finally, try to parse a block-declaration, or a function-definition. */
23853 else
23855 }
23857 /* Parse a method signature. */
23859 static tree
23861 {
23877 }
23879 static bool
23881 {
23882 tree tattr;
23887 /* If the attributes are followed by a method introducer, this is not allowed.
23888 Dump the attributes and flag the situation. */
23893 /* Otherwise, the attributes introduce some interstitial code, possibly so
23894 rewind to allow that check. */
23897 }
23899 /* Parse an Objective-C method prototype list. */
23901 static void
23903 {
23907 {
23909 {
23914 else
23918 {
23922 }
23925 }
23931 OPT_Wattributes,
23933 else
23934 /* Allow for interspersed non-ObjC++ code. */
23938 }
23942 else
23946 }
23948 /* Parse an Objective-C method definition list. */
23950 static void
23952 {
23956 {
23957 tree meth;
23960 {
23966 else
23971 {
23975 }
23977 NULL_TREE);
23979 /* For historical reasons, we accept an optional semicolon. */
23986 {
23993 }
23994 }
23995 /* The following case will be removed once @synthesize is
23996 completely implemented. */
24007 else
24008 /* Allow for interspersed non-ObjC++ code. */
24012 }
24016 else
24020 }
24022 /* Parse Objective-C ivars. */
24024 static void
24026 {
24037 {
24038 cp_decl_specifier_seq declspecs;
24040 tree prefix_attributes;
24048 CP_PARSER_FLAGS_OPTIONAL,
24052 /* auto, register, static, extern, mutable. */
24054 {
24057 }
24059 /* __thread. */
24061 {
24064 }
24066 /* typedef. */
24068 {
24071 }
24076 /* Keep going until we hit the `;' at the end of the
24077 declaration. */
24079 {
24084 /* Check for a (possibly unnamed) bitfield declaration. */
24092 {
24093 /* Get the name of the bitfield. */
24096 sfk_none);
24098 eat_colon:
24100 /* Get the width of the bitfield. */
24101 width
24104 NULL);
24105 }
24106 else
24107 {
24108 /* Parse the declarator. */
24109 declarator
24114 }
24116 /* Look for attributes that apply to the ivar. */
24118 /* Remember which attributes are prefix attributes and
24119 which are not. */
24121 /* Combine the attributes. */
24125 /* Create the bitfield declaration. */
24127 width,
24128 attributes);
24129 else
24134 /* Add the instance variable. */
24138 /* Reset PREFIX_ATTRIBUTES. */
24147 {
24150 }
24152 }
24156 }
24161 /* Do not consume the RID_AT_END, so it will be read again as terminating
24162 the @interface of @implementation. */
24166 /* For historical reasons, we accept an optional semicolon. */
24169 }
24171 /* Parse an Objective-C protocol declaration. */
24173 static void
24175 {
24181 {
24186 }
24188 /* See if we have a forward declaration or a definition. */
24191 /* Try a forward declaration first. */
24193 {
24195 {
24196 tree id;
24206 else
24208 }
24210 }
24212 /* Ok, we got a full-fledged definition (or at least should). */
24213 else
24214 {
24219 }
24220 }
24222 /* Parse an Objective-C superclass or category. */
24224 static void
24229 {
24235 {
24238 }
24240 {
24243 /* If there is no category name, and this is an @interface, we
24244 have a class extension. */
24246 {
24249 }
24250 else
24254 }
24255 }
24257 /* Parse an Objective-C class interface. */
24259 static void
24261 {
24268 {
24269 /* It's hard to recover because even if valid @interface stuff
24270 is to follow, we can't compile it (or validate it) if we
24271 don't even know which class it refers to. Let's assume this
24272 was a stray '@interface' token in the stream and skip it.
24273 */
24275 }
24280 /* We have either a class or a category on our hands. */
24283 else
24284 {
24286 /* Handle instance variable declarations, if any. */
24289 }
24292 }
24294 /* Parse an Objective-C class implementation. */
24296 static void
24298 {
24305 {
24306 /* It's hard to recover because even if valid @implementation
24307 stuff is to follow, we can't compile it (or validate it) if
24308 we don't even know which class it refers to. Let's assume
24309 this was a stray '@implementation' token in the stream and
24310 skip it.
24311 */
24313 }
24317 /* We have either a class or a category on our hands. */
24320 else
24321 {
24323 /* Handle instance variable declarations, if any. */
24326 }
24329 }
24331 /* Consume the @end token and finish off the implementation. */
24333 static void
24335 {
24338 }
24340 /* Parse an Objective-C declaration. */
24342 static void
24344 {
24345 /* Try to figure out what kind of declaration is present. */
24350 {
24366 }
24369 {
24392 }
24393 }
24395 /* Parse an Objective-C try-catch-finally statement.
24397 objc-try-catch-finally-stmt:
24398 @try compound-statement objc-catch-clause-seq [opt]
24399 objc-finally-clause [opt]
24401 objc-catch-clause-seq:
24402 objc-catch-clause objc-catch-clause-seq [opt]
24404 objc-catch-clause:
24405 @catch ( objc-exception-declaration ) compound-statement
24407 objc-finally-clause:
24408 @finally compound-statement
24410 objc-exception-declaration:
24411 parameter-declaration
24412 '...'
24414 where '...' is to be interpreted literally, that is, it means CPP_ELLIPSIS.
24416 Returns NULL_TREE.
24418 PS: This function is identical to c_parser_objc_try_catch_finally_statement
24419 for C. Keep them in sync. */
24421 static tree
24423 {
24424 location_t location;
24425 tree stmt;
24430 /* NB: The @try block needs to be wrapped in its own STATEMENT_LIST
24431 node, lest it get absorbed into the surrounding block. */
24437 {
24446 {
24447 /* We have "@catch (...)" (where the '...' are literally
24448 what is in the code). Skip the '...'.
24449 parameter_declaration is set to NULL_TREE, and
24450 objc_being_catch_clauses() knows that that means
24451 '...'. */
24454 }
24455 else
24456 {
24457 /* We have "@catch (NSException *exception)" or something
24458 like that. Parse the parameter declaration. */
24462 else
24467 }
24470 else
24471 {
24472 /* If there was no open parenthesis, we are recovering from
24473 an error, and we are trying to figure out what mistake
24474 the user has made. */
24476 /* If there is an immediate closing parenthesis, the user
24477 probably forgot the opening one (ie, they typed "@catch
24478 NSException *e)". Parse the closing parenthesis and keep
24479 going. */
24483 /* If these is no immediate closing parenthesis, the user
24484 probably doesn't know that parenthesis are required at
24485 all (ie, they typed "@catch NSException *e"). So, just
24486 forget about the closing parenthesis and keep going. */
24487 }
24491 }
24493 {
24496 /* NB: The @finally block needs to be wrapped in its own STATEMENT_LIST
24497 node, lest it get absorbed into the surrounding block. */
24501 }
24504 }
24506 /* Parse an Objective-C synchronized statement.
24508 objc-synchronized-stmt:
24509 @synchronized ( expression ) compound-statement
24511 Returns NULL_TREE. */
24513 static tree
24515 {
24516 location_t location;
24527 /* NB: The @synchronized block needs to be wrapped in its own STATEMENT_LIST
24528 node, lest it get absorbed into the surrounding block. */
24533 }
24535 /* Parse an Objective-C throw statement.
24537 objc-throw-stmt:
24538 @throw assignment-expression [opt] ;
24540 Returns a constructed '@throw' statement. */
24542 static tree
24544 {
24556 }
24558 /* Parse an Objective-C statement. */
24560 static tree
24562 {
24563 /* Try to figure out what kind of declaration is present. */
24567 {
24578 }
24581 }
24583 /* If we are compiling ObjC++ and we see an __attribute__ we neeed to
24584 look ahead to see if an objc keyword follows the attributes. This
24585 is to detect the use of prefix attributes on ObjC @interface and
24586 @protocol. */
24588 static bool
24590 {
24595 {
24598 }
24601 }
24603 /* This routine is a minimal replacement for
24604 c_parser_struct_declaration () used when parsing the list of
24605 types/names or ObjC++ properties. For example, when parsing the
24606 code
24608 @property (readonly) int a, b, c;
24610 this function is responsible for parsing "int a, int b, int c" and
24611 returning the declarations as CHAIN of DECLs.
24613 TODO: Share this code with cp_parser_objc_class_ivars. It's very
24614 similar parsing. */
24615 static tree
24617 {
24619 cp_decl_specifier_seq declspecs;
24621 tree prefix_attributes;
24624 CP_PARSER_FLAGS_NONE,
24631 /* auto, register, static, extern, mutable. */
24633 {
24636 }
24638 /* __thread. */
24640 {
24643 }
24645 /* typedef. */
24647 {
24650 }
24655 /* Keep going until we hit the `;' at the end of the declaration. */
24657 {
24662 /* Parse the declarator. */
24666 /* Look for attributes that apply to the ivar. */
24668 /* Remember which attributes are prefix attributes and
24669 which are not. */
24671 /* Combine the attributes. */
24681 /* Reset PREFIX_ATTRIBUTES. */
24692 {
24695 }
24696 else
24698 }
24700 }
24702 /* Parse an Objective-C @property declaration. The syntax is:
24704 objc-property-declaration:
24705 '@property' objc-property-attributes[opt] struct-declaration ;
24707 objc-property-attributes:
24708 '(' objc-property-attribute-list ')'
24710 objc-property-attribute-list:
24711 objc-property-attribute
24712 objc-property-attribute-list, objc-property-attribute
24714 objc-property-attribute
24715 'getter' = identifier
24716 'setter' = identifier
24717 'readonly'
24718 'readwrite'
24719 'assign'
24720 'retain'
24721 'copy'
24722 'nonatomic'
24724 For example:
24725 @property NSString *name;
24726 @property (readonly) id object;
24727 @property (retain, nonatomic, getter=getTheName) id name;
24728 @property int a, b, c;
24730 PS: This function is identical to
24731 c_parser_objc_at_property_declaration for C. Keep them in sync. */
24732 static void
24734 {
24735 /* The following variables hold the attributes of the properties as
24736 parsed. They are 'false' or 'NULL_TREE' if the attribute was not
24737 seen. When we see an attribute, we set them to 'true' (if they
24738 are boolean properties) or to the identifier (if they have an
24739 argument, ie, for getter and setter). Note that here we only
24740 parse the list of attributes, check the syntax and accumulate the
24741 attributes that we find. objc_add_property_declaration() will
24742 then process the information. */
24752 /* 'properties' is the list of properties that we read. Usually a
24753 single one, but maybe more (eg, in "@property int a, b, c;" there
24754 are three). */
24755 tree properties;
24756 location_t loc;
24762 /* Parse the optional attribute list... */
24764 {
24765 /* Eat the '('. */
24769 {
24775 {
24778 }
24782 {
24793 {
24797 else
24802 }
24805 {
24809 }
24811 {
24813 {
24816 }
24817 else
24821 else
24823 }
24824 else
24825 {
24827 {
24830 }
24831 else
24833 }
24839 }
24846 else
24848 }
24850 /* FIXME: "@property (setter, assign);" will generate a spurious
24851 "error: expected ‘)’ before ‘,’ token". This is because
24852 cp_parser_require, unlike the C counterpart, will produce an
24853 error even if we are in error recovery. */
24855 {
24860 }
24861 }
24863 /* ... and the property declaration(s). */
24867 {
24869 /* If the next token is now a `;', consume it. */
24873 }
24877 else
24878 {
24879 /* Comma-separated properties are chained together in
24880 reverse order; add them one by one. */
24889 }
24892 }
24894 /* Parse an Objective-C++ @synthesize declaration. The syntax is:
24896 objc-synthesize-declaration:
24897 @synthesize objc-synthesize-identifier-list ;
24899 objc-synthesize-identifier-list:
24900 objc-synthesize-identifier
24901 objc-synthesize-identifier-list, objc-synthesize-identifier
24903 objc-synthesize-identifier
24904 identifier
24905 identifier = identifier
24907 For example:
24908 @synthesize MyProperty;
24909 @synthesize OneProperty, AnotherProperty=MyIvar, YetAnotherProperty;
24911 PS: This function is identical to c_parser_objc_at_synthesize_declaration
24912 for C. Keep them in sync.
24913 */
24914 static void
24916 {
24918 location_t loc;
24923 {
24927 {
24930 }
24932 {
24936 {
24939 }
24940 }
24941 else
24946 else
24948 }
24951 }
24953 /* Parse an Objective-C++ @dynamic declaration. The syntax is:
24955 objc-dynamic-declaration:
24956 @dynamic identifier-list ;
24958 For example:
24959 @dynamic MyProperty;
24960 @dynamic MyProperty, AnotherProperty;
24962 PS: This function is identical to c_parser_objc_at_dynamic_declaration
24963 for C. Keep them in sync.
24964 */
24965 static void
24967 {
24969 location_t loc;
24974 {
24975 tree property;
24978 {
24981 }
24985 else
24987 }
24990 }
24992 \f
24993 /* OpenMP 2.5 parsing routines. */
24995 /* Returns name of the next clause.
24996 If the clause is not recognized PRAGMA_OMP_CLAUSE_NONE is returned and
24997 the token is not consumed. Otherwise appropriate pragma_omp_clause is
24998 returned and the token is consumed. */
25000 static pragma_omp_clause
25002 {
25012 {
25017 {
25064 }
25065 }
25071 }
25073 /* Validate that a clause of the given type does not already exist. */
25075 static void
25078 {
25079 tree c;
25083 {
25086 }
25087 }
25089 /* OpenMP 2.5:
25090 variable-list:
25091 identifier
25092 variable-list , identifier
25094 In addition, we match a closing parenthesis. An opening parenthesis
25095 will have been consumed by the caller.
25097 If KIND is nonzero, create the appropriate node and install the decl
25098 in OMP_CLAUSE_DECL and add the node to the head of the list.
25100 If KIND is zero, create a TREE_LIST with the decl in TREE_PURPOSE;
25101 return the list created. */
25103 static tree
25105 tree list)
25106 {
25109 {
25126 {
25131 }
25132 else
25135 get_comma:
25139 }
25142 {
25145 /* Try to resync to an unnested comma. Copied from
25146 cp_parser_parenthesized_expression_list. */
25147 skip_comma:
25154 }
25157 }
25159 /* Similarly, but expect leading and trailing parenthesis. This is a very
25160 common case for omp clauses. */
25162 static tree
25164 {
25168 }
25170 /* OpenMP 3.0:
25171 collapse ( constant-expression ) */
25173 static tree
25175 {
25177 location_t loc;
25178 HOST_WIDE_INT n;
25198 {
25201 }
25209 }
25211 /* OpenMP 2.5:
25212 default ( shared | none ) */
25214 static tree
25216 {
25218 tree c;
25223 {
25228 {
25243 }
25246 }
25247 else
25248 {
25249 invalid_kind:
25251 }
25267 }
25269 /* OpenMP 3.1:
25270 final ( expression ) */
25272 static tree
25274 {
25295 }
25297 /* OpenMP 2.5:
25298 if ( expression ) */
25300 static tree
25302 {
25323 }
25325 /* OpenMP 3.1:
25326 mergeable */
25328 static tree
25331 {
25332 tree c;
25335 location);
25340 }
25342 /* OpenMP 2.5:
25343 nowait */
25345 static tree
25348 {
25349 tree c;
25356 }
25358 /* OpenMP 2.5:
25359 num_threads ( expression ) */
25361 static tree
25363 location_t location)
25364 {
25386 }
25388 /* OpenMP 2.5:
25389 ordered */
25391 static tree
25394 {
25395 tree c;
25403 }
25405 /* OpenMP 2.5:
25406 reduction ( reduction-operator : variable-list )
25408 reduction-operator:
25409 One of: + * - & ^ | && ||
25411 OpenMP 3.1:
25413 reduction-operator:
25414 One of: + * - & ^ | && || min max */
25416 static tree
25418 {
25426 {
25452 {
25457 {
25460 }
25462 {
25465 }
25466 }
25467 /* FALLTHROUGH */
25471 resync_fail:
25476 }
25487 }
25489 /* OpenMP 2.5:
25490 schedule ( schedule-kind )
25491 schedule ( schedule-kind , expression )
25493 schedule-kind:
25494 static | dynamic | guided | runtime | auto */
25496 static tree
25498 {
25507 {
25512 {
25533 }
25534 }
25539 else
25544 {
25559 else
25564 }
25572 invalid_kind:
25574 resync_fail:
25579 }
25581 /* OpenMP 3.0:
25582 untied */
25584 static tree
25587 {
25588 tree c;
25595 }
25597 /* Parse all OpenMP clauses. The set clauses allowed by the directive
25598 is a bitmask in MASK. Return the list of clauses found; the result
25599 of clause default goes in *pdefault. */
25601 static tree
25604 {
25610 {
25611 pragma_omp_clause c_kind;
25623 {
25635 clauses);
25649 clauses);
25658 clauses);
25682 clauses);
25696 clauses);
25707 }
25710 {
25711 /* Remove the invalid clause(s) from the list to avoid
25712 confusing the rest of the compiler. */
25715 }
25716 }
25717 saw_error:
25720 }
25722 /* OpenMP 2.5:
25723 structured-block:
25724 statement
25726 In practice, we're also interested in adding the statement to an
25727 outer node. So it is convenient if we work around the fact that
25728 cp_parser_statement calls add_stmt. */
25730 static unsigned
25732 {
25735 /* Only move the values to IN_OMP_BLOCK if they weren't false.
25736 This preserves the "not within loop or switch" style error messages
25737 for nonsense cases like
25738 void foo() {
25739 #pragma omp single
25740 break;
25741 }
25742 */
25747 }
25749 static void
25751 {
25753 }
25755 static tree
25757 {
25765 }
25767 /* OpenMP 2.5:
25768 # pragma omp atomic new-line
25769 expression-stmt
25771 expression-stmt:
25772 x binop= expr | x++ | ++x | x-- | --x
25773 binop:
25774 +, *, -, /, &, ^, |, <<, >>
25776 where x is an lvalue expression with scalar type.
25778 OpenMP 3.1:
25779 # pragma omp atomic new-line
25780 update-stmt
25782 # pragma omp atomic read new-line
25783 read-stmt
25785 # pragma omp atomic write new-line
25786 write-stmt
25788 # pragma omp atomic update new-line
25789 update-stmt
25791 # pragma omp atomic capture new-line
25792 capture-stmt
25794 # pragma omp atomic capture new-line
25795 capture-block
25797 read-stmt:
25798 v = x
25799 write-stmt:
25800 x = expr
25801 update-stmt:
25802 expression-stmt | x = x binop expr
25803 capture-stmt:
25804 v = x binop= expr | v = x++ | v = ++x | v = x-- | v = --x
25805 capture-block:
25806 { v = x; update-stmt; } | { update-stmt; v = x; }
25808 where x and v are lvalue expressions with scalar type. */
25810 static void
25812 {
25819 {
25831 else
25835 }
25839 {
25850 else
25856 {
25857 /* atomic write is represented by OMP_ATOMIC with NOP_EXPR
25858 opcode. */
25863 }
25867 {
25870 }
25871 else
25872 {
25879 }
25882 }
25884 restart:
25889 {
25896 /* FALLTHROUGH */
25906 /* FALLTHROUGH */
25921 /* Undo effects of boolean_increment for post {in,de}crement. */
25923 /* FALLTHRU */
25927 {
25928 /* Undo effects of boolean_increment. */
25930 {
25931 /* This is pre or post increment. */
25936 && !structured_block
25940 }
25941 }
25942 /* FALLTHRU */
25945 {
25975 {
25985 {
25988 {
25996 }
26031 }
26042 }
26043 /* FALLTHROUGH */
26048 }
26055 }
26056 stmt_done:
26058 {
26071 }
26073 {
26076 }
26077 done:
26083 saw_error:
26086 {
26090 {
26094 }
26095 }
26096 }
26099 /* OpenMP 2.5:
26100 # pragma omp barrier new-line */
26102 static void
26104 {
26107 }
26109 /* OpenMP 2.5:
26110 # pragma omp critical [(name)] new-line
26111 structured-block */
26113 static tree
26115 {
26119 {
26131 }
26136 }
26138 /* OpenMP 2.5:
26139 # pragma omp flush flush-vars[opt] new-line
26141 flush-vars:
26142 ( variable-list ) */
26144 static void
26146 {
26152 }
26154 /* Helper function, to parse omp for increment expression. */
26156 static tree
26158 {
26163 {
26166 }
26169 {
26177 }
26179 /* If decl is an iterator, preserve LHS and RHS of the relational
26180 expr until finish_omp_for. */
26190 }
26192 /* Helper function, to parse omp for increment expression. */
26194 static tree
26196 {
26200 cp_id_kind idk;
26204 {
26212 }
26220 {
26225 }
26232 {
26236 }
26248 do
26249 {
26256 {
26258 {
26261 else
26263 tf_warning_or_error);
26264 }
26265 else
26268 }
26269 }
26273 {
26277 }
26278 else
26282 }
26284 /* Parse the restricted form of the for statement allowed by OpenMP. */
26286 static tree
26288 {
26292 location_t loc_first;
26311 {
26314 location_t loc;
26317 {
26320 }
26329 {
26330 /* See 2.5.1 (in OpenMP 3.0, similar wording is in 2.5 standard too):
26332 init-expr:
26333 var = lb
26334 integer-type var = lb
26335 random-access-iterator-type var = lb
26336 pointer-type var = lb
26337 */
26338 cp_decl_specifier_seq type_specifiers;
26340 /* First, try to parse as an initialized declaration. See
26341 cp_parser_condition, from whence the bulk of this is copied. */
26348 {
26349 /* If parsing a type specifier seq succeeded, then this
26350 MUST be a initialized declaration. */
26355 CP_PARSER_DECLARATOR_NAMED,
26365 else
26366 {
26376 {
26378 CPP_OPEN_PAREN))
26381 else
26382 /* Trigger an error. */
26387 }
26391 {
26399 {
26402 auto_node);
26407 }
26410 asm_specification,
26411 LOOKUP_ONLYCONVERTING);
26413 {
26416 }
26417 else
26420 }
26421 else
26422 {
26423 /* Consume '='. */
26427 non_class:
26430 else
26433 asm_specification,
26434 LOOKUP_ONLYCONVERTING);
26435 }
26439 }
26440 }
26441 else
26442 {
26443 cp_id_kind idk;
26444 /* If parsing a type specifier sequence failed, then
26445 this MUST be a simple expression. */
26450 && decl
26453 {
26454 tree rhs;
26461 rhs,
26462 tf_warning_or_error));
26464 }
26465 else
26466 {
26471 {
26475 }
26476 }
26477 }
26478 }
26481 {
26484 {
26490 }
26491 else
26493 }
26498 {
26503 {
26507 }
26510 {
26511 /* Add lastprivate (decl) clause to OMP_FOR_CLAUSES,
26512 change it to shared (decl) in OMP_PARALLEL_CLAUSES. */
26521 }
26522 else
26523 {
26528 }
26529 }
26532 {
26533 tree c;
26535 {
26544 decl);
26548 decl);
26549 }
26551 {
26556 {
26559 }
26560 }
26561 }
26570 {
26571 /* If decl is an iterator, preserve the operator on decl
26572 until finish_omp_for. */
26574 && ((processing_template_decl
26578 else
26582 }
26597 /* FIXME: OpenMP 3.0 draft isn't very clear on what exactly is allowed
26598 in between the collapsed for loops to be still considered perfectly
26599 nested. Hopefully the final version clarifies this.
26600 For now handle (multiple) {'s and empty statements. */
26602 do
26603 {
26607 {
26609 bracecount++;
26610 }
26614 else
26615 {
26622 }
26623 }
26627 {
26630 }
26631 }
26633 /* Note that we saved the original contents of this flag when we entered
26634 the structured block, and so we don't need to re-save it here. */
26637 /* Note that the grammar doesn't call for a structured block here,
26638 though the loop as a whole is a structured block. */
26645 else
26650 {
26652 {
26654 nbraces--;
26655 }
26658 else
26659 {
26661 {
26664 }
26669 }
26670 }
26677 }
26679 /* OpenMP 2.5:
26680 #pragma omp for for-clause[optseq] new-line
26681 for-loop */
26683 #define OMP_FOR_CLAUSE_MASK \
26684 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26685 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26686 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
26687 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26688 | (1u << PRAGMA_OMP_CLAUSE_ORDERED) \
26689 | (1u << PRAGMA_OMP_CLAUSE_SCHEDULE) \
26690 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT) \
26691 | (1u << PRAGMA_OMP_CLAUSE_COLLAPSE))
26693 static tree
26695 {
26711 }
26713 /* OpenMP 2.5:
26714 # pragma omp master new-line
26715 structured-block */
26717 static tree
26719 {
26723 }
26725 /* OpenMP 2.5:
26726 # pragma omp ordered new-line
26727 structured-block */
26729 static tree
26731 {
26735 }
26737 /* OpenMP 2.5:
26739 section-scope:
26740 { section-sequence }
26742 section-sequence:
26743 section-directive[opt] structured-block
26744 section-sequence section-directive structured-block */
26746 static tree
26748 {
26759 {
26766 {
26776 }
26782 }
26785 {
26793 {
26797 }
26799 {
26802 }
26807 }
26818 }
26820 /* OpenMP 2.5:
26821 # pragma omp sections sections-clause[optseq] newline
26822 sections-scope */
26824 #define OMP_SECTIONS_CLAUSE_MASK \
26825 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26826 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26827 | (1u << PRAGMA_OMP_CLAUSE_LASTPRIVATE) \
26828 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26829 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
26831 static tree
26833 {
26844 }
26846 /* OpenMP 2.5:
26847 # pragma parallel parallel-clause new-line
26848 # pragma parallel for parallel-for-clause new-line
26849 # pragma parallel sections parallel-sections-clause new-line */
26851 #define OMP_PARALLEL_CLAUSE_MASK \
26852 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
26853 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26854 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26855 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
26856 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
26857 | (1u << PRAGMA_OMP_CLAUSE_COPYIN) \
26858 | (1u << PRAGMA_OMP_CLAUSE_REDUCTION) \
26859 | (1u << PRAGMA_OMP_CLAUSE_NUM_THREADS))
26861 static tree
26863 {
26872 {
26878 }
26880 {
26884 {
26890 }
26891 }
26898 {
26918 }
26925 }
26927 /* OpenMP 2.5:
26928 # pragma omp single single-clause[optseq] new-line
26929 structured-block */
26931 #define OMP_SINGLE_CLAUSE_MASK \
26932 ( (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26933 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26934 | (1u << PRAGMA_OMP_CLAUSE_COPYPRIVATE) \
26935 | (1u << PRAGMA_OMP_CLAUSE_NOWAIT))
26937 static tree
26939 {
26949 }
26951 /* OpenMP 3.0:
26952 # pragma omp task task-clause[optseq] new-line
26953 structured-block */
26955 #define OMP_TASK_CLAUSE_MASK \
26956 ( (1u << PRAGMA_OMP_CLAUSE_IF) \
26957 | (1u << PRAGMA_OMP_CLAUSE_UNTIED) \
26958 | (1u << PRAGMA_OMP_CLAUSE_DEFAULT) \
26959 | (1u << PRAGMA_OMP_CLAUSE_PRIVATE) \
26960 | (1u << PRAGMA_OMP_CLAUSE_FIRSTPRIVATE) \
26961 | (1u << PRAGMA_OMP_CLAUSE_SHARED) \
26962 | (1u << PRAGMA_OMP_CLAUSE_FINAL) \
26963 | (1u << PRAGMA_OMP_CLAUSE_MERGEABLE))
26965 static tree
26967 {
26978 }
26980 /* OpenMP 3.0:
26981 # pragma omp taskwait new-line */
26983 static void
26985 {
26988 }
26990 /* OpenMP 3.1:
26991 # pragma omp taskyield new-line */
26993 static void
26995 {
26998 }
27000 /* OpenMP 2.5:
27001 # pragma omp threadprivate (variable-list) */
27003 static void
27005 {
27006 tree vars;
27012 }
27014 /* Main entry point to OpenMP statement pragmas. */
27016 static void
27018 {
27019 tree stmt;
27022 {
27052 }
27056 }
27057 \f
27058 /* Transactional Memory parsing routines. */
27060 /* Parse a transaction attribute.
27062 txn-attribute:
27063 attribute
27064 [ [ identifier ] ]
27066 ??? Simplify this when C++0x bracket attributes are
27067 implemented properly. */
27069 static tree
27071 {
27086 {
27090 /* For keywords, use the canonical spelling,
27091 not the parsed identifier. */
27095 }
27096 else
27100 error1:
27103 }
27105 /* Parse a __transaction_atomic or __transaction_relaxed statement.
27107 transaction-statement:
27108 __transaction_atomic txn-attribute[opt] txn-noexcept-spec[opt]
27109 compound-statement
27110 __transaction_relaxed txn-noexcept-spec[opt] compound-statement
27111 */
27113 static tree
27115 {
27130 else
27131 {
27135 }
27137 /* Parse a noexcept specification. */
27140 /* Keep track if we're in the lexical scope of an outer transaction. */
27152 }
27154 /* Parse a __transaction_atomic or __transaction_relaxed expression.
27156 transaction-expression:
27157 __transaction_atomic txn-noexcept-spec[opt] ( expression )
27158 __transaction_relaxed txn-noexcept-spec[opt] ( expression )
27159 */
27161 static tree
27163 {
27188 /* Set this early. This might mean that we allow transaction_cancel in
27189 an expression that we find out later actually has to be a constexpr.
27190 However, we expect that cxx_constant_value will be able to deal with
27191 this; also, if the noexcept has no constexpr, then what we parse next
27192 really is a transaction's body. */
27195 /* Parse a noexcept specification. */
27201 {
27208 }
27209 else
27210 {
27211 /* The only expression that is available got parsed for the noexcept
27212 already. noexcept is true then. */
27215 }
27224 }
27226 /* Parse a function-transaction-block.
27228 function-transaction-block:
27229 __transaction_atomic txn-attribute[opt] ctor-initializer[opt]
27230 function-body
27231 __transaction_atomic txn-attribute[opt] function-try-block
27232 __transaction_relaxed ctor-initializer[opt] function-body
27233 __transaction_relaxed function-try-block
27234 */
27236 static bool
27238 {
27254 else
27255 {
27259 }
27267 else
27268 ctor_initializer_p = cp_parser_ctor_initializer_opt_and_function_body
27276 }
27278 /* Parse a __transaction_cancel statement.
27280 cancel-statement:
27281 __transaction_cancel txn-attribute[opt] ;
27282 __transaction_cancel txn-attribute[opt] throw-expression ;
27284 ??? Cancel and throw is not yet implemented. */
27286 static tree
27288 {
27294 RT_TRANSACTION_CANCEL);
27301 /* ??? Parse cancel-and-throw here. */
27306 {
27310 }
27312 {
27316 }
27318 {
27321 {
27327 }
27328 }
27330 {
27334 }
27341 }
27342 \f
27343 /* The parser. */
27347 \f
27348 /* Special handling for the first token or line in the file. The first
27349 thing in the file might be #pragma GCC pch_preprocess, which loads a
27350 PCH file, which is a GC collection point. So we need to handle this
27351 first pragma without benefit of an existing lexer structure.
27353 Always returns one token to the caller in *FIRST_TOKEN. This is
27354 either the true first token of the file, or the first token after
27355 the initial pragma. */
27357 static void
27359 {
27368 {
27375 }
27376 else
27379 /* Skip to the end of the pragma. */
27383 /* Now actually load the PCH file. */
27387 /* Read one more token to return to our caller. We have to do this
27388 after reading the PCH file in, since its pointers have to be
27389 live. */
27391 }
27393 /* Normal parsing of a pragma token. Here we can (and must) use the
27394 regular lexer. */
27396 static bool
27398 {
27408 {
27416 {
27426 }
27431 {
27441 }
27446 {
27452 "%<#pragma omp taskwait%> may only be "
27457 }
27462 {
27468 "%<#pragma omp taskyield%> may only be "
27473 }
27496 "%<#pragma omp section%> may only be used in "
27505 bad_stmt:
27508 }
27512 }
27514 /* The interface the pragma parsers have to the lexer. */
27516 enum cpp_ttype
27518 {
27531 else
27532 {
27536 }
27539 }
27541 \f
27542 /* External interface. */
27544 /* Parse one entire translation unit. */
27546 void
27548 {
27552 {
27555 }
27563 }